@niscorp/vex 0.2.2 → 0.3.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +172 -0
- package/DESIGN.md +66 -3
- package/DOCS.md +156 -12
- package/dist/adapters/express/index.cjs +102 -17
- package/dist/adapters/express/index.cjs.map +1 -1
- package/dist/adapters/express/index.d.cts +2 -2
- package/dist/adapters/express/index.d.ts +2 -2
- package/dist/adapters/express/index.js +2 -2
- package/dist/adapters/hono/index.cjs +121 -22
- package/dist/adapters/hono/index.cjs.map +1 -1
- package/dist/adapters/hono/index.d.cts +2 -2
- package/dist/adapters/hono/index.d.ts +2 -2
- package/dist/adapters/hono/index.js +21 -7
- package/dist/adapters/hono/index.js.map +1 -1
- package/dist/agent/index.cjs +2 -0
- package/dist/agent/index.cjs.map +1 -1
- package/dist/agent/index.d.cts +1 -1
- package/dist/agent/index.d.ts +1 -1
- package/dist/agent/index.js +1 -1
- package/dist/{chunk-HF25Q53I.js → chunk-H4BHW76Q.js} +6 -3
- package/dist/chunk-H4BHW76Q.js.map +1 -0
- package/dist/{chunk-HCEH55PP.js → chunk-IQM4SQE2.js} +123 -21
- package/dist/chunk-IQM4SQE2.js.map +1 -0
- package/dist/{handler-Cql8SJ3F.d.cts → handler-BGCL6_Si.d.ts} +3 -2
- package/dist/{handler-mICf9ins.d.ts → handler-CMrjTXNx.d.cts} +3 -2
- package/dist/index.cjs +163 -35
- package/dist/index.cjs.map +1 -1
- package/dist/index.d.cts +3 -3
- package/dist/index.d.ts +3 -3
- package/dist/index.js +44 -22
- package/dist/index.js.map +1 -1
- package/dist/{types-BRvMB6IM.d.cts → types-Bi-Lg86b.d.cts} +48 -2
- package/dist/{types-BRvMB6IM.d.ts → types-Bi-Lg86b.d.ts} +48 -2
- package/package.json +5 -5
- package/dist/chunk-HCEH55PP.js.map +0 -1
- package/dist/chunk-HF25Q53I.js.map +0 -1
package/dist/index.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["../src/scope/discover.ts","../src/scope/grants.ts","../src/engine/resolver.ts","../src/engine/analyzer.ts","../src/cache/memory.ts","../src/engine/live.ts","../src/engine/runtime.ts","../src/adapters/postgres/introspect.ts","../src/adapters/postgres/compile.ts","../src/adapters/postgres/statement-timeout.ts","../src/adapters/postgres/postgres.adapter.ts","../src/guide.ts","../src/cache/cache.types.ts","../src/cache/validate.ts","../src/cache/postgres.ts","../src/cache/tiered.ts","../src/cache/seed.ts"],"names":["follow","compile","executePrism","execute","rows","executionMs","result","exceedsDepth","depthRefusal","quoteIdent","keys","current"],"mappings":";;;;;;;;;;AAYO,IAAM,qBAAA,GAAwB,CAAC,IAAA,KAAqC;AACzE,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAC5B,EAAA,OAAO,KAAA,CAAM,MAAA,KAAW,CAAA,GAAI,KAAA,CAAM,CAAC,CAAA,GAAI,MAAA;AACzC,CAAA;AAOA,IAAM,uBAAA,GAA0B,CAAC,GAAA,EAAmB,GAAA,KAA2B;AAC7E,EAAA,IAAI,gBAAA,CAAiB,GAAG,CAAA,EAAG;AACzB,IAAA,MAAM,MAAA,GAAS,sBAAsB,GAAG,CAAA;AACxC,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AAAA,EAC1C;AAEF,CAAA;AAMA,IAAM,iBAAA,GAAoB,CAAC,MAAA,EAAgB,GAAA,KAA2B;AAGpE,EAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,IAAA,KAAA,MAAW,UAAU,MAAA,CAAO,MAAA,CAAO,IAAA,EAAM,GAAA,CAAI,IAAI,MAAM,CAAA;AACvD,IAAA,IAAI,MAAA,CAAO,OAAO,MAAA,KAAW,MAAA,oBAA6B,MAAA,CAAO,MAAA,CAAO,QAAQ,GAAG,CAAA;AACnF,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,IAAA,IAAQ,MAAA,IAAU,KAAA,IAAS,MAAA,IAAU,IAAA,IAAQ,MAAA,IAAU,KAAA,IAAS,MAAA,IAAU,IAAA,IAAQ,MAAA,IAAU,KAAA,IAAS,MAAA,EAAQ;AAC/G,IAAA,MAAM,IAAA,GAAQ,QAAQ,MAAA,GAAU,MAAA,CAAO,KAClC,KAAA,IAAS,MAAA,GAAU,OAAO,GAAA,GAC1B,IAAA,IAAQ,SAAU,MAAA,CAAO,EAAA,GACzB,SAAS,MAAA,GAAU,MAAA,CAAO,MAC1B,IAAA,IAAQ,MAAA,GAAU,MAAA,CAAO,EAAA,GAC1B,MAAA,CAAO,GAAA;AACX,IAAA,uBAAA,CAAwB,IAAA,CAAK,CAAC,CAAA,EAAG,GAAG,CAAA;AACpC,IAAA,uBAAA,CAAwB,IAAA,CAAK,CAAC,CAAA,EAAG,GAAG,CAAA;AACpC,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,IAAA,IAAQ,MAAA,IAAU,OAAA,IAAW,MAAA,EAAQ;AACvC,IAAA,MAAM,KAAA,GAAQ,IAAA,IAAQ,MAAA,GAAS,MAAA,CAAO,KAAK,MAAA,CAAO,KAAA;AAClD,IAAA,MAAM,MAAA,GAAS,qBAAA,CAAsB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AACxC,IAAA,MAAM,MAAA,GAAS,MAAM,CAAC,CAAA;AACtB,IAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,EAAG;AACzB,MAAA,KAAA,MAAW,KAAK,MAAA,EAAQ;AACtB,QAAA,uBAAA,CAAwB,GAAG,GAAG,CAAA;AAAA,MAChC;AAAA,IACF;AAEA,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,MAAA,IAAU,MAAA,IAAU,OAAA,IAAW,MAAA,EAAQ;AACzC,IAAA,MAAM,KAAA,GAAQ,MAAA,IAAU,MAAA,GAAS,MAAA,CAAO,OAAO,MAAA,CAAO,KAAA;AACtD,IAAA,MAAM,MAAA,GAAS,qBAAA,CAAsB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AACxC,IAAA,uBAAA,CAAwB,KAAA,CAAM,CAAC,CAAA,EAAG,GAAG,CAAA;AACrC,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,IAAA,MAAM,MAAA,GAAS,qBAAA,CAAsB,MAAA,CAAO,MAAM,CAAA;AAClD,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AACxC,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,eAAe,MAAA,EAAQ;AACzB,IAAA,MAAM,MAAA,GAAS,qBAAA,CAAsB,MAAA,CAAO,SAAS,CAAA;AACrD,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AACxC,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,KAAA,MAAW,GAAA,IAAO,OAAO,GAAA,EAAK;AAC5B,MAAA,iBAAA,CAAkB,KAAK,GAAG,CAAA;AAAA,IAC5B;AACA,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,QAAQ,MAAA,EAAQ;AAClB,IAAA,KAAA,MAAW,GAAA,IAAO,OAAO,EAAA,EAAI;AAC3B,MAAA,iBAAA,CAAkB,KAAK,GAAG,CAAA;AAAA,IAC5B;AACA,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,iBAAA,CAAkB,MAAA,CAAO,KAAK,GAAG,CAAA;AACjC,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,cAAc,MAAA,EAAQ;AACxB,IAAA,MAAM,MAAA,GAAS,qBAAA,CAAsB,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA;AAC1D,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AACxC,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,WAAW,MAAA,EAAQ;AACrB,IAAA,MAAM,MAAA,GAAS,qBAAA,CAAsB,MAAA,CAAO,KAAA,CAAM,KAAK,CAAA;AACvD,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AACxC,IAAA;AAAA,EACF;AAQA,EAAA,IAAI,UAAA,IAAc,MAAA,EAAQ,cAAA,CAAe,iBAAiB,CAAA;AAC5D,CAAA;AAMA,IAAM,kBAAA,GAAqB,CAAC,IAAA,EAAyB,GAAA,KAA2B;AAC9E,EAAA,IAAI,SAAS,IAAA,IAAQ,UAAA,IAAc,QAAQ,UAAA,IAAc,IAAA,IAAQ,YAAY,IAAA,EAAM;AACjF,IAAA,MAAM,IAAA,GAAQ,KAAA,IAAS,IAAA,GAAQ,IAAA,CAAK,GAAA,GAC/B,UAAA,IAAc,IAAA,GAAQ,IAAA,CAAK,QAAA,GAC3B,UAAA,IAAc,IAAA,GAAQ,IAAA,CAAK,WAC5B,IAAA,CAAK,MAAA;AACT,IAAA,uBAAA,CAAwB,IAAA,CAAK,CAAC,CAAA,EAAG,GAAG,CAAA;AACpC,IAAA,uBAAA,CAAwB,IAAA,CAAK,CAAC,CAAA,EAAG,GAAG,CAAA;AACpC,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,YAAY,IAAA,EAAM;AACpB,IAAA,KAAA,MAAW,CAAA,IAAK,KAAK,MAAA,EAAQ;AAC3B,MAAA,uBAAA,CAAwB,GAAG,GAAG,CAAA;AAAA,IAChC;AACA,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,cAAc,IAAA,EAAM;AACtB,IAAA,KAAA,MAAW,CAAA,IAAK,KAAK,QAAA,EAAU;AAC7B,MAAA,uBAAA,CAAwB,GAAG,GAAG,CAAA;AAAA,IAChC;AACA,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,UAAU,IAAA,EAAM;AAClB,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,IAAA,CAAK,IAAA,EAAM;AACjC,MAAA,iBAAA,CAAkB,IAAA,CAAK,WAAW,GAAG,CAAA;AACrC,MAAA,uBAAA,CAAwB,IAAA,CAAK,MAAM,GAAG,CAAA;AAAA,IACxC;AACA,IAAA,uBAAA,CAAwB,IAAA,CAAK,IAAA,CAAK,IAAA,EAAM,GAAG,CAAA;AAC3C,IAAA;AAAA,EACF;AACF,CAAA;AAMA,IAAM,oBAAA,GAAuB,CAAC,IAAA,EAA2B,GAAA,KAA2B;AAClF,EAAA,MAAM,GAAA,GAAO,WAAW,IAAA,GAAQ,IAAA,CAAK,QAChC,eAAA,IAAmB,IAAA,GAAQ,KAAK,aAAA,GAChC,KAAA,IAAS,OAAQ,IAAA,CAAK,GAAA,GACtB,SAAS,IAAA,GAAQ,IAAA,CAAK,MACtB,KAAA,IAAS,IAAA,GAAQ,IAAA,CAAK,GAAA,GACvB,IAAA,CAAK,GAAA;AAET,EAAA,IAAI,OAAO,QAAQ,QAAA,EAAU;AAC3B,IAAA,kBAAA,CAAmB,KAAK,GAAG,CAAA;AAC3B,IAAA;AAAA,EACF;AACA,EAAA,MAAM,MAAA,GAAS,sBAAsB,GAAG,CAAA;AACxC,EAAA,IAAI,MAAA,KAAW,MAAA,EAAW,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AAC1C,CAAA;AAMA,IAAM,gBAAA,GAAmB,CAAC,GAAA,EAAY,GAAA,KAA2B;AAM/D,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAG9B,EAAA,KAAA,MAAW,MAAA,IAAU,IAAI,IAAA,EAAM;AAC7B,IAAA,IAAI,OAAO,WAAW,QAAA,EAAU;AAC9B,MAAA,GAAA,CAAI,IAAI,MAAM,CAAA;AAAA,IAChB,CAAA,MAAO;AACL,MAAA,OAAA,CAAQ,GAAA,CAAI,OAAO,EAAE,CAAA;AACrB,MAAA,gBAAA,CAAiB,MAAA,CAAO,OAAO,GAAG,CAAA;AAAA,IACpC;AAAA,EACF;AAGA,EAAA,KAAA,MAAW,GAAA,IAAO,GAAA,CAAI,MAAA,IAAU,EAAC,EAAG;AAClC,IAAA,MAAM,SAAS,qBAAA,CAAsB,OAAO,QAAQ,QAAA,GAAW,GAAA,GAAM,IAAI,KAAK,CAAA;AAC9E,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AAAA,EAC5C;AAGA,EAAA,IAAI,GAAA,CAAI,WAAW,MAAA,EAAW;AAC5B,IAAA,iBAAA,CAAkB,GAAA,CAAI,QAAQ,KAAK,CAAA;AAAA,EACrC;AAGA,EAAA,IAAI,GAAA,CAAI,YAAY,MAAA,EAAW;AAC7B,IAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,IAAA,CAAK,GAAA,CAAI,OAAO,CAAA,EAAG;AAC1C,MAAA,MAAM,IAAA,GAAO,GAAA,CAAI,OAAA,CAAQ,GAAG,CAAA;AAC5B,MAAA,IAAI,SAAS,MAAA,EAAW;AACtB,QAAA,kBAAA,CAAmB,MAAM,KAAK,CAAA;AAAA,MAChC;AAAA,IACF;AAAA,EACF;AAGA,EAAA,IAAI,GAAA,CAAI,cAAc,MAAA,EAAW;AAC/B,IAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,IAAA,CAAK,GAAA,CAAI,SAAS,CAAA,EAAG;AAC5C,MAAA,MAAM,IAAA,GAAO,GAAA,CAAI,SAAA,CAAU,GAAG,CAAA;AAC9B,MAAA,IAAI,SAAS,MAAA,EAAW;AACtB,QAAA,oBAAA,CAAqB,MAAM,KAAK,CAAA;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AAGA,EAAA,IAAI,GAAA,CAAI,YAAY,MAAA,EAAW;AAC7B,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAI,OAAA,EAAS;AAC9B,MAAA,MAAM,MAAA,GAAS,sBAAsB,IAAI,CAAA;AACzC,MAAA,IAAI,MAAA,KAAW,MAAA,EAAW,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AAAA,IAC5C;AAAA,EACF;AAGA,EAAA,IAAI,GAAA,CAAI,SAAS,MAAA,EAAW;AAC1B,IAAA,KAAA,MAAW,KAAA,IAAS,IAAI,IAAA,EAAM;AAC5B,MAAA,MAAM,MAAA,GAAS,qBAAA,CAAsB,KAAA,CAAM,KAAK,CAAA;AAChD,MAAA,IAAI,MAAA,KAAW,MAAA,EAAW,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AAAA,IAC5C;AAAA,EACF;AAEA,EAAA,KAAA,MAAW,UAAU,KAAA,EAAO;AAC1B,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAA,EAAG,GAAA,CAAI,IAAI,MAAM,CAAA;AAAA,EAC1C;AACF,CAAA;AAEO,IAAM,gBAAA,GAAmB,CAAC,GAAA,KAA4B;AAC3D,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAY;AACjC,EAAA,gBAAA,CAAiB,KAAK,QAAQ,CAAA;AAC9B,EAAA,OAAO,QAAA;AACT;;;ACvPO,IAAM,WAAA,GAAc,CAAC,MAAA,EAAQ,cAAA,EAAgB,gBAAgB,cAAc;AAK3E,IAAM,cAAc,CAAC,MAAA,KAC1B,MAAA,CAAO,OAAA,CAAQ,CAAC,CAAA,KAAM,WAAA,CAAY,GAAA,CAAI,CAAC,MAAM,CAAA,EAAG,CAAC,CAAA,CAAA,EAAI,CAAC,EAAE,CAAC;AAgC3D,IAAM,YAAY,CAAC,MAAA,EAAQ,OAAA,EAAS,QAAA,EAAU,UAAU,QAAQ,CAAA;AAEhE,IAAM,SAAA,GAAY,CAAC,KAAA,KACjB,SAAA,CAAU,KAAK,CAAC,CAAA,KAAM,KAAK,KAAK,CAAA;AAWlC,IAAM,WAAA,GAAc,CAAC,SAAA,EAA2B,KAAA,EAAe,OAAA,KAAwD;AACrH,EAAA,MAAM,KAAA,GAAQ,UAAU,KAAK,CAAA;AAC7B,EAAA,IAAI,KAAA,KAAU,MAAA,EAAW,OAAO,EAAC;AACjC,EAAA,IAAI,SAAA,CAAU,KAAK,CAAA,EAAG,OAAO,KAAA;AAE7B,EAAA,OAAA,CAAQ,YAAY,MAAA,GAAY,MAAA,GAAY,MAAM,OAAO,CAAA,KAAM,MAAM,SAAS,CAAA;AAChF,CAAA;AAEA,IAAM,WAAA,GAAc,CAAC,KAAA,KAAqC,KAAA,CAAM,OAAO,CAAC,CAAA,KAAuB,WAAW,CAAC,CAAA;AAQ3G,IAAM,KAAA,GAA6B,IAAI,GAAA,CAAI,WAAW,CAAA;AAgBtD,IAAM,UAAA,GAAa,CAAC,KAAA,KAAA,CACjB,SAAA,CAAU,KAAK,CAAA,GAAI,CAAC,KAAK,CAAA,GAAI,MAAA,CAAO,MAAA,CAAO,KAAK,CAAA,EAAG,OAAA;AAAA,EAAQ,CAAC,UAC3D,SAAA,CAAU,OAAA;AAAA,IAAQ,CAAC,KAAA,KAAA,CAChB,KAAA,CAAM,KAAK,CAAA,IAAK,EAAC,EAAG,GAAA;AAAA,MAAI,CAAC,IAAA,KACxB,KAAA,IAAS,IAAA,GAAO,EAAE,KAAA,EAAO,IAAA,CAAK,GAAA,EAAK,GAAA,EAAK,IAAA,CAAK,EAAA,EAAG,GAAI,UAAA,CAAW,IAAI,CAAA,GAAI,EAAE,KAAA,EAAO,IAAA,CAAK,KAAA,EAAO,GAAA,EAAK,IAAA,CAAK,EAAA,EAAG,GAAI,EAAE,KAAA,EAAO,IAAA,CAAK,KAAA,EAAO,GAAA,EAAK,KAAK,EAAA;AAAG;AACjJ;AAEJ,CAAA;AAMK,IAAM,aAAA,GAAgB,CAAC,SAAA,EAA2B,MAAA,EAA2B,KAAA,KAAuC;AACzH,EAAA,MAAM,IAAA,uBAAW,GAAA,EAA0B;AAC3C,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,IAAA,MAAM,KAAA,GAAQ,UAAU,KAAK,CAAA;AAC7B,IAAA,IAAI,UAAU,MAAA,EAAW;AACzB,IAAA,KAAA,MAAW,EAAE,KAAA,EAAO,GAAA,EAAI,IAAK,UAAA,CAAW,KAAK,CAAA,EAAG;AAC9C,MAAA,IAAI,MAAM,GAAG,CAAA,KAAM,UAAa,KAAA,CAAM,GAAG,MAAM,IAAA,EAAM;AACrD,MAAA,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,KAAK,CAAA,CAAA,EAAI,GAAG,CAAA,CAAA,EAAI,EAAE,MAAA,EAAQ,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA;AAAA,IACpE;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,IAAA,CAAK,MAAA,EAAQ,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,EAAG,CAAA,CAAE,MAAM,CAAA,CAAA,EAAI,CAAA,CAAE,KAAK,CAAA,CAAA,EAAI,CAAA,CAAE,GAAG,CAAA,CAAA,CAAG,aAAA,CAAc,GAAG,CAAA,CAAE,MAAM,CAAA,CAAA,EAAI,CAAA,CAAE,KAAK,CAAA,CAAA,EAAI,CAAA,CAAE,GAAG,EAAE,CAAC,CAAA;AAC7H;AAGO,IAAM,eAAA,GAAkB,CAAC,SAAA,KAC9B,MAAA,CAAO,OAAA,CAAQ,SAAS,CAAA,CAAE,OAAA,CAAQ,CAAC,CAAC,KAAA,EAAO,KAAK,CAAA,KAAM,WAAW,KAAK,CAAA,CAAE,GAAA,CAAI,CAAC,EAAE,KAAA,EAAM,MAAO,EAAE,MAAA,EAAQ,KAAA,EAAO,KAAA,EAAM,CAAE,CAAC,CAAA;AAGjH,IAAM,aAAA,GAAgB,CAAC,SAAA,KAAmD;AAC/E,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,EAAA,KAAA,MAAW,KAAA,IAAS,MAAA,CAAO,MAAA,CAAO,SAAS,CAAA,EAAG;AAC5C,IAAA,IAAI,SAAA,CAAU,KAAK,CAAA,EAAG;AACtB,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,MAAO,IAAA,KAAS,SAAA,EAAW,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA;AAAA,EAC/E;AACA,EAAA,OAAO,KAAA;AACT;AAQO,IAAM,oBAAoB,CAC/B,MAAA,EACA,SAAA,GAA4B,IAC5B,OAAA,KACgB;AAChB,EAAA,IAAI,OAAA,KAAY,MAAA,IAAa,CAAC,aAAA,CAAc,SAAS,CAAA,CAAE,GAAA,CAAI,OAAO,CAAA,SAAU,EAAE,OAAA,EAAS,MAAA,EAAQ,QAAA,EAAU,EAAC,EAAE;AAC5G,EAAA,MAAM,WAAuH,EAAC;AAC9H,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,IAAA,MAAM,GAAA,GAAM,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA;AAC7B,IAAA,IAAI,MAAM,CAAA,EAAG;AACb,IAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,KAAA,CAAM,CAAA,EAAG,GAAG,CAAA;AAChC,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,KAAA,CAAM,GAAA,GAAM,CAAC,CAAA;AAChC,IAAA,IAAI,CAAC,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA,EAAG;AACtB,IAAA,MAAM,CAAA,GAAI,WAAA,CAAY,SAAA,EAAW,KAAA,EAAO,OAAO,CAAA;AAC/C,IAAA,IAAI,MAAM,MAAA,EAAW;AACrB,IAAA,MAAM,IAAA,GAAQ,QAAA,CAAS,KAAK,CAAA,KAAM,EAAC;AACnC,IAAA,IAAI,SAAS,MAAA,EAAQ,IAAA,CAAK,IAAA,GAAO,CAAA,EAAG,QAAQ,EAAC;AAAA,SAAA,IACpC,IAAA,KAAS,cAAA,EAAgB,IAAA,CAAK,MAAA,GAAS,CAAC,GAAI,CAAA,EAAG,KAAA,IAAS,EAAC,EAAI,GAAI,CAAA,EAAG,MAAA,IAAU,EAAG,CAAA;AAAA,SAAA,IACjF,IAAA,KAAS,cAAA,EAAgB,IAAA,CAAK,MAAA,GAAS,CAAC,GAAI,CAAA,EAAG,KAAA,IAAS,EAAC,EAAI,GAAI,CAAA,EAAG,MAAA,IAAU,EAAG,CAAA;AAAA,SAAA,IACjF,SAAS,cAAA,EAAgB,IAAA,CAAK,MAAA,GAAS,CAAC,GAAG,WAAA,CAAY,CAAA,EAAG,KAAA,IAAS,EAAE,CAAA,EAAG,GAAI,CAAA,EAAG,MAAA,IAAU,EAAG,CAAA;AAAA,EACvG;AACA,EAAA,OAAO,EAAE,OAAA,EAAS,MAAA,EAAQ,QAAA,EAAS;AACrC;AAwBA,IAAM,UAAA,GAAa,CAAC,KAAA,KAAA,CACjB,KAAA,IAAS,EAAC,EAAG,MAAA,CAAO,CAAC,CAAA,KAAM,OAAA,IAAW,CAAC,CAAA,CAAE,MAAA;AAGrC,IAAM,kBAAA,GAAqB,CAAC,QAAA,KAAkD;AACnF,EAAA,MAAM,WAAuH,EAAC;AAC9H,EAAA,KAAA,MAAW,UAAU,QAAA,EAAU;AAC7B,IAAA,KAAA,MAAW,CAAC,OAAO,IAAI,CAAA,IAAK,OAAO,OAAA,CAAQ,MAAA,CAAO,QAAQ,CAAA,EAAG;AAC3D,MAAA,IAAI,IAAA,KAAS,MAAA,IAAa,QAAA,IAAY,IAAA,IAAQ,UAAU,IAAA,EAAM;AAC9D,MAAA,MAAM,IAAA,GAAQ,QAAA,CAAS,KAAK,CAAA,KAAM,EAAC;AACnC,MAAA,KAAA,MAAW,SAAS,CAAC,MAAA,EAAQ,QAAA,EAAU,QAAA,EAAU,QAAQ,CAAA,EAAY;AACnE,QAAA,MAAM,QAAA,GAAW,KAAK,KAAK,CAAA;AAC3B,QAAA,IAAI,aAAa,MAAA,EAAW;AAC5B,QAAA,MAAM,IAAA,GAAO,KAAK,KAAK,CAAA;AAGvB,QAAA,IAAI,SAAS,MAAA,IAAa,UAAA,CAAW,QAAQ,CAAA,GAAI,UAAA,CAAW,IAAI,CAAA,EAAG;AACjE,UAAC,IAAA,CAAiC,KAAK,CAAA,GAAI,QAAA;AAAA,QAC7C;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,EAAE,OAAA,EAAS,MAAA,EAAQ,QAAA,EAAS;AACrC;;;ACpMA,IAAM,WAAA,GAAc,CAAC,CAAA,EAAW,CAAA,KAAsB;AACpD,EAAA,MAAM,KAAK,CAAA,CAAE,MAAA;AACb,EAAA,MAAM,KAAK,CAAA,CAAE,MAAA;AACb,EAAA,IAAI,EAAA,KAAO,GAAG,OAAO,EAAA;AACrB,EAAA,IAAI,EAAA,KAAO,GAAG,OAAO,EAAA;AAGrB,EAAA,IAAI,IAAA,GAAO,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,EAAA,GAAK,CAAA,EAAE,EAAG,CAAC,CAAA,EAAG,CAAA,KAAM,CAAC,CAAA;AACrD,EAAA,IAAI,IAAA,GAAO,IAAI,KAAA,CAAc,EAAA,GAAK,CAAC,CAAA;AAEnC,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,IAAK,EAAA,EAAI,CAAA,EAAA,EAAK;AAC5B,IAAA,IAAA,CAAK,CAAC,CAAA,GAAI,CAAA;AACV,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,IAAK,EAAA,EAAI,CAAA,EAAA,EAAK;AAC5B,MAAA,MAAM,IAAA,GAAO,EAAE,CAAA,GAAI,CAAC,MAAM,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA,GAAI,CAAA;AACzC,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,CAAC,CAAA,IAAK,CAAA;AACzB,MAAA,MAAM,MAAA,GAAS,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,IAAK,CAAA;AAC9B,MAAA,MAAM,MAAA,GAAS,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,IAAK,CAAA;AAC9B,MAAA,IAAA,CAAK,CAAC,IAAI,IAAA,CAAK,GAAA,CAAI,QAAQ,CAAA,EAAG,MAAA,GAAS,CAAA,EAAG,MAAA,GAAS,IAAI,CAAA;AAAA,IACzD;AACA,IAAA,CAAC,IAAA,EAAM,IAAI,CAAA,GAAI,CAAC,MAAM,IAAI,CAAA;AAAA,EAC5B;AAEA,EAAA,OAAO,IAAA,CAAK,EAAE,CAAA,IAAK,CAAA;AACrB,CAAA;AAEA,IAAM,WAAA,GAAc,CAAC,MAAA,EAAgB,UAAA,KAA6C;AAChF,EAAA,IAAI,IAAA;AACJ,EAAA,IAAI,QAAA,GAAW,QAAA;AACf,EAAA,KAAA,MAAW,KAAK,UAAA,EAAY;AAC1B,IAAA,MAAM,OAAO,WAAA,CAAY,MAAA,CAAO,aAAY,EAAG,CAAA,CAAE,aAAa,CAAA;AAC9D,IAAA,IAAI,OAAO,QAAA,EAAU;AACnB,MAAA,QAAA,GAAW,IAAA;AACX,MAAA,IAAA,GAAO,CAAA;AAAA,IACT;AAAA,EACF;AAEA,EAAA,IAAI,QAAA,IAAY,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,KAAK,MAAA,CAAO,MAAA,GAAS,CAAC,CAAC,CAAA,EAAG;AACzD,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,OAAO,MAAA;AACT,CAAA;AAQA,IAAM,aAAA,GAAgB,CAAC,IAAA,EAAc,OAAA,KAAkC;AACrE,EAAA,MAAM,MAAA,GAAS,IAAA,CAAK,MAAA,CAAO,CAAC,EAAE,WAAA,EAAY;AAC1C,EAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAA,IAAK,CAAA;AACvC,EAAA,MAAM,OAAO,OAAA,GAAU,CAAA;AACvB,EAAA,OAAA,CAAQ,GAAA,CAAI,QAAQ,IAAI,CAAA;AACxB,EAAA,OAAO,CAAA,EAAG,MAAM,CAAA,EAAG,IAAI,CAAA,CAAA;AACzB,CAAA;AAMA,IAAM,UAAA,GAAa,CAAC,IAAA,EAAc,MAAA,KAAyC;AACzE,EAAA,MAAM,KAAA,GAAQ,OAAO,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,IAAI,CAAA;AACzD,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,KAAA;AAEhC,EAAA,MAAM,WAAW,MAAA,CAAO,QAAA,CAAS,IAAI,CAAC,CAAA,KAAM,EAAE,IAAI,CAAA;AAClD,EAAA,MAAM,UAAA,GAAa,WAAA,CAAY,IAAA,EAAM,QAAQ,CAAA;AAC7C,EAAA,MAAM,IAAA,GAAO,UAAA,KAAe,MAAA,GAAY,CAAA,eAAA,EAAkB,UAAU,CAAA,EAAA,CAAA,GAAO,EAAA;AAC3E,EAAA,MAAM,IAAI,QAAA;AAAA,IACR,aAAA;AAAA,IACA,CAAA,QAAA,EAAW,IAAI,CAAA,sBAAA,EAAyB,IAAI,CAAA,CAAA;AAAA,IAC5C,EAAE,UAAA,EAAY,OAAA,EAAS,QAAA;AAAS,GAClC;AACF,CAAA;AAEA,IAAM,SAAA,GAAY,CAAC,SAAA,EAAmB,MAAA,KAAsC;AAC1E,EAAA,MAAM,KAAA,GAAQ,OAAO,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,SAAS,CAAA;AAC5D,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,KAAA;AAEhC,EAAA,MAAM,YAAY,MAAA,CAAO,MAAA,CAAO,IAAI,CAAC,CAAA,KAAM,EAAE,IAAI,CAAA;AACjD,EAAA,MAAM,UAAA,GAAa,WAAA,CAAY,SAAA,EAAW,SAAS,CAAA;AACnD,EAAA,MAAM,IAAA,GAAO,UAAA,KAAe,MAAA,GAAY,CAAA,eAAA,EAAkB,UAAU,CAAA,EAAA,CAAA,GAAO,EAAA;AAC3E,EAAA,MAAM,IAAI,QAAA;AAAA,IACR,aAAA;AAAA,IACA,CAAA,OAAA,EAAU,SAAS,CAAA,uBAAA,EAA0B,MAAA,CAAO,IAAI,CAAA,EAAA,EAAK,IAAI,CAAA,mBAAA,EAAsB,SAAA,CAAU,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA;AAAA,IAC3G,EAAE,UAAA,EAAY,OAAA,EAAS,SAAA;AAAU,GACnC;AACF,CAAA;AASA,IAAM,SAAA,GAAY,CAAC,IAAA,KAAoD;AACrE,EAAA,IAAI,CAAC,gBAAA,CAAiB,IAAI,CAAA,EAAG;AAC3B,IAAA,MAAM,IAAI,QAAA;AAAA,MACR,aAAA;AAAA,MACA,uBAAuB,IAAI,CAAA,gCAAA;AAAA,KAC7B;AAAA,EACF;AACA,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA;AACjC,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,IAAA,CAAK,SAAA,CAAU,CAAA,EAAG,QAAQ,CAAA;AAAA,IAClC,KAAA,EAAO,IAAA,CAAK,SAAA,CAAU,QAAA,GAAW,CAAC;AAAA,GACpC;AACF,CAAA;AAMA,IAAM,UAAA,GAAa,CAAC,IAAA,EAAc,IAAA,KAAuB;AACvD,EAAA,IAAI,CAAC,YAAA,CAAa,IAAI,CAAA,EAAG;AACvB,IAAA,MAAM,IAAI,QAAA,CAAS,aAAA,EAAe,WAAW,IAAI,CAAA,EAAA,EAAK,IAAI,CAAA,8DAAA,CAAgE,CAAA;AAAA,EAC5H;AACF,CAAA;AAMA,IAAM,eAAA,GAAkB,CACtB,UAAA,EACA,QAAA,EACA,WACA,OAAA,KAC6B;AAM7B,EAAA,KAAA,MAAW,GAAA,IAAO,WAAW,SAAA,EAAW;AACtC,IAAA,IAAI,GAAA,CAAI,MAAA,KAAW,QAAA,CAAS,IAAA,EAAM;AAChC,MAAA,MAAM,UAAA,GAAa,IAAI,WAAA,CAAY,IAAA;AAAA,QACjC,CAAC,MAAA,KAAW,UAAA,CAAW,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAM,CAAA,EAAG,QAAA,KAAa;AAAA,OAC7E;AACA,MAAA,OAAO;AAAA,QACL,SAAA;AAAA,QACA,aAAa,GAAA,CAAI,WAAA;AAAA,QACjB,OAAA;AAAA,QACA,WAAW,GAAA,CAAI,aAAA;AAAA,QACf,SAAS,QAAA,CAAS,KAAA;AAAA,QAClB,IAAA,EAAM,aAAa,MAAA,GAAS;AAAA,OAC9B;AAAA,IACF;AAAA,EACF;AAIA,EAAA,KAAA,MAAW,GAAA,IAAO,SAAS,SAAA,EAAW;AACpC,IAAA,IAAI,GAAA,CAAI,MAAA,KAAW,UAAA,CAAW,IAAA,EAAM;AAClC,MAAA,OAAO;AAAA,QACL,SAAA;AAAA,QACA,aAAa,GAAA,CAAI,aAAA;AAAA,QACjB,OAAA;AAAA,QACA,WAAW,GAAA,CAAI,WAAA;AAAA,QACf,SAAS,QAAA,CAAS,KAAA;AAAA,QAClB,IAAA,EAAM;AAAA,OACR;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT,CAAA;AASA,IAAM,gBAAA,GAAmB,CACvB,IAAA,EACA,YAAA,EACA,MAAA,KACoD;AACpD,EAAA,MAAM,MAAA,GAAS,UAAU,IAAI,CAAA;AAC7B,EAAA,MAAM,MAAA,GAAS,YAAA,CAAa,GAAA,CAAI,MAAA,CAAO,MAAM,CAAA;AAE7C,EAAA,IAAI,WAAW,MAAA,EAAW;AAExB,IAAA,MAAM,YAAA,GAAe,OAAO,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAA,CAAO,MAAM,CAAA;AACzE,IAAA,IAAI,YAAA,EAAc;AAChB,MAAA,MAAM,IAAI,QAAA;AAAA,QACR,aAAA;AAAA,QACA,CAAA,QAAA,EAAW,MAAA,CAAO,MAAM,CAAA,+BAAA,EAAkC,IAAI,CAAA,0BAAA;AAAA,OAChE;AAAA,IACF;AACA,IAAA,MAAM,WAAW,MAAA,CAAO,QAAA,CAAS,IAAI,CAAC,CAAA,KAAM,EAAE,IAAI,CAAA;AAClD,IAAA,MAAM,UAAA,GAAa,WAAA,CAAY,MAAA,CAAO,MAAA,EAAQ,QAAQ,CAAA;AACtD,IAAA,MAAM,IAAA,GAAO,UAAA,KAAe,MAAA,GAAY,CAAA,eAAA,EAAkB,UAAU,CAAA,EAAA,CAAA,GAAO,EAAA;AAC3E,IAAA,MAAM,IAAI,QAAA;AAAA,MACR,aAAA;AAAA,MACA,CAAA,QAAA,EAAW,MAAA,CAAO,MAAM,CAAA,sBAAA,EAAyB,IAAI,CAAA,CAAA;AAAA,MACrD,EAAE,UAAA,EAAY,OAAA,EAAS,QAAA;AAAS,KAClC;AAAA,EACF;AAEA,EAAA,MAAM,WAAA,GAAc,SAAA,CAAU,MAAA,CAAO,KAAA,EAAO,OAAO,MAAM,CAAA;AAEzD,EAAA,OAAO;AAAA,IACL,QAAA,EAAU;AAAA,MACR,IAAA;AAAA,MACA,OAAO,MAAA,CAAO,KAAA;AAAA,MACd,QAAQ,WAAA,CAAY,IAAA;AAAA,MACpB,YAAY,MAAA,CAAO,KAAA;AAAA,MACnB,MAAA,EAAQ;AAAA,KACV;AAAA,IACA,YAAY,MAAA,CAAO;AAAA,GACrB;AACF,CAAA;AAKA,IAAM,WAAA,GAAc,gBAAA;AAEpB,IAAM,qBAAqB,CACzB,MAAA,EACA,cACA,MAAA,EACA,aAAA,EAMA,WACA,YAAA,KACS;AACT,EAAA,IAAI,IAAA,IAAQ,MAAA,IAAU,KAAA,IAAS,MAAA,IAAU,IAAA,IAAQ,MAAA,IAAU,KAAA,IAAS,MAAA,IAAU,IAAA,IAAQ,MAAA,IAAU,KAAA,IAAS,MAAA,EAAQ;AAC/G,IAAA,MAAM,IAAA,GAAQ,QAAQ,MAAA,GAAU,MAAA,CAAO,KAClC,KAAA,IAAS,MAAA,GAAU,OAAO,GAAA,GAC1B,IAAA,IAAQ,SAAU,MAAA,CAAO,EAAA,GACzB,SAAS,MAAA,GAAU,MAAA,CAAO,MAC1B,IAAA,IAAQ,MAAA,GAAU,MAAA,CAAO,EAAA,GAC1B,MAAA,CAAO,GAAA;AACX,IAAA,yBAAA,CAA0B,IAAA,CAAK,CAAC,CAAA,EAAG,YAAA,EAAc,QAAQ,aAAa,CAAA;AACtE,IAAA,yBAAA,CAA0B,IAAA,CAAK,CAAC,CAAA,EAAG,YAAA,EAAc,QAAQ,aAAa,CAAA;AACtE,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,IAAA,IAAQ,MAAA,IAAU,OAAA,IAAW,MAAA,EAAQ;AACvC,IAAA,MAAM,KAAA,GAAQ,IAAA,IAAQ,MAAA,GAAS,MAAA,CAAO,KAAK,MAAA,CAAO,KAAA;AAClD,IAAA,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAA,EAAG,YAAA,EAAc,QAAQ,aAAa,CAAA;AACpE,IAAA,MAAM,MAAA,GAAS,MAAM,CAAC,CAAA;AACtB,IAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,EAAG;AACzB,MAAA,KAAA,MAAW,KAAK,MAAA,EAAQ;AACtB,QAAA,yBAAA,CAA0B,CAAA,EAAG,YAAA,EAAc,MAAA,EAAQ,aAAa,CAAA;AAAA,MAClE;AAAA,IACF;AACA,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,MAAA,IAAU,MAAA,IAAU,OAAA,IAAW,MAAA,EAAQ;AACzC,IAAA,MAAM,KAAA,GAAQ,MAAA,IAAU,MAAA,GAAS,MAAA,CAAO,OAAO,MAAA,CAAO,KAAA;AACtD,IAAA,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAA,EAAG,YAAA,EAAc,QAAQ,aAAa,CAAA;AACpE,IAAA,yBAAA,CAA0B,KAAA,CAAM,CAAC,CAAA,EAAG,YAAA,EAAc,QAAQ,aAAa,CAAA;AACvE,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,IAAA,sBAAA,CAAuB,MAAA,CAAO,MAAA,EAAQ,YAAA,EAAc,MAAA,EAAQ,aAAa,CAAA;AACzE,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,eAAe,MAAA,EAAQ;AACzB,IAAA,sBAAA,CAAuB,MAAA,CAAO,SAAA,EAAW,YAAA,EAAc,MAAA,EAAQ,aAAa,CAAA;AAC5E,IAAA;AAAA,EACF;AAOA,EAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,IAAA,IAAI,SAAA,KAAc,MAAA,IAAa,YAAA,KAAiB,MAAA,EAAW;AAC3D,IAAA,MAAM,KAAA,GAAsB,IAAI,GAAA,CAAI,YAAY,CAAA;AAChD,IAAA,MAAM,eAAiC,EAAC;AACxC,IAAA,MAAM,gBAAgE,EAAC;AACvE,IAAA,MAAM,aAA6B,EAAC;AACpC,IAAA,MAAM,aAAA,uBAAoB,GAAA,EAAoB;AAE9C,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAA,CAAO,MAAA,CAAO,IAAA,EAAM;AACrC,MAAA,MAAM,MAAA,GAAS,UAAA,CAAW,IAAA,EAAM,MAAM,CAAA;AAItC,MAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,IAAA,EAAM,YAAY,CAAA;AAC9C,MAAA,KAAA,CAAM,GAAA,CAAI,IAAA,EAAM,EAAE,MAAA,EAAQ,OAAO,CAAA;AACjC,MAAA,YAAA,CAAa,KAAK,EAAE,KAAA,EAAO,QAAQ,KAAA,EAAO,MAAA,CAAO,OAAO,CAAA;AACxD,MAAA,aAAA,CAAc,IAAA,CAAK,EAAE,MAAA,EAAQ,KAAA,EAAO,CAAA;AAAA,IACtC;AAEA,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,aAAA,CAAc,MAAA,EAAQ,KAAK,CAAA,EAAG;AAChD,MAAA,MAAM,IAAA,GAAO,cAAc,CAAC,CAAA;AAC5B,MAAA,IAAI,SAAS,MAAA,EAAW;AACxB,MAAA,IAAI,KAAA,GAAQ,KAAA;AACZ,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,KAAK,CAAA,EAAG;AAC7B,QAAA,MAAM,OAAA,GAAU,cAAc,CAAC,CAAA;AAC/B,QAAA,IAAI,YAAY,MAAA,EAAW;AAC3B,QAAA,MAAM,IAAA,GAAO,gBAAgB,OAAA,CAAQ,MAAA,EAAQ,KAAK,MAAA,EAAQ,OAAA,CAAQ,KAAA,EAAO,IAAA,CAAK,KAAK,CAAA;AACnF,QAAA,IAAI,SAAS,MAAA,EAAW;AACtB,UAAA,UAAA,CAAW,KAAK,IAAI,CAAA;AACpB,UAAA,KAAA,GAAQ,IAAA;AACR,UAAA;AAAA,QACF;AAAA,MACF;AACA,MAAA,IAAI,CAAC,KAAA,EAAO,MAAM,IAAI,QAAA,CAAS,eAAe,CAAA,2EAAA,EAA8E,IAAA,CAAK,MAAA,CAAO,IAAI,CAAA,EAAA,CAAI,CAAA;AAAA,IAClJ;AAEA,IAAA,IAAI,WAAA;AACJ,IAAA,IAAI,MAAA,CAAO,MAAA,CAAO,MAAA,KAAW,MAAA,EAAW;AACtC,MAAA,MAAM,UAAA,uBAAiB,GAAA,EAA4B;AACnD,MAAA,kBAAA,CAAmB,OAAO,MAAA,CAAO,MAAA,EAAQ,OAAO,MAAA,EAAQ,UAAA,EAAY,WAAW,YAAY,CAAA;AAC3F,MAAA,WAAA,GAAc,EAAE,QAAA,EAAU,MAAA,CAAO,MAAA,CAAO,MAAA,EAAQ,eAAe,UAAA,EAAW;AAC1E,MAAA,KAAA,MAAW,CAAC,IAAA,EAAM,GAAG,CAAA,IAAK,UAAA,EAAY;AAGpC,QAAA,MAAM,QAAQ,IAAA,CAAK,KAAA,CAAM,GAAG,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAC,CAAA;AAC7C,QAAA,IAAI,MAAA,CAAO,MAAA,CAAO,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,EAAG,aAAA,CAAc,GAAA,CAAI,IAAA,EAAM,GAAG,GAAA,CAAI,KAAK,CAAA,CAAA,EAAI,GAAA,CAAI,MAAM,CAAA,CAAE,CAAA;AAAA,aACvF,aAAA,CAAc,GAAA,CAAI,IAAA,EAAM,GAAG,CAAA;AAAA,MAClC;AAAA,IACF;AAEA,IAAA,SAAA,CAAU,GAAA,CAAI,MAAA,CAAO,MAAA,EAAQ,EAAE,OAAA,EAAS,YAAA,EAAc,KAAA,EAAO,UAAA,EAAY,MAAA,EAAQ,WAAA,EAAa,QAAA,EAAU,aAAA,EAAe,CAAA;AACvH,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,KAAA,MAAW,GAAA,IAAO,OAAO,GAAA,EAAK;AAC5B,MAAA,kBAAA,CAAmB,GAAA,EAAK,YAAA,EAAc,MAAA,EAAQ,aAAA,EAAe,WAAW,YAAY,CAAA;AAAA,IACtF;AACA,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,QAAQ,MAAA,EAAQ;AAClB,IAAA,KAAA,MAAW,GAAA,IAAO,OAAO,EAAA,EAAI;AAC3B,MAAA,kBAAA,CAAmB,GAAA,EAAK,YAAA,EAAc,MAAA,EAAQ,aAAA,EAAe,WAAW,YAAY,CAAA;AAAA,IACtF;AACA,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,kBAAA,CAAmB,OAAO,GAAA,EAAK,YAAA,EAAc,MAAA,EAAQ,aAAA,EAAe,WAAW,YAAY,CAAA;AAC3F,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,cAAc,MAAA,EAAQ;AACxB,IAAA,sBAAA,CAAuB,MAAA,CAAO,QAAA,CAAS,KAAA,EAAO,YAAA,EAAc,QAAQ,aAAa,CAAA;AACjF,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,WAAW,MAAA,EAAQ;AACrB,IAAA,sBAAA,CAAuB,MAAA,CAAO,KAAA,CAAM,KAAA,EAAO,YAAA,EAAc,QAAQ,aAAa,CAAA;AAC9E,IAAA;AAAA,EACF;AAGA,EAAA,IAAI,UAAA,IAAc,MAAA,EAAQ,cAAA,CAAe,kBAAkB,CAAA;AAC7D,CAAA;AAEA,IAAM,sBAAA,GAAyB,CAC7B,IAAA,EACA,YAAA,EACA,QACA,aAAA,KACS;AACT,EAAA,IAAI,aAAA,CAAc,GAAA,CAAI,IAAI,CAAA,EAAG;AAK7B,EAAA,MAAM,EAAE,QAAA,EAAS,GAAI,gBAAA,CAAiB,IAAA,EAAM,cAAc,MAAM,CAAA;AAChE,EAAA,aAAA,CAAc,GAAA,CAAI,IAAA,EAAM,EAAE,KAAA,EAAO,QAAA,CAAS,KAAA,EAAO,MAAA,EAAQ,QAAA,CAAS,MAAA,EAAQ,MAAA,EAAQ,QAAA,CAAS,MAAA,EAAQ,CAAA;AACrG,CAAA;AAEA,IAAM,yBAAA,GAA4B,CAChC,GAAA,EACA,YAAA,EACA,QACA,aAAA,KACS;AACT,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,IAAY,WAAA,CAAY,GAAG,CAAA,EAAG;AAC/C,IAAA,sBAAA,CAAuB,GAAA,EAAK,YAAA,EAAc,MAAA,EAAQ,aAAa,CAAA;AAAA,EACjE;AACF,CAAA;AAMA,IAAM,eAAA,GAAkB,CACtB,MAAA,EACA,YAAA,EACA,MAAA,KACiC;AACjC,EAAA,IAAI,cAAc,MAAA,EAAQ;AACxB,IAAA,MAAM,EAAE,UAAS,GAAI,gBAAA,CAAiB,OAAO,QAAA,CAAS,KAAA,EAAO,cAAc,MAAM,CAAA;AACjF,IAAA,MAAM,QAAA,GAAW,OAAO,QAAA,CAAS,KAAA;AACjC,IAAA,MAAM,WAAA,GAAc,UAAA,IAAc,QAAA,GAAW,QAAA,CAAS,WAAW,QAAA,CAAS,MAAA;AAC1E,IAAA,OAAO;AAAA,MACL,KAAA,EAAO,QAAA;AAAA,MACP,WAAA;AAAA,MACA,QAAA,EAAU,OAAO,QAAA,CAAS;AAAA,KAC5B;AAAA,EACF;AAEA,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,KAAA,MAAW,GAAA,IAAO,OAAO,GAAA,EAAK;AAC5B,MAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,GAAA,EAAK,YAAA,EAAc,MAAM,CAAA;AACxD,MAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AAAA,IACnC;AAAA,EACF;AAEA,EAAA,IAAI,QAAQ,MAAA,EAAQ;AAClB,IAAA,KAAA,MAAW,GAAA,IAAO,OAAO,EAAA,EAAI;AAC3B,MAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,GAAA,EAAK,YAAA,EAAc,MAAM,CAAA;AACxD,MAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AAAA,IACnC;AAAA,EACF;AAEA,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,OAAO,eAAA,CAAgB,MAAA,CAAO,GAAA,EAAK,YAAA,EAAc,MAAM,CAAA;AAAA,EACzD;AAEA,EAAA,OAAO,MAAA;AACT,CAAA;AAMO,IAAM,OAAA,GAAU,CAAC,GAAA,EAAY,MAAA,KAA0C;AAC5E,EAAA,MAAM,YAAA,uBAAiC,GAAA,EAAI;AAC3C,EAAA,MAAM,YAAA,uBAAiC,GAAA,EAAI;AAC3C,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AACzC,EAAA,MAAM,UAA4B,EAAC;AACnC,EAAA,MAAM,QAAwB,EAAC;AAG/B,EAAA,MAAM,gBAAgE,EAAC;AAEvE,EAAA,KAAA,MAAW,MAAA,IAAU,IAAI,IAAA,EAAM;AAC7B,IAAA,IAAI,OAAO,WAAW,QAAA,EAAU;AAC9B,MAAA,MAAM,MAAA,GAAS,UAAA,CAAW,MAAA,EAAQ,MAAM,CAAA;AACxC,MAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,MAAA,EAAQ,YAAY,CAAA;AAEhD,MAAA,YAAA,CAAa,GAAA,CAAI,MAAA,EAAQ,EAAE,MAAA,EAAQ,OAAO,CAAA;AAC1C,MAAA,OAAA,CAAQ,KAAK,EAAE,KAAA,EAAO,QAAQ,KAAA,EAAO,MAAA,CAAO,OAAO,CAAA;AACnD,MAAA,aAAA,CAAc,IAAA,CAAK,EAAE,MAAA,EAAQ,KAAA,EAAO,CAAA;AAAA,IACtC,CAAA,MAAO;AAEL,MAAA,UAAA,CAAW,MAAA,CAAO,IAAI,gBAAgB,CAAA;AACtC,MAAA,MAAM,WAAA,GAAc,OAAA,CAAQ,MAAA,CAAO,KAAA,EAAO,MAAM,CAAA;AAChD,MAAA,MAAM,QAAQ,MAAA,CAAO,EAAA;AAOrB,MAAA,MAAM,UAAA,GAAa,CAAC,IAAA,EAAc,cAAA,MAAiD;AAAA,QACjF,IAAA;AAAA,QACA,IAAA,EAAM,cAAA;AAAA,QACN,cAAA;AAAA,QACA,QAAA,EAAU,IAAA;AAAA,QACV,UAAA,EAAY;AAAA,OACd,CAAA;AACA,MAAA,MAAM,eAAA,GAAiC;AAAA,QACrC,GAAG,WAAA,CAAY,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,MAAO,EAAE,GAAG,CAAA,CAAE,MAAA,EAAQ,IAAA,EAAM,CAAA,CAAE,YAAW,CAAE,CAAA;AAAA,QACtE,GAAG,WAAA,CAAY,QAAA,CAAS,GAAA,CAAI,CAAC,MAAM,UAAA,CAAW,CAAA,CAAE,IAAA,EAAM,SAAS,CAAC,CAAA;AAAA,QAChE,GAAG,WAAA,CAAY,UAAA,CAAW,GAAA,CAAI,CAAC,MAAM,UAAA,CAAW,CAAA,CAAE,IAAA,EAAM,QAAQ,CAAC;AAAA,OACnE;AACA,MAAA,MAAM,eAAA,GAAgC;AAAA,QACpC,IAAA,EAAM,KAAA;AAAA,QACN,KAAA,EAAO,KAAA;AAAA,QACP,MAAA,EAAQ,eAAA;AAAA,QACR,WAAW,EAAC;AAAA,QACZ,SAAS;AAAC,OACZ;AAEA,MAAA,YAAA,CAAa,IAAI,KAAA,EAAO,EAAE,MAAA,EAAQ,eAAA,EAAiB,OAAO,CAAA;AAC1D,MAAA,OAAA,CAAQ,IAAA,CAAK,EAAE,KAAA,EAAO,QAAA,EAAU,aAAa,CAAA;AAAA,IAC/C;AAAA,EACF;AAGA,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,aAAA,CAAc,QAAQ,CAAA,EAAA,EAAK;AAC7C,IAAA,MAAM,IAAA,GAAO,aAAA,CAAc,CAAA,GAAI,CAAC,CAAA;AAChC,IAAA,MAAM,IAAA,GAAO,cAAc,CAAC,CAAA;AAC5B,IAAA,IAAI,IAAA,KAAS,MAAA,IAAa,IAAA,KAAS,MAAA,EAAW;AAG9C,IAAA,IAAI,SAAA,GAAY,KAAA;AAChB,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK;AAC1B,MAAA,MAAM,OAAA,GAAU,cAAc,CAAC,CAAA;AAC/B,MAAA,IAAI,YAAY,MAAA,EAAW;AAE3B,MAAA,MAAM,IAAA,GAAO,gBAAgB,OAAA,CAAQ,MAAA,EAAQ,KAAK,MAAA,EAAQ,OAAA,CAAQ,KAAA,EAAO,IAAA,CAAK,KAAK,CAAA;AACnF,MAAA,IAAI,SAAS,MAAA,EAAW;AACtB,QAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AACf,QAAA,SAAA,GAAY,IAAA;AACZ,QAAA;AAAA,MACF;AAAA,IACF;AAEA,IAAA,IAAI,CAAC,SAAA,EAAW;AACd,MAAA,MAAM,IAAI,QAAA;AAAA,QACR,aAAA;AAAA,QACA,CAAA,mEAAA,EAAsE,IAAA,CAAK,MAAA,CAAO,IAAI,CAAA,mCAAA;AAAA,OACxF;AAAA,IACF;AAAA,EACF;AAKA,EAAA,MAAM,SAA0B,EAAC;AACjC,EAAA,KAAA,MAAW,GAAA,IAAO,GAAA,CAAI,MAAA,IAAU,EAAC,EAAG;AAClC,IAAA,MAAM,IAAA,GAAO,OAAO,GAAA,KAAQ,QAAA,GAAW,MAAM,GAAA,CAAI,KAAA;AACjD,IAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,EAAU,UAAA,CAAW,GAAA,CAAI,IAAI,aAAa,CAAA;AAC7D,IAAA,MAAM,EAAE,QAAA,EAAS,GAAI,gBAAA,CAAiB,IAAA,EAAM,cAAc,MAAM,CAAA;AAChE,IAAA,MAAA,CAAO,IAAA,CAAK,OAAO,GAAA,KAAQ,QAAA,GAAW,QAAA,GAAW,EAAE,GAAG,QAAA,EAAU,UAAA,EAAY,GAAA,CAAI,EAAA,EAAI,CAAA;AACpF,IAAA,QAAA,CAAS,GAAA,CAAI,MAAM,CAAA,EAAG,QAAA,CAAS,KAAK,CAAA,CAAA,EAAI,QAAA,CAAS,MAAM,CAAA,CAAE,CAAA;AAAA,EAC3D;AAGA,EAAA,IAAI,cAAA;AACJ,EAAA,IAAI,QAAA;AAEJ,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAA4B;AAElD,EAAA,IAAI,GAAA,CAAI,WAAW,MAAA,EAAW;AAC5B,IAAA,MAAM,aAAA,uBAAoB,GAAA,EAA4B;AACtD,IAAA,kBAAA,CAAmB,IAAI,MAAA,EAAQ,YAAA,EAAc,MAAA,EAAQ,aAAA,EAAe,WAAW,YAAY,CAAA;AAC3F,IAAA,cAAA,GAAiB,EAAE,QAAA,EAAU,GAAA,CAAI,MAAA,EAAQ,aAAA,EAAc;AAGvD,IAAA,KAAA,MAAW,CAAC,IAAA,EAAM,GAAG,CAAA,IAAK,aAAA,EAAe;AACvC,MAAA,QAAA,CAAS,GAAA,CAAI,MAAM,CAAA,EAAG,GAAA,CAAI,KAAK,CAAA,CAAA,EAAI,GAAA,CAAI,MAAM,CAAA,CAAE,CAAA;AAAA,IACjD;AAGA,IAAA,QAAA,GAAW,eAAA,CAAgB,GAAA,CAAI,MAAA,EAAQ,YAAA,EAAc,MAAM,CAAA;AAAA,EAC7D;AAOA,EAAA,MAAM,WAAmE,EAAC;AAC1E,EAAA,IAAI,GAAA,CAAI,YAAY,MAAA,EAAW;AAC7B,IAAA,KAAA,MAAW,CAAC,MAAM,IAAI,CAAA,IAAK,OAAO,OAAA,CAAQ,GAAA,CAAI,OAAO,CAAA,EAAG;AACtD,MAAA,IAAI,SAAS,MAAA,EAAW;AACtB,QAAA,UAAA,CAAW,MAAM,cAAc,CAAA;AAC/B,QAAA,mBAAA,CAAoB,IAAA,EAAM,YAAA,EAAc,MAAA,EAAQ,QAAA,EAAU,WAAW,YAAY,CAAA;AACjF,QAAA,QAAA,CAAS,IAAA,CAAK,EAAE,IAAA,EAAM,UAAA,EAAY,MAAM,CAAA;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAGA,EAAA,MAAM,aAAuE,EAAC;AAC9E,EAAA,IAAI,GAAA,CAAI,cAAc,MAAA,EAAW;AAC/B,IAAA,KAAA,MAAW,CAAC,MAAM,IAAI,CAAA,IAAK,OAAO,OAAA,CAAQ,GAAA,CAAI,SAAS,CAAA,EAAG;AACxD,MAAA,IAAI,SAAS,MAAA,EAAW;AACtB,QAAA,UAAA,CAAW,MAAM,gBAAgB,CAAA;AACjC,QAAA,qBAAA,CAAsB,IAAA,EAAM,YAAA,EAAc,MAAA,EAAQ,QAAQ,CAAA;AAC1D,QAAA,UAAA,CAAW,IAAA,CAAK,EAAE,IAAA,EAAM,UAAA,EAAY,MAAM,CAAA;AAAA,MAC5C;AAAA,IACF;AAAA,EACF;AAGA,EAAA,MAAM,UAA2B,EAAC;AAClC,EAAA,IAAI,GAAA,CAAI,YAAY,MAAA,EAAW;AAC7B,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAI,OAAA,EAAS;AAC9B,MAAA,MAAM,EAAE,QAAA,EAAS,GAAI,gBAAA,CAAiB,IAAA,EAAM,cAAc,MAAM,CAAA;AAChE,MAAA,OAAA,CAAQ,KAAK,QAAQ,CAAA;AACrB,MAAA,QAAA,CAAS,GAAA,CAAI,MAAM,CAAA,EAAG,QAAA,CAAS,KAAK,CAAA,CAAA,EAAI,QAAA,CAAS,MAAM,CAAA,CAAE,CAAA;AAAA,IAC3D;AAAA,EACF;AAGA,EAAA,MAAM,OAAsE,EAAC;AAC7E,EAAA,IAAI,GAAA,CAAI,SAAS,MAAA,EAAW;AAC1B,IAAA,MAAM,YAAA,GAAe,IAAI,GAAA,CAAI,QAAA,CAAS,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAA;AACxD,IAAA,MAAM,cAAA,GAAiB,IAAI,GAAA,CAAI,UAAA,CAAW,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAA;AAE5D,IAAA,KAAA,MAAW,KAAA,IAAS,IAAI,IAAA,EAAM;AAC5B,MAAA,MAAM,GAAA,GAAM,MAAM,GAAA,IAAO,KAAA;AAEzB,MAAA,IAAI,YAAA,CAAa,IAAI,KAAA,CAAM,KAAK,KAAK,cAAA,CAAe,GAAA,CAAI,KAAA,CAAM,KAAK,CAAA,EAAG;AAEpE,QAAA,IAAA,CAAK,KAAK,EAAE,KAAA,EAAO,KAAA,CAAM,KAAA,EAAO,KAAK,CAAA;AAAA,MACvC,CAAA,MAAO;AAEL,QAAA,MAAM,EAAE,QAAA,EAAS,GAAI,iBAAiB,KAAA,CAAM,KAAA,EAAO,cAAc,MAAM,CAAA;AACvE,QAAA,QAAA,CAAS,GAAA,CAAI,MAAM,KAAA,EAAO,CAAA,EAAG,SAAS,KAAK,CAAA,CAAA,EAAI,QAAA,CAAS,MAAM,CAAA,CAAE,CAAA;AAChE,QAAA,IAAA,CAAK,IAAA,CAAK,EAAE,KAAA,EAAO,QAAA,EAAU,KAAK,CAAA;AAAA,MACpC;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO;AAAA,IACL,OAAA;AAAA,IACA,KAAA;AAAA,IACA,MAAA;AAAA,IACA,MAAA,EAAQ,cAAA;AAAA,IACR,QAAA;AAAA,IACA,QAAA;AAAA,IACA,UAAA;AAAA,IACA,OAAA;AAAA,IACA,IAAA;AAAA,IACA,OAAO,GAAA,CAAI,KAAA;AAAA,IACX,QAAA,EAAU,IAAI,QAAA,IAAY,KAAA;AAAA,IAC1B,QAAA;AAAA,IACA,GAAI,SAAA,CAAU,IAAA,GAAO,IAAI,EAAE,SAAA,KAAc;AAAC,GAC5C;AACF;AAMA,IAAM,sBAAsB,CAC1B,IAAA,EACA,cACA,MAAA,EACA,QAAA,EACA,WACA,YAAA,KACS;AACT,EAAA,MAAM,mBAAA,GAAsB,CAAC,GAAA,KAA4B;AACvD,IAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,IAAY,WAAA,CAAY,GAAG,CAAA,EAAG;AAC/C,MAAA,IAAI,CAAC,QAAA,CAAS,GAAA,CAAI,GAAG,CAAA,EAAG;AACtB,QAAA,MAAM,EAAE,QAAA,EAAS,GAAI,gBAAA,CAAiB,GAAA,EAAK,cAAc,MAAM,CAAA;AAC/D,QAAA,QAAA,CAAS,GAAA,CAAI,KAAK,CAAA,EAAG,QAAA,CAAS,KAAK,CAAA,CAAA,EAAI,QAAA,CAAS,MAAM,CAAA,CAAE,CAAA;AAAA,MAC1D;AAAA,IACF;AAAA,EACF,CAAA;AAEA,EAAA,IAAI,SAAS,IAAA,IAAQ,UAAA,IAAc,QAAQ,UAAA,IAAc,IAAA,IAAQ,YAAY,IAAA,EAAM;AACjF,IAAA,MAAM,IAAA,GAAQ,KAAA,IAAS,IAAA,GAAQ,IAAA,CAAK,GAAA,GAC/B,UAAA,IAAc,IAAA,GAAQ,IAAA,CAAK,QAAA,GAC3B,UAAA,IAAc,IAAA,GAAQ,IAAA,CAAK,WAC5B,IAAA,CAAK,MAAA;AACT,IAAA,mBAAA,CAAoB,IAAA,CAAK,CAAC,CAAC,CAAA;AAC3B,IAAA,mBAAA,CAAoB,IAAA,CAAK,CAAC,CAAC,CAAA;AAC3B,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,YAAY,IAAA,EAAM;AACpB,IAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,MAAA,EAAQ,mBAAA,CAAoB,CAAC,CAAA;AAClD,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,cAAc,IAAA,EAAM;AACtB,IAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,QAAA,EAAU,mBAAA,CAAoB,CAAC,CAAA;AACpD,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,UAAU,IAAA,EAAM;AAClB,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,IAAA,CAAK,IAAA,EAAM;AAGjC,MAAA,MAAM,aAAA,uBAAoB,GAAA,EAA4B;AACtD,MAAA,kBAAA,CAAmB,KAAK,SAAA,EAAW,YAAA,EAAc,MAAA,EAAQ,aAAA,EAAe,WAAW,YAAY,CAAA;AAC/F,MAAA,KAAA,MAAW,CAAC,IAAA,EAAM,GAAG,CAAA,IAAK,aAAA,EAAe;AACvC,QAAA,QAAA,CAAS,GAAA,CAAI,MAAM,CAAA,EAAG,GAAA,CAAI,KAAK,CAAA,CAAA,EAAI,GAAA,CAAI,MAAM,CAAA,CAAE,CAAA;AAAA,MACjD;AACA,MAAA,mBAAA,CAAoB,KAAK,IAAI,CAAA;AAAA,IAC/B;AACA,IAAA,mBAAA,CAAoB,IAAA,CAAK,KAAK,IAAI,CAAA;AAAA,EACpC;AACF,CAAA;AAEA,IAAM,qBAAA,GAAwB,CAC5B,IAAA,EACA,YAAA,EACA,QACA,QAAA,KACS;AACT,EAAA,MAAM,GAAA,GAAO,WAAW,IAAA,GAAQ,IAAA,CAAK,QAChC,eAAA,IAAmB,IAAA,GAAQ,KAAK,aAAA,GAChC,KAAA,IAAS,OAAQ,IAAA,CAAK,GAAA,GACtB,SAAS,IAAA,GAAQ,IAAA,CAAK,MACtB,KAAA,IAAS,IAAA,GAAQ,IAAA,CAAK,GAAA,GACvB,IAAA,CAAK,GAAA;AAGT,EAAA,IAAI,QAAQ,GAAA,EAAK;AAGjB,EAAA,IAAI,OAAO,QAAQ,QAAA,EAAU;AAC3B,IAAA,mBAAA,CAAoB,GAAA,EAAK,YAAA,EAAc,MAAA,EAAQ,QAAQ,CAAA;AACvD,IAAA;AAAA,EACF;AAGA,EAAA,IAAI,CAAC,QAAA,CAAS,GAAA,CAAI,GAAG,CAAA,EAAG;AACtB,IAAA,MAAM,EAAE,QAAA,EAAS,GAAI,gBAAA,CAAiB,GAAA,EAAK,cAAc,MAAM,CAAA;AAC/D,IAAA,QAAA,CAAS,GAAA,CAAI,KAAK,CAAA,EAAG,QAAA,CAAS,KAAK,CAAA,CAAA,EAAI,QAAA,CAAS,MAAM,CAAA,CAAE,CAAA;AAAA,EAC1D;AACF,CAAA;;;ACntBA,IAAM,mBAAA,GAAsB,CAAC,MAAA,KAAmC;AAC9D,EAAA,IAAI,MAAA,CAAO,QAAA,KAAa,MAAA,EAAW,OAAO,CAAA;AAC1C,EAAA,IAAI,QAAA,GAAW,CAAA;AACf,EAAA,KAAA,MAAW,WAAA,IAAe,MAAA,CAAO,QAAA,CAAS,OAAA,EAAS;AACjD,IAAA,MAAM,UAAA,GAAa,oBAAoB,WAAW,CAAA;AAClD,IAAA,IAAI,UAAA,GAAa,UAAU,QAAA,GAAW,UAAA;AAAA,EACxC;AACA,EAAA,OAAO,CAAA,GAAI,QAAA;AACb,CAAA;AAEA,IAAM,kBAAA,GAAqB,CAAC,QAAA,KAAoC;AAC9D,EAAA,IAAI,GAAA,GAAM,CAAA;AACV,EAAA,KAAA,MAAW,MAAA,IAAU,SAAS,OAAA,EAAS;AACrC,IAAA,MAAM,KAAA,GAAQ,oBAAoB,MAAM,CAAA;AACxC,IAAA,IAAI,KAAA,GAAQ,KAAK,GAAA,GAAM,KAAA;AAAA,EACzB;AACA,EAAA,OAAO,GAAA;AACT,CAAA;AAMA,IAAM,mBAAA,GAAsB,CAAC,QAAA,KAAqC;AAEhE,EAAA,MAAM,aAAA,GAAgB,SAAS,OAAA,CAAQ,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,WAAW,MAAS,CAAA;AAC3E,EAAA,IAAI,aAAA,CAAc,MAAA,IAAU,CAAA,EAAG,OAAO,KAAA;AAItC,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAY;AACpC,EAAA,MAAM,WAAA,GAAc,cAAc,CAAC,CAAA;AACnC,EAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,IAAA,WAAA,CAAY,GAAA,CAAI,YAAY,KAAK,CAAA;AAAA,EACnC;AAEA,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,aAAA,CAAc,QAAQ,CAAA,EAAA,EAAK;AAC7C,IAAA,MAAM,MAAA,GAAS,cAAc,CAAC,CAAA;AAC9B,IAAA,IAAI,WAAW,MAAA,EAAW;AAE1B,IAAA,MAAM,OAAA,GAAU,SAAS,KAAA,CAAM,IAAA;AAAA,MAC7B,CAAC,CAAA,KACE,CAAA,CAAE,YAAY,MAAA,CAAO,KAAA,IAAS,YAAY,GAAA,CAAI,CAAA,CAAE,SAAS,CAAA,IACzD,EAAE,SAAA,KAAc,MAAA,CAAO,SAAS,WAAA,CAAY,GAAA,CAAI,EAAE,OAAO;AAAA,KAC9D;AAEA,IAAA,IAAI,CAAC,SAAS,OAAO,IAAA;AAErB,IAAA,WAAA,CAAY,GAAA,CAAI,OAAO,KAAK,CAAA;AAAA,EAC9B;AAEA,EAAA,OAAO,KAAA;AACT,CAAA;AAMA,IAAM,0BAAA,GAA6B,CAAC,QAAA,KAAsC;AACxE,EAAA,IAAI,QAAA,CAAS,MAAA,KAAW,MAAA,EAAW,OAAO,EAAC;AAE3C,EAAA,MAAM,YAAsB,EAAC;AAE7B,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,GAAG,CAAA,IAAK,QAAA,CAAS,OAAO,aAAA,EAAe;AAEvD,IAAA,MAAM,MAAA,GAAS,SAAS,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,KAAA,KAAU,GAAA,CAAI,KAAK,CAAA;AACjE,IAAA,IAAI,MAAA,KAAW,MAAA,IAAa,MAAA,CAAO,MAAA,KAAW,MAAA,EAAW;AAGzD,IAAA,MAAM,SAAA,GAAY,MAAA,CAAO,MAAA,CAAO,OAAA,CAAQ,IAAA;AAAA,MAAK,CAAC,GAAA,KAC5C,GAAA,CAAI,MAAA,CAAO,QAAA,CAAS,IAAI,MAAM;AAAA,KAChC;AAGA,IAAA,MAAM,YAAA,GAAe,MAAA,CAAO,MAAA,CAAO,MAAA,CAAO,IAAA;AAAA,MACxC,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,GAAA,CAAI,UAAU,CAAA,CAAE;AAAA,KACpC;AAEA,IAAA,IAAI,CAAC,SAAA,IAAa,CAAC,YAAA,EAAc;AAC/B,MAAA,SAAA,CAAU,KAAK,IAAI,CAAA;AAAA,IACrB;AAAA,EACF;AAEA,EAAA,OAAO,SAAA;AACT,CAAA;AAMA,IAAM,2BAAA,GAA8B,CAAC,QAAA,KACnC,QAAA,CAAS,WAAW,MAAA,GAAS,CAAA,IAAK,QAAA,CAAS,OAAA,CAAQ,MAAA,KAAW,CAAA;AAMzD,IAAM,OAAA,GAAU,CAAC,QAAA,EAAyB,MAAA,KAA2C;AAC1F,EAAA,MAAM,WAAqB,EAAC;AAC5B,EAAA,MAAM,SAAmB,EAAC;AAG1B,EAAA,MAAM,KAAA,GAAQ,mBAAmB,QAAQ,CAAA;AACzC,EAAA,IAAI,KAAA,GAAQ,OAAO,eAAA,EAAiB;AAClC,IAAA,MAAA,CAAO,IAAA;AAAA,MACL,CAAA,uBAAA,EAA0B,KAAK,CAAA,kCAAA,EAAqC,MAAA,CAAO,eAAe,CAAA;AAAA,KAC5F;AAAA,EACF;AAGA,EAAA,IAAI,MAAA,CAAO,uBAAA,IAA2B,mBAAA,CAAoB,QAAQ,CAAA,EAAG;AACnE,IAAA,MAAA,CAAO,IAAA;AAAA,MACL;AAAA,KACF;AAAA,EACF;AAGA,EAAA,MAAM,SAAA,GAAY,2BAA2B,QAAQ,CAAA;AACrD,EAAA,IAAI,SAAA,CAAU,SAAS,CAAA,EAAG;AACxB,IAAA,MAAM,OAAA,GAAU,CAAA,0BAAA,EAA6B,SAAA,CAAU,IAAA,CAAK,IAAI,CAAC,CAAA,iDAAA,CAAA;AACjE,IAAA,IAAI,OAAO,sBAAA,EAAwB;AACjC,MAAA,MAAA,CAAO,KAAK,OAAO,CAAA;AAAA,IACrB,CAAA,MAAA,IAAW,OAAO,oBAAA,EAAsB;AACtC,MAAA,QAAA,CAAS,KAAK,OAAO,CAAA;AAAA,IACvB;AAAA,EACF;AAGA,EAAA,IAAI,2BAAA,CAA4B,QAAQ,CAAA,EAAG;AACzC,IAAA,QAAA,CAAS,IAAA;AAAA,MACP;AAAA,KACF;AAAA,EACF;AAGA,EAAA,IAAI,QAAA,CAAS,aAAa,MAAA,EAAW;AACnC,IAAA,MAAM,aAAA,GAAgB,SAAS,QAAA,CAAS,KAAA;AACxC,IAAA,MAAM,YAAA,GAAe,SAAS,OAAA,CAAQ,IAAA;AAAA,MACpC,CAAC,CAAA,KAAM,CAAA,CAAE,KAAA,KAAU,aAAA,CAAc;AAAA,KACnC;AACA,IAAA,IAAI,YAAA,KAAiB,MAAA,IAAa,YAAA,CAAa,MAAA,KAAW,MAAA,EAAW;AACnE,MAAA,MAAM,cAAA,GAAiB,YAAA,CAAa,MAAA,CAAO,OAAA,CAAQ,IAAA;AAAA,QACjD,CAAC,GAAA,KACC,GAAA,CAAI,MAAA,CAAO,QAAA,CAAS,aAAA,CAAc,MAAM,CAAA,KACvC,GAAA,CAAI,IAAA,KAAS,MAAA,IAAU,GAAA,CAAI,IAAA,KAAS,SAAA;AAAA,OACzC;AACA,MAAA,IAAI,CAAC,cAAA,EAAgB;AACnB,QAAA,QAAA,CAAS,IAAA;AAAA,UACP,CAAA,cAAA,EAAiB,cAAc,IAAI,CAAA,4DAAA;AAAA,SACrC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,UAAU,MAAA,EAAO;AAC5B;;;ACpKO,IAAM,oBAAoB,MAAoB;AACnD,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAwB;AAE1C,EAAA,MAAM,GAAA,GAAM,OAAO,GAAA,KAAiD;AAClE,IAAA,OAAO,KAAA,CAAM,IAAI,GAAG,CAAA;AAAA,EACtB,CAAA;AAEA,EAAA,MAAM,GAAA,GAAM,OAAO,GAAA,EAAa,KAAA,KAAqC;AACnE,IAAA,KAAA,CAAM,GAAA,CAAI,KAAK,KAAK,CAAA;AAAA,EACtB,CAAA;AAEA,EAAA,MAAM,GAAA,GAAM,OAAO,GAAA,KAA+B;AAChD,IAAA,KAAA,CAAM,OAAO,GAAG,CAAA;AAAA,EAClB,CAAA;AAEA,EAAA,MAAM,QAAQ,YAA2B;AACvC,IAAA,KAAA,CAAM,KAAA,EAAM;AAAA,EACd,CAAA;AAEA,EAAA,MAAM,OAAO,YAA+B;AAC1C,IAAA,OAAO,CAAC,GAAG,KAAA,CAAM,IAAA,EAAM,CAAA;AAAA,EACzB,CAAA;AAGA,EAAA,MAAM,UAAU,YAAgE;AAC9E,IAAA,OAAO,CAAC,GAAG,KAAA,CAAM,OAAA,EAAS,CAAA,CAAE,GAAA,CAAI,CAAC,CAAC,KAAK,KAAK,CAAA,MAAO,EAAE,GAAA,EAAK,OAAM,CAAE,CAAA;AAAA,EACpE,CAAA;AAEA,EAAA,OAAO,EAAE,GAAA,EAAK,GAAA,EAAK,QAAQ,GAAA,EAAK,KAAA,EAAO,MAAM,OAAA,EAAQ;AACvD;;;ACqDA,IAAM,cAAA,GAAiB,GAAA;AACvB,IAAM,mBAAA,GAAsB,GAAA;AAC5B,IAAM,iBAAA,GAAoB,KAAK,IAAA,GAAO,IAAA;AACtC,IAAM,mBAAA,GAAsB,EAAA;AAG5B,IAAM,gBAAA,GAAmB,GAAA;AACzB,IAAM,YAAA,GAAe,GAAA;AAgBrB,IAAM,KAAA,GAAQ,CAAC,KAAA,KAA+C;AAC5D,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,IAAA,IAAQ,OAAA,IAAW,KAAA,IAAS,OAAO,KAAA,CAAM,KAAA,KAAU,UAAA,EAAY,KAAA,CAAM,KAAA,EAAM;AACxH,CAAA;AAEO,IAAM,iBAAiB,CAC5B,MAAA,GAAyB,EAAC,EAC1B,OAAuC,MAAM;AAAC,CAAA,EAC9C,GAAA,GAAoB,KAAK,GAAA,KACZ;AACb,EAAA,MAAM,KAAA,GAAQ,OAAO,KAAA,IAAS,cAAA;AAC9B,EAAA,MAAM,UAAA,GAAa,OAAO,UAAA,IAAc,mBAAA;AACxC,EAAA,MAAM,QAAA,GAAW,OAAO,QAAA,IAAY,iBAAA;AACpC,EAAA,MAAM,gBAAgB,MAAA,CAAO,aAAA,IAAiB,IAAA,CAAK,KAAA,CAAM,WAAW,EAAE,CAAA;AACtE,EAAA,MAAM,UAAA,GAAa,OAAO,UAAA,IAAc,mBAAA;AAExC,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AACzC,EAAA,MAAM,YAAY,CAAC,KAAA,KAA0B,QAAA,CAAS,GAAA,CAAI,KAAK,CAAA,IAAK,CAAA;AACpE,EAAA,MAAM,QAAA,GAAW,CAAC,MAAA,KAAwC,MAAA,CAAO,IAAI,SAAS,CAAA;AAC9E,EAAA,MAAM,SAAA,GAAY,CAAC,MAAA,EAA2B,IAAA,KAC5C,OAAO,KAAA,CAAM,CAAC,KAAA,EAAO,CAAA,KAAM,SAAA,CAAU,KAAK,CAAA,KAAM,IAAA,CAAK,CAAC,CAAC,CAAA;AAGzD,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAoB;AACvC,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAoB;AACxC,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAoB;AACxC,EAAA,MAAM,cAAA,uBAAqB,GAAA,EAAyB;AAEpD,EAAA,MAAM,MAAA,GAAS,EAAE,IAAA,EAAM,CAAA,EAAG,MAAA,EAAQ,CAAA,EAAG,SAAA,EAAW,CAAA,EAAG,SAAA,EAAW,CAAA,EAAG,SAAA,EAAW,CAAA,EAAE;AAC9E,EAAA,MAAM,MAAA,GAAS,EAAE,KAAA,EAAO,GAAA,EAAI,EAAG,MAAM,CAAA,EAAG,SAAA,EAAW,CAAA,EAAG,MAAA,EAAQ,CAAA,EAAE;AAEhE,EAAA,MAAM,IAAA,GAAO,CAAC,GAAA,KAAsB;AAClC,IAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA;AAC5B,IAAA,IAAI,UAAU,MAAA,EAAW;AACzB,IAAA,MAAA,CAAO,OAAO,GAAG,CAAA;AACjB,IAAA,KAAA,IAAS,KAAA,CAAM,KAAA;AAAA,EACjB,CAAA;AAEA,EAAA,MAAM,eAAe,MAAY;AAC/B,IAAA,MAAM,KAAK,GAAA,EAAI;AACf,IAAA,IAAI,EAAA,GAAK,MAAA,CAAO,KAAA,GAAQ,gBAAA,EAAkB;AACxC,MAAA,MAAA,CAAO,KAAA,GAAQ,EAAA;AACf,MAAA,MAAA,CAAO,IAAA,GAAO,CAAA;AACd,MAAA,MAAA,CAAO,SAAA,GAAY,CAAA;AAAA,IACrB;AACA,IAAA,MAAA,CAAO,SAAA,IAAa,CAAA;AACpB,IAAA,IAAI,MAAA,CAAO,SAAA,IAAa,YAAA,IAAgB,MAAA,CAAO,SAAA,GAAY,OAAO,IAAA,IAAQ,EAAA,GAAK,MAAA,CAAO,MAAA,GAAS,gBAAA,EAAkB;AAC/G,MAAA,MAAA,CAAO,MAAA,GAAS,EAAA;AAChB,MAAA,OAAA,CAAQ,IAAA;AAAA,QACN,CAAA,2CAAA,EAA8C,MAAA,CAAO,SAAS,CAAA,YAAA,EAAe,OAAO,IAAI,CAAA,6EAAA;AAAA,OAC1F;AAAA,IACF;AAAA,EACF,CAAA;AAEA,EAAA,MAAM,KAAA,GAAQ,CAAC,GAAA,EAAa,IAAA,EAAa,QAA2B,IAAA,KAAkC;AACpG,IAAA,IAAA,CAAK,GAAG,CAAA;AACR,IAAA,MAAM,IAAA,GAAA,CAAQ,IAAA,CAAK,SAAA,CAAU,IAAI,KAAK,EAAA,EAAI,MAAA;AAC1C,IAAA,IAAI,OAAO,aAAA,EAAe;AACxB,MAAA,MAAA,CAAO,SAAA,IAAa,CAAA;AACpB,MAAA,IAAA,CAAK,EAAE,IAAA,EAAM,YAAA,EAAc,QAAQ,WAAA,EAAa,KAAA,EAAO,MAAM,CAAA;AAC7D,MAAA;AAAA,IACF;AACA,IAAA,MAAA,CAAO,GAAA,CAAI,GAAA,EAAK,EAAE,IAAA,EAAM,KAAA,EAAO,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,EAAA,EAAI,GAAA,EAAI,EAAG,CAAA;AAC9D,IAAA,KAAA,IAAS,IAAA;AACT,IAAA,OAAO,MAAA,CAAO,IAAA,GAAO,UAAA,IAAc,KAAA,GAAQ,QAAA,EAAU;AACnD,MAAA,MAAM,MAAA,GAAS,MAAA,CAAO,IAAA,EAAK,CAAE,IAAA,EAAK;AAClC,MAAA,IAAI,MAAA,CAAO,SAAS,IAAA,EAAM;AAC1B,MAAA,MAAM,OAAA,GAAU,MAAA,CAAO,GAAA,CAAI,MAAA,CAAO,KAAK,CAAA;AACvC,MAAA,IAAA,CAAK,OAAO,KAAK,CAAA;AACjB,MAAA,MAAA,CAAO,SAAA,IAAa,CAAA;AACpB,MAAA,IAAA,CAAK,EAAE,MAAM,YAAA,EAAc,MAAA,EAAQ,YAAY,KAAA,EAAO,OAAA,EAAS,KAAA,IAAS,CAAA,EAAG,CAAA;AAC3E,MAAA,YAAA,EAAa;AAAA,IACf;AAAA,EACF,CAAA;AAEA,EAAA,MAAM,IAAA,GAAO,CAAC,GAAA,EAAa,MAAA,KAAuC;AAChE,IAAA,MAAM,GAAA,GAAM,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA;AAC1B,IAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,MAAA,IAAI,GAAA,EAAI,GAAI,GAAA,CAAI,EAAA,GAAK,KAAA,IAAS,UAAU,GAAA,CAAI,MAAA,EAAQ,GAAA,CAAI,IAAI,CAAA,EAAG;AAC7D,QAAA,MAAA,CAAO,OAAO,GAAG,CAAA;AACjB,QAAA,MAAA,CAAO,GAAA,CAAI,KAAK,GAAG,CAAA;AACnB,QAAA,MAAA,CAAO,IAAA,IAAQ,CAAA;AACf,QAAA,MAAA,CAAO,IAAA,IAAQ,CAAA;AACf,QAAA,OAAO,OAAA,CAAQ,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA;AAAA,MACjC;AACA,MAAA,IAAA,CAAK,GAAG,CAAA;AAAA,IACV;AACA,IAAA,MAAA,CAAO,MAAA,IAAU,CAAA;AAGjB,IAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AAC9B,IAAA,IAAI,MAAA,KAAW,UAAa,SAAA,CAAU,MAAA,CAAO,QAAQ,MAAA,CAAO,IAAI,CAAA,EAAG,OAAO,MAAA,CAAO,OAAA;AAEjF,IAAA,MAAM,IAAA,GAAO,QAAA,CAAS,MAAA,CAAO,MAAM,CAAA;AACnC,IAAA,MAAM,UAAU,MAAA,CAAO,KAAA,EAAM,CAAE,IAAA,CAAK,CAAC,IAAA,KAAS;AAC5C,MAAA,KAAA,CAAM,GAAA,EAAK,IAAA,EAAM,MAAA,CAAO,MAAA,EAAQ,IAAI,CAAA;AACpC,MAAA,OAAO,IAAA;AAAA,IACT,CAAC,CAAA;AACD,IAAA,MAAM,QAAgB,EAAE,OAAA,EAAS,MAAA,EAAQ,MAAA,CAAO,QAAQ,IAAA,EAAK;AAC7D,IAAA,OAAA,CAAQ,GAAA,CAAI,KAAK,KAAK,CAAA;AACtB,IAAA,MAAM,SAAS,MAAY;AACzB,MAAA,IAAI,QAAQ,GAAA,CAAI,GAAG,MAAM,KAAA,EAAO,OAAA,CAAQ,OAAO,GAAG,CAAA;AAAA,IACpD,CAAA;AACA,IAAA,OAAA,CAAQ,IAAA,CAAK,QAAQ,MAAM,CAAA;AAC3B,IAAA,OAAO,OAAA;AAAA,EACT,CAAA;AAIA,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,EAAA,IAAI,UAAA;AAEJ,EAAA,MAAM,QAAA,GAAW,CAAC,GAAA,KAAsB;AACtC,IAAA,KAAA,CAAM,IAAI,GAAG,CAAA;AACb,IAAA,IAAI,eAAe,MAAA,EAAW;AAC9B,IAAA,UAAA,GAAa,WAAW,MAAM;AAC5B,MAAA,UAAA,GAAa,MAAA;AACb,MAAA,MAAM,IAAA,GAAO,CAAC,GAAG,KAAK,CAAA;AACtB,MAAA,KAAA,CAAM,KAAA,EAAM;AACZ,MAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,EAAM,KAAK,OAAA,CAAQ,MAAM,KAAK,CAAA;AAAA,IACnD,GAAG,UAAU,CAAA;AACb,IAAA,KAAA,CAAM,UAAU,CAAA;AAAA,EAClB,CAAA;AAKA,EAAA,MAAM,GAAA,GAAM,CAAC,GAAA,EAAaA,OAAAA,KAAyB;AACjD,IAAA,IAAIA,OAAAA,CAAO,KAAA,KAAU,MAAA,EAAW,YAAA,CAAaA,QAAO,KAAK,CAAA;AACzD,IAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,EAAG;AAC7B,IAAAA,OAAAA,CAAO,QAAQ,UAAA,CAAW,MAAM,KAAK,OAAA,CAAQ,GAAA,EAAK,IAAI,CAAA,EAAG,KAAK,CAAA;AAC9D,IAAA,KAAA,CAAMA,QAAO,KAAK,CAAA;AAAA,EACpB,CAAA;AAEA,EAAA,MAAM,OAAA,GAAU,OAAO,GAAA,EAAa,MAAA,KAAmC;AACrE,IAAA,MAAMA,OAAAA,GAAS,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AAC9B,IAAA,IAAIA,YAAW,MAAA,EAAW;AAC1B,IAAAA,QAAO,MAAA,IAAU,CAAA;AACjB,IAAA,MAAM,SAASA,OAAAA,CAAO,MAAA;AACtB,IAAA,IAAI,MAAA,OAAa,GAAG,CAAA;AACpB,IAAA,IAAI,IAAA;AACJ,IAAA,IAAI;AACF,MAAA,IAAA,GAAO,MAAM,IAAA,CAAK,GAAA,EAAKA,OAAAA,CAAO,MAAM,CAAA;AAAA,IACtC,SAAS,GAAA,EAAK;AAEZ,MAAA,IAAA,CAAK,EAAE,IAAA,EAAM,YAAA,EAAc,OAAA,EAAS,GAAA,YAAe,KAAA,GAAQ,GAAA,CAAI,OAAA,GAAU,MAAA,CAAO,GAAG,CAAA,EAAG,CAAA;AACtF,MAAA,IAAI,QAAQ,GAAA,CAAI,GAAG,MAAMA,OAAAA,EAAQ,GAAA,CAAI,KAAKA,OAAM,CAAA;AAChD,MAAA;AAAA,IACF;AACA,IAAA,IAAI,QAAQ,GAAA,CAAI,GAAG,MAAMA,OAAAA,IAAU,MAAA,GAASA,QAAO,MAAA,EAAQ;AAC3D,IAAAA,QAAO,MAAA,GAAS,MAAA;AAChB,IAAA,MAAA,CAAO,SAAA,IAAa,CAAA;AACpB,IAAA,GAAA,CAAI,KAAKA,OAAM,CAAA;AACf,IAAA,MAAM,WAAW,QAAA,CAAS,IAAA,CAAK,SAAA,CAAU,IAAI,KAAK,EAAE,CAAA;AACpD,IAAA,IAAI,QAAA,KAAaA,QAAO,QAAA,EAAU;AAClC,IAAAA,QAAO,QAAA,GAAW,QAAA;AAClB,IAAA,KAAA,MAAW,QAAA,IAAY,CAAC,GAAGA,OAAAA,CAAO,SAAS,CAAA,EAAG;AAC5C,MAAA,IAAI;AACF,QAAA,QAAA,CAAS,QAAQ,IAAI,CAAA;AAAA,MACvB,SAAS,GAAA,EAAK;AACZ,QAAA,IAAA,CAAK,EAAE,IAAA,EAAM,YAAA,EAAc,OAAA,EAAS,GAAA,YAAe,KAAA,GAAQ,GAAA,CAAI,OAAA,GAAU,MAAA,CAAO,GAAG,CAAA,EAAG,CAAA;AAAA,MACxF;AAAA,IACF;AAAA,EACF,CAAA;AAEA,EAAA,MAAM,QAAA,GAAW,CAAC,GAAA,EAAa,QAAA,KAAiC;AAC9D,IAAA,MAAMA,OAAAA,GAAS,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AAC9B,IAAA,IAAIA,YAAW,MAAA,EAAW;AAC1B,IAAAA,OAAAA,CAAO,SAAA,CAAU,MAAA,CAAO,QAAQ,CAAA;AAChC,IAAA,IAAIA,OAAAA,CAAO,SAAA,CAAU,IAAA,GAAO,CAAA,EAAG;AAC/B,IAAA,OAAA,CAAQ,OAAO,GAAG,CAAA;AAClB,IAAA,KAAA,CAAM,OAAO,GAAG,CAAA;AAChB,IAAA,IAAIA,OAAAA,CAAO,KAAA,KAAU,MAAA,EAAW,YAAA,CAAaA,QAAO,KAAK,CAAA;AACzD,IAAA,KAAA,MAAW,KAAA,IAASA,OAAAA,CAAO,MAAA,CAAO,MAAA,EAAQ;AACxC,MAAA,MAAM,IAAA,GAAO,cAAA,CAAe,GAAA,CAAI,KAAK,CAAA;AACrC,MAAA,IAAA,EAAM,OAAO,GAAG,CAAA;AAChB,MAAA,IAAI,SAAS,MAAA,IAAa,IAAA,CAAK,SAAS,CAAA,EAAG,cAAA,CAAe,OAAO,KAAK,CAAA;AAAA,IACxE;AAAA,EACF,CAAA;AAEA,EAAA,MAAM,SAAS,CAAC,GAAA,EAAa,MAAA,EAAoB,IAAA,EAAa,UAAwB,MAAA,KAA8B;AAClH,IAAA,IAAI,OAAO,OAAA,EAAS;AACpB,IAAA,IAAI,QAAA,GAAW,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AAC9B,IAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,MAAA,QAAA,GAAW,EAAE,MAAA,EAAQ,SAAA,kBAAW,IAAI,GAAA,IAAO,QAAA,EAAU,QAAA,CAAS,IAAA,CAAK,SAAA,CAAU,IAAI,CAAA,IAAK,EAAE,GAAG,MAAA,EAAQ,CAAA,EAAG,QAAQ,CAAA,EAAE;AAChH,MAAA,OAAA,CAAQ,GAAA,CAAI,KAAK,QAAQ,CAAA;AACzB,MAAA,KAAA,MAAW,KAAA,IAAS,OAAO,MAAA,EAAQ;AACjC,QAAA,IAAI,IAAA,GAAO,cAAA,CAAe,GAAA,CAAI,KAAK,CAAA;AACnC,QAAA,IAAI,SAAS,MAAA,EAAW;AACtB,UAAA,IAAA,uBAAW,GAAA,EAAI;AACf,UAAA,cAAA,CAAe,GAAA,CAAI,OAAO,IAAI,CAAA;AAAA,QAChC;AACA,QAAA,IAAA,CAAK,IAAI,GAAG,CAAA;AAAA,MACd;AACA,MAAA,GAAA,CAAI,KAAK,QAAQ,CAAA;AAAA,IACnB;AAKA,IAAA,QAAA,CAAS,SAAA,CAAU,IAAI,QAAQ,CAAA;AAC/B,IAAA,MAAA,CAAO,gBAAA,CAAiB,OAAA,EAAS,MAAM,QAAA,CAAS,GAAA,EAAK,QAAQ,CAAA,EAAG,EAAE,IAAA,EAAM,IAAA,EAAM,CAAA;AAAA,EAChF,CAAA;AAEA,EAAA,MAAM,UAAA,GAAa,CAAC,MAAA,KAAoC;AACtD,IAAA,KAAA,MAAW,KAAA,IAAS,QAAQ,QAAA,CAAS,GAAA,CAAI,OAAO,SAAA,CAAU,KAAK,IAAI,CAAC,CAAA;AACpE,IAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,MAAA,KAAA,MAAW,GAAA,IAAO,eAAe,GAAA,CAAI,KAAK,KAAK,EAAC,WAAY,GAAG,CAAA;AAAA,IACjE;AAAA,EACF,CAAA;AAEA,EAAA,MAAM,QAAQ,MAAqB;AACjC,IAAA,IAAI,SAAA,GAAY,CAAA;AAChB,IAAA,KAAA,MAAW,SAAS,OAAA,CAAQ,MAAA,EAAO,EAAG,SAAA,IAAa,MAAM,SAAA,CAAU,IAAA;AACnE,IAAA,OAAO,EAAE,OAAA,EAAS,MAAA,CAAO,IAAA,EAAM,KAAA,EAAO,SAAS,OAAA,CAAQ,IAAA,EAAM,SAAA,EAAW,GAAG,MAAA,EAAO;AAAA,EACpF,CAAA;AAEA,EAAA,MAAM,OAAO,MAAY;AACvB,IAAA,IAAI,UAAA,KAAe,MAAA,EAAW,YAAA,CAAa,UAAU,CAAA;AACrD,IAAA,UAAA,GAAa,MAAA;AACb,IAAA,KAAA,MAAW,KAAA,IAAS,OAAA,CAAQ,MAAA,EAAO,EAAG,IAAI,MAAM,KAAA,KAAU,MAAA,EAAW,YAAA,CAAa,KAAA,CAAM,KAAK,CAAA;AAAA,EAC/F,CAAA;AAEA,EAAA,OAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,UAAA,EAAY,OAAO,IAAA,EAAK;AACjD,CAAA;ACvSO,IAAM,gBAAA,GAAmB,CAAC,GAAA,EAAY,OAAA,KAA4C;AACvF,EAAA,MAAM,MAAA,GAAS,QAAQ,QAAQ,CAAA;AAC/B,EAAA,IAAI,OAAO,MAAA,KAAW,QAAA,IAAY,MAAA,KAAW,IAAI,OAAO,GAAA;AACxD,EAAA,MAAM,GAAA,GAAsB,OAAA,CAAQ,SAAS,CAAA,KAAM,SAAS,MAAA,GAAS,KAAA;AASrE,EAAA,MAAM,WAAA,GAAA,CAAe,GAAA,CAAI,IAAA,IAAQ,EAAC,EAAG,OAAO,CAAC,KAAA,KAAU,KAAA,CAAM,KAAA,KAAU,MAAM,CAAA;AAC7E,EAAA,OAAO,EAAE,GAAG,GAAA,EAAK,IAAA,EAAM,CAAC,EAAE,KAAA,EAAO,MAAA,EAAQ,GAAA,EAAI,EAAG,GAAG,WAAW,CAAA,EAAE;AAClE,CAAA;AAeA,IAAM,yBAAA,GAA4B,CAAA;AAClC,IAAM,aAAA,GAAgB,GAAA;AACtB,IAAM,iBAAA,GAAoB,GAAA;AAC1B,IAAM,4BAAA,GAA+B,GAAA;AACrC,IAAM,4BAAA,GAA+B,GAAA;AACrC,IAAM,6BAAA,GAAgC,EAAA;AAM/B,IAAM,iBAAA,GAAoB,CAAC,YAAA,KAAiD;AACjF,EAAA,MAAM,EAAE,SAAS,KAAA,EAAO,WAAA,EAAa,aAAa,UAAA,EAAY,KAAA,EAAO,WAAU,GAAI,YAAA;AACnF,EAAA,MAAM,IAAA,GAAO,YAAA,CAAa,OAAA,KAAY,MAAM;AAAA,EAAC,CAAA,CAAA;AAC7C,EAAA,MAAM,eAAA,GAAkB,YAAA,CAAa,MAAA,EAAQ,eAAA,IAAmB,yBAAA;AAChE,EAAA,MAAM,YAAA,GAAe,YAAA,CAAa,MAAA,EAAQ,YAAA,IAAgB,aAAA;AAC1D,EAAA,MAAM,QAAA,GAAW,YAAA,CAAa,MAAA,EAAQ,QAAA,IAAY,iBAAA;AAClD,EAAA,MAAM,uBAAA,GAA0B,YAAA,CAAa,MAAA,EAAQ,uBAAA,IAA2B,IAAA;AAChF,EAAA,MAAM,oBAAA,GAAuB,YAAA,CAAa,MAAA,EAAQ,oBAAA,IAAwB,IAAA;AAC1E,EAAA,MAAM,sBAAA,GAAyB,YAAA,CAAa,MAAA,EAAQ,sBAAA,IAA0B,KAAA;AAC9E,EAAA,MAAM,kBAAA,GAAqB,YAAA,CAAa,MAAA,EAAQ,kBAAA,IAAsB,4BAAA;AAEtE,EAAA,MAAM,cAAA,GAAiC;AAAA,IACrC,eAAA;AAAA,IACA,uBAAA;AAAA,IACA,oBAAA;AAAA,IACA;AAAA,GACF;AAIA,EAAA,MAAM,IAAA,GAAO,cAAA,CAAe,YAAA,CAAa,IAAA,EAAM,IAAI,CAAA;AAEnD,EAAA,IAAI,YAAA;AACJ,EAAA,IAAI,iBAAA;AACJ,EAAA,MAAM,KAAA,GAAsB,YAAA,CAAa,KAAA,IAAS,iBAAA,EAAkB;AAepE,EAAA,MAAM,YAAA,uBAAmB,GAAA,EAAyB;AAClD,EAAA,MAAM,mBAAA,GAAsB,YAAA,CAAa,MAAA,EAAQ,mBAAA,IAAuB,6BAAA;AAExE,EAAA,MAAM,WAAA,GAAc,CAAC,WAAA,EAAiC,SAAA,EAAmB,QAAA,KAA6B;AACpG,IAAA,IAAI,WAAA,KAAgB,MAAA,IAAa,SAAA,KAAc,EAAA,EAAI;AACnD,IAAA,IAAI,IAAA,GAAO,YAAA,CAAa,GAAA,CAAI,WAAW,CAAA;AACvC,IAAA,IAAI,SAAS,MAAA,EAAW;AACtB,MAAA,IAAA,uBAAW,GAAA,EAAY;AACvB,MAAA,YAAA,CAAa,GAAA,CAAI,aAAa,IAAI,CAAA;AAAA,IACpC;AACA,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,SAAS,CAAA,EAAG;AACzB,IAAA,IAAA,CAAK,IAAI,SAAS,CAAA;AAClB,IAAA,IAAI,IAAA,CAAK,OAAO,mBAAA,EAAqB;AACnC,MAAA,QAAA,CAAS,IAAA;AAAA,QACP,IAAI,WAAW,CAAA,mBAAA,EAAsB,IAAA,CAAK,IAAI,8CAA8C,mBAAmB,CAAA,oHAAA;AAAA,OACjH;AAAA,IACF;AAAA,EACF,CAAA;AAMA,EAAA,MAAM,QAAA,uBAAe,GAAA,EAA4B;AAIjD,EAAA,MAAM,aAAa,YAAqC;AACtD,IAAA,MAAM,OAAA,GAAU,YAAA,CAAa,MAAA,EAAQ,QAAA,KAAa,MAAA,GAC9C,EAAE,QAAA,EAAU,YAAA,CAAa,MAAA,CAAO,QAAA,EAAS,GACzC,MAAA;AACJ,IAAA,MAAM,MAAA,GAAS,MAAM,OAAA,CAAQ,UAAA,CAAW,OAAO,CAAA;AAG/C,IAAA,MAAM,SAAA,GAAY,YAAA,CAAa,MAAA,EAAQ,kBAAA,IAAsB,4BAAA;AAC7D,IAAA,IAAI,OAAA,CAAQ,UAAA,KAAe,MAAA,IAAc,MAAM,OAAA,CAAQ,WAAW,SAAS,CAAA,KAAO,YAAA,IAAgB,SAAA,GAAY,CAAA,EAAG;AAC/G,MAAA,OAAA,CAAQ,IAAA,CAAK,CAAA,6EAAA,EAAgF,SAAS,CAAA,2DAAA,CAA6D,CAAA;AAAA,IACrK;AAIA,IAAA,IAAI,cAAc,MAAA,EAAW;AAC3B,MAAA,MAAM,OAAA,GAAU,eAAA,CAAgB,SAAS,CAAA,CAAE,MAAA,CAAO,CAAC,EAAE,MAAA,EAAQ,KAAA,EAAM,KAAM,CAAC,MAAA,CAAO,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAA,IAAU,CAAA,CAAE,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,KAAK,CAAC,CAAC,CAAA;AAClK,MAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtB,QAAA,MAAM,IAAI,QAAA,CAAS,iBAAA,EAAmB,0DAA0D,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAG,EAAE,MAAM,CAAA,CAAA,EAAI,EAAE,KAAK,CAAA,CAAE,EAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,MAC5J;AAAA,IACF;AACA,IAAA,YAAA,GAAe,MAAA;AACf,IAAA,iBAAA,GAAoB,yBAAyB,MAAM,CAAA;AACnD,IAAA,OAAO,MAAA;AAAA,EACT,CAAA;AAIA,EAAA,MAAM,eAAe,MAAsB;AACzC,IAAA,IAAI,iBAAiB,MAAA,EAAW;AAC9B,MAAA,MAAM,IAAI,QAAA;AAAA,QACR,iBAAA;AAAA,QACA;AAAA,OACF;AAAA,IACF;AACA,IAAA,OAAO,YAAA;AAAA,EACT,CAAA;AAQA,EAAA,MAAM,WAAA,GAAc,CAAC,GAAA,EAAY,cAAA,KAAiD;AAChF,IAAA,MAAM,SAAS,YAAA,EAAa;AAG5B,IAAA,IAAI,YAAA,GAAe,GAAA;AACnB,IAAA,IAAI,YAAA,CAAa,UAAU,MAAA,EAAW;AACpC,MAAA,YAAA,GAAe,EAAE,GAAG,YAAA,EAAc,KAAA,EAAO,YAAA,EAAa;AAAA,IACxD,CAAA,MAAA,IAAW,YAAA,CAAa,KAAA,GAAQ,QAAA,EAAU;AACxC,MAAA,YAAA,GAAe,EAAE,GAAG,YAAA,EAAc,KAAA,EAAO,QAAA,EAAS;AAAA,IACpD;AAGA,IAAA,MAAM,QAAA,GAAW,iBAAiB,YAAY,CAAA;AAU9C,IAAA,MAAM,eAAe,cAAA,IAAkB,WAAA;AACvC,IAAA,IAAI,YAAA,KAAiB,MAAA,EAAW,UAAA,CAAW,QAAA,EAAU,YAAY,CAAA;AAGjE,IAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,YAAA,EAAc,MAAM,CAAA;AAC7C,IAAA,IAAI,YAAA,KAAiB,MAAA,EAAW,aAAA,CAAc,QAAA,EAAU,YAAY,CAAA;AAGpE,IAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,QAAA,EAAU,cAAc,CAAA;AACjD,IAAA,IAAI,QAAA,CAAS,MAAA,CAAO,MAAA,GAAS,CAAA,EAAG;AAC9B,MAAA,MAAM,IAAI,QAAA;AAAA,QACR,aAAA;AAAA,QACA,CAAA,iBAAA,EAAoB,QAAA,CAAS,MAAA,CAAO,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA;AAAA,QAC9C,EAAE,MAAA,EAAQ,QAAA,CAAS,MAAA,EAAQ,QAAA,EAAU,SAAS,QAAA;AAAS,OACzD;AAAA,IACF;AAGA,IAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,OAAA,CAAQ,QAAQ,CAAA;AAEzC,IAAA,OAAO,EAAE,QAAA,EAAU,QAAA,EAAU,QAAA,CAAS,QAAA,EAAS;AAAA,EACjD,CAAA;AAQA,EAAA,MAAMC,QAAAA,GAAU,CAAC,GAAA,KACf,WAAA,CAAY,cAAc,GAAA,EAAK,KAAK,CAAC,CAAA,CAAE,QAAA;AAIzC,EAAA,MAAM,IAAA,GAAO,OAAO,GAAA,EAAY,WAAA,KAAmD;AACjF,IAAA,IAAI;AAEF,MAAA,MAAM,OAAA,GAAiB,EAAE,GAAG,aAAA,CAAc,KAAK,KAAK,CAAA,EAAG,OAAO,CAAA,EAAE;AAChE,MAAA,MAAM,EAAE,QAAA,EAAU,QAAA,EAAS,GAAI,YAAY,OAAO,CAAA;AAGlD,MAAA,MAAM,gBAAA,GAAmB,sBAAA,CAAuB,QAAA,CAAS,eAAe,CAAA;AAGxE,MAAA,MAAM,KAAA,GAAqB,eAAe,EAAC;AAC3C,MAAA,YAAA,CAAa,UAAU,KAAK,CAAA;AAE5B,MAAA,MAAM,OAAO,MAAM,YAAA,CAAa,UAAU,gBAAA,EAAkB,KAAA,EAAO,SAAS,KAAK,CAAA;AAEjF,MAAA,OAAO,EAAE,IAAA,EAAM,QAAA,EAAU,MAAA,EAAQ,EAAC,EAAE;AAAA,IACtC,SAAS,GAAA,EAAK;AACZ,MAAA,MAAM,UAAU,GAAA,YAAe,KAAA,GAAQ,GAAA,CAAI,OAAA,GAAU,OAAO,GAAG,CAAA;AAC/D,MAAA,OAAO,EAAE,IAAA,EAAM,EAAC,EAAG,QAAA,EAAU,EAAC,EAAG,MAAA,EAAQ,CAAC,OAAO,CAAA,EAAE;AAAA,IACrD;AAAA,EACF,CAAA;AAsBA,EAAA,MAAM,YAAA,GAAe,CAAC,KAAA,EAAmB,GAAA,KAAyB;AAChE,IAAA,IAAI,YAAA,CAAa,KAAA,EAAO,iBAAiB,CAAA,EAAG,OAAO,IAAA;AACnD,IAAA,KAAK,KAAA,CAAM,OAAO,GAAG,CAAA;AACrB,IAAA,OAAO,KAAA;AAAA,EACT,CAAA;AAKA,EAAA,MAAM,KAAA,GAAQ,CAAC,GAAA,EAAa,KAAA,KAA4B;AACtD,IAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,IAAA,IAAI,UAAA,CAAW,KAAA,EAAO,GAAG,CAAA,gBAAiB,KAAA,CAAM,GAAA,CAAI,GAAA,EAAK,EAAE,GAAG,KAAA,EAAO,UAAA,EAAY,GAAA,EAAK,CAAC,CAAA;AAAA,EACzF,CAAA;AAEA,EAAA,MAAM,kBAAA,GAAqB,OACzB,YAAA,EACA,UAAA,EACA,WAAA,KACwB;AACxB,IAAA,MAAM,KAAK,YAAA,CAAa,WAAA;AACxB,IAAA,IAAI,OAAO,MAAA,EAAW;AAEpB,MAAA,OAAO,EAAE,WAAA,EAAa,eAAA,IAAmB,GAAA,EAAK,KAAA,EAAO,UAAU,KAAA,EAAM;AAAA,IACvE;AAEA,IAAA,MAAM,KAAA,GAAQ,MAAM,KAAA,CAAM,GAAA,CAAI,EAAE,CAAA;AAChC,IAAA,IAAI,KAAA,EAAO,SAAS,UAAA,EAAY;AAC9B,MAAA,MAAM,IAAI,QAAA;AAAA,QACR,iBAAA;AAAA,QACA,gBAAgB,EAAE,CAAA,qGAAA;AAAA,OACpB;AAAA,IACF;AACA,IAAA,IAAI,OAAO,IAAA,KAAS,IAAA,IAAQ,YAAA,CAAa,KAAA,EAAO,EAAE,CAAA,EAAG;AACnD,MAAA,IAAI,CAAC,UAAA,IAAc,KAAA,CAAM,WAAA,KAAgB,WAAA,EAAa;AACpD,QAAA,KAAA,CAAM,IAAI,KAAK,CAAA;AACf,QAAA,OAAO;AAAA,UACL,WAAA,EAAa,EAAA;AAAA,UACb,KAAK,KAAA,CAAM,GAAA;AAAA,UACX,GAAI,MAAM,OAAA,KAAY,MAAA,GAAY,EAAE,QAAA,EAAU,KAAA,CAAM,OAAA,EAAQ,GAAI,EAAC;AAAA,UACjE,GAAI,MAAM,MAAA,KAAW,MAAA,GAAY,EAAE,MAAA,EAAQ,KAAA,CAAM,MAAA,EAAO,GAAI,EAAC;AAAA,UAC7D,GAAI,MAAM,KAAA,KAAU,MAAA,GAAY,EAAE,KAAA,EAAO,KAAA,CAAM,KAAA,EAAM,GAAI,EAAC;AAAA,UAC1D,GAAI,MAAM,OAAA,KAAY,MAAA,GAAY,EAAE,OAAA,EAAS,KAAA,CAAM,OAAA,EAAQ,GAAI,EAAC;AAAA,UAChE,GAAA,EAAK,IAAA;AAAA,UACL,QAAA,EAAU;AAAA,SACZ;AAAA,MACF;AACA,MAAA,IAAI,KAAA,CAAM,cAAc,IAAA,EAAM;AAC5B,QAAA,MAAM,IAAI,QAAA;AAAA,UACR,uBAAA;AAAA,UACA,gBAAgB,EAAE,CAAA,0HAAA;AAAA,SACpB;AAAA,MACF;AAEA,MAAA,OAAO,EAAE,WAAA,EAAa,EAAA,EAAI,GAAA,EAAK,KAAA,EAAO,UAAU,IAAA,EAAK;AAAA,IACvD;AAEA,IAAA,IAAI,CAAC,UAAA,EAAY;AACf,MAAA,MAAM,IAAI,QAAA,CAAS,YAAA,EAAc,CAAA,qBAAA,EAAwB,EAAE,CAAA,gDAAA,CAA6C,CAAA;AAAA,IAC1G;AACA,IAAA,OAAO,EAAE,WAAA,EAAa,EAAA,EAAI,GAAA,EAAK,KAAA,EAAO,UAAU,KAAA,EAAM;AAAA,EACxD,CAAA;AAUA,EAAA,MAAM,QAAA,GAAW,CAAC,MAAA,EAAiC,KAAA,EAAoB,MAAA,MAAiD;AAAA,IACtH,UAAU,aAAA,CAAc,SAAA,IAAa,EAAC,EAAG,QAAQ,KAAK,CAAA;AAAA,IACtD,IAAA,EAAM,OAAO,GAAA,KAAQ;AACnB,MAAA,MAAM,EAAE,UAAU,QAAA,EAAS,GAAI,YAAY,aAAA,CAAc,GAAA,EAAK,KAAK,CAAA,EAAG,MAAM,CAAA;AAC5E,MAAA,YAAA,CAAa,UAAU,KAAK,CAAA;AAC5B,MAAA,IAAI,QAAA,CAAS,WAAW,IAAA,CAAK,CAAC,SAAS,IAAA,CAAK,IAAA,KAAS,UAAU,CAAA,EAAG;AAChE,QAAA,OAAO,EAAE,IAAA,EAAM,EAAC,EAAG,GAAA,EAAK,QAAA,CAAS,GAAA,EAAK,QAAA,EAAU,CAAC,GAAG,QAAA,EAAU,gFAA2E,CAAA,EAAE;AAAA,MAC7I;AAMA,MAAA,MAAM,MAAA,GAAS,QAAA,CAAS,UAAA,CAAW,GAAA,CAAI,CAAC,IAAA,KAAU,IAAA,CAAK,IAAA,KAAS,OAAA,GAAU,KAAA,CAAM,IAAA,CAAK,GAAG,IAAI,IAAK,CAAA;AACjG,MAAA,OAAO,EAAE,IAAA,EAAM,MAAM,OAAA,CAAQ,OAAA,CAAQ,QAAA,EAAU,MAAM,CAAA,EAAG,GAAA,EAAK,QAAA,CAAS,GAAA,EAAK,QAAA,EAAS;AAAA,IACtF;AAAA,GACF,CAAA;AAEA,EAAA,MAAM,qBAAqB,OACzB,YAAA,EACA,WACA,MAAA,EACA,QAAA,EACA,QACA,KAAA,KACmB;AACnB,IAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,MAAA,MAAM,IAAI,QAAA,CAAS,cAAA,EAAgB,kEAAkE,CAAA;AAAA,IACvG;AAEA,IAAA,MAAM,aAAa,YAAA,EAAa;AAChC,IAAA,MAAM,WAAA,GAAc;AAAA,MAClB,GAAG,UAAA;AAAA,MACH,QAAA,EAAU,WAAW,QAAA,CAAS,MAAA;AAAA,QAC5B,CAAC,CAAA,KAAA,CAAO,QAAA,KAAa,MAAA,IAAa,SAAS,QAAA,CAAS,CAAA,CAAE,IAAI,CAAA,MAAO,MAAA,KAAW,MAAA,IAAa,YAAA,CAAa,MAAA,EAAQ,EAAE,IAAI,CAAA;AAAA;AACtH,KACF;AAEA,IAAA,MAAM,WAAW,YAA4B;AAC3C,MAAA,IAAI;AACF,QAAA,OAAO,MAAM,WAAA,CAAY,YAAA,EAAc,WAAA,EAAa,SAAS,MAAA,EAAQ,KAAA,EAAO,WAAA,CAAY,QAAA,CAAS,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAC,CAAA;AAAA,MACtH,SAAS,GAAA,EAAK;AAGZ,QAAA,IAAI,GAAA,YAAe,QAAA,IAAY,GAAA,CAAI,IAAA,KAAS,eAAA,EAAiB;AAC3D,UAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,UAAA,MAAM,KAAA,CAAM,IAAI,MAAA,EAAQ;AAAA,YACtB,IAAA,EAAM,eAAA;AAAA,YACN,QAAQ,GAAA,CAAI,OAAA;AAAA,YACZ,SAAA,EAAW,GAAA;AAAA,YACX,WAAW,GAAA,GAAM,kBAAA;AAAA,YACjB,GAAI,aAAa,MAAA,KAAW,MAAA,GAAY,EAAE,MAAA,EAAQ,YAAA,CAAa,MAAA,EAAO,GAAI,EAAC;AAAA,YAC3E,OAAO,YAAA,CAAa,KAAA;AAAA,YACpB,GAAI,iBAAA,KAAsB,MAAA,GAAY,EAAE,iBAAA,EAAmB,iBAAA,KAAsB;AAAC,WACnF,CAAA;AAAA,QACH;AACA,QAAA,MAAM,GAAA;AAAA,MACR;AAAA,IACF,CAAA;AAQA,IAAA,MAAM,QAAA,GAAW,QAAA,CAAS,GAAA,CAAI,SAAS,CAAA;AACvC,IAAA,IAAI,QAAA,KAAa,QAAW,OAAO,QAAA;AAEnC,IAAA,MAAM,aAAa,QAAA,EAAS;AAC5B,IAAA,QAAA,CAAS,GAAA,CAAI,WAAW,UAAU,CAAA;AAClC,IAAA,IAAI;AACF,MAAA,OAAO,MAAM,UAAA;AAAA,IACf,CAAA,SAAE;AACA,MAAA,QAAA,CAAS,OAAO,SAAS,CAAA;AAAA,IAC3B;AAAA,EACF,CAAA;AA4BA,EAAA,MAAM,UAAU,CACd,IAAA,EACA,KAAA,EACA,EAAA,EACA,SACA,KAAA,KACc;AACd,IAAA,MAAM,MAAA,GAAS,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA;AACnC,IAAA,MAAM,MAAA,GAAS;AAAA,MACb,MAAA,EAAQ,MAAA,GAAU,IAAA,CAAK,CAAC,KAAK,IAAA,GAAQ,IAAA;AAAA,MACrC,OAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,OAAOC,OAAA,CAAa,IAAI,MAAM,CAAA;AAAA,EAChC,CAAA;AAEA,EAAA,MAAM,gBAAgB,OACpB,QAAA,EACA,YAAA,EACA,QAAA,EACA,SACA,KAAA,KACuB;AACvB,IAAA,MAAM,SAAA,GAAY,KAAK,GAAA,EAAI;AAC3B,IAAA,MAAM,OAAO,MAAM,YAAA,CAAa,UAAU,OAAA,EAAS,KAAA,EAAO,SAAS,KAAK,CAAA;AACxE,IAAA,MAAM,WAAA,GAAc,IAAA,CAAK,GAAA,EAAI,GAAI,SAAA;AACjC,IAAA,IAAA,CAAK,EAAE,IAAA,EAAM,YAAA,EAAc,OAAO,IAAA,CAAK,MAAA,EAAQ,aAAa,CAAA;AAG5D,IAAA,IAAI,MAAA,GAAoB,IAAA;AACxB,IAAA,IAAI,SAAA;AACJ,IAAA,IAAI,QAAA,GAAmC,QAAA;AAEvC,IAAA,IAAI,YAAA,CAAa,UAAU,MAAA,EAAW;AACpC,MAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,QAAA,MAAM,QAAA,GAAW,KAAK,GAAA,EAAI;AAC1B,QAAA,MAAA,GAAS,QAAQ,IAAA,EAAM,YAAA,CAAa,KAAA,EAAO,QAAA,EAAU,SAAS,KAAK,CAAA;AACnE,QAAA,SAAA,GAAY,IAAA,CAAK,KAAI,GAAI,QAAA;AAAA,MAC3B,CAAA,MAAA,IAAW,eAAe,MAAA,EAAW;AACnC,QAAA,MAAM,QAAA,GAAW,KAAK,GAAA,EAAI;AAC1B,QAAA,MAAM,MAAA,GAAS,MAAM,UAAA,CAAW,IAAA,EAAM,aAAa,KAAK,CAAA;AACxD,QAAA,SAAA,GAAY,IAAA,CAAK,KAAI,GAAI,QAAA;AACzB,QAAA,MAAA,GAAS,MAAA,CAAO,WAAA;AAChB,QAAA,QAAA,GAAW,MAAA,CAAO,EAAA;AAAA,MACpB;AACA,MAAA,IAAI,cAAc,MAAA,EAAW,IAAA,CAAK,EAAE,IAAA,EAAM,cAAA,EAAgB,WAAW,CAAA;AAAA,IACvE;AAEA,IAAA,OAAO,EAAE,MAAA,EAAQ,WAAA,EAAa,SAAA,EAAW,QAAA,EAAS;AAAA,EACpD,CAAA;AAIA,EAAA,MAAMC,SAAA,GAAU,OACd,OAAA,EACA,OAAA,KAC2B;AAC3B,IAAA,IAAI,YAAA,CAAa,OAAO,CAAA,EAAG,MAAM,IAAI,SAAS,iBAAA,EAAmB,CAAA,iBAAA,EAAoB,YAAA,EAAc,CAAA,CAAE,CAAA;AACrG,IAAA,MAAM,MAAA,GAAS,kBAAA,CAAmB,SAAA,CAAU,OAAO,CAAA;AACnD,IAAA,IAAI,CAAC,OAAO,OAAA,EAAS;AACnB,MAAA,MAAM,IAAI,QAAA,CAAS,iBAAA,EAAmB,oBAAoB,MAAA,CAAO,KAAA,CAAM,OAAO,CAAA,CAAE,CAAA;AAAA,IAClF;AAEA,IAAA,MAAM,eAAe,MAAA,CAAO,IAAA;AAC5B,IAAA,MAAM,KAAA,GAAqB,OAAA,EAAS,KAAA,IAAS,EAAC;AAC9C,IAAA,MAAM,YAAA,GAAe,SAAS,WAAA,IAAe,WAAA;AAC7C,IAAA,MAAM,EAAA,GAAK,KAAK,GAAA,EAAI;AAEpB,IAAA,MAAM,UAAA,GAAa,YAAA,CAAa,KAAA,KAAU,MAAA,IAAa,aAAa,KAAA,KAAU,IAAA;AAC9E,IAAA,IAAI,YAAA,CAAa,WAAA,KAAgB,MAAA,IAAa,CAAC,UAAA,EAAY;AACzD,MAAA,MAAM,IAAI,QAAA,CAAS,iBAAA,EAAmB,uFAAkF,CAAA;AAAA,IAC1H;AACA,IAAA,MAAM,WAAA,GAAc,UAAA,GAAa,kBAAA,CAAmB,YAAY,CAAA,GAAI,MAAA;AACpE,IAAA,MAAM,SAAA,GAAY,gBAAgB,MAAA,GAAY,CAAA,EAAG,WAAW,CAAA,CAAA,EAAI,gBAAA,CAAiB,YAAY,CAAC,CAAA,CAAA,GAAK,MAAA;AACnG,IAAA,MAAM,MAAA,GAAS,SAAA,KAAc,MAAA,GAAY,CAAA,IAAA,EAAO,SAAS,CAAA,CAAA,GAAK,MAAA;AAC9D,IAAA,IAAA,CAAK;AAAA,MACH,IAAA,EAAM,aAAA;AAAA,MACN,QAAQ,YAAA,CAAa,MAAA;AAAA,MACrB,OAAO,YAAA,CAAa,KAAA;AAAA,MACpB,aAAa,YAAA,CAAa,WAAA;AAAA,MAC1B,UAAU,OAAA,EAAS;AAAA,KACpB,CAAA;AAGD,IAAA,MAAM,MAAA,GAAS,MAAM,kBAAA,CAAmB,YAAA,EAAc,YAAY,WAAW,CAAA;AAC7E,IAAA,IAAA,CAAK,EAAE,IAAA,EAAM,aAAA,EAAe,GAAA,EAAK,MAAA,CAAO,GAAA,EAAK,WAAA,EAAa,MAAA,CAAO,WAAA,EAAa,QAAA,EAAU,MAAA,CAAO,QAAA,EAAU,CAAA;AAGzG,IAAA,IAAI,MAAM,MAAA,CAAO,GAAA;AACjB,IAAA,IAAI,OAAA;AACJ,IAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,MAAA,IAAI,OAAA,EAAS,WAAW,IAAA,EAAM;AAC5B,QAAA,MAAM,IAAI,QAAA,CAAS,QAAA,EAAU,2FAAsF,CAAA;AAAA,MACrH;AACA,MAAA,IAAI,SAAA,KAAc,MAAA,IAAa,MAAA,KAAW,MAAA,EAAW;AACnD,QAAA,MAAM,IAAI,QAAA,CAAS,iBAAA,EAAmB,kCAAkC,CAAA;AAAA,MAC1E;AACA,MAAA,MAAM,QAAA,GAAW,MAAM,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AACvC,MAAA,IAAI,UAAU,IAAA,KAAS,eAAA,IAAmB,YAAA,CAAa,QAAA,EAAU,MAAM,CAAA,EAAG;AACxE,QAAA,IAAA,CAAK,EAAE,MAAM,aAAA,EAAe,IAAA,EAAM,iBAAiB,OAAA,EAAS,QAAA,CAAS,QAAQ,CAAA;AAC7E,QAAA,MAAM,IAAI,QAAA,CAAS,eAAA,EAAiB,QAAA,CAAS,MAAM,CAAA;AAAA,MACrD;AACA,MAAA,MAAM,UAAA,GAAa,KAAK,GAAA,EAAI;AAC5B,MAAA,GAAA,GAAM,MAAM,mBAAmB,YAAA,EAAc,SAAA,EAAW,QAAQ,OAAA,EAAS,QAAA,EAAU,cAAc,KAAK,CAAA;AACtG,MAAA,OAAA,GAAU,IAAA,CAAK,KAAI,GAAI,UAAA;AACvB,MAAA,IAAA,CAAK,EAAE,IAAA,EAAM,WAAA,EAAa,GAAA,EAAK,SAAS,CAAA;AAAA,IAC1C;AAQA,IAAA,MAAM,QAAA,GAAW,UAAA,CAAW,YAAA,CAAa,OAAO,CAAA;AAChD,IAAA,MAAM,SAAS,aAAA,CAAc,gBAAA,CAAiB,KAAK,YAAA,CAAa,OAAO,GAAG,QAAQ,CAAA;AAClF,IAAA,MAAM,EAAE,QAAA,EAAU,QAAA,EAAS,GAAI,WAAA,CAAY,QAAQ,YAAY,CAAA;AAC/D,IAAA,WAAA,CAAY,OAAO,WAAA,EAAa,iBAAA,CAAkB,GAAA,EAAK,QAAQ,GAAG,QAAQ,CAAA;AAC1E,IAAA,IAAA,CAAK,EAAE,IAAA,EAAM,WAAA,EAAa,KAAK,QAAA,CAAS,GAAA,EAAK,UAAU,CAAA;AAIvD,IAAA,YAAA,CAAa,UAAU,KAAK,CAAA;AAC5B,IAAA,MAAM,UAAU,YAAA,CAAa,OAAA;AAC7B,IAAA,MAAM,WAAA,GAAc,kBAAA,CAAmB,QAAA,EAAU,OAAO,CAAA;AAExD,IAAA,IAAI,WAAA,CAAY,SAAS,CAAA,EAAG;AAC1B,MAAA,OAAO;AAAA,QACL,QAAQ,EAAC;AAAA,QACT,IAAA,EAAM;AAAA,UACJ,KAAA,EAAO;AAAA,YACL,KAAK,MAAA,CAAO,GAAA;AAAA,YACZ,aAAa,MAAA,CAAO,WAAA;AAAA,YACpB,MAAA,EAAQ,MAAA,CAAO,MAAA,IAAU,YAAA,CAAa,MAAA;AAAA,YACtC,GAAI,MAAA,CAAO,QAAA,GAAW,EAAE,QAAA,EAAU,IAAA,KAAS;AAAC,WAC9C;AAAA,UACA,OAAA,EAAS,oBAAA,CAAqB,QAAA,EAAU,cAAA,CAAe,GAAG,CAAC,CAAA;AAAA,UAC3D,QAAA,EAAU,QAAA,CAAS,MAAA,GAAS,CAAA,GAAI,QAAA,GAAW,MAAA;AAAA,UAC3C,cAAA,EAAgB;AAAA;AAClB,OACF;AAAA,IACF;AAIA,IAAA,MAAM,gBAAA,GAAmB,aAAa,YAAA,GAAe,EAAE,GAAG,YAAA,EAAc,KAAA,EAAO,OAAO,KAAA,EAAM;AAM5F,IAAA,MAAM,aAAa,MAAA,CAAO,QAAA;AAC1B,IAAA,IAAI,MAAA,CAAO,OAAO,MAAA,CAAO,OAAA,KAAY,eAAe,gBAAA,CAAiB,KAAA,KAAU,MAAA,IAAa,UAAA,KAAe,MAAA,CAAA,EAAY;AACrH,MAAA,MAAM,QAAQ,gBAAA,CAAiB,KAAA;AAC/B,MAAA,MAAM,SAAA,GAAY,CAACC,KAAAA,KACjB,KAAA,KAAU,MAAA,IAAa,UAAA,KAAe,MAAA,GAAaA,KAAAA,GAAgC,OAAA,CAAQA,KAAAA,EAAM,KAAA,EAAO,UAAA,EAAY,SAAS,KAAK,CAAA;AACpI,MAAA,MAAM,SAAS,MAAM,aAAA,CAAc,SAAS,UAAA,EAAY,OAAA,EAAS,OAAO,KAAK,CAAA;AAG7E,MAAA,MAAM,MAAM,aAAA,CAAc,CAAC,QAAA,CAAS,GAAA,EAAK,MAAM,CAAC,CAAA;AAChD,MAAA,MAAM,MAAA,GAAqB,EAAE,MAAA,EAAQ,CAAC,GAAG,gBAAA,CAAiB,MAAM,CAAC,CAAA,EAAG,OAAO,MAAM,OAAA,CAAQ,OAAA,CAAQ,QAAA,EAAU,MAAM,CAAA,EAAE;AACnH,MAAA,MAAM,SAAA,GAAY,KAAK,GAAA,EAAI;AAC3B,MAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,IAAA,CAAK,KAAK,MAAM,CAAA;AACxC,MAAA,MAAMC,YAAAA,GAAc,IAAA,CAAK,GAAA,EAAI,GAAI,SAAA;AACjC,MAAA,IAAA,CAAK,EAAE,MAAM,YAAA,EAAc,KAAA,EAAO,KAAK,MAAA,EAAQ,WAAA,EAAAA,cAAa,CAAA;AAC5D,MAAA,MAAMC,OAAAA,GAAS,UAAU,IAAI,CAAA;AAC7B,MAAA,MAAM,IAAA,GAAO;AAAA,QACX,KAAA,EAAO;AAAA,UACL,KAAK,MAAA,CAAO,GAAA;AAAA,UACZ,aAAa,MAAA,CAAO,WAAA;AAAA,UACpB,MAAA,EAAQ,MAAA,CAAO,MAAA,IAAU,YAAA,CAAa;AAAA,SACxC;AAAA,QACA,OAAA,EAAS,oBAAA,CAAqB,QAAA,EAAU,cAAA,CAAe,GAAG,CAAC,CAAA;AAAA,QAC3D,QAAA,EAAU,QAAA,CAAS,MAAA,GAAS,CAAA,GAAI,QAAA,GAAW;AAAA,OAC7C;AACA,MAAA,MAAM,EAAE,MAAA,EAAQ,QAAA,EAAS,GAAI,WAAW,EAAC;AACzC,MAAA,IAAI,MAAA,KAAW,MAAA,IAAa,QAAA,KAAa,MAAA,EAAW;AAClD,QAAA,IAAI,QAAA,GAAW,cAAcA,OAAM,CAAA;AACnC,QAAA,IAAA,CAAK,MAAA,CAAO,GAAA,EAAK,MAAA,EAAQ,IAAA,EAAM;AAAA,UAC7B,OAAA,EAAS,CAAC,IAAA,KAAS;AACjB,YAAA,MAAM,UAAA,GAAa,UAAU,IAAI,CAAA;AACjC,YAAA,MAAM,QAAA,GAAW,cAAc,UAAU,CAAA;AACzC,YAAA,IAAI,aAAa,QAAA,EAAU;AAC3B,YAAA,QAAA,GAAW,QAAA;AACX,YAAA,QAAA,CAAS,EAAE,MAAA,EAAQ,UAAA,EAAY,IAAA,EAAM,CAAA;AAAA,UACvC;AAAA,WACC,MAAM,CAAA;AAAA,MACX;AACA,MAAA,IAAA,CAAK,EAAE,MAAM,YAAA,EAAc,OAAA,EAAS,KAAK,GAAA,EAAI,GAAI,IAAI,CAAA;AACrD,MAAA,OAAO,EAAE,MAAA,EAAAA,OAAAA,EAAQ,IAAA,EAAM,EAAE,GAAG,IAAA,EAAM,MAAA,EAAQ,EAAE,WAAA,EAAAD,YAAAA,EAAY,EAAE,EAAE;AAAA,IAC9D;AACA,IAAA,MAAM,EAAE,MAAA,EAAQ,WAAA,EAAa,SAAA,EAAW,QAAA,KAAa,MAAM,aAAA;AAAA,MACzD,QAAA;AAAA,MAAU,gBAAA;AAAA,MAAkB,MAAA,CAAO,QAAA;AAAA,MAAU,OAAA;AAAA,MAAS;AAAA,KACxD;AAIA,IAAA,IAAI,CAAC,OAAO,GAAA,EAAK;AACf,MAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,MAAA,MAAM,KAAA,GAAsB;AAAA,QAC1B,IAAA,EAAM,IAAA;AAAA,QACN,GAAA;AAAA,QACA,GAAI,QAAA,KAAa,MAAA,GAAY,EAAE,OAAA,EAAS,QAAA,KAAa,EAAC;AAAA,QACtD,SAAA,EAAW,GAAA;AAAA,QACX,UAAA,EAAY,GAAA;AAAA,QACZ,GAAI,WAAA,KAAgB,MAAA,GAAY,EAAE,WAAA,KAAgB,EAAC;AAAA,QACnD,GAAI,aAAa,MAAA,KAAW,MAAA,GAAY,EAAE,MAAA,EAAQ,YAAA,CAAa,MAAA,EAAO,GAAI,EAAC;AAAA,QAC3E,OAAO,YAAA,CAAa,KAAA;AAAA,QACpB,GAAI,iBAAA,KAAsB,MAAA,GAAY,EAAE,iBAAA,EAAmB,iBAAA,KAAsB;AAAC,OACpF;AACA,MAAA,MAAM,KAAA,CAAM,GAAA,CAAI,MAAA,CAAO,WAAA,EAAa,KAAK,CAAA;AAAA,IAC3C;AAEA,IAAA,IAAA,CAAK,EAAE,MAAM,YAAA,EAAc,OAAA,EAAS,KAAK,GAAA,EAAI,GAAI,IAAI,CAAA;AAErD,IAAA,OAAO;AAAA,MACL,MAAA;AAAA,MACA,IAAA,EAAM;AAAA,QACJ,KAAA,EAAO;AAAA,UACL,KAAK,MAAA,CAAO,GAAA;AAAA,UACZ,aAAa,MAAA,CAAO,WAAA;AAAA,UACpB,MAAA,EAAQ,MAAA,CAAO,MAAA,IAAU,YAAA,CAAa,MAAA;AAAA,UACtC,GAAI,MAAA,CAAO,QAAA,GAAW,EAAE,QAAA,EAAU,IAAA,KAAS;AAAC,SAC9C;AAAA,QACA,OAAA,EAAS,oBAAA,CAAqB,QAAA,EAAU,cAAA,CAAe,GAAG,CAAC,CAAA;AAAA,QAC3D,MAAA,EAAQ;AAAA,UACN,GAAI,OAAA,KAAY,MAAA,GAAY,EAAE,OAAA,KAAY,EAAC;AAAA,UAC3C,WAAA;AAAA,UACA,GAAI,SAAA,KAAc,MAAA,GAAY,EAAE,SAAA,KAAc;AAAC,SACjD;AAAA,QACA,QAAA,EAAU,QAAA,CAAS,MAAA,GAAS,CAAA,GAAI,QAAA,GAAW;AAAA;AAC7C,KACF;AAAA,EACF,CAAA;AAIA,EAAA,MAAM,YAAA,GAAe,MACnB,CAAA,CAAE,YAAA,CAAa,WAAA,EAAa,EAAE,MAAA,EAAQ,SAAA,EAAW,MAAA,EAAQ,KAAA,EAAO,CAAA;AAIlE,EAAA,MAAM,YAAY,MAAkC,YAAA;AAEpD,EAAA,OAAO;AAAA,IACL,UAAA;AAAA,aACAF,SAAA;AAAA,IACA,OAAA,EAAAF,QAAAA;AAAA,IACA,IAAA;AAAA,IACA,YAAA;AAAA,IACA,SAAA;AAAA,IACA,KAAA;AAAA,IACA,YAAY,IAAA,CAAK,UAAA;AAAA,IACjB,MAAM,EAAE,KAAA,EAAO,KAAK,KAAA,EAAO,IAAA,EAAM,KAAK,IAAA;AAAK,GAC7C;AACF;;;AC/pBA,IAAM,aAAA,GAAgB,CAAC,MAAA,KAAmC;AACxD,EAAA,MAAM,KAAA,GAAQ,OAAO,WAAA,EAAY;AAGjC,EAAA,IACE,MAAM,UAAA,CAAW,SAAS,CAAA,IAC1B,KAAA,CAAM,WAAW,mBAAmB,CAAA,IACpC,KAAA,KAAU,MAAA,IACV,MAAM,UAAA,CAAW,MAAM,KACvB,KAAA,KAAU,MAAA,IACV,UAAU,QAAA,EACV;AACA,IAAA,OAAO,QAAA;AAAA,EACT;AAGA,EAAA,IACE,KAAA,KAAU,SAAA,IACV,KAAA,KAAU,KAAA,IACV,UAAU,QAAA,IACV,KAAA,KAAU,UAAA,IACV,KAAA,KAAU,YACV,KAAA,KAAU,WAAA,IACV,KAAA,KAAU,aAAA,IACV,UAAU,SAAA,IACV,KAAA,CAAM,UAAA,CAAW,SAAS,KAC1B,KAAA,KAAU,SAAA,IACV,KAAA,CAAM,UAAA,CAAW,SAAS,CAAA,IAC1B,KAAA,KAAU,MAAA,IACV,KAAA,KAAU,sBACV,KAAA,KAAU,OAAA,IACV,KAAA,CAAM,UAAA,CAAW,OAAO,CAAA,EACxB;AACA,IAAA,OAAO,QAAA;AAAA,EACT;AAGA,EAAA,IAAI,KAAA,KAAU,SAAA,IAAa,KAAA,KAAU,MAAA,EAAQ,OAAO,SAAA;AAGpD,EAAA,IAAI,KAAA,KAAU,QAAQ,OAAO,MAAA;AAG7B,EAAA,IAAI,KAAA,CAAM,UAAA,CAAW,WAAW,CAAA,EAAG,OAAO,WAAA;AAG1C,EAAA,IAAI,KAAA,KAAU,QAAQ,OAAO,MAAA;AAG7B,EAAA,IAAI,KAAA,KAAU,MAAA,IAAU,KAAA,KAAU,OAAA,EAAS,OAAO,MAAA;AAGlD,EAAA,IAAI,KAAA,KAAU,OAAA,IAAW,KAAA,CAAM,QAAA,CAAS,IAAI,KAAK,KAAA,CAAM,UAAA,CAAW,GAAG,CAAA,EAAG,OAAO,OAAA;AAG/E,EAAA,IAAI,UAAU,QAAA,IAAY,KAAA,CAAM,UAAA,CAAW,QAAQ,GAAG,OAAO,QAAA;AAE7D,EAAA,OAAO,SAAA;AACT,CAAA;AAEA,IAAM,uBAAA,GAA0B,CAAC,MAAA,KAAuC;AAEtE,EAAA,MAAM,KAAA,GAAQ,kBAAA,CAAmB,IAAA,CAAK,MAAM,CAAA;AAC5C,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,KAAA,CAAM,CAAC,MAAM,MAAA,EAAW;AAC5C,IAAA,OAAO,QAAA,CAAS,KAAA,CAAM,CAAC,CAAA,EAAG,EAAE,CAAA;AAAA,EAC9B;AACA,EAAA,OAAO,MAAA;AACT,CAAA;AAUA,IAAM,YAAA,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA;AAUrB,IAAM,aAAA,GAAgB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA;AAwDtB,IAAM,iBAAA,GAAoB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA;AAoB1B,IAAM,aAAA,GAAgB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA;AAkBtB,IAAM,gBAAA,GAAmB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA;AAYlB,IAAM,kBAAA,GAAqB,OAChC,IAAA,EACA,OAAA,KAC4B;AAC5B,EAAA,MAAM,UAAA,GAAa,SAAS,MAAA,IAAU,QAAA;AAGtC,EAAA,MAAM,CAAC,cAAc,aAAA,EAAe,UAAA,EAAY,eAAe,eAAe,CAAA,GAAI,MAAM,OAAA,CAAQ,GAAA,CAAI;AAAA,IAClG,IAAA,CAAK,KAAA,CAAM,YAAA,EAAc,CAAC,UAAU,CAAC,CAAA;AAAA,IACrC,IAAA,CAAK,KAAA,CAAM,aAAA,EAAe,CAAC,UAAU,CAAC,CAAA;AAAA,IACtC,IAAA,CAAK,KAAA,CAAM,iBAAA,EAAmB,CAAC,UAAU,CAAC,CAAA;AAAA,IAC1C,IAAA,CAAK,KAAA,CAAM,aAAA,EAAe,CAAC,UAAU,CAAC,CAAA;AAAA,IACtC,IAAA,CAAK,KAAA,CAAM,gBAAA,EAAkB,CAAC,UAAU,CAAC;AAAA,GAC1C,CAAA;AAWD,EAAA,MAAM,IAAA,GAAc,UAAA,CAAW,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,MAAS;AAAA,IAChD,IAAA,EAAM,IAAI,MAAM,CAAA;AAAA,IAChB,SAAA,EAAW,IAAI,YAAY,CAAA;AAAA,IAC3B,OAAA,EAAU,GAAA,CAAI,UAAU,CAAA,IAAuB,IAAA;AAAA,IAC/C,WAAA,EAAa,IAAI,cAAc,CAAA;AAAA,IAC/B,SAAA,EAAW,IAAI,YAAY;AAAA,GAC7B,CAAE,CAAA;AAGF,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAyB;AAK3C,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAwB;AAC/C,EAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,IAAA,IAAI,GAAA,CAAI,SAAS,GAAA,EAAK;AACtB,IAAA,IAAI,GAAA,CAAI,SAAS,GAAA,EAAK;AACpB,MAAA,IAAI,IAAA,GAAO,KAAA,CAAM,GAAA,CAAI,GAAA,CAAI,SAAS,CAAA;AAClC,MAAA,IAAI,SAAS,MAAA,EAAW;AACtB,QAAA,IAAA,uBAAW,GAAA,EAAI;AACf,QAAA,KAAA,CAAM,GAAA,CAAI,GAAA,CAAI,SAAA,EAAW,IAAI,CAAA;AAAA,MAC/B;AACA,MAAA,KAAA,MAAW,GAAA,IAAO,GAAA,CAAI,WAAA,EAAa,IAAA,CAAK,IAAI,GAAG,CAAA;AAAA,IACjD;AACA,IAAA,IAAI,IAAA,GAAO,UAAA,CAAW,GAAA,CAAI,GAAA,CAAI,SAAS,CAAA;AACvC,IAAA,IAAI,SAAS,MAAA,EAAW;AACtB,MAAA,IAAA,GAAO,EAAC;AACR,MAAA,UAAA,CAAW,GAAA,CAAI,GAAA,CAAI,SAAA,EAAW,IAAI,CAAA;AAAA,IACpC;AACA,IAAA,IAAA,CAAK,IAAA,CAAK,IAAI,WAAW,CAAA;AAAA,EAC3B;AAGA,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAoB;AAC5C,EAAA,KAAA,MAAW,GAAA,IAAO,gBAAgB,IAAA,EAAM;AACtC,IAAA,MAAM,KAAA,GAAQ,IAAI,YAAY,CAAA;AAC9B,IAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,GAAA,CAAI,WAAW,KAAK,CAAC,CAAA;AAC1C,IAAA,WAAA,CAAY,GAAA,CAAI,OAAO,KAAK,CAAA;AAAA,EAC9B;AAGA,EAAA,MAAM,cAAA,uBAAqB,GAAA,EAA2B;AACtD,EAAA,KAAA,MAAW,GAAA,IAAO,cAAc,IAAA,EAAM;AACpC,IAAA,MAAM,KAAA,GAAQ,IAAI,YAAY,CAAA;AAC9B,IAAA,MAAM,OAAA,GAAU,IAAI,aAAa,CAAA;AACjC,IAAA,MAAM,QAAA,GAAW,IAAI,gBAAgB,CAAA;AACrC,IAAA,MAAM,QAAA,GAAW,IAAI,WAAW,CAAA;AAChC,IAAA,MAAM,UAAA,GAAa,IAAI,aAAa,CAAA;AACpC,IAAA,MAAM,UAAA,GAAa,IAAI,gBAAgB,CAAA;AACvC,IAAA,MAAM,cAAA,GAAiB,IAAI,aAAa,CAAA;AAExC,IAAA,MAAM,QAAA,GAAW,KAAA,CAAM,GAAA,CAAI,KAAK,CAAA;AAChC,IAAA,MAAM,IAAA,GAAO,QAAA,KAAa,MAAA,IAAa,QAAA,CAAS,IAAI,OAAO,CAAA;AAE3D,IAAA,MAAM,EAAA,GAAK,aAAA,CAAc,QAAA,IAAY,QAAQ,CAAA;AAC7C,IAAA,MAAM,UAAU,EAAA,KAAO,QAAA,GAAW,uBAAA,CAAwB,QAAA,IAAY,QAAQ,CAAA,GAAI,MAAA;AAElF,IAAA,MAAM,KAAA,GAAqB;AAAA,MACzB,IAAA,EAAM,OAAA;AAAA,MACN,MAAM,QAAA,IAAY,QAAA;AAAA,MAClB,cAAA,EAAgB,EAAA;AAAA,MAChB,UAAU,UAAA,KAAe,KAAA;AAAA,MACzB,UAAA,EAAY,IAAA;AAAA,MACZ,GAAI,UAAA,KAAe,IAAA,GAAO,EAAE,YAAA,EAAc,UAAA,KAAe,EAAC;AAAA,MAC1D,GAAI,mBAAmB,IAAA,IAAQ,cAAA,KAAmB,KAAK,EAAE,WAAA,EAAa,cAAA,EAAe,GAAI,EAAC;AAAA,MAC1F,GAAI,OAAA,KAAY,MAAA,GAAY,EAAE,gBAAA,EAAkB,OAAA,KAAY;AAAC,KAC/D;AAEA,IAAA,IAAI,MAAA,GAAS,cAAA,CAAe,GAAA,CAAI,KAAK,CAAA;AACrC,IAAA,IAAI,WAAW,MAAA,EAAW;AACxB,MAAA,MAAA,GAAS,EAAC;AACV,MAAA,cAAA,CAAe,GAAA,CAAI,OAAO,MAAM,CAAA;AAAA,IAClC;AACA,IAAA,MAAA,CAAO,KAAK,KAAK,CAAA;AAAA,EACnB;AAKA,EAAA,MAAM,gBAAA,uBAAuB,GAAA,EAA8B;AAC3D,EAAA,MAAM,WAAA,GAAc,CAAC,KAAA,EAAe,QAAA,KAAmC;AACrE,IAAA,IAAI,IAAA,GAAO,gBAAA,CAAiB,GAAA,CAAI,KAAK,CAAA;AACrC,IAAA,IAAI,SAAS,MAAA,EAAW;AACtB,MAAA,IAAA,GAAO,EAAC;AACR,MAAA,gBAAA,CAAiB,GAAA,CAAI,OAAO,IAAI,CAAA;AAAA,IAClC;AACA,IAAA,IAAA,CAAK,KAAK,QAAQ,CAAA;AAAA,EACpB,CAAA;AAEA,EAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,IAAA,IAAI,GAAA,CAAI,IAAA,KAAS,GAAA,IAAO,GAAA,CAAI,YAAY,IAAA,EAAM;AAC9C,IAAA,MAAM,gBAAgB,GAAA,CAAI,SAAA,CAAU,OAAO,CAAC,GAAA,KAAuB,QAAQ,IAAI,CAAA;AAC/E,IAAA,IAAI,aAAA,CAAc,MAAA,KAAW,GAAA,CAAI,WAAA,CAAY,MAAA,EAAQ;AAErD,IAAA,MAAM,cAAc,UAAA,CAAW,GAAA,CAAI,IAAI,SAAS,CAAA,IAAK,EAAC,EAAG,IAAA;AAAA,MAAK,CAAC,GAAA,KAC7D,GAAA,CAAI,KAAA,CAAM,CAAC,QAAQ,GAAA,CAAI,WAAA,CAAY,QAAA,CAAS,GAAG,CAAC;AAAA,KAClD;AAGA,IAAA,WAAA,CAAY,IAAI,SAAA,EAAW;AAAA,MACzB,IAAA,EAAM,WAAA;AAAA,MACN,QAAQ,GAAA,CAAI,OAAA;AAAA,MACZ,aAAa,GAAA,CAAI,WAAA;AAAA,MACjB;AAAA,KACD,CAAA;AAGD,IAAA,WAAA,CAAY,IAAI,OAAA,EAAS;AAAA,MACvB,IAAA,EAAM,aAAa,QAAA,GAAW,SAAA;AAAA,MAC9B,QAAQ,GAAA,CAAI,SAAA;AAAA,MACZ,WAAA,EAAa,aAAA;AAAA,MACb,eAAe,GAAA,CAAI;AAAA,KACpB,CAAA;AAAA,EACH;AAGA,EAAA,MAAM,cAAA,uBAAqB,GAAA,EAA2B;AAEtD,EAAA,KAAA,MAAW,GAAA,IAAO,cAAc,IAAA,EAAM;AACpC,IAAA,MAAM,KAAA,GAAQ,IAAI,YAAY,CAAA;AAC9B,IAAA,MAAM,SAAA,GAAY,IAAI,YAAY,CAAA;AAClC,IAAA,MAAM,QAAA,GAAW,IAAI,WAAW,CAAA;AAChC,IAAA,MAAM,SAAA,GAAY,IAAI,YAAY,CAAA;AAClC,IAAA,MAAM,OAAA,GAAU,IAAI,SAAS,CAAA;AAE7B,IAAA,MAAM,UAAA,GAAa,aAAa,SAAS,CAAA;AAEzC,IAAA,MAAM,GAAA,GAAmB;AAAA,MACvB,IAAA,EAAM,SAAA;AAAA,MACN,MAAA,EAAQ,OAAA;AAAA,MACR,MAAA,EAAQ,QAAA;AAAA,MACR,IAAA,EAAM;AAAA,KACR;AAEA,IAAA,IAAI,OAAA,GAAU,cAAA,CAAe,GAAA,CAAI,KAAK,CAAA;AACtC,IAAA,IAAI,YAAY,MAAA,EAAW;AACzB,MAAA,OAAA,GAAU,EAAC;AACX,MAAA,cAAA,CAAe,GAAA,CAAI,OAAO,OAAO,CAAA;AAAA,IACnC;AACA,IAAA,OAAA,CAAQ,KAAK,GAAG,CAAA;AAAA,EAClB;AAGA,EAAA,MAAM,cAAA,GAAiB,YAAA,CAAa,IAAA,CAAK,MAAA,CAAO,CAAC,GAAA,KAAQ;AACvD,IAAA,MAAM,IAAA,GAAO,IAAI,YAAY,CAAA;AAC7B,IAAA,IAAI,OAAA,EAAS,aAAa,MAAA,IAAa,CAAC,QAAQ,QAAA,CAAS,QAAA,CAAS,IAAI,CAAA,EAAG,OAAO,KAAA;AAChF,IAAA,IAAI,OAAA,EAAS,YAAY,MAAA,IAAa,OAAA,CAAQ,QAAQ,QAAA,CAAS,IAAI,GAAG,OAAO,KAAA;AAC7E,IAAA,OAAO,IAAA;AAAA,EACT,CAAC,CAAA;AAED,EAAA,MAAM,QAAA,GAA2B,cAAA,CAAe,GAAA,CAAI,CAAC,GAAA,KAAQ;AAC3D,IAAA,MAAM,SAAA,GAAY,IAAI,YAAY,CAAA;AAClC,IAAA,MAAM,gBAAA,GAAmB,IAAI,aAAa,CAAA;AAC1C,IAAA,OAAO;AAAA,MACL,IAAA,EAAM,SAAA;AAAA,MACN,KAAA,EAAO,SAAA;AAAA,MACP,GAAI,qBAAqB,IAAA,IAAQ,gBAAA,KAAqB,KAAK,EAAE,WAAA,EAAa,gBAAA,EAAiB,GAAI,EAAC;AAAA,MAChG,MAAA,EAAQ,cAAA,CAAe,GAAA,CAAI,SAAS,KAAK,EAAC;AAAA,MAC1C,SAAA,EAAW,gBAAA,CAAiB,GAAA,CAAI,SAAS,KAAK,EAAC;AAAA,MAC/C,OAAA,EAAS,cAAA,CAAe,GAAA,CAAI,SAAS,KAAK,EAAC;AAAA,MAC3C,QAAA,EAAU,WAAA,CAAY,GAAA,CAAI,SAAS;AAAA,KACrC;AAAA,EACF,CAAC,CAAA;AAED,EAAA,OAAO,EAAE,QAAA,EAAS;AACpB,CAAA;AAMA,IAAM,YAAA,GAAe,CAAC,MAAA,KAAwC;AAC5D,EAAA,MAAM,KAAA,GAAQ,OAAO,WAAA,EAAY;AACjC,EAAA,IAAI,KAAA,KAAU,SAAS,OAAO,OAAA;AAC9B,EAAA,IAAI,KAAA,KAAU,QAAQ,OAAO,MAAA;AAC7B,EAAA,IAAI,KAAA,KAAU,OAAO,OAAO,KAAA;AAC5B,EAAA,IAAI,KAAA,KAAU,QAAQ,OAAO,MAAA;AAC7B,EAAA,IAAI,KAAA,KAAU,WAAW,OAAO,SAAA;AAChC,EAAA,IAAI,KAAA,KAAU,QAAQ,OAAO,MAAA;AAC7B,EAAA,OAAO,OAAA;AACT,CAAA;;;AC7aO,IAAM,YAAA,GAAe,CAAC,QAAA,KAA2C;AACtE,EAAA,MAAM,aAA0B,EAAC;AACjC,EAAA,MAAM,YAAA,GAAe,EAAE,KAAA,EAAO,CAAA,EAAE;AAEhC,EAAA,MAAM,GAAA,GAA0B;AAAA,IAC9B,aAAA,EAAe,QAAA,CAAS,MAAA,EAAQ,aAAA,wBAAqB,GAAA,EAAI;AAAA,IACzD,UAAU,QAAA,CAAS,QAAA;AAAA,IACnB,UAAA;AAAA,IACA,YAAA;AAAA,IACA,GAAI,SAAS,SAAA,KAAc,MAAA,GAAY,EAAE,SAAA,EAAW,QAAA,CAAS,SAAA,EAAU,GAAI;AAAC,GAC9E;AAEA,EAAA,MAAM,WAAqB,EAAC;AAG5B,EAAA,MAAM,cAAwB,EAAC;AAE/B,EAAA,IAAI,SAAS,QAAA,EAAU;AACrB,IAAA,WAAA,CAAY,KAAK,UAAU,CAAA;AAAA,EAC7B;AAGA,EAAA,MAAM,YAAA,GAAe,SAAS,MAAA,CAAO,GAAA;AAAA,IAAI,CAAC,CAAA,KACxC,CAAA,EAAG,CAAA,CAAE,KAAK,CAAA,CAAA,EAAI,CAAA,CAAE,MAAM,CAAA,IAAA,EAAO,UAAA,CAAW,CAAA,CAAE,UAAU,CAAC,CAAA;AAAA,GACvD;AAGA,EAAA,MAAM,cAAA,GAAiB,QAAA,CAAS,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,KAAM;AAClD,IAAA,MAAM,IAAA,GAAO,cAAA,CAAe,CAAA,CAAE,UAAA,EAAY,GAAG,CAAA;AAC7C,IAAA,OAAO,GAAG,IAAI,CAAA,IAAA,EAAO,UAAA,CAAW,CAAA,CAAE,IAAI,CAAC,CAAA,CAAA;AAAA,EACzC,CAAC,CAAA;AAGD,EAAA,MAAM,gBAAA,GAAmB,QAAA,CAAS,UAAA,CAAW,GAAA,CAAI,CAAC,CAAA,KAAM;AACtD,IAAA,MAAM,IAAA,GAAO,gBAAA,CAAiB,CAAA,CAAE,UAAA,EAAY,GAAG,CAAA;AAC/C,IAAA,OAAO,GAAG,IAAI,CAAA,IAAA,EAAO,UAAA,CAAW,CAAA,CAAE,IAAI,CAAC,CAAA,CAAA;AAAA,EACzC,CAAC,CAAA;AAGD,EAAA,MAAM,kBAA4B,EAAC;AACnC,EAAA,IAAI,QAAA,CAAS,aAAa,MAAA,EAAW;AACnC,IAAA,MAAM,GAAA,GAAM,CAAA,EAAG,QAAA,CAAS,QAAA,CAAS,KAAA,CAAM,KAAK,CAAA,CAAA,EAAI,QAAA,CAAS,QAAA,CAAS,KAAA,CAAM,MAAM,CAAA,CAAA;AAK9E,IAAA,MAAM,kBAAA,GAAqB,uBAAuB,UAAU,CAAA;AAC5D,IAAA,IAAI,uBAAuB,MAAA,EAAW;AACpC,MAAA,eAAA,CAAgB,IAAA,CAAK,CAAA,KAAA,EAAQ,GAAG,CAAA,MAAA,EAAS,kBAAkB,CAAA,aAAA,CAAe,CAAA;AAAA,IAC5E;AAAA,EACF;AAEA,EAAA,MAAM,UAAA,GAAa,CAAC,GAAG,YAAA,EAAc,GAAG,cAAA,EAAgB,GAAG,gBAAA,EAAkB,GAAG,eAAe,CAAA;AAC/F,EAAA,IAAI,WAAA,CAAY,SAAS,CAAA,EAAG;AAC1B,IAAA,QAAA,CAAS,IAAA,CAAK,CAAA,OAAA,EAAU,WAAA,CAAY,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,EAAI,UAAA,CAAW,IAAA,CAAK,IAAI,CAAC,CAAA,CAAE,CAAA;AAAA,EAC1E,CAAA,MAAO;AACL,IAAA,QAAA,CAAS,KAAK,CAAA,OAAA,EAAU,UAAA,CAAW,IAAA,CAAK,IAAI,CAAC,CAAA,CAAE,CAAA;AAAA,EACjD;AAGA,EAAA,MAAM,WAAA,GAAc,QAAA,CAAS,OAAA,CAAQ,CAAC,CAAA;AACtC,EAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,IAAA,IAAI,WAAA,CAAY,aAAa,MAAA,EAAW;AACtC,MAAA,MAAM,MAAA,GAAS,YAAA,CAAa,WAAA,CAAY,QAAQ,CAAA;AAEhD,MAAA,mBAAA,CAAoB,MAAA,EAAQ,YAAY,YAAY,CAAA;AACpD,MAAA,QAAA,CAAS,KAAK,CAAA,MAAA,EAAS,MAAA,CAAO,GAAG,CAAA,KAAA,EAAQ,WAAA,CAAY,KAAK,CAAA,CAAE,CAAA;AAAA,IAC9D,CAAA,MAAA,IAAW,WAAA,CAAY,KAAA,KAAU,MAAA,EAAW;AAC1C,MAAA,QAAA,CAAS,KAAK,CAAA,KAAA,EAAQ,WAAA,CAAY,KAAK,CAAA,IAAA,EAAO,WAAA,CAAY,KAAK,CAAA,CAAE,CAAA;AAAA,IACnE;AAAA,EACF;AAOA,EAAA,KAAA,MAAW,IAAA,IAAQ,SAAS,KAAA,EAAO;AACjC,IAAA,MAAM,UAAA,GAAa,SAAS,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,KAAA,KAAU,IAAA,CAAK,OAAO,CAAA;AACxE,IAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,MAAA,MAAM,OAAA,GAAU,IAAA,CAAK,IAAA,KAAS,MAAA,GAAS,WAAA,GAAc,MAAA;AACrD,MAAA,MAAM,UAAA,GAAa;AAAA,QACjB,GAAG,iBAAiB,IAAI,CAAA;AAAA,QACxB,GAAA,CAAI,IAAA,CAAK,EAAA,IAAM,EAAC,EAAG,GAAA,CAAI,CAAC,KAAA,KAAU,aAAA,CAAc,KAAA,CAAM,QAAA,EAAU,GAAG,CAAC;AAAA,OACtE;AACA,MAAA,MAAM,EAAA,GAAK,UAAA,CAAW,IAAA,CAAK,OAAO,CAAA;AAClC,MAAA,IAAI,UAAA,CAAW,aAAa,MAAA,EAAW;AACrC,QAAA,MAAM,MAAA,GAAS,YAAA,CAAa,UAAA,CAAW,QAAQ,CAAA;AAC/C,QAAA,mBAAA,CAAoB,MAAA,EAAQ,YAAY,YAAY,CAAA;AACpD,QAAA,QAAA,CAAS,IAAA,CAAK,CAAA,EAAG,OAAO,CAAA,EAAA,EAAK,MAAA,CAAO,GAAG,CAAA,KAAA,EAAQ,IAAA,CAAK,OAAO,CAAA,IAAA,EAAO,EAAE,CAAA,CAAE,CAAA;AAAA,MACxE,CAAA,MAAO;AACL,QAAA,QAAA,CAAS,IAAA,CAAK,CAAA,EAAG,OAAO,CAAA,CAAA,EAAI,IAAA,CAAK,OAAO,CAAA,IAAA,EAAO,IAAA,CAAK,OAAO,CAAA,IAAA,EAAO,EAAE,CAAA,CAAE,CAAA;AAAA,MACxE;AAAA,IACF;AAAA,EACF;AAQA,EAAA,MAAM,aAAA,GAAgB,IAAI,GAAA,CAAI,QAAA,CAAS,KAAA,CAAM,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,OAAO,CAAC,CAAA;AAClE,EAAA,KAAA,MAAW,MAAA,IAAU,SAAS,OAAA,EAAS;AACrC,IAAA,IAAI,MAAA,CAAO,UAAU,WAAA,EAAa,KAAA,IAAS,cAAc,GAAA,CAAI,MAAA,CAAO,KAAK,CAAA,EAAG;AAC5E,IAAA,IAAI,MAAA,CAAO,aAAa,MAAA,EAAW;AACjC,MAAA,MAAM,MAAA,GAAS,YAAA,CAAa,MAAA,CAAO,QAAQ,CAAA;AAC3C,MAAA,mBAAA,CAAoB,MAAA,EAAQ,YAAY,YAAY,CAAA;AACpD,MAAA,QAAA,CAAS,KAAK,CAAA,YAAA,EAAe,MAAA,CAAO,GAAG,CAAA,KAAA,EAAQ,MAAA,CAAO,KAAK,CAAA,CAAE,CAAA;AAAA,IAC/D,CAAA,MAAA,IAAW,MAAA,CAAO,KAAA,KAAU,MAAA,EAAW;AACrC,MAAA,QAAA,CAAS,KAAK,CAAA,WAAA,EAAc,MAAA,CAAO,KAAK,CAAA,IAAA,EAAO,MAAA,CAAO,KAAK,CAAA,CAAE,CAAA;AAAA,IAC/D;AAAA,EACF;AAGA,EAAA,IAAI,QAAA,CAAS,WAAW,MAAA,EAAW;AACjC,IAAA,MAAM,WAAA,GAAc,aAAA,CAAc,QAAA,CAAS,MAAA,CAAO,UAAU,GAAG,CAAA;AAC/D,IAAA,QAAA,CAAS,IAAA,CAAK,CAAA,MAAA,EAAS,WAAW,CAAA,CAAE,CAAA;AAAA,EACtC;AAGA,EAAA,IAAI,QAAA,CAAS,OAAA,CAAQ,MAAA,GAAS,CAAA,EAAG;AAC/B,IAAA,MAAM,YAAA,GAAe,QAAA,CAAS,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAG,CAAA,CAAE,KAAK,CAAA,CAAA,EAAI,CAAA,CAAE,MAAM,CAAA,CAAE,CAAA;AACzE,IAAA,QAAA,CAAS,KAAK,CAAA,SAAA,EAAY,YAAA,CAAa,IAAA,CAAK,IAAI,CAAC,CAAA,CAAE,CAAA;AAAA,EACrD;AAGA,EAAA,IAAI,QAAA,CAAS,IAAA,CAAK,MAAA,GAAS,CAAA,EAAG;AAC5B,IAAA,MAAM,YAAA,GAAe,QAAA,CAAS,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,KAAM;AAC5C,MAAA,IAAI,OAAO,CAAA,CAAE,KAAA,KAAU,QAAA,EAAU;AAC/B,QAAA,OAAO,CAAA,EAAG,UAAA,CAAW,CAAA,CAAE,KAAK,CAAC,IAAI,CAAA,CAAE,GAAA,KAAQ,MAAA,GAAS,MAAA,GAAS,KAAK,CAAA,CAAA;AAAA,MACpE;AACA,MAAA,OAAO,CAAA,EAAG,CAAA,CAAE,KAAA,CAAM,KAAK,CAAA,CAAA,EAAI,CAAA,CAAE,KAAA,CAAM,MAAM,CAAA,CAAA,EAAI,CAAA,CAAE,GAAA,KAAQ,MAAA,GAAS,SAAS,KAAK,CAAA,CAAA;AAAA,IAChF,CAAC,CAAA;AACD,IAAA,QAAA,CAAS,KAAK,CAAA,SAAA,EAAY,YAAA,CAAa,IAAA,CAAK,IAAI,CAAC,CAAA,CAAE,CAAA;AAAA,EACrD,CAAA,MAAA,IAAW,QAAA,CAAS,QAAA,KAAa,MAAA,EAAW;AAC1C,IAAA,MAAM,WAAA,GAAc,uBAAuB,UAAU,CAAA;AACrD,IAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,MAAA,MAAM,GAAA,GAAM,CAAA,EAAG,QAAA,CAAS,QAAA,CAAS,KAAA,CAAM,KAAK,CAAA,CAAA,EAAI,QAAA,CAAS,QAAA,CAAS,KAAA,CAAM,MAAM,CAAA,CAAA;AAC9E,MAAA,QAAA,CAAS,IAAA,CAAK,CAAA,SAAA,EAAY,GAAG,CAAA,MAAA,EAAS,WAAW,CAAA,IAAA,CAAM,CAAA;AAAA,IACzD;AAAA,EACF;AAGA,EAAA,IAAI,QAAA,CAAS,UAAU,MAAA,EAAW;AAGhC,IAAA,IAAI,CAAC,OAAO,SAAA,CAAU,QAAA,CAAS,KAAK,CAAA,IAAK,QAAA,CAAS,QAAQ,CAAA,EAAG;AAC3D,MAAA,MAAM,IAAI,SAAS,aAAA,EAAe,CAAA,sCAAA,EAAyC,OAAO,QAAA,CAAS,KAAK,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,IACtG;AACA,IAAA,QAAA,CAAS,IAAA,CAAK,CAAA,MAAA,EAAS,QAAA,CAAS,KAAK,CAAA,CAAE,CAAA;AAAA,EACzC;AAGA,EAAA,MAAM,kBAAmC,EAAC;AAC1C,EAAA,KAAA,MAAW,QAAQ,UAAA,EAAY;AAC7B,IAAA,eAAA,CAAgB,IAAA,CAAK,GAAG,CAAA,GAAI,EAAE,MAAM,IAAA,CAAK,IAAA,EAAM,IAAA,EAAM,IAAA,CAAK,IAAA,EAAK;AAAA,EACjE;AAEA,EAAA,OAAO;AAAA,IACL,GAAA,EAAK,QAAA,CAAS,IAAA,CAAK,GAAG,CAAA;AAAA,IACtB,UAAA;AAAA,IACA;AAAA,GACF;AACF,CAAA;AAMA,IAAM,sBAAA,GAAyB,CAAC,KAAA,KAA2C;AACzE,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,MAAM,IAAA,GAAO,MAAM,CAAC,CAAA;AACpB,IAAA,IAAI,IAAA,KAAS,MAAA,IAAa,IAAA,CAAK,IAAA,KAAS,UAAA,EAAY;AAClD,MAAA,OAAO,CAAA,GAAI,CAAA;AAAA,IACb;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT,CAAA;AAEA,IAAM,mBAAA,GAAsB,CAC1B,WAAA,EACA,WAAA,EACA,aAAA,KACS;AAOT,EAAA,KAAA,MAAW,IAAA,IAAQ,YAAY,UAAA,EAAY;AACzC,IAAA,aAAA,CAAc,KAAA,IAAS,CAAA;AACvB,IAAA,WAAA,CAAY,KAAK,IAAI,CAAA;AAAA,EACvB;AACF,CAAA;;;ACjLA,IAAM,OAAA,GAAkC,EAAE,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,CAAA,EAAG,CAAA,EAAG,GAAA,EAAM,GAAA,EAAK,GAAA,EAAQ,CAAA,EAAG,IAAA,EAAW,GAAG,KAAA,EAAW;AAEnG,IAAM,YAAA,GAAe,CAAC,KAAA,KAAsC;AACjE,EAAA,MAAM,KAAA,GAAQ,2CAAA,CAA4C,IAAA,CAAK,KAAK,CAAA;AACpE,EAAA,IAAI,KAAA,KAAU,MAAM,OAAO,MAAA;AAC3B,EAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,KAAA,CAAM,CAAC,KAAK,EAAE,CAAA;AACnC,EAAA,OAAO,SAAS,MAAA,GAAY,MAAA,GAAY,OAAO,KAAA,CAAM,CAAC,CAAC,CAAA,GAAI,IAAA;AAC7D,CAAA;AAEO,IAAM,cAAA,GAAiB,OAAO,IAAA,EAAc,SAAA,KAAmD;AACpG,EAAA,IAAI,IAAA,CAAK,iBAAA,KAAsB,KAAA,EAAO,OAAO,YAAA;AAC7C,EAAA,MAAM,KAAA,GAAQ,MAAM,IAAA,CAAK,KAAA,CAAM,wBAAwB,CAAA;AACvD,EAAA,MAAM,OAAA,GAAU,YAAA,CAAa,MAAA,CAAO,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,GAAI,mBAAmB,CAAA,IAAK,EAAE,CAAC,CAAA;AAC/E,EAAA,IAAI,YAAY,MAAA,IAAa,OAAA,GAAU,CAAA,IAAK,OAAA,IAAW,WAAW,OAAO,YAAA;AACzE,EAAA,OAAO,IAAA,CAAK,WAAA,KAAgB,MAAA,GAAY,YAAA,GAAe,WAAA;AACzD,CAAA;;;ACjBA,IAAM,YAAA,uBAAmB,GAAA,CAAI;AAAA,EAC3B,EAAA;AAAA;AAAA,EACA,GAAA;AAAA;AAAA,EACA,GAAA;AAAA;AAAA,EACA;AAAA;AACF,CAAC,CAAA;AAID,IAAM,oBAAA,GAAuB,CAAC,IAAA,EAAa,MAAA,KAA6B;AACtE,EAAA,MAAM,WAAA,GAAc,MAAA,CACjB,MAAA,CAAO,CAAA,CAAA,KAAK,YAAA,CAAa,GAAA,CAAI,CAAA,CAAE,UAAU,CAAC,CAAA,CAC1C,GAAA,CAAI,CAAA,CAAA,KAAK,EAAE,IAAI,CAAA;AAClB,EAAA,IAAI,YAAY,MAAA,KAAW,CAAA,IAAK,IAAA,CAAK,MAAA,KAAW,GAAG,OAAO,IAAA;AAC1D,EAAA,OAAO,IAAA,CAAK,IAAI,CAAA,GAAA,KAAO;AACrB,IAAA,MAAM,GAAA,GAAM,EAAE,GAAG,GAAA,EAAI;AACrB,IAAA,KAAA,MAAW,OAAO,WAAA,EAAa;AAC7B,MAAA,MAAM,CAAA,GAAI,IAAI,GAAG,CAAA;AACjB,MAAA,IAAI,OAAO,MAAM,QAAA,EAAU;AACzB,QAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,QAAA,IAAI,OAAO,QAAA,CAAS,CAAC,CAAA,EAAG,GAAA,CAAI,GAAG,CAAA,GAAI,CAAA;AAAA,MACrC;AAAA,IACF;AACA,IAAA,OAAO,GAAA;AAAA,EACT,CAAC,CAAA;AACH,CAAA;AAEO,IAAM,qBAAA,GAAwB,CAAC,MAAA,KAAmD;AACvF,EAAA,MAAM,EAAE,IAAA,EAAM,MAAA,GAAS,QAAA,EAAU,SAAQ,GAAI,MAAA;AAE7C,EAAA,MAAM,YAAA,GAAoC;AAAA,IACxC,YAAA,EAAc,IAAA;AAAA,IACd,UAAA,EAAY,KAAA;AAAA;AAAA,IACZ,UAAA,EAAY,IAAA;AAAA,IACZ,cAAA,EAAgB,IAAA;AAAA,IAChB,eAAA,EAAiB,IAAA;AAAA,IACjB,GAAA,EAAK,IAAA;AAAA,IACL,eAAA,EAAiB,IAAA;AAAA,IACjB,gBAAA,EAAkB;AAAA,GACpB;AAEA,EAAA,MAAM,UAAA,GAAa,OAAO,OAAA,KACxB,kBAAA,CAAmB,IAAA,EAAM;AAAA,IACvB,GAAG,OAAA;AAAA,IACH,MAAA,EAAQ,SAAS,MAAA,IAAU,MAAA;AAAA,IAC3B,OAAA,EAAS,SAAS,OAAA,IAAW;AAAA,GAC9B,CAAA;AAEH,EAAA,MAAMA,QAAAA,GAAU,CAAC,QAAA,KACf,YAAA,CAAa,QAAQ,CAAA;AAKvB,EAAA,IAAI,cAAA;AACJ,EAAA,MAAM,UAAA,GAAa,OAAO,EAAA,KAA4C;AACpE,IAAA,cAAA,GAAiB,MAAA;AACjB,IAAA,IAAI,EAAA,IAAM,GAAG,OAAO,YAAA;AACpB,IAAA,MAAM,WAAA,GAAc,MAAM,cAAA,CAAe,IAAA,EAAM,EAAE,CAAA;AACjD,IAAA,IAAI,WAAA,KAAgB,WAAA,EAAa,cAAA,GAAiB,IAAA,CAAK,MAAM,EAAE,CAAA;AAC/D,IAAA,OAAO,WAAA;AAAA,EACT,CAAA;AAEA,EAAA,MAAM,OAAA,GAAU,OAAO,KAAA,EAAsB,MAAA,KAAwC;AACnF,IAAA,MAAM,KAAA,GAAQ,cAAA;AAGd,IAAA,MAAM,SACJ,KAAA,KAAU,MAAA,IAAa,IAAA,CAAK,WAAA,KAAgB,SACxC,MAAM,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,KAAK,MAAM,CAAA,GAClC,MAAM,IAAA,CAAK,WAAA,CAAY,OAAO,EAAA,KAAO;AAGnC,MAAA,MAAM,EAAA,CAAG,KAAA,CAAM,CAAA,8BAAA,EAAiC,KAAK,CAAA,CAAE,CAAA;AACvD,MAAA,OAAO,EAAA,CAAG,KAAA,CAAM,KAAA,CAAM,GAAA,EAAK,MAAM,CAAA;AAAA,IACnC,CAAC,CAAA;AACP,IAAA,OAAO,oBAAA,CAAqB,MAAA,CAAO,IAAA,EAAM,MAAA,CAAO,MAAmB,CAAA;AAAA,EACrE,CAAA;AAEA,EAAA,OAAO;AAAA,IACL,EAAA,EAAI,UAAA;AAAA,IACJ,UAAA;AAAA,IACA,OAAA,EAAAA,QAAAA;AAAA,IACA,OAAA;AAAA,IACA,YAAA;AAAA,IACA;AAAA,GACF;AACF;;;ACvGO,IAAM,WAAW,MACtB;AAAA,EACE,yGAAA;AAAA,EACA,EAAA;AAAA,EACA,+CAAA;AAAA,EACA,0WAAA;AAAA,EACA,kJAAA;AAAA,EACA,mMAAA;AAAA,EACA,EAAA;AAAA,EACA,yDAAA;AAAA,EACA,+PAAA;AAAA,EACA,4SAAA;AAAA,EACA,mIAAA;AAAA,EACA,mFAAA;AAAA,EACA,uaAAA;AAAA,EACA,EAAA;AAAA,EACA,8WAAA;AAAA,EACA,EAAA;AAAA,EACA;AACF,CAAA,CAAE,KAAK,IAAI;;;ACQN,IAAM,aAAA,GAAgB,CAAC,UAAA,EAAY,UAAU;AAG7C,IAAM,SAAA,GAAY,CAAC,KAAA,KAAqC,aAAA,CAAc,KAAK,CAAC,IAAA,KAAS,SAAS,KAAK;ACjB1G,IAAM,YAAA,GAAe,CAAC,KAAA,KAA4B;AAChD,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,UAAU,OAAO,KAAA;AACxD,EAAA,MAAM,EAAA,GAAK,KAAA;AACX,EAAA,IAAI,EAAA,CAAG,WAAW,CAAA,KAAM,CAAA,EAAG,OAAO,KAAA;AAClC,EAAA,IAAI,EAAE,MAAA,IAAU,EAAA,CAAA,EAAK,OAAO,KAAA;AAC5B,EAAA,MAAM,MAAA,GAAS,GAAG,QAAQ,CAAA;AAC1B,EAAA,IAAI,MAAA,KAAW,IAAA,IAAQ,OAAO,MAAA,KAAW,UAAU,OAAO,KAAA;AAC1D,EAAA,MAAM,CAAA,GAAI,MAAA;AACV,EAAA,OAAO,KAAA,CAAM,OAAA,CAAQ,CAAA,CAAE,OAAO,CAAC,KAAK,KAAA,CAAM,OAAA,CAAQ,CAAA,CAAE,SAAS,CAAC,CAAA;AAChE,CAAA;AAMO,IAAM,aAAA,GAAgB,CAAC,KAAA,KAAqC;AACjE,EAAA,IAAI,OAAO,KAAA,CAAM,SAAA,KAAc,QAAA,EAAU,OAAO,4BAAA;AAChD,EAAA,IAAI,MAAM,SAAA,KAAc,MAAA,IAAa,OAAO,KAAA,CAAM,cAAc,QAAA,EAAU;AACxE,IAAA,OAAO,yCAAA;AAAA,EACT;AAEA,EAAA,IAAI,KAAA,CAAM,SAAS,eAAA,EAAiB;AAClC,IAAA,OAAO,OAAO,MAAM,MAAA,KAAW,QAAA,IAAY,MAAM,MAAA,CAAO,MAAA,GAAS,IAC7D,IAAA,GACA,iDAAA;AAAA,EACN;AAEA,EAAA,IAAI,KAAA,CAAM,SAAS,IAAA,EAAM;AACvB,IAAA,IAAIM,aAAa,KAAA,CAAM,GAAG,GAAG,OAAO,CAAA,aAAA,EAAgBC,cAAc,CAAA,CAAA;AAClE,IAAA,MAAM,MAAA,GAAS,WAAA,CAAY,SAAA,CAAU,KAAA,CAAM,GAAG,CAAA;AAC9C,IAAA,IAAI,CAAC,MAAA,CAAO,OAAA,SAAgB,CAAA,aAAA,EAAgB,MAAA,CAAO,MAAM,OAAO,CAAA,CAAA;AAChE,IAAA,IAAI,MAAM,OAAA,KAAY,MAAA,IAAa,CAAC,YAAA,CAAa,KAAA,CAAM,OAAO,CAAA,EAAG;AAC/D,MAAA,OAAO,6CAAA;AAAA,IACT;AACA,IAAA,IAAI,MAAM,OAAA,KAAY,MAAA,IAAa,CAAC,SAAA,CAAU,KAAA,CAAM,OAAO,CAAA,EAAG;AAC5D,MAAA,OAAO,CAAA,iBAAA,EAAoB,MAAA,CAAO,KAAA,CAAM,OAAO,CAAC,CAAA,CAAA;AAAA,IAClD;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,IAAI,KAAA,CAAM,SAAS,UAAA,EAAY;AAC7B,IAAA,IAAID,aAAa,KAAA,CAAM,QAAQ,GAAG,OAAO,CAAA,kBAAA,EAAqBC,cAAc,CAAA,CAAA;AAC5E,IAAA,MAAM,MAAA,GAAS,wBAAA,CAAyB,SAAA,CAAU,KAAA,CAAM,QAAQ,CAAA;AAChE,IAAA,OAAO,OAAO,OAAA,GAAU,IAAA,GAAO,CAAA,kBAAA,EAAqB,MAAA,CAAO,MAAM,OAAO,CAAA,CAAA;AAAA,EAC1E;AAEA,EAAA,OAAO,CAAA,0BAAA,EAA6B,MAAA,CAAQ,KAAA,CAA4B,IAAI,CAAC,CAAA,CAAA;AAC/E;ACrBA,IAAM,KAAA,GAAQ,0BAAA;AACd,IAAMC,WAAAA,GAAa,CAAC,IAAA,EAAc,KAAA,KAA0B;AAC1D,EAAA,IAAI,CAAC,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA,EAAG;AACrB,IAAA,MAAM,IAAI,KAAA,CAAM,CAAA,QAAA,EAAW,KAAK,CAAA,iCAAA,EAAoC,IAAI,CAAA,CAAA,CAAG,CAAA;AAAA,EAC7E;AACA,EAAA,OAAO,IAAI,IAAI,CAAA,CAAA,CAAA;AACjB,CAAA;AAEA,IAAM,WAAA,GACJ,oJAAA;AAEF,IAAM,UAAA,GAAa,CAAC,GAAA,KAA6C;AAC/D,EAAA,MAAM,SAAA,GAAa,GAAA,CAAI,YAAY,CAAA,CAAW,OAAA,EAAQ;AACtD,EAAA,MAAM,YAAA,GAAe,IAAI,YAAY,CAAA;AACrC,EAAA,MAAM,WAAA,GAAc,IAAI,cAAc,CAAA;AACtC,EAAA,MAAM,WAAA,GAAc,IAAI,oBAAoB,CAAA;AAC5C,EAAA,MAAM,IAAA,GAAO;AAAA,IACX,SAAA;AAAA,IACA,GAAI,eAAe,EAAE,SAAA,EAAW,aAAa,OAAA,EAAQ,KAAM,EAAC;AAAA,IAC5D,GAAI,cAAc,EAAE,UAAA,EAAY,YAAY,OAAA,EAAQ,KAAM,EAAC;AAAA,IAC3D,GAAI,IAAI,WAAW,CAAA,KAAM,OAAO,EAAE,SAAA,EAAW,IAAA,EAAK,GAAI,EAAC;AAAA,IACvD,GAAI,GAAA,CAAI,cAAc,CAAA,IAAK,IAAA,GAAO,EAAE,WAAA,EAAa,MAAA,CAAO,GAAA,CAAI,cAAc,CAAC,CAAA,KAAM,EAAC;AAAA,IAClF,GAAI,WAAA,GAAc,EAAE,iBAAA,EAAmB,WAAA,KAAgB,EAAC;AAAA,IACxD,GAAI,GAAA,CAAI,QAAQ,CAAA,IAAK,IAAA,GAAO,EAAE,MAAA,EAAQ,MAAA,CAAO,GAAA,CAAI,QAAQ,CAAC,CAAA,KAAM,EAAC;AAAA,IACjE,GAAI,GAAA,CAAI,OAAO,CAAA,IAAK,IAAA,GAAO,EAAE,KAAA,EAAO,GAAA,CAAI,OAAO,CAAA,EAAE,GAAI;AAAC,GACxD;AAEA,EAAA,IAAI,GAAA,CAAI,MAAM,CAAA,KAAM,eAAA,EAAiB;AACnC,IAAA,OAAO,EAAE,IAAA,EAAM,eAAA,EAAiB,MAAA,EAAQ,MAAA,CAAO,GAAA,CAAI,QAAQ,CAAA,IAAK,EAAE,CAAA,EAAG,GAAG,IAAA,EAAK;AAAA,EAC/E;AAGA,EAAA,IAAI,GAAA,CAAI,MAAM,CAAA,KAAM,UAAA,EAAY;AAC9B,IAAA,OAAO;AAAA,MACL,IAAA,EAAM,UAAA;AAAA,MACN,QAAA,EAAU,IAAI,KAAK,CAAA;AAAA,MACnB,GAAI,GAAA,CAAI,OAAO,CAAA,IAAK,IAAA,GAAO,EAAE,KAAA,EAAO,GAAA,CAAI,OAAO,CAAA,EAAY,GAAI,EAAC;AAAA,MAChE,GAAG;AAAA,KACL;AAAA,EACF;AACA,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,IAAA;AAAA,IACN,GAAA,EAAK,IAAI,KAAK,CAAA;AAAA,IACd,GAAI,GAAA,CAAI,UAAU,CAAA,IAAK,IAAA,GAAO,EAAE,OAAA,EAAS,GAAA,CAAI,UAAU,CAAA,EAAgB,GAAI,EAAC;AAAA;AAAA;AAAA;AAAA;AAAA,IAK5E,GAAI,GAAA,CAAI,OAAO,CAAA,IAAK,IAAA,GAAO,EAAE,KAAA,EAAO,GAAA,CAAI,OAAO,CAAA,EAAY,GAAI,EAAC;AAAA;AAAA;AAAA,IAGhE,GAAI,SAAA,CAAU,GAAA,CAAI,SAAS,CAAC,CAAA,GAAI,EAAE,OAAA,EAAS,GAAA,CAAI,SAAS,CAAA,EAAE,GAAI,EAAC;AAAA,IAC/D,GAAG;AAAA,GACL;AACF,CAAA;AAEO,IAAM,mBAAA,GAAsB,CAAC,MAAA,KAA+C;AACjF,EAAA,MAAM,EAAE,IAAA,EAAM,OAAA,EAAQ,GAAI,MAAA;AAC1B,EAAA,MAAM,MAAA,GAASA,WAAAA,CAAW,MAAA,CAAO,MAAA,IAAU,UAAU,QAAQ,CAAA;AAC7D,EAAA,MAAM,KAAA,GAAQA,WAAAA,CAAW,MAAA,CAAO,KAAA,IAAS,aAAa,OAAO,CAAA;AAC7D,EAAA,MAAM,SAAA,GAAY,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,KAAK,CAAA,CAAA;AAUpC,EAAA,MAAM,aAAa,MAAA,CAAO,MAAA,IAAU,cAAc,QAAA,IAAA,CAAa,MAAA,CAAO,SAAS,WAAA,MAAiB,WAAA;AAChG,EAAA,MAAM,IAAA,GAAO,CAAA,EAAG,MAAA,CAAO,MAAA,IAAU,QAAQ,CAAA,CAAA,EAAI,MAAA,CAAO,KAAA,IAAS,WAAW,CAAA,CAAA,CAAG,WAAA,EAAY,CAAE,OAAA,CAAQ,eAAe,GAAG,CAAA;AACnH,EAAA,MAAM,QAAA,GAAqB;AAAA,IACzB,EAAA,EAAI,SAAA,GAAY,gBAAA,GAAmB,CAAA,eAAA,EAAkB,IAAI,CAAA,CAAA;AAAA,IACzD,UAAA,EAAY;AAAA,MACV;AAAA,QACE,WAAA,EAAa,uDAAA;AAAA,QACb,KAAA,EAAO;AAAA,UACL,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,CAAA,4BAAA,EAA+B,MAAM,CAAA,CAAA,EAAG;AAAA,UAC5D;AAAA,YACE,IAAA,EAAM,KAAA;AAAA,YACN,GAAA,EAAK,8BAA8B,SAAS,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAAA;AAAA,WAiB9C;AAAA,UACA,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,CAAA,YAAA,EAAe,SAAS,CAAA,kEAAA,CAAA,EAAqE;AAAA,UACjH,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,CAAA,YAAA,EAAe,SAAS,CAAA,kDAAA,CAAA,EAAqD;AAAA,UACjG,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,CAAA,YAAA,EAAe,SAAS,CAAA,2CAAA,CAAA,EAA8C;AAAA,UAC1F,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,CAAA,YAAA,EAAe,SAAS,CAAA,oCAAA,CAAA,EAAuC;AAAA,UACnF,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,CAAA,YAAA,EAAe,SAAS,CAAA,sCAAA,CAAA;AAAyC;AACvF;AACF;AACF,GACF;AAGA,EAAA,MAAM,OAAO,YAA2B;AACtC,IAAA,MAAM,OAAA,CAAQ,IAAA,EAAM,CAAC,QAAQ,CAAC,CAAA;AAAA,EAChC,CAAA;AAEA,EAAA,MAAM,KAAA,GAAQ,CAAC,GAAA,EAAa,MAAA,KAAyB;AACnD,IAAA,aAAA,CAAc,IAAA,CAAK,MAAM,CAAA,YAAA,EAAe,SAAS,mBAAmB,CAAC,GAAG,CAAC,CAAA,EAAG,OAAO,CAAA;AACnF,IAAA,MAAM,MAAM,IAAI,KAAA,CAAM,qDAAqD,GAAG,CAAA,GAAA,EAAM,MAAM,CAAA,CAAE,CAAA;AAC5F,IAAA,IAAI,OAAA,UAAiB,GAAG,CAAA;AAAA,SACnB,OAAA,CAAQ,MAAM,GAAG,CAAA;AAAA,EACxB,CAAA;AAEA,EAAA,MAAM,GAAA,GAAM,OAAO,GAAA,KAAiD;AAClE,IAAA,MAAM,GAAA,GAAM,MAAM,IAAA,CAAK,KAAA;AAAA,MACrB,CAAA,OAAA,EAAU,WAAW,CAAA,MAAA,EAAS,SAAS;AAAA,oEAAA,CAAA;AAAA,MAEvC,CAAC,GAAG;AAAA,KACN;AACA,IAAA,MAAM,GAAA,GAAM,GAAA,CAAI,IAAA,CAAK,CAAC,CAAA;AACtB,IAAA,IAAI,GAAA,KAAQ,QAAW,OAAO,MAAA;AAE9B,IAAA,MAAM,KAAA,GAAQ,WAAW,GAAG,CAAA;AAC5B,IAAA,MAAM,KAAA,GAAQ,cAAc,KAAK,CAAA;AACjC,IAAA,IAAI,UAAU,IAAA,EAAM;AAClB,MAAA,KAAA,CAAM,KAAK,KAAK,CAAA;AAChB,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,OAAO,KAAA;AAAA,EACT,CAAA;AAEA,EAAA,MAAM,GAAA,GAAM,OAAO,GAAA,EAAa,KAAA,KAAqC;AACnE,IAAA,MAAM,KAAA,GAAQ,cAAc,KAAK,CAAA;AACjC,IAAA,IAAI,UAAU,IAAA,EAAM;AAClB,MAAA,MAAM,UAAU,IAAI,KAAA;AAAA,QAClB,CAAA,8DAAA,EAAiE,GAAG,CAAA,GAAA,EAAM,KAAK,CAAA;AAAA,OACjF;AACA,MAAA,IAAI,OAAA,EAAS;AACX,QAAA,OAAA,CAAQ,OAAO,CAAA;AACf,QAAA;AAAA,MACF;AACA,MAAA,MAAM,OAAA;AAAA,IACR;AAEA,IAAA,MAAM,IAAA,GAAO,MAAM,IAAA,KAAS,IAAA;AAC5B,IAAA,MAAM,GAAA,GAAM,IAAA,GAAO,IAAA,CAAK,SAAA,CAAU,MAAM,GAAG,CAAA,GAAI,KAAA,CAAM,IAAA,KAAS,UAAA,GAAa,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,QAAQ,CAAA,GAAI,IAAA;AAC5G,IAAA,MAAM,OAAA,GAAU,QAAQ,KAAA,CAAM,OAAA,KAAY,SAAY,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,OAAO,CAAA,GAAI,IAAA;AACtF,IAAA,MAAM,MAAA,GAAS,KAAA,CAAM,IAAA,KAAS,eAAA,GAAkB,MAAM,MAAA,GAAS,IAAA;AAC/D,IAAA,MAAM,MAAA,GAAS,MAAM,MAAA,IAAU,IAAA;AAC/B,IAAA,MAAM,KAAA,GAAQ,MAAM,KAAA,KAAU,MAAA,GAAY,KAAK,SAAA,CAAU,KAAA,CAAM,KAAK,CAAA,GAAI,IAAA;AACxE,IAAA,MAAM,SAAA,GAAY,IAAI,IAAA,CAAK,KAAA,CAAM,SAAS,CAAA;AAC1C,IAAA,MAAM,SAAA,GAAY,MAAM,SAAA,KAAc,MAAA,GAAY,IAAI,IAAA,CAAK,KAAA,CAAM,SAAS,CAAA,GAAI,IAAA;AAC9E,IAAA,MAAM,WAAA,GAAc,MAAM,iBAAA,IAAqB,IAAA;AAC/C,IAAA,MAAM,WAAA,GAAc,MAAM,SAAA,KAAc,IAAA;AACxC,IAAA,MAAM,UAAA,GAAa,MAAM,UAAA,KAAe,MAAA,GAAY,IAAI,IAAA,CAAK,KAAA,CAAM,UAAU,CAAA,GAAI,IAAA;AACjF,IAAA,MAAM,WAAA,GAAc,MAAM,WAAA,IAAe,IAAA;AACzC,IAAA,MAAM,QAAQ,KAAA,CAAM,IAAA,KAAS,eAAA,GAAkB,IAAA,GAAQ,MAAM,KAAA,IAAS,IAAA;AACtE,IAAA,MAAM,UAAU,KAAA,CAAM,IAAA,KAAS,IAAA,GAAQ,KAAA,CAAM,WAAW,IAAA,GAAQ,IAAA;AAEhE,IAAA,MAAM,IAAA,CAAK,KAAA;AAAA,MACT,eAAe,SAAS,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,8CAAA,CAAA;AAAA,MAiBxB,CAAC,GAAA,EAAK,KAAA,CAAM,IAAA,EAAM,MAAA,EAAQ,OAAO,GAAA,EAAK,OAAA,EAAS,KAAA,EAAO,MAAA,EAAQ,WAAW,SAAA,EAAW,WAAA,EAAa,WAAA,EAAa,UAAA,EAAY,aAAa,OAAO;AAAA,KAChJ;AAAA,EACF,CAAA;AAEA,EAAA,MAAM,GAAA,GAAM,OAAO,GAAA,KAA+B;AAChD,IAAA,MAAM,KAAK,KAAA,CAAM,CAAA,YAAA,EAAe,SAAS,CAAA,eAAA,CAAA,EAAmB,CAAC,GAAG,CAAC,CAAA;AAAA,EACnE,CAAA;AAEA,EAAA,MAAM,QAAQ,YAA2B;AACvC,IAAA,MAAM,IAAA,CAAK,KAAA,CAAM,CAAA,YAAA,EAAe,SAAS,CAAA,CAAE,CAAA;AAAA,EAC7C,CAAA;AAEA,EAAA,MAAM,OAAO,YAA+B;AAC1C,IAAA,MAAM,GAAA,GAAM,MAAM,IAAA,CAAK,KAAA;AAAA,MACrB,mBAAmB,SAAS,CAAA,+CAAA;AAAA,KAC9B;AACA,IAAA,OAAO,GAAA,CAAI,KAAK,GAAA,CAAI,CAAC,MAAM,MAAA,CAAO,CAAA,CAAE,KAAK,CAAC,CAAC,CAAA;AAAA,EAC7C,CAAA;AAGA,EAAA,MAAM,UAAU,YAAgE;AAC9E,IAAA,MAAM,GAAA,GAAM,MAAM,IAAA,CAAK,KAAA;AAAA,MACrB,CAAA,OAAA,EAAU,WAAW,CAAA,MAAA,EAAS,SAAS;AAAA,qDAAA;AAAA,KAEzC;AACA,IAAA,MAAM,MAAiD,EAAC;AACxD,IAAA,KAAA,MAAW,GAAA,IAAO,IAAI,IAAA,EAAM;AAC1B,MAAA,MAAM,GAAA,GAAM,MAAA,CAAO,GAAA,CAAI,KAAK,CAAC,CAAA;AAC7B,MAAA,MAAM,KAAA,GAAQ,WAAW,GAAG,CAAA;AAC5B,MAAA,MAAM,KAAA,GAAQ,cAAc,KAAK,CAAA;AACjC,MAAA,IAAI,UAAU,IAAA,EAAM;AAClB,QAAA,KAAA,CAAM,KAAK,KAAK,CAAA;AAChB,QAAA;AAAA,MACF;AACA,MAAA,GAAA,CAAI,IAAA,CAAK,EAAE,GAAA,EAAK,KAAA,EAAO,CAAA;AAAA,IACzB;AACA,IAAA,OAAO,GAAA;AAAA,EACT,CAAA;AAEA,EAAA,OAAO,EAAE,MAAM,QAAA,EAAU,GAAA,EAAK,KAAK,MAAA,EAAQ,GAAA,EAAK,KAAA,EAAO,IAAA,EAAM,OAAA,EAAQ;AACvE;;;ACnOO,IAAM,iBAAA,GAAoB,CAAC,MAAA,KAA2C;AAC3E,EAAA,MAAM,EAAE,EAAA,EAAI,EAAA,EAAI,OAAA,EAAQ,GAAI,MAAA;AAC5B,EAAA,MAAM,MAAA,GAAqB,OAAO,MAAA,IAAU,MAAA;AAK5C,EAAA,MAAM,OAAA,GAAU,OAAO,GAAA,EAAa,KAAA,KAAwC;AAC1E,IAAA,MAAM,KAAA,GAAQ,cAAc,KAAK,CAAA;AACjC,IAAA,IAAI,UAAU,IAAA,EAAM;AAClB,MAAA,MAAM,UAAU,IAAI,KAAA,CAAM,yDAAyD,GAAG,CAAA,GAAA,EAAM,KAAK,CAAA,CAAE,CAAA;AACnG,MAAA,IAAI,OAAA,UAAiB,OAAO,CAAA;AAAA,WACvB,OAAA,CAAQ,MAAM,OAAO,CAAA;AAC1B,MAAA,aAAA,CAAc,EAAA,CAAG,MAAA,CAAO,GAAG,CAAA,EAAG,OAAO,CAAA;AACrC,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,MAAM,EAAA,CAAG,GAAA,CAAI,GAAA,EAAK,KAAK,CAAA;AACvB,IAAA,OAAO,IAAA;AAAA,EACT,CAAA;AAEA,EAAA,MAAM,OAAO,YAA2B;AACtC,IAAA,MAAM,GAAG,IAAA,IAAO;AAChB,IAAA,MAAM,GAAG,IAAA,IAAO;AAEhB,IAAA,IAAI,WAAW,MAAA,EAAQ;AAEvB,IAAA,IAAI,OAAO,MAAA,KAAW,QAAA,IAAY,MAAA,CAAO,SAAS,SAAA,EAAW;AAC3D,MAAA,KAAA,MAAW,GAAA,IAAO,OAAO,YAAA,EAAc;AACrC,QAAA,MAAM,KAAA,GAAQ,MAAM,EAAA,CAAG,GAAA,CAAI,GAAG,CAAA;AAC9B,QAAA,IAAI,KAAA,KAAU,MAAA,EAAW,MAAM,OAAA,CAAQ,KAAK,KAAK,CAAA;AAAA,MACnD;AACA,MAAA;AAAA,IACF;AAIA,IAAA,IAAI,GAAG,OAAA,EAAS;AACd,MAAA,MAAM,GAAA,GAAM,MAAM,EAAA,CAAG,OAAA,EAAQ;AAC7B,MAAA,KAAA,MAAW,EAAE,KAAK,KAAA,EAAM,IAAK,KAAK,MAAM,OAAA,CAAQ,KAAK,KAAK,CAAA;AAC1D,MAAA;AAAA,IACF;AACA,IAAA,MAAMC,KAAAA,GAAO,MAAM,EAAA,CAAG,IAAA,EAAK;AAC3B,IAAA,KAAA,MAAW,OAAOA,KAAAA,EAAM;AACtB,MAAA,MAAM,KAAA,GAAQ,MAAM,EAAA,CAAG,GAAA,CAAI,GAAG,CAAA;AAC9B,MAAA,IAAI,KAAA,KAAU,MAAA,EAAW,MAAM,OAAA,CAAQ,KAAK,KAAK,CAAA;AAAA,IACnD;AAAA,EACF,CAAA;AAEA,EAAA,MAAM,GAAA,GAAM,OAAO,GAAA,KAAiD;AAClE,IAAA,MAAM,GAAA,GAAM,MAAM,EAAA,CAAG,GAAA,CAAI,GAAG,CAAA;AAC5B,IAAA,IAAI,GAAA,KAAQ,QAAW,OAAO,GAAA;AAE9B,IAAA,MAAM,MAAA,GAAS,MAAM,EAAA,CAAG,GAAA,CAAI,GAAG,CAAA;AAC/B,IAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AAEjC,IAAA,MAAM,EAAA,GAAK,MAAM,OAAA,CAAQ,GAAA,EAAK,MAAM,CAAA;AACpC,IAAA,OAAO,KAAK,MAAA,GAAS,MAAA;AAAA,EACvB,CAAA;AAEA,EAAA,MAAM,GAAA,GAAM,OAAO,GAAA,EAAa,KAAA,KAAqC;AACnE,IAAA,MAAM,EAAA,CAAG,GAAA,CAAI,GAAA,EAAK,KAAK,CAAA;AACvB,IAAA,aAAA,CAAc,EAAA,CAAG,GAAA,CAAI,GAAA,EAAK,KAAK,GAAG,OAAO,CAAA;AAAA,EAC3C,CAAA;AAEA,EAAA,MAAM,GAAA,GAAM,OAAO,GAAA,KAA+B;AAChD,IAAA,MAAM,EAAA,CAAG,OAAO,GAAG,CAAA;AACnB,IAAA,aAAA,CAAc,EAAA,CAAG,MAAA,CAAO,GAAG,CAAA,EAAG,OAAO,CAAA;AAAA,EACvC,CAAA;AAEA,EAAA,MAAM,QAAQ,YAA2B;AACvC,IAAA,MAAM,GAAG,KAAA,EAAM;AACf,IAAA,aAAA,CAAc,EAAA,CAAG,KAAA,EAAM,EAAG,OAAO,CAAA;AAAA,EACnC,CAAA;AAIA,EAAA,MAAM,IAAA,GAAO,YAA+B,EAAA,CAAG,IAAA,EAAK;AAEpD,EAAA,OAAO,EAAE,IAAA,EAAM,GAAA,EAAK,KAAK,MAAA,EAAQ,GAAA,EAAK,OAAO,IAAA,EAAM,GAAI,EAAA,CAAG,QAAA,KAAa,SAAY,EAAE,QAAA,EAAU,GAAG,QAAA,EAAS,GAAI,EAAC,EAAG;AACrH;ACzEA,IAAM,IAAA,GAAO,CAAC,CAAA,EAAY,CAAA,KACxB,MAAM,MAAA,IAAa,CAAA,KAAM,MAAA,GAAY,CAAA,KAAM,CAAA,GAAI,aAAA,CAAc,CAAC,CAAA,KAAM,cAAc,CAAC,CAAA;AAE9E,IAAM,SAAA,GAAY,OAAO,KAAA,EAAqB,OAAA,KAAkE;AACrH,EAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,IAAA,MAAM,QAAA,GAAW,MAAM,KAAA,CAAM,GAAA,CAAI,MAAM,WAAW,CAAA;AAElD,IAAA,IAAI,cAAc,KAAA,EAAO;AACvB,MAAA,MAAM,MAAA,GAAS,YAAA,CAAa,KAAA,CAAM,QAAQ,CAAA;AAC1C,MAAA,IAAI,MAAA,CAAO,SAAS,CAAA,EAAG;AACrB,QAAA,MAAM,IAAI,KAAA,CAAM,CAAA,eAAA,EAAkB,KAAA,CAAM,WAAW,CAAA;AAAA,EAAA,EAAkC,MAAA,CAAO,IAAA,CAAK,MAAM,CAAC,CAAA,CAAE,CAAA;AAAA,MAC5G;AACA,MAAA,MAAMC,QAAAA,GACJ,UAAU,IAAA,KAAS,UAAA,IACnB,SAAS,SAAA,KAAc,IAAA,IACvB,IAAA,CAAK,QAAA,CAAS,QAAA,EAAU,KAAA,CAAM,QAAQ,CAAA,IACtC,IAAA,CAAK,QAAA,CAAS,KAAA,EAAO,KAAA,CAAM,KAAK,KAChC,IAAA,CAAK,QAAA,CAAS,MAAA,EAAQ,KAAA,CAAM,MAAM,CAAA;AACpC,MAAA,IAAIA,QAAAA,EAAS;AACb,MAAA,MAAM,KAAA,CAAM,GAAA,CAAI,KAAA,CAAM,WAAA,EAAa;AAAA,QACjC,IAAA,EAAM,UAAA;AAAA,QACN,UAAU,KAAA,CAAM,QAAA;AAAA,QAChB,GAAI,MAAM,KAAA,KAAU,MAAA,GAAY,EAAE,KAAA,EAAO,KAAA,CAAM,KAAA,EAAM,GAAI,EAAC;AAAA,QAC1D,GAAI,MAAM,MAAA,KAAW,MAAA,GAAY,EAAE,MAAA,EAAQ,KAAA,CAAM,MAAA,EAAO,GAAI,EAAC;AAAA,QAC7D,SAAA,EAAW,IAAA;AAAA,QACX,SAAA,EAAW,KAAK,GAAA;AAAI,OACrB,CAAA;AACD,MAAA;AAAA,IACF;AAIA,IAAA,MAAM,OAAA,GAAU,MAAM,OAAA,CAAQ,KAAA,CAAM,WAAW,EAAE,IAAA,EAAM,YAAY,CAAA;AAGnE,IAAA,MAAM,UACJ,QAAA,EAAU,IAAA,KAAS,QACnB,QAAA,CAAS,SAAA,KAAc,QACvB,QAAA,CAAS,OAAA,EAAS,KAAK,WAAA,KAAgB,OAAA,CAAQ,KAAK,WAAA,IACpD,IAAA,CAAK,SAAS,GAAA,EAAK,KAAA,CAAM,GAAG,CAAA,IAC5B,IAAA,CAAK,QAAA,CAAS,KAAA,EAAO,MAAM,KAAK,CAAA,IAChC,KAAK,QAAA,CAAS,KAAA,EAAO,MAAM,KAAK,CAAA,IAChC,KAAK,QAAA,CAAS,MAAA,EAAQ,MAAM,MAAM,CAAA,IAAA,CACjC,SAAS,OAAA,IAAW,UAAA,OAAiB,MAAM,OAAA,IAAW,UAAA,CAAA;AACzD,IAAA,IAAI,OAAA,EAAS;AACb,IAAA,MAAM,KAAA,CAAM,GAAA,CAAI,KAAA,CAAM,WAAA,EAAa;AAAA,MACjC,IAAA,EAAM,IAAA;AAAA,MACN,GAAI,MAAM,OAAA,KAAY,MAAA,GAAY,EAAE,OAAA,EAAS,KAAA,CAAM,OAAA,EAAQ,GAAI,EAAC;AAAA,MAChE,KAAK,KAAA,CAAM,GAAA;AAAA,MACX,OAAA;AAAA,MACA,GAAI,MAAM,KAAA,KAAU,MAAA,GAAY,EAAE,KAAA,EAAO,KAAA,CAAM,KAAA,EAAM,GAAI,EAAC;AAAA,MAC1D,GAAI,MAAM,MAAA,KAAW,MAAA,GAAY,EAAE,MAAA,EAAQ,KAAA,CAAM,MAAA,EAAO,GAAI,EAAC;AAAA,MAC7D,GAAI,MAAM,KAAA,KAAU,MAAA,GAAY,EAAE,KAAA,EAAO,KAAA,CAAM,KAAA,EAAM,GAAI,EAAC;AAAA,MAC1D,SAAA,EAAW,IAAA;AAAA,MACX,SAAA,EAAW,KAAK,GAAA;AAAI,KACrB,CAAA;AAAA,EACH;AACF","file":"index.js","sourcesContent":["import type { Query } from '../schemas/query.schema.js';\nimport type { Filter } from '../schemas/filter.schema.js';\nimport type { ComputeExpression } from '../schemas/compute.schema.js';\nimport type { AggregateExpression } from '../schemas/aggregate.schema.js';\nimport type { FieldOrValue } from '../schemas/value.schema.js';\nimport { refuseOptional } from '../engine/optional.js';\nimport { isFieldPathShape } from '../schemas/identifier.schema.js';\n\n// ───────────────────────────────────────────────────────────────\n// Helpers\n// ───────────────────────────────────────────────────────────────\n\nexport const extractEntityFromPath = (path: string): string | undefined => {\n const parts = path.split('.');\n return parts.length === 2 ? parts[0] : undefined;\n};\n\n// A VALUE is a column only when it is shaped like one — the resolver and the\n// compiler use the same rule, so a literal like \"u1@x.com\" is never mistaken\n// for a table here and refused as one. (Field positions below keep the looser\n// split: over-collecting there can only refuse more, and the resolver refuses\n// anything in a field position that is not a real column anyway.)\nconst collectFromFieldOrValue = (fov: FieldOrValue, out: Set<string>): void => {\n if (isFieldPathShape(fov)) {\n const entity = extractEntityFromPath(fov);\n if (entity !== undefined) out.add(entity);\n }\n // numbers, booleans, null, $context, $scope — no entity to extract\n};\n\n// ───────────────────────────────────────────────────────────────\n// Filter walker\n// ───────────────────────────────────────────────────────────────\n\nconst collectFromFilter = (filter: Filter, out: Set<string>): void => {\n // An EXISTS reads tables, so its tables are discovered like any other — a\n // denied entity cannot be reached by hiding it inside a subquery.\n if ('exists' in filter) {\n for (const entity of filter.exists.from) out.add(entity);\n if (filter.exists.filter !== undefined) collectFromFilter(filter.exists.filter, out);\n return;\n }\n\n if ('eq' in filter || 'neq' in filter || 'gt' in filter || 'gte' in filter || 'lt' in filter || 'lte' in filter) {\n const pair = ('eq' in filter) ? filter.eq\n : ('neq' in filter) ? filter.neq\n : ('gt' in filter) ? filter.gt\n : ('gte' in filter) ? filter.gte\n : ('lt' in filter) ? filter.lt\n : filter.lte;\n collectFromFieldOrValue(pair[0], out);\n collectFromFieldOrValue(pair[1], out);\n return;\n }\n\n if ('in' in filter || 'notIn' in filter) {\n const tuple = 'in' in filter ? filter.in : filter.notIn;\n const entity = extractEntityFromPath(tuple[0]);\n if (entity !== undefined) out.add(entity);\n const target = tuple[1];\n if (Array.isArray(target)) {\n for (const v of target) {\n collectFromFieldOrValue(v, out);\n }\n }\n // ContextRef / ScopeRef — no entity\n return;\n }\n\n if ('like' in filter || 'ilike' in filter) {\n const tuple = 'like' in filter ? filter.like : filter.ilike;\n const entity = extractEntityFromPath(tuple[0]);\n if (entity !== undefined) out.add(entity);\n collectFromFieldOrValue(tuple[1], out);\n return;\n }\n\n if ('isNull' in filter) {\n const entity = extractEntityFromPath(filter.isNull);\n if (entity !== undefined) out.add(entity);\n return;\n }\n\n if ('isNotNull' in filter) {\n const entity = extractEntityFromPath(filter.isNotNull);\n if (entity !== undefined) out.add(entity);\n return;\n }\n\n if ('and' in filter) {\n for (const sub of filter.and) {\n collectFromFilter(sub, out);\n }\n return;\n }\n\n if ('or' in filter) {\n for (const sub of filter.or) {\n collectFromFilter(sub, out);\n }\n return;\n }\n\n if ('not' in filter) {\n collectFromFilter(filter.not, out);\n return;\n }\n\n if ('semantic' in filter) {\n const entity = extractEntityFromPath(filter.semantic.field);\n if (entity !== undefined) out.add(entity);\n return;\n }\n\n if ('fuzzy' in filter) {\n const entity = extractEntityFromPath(filter.fuzzy.field);\n if (entity !== undefined) out.add(entity);\n return;\n }\n\n // THE ONE THAT MATTERS. This walker decides which entities get scope\n // injected; a node it does not recognise falls through and contributes\n // nothing, so an entity mentioned only inside an unrecognised node would be\n // read WITHOUT a tenant filter. `optional` is resolved before the pipeline\n // (engine/optional.ts) precisely so it can never reach here — and if it ever\n // does, that is a scope hole, not a missing feature.\n if ('optional' in filter) refuseOptional('scope discovery');\n};\n\n// ───────────────────────────────────────────────────────────────\n// Compute walker\n// ───────────────────────────────────────────────────────────────\n\nconst collectFromCompute = (expr: ComputeExpression, out: Set<string>): void => {\n if ('add' in expr || 'subtract' in expr || 'multiply' in expr || 'divide' in expr) {\n const pair = ('add' in expr) ? expr.add\n : ('subtract' in expr) ? expr.subtract\n : ('multiply' in expr) ? expr.multiply\n : expr.divide;\n collectFromFieldOrValue(pair[0], out);\n collectFromFieldOrValue(pair[1], out);\n return;\n }\n\n if ('concat' in expr) {\n for (const v of expr.concat) {\n collectFromFieldOrValue(v, out);\n }\n return;\n }\n\n if ('coalesce' in expr) {\n for (const v of expr.coalesce) {\n collectFromFieldOrValue(v, out);\n }\n return;\n }\n\n if ('case' in expr) {\n for (const when of expr.case.when) {\n collectFromFilter(when.condition, out);\n collectFromFieldOrValue(when.then, out);\n }\n collectFromFieldOrValue(expr.case.else, out);\n return;\n }\n};\n\n// ───────────────────────────────────────────────────────────────\n// Aggregate walker\n// ───────────────────────────────────────────────────────────────\n\nconst collectFromAggregate = (expr: AggregateExpression, out: Set<string>): void => {\n const arg = ('count' in expr) ? expr.count\n : ('countDistinct' in expr) ? expr.countDistinct\n : ('sum' in expr) ? expr.sum\n : ('avg' in expr) ? expr.avg\n : ('min' in expr) ? expr.min\n : expr.max;\n // sum/avg/min/max may take a compute expression — walk it for entities.\n if (typeof arg !== 'string') {\n collectFromCompute(arg, out);\n return;\n }\n const entity = extractEntityFromPath(arg);\n if (entity !== undefined) out.add(entity);\n};\n\n// ───────────────────────────────────────────────────────────────\n// Public API\n// ───────────────────────────────────────────────────────────────\n\nconst collectFromQuery = (dsl: Query, out: Set<string>): void => {\n // A subquery source introduces an ALIAS (`{ as: 'c', query }`): a derived\n // relation, not a table. References to the alias at this level (`c.n`) are\n // not entities — the subquery's REAL tables are collected (and scoped) by\n // the recursion. Everything referenced at this level lands in `local`\n // first, and aliases are subtracted before merging into `out`.\n const aliases = new Set<string>();\n const local = new Set<string>();\n\n // from\n for (const source of dsl.from) {\n if (typeof source === 'string') {\n out.add(source);\n } else {\n aliases.add(source.as);\n collectFromQuery(source.query, out);\n }\n }\n\n // fields (optional; an entry may be a bare path or { field, as })\n for (const ref of dsl.fields ?? []) {\n const entity = extractEntityFromPath(typeof ref === 'string' ? ref : ref.field);\n if (entity !== undefined) local.add(entity);\n }\n\n // filter\n if (dsl.filter !== undefined) {\n collectFromFilter(dsl.filter, local);\n }\n\n // compute\n if (dsl.compute !== undefined) {\n for (const key of Object.keys(dsl.compute)) {\n const expr = dsl.compute[key];\n if (expr !== undefined) {\n collectFromCompute(expr, local);\n }\n }\n }\n\n // aggregate\n if (dsl.aggregate !== undefined) {\n for (const key of Object.keys(dsl.aggregate)) {\n const expr = dsl.aggregate[key];\n if (expr !== undefined) {\n collectFromAggregate(expr, local);\n }\n }\n }\n\n // groupBy\n if (dsl.groupBy !== undefined) {\n for (const path of dsl.groupBy) {\n const entity = extractEntityFromPath(path);\n if (entity !== undefined) local.add(entity);\n }\n }\n\n // sort\n if (dsl.sort !== undefined) {\n for (const entry of dsl.sort) {\n const entity = extractEntityFromPath(entry.field);\n if (entity !== undefined) local.add(entity);\n }\n }\n\n for (const entity of local) {\n if (!aliases.has(entity)) out.add(entity);\n }\n};\n\nexport const discoverEntities = (dsl: Query): Set<string> => {\n const entities = new Set<string>();\n collectFromQuery(dsl, entities);\n return entities;\n};\n","import type { ScopePolicy, ScopeMatch, ScopeRule, ScopeValues } from './scope.types.js';\nimport { isSetMatch } from './scope.types.js';\nimport type { ScopeBinding } from '../types.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Grants — a ScopePolicy described as strings.\n//\n// A grant is `<table>.<verb>` where the verb is one of SCOPE_VERBS —\n// vex's own phase grammar as leaves: `read`, plus the three write ops\n// under the `write` namespace. `write` itself is never a grant; a caller\n// that means \"every write\" grants all three (an ACL layer above does\n// that with a glob — `deals.write.*`).\n//\n// The dialect exists so a policy layer (a charter, a role system, a\n// config file) can hand vex a flat string set and get vex's native\n// contract back — with no imports in either direction: the strings are\n// opaque to the layer that resolves them and native to vex, which is\n// where their meaning lives.\n// ═══════════════════════════════════════════════════════════════\n\nexport const SCOPE_VERBS = ['read', 'write.insert', 'write.update', 'write.delete'] as const;\n\n// Every grant a set of tables can carry — tables × SCOPE_VERBS. The full\n// set a policy layer resolves selections against; derived, never authored\n// (a server derives `tables` from the introspected schema).\nexport const scopeGrants = (tables: readonly string[]): string[] =>\n tables.flatMap((t) => SCOPE_VERBS.map((v) => `${t}.${v}`));\n\n// The static, app-owned row behaviors: per table, what a GRANTED phase\n// does. NOT access control — listing a table here grants nothing; the\n// grant set decides whether a phase exists. `write` behaviors apply to\n// every granted write phase (the umbrella, applied at build time); the\n// specific keys stack on top for their op. Deliberately the rules-only\n// subset of ScopeEntityRule: its `public`/`deny` variants are access\n// control, which behaviors must never carry.\nexport type ScopeRules = { read?: ScopeMatch[]; write?: ScopeRule[]; insert?: ScopeRule[]; update?: ScopeRule[]; delete?: ScopeMatch[] };\n\n// A table carries EITHER one rule set — the shape above, unchanged — or several\n// NAMED ones, of which `default` is what an unprofiled principal gets.\n//\n// WHY: scoping used to be a property of the TABLE, so every rung holding any\n// grant on it got the same reach. \"The desk reads every booking; a member reads\n// their own\" was therefore unsayable, and the only way to say it was a SECOND\n// TABLE carrying the tighter rule — one fact in two places, kept level by a\n// trigger, drifting the first time the trigger was wrong.\n//\n// Reach is a property of the RUNG, not of the grant and not of the table: a\n// member acts for themselves whatever they are reading. So the profile is\n// chosen once, per principal, and applies to every table they touch — falling\n// back to a table's `default` where it declares no variant, which is what makes\n// the common case (a shared timetable, read the ordinary way) need no entry.\n//\n// The two shapes are told apart by their keys: a rule set has at least one of\n// read/write/insert/update/delete, a named map has none of them.\nexport type NamedScopeBehaviors = Record<string, ScopeRules>;\n\nexport type ScopeBehaviors = Record<string, ScopeRules | NamedScopeBehaviors>;\n\nconst RULE_KEYS = ['read', 'write', 'insert', 'update', 'delete'] as const;\n\nconst isRuleSet = (value: ScopeRules | NamedScopeBehaviors): value is ScopeRules =>\n RULE_KEYS.some((k) => k in value);\n\n// THE LOOKUP.\n//\n// A table with no entry at all is rule-free, as before — listing a table in\n// behaviors was never what granted it.\n//\n// A table declaring NAMED variants and no `default` refuses an unprofiled\n// principal rather than falling through to no rules. That is the fail-closed\n// half: a table whose author went to the trouble of naming its reaches is one\n// where \"no rule\" is not a safe guess.\nconst behaviorFor = (behaviors: ScopeBehaviors, table: string, profile: string | undefined): ScopeRules | undefined => {\n const entry = behaviors[table];\n if (entry === undefined) return {};\n if (isRuleSet(entry)) return entry;\n // Named map: the profile if the table declares it, otherwise the default.\n return (profile === undefined ? undefined : entry[profile]) ?? entry['default'];\n};\n\nconst onlyMatches = (rules: ScopeRule[]): ScopeMatch[] => rules.filter((r): r is ScopeMatch => 'match' in r);\n\n// Grants + behaviors → a ScopePolicy. Each granted leaf becomes a\n// SPECIFIC phase (the builder never emits the `write` umbrella — the\n// caller already resolved it, so the output is exact); a granted phase\n// carries the table's umbrella behaviors plus its op's own, and delete\n// keeps matches only (nothing to set). Ungranted phases are absent, and\n// `default: 'deny'` refuses them — deny by absence.\nconst VERBS: ReadonlySet<string> = new Set(SCOPE_VERBS);\n\n// ═══════════════════════════════════════════════════════════════\n// WHO \"ME\" IS, READ OFF THE BEHAVIORS.\n//\n// A rule binds a column to a scope key — `{ set: 'member_id', to: 'userId' }`,\n// `{ match: 'studio_id', to: 'tenantId' }` — and the scope values are always\n// the caller's own. So a column bound to a key the caller carries holds that\n// value on the caller's own rows, whatever either is called: this is read from\n// what the host DECLARED, never guessed from a name. Every reach and every\n// phase counts, because which column is the caller's does not depend on what\n// this caller may do to it — a reader holds no insert, yet the insert's stamp\n// is what says `member_id` is them.\n// ═══════════════════════════════════════════════════════════════\n\n/** Every rule a table declares, in every reach and phase, as (column, key) pairs. */\nconst bindingsOf = (entry: ScopeRules | NamedScopeBehaviors): { field: string; key: string }[] =>\n (isRuleSet(entry) ? [entry] : Object.values(entry)).flatMap((rules) =>\n RULE_KEYS.flatMap((phase) =>\n (rules[phase] ?? []).map((rule: ScopeRule) =>\n 'set' in rule ? { field: rule.set, key: rule.to } : isSetMatch(rule) ? { field: rule.match, key: rule.in } : { field: rule.match, key: rule.to },\n ),\n ),\n );\n\n/**\n * The columns the behaviors bind to scope keys, on the given tables, for the\n * keys present in `scope` — sorted, one per (table, column, key).\n */\nexport const scopeBindings = (behaviors: ScopeBehaviors, tables: readonly string[], scope: ScopeValues): ScopeBinding[] => {\n const seen = new Map<string, ScopeBinding>();\n for (const table of tables) {\n const entry = behaviors[table];\n if (entry === undefined) continue;\n for (const { field, key } of bindingsOf(entry)) {\n if (scope[key] === undefined || scope[key] === null) continue;\n seen.set(`${table}.${field}:${key}`, { entity: table, field, key });\n }\n }\n return [...seen.values()].sort((a, b) => `${a.entity}.${a.field}:${a.key}`.localeCompare(`${b.entity}.${b.field}:${b.key}`));\n};\n\n/** Every (table, column) any rule names — for checking them against a schema. */\nexport const behaviorColumns = (behaviors: ScopeBehaviors): { entity: string; field: string }[] =>\n Object.entries(behaviors).flatMap(([table, entry]) => bindingsOf(entry).map(({ field }) => ({ entity: table, field })));\n\n/** Every profile name any table declares. A profile nobody declares is a typo. */\nexport const scopeProfiles = (behaviors: ScopeBehaviors): ReadonlySet<string> => {\n const names = new Set<string>();\n for (const entry of Object.values(behaviors)) {\n if (isRuleSet(entry)) continue;\n for (const name of Object.keys(entry)) if (name !== 'default') names.add(name);\n }\n return names;\n};\n\n// `scoping` names the principal's profile — the rung's answer to \"how far does\n// this person reach\", chosen once and applied to every table they touch. An\n// UNKNOWN profile is refused wholesale: it cannot silently mean \"the default\",\n// because a mistyped profile would then widen a member to every row in every\n// table they hold a grant on. That is the one failure mode a policy layer may\n// not have, so it is a hard refusal rather than a fallback.\nexport const createScopePolicy = (\n grants: ReadonlySet<string>,\n behaviors: ScopeBehaviors = {},\n scoping?: string,\n): ScopePolicy => {\n if (scoping !== undefined && !scopeProfiles(behaviors).has(scoping)) return { default: 'deny', entities: {} };\n const entities: Record<string, { read?: ScopeMatch[]; insert?: ScopeRule[]; update?: ScopeRule[]; delete?: ScopeMatch[] }> = {};\n for (const grant of grants) {\n const dot = grant.indexOf('.'); // table names carry no dots; the rest is the verb\n if (dot < 0) continue;\n const table = grant.slice(0, dot);\n const verb = grant.slice(dot + 1);\n if (!VERBS.has(verb)) continue; // a malformed verb grants nothing, not even an entity entry\n const b = behaviorFor(behaviors, table, scoping);\n if (b === undefined) continue; // the profile names nothing for this table — grant nothing\n const rule = (entities[table] ??= {});\n if (verb === 'read') rule.read = b?.read ?? [];\n else if (verb === 'write.insert') rule.insert = [...(b?.write ?? []), ...(b?.insert ?? [])];\n else if (verb === 'write.update') rule.update = [...(b?.write ?? []), ...(b?.update ?? [])];\n else if (verb === 'write.delete') rule.delete = [...onlyMatches(b?.write ?? []), ...(b?.delete ?? [])];\n }\n return { default: 'deny', entities };\n};\n\n// ═══════════════════════════════════════════════════════════════\n// A PRINCIPAL MAY HOLD SEVERAL ROLES, and reach belongs to the role.\n//\n// One policy per principal assumes one role per principal. That assumption\n// survives right up until somebody is two things at once — an instructor who\n// also trains is staff on the roster and a member in the class — and then a\n// single profile cannot describe them: studio-wide on the read they do as\n// staff, their own rows on the write they do as a member.\n//\n// So a policy is compiled PER ROLE, each with that role's own reach, and the\n// results are merged here. A principal may do anything any of their roles\n// permits, which is what makes holding two roles additive rather than a\n// conflict to be refused.\n//\n// MERGE RULE: per entity and phase, the BROADEST rule set wins — fewest match\n// rules, since every match narrows. Profiles are refinements of a default\n// (personal = the tenant rule plus one more), so \"fewest\" is \"widest\" in\n// practice, and a phase only one role grants keeps that role's rules intact\n// (which is what carries a member's identity stamp onto a write no other role\n// grants).\n// ═══════════════════════════════════════════════════════════════\n\nconst matchCount = (rules: readonly (ScopeMatch | ScopeRule)[] | undefined): number =>\n (rules ?? []).filter((r) => 'match' in r).length;\n\n/** The union of several compiled policies: anything any of them permits. */\nexport const mergeScopePolicies = (policies: readonly ScopePolicy[]): ScopePolicy => {\n const entities: Record<string, { read?: ScopeMatch[]; insert?: ScopeRule[]; update?: ScopeRule[]; delete?: ScopeMatch[] }> = {};\n for (const policy of policies) {\n for (const [table, rule] of Object.entries(policy.entities)) {\n if (rule === undefined || 'public' in rule || 'deny' in rule) continue;\n const into = (entities[table] ??= {});\n for (const phase of ['read', 'insert', 'update', 'delete'] as const) {\n const incoming = rule[phase];\n if (incoming === undefined) continue;\n const held = into[phase];\n // Absent means the phase is refused, so the first grant always wins the\n // slot; after that, fewer matches means wider access.\n if (held === undefined || matchCount(incoming) < matchCount(held)) {\n (into as Record<string, unknown>)[phase] = incoming;\n }\n }\n }\n }\n return { default: 'deny', entities };\n};\n","import type { Query } from '../schemas/query.schema.js';\nimport type { Filter } from '../schemas/filter.schema.js';\nimport type { ComputeExpression } from '../schemas/compute.schema.js';\nimport type { AggregateExpression } from '../schemas/aggregate.schema.js';\nimport type { FieldOrValue } from '../schemas/value.schema.js';\nimport { refuseOptional } from './optional.js';\nimport type { DatabaseSchema, EntitySchema, FieldSchema, NormalizedType } from '../schemas/database.schema.js';\nimport type {\n ResolvedQuery,\n ResolvedSource,\n ResolvedField,\n ResolvedJoin,\n ResolvedFilter,\n ResolvedSemantic,\n ResolvedExists,\n} from './engine.types.js';\nimport { VexError } from '../errors.js';\nimport { isFieldPathShape, isIdentifier } from '../schemas/identifier.schema.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Levenshtein distance for \"did you mean?\" suggestions\n// ═══════════════════════════════════════════════════════════════\n\nconst levenshtein = (a: string, b: string): number => {\n const la = a.length;\n const lb = b.length;\n if (la === 0) return lb;\n if (lb === 0) return la;\n\n // Two-row approach to save memory\n let prev = Array.from({ length: lb + 1 }, (_, i) => i);\n let curr = new Array<number>(lb + 1);\n\n for (let i = 1; i <= la; i++) {\n curr[0] = i;\n for (let j = 1; j <= lb; j++) {\n const cost = a[i - 1] === b[j - 1] ? 0 : 1;\n const prevJ = prev[j] ?? 0;\n const currJ1 = curr[j - 1] ?? 0;\n const prevJ1 = prev[j - 1] ?? 0;\n curr[j] = Math.min(prevJ + 1, currJ1 + 1, prevJ1 + cost);\n }\n [prev, curr] = [curr, prev];\n }\n\n return prev[lb] ?? 0;\n};\n\nconst findClosest = (target: string, candidates: string[]): string | undefined => {\n let best: string | undefined;\n let bestDist = Infinity;\n for (const c of candidates) {\n const dist = levenshtein(target.toLowerCase(), c.toLowerCase());\n if (dist < bestDist) {\n bestDist = dist;\n best = c;\n }\n }\n // Only suggest if reasonably close\n if (bestDist <= Math.max(3, Math.ceil(target.length / 2))) {\n return best;\n }\n return undefined;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Alias generation\n// ═══════════════════════════════════════════════════════════════\n\ntype AliasCounter = Map<string, number>;\n\nconst generateAlias = (name: string, counter: AliasCounter): string => {\n const prefix = name.charAt(0).toLowerCase();\n const current = counter.get(prefix) ?? 0;\n const next = current + 1;\n counter.set(prefix, next);\n return `${prefix}${next}`;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Entity & field lookup\n// ═══════════════════════════════════════════════════════════════\n\nconst findEntity = (name: string, schema: DatabaseSchema): EntitySchema => {\n const found = schema.entities.find((e) => e.name === name);\n if (found !== undefined) return found;\n\n const allNames = schema.entities.map((e) => e.name);\n const suggestion = findClosest(name, allNames);\n const hint = suggestion !== undefined ? ` Did you mean \"${suggestion}\"?` : '';\n throw new VexError(\n 'invalid_dsl',\n `Entity \"${name}\" not found in schema.${hint}`,\n { suggestion, options: allNames },\n );\n};\n\nconst findField = (fieldName: string, entity: EntitySchema): FieldSchema => {\n const found = entity.fields.find((f) => f.name === fieldName);\n if (found !== undefined) return found;\n\n const allFields = entity.fields.map((f) => f.name);\n const suggestion = findClosest(fieldName, allFields);\n const hint = suggestion !== undefined ? ` Did you mean \"${suggestion}\"?` : '';\n throw new VexError(\n 'invalid_dsl',\n `Field \"${fieldName}\" not found on entity \"${entity.name}\".${hint} Available fields: ${allFields.join(', ')}`,\n { suggestion, options: allFields },\n );\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Path parsing\n// ═══════════════════════════════════════════════════════════════\n\n// Both halves are names, so both are held to the name grammar — a field path\n// that resolves is a column the schema has, and one that does not is refused\n// here rather than reaching SQL as text.\nconst parsePath = (path: string): { entity: string; field: string } => {\n if (!isFieldPathShape(path)) {\n throw new VexError(\n 'invalid_dsl',\n `Invalid field path \"${path}\". Expected format: entity.field`,\n );\n }\n const dotIndex = path.indexOf('.');\n return {\n entity: path.substring(0, dotIndex),\n field: path.substring(dotIndex + 1),\n };\n};\n\n// A name the author chose — an output alias, a compute or aggregate key, a\n// subquery alias — becomes SQL text, so it must be a name and nothing else.\n// The schema says the same thing; this says it for a DSL that skipped the\n// schema (`engine.compile`, `engine.test`).\nconst assertName = (name: string, what: string): void => {\n if (!isIdentifier(name)) {\n throw new VexError('invalid_dsl', `Invalid ${what} \"${name}\": letters, digits and underscores, not starting with a digit.`);\n }\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Join discovery\n// ═══════════════════════════════════════════════════════════════\n\nconst findJoinBetween = (\n fromEntity: EntitySchema,\n toEntity: EntitySchema,\n fromAlias: string,\n toAlias: string,\n): ResolvedJoin | undefined => {\n // Check if fromEntity has a relation pointing to toEntity. The FK columns\n // live on the referencing side — when ANY of them is nullable, the join is\n // LEFT so a null never silently drops the referencing row. Any, not the\n // first: a composite key is MATCH SIMPLE by default, unenforced as a whole\n // once one column is null, so the row exists with no counterpart to join.\n for (const rel of fromEntity.relations) {\n if (rel.entity === toEntity.name) {\n const fkNullable = rel.localFields.some(\n (column) => fromEntity.fields.find((f) => f.name === column)?.nullable === true,\n );\n return {\n fromAlias,\n fromColumns: rel.localFields,\n toAlias,\n toColumns: rel.foreignFields,\n toTable: toEntity.table,\n kind: fkNullable ? 'left' : 'inner',\n };\n }\n }\n\n // Check reverse: toEntity has a relation pointing to fromEntity — a\n // one-to-many expansion (rows multiply per child), inner by design.\n for (const rel of toEntity.relations) {\n if (rel.entity === fromEntity.name) {\n return {\n fromAlias,\n fromColumns: rel.foreignFields,\n toAlias,\n toColumns: rel.localFields,\n toTable: toEntity.table,\n kind: 'inner',\n };\n }\n }\n\n return undefined;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Filter path resolution\n// ═══════════════════════════════════════════════════════════════\n\ntype PathResolution = { alias: string; column: string; schema: FieldSchema };\ntype EntityLookup = Map<string, { entity: EntitySchema; alias: string }>;\n\nconst resolveFieldPath = (\n path: string,\n entityLookup: EntityLookup,\n schema: DatabaseSchema,\n): { resolved: ResolvedField; entityName: string } => {\n const parsed = parsePath(path);\n const lookup = entityLookup.get(parsed.entity);\n\n if (lookup === undefined) {\n // Check if it's a known entity that's not in from\n const entityExists = schema.entities.some((e) => e.name === parsed.entity);\n if (entityExists) {\n throw new VexError(\n 'invalid_dsl',\n `Entity \"${parsed.entity}\" is referenced in field path \"${path}\" but not listed in \"from\"`,\n );\n }\n const allNames = schema.entities.map((e) => e.name);\n const suggestion = findClosest(parsed.entity, allNames);\n const hint = suggestion !== undefined ? ` Did you mean \"${suggestion}\"?` : '';\n throw new VexError(\n 'invalid_dsl',\n `Entity \"${parsed.entity}\" not found in schema.${hint}`,\n { suggestion, options: allNames },\n );\n }\n\n const fieldSchema = findField(parsed.field, lookup.entity);\n\n return {\n resolved: {\n path,\n alias: lookup.alias,\n column: fieldSchema.name,\n outputName: parsed.field,\n schema: fieldSchema,\n },\n entityName: parsed.entity,\n };\n};\n\n// In a VALUE position, a string is a column exactly when it is shaped like one;\n// anything else is a literal. (In a FIELD position there is no such choice —\n// see resolveFilterFieldPath.)\nconst isFieldPath = isFieldPathShape;\n\nconst collectFilterPaths = (\n filter: Filter,\n entityLookup: EntityLookup,\n schema: DatabaseSchema,\n resolvedPaths: Map<string, PathResolution>,\n // Both optional for a caller that structurally cannot meet an `exists`\n // (aggregate arguments). The filter path AND the compute-case path pass\n // them, so an exists resolves identically wherever a condition may sit —\n // which is what lets a derived standing ask \"do they hold a subscription?\"\n // from inside a computed CASE.\n existsOut?: Map<object, ResolvedExists>,\n aliasCounter?: AliasCounter,\n): void => {\n if ('eq' in filter || 'neq' in filter || 'gt' in filter || 'gte' in filter || 'lt' in filter || 'lte' in filter) {\n const pair = ('eq' in filter) ? filter.eq\n : ('neq' in filter) ? filter.neq\n : ('gt' in filter) ? filter.gt\n : ('gte' in filter) ? filter.gte\n : ('lt' in filter) ? filter.lt\n : filter.lte;\n resolveFilterFieldOrValue(pair[0], entityLookup, schema, resolvedPaths);\n resolveFilterFieldOrValue(pair[1], entityLookup, schema, resolvedPaths);\n return;\n }\n\n if ('in' in filter || 'notIn' in filter) {\n const tuple = 'in' in filter ? filter.in : filter.notIn;\n resolveFilterFieldPath(tuple[0], entityLookup, schema, resolvedPaths);\n const target = tuple[1];\n if (Array.isArray(target)) {\n for (const v of target) {\n resolveFilterFieldOrValue(v, entityLookup, schema, resolvedPaths);\n }\n }\n return;\n }\n\n if ('like' in filter || 'ilike' in filter) {\n const tuple = 'like' in filter ? filter.like : filter.ilike;\n resolveFilterFieldPath(tuple[0], entityLookup, schema, resolvedPaths);\n resolveFilterFieldOrValue(tuple[1], entityLookup, schema, resolvedPaths);\n return;\n }\n\n if ('isNull' in filter) {\n resolveFilterFieldPath(filter.isNull, entityLookup, schema, resolvedPaths);\n return;\n }\n\n if ('isNotNull' in filter) {\n resolveFilterFieldPath(filter.isNotNull, entityLookup, schema, resolvedPaths);\n return;\n }\n\n // An EXISTS resolves as its own little query, and is recorded against the\n // node so the compiler can find it again. Its sources are added to a lookup\n // LAYERED OVER the outer one: an inner path resolves to the inner alias, and\n // anything the inner filter mentions that the subquery does not read falls\n // through to the outer query — which is exactly what a correlation is.\n if ('exists' in filter) {\n if (existsOut === undefined || aliasCounter === undefined) return;\n const inner: EntityLookup = new Map(entityLookup);\n const innerSources: ResolvedSource[] = [];\n const innerEntities: Array<{ entity: EntitySchema; alias: string }> = [];\n const innerJoins: ResolvedJoin[] = [];\n const innerAliasMap = new Map<string, string>();\n\n for (const name of filter.exists.from) {\n const entity = findEntity(name, schema);\n // The alias counter is SHARED with the outer query, so an inner `rooms`\n // can never take the same alias as an outer one and quietly correlate a\n // table with itself.\n const alias = generateAlias(name, aliasCounter);\n inner.set(name, { entity, alias });\n innerSources.push({ alias, entity, table: entity.table });\n innerEntities.push({ entity, alias });\n }\n\n for (let i = 1; i < innerEntities.length; i += 1) {\n const curr = innerEntities[i];\n if (curr === undefined) continue;\n let found = false;\n for (let j = 0; j < i; j += 1) {\n const earlier = innerEntities[j];\n if (earlier === undefined) continue;\n const join = findJoinBetween(earlier.entity, curr.entity, earlier.alias, curr.alias);\n if (join !== undefined) {\n innerJoins.push(join);\n found = true;\n break;\n }\n }\n if (!found) throw new VexError('invalid_dsl', `No foreign key relationship found between the entities of an \"exists\" and \"${curr.entity.name}\".`);\n }\n\n let innerFilter: ResolvedFilter | undefined;\n if (filter.exists.filter !== undefined) {\n const innerPaths = new Map<string, PathResolution>();\n collectFilterPaths(filter.exists.filter, inner, schema, innerPaths, existsOut, aliasCounter);\n innerFilter = { original: filter.exists.filter, resolvedPaths: innerPaths };\n for (const [path, res] of innerPaths) {\n // Only paths the SUBQUERY owns go in its map; the rest are the outer\n // query's and resolve there.\n const owner = path.slice(0, path.indexOf('.'));\n if (filter.exists.from.includes(owner)) innerAliasMap.set(path, `${res.alias}.${res.column}`);\n else resolvedPaths.set(path, res);\n }\n }\n\n existsOut.set(filter.exists, { sources: innerSources, joins: innerJoins, filter: innerFilter, aliasMap: innerAliasMap });\n return;\n }\n\n if ('and' in filter) {\n for (const sub of filter.and) {\n collectFilterPaths(sub, entityLookup, schema, resolvedPaths, existsOut, aliasCounter);\n }\n return;\n }\n\n if ('or' in filter) {\n for (const sub of filter.or) {\n collectFilterPaths(sub, entityLookup, schema, resolvedPaths, existsOut, aliasCounter);\n }\n return;\n }\n\n if ('not' in filter) {\n collectFilterPaths(filter.not, entityLookup, schema, resolvedPaths, existsOut, aliasCounter);\n return;\n }\n\n if ('semantic' in filter) {\n resolveFilterFieldPath(filter.semantic.field, entityLookup, schema, resolvedPaths);\n return;\n }\n\n if ('fuzzy' in filter) {\n resolveFilterFieldPath(filter.fuzzy.field, entityLookup, schema, resolvedPaths);\n return;\n }\n\n // Resolved away before the pipeline — see engine/optional.ts.\n if ('optional' in filter) refuseOptional('field resolution');\n};\n\nconst resolveFilterFieldPath = (\n path: string,\n entityLookup: EntityLookup,\n schema: DatabaseSchema,\n resolvedPaths: Map<string, PathResolution>,\n): void => {\n if (resolvedPaths.has(path)) return;\n // A FIELD position (`in`, `like`, `isNull`, `semantic`, …) holds a column and\n // nothing else. It resolves or the query is refused — it used to return\n // quietly for a string without a dot, and the compiler then pasted that\n // string into the statement verbatim.\n const { resolved } = resolveFieldPath(path, entityLookup, schema);\n resolvedPaths.set(path, { alias: resolved.alias, column: resolved.column, schema: resolved.schema });\n};\n\nconst resolveFilterFieldOrValue = (\n fov: FieldOrValue,\n entityLookup: EntityLookup,\n schema: DatabaseSchema,\n resolvedPaths: Map<string, PathResolution>,\n): void => {\n if (typeof fov === 'string' && isFieldPath(fov)) {\n resolveFilterFieldPath(fov, entityLookup, schema, resolvedPaths);\n }\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Semantic filter extraction\n// ═══════════════════════════════════════════════════════════════\n\nconst extractSemantic = (\n filter: Filter,\n entityLookup: EntityLookup,\n schema: DatabaseSchema,\n): ResolvedSemantic | undefined => {\n if ('semantic' in filter) {\n const { resolved } = resolveFieldPath(filter.semantic.field, entityLookup, schema);\n const queryRef = filter.semantic.query;\n const contextPath = '$context' in queryRef ? queryRef.$context : queryRef.$scope;\n return {\n field: resolved,\n contextPath,\n minScore: filter.semantic.minScore,\n };\n }\n\n if ('and' in filter) {\n for (const sub of filter.and) {\n const result = extractSemantic(sub, entityLookup, schema);\n if (result !== undefined) return result;\n }\n }\n\n if ('or' in filter) {\n for (const sub of filter.or) {\n const result = extractSemantic(sub, entityLookup, schema);\n if (result !== undefined) return result;\n }\n }\n\n if ('not' in filter) {\n return extractSemantic(filter.not, entityLookup, schema);\n }\n\n return undefined;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Main resolver\n// ═══════════════════════════════════════════════════════════════\n\nexport const resolve = (dsl: Query, schema: DatabaseSchema): ResolvedQuery => {\n const aliasCounter: AliasCounter = new Map();\n const entityLookup: EntityLookup = new Map();\n const aliasMap = new Map<string, string>();\n const sources: ResolvedSource[] = [];\n const joins: ResolvedJoin[] = [];\n\n // ─── Resolve sources ───────────────────────────────────────\n const entitySources: Array<{ entity: EntitySchema; alias: string }> = [];\n\n for (const source of dsl.from) {\n if (typeof source === 'string') {\n const entity = findEntity(source, schema);\n const alias = generateAlias(source, aliasCounter);\n\n entityLookup.set(source, { entity, alias });\n sources.push({ alias, entity, table: entity.table });\n entitySources.push({ entity, alias });\n } else {\n // Subquery source — after the typeof string check, source is narrowed\n assertName(source.as, 'subquery alias');\n const subResolved = resolve(source.query, schema);\n const alias = source.as;\n\n // Expose the subquery's OUTPUT columns as a synthetic entity, so the\n // outer query can reference them as `alias.field`. That's every selected\n // field (under its output name — `as` if aliased), plus every compute and\n // aggregate alias. Without the aggregate outputs, a cross-joined count\n // subquery's `alias.n` would not resolve.\n const synthField = (name: string, normalizedType: NormalizedType): FieldSchema => ({\n name,\n type: normalizedType,\n normalizedType,\n nullable: true,\n primaryKey: false,\n });\n const syntheticFields: FieldSchema[] = [\n ...subResolved.fields.map((f) => ({ ...f.schema, name: f.outputName })),\n ...subResolved.computes.map((c) => synthField(c.name, 'unknown')),\n ...subResolved.aggregates.map((a) => synthField(a.name, 'number')),\n ];\n const syntheticEntity: EntitySchema = {\n name: alias,\n table: alias,\n fields: syntheticFields,\n relations: [],\n indexes: [],\n };\n\n entityLookup.set(alias, { entity: syntheticEntity, alias });\n sources.push({ alias, subquery: subResolved });\n }\n }\n\n // ─── Discover joins ────────────────────────────────────────\n for (let i = 1; i < entitySources.length; i++) {\n const prev = entitySources[i - 1];\n const curr = entitySources[i];\n if (prev === undefined || curr === undefined) continue;\n\n // Try to find a join path from any previously seen entity to current\n let joinFound = false;\n for (let j = 0; j < i; j++) {\n const earlier = entitySources[j];\n if (earlier === undefined) continue;\n\n const join = findJoinBetween(earlier.entity, curr.entity, earlier.alias, curr.alias);\n if (join !== undefined) {\n joins.push(join);\n joinFound = true;\n break;\n }\n }\n\n if (!joinFound) {\n throw new VexError(\n 'invalid_dsl',\n `No foreign key relationship found between any previous entity and \"${curr.entity.name}\". Cannot determine join condition.`,\n );\n }\n }\n\n // ─── Resolve fields ────────────────────────────────────────\n // `fields` is optional (an aggregate-only query selects none); an entry may be\n // a bare `entity.field` or `{ field, as }`, where `as` overrides the output key.\n const fields: ResolvedField[] = [];\n for (const ref of dsl.fields ?? []) {\n const path = typeof ref === 'string' ? ref : ref.field;\n if (typeof ref !== 'string') assertName(ref.as, 'field alias');\n const { resolved } = resolveFieldPath(path, entityLookup, schema);\n fields.push(typeof ref === 'string' ? resolved : { ...resolved, outputName: ref.as });\n aliasMap.set(path, `${resolved.alias}.${resolved.column}`);\n }\n\n // ─── Resolve filter ────────────────────────────────────────\n let resolvedFilter: ResolvedFilter | undefined;\n let semantic: ResolvedSemantic | undefined;\n\n const existsMap = new Map<object, ResolvedExists>();\n\n if (dsl.filter !== undefined) {\n const resolvedPaths = new Map<string, PathResolution>();\n collectFilterPaths(dsl.filter, entityLookup, schema, resolvedPaths, existsMap, aliasCounter);\n resolvedFilter = { original: dsl.filter, resolvedPaths };\n\n // Also populate aliasMap with filter paths\n for (const [path, res] of resolvedPaths) {\n aliasMap.set(path, `${res.alias}.${res.column}`);\n }\n\n // Extract semantic filter if present\n semantic = extractSemantic(dsl.filter, entityLookup, schema);\n }\n\n // ─── Resolve computes ──────────────────────────────────────\n // The exists collector is the same map the filter fills: a computed CASE\n // whose condition is an EXISTS (how a derived standing asks \"do they hold a\n // subscription?\") resolves into the one flat map that scope placement and\n // the compiler both walk, so an exists behaves identically wherever it sits.\n const computes: Array<{ name: string; expression: ComputeExpression }> = [];\n if (dsl.compute !== undefined) {\n for (const [name, expr] of Object.entries(dsl.compute)) {\n if (expr !== undefined) {\n assertName(name, 'compute name');\n resolveComputePaths(expr, entityLookup, schema, aliasMap, existsMap, aliasCounter);\n computes.push({ name, expression: expr });\n }\n }\n }\n\n // ─── Resolve aggregates ────────────────────────────────────\n const aggregates: Array<{ name: string; expression: AggregateExpression }> = [];\n if (dsl.aggregate !== undefined) {\n for (const [name, expr] of Object.entries(dsl.aggregate)) {\n if (expr !== undefined) {\n assertName(name, 'aggregate name');\n resolveAggregatePaths(expr, entityLookup, schema, aliasMap);\n aggregates.push({ name, expression: expr });\n }\n }\n }\n\n // ─── Resolve groupBy ───────────────────────────────────────\n const groupBy: ResolvedField[] = [];\n if (dsl.groupBy !== undefined) {\n for (const path of dsl.groupBy) {\n const { resolved } = resolveFieldPath(path, entityLookup, schema);\n groupBy.push(resolved);\n aliasMap.set(path, `${resolved.alias}.${resolved.column}`);\n }\n }\n\n // ─── Resolve sort ──────────────────────────────────────────\n const sort: Array<{ field: ResolvedField | string; dir: 'asc' | 'desc' }> = [];\n if (dsl.sort !== undefined) {\n const computeNames = new Set(computes.map((c) => c.name));\n const aggregateNames = new Set(aggregates.map((a) => a.name));\n\n for (const entry of dsl.sort) {\n const dir = entry.dir ?? 'asc';\n\n if (computeNames.has(entry.field) || aggregateNames.has(entry.field)) {\n // Sort by computed/aggregate alias\n sort.push({ field: entry.field, dir });\n } else {\n // Sort by entity.field\n const { resolved } = resolveFieldPath(entry.field, entityLookup, schema);\n aliasMap.set(entry.field, `${resolved.alias}.${resolved.column}`);\n sort.push({ field: resolved, dir });\n }\n }\n }\n\n return {\n sources,\n joins,\n fields,\n filter: resolvedFilter,\n semantic,\n computes,\n aggregates,\n groupBy,\n sort,\n limit: dsl.limit,\n distinct: dsl.distinct ?? false,\n aliasMap,\n ...(existsMap.size > 0 ? { existsMap } : {}),\n };\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Compute/aggregate path resolution helpers\n// ═══════════════════════════════════════════════════════════════\n\nconst resolveComputePaths = (\n expr: ComputeExpression,\n entityLookup: EntityLookup,\n schema: DatabaseSchema,\n aliasMap: Map<string, string>,\n existsOut?: Map<object, ResolvedExists>,\n aliasCounter?: AliasCounter,\n): void => {\n const resolveFieldOrValue = (fov: FieldOrValue): void => {\n if (typeof fov === 'string' && isFieldPath(fov)) {\n if (!aliasMap.has(fov)) {\n const { resolved } = resolveFieldPath(fov, entityLookup, schema);\n aliasMap.set(fov, `${resolved.alias}.${resolved.column}`);\n }\n }\n };\n\n if ('add' in expr || 'subtract' in expr || 'multiply' in expr || 'divide' in expr) {\n const pair = ('add' in expr) ? expr.add\n : ('subtract' in expr) ? expr.subtract\n : ('multiply' in expr) ? expr.multiply\n : expr.divide;\n resolveFieldOrValue(pair[0]);\n resolveFieldOrValue(pair[1]);\n return;\n }\n\n if ('concat' in expr) {\n for (const v of expr.concat) resolveFieldOrValue(v);\n return;\n }\n\n if ('coalesce' in expr) {\n for (const v of expr.coalesce) resolveFieldOrValue(v);\n return;\n }\n\n if ('case' in expr) {\n for (const when of expr.case.when) {\n // Resolve field paths inside the condition filter — WITH the exists\n // collector, so a condition may be an EXISTS like any filter may.\n const resolvedPaths = new Map<string, PathResolution>();\n collectFilterPaths(when.condition, entityLookup, schema, resolvedPaths, existsOut, aliasCounter);\n for (const [path, res] of resolvedPaths) {\n aliasMap.set(path, `${res.alias}.${res.column}`);\n }\n resolveFieldOrValue(when.then);\n }\n resolveFieldOrValue(expr.case.else);\n }\n};\n\nconst resolveAggregatePaths = (\n expr: AggregateExpression,\n entityLookup: EntityLookup,\n schema: DatabaseSchema,\n aliasMap: Map<string, string>,\n): void => {\n const arg = ('count' in expr) ? expr.count\n : ('countDistinct' in expr) ? expr.countDistinct\n : ('sum' in expr) ? expr.sum\n : ('avg' in expr) ? expr.avg\n : ('min' in expr) ? expr.min\n : expr.max;\n\n // COUNT(*) is special — no field path.\n if (arg === '*') return;\n\n // sum/avg/min/max may take a compute expression — resolve the columns it refs.\n if (typeof arg !== 'string') {\n resolveComputePaths(arg, entityLookup, schema, aliasMap);\n return;\n }\n\n // A field position: resolves or refuses, like a filter's.\n if (!aliasMap.has(arg)) {\n const { resolved } = resolveFieldPath(arg, entityLookup, schema);\n aliasMap.set(arg, `${resolved.alias}.${resolved.column}`);\n }\n};\n","import type {\n ResolvedQuery,\n ResolvedSource,\n AnalysisResult,\n AnalysisConfig,\n} from './engine.types.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Nesting depth\n// ═══════════════════════════════════════════════════════════════\n\nconst measureNestingDepth = (source: ResolvedSource): number => {\n if (source.subquery === undefined) return 0;\n let maxChild = 0;\n for (const childSource of source.subquery.sources) {\n const childDepth = measureNestingDepth(childSource);\n if (childDepth > maxChild) maxChild = childDepth;\n }\n return 1 + maxChild;\n};\n\nconst getMaxNestingDepth = (resolved: ResolvedQuery): number => {\n let max = 0;\n for (const source of resolved.sources) {\n const depth = measureNestingDepth(source);\n if (depth > max) max = depth;\n }\n return max;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Cartesian product detection\n// ═══════════════════════════════════════════════════════════════\n\nconst hasCartesianProduct = (resolved: ResolvedQuery): boolean => {\n // Only relevant when there are multiple entity sources (not subqueries)\n const entitySources = resolved.sources.filter((s) => s.entity !== undefined);\n if (entitySources.length <= 1) return false;\n\n // Check that each source after the first has at least one join connecting it\n // to a previously-seen source\n const seenAliases = new Set<string>();\n const firstSource = entitySources[0];\n if (firstSource !== undefined) {\n seenAliases.add(firstSource.alias);\n }\n\n for (let i = 1; i < entitySources.length; i++) {\n const source = entitySources[i];\n if (source === undefined) continue;\n\n const hasJoin = resolved.joins.some(\n (j) =>\n (j.toAlias === source.alias && seenAliases.has(j.fromAlias)) ||\n (j.fromAlias === source.alias && seenAliases.has(j.toAlias)),\n );\n\n if (!hasJoin) return true;\n\n seenAliases.add(source.alias);\n }\n\n return false;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Unindexed filter check\n// ═══════════════════════════════════════════════════════════════\n\nconst findUnindexedFilterColumns = (resolved: ResolvedQuery): string[] => {\n if (resolved.filter === undefined) return [];\n\n const unindexed: string[] = [];\n\n for (const [path, res] of resolved.filter.resolvedPaths) {\n // Find the entity for this alias\n const source = resolved.sources.find((s) => s.alias === res.alias);\n if (source === undefined || source.entity === undefined) continue;\n\n // Check if the column appears in any index\n const isIndexed = source.entity.indexes.some((idx) =>\n idx.fields.includes(res.column),\n );\n\n // Also consider primary keys as indexed\n const isPrimaryKey = source.entity.fields.some(\n (f) => f.name === res.column && f.primaryKey,\n );\n\n if (!isIndexed && !isPrimaryKey) {\n unindexed.push(path);\n }\n }\n\n return unindexed;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Aggregates without groupBy\n// ═══════════════════════════════════════════════════════════════\n\nconst hasAggregatesWithoutGroupBy = (resolved: ResolvedQuery): boolean =>\n resolved.aggregates.length > 0 && resolved.groupBy.length === 0;\n\n// ═══════════════════════════════════════════════════════════════\n// Public API\n// ═══════════════════════════════════════════════════════════════\n\nexport const analyze = (resolved: ResolvedQuery, config: AnalysisConfig): AnalysisResult => {\n const warnings: string[] = [];\n const errors: string[] = [];\n\n // Check nesting depth\n const depth = getMaxNestingDepth(resolved);\n if (depth > config.maxNestingDepth) {\n errors.push(\n `Subquery nesting depth ${depth} exceeds maximum allowed depth of ${config.maxNestingDepth}`,\n );\n }\n\n // Check for cartesian products\n if (config.rejectCartesianProducts && hasCartesianProduct(resolved)) {\n errors.push(\n 'Cartesian product detected: multiple sources with no join between them. Add a join or reduce sources.',\n );\n }\n\n // Check for unindexed filter columns\n const unindexed = findUnindexedFilterColumns(resolved);\n if (unindexed.length > 0) {\n const message = `Unindexed filter columns: ${unindexed.join(', ')}. Consider adding indexes for better performance.`;\n if (config.rejectUnindexedFilters) {\n errors.push(message);\n } else if (config.warnUnindexedFilters) {\n warnings.push(message);\n }\n }\n\n // Check for aggregates without groupBy\n if (hasAggregatesWithoutGroupBy(resolved)) {\n warnings.push(\n 'Aggregate functions used without groupBy. The result will be a single aggregated row.',\n );\n }\n\n // Check for unindexed vector field in semantic search\n if (resolved.semantic !== undefined) {\n const semanticField = resolved.semantic.field;\n const vectorSource = resolved.sources.find(\n (s) => s.alias === semanticField.alias,\n );\n if (vectorSource !== undefined && vectorSource.entity !== undefined) {\n const hasVectorIndex = vectorSource.entity.indexes.some(\n (idx) =>\n idx.fields.includes(semanticField.column) &&\n (idx.type === 'hnsw' || idx.type === 'ivfflat'),\n );\n if (!hasVectorIndex) {\n warnings.push(\n `Vector field \"${semanticField.path}\" has no HNSW or IVFFlat index. Semantic search may be slow.`,\n );\n }\n }\n }\n\n return { warnings, errors };\n};\n","import type { CacheBackend, CacheEntry } from './cache.types.js';\n\nexport const createMemoryCache = (): CacheBackend => {\n const store = new Map<string, CacheEntry>();\n\n const get = async (key: string): Promise<CacheEntry | undefined> => {\n return store.get(key);\n };\n\n const set = async (key: string, entry: CacheEntry): Promise<void> => {\n store.set(key, entry);\n };\n\n const del = async (key: string): Promise<void> => {\n store.delete(key);\n };\n\n const clear = async (): Promise<void> => {\n store.clear();\n };\n\n const keys = async (): Promise<string[]> => {\n return [...store.keys()];\n };\n\n // Read-only snapshot — does not increment hit counts.\n const entries = async (): Promise<Array<{ key: string; entry: CacheEntry }>> => {\n return [...store.entries()].map(([key, entry]) => ({ key, entry }));\n };\n\n return { get, set, delete: del, clear, keys, entries };\n};\n","import type { Row } from '../adapters/adapter.types.js';\nimport { hashText } from '../utils/canonical.js';\n\n// ═══════════════════════════════════════════════════════════════\n// LIVE ROWS — what makes a `refresh: 'reactive'` read reactive.\n//\n// Two structures, kept apart on purpose:\n//\n// ROWS — key → the rows a query returned. A cache: bounded by entries,\n// by bytes and by age, least-recently-used first out. Evicting\n// one never breaks anything; it costs one query.\n// FOLLOWS — key → what somebody is watching: the tables the query reads,\n// how to run it again, and who to tell. Small, and bounded by\n// what is mounted, not by this module: a follow ends when its\n// last follower's signal aborts.\n//\n// THE KEY IS THE COMPILED SQL AND ITS BOUND VALUES, which the engine hashes\n// before it gets here. Scope compiles into both — row rules into the SQL,\n// scope values into the parameters — so two callers share rows exactly when\n// they would provably have got the same rows. Nothing here reasons about\n// policy, and nothing needs to.\n//\n// A WRITE BUMPS ITS TABLES' VERSIONS. Rows remember the versions they were\n// read at; a stored entry whose tables moved is stale, checked on read — so\n// invalidation is a counter bump, not a walk over the cache. The same stamp\n// closes the race that would otherwise poison it: rows fetched by a read\n// that started BEFORE a write and finished after it carry the versions from\n// before, so they are stale the moment they land.\n//\n// Followed keys are refetched once per burst (debounced, trailing), and a\n// follower hears only when its own answer changed.\n// ═══════════════════════════════════════════════════════════════\n\nexport type LiveRowsConfig = {\n /** How long stored rows are trusted, and how often a followed read is re-checked when nothing wrote. Default 60 000. */\n ttlMs?: number;\n /** Most stored results. Default 5 000. */\n maxEntries?: number;\n /** Most stored text, measured as the length of each result's JSON. Default 64 MiB. */\n maxBytes?: number;\n /** Largest single result worth storing; bigger ones are refetched every time. Default a tenth of `maxBytes`. */\n maxEntryBytes?: number;\n /** How long a burst of writes is gathered before followed reads refetch. Default 10. */\n debounceMs?: number;\n};\n\nexport type LiveRowsStats = {\n entries: number;\n bytes: number;\n follows: number;\n followers: number;\n hits: number;\n misses: number;\n evictions: number;\n oversized: number;\n refreshes: number;\n};\n\nexport type LiveRowsEvent =\n | { type: 'rows.evict'; reason: 'capacity' | 'oversized'; bytes: number }\n | { type: 'rows.error'; message: string };\n\n// What running a query again needs, and which tables it reads.\nexport type RowsSource = {\n tables: readonly string[];\n fetch: () => Promise<Row[]>;\n};\n\nexport type RowsFollower = {\n // New rows for the key. The follower decides whether its own answer changed.\n deliver: (rows: Row[]) => void;\n};\n\nexport type LiveRows = {\n read: (key: string, source: RowsSource) => Promise<Row[]>;\n // Start following `key`. `rows` is what the follower was just answered\n // with. Ends when `signal` aborts.\n follow: (key: string, source: RowsSource, rows: Row[], follower: RowsFollower, signal: AbortSignal) => void;\n invalidate: (tables: readonly string[]) => void;\n stats: () => LiveRowsStats;\n // Stop every timer — for hosts that outlive the engine (tests, embedded tools).\n stop: () => void;\n};\n\nconst DEFAULT_TTL_MS = 60_000;\nconst DEFAULT_MAX_ENTRIES = 5_000;\nconst DEFAULT_MAX_BYTES = 64 * 1024 * 1024;\nconst DEFAULT_DEBOUNCE_MS = 10;\n// A cache that evicts faster than it answers is too small for what it holds.\n// Said at most once a minute, and only past a floor, so a cold start is quiet.\nconst THRASH_WINDOW_MS = 60_000;\nconst THRASH_FLOOR = 100;\n\ntype Stored = { rows: Row[]; bytes: number; tables: readonly string[]; seen: readonly number[]; at: number };\ntype Flight = { promise: Promise<Row[]>; tables: readonly string[]; seen: readonly number[] };\ntype Follow = {\n source: RowsSource;\n followers: Set<RowsFollower>;\n // The rows every follower was last brought up to, as a hash — when a refetch\n // returns the same, nobody's answer can have changed and nobody is mapped.\n rowsHash: string;\n // Refetches are numbered so a slow one landing after a newer one is dropped.\n issued: number;\n landed: number;\n timer?: ReturnType<typeof setTimeout>;\n};\n\nconst unref = (timer: ReturnType<typeof setTimeout>): void => {\n if (typeof timer === 'object' && timer !== null && 'unref' in timer && typeof timer.unref === 'function') timer.unref();\n};\n\nexport const createLiveRows = (\n config: LiveRowsConfig = {},\n emit: (event: LiveRowsEvent) => void = () => {},\n now: () => number = Date.now,\n): LiveRows => {\n const ttlMs = config.ttlMs ?? DEFAULT_TTL_MS;\n const maxEntries = config.maxEntries ?? DEFAULT_MAX_ENTRIES;\n const maxBytes = config.maxBytes ?? DEFAULT_MAX_BYTES;\n const maxEntryBytes = config.maxEntryBytes ?? Math.floor(maxBytes / 10);\n const debounceMs = config.debounceMs ?? DEFAULT_DEBOUNCE_MS;\n\n const versions = new Map<string, number>();\n const versionOf = (table: string): number => versions.get(table) ?? 0;\n const snapshot = (tables: readonly string[]): number[] => tables.map(versionOf);\n const unchanged = (tables: readonly string[], seen: readonly number[]): boolean =>\n tables.every((table, i) => versionOf(table) === seen[i]);\n\n // Insertion order is recency: a hit is re-inserted, the oldest is first out.\n const stored = new Map<string, Stored>();\n let bytes = 0;\n const flights = new Map<string, Flight>();\n const follows = new Map<string, Follow>();\n const followsByTable = new Map<string, Set<string>>();\n\n const counts = { hits: 0, misses: 0, evictions: 0, oversized: 0, refreshes: 0 };\n const thrash = { start: now(), hits: 0, evictions: 0, warned: 0 };\n\n const drop = (key: string): void => {\n const entry = stored.get(key);\n if (entry === undefined) return;\n stored.delete(key);\n bytes -= entry.bytes;\n };\n\n const noteEviction = (): void => {\n const at = now();\n if (at - thrash.start > THRASH_WINDOW_MS) {\n thrash.start = at;\n thrash.hits = 0;\n thrash.evictions = 0;\n }\n thrash.evictions += 1;\n if (thrash.evictions >= THRASH_FLOOR && thrash.evictions > thrash.hits && at - thrash.warned > THRASH_WINDOW_MS) {\n thrash.warned = at;\n console.warn(\n `[vex:rows] evicting faster than answering (${thrash.evictions} evictions, ${thrash.hits} hits this minute) — raise the engine's rows.maxBytes / rows.maxEntries.`,\n );\n }\n };\n\n const store = (key: string, rows: Row[], tables: readonly string[], seen: readonly number[]): void => {\n drop(key);\n const size = (JSON.stringify(rows) ?? '').length;\n if (size > maxEntryBytes) {\n counts.oversized += 1;\n emit({ type: 'rows.evict', reason: 'oversized', bytes: size });\n return;\n }\n stored.set(key, { rows, bytes: size, tables, seen, at: now() });\n bytes += size;\n while (stored.size > maxEntries || bytes > maxBytes) {\n const oldest = stored.keys().next();\n if (oldest.done === true) break;\n const evicted = stored.get(oldest.value);\n drop(oldest.value);\n counts.evictions += 1;\n emit({ type: 'rows.evict', reason: 'capacity', bytes: evicted?.bytes ?? 0 });\n noteEviction();\n }\n };\n\n const read = (key: string, source: RowsSource): Promise<Row[]> => {\n const hit = stored.get(key);\n if (hit !== undefined) {\n if (now() - hit.at < ttlMs && unchanged(hit.tables, hit.seen)) {\n stored.delete(key);\n stored.set(key, hit);\n counts.hits += 1;\n thrash.hits += 1;\n return Promise.resolve(hit.rows);\n }\n drop(key);\n }\n counts.misses += 1;\n // Join a fetch already out — but only one that started after the last\n // write to these tables; an older one is about to return stale rows.\n const flight = flights.get(key);\n if (flight !== undefined && unchanged(flight.tables, flight.seen)) return flight.promise;\n\n const seen = snapshot(source.tables);\n const promise = source.fetch().then((rows) => {\n store(key, rows, source.tables, seen);\n return rows;\n });\n const entry: Flight = { promise, tables: source.tables, seen };\n flights.set(key, entry);\n const settle = (): void => {\n if (flights.get(key) === entry) flights.delete(key);\n };\n promise.then(settle, settle);\n return promise;\n };\n\n // ── follows ───────────────────────────────────────────────\n\n const dirty = new Set<string>();\n let flushTimer: ReturnType<typeof setTimeout> | undefined;\n\n const schedule = (key: string): void => {\n dirty.add(key);\n if (flushTimer !== undefined) return;\n flushTimer = setTimeout(() => {\n flushTimer = undefined;\n const keys = [...dirty];\n dirty.clear();\n for (const next of keys) void refresh(next, false);\n }, debounceMs);\n unref(flushTimer);\n };\n\n // Nothing wrote, but a lost invalidation (a write vex never saw, a signal\n // from another process that never came) must not leave a screen stale for\n // ever: every followed read is re-checked once per TTL, bypassing the cache.\n const arm = (key: string, follow: Follow): void => {\n if (follow.timer !== undefined) clearTimeout(follow.timer);\n if (!Number.isFinite(ttlMs)) return;\n follow.timer = setTimeout(() => void refresh(key, true), ttlMs);\n unref(follow.timer);\n };\n\n const refresh = async (key: string, bypass: boolean): Promise<void> => {\n const follow = follows.get(key);\n if (follow === undefined) return;\n follow.issued += 1;\n const ticket = follow.issued;\n if (bypass) drop(key);\n let rows: Row[];\n try {\n rows = await read(key, follow.source);\n } catch (err) {\n // The screen keeps its last good answer; the next write or TTL tries again.\n emit({ type: 'rows.error', message: err instanceof Error ? err.message : String(err) });\n if (follows.get(key) === follow) arm(key, follow);\n return;\n }\n if (follows.get(key) !== follow || ticket < follow.landed) return;\n follow.landed = ticket;\n counts.refreshes += 1;\n arm(key, follow);\n const rowsHash = hashText(JSON.stringify(rows) ?? '');\n if (rowsHash === follow.rowsHash) return;\n follow.rowsHash = rowsHash;\n for (const follower of [...follow.followers]) {\n try {\n follower.deliver(rows);\n } catch (err) {\n emit({ type: 'rows.error', message: err instanceof Error ? err.message : String(err) });\n }\n }\n };\n\n const unfollow = (key: string, follower: RowsFollower): void => {\n const follow = follows.get(key);\n if (follow === undefined) return;\n follow.followers.delete(follower);\n if (follow.followers.size > 0) return;\n follows.delete(key);\n dirty.delete(key);\n if (follow.timer !== undefined) clearTimeout(follow.timer);\n for (const table of follow.source.tables) {\n const keys = followsByTable.get(table);\n keys?.delete(key);\n if (keys !== undefined && keys.size === 0) followsByTable.delete(table);\n }\n };\n\n const follow = (key: string, source: RowsSource, rows: Row[], follower: RowsFollower, signal: AbortSignal): void => {\n if (signal.aborted) return;\n let existing = follows.get(key);\n if (existing === undefined) {\n existing = { source, followers: new Set(), rowsHash: hashText(JSON.stringify(rows) ?? ''), issued: 0, landed: 0 };\n follows.set(key, existing);\n for (const table of source.tables) {\n let keys = followsByTable.get(table);\n if (keys === undefined) {\n keys = new Set();\n followsByTable.set(table, keys);\n }\n keys.add(key);\n }\n arm(key, existing);\n }\n // A follower joining a follow that already exists keeps the follow's own\n // record of what everybody was last brought up to — if its rows are\n // newer, the refresh already scheduled will say so to everyone, and the\n // newcomer's own comparison drops the repeat.\n existing.followers.add(follower);\n signal.addEventListener('abort', () => unfollow(key, follower), { once: true });\n };\n\n const invalidate = (tables: readonly string[]): void => {\n for (const table of tables) versions.set(table, versionOf(table) + 1);\n for (const table of tables) {\n for (const key of followsByTable.get(table) ?? []) schedule(key);\n }\n };\n\n const stats = (): LiveRowsStats => {\n let followers = 0;\n for (const entry of follows.values()) followers += entry.followers.size;\n return { entries: stored.size, bytes, follows: follows.size, followers, ...counts };\n };\n\n const stop = (): void => {\n if (flushTimer !== undefined) clearTimeout(flushTimer);\n flushTimer = undefined;\n for (const entry of follows.values()) if (entry.timer !== undefined) clearTimeout(entry.timer);\n };\n\n return { read, follow, invalidate, stats, stop };\n};\n","import type { QueryEngine, QueryEngineConfig, ExecuteOptions, GenerationCaller } from '../types.js';\nimport type { DatabaseSchema } from '../schemas/database.schema.js';\nimport type { Query } from '../schemas/query.schema.js';\nimport type { QueryRequest, QueryResponse } from '../schemas/request.schema.js';\nimport type { CompiledQuery } from '../adapters/adapter.types.js';\nimport type { TestResult, AnalysisConfig } from './engine.types.js';\nimport type { ScopeValues, ScopePolicy } from '../scope/scope.types.js';\nimport type { CacheBackend, CacheEntry, OkCacheEntry } from '../cache/cache.types.js';\nimport { z } from 'zod';\nimport { QueryRequestSchema } from '../schemas/request.schema.js';\nimport { QuerySchema } from '../schemas/query.schema.js';\nimport { discoverEntities } from '../scope/discover.js';\nimport { checkScope, scopeResolved, canReadTable } from '../scope/apply.js';\nimport { behaviorColumns, scopeBindings } from '../scope/grants.js';\nimport { resolve } from './resolver.js';\nimport { analyze } from './analyzer.js';\nimport { executeQuery, buildContextContract, findMissingContext, requireScope } from './executor.js';\nimport { pruneOptional, presenceOf, presenceSignature, optionalKeysOf } from './optional.js';\nimport { createMemoryCache } from '../cache/memory.js';\nimport { computeSchemaFingerprint, computeRequestHash, computePolicyKey, mintFingerprint } from '../cache/hash.js';\nimport { isEntryFresh, isTouchDue, fireAndForget } from '../cache/util.js';\nimport { buildValidationContext, resolveParams } from '../utils/context.js';\nimport { canonicalHash } from '../utils/canonical.js';\nimport { createLiveRows } from './live.js';\nimport type { RowsSource } from './live.js';\nimport type { Refresh } from '../cache/cache.types.js';\nimport type { Row } from '../adapters/adapter.types.js';\nimport { VexError } from '../errors.js';\nimport { depthRefusal, exceedsDepth } from '@niscorp/strata';\nimport type { CompiledIr, JsonObject, JsonValue } from '@niscorp/prism';\nimport { execute as executePrism } from '@niscorp/prism';\n\n// `sortBy`/`sortDir` are reserved context keys: when present they replace the\n// query's literal `sort` (its default) with a single ORDER BY for this run. The\n// column is validated downstream by resolve()/resolveFieldPath — an unknown\n// column throws — and never becomes a param (operators.ts guards $context refs).\nexport const applySortContext = (dsl: Query, context: Record<string, unknown>): Query => {\n const sortBy = context['sortBy'];\n if (typeof sortBy !== 'string' || sortBy === '') return dsl;\n const dir: 'asc' | 'desc' = context['sortDir'] === 'desc' ? 'desc' : 'asc';\n // The caller's column LEADS; the entry's own keys stay behind it as\n // tiebreakers. This used to replace the sort outright, which quietly broke\n // any entry whose last sort key was there to make the order TOTAL — a keyset\n // page ordered by (name, id) became ordered by name alone, and two people\n // sharing a name could straddle a page boundary and never be reached.\n // A trailing key is not decoration; it is what makes \"the next fifty\" mean\n // anything. The caller's own column is dropped from the tail so it cannot\n // appear twice with two directions.\n const tiebreakers = (dsl.sort ?? []).filter((entry) => entry.field !== sortBy);\n return { ...dsl, sort: [{ field: sortBy, dir }, ...tiebreakers] };\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Pipeline result (compiled query + analysis warnings)\n// ═══════════════════════════════════════════════════════════════\n\ntype PipelineResult = {\n compiled: CompiledQuery;\n warnings: string[];\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Configuration defaults\n// ═══════════════════════════════════════════════════════════════\n\nconst DEFAULT_MAX_NESTING_DEPTH = 2;\nconst DEFAULT_LIMIT = 100;\nconst DEFAULT_MAX_LIMIT = 1000;\nconst DEFAULT_STATEMENT_TIMEOUT_MS = 10_000;\nconst DEFAULT_UNSATISFIABLE_TTL_MS = 300_000;\nconst DEFAULT_MAX_PRESENCE_VARIANTS = 32;\n\n// ═══════════════════════════════════════════════════════════════\n// Runtime factory\n// ═══════════════════════════════════════════════════════════════\n\nexport const createQueryEngine = (engineConfig: QueryEngineConfig): QueryEngine => {\n const { adapter, scope: scopePolicy, generateDsl, mapToShape, embed, behaviors } = engineConfig;\n const emit = engineConfig.onEvent ?? (() => {});\n const maxNestingDepth = engineConfig.config?.maxNestingDepth ?? DEFAULT_MAX_NESTING_DEPTH;\n const defaultLimit = engineConfig.config?.defaultLimit ?? DEFAULT_LIMIT;\n const maxLimit = engineConfig.config?.maxLimit ?? DEFAULT_MAX_LIMIT;\n const rejectCartesianProducts = engineConfig.config?.rejectCartesianProducts ?? true;\n const warnUnindexedFilters = engineConfig.config?.warnUnindexedFilters ?? true;\n const rejectUnindexedFilters = engineConfig.config?.rejectUnindexedFilters ?? false;\n const unsatisfiableTtlMs = engineConfig.config?.unsatisfiableTtlMs ?? DEFAULT_UNSATISFIABLE_TTL_MS;\n\n const analysisConfig: AnalysisConfig = {\n maxNestingDepth,\n rejectCartesianProducts,\n warnUnindexedFilters,\n rejectUnindexedFilters,\n };\n\n // The rows behind `refresh: 'reactive'` entries (engine/live.ts). Snapshot\n // reads never touch it.\n const live = createLiveRows(engineConfig.rows, emit);\n\n let cachedSchema: DatabaseSchema | undefined;\n let cachedFingerprint: string | undefined;\n const cache: CacheBackend = engineConfig.cache ?? createMemoryCache();\n\n // ── how many SHAPES one entry is being asked for ──\n //\n // Optional conditions trade one artifact for up to 2^n compiled forms. That\n // is the deal and it is a good one — but it is worth SAYING when an entry\n // starts behaving like a query builder, because at that point a caller is\n // composing rather than choosing, and the closed grammar is doing less work\n // than it looks like it is.\n //\n // A warning rather than a refusal: every variant is still a query the author\n // wrote, scope still applies, and failing a legitimate read to make a point\n // about authoring would be the wrong trade. There is no per-call cost here\n // either — vex compiles per request already, so a new shape is not a cache\n // miss, it is just a different string.\n const variantsSeen = new Map<string, Set<string>>();\n const maxPresenceVariants = engineConfig.config?.maxPresenceVariants ?? DEFAULT_MAX_PRESENCE_VARIANTS;\n\n const noteVariant = (fingerprint: string | undefined, signature: string, warnings: string[]): void => {\n if (fingerprint === undefined || signature === '') return;\n let seen = variantsSeen.get(fingerprint);\n if (seen === undefined) {\n seen = new Set<string>();\n variantsSeen.set(fingerprint, seen);\n }\n if (seen.has(signature)) return;\n seen.add(signature);\n if (seen.size > maxPresenceVariants) {\n warnings.push(\n `\"${fingerprint}\" has now compiled ${seen.size} distinct optional-key combinations (limit ${maxPresenceVariants}). An entry answering this many shapes is closer to a query builder than to a question — consider splitting it.`,\n );\n }\n };\n\n // Single-flight: collapse concurrent identical misses (same request\n // identity) so a burst of N requests triggers one agent generation,\n // not N. Keyed by request hash; only the shared generation is pooled,\n // each request still runs its own scope/execute.\n const inFlight = new Map<string, Promise<Query>>();\n\n // ─── Introspect ────────────────────────────────────────────\n\n const introspect = async (): Promise<DatabaseSchema> => {\n const options = engineConfig.config?.entities !== undefined\n ? { entities: engineConfig.config.entities }\n : undefined;\n const schema = await adapter.introspect(options);\n // Every read bounded, from here on. Said once when the database cannot\n // enforce it (PGlite, a pool that cannot transact) — dev, not production.\n const readLimit = engineConfig.config?.statementTimeoutMs ?? DEFAULT_STATEMENT_TIMEOUT_MS;\n if (adapter.limitReads !== undefined && (await adapter.limitReads(readLimit)) === 'unenforced' && readLimit > 0) {\n console.warn(`[vex] reads are not bounded: this database cannot enforce statement_timeout (${readLimit}ms asked). Fine for development; production wants Postgres.`);\n }\n // The behaviors are read for who a caller is (GenerationCaller.bindings):\n // a rule naming a table or a column the database does not have would tell\n // a generation something false, so it refuses here, at boot.\n if (behaviors !== undefined) {\n const missing = behaviorColumns(behaviors).filter(({ entity, field }) => !schema.entities.some((e) => e.name === entity && e.fields.some((f) => f.name === field)));\n if (missing.length > 0) {\n throw new VexError('execution_error', `The behaviors name columns the database does not have: ${missing.map((m) => `${m.entity}.${m.field}`).join(', ')}.`);\n }\n }\n cachedSchema = schema;\n cachedFingerprint = computeSchemaFingerprint(schema);\n return schema;\n };\n\n // ─── Internal pipeline ─────────────────────────────────────\n\n const ensureSchema = (): DatabaseSchema => {\n if (cachedSchema === undefined) {\n throw new VexError(\n 'execution_error',\n 'Database schema not loaded. Call introspect() first.',\n );\n }\n return cachedSchema;\n };\n\n // WHO IS ASKING never decides WHETHER the policy applies. An engine with a\n // policy enforces it on every run; the caller's scope values only fill the\n // row rules' `$scope` slots at bind time, and a slot nobody filled is a\n // refusal (`requireScope`), not a pass. Omitting the values used to switch\n // the whole policy off — table access included — so a call that forgot to\n // say who it was for read as everybody.\n const runPipeline = (dsl: Query, policyOverride?: ScopePolicy): PipelineResult => {\n const schema = ensureSchema();\n\n // Apply limit constraints\n let processedDsl = dsl;\n if (processedDsl.limit === undefined) {\n processedDsl = { ...processedDsl, limit: defaultLimit };\n } else if (processedDsl.limit > maxLimit) {\n processedDsl = { ...processedDsl, limit: maxLimit };\n }\n\n // Discover entities\n const entities = discoverEntities(processedDsl);\n\n // Scope, in two halves. A per-request policy (from ExecuteOptions)\n // overrides the engine's configured default for this run.\n //\n // The ACCESS CHECK runs first, on entity names alone, so a denied table is\n // refused before any work is done. The ROW RULES are placed AFTER\n // resolution, because only the resolver knows which tables are left-joined\n // and a row rule in the WHERE of a left join silently deletes rows whose\n // optional FK is null. See scope/apply.ts.\n const activePolicy = policyOverride ?? scopePolicy;\n if (activePolicy !== undefined) checkScope(entities, activePolicy);\n\n // Resolve\n const resolved = resolve(processedDsl, schema);\n if (activePolicy !== undefined) scopeResolved(resolved, activePolicy);\n\n // Analyze\n const analysis = analyze(resolved, analysisConfig);\n if (analysis.errors.length > 0) {\n throw new VexError(\n 'invalid_dsl',\n `Analysis failed: ${analysis.errors.join('; ')}`,\n { errors: analysis.errors, warnings: analysis.warnings },\n );\n }\n\n // Compile\n const compiled = adapter.compile(resolved);\n\n return { compiled, warnings: analysis.warnings };\n };\n\n // ─── Compile ───────────────────────────────────────────────\n\n // No caller, so no presence to resolve against: `all` compiles the WIDEST\n // form of the query, every optional condition included. That is the right\n // default for both of these — a compile is asking \"does this query build\",\n // and a test is asking \"does the hardest version of it run\".\n const compile = (dsl: Query): CompiledQuery =>\n runPipeline(pruneOptional(dsl, 'all')).compiled;\n\n // ─── Test ──────────────────────────────────────────────────\n\n const test = async (dsl: Query, scopeValues?: ScopeValues): Promise<TestResult> => {\n try {\n // Override limit to 5 for test queries\n const testDsl: Query = { ...pruneOptional(dsl, 'all'), limit: 5 };\n const { compiled, warnings } = runPipeline(testDsl);\n\n // Build synthetic context for testing\n const syntheticContext = buildValidationContext(compiled.contextContract);\n\n // Scope is never synthetic: a test runs AS somebody or it is refused.\n const scope: ScopeValues = scopeValues ?? {};\n requireScope(compiled, scope);\n\n const rows = await executeQuery(compiled, syntheticContext, scope, adapter, embed);\n\n return { rows, warnings, errors: [] };\n } catch (err) {\n const message = err instanceof Error ? err.message : String(err);\n return { rows: [], warnings: [], errors: [message] };\n }\n };\n\n // ─── Cache resolution (fingerprint identity) ───────────────\n\n type Resolution = {\n fingerprint: string;\n // Present on a hit — the stored artifact.\n dsl?: Query;\n cachedIr?: CompiledIr;\n intent?: string;\n // The stored shape — drives the array-vs-single mapping envelope on\n // fingerprint-only replays (the request carries no shape then).\n shape?: unknown;\n refresh?: Refresh;\n hit: boolean;\n // A named slot existed but its stored request differed — this run\n // regenerates and REPLACES it.\n replaced: boolean;\n };\n\n // Fresh = not past TTL and written against the current schema. A\n // non-fresh entry is evicted here, then treated as a miss.\n const freshOrEvict = (entry: CacheEntry, key: string): boolean => {\n if (isEntryFresh(entry, cachedFingerprint)) return true;\n void cache.delete(key);\n return false;\n };\n\n // Lifetime = usage: a hit stamps lastUsedAt (off the hot path) so a GC\n // sweep can evict entries that stopped being replayed — at most once per\n // TOUCH_EVERY_MS, not on every replay (cache/util.ts).\n const touch = (key: string, entry: CacheEntry): void => {\n const now = Date.now();\n if (isTouchDue(entry, now)) fireAndForget(cache.set(key, { ...entry, lastUsedAt: now }));\n };\n\n const resolveFingerprint = async (\n validRequest: QueryRequest,\n hasRequest: boolean,\n requestHash: string | undefined,\n ): Promise<Resolution> => {\n const fp = validRequest.fingerprint;\n if (fp === undefined) {\n // Explore: always a fresh generation under a minted, immutable pin.\n return { fingerprint: mintFingerprint(), hit: false, replaced: false };\n }\n\n const entry = await cache.get(fp);\n if (entry?.kind === 'mutation') {\n throw new VexError(\n 'invalid_request',\n `Fingerprint \"${fp}\" names a mutation — the query engine cannot execute writes. Replay it through the vex endpoint.`,\n );\n }\n if (entry?.kind === 'ok' && freshOrEvict(entry, fp)) {\n if (!hasRequest || entry.requestHash === requestHash) {\n touch(fp, entry);\n return {\n fingerprint: fp,\n dsl: entry.dsl,\n ...(entry.prismIr !== undefined ? { cachedIr: entry.prismIr } : {}),\n ...(entry.intent !== undefined ? { intent: entry.intent } : {}),\n ...(entry.shape !== undefined ? { shape: entry.shape } : {}),\n ...(entry.refresh !== undefined ? { refresh: entry.refresh } : {}),\n hit: true,\n replaced: false,\n };\n }\n if (entry.protected === true) {\n throw new VexError(\n 'fingerprint_protected',\n `Fingerprint \"${fp}\" is protected and this request no longer matches its stored one. Replay it with the fingerprint alone, or use a new name.`,\n );\n }\n // The name is the caller's; its content follows the caller's request.\n return { fingerprint: fp, hit: false, replaced: true };\n }\n\n if (!hasRequest) {\n throw new VexError('cache_miss', `Unknown fingerprint \"${fp}\" — pass intent + shape to (re)generate it.`);\n }\n return { fingerprint: fp, hit: false, replaced: false };\n };\n\n // ─── DSL generation (single-flight + negative caching) ─────\n\n // WHAT A GENERATION MAY TOUCH is what its caller may touch. The hook is\n // handed a `read` capability that runs the engine's own pipeline under the\n // caller's policy and scope values — the only way anything it does reaches\n // the database — and a schema holding only the tables that policy lets the\n // caller read. The DSL it writes is still caller-neutral (scope is applied\n // again on every replay); what it SAW while writing it is the caller's.\n const callerOf = (policy: ScopePolicy | undefined, scope: ScopeValues, tables: readonly string[]): GenerationCaller => ({\n bindings: scopeBindings(behaviors ?? {}, tables, scope),\n read: async (dsl) => {\n const { compiled, warnings } = runPipeline(pruneOptional(dsl, 'all'), policy);\n requireScope(compiled, scope);\n if (compiled.paramSlots.some((slot) => slot.kind === 'semantic')) {\n return { rows: [], sql: compiled.sql, warnings: [...warnings, 'Semantic params present — execution skipped, SQL structure validated only'] };\n }\n // `$context` binds NULL — a probe asks whether a query runs, not what it\n // answers, and NULL compares against a column of any type. Typed guesses\n // were a trap: an empty string against a date column is a cast ERROR,\n // which taught the agent the DSL could not compare dates. Scope binds the\n // caller's own values.\n const params = compiled.paramSlots.map((slot) => (slot.kind === 'scope' ? scope[slot.key] : null));\n return { rows: await adapter.execute(compiled, params), sql: compiled.sql, warnings };\n },\n });\n\n const generateMissingDsl = async (\n validRequest: QueryRequest,\n flightKey: string,\n negKey: string,\n entities: string[] | undefined,\n policy: ScopePolicy | undefined,\n scope: ScopeValues,\n ): Promise<Query> => {\n if (generateDsl === undefined) {\n throw new VexError('agent_failed', 'No query generation function available and no cached query found');\n }\n\n const fullSchema = ensureSchema();\n const agentSchema = {\n ...fullSchema,\n entities: fullSchema.entities.filter(\n (e) => (entities === undefined || entities.includes(e.name)) && (policy === undefined || canReadTable(policy, e.name)),\n ),\n };\n\n const generate = async (): Promise<Query> => {\n try {\n return await generateDsl(validRequest, agentSchema, callerOf(policy, scope, agentSchema.entities.map((e) => e.name)));\n } catch (err) {\n // Cache a negative result so a known-impossible request doesn't\n // re-run the agent. TTL'd — a schema change may make it possible.\n if (err instanceof VexError && err.code === 'unsatisfiable') {\n const now = Date.now();\n await cache.set(negKey, {\n kind: 'unsatisfiable',\n reason: err.message,\n createdAt: now,\n expiresAt: now + unsatisfiableTtlMs,\n ...(validRequest.intent !== undefined ? { intent: validRequest.intent } : {}),\n shape: validRequest.shape,\n ...(cachedFingerprint !== undefined ? { schemaFingerprint: cachedFingerprint } : {}),\n });\n }\n throw err;\n }\n };\n\n // Single-flight: a burst of identical requests (same request\n // identity) triggers one generation, not N.\n //\n // Keyed by request AND policy: two callers who can see different tables\n // are asking different agents, and one's answer — or one's \"cannot\n // satisfy\" — is not the other's.\n const existing = inFlight.get(flightKey);\n if (existing !== undefined) return existing;\n\n const generation = generate();\n inFlight.set(flightKey, generation);\n try {\n return await generation;\n } finally {\n inFlight.delete(flightKey);\n }\n };\n\n // ─── Execute SQL + map to shape ────────────────────────────\n\n type MapResult = { result: JsonValue; executionMs: number; mappingMs?: number; mappedIr?: CompiledIr };\n\n // Prism runs ONCE and its output IS the result. The shape decides the\n // envelope: an ARRAY shape maps over the whole row set (`$.result` is the\n // array — a `$map`/identity); a non-array shape maps the SINGLE (first)\n // row (`$.result` is that row — a detail/aggregate reads `$.result.field`,\n // no `[0]`). Vex never forces an array: the mapping owns the shape.\n //\n // `$.result` is the rows, and it is what every mapping was written\n // against. `$.context` and `$.scope` sit BESIDE it — additive, so nothing\n // authored before this line changes meaning.\n //\n // WHY A MAPPING NEEDS THE SCOPE. A mapping is where a row becomes words\n // (\"Active\", \"Fri 14 Mar\", \"€45\"), and words have a language. Without\n // this, the deepest layer of an application's display strings is the one\n // layer that structurally cannot be localised — and the only escape is to\n // stop mapping in vex and re-derive the same fields somewhere further out,\n // which is worse in every direction.\n //\n // Scope values are ENGINE-side (moss injects them per session; a request\n // cannot author one), so reading them here does not widen what a caller\n // can reach — it widens what the app can say about a caller it already\n // knows. It is also why a reactive read shares ROWS between callers and\n // maps them per caller: the rows are the same, the words may not be.\n const mapRows = (\n rows: Row[],\n shape: unknown,\n ir: CompiledIr,\n context: Record<string, unknown>,\n scope: Record<string, unknown>,\n ): JsonValue => {\n const single = !Array.isArray(shape);\n const source = {\n result: single ? (rows[0] ?? null) : rows,\n context,\n scope,\n } as unknown as JsonObject;\n return executePrism(ir, source);\n };\n\n const executeAndMap = async (\n compiled: CompiledQuery,\n validRequest: QueryRequest,\n cachedIr: CompiledIr | undefined,\n context: Record<string, unknown>,\n scope: Record<string, unknown>,\n ): Promise<MapResult> => {\n const execStart = Date.now();\n const rows = await executeQuery(compiled, context, scope, adapter, embed);\n const executionMs = Date.now() - execStart;\n emit({ type: 'query.rows', count: rows.length, executionMs });\n\n // No shape declared → hand back the raw rows untouched.\n let result: JsonValue = rows as unknown as JsonValue;\n let mappingMs: number | undefined;\n let mappedIr: CompiledIr | undefined = cachedIr;\n\n if (validRequest.shape !== undefined) {\n if (cachedIr !== undefined) {\n const mapStart = Date.now();\n result = mapRows(rows, validRequest.shape, cachedIr, context, scope);\n mappingMs = Date.now() - mapStart;\n } else if (mapToShape !== undefined) {\n const mapStart = Date.now();\n const mapped = await mapToShape(rows, validRequest.shape);\n mappingMs = Date.now() - mapStart;\n result = mapped.transformed;\n mappedIr = mapped.ir;\n }\n if (mappingMs !== undefined) emit({ type: 'query.mapped', mappingMs });\n }\n\n return { result, executionMs, mappingMs, mappedIr };\n };\n\n // ─── Execute ───────────────────────────────────────────────\n\n const execute = async (\n request: QueryRequest,\n options?: ExecuteOptions,\n ): Promise<QueryResponse> => {\n if (exceedsDepth(request)) throw new VexError('invalid_request', `Invalid request: ${depthRefusal()}`);\n const parsed = QueryRequestSchema.safeParse(request);\n if (!parsed.success) {\n throw new VexError('invalid_request', `Invalid request: ${parsed.error.message}`);\n }\n\n const validRequest = parsed.data;\n const scope: ScopeValues = options?.scope ?? {};\n const activePolicy = options?.scopePolicy ?? scopePolicy;\n const t0 = Date.now();\n\n const hasRequest = validRequest.shape !== undefined && validRequest.shape !== null;\n if (validRequest.fingerprint === undefined && !hasRequest) {\n throw new VexError('invalid_request', 'Pass a fingerprint (replay) or intent + shape (generate) — or both (named slot).');\n }\n const requestHash = hasRequest ? computeRequestHash(validRequest) : undefined;\n const flightKey = requestHash !== undefined ? `${requestHash}:${computePolicyKey(activePolicy)}` : undefined;\n const negKey = flightKey !== undefined ? `neg:${flightKey}` : undefined;\n emit({\n type: 'query.start',\n intent: validRequest.intent,\n shape: validRequest.shape,\n fingerprint: validRequest.fingerprint,\n entities: options?.entities,\n });\n\n // Resolve identity: replay a pin/name, or decide to generate.\n const cached = await resolveFingerprint(validRequest, hasRequest, requestHash);\n emit({ type: 'query.cache', hit: cached.hit, fingerprint: cached.fingerprint, replaced: cached.replaced });\n\n // Generate on miss (consulting the negative cache first).\n let dsl = cached.dsl;\n let agentMs: number | undefined;\n if (dsl === undefined) {\n if (options?.locked === true) {\n throw new VexError('locked', 'This endpoint is replay-only — unknown or changed fingerprints cannot generate here.');\n }\n if (flightKey === undefined || negKey === undefined) {\n throw new VexError('invalid_request', 'Generation needs intent + shape.');\n }\n const negative = await cache.get(negKey);\n if (negative?.kind === 'unsatisfiable' && freshOrEvict(negative, negKey)) {\n emit({ type: 'query.error', code: 'unsatisfiable', message: negative.reason });\n throw new VexError('unsatisfiable', negative.reason);\n }\n const agentStart = Date.now();\n dsl = await generateMissingDsl(validRequest, flightKey, negKey, options?.entities, activePolicy, scope);\n agentMs = Date.now() - agentStart;\n emit({ type: 'query.dsl', dsl, agentMs });\n }\n\n // Run the pipeline. Two caller-driven rewrites happen here and NOWHERE\n // else, both against the stored `dsl` rather than replacing it:\n // · `sortBy`/`sortDir` override the literal `sort` for this run\n // · optional conditions the caller did not key are pruned OUT entirely\n // The cached entry keeps its full form — every run re-derives its own\n // shape, so one stored artifact answers every combination of keys.\n const presence = presenceOf(validRequest.context);\n const shaped = pruneOptional(applySortContext(dsl, validRequest.context), presence);\n const { compiled, warnings } = runPipeline(shaped, activePolicy);\n noteVariant(cached.fingerprint, presenceSignature(dsl, presence), warnings);\n emit({ type: 'query.sql', sql: compiled.sql, warnings });\n\n // A missing SCOPE value is the host's fault and refuses; a missing CONTEXT\n // value is the caller's and answers empty with the contract it missed.\n requireScope(compiled, scope);\n const context = validRequest.context;\n const missingKeys = findMissingContext(compiled, context);\n\n if (missingKeys.length > 0) {\n return {\n result: [],\n meta: {\n cache: {\n hit: cached.hit,\n fingerprint: cached.fingerprint,\n intent: cached.intent ?? validRequest.intent,\n ...(cached.replaced ? { replaced: true } : {}),\n },\n context: buildContextContract(compiled, optionalKeysOf(dsl)),\n warnings: warnings.length > 0 ? warnings : undefined,\n missingContext: missingKeys,\n },\n };\n }\n\n // Execute SQL + map rows to the requested shape. A fingerprint-only\n // replay carries no shape — the stored one drives the envelope.\n const effectiveRequest = hasRequest ? validRequest : { ...validRequest, shape: cached.shape };\n\n // A REACTIVE READ answers from the shared rows and, when the caller asks\n // to follow it, keeps answering. Only a stored entry can be reactive —\n // the mode is authored, never generated — and only one whose mapping is\n // already compiled, because a later answer must never wait on a model.\n const reactiveIr = cached.cachedIr;\n if (cached.hit && cached.refresh === 'reactive' && (effectiveRequest.shape === undefined || reactiveIr !== undefined)) {\n const shape = effectiveRequest.shape;\n const shapeRows = (rows: Row[]): JsonValue =>\n shape === undefined || reactiveIr === undefined ? (rows as unknown as JsonValue) : mapRows(rows, shape, reactiveIr, context, scope);\n const params = await resolveParams(compiled.paramSlots, context, scope, embed);\n // The compiled SQL and its bound values: scope is inside both, so two\n // callers share rows exactly when they would get the same rows.\n const key = canonicalHash([compiled.sql, params]);\n const source: RowsSource = { tables: [...discoverEntities(shaped)], fetch: () => adapter.execute(compiled, params) };\n const execStart = Date.now();\n const rows = await live.read(key, source);\n const executionMs = Date.now() - execStart;\n emit({ type: 'query.rows', count: rows.length, executionMs });\n const result = shapeRows(rows);\n const meta = {\n cache: {\n hit: cached.hit,\n fingerprint: cached.fingerprint,\n intent: cached.intent ?? validRequest.intent,\n },\n context: buildContextContract(compiled, optionalKeysOf(dsl)),\n warnings: warnings.length > 0 ? warnings : undefined,\n };\n const { signal, onChange } = options ?? {};\n if (signal !== undefined && onChange !== undefined) {\n let lastHash = canonicalHash(result);\n live.follow(key, source, rows, {\n deliver: (next) => {\n const nextResult = shapeRows(next);\n const nextHash = canonicalHash(nextResult);\n if (nextHash === lastHash) return;\n lastHash = nextHash;\n onChange({ result: nextResult, meta });\n },\n }, signal);\n }\n emit({ type: 'query.done', totalMs: Date.now() - t0 });\n return { result, meta: { ...meta, timing: { executionMs } } };\n }\n const { result, executionMs, mappingMs, mappedIr } = await executeAndMap(\n compiled, effectiveRequest, cached.cachedIr, context, scope,\n );\n\n // Store the artifact under its fingerprint. Runtime writes are never\n // protected — that bit belongs to seeds and explicit PATCHes only.\n if (!cached.hit) {\n const now = Date.now();\n const entry: OkCacheEntry = {\n kind: 'ok',\n dsl,\n ...(mappedIr !== undefined ? { prismIr: mappedIr } : {}),\n createdAt: now,\n lastUsedAt: now,\n ...(requestHash !== undefined ? { requestHash } : {}),\n ...(validRequest.intent !== undefined ? { intent: validRequest.intent } : {}),\n shape: validRequest.shape,\n ...(cachedFingerprint !== undefined ? { schemaFingerprint: cachedFingerprint } : {}),\n };\n await cache.set(cached.fingerprint, entry);\n }\n\n emit({ type: 'query.done', totalMs: Date.now() - t0 });\n\n return {\n result,\n meta: {\n cache: {\n hit: cached.hit,\n fingerprint: cached.fingerprint,\n intent: cached.intent ?? validRequest.intent,\n ...(cached.replaced ? { replaced: true } : {}),\n },\n context: buildContextContract(compiled, optionalKeysOf(dsl)),\n timing: {\n ...(agentMs !== undefined ? { agentMs } : {}),\n executionMs,\n ...(mappingMs !== undefined ? { mappingMs } : {}),\n },\n warnings: warnings.length > 0 ? warnings : undefined,\n },\n };\n };\n\n // ─── getDslSchema ─────────────────────────────────────────\n\n const getDslSchema = (): object =>\n z.toJSONSchema(QuerySchema, { target: 'draft-7', reused: 'ref' });\n\n // ─── getSchema ─────────────────────────────────────────────\n\n const getSchema = (): DatabaseSchema | undefined => cachedSchema;\n\n return {\n introspect,\n execute,\n compile,\n test,\n getDslSchema,\n getSchema,\n cache,\n invalidate: live.invalidate,\n rows: { stats: live.stats, stop: live.stop },\n };\n};\n","import type {\n DatabaseSchema,\n EntitySchema,\n FieldSchema,\n RelationSchema,\n IndexSchema,\n NormalizedType,\n} from '../../schemas/database.schema.js';\nimport type { IntrospectOptions } from '../adapter.types.js';\n\n// ═══════════════════════════════════════════════════════════════\n// PgPool type (no dependency on `pg` package)\n// ═══════════════════════════════════════════════════════════════\n\nexport type PgQuery = (\n text: string,\n values?: unknown[],\n) => Promise<{ rows: Record<string, unknown>[]; fields?: Array<{ name: string; dataTypeID: number }> }>;\n\nexport type PgPool = {\n query: PgQuery;\n // Several statements land together or not at all.\n //\n // This was missing, and it was not a gap in a future feature: vex's own\n // `executeMutation` throws \"Batch mutations require a transactional client\"\n // whenever a mutation entry is an ARRAY, and no adapter in the repo\n // supplied one — so every batch write failed at runtime with a message\n // about a client nobody could construct. Optional because a pool that\n // genuinely cannot transact should say so by omission rather than by\n // pretending and breaking atomicity quietly.\n transaction?: <T>(fn: (tx: { query: PgQuery }) => Promise<T>) => Promise<T>;\n // False when the database behind the pool cannot enforce\n // `statement_timeout` at all (PGlite: single-threaded, the timer never\n // fires) — see ./statement-timeout.ts. Absent means it can.\n statementTimeouts?: false;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Type mapping\n// ═══════════════════════════════════════════════════════════════\n\nconst normalizeType = (pgType: string): NormalizedType => {\n const lower = pgType.toLowerCase();\n\n // String types\n if (\n lower.startsWith('varchar') ||\n lower.startsWith('character varying') ||\n lower === 'text' ||\n lower.startsWith('char') ||\n lower === 'name' ||\n lower === 'citext'\n ) {\n return 'string';\n }\n\n // Number types\n if (\n lower === 'integer' ||\n lower === 'int' ||\n lower === 'bigint' ||\n lower === 'smallint' ||\n lower === 'serial' ||\n lower === 'bigserial' ||\n lower === 'smallserial' ||\n lower === 'numeric' ||\n lower.startsWith('numeric') ||\n lower === 'decimal' ||\n lower.startsWith('decimal') ||\n lower === 'real' ||\n lower === 'double precision' ||\n lower === 'float' ||\n lower.startsWith('float')\n ) {\n return 'number';\n }\n\n // Boolean\n if (lower === 'boolean' || lower === 'bool') return 'boolean';\n\n // Date\n if (lower === 'date') return 'date';\n\n // Timestamp\n if (lower.startsWith('timestamp')) return 'timestamp';\n\n // UUID\n if (lower === 'uuid') return 'uuid';\n\n // JSON\n if (lower === 'json' || lower === 'jsonb') return 'json';\n\n // Array types (e.g., text[], integer[], etc.)\n if (lower === 'array' || lower.endsWith('[]') || lower.startsWith('_')) return 'array';\n\n // Vector (pgvector)\n if (lower === 'vector' || lower.startsWith('vector')) return 'vector';\n\n return 'unknown';\n};\n\nconst extractVectorDimensions = (pgType: string): number | undefined => {\n // vector(384) → 384\n const match = /vector\\((\\d+)\\)/i.exec(pgType);\n if (match !== null && match[1] !== undefined) {\n return parseInt(match[1], 10);\n }\n return undefined;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// SQL queries for introspection\n// ═══════════════════════════════════════════════════════════════\n\n// A table's and a column's COMMENT is its description: what the schema's author\n// says it means, where Postgres keeps that — and what a query writer needs\n// beside a name (\"members\" are the people in the room). Not part of the schema\n// fingerprint: rewording a comment changes no query.\nconst TABLES_QUERY = `\n SELECT t.table_name, obj_description(cl.oid, 'pg_class') AS description\n FROM information_schema.tables t\n JOIN pg_namespace ns ON ns.nspname = t.table_schema\n JOIN pg_class cl ON cl.relname = t.table_name AND cl.relnamespace = ns.oid\n WHERE t.table_schema = $1\n AND t.table_type = 'BASE TABLE'\n ORDER BY t.table_name\n`;\n\nconst COLUMNS_QUERY = `\n SELECT\n c.table_name,\n c.column_name,\n c.data_type,\n c.udt_name,\n c.is_nullable,\n c.column_default,\n CASE\n WHEN c.data_type = 'USER-DEFINED' THEN c.udt_name\n WHEN c.data_type = 'ARRAY' THEN c.udt_name\n ELSE c.data_type\n END AS effective_type,\n COALESCE(\n (SELECT format_type(a.atttypid, a.atttypmod)\n FROM pg_attribute a\n JOIN pg_class cl ON a.attrelid = cl.oid\n JOIN pg_namespace ns ON cl.relnamespace = ns.oid\n WHERE cl.relname = c.table_name\n AND ns.nspname = $1\n AND a.attname = c.column_name\n AND a.attnum > 0),\n c.data_type\n ) AS full_type,\n (SELECT col_description(a.attrelid, a.attnum)\n FROM pg_attribute a\n JOIN pg_class cl ON a.attrelid = cl.oid\n JOIN pg_namespace ns ON cl.relnamespace = ns.oid\n WHERE cl.relname = c.table_name\n AND ns.nspname = $1\n AND a.attname = c.column_name\n AND a.attnum > 0) AS description\n FROM information_schema.columns c\n WHERE c.table_schema = $1\n ORDER BY c.table_name, c.ordinal_position\n`;\n\n// Every key at once — primary, unique and foreign — from pg_constraint, with\n// the columns in the key's own order and a foreign key's referencing and\n// referenced columns zipped BY POSITION: a two-column key is one row with\n// two ordered pairs.\n//\n// information_schema cannot say this. key_column_usage (the referencing\n// columns) and constraint_column_usage (the referenced ones) share only the\n// constraint's name, so joining them pairs every referencing column with\n// every referenced one, and a key over N columns came back as N×N rows —\n// each read as its own relation, the first of which the resolver joined on.\n// Which came first was row order. A key referencing (id, builder_id) joined\n// on role_id = builder_id and matched nothing, and nothing said so.\n//\n// Ordered by OID, which is creation order. Where two tables reference each\n// other both ways the first-declared key wins the join, and a schema that\n// leans on that (a tenant's builder over a builder's home tenant) is leaning\n// on this ORDER BY. The referenced table must share the schema; a key into\n// another schema names a table no entity here carries and is left out, as\n// before.\nconst CONSTRAINTS_QUERY = `\n SELECT\n c.contype::text AS kind,\n rel.relname AS from_table,\n frel.relname AS to_table,\n array_agg(a.attname ORDER BY k.n)::text[] AS from_columns,\n array_agg(fa.attname ORDER BY k.n)::text[] AS to_columns\n FROM pg_constraint c\n JOIN pg_class rel ON rel.oid = c.conrelid\n JOIN pg_namespace ns ON ns.oid = rel.relnamespace\n LEFT JOIN pg_class frel ON frel.oid = c.confrelid AND frel.relnamespace = rel.relnamespace\n CROSS JOIN LATERAL unnest(c.conkey, c.confkey) WITH ORDINALITY AS k(attnum, fattnum, n)\n JOIN pg_attribute a ON a.attrelid = c.conrelid AND a.attnum = k.attnum\n LEFT JOIN pg_attribute fa ON fa.attrelid = c.confrelid AND fa.attnum = k.fattnum\n WHERE ns.nspname = $1\n AND c.contype IN ('p', 'u', 'f')\n GROUP BY c.oid, c.contype, rel.relname, frel.relname\n ORDER BY c.oid\n`;\n\nconst INDEXES_QUERY = `\n SELECT\n i.tablename AS table_name,\n i.indexname AS index_name,\n ix.indisunique AS is_unique,\n am.amname AS index_type,\n array_agg(a.attname ORDER BY k.n)::text[] AS columns\n FROM pg_indexes i\n JOIN pg_class c ON c.relname = i.indexname\n JOIN pg_index ix ON ix.indexrelid = c.oid\n JOIN pg_am am ON am.oid = c.relam\n CROSS JOIN LATERAL unnest(ix.indkey) WITH ORDINALITY AS k(attnum, n)\n JOIN pg_attribute a ON a.attrelid = ix.indrelid AND a.attnum = k.attnum\n WHERE i.schemaname = $1\n GROUP BY i.tablename, i.indexname, ix.indisunique, am.amname\n ORDER BY i.tablename, i.indexname\n`;\n\nconst ROW_COUNTS_QUERY = `\n SELECT\n relname AS table_name,\n n_live_tup AS row_count\n FROM pg_stat_user_tables\n WHERE schemaname = $1\n`;\n\n// ═══════════════════════════════════════════════════════════════\n// Introspection\n// ═══════════════════════════════════════════════════════════════\n\nexport const introspectPostgres = async (\n pool: PgPool,\n options?: IntrospectOptions,\n): Promise<DatabaseSchema> => {\n const schemaName = options?.schema ?? 'public';\n\n // Run all queries in parallel\n const [tablesResult, columnsResult, keysResult, indexesResult, rowCountsResult] = await Promise.all([\n pool.query(TABLES_QUERY, [schemaName]),\n pool.query(COLUMNS_QUERY, [schemaName]),\n pool.query(CONSTRAINTS_QUERY, [schemaName]),\n pool.query(INDEXES_QUERY, [schemaName]),\n pool.query(ROW_COUNTS_QUERY, [schemaName]),\n ]);\n\n // ─── Keys ──────────────────────────────────────────────────\n type Key = {\n kind: 'p' | 'u' | 'f';\n fromTable: string;\n toTable: string | null;\n fromColumns: string[];\n toColumns: Array<string | null>;\n };\n\n const keys: Key[] = keysResult.rows.map((row) => ({\n kind: row['kind'] as Key['kind'],\n fromTable: row['from_table'] as string,\n toTable: (row['to_table'] as string | null) ?? null,\n fromColumns: row['from_columns'] as string[],\n toColumns: row['to_columns'] as Array<string | null>,\n }));\n\n // Primary keys: table -> PK column names (flags the field)\n const pkMap = new Map<string, Set<string>>();\n // Every column set that makes a row unique — primary and unique keys,\n // whole. A foreign key's reverse is hasOne when the key CONTAINS one of\n // these sets, not when one of its columns appears in any of them:\n // UNIQUE (builder_id, name) says nothing about builder_id alone.\n const uniqueSets = new Map<string, string[][]>();\n for (const key of keys) {\n if (key.kind === 'f') continue;\n if (key.kind === 'p') {\n let cols = pkMap.get(key.fromTable);\n if (cols === undefined) {\n cols = new Set();\n pkMap.set(key.fromTable, cols);\n }\n for (const col of key.fromColumns) cols.add(col);\n }\n let sets = uniqueSets.get(key.fromTable);\n if (sets === undefined) {\n sets = [];\n uniqueSets.set(key.fromTable, sets);\n }\n sets.push(key.fromColumns);\n }\n\n // Row counts: table -> count\n const rowCountMap = new Map<string, number>();\n for (const row of rowCountsResult.rows) {\n const table = row['table_name'] as string;\n const count = Number(row['row_count'] ?? 0);\n rowCountMap.set(table, count);\n }\n\n // ─── Columns grouped by table ─────────────────────────────\n const columnsByTable = new Map<string, FieldSchema[]>();\n for (const row of columnsResult.rows) {\n const table = row['table_name'] as string;\n const colName = row['column_name'] as string;\n const dataType = row['effective_type'] as string;\n const fullType = row['full_type'] as string;\n const isNullable = row['is_nullable'] as string;\n const colDefault = row['column_default'] as string | null;\n const colDescription = row['description'] as string | null;\n\n const tablePks = pkMap.get(table);\n const isPk = tablePks !== undefined && tablePks.has(colName);\n\n const nt = normalizeType(fullType ?? dataType);\n const vecDims = nt === 'vector' ? extractVectorDimensions(fullType ?? dataType) : undefined;\n\n const field: FieldSchema = {\n name: colName,\n type: fullType ?? dataType,\n normalizedType: nt,\n nullable: isNullable === 'YES',\n primaryKey: isPk,\n ...(colDefault !== null ? { defaultValue: colDefault } : {}),\n ...(colDescription !== null && colDescription !== '' ? { description: colDescription } : {}),\n ...(vecDims !== undefined ? { vectorDimensions: vecDims } : {}),\n };\n\n let fields = columnsByTable.get(table);\n if (fields === undefined) {\n fields = [];\n columnsByTable.set(table, fields);\n }\n fields.push(field);\n }\n\n // ─── Foreign keys → Relations ──────────────────────────────\n // One key, two relations: the referencing side's belongsTo and the\n // referenced side's reverse, each carrying the whole key as ordered pairs.\n const relationsByTable = new Map<string, RelationSchema[]>();\n const addRelation = (table: string, relation: RelationSchema): void => {\n let rels = relationsByTable.get(table);\n if (rels === undefined) {\n rels = [];\n relationsByTable.set(table, rels);\n }\n rels.push(relation);\n };\n\n for (const key of keys) {\n if (key.kind !== 'f' || key.toTable === null) continue;\n const foreignFields = key.toColumns.filter((col): col is string => col !== null);\n if (foreignFields.length !== key.fromColumns.length) continue;\n\n const isFkUnique = (uniqueSets.get(key.fromTable) ?? []).some((set) =>\n set.every((col) => key.fromColumns.includes(col)),\n );\n\n // belongsTo: this table's key points at the other table\n addRelation(key.fromTable, {\n type: 'belongsTo',\n entity: key.toTable,\n localFields: key.fromColumns,\n foreignFields,\n });\n\n // hasOne or hasMany: the other table's reverse of the same key\n addRelation(key.toTable, {\n type: isFkUnique ? 'hasOne' : 'hasMany',\n entity: key.fromTable,\n localFields: foreignFields,\n foreignFields: key.fromColumns,\n });\n }\n\n // ─── Indexes ───────────────────────────────────────────────\n const indexesByTable = new Map<string, IndexSchema[]>();\n\n for (const row of indexesResult.rows) {\n const table = row['table_name'] as string;\n const indexName = row['index_name'] as string;\n const isUnique = row['is_unique'] as boolean;\n const indexType = row['index_type'] as string;\n const columns = row['columns'] as string[];\n\n const mappedType = mapIndexType(indexType);\n\n const idx: IndexSchema = {\n name: indexName,\n fields: columns,\n unique: isUnique,\n type: mappedType,\n };\n\n let idxList = indexesByTable.get(table);\n if (idxList === undefined) {\n idxList = [];\n indexesByTable.set(table, idxList);\n }\n idxList.push(idx);\n }\n\n // ─── Build entities ────────────────────────────────────────\n const filteredTables = tablesResult.rows.filter((row) => {\n const name = row['table_name'] as string;\n if (options?.entities !== undefined && !options.entities.includes(name)) return false;\n if (options?.exclude !== undefined && options.exclude.includes(name)) return false;\n return true;\n });\n\n const entities: EntitySchema[] = filteredTables.map((row) => {\n const tableName = row['table_name'] as string;\n const tableDescription = row['description'] as string | null;\n return {\n name: tableName,\n table: tableName,\n ...(tableDescription !== null && tableDescription !== '' ? { description: tableDescription } : {}),\n fields: columnsByTable.get(tableName) ?? [],\n relations: relationsByTable.get(tableName) ?? [],\n indexes: indexesByTable.get(tableName) ?? [],\n rowCount: rowCountMap.get(tableName),\n };\n });\n\n return { entities };\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Helpers\n// ═══════════════════════════════════════════════════════════════\n\nconst mapIndexType = (pgType: string): IndexSchema['type'] => {\n const lower = pgType.toLowerCase();\n if (lower === 'btree') return 'btree';\n if (lower === 'hash') return 'hash';\n if (lower === 'gin') return 'gin';\n if (lower === 'gist') return 'gist';\n if (lower === 'ivfflat') return 'ivfflat';\n if (lower === 'hnsw') return 'hnsw';\n return 'other';\n};\n","import type { ResolvedQuery } from '../../engine/engine.types.js';\nimport type { CompiledQuery, ParamSlot, ContextContract } from '../adapter.types.js';\nimport { compileFilter, compileCompute, compileAggregate, compileJoinPairs, quoteIdent } from './operators.js';\nimport { VexError } from '../../errors.js';\nimport type { CompilationContext } from './operators.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Query compilation\n// ═══════════════════════════════════════════════════════════════\n\nexport const compileQuery = (resolved: ResolvedQuery): CompiledQuery => {\n const paramSlots: ParamSlot[] = [];\n const paramCounter = { value: 0 };\n\n const ctx: CompilationContext = {\n resolvedPaths: resolved.filter?.resolvedPaths ?? new Map(),\n aliasMap: resolved.aliasMap,\n paramSlots,\n paramCounter,\n ...(resolved.existsMap !== undefined ? { existsMap: resolved.existsMap } : {}),\n };\n\n const sqlParts: string[] = [];\n\n // ─── SELECT ────────────────────────────────────────────────\n const selectParts: string[] = [];\n\n if (resolved.distinct) {\n selectParts.push('DISTINCT');\n }\n\n // Regular fields\n const fieldColumns = resolved.fields.map((f) =>\n `${f.alias}.${f.column} AS ${quoteIdent(f.outputName)}`,\n );\n\n // Computed fields\n const computeColumns = resolved.computes.map((c) => {\n const expr = compileCompute(c.expression, ctx);\n return `${expr} AS ${quoteIdent(c.name)}`;\n });\n\n // Aggregate fields\n const aggregateColumns = resolved.aggregates.map((a) => {\n const expr = compileAggregate(a.expression, ctx);\n return `${expr} AS ${quoteIdent(a.name)}`;\n });\n\n // Semantic score column\n const semanticColumns: string[] = [];\n if (resolved.semantic !== undefined) {\n const col = `${resolved.semantic.field.alias}.${resolved.semantic.field.column}`;\n\n // The semantic parameter was already added when compiling the filter\n // We need to add the score column using the same parameter reference\n // Find the semantic param slot index\n const semanticParamIndex = findSemanticParamIndex(paramSlots);\n if (semanticParamIndex !== undefined) {\n semanticColumns.push(`1 - (${col} <=> $${semanticParamIndex}) AS \"$score\"`);\n }\n }\n\n const allColumns = [...fieldColumns, ...computeColumns, ...aggregateColumns, ...semanticColumns];\n if (selectParts.length > 0) {\n sqlParts.push(`SELECT ${selectParts.join(' ')} ${allColumns.join(', ')}`);\n } else {\n sqlParts.push(`SELECT ${allColumns.join(', ')}`);\n }\n\n // ─── FROM ──────────────────────────────────────────────────\n const firstSource = resolved.sources[0];\n if (firstSource !== undefined) {\n if (firstSource.subquery !== undefined) {\n const subSql = compileQuery(firstSource.subquery);\n // Merge sub-params into our slots (offset positions)\n mergeSubqueryParams(subSql, paramSlots, paramCounter);\n sqlParts.push(`FROM (${subSql.sql}) AS ${firstSource.alias}`);\n } else if (firstSource.table !== undefined) {\n sqlParts.push(`FROM ${firstSource.table} AS ${firstSource.alias}`);\n }\n }\n\n // ─── JOIN ──────────────────────────────────────────────────\n // A join's ON clause is the FK condition plus anything scope put there. The\n // extras only ever appear on LEFT joins, and they are the whole reason a LEFT\n // join survives a row rule: in WHERE they would annihilate every driving row\n // whose optional FK is null.\n for (const join of resolved.joins) {\n const joinSource = resolved.sources.find((s) => s.alias === join.toAlias);\n if (joinSource !== undefined) {\n const keyword = join.kind === 'left' ? 'LEFT JOIN' : 'JOIN';\n const conditions = [\n ...compileJoinPairs(join),\n ...(join.on ?? []).map((extra) => compileFilter(extra.original, ctx)),\n ];\n const on = conditions.join(' AND ');\n if (joinSource.subquery !== undefined) {\n const subSql = compileQuery(joinSource.subquery);\n mergeSubqueryParams(subSql, paramSlots, paramCounter);\n sqlParts.push(`${keyword} (${subSql.sql}) AS ${join.toAlias} ON ${on}`);\n } else {\n sqlParts.push(`${keyword} ${join.toTable} AS ${join.toAlias} ON ${on}`);\n }\n }\n }\n\n // ─── CROSS JOIN ────────────────────────────────────────────\n // Sources past the first with no join condition are cross-joined. A string\n // entity always gets an FK join (or the resolver throws), so in practice only\n // subquery sources land here — independent derived tables the author chose to\n // combine (e.g. four single-row COUNT aggregates → one row of counts). The\n // cartesian product is therefore intended, not an inferred mistake.\n const joinedAliases = new Set(resolved.joins.map((j) => j.toAlias));\n for (const source of resolved.sources) {\n if (source.alias === firstSource?.alias || joinedAliases.has(source.alias)) continue;\n if (source.subquery !== undefined) {\n const subSql = compileQuery(source.subquery);\n mergeSubqueryParams(subSql, paramSlots, paramCounter);\n sqlParts.push(`CROSS JOIN (${subSql.sql}) AS ${source.alias}`);\n } else if (source.table !== undefined) {\n sqlParts.push(`CROSS JOIN ${source.table} AS ${source.alias}`);\n }\n }\n\n // ─── WHERE ─────────────────────────────────────────────────\n if (resolved.filter !== undefined) {\n const whereClause = compileFilter(resolved.filter.original, ctx);\n sqlParts.push(`WHERE ${whereClause}`);\n }\n\n // ─── GROUP BY ──────────────────────────────────────────────\n if (resolved.groupBy.length > 0) {\n const groupByParts = resolved.groupBy.map((f) => `${f.alias}.${f.column}`);\n sqlParts.push(`GROUP BY ${groupByParts.join(', ')}`);\n }\n\n // ─── ORDER BY ──────────────────────────────────────────────\n if (resolved.sort.length > 0) {\n const orderByParts = resolved.sort.map((s) => {\n if (typeof s.field === 'string') {\n return `${quoteIdent(s.field)} ${s.dir === 'desc' ? 'DESC' : 'ASC'}`;\n }\n return `${s.field.alias}.${s.field.column} ${s.dir === 'desc' ? 'DESC' : 'ASC'}`;\n });\n sqlParts.push(`ORDER BY ${orderByParts.join(', ')}`);\n } else if (resolved.semantic !== undefined) {\n const semanticIdx = findSemanticParamIndex(paramSlots);\n if (semanticIdx !== undefined) {\n const col = `${resolved.semantic.field.alias}.${resolved.semantic.field.column}`;\n sqlParts.push(`ORDER BY ${col} <=> $${semanticIdx} ASC`);\n }\n }\n\n // ─── LIMIT ─────────────────────────────────────────────────\n if (resolved.limit !== undefined) {\n // The schema says a positive integer; a DSL that skipped the schema is held\n // to it here, because this is text, not a parameter.\n if (!Number.isInteger(resolved.limit) || resolved.limit < 1) {\n throw new VexError('invalid_dsl', `LIMIT must be a positive integer, not ${String(resolved.limit)}.`);\n }\n sqlParts.push(`LIMIT ${resolved.limit}`);\n }\n\n // ─── Build context contract ────────────────────────────────\n const contextContract: ContextContract = {};\n for (const slot of paramSlots) {\n contextContract[slot.key] = { type: slot.type, kind: slot.kind };\n }\n\n return {\n sql: sqlParts.join(' '),\n paramSlots,\n contextContract,\n };\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Helpers\n// ═══════════════════════════════════════════════════════════════\n\nconst findSemanticParamIndex = (slots: ParamSlot[]): number | undefined => {\n for (let i = 0; i < slots.length; i++) {\n const slot = slots[i];\n if (slot !== undefined && slot.kind === 'semantic') {\n return i + 1; // 1-indexed for $N references\n }\n }\n return undefined;\n};\n\nconst mergeSubqueryParams = (\n subCompiled: CompiledQuery,\n parentSlots: ParamSlot[],\n parentCounter: { value: number },\n): void => {\n // Subqueries have their own parameter numbering which we need to\n // offset when embedding in the parent query. For simplicity in this\n // implementation, subquery parameters are compiled independently.\n // A full implementation would rewrite $N references in the subquery SQL.\n // For now, subqueries that reference context/scope params work because\n // the executor resolves all params from all slots in order.\n for (const slot of subCompiled.paramSlots) {\n parentCounter.value += 1;\n parentSlots.push(slot);\n }\n};\n","import type { PgPool } from './introspect.js';\n\n// ═══════════════════════════════════════════════════════════════\n// HOW LONG ONE READ MAY RUN, enforced where it is cheapest.\n//\n// The engine asks for a ceiling (`config.statementTimeoutMs`); the database\n// is what has to enforce it — a client that stops waiting leaves the query\n// running on the server (measured: `query_timeout` gave up at 200ms and the\n// sleep was still active in pg_stat_activity). Postgres enforces\n// `statement_timeout` two ways, and they cost very differently (Postgres 17,\n// 500 reads each):\n//\n// · on the connection (the pool's own `statement_timeout`, a role or a\n// database default) — 0.36ms a read, the same as none;\n// · per statement (`SET LOCAL` in a transaction) — 1.37ms a read, 3.4×,\n// and more across a network.\n//\n// So the adapter asks the database once what its connections already\n// enforce. At or under the ceiling: reads run plain. Otherwise each read is\n// wrapped. A pool that cannot enforce it at all (PGlite: single-threaded, the\n// timer never fires — a 2s sleep ran 2.9s under a 200ms limit) says so, and\n// reads run unbounded with one warning.\n// ═══════════════════════════════════════════════════════════════\n\nexport type TimeoutEnforcement = 'connection' | 'statement' | 'unenforced';\n\n// `SHOW statement_timeout` answers in Postgres units: '0', '250ms', '5s',\n// '1min', '2h', '1d'; a bare number is milliseconds.\nconst UNIT_MS: Record<string, number> = { '': 1, ms: 1, s: 1000, min: 60_000, h: 3_600_000, d: 86_400_000 };\n\nexport const parseTimeout = (shown: string): number | undefined => {\n const match = /^\\s*(\\d+(?:\\.\\d+)?)\\s*(ms|s|min|h|d)?\\s*$/.exec(shown);\n if (match === null) return undefined;\n const unit = UNIT_MS[match[2] ?? ''];\n return unit === undefined ? undefined : Number(match[1]) * unit;\n};\n\nexport const enforcementFor = async (pool: PgPool, ceilingMs: number): Promise<TimeoutEnforcement> => {\n if (pool.statementTimeouts === false) return 'unenforced';\n const shown = await pool.query('SHOW statement_timeout');\n const current = parseTimeout(String(shown.rows[0]?.['statement_timeout'] ?? ''));\n if (current !== undefined && current > 0 && current <= ceilingMs) return 'connection';\n return pool.transaction === undefined ? 'unenforced' : 'statement';\n};\n","import type { DatabaseAdapter, AdapterCapabilities, CompiledQuery, BoundParams, Row, IntrospectOptions } from '../adapter.types.js';\nimport type { DatabaseSchema } from '../../schemas/database.schema.js';\nimport type { ResolvedQuery } from '../../engine/engine.types.js';\nimport { introspectPostgres } from './introspect.js';\nimport type { PgPool } from './introspect.js';\nimport { compileQuery } from './compile.js';\nimport { enforcementFor, type TimeoutEnforcement } from './statement-timeout.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Config\n// ═══════════════════════════════════════════════════════════════\n\nexport type PostgresAdapterConfig = {\n pool: PgPool;\n schema?: string;\n // Tables this adapter never reports. Set once at construction because the\n // caller that knows a table is not application data is the one wiring the\n // adapter, not each caller of `introspect()` — and `QueryEngine.introspect`\n // takes no arguments, so per-call is not reachable from a host anyway.\n exclude?: string[];\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Adapter factory\n// ═══════════════════════════════════════════════════════════════\n\nconst NUMERIC_OIDS = new Set([\n 20, // int8\n 700, // float4\n 701, // float8\n 1700, // numeric\n]);\n\ntype PgField = { name: string; dataTypeID: number };\n\nconst coerceNumericColumns = (rows: Row[], fields: PgField[]): Row[] => {\n const numericKeys = fields\n .filter(f => NUMERIC_OIDS.has(f.dataTypeID))\n .map(f => f.name);\n if (numericKeys.length === 0 || rows.length === 0) return rows;\n return rows.map(row => {\n const out = { ...row };\n for (const key of numericKeys) {\n const v = out[key];\n if (typeof v === 'string') {\n const n = Number(v);\n if (Number.isFinite(n)) out[key] = n;\n }\n }\n return out;\n });\n};\n\nexport const createPostgresAdapter = (config: PostgresAdapterConfig): DatabaseAdapter => {\n const { pool, schema = 'public', exclude } = config;\n\n const capabilities: AdapterCapabilities = {\n vectorSearch: true,\n fuzzyMatch: false, // Requires pg_trgm extension, not guaranteed\n jsonFields: true,\n fullTextSearch: true,\n returningClause: true,\n cte: true,\n windowFunctions: true,\n statementTimeout: true,\n };\n\n const introspect = async (options?: IntrospectOptions): Promise<DatabaseSchema> =>\n introspectPostgres(pool, {\n ...options,\n schema: options?.schema ?? schema,\n exclude: options?.exclude ?? exclude,\n });\n\n const compile = (resolved: ResolvedQuery): CompiledQuery =>\n compileQuery(resolved);\n\n // How reads are bounded (./statement-timeout.ts): unbounded until the\n // engine asks; then plain when the connection already enforces the limit,\n // wrapped per statement when it does not.\n let perStatementMs: number | undefined;\n const limitReads = async (ms: number): Promise<TimeoutEnforcement> => {\n perStatementMs = undefined;\n if (ms <= 0) return 'unenforced';\n const enforcement = await enforcementFor(pool, ms);\n if (enforcement === 'statement') perStatementMs = Math.round(ms);\n return enforcement;\n };\n\n const execute = async (query: CompiledQuery, params: BoundParams): Promise<Row[]> => {\n const limit = perStatementMs;\n // `transaction` is called ON the pool, never taken off it: a driver's own\n // object (a PGlite) has it as a method that needs its receiver.\n const result =\n limit === undefined || pool.transaction === undefined\n ? await pool.query(query.sql, params)\n : await pool.transaction(async (tx) => {\n // SET cannot take a bind parameter; the limit is an integer the\n // engine configured, never request data.\n await tx.query(`SET LOCAL statement_timeout = ${limit}`);\n return tx.query(query.sql, params);\n });\n return coerceNumericColumns(result.rows, result.fields as PgField[]);\n };\n\n return {\n id: 'postgres',\n introspect,\n compile,\n execute,\n capabilities,\n limitReads,\n };\n};\n","// ═══════════════════════════════════════════════════════════\n// The agent-facing Vex guide — exported knowledge, not app prose.\n//\n// Any agent that reads or embeds Vex endpoints injects THIS text\n// (plus `handleDiscovery` output for the live per-endpoint facts:\n// entities, existing fingerprints, the DSL schema). Apps add only\n// their genuinely app-specific lines (URLs, house rules) — they\n// never re-explain Vex, so the contract can't drift per app.\n// ═══════════════════════════════════════════════════════════\n\nexport const vexGuide = (): string =>\n [\n 'VEX — how to read data. A Vex endpoint answers POST with a JSON body and returns { result, meta }.',\n '',\n 'The request body takes one of three postures:',\n ' 1. GENERATE: { intent, shape, context? } — intent is plain English (all detail: filters, thresholds, sorting, grouping); shape is a JSON EXAMPLE of the output (an ARRAY with one example element returns a LIST; a plain OBJECT returns ONE record; values are type markers: \"\" 0 false). The result is cached and meta.cache.fingerprint carries its identity.',\n ' 2. REPLAY: { fingerprint, context? } — re-runs the exact cached query. Never regenerates. Unknown fingerprint → error cache_miss.',\n ' 3. NAMED SLOT: { fingerprint, intent, shape, context? } — hit when the stored request matches; regenerate-and-replace when it differs (protected slots refuse with fingerprint_protected).',\n '',\n 'context — runtime values, bound as SQL parameters:',\n ' - Keys are part of the query\\'s contract; VALUES vary freely per call. Replaying one fingerprint with different context values re-runs the same query with new parameters — this is how a search term, an id, a threshold, or a date flows in per call.',\n ' - The query binds ONLY keys you pass at generation. To parameterize a query: name the value in the intent AND pass the key with a real value in context — e.g. intent \"companies whose name contains the search text\" with context { \"q\": \"acme\" }. Replays then pass new values for the same keys.',\n ' - Reserved keys: sortBy (an \"entity.field\", schema-validated) and sortDir (\"asc\"|\"desc\") drive ORDER BY directly on any replay.',\n ' - A value the query filters with ILIKE is a pattern: \"%text%\" matches contains.',\n ' - OPTIONAL keys: meta.context marks some keys `optional: true`. Those switch a condition ON — send the key and it applies, omit it and the condition is not in the query at all (it does not match everything by accident, and omitting it is never an error). A key marked `absent: true` is one you did not send on this run. This is how one fingerprint answers \"everyone\", \"everyone matching a search\", and \"one by id\".',\n '',\n 'result — exactly the requested shape (array, object, or scalar). meta.cache = { hit, fingerprint, replaced? }; meta.missingContext lists REQUIRED context keys you did not send — the query ran without them, so the result is WRONG. Supply the keys and re-run before trusting it. Optional keys never appear there; leaving one out is a choice, not a mistake.',\n '',\n 'GET on the same URL returns the endpoint\\'s self-description: its entities, the query body contract, and every existing named fingerprint with its intent — check it before generating a query that may already exist.',\n ].join('\\n');\n","import type { Query } from '../schemas/query.schema.js';\nimport type { CompiledIr } from '@niscorp/prism';\nimport type { MutationDefinition } from '../mutations/schema.js';\nimport type { Sequence } from '@niscorp/strata';\n\n// ───────────────────────────────────────────────────────────────\n// Cache entries\n//\n// Discriminated on `kind`:\n// - 'ok' — a successful shape→DSL synthesis (+ optional\n// Prism mapping IR). The happy path.\n// - 'mutation' — a WRITE artifact: a dev-authored mutation def\n// replayed by fingerprint. Never generated; enters\n// only through the seed path (and is normally\n// protected). Replay-only under any posture.\n// - 'unsatisfiable' — a negative result: the agent decided this\n// shape/intent cannot be satisfied. Cached so we\n// don't re-run the agent on a known-impossible\n// request. Always carries an `expiresAt` (a shape\n// impossible today may be possible after a schema\n// change).\n// ───────────────────────────────────────────────────────────────\n\n// ───────────────────────────────────────────────────────────────\n// When a read's answer is refreshed.\n//\n// 'snapshot' — the default, and what every read was before this existed:\n// answered when asked, never again.\n// 'reactive' — answered when asked, and again whenever a write lands on a\n// table the query reads, for as long as somebody follows it\n// (see engine/live.ts). Rows are shared between callers whose\n// compiled SQL and bound values are identical.\n//\n// A mode, not a flag, because it will grow: time as a source of change\n// (a read that depends on `today`) is the next state it is waiting for.\n// ───────────────────────────────────────────────────────────────\n\nexport const REFRESH_MODES = ['snapshot', 'reactive'] as const;\nexport type Refresh = (typeof REFRESH_MODES)[number];\n\nexport const isRefresh = (value: unknown): value is Refresh => REFRESH_MODES.some((mode) => mode === value);\n\ntype CacheEntryMeta = {\n createdAt: number;\n /**\n * Touch-on-read timestamp. Lifetime is usage: a GC sweep evicts\n * entries unused for a configured window; protected entries never\n * sweep. Replaces the provisional/permanent distinction entirely.\n */\n lastUsedAt?: number;\n expiresAt?: number;\n /**\n * Protected entries refuse replacement: a fingerprint request whose\n * intent/shape differ from the stored ones errors instead of\n * regenerating. Written ONLY by the seed path and an explicit PATCH —\n * never by query execution.\n */\n protected?: boolean;\n /**\n * Identity of the request that produced this entry (intent + normalized\n * shape + context key names). A fingerprint request with a matching\n * hash is a hit; a differing one regenerates (or 409s when protected).\n */\n requestHash?: string;\n /**\n * Fingerprint of the database schema at write time. When it no longer\n * matches the current schema, the entry is stale (its DSL may\n * reference columns that have since changed) and is treated as a miss.\n */\n schemaFingerprint?: string;\n /**\n * The originating request's intent and shape — descriptive metadata\n * for inspection and the GET overview. Never part of identity.\n */\n intent?: string;\n shape?: unknown;\n};\n\nexport type OkCacheEntry = CacheEntryMeta & {\n kind: 'ok';\n dsl: Query;\n prismIr?: CompiledIr;\n /**\n * THE REACH THIS READ REQUIRES, whatever the caller's roles say.\n *\n * Reach is normally the caller's: a scope profile named by their role, applied\n * to every table they touch. That is right for a read whose answer legitimately\n * widens with the reader — a roster, a schedule, a members list.\n *\n * It is wrong for a read that means \"mine\". A principal may hold several roles\n * and the compiled policies merge to the WIDEST reach any of them grants, so an\n * instructor who also trains at the studio reads `bookings` studio-wide — and\n * \"the classes you have booked\" then answers with the whole studio's.\n *\n * An entry naming a reach is served at that profile instead, with the caller's\n * own grants unchanged. It can only narrow: a read the caller holds no verb for\n * is still refused. If the profile cannot be compiled, the read is refused\n * rather than served wide.\n */\n reach?: string;\n /** When this read's answer is refreshed. Absent means 'snapshot'. */\n refresh?: Refresh;\n};\n\nexport type UnsatisfiableCacheEntry = CacheEntryMeta & {\n kind: 'unsatisfiable';\n reason: string;\n};\n\nexport type MutationCacheEntry = CacheEntryMeta & {\n kind: 'mutation';\n mutation: MutationDefinition;\n /**\n * THE REACH THIS WRITE REQUIRES — the same word reads use, and it belongs\n * here for a sharper reason.\n *\n * A read served too wide shows somebody too much. A write served too wide\n * CHANGES somebody else's row: `me/cancel` is \"cancel MY booking\", and its\n * whole safety is that the policy's update rules pin the row to the caller.\n * Take a principal who holds two roles and the merge widens those rules to\n * the broadest either grants — so the same fingerprint, replayed by somebody\n * who is a member AND something else, could reach a booking that is not\n * theirs.\n *\n * Declaring it here means the write is compiled at that profile whoever asks.\n */\n reach?: string;\n};\n\nexport type CacheEntry = OkCacheEntry | UnsatisfiableCacheEntry | MutationCacheEntry;\n\n// ───────────────────────────────────────────────────────────────\n// Backend interface\n//\n// `get/set/delete/clear/keys` are the core contract every backend\n// implements. `init` and `entries` are optional capabilities: backends\n// that need setup (Postgres) expose `init`, and backends that can\n// enumerate without N+1 reads (Postgres, memory) expose `entries`. The\n// tiered cache uses both for warm-up; a management UI would use\n// `entries` for browsing.\n// ───────────────────────────────────────────────────────────────\n\nexport type CacheBackend = {\n get: (key: string) => Promise<CacheEntry | undefined>;\n set: (key: string, entry: CacheEntry) => Promise<void>;\n delete: (key: string) => Promise<void>;\n clear: () => Promise<void>;\n keys: () => Promise<string[]>;\n init?: () => Promise<void>;\n // The tables this backend owns, as a strata sequence (Postgres). A host that\n // migrates several owners in one run (moss) collects it; `init` applies it\n // alone for everyone else. Either way it goes through the ledger.\n sequence?: Sequence;\n entries?: () => Promise<Array<{ key: string; entry: CacheEntry }>>;\n};\n","import { QuerySchema } from '../schemas/query.schema.js';\nimport { MutationDefinitionSchema } from '../mutations/schema.js';\nimport { depthRefusal, exceedsDepth } from '@niscorp/strata';\nimport type { CacheEntry } from './cache.types.js';\nimport { isRefresh } from './cache.types.js';\n\n// ───────────────────────────────────────────────────────────────\n// Entry validation\n//\n// Every persisted (jsonb) write is validated before it lands, and every\n// entry promoted from a durable backend into memory is validated before\n// it is trusted. This is the guard that keeps a corrupt or\n// schema-drifted row from poisoning the cache. It is deliberately cheap\n// and synchronous so it can sit on the write path and the promotion\n// path without adding a round-trip.\n// ───────────────────────────────────────────────────────────────\n\n// Prism does not export a Zod schema for the *compiled* IR (only for\n// the input Config), so we validate structurally. The runtime-attached\n// `__op`/`__segments` handlers are non-enumerable and do not survive a\n// JSON round-trip — that is fine, Prism's evaluator falls back to its\n// discriminant chain when they are absent. We only assert the\n// serializable skeleton is intact.\nconst isCompiledIr = (value: unknown): boolean => {\n if (value === null || typeof value !== 'object') return false;\n const ir = value as Record<string, unknown>;\n if (ir['irVersion'] !== 1) return false;\n if (!('core' in ir)) return false;\n const tables = ir['tables'];\n if (tables === null || typeof tables !== 'object') return false;\n const t = tables as Record<string, unknown>;\n return Array.isArray(t['paths']) && Array.isArray(t['strings']);\n};\n\n/**\n * Returns `null` if the entry is valid, or a human-readable reason\n * string if it is not.\n */\nexport const validateEntry = (entry: CacheEntry): string | null => {\n if (typeof entry.createdAt !== 'number') return 'createdAt must be a number';\n if (entry.expiresAt !== undefined && typeof entry.expiresAt !== 'number') {\n return 'expiresAt must be a number when present';\n }\n\n if (entry.kind === 'unsatisfiable') {\n return typeof entry.reason === 'string' && entry.reason.length > 0\n ? null\n : 'unsatisfiable entry requires a non-empty reason';\n }\n\n if (entry.kind === 'ok') {\n if (exceedsDepth(entry.dsl)) return `invalid dsl: ${depthRefusal()}`;\n const parsed = QuerySchema.safeParse(entry.dsl);\n if (!parsed.success) return `invalid dsl: ${parsed.error.message}`;\n if (entry.prismIr !== undefined && !isCompiledIr(entry.prismIr)) {\n return 'invalid prismIr: not a CompiledIr structure';\n }\n if (entry.refresh !== undefined && !isRefresh(entry.refresh)) {\n return `invalid refresh: ${String(entry.refresh)}`;\n }\n return null;\n }\n\n if (entry.kind === 'mutation') {\n if (exceedsDepth(entry.mutation)) return `invalid mutation: ${depthRefusal()}`;\n const parsed = MutationDefinitionSchema.safeParse(entry.mutation);\n return parsed.success ? null : `invalid mutation: ${parsed.error.message}`;\n }\n\n return `unknown cache entry kind: ${String((entry as { kind: unknown }).kind)}`;\n};\n","import type { PgPool } from '../adapters/postgres/introspect.js';\nimport type { Query } from '../schemas/query.schema.js';\nimport type { CompiledIr } from '@niscorp/prism';\nimport type { MutationDefinition } from '../mutations/schema.js';\nimport type { CacheBackend, CacheEntry } from './cache.types.js';\nimport { isRefresh } from './cache.types.js';\nimport { validateEntry } from './validate.js';\nimport { fireAndForget } from './util.js';\nimport type { Sequence } from '@niscorp/strata';\nimport { migrate } from '@niscorp/strata/postgres';\n\nexport type { PgPool };\n\n// ═══════════════════════════════════════════════════════════════\n// Postgres cache backend (L2 — durable source of truth)\n//\n// Stores entries as jsonb in a configurable schema/table. Designed to\n// sit *behind* an in-memory tier (see createTieredCache): on its own it\n// reads from Postgres on every get, which is correct but not what you\n// want on the hot path. Use it directly only when you don't want an L1.\n//\n// Guarantees:\n// - Every write is schema-validated first. An invalid entry is never\n// written — it is logged via onError (or thrown if no handler).\n// - Reads are validated too (rare: L2 misses / warm-up). A corrupt or\n// schema-drifted row is evicted on read so it can't keep failing.\n// - TTL (expires_at) is enforced server-side; expired rows read as\n// misses and are excluded from keys()/entries().\n// ═══════════════════════════════════════════════════════════════\n\nexport type PostgresCacheConfig = {\n /** A pg Pool (or anything matching its query shape). The caller owns its lifecycle. */\n pool: PgPool;\n /** Schema to place the cache table in. Default: 'public'. */\n schema?: string;\n /** Table name. Default: 'vex_cache'. */\n table?: string;\n /** Called on rejected writes and evicted-on-read invalid rows. */\n onError?: (err: unknown) => void;\n};\n\nexport type PostgresCache = CacheBackend & {\n init: () => Promise<void>;\n sequence: Sequence;\n entries: () => Promise<Array<{ key: string; entry: CacheEntry }>>;\n};\n\n// Identifiers cannot be parameterized in SQL, so they are validated\n// against a strict allowlist and double-quoted.\nconst IDENT = /^[A-Za-z_][A-Za-z0-9_]*$/;\nconst quoteIdent = (name: string, label: string): string => {\n if (!IDENT.test(name)) {\n throw new Error(`Invalid ${label} identifier for postgres cache: \"${name}\"`);\n }\n return `\"${name}\"`;\n};\n\nconst SELECT_COLS =\n 'key, kind, intent, shape, dsl, prism_ir, reach, reason, created_at, expires_at, schema_fingerprint, protected, last_used_at, request_hash, refresh';\n\nconst rowToEntry = (row: Record<string, unknown>): CacheEntry => {\n const createdAt = (row['created_at'] as Date).getTime();\n const expiresAtRaw = row['expires_at'] as Date | null;\n const lastUsedRaw = row['last_used_at'] as Date | null;\n const fingerprint = row['schema_fingerprint'] as string | null;\n const meta = {\n createdAt,\n ...(expiresAtRaw ? { expiresAt: expiresAtRaw.getTime() } : {}),\n ...(lastUsedRaw ? { lastUsedAt: lastUsedRaw.getTime() } : {}),\n ...(row['protected'] === true ? { protected: true } : {}),\n ...(row['request_hash'] != null ? { requestHash: String(row['request_hash']) } : {}),\n ...(fingerprint ? { schemaFingerprint: fingerprint } : {}),\n ...(row['intent'] != null ? { intent: String(row['intent']) } : {}),\n ...(row['shape'] != null ? { shape: row['shape'] } : {}),\n };\n\n if (row['kind'] === 'unsatisfiable') {\n return { kind: 'unsatisfiable', reason: String(row['reason'] ?? ''), ...meta };\n }\n // A mutation entry stores its def in the same jsonb slot a query's DSL\n // uses — one column, discriminated by `kind`.\n if (row['kind'] === 'mutation') {\n return {\n kind: 'mutation',\n mutation: row['dsl'] as MutationDefinition,\n ...(row['reach'] != null ? { reach: row['reach'] as string } : {}),\n ...meta,\n };\n }\n return {\n kind: 'ok',\n dsl: row['dsl'] as Query,\n ...(row['prism_ir'] != null ? { prismIr: row['prism_ir'] as CompiledIr } : {}),\n // A DECLARED REACH IS PART OF THE ENTRY, so it has to survive the round\n // trip. Dropping it here would not fail loudly — the read would simply be\n // served at the caller's own, wider reach, which is the exact thing the\n // field exists to prevent.\n ...(row['reach'] != null ? { reach: row['reach'] as string } : {}),\n // So must the refresh mode: dropped, a reactive read would quietly answer\n // once and never again.\n ...(isRefresh(row['refresh']) ? { refresh: row['refresh'] } : {}),\n ...meta,\n };\n};\n\nexport const createPostgresCache = (config: PostgresCacheConfig): PostgresCache => {\n const { pool, onError } = config;\n const schema = quoteIdent(config.schema ?? 'public', 'schema');\n const table = quoteIdent(config.table ?? 'vex_cache', 'table');\n const qualified = `${schema}.${table}`;\n\n // THE TABLE, AS A STRATA SEQUENCE. Migration 1 is the DDL every boot used to\n // run, verbatim — CREATE … IF NOT EXISTS plus the ADD COLUMN IF NOT EXISTS\n // that caught older tables up — so it converges ANY earlier shape of the\n // table to the current one: a fresh database and a deployment from months\n // ago both land here, once, and the ledger remembers. Changes from now on are\n // appended as plain migrations; this list is never edited.\n //\n // One sequence per table: a cache under a non-default name is its own owner.\n const isDefault = (config.schema ?? 'public') === 'public' && (config.table ?? 'vex_cache') === 'vex_cache';\n const slug = `${config.schema ?? 'public'}-${config.table ?? 'vex_cache'}`.toLowerCase().replace(/[^a-z0-9-]/g, '-');\n const sequence: Sequence = {\n id: isDefault ? 'nisc.vex.cache' : `nisc.vex.cache.${slug}`,\n migrations: [\n {\n description: 'The vex cache table, converged from any earlier shape',\n steps: [\n { kind: 'sql', sql: `CREATE SCHEMA IF NOT EXISTS ${schema}` },\n {\n kind: 'sql',\n sql: `CREATE TABLE IF NOT EXISTS ${qualified} (\n key text PRIMARY KEY,\n kind text NOT NULL DEFAULT 'ok',\n intent text,\n shape jsonb,\n dsl jsonb,\n prism_ir jsonb,\n reach text,\n reason text,\n created_at timestamptz NOT NULL DEFAULT now(),\n expires_at timestamptz,\n schema_fingerprint text,\n protected boolean NOT NULL DEFAULT false,\n last_used_at timestamptz,\n request_hash text,\n refresh text\n )`,\n },\n { kind: 'sql', sql: `ALTER TABLE ${qualified} ADD COLUMN IF NOT EXISTS protected boolean NOT NULL DEFAULT false` },\n { kind: 'sql', sql: `ALTER TABLE ${qualified} ADD COLUMN IF NOT EXISTS last_used_at timestamptz` },\n { kind: 'sql', sql: `ALTER TABLE ${qualified} ADD COLUMN IF NOT EXISTS request_hash text` },\n { kind: 'sql', sql: `ALTER TABLE ${qualified} ADD COLUMN IF NOT EXISTS reach text` },\n { kind: 'sql', sql: `ALTER TABLE ${qualified} ADD COLUMN IF NOT EXISTS refresh text` },\n ],\n },\n ],\n };\n\n // Applies the sequence through the ledger — once, recorded — not every boot.\n const init = async (): Promise<void> => {\n await migrate(pool, [sequence]);\n };\n\n const evict = (key: string, reason: string): void => {\n fireAndForget(pool.query(`DELETE FROM ${qualified} WHERE key = $1`, [key]), onError);\n const err = new Error(`[vex:cache:postgres] evicted invalid row for key \"${key}\": ${reason}`);\n if (onError) onError(err);\n else console.error(err);\n };\n\n const get = async (key: string): Promise<CacheEntry | undefined> => {\n const res = await pool.query(\n `SELECT ${SELECT_COLS} FROM ${qualified}\n WHERE key = $1 AND (expires_at IS NULL OR expires_at > now())`,\n [key],\n );\n const row = res.rows[0];\n if (row === undefined) return undefined;\n\n const entry = rowToEntry(row);\n const error = validateEntry(entry);\n if (error !== null) {\n evict(key, error);\n return undefined;\n }\n return entry;\n };\n\n const set = async (key: string, entry: CacheEntry): Promise<void> => {\n const error = validateEntry(entry);\n if (error !== null) {\n const wrapped = new Error(\n `[vex:cache:postgres] refusing to write invalid entry for key \"${key}\": ${error}`,\n );\n if (onError) {\n onError(wrapped);\n return;\n }\n throw wrapped;\n }\n\n const isOk = entry.kind === 'ok';\n const dsl = isOk ? JSON.stringify(entry.dsl) : entry.kind === 'mutation' ? JSON.stringify(entry.mutation) : null;\n const prismIr = isOk && entry.prismIr !== undefined ? JSON.stringify(entry.prismIr) : null;\n const reason = entry.kind === 'unsatisfiable' ? entry.reason : null;\n const intent = entry.intent ?? null;\n const shape = entry.shape !== undefined ? JSON.stringify(entry.shape) : null;\n const createdAt = new Date(entry.createdAt);\n const expiresAt = entry.expiresAt !== undefined ? new Date(entry.expiresAt) : null;\n const fingerprint = entry.schemaFingerprint ?? null;\n const isProtected = entry.protected === true;\n const lastUsedAt = entry.lastUsedAt !== undefined ? new Date(entry.lastUsedAt) : null;\n const requestHash = entry.requestHash ?? null;\n const reach = entry.kind === 'unsatisfiable' ? null : (entry.reach ?? null);\n const refresh = entry.kind === 'ok' ? (entry.refresh ?? null) : null;\n\n await pool.query(\n `INSERT INTO ${qualified} (key, kind, intent, shape, dsl, prism_ir, reach, reason, created_at, expires_at, schema_fingerprint, protected, last_used_at, request_hash, refresh)\n VALUES ($1, $2, $3, $4::jsonb, $5::jsonb, $6::jsonb, $7, $8, $9, $10, $11, $12, $13, $14, $15)\n ON CONFLICT (key) DO UPDATE SET\n kind = EXCLUDED.kind,\n intent = EXCLUDED.intent,\n shape = EXCLUDED.shape,\n dsl = EXCLUDED.dsl,\n prism_ir = EXCLUDED.prism_ir,\n reach = EXCLUDED.reach,\n reason = EXCLUDED.reason,\n created_at = EXCLUDED.created_at,\n expires_at = EXCLUDED.expires_at,\n schema_fingerprint = EXCLUDED.schema_fingerprint,\n protected = EXCLUDED.protected,\n last_used_at = EXCLUDED.last_used_at,\n request_hash = EXCLUDED.request_hash,\n refresh = EXCLUDED.refresh`,\n [key, entry.kind, intent, shape, dsl, prismIr, reach, reason, createdAt, expiresAt, fingerprint, isProtected, lastUsedAt, requestHash, refresh],\n );\n };\n\n const del = async (key: string): Promise<void> => {\n await pool.query(`DELETE FROM ${qualified} WHERE key = $1`, [key]);\n };\n\n const clear = async (): Promise<void> => {\n await pool.query(`DELETE FROM ${qualified}`);\n };\n\n const keys = async (): Promise<string[]> => {\n const res = await pool.query(\n `SELECT key FROM ${qualified} WHERE expires_at IS NULL OR expires_at > now()`,\n );\n return res.rows.map((r) => String(r['key']));\n };\n\n // Bulk read for warm-up. Validates and evicts invalid rows (same as get).\n const entries = async (): Promise<Array<{ key: string; entry: CacheEntry }>> => {\n const res = await pool.query(\n `SELECT ${SELECT_COLS} FROM ${qualified}\n WHERE expires_at IS NULL OR expires_at > now()`,\n );\n const out: Array<{ key: string; entry: CacheEntry }> = [];\n for (const row of res.rows) {\n const key = String(row['key']);\n const entry = rowToEntry(row);\n const error = validateEntry(entry);\n if (error !== null) {\n evict(key, error);\n continue;\n }\n out.push({ key, entry });\n }\n return out;\n };\n\n return { init, sequence, get, set, delete: del, clear, keys, entries };\n};\n","import type { CacheBackend, CacheEntry } from './cache.types.js';\nimport { validateEntry } from './validate.js';\nimport { fireAndForget } from './util.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Tiered cache (L1 in-memory + L2 durable)\n//\n// Read-through / write-through:\n// - get: L1 → on miss, L2 → validate → promote into L1.\n// - set: L1 synchronously + L2 fire-and-forget (off the hot path).\n// - init: warm-up, per the configured mode (see WarmupMode).\n//\n// The hot read never validates and never touches L2: every entry in L1\n// was validated on the way in (at promotion or at write). Validation\n// cost lands only at startup and the occasional L1 miss. An L2 entry\n// that fails validation (corrupt / schema-drifted) is evicted from L2,\n// not just skipped, so it can't keep failing.\n//\n// Single-instance only. Multiple processes sharing one L2 would each\n// keep their own L1; an entry written by process A is invisible to\n// process B's L1 until B restarts (a TTL-based L1 refresh would fix\n// this — deliberately deferred).\n// ═══════════════════════════════════════════════════════════════\n\nexport type WarmupMode =\n /** Load all of L2 into L1 on init (default). Start fully hot. */\n | 'full'\n /** Don't preload; L1 fills on demand via get→promote. Bounded memory. */\n | 'lazy'\n /** Preload only these fingerprints; lazy-fill the rest. */\n | { mode: 'partial'; fingerprints: string[] };\n\nexport type TieredCacheConfig = {\n /** Fast, volatile tier (e.g. createMemoryCache()). */\n l1: CacheBackend;\n /** Durable source of truth (e.g. createPostgresCache(...)). */\n l2: CacheBackend;\n /** Warm-up strategy run by init(). Default: 'full'. */\n warmup?: WarmupMode;\n /** Called on background failures (async L2 writes) and dropped invalid entries. */\n onError?: (err: unknown) => void;\n};\n\nexport type TieredCache = CacheBackend & {\n init: () => Promise<void>;\n};\n\nexport const createTieredCache = (config: TieredCacheConfig): TieredCache => {\n const { l1, l2, onError } = config;\n const warmup: WarmupMode = config.warmup ?? 'full';\n\n // Validate, then lift an entry into L1. Returns false if the L2 entry\n // is corrupt or schema-drifted — and evicts it from L2 so it can't\n // keep failing future reads.\n const promote = async (key: string, entry: CacheEntry): Promise<boolean> => {\n const error = validateEntry(entry);\n if (error !== null) {\n const wrapped = new Error(`[vex:cache:tiered] evicting invalid L2 entry for key \"${key}\": ${error}`);\n if (onError) onError(wrapped);\n else console.error(wrapped);\n fireAndForget(l2.delete(key), onError);\n return false;\n }\n await l1.set(key, entry);\n return true;\n };\n\n const init = async (): Promise<void> => {\n await l2.init?.();\n await l1.init?.();\n\n if (warmup === 'lazy') return;\n\n if (typeof warmup === 'object' && warmup.mode === 'partial') {\n for (const key of warmup.fingerprints) {\n const entry = await l2.get(key);\n if (entry !== undefined) await promote(key, entry);\n }\n return;\n }\n\n // 'full' — load everything. Prefer a bulk read (no N+1) when L2\n // supports it; otherwise fall back to key-by-key.\n if (l2.entries) {\n const all = await l2.entries();\n for (const { key, entry } of all) await promote(key, entry);\n return;\n }\n const keys = await l2.keys();\n for (const key of keys) {\n const entry = await l2.get(key);\n if (entry !== undefined) await promote(key, entry);\n }\n };\n\n const get = async (key: string): Promise<CacheEntry | undefined> => {\n const hit = await l1.get(key);\n if (hit !== undefined) return hit;\n\n const fromL2 = await l2.get(key);\n if (fromL2 === undefined) return undefined;\n\n const ok = await promote(key, fromL2);\n return ok ? fromL2 : undefined;\n };\n\n const set = async (key: string, entry: CacheEntry): Promise<void> => {\n await l1.set(key, entry);\n fireAndForget(l2.set(key, entry), onError);\n };\n\n const del = async (key: string): Promise<void> => {\n await l1.delete(key);\n fireAndForget(l2.delete(key), onError);\n };\n\n const clear = async (): Promise<void> => {\n await l1.clear();\n fireAndForget(l2.clear(), onError);\n };\n\n // L1 holds the full set after warm-up and receives every write, so it\n // is the authoritative key list for the running process.\n const keys = async (): Promise<string[]> => l1.keys();\n\n return { init, get, set, delete: del, clear, keys, ...(l2.sequence !== undefined ? { sequence: l2.sequence } : {}) };\n};\n","import { compile } from '@niscorp/prism';\nimport type { CacheBackend } from './cache.types.js';\nimport type { Query } from '../schemas/query.schema.js';\nimport type { MutationDefinition } from '../mutations/schema.js';\nimport { lintMutation } from '../mutations/signature.js';\nimport { canonicalText } from '../utils/canonical.js';\nimport type { Refresh } from './cache.types.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Seeding — authored entries → protected cache rows.\n//\n// The seeds ARE the API surface under the locked posture: every read and\n// write an app serves is a named, protected entry, replayed by fingerprint\n// (`{ fingerprint, context }` on the wire — definitions never travel).\n// This is the machinery every app used to hand-roll; the app authors the\n// ENTRIES (content), this compiles and stores them.\n//\n// Idempotent against a durable cache: a stored row that already matches\n// its authored definition is left untouched; anything else at that\n// fingerprint — edited, unprotected, regenerated, missing — converges to\n// the authored definition, protected. The code is the API surface; the\n// surviving rows are not. Protection keeps meaning what it means: a\n// drifted REQUEST still 409s — the seed path is the author it serves.\n// Mutations run the authoring lint every boot, edits included (\"if it\n// boots, it's coherent\" for writes).\n// ═══════════════════════════════════════════════════════════════\n\n// A read seed — vex's own cache row, minus what the seed derives: `mapping`\n// is uncompiled Prism (compiled to prism IR here; absent = identity, the\n// DSL already aliases columns to the shape's keys).\nexport type SeedEntry = {\n fingerprint: string;\n intent?: string;\n shape?: unknown;\n dsl: Query;\n mapping?: unknown;\n /** The reach this read requires whatever the caller holds — see `OkCacheEntry.reach`. */\n reach?: string;\n /** When this read's answer is refreshed — see `Refresh`. Absent means 'snapshot'. */\n refresh?: Refresh;\n};\n\n// A write seed — the same idea, `kind: 'mutation'`.\nexport type SeedMutation = {\n fingerprint: string;\n intent?: string;\n mutation: MutationDefinition;\n /** The reach this write requires whatever the caller holds — see `MutationCacheEntry.reach`. */\n reach?: string;\n};\n\n// Stored definitions round-trip through jsonb, which reorders object keys —\n// equality is canonical (utils/canonical.ts).\nconst same = (a: unknown, b: unknown): boolean =>\n a === undefined || b === undefined ? a === b : canonicalText(a) === canonicalText(b);\n\nexport const seedCache = async (cache: CacheBackend, entries: readonly (SeedEntry | SeedMutation)[]): Promise<void> => {\n for (const entry of entries) {\n const existing = await cache.get(entry.fingerprint);\n\n if ('mutation' in entry) {\n const issues = lintMutation(entry.mutation);\n if (issues.length > 0) {\n throw new Error(`Mutation seed \"${entry.fingerprint}\" fails the authoring lint:\\n ${issues.join('\\n ')}`);\n }\n const current =\n existing?.kind === 'mutation' &&\n existing.protected === true &&\n same(existing.mutation, entry.mutation) &&\n same(existing.reach, entry.reach) &&\n same(existing.intent, entry.intent);\n if (current) continue;\n await cache.set(entry.fingerprint, {\n kind: 'mutation',\n mutation: entry.mutation,\n ...(entry.reach !== undefined ? { reach: entry.reach } : {}),\n ...(entry.intent !== undefined ? { intent: entry.intent } : {}),\n protected: true,\n createdAt: Date.now(),\n });\n continue;\n }\n\n // Identity IR is seeded explicitly: a NULL mapping would make the reader\n // fall through to the LLM mapper on every replay.\n const prismIr = await compile(entry.mapping ?? { $ref: '$.result' });\n // The IR stamps its compile time, so it is compared by meta.fingerprint —\n // prism's hash of the compiled core — never by value.\n const current =\n existing?.kind === 'ok' &&\n existing.protected === true &&\n existing.prismIr?.meta.fingerprint === prismIr.meta.fingerprint &&\n same(existing.dsl, entry.dsl) &&\n same(existing.shape, entry.shape) &&\n same(existing.reach, entry.reach) &&\n same(existing.intent, entry.intent) &&\n (existing.refresh ?? 'snapshot') === (entry.refresh ?? 'snapshot');\n if (current) continue;\n await cache.set(entry.fingerprint, {\n kind: 'ok',\n ...(entry.refresh !== undefined ? { refresh: entry.refresh } : {}),\n dsl: entry.dsl,\n prismIr,\n ...(entry.reach !== undefined ? { reach: entry.reach } : {}),\n ...(entry.intent !== undefined ? { intent: entry.intent } : {}),\n ...(entry.shape !== undefined ? { shape: entry.shape } : {}),\n protected: true,\n createdAt: Date.now(),\n });\n }\n};\n"]}
|
|
1
|
+
{"version":3,"sources":["../src/scope/discover.ts","../src/scope/grants.ts","../src/engine/resolver.ts","../src/engine/analyzer.ts","../src/cache/memory.ts","../src/engine/live.ts","../src/engine/runtime.ts","../src/adapters/postgres/introspect.ts","../src/adapters/postgres/compile.ts","../src/adapters/postgres/statement-timeout.ts","../src/adapters/postgres/postgres.adapter.ts","../src/guide.ts","../src/cache/cache.types.ts","../src/cache/validate.ts","../src/cache/postgres.ts","../src/cache/tiered.ts","../src/cache/seed.ts"],"names":["follow","compile","executePrism","execute","rows","executionMs","result","rowCount","cut","said","exceedsDepth","depthRefusal","quoteIdent","keys","current"],"mappings":";;;;;;;;;;AAYO,IAAM,qBAAA,GAAwB,CAAC,IAAA,KAAqC;AACzE,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAC5B,EAAA,OAAO,KAAA,CAAM,MAAA,KAAW,CAAA,GAAI,KAAA,CAAM,CAAC,CAAA,GAAI,MAAA;AACzC,CAAA;AAOA,IAAM,uBAAA,GAA0B,CAAC,GAAA,EAAmB,GAAA,KAA2B;AAC7E,EAAA,IAAI,gBAAA,CAAiB,GAAG,CAAA,EAAG;AACzB,IAAA,MAAM,MAAA,GAAS,sBAAsB,GAAG,CAAA;AACxC,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AAAA,EAC1C;AAEF,CAAA;AAMA,IAAM,iBAAA,GAAoB,CAAC,MAAA,EAAgB,GAAA,KAA2B;AAGpE,EAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,IAAA,KAAA,MAAW,UAAU,MAAA,CAAO,MAAA,CAAO,IAAA,EAAM,GAAA,CAAI,IAAI,MAAM,CAAA;AACvD,IAAA,IAAI,MAAA,CAAO,OAAO,MAAA,KAAW,MAAA,oBAA6B,MAAA,CAAO,MAAA,CAAO,QAAQ,GAAG,CAAA;AACnF,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,IAAA,IAAQ,MAAA,IAAU,KAAA,IAAS,MAAA,IAAU,IAAA,IAAQ,MAAA,IAAU,KAAA,IAAS,MAAA,IAAU,IAAA,IAAQ,MAAA,IAAU,KAAA,IAAS,MAAA,EAAQ;AAC/G,IAAA,MAAM,IAAA,GAAQ,QAAQ,MAAA,GAAU,MAAA,CAAO,KAClC,KAAA,IAAS,MAAA,GAAU,OAAO,GAAA,GAC1B,IAAA,IAAQ,SAAU,MAAA,CAAO,EAAA,GACzB,SAAS,MAAA,GAAU,MAAA,CAAO,MAC1B,IAAA,IAAQ,MAAA,GAAU,MAAA,CAAO,EAAA,GAC1B,MAAA,CAAO,GAAA;AACX,IAAA,uBAAA,CAAwB,IAAA,CAAK,CAAC,CAAA,EAAG,GAAG,CAAA;AACpC,IAAA,uBAAA,CAAwB,IAAA,CAAK,CAAC,CAAA,EAAG,GAAG,CAAA;AACpC,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,IAAA,IAAQ,MAAA,IAAU,OAAA,IAAW,MAAA,EAAQ;AACvC,IAAA,MAAM,KAAA,GAAQ,IAAA,IAAQ,MAAA,GAAS,MAAA,CAAO,KAAK,MAAA,CAAO,KAAA;AAClD,IAAA,MAAM,MAAA,GAAS,qBAAA,CAAsB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AACxC,IAAA,MAAM,MAAA,GAAS,MAAM,CAAC,CAAA;AACtB,IAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,EAAG;AACzB,MAAA,KAAA,MAAW,KAAK,MAAA,EAAQ;AACtB,QAAA,uBAAA,CAAwB,GAAG,GAAG,CAAA;AAAA,MAChC;AAAA,IACF;AAEA,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,MAAA,IAAU,MAAA,IAAU,OAAA,IAAW,MAAA,EAAQ;AACzC,IAAA,MAAM,KAAA,GAAQ,MAAA,IAAU,MAAA,GAAS,MAAA,CAAO,OAAO,MAAA,CAAO,KAAA;AACtD,IAAA,MAAM,MAAA,GAAS,qBAAA,CAAsB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AACxC,IAAA,uBAAA,CAAwB,KAAA,CAAM,CAAC,CAAA,EAAG,GAAG,CAAA;AACrC,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,IAAA,MAAM,MAAA,GAAS,qBAAA,CAAsB,MAAA,CAAO,MAAM,CAAA;AAClD,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AACxC,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,eAAe,MAAA,EAAQ;AACzB,IAAA,MAAM,MAAA,GAAS,qBAAA,CAAsB,MAAA,CAAO,SAAS,CAAA;AACrD,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AACxC,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,KAAA,MAAW,GAAA,IAAO,OAAO,GAAA,EAAK;AAC5B,MAAA,iBAAA,CAAkB,KAAK,GAAG,CAAA;AAAA,IAC5B;AACA,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,QAAQ,MAAA,EAAQ;AAClB,IAAA,KAAA,MAAW,GAAA,IAAO,OAAO,EAAA,EAAI;AAC3B,MAAA,iBAAA,CAAkB,KAAK,GAAG,CAAA;AAAA,IAC5B;AACA,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,iBAAA,CAAkB,MAAA,CAAO,KAAK,GAAG,CAAA;AACjC,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,cAAc,MAAA,EAAQ;AACxB,IAAA,MAAM,MAAA,GAAS,qBAAA,CAAsB,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA;AAC1D,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AACxC,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,WAAW,MAAA,EAAQ;AACrB,IAAA,MAAM,MAAA,GAAS,qBAAA,CAAsB,MAAA,CAAO,KAAA,CAAM,KAAK,CAAA;AACvD,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AACxC,IAAA;AAAA,EACF;AAQA,EAAA,IAAI,UAAA,IAAc,MAAA,EAAQ,cAAA,CAAe,iBAAiB,CAAA;AAC5D,CAAA;AAMA,IAAM,kBAAA,GAAqB,CAAC,IAAA,EAAyB,GAAA,KAA2B;AAC9E,EAAA,IAAI,SAAS,IAAA,IAAQ,UAAA,IAAc,QAAQ,UAAA,IAAc,IAAA,IAAQ,YAAY,IAAA,EAAM;AACjF,IAAA,MAAM,IAAA,GAAQ,KAAA,IAAS,IAAA,GAAQ,IAAA,CAAK,GAAA,GAC/B,UAAA,IAAc,IAAA,GAAQ,IAAA,CAAK,QAAA,GAC3B,UAAA,IAAc,IAAA,GAAQ,IAAA,CAAK,WAC5B,IAAA,CAAK,MAAA;AACT,IAAA,uBAAA,CAAwB,IAAA,CAAK,CAAC,CAAA,EAAG,GAAG,CAAA;AACpC,IAAA,uBAAA,CAAwB,IAAA,CAAK,CAAC,CAAA,EAAG,GAAG,CAAA;AACpC,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,YAAY,IAAA,EAAM;AACpB,IAAA,KAAA,MAAW,CAAA,IAAK,KAAK,MAAA,EAAQ;AAC3B,MAAA,uBAAA,CAAwB,GAAG,GAAG,CAAA;AAAA,IAChC;AACA,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,cAAc,IAAA,EAAM;AACtB,IAAA,KAAA,MAAW,CAAA,IAAK,KAAK,QAAA,EAAU;AAC7B,MAAA,uBAAA,CAAwB,GAAG,GAAG,CAAA;AAAA,IAChC;AACA,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,UAAU,IAAA,EAAM;AAClB,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,IAAA,CAAK,IAAA,EAAM;AACjC,MAAA,iBAAA,CAAkB,IAAA,CAAK,WAAW,GAAG,CAAA;AACrC,MAAA,uBAAA,CAAwB,IAAA,CAAK,MAAM,GAAG,CAAA;AAAA,IACxC;AACA,IAAA,uBAAA,CAAwB,IAAA,CAAK,IAAA,CAAK,IAAA,EAAM,GAAG,CAAA;AAC3C,IAAA;AAAA,EACF;AACF,CAAA;AAMA,IAAM,oBAAA,GAAuB,CAAC,IAAA,EAA2B,GAAA,KAA2B;AAClF,EAAA,MAAM,GAAA,GAAO,WAAW,IAAA,GAAQ,IAAA,CAAK,QAChC,eAAA,IAAmB,IAAA,GAAQ,KAAK,aAAA,GAChC,KAAA,IAAS,OAAQ,IAAA,CAAK,GAAA,GACtB,SAAS,IAAA,GAAQ,IAAA,CAAK,MACtB,KAAA,IAAS,IAAA,GAAQ,IAAA,CAAK,GAAA,GACvB,IAAA,CAAK,GAAA;AAET,EAAA,IAAI,OAAO,QAAQ,QAAA,EAAU;AAC3B,IAAA,kBAAA,CAAmB,KAAK,GAAG,CAAA;AAC3B,IAAA;AAAA,EACF;AACA,EAAA,MAAM,MAAA,GAAS,sBAAsB,GAAG,CAAA;AACxC,EAAA,IAAI,MAAA,KAAW,MAAA,EAAW,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AAC1C,CAAA;AAMA,IAAM,gBAAA,GAAmB,CAAC,GAAA,EAAY,GAAA,KAA2B;AAM/D,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAG9B,EAAA,KAAA,MAAW,MAAA,IAAU,IAAI,IAAA,EAAM;AAC7B,IAAA,IAAI,OAAO,WAAW,QAAA,EAAU;AAC9B,MAAA,GAAA,CAAI,IAAI,MAAM,CAAA;AAAA,IAChB,CAAA,MAAO;AACL,MAAA,OAAA,CAAQ,GAAA,CAAI,OAAO,EAAE,CAAA;AACrB,MAAA,gBAAA,CAAiB,MAAA,CAAO,OAAO,GAAG,CAAA;AAAA,IACpC;AAAA,EACF;AAGA,EAAA,KAAA,MAAW,GAAA,IAAO,GAAA,CAAI,MAAA,IAAU,EAAC,EAAG;AAClC,IAAA,MAAM,SAAS,qBAAA,CAAsB,OAAO,QAAQ,QAAA,GAAW,GAAA,GAAM,IAAI,KAAK,CAAA;AAC9E,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AAAA,EAC5C;AAGA,EAAA,IAAI,GAAA,CAAI,WAAW,MAAA,EAAW;AAC5B,IAAA,iBAAA,CAAkB,GAAA,CAAI,QAAQ,KAAK,CAAA;AAAA,EACrC;AAGA,EAAA,IAAI,GAAA,CAAI,YAAY,MAAA,EAAW;AAC7B,IAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,IAAA,CAAK,GAAA,CAAI,OAAO,CAAA,EAAG;AAC1C,MAAA,MAAM,IAAA,GAAO,GAAA,CAAI,OAAA,CAAQ,GAAG,CAAA;AAC5B,MAAA,IAAI,SAAS,MAAA,EAAW;AACtB,QAAA,kBAAA,CAAmB,MAAM,KAAK,CAAA;AAAA,MAChC;AAAA,IACF;AAAA,EACF;AAGA,EAAA,IAAI,GAAA,CAAI,cAAc,MAAA,EAAW;AAC/B,IAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,IAAA,CAAK,GAAA,CAAI,SAAS,CAAA,EAAG;AAC5C,MAAA,MAAM,IAAA,GAAO,GAAA,CAAI,SAAA,CAAU,GAAG,CAAA;AAC9B,MAAA,IAAI,SAAS,MAAA,EAAW;AACtB,QAAA,oBAAA,CAAqB,MAAM,KAAK,CAAA;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AAGA,EAAA,IAAI,GAAA,CAAI,YAAY,MAAA,EAAW;AAC7B,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAI,OAAA,EAAS;AAC9B,MAAA,MAAM,MAAA,GAAS,sBAAsB,IAAI,CAAA;AACzC,MAAA,IAAI,MAAA,KAAW,MAAA,EAAW,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AAAA,IAC5C;AAAA,EACF;AAGA,EAAA,IAAI,GAAA,CAAI,SAAS,MAAA,EAAW;AAC1B,IAAA,KAAA,MAAW,KAAA,IAAS,IAAI,IAAA,EAAM;AAC5B,MAAA,MAAM,MAAA,GAAS,qBAAA,CAAsB,KAAA,CAAM,KAAK,CAAA;AAChD,MAAA,IAAI,MAAA,KAAW,MAAA,EAAW,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AAAA,IAC5C;AAAA,EACF;AAEA,EAAA,KAAA,MAAW,UAAU,KAAA,EAAO;AAC1B,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAA,EAAG,GAAA,CAAI,IAAI,MAAM,CAAA;AAAA,EAC1C;AACF,CAAA;AAEO,IAAM,gBAAA,GAAmB,CAAC,GAAA,KAA4B;AAC3D,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAY;AACjC,EAAA,gBAAA,CAAiB,KAAK,QAAQ,CAAA;AAC9B,EAAA,OAAO,QAAA;AACT;;;ACvPO,IAAM,WAAA,GAAc,CAAC,MAAA,EAAQ,cAAA,EAAgB,gBAAgB,cAAc;AAK3E,IAAM,cAAc,CAAC,MAAA,KAC1B,MAAA,CAAO,OAAA,CAAQ,CAAC,CAAA,KAAM,WAAA,CAAY,GAAA,CAAI,CAAC,MAAM,CAAA,EAAG,CAAC,CAAA,CAAA,EAAI,CAAC,EAAE,CAAC;AAgC3D,IAAM,YAAY,CAAC,MAAA,EAAQ,OAAA,EAAS,QAAA,EAAU,UAAU,QAAQ,CAAA;AAEhE,IAAM,SAAA,GAAY,CAAC,KAAA,KACjB,SAAA,CAAU,KAAK,CAAC,CAAA,KAAM,KAAK,KAAK,CAAA;AAWlC,IAAM,WAAA,GAAc,CAAC,SAAA,EAA2B,KAAA,EAAe,OAAA,KAAwD;AACrH,EAAA,MAAM,KAAA,GAAQ,UAAU,KAAK,CAAA;AAC7B,EAAA,IAAI,KAAA,KAAU,MAAA,EAAW,OAAO,EAAC;AACjC,EAAA,IAAI,SAAA,CAAU,KAAK,CAAA,EAAG,OAAO,KAAA;AAE7B,EAAA,OAAA,CAAQ,YAAY,MAAA,GAAY,MAAA,GAAY,MAAM,OAAO,CAAA,KAAM,MAAM,SAAS,CAAA;AAChF,CAAA;AAEA,IAAM,WAAA,GAAc,CAAC,KAAA,KAAqC,KAAA,CAAM,OAAO,CAAC,CAAA,KAAuB,WAAW,CAAC,CAAA;AAQ3G,IAAM,KAAA,GAA6B,IAAI,GAAA,CAAI,WAAW,CAAA;AAgBtD,IAAM,UAAA,GAAa,CAAC,KAAA,KAAA,CACjB,SAAA,CAAU,KAAK,CAAA,GAAI,CAAC,KAAK,CAAA,GAAI,MAAA,CAAO,MAAA,CAAO,KAAK,CAAA,EAAG,OAAA;AAAA,EAAQ,CAAC,UAC3D,SAAA,CAAU,OAAA;AAAA,IAAQ,CAAC,KAAA,KAAA,CAChB,KAAA,CAAM,KAAK,CAAA,IAAK,EAAC,EAAG,GAAA;AAAA,MAAI,CAAC,IAAA,KACxB,KAAA,IAAS,IAAA,GAAO,EAAE,KAAA,EAAO,IAAA,CAAK,GAAA,EAAK,GAAA,EAAK,IAAA,CAAK,EAAA,EAAG,GAAI,UAAA,CAAW,IAAI,CAAA,GAAI,EAAE,KAAA,EAAO,IAAA,CAAK,KAAA,EAAO,GAAA,EAAK,IAAA,CAAK,EAAA,EAAG,GAAI,EAAE,KAAA,EAAO,IAAA,CAAK,KAAA,EAAO,GAAA,EAAK,KAAK,EAAA;AAAG;AACjJ;AAEJ,CAAA;AAMK,IAAM,aAAA,GAAgB,CAAC,SAAA,EAA2B,MAAA,EAA2B,KAAA,KAAuC;AACzH,EAAA,MAAM,IAAA,uBAAW,GAAA,EAA0B;AAC3C,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,IAAA,MAAM,KAAA,GAAQ,UAAU,KAAK,CAAA;AAC7B,IAAA,IAAI,UAAU,MAAA,EAAW;AACzB,IAAA,KAAA,MAAW,EAAE,KAAA,EAAO,GAAA,EAAI,IAAK,UAAA,CAAW,KAAK,CAAA,EAAG;AAC9C,MAAA,IAAI,MAAM,GAAG,CAAA,KAAM,UAAa,KAAA,CAAM,GAAG,MAAM,IAAA,EAAM;AACrD,MAAA,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,KAAK,CAAA,CAAA,EAAI,GAAG,CAAA,CAAA,EAAI,EAAE,MAAA,EAAQ,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA;AAAA,IACpE;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,IAAA,CAAK,MAAA,EAAQ,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,EAAG,CAAA,CAAE,MAAM,CAAA,CAAA,EAAI,CAAA,CAAE,KAAK,CAAA,CAAA,EAAI,CAAA,CAAE,GAAG,CAAA,CAAA,CAAG,aAAA,CAAc,GAAG,CAAA,CAAE,MAAM,CAAA,CAAA,EAAI,CAAA,CAAE,KAAK,CAAA,CAAA,EAAI,CAAA,CAAE,GAAG,EAAE,CAAC,CAAA;AAC7H;AAGO,IAAM,eAAA,GAAkB,CAAC,SAAA,KAC9B,MAAA,CAAO,OAAA,CAAQ,SAAS,CAAA,CAAE,OAAA,CAAQ,CAAC,CAAC,KAAA,EAAO,KAAK,CAAA,KAAM,WAAW,KAAK,CAAA,CAAE,GAAA,CAAI,CAAC,EAAE,KAAA,EAAM,MAAO,EAAE,MAAA,EAAQ,KAAA,EAAO,KAAA,EAAM,CAAE,CAAC,CAAA;AAGjH,IAAM,aAAA,GAAgB,CAAC,SAAA,KAAmD;AAC/E,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,EAAA,KAAA,MAAW,KAAA,IAAS,MAAA,CAAO,MAAA,CAAO,SAAS,CAAA,EAAG;AAC5C,IAAA,IAAI,SAAA,CAAU,KAAK,CAAA,EAAG;AACtB,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,MAAO,IAAA,KAAS,SAAA,EAAW,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA;AAAA,EAC/E;AACA,EAAA,OAAO,KAAA;AACT;AAQO,IAAM,oBAAoB,CAC/B,MAAA,EACA,SAAA,GAA4B,IAC5B,OAAA,KACgB;AAChB,EAAA,IAAI,OAAA,KAAY,MAAA,IAAa,CAAC,aAAA,CAAc,SAAS,CAAA,CAAE,GAAA,CAAI,OAAO,CAAA,SAAU,EAAE,OAAA,EAAS,MAAA,EAAQ,QAAA,EAAU,EAAC,EAAE;AAC5G,EAAA,MAAM,WAAuH,EAAC;AAC9H,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,IAAA,MAAM,GAAA,GAAM,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA;AAC7B,IAAA,IAAI,MAAM,CAAA,EAAG;AACb,IAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,KAAA,CAAM,CAAA,EAAG,GAAG,CAAA;AAChC,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,KAAA,CAAM,GAAA,GAAM,CAAC,CAAA;AAChC,IAAA,IAAI,CAAC,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA,EAAG;AACtB,IAAA,MAAM,CAAA,GAAI,WAAA,CAAY,SAAA,EAAW,KAAA,EAAO,OAAO,CAAA;AAC/C,IAAA,IAAI,MAAM,MAAA,EAAW;AACrB,IAAA,MAAM,IAAA,GAAQ,QAAA,CAAS,KAAK,CAAA,KAAM,EAAC;AACnC,IAAA,IAAI,SAAS,MAAA,EAAQ,IAAA,CAAK,IAAA,GAAO,CAAA,EAAG,QAAQ,EAAC;AAAA,SAAA,IACpC,IAAA,KAAS,cAAA,EAAgB,IAAA,CAAK,MAAA,GAAS,CAAC,GAAI,CAAA,EAAG,KAAA,IAAS,EAAC,EAAI,GAAI,CAAA,EAAG,MAAA,IAAU,EAAG,CAAA;AAAA,SAAA,IACjF,IAAA,KAAS,cAAA,EAAgB,IAAA,CAAK,MAAA,GAAS,CAAC,GAAI,CAAA,EAAG,KAAA,IAAS,EAAC,EAAI,GAAI,CAAA,EAAG,MAAA,IAAU,EAAG,CAAA;AAAA,SAAA,IACjF,SAAS,cAAA,EAAgB,IAAA,CAAK,MAAA,GAAS,CAAC,GAAG,WAAA,CAAY,CAAA,EAAG,KAAA,IAAS,EAAE,CAAA,EAAG,GAAI,CAAA,EAAG,MAAA,IAAU,EAAG,CAAA;AAAA,EACvG;AACA,EAAA,OAAO,EAAE,OAAA,EAAS,MAAA,EAAQ,QAAA,EAAS;AACrC;AAwBA,IAAM,UAAA,GAAa,CAAC,KAAA,KAAA,CACjB,KAAA,IAAS,EAAC,EAAG,MAAA,CAAO,CAAC,CAAA,KAAM,OAAA,IAAW,CAAC,CAAA,CAAE,MAAA;AAGrC,IAAM,kBAAA,GAAqB,CAAC,QAAA,KAAkD;AACnF,EAAA,MAAM,WAAuH,EAAC;AAC9H,EAAA,KAAA,MAAW,UAAU,QAAA,EAAU;AAC7B,IAAA,KAAA,MAAW,CAAC,OAAO,IAAI,CAAA,IAAK,OAAO,OAAA,CAAQ,MAAA,CAAO,QAAQ,CAAA,EAAG;AAC3D,MAAA,IAAI,IAAA,KAAS,MAAA,IAAa,QAAA,IAAY,IAAA,IAAQ,UAAU,IAAA,EAAM;AAC9D,MAAA,MAAM,IAAA,GAAQ,QAAA,CAAS,KAAK,CAAA,KAAM,EAAC;AACnC,MAAA,KAAA,MAAW,SAAS,CAAC,MAAA,EAAQ,QAAA,EAAU,QAAA,EAAU,QAAQ,CAAA,EAAY;AACnE,QAAA,MAAM,QAAA,GAAW,KAAK,KAAK,CAAA;AAC3B,QAAA,IAAI,aAAa,MAAA,EAAW;AAC5B,QAAA,MAAM,IAAA,GAAO,KAAK,KAAK,CAAA;AAGvB,QAAA,IAAI,SAAS,MAAA,IAAa,UAAA,CAAW,QAAQ,CAAA,GAAI,UAAA,CAAW,IAAI,CAAA,EAAG;AACjE,UAAC,IAAA,CAAiC,KAAK,CAAA,GAAI,QAAA;AAAA,QAC7C;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,EAAE,OAAA,EAAS,MAAA,EAAQ,QAAA,EAAS;AACrC;;;ACpMA,IAAM,WAAA,GAAc,CAAC,CAAA,EAAW,CAAA,KAAsB;AACpD,EAAA,MAAM,KAAK,CAAA,CAAE,MAAA;AACb,EAAA,MAAM,KAAK,CAAA,CAAE,MAAA;AACb,EAAA,IAAI,EAAA,KAAO,GAAG,OAAO,EAAA;AACrB,EAAA,IAAI,EAAA,KAAO,GAAG,OAAO,EAAA;AAGrB,EAAA,IAAI,IAAA,GAAO,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,EAAA,GAAK,CAAA,EAAE,EAAG,CAAC,CAAA,EAAG,CAAA,KAAM,CAAC,CAAA;AACrD,EAAA,IAAI,IAAA,GAAO,IAAI,KAAA,CAAc,EAAA,GAAK,CAAC,CAAA;AAEnC,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,IAAK,EAAA,EAAI,CAAA,EAAA,EAAK;AAC5B,IAAA,IAAA,CAAK,CAAC,CAAA,GAAI,CAAA;AACV,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,IAAK,EAAA,EAAI,CAAA,EAAA,EAAK;AAC5B,MAAA,MAAM,IAAA,GAAO,EAAE,CAAA,GAAI,CAAC,MAAM,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA,GAAI,CAAA;AACzC,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,CAAC,CAAA,IAAK,CAAA;AACzB,MAAA,MAAM,MAAA,GAAS,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,IAAK,CAAA;AAC9B,MAAA,MAAM,MAAA,GAAS,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,IAAK,CAAA;AAC9B,MAAA,IAAA,CAAK,CAAC,IAAI,IAAA,CAAK,GAAA,CAAI,QAAQ,CAAA,EAAG,MAAA,GAAS,CAAA,EAAG,MAAA,GAAS,IAAI,CAAA;AAAA,IACzD;AACA,IAAA,CAAC,IAAA,EAAM,IAAI,CAAA,GAAI,CAAC,MAAM,IAAI,CAAA;AAAA,EAC5B;AAEA,EAAA,OAAO,IAAA,CAAK,EAAE,CAAA,IAAK,CAAA;AACrB,CAAA;AAEA,IAAM,WAAA,GAAc,CAAC,MAAA,EAAgB,UAAA,KAA6C;AAChF,EAAA,IAAI,IAAA;AACJ,EAAA,IAAI,QAAA,GAAW,QAAA;AACf,EAAA,KAAA,MAAW,KAAK,UAAA,EAAY;AAC1B,IAAA,MAAM,OAAO,WAAA,CAAY,MAAA,CAAO,aAAY,EAAG,CAAA,CAAE,aAAa,CAAA;AAC9D,IAAA,IAAI,OAAO,QAAA,EAAU;AACnB,MAAA,QAAA,GAAW,IAAA;AACX,MAAA,IAAA,GAAO,CAAA;AAAA,IACT;AAAA,EACF;AAEA,EAAA,IAAI,QAAA,IAAY,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,KAAK,MAAA,CAAO,MAAA,GAAS,CAAC,CAAC,CAAA,EAAG;AACzD,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,OAAO,MAAA;AACT,CAAA;AAQA,IAAM,aAAA,GAAgB,CAAC,IAAA,EAAc,OAAA,KAAkC;AACrE,EAAA,MAAM,MAAA,GAAS,IAAA,CAAK,MAAA,CAAO,CAAC,EAAE,WAAA,EAAY;AAC1C,EAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAA,IAAK,CAAA;AACvC,EAAA,MAAM,OAAO,OAAA,GAAU,CAAA;AACvB,EAAA,OAAA,CAAQ,GAAA,CAAI,QAAQ,IAAI,CAAA;AACxB,EAAA,OAAO,CAAA,EAAG,MAAM,CAAA,EAAG,IAAI,CAAA,CAAA;AACzB,CAAA;AAMA,IAAM,UAAA,GAAa,CAAC,IAAA,EAAc,MAAA,KAAyC;AACzE,EAAA,MAAM,KAAA,GAAQ,OAAO,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,IAAI,CAAA;AACzD,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,KAAA;AAEhC,EAAA,MAAM,WAAW,MAAA,CAAO,QAAA,CAAS,IAAI,CAAC,CAAA,KAAM,EAAE,IAAI,CAAA;AAClD,EAAA,MAAM,UAAA,GAAa,WAAA,CAAY,IAAA,EAAM,QAAQ,CAAA;AAC7C,EAAA,MAAM,IAAA,GAAO,UAAA,KAAe,MAAA,GAAY,CAAA,eAAA,EAAkB,UAAU,CAAA,EAAA,CAAA,GAAO,EAAA;AAC3E,EAAA,MAAM,IAAI,QAAA;AAAA,IACR,aAAA;AAAA,IACA,CAAA,QAAA,EAAW,IAAI,CAAA,sBAAA,EAAyB,IAAI,CAAA,CAAA;AAAA,IAC5C,EAAE,UAAA,EAAY,OAAA,EAAS,QAAA;AAAS,GAClC;AACF,CAAA;AAEA,IAAM,SAAA,GAAY,CAAC,SAAA,EAAmB,MAAA,KAAsC;AAC1E,EAAA,MAAM,KAAA,GAAQ,OAAO,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,SAAS,CAAA;AAC5D,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,KAAA;AAEhC,EAAA,MAAM,YAAY,MAAA,CAAO,MAAA,CAAO,IAAI,CAAC,CAAA,KAAM,EAAE,IAAI,CAAA;AACjD,EAAA,MAAM,UAAA,GAAa,WAAA,CAAY,SAAA,EAAW,SAAS,CAAA;AACnD,EAAA,MAAM,IAAA,GAAO,UAAA,KAAe,MAAA,GAAY,CAAA,eAAA,EAAkB,UAAU,CAAA,EAAA,CAAA,GAAO,EAAA;AAC3E,EAAA,MAAM,IAAI,QAAA;AAAA,IACR,aAAA;AAAA,IACA,CAAA,OAAA,EAAU,SAAS,CAAA,uBAAA,EAA0B,MAAA,CAAO,IAAI,CAAA,EAAA,EAAK,IAAI,CAAA,mBAAA,EAAsB,SAAA,CAAU,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA;AAAA,IAC3G,EAAE,UAAA,EAAY,OAAA,EAAS,SAAA;AAAU,GACnC;AACF,CAAA;AASA,IAAM,SAAA,GAAY,CAAC,IAAA,KAAoD;AACrE,EAAA,IAAI,CAAC,gBAAA,CAAiB,IAAI,CAAA,EAAG;AAC3B,IAAA,MAAM,IAAI,QAAA;AAAA,MACR,aAAA;AAAA,MACA,uBAAuB,IAAI,CAAA,gCAAA;AAAA,KAC7B;AAAA,EACF;AACA,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA;AACjC,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,IAAA,CAAK,SAAA,CAAU,CAAA,EAAG,QAAQ,CAAA;AAAA,IAClC,KAAA,EAAO,IAAA,CAAK,SAAA,CAAU,QAAA,GAAW,CAAC;AAAA,GACpC;AACF,CAAA;AAMA,IAAM,UAAA,GAAa,CAAC,IAAA,EAAc,IAAA,KAAuB;AACvD,EAAA,IAAI,CAAC,YAAA,CAAa,IAAI,CAAA,EAAG;AACvB,IAAA,MAAM,IAAI,QAAA,CAAS,aAAA,EAAe,WAAW,IAAI,CAAA,EAAA,EAAK,IAAI,CAAA,8DAAA,CAAgE,CAAA;AAAA,EAC5H;AACF,CAAA;AAMA,IAAM,eAAA,GAAkB,CACtB,UAAA,EACA,QAAA,EACA,WACA,OAAA,KAC6B;AAM7B,EAAA,KAAA,MAAW,GAAA,IAAO,WAAW,SAAA,EAAW;AACtC,IAAA,IAAI,GAAA,CAAI,MAAA,KAAW,QAAA,CAAS,IAAA,EAAM;AAChC,MAAA,MAAM,UAAA,GAAa,IAAI,WAAA,CAAY,IAAA;AAAA,QACjC,CAAC,MAAA,KAAW,UAAA,CAAW,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAM,CAAA,EAAG,QAAA,KAAa;AAAA,OAC7E;AACA,MAAA,OAAO;AAAA,QACL,SAAA;AAAA,QACA,aAAa,GAAA,CAAI,WAAA;AAAA,QACjB,OAAA;AAAA,QACA,WAAW,GAAA,CAAI,aAAA;AAAA,QACf,SAAS,QAAA,CAAS,KAAA;AAAA,QAClB,IAAA,EAAM,aAAa,MAAA,GAAS;AAAA,OAC9B;AAAA,IACF;AAAA,EACF;AAIA,EAAA,KAAA,MAAW,GAAA,IAAO,SAAS,SAAA,EAAW;AACpC,IAAA,IAAI,GAAA,CAAI,MAAA,KAAW,UAAA,CAAW,IAAA,EAAM;AAClC,MAAA,OAAO;AAAA,QACL,SAAA;AAAA,QACA,aAAa,GAAA,CAAI,aAAA;AAAA,QACjB,OAAA;AAAA,QACA,WAAW,GAAA,CAAI,WAAA;AAAA,QACf,SAAS,QAAA,CAAS,KAAA;AAAA,QAClB,IAAA,EAAM;AAAA,OACR;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT,CAAA;AASA,IAAM,gBAAA,GAAmB,CACvB,IAAA,EACA,YAAA,EACA,MAAA,KACoD;AACpD,EAAA,MAAM,MAAA,GAAS,UAAU,IAAI,CAAA;AAC7B,EAAA,MAAM,MAAA,GAAS,YAAA,CAAa,GAAA,CAAI,MAAA,CAAO,MAAM,CAAA;AAE7C,EAAA,IAAI,WAAW,MAAA,EAAW;AAExB,IAAA,MAAM,YAAA,GAAe,OAAO,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAA,CAAO,MAAM,CAAA;AACzE,IAAA,IAAI,YAAA,EAAc;AAChB,MAAA,MAAM,IAAI,QAAA;AAAA,QACR,aAAA;AAAA,QACA,CAAA,QAAA,EAAW,MAAA,CAAO,MAAM,CAAA,+BAAA,EAAkC,IAAI,CAAA,0BAAA;AAAA,OAChE;AAAA,IACF;AACA,IAAA,MAAM,WAAW,MAAA,CAAO,QAAA,CAAS,IAAI,CAAC,CAAA,KAAM,EAAE,IAAI,CAAA;AAClD,IAAA,MAAM,UAAA,GAAa,WAAA,CAAY,MAAA,CAAO,MAAA,EAAQ,QAAQ,CAAA;AACtD,IAAA,MAAM,IAAA,GAAO,UAAA,KAAe,MAAA,GAAY,CAAA,eAAA,EAAkB,UAAU,CAAA,EAAA,CAAA,GAAO,EAAA;AAC3E,IAAA,MAAM,IAAI,QAAA;AAAA,MACR,aAAA;AAAA,MACA,CAAA,QAAA,EAAW,MAAA,CAAO,MAAM,CAAA,sBAAA,EAAyB,IAAI,CAAA,CAAA;AAAA,MACrD,EAAE,UAAA,EAAY,OAAA,EAAS,QAAA;AAAS,KAClC;AAAA,EACF;AAEA,EAAA,MAAM,WAAA,GAAc,SAAA,CAAU,MAAA,CAAO,KAAA,EAAO,OAAO,MAAM,CAAA;AAEzD,EAAA,OAAO;AAAA,IACL,QAAA,EAAU;AAAA,MACR,IAAA;AAAA,MACA,OAAO,MAAA,CAAO,KAAA;AAAA,MACd,QAAQ,WAAA,CAAY,IAAA;AAAA,MACpB,YAAY,MAAA,CAAO,KAAA;AAAA,MACnB,MAAA,EAAQ;AAAA,KACV;AAAA,IACA,YAAY,MAAA,CAAO;AAAA,GACrB;AACF,CAAA;AAKA,IAAM,WAAA,GAAc,gBAAA;AAEpB,IAAM,qBAAqB,CACzB,MAAA,EACA,cACA,MAAA,EACA,aAAA,EAMA,WACA,YAAA,KACS;AACT,EAAA,IAAI,IAAA,IAAQ,MAAA,IAAU,KAAA,IAAS,MAAA,IAAU,IAAA,IAAQ,MAAA,IAAU,KAAA,IAAS,MAAA,IAAU,IAAA,IAAQ,MAAA,IAAU,KAAA,IAAS,MAAA,EAAQ;AAC/G,IAAA,MAAM,IAAA,GAAQ,QAAQ,MAAA,GAAU,MAAA,CAAO,KAClC,KAAA,IAAS,MAAA,GAAU,OAAO,GAAA,GAC1B,IAAA,IAAQ,SAAU,MAAA,CAAO,EAAA,GACzB,SAAS,MAAA,GAAU,MAAA,CAAO,MAC1B,IAAA,IAAQ,MAAA,GAAU,MAAA,CAAO,EAAA,GAC1B,MAAA,CAAO,GAAA;AACX,IAAA,yBAAA,CAA0B,IAAA,CAAK,CAAC,CAAA,EAAG,YAAA,EAAc,QAAQ,aAAa,CAAA;AACtE,IAAA,yBAAA,CAA0B,IAAA,CAAK,CAAC,CAAA,EAAG,YAAA,EAAc,QAAQ,aAAa,CAAA;AACtE,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,IAAA,IAAQ,MAAA,IAAU,OAAA,IAAW,MAAA,EAAQ;AACvC,IAAA,MAAM,KAAA,GAAQ,IAAA,IAAQ,MAAA,GAAS,MAAA,CAAO,KAAK,MAAA,CAAO,KAAA;AAClD,IAAA,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAA,EAAG,YAAA,EAAc,QAAQ,aAAa,CAAA;AACpE,IAAA,MAAM,MAAA,GAAS,MAAM,CAAC,CAAA;AACtB,IAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,EAAG;AACzB,MAAA,KAAA,MAAW,KAAK,MAAA,EAAQ;AACtB,QAAA,yBAAA,CAA0B,CAAA,EAAG,YAAA,EAAc,MAAA,EAAQ,aAAa,CAAA;AAAA,MAClE;AAAA,IACF;AACA,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,MAAA,IAAU,MAAA,IAAU,OAAA,IAAW,MAAA,EAAQ;AACzC,IAAA,MAAM,KAAA,GAAQ,MAAA,IAAU,MAAA,GAAS,MAAA,CAAO,OAAO,MAAA,CAAO,KAAA;AACtD,IAAA,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAA,EAAG,YAAA,EAAc,QAAQ,aAAa,CAAA;AACpE,IAAA,yBAAA,CAA0B,KAAA,CAAM,CAAC,CAAA,EAAG,YAAA,EAAc,QAAQ,aAAa,CAAA;AACvE,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,IAAA,sBAAA,CAAuB,MAAA,CAAO,MAAA,EAAQ,YAAA,EAAc,MAAA,EAAQ,aAAa,CAAA;AACzE,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,eAAe,MAAA,EAAQ;AACzB,IAAA,sBAAA,CAAuB,MAAA,CAAO,SAAA,EAAW,YAAA,EAAc,MAAA,EAAQ,aAAa,CAAA;AAC5E,IAAA;AAAA,EACF;AAOA,EAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,IAAA,IAAI,SAAA,KAAc,MAAA,IAAa,YAAA,KAAiB,MAAA,EAAW;AAC3D,IAAA,MAAM,KAAA,GAAsB,IAAI,GAAA,CAAI,YAAY,CAAA;AAChD,IAAA,MAAM,eAAiC,EAAC;AACxC,IAAA,MAAM,gBAAgE,EAAC;AACvE,IAAA,MAAM,aAA6B,EAAC;AACpC,IAAA,MAAM,aAAA,uBAAoB,GAAA,EAAoB;AAE9C,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAA,CAAO,MAAA,CAAO,IAAA,EAAM;AACrC,MAAA,MAAM,MAAA,GAAS,UAAA,CAAW,IAAA,EAAM,MAAM,CAAA;AAItC,MAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,IAAA,EAAM,YAAY,CAAA;AAC9C,MAAA,KAAA,CAAM,GAAA,CAAI,IAAA,EAAM,EAAE,MAAA,EAAQ,OAAO,CAAA;AACjC,MAAA,YAAA,CAAa,KAAK,EAAE,KAAA,EAAO,QAAQ,KAAA,EAAO,MAAA,CAAO,OAAO,CAAA;AACxD,MAAA,aAAA,CAAc,IAAA,CAAK,EAAE,MAAA,EAAQ,KAAA,EAAO,CAAA;AAAA,IACtC;AAEA,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,aAAA,CAAc,MAAA,EAAQ,KAAK,CAAA,EAAG;AAChD,MAAA,MAAM,IAAA,GAAO,cAAc,CAAC,CAAA;AAC5B,MAAA,IAAI,SAAS,MAAA,EAAW;AACxB,MAAA,IAAI,KAAA,GAAQ,KAAA;AACZ,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,KAAK,CAAA,EAAG;AAC7B,QAAA,MAAM,OAAA,GAAU,cAAc,CAAC,CAAA;AAC/B,QAAA,IAAI,YAAY,MAAA,EAAW;AAC3B,QAAA,MAAM,IAAA,GAAO,gBAAgB,OAAA,CAAQ,MAAA,EAAQ,KAAK,MAAA,EAAQ,OAAA,CAAQ,KAAA,EAAO,IAAA,CAAK,KAAK,CAAA;AACnF,QAAA,IAAI,SAAS,MAAA,EAAW;AACtB,UAAA,UAAA,CAAW,KAAK,IAAI,CAAA;AACpB,UAAA,KAAA,GAAQ,IAAA;AACR,UAAA;AAAA,QACF;AAAA,MACF;AACA,MAAA,IAAI,CAAC,KAAA,EAAO,MAAM,IAAI,QAAA,CAAS,eAAe,CAAA,2EAAA,EAA8E,IAAA,CAAK,MAAA,CAAO,IAAI,CAAA,EAAA,CAAI,CAAA;AAAA,IAClJ;AAEA,IAAA,IAAI,WAAA;AACJ,IAAA,IAAI,MAAA,CAAO,MAAA,CAAO,MAAA,KAAW,MAAA,EAAW;AACtC,MAAA,MAAM,UAAA,uBAAiB,GAAA,EAA4B;AACnD,MAAA,kBAAA,CAAmB,OAAO,MAAA,CAAO,MAAA,EAAQ,OAAO,MAAA,EAAQ,UAAA,EAAY,WAAW,YAAY,CAAA;AAC3F,MAAA,WAAA,GAAc,EAAE,QAAA,EAAU,MAAA,CAAO,MAAA,CAAO,MAAA,EAAQ,eAAe,UAAA,EAAW;AAC1E,MAAA,KAAA,MAAW,CAAC,IAAA,EAAM,GAAG,CAAA,IAAK,UAAA,EAAY;AAGpC,QAAA,MAAM,QAAQ,IAAA,CAAK,KAAA,CAAM,GAAG,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAC,CAAA;AAC7C,QAAA,IAAI,MAAA,CAAO,MAAA,CAAO,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,EAAG,aAAA,CAAc,GAAA,CAAI,IAAA,EAAM,GAAG,GAAA,CAAI,KAAK,CAAA,CAAA,EAAI,GAAA,CAAI,MAAM,CAAA,CAAE,CAAA;AAAA,aACvF,aAAA,CAAc,GAAA,CAAI,IAAA,EAAM,GAAG,CAAA;AAAA,MAClC;AAAA,IACF;AAEA,IAAA,SAAA,CAAU,GAAA,CAAI,MAAA,CAAO,MAAA,EAAQ,EAAE,OAAA,EAAS,YAAA,EAAc,KAAA,EAAO,UAAA,EAAY,MAAA,EAAQ,WAAA,EAAa,QAAA,EAAU,aAAA,EAAe,CAAA;AACvH,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,KAAA,MAAW,GAAA,IAAO,OAAO,GAAA,EAAK;AAC5B,MAAA,kBAAA,CAAmB,GAAA,EAAK,YAAA,EAAc,MAAA,EAAQ,aAAA,EAAe,WAAW,YAAY,CAAA;AAAA,IACtF;AACA,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,QAAQ,MAAA,EAAQ;AAClB,IAAA,KAAA,MAAW,GAAA,IAAO,OAAO,EAAA,EAAI;AAC3B,MAAA,kBAAA,CAAmB,GAAA,EAAK,YAAA,EAAc,MAAA,EAAQ,aAAA,EAAe,WAAW,YAAY,CAAA;AAAA,IACtF;AACA,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,kBAAA,CAAmB,OAAO,GAAA,EAAK,YAAA,EAAc,MAAA,EAAQ,aAAA,EAAe,WAAW,YAAY,CAAA;AAC3F,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,cAAc,MAAA,EAAQ;AACxB,IAAA,sBAAA,CAAuB,MAAA,CAAO,QAAA,CAAS,KAAA,EAAO,YAAA,EAAc,QAAQ,aAAa,CAAA;AACjF,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,WAAW,MAAA,EAAQ;AACrB,IAAA,sBAAA,CAAuB,MAAA,CAAO,KAAA,CAAM,KAAA,EAAO,YAAA,EAAc,QAAQ,aAAa,CAAA;AAC9E,IAAA;AAAA,EACF;AAGA,EAAA,IAAI,UAAA,IAAc,MAAA,EAAQ,cAAA,CAAe,kBAAkB,CAAA;AAC7D,CAAA;AAEA,IAAM,sBAAA,GAAyB,CAC7B,IAAA,EACA,YAAA,EACA,QACA,aAAA,KACS;AACT,EAAA,IAAI,aAAA,CAAc,GAAA,CAAI,IAAI,CAAA,EAAG;AAK7B,EAAA,MAAM,EAAE,QAAA,EAAS,GAAI,gBAAA,CAAiB,IAAA,EAAM,cAAc,MAAM,CAAA;AAChE,EAAA,aAAA,CAAc,GAAA,CAAI,IAAA,EAAM,EAAE,KAAA,EAAO,QAAA,CAAS,KAAA,EAAO,MAAA,EAAQ,QAAA,CAAS,MAAA,EAAQ,MAAA,EAAQ,QAAA,CAAS,MAAA,EAAQ,CAAA;AACrG,CAAA;AAEA,IAAM,yBAAA,GAA4B,CAChC,GAAA,EACA,YAAA,EACA,QACA,aAAA,KACS;AACT,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,IAAY,WAAA,CAAY,GAAG,CAAA,EAAG;AAC/C,IAAA,sBAAA,CAAuB,GAAA,EAAK,YAAA,EAAc,MAAA,EAAQ,aAAa,CAAA;AAAA,EACjE;AACF,CAAA;AAMA,IAAM,eAAA,GAAkB,CACtB,MAAA,EACA,YAAA,EACA,MAAA,KACiC;AACjC,EAAA,IAAI,cAAc,MAAA,EAAQ;AACxB,IAAA,MAAM,EAAE,UAAS,GAAI,gBAAA,CAAiB,OAAO,QAAA,CAAS,KAAA,EAAO,cAAc,MAAM,CAAA;AACjF,IAAA,MAAM,QAAA,GAAW,OAAO,QAAA,CAAS,KAAA;AACjC,IAAA,MAAM,WAAA,GAAc,UAAA,IAAc,QAAA,GAAW,QAAA,CAAS,WAAW,QAAA,CAAS,MAAA;AAC1E,IAAA,OAAO;AAAA,MACL,KAAA,EAAO,QAAA;AAAA,MACP,WAAA;AAAA,MACA,QAAA,EAAU,OAAO,QAAA,CAAS;AAAA,KAC5B;AAAA,EACF;AAEA,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,KAAA,MAAW,GAAA,IAAO,OAAO,GAAA,EAAK;AAC5B,MAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,GAAA,EAAK,YAAA,EAAc,MAAM,CAAA;AACxD,MAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AAAA,IACnC;AAAA,EACF;AAEA,EAAA,IAAI,QAAQ,MAAA,EAAQ;AAClB,IAAA,KAAA,MAAW,GAAA,IAAO,OAAO,EAAA,EAAI;AAC3B,MAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,GAAA,EAAK,YAAA,EAAc,MAAM,CAAA;AACxD,MAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AAAA,IACnC;AAAA,EACF;AAEA,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,OAAO,eAAA,CAAgB,MAAA,CAAO,GAAA,EAAK,YAAA,EAAc,MAAM,CAAA;AAAA,EACzD;AAEA,EAAA,OAAO,MAAA;AACT,CAAA;AAMO,IAAM,OAAA,GAAU,CAAC,GAAA,EAAY,MAAA,KAA0C;AAC5E,EAAA,MAAM,YAAA,uBAAiC,GAAA,EAAI;AAC3C,EAAA,MAAM,YAAA,uBAAiC,GAAA,EAAI;AAC3C,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AACzC,EAAA,MAAM,UAA4B,EAAC;AACnC,EAAA,MAAM,QAAwB,EAAC;AAG/B,EAAA,MAAM,gBAAgE,EAAC;AAEvE,EAAA,KAAA,MAAW,MAAA,IAAU,IAAI,IAAA,EAAM;AAC7B,IAAA,IAAI,OAAO,WAAW,QAAA,EAAU;AAC9B,MAAA,MAAM,MAAA,GAAS,UAAA,CAAW,MAAA,EAAQ,MAAM,CAAA;AACxC,MAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,MAAA,EAAQ,YAAY,CAAA;AAEhD,MAAA,YAAA,CAAa,GAAA,CAAI,MAAA,EAAQ,EAAE,MAAA,EAAQ,OAAO,CAAA;AAC1C,MAAA,OAAA,CAAQ,KAAK,EAAE,KAAA,EAAO,QAAQ,KAAA,EAAO,MAAA,CAAO,OAAO,CAAA;AACnD,MAAA,aAAA,CAAc,IAAA,CAAK,EAAE,MAAA,EAAQ,KAAA,EAAO,CAAA;AAAA,IACtC,CAAA,MAAO;AAEL,MAAA,UAAA,CAAW,MAAA,CAAO,IAAI,gBAAgB,CAAA;AACtC,MAAA,MAAM,WAAA,GAAc,OAAA,CAAQ,MAAA,CAAO,KAAA,EAAO,MAAM,CAAA;AAChD,MAAA,MAAM,QAAQ,MAAA,CAAO,EAAA;AAOrB,MAAA,MAAM,UAAA,GAAa,CAAC,IAAA,EAAc,cAAA,MAAiD;AAAA,QACjF,IAAA;AAAA,QACA,IAAA,EAAM,cAAA;AAAA,QACN,cAAA;AAAA,QACA,QAAA,EAAU,IAAA;AAAA,QACV,UAAA,EAAY;AAAA,OACd,CAAA;AACA,MAAA,MAAM,eAAA,GAAiC;AAAA,QACrC,GAAG,WAAA,CAAY,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,MAAO,EAAE,GAAG,CAAA,CAAE,MAAA,EAAQ,IAAA,EAAM,CAAA,CAAE,YAAW,CAAE,CAAA;AAAA,QACtE,GAAG,WAAA,CAAY,QAAA,CAAS,GAAA,CAAI,CAAC,MAAM,UAAA,CAAW,CAAA,CAAE,IAAA,EAAM,SAAS,CAAC,CAAA;AAAA,QAChE,GAAG,WAAA,CAAY,UAAA,CAAW,GAAA,CAAI,CAAC,MAAM,UAAA,CAAW,CAAA,CAAE,IAAA,EAAM,QAAQ,CAAC;AAAA,OACnE;AACA,MAAA,MAAM,eAAA,GAAgC;AAAA,QACpC,IAAA,EAAM,KAAA;AAAA,QACN,KAAA,EAAO,KAAA;AAAA,QACP,MAAA,EAAQ,eAAA;AAAA,QACR,WAAW,EAAC;AAAA,QACZ,SAAS;AAAC,OACZ;AAEA,MAAA,YAAA,CAAa,IAAI,KAAA,EAAO,EAAE,MAAA,EAAQ,eAAA,EAAiB,OAAO,CAAA;AAC1D,MAAA,OAAA,CAAQ,IAAA,CAAK,EAAE,KAAA,EAAO,QAAA,EAAU,aAAa,CAAA;AAAA,IAC/C;AAAA,EACF;AAGA,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,aAAA,CAAc,QAAQ,CAAA,EAAA,EAAK;AAC7C,IAAA,MAAM,IAAA,GAAO,aAAA,CAAc,CAAA,GAAI,CAAC,CAAA;AAChC,IAAA,MAAM,IAAA,GAAO,cAAc,CAAC,CAAA;AAC5B,IAAA,IAAI,IAAA,KAAS,MAAA,IAAa,IAAA,KAAS,MAAA,EAAW;AAG9C,IAAA,IAAI,SAAA,GAAY,KAAA;AAChB,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK;AAC1B,MAAA,MAAM,OAAA,GAAU,cAAc,CAAC,CAAA;AAC/B,MAAA,IAAI,YAAY,MAAA,EAAW;AAE3B,MAAA,MAAM,IAAA,GAAO,gBAAgB,OAAA,CAAQ,MAAA,EAAQ,KAAK,MAAA,EAAQ,OAAA,CAAQ,KAAA,EAAO,IAAA,CAAK,KAAK,CAAA;AACnF,MAAA,IAAI,SAAS,MAAA,EAAW;AACtB,QAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AACf,QAAA,SAAA,GAAY,IAAA;AACZ,QAAA;AAAA,MACF;AAAA,IACF;AAEA,IAAA,IAAI,CAAC,SAAA,EAAW;AACd,MAAA,MAAM,IAAI,QAAA;AAAA,QACR,aAAA;AAAA,QACA,CAAA,mEAAA,EAAsE,IAAA,CAAK,MAAA,CAAO,IAAI,CAAA,mCAAA;AAAA,OACxF;AAAA,IACF;AAAA,EACF;AAKA,EAAA,MAAM,SAA0B,EAAC;AACjC,EAAA,KAAA,MAAW,GAAA,IAAO,GAAA,CAAI,MAAA,IAAU,EAAC,EAAG;AAClC,IAAA,MAAM,IAAA,GAAO,OAAO,GAAA,KAAQ,QAAA,GAAW,MAAM,GAAA,CAAI,KAAA;AACjD,IAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,EAAU,UAAA,CAAW,GAAA,CAAI,IAAI,aAAa,CAAA;AAC7D,IAAA,MAAM,EAAE,QAAA,EAAS,GAAI,gBAAA,CAAiB,IAAA,EAAM,cAAc,MAAM,CAAA;AAChE,IAAA,MAAA,CAAO,IAAA,CAAK,OAAO,GAAA,KAAQ,QAAA,GAAW,QAAA,GAAW,EAAE,GAAG,QAAA,EAAU,UAAA,EAAY,GAAA,CAAI,EAAA,EAAI,CAAA;AACpF,IAAA,QAAA,CAAS,GAAA,CAAI,MAAM,CAAA,EAAG,QAAA,CAAS,KAAK,CAAA,CAAA,EAAI,QAAA,CAAS,MAAM,CAAA,CAAE,CAAA;AAAA,EAC3D;AAGA,EAAA,IAAI,cAAA;AACJ,EAAA,IAAI,QAAA;AAEJ,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAA4B;AAElD,EAAA,IAAI,GAAA,CAAI,WAAW,MAAA,EAAW;AAC5B,IAAA,MAAM,aAAA,uBAAoB,GAAA,EAA4B;AACtD,IAAA,kBAAA,CAAmB,IAAI,MAAA,EAAQ,YAAA,EAAc,MAAA,EAAQ,aAAA,EAAe,WAAW,YAAY,CAAA;AAC3F,IAAA,cAAA,GAAiB,EAAE,QAAA,EAAU,GAAA,CAAI,MAAA,EAAQ,aAAA,EAAc;AAGvD,IAAA,KAAA,MAAW,CAAC,IAAA,EAAM,GAAG,CAAA,IAAK,aAAA,EAAe;AACvC,MAAA,QAAA,CAAS,GAAA,CAAI,MAAM,CAAA,EAAG,GAAA,CAAI,KAAK,CAAA,CAAA,EAAI,GAAA,CAAI,MAAM,CAAA,CAAE,CAAA;AAAA,IACjD;AAGA,IAAA,QAAA,GAAW,eAAA,CAAgB,GAAA,CAAI,MAAA,EAAQ,YAAA,EAAc,MAAM,CAAA;AAAA,EAC7D;AAOA,EAAA,MAAM,WAAmE,EAAC;AAC1E,EAAA,IAAI,GAAA,CAAI,YAAY,MAAA,EAAW;AAC7B,IAAA,KAAA,MAAW,CAAC,MAAM,IAAI,CAAA,IAAK,OAAO,OAAA,CAAQ,GAAA,CAAI,OAAO,CAAA,EAAG;AACtD,MAAA,IAAI,SAAS,MAAA,EAAW;AACtB,QAAA,UAAA,CAAW,MAAM,cAAc,CAAA;AAC/B,QAAA,mBAAA,CAAoB,IAAA,EAAM,YAAA,EAAc,MAAA,EAAQ,QAAA,EAAU,WAAW,YAAY,CAAA;AACjF,QAAA,QAAA,CAAS,IAAA,CAAK,EAAE,IAAA,EAAM,UAAA,EAAY,MAAM,CAAA;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAGA,EAAA,MAAM,aAAuE,EAAC;AAC9E,EAAA,IAAI,GAAA,CAAI,cAAc,MAAA,EAAW;AAC/B,IAAA,KAAA,MAAW,CAAC,MAAM,IAAI,CAAA,IAAK,OAAO,OAAA,CAAQ,GAAA,CAAI,SAAS,CAAA,EAAG;AACxD,MAAA,IAAI,SAAS,MAAA,EAAW;AACtB,QAAA,UAAA,CAAW,MAAM,gBAAgB,CAAA;AACjC,QAAA,qBAAA,CAAsB,IAAA,EAAM,YAAA,EAAc,MAAA,EAAQ,QAAQ,CAAA;AAC1D,QAAA,UAAA,CAAW,IAAA,CAAK,EAAE,IAAA,EAAM,UAAA,EAAY,MAAM,CAAA;AAAA,MAC5C;AAAA,IACF;AAAA,EACF;AAGA,EAAA,MAAM,UAA2B,EAAC;AAClC,EAAA,IAAI,GAAA,CAAI,YAAY,MAAA,EAAW;AAC7B,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAI,OAAA,EAAS;AAC9B,MAAA,MAAM,EAAE,QAAA,EAAS,GAAI,gBAAA,CAAiB,IAAA,EAAM,cAAc,MAAM,CAAA;AAChE,MAAA,OAAA,CAAQ,KAAK,QAAQ,CAAA;AACrB,MAAA,QAAA,CAAS,GAAA,CAAI,MAAM,CAAA,EAAG,QAAA,CAAS,KAAK,CAAA,CAAA,EAAI,QAAA,CAAS,MAAM,CAAA,CAAE,CAAA;AAAA,IAC3D;AAAA,EACF;AAGA,EAAA,MAAM,OAAsE,EAAC;AAC7E,EAAA,IAAI,GAAA,CAAI,SAAS,MAAA,EAAW;AAC1B,IAAA,MAAM,YAAA,GAAe,IAAI,GAAA,CAAI,QAAA,CAAS,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAA;AACxD,IAAA,MAAM,cAAA,GAAiB,IAAI,GAAA,CAAI,UAAA,CAAW,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAA;AAE5D,IAAA,KAAA,MAAW,KAAA,IAAS,IAAI,IAAA,EAAM;AAC5B,MAAA,MAAM,GAAA,GAAM,MAAM,GAAA,IAAO,KAAA;AAEzB,MAAA,IAAI,YAAA,CAAa,IAAI,KAAA,CAAM,KAAK,KAAK,cAAA,CAAe,GAAA,CAAI,KAAA,CAAM,KAAK,CAAA,EAAG;AAEpE,QAAA,IAAA,CAAK,KAAK,EAAE,KAAA,EAAO,KAAA,CAAM,KAAA,EAAO,KAAK,CAAA;AAAA,MACvC,CAAA,MAAO;AAEL,QAAA,MAAM,EAAE,QAAA,EAAS,GAAI,iBAAiB,KAAA,CAAM,KAAA,EAAO,cAAc,MAAM,CAAA;AACvE,QAAA,QAAA,CAAS,GAAA,CAAI,MAAM,KAAA,EAAO,CAAA,EAAG,SAAS,KAAK,CAAA,CAAA,EAAI,QAAA,CAAS,MAAM,CAAA,CAAE,CAAA;AAChE,QAAA,IAAA,CAAK,IAAA,CAAK,EAAE,KAAA,EAAO,QAAA,EAAU,KAAK,CAAA;AAAA,MACpC;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO;AAAA,IACL,OAAA;AAAA,IACA,KAAA;AAAA,IACA,MAAA;AAAA,IACA,MAAA,EAAQ,cAAA;AAAA,IACR,QAAA;AAAA,IACA,QAAA;AAAA,IACA,UAAA;AAAA,IACA,OAAA;AAAA,IACA,IAAA;AAAA,IACA,OAAO,GAAA,CAAI,KAAA;AAAA,IACX,QAAA,EAAU,IAAI,QAAA,IAAY,KAAA;AAAA,IAC1B,QAAA;AAAA,IACA,GAAI,SAAA,CAAU,IAAA,GAAO,IAAI,EAAE,SAAA,KAAc;AAAC,GAC5C;AACF;AAMA,IAAM,sBAAsB,CAC1B,IAAA,EACA,cACA,MAAA,EACA,QAAA,EACA,WACA,YAAA,KACS;AACT,EAAA,MAAM,mBAAA,GAAsB,CAAC,GAAA,KAA4B;AACvD,IAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,IAAY,WAAA,CAAY,GAAG,CAAA,EAAG;AAC/C,MAAA,IAAI,CAAC,QAAA,CAAS,GAAA,CAAI,GAAG,CAAA,EAAG;AACtB,QAAA,MAAM,EAAE,QAAA,EAAS,GAAI,gBAAA,CAAiB,GAAA,EAAK,cAAc,MAAM,CAAA;AAC/D,QAAA,QAAA,CAAS,GAAA,CAAI,KAAK,CAAA,EAAG,QAAA,CAAS,KAAK,CAAA,CAAA,EAAI,QAAA,CAAS,MAAM,CAAA,CAAE,CAAA;AAAA,MAC1D;AAAA,IACF;AAAA,EACF,CAAA;AAEA,EAAA,IAAI,SAAS,IAAA,IAAQ,UAAA,IAAc,QAAQ,UAAA,IAAc,IAAA,IAAQ,YAAY,IAAA,EAAM;AACjF,IAAA,MAAM,IAAA,GAAQ,KAAA,IAAS,IAAA,GAAQ,IAAA,CAAK,GAAA,GAC/B,UAAA,IAAc,IAAA,GAAQ,IAAA,CAAK,QAAA,GAC3B,UAAA,IAAc,IAAA,GAAQ,IAAA,CAAK,WAC5B,IAAA,CAAK,MAAA;AACT,IAAA,mBAAA,CAAoB,IAAA,CAAK,CAAC,CAAC,CAAA;AAC3B,IAAA,mBAAA,CAAoB,IAAA,CAAK,CAAC,CAAC,CAAA;AAC3B,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,YAAY,IAAA,EAAM;AACpB,IAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,MAAA,EAAQ,mBAAA,CAAoB,CAAC,CAAA;AAClD,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,cAAc,IAAA,EAAM;AACtB,IAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,QAAA,EAAU,mBAAA,CAAoB,CAAC,CAAA;AACpD,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,UAAU,IAAA,EAAM;AAClB,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,IAAA,CAAK,IAAA,EAAM;AAGjC,MAAA,MAAM,aAAA,uBAAoB,GAAA,EAA4B;AACtD,MAAA,kBAAA,CAAmB,KAAK,SAAA,EAAW,YAAA,EAAc,MAAA,EAAQ,aAAA,EAAe,WAAW,YAAY,CAAA;AAC/F,MAAA,KAAA,MAAW,CAAC,IAAA,EAAM,GAAG,CAAA,IAAK,aAAA,EAAe;AACvC,QAAA,QAAA,CAAS,GAAA,CAAI,MAAM,CAAA,EAAG,GAAA,CAAI,KAAK,CAAA,CAAA,EAAI,GAAA,CAAI,MAAM,CAAA,CAAE,CAAA;AAAA,MACjD;AACA,MAAA,mBAAA,CAAoB,KAAK,IAAI,CAAA;AAAA,IAC/B;AACA,IAAA,mBAAA,CAAoB,IAAA,CAAK,KAAK,IAAI,CAAA;AAAA,EACpC;AACF,CAAA;AAEA,IAAM,qBAAA,GAAwB,CAC5B,IAAA,EACA,YAAA,EACA,QACA,QAAA,KACS;AACT,EAAA,MAAM,GAAA,GAAO,WAAW,IAAA,GAAQ,IAAA,CAAK,QAChC,eAAA,IAAmB,IAAA,GAAQ,KAAK,aAAA,GAChC,KAAA,IAAS,OAAQ,IAAA,CAAK,GAAA,GACtB,SAAS,IAAA,GAAQ,IAAA,CAAK,MACtB,KAAA,IAAS,IAAA,GAAQ,IAAA,CAAK,GAAA,GACvB,IAAA,CAAK,GAAA;AAGT,EAAA,IAAI,QAAQ,GAAA,EAAK;AAGjB,EAAA,IAAI,OAAO,QAAQ,QAAA,EAAU;AAC3B,IAAA,mBAAA,CAAoB,GAAA,EAAK,YAAA,EAAc,MAAA,EAAQ,QAAQ,CAAA;AACvD,IAAA;AAAA,EACF;AAGA,EAAA,IAAI,CAAC,QAAA,CAAS,GAAA,CAAI,GAAG,CAAA,EAAG;AACtB,IAAA,MAAM,EAAE,QAAA,EAAS,GAAI,gBAAA,CAAiB,GAAA,EAAK,cAAc,MAAM,CAAA;AAC/D,IAAA,QAAA,CAAS,GAAA,CAAI,KAAK,CAAA,EAAG,QAAA,CAAS,KAAK,CAAA,CAAA,EAAI,QAAA,CAAS,MAAM,CAAA,CAAE,CAAA;AAAA,EAC1D;AACF,CAAA;;;ACntBA,IAAM,mBAAA,GAAsB,CAAC,MAAA,KAAmC;AAC9D,EAAA,IAAI,MAAA,CAAO,QAAA,KAAa,MAAA,EAAW,OAAO,CAAA;AAC1C,EAAA,IAAI,QAAA,GAAW,CAAA;AACf,EAAA,KAAA,MAAW,WAAA,IAAe,MAAA,CAAO,QAAA,CAAS,OAAA,EAAS;AACjD,IAAA,MAAM,UAAA,GAAa,oBAAoB,WAAW,CAAA;AAClD,IAAA,IAAI,UAAA,GAAa,UAAU,QAAA,GAAW,UAAA;AAAA,EACxC;AACA,EAAA,OAAO,CAAA,GAAI,QAAA;AACb,CAAA;AAEA,IAAM,kBAAA,GAAqB,CAAC,QAAA,KAAoC;AAC9D,EAAA,IAAI,GAAA,GAAM,CAAA;AACV,EAAA,KAAA,MAAW,MAAA,IAAU,SAAS,OAAA,EAAS;AACrC,IAAA,MAAM,KAAA,GAAQ,oBAAoB,MAAM,CAAA;AACxC,IAAA,IAAI,KAAA,GAAQ,KAAK,GAAA,GAAM,KAAA;AAAA,EACzB;AACA,EAAA,OAAO,GAAA;AACT,CAAA;AAMA,IAAM,mBAAA,GAAsB,CAAC,QAAA,KAAqC;AAEhE,EAAA,MAAM,aAAA,GAAgB,SAAS,OAAA,CAAQ,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,WAAW,MAAS,CAAA;AAC3E,EAAA,IAAI,aAAA,CAAc,MAAA,IAAU,CAAA,EAAG,OAAO,KAAA;AAItC,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAY;AACpC,EAAA,MAAM,WAAA,GAAc,cAAc,CAAC,CAAA;AACnC,EAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,IAAA,WAAA,CAAY,GAAA,CAAI,YAAY,KAAK,CAAA;AAAA,EACnC;AAEA,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,aAAA,CAAc,QAAQ,CAAA,EAAA,EAAK;AAC7C,IAAA,MAAM,MAAA,GAAS,cAAc,CAAC,CAAA;AAC9B,IAAA,IAAI,WAAW,MAAA,EAAW;AAE1B,IAAA,MAAM,OAAA,GAAU,SAAS,KAAA,CAAM,IAAA;AAAA,MAC7B,CAAC,CAAA,KACE,CAAA,CAAE,YAAY,MAAA,CAAO,KAAA,IAAS,YAAY,GAAA,CAAI,CAAA,CAAE,SAAS,CAAA,IACzD,EAAE,SAAA,KAAc,MAAA,CAAO,SAAS,WAAA,CAAY,GAAA,CAAI,EAAE,OAAO;AAAA,KAC9D;AAEA,IAAA,IAAI,CAAC,SAAS,OAAO,IAAA;AAErB,IAAA,WAAA,CAAY,GAAA,CAAI,OAAO,KAAK,CAAA;AAAA,EAC9B;AAEA,EAAA,OAAO,KAAA;AACT,CAAA;AAMA,IAAM,0BAAA,GAA6B,CAAC,QAAA,KAAsC;AACxE,EAAA,IAAI,QAAA,CAAS,MAAA,KAAW,MAAA,EAAW,OAAO,EAAC;AAE3C,EAAA,MAAM,YAAsB,EAAC;AAE7B,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,GAAG,CAAA,IAAK,QAAA,CAAS,OAAO,aAAA,EAAe;AAEvD,IAAA,MAAM,MAAA,GAAS,SAAS,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,KAAA,KAAU,GAAA,CAAI,KAAK,CAAA;AACjE,IAAA,IAAI,MAAA,KAAW,MAAA,IAAa,MAAA,CAAO,MAAA,KAAW,MAAA,EAAW;AAGzD,IAAA,MAAM,SAAA,GAAY,MAAA,CAAO,MAAA,CAAO,OAAA,CAAQ,IAAA;AAAA,MAAK,CAAC,GAAA,KAC5C,GAAA,CAAI,MAAA,CAAO,QAAA,CAAS,IAAI,MAAM;AAAA,KAChC;AAGA,IAAA,MAAM,YAAA,GAAe,MAAA,CAAO,MAAA,CAAO,MAAA,CAAO,IAAA;AAAA,MACxC,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,GAAA,CAAI,UAAU,CAAA,CAAE;AAAA,KACpC;AAEA,IAAA,IAAI,CAAC,SAAA,IAAa,CAAC,YAAA,EAAc;AAC/B,MAAA,SAAA,CAAU,KAAK,IAAI,CAAA;AAAA,IACrB;AAAA,EACF;AAEA,EAAA,OAAO,SAAA;AACT,CAAA;AAMA,IAAM,2BAAA,GAA8B,CAAC,QAAA,KACnC,QAAA,CAAS,WAAW,MAAA,GAAS,CAAA,IAAK,QAAA,CAAS,OAAA,CAAQ,MAAA,KAAW,CAAA;AAMzD,IAAM,OAAA,GAAU,CAAC,QAAA,EAAyB,MAAA,KAA2C;AAC1F,EAAA,MAAM,WAAqB,EAAC;AAC5B,EAAA,MAAM,SAAmB,EAAC;AAG1B,EAAA,MAAM,KAAA,GAAQ,mBAAmB,QAAQ,CAAA;AACzC,EAAA,IAAI,KAAA,GAAQ,OAAO,eAAA,EAAiB;AAClC,IAAA,MAAA,CAAO,IAAA;AAAA,MACL,CAAA,uBAAA,EAA0B,KAAK,CAAA,kCAAA,EAAqC,MAAA,CAAO,eAAe,CAAA;AAAA,KAC5F;AAAA,EACF;AAGA,EAAA,IAAI,MAAA,CAAO,uBAAA,IAA2B,mBAAA,CAAoB,QAAQ,CAAA,EAAG;AACnE,IAAA,MAAA,CAAO,IAAA;AAAA,MACL;AAAA,KACF;AAAA,EACF;AAGA,EAAA,MAAM,SAAA,GAAY,2BAA2B,QAAQ,CAAA;AACrD,EAAA,IAAI,SAAA,CAAU,SAAS,CAAA,EAAG;AACxB,IAAA,MAAM,OAAA,GAAU,CAAA,0BAAA,EAA6B,SAAA,CAAU,IAAA,CAAK,IAAI,CAAC,CAAA,iDAAA,CAAA;AACjE,IAAA,IAAI,OAAO,sBAAA,EAAwB;AACjC,MAAA,MAAA,CAAO,KAAK,OAAO,CAAA;AAAA,IACrB,CAAA,MAAA,IAAW,OAAO,oBAAA,EAAsB;AACtC,MAAA,QAAA,CAAS,KAAK,OAAO,CAAA;AAAA,IACvB;AAAA,EACF;AAGA,EAAA,IAAI,2BAAA,CAA4B,QAAQ,CAAA,EAAG;AACzC,IAAA,QAAA,CAAS,IAAA;AAAA,MACP;AAAA,KACF;AAAA,EACF;AAGA,EAAA,IAAI,QAAA,CAAS,aAAa,MAAA,EAAW;AACnC,IAAA,MAAM,aAAA,GAAgB,SAAS,QAAA,CAAS,KAAA;AACxC,IAAA,MAAM,YAAA,GAAe,SAAS,OAAA,CAAQ,IAAA;AAAA,MACpC,CAAC,CAAA,KAAM,CAAA,CAAE,KAAA,KAAU,aAAA,CAAc;AAAA,KACnC;AACA,IAAA,IAAI,YAAA,KAAiB,MAAA,IAAa,YAAA,CAAa,MAAA,KAAW,MAAA,EAAW;AACnE,MAAA,MAAM,cAAA,GAAiB,YAAA,CAAa,MAAA,CAAO,OAAA,CAAQ,IAAA;AAAA,QACjD,CAAC,GAAA,KACC,GAAA,CAAI,MAAA,CAAO,QAAA,CAAS,aAAA,CAAc,MAAM,CAAA,KACvC,GAAA,CAAI,IAAA,KAAS,MAAA,IAAU,GAAA,CAAI,IAAA,KAAS,SAAA;AAAA,OACzC;AACA,MAAA,IAAI,CAAC,cAAA,EAAgB;AACnB,QAAA,QAAA,CAAS,IAAA;AAAA,UACP,CAAA,cAAA,EAAiB,cAAc,IAAI,CAAA,4DAAA;AAAA,SACrC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,UAAU,MAAA,EAAO;AAC5B;;;ACpKO,IAAM,oBAAoB,MAAoB;AACnD,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAwB;AAE1C,EAAA,MAAM,GAAA,GAAM,OAAO,GAAA,KAAiD;AAClE,IAAA,OAAO,KAAA,CAAM,IAAI,GAAG,CAAA;AAAA,EACtB,CAAA;AAEA,EAAA,MAAM,GAAA,GAAM,OAAO,GAAA,EAAa,KAAA,KAAqC;AACnE,IAAA,KAAA,CAAM,GAAA,CAAI,KAAK,KAAK,CAAA;AAAA,EACtB,CAAA;AAEA,EAAA,MAAM,GAAA,GAAM,OAAO,GAAA,KAA+B;AAChD,IAAA,KAAA,CAAM,OAAO,GAAG,CAAA;AAAA,EAClB,CAAA;AAEA,EAAA,MAAM,QAAQ,YAA2B;AACvC,IAAA,KAAA,CAAM,KAAA,EAAM;AAAA,EACd,CAAA;AAEA,EAAA,MAAM,OAAO,YAA+B;AAC1C,IAAA,OAAO,CAAC,GAAG,KAAA,CAAM,IAAA,EAAM,CAAA;AAAA,EACzB,CAAA;AAGA,EAAA,MAAM,UAAU,YAAgE;AAC9E,IAAA,OAAO,CAAC,GAAG,KAAA,CAAM,OAAA,EAAS,CAAA,CAAE,GAAA,CAAI,CAAC,CAAC,KAAK,KAAK,CAAA,MAAO,EAAE,GAAA,EAAK,OAAM,CAAE,CAAA;AAAA,EACpE,CAAA;AAEA,EAAA,OAAO,EAAE,GAAA,EAAK,GAAA,EAAK,QAAQ,GAAA,EAAK,KAAA,EAAO,MAAM,OAAA,EAAQ;AACvD;;;ACqDA,IAAM,cAAA,GAAiB,GAAA;AACvB,IAAM,mBAAA,GAAsB,GAAA;AAC5B,IAAM,iBAAA,GAAoB,KAAK,IAAA,GAAO,IAAA;AACtC,IAAM,mBAAA,GAAsB,EAAA;AAG5B,IAAM,gBAAA,GAAmB,GAAA;AACzB,IAAM,YAAA,GAAe,GAAA;AAgBrB,IAAM,KAAA,GAAQ,CAAC,KAAA,KAA+C;AAC5D,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,IAAA,IAAQ,OAAA,IAAW,KAAA,IAAS,OAAO,KAAA,CAAM,KAAA,KAAU,UAAA,EAAY,KAAA,CAAM,KAAA,EAAM;AACxH,CAAA;AAEO,IAAM,iBAAiB,CAC5B,MAAA,GAAyB,EAAC,EAC1B,OAAuC,MAAM;AAAC,CAAA,EAC9C,GAAA,GAAoB,KAAK,GAAA,KACZ;AACb,EAAA,MAAM,KAAA,GAAQ,OAAO,KAAA,IAAS,cAAA;AAC9B,EAAA,MAAM,UAAA,GAAa,OAAO,UAAA,IAAc,mBAAA;AACxC,EAAA,MAAM,QAAA,GAAW,OAAO,QAAA,IAAY,iBAAA;AACpC,EAAA,MAAM,gBAAgB,MAAA,CAAO,aAAA,IAAiB,IAAA,CAAK,KAAA,CAAM,WAAW,EAAE,CAAA;AACtE,EAAA,MAAM,UAAA,GAAa,OAAO,UAAA,IAAc,mBAAA;AAExC,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AACzC,EAAA,MAAM,YAAY,CAAC,KAAA,KAA0B,QAAA,CAAS,GAAA,CAAI,KAAK,CAAA,IAAK,CAAA;AACpE,EAAA,MAAM,QAAA,GAAW,CAAC,MAAA,KAAwC,MAAA,CAAO,IAAI,SAAS,CAAA;AAC9E,EAAA,MAAM,SAAA,GAAY,CAAC,MAAA,EAA2B,IAAA,KAC5C,OAAO,KAAA,CAAM,CAAC,KAAA,EAAO,CAAA,KAAM,SAAA,CAAU,KAAK,CAAA,KAAM,IAAA,CAAK,CAAC,CAAC,CAAA;AAGzD,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAoB;AACvC,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAoB;AACxC,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAoB;AACxC,EAAA,MAAM,cAAA,uBAAqB,GAAA,EAAyB;AAEpD,EAAA,MAAM,MAAA,GAAS,EAAE,IAAA,EAAM,CAAA,EAAG,MAAA,EAAQ,CAAA,EAAG,SAAA,EAAW,CAAA,EAAG,SAAA,EAAW,CAAA,EAAG,SAAA,EAAW,CAAA,EAAE;AAC9E,EAAA,MAAM,MAAA,GAAS,EAAE,KAAA,EAAO,GAAA,EAAI,EAAG,MAAM,CAAA,EAAG,SAAA,EAAW,CAAA,EAAG,MAAA,EAAQ,CAAA,EAAE;AAEhE,EAAA,MAAM,IAAA,GAAO,CAAC,GAAA,KAAsB;AAClC,IAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA;AAC5B,IAAA,IAAI,UAAU,MAAA,EAAW;AACzB,IAAA,MAAA,CAAO,OAAO,GAAG,CAAA;AACjB,IAAA,KAAA,IAAS,KAAA,CAAM,KAAA;AAAA,EACjB,CAAA;AAEA,EAAA,MAAM,eAAe,MAAY;AAC/B,IAAA,MAAM,KAAK,GAAA,EAAI;AACf,IAAA,IAAI,EAAA,GAAK,MAAA,CAAO,KAAA,GAAQ,gBAAA,EAAkB;AACxC,MAAA,MAAA,CAAO,KAAA,GAAQ,EAAA;AACf,MAAA,MAAA,CAAO,IAAA,GAAO,CAAA;AACd,MAAA,MAAA,CAAO,SAAA,GAAY,CAAA;AAAA,IACrB;AACA,IAAA,MAAA,CAAO,SAAA,IAAa,CAAA;AACpB,IAAA,IAAI,MAAA,CAAO,SAAA,IAAa,YAAA,IAAgB,MAAA,CAAO,SAAA,GAAY,OAAO,IAAA,IAAQ,EAAA,GAAK,MAAA,CAAO,MAAA,GAAS,gBAAA,EAAkB;AAC/G,MAAA,MAAA,CAAO,MAAA,GAAS,EAAA;AAChB,MAAA,OAAA,CAAQ,IAAA;AAAA,QACN,CAAA,2CAAA,EAA8C,MAAA,CAAO,SAAS,CAAA,YAAA,EAAe,OAAO,IAAI,CAAA,6EAAA;AAAA,OAC1F;AAAA,IACF;AAAA,EACF,CAAA;AAEA,EAAA,MAAM,KAAA,GAAQ,CAAC,GAAA,EAAa,IAAA,EAAa,QAA2B,IAAA,KAAkC;AACpG,IAAA,IAAA,CAAK,GAAG,CAAA;AACR,IAAA,MAAM,IAAA,GAAA,CAAQ,IAAA,CAAK,SAAA,CAAU,IAAI,KAAK,EAAA,EAAI,MAAA;AAC1C,IAAA,IAAI,OAAO,aAAA,EAAe;AACxB,MAAA,MAAA,CAAO,SAAA,IAAa,CAAA;AACpB,MAAA,IAAA,CAAK,EAAE,IAAA,EAAM,YAAA,EAAc,QAAQ,WAAA,EAAa,KAAA,EAAO,MAAM,CAAA;AAC7D,MAAA;AAAA,IACF;AACA,IAAA,MAAA,CAAO,GAAA,CAAI,GAAA,EAAK,EAAE,IAAA,EAAM,KAAA,EAAO,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,EAAA,EAAI,GAAA,EAAI,EAAG,CAAA;AAC9D,IAAA,KAAA,IAAS,IAAA;AACT,IAAA,OAAO,MAAA,CAAO,IAAA,GAAO,UAAA,IAAc,KAAA,GAAQ,QAAA,EAAU;AACnD,MAAA,MAAM,MAAA,GAAS,MAAA,CAAO,IAAA,EAAK,CAAE,IAAA,EAAK;AAClC,MAAA,IAAI,MAAA,CAAO,SAAS,IAAA,EAAM;AAC1B,MAAA,MAAM,OAAA,GAAU,MAAA,CAAO,GAAA,CAAI,MAAA,CAAO,KAAK,CAAA;AACvC,MAAA,IAAA,CAAK,OAAO,KAAK,CAAA;AACjB,MAAA,MAAA,CAAO,SAAA,IAAa,CAAA;AACpB,MAAA,IAAA,CAAK,EAAE,MAAM,YAAA,EAAc,MAAA,EAAQ,YAAY,KAAA,EAAO,OAAA,EAAS,KAAA,IAAS,CAAA,EAAG,CAAA;AAC3E,MAAA,YAAA,EAAa;AAAA,IACf;AAAA,EACF,CAAA;AAEA,EAAA,MAAM,IAAA,GAAO,CAAC,GAAA,EAAa,MAAA,KAAuC;AAChE,IAAA,MAAM,GAAA,GAAM,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA;AAC1B,IAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,MAAA,IAAI,GAAA,EAAI,GAAI,GAAA,CAAI,EAAA,GAAK,KAAA,IAAS,UAAU,GAAA,CAAI,MAAA,EAAQ,GAAA,CAAI,IAAI,CAAA,EAAG;AAC7D,QAAA,MAAA,CAAO,OAAO,GAAG,CAAA;AACjB,QAAA,MAAA,CAAO,GAAA,CAAI,KAAK,GAAG,CAAA;AACnB,QAAA,MAAA,CAAO,IAAA,IAAQ,CAAA;AACf,QAAA,MAAA,CAAO,IAAA,IAAQ,CAAA;AACf,QAAA,OAAO,OAAA,CAAQ,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA;AAAA,MACjC;AACA,MAAA,IAAA,CAAK,GAAG,CAAA;AAAA,IACV;AACA,IAAA,MAAA,CAAO,MAAA,IAAU,CAAA;AAGjB,IAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AAC9B,IAAA,IAAI,MAAA,KAAW,UAAa,SAAA,CAAU,MAAA,CAAO,QAAQ,MAAA,CAAO,IAAI,CAAA,EAAG,OAAO,MAAA,CAAO,OAAA;AAEjF,IAAA,MAAM,IAAA,GAAO,QAAA,CAAS,MAAA,CAAO,MAAM,CAAA;AACnC,IAAA,MAAM,UAAU,MAAA,CAAO,KAAA,EAAM,CAAE,IAAA,CAAK,CAAC,IAAA,KAAS;AAC5C,MAAA,KAAA,CAAM,GAAA,EAAK,IAAA,EAAM,MAAA,CAAO,MAAA,EAAQ,IAAI,CAAA;AACpC,MAAA,OAAO,IAAA;AAAA,IACT,CAAC,CAAA;AACD,IAAA,MAAM,QAAgB,EAAE,OAAA,EAAS,MAAA,EAAQ,MAAA,CAAO,QAAQ,IAAA,EAAK;AAC7D,IAAA,OAAA,CAAQ,GAAA,CAAI,KAAK,KAAK,CAAA;AACtB,IAAA,MAAM,SAAS,MAAY;AACzB,MAAA,IAAI,QAAQ,GAAA,CAAI,GAAG,MAAM,KAAA,EAAO,OAAA,CAAQ,OAAO,GAAG,CAAA;AAAA,IACpD,CAAA;AACA,IAAA,OAAA,CAAQ,IAAA,CAAK,QAAQ,MAAM,CAAA;AAC3B,IAAA,OAAO,OAAA;AAAA,EACT,CAAA;AAIA,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,EAAA,IAAI,UAAA;AAEJ,EAAA,MAAM,QAAA,GAAW,CAAC,GAAA,KAAsB;AACtC,IAAA,KAAA,CAAM,IAAI,GAAG,CAAA;AACb,IAAA,IAAI,eAAe,MAAA,EAAW;AAC9B,IAAA,UAAA,GAAa,WAAW,MAAM;AAC5B,MAAA,UAAA,GAAa,MAAA;AACb,MAAA,MAAM,IAAA,GAAO,CAAC,GAAG,KAAK,CAAA;AACtB,MAAA,KAAA,CAAM,KAAA,EAAM;AACZ,MAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,EAAM,KAAK,OAAA,CAAQ,MAAM,KAAK,CAAA;AAAA,IACnD,GAAG,UAAU,CAAA;AACb,IAAA,KAAA,CAAM,UAAU,CAAA;AAAA,EAClB,CAAA;AAKA,EAAA,MAAM,GAAA,GAAM,CAAC,GAAA,EAAaA,OAAAA,KAAyB;AACjD,IAAA,IAAIA,OAAAA,CAAO,KAAA,KAAU,MAAA,EAAW,YAAA,CAAaA,QAAO,KAAK,CAAA;AACzD,IAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,EAAG;AAC7B,IAAAA,OAAAA,CAAO,QAAQ,UAAA,CAAW,MAAM,KAAK,OAAA,CAAQ,GAAA,EAAK,IAAI,CAAA,EAAG,KAAK,CAAA;AAC9D,IAAA,KAAA,CAAMA,QAAO,KAAK,CAAA;AAAA,EACpB,CAAA;AAEA,EAAA,MAAM,OAAA,GAAU,OAAO,GAAA,EAAa,MAAA,KAAmC;AACrE,IAAA,MAAMA,OAAAA,GAAS,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AAC9B,IAAA,IAAIA,YAAW,MAAA,EAAW;AAC1B,IAAAA,QAAO,MAAA,IAAU,CAAA;AACjB,IAAA,MAAM,SAASA,OAAAA,CAAO,MAAA;AACtB,IAAA,IAAI,MAAA,OAAa,GAAG,CAAA;AACpB,IAAA,IAAI,IAAA;AACJ,IAAA,IAAI;AACF,MAAA,IAAA,GAAO,MAAM,IAAA,CAAK,GAAA,EAAKA,OAAAA,CAAO,MAAM,CAAA;AAAA,IACtC,SAAS,GAAA,EAAK;AAEZ,MAAA,IAAA,CAAK,EAAE,IAAA,EAAM,YAAA,EAAc,OAAA,EAAS,GAAA,YAAe,KAAA,GAAQ,GAAA,CAAI,OAAA,GAAU,MAAA,CAAO,GAAG,CAAA,EAAG,CAAA;AACtF,MAAA,IAAI,QAAQ,GAAA,CAAI,GAAG,MAAMA,OAAAA,EAAQ,GAAA,CAAI,KAAKA,OAAM,CAAA;AAChD,MAAA;AAAA,IACF;AACA,IAAA,IAAI,QAAQ,GAAA,CAAI,GAAG,MAAMA,OAAAA,IAAU,MAAA,GAASA,QAAO,MAAA,EAAQ;AAC3D,IAAAA,QAAO,MAAA,GAAS,MAAA;AAChB,IAAA,MAAA,CAAO,SAAA,IAAa,CAAA;AACpB,IAAA,GAAA,CAAI,KAAKA,OAAM,CAAA;AACf,IAAA,MAAM,WAAW,QAAA,CAAS,IAAA,CAAK,SAAA,CAAU,IAAI,KAAK,EAAE,CAAA;AACpD,IAAA,IAAI,QAAA,KAAaA,QAAO,QAAA,EAAU;AAClC,IAAAA,QAAO,QAAA,GAAW,QAAA;AAClB,IAAA,KAAA,MAAW,QAAA,IAAY,CAAC,GAAGA,OAAAA,CAAO,SAAS,CAAA,EAAG;AAC5C,MAAA,IAAI;AACF,QAAA,QAAA,CAAS,QAAQ,IAAI,CAAA;AAAA,MACvB,SAAS,GAAA,EAAK;AACZ,QAAA,IAAA,CAAK,EAAE,IAAA,EAAM,YAAA,EAAc,OAAA,EAAS,GAAA,YAAe,KAAA,GAAQ,GAAA,CAAI,OAAA,GAAU,MAAA,CAAO,GAAG,CAAA,EAAG,CAAA;AAAA,MACxF;AAAA,IACF;AAAA,EACF,CAAA;AAEA,EAAA,MAAM,QAAA,GAAW,CAAC,GAAA,EAAa,QAAA,KAAiC;AAC9D,IAAA,MAAMA,OAAAA,GAAS,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AAC9B,IAAA,IAAIA,YAAW,MAAA,EAAW;AAC1B,IAAAA,OAAAA,CAAO,SAAA,CAAU,MAAA,CAAO,QAAQ,CAAA;AAChC,IAAA,IAAIA,OAAAA,CAAO,SAAA,CAAU,IAAA,GAAO,CAAA,EAAG;AAC/B,IAAA,OAAA,CAAQ,OAAO,GAAG,CAAA;AAClB,IAAA,KAAA,CAAM,OAAO,GAAG,CAAA;AAChB,IAAA,IAAIA,OAAAA,CAAO,KAAA,KAAU,MAAA,EAAW,YAAA,CAAaA,QAAO,KAAK,CAAA;AACzD,IAAA,KAAA,MAAW,KAAA,IAASA,OAAAA,CAAO,MAAA,CAAO,MAAA,EAAQ;AACxC,MAAA,MAAM,IAAA,GAAO,cAAA,CAAe,GAAA,CAAI,KAAK,CAAA;AACrC,MAAA,IAAA,EAAM,OAAO,GAAG,CAAA;AAChB,MAAA,IAAI,SAAS,MAAA,IAAa,IAAA,CAAK,SAAS,CAAA,EAAG,cAAA,CAAe,OAAO,KAAK,CAAA;AAAA,IACxE;AAAA,EACF,CAAA;AAEA,EAAA,MAAM,SAAS,CAAC,GAAA,EAAa,MAAA,EAAoB,IAAA,EAAa,UAAwB,MAAA,KAA8B;AAClH,IAAA,IAAI,OAAO,OAAA,EAAS;AACpB,IAAA,IAAI,QAAA,GAAW,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AAC9B,IAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,MAAA,QAAA,GAAW,EAAE,MAAA,EAAQ,SAAA,kBAAW,IAAI,GAAA,IAAO,QAAA,EAAU,QAAA,CAAS,IAAA,CAAK,SAAA,CAAU,IAAI,CAAA,IAAK,EAAE,GAAG,MAAA,EAAQ,CAAA,EAAG,QAAQ,CAAA,EAAE;AAChH,MAAA,OAAA,CAAQ,GAAA,CAAI,KAAK,QAAQ,CAAA;AACzB,MAAA,KAAA,MAAW,KAAA,IAAS,OAAO,MAAA,EAAQ;AACjC,QAAA,IAAI,IAAA,GAAO,cAAA,CAAe,GAAA,CAAI,KAAK,CAAA;AACnC,QAAA,IAAI,SAAS,MAAA,EAAW;AACtB,UAAA,IAAA,uBAAW,GAAA,EAAI;AACf,UAAA,cAAA,CAAe,GAAA,CAAI,OAAO,IAAI,CAAA;AAAA,QAChC;AACA,QAAA,IAAA,CAAK,IAAI,GAAG,CAAA;AAAA,MACd;AACA,MAAA,GAAA,CAAI,KAAK,QAAQ,CAAA;AAAA,IACnB;AAKA,IAAA,QAAA,CAAS,SAAA,CAAU,IAAI,QAAQ,CAAA;AAC/B,IAAA,MAAA,CAAO,gBAAA,CAAiB,OAAA,EAAS,MAAM,QAAA,CAAS,GAAA,EAAK,QAAQ,CAAA,EAAG,EAAE,IAAA,EAAM,IAAA,EAAM,CAAA;AAAA,EAChF,CAAA;AAEA,EAAA,MAAM,UAAA,GAAa,CAAC,MAAA,KAAoC;AACtD,IAAA,KAAA,MAAW,KAAA,IAAS,QAAQ,QAAA,CAAS,GAAA,CAAI,OAAO,SAAA,CAAU,KAAK,IAAI,CAAC,CAAA;AACpE,IAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,MAAA,KAAA,MAAW,GAAA,IAAO,eAAe,GAAA,CAAI,KAAK,KAAK,EAAC,WAAY,GAAG,CAAA;AAAA,IACjE;AAAA,EACF,CAAA;AAEA,EAAA,MAAM,QAAQ,MAAqB;AACjC,IAAA,IAAI,SAAA,GAAY,CAAA;AAChB,IAAA,KAAA,MAAW,SAAS,OAAA,CAAQ,MAAA,EAAO,EAAG,SAAA,IAAa,MAAM,SAAA,CAAU,IAAA;AACnE,IAAA,OAAO,EAAE,OAAA,EAAS,MAAA,CAAO,IAAA,EAAM,KAAA,EAAO,SAAS,OAAA,CAAQ,IAAA,EAAM,SAAA,EAAW,GAAG,MAAA,EAAO;AAAA,EACpF,CAAA;AAEA,EAAA,MAAM,OAAO,MAAY;AACvB,IAAA,IAAI,UAAA,KAAe,MAAA,EAAW,YAAA,CAAa,UAAU,CAAA;AACrD,IAAA,UAAA,GAAa,MAAA;AACb,IAAA,KAAA,MAAW,KAAA,IAAS,OAAA,CAAQ,MAAA,EAAO,EAAG,IAAI,MAAM,KAAA,KAAU,MAAA,EAAW,YAAA,CAAa,KAAA,CAAM,KAAK,CAAA;AAAA,EAC/F,CAAA;AAEA,EAAA,OAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,UAAA,EAAY,OAAO,IAAA,EAAK;AACjD,CAAA;ACvSO,IAAM,gBAAA,GAAmB,CAAC,GAAA,EAAY,OAAA,KAA4C;AACvF,EAAA,MAAM,MAAA,GAAS,QAAQ,QAAQ,CAAA;AAC/B,EAAA,IAAI,OAAO,MAAA,KAAW,QAAA,IAAY,MAAA,KAAW,IAAI,OAAO,GAAA;AACxD,EAAA,MAAM,GAAA,GAAsB,OAAA,CAAQ,SAAS,CAAA,KAAM,SAAS,MAAA,GAAS,KAAA;AASrE,EAAA,MAAM,WAAA,GAAA,CAAe,GAAA,CAAI,IAAA,IAAQ,EAAC,EAAG,OAAO,CAAC,KAAA,KAAU,KAAA,CAAM,KAAA,KAAU,MAAM,CAAA;AAC7E,EAAA,OAAO,EAAE,GAAG,GAAA,EAAK,IAAA,EAAM,CAAC,EAAE,KAAA,EAAO,MAAA,EAAQ,GAAA,EAAI,EAAG,GAAG,WAAW,CAAA,EAAE;AAClE,CAAA;AAkBA,IAAM,yBAAA,GAA4B,CAAA;AAClC,IAAM,aAAA,GAAgB,GAAA;AACtB,IAAM,iBAAA,GAAoB,GAAA;AAC1B,IAAM,4BAAA,GAA+B,GAAA;AACrC,IAAM,4BAAA,GAA+B,GAAA;AACrC,IAAM,6BAAA,GAAgC,EAAA;AAM/B,IAAM,iBAAA,GAAoB,CAAC,YAAA,KAAiD;AACjF,EAAA,MAAM,EAAE,SAAS,KAAA,EAAO,WAAA,EAAa,aAAa,UAAA,EAAY,KAAA,EAAO,WAAU,GAAI,YAAA;AACnF,EAAA,MAAM,IAAA,GAAO,YAAA,CAAa,OAAA,KAAY,MAAM;AAAA,EAAC,CAAA,CAAA;AAC7C,EAAA,MAAM,eAAA,GAAkB,YAAA,CAAa,MAAA,EAAQ,eAAA,IAAmB,yBAAA;AAChE,EAAA,MAAM,YAAA,GAAe,YAAA,CAAa,MAAA,EAAQ,YAAA,IAAgB,aAAA;AAC1D,EAAA,MAAM,QAAA,GAAW,YAAA,CAAa,MAAA,EAAQ,QAAA,IAAY,iBAAA;AAClD,EAAA,MAAM,WAAA,GAAc,YAAA,CAAa,MAAA,EAAQ,WAAA,IAAe,KAAA;AACxD,EAAA,MAAM,uBAAA,GAA0B,YAAA,CAAa,MAAA,EAAQ,uBAAA,IAA2B,IAAA;AAChF,EAAA,MAAM,oBAAA,GAAuB,YAAA,CAAa,MAAA,EAAQ,oBAAA,IAAwB,IAAA;AAC1E,EAAA,MAAM,sBAAA,GAAyB,YAAA,CAAa,MAAA,EAAQ,sBAAA,IAA0B,KAAA;AAC9E,EAAA,MAAM,kBAAA,GAAqB,YAAA,CAAa,MAAA,EAAQ,kBAAA,IAAsB,4BAAA;AAEtE,EAAA,MAAM,cAAA,GAAiC;AAAA,IACrC,eAAA;AAAA,IACA,uBAAA;AAAA,IACA,oBAAA;AAAA,IACA;AAAA,GACF;AAIA,EAAA,MAAM,IAAA,GAAO,cAAA,CAAe,YAAA,CAAa,IAAA,EAAM,IAAI,CAAA;AAEnD,EAAA,IAAI,YAAA;AACJ,EAAA,IAAI,iBAAA;AACJ,EAAA,MAAM,KAAA,GAAsB,YAAA,CAAa,KAAA,IAAS,iBAAA,EAAkB;AAepE,EAAA,MAAM,YAAA,uBAAmB,GAAA,EAAyB;AAClD,EAAA,MAAM,mBAAA,GAAsB,YAAA,CAAa,MAAA,EAAQ,mBAAA,IAAuB,6BAAA;AAExE,EAAA,MAAM,WAAA,GAAc,CAAC,WAAA,EAAiC,SAAA,EAAmB,QAAA,KAA6B;AACpG,IAAA,IAAI,WAAA,KAAgB,MAAA,IAAa,SAAA,KAAc,EAAA,EAAI;AACnD,IAAA,IAAI,IAAA,GAAO,YAAA,CAAa,GAAA,CAAI,WAAW,CAAA;AACvC,IAAA,IAAI,SAAS,MAAA,EAAW;AACtB,MAAA,IAAA,uBAAW,GAAA,EAAY;AACvB,MAAA,YAAA,CAAa,GAAA,CAAI,aAAa,IAAI,CAAA;AAAA,IACpC;AACA,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,SAAS,CAAA,EAAG;AACzB,IAAA,IAAA,CAAK,IAAI,SAAS,CAAA;AAClB,IAAA,IAAI,IAAA,CAAK,OAAO,mBAAA,EAAqB;AACnC,MAAA,QAAA,CAAS,IAAA;AAAA,QACP,IAAI,WAAW,CAAA,mBAAA,EAAsB,IAAA,CAAK,IAAI,8CAA8C,mBAAmB,CAAA,oHAAA;AAAA,OACjH;AAAA,IACF;AAAA,EACF,CAAA;AAMA,EAAA,MAAM,QAAA,uBAAe,GAAA,EAA4B;AAIjD,EAAA,MAAM,aAAa,YAAqC;AACtD,IAAA,MAAM,OAAA,GAAU,YAAA,CAAa,MAAA,EAAQ,QAAA,KAAa,MAAA,GAC9C,EAAE,QAAA,EAAU,YAAA,CAAa,MAAA,CAAO,QAAA,EAAS,GACzC,MAAA;AACJ,IAAA,MAAM,MAAA,GAAS,MAAM,OAAA,CAAQ,UAAA,CAAW,OAAO,CAAA;AAG/C,IAAA,MAAM,SAAA,GAAY,YAAA,CAAa,MAAA,EAAQ,kBAAA,IAAsB,4BAAA;AAC7D,IAAA,IAAI,OAAA,CAAQ,UAAA,KAAe,MAAA,IAAc,MAAM,OAAA,CAAQ,WAAW,SAAS,CAAA,KAAO,YAAA,IAAgB,SAAA,GAAY,CAAA,EAAG;AAC/G,MAAA,OAAA,CAAQ,IAAA,CAAK,CAAA,6EAAA,EAAgF,SAAS,CAAA,2DAAA,CAA6D,CAAA;AAAA,IACrK;AAIA,IAAA,IAAI,cAAc,MAAA,EAAW;AAC3B,MAAA,MAAM,OAAA,GAAU,eAAA,CAAgB,SAAS,CAAA,CAAE,MAAA,CAAO,CAAC,EAAE,MAAA,EAAQ,KAAA,EAAM,KAAM,CAAC,MAAA,CAAO,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAA,IAAU,CAAA,CAAE,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,KAAK,CAAC,CAAC,CAAA;AAClK,MAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtB,QAAA,MAAM,IAAI,QAAA,CAAS,iBAAA,EAAmB,0DAA0D,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAG,EAAE,MAAM,CAAA,CAAA,EAAI,EAAE,KAAK,CAAA,CAAE,EAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,MAC5J;AAAA,IACF;AACA,IAAA,YAAA,GAAe,MAAA;AACf,IAAA,iBAAA,GAAoB,yBAAyB,MAAM,CAAA;AACnD,IAAA,OAAO,MAAA;AAAA,EACT,CAAA;AAIA,EAAA,MAAM,eAAe,MAAsB;AACzC,IAAA,IAAI,iBAAiB,MAAA,EAAW;AAC9B,MAAA,MAAM,IAAI,QAAA;AAAA,QACR,iBAAA;AAAA,QACA;AAAA,OACF;AAAA,IACF;AACA,IAAA,OAAO,YAAA;AAAA,EACT,CAAA;AAeA,EAAA,MAAM,WAAA,GAAc,CAAC,GAAA,EAAY,cAAA,EAA8B,SAAS,KAAA,KAA0B;AAChG,IAAA,MAAM,SAAS,YAAA,EAAa;AAE5B,IAAA,IAAI,YAAA,GAAe,GAAA;AACnB,IAAA,IAAI,WAAA;AACJ,IAAA,IAAI,YAAA,CAAa,UAAU,MAAA,EAAW;AACpC,MAAA,YAAA,GAAe,EAAE,GAAG,YAAA,EAAc,KAAA,EAAO,YAAA,EAAa;AACtD,MAAA,WAAA,GAAc,YAAA;AAAA,IAChB,WAAW,YAAA,CAAa,KAAA,GAAQ,QAAA,KAAa,WAAA,IAAe,CAAC,MAAA,CAAA,EAAS;AACpE,MAAA,YAAA,GAAe,EAAE,GAAG,YAAA,EAAc,KAAA,EAAO,QAAA,EAAS;AAClD,MAAA,WAAA,GAAc,QAAA;AAAA,IAChB;AAGA,IAAA,MAAM,QAAA,GAAW,iBAAiB,YAAY,CAAA;AAU9C,IAAA,MAAM,eAAe,cAAA,IAAkB,WAAA;AACvC,IAAA,IAAI,YAAA,KAAiB,MAAA,EAAW,UAAA,CAAW,QAAA,EAAU,YAAY,CAAA;AAGjE,IAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,YAAA,EAAc,MAAM,CAAA;AAC7C,IAAA,IAAI,YAAA,KAAiB,MAAA,EAAW,aAAA,CAAc,QAAA,EAAU,YAAY,CAAA;AAGpE,IAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,QAAA,EAAU,cAAc,CAAA;AACjD,IAAA,IAAI,QAAA,CAAS,MAAA,CAAO,MAAA,GAAS,CAAA,EAAG;AAC9B,MAAA,MAAM,IAAI,QAAA;AAAA,QACR,aAAA;AAAA,QACA,CAAA,iBAAA,EAAoB,QAAA,CAAS,MAAA,CAAO,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA;AAAA,QAC9C,EAAE,MAAA,EAAQ,QAAA,CAAS,MAAA,EAAQ,QAAA,EAAU,SAAS,QAAA;AAAS,OACzD;AAAA,IACF;AAGA,IAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,OAAA,CAAQ,QAAQ,CAAA;AAEzC,IAAA,OAAO,EAAE,QAAA,EAAU,QAAA,EAAU,QAAA,CAAS,QAAA,EAAU,GAAI,WAAA,KAAgB,MAAA,GAAY,EAAE,WAAA,EAAY,GAAI,EAAC,EAAG;AAAA,EACxG,CAAA;AAYA,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAEhC,EAAA,MAAM,UAAU,CAAC,WAAA,EAAiC,MAAA,EAA4B,QAAA,EAAkB,OAAgB,WAAA,KAAwD;AACtK,IAAA,IAAI,WAAA,KAAgB,MAAA,IAAa,QAAA,KAAa,WAAA,EAAa,OAAO,MAAA;AAClE,IAAA,IAAI,UAAU,MAAA,IAAa,CAAC,MAAM,OAAA,CAAQ,KAAK,GAAG,OAAO,MAAA;AACzD,IAAA,MAAM,IAAA,GACJ,MAAA,KAAW,MAAA,GACP,CAAA,uEAAA,EAA0E,WAAW,CAAA,cAAA,EAAiB,WAAW,CAAA,+DAAA,CAAA,GACjH,CAAA,oBAAA,EAAuB,MAAM,CAAA,gCAAA,EAAmC,WAAW,iBAAiB,WAAW,CAAA,8EAAA,CAAA;AAC7G,IAAA,IAAI,gBAAgB,MAAA,IAAa,CAAC,OAAA,CAAQ,GAAA,CAAI,WAAW,CAAA,EAAG;AAC1D,MAAA,OAAA,CAAQ,IAAI,WAAW,CAAA;AACvB,MAAA,OAAA,CAAQ,IAAA,CAAK,CAAA,OAAA,EAAU,WAAW,CAAA,GAAA,EAAM,IAAI,CAAA,CAAE,CAAA;AAAA,IAChD;AACA,IAAA,OAAO,IAAA;AAAA,EACT,CAAA;AAQA,EAAA,MAAMC,QAAAA,GAAU,CAAC,GAAA,KACf,WAAA,CAAY,cAAc,GAAA,EAAK,KAAK,CAAC,CAAA,CAAE,QAAA;AAIzC,EAAA,MAAM,IAAA,GAAO,OAAO,GAAA,EAAY,WAAA,KAAmD;AACjF,IAAA,IAAI;AAEF,MAAA,MAAM,OAAA,GAAiB,EAAE,GAAG,aAAA,CAAc,KAAK,KAAK,CAAA,EAAG,OAAO,CAAA,EAAE;AAChE,MAAA,MAAM,EAAE,QAAA,EAAU,QAAA,EAAS,GAAI,YAAY,OAAO,CAAA;AAGlD,MAAA,MAAM,gBAAA,GAAmB,sBAAA,CAAuB,QAAA,CAAS,eAAe,CAAA;AAGxE,MAAA,MAAM,KAAA,GAAqB,eAAe,EAAC;AAC3C,MAAA,YAAA,CAAa,UAAU,KAAK,CAAA;AAE5B,MAAA,MAAM,OAAO,MAAM,YAAA,CAAa,UAAU,gBAAA,EAAkB,KAAA,EAAO,SAAS,KAAK,CAAA;AAEjF,MAAA,OAAO,EAAE,IAAA,EAAM,QAAA,EAAU,MAAA,EAAQ,EAAC,EAAE;AAAA,IACtC,SAAS,GAAA,EAAK;AACZ,MAAA,MAAM,UAAU,GAAA,YAAe,KAAA,GAAQ,GAAA,CAAI,OAAA,GAAU,OAAO,GAAG,CAAA;AAC/D,MAAA,OAAO,EAAE,IAAA,EAAM,EAAC,EAAG,QAAA,EAAU,EAAC,EAAG,MAAA,EAAQ,CAAC,OAAO,CAAA,EAAE;AAAA,IACrD;AAAA,EACF,CAAA;AA6BA,EAAA,MAAM,YAAA,GAAe,CAAC,KAAA,EAAmB,GAAA,KAAyB;AAChE,IAAA,IAAI,YAAA,CAAa,KAAA,EAAO,iBAAiB,CAAA,EAAG,OAAO,IAAA;AACnD,IAAA,KAAK,KAAA,CAAM,OAAO,GAAG,CAAA;AACrB,IAAA,OAAO,KAAA;AAAA,EACT,CAAA;AAKA,EAAA,MAAM,KAAA,GAAQ,CAAC,GAAA,EAAa,KAAA,KAA4B;AACtD,IAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,IAAA,IAAI,UAAA,CAAW,KAAA,EAAO,GAAG,CAAA,gBAAiB,KAAA,CAAM,GAAA,CAAI,GAAA,EAAK,EAAE,GAAG,KAAA,EAAO,UAAA,EAAY,GAAA,EAAK,CAAC,CAAA;AAAA,EACzF,CAAA;AAEA,EAAA,MAAM,kBAAA,GAAqB,OACzB,YAAA,EACA,UAAA,EACA,WAAA,KACwB;AACxB,IAAA,MAAM,KAAK,YAAA,CAAa,WAAA;AACxB,IAAA,IAAI,OAAO,MAAA,EAAW;AAEpB,MAAA,OAAO,EAAE,WAAA,EAAa,eAAA,IAAmB,GAAA,EAAK,KAAA,EAAO,UAAU,KAAA,EAAM;AAAA,IACvE;AAEA,IAAA,MAAM,KAAA,GAAQ,MAAM,KAAA,CAAM,GAAA,CAAI,EAAE,CAAA;AAChC,IAAA,IAAI,KAAA,EAAO,SAAS,UAAA,EAAY;AAC9B,MAAA,MAAM,IAAI,QAAA;AAAA,QACR,iBAAA;AAAA,QACA,gBAAgB,EAAE,CAAA,qGAAA;AAAA,OACpB;AAAA,IACF;AACA,IAAA,IAAI,OAAO,IAAA,KAAS,IAAA,IAAQ,YAAA,CAAa,KAAA,EAAO,EAAE,CAAA,EAAG;AACnD,MAAA,IAAI,CAAC,UAAA,IAAc,KAAA,CAAM,WAAA,KAAgB,WAAA,EAAa;AACpD,QAAA,KAAA,CAAM,IAAI,KAAK,CAAA;AACf,QAAA,OAAO;AAAA,UACL,WAAA,EAAa,EAAA;AAAA,UACb,KAAK,KAAA,CAAM,GAAA;AAAA,UACX,GAAI,MAAM,OAAA,KAAY,MAAA,GAAY,EAAE,QAAA,EAAU,KAAA,CAAM,OAAA,EAAQ,GAAI,EAAC;AAAA,UACjE,GAAI,MAAM,MAAA,KAAW,MAAA,GAAY,EAAE,MAAA,EAAQ,KAAA,CAAM,MAAA,EAAO,GAAI,EAAC;AAAA,UAC7D,GAAI,MAAM,KAAA,KAAU,MAAA,GAAY,EAAE,KAAA,EAAO,KAAA,CAAM,KAAA,EAAM,GAAI,EAAC;AAAA,UAC1D,GAAI,MAAM,OAAA,KAAY,MAAA,GAAY,EAAE,OAAA,EAAS,KAAA,CAAM,OAAA,EAAQ,GAAI,EAAC;AAAA,UAChE,MAAA,EAAQ,KAAA,CAAM,SAAA,KAAc,IAAA,IAAQ,MAAM,WAAA,KAAgB,MAAA;AAAA,UAC1D,GAAA,EAAK,IAAA;AAAA,UACL,QAAA,EAAU;AAAA,SACZ;AAAA,MACF;AACA,MAAA,IAAI,KAAA,CAAM,cAAc,IAAA,EAAM;AAC5B,QAAA,MAAM,IAAI,QAAA;AAAA,UACR,uBAAA;AAAA,UACA,gBAAgB,EAAE,CAAA,0HAAA;AAAA,SACpB;AAAA,MACF;AAEA,MAAA,OAAO,EAAE,WAAA,EAAa,EAAA,EAAI,GAAA,EAAK,KAAA,EAAO,UAAU,IAAA,EAAK;AAAA,IACvD;AAEA,IAAA,IAAI,CAAC,UAAA,EAAY;AACf,MAAA,MAAM,IAAI,QAAA,CAAS,YAAA,EAAc,CAAA,qBAAA,EAAwB,EAAE,CAAA,gDAAA,CAA6C,CAAA;AAAA,IAC1G;AACA,IAAA,OAAO,EAAE,WAAA,EAAa,EAAA,EAAI,GAAA,EAAK,KAAA,EAAO,UAAU,KAAA,EAAM;AAAA,EACxD,CAAA;AAUA,EAAA,MAAM,QAAA,GAAW,CAAC,MAAA,EAAiC,KAAA,EAAoB,MAAA,MAAiD;AAAA,IACtH,UAAU,aAAA,CAAc,SAAA,IAAa,EAAC,EAAG,QAAQ,KAAK,CAAA;AAAA,IACtD,IAAA,EAAM,OAAO,GAAA,KAAQ;AACnB,MAAA,MAAM,EAAE,UAAU,QAAA,EAAS,GAAI,YAAY,aAAA,CAAc,GAAA,EAAK,KAAK,CAAA,EAAG,MAAM,CAAA;AAC5E,MAAA,YAAA,CAAa,UAAU,KAAK,CAAA;AAC5B,MAAA,IAAI,QAAA,CAAS,WAAW,IAAA,CAAK,CAAC,SAAS,IAAA,CAAK,IAAA,KAAS,UAAU,CAAA,EAAG;AAChE,QAAA,OAAO,EAAE,IAAA,EAAM,EAAC,EAAG,GAAA,EAAK,QAAA,CAAS,GAAA,EAAK,QAAA,EAAU,CAAC,GAAG,QAAA,EAAU,gFAA2E,CAAA,EAAE;AAAA,MAC7I;AAMA,MAAA,MAAM,MAAA,GAAS,QAAA,CAAS,UAAA,CAAW,GAAA,CAAI,CAAC,IAAA,KAAU,IAAA,CAAK,IAAA,KAAS,OAAA,GAAU,KAAA,CAAM,IAAA,CAAK,GAAG,IAAI,IAAK,CAAA;AACjG,MAAA,OAAO,EAAE,IAAA,EAAM,MAAM,OAAA,CAAQ,OAAA,CAAQ,QAAA,EAAU,MAAM,CAAA,EAAG,GAAA,EAAK,QAAA,CAAS,GAAA,EAAK,QAAA,EAAS;AAAA,IACtF;AAAA,GACF,CAAA;AAEA,EAAA,MAAM,qBAAqB,OACzB,YAAA,EACA,WACA,MAAA,EACA,QAAA,EACA,QACA,KAAA,KACmB;AACnB,IAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,MAAA,MAAM,IAAI,QAAA,CAAS,cAAA,EAAgB,kEAAkE,CAAA;AAAA,IACvG;AAEA,IAAA,MAAM,aAAa,YAAA,EAAa;AAChC,IAAA,MAAM,WAAA,GAAc;AAAA,MAClB,GAAG,UAAA;AAAA,MACH,QAAA,EAAU,WAAW,QAAA,CAAS,MAAA;AAAA,QAC5B,CAAC,CAAA,KAAA,CAAO,QAAA,KAAa,MAAA,IAAa,SAAS,QAAA,CAAS,CAAA,CAAE,IAAI,CAAA,MAAO,MAAA,KAAW,MAAA,IAAa,YAAA,CAAa,MAAA,EAAQ,EAAE,IAAI,CAAA;AAAA;AACtH,KACF;AAEA,IAAA,MAAM,WAAW,YAA4B;AAC3C,MAAA,IAAI;AACF,QAAA,OAAO,MAAM,WAAA,CAAY,YAAA,EAAc,WAAA,EAAa,SAAS,MAAA,EAAQ,KAAA,EAAO,WAAA,CAAY,QAAA,CAAS,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAC,CAAA;AAAA,MACtH,SAAS,GAAA,EAAK;AAGZ,QAAA,IAAI,UAAA,CAAW,GAAG,CAAA,IAAK,GAAA,CAAI,SAAS,eAAA,EAAiB;AACnD,UAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,UAAA,MAAM,KAAA,CAAM,IAAI,MAAA,EAAQ;AAAA,YACtB,IAAA,EAAM,eAAA;AAAA,YACN,QAAQ,GAAA,CAAI,OAAA;AAAA,YACZ,SAAA,EAAW,GAAA;AAAA,YACX,WAAW,GAAA,GAAM,kBAAA;AAAA,YACjB,GAAI,aAAa,MAAA,KAAW,MAAA,GAAY,EAAE,MAAA,EAAQ,YAAA,CAAa,MAAA,EAAO,GAAI,EAAC;AAAA,YAC3E,OAAO,YAAA,CAAa,KAAA;AAAA,YACpB,GAAI,iBAAA,KAAsB,MAAA,GAAY,EAAE,iBAAA,EAAmB,iBAAA,KAAsB;AAAC,WACnF,CAAA;AAAA,QACH;AACA,QAAA,MAAM,GAAA;AAAA,MACR;AAAA,IACF,CAAA;AAQA,IAAA,MAAM,QAAA,GAAW,QAAA,CAAS,GAAA,CAAI,SAAS,CAAA;AACvC,IAAA,IAAI,QAAA,KAAa,QAAW,OAAO,QAAA;AAEnC,IAAA,MAAM,aAAa,QAAA,EAAS;AAC5B,IAAA,QAAA,CAAS,GAAA,CAAI,WAAW,UAAU,CAAA;AAClC,IAAA,IAAI;AACF,MAAA,OAAO,MAAM,UAAA;AAAA,IACf,CAAA,SAAE;AACA,MAAA,QAAA,CAAS,OAAO,SAAS,CAAA;AAAA,IAC3B;AAAA,EACF,CAAA;AA4BA,EAAA,MAAM,UAAU,CACd,IAAA,EACA,KAAA,EACA,EAAA,EACA,SACA,KAAA,KACc;AACd,IAAA,MAAM,MAAA,GAAS,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA;AACnC,IAAA,MAAM,MAAA,GAAS;AAAA,MACb,MAAA,EAAQ,MAAA,GAAU,IAAA,CAAK,CAAC,KAAK,IAAA,GAAQ,IAAA;AAAA,MACrC,OAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,OAAOC,OAAA,CAAa,IAAI,MAAM,CAAA;AAAA,EAChC,CAAA;AAEA,EAAA,MAAM,gBAAgB,OACpB,QAAA,EACA,YAAA,EACA,QAAA,EACA,SACA,KAAA,KACuB;AACvB,IAAA,MAAM,SAAA,GAAY,KAAK,GAAA,EAAI;AAC3B,IAAA,MAAM,OAAO,MAAM,YAAA,CAAa,UAAU,OAAA,EAAS,KAAA,EAAO,SAAS,KAAK,CAAA;AACxE,IAAA,MAAM,WAAA,GAAc,IAAA,CAAK,GAAA,EAAI,GAAI,SAAA;AACjC,IAAA,IAAA,CAAK,EAAE,IAAA,EAAM,YAAA,EAAc,OAAO,IAAA,CAAK,MAAA,EAAQ,aAAa,CAAA;AAG5D,IAAA,IAAI,MAAA,GAAoB,IAAA;AACxB,IAAA,IAAI,SAAA;AACJ,IAAA,IAAI,QAAA,GAAmC,QAAA;AAEvC,IAAA,IAAI,YAAA,CAAa,UAAU,MAAA,EAAW;AACpC,MAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,QAAA,MAAM,QAAA,GAAW,KAAK,GAAA,EAAI;AAC1B,QAAA,MAAA,GAAS,QAAQ,IAAA,EAAM,YAAA,CAAa,KAAA,EAAO,QAAA,EAAU,SAAS,KAAK,CAAA;AACnE,QAAA,SAAA,GAAY,IAAA,CAAK,KAAI,GAAI,QAAA;AAAA,MAC3B,CAAA,MAAA,IAAW,eAAe,MAAA,EAAW;AACnC,QAAA,MAAM,QAAA,GAAW,KAAK,GAAA,EAAI;AAC1B,QAAA,MAAM,MAAA,GAAS,MAAM,UAAA,CAAW,IAAA,EAAM,aAAa,KAAK,CAAA;AACxD,QAAA,SAAA,GAAY,IAAA,CAAK,KAAI,GAAI,QAAA;AACzB,QAAA,MAAA,GAAS,MAAA,CAAO,WAAA;AAChB,QAAA,QAAA,GAAW,MAAA,CAAO,EAAA;AAAA,MACpB;AACA,MAAA,IAAI,cAAc,MAAA,EAAW,IAAA,CAAK,EAAE,IAAA,EAAM,cAAA,EAAgB,WAAW,CAAA;AAAA,IACvE;AAEA,IAAA,OAAO,EAAE,MAAA,EAAQ,QAAA,EAAU,KAAK,MAAA,EAAQ,WAAA,EAAa,WAAW,QAAA,EAAS;AAAA,EAC3E,CAAA;AAIA,EAAA,MAAMC,SAAA,GAAU,OACd,OAAA,EACA,OAAA,KAC2B;AAC3B,IAAA,IAAI,YAAA,CAAa,OAAO,CAAA,EAAG,MAAM,IAAI,SAAS,iBAAA,EAAmB,CAAA,iBAAA,EAAoB,YAAA,EAAc,CAAA,CAAE,CAAA;AACrG,IAAA,MAAM,MAAA,GAAS,kBAAA,CAAmB,SAAA,CAAU,OAAO,CAAA;AACnD,IAAA,IAAI,CAAC,OAAO,OAAA,EAAS;AACnB,MAAA,MAAM,IAAI,QAAA,CAAS,iBAAA,EAAmB,oBAAoB,MAAA,CAAO,KAAA,CAAM,OAAO,CAAA,CAAE,CAAA;AAAA,IAClF;AAEA,IAAA,MAAM,eAAe,MAAA,CAAO,IAAA;AAC5B,IAAA,MAAM,KAAA,GAAqB,OAAA,EAAS,KAAA,IAAS,EAAC;AAC9C,IAAA,MAAM,YAAA,GAAe,SAAS,WAAA,IAAe,WAAA;AAC7C,IAAA,MAAM,EAAA,GAAK,KAAK,GAAA,EAAI;AAEpB,IAAA,MAAM,UAAA,GAAa,YAAA,CAAa,KAAA,KAAU,MAAA,IAAa,aAAa,KAAA,KAAU,IAAA;AAC9E,IAAA,IAAI,YAAA,CAAa,WAAA,KAAgB,MAAA,IAAa,CAAC,UAAA,EAAY;AACzD,MAAA,MAAM,IAAI,QAAA,CAAS,iBAAA,EAAmB,uFAAkF,CAAA;AAAA,IAC1H;AACA,IAAA,MAAM,WAAA,GAAc,UAAA,GAAa,kBAAA,CAAmB,YAAY,CAAA,GAAI,MAAA;AACpE,IAAA,MAAM,SAAA,GAAY,gBAAgB,MAAA,GAAY,CAAA,EAAG,WAAW,CAAA,CAAA,EAAI,gBAAA,CAAiB,YAAY,CAAC,CAAA,CAAA,GAAK,MAAA;AACnG,IAAA,MAAM,MAAA,GAAS,SAAA,KAAc,MAAA,GAAY,CAAA,IAAA,EAAO,SAAS,CAAA,CAAA,GAAK,MAAA;AAC9D,IAAA,IAAA,CAAK;AAAA,MACH,IAAA,EAAM,aAAA;AAAA,MACN,QAAQ,YAAA,CAAa,MAAA;AAAA,MACrB,OAAO,YAAA,CAAa,KAAA;AAAA,MACpB,aAAa,YAAA,CAAa,WAAA;AAAA,MAC1B,UAAU,OAAA,EAAS;AAAA,KACpB,CAAA;AAGD,IAAA,MAAM,MAAA,GAAS,MAAM,kBAAA,CAAmB,YAAA,EAAc,YAAY,WAAW,CAAA;AAC7E,IAAA,IAAA,CAAK,EAAE,IAAA,EAAM,aAAA,EAAe,GAAA,EAAK,MAAA,CAAO,GAAA,EAAK,WAAA,EAAa,MAAA,CAAO,WAAA,EAAa,QAAA,EAAU,MAAA,CAAO,QAAA,EAAU,CAAA;AAGzG,IAAA,IAAI,MAAM,MAAA,CAAO,GAAA;AACjB,IAAA,IAAI,OAAA;AACJ,IAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,MAAA,IAAI,OAAA,EAAS,WAAW,IAAA,EAAM;AAC5B,QAAA,MAAM,IAAI,QAAA,CAAS,QAAA,EAAU,2FAAsF,CAAA;AAAA,MACrH;AACA,MAAA,IAAI,SAAA,KAAc,MAAA,IAAa,MAAA,KAAW,MAAA,EAAW;AACnD,QAAA,MAAM,IAAI,QAAA,CAAS,iBAAA,EAAmB,kCAAkC,CAAA;AAAA,MAC1E;AACA,MAAA,MAAM,QAAA,GAAW,MAAM,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AACvC,MAAA,IAAI,UAAU,IAAA,KAAS,eAAA,IAAmB,YAAA,CAAa,QAAA,EAAU,MAAM,CAAA,EAAG;AACxE,QAAA,IAAA,CAAK,EAAE,MAAM,aAAA,EAAe,IAAA,EAAM,iBAAiB,OAAA,EAAS,QAAA,CAAS,QAAQ,CAAA;AAC7E,QAAA,MAAM,IAAI,QAAA,CAAS,eAAA,EAAiB,QAAA,CAAS,MAAM,CAAA;AAAA,MACrD;AACA,MAAA,MAAM,UAAA,GAAa,KAAK,GAAA,EAAI;AAC5B,MAAA,GAAA,GAAM,MAAM,mBAAmB,YAAA,EAAc,SAAA,EAAW,QAAQ,OAAA,EAAS,QAAA,EAAU,cAAc,KAAK,CAAA;AACtG,MAAA,OAAA,GAAU,IAAA,CAAK,KAAI,GAAI,UAAA;AACvB,MAAA,IAAA,CAAK,EAAE,IAAA,EAAM,WAAA,EAAa,GAAA,EAAK,SAAS,CAAA;AAAA,IAC1C;AAQA,IAAA,MAAM,QAAA,GAAW,UAAA,CAAW,YAAA,CAAa,OAAO,CAAA;AAChD,IAAA,MAAM,SAAS,aAAA,CAAc,gBAAA,CAAiB,KAAK,YAAA,CAAa,OAAO,GAAG,QAAQ,CAAA;AAClF,IAAA,MAAM,EAAE,QAAA,EAAU,QAAA,EAAU,WAAA,EAAY,GAAI,YAAY,MAAA,EAAQ,YAAA,EAAc,MAAA,CAAO,MAAA,KAAW,IAAI,CAAA;AACpG,IAAA,WAAA,CAAY,OAAO,WAAA,EAAa,iBAAA,CAAkB,GAAA,EAAK,QAAQ,GAAG,QAAQ,CAAA;AAC1E,IAAA,IAAA,CAAK,EAAE,IAAA,EAAM,WAAA,EAAa,KAAK,QAAA,CAAS,GAAA,EAAK,UAAU,CAAA;AAIvD,IAAA,YAAA,CAAa,UAAU,KAAK,CAAA;AAC5B,IAAA,MAAM,UAAU,YAAA,CAAa,OAAA;AAC7B,IAAA,MAAM,WAAA,GAAc,kBAAA,CAAmB,QAAA,EAAU,OAAO,CAAA;AAExD,IAAA,IAAI,WAAA,CAAY,SAAS,CAAA,EAAG;AAC1B,MAAA,OAAO;AAAA,QACL,QAAQ,EAAC;AAAA,QACT,IAAA,EAAM;AAAA,UACJ,KAAA,EAAO;AAAA,YACL,KAAK,MAAA,CAAO,GAAA;AAAA,YACZ,aAAa,MAAA,CAAO,WAAA;AAAA,YACpB,MAAA,EAAQ,MAAA,CAAO,MAAA,IAAU,YAAA,CAAa,MAAA;AAAA,YACtC,GAAI,MAAA,CAAO,QAAA,GAAW,EAAE,QAAA,EAAU,IAAA,KAAS;AAAC,WAC9C;AAAA,UACA,OAAA,EAAS,oBAAA,CAAqB,QAAA,EAAU,cAAA,CAAe,GAAG,CAAC,CAAA;AAAA,UAC3D,QAAA,EAAU,QAAA,CAAS,MAAA,GAAS,CAAA,GAAI,QAAA,GAAW,MAAA;AAAA,UAC3C,cAAA,EAAgB;AAAA;AAClB,OACF;AAAA,IACF;AAIA,IAAA,MAAM,gBAAA,GAAmB,aAAa,YAAA,GAAe,EAAE,GAAG,YAAA,EAAc,KAAA,EAAO,OAAO,KAAA,EAAM;AAM5F,IAAA,MAAM,aAAa,MAAA,CAAO,QAAA;AAC1B,IAAA,IAAI,MAAA,CAAO,OAAO,MAAA,CAAO,OAAA,KAAY,eAAe,gBAAA,CAAiB,KAAA,KAAU,MAAA,IAAa,UAAA,KAAe,MAAA,CAAA,EAAY;AACrH,MAAA,MAAM,QAAQ,gBAAA,CAAiB,KAAA;AAC/B,MAAA,MAAM,SAAA,GAAY,CAACC,KAAAA,KACjB,KAAA,KAAU,MAAA,IAAa,UAAA,KAAe,MAAA,GAAaA,KAAAA,GAAgC,OAAA,CAAQA,KAAAA,EAAM,KAAA,EAAO,UAAA,EAAY,SAAS,KAAK,CAAA;AACpI,MAAA,MAAM,SAAS,MAAM,aAAA,CAAc,SAAS,UAAA,EAAY,OAAA,EAAS,OAAO,KAAK,CAAA;AAG7E,MAAA,MAAM,MAAM,aAAA,CAAc,CAAC,QAAA,CAAS,GAAA,EAAK,MAAM,CAAC,CAAA;AAChD,MAAA,MAAM,MAAA,GAAqB,EAAE,MAAA,EAAQ,CAAC,GAAG,gBAAA,CAAiB,MAAM,CAAC,CAAA,EAAG,OAAO,MAAM,OAAA,CAAQ,OAAA,CAAQ,QAAA,EAAU,MAAM,CAAA,EAAE;AACnH,MAAA,MAAM,SAAA,GAAY,KAAK,GAAA,EAAI;AAC3B,MAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,IAAA,CAAK,KAAK,MAAM,CAAA;AACxC,MAAA,MAAMC,YAAAA,GAAc,IAAA,CAAK,GAAA,EAAI,GAAI,SAAA;AACjC,MAAA,IAAA,CAAK,EAAE,MAAM,YAAA,EAAc,KAAA,EAAO,KAAK,MAAA,EAAQ,WAAA,EAAAA,cAAa,CAAA;AAC5D,MAAA,MAAMC,OAAAA,GAAS,UAAU,IAAI,CAAA;AAG7B,MAAA,MAAM,MAAA,GAAS,CAACC,SAAAA,KAA4D;AAC1E,QAAA,MAAMC,IAAAA,GAAM,QAAQ,WAAA,EAAa,MAAA,CAAO,OAAOD,SAAAA,EAAU,KAAA,EAAO,aAAa,WAAW,CAAA;AACxF,QAAA,MAAME,QAAOD,IAAAA,KAAQ,MAAA,GAAY,WAAW,CAAC,GAAG,UAAUA,IAAG,CAAA;AAC7D,QAAA,OAAO;AAAA,UACL,KAAA,EAAO;AAAA,YACL,KAAK,MAAA,CAAO,GAAA;AAAA,YACZ,aAAa,MAAA,CAAO,WAAA;AAAA,YACpB,MAAA,EAAQ,MAAA,CAAO,MAAA,IAAU,YAAA,CAAa;AAAA,WACxC;AAAA,UACA,OAAA,EAAS,oBAAA,CAAqB,QAAA,EAAU,cAAA,CAAe,GAAG,CAAC,CAAA;AAAA,UAC3D,QAAA,EAAUC,KAAAA,CAAK,MAAA,GAAS,CAAA,GAAIA,KAAAA,GAAO;AAAA,SACrC;AAAA,MACF,CAAA;AACA,MAAA,MAAM,EAAE,MAAA,EAAQ,QAAA,EAAS,GAAI,WAAW,EAAC;AACzC,MAAA,IAAI,MAAA,KAAW,MAAA,IAAa,QAAA,KAAa,MAAA,EAAW;AAClD,QAAA,IAAI,QAAA,GAAW,cAAcH,OAAM,CAAA;AACnC,QAAA,IAAA,CAAK,MAAA,CAAO,GAAA,EAAK,MAAA,EAAQ,IAAA,EAAM;AAAA,UAC7B,OAAA,EAAS,CAAC,IAAA,KAAS;AACjB,YAAA,MAAM,UAAA,GAAa,UAAU,IAAI,CAAA;AACjC,YAAA,MAAM,QAAA,GAAW,cAAc,UAAU,CAAA;AACzC,YAAA,IAAI,aAAa,QAAA,EAAU;AAC3B,YAAA,QAAA,GAAW,QAAA;AACX,YAAA,QAAA,CAAS,EAAE,QAAQ,UAAA,EAAY,IAAA,EAAM,OAAO,IAAA,CAAK,MAAM,GAAG,CAAA;AAAA,UAC5D;AAAA,WACC,MAAM,CAAA;AAAA,MACX;AACA,MAAA,IAAA,CAAK,EAAE,MAAM,YAAA,EAAc,OAAA,EAAS,KAAK,GAAA,EAAI,GAAI,IAAI,CAAA;AACrD,MAAA,OAAO,EAAE,MAAA,EAAAA,OAAAA,EAAQ,IAAA,EAAM,EAAE,GAAG,MAAA,CAAO,IAAA,CAAK,MAAM,GAAG,MAAA,EAAQ,EAAE,WAAA,EAAAD,YAAAA,IAAc,EAAE;AAAA,IAC7E;AACA,IAAA,MAAM,EAAE,MAAA,EAAQ,QAAA,EAAU,aAAa,SAAA,EAAW,QAAA,KAAa,MAAM,aAAA;AAAA,MACnE,QAAA;AAAA,MAAU,gBAAA;AAAA,MAAkB,MAAA,CAAO,QAAA;AAAA,MAAU,OAAA;AAAA,MAAS;AAAA,KACxD;AACA,IAAA,MAAM,GAAA,GAAM,QAAQ,WAAA,EAAa,MAAA,CAAO,OAAO,QAAA,EAAU,gBAAA,CAAiB,KAAA,EAAO,YAAA,CAAa,WAAW,CAAA;AACzG,IAAA,MAAM,OAAO,GAAA,KAAQ,MAAA,GAAY,WAAW,CAAC,GAAG,UAAU,GAAG,CAAA;AAI7D,IAAA,IAAI,CAAC,OAAO,GAAA,EAAK;AACf,MAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,MAAA,MAAM,KAAA,GAAsB;AAAA,QAC1B,IAAA,EAAM,IAAA;AAAA,QACN,GAAA;AAAA,QACA,GAAI,QAAA,KAAa,MAAA,GAAY,EAAE,OAAA,EAAS,QAAA,KAAa,EAAC;AAAA,QACtD,SAAA,EAAW,GAAA;AAAA,QACX,UAAA,EAAY,GAAA;AAAA,QACZ,GAAI,WAAA,KAAgB,MAAA,GAAY,EAAE,WAAA,KAAgB,EAAC;AAAA,QACnD,GAAI,aAAa,MAAA,KAAW,MAAA,GAAY,EAAE,MAAA,EAAQ,YAAA,CAAa,MAAA,EAAO,GAAI,EAAC;AAAA,QAC3E,OAAO,YAAA,CAAa,KAAA;AAAA,QACpB,GAAI,iBAAA,KAAsB,MAAA,GAAY,EAAE,iBAAA,EAAmB,iBAAA,KAAsB;AAAC,OACpF;AACA,MAAA,MAAM,KAAA,CAAM,GAAA,CAAI,MAAA,CAAO,WAAA,EAAa,KAAK,CAAA;AAAA,IAC3C;AAEA,IAAA,IAAA,CAAK,EAAE,MAAM,YAAA,EAAc,OAAA,EAAS,KAAK,GAAA,EAAI,GAAI,IAAI,CAAA;AAErD,IAAA,OAAO;AAAA,MACL,MAAA;AAAA,MACA,IAAA,EAAM;AAAA,QACJ,KAAA,EAAO;AAAA,UACL,KAAK,MAAA,CAAO,GAAA;AAAA,UACZ,aAAa,MAAA,CAAO,WAAA;AAAA,UACpB,MAAA,EAAQ,MAAA,CAAO,MAAA,IAAU,YAAA,CAAa,MAAA;AAAA,UACtC,GAAI,MAAA,CAAO,QAAA,GAAW,EAAE,QAAA,EAAU,IAAA,KAAS;AAAC,SAC9C;AAAA,QACA,OAAA,EAAS,oBAAA,CAAqB,QAAA,EAAU,cAAA,CAAe,GAAG,CAAC,CAAA;AAAA,QAC3D,MAAA,EAAQ;AAAA,UACN,GAAI,OAAA,KAAY,MAAA,GAAY,EAAE,OAAA,KAAY,EAAC;AAAA,UAC3C,WAAA;AAAA,UACA,GAAI,SAAA,KAAc,MAAA,GAAY,EAAE,SAAA,KAAc;AAAC,SACjD;AAAA,QACA,QAAA,EAAU,IAAA,CAAK,MAAA,GAAS,CAAA,GAAI,IAAA,GAAO;AAAA;AACrC,KACF;AAAA,EACF,CAAA;AAIA,EAAA,MAAM,YAAA,GAAe,MACnB,CAAA,CAAE,YAAA,CAAa,WAAA,EAAa,EAAE,MAAA,EAAQ,SAAA,EAAW,MAAA,EAAQ,KAAA,EAAO,CAAA;AAIlE,EAAA,MAAM,YAAY,MAAkC,YAAA;AAEpD,EAAA,OAAO;AAAA,IACL,UAAA;AAAA,aACAF,SAAA;AAAA,IACA,OAAA,EAAAF,QAAAA;AAAA,IACA,IAAA;AAAA,IACA,YAAA;AAAA,IACA,SAAA;AAAA,IACA,KAAA;AAAA,IACA,YAAY,IAAA,CAAK,UAAA;AAAA,IACjB,MAAM,EAAE,KAAA,EAAO,KAAK,KAAA,EAAO,IAAA,EAAM,KAAK,IAAA;AAAK,GAC7C;AACF;;;ACttBA,IAAM,aAAA,GAAgB,CAAC,MAAA,KAAmC;AACxD,EAAA,MAAM,KAAA,GAAQ,OAAO,WAAA,EAAY;AAGjC,EAAA,IACE,MAAM,UAAA,CAAW,SAAS,CAAA,IAC1B,KAAA,CAAM,WAAW,mBAAmB,CAAA,IACpC,KAAA,KAAU,MAAA,IACV,MAAM,UAAA,CAAW,MAAM,KACvB,KAAA,KAAU,MAAA,IACV,UAAU,QAAA,EACV;AACA,IAAA,OAAO,QAAA;AAAA,EACT;AAGA,EAAA,IACE,KAAA,KAAU,SAAA,IACV,KAAA,KAAU,KAAA,IACV,UAAU,QAAA,IACV,KAAA,KAAU,UAAA,IACV,KAAA,KAAU,YACV,KAAA,KAAU,WAAA,IACV,KAAA,KAAU,aAAA,IACV,UAAU,SAAA,IACV,KAAA,CAAM,UAAA,CAAW,SAAS,KAC1B,KAAA,KAAU,SAAA,IACV,KAAA,CAAM,UAAA,CAAW,SAAS,CAAA,IAC1B,KAAA,KAAU,MAAA,IACV,KAAA,KAAU,sBACV,KAAA,KAAU,OAAA,IACV,KAAA,CAAM,UAAA,CAAW,OAAO,CAAA,EACxB;AACA,IAAA,OAAO,QAAA;AAAA,EACT;AAGA,EAAA,IAAI,KAAA,KAAU,SAAA,IAAa,KAAA,KAAU,MAAA,EAAQ,OAAO,SAAA;AAGpD,EAAA,IAAI,KAAA,KAAU,QAAQ,OAAO,MAAA;AAG7B,EAAA,IAAI,KAAA,CAAM,UAAA,CAAW,WAAW,CAAA,EAAG,OAAO,WAAA;AAG1C,EAAA,IAAI,KAAA,KAAU,QAAQ,OAAO,MAAA;AAG7B,EAAA,IAAI,KAAA,KAAU,MAAA,IAAU,KAAA,KAAU,OAAA,EAAS,OAAO,MAAA;AAGlD,EAAA,IAAI,KAAA,KAAU,OAAA,IAAW,KAAA,CAAM,QAAA,CAAS,IAAI,KAAK,KAAA,CAAM,UAAA,CAAW,GAAG,CAAA,EAAG,OAAO,OAAA;AAG/E,EAAA,IAAI,UAAU,QAAA,IAAY,KAAA,CAAM,UAAA,CAAW,QAAQ,GAAG,OAAO,QAAA;AAE7D,EAAA,OAAO,SAAA;AACT,CAAA;AAEA,IAAM,uBAAA,GAA0B,CAAC,MAAA,KAAuC;AAEtE,EAAA,MAAM,KAAA,GAAQ,kBAAA,CAAmB,IAAA,CAAK,MAAM,CAAA;AAC5C,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,KAAA,CAAM,CAAC,MAAM,MAAA,EAAW;AAC5C,IAAA,OAAO,QAAA,CAAS,KAAA,CAAM,CAAC,CAAA,EAAG,EAAE,CAAA;AAAA,EAC9B;AACA,EAAA,OAAO,MAAA;AACT,CAAA;AAUA,IAAM,YAAA,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA;AAUrB,IAAM,aAAA,GAAgB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA;AAwDtB,IAAM,iBAAA,GAAoB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA;AAoB1B,IAAM,aAAA,GAAgB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA;AAkBtB,IAAM,gBAAA,GAAmB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA;AAYlB,IAAM,kBAAA,GAAqB,OAChC,IAAA,EACA,OAAA,KAC4B;AAC5B,EAAA,MAAM,UAAA,GAAa,SAAS,MAAA,IAAU,QAAA;AAGtC,EAAA,MAAM,CAAC,cAAc,aAAA,EAAe,UAAA,EAAY,eAAe,eAAe,CAAA,GAAI,MAAM,OAAA,CAAQ,GAAA,CAAI;AAAA,IAClG,IAAA,CAAK,KAAA,CAAM,YAAA,EAAc,CAAC,UAAU,CAAC,CAAA;AAAA,IACrC,IAAA,CAAK,KAAA,CAAM,aAAA,EAAe,CAAC,UAAU,CAAC,CAAA;AAAA,IACtC,IAAA,CAAK,KAAA,CAAM,iBAAA,EAAmB,CAAC,UAAU,CAAC,CAAA;AAAA,IAC1C,IAAA,CAAK,KAAA,CAAM,aAAA,EAAe,CAAC,UAAU,CAAC,CAAA;AAAA,IACtC,IAAA,CAAK,KAAA,CAAM,gBAAA,EAAkB,CAAC,UAAU,CAAC;AAAA,GAC1C,CAAA;AAWD,EAAA,MAAM,IAAA,GAAc,UAAA,CAAW,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,MAAS;AAAA,IAChD,IAAA,EAAM,IAAI,MAAM,CAAA;AAAA,IAChB,SAAA,EAAW,IAAI,YAAY,CAAA;AAAA,IAC3B,OAAA,EAAU,GAAA,CAAI,UAAU,CAAA,IAAuB,IAAA;AAAA,IAC/C,WAAA,EAAa,IAAI,cAAc,CAAA;AAAA,IAC/B,SAAA,EAAW,IAAI,YAAY;AAAA,GAC7B,CAAE,CAAA;AAGF,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAyB;AAK3C,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAwB;AAC/C,EAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,IAAA,IAAI,GAAA,CAAI,SAAS,GAAA,EAAK;AACtB,IAAA,IAAI,GAAA,CAAI,SAAS,GAAA,EAAK;AACpB,MAAA,IAAI,IAAA,GAAO,KAAA,CAAM,GAAA,CAAI,GAAA,CAAI,SAAS,CAAA;AAClC,MAAA,IAAI,SAAS,MAAA,EAAW;AACtB,QAAA,IAAA,uBAAW,GAAA,EAAI;AACf,QAAA,KAAA,CAAM,GAAA,CAAI,GAAA,CAAI,SAAA,EAAW,IAAI,CAAA;AAAA,MAC/B;AACA,MAAA,KAAA,MAAW,GAAA,IAAO,GAAA,CAAI,WAAA,EAAa,IAAA,CAAK,IAAI,GAAG,CAAA;AAAA,IACjD;AACA,IAAA,IAAI,IAAA,GAAO,UAAA,CAAW,GAAA,CAAI,GAAA,CAAI,SAAS,CAAA;AACvC,IAAA,IAAI,SAAS,MAAA,EAAW;AACtB,MAAA,IAAA,GAAO,EAAC;AACR,MAAA,UAAA,CAAW,GAAA,CAAI,GAAA,CAAI,SAAA,EAAW,IAAI,CAAA;AAAA,IACpC;AACA,IAAA,IAAA,CAAK,IAAA,CAAK,IAAI,WAAW,CAAA;AAAA,EAC3B;AAGA,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAoB;AAC5C,EAAA,KAAA,MAAW,GAAA,IAAO,gBAAgB,IAAA,EAAM;AACtC,IAAA,MAAM,KAAA,GAAQ,IAAI,YAAY,CAAA;AAC9B,IAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,GAAA,CAAI,WAAW,KAAK,CAAC,CAAA;AAC1C,IAAA,WAAA,CAAY,GAAA,CAAI,OAAO,KAAK,CAAA;AAAA,EAC9B;AAGA,EAAA,MAAM,cAAA,uBAAqB,GAAA,EAA2B;AACtD,EAAA,KAAA,MAAW,GAAA,IAAO,cAAc,IAAA,EAAM;AACpC,IAAA,MAAM,KAAA,GAAQ,IAAI,YAAY,CAAA;AAC9B,IAAA,MAAM,OAAA,GAAU,IAAI,aAAa,CAAA;AACjC,IAAA,MAAM,QAAA,GAAW,IAAI,gBAAgB,CAAA;AACrC,IAAA,MAAM,QAAA,GAAW,IAAI,WAAW,CAAA;AAChC,IAAA,MAAM,UAAA,GAAa,IAAI,aAAa,CAAA;AACpC,IAAA,MAAM,UAAA,GAAa,IAAI,gBAAgB,CAAA;AACvC,IAAA,MAAM,cAAA,GAAiB,IAAI,aAAa,CAAA;AAExC,IAAA,MAAM,QAAA,GAAW,KAAA,CAAM,GAAA,CAAI,KAAK,CAAA;AAChC,IAAA,MAAM,IAAA,GAAO,QAAA,KAAa,MAAA,IAAa,QAAA,CAAS,IAAI,OAAO,CAAA;AAE3D,IAAA,MAAM,EAAA,GAAK,aAAA,CAAc,QAAA,IAAY,QAAQ,CAAA;AAC7C,IAAA,MAAM,UAAU,EAAA,KAAO,QAAA,GAAW,uBAAA,CAAwB,QAAA,IAAY,QAAQ,CAAA,GAAI,MAAA;AAElF,IAAA,MAAM,KAAA,GAAqB;AAAA,MACzB,IAAA,EAAM,OAAA;AAAA,MACN,MAAM,QAAA,IAAY,QAAA;AAAA,MAClB,cAAA,EAAgB,EAAA;AAAA,MAChB,UAAU,UAAA,KAAe,KAAA;AAAA,MACzB,UAAA,EAAY,IAAA;AAAA,MACZ,GAAI,UAAA,KAAe,IAAA,GAAO,EAAE,YAAA,EAAc,UAAA,KAAe,EAAC;AAAA,MAC1D,GAAI,mBAAmB,IAAA,IAAQ,cAAA,KAAmB,KAAK,EAAE,WAAA,EAAa,cAAA,EAAe,GAAI,EAAC;AAAA,MAC1F,GAAI,OAAA,KAAY,MAAA,GAAY,EAAE,gBAAA,EAAkB,OAAA,KAAY;AAAC,KAC/D;AAEA,IAAA,IAAI,MAAA,GAAS,cAAA,CAAe,GAAA,CAAI,KAAK,CAAA;AACrC,IAAA,IAAI,WAAW,MAAA,EAAW;AACxB,MAAA,MAAA,GAAS,EAAC;AACV,MAAA,cAAA,CAAe,GAAA,CAAI,OAAO,MAAM,CAAA;AAAA,IAClC;AACA,IAAA,MAAA,CAAO,KAAK,KAAK,CAAA;AAAA,EACnB;AAKA,EAAA,MAAM,gBAAA,uBAAuB,GAAA,EAA8B;AAC3D,EAAA,MAAM,WAAA,GAAc,CAAC,KAAA,EAAe,QAAA,KAAmC;AACrE,IAAA,IAAI,IAAA,GAAO,gBAAA,CAAiB,GAAA,CAAI,KAAK,CAAA;AACrC,IAAA,IAAI,SAAS,MAAA,EAAW;AACtB,MAAA,IAAA,GAAO,EAAC;AACR,MAAA,gBAAA,CAAiB,GAAA,CAAI,OAAO,IAAI,CAAA;AAAA,IAClC;AACA,IAAA,IAAA,CAAK,KAAK,QAAQ,CAAA;AAAA,EACpB,CAAA;AAEA,EAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,IAAA,IAAI,GAAA,CAAI,IAAA,KAAS,GAAA,IAAO,GAAA,CAAI,YAAY,IAAA,EAAM;AAC9C,IAAA,MAAM,gBAAgB,GAAA,CAAI,SAAA,CAAU,OAAO,CAAC,GAAA,KAAuB,QAAQ,IAAI,CAAA;AAC/E,IAAA,IAAI,aAAA,CAAc,MAAA,KAAW,GAAA,CAAI,WAAA,CAAY,MAAA,EAAQ;AAErD,IAAA,MAAM,cAAc,UAAA,CAAW,GAAA,CAAI,IAAI,SAAS,CAAA,IAAK,EAAC,EAAG,IAAA;AAAA,MAAK,CAAC,GAAA,KAC7D,GAAA,CAAI,KAAA,CAAM,CAAC,QAAQ,GAAA,CAAI,WAAA,CAAY,QAAA,CAAS,GAAG,CAAC;AAAA,KAClD;AAGA,IAAA,WAAA,CAAY,IAAI,SAAA,EAAW;AAAA,MACzB,IAAA,EAAM,WAAA;AAAA,MACN,QAAQ,GAAA,CAAI,OAAA;AAAA,MACZ,aAAa,GAAA,CAAI,WAAA;AAAA,MACjB;AAAA,KACD,CAAA;AAGD,IAAA,WAAA,CAAY,IAAI,OAAA,EAAS;AAAA,MACvB,IAAA,EAAM,aAAa,QAAA,GAAW,SAAA;AAAA,MAC9B,QAAQ,GAAA,CAAI,SAAA;AAAA,MACZ,WAAA,EAAa,aAAA;AAAA,MACb,eAAe,GAAA,CAAI;AAAA,KACpB,CAAA;AAAA,EACH;AAGA,EAAA,MAAM,cAAA,uBAAqB,GAAA,EAA2B;AAEtD,EAAA,KAAA,MAAW,GAAA,IAAO,cAAc,IAAA,EAAM;AACpC,IAAA,MAAM,KAAA,GAAQ,IAAI,YAAY,CAAA;AAC9B,IAAA,MAAM,SAAA,GAAY,IAAI,YAAY,CAAA;AAClC,IAAA,MAAM,QAAA,GAAW,IAAI,WAAW,CAAA;AAChC,IAAA,MAAM,SAAA,GAAY,IAAI,YAAY,CAAA;AAClC,IAAA,MAAM,OAAA,GAAU,IAAI,SAAS,CAAA;AAE7B,IAAA,MAAM,UAAA,GAAa,aAAa,SAAS,CAAA;AAEzC,IAAA,MAAM,GAAA,GAAmB;AAAA,MACvB,IAAA,EAAM,SAAA;AAAA,MACN,MAAA,EAAQ,OAAA;AAAA,MACR,MAAA,EAAQ,QAAA;AAAA,MACR,IAAA,EAAM;AAAA,KACR;AAEA,IAAA,IAAI,OAAA,GAAU,cAAA,CAAe,GAAA,CAAI,KAAK,CAAA;AACtC,IAAA,IAAI,YAAY,MAAA,EAAW;AACzB,MAAA,OAAA,GAAU,EAAC;AACX,MAAA,cAAA,CAAe,GAAA,CAAI,OAAO,OAAO,CAAA;AAAA,IACnC;AACA,IAAA,OAAA,CAAQ,KAAK,GAAG,CAAA;AAAA,EAClB;AAGA,EAAA,MAAM,cAAA,GAAiB,YAAA,CAAa,IAAA,CAAK,MAAA,CAAO,CAAC,GAAA,KAAQ;AACvD,IAAA,MAAM,IAAA,GAAO,IAAI,YAAY,CAAA;AAC7B,IAAA,IAAI,OAAA,EAAS,aAAa,MAAA,IAAa,CAAC,QAAQ,QAAA,CAAS,QAAA,CAAS,IAAI,CAAA,EAAG,OAAO,KAAA;AAChF,IAAA,IAAI,OAAA,EAAS,YAAY,MAAA,IAAa,OAAA,CAAQ,QAAQ,QAAA,CAAS,IAAI,GAAG,OAAO,KAAA;AAC7E,IAAA,OAAO,IAAA;AAAA,EACT,CAAC,CAAA;AAED,EAAA,MAAM,QAAA,GAA2B,cAAA,CAAe,GAAA,CAAI,CAAC,GAAA,KAAQ;AAC3D,IAAA,MAAM,SAAA,GAAY,IAAI,YAAY,CAAA;AAClC,IAAA,MAAM,gBAAA,GAAmB,IAAI,aAAa,CAAA;AAC1C,IAAA,OAAO;AAAA,MACL,IAAA,EAAM,SAAA;AAAA,MACN,KAAA,EAAO,SAAA;AAAA,MACP,GAAI,qBAAqB,IAAA,IAAQ,gBAAA,KAAqB,KAAK,EAAE,WAAA,EAAa,gBAAA,EAAiB,GAAI,EAAC;AAAA,MAChG,MAAA,EAAQ,cAAA,CAAe,GAAA,CAAI,SAAS,KAAK,EAAC;AAAA,MAC1C,SAAA,EAAW,gBAAA,CAAiB,GAAA,CAAI,SAAS,KAAK,EAAC;AAAA,MAC/C,OAAA,EAAS,cAAA,CAAe,GAAA,CAAI,SAAS,KAAK,EAAC;AAAA,MAC3C,QAAA,EAAU,WAAA,CAAY,GAAA,CAAI,SAAS;AAAA,KACrC;AAAA,EACF,CAAC,CAAA;AAED,EAAA,OAAO,EAAE,QAAA,EAAS;AACpB,CAAA;AAMA,IAAM,YAAA,GAAe,CAAC,MAAA,KAAwC;AAC5D,EAAA,MAAM,KAAA,GAAQ,OAAO,WAAA,EAAY;AACjC,EAAA,IAAI,KAAA,KAAU,SAAS,OAAO,OAAA;AAC9B,EAAA,IAAI,KAAA,KAAU,QAAQ,OAAO,MAAA;AAC7B,EAAA,IAAI,KAAA,KAAU,OAAO,OAAO,KAAA;AAC5B,EAAA,IAAI,KAAA,KAAU,QAAQ,OAAO,MAAA;AAC7B,EAAA,IAAI,KAAA,KAAU,WAAW,OAAO,SAAA;AAChC,EAAA,IAAI,KAAA,KAAU,QAAQ,OAAO,MAAA;AAC7B,EAAA,OAAO,OAAA;AACT,CAAA;;;AC7aO,IAAM,YAAA,GAAe,CAAC,QAAA,KAA2C;AACtE,EAAA,MAAM,aAA0B,EAAC;AACjC,EAAA,MAAM,YAAA,GAAe,EAAE,KAAA,EAAO,CAAA,EAAE;AAEhC,EAAA,MAAM,GAAA,GAA0B;AAAA,IAC9B,aAAA,EAAe,QAAA,CAAS,MAAA,EAAQ,aAAA,wBAAqB,GAAA,EAAI;AAAA,IACzD,UAAU,QAAA,CAAS,QAAA;AAAA,IACnB,UAAA;AAAA,IACA,YAAA;AAAA,IACA,GAAI,SAAS,SAAA,KAAc,MAAA,GAAY,EAAE,SAAA,EAAW,QAAA,CAAS,SAAA,EAAU,GAAI;AAAC,GAC9E;AAEA,EAAA,MAAM,WAAqB,EAAC;AAG5B,EAAA,MAAM,cAAwB,EAAC;AAE/B,EAAA,IAAI,SAAS,QAAA,EAAU;AACrB,IAAA,WAAA,CAAY,KAAK,UAAU,CAAA;AAAA,EAC7B;AAGA,EAAA,MAAM,YAAA,GAAe,SAAS,MAAA,CAAO,GAAA;AAAA,IAAI,CAAC,CAAA,KACxC,CAAA,EAAG,CAAA,CAAE,KAAK,CAAA,CAAA,EAAI,CAAA,CAAE,MAAM,CAAA,IAAA,EAAO,UAAA,CAAW,CAAA,CAAE,UAAU,CAAC,CAAA;AAAA,GACvD;AAGA,EAAA,MAAM,cAAA,GAAiB,QAAA,CAAS,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,KAAM;AAClD,IAAA,MAAM,IAAA,GAAO,cAAA,CAAe,CAAA,CAAE,UAAA,EAAY,GAAG,CAAA;AAC7C,IAAA,OAAO,GAAG,IAAI,CAAA,IAAA,EAAO,UAAA,CAAW,CAAA,CAAE,IAAI,CAAC,CAAA,CAAA;AAAA,EACzC,CAAC,CAAA;AAGD,EAAA,MAAM,gBAAA,GAAmB,QAAA,CAAS,UAAA,CAAW,GAAA,CAAI,CAAC,CAAA,KAAM;AACtD,IAAA,MAAM,IAAA,GAAO,gBAAA,CAAiB,CAAA,CAAE,UAAA,EAAY,GAAG,CAAA;AAC/C,IAAA,OAAO,GAAG,IAAI,CAAA,IAAA,EAAO,UAAA,CAAW,CAAA,CAAE,IAAI,CAAC,CAAA,CAAA;AAAA,EACzC,CAAC,CAAA;AAGD,EAAA,MAAM,kBAA4B,EAAC;AACnC,EAAA,IAAI,QAAA,CAAS,aAAa,MAAA,EAAW;AACnC,IAAA,MAAM,GAAA,GAAM,CAAA,EAAG,QAAA,CAAS,QAAA,CAAS,KAAA,CAAM,KAAK,CAAA,CAAA,EAAI,QAAA,CAAS,QAAA,CAAS,KAAA,CAAM,MAAM,CAAA,CAAA;AAK9E,IAAA,MAAM,kBAAA,GAAqB,uBAAuB,UAAU,CAAA;AAC5D,IAAA,IAAI,uBAAuB,MAAA,EAAW;AACpC,MAAA,eAAA,CAAgB,IAAA,CAAK,CAAA,KAAA,EAAQ,GAAG,CAAA,MAAA,EAAS,kBAAkB,CAAA,aAAA,CAAe,CAAA;AAAA,IAC5E;AAAA,EACF;AAEA,EAAA,MAAM,UAAA,GAAa,CAAC,GAAG,YAAA,EAAc,GAAG,cAAA,EAAgB,GAAG,gBAAA,EAAkB,GAAG,eAAe,CAAA;AAC/F,EAAA,IAAI,WAAA,CAAY,SAAS,CAAA,EAAG;AAC1B,IAAA,QAAA,CAAS,IAAA,CAAK,CAAA,OAAA,EAAU,WAAA,CAAY,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,EAAI,UAAA,CAAW,IAAA,CAAK,IAAI,CAAC,CAAA,CAAE,CAAA;AAAA,EAC1E,CAAA,MAAO;AACL,IAAA,QAAA,CAAS,KAAK,CAAA,OAAA,EAAU,UAAA,CAAW,IAAA,CAAK,IAAI,CAAC,CAAA,CAAE,CAAA;AAAA,EACjD;AAGA,EAAA,MAAM,WAAA,GAAc,QAAA,CAAS,OAAA,CAAQ,CAAC,CAAA;AACtC,EAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,IAAA,IAAI,WAAA,CAAY,aAAa,MAAA,EAAW;AACtC,MAAA,MAAM,MAAA,GAAS,YAAA,CAAa,WAAA,CAAY,QAAQ,CAAA;AAEhD,MAAA,mBAAA,CAAoB,MAAA,EAAQ,YAAY,YAAY,CAAA;AACpD,MAAA,QAAA,CAAS,KAAK,CAAA,MAAA,EAAS,MAAA,CAAO,GAAG,CAAA,KAAA,EAAQ,WAAA,CAAY,KAAK,CAAA,CAAE,CAAA;AAAA,IAC9D,CAAA,MAAA,IAAW,WAAA,CAAY,KAAA,KAAU,MAAA,EAAW;AAC1C,MAAA,QAAA,CAAS,KAAK,CAAA,KAAA,EAAQ,WAAA,CAAY,KAAK,CAAA,IAAA,EAAO,WAAA,CAAY,KAAK,CAAA,CAAE,CAAA;AAAA,IACnE;AAAA,EACF;AAOA,EAAA,KAAA,MAAW,IAAA,IAAQ,SAAS,KAAA,EAAO;AACjC,IAAA,MAAM,UAAA,GAAa,SAAS,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,KAAA,KAAU,IAAA,CAAK,OAAO,CAAA;AACxE,IAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,MAAA,MAAM,OAAA,GAAU,IAAA,CAAK,IAAA,KAAS,MAAA,GAAS,WAAA,GAAc,MAAA;AACrD,MAAA,MAAM,UAAA,GAAa;AAAA,QACjB,GAAG,iBAAiB,IAAI,CAAA;AAAA,QACxB,GAAA,CAAI,IAAA,CAAK,EAAA,IAAM,EAAC,EAAG,GAAA,CAAI,CAAC,KAAA,KAAU,aAAA,CAAc,KAAA,CAAM,QAAA,EAAU,GAAG,CAAC;AAAA,OACtE;AACA,MAAA,MAAM,EAAA,GAAK,UAAA,CAAW,IAAA,CAAK,OAAO,CAAA;AAClC,MAAA,IAAI,UAAA,CAAW,aAAa,MAAA,EAAW;AACrC,QAAA,MAAM,MAAA,GAAS,YAAA,CAAa,UAAA,CAAW,QAAQ,CAAA;AAC/C,QAAA,mBAAA,CAAoB,MAAA,EAAQ,YAAY,YAAY,CAAA;AACpD,QAAA,QAAA,CAAS,IAAA,CAAK,CAAA,EAAG,OAAO,CAAA,EAAA,EAAK,MAAA,CAAO,GAAG,CAAA,KAAA,EAAQ,IAAA,CAAK,OAAO,CAAA,IAAA,EAAO,EAAE,CAAA,CAAE,CAAA;AAAA,MACxE,CAAA,MAAO;AACL,QAAA,QAAA,CAAS,IAAA,CAAK,CAAA,EAAG,OAAO,CAAA,CAAA,EAAI,IAAA,CAAK,OAAO,CAAA,IAAA,EAAO,IAAA,CAAK,OAAO,CAAA,IAAA,EAAO,EAAE,CAAA,CAAE,CAAA;AAAA,MACxE;AAAA,IACF;AAAA,EACF;AAQA,EAAA,MAAM,aAAA,GAAgB,IAAI,GAAA,CAAI,QAAA,CAAS,KAAA,CAAM,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,OAAO,CAAC,CAAA;AAClE,EAAA,KAAA,MAAW,MAAA,IAAU,SAAS,OAAA,EAAS;AACrC,IAAA,IAAI,MAAA,CAAO,UAAU,WAAA,EAAa,KAAA,IAAS,cAAc,GAAA,CAAI,MAAA,CAAO,KAAK,CAAA,EAAG;AAC5E,IAAA,IAAI,MAAA,CAAO,aAAa,MAAA,EAAW;AACjC,MAAA,MAAM,MAAA,GAAS,YAAA,CAAa,MAAA,CAAO,QAAQ,CAAA;AAC3C,MAAA,mBAAA,CAAoB,MAAA,EAAQ,YAAY,YAAY,CAAA;AACpD,MAAA,QAAA,CAAS,KAAK,CAAA,YAAA,EAAe,MAAA,CAAO,GAAG,CAAA,KAAA,EAAQ,MAAA,CAAO,KAAK,CAAA,CAAE,CAAA;AAAA,IAC/D,CAAA,MAAA,IAAW,MAAA,CAAO,KAAA,KAAU,MAAA,EAAW;AACrC,MAAA,QAAA,CAAS,KAAK,CAAA,WAAA,EAAc,MAAA,CAAO,KAAK,CAAA,IAAA,EAAO,MAAA,CAAO,KAAK,CAAA,CAAE,CAAA;AAAA,IAC/D;AAAA,EACF;AAGA,EAAA,IAAI,QAAA,CAAS,WAAW,MAAA,EAAW;AACjC,IAAA,MAAM,WAAA,GAAc,aAAA,CAAc,QAAA,CAAS,MAAA,CAAO,UAAU,GAAG,CAAA;AAC/D,IAAA,QAAA,CAAS,IAAA,CAAK,CAAA,MAAA,EAAS,WAAW,CAAA,CAAE,CAAA;AAAA,EACtC;AAGA,EAAA,IAAI,QAAA,CAAS,OAAA,CAAQ,MAAA,GAAS,CAAA,EAAG;AAC/B,IAAA,MAAM,YAAA,GAAe,QAAA,CAAS,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAG,CAAA,CAAE,KAAK,CAAA,CAAA,EAAI,CAAA,CAAE,MAAM,CAAA,CAAE,CAAA;AACzE,IAAA,QAAA,CAAS,KAAK,CAAA,SAAA,EAAY,YAAA,CAAa,IAAA,CAAK,IAAI,CAAC,CAAA,CAAE,CAAA;AAAA,EACrD;AAGA,EAAA,IAAI,QAAA,CAAS,IAAA,CAAK,MAAA,GAAS,CAAA,EAAG;AAC5B,IAAA,MAAM,YAAA,GAAe,QAAA,CAAS,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,KAAM;AAC5C,MAAA,IAAI,OAAO,CAAA,CAAE,KAAA,KAAU,QAAA,EAAU;AAC/B,QAAA,OAAO,CAAA,EAAG,UAAA,CAAW,CAAA,CAAE,KAAK,CAAC,IAAI,CAAA,CAAE,GAAA,KAAQ,MAAA,GAAS,MAAA,GAAS,KAAK,CAAA,CAAA;AAAA,MACpE;AACA,MAAA,OAAO,CAAA,EAAG,CAAA,CAAE,KAAA,CAAM,KAAK,CAAA,CAAA,EAAI,CAAA,CAAE,KAAA,CAAM,MAAM,CAAA,CAAA,EAAI,CAAA,CAAE,GAAA,KAAQ,MAAA,GAAS,SAAS,KAAK,CAAA,CAAA;AAAA,IAChF,CAAC,CAAA;AACD,IAAA,QAAA,CAAS,KAAK,CAAA,SAAA,EAAY,YAAA,CAAa,IAAA,CAAK,IAAI,CAAC,CAAA,CAAE,CAAA;AAAA,EACrD,CAAA,MAAA,IAAW,QAAA,CAAS,QAAA,KAAa,MAAA,EAAW;AAC1C,IAAA,MAAM,WAAA,GAAc,uBAAuB,UAAU,CAAA;AACrD,IAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,MAAA,MAAM,GAAA,GAAM,CAAA,EAAG,QAAA,CAAS,QAAA,CAAS,KAAA,CAAM,KAAK,CAAA,CAAA,EAAI,QAAA,CAAS,QAAA,CAAS,KAAA,CAAM,MAAM,CAAA,CAAA;AAC9E,MAAA,QAAA,CAAS,IAAA,CAAK,CAAA,SAAA,EAAY,GAAG,CAAA,MAAA,EAAS,WAAW,CAAA,IAAA,CAAM,CAAA;AAAA,IACzD;AAAA,EACF;AAGA,EAAA,IAAI,QAAA,CAAS,UAAU,MAAA,EAAW;AAGhC,IAAA,IAAI,CAAC,OAAO,SAAA,CAAU,QAAA,CAAS,KAAK,CAAA,IAAK,QAAA,CAAS,QAAQ,CAAA,EAAG;AAC3D,MAAA,MAAM,IAAI,SAAS,aAAA,EAAe,CAAA,sCAAA,EAAyC,OAAO,QAAA,CAAS,KAAK,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,IACtG;AACA,IAAA,QAAA,CAAS,IAAA,CAAK,CAAA,MAAA,EAAS,QAAA,CAAS,KAAK,CAAA,CAAE,CAAA;AAAA,EACzC;AAGA,EAAA,MAAM,kBAAmC,EAAC;AAC1C,EAAA,KAAA,MAAW,QAAQ,UAAA,EAAY;AAC7B,IAAA,eAAA,CAAgB,IAAA,CAAK,GAAG,CAAA,GAAI,EAAE,MAAM,IAAA,CAAK,IAAA,EAAM,IAAA,EAAM,IAAA,CAAK,IAAA,EAAK;AAAA,EACjE;AAEA,EAAA,OAAO;AAAA,IACL,GAAA,EAAK,QAAA,CAAS,IAAA,CAAK,GAAG,CAAA;AAAA,IACtB,UAAA;AAAA,IACA;AAAA,GACF;AACF,CAAA;AAMA,IAAM,sBAAA,GAAyB,CAAC,KAAA,KAA2C;AACzE,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,MAAM,IAAA,GAAO,MAAM,CAAC,CAAA;AACpB,IAAA,IAAI,IAAA,KAAS,MAAA,IAAa,IAAA,CAAK,IAAA,KAAS,UAAA,EAAY;AAClD,MAAA,OAAO,CAAA,GAAI,CAAA;AAAA,IACb;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT,CAAA;AAEA,IAAM,mBAAA,GAAsB,CAC1B,WAAA,EACA,WAAA,EACA,aAAA,KACS;AAOT,EAAA,KAAA,MAAW,IAAA,IAAQ,YAAY,UAAA,EAAY;AACzC,IAAA,aAAA,CAAc,KAAA,IAAS,CAAA;AACvB,IAAA,WAAA,CAAY,KAAK,IAAI,CAAA;AAAA,EACvB;AACF,CAAA;;;ACjLA,IAAM,OAAA,GAAkC,EAAE,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,CAAA,EAAG,CAAA,EAAG,GAAA,EAAM,GAAA,EAAK,GAAA,EAAQ,CAAA,EAAG,IAAA,EAAW,GAAG,KAAA,EAAW;AAEnG,IAAM,YAAA,GAAe,CAAC,KAAA,KAAsC;AACjE,EAAA,MAAM,KAAA,GAAQ,2CAAA,CAA4C,IAAA,CAAK,KAAK,CAAA;AACpE,EAAA,IAAI,KAAA,KAAU,MAAM,OAAO,MAAA;AAC3B,EAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,KAAA,CAAM,CAAC,KAAK,EAAE,CAAA;AACnC,EAAA,OAAO,SAAS,MAAA,GAAY,MAAA,GAAY,OAAO,KAAA,CAAM,CAAC,CAAC,CAAA,GAAI,IAAA;AAC7D,CAAA;AAEO,IAAM,cAAA,GAAiB,OAAO,IAAA,EAAc,SAAA,KAAmD;AACpG,EAAA,IAAI,IAAA,CAAK,iBAAA,KAAsB,KAAA,EAAO,OAAO,YAAA;AAC7C,EAAA,MAAM,KAAA,GAAQ,MAAM,IAAA,CAAK,KAAA,CAAM,wBAAwB,CAAA;AACvD,EAAA,MAAM,OAAA,GAAU,YAAA,CAAa,MAAA,CAAO,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,GAAI,mBAAmB,CAAA,IAAK,EAAE,CAAC,CAAA;AAC/E,EAAA,IAAI,YAAY,MAAA,IAAa,OAAA,GAAU,CAAA,IAAK,OAAA,IAAW,WAAW,OAAO,YAAA;AACzE,EAAA,OAAO,IAAA,CAAK,WAAA,KAAgB,MAAA,GAAY,YAAA,GAAe,WAAA;AACzD,CAAA;;;ACjBA,IAAM,YAAA,uBAAmB,GAAA,CAAI;AAAA,EAC3B,EAAA;AAAA;AAAA,EACA,GAAA;AAAA;AAAA,EACA,GAAA;AAAA;AAAA,EACA;AAAA;AACF,CAAC,CAAA;AAID,IAAM,oBAAA,GAAuB,CAAC,IAAA,EAAa,MAAA,KAA6B;AACtE,EAAA,MAAM,WAAA,GAAc,MAAA,CACjB,MAAA,CAAO,CAAA,CAAA,KAAK,YAAA,CAAa,GAAA,CAAI,CAAA,CAAE,UAAU,CAAC,CAAA,CAC1C,GAAA,CAAI,CAAA,CAAA,KAAK,EAAE,IAAI,CAAA;AAClB,EAAA,IAAI,YAAY,MAAA,KAAW,CAAA,IAAK,IAAA,CAAK,MAAA,KAAW,GAAG,OAAO,IAAA;AAC1D,EAAA,OAAO,IAAA,CAAK,IAAI,CAAA,GAAA,KAAO;AACrB,IAAA,MAAM,GAAA,GAAM,EAAE,GAAG,GAAA,EAAI;AACrB,IAAA,KAAA,MAAW,OAAO,WAAA,EAAa;AAC7B,MAAA,MAAM,CAAA,GAAI,IAAI,GAAG,CAAA;AACjB,MAAA,IAAI,OAAO,MAAM,QAAA,EAAU;AACzB,QAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,QAAA,IAAI,OAAO,QAAA,CAAS,CAAC,CAAA,EAAG,GAAA,CAAI,GAAG,CAAA,GAAI,CAAA;AAAA,MACrC;AAAA,IACF;AACA,IAAA,OAAO,GAAA;AAAA,EACT,CAAC,CAAA;AACH,CAAA;AAEO,IAAM,qBAAA,GAAwB,CAAC,MAAA,KAAmD;AACvF,EAAA,MAAM,EAAE,IAAA,EAAM,MAAA,GAAS,QAAA,EAAU,SAAQ,GAAI,MAAA;AAE7C,EAAA,MAAM,YAAA,GAAoC;AAAA,IACxC,YAAA,EAAc,IAAA;AAAA,IACd,UAAA,EAAY,KAAA;AAAA;AAAA,IACZ,UAAA,EAAY,IAAA;AAAA,IACZ,cAAA,EAAgB,IAAA;AAAA,IAChB,eAAA,EAAiB,IAAA;AAAA,IACjB,GAAA,EAAK,IAAA;AAAA,IACL,eAAA,EAAiB,IAAA;AAAA,IACjB,gBAAA,EAAkB;AAAA,GACpB;AAEA,EAAA,MAAM,UAAA,GAAa,OAAO,OAAA,KACxB,kBAAA,CAAmB,IAAA,EAAM;AAAA,IACvB,GAAG,OAAA;AAAA,IACH,MAAA,EAAQ,SAAS,MAAA,IAAU,MAAA;AAAA,IAC3B,OAAA,EAAS,SAAS,OAAA,IAAW;AAAA,GAC9B,CAAA;AAEH,EAAA,MAAMA,QAAAA,GAAU,CAAC,QAAA,KACf,YAAA,CAAa,QAAQ,CAAA;AAKvB,EAAA,IAAI,cAAA;AACJ,EAAA,MAAM,UAAA,GAAa,OAAO,EAAA,KAA4C;AACpE,IAAA,cAAA,GAAiB,MAAA;AACjB,IAAA,IAAI,EAAA,IAAM,GAAG,OAAO,YAAA;AACpB,IAAA,MAAM,WAAA,GAAc,MAAM,cAAA,CAAe,IAAA,EAAM,EAAE,CAAA;AACjD,IAAA,IAAI,WAAA,KAAgB,WAAA,EAAa,cAAA,GAAiB,IAAA,CAAK,MAAM,EAAE,CAAA;AAC/D,IAAA,OAAO,WAAA;AAAA,EACT,CAAA;AAEA,EAAA,MAAM,OAAA,GAAU,OAAO,KAAA,EAAsB,MAAA,KAAwC;AACnF,IAAA,MAAM,KAAA,GAAQ,cAAA;AAGd,IAAA,MAAM,SACJ,KAAA,KAAU,MAAA,IAAa,IAAA,CAAK,WAAA,KAAgB,SACxC,MAAM,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,KAAK,MAAM,CAAA,GAClC,MAAM,IAAA,CAAK,WAAA,CAAY,OAAO,EAAA,KAAO;AAGnC,MAAA,MAAM,EAAA,CAAG,KAAA,CAAM,CAAA,8BAAA,EAAiC,KAAK,CAAA,CAAE,CAAA;AACvD,MAAA,OAAO,EAAA,CAAG,KAAA,CAAM,KAAA,CAAM,GAAA,EAAK,MAAM,CAAA;AAAA,IACnC,CAAC,CAAA;AACP,IAAA,OAAO,oBAAA,CAAqB,MAAA,CAAO,IAAA,EAAM,MAAA,CAAO,MAAmB,CAAA;AAAA,EACrE,CAAA;AAEA,EAAA,OAAO;AAAA,IACL,EAAA,EAAI,UAAA;AAAA,IACJ,UAAA;AAAA,IACA,OAAA,EAAAA,QAAAA;AAAA,IACA,OAAA;AAAA,IACA,YAAA;AAAA,IACA;AAAA,GACF;AACF;;;ACvGO,IAAM,WAAW,MACtB;AAAA,EACE,yGAAA;AAAA,EACA,EAAA;AAAA,EACA,+CAAA;AAAA,EACA,0WAAA;AAAA,EACA,kJAAA;AAAA,EACA,mMAAA;AAAA,EACA,EAAA;AAAA,EACA,yDAAA;AAAA,EACA,+PAAA;AAAA,EACA,4SAAA;AAAA,EACA,mIAAA;AAAA,EACA,mFAAA;AAAA,EACA,uaAAA;AAAA,EACA,EAAA;AAAA,EACA,8WAAA;AAAA,EACA,EAAA;AAAA,EACA;AACF,CAAA,CAAE,KAAK,IAAI;;;ACQN,IAAM,aAAA,GAAgB,CAAC,UAAA,EAAY,UAAU;AAG7C,IAAM,SAAA,GAAY,CAAC,KAAA,KAAqC,aAAA,CAAc,KAAK,CAAC,IAAA,KAAS,SAAS,KAAK;ACjB1G,IAAM,YAAA,GAAe,CAAC,KAAA,KAA4B;AAChD,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,UAAU,OAAO,KAAA;AACxD,EAAA,MAAM,EAAA,GAAK,KAAA;AACX,EAAA,IAAI,EAAA,CAAG,WAAW,CAAA,KAAM,CAAA,EAAG,OAAO,KAAA;AAClC,EAAA,IAAI,EAAE,MAAA,IAAU,EAAA,CAAA,EAAK,OAAO,KAAA;AAC5B,EAAA,MAAM,MAAA,GAAS,GAAG,QAAQ,CAAA;AAC1B,EAAA,IAAI,MAAA,KAAW,IAAA,IAAQ,OAAO,MAAA,KAAW,UAAU,OAAO,KAAA;AAC1D,EAAA,MAAM,CAAA,GAAI,MAAA;AACV,EAAA,OAAO,KAAA,CAAM,OAAA,CAAQ,CAAA,CAAE,OAAO,CAAC,KAAK,KAAA,CAAM,OAAA,CAAQ,CAAA,CAAE,SAAS,CAAC,CAAA;AAChE,CAAA;AAMO,IAAM,aAAA,GAAgB,CAAC,KAAA,KAAqC;AACjE,EAAA,IAAI,OAAO,KAAA,CAAM,SAAA,KAAc,QAAA,EAAU,OAAO,4BAAA;AAChD,EAAA,IAAI,MAAM,SAAA,KAAc,MAAA,IAAa,OAAO,KAAA,CAAM,cAAc,QAAA,EAAU;AACxE,IAAA,OAAO,yCAAA;AAAA,EACT;AAEA,EAAA,IAAI,KAAA,CAAM,SAAS,eAAA,EAAiB;AAClC,IAAA,OAAO,OAAO,MAAM,MAAA,KAAW,QAAA,IAAY,MAAM,MAAA,CAAO,MAAA,GAAS,IAC7D,IAAA,GACA,iDAAA;AAAA,EACN;AAEA,EAAA,IAAI,KAAA,CAAM,SAAS,IAAA,EAAM;AACvB,IAAA,IAAIS,aAAa,KAAA,CAAM,GAAG,GAAG,OAAO,CAAA,aAAA,EAAgBC,cAAc,CAAA,CAAA;AAClE,IAAA,MAAM,MAAA,GAAS,WAAA,CAAY,SAAA,CAAU,KAAA,CAAM,GAAG,CAAA;AAC9C,IAAA,IAAI,CAAC,MAAA,CAAO,OAAA,SAAgB,CAAA,aAAA,EAAgB,MAAA,CAAO,MAAM,OAAO,CAAA,CAAA;AAChE,IAAA,IAAI,MAAM,OAAA,KAAY,MAAA,IAAa,CAAC,YAAA,CAAa,KAAA,CAAM,OAAO,CAAA,EAAG;AAC/D,MAAA,OAAO,6CAAA;AAAA,IACT;AACA,IAAA,IAAI,MAAM,OAAA,KAAY,MAAA,IAAa,CAAC,SAAA,CAAU,KAAA,CAAM,OAAO,CAAA,EAAG;AAC5D,MAAA,OAAO,CAAA,iBAAA,EAAoB,MAAA,CAAO,KAAA,CAAM,OAAO,CAAC,CAAA,CAAA;AAAA,IAClD;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,IAAI,KAAA,CAAM,SAAS,UAAA,EAAY;AAC7B,IAAA,IAAID,aAAa,KAAA,CAAM,QAAQ,GAAG,OAAO,CAAA,kBAAA,EAAqBC,cAAc,CAAA,CAAA;AAC5E,IAAA,MAAM,MAAA,GAAS,wBAAA,CAAyB,SAAA,CAAU,KAAA,CAAM,QAAQ,CAAA;AAChE,IAAA,OAAO,OAAO,OAAA,GAAU,IAAA,GAAO,CAAA,kBAAA,EAAqB,MAAA,CAAO,MAAM,OAAO,CAAA,CAAA;AAAA,EAC1E;AAEA,EAAA,OAAO,CAAA,0BAAA,EAA6B,MAAA,CAAQ,KAAA,CAA4B,IAAI,CAAC,CAAA,CAAA;AAC/E;ACrBA,IAAM,KAAA,GAAQ,0BAAA;AACd,IAAMC,WAAAA,GAAa,CAAC,IAAA,EAAc,KAAA,KAA0B;AAC1D,EAAA,IAAI,CAAC,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA,EAAG;AACrB,IAAA,MAAM,IAAI,KAAA,CAAM,CAAA,QAAA,EAAW,KAAK,CAAA,iCAAA,EAAoC,IAAI,CAAA,CAAA,CAAG,CAAA;AAAA,EAC7E;AACA,EAAA,OAAO,IAAI,IAAI,CAAA,CAAA,CAAA;AACjB,CAAA;AAEA,IAAM,WAAA,GACJ,oJAAA;AAEF,IAAM,UAAA,GAAa,CAAC,GAAA,KAA6C;AAC/D,EAAA,MAAM,SAAA,GAAa,GAAA,CAAI,YAAY,CAAA,CAAW,OAAA,EAAQ;AACtD,EAAA,MAAM,YAAA,GAAe,IAAI,YAAY,CAAA;AACrC,EAAA,MAAM,WAAA,GAAc,IAAI,cAAc,CAAA;AACtC,EAAA,MAAM,WAAA,GAAc,IAAI,oBAAoB,CAAA;AAC5C,EAAA,MAAM,IAAA,GAAO;AAAA,IACX,SAAA;AAAA,IACA,GAAI,eAAe,EAAE,SAAA,EAAW,aAAa,OAAA,EAAQ,KAAM,EAAC;AAAA,IAC5D,GAAI,cAAc,EAAE,UAAA,EAAY,YAAY,OAAA,EAAQ,KAAM,EAAC;AAAA,IAC3D,GAAI,IAAI,WAAW,CAAA,KAAM,OAAO,EAAE,SAAA,EAAW,IAAA,EAAK,GAAI,EAAC;AAAA,IACvD,GAAI,GAAA,CAAI,cAAc,CAAA,IAAK,IAAA,GAAO,EAAE,WAAA,EAAa,MAAA,CAAO,GAAA,CAAI,cAAc,CAAC,CAAA,KAAM,EAAC;AAAA,IAClF,GAAI,WAAA,GAAc,EAAE,iBAAA,EAAmB,WAAA,KAAgB,EAAC;AAAA,IACxD,GAAI,GAAA,CAAI,QAAQ,CAAA,IAAK,IAAA,GAAO,EAAE,MAAA,EAAQ,MAAA,CAAO,GAAA,CAAI,QAAQ,CAAC,CAAA,KAAM,EAAC;AAAA,IACjE,GAAI,GAAA,CAAI,OAAO,CAAA,IAAK,IAAA,GAAO,EAAE,KAAA,EAAO,GAAA,CAAI,OAAO,CAAA,EAAE,GAAI;AAAC,GACxD;AAEA,EAAA,IAAI,GAAA,CAAI,MAAM,CAAA,KAAM,eAAA,EAAiB;AACnC,IAAA,OAAO,EAAE,IAAA,EAAM,eAAA,EAAiB,MAAA,EAAQ,MAAA,CAAO,GAAA,CAAI,QAAQ,CAAA,IAAK,EAAE,CAAA,EAAG,GAAG,IAAA,EAAK;AAAA,EAC/E;AAGA,EAAA,IAAI,GAAA,CAAI,MAAM,CAAA,KAAM,UAAA,EAAY;AAC9B,IAAA,OAAO;AAAA,MACL,IAAA,EAAM,UAAA;AAAA,MACN,QAAA,EAAU,IAAI,KAAK,CAAA;AAAA,MACnB,GAAI,GAAA,CAAI,OAAO,CAAA,IAAK,IAAA,GAAO,EAAE,KAAA,EAAO,GAAA,CAAI,OAAO,CAAA,EAAY,GAAI,EAAC;AAAA,MAChE,GAAG;AAAA,KACL;AAAA,EACF;AACA,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,IAAA;AAAA,IACN,GAAA,EAAK,IAAI,KAAK,CAAA;AAAA,IACd,GAAI,GAAA,CAAI,UAAU,CAAA,IAAK,IAAA,GAAO,EAAE,OAAA,EAAS,GAAA,CAAI,UAAU,CAAA,EAAgB,GAAI,EAAC;AAAA;AAAA;AAAA;AAAA;AAAA,IAK5E,GAAI,GAAA,CAAI,OAAO,CAAA,IAAK,IAAA,GAAO,EAAE,KAAA,EAAO,GAAA,CAAI,OAAO,CAAA,EAAY,GAAI,EAAC;AAAA;AAAA;AAAA,IAGhE,GAAI,SAAA,CAAU,GAAA,CAAI,SAAS,CAAC,CAAA,GAAI,EAAE,OAAA,EAAS,GAAA,CAAI,SAAS,CAAA,EAAE,GAAI,EAAC;AAAA,IAC/D,GAAG;AAAA,GACL;AACF,CAAA;AAEO,IAAM,mBAAA,GAAsB,CAAC,MAAA,KAA+C;AACjF,EAAA,MAAM,EAAE,IAAA,EAAM,OAAA,EAAQ,GAAI,MAAA;AAC1B,EAAA,MAAM,MAAA,GAASA,WAAAA,CAAW,MAAA,CAAO,MAAA,IAAU,UAAU,QAAQ,CAAA;AAC7D,EAAA,MAAM,KAAA,GAAQA,WAAAA,CAAW,MAAA,CAAO,KAAA,IAAS,aAAa,OAAO,CAAA;AAC7D,EAAA,MAAM,SAAA,GAAY,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,KAAK,CAAA,CAAA;AAUpC,EAAA,MAAM,aAAa,MAAA,CAAO,MAAA,IAAU,cAAc,QAAA,IAAA,CAAa,MAAA,CAAO,SAAS,WAAA,MAAiB,WAAA;AAChG,EAAA,MAAM,IAAA,GAAO,CAAA,EAAG,MAAA,CAAO,MAAA,IAAU,QAAQ,CAAA,CAAA,EAAI,MAAA,CAAO,KAAA,IAAS,WAAW,CAAA,CAAA,CAAG,WAAA,EAAY,CAAE,OAAA,CAAQ,eAAe,GAAG,CAAA;AACnH,EAAA,MAAM,QAAA,GAAqB;AAAA,IACzB,EAAA,EAAI,SAAA,GAAY,gBAAA,GAAmB,CAAA,eAAA,EAAkB,IAAI,CAAA,CAAA;AAAA,IACzD,UAAA,EAAY;AAAA,MACV;AAAA,QACE,WAAA,EAAa,uDAAA;AAAA,QACb,KAAA,EAAO;AAAA,UACL,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,CAAA,4BAAA,EAA+B,MAAM,CAAA,CAAA,EAAG;AAAA,UAC5D;AAAA,YACE,IAAA,EAAM,KAAA;AAAA,YACN,GAAA,EAAK,8BAA8B,SAAS,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAAA;AAAA,WAiB9C;AAAA,UACA,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,CAAA,YAAA,EAAe,SAAS,CAAA,kEAAA,CAAA,EAAqE;AAAA,UACjH,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,CAAA,YAAA,EAAe,SAAS,CAAA,kDAAA,CAAA,EAAqD;AAAA,UACjG,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,CAAA,YAAA,EAAe,SAAS,CAAA,2CAAA,CAAA,EAA8C;AAAA,UAC1F,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,CAAA,YAAA,EAAe,SAAS,CAAA,oCAAA,CAAA,EAAuC;AAAA,UACnF,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,CAAA,YAAA,EAAe,SAAS,CAAA,sCAAA,CAAA;AAAyC;AACvF;AACF;AACF,GACF;AAGA,EAAA,MAAM,OAAO,YAA2B;AACtC,IAAA,MAAM,OAAA,CAAQ,IAAA,EAAM,CAAC,QAAQ,CAAC,CAAA;AAAA,EAChC,CAAA;AAEA,EAAA,MAAM,KAAA,GAAQ,CAAC,GAAA,EAAa,MAAA,KAAyB;AACnD,IAAA,aAAA,CAAc,IAAA,CAAK,MAAM,CAAA,YAAA,EAAe,SAAS,mBAAmB,CAAC,GAAG,CAAC,CAAA,EAAG,OAAO,CAAA;AACnF,IAAA,MAAM,MAAM,IAAI,KAAA,CAAM,qDAAqD,GAAG,CAAA,GAAA,EAAM,MAAM,CAAA,CAAE,CAAA;AAC5F,IAAA,IAAI,OAAA,UAAiB,GAAG,CAAA;AAAA,SACnB,OAAA,CAAQ,MAAM,GAAG,CAAA;AAAA,EACxB,CAAA;AAEA,EAAA,MAAM,GAAA,GAAM,OAAO,GAAA,KAAiD;AAClE,IAAA,MAAM,GAAA,GAAM,MAAM,IAAA,CAAK,KAAA;AAAA,MACrB,CAAA,OAAA,EAAU,WAAW,CAAA,MAAA,EAAS,SAAS;AAAA,oEAAA,CAAA;AAAA,MAEvC,CAAC,GAAG;AAAA,KACN;AACA,IAAA,MAAM,GAAA,GAAM,GAAA,CAAI,IAAA,CAAK,CAAC,CAAA;AACtB,IAAA,IAAI,GAAA,KAAQ,QAAW,OAAO,MAAA;AAE9B,IAAA,MAAM,KAAA,GAAQ,WAAW,GAAG,CAAA;AAC5B,IAAA,MAAM,KAAA,GAAQ,cAAc,KAAK,CAAA;AACjC,IAAA,IAAI,UAAU,IAAA,EAAM;AAClB,MAAA,KAAA,CAAM,KAAK,KAAK,CAAA;AAChB,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,OAAO,KAAA;AAAA,EACT,CAAA;AAEA,EAAA,MAAM,GAAA,GAAM,OAAO,GAAA,EAAa,KAAA,KAAqC;AACnE,IAAA,MAAM,KAAA,GAAQ,cAAc,KAAK,CAAA;AACjC,IAAA,IAAI,UAAU,IAAA,EAAM;AAClB,MAAA,MAAM,UAAU,IAAI,KAAA;AAAA,QAClB,CAAA,8DAAA,EAAiE,GAAG,CAAA,GAAA,EAAM,KAAK,CAAA;AAAA,OACjF;AACA,MAAA,IAAI,OAAA,EAAS;AACX,QAAA,OAAA,CAAQ,OAAO,CAAA;AACf,QAAA;AAAA,MACF;AACA,MAAA,MAAM,OAAA;AAAA,IACR;AAEA,IAAA,MAAM,IAAA,GAAO,MAAM,IAAA,KAAS,IAAA;AAC5B,IAAA,MAAM,GAAA,GAAM,IAAA,GAAO,IAAA,CAAK,SAAA,CAAU,MAAM,GAAG,CAAA,GAAI,KAAA,CAAM,IAAA,KAAS,UAAA,GAAa,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,QAAQ,CAAA,GAAI,IAAA;AAC5G,IAAA,MAAM,OAAA,GAAU,QAAQ,KAAA,CAAM,OAAA,KAAY,SAAY,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,OAAO,CAAA,GAAI,IAAA;AACtF,IAAA,MAAM,MAAA,GAAS,KAAA,CAAM,IAAA,KAAS,eAAA,GAAkB,MAAM,MAAA,GAAS,IAAA;AAC/D,IAAA,MAAM,MAAA,GAAS,MAAM,MAAA,IAAU,IAAA;AAC/B,IAAA,MAAM,KAAA,GAAQ,MAAM,KAAA,KAAU,MAAA,GAAY,KAAK,SAAA,CAAU,KAAA,CAAM,KAAK,CAAA,GAAI,IAAA;AACxE,IAAA,MAAM,SAAA,GAAY,IAAI,IAAA,CAAK,KAAA,CAAM,SAAS,CAAA;AAC1C,IAAA,MAAM,SAAA,GAAY,MAAM,SAAA,KAAc,MAAA,GAAY,IAAI,IAAA,CAAK,KAAA,CAAM,SAAS,CAAA,GAAI,IAAA;AAC9E,IAAA,MAAM,WAAA,GAAc,MAAM,iBAAA,IAAqB,IAAA;AAC/C,IAAA,MAAM,WAAA,GAAc,MAAM,SAAA,KAAc,IAAA;AACxC,IAAA,MAAM,UAAA,GAAa,MAAM,UAAA,KAAe,MAAA,GAAY,IAAI,IAAA,CAAK,KAAA,CAAM,UAAU,CAAA,GAAI,IAAA;AACjF,IAAA,MAAM,WAAA,GAAc,MAAM,WAAA,IAAe,IAAA;AACzC,IAAA,MAAM,QAAQ,KAAA,CAAM,IAAA,KAAS,eAAA,GAAkB,IAAA,GAAQ,MAAM,KAAA,IAAS,IAAA;AACtE,IAAA,MAAM,UAAU,KAAA,CAAM,IAAA,KAAS,IAAA,GAAQ,KAAA,CAAM,WAAW,IAAA,GAAQ,IAAA;AAEhE,IAAA,MAAM,IAAA,CAAK,KAAA;AAAA,MACT,eAAe,SAAS,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,8CAAA,CAAA;AAAA,MAiBxB,CAAC,GAAA,EAAK,KAAA,CAAM,IAAA,EAAM,MAAA,EAAQ,OAAO,GAAA,EAAK,OAAA,EAAS,KAAA,EAAO,MAAA,EAAQ,WAAW,SAAA,EAAW,WAAA,EAAa,WAAA,EAAa,UAAA,EAAY,aAAa,OAAO;AAAA,KAChJ;AAAA,EACF,CAAA;AAEA,EAAA,MAAM,GAAA,GAAM,OAAO,GAAA,KAA+B;AAChD,IAAA,MAAM,KAAK,KAAA,CAAM,CAAA,YAAA,EAAe,SAAS,CAAA,eAAA,CAAA,EAAmB,CAAC,GAAG,CAAC,CAAA;AAAA,EACnE,CAAA;AAEA,EAAA,MAAM,QAAQ,YAA2B;AACvC,IAAA,MAAM,IAAA,CAAK,KAAA,CAAM,CAAA,YAAA,EAAe,SAAS,CAAA,CAAE,CAAA;AAAA,EAC7C,CAAA;AAEA,EAAA,MAAM,OAAO,YAA+B;AAC1C,IAAA,MAAM,GAAA,GAAM,MAAM,IAAA,CAAK,KAAA;AAAA,MACrB,mBAAmB,SAAS,CAAA,+CAAA;AAAA,KAC9B;AACA,IAAA,OAAO,GAAA,CAAI,KAAK,GAAA,CAAI,CAAC,MAAM,MAAA,CAAO,CAAA,CAAE,KAAK,CAAC,CAAC,CAAA;AAAA,EAC7C,CAAA;AAGA,EAAA,MAAM,UAAU,YAAgE;AAC9E,IAAA,MAAM,GAAA,GAAM,MAAM,IAAA,CAAK,KAAA;AAAA,MACrB,CAAA,OAAA,EAAU,WAAW,CAAA,MAAA,EAAS,SAAS;AAAA,qDAAA;AAAA,KAEzC;AACA,IAAA,MAAM,MAAiD,EAAC;AACxD,IAAA,KAAA,MAAW,GAAA,IAAO,IAAI,IAAA,EAAM;AAC1B,MAAA,MAAM,GAAA,GAAM,MAAA,CAAO,GAAA,CAAI,KAAK,CAAC,CAAA;AAC7B,MAAA,MAAM,KAAA,GAAQ,WAAW,GAAG,CAAA;AAC5B,MAAA,MAAM,KAAA,GAAQ,cAAc,KAAK,CAAA;AACjC,MAAA,IAAI,UAAU,IAAA,EAAM;AAClB,QAAA,KAAA,CAAM,KAAK,KAAK,CAAA;AAChB,QAAA;AAAA,MACF;AACA,MAAA,GAAA,CAAI,IAAA,CAAK,EAAE,GAAA,EAAK,KAAA,EAAO,CAAA;AAAA,IACzB;AACA,IAAA,OAAO,GAAA;AAAA,EACT,CAAA;AAEA,EAAA,OAAO,EAAE,MAAM,QAAA,EAAU,GAAA,EAAK,KAAK,MAAA,EAAQ,GAAA,EAAK,KAAA,EAAO,IAAA,EAAM,OAAA,EAAQ;AACvE;;;ACnOO,IAAM,iBAAA,GAAoB,CAAC,MAAA,KAA2C;AAC3E,EAAA,MAAM,EAAE,EAAA,EAAI,EAAA,EAAI,OAAA,EAAQ,GAAI,MAAA;AAC5B,EAAA,MAAM,MAAA,GAAqB,OAAO,MAAA,IAAU,MAAA;AAK5C,EAAA,MAAM,OAAA,GAAU,OAAO,GAAA,EAAa,KAAA,KAAwC;AAC1E,IAAA,MAAM,KAAA,GAAQ,cAAc,KAAK,CAAA;AACjC,IAAA,IAAI,UAAU,IAAA,EAAM;AAClB,MAAA,MAAM,UAAU,IAAI,KAAA,CAAM,yDAAyD,GAAG,CAAA,GAAA,EAAM,KAAK,CAAA,CAAE,CAAA;AACnG,MAAA,IAAI,OAAA,UAAiB,OAAO,CAAA;AAAA,WACvB,OAAA,CAAQ,MAAM,OAAO,CAAA;AAC1B,MAAA,aAAA,CAAc,EAAA,CAAG,MAAA,CAAO,GAAG,CAAA,EAAG,OAAO,CAAA;AACrC,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,MAAM,EAAA,CAAG,GAAA,CAAI,GAAA,EAAK,KAAK,CAAA;AACvB,IAAA,OAAO,IAAA;AAAA,EACT,CAAA;AAEA,EAAA,MAAM,OAAO,YAA2B;AACtC,IAAA,MAAM,GAAG,IAAA,IAAO;AAChB,IAAA,MAAM,GAAG,IAAA,IAAO;AAEhB,IAAA,IAAI,WAAW,MAAA,EAAQ;AAEvB,IAAA,IAAI,OAAO,MAAA,KAAW,QAAA,IAAY,MAAA,CAAO,SAAS,SAAA,EAAW;AAC3D,MAAA,KAAA,MAAW,GAAA,IAAO,OAAO,YAAA,EAAc;AACrC,QAAA,MAAM,KAAA,GAAQ,MAAM,EAAA,CAAG,GAAA,CAAI,GAAG,CAAA;AAC9B,QAAA,IAAI,KAAA,KAAU,MAAA,EAAW,MAAM,OAAA,CAAQ,KAAK,KAAK,CAAA;AAAA,MACnD;AACA,MAAA;AAAA,IACF;AAIA,IAAA,IAAI,GAAG,OAAA,EAAS;AACd,MAAA,MAAM,GAAA,GAAM,MAAM,EAAA,CAAG,OAAA,EAAQ;AAC7B,MAAA,KAAA,MAAW,EAAE,KAAK,KAAA,EAAM,IAAK,KAAK,MAAM,OAAA,CAAQ,KAAK,KAAK,CAAA;AAC1D,MAAA;AAAA,IACF;AACA,IAAA,MAAMC,KAAAA,GAAO,MAAM,EAAA,CAAG,IAAA,EAAK;AAC3B,IAAA,KAAA,MAAW,OAAOA,KAAAA,EAAM;AACtB,MAAA,MAAM,KAAA,GAAQ,MAAM,EAAA,CAAG,GAAA,CAAI,GAAG,CAAA;AAC9B,MAAA,IAAI,KAAA,KAAU,MAAA,EAAW,MAAM,OAAA,CAAQ,KAAK,KAAK,CAAA;AAAA,IACnD;AAAA,EACF,CAAA;AAEA,EAAA,MAAM,GAAA,GAAM,OAAO,GAAA,KAAiD;AAClE,IAAA,MAAM,GAAA,GAAM,MAAM,EAAA,CAAG,GAAA,CAAI,GAAG,CAAA;AAC5B,IAAA,IAAI,GAAA,KAAQ,QAAW,OAAO,GAAA;AAE9B,IAAA,MAAM,MAAA,GAAS,MAAM,EAAA,CAAG,GAAA,CAAI,GAAG,CAAA;AAC/B,IAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AAEjC,IAAA,MAAM,EAAA,GAAK,MAAM,OAAA,CAAQ,GAAA,EAAK,MAAM,CAAA;AACpC,IAAA,OAAO,KAAK,MAAA,GAAS,MAAA;AAAA,EACvB,CAAA;AAEA,EAAA,MAAM,GAAA,GAAM,OAAO,GAAA,EAAa,KAAA,KAAqC;AACnE,IAAA,MAAM,EAAA,CAAG,GAAA,CAAI,GAAA,EAAK,KAAK,CAAA;AACvB,IAAA,aAAA,CAAc,EAAA,CAAG,GAAA,CAAI,GAAA,EAAK,KAAK,GAAG,OAAO,CAAA;AAAA,EAC3C,CAAA;AAEA,EAAA,MAAM,GAAA,GAAM,OAAO,GAAA,KAA+B;AAChD,IAAA,MAAM,EAAA,CAAG,OAAO,GAAG,CAAA;AACnB,IAAA,aAAA,CAAc,EAAA,CAAG,MAAA,CAAO,GAAG,CAAA,EAAG,OAAO,CAAA;AAAA,EACvC,CAAA;AAEA,EAAA,MAAM,QAAQ,YAA2B;AACvC,IAAA,MAAM,GAAG,KAAA,EAAM;AACf,IAAA,aAAA,CAAc,EAAA,CAAG,KAAA,EAAM,EAAG,OAAO,CAAA;AAAA,EACnC,CAAA;AAIA,EAAA,MAAM,IAAA,GAAO,YAA+B,EAAA,CAAG,IAAA,EAAK;AAEpD,EAAA,OAAO,EAAE,IAAA,EAAM,GAAA,EAAK,KAAK,MAAA,EAAQ,GAAA,EAAK,OAAO,IAAA,EAAM,GAAI,EAAA,CAAG,QAAA,KAAa,SAAY,EAAE,QAAA,EAAU,GAAG,QAAA,EAAS,GAAI,EAAC,EAAG;AACrH;ACzEA,IAAM,IAAA,GAAO,CAAC,CAAA,EAAY,CAAA,KACxB,MAAM,MAAA,IAAa,CAAA,KAAM,MAAA,GAAY,CAAA,KAAM,CAAA,GAAI,aAAA,CAAc,CAAC,CAAA,KAAM,cAAc,CAAC,CAAA;AAE9E,IAAM,SAAA,GAAY,OAAO,KAAA,EAAqB,OAAA,KAAkE;AACrH,EAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,IAAA,MAAM,QAAA,GAAW,MAAM,KAAA,CAAM,GAAA,CAAI,MAAM,WAAW,CAAA;AAElD,IAAA,IAAI,cAAc,KAAA,EAAO;AACvB,MAAA,MAAM,MAAA,GAAS,YAAA,CAAa,KAAA,CAAM,QAAQ,CAAA;AAC1C,MAAA,IAAI,MAAA,CAAO,SAAS,CAAA,EAAG;AACrB,QAAA,MAAM,IAAI,KAAA,CAAM,CAAA,eAAA,EAAkB,KAAA,CAAM,WAAW,CAAA;AAAA,EAAA,EAAkC,MAAA,CAAO,IAAA,CAAK,MAAM,CAAC,CAAA,CAAE,CAAA;AAAA,MAC5G;AACA,MAAA,MAAMC,QAAAA,GACJ,UAAU,IAAA,KAAS,UAAA,IACnB,SAAS,SAAA,KAAc,IAAA,IACvB,IAAA,CAAK,QAAA,CAAS,QAAA,EAAU,KAAA,CAAM,QAAQ,CAAA,IACtC,IAAA,CAAK,QAAA,CAAS,KAAA,EAAO,KAAA,CAAM,KAAK,KAChC,IAAA,CAAK,QAAA,CAAS,MAAA,EAAQ,KAAA,CAAM,MAAM,CAAA;AACpC,MAAA,IAAIA,QAAAA,EAAS;AACb,MAAA,MAAM,KAAA,CAAM,GAAA,CAAI,KAAA,CAAM,WAAA,EAAa;AAAA,QACjC,IAAA,EAAM,UAAA;AAAA,QACN,UAAU,KAAA,CAAM,QAAA;AAAA,QAChB,GAAI,MAAM,KAAA,KAAU,MAAA,GAAY,EAAE,KAAA,EAAO,KAAA,CAAM,KAAA,EAAM,GAAI,EAAC;AAAA,QAC1D,GAAI,MAAM,MAAA,KAAW,MAAA,GAAY,EAAE,MAAA,EAAQ,KAAA,CAAM,MAAA,EAAO,GAAI,EAAC;AAAA,QAC7D,SAAA,EAAW,IAAA;AAAA,QACX,SAAA,EAAW,KAAK,GAAA;AAAI,OACrB,CAAA;AACD,MAAA;AAAA,IACF;AAIA,IAAA,MAAM,OAAA,GAAU,MAAM,OAAA,CAAQ,KAAA,CAAM,WAAW,EAAE,IAAA,EAAM,YAAY,CAAA;AAGnE,IAAA,MAAM,UACJ,QAAA,EAAU,IAAA,KAAS,QACnB,QAAA,CAAS,SAAA,KAAc,QACvB,QAAA,CAAS,OAAA,EAAS,KAAK,WAAA,KAAgB,OAAA,CAAQ,KAAK,WAAA,IACpD,IAAA,CAAK,SAAS,GAAA,EAAK,KAAA,CAAM,GAAG,CAAA,IAC5B,IAAA,CAAK,QAAA,CAAS,KAAA,EAAO,MAAM,KAAK,CAAA,IAChC,KAAK,QAAA,CAAS,KAAA,EAAO,MAAM,KAAK,CAAA,IAChC,KAAK,QAAA,CAAS,MAAA,EAAQ,MAAM,MAAM,CAAA,IAAA,CACjC,SAAS,OAAA,IAAW,UAAA,OAAiB,MAAM,OAAA,IAAW,UAAA,CAAA;AACzD,IAAA,IAAI,OAAA,EAAS;AACb,IAAA,MAAM,KAAA,CAAM,GAAA,CAAI,KAAA,CAAM,WAAA,EAAa;AAAA,MACjC,IAAA,EAAM,IAAA;AAAA,MACN,GAAI,MAAM,OAAA,KAAY,MAAA,GAAY,EAAE,OAAA,EAAS,KAAA,CAAM,OAAA,EAAQ,GAAI,EAAC;AAAA,MAChE,KAAK,KAAA,CAAM,GAAA;AAAA,MACX,OAAA;AAAA,MACA,GAAI,MAAM,KAAA,KAAU,MAAA,GAAY,EAAE,KAAA,EAAO,KAAA,CAAM,KAAA,EAAM,GAAI,EAAC;AAAA,MAC1D,GAAI,MAAM,MAAA,KAAW,MAAA,GAAY,EAAE,MAAA,EAAQ,KAAA,CAAM,MAAA,EAAO,GAAI,EAAC;AAAA,MAC7D,GAAI,MAAM,KAAA,KAAU,MAAA,GAAY,EAAE,KAAA,EAAO,KAAA,CAAM,KAAA,EAAM,GAAI,EAAC;AAAA,MAC1D,SAAA,EAAW,IAAA;AAAA,MACX,SAAA,EAAW,KAAK,GAAA;AAAI,KACrB,CAAA;AAAA,EACH;AACF","file":"index.js","sourcesContent":["import type { Query } from '../schemas/query.schema.js';\nimport type { Filter } from '../schemas/filter.schema.js';\nimport type { ComputeExpression } from '../schemas/compute.schema.js';\nimport type { AggregateExpression } from '../schemas/aggregate.schema.js';\nimport type { FieldOrValue } from '../schemas/value.schema.js';\nimport { refuseOptional } from '../engine/optional.js';\nimport { isFieldPathShape } from '../schemas/identifier.schema.js';\n\n// ───────────────────────────────────────────────────────────────\n// Helpers\n// ───────────────────────────────────────────────────────────────\n\nexport const extractEntityFromPath = (path: string): string | undefined => {\n const parts = path.split('.');\n return parts.length === 2 ? parts[0] : undefined;\n};\n\n// A VALUE is a column only when it is shaped like one — the resolver and the\n// compiler use the same rule, so a literal like \"u1@x.com\" is never mistaken\n// for a table here and refused as one. (Field positions below keep the looser\n// split: over-collecting there can only refuse more, and the resolver refuses\n// anything in a field position that is not a real column anyway.)\nconst collectFromFieldOrValue = (fov: FieldOrValue, out: Set<string>): void => {\n if (isFieldPathShape(fov)) {\n const entity = extractEntityFromPath(fov);\n if (entity !== undefined) out.add(entity);\n }\n // numbers, booleans, null, $context, $scope — no entity to extract\n};\n\n// ───────────────────────────────────────────────────────────────\n// Filter walker\n// ───────────────────────────────────────────────────────────────\n\nconst collectFromFilter = (filter: Filter, out: Set<string>): void => {\n // An EXISTS reads tables, so its tables are discovered like any other — a\n // denied entity cannot be reached by hiding it inside a subquery.\n if ('exists' in filter) {\n for (const entity of filter.exists.from) out.add(entity);\n if (filter.exists.filter !== undefined) collectFromFilter(filter.exists.filter, out);\n return;\n }\n\n if ('eq' in filter || 'neq' in filter || 'gt' in filter || 'gte' in filter || 'lt' in filter || 'lte' in filter) {\n const pair = ('eq' in filter) ? filter.eq\n : ('neq' in filter) ? filter.neq\n : ('gt' in filter) ? filter.gt\n : ('gte' in filter) ? filter.gte\n : ('lt' in filter) ? filter.lt\n : filter.lte;\n collectFromFieldOrValue(pair[0], out);\n collectFromFieldOrValue(pair[1], out);\n return;\n }\n\n if ('in' in filter || 'notIn' in filter) {\n const tuple = 'in' in filter ? filter.in : filter.notIn;\n const entity = extractEntityFromPath(tuple[0]);\n if (entity !== undefined) out.add(entity);\n const target = tuple[1];\n if (Array.isArray(target)) {\n for (const v of target) {\n collectFromFieldOrValue(v, out);\n }\n }\n // ContextRef / ScopeRef — no entity\n return;\n }\n\n if ('like' in filter || 'ilike' in filter) {\n const tuple = 'like' in filter ? filter.like : filter.ilike;\n const entity = extractEntityFromPath(tuple[0]);\n if (entity !== undefined) out.add(entity);\n collectFromFieldOrValue(tuple[1], out);\n return;\n }\n\n if ('isNull' in filter) {\n const entity = extractEntityFromPath(filter.isNull);\n if (entity !== undefined) out.add(entity);\n return;\n }\n\n if ('isNotNull' in filter) {\n const entity = extractEntityFromPath(filter.isNotNull);\n if (entity !== undefined) out.add(entity);\n return;\n }\n\n if ('and' in filter) {\n for (const sub of filter.and) {\n collectFromFilter(sub, out);\n }\n return;\n }\n\n if ('or' in filter) {\n for (const sub of filter.or) {\n collectFromFilter(sub, out);\n }\n return;\n }\n\n if ('not' in filter) {\n collectFromFilter(filter.not, out);\n return;\n }\n\n if ('semantic' in filter) {\n const entity = extractEntityFromPath(filter.semantic.field);\n if (entity !== undefined) out.add(entity);\n return;\n }\n\n if ('fuzzy' in filter) {\n const entity = extractEntityFromPath(filter.fuzzy.field);\n if (entity !== undefined) out.add(entity);\n return;\n }\n\n // THE ONE THAT MATTERS. This walker decides which entities get scope\n // injected; a node it does not recognise falls through and contributes\n // nothing, so an entity mentioned only inside an unrecognised node would be\n // read WITHOUT a tenant filter. `optional` is resolved before the pipeline\n // (engine/optional.ts) precisely so it can never reach here — and if it ever\n // does, that is a scope hole, not a missing feature.\n if ('optional' in filter) refuseOptional('scope discovery');\n};\n\n// ───────────────────────────────────────────────────────────────\n// Compute walker\n// ───────────────────────────────────────────────────────────────\n\nconst collectFromCompute = (expr: ComputeExpression, out: Set<string>): void => {\n if ('add' in expr || 'subtract' in expr || 'multiply' in expr || 'divide' in expr) {\n const pair = ('add' in expr) ? expr.add\n : ('subtract' in expr) ? expr.subtract\n : ('multiply' in expr) ? expr.multiply\n : expr.divide;\n collectFromFieldOrValue(pair[0], out);\n collectFromFieldOrValue(pair[1], out);\n return;\n }\n\n if ('concat' in expr) {\n for (const v of expr.concat) {\n collectFromFieldOrValue(v, out);\n }\n return;\n }\n\n if ('coalesce' in expr) {\n for (const v of expr.coalesce) {\n collectFromFieldOrValue(v, out);\n }\n return;\n }\n\n if ('case' in expr) {\n for (const when of expr.case.when) {\n collectFromFilter(when.condition, out);\n collectFromFieldOrValue(when.then, out);\n }\n collectFromFieldOrValue(expr.case.else, out);\n return;\n }\n};\n\n// ───────────────────────────────────────────────────────────────\n// Aggregate walker\n// ───────────────────────────────────────────────────────────────\n\nconst collectFromAggregate = (expr: AggregateExpression, out: Set<string>): void => {\n const arg = ('count' in expr) ? expr.count\n : ('countDistinct' in expr) ? expr.countDistinct\n : ('sum' in expr) ? expr.sum\n : ('avg' in expr) ? expr.avg\n : ('min' in expr) ? expr.min\n : expr.max;\n // sum/avg/min/max may take a compute expression — walk it for entities.\n if (typeof arg !== 'string') {\n collectFromCompute(arg, out);\n return;\n }\n const entity = extractEntityFromPath(arg);\n if (entity !== undefined) out.add(entity);\n};\n\n// ───────────────────────────────────────────────────────────────\n// Public API\n// ───────────────────────────────────────────────────────────────\n\nconst collectFromQuery = (dsl: Query, out: Set<string>): void => {\n // A subquery source introduces an ALIAS (`{ as: 'c', query }`): a derived\n // relation, not a table. References to the alias at this level (`c.n`) are\n // not entities — the subquery's REAL tables are collected (and scoped) by\n // the recursion. Everything referenced at this level lands in `local`\n // first, and aliases are subtracted before merging into `out`.\n const aliases = new Set<string>();\n const local = new Set<string>();\n\n // from\n for (const source of dsl.from) {\n if (typeof source === 'string') {\n out.add(source);\n } else {\n aliases.add(source.as);\n collectFromQuery(source.query, out);\n }\n }\n\n // fields (optional; an entry may be a bare path or { field, as })\n for (const ref of dsl.fields ?? []) {\n const entity = extractEntityFromPath(typeof ref === 'string' ? ref : ref.field);\n if (entity !== undefined) local.add(entity);\n }\n\n // filter\n if (dsl.filter !== undefined) {\n collectFromFilter(dsl.filter, local);\n }\n\n // compute\n if (dsl.compute !== undefined) {\n for (const key of Object.keys(dsl.compute)) {\n const expr = dsl.compute[key];\n if (expr !== undefined) {\n collectFromCompute(expr, local);\n }\n }\n }\n\n // aggregate\n if (dsl.aggregate !== undefined) {\n for (const key of Object.keys(dsl.aggregate)) {\n const expr = dsl.aggregate[key];\n if (expr !== undefined) {\n collectFromAggregate(expr, local);\n }\n }\n }\n\n // groupBy\n if (dsl.groupBy !== undefined) {\n for (const path of dsl.groupBy) {\n const entity = extractEntityFromPath(path);\n if (entity !== undefined) local.add(entity);\n }\n }\n\n // sort\n if (dsl.sort !== undefined) {\n for (const entry of dsl.sort) {\n const entity = extractEntityFromPath(entry.field);\n if (entity !== undefined) local.add(entity);\n }\n }\n\n for (const entity of local) {\n if (!aliases.has(entity)) out.add(entity);\n }\n};\n\nexport const discoverEntities = (dsl: Query): Set<string> => {\n const entities = new Set<string>();\n collectFromQuery(dsl, entities);\n return entities;\n};\n","import type { ScopePolicy, ScopeMatch, ScopeRule, ScopeValues } from './scope.types.js';\nimport { isSetMatch } from './scope.types.js';\nimport type { ScopeBinding } from '../types.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Grants — a ScopePolicy described as strings.\n//\n// A grant is `<table>.<verb>` where the verb is one of SCOPE_VERBS —\n// vex's own phase grammar as leaves: `read`, plus the three write ops\n// under the `write` namespace. `write` itself is never a grant; a caller\n// that means \"every write\" grants all three (an ACL layer above does\n// that with a glob — `deals.write.*`).\n//\n// The dialect exists so a policy layer (a charter, a role system, a\n// config file) can hand vex a flat string set and get vex's native\n// contract back — with no imports in either direction: the strings are\n// opaque to the layer that resolves them and native to vex, which is\n// where their meaning lives.\n// ═══════════════════════════════════════════════════════════════\n\nexport const SCOPE_VERBS = ['read', 'write.insert', 'write.update', 'write.delete'] as const;\n\n// Every grant a set of tables can carry — tables × SCOPE_VERBS. The full\n// set a policy layer resolves selections against; derived, never authored\n// (a server derives `tables` from the introspected schema).\nexport const scopeGrants = (tables: readonly string[]): string[] =>\n tables.flatMap((t) => SCOPE_VERBS.map((v) => `${t}.${v}`));\n\n// The static, app-owned row behaviors: per table, what a GRANTED phase\n// does. NOT access control — listing a table here grants nothing; the\n// grant set decides whether a phase exists. `write` behaviors apply to\n// every granted write phase (the umbrella, applied at build time); the\n// specific keys stack on top for their op. Deliberately the rules-only\n// subset of ScopeEntityRule: its `public`/`deny` variants are access\n// control, which behaviors must never carry.\nexport type ScopeRules = { read?: ScopeMatch[]; write?: ScopeRule[]; insert?: ScopeRule[]; update?: ScopeRule[]; delete?: ScopeMatch[] };\n\n// A table carries EITHER one rule set — the shape above, unchanged — or several\n// NAMED ones, of which `default` is what an unprofiled principal gets.\n//\n// WHY: scoping used to be a property of the TABLE, so every rung holding any\n// grant on it got the same reach. \"The desk reads every booking; a member reads\n// their own\" was therefore unsayable, and the only way to say it was a SECOND\n// TABLE carrying the tighter rule — one fact in two places, kept level by a\n// trigger, drifting the first time the trigger was wrong.\n//\n// Reach is a property of the RUNG, not of the grant and not of the table: a\n// member acts for themselves whatever they are reading. So the profile is\n// chosen once, per principal, and applies to every table they touch — falling\n// back to a table's `default` where it declares no variant, which is what makes\n// the common case (a shared timetable, read the ordinary way) need no entry.\n//\n// The two shapes are told apart by their keys: a rule set has at least one of\n// read/write/insert/update/delete, a named map has none of them.\nexport type NamedScopeBehaviors = Record<string, ScopeRules>;\n\nexport type ScopeBehaviors = Record<string, ScopeRules | NamedScopeBehaviors>;\n\nconst RULE_KEYS = ['read', 'write', 'insert', 'update', 'delete'] as const;\n\nconst isRuleSet = (value: ScopeRules | NamedScopeBehaviors): value is ScopeRules =>\n RULE_KEYS.some((k) => k in value);\n\n// THE LOOKUP.\n//\n// A table with no entry at all is rule-free, as before — listing a table in\n// behaviors was never what granted it.\n//\n// A table declaring NAMED variants and no `default` refuses an unprofiled\n// principal rather than falling through to no rules. That is the fail-closed\n// half: a table whose author went to the trouble of naming its reaches is one\n// where \"no rule\" is not a safe guess.\nconst behaviorFor = (behaviors: ScopeBehaviors, table: string, profile: string | undefined): ScopeRules | undefined => {\n const entry = behaviors[table];\n if (entry === undefined) return {};\n if (isRuleSet(entry)) return entry;\n // Named map: the profile if the table declares it, otherwise the default.\n return (profile === undefined ? undefined : entry[profile]) ?? entry['default'];\n};\n\nconst onlyMatches = (rules: ScopeRule[]): ScopeMatch[] => rules.filter((r): r is ScopeMatch => 'match' in r);\n\n// Grants + behaviors → a ScopePolicy. Each granted leaf becomes a\n// SPECIFIC phase (the builder never emits the `write` umbrella — the\n// caller already resolved it, so the output is exact); a granted phase\n// carries the table's umbrella behaviors plus its op's own, and delete\n// keeps matches only (nothing to set). Ungranted phases are absent, and\n// `default: 'deny'` refuses them — deny by absence.\nconst VERBS: ReadonlySet<string> = new Set(SCOPE_VERBS);\n\n// ═══════════════════════════════════════════════════════════════\n// WHO \"ME\" IS, READ OFF THE BEHAVIORS.\n//\n// A rule binds a column to a scope key — `{ set: 'member_id', to: 'userId' }`,\n// `{ match: 'studio_id', to: 'tenantId' }` — and the scope values are always\n// the caller's own. So a column bound to a key the caller carries holds that\n// value on the caller's own rows, whatever either is called: this is read from\n// what the host DECLARED, never guessed from a name. Every reach and every\n// phase counts, because which column is the caller's does not depend on what\n// this caller may do to it — a reader holds no insert, yet the insert's stamp\n// is what says `member_id` is them.\n// ═══════════════════════════════════════════════════════════════\n\n/** Every rule a table declares, in every reach and phase, as (column, key) pairs. */\nconst bindingsOf = (entry: ScopeRules | NamedScopeBehaviors): { field: string; key: string }[] =>\n (isRuleSet(entry) ? [entry] : Object.values(entry)).flatMap((rules) =>\n RULE_KEYS.flatMap((phase) =>\n (rules[phase] ?? []).map((rule: ScopeRule) =>\n 'set' in rule ? { field: rule.set, key: rule.to } : isSetMatch(rule) ? { field: rule.match, key: rule.in } : { field: rule.match, key: rule.to },\n ),\n ),\n );\n\n/**\n * The columns the behaviors bind to scope keys, on the given tables, for the\n * keys present in `scope` — sorted, one per (table, column, key).\n */\nexport const scopeBindings = (behaviors: ScopeBehaviors, tables: readonly string[], scope: ScopeValues): ScopeBinding[] => {\n const seen = new Map<string, ScopeBinding>();\n for (const table of tables) {\n const entry = behaviors[table];\n if (entry === undefined) continue;\n for (const { field, key } of bindingsOf(entry)) {\n if (scope[key] === undefined || scope[key] === null) continue;\n seen.set(`${table}.${field}:${key}`, { entity: table, field, key });\n }\n }\n return [...seen.values()].sort((a, b) => `${a.entity}.${a.field}:${a.key}`.localeCompare(`${b.entity}.${b.field}:${b.key}`));\n};\n\n/** Every (table, column) any rule names — for checking them against a schema. */\nexport const behaviorColumns = (behaviors: ScopeBehaviors): { entity: string; field: string }[] =>\n Object.entries(behaviors).flatMap(([table, entry]) => bindingsOf(entry).map(({ field }) => ({ entity: table, field })));\n\n/** Every profile name any table declares. A profile nobody declares is a typo. */\nexport const scopeProfiles = (behaviors: ScopeBehaviors): ReadonlySet<string> => {\n const names = new Set<string>();\n for (const entry of Object.values(behaviors)) {\n if (isRuleSet(entry)) continue;\n for (const name of Object.keys(entry)) if (name !== 'default') names.add(name);\n }\n return names;\n};\n\n// `scoping` names the principal's profile — the rung's answer to \"how far does\n// this person reach\", chosen once and applied to every table they touch. An\n// UNKNOWN profile is refused wholesale: it cannot silently mean \"the default\",\n// because a mistyped profile would then widen a member to every row in every\n// table they hold a grant on. That is the one failure mode a policy layer may\n// not have, so it is a hard refusal rather than a fallback.\nexport const createScopePolicy = (\n grants: ReadonlySet<string>,\n behaviors: ScopeBehaviors = {},\n scoping?: string,\n): ScopePolicy => {\n if (scoping !== undefined && !scopeProfiles(behaviors).has(scoping)) return { default: 'deny', entities: {} };\n const entities: Record<string, { read?: ScopeMatch[]; insert?: ScopeRule[]; update?: ScopeRule[]; delete?: ScopeMatch[] }> = {};\n for (const grant of grants) {\n const dot = grant.indexOf('.'); // table names carry no dots; the rest is the verb\n if (dot < 0) continue;\n const table = grant.slice(0, dot);\n const verb = grant.slice(dot + 1);\n if (!VERBS.has(verb)) continue; // a malformed verb grants nothing, not even an entity entry\n const b = behaviorFor(behaviors, table, scoping);\n if (b === undefined) continue; // the profile names nothing for this table — grant nothing\n const rule = (entities[table] ??= {});\n if (verb === 'read') rule.read = b?.read ?? [];\n else if (verb === 'write.insert') rule.insert = [...(b?.write ?? []), ...(b?.insert ?? [])];\n else if (verb === 'write.update') rule.update = [...(b?.write ?? []), ...(b?.update ?? [])];\n else if (verb === 'write.delete') rule.delete = [...onlyMatches(b?.write ?? []), ...(b?.delete ?? [])];\n }\n return { default: 'deny', entities };\n};\n\n// ═══════════════════════════════════════════════════════════════\n// A PRINCIPAL MAY HOLD SEVERAL ROLES, and reach belongs to the role.\n//\n// One policy per principal assumes one role per principal. That assumption\n// survives right up until somebody is two things at once — an instructor who\n// also trains is staff on the roster and a member in the class — and then a\n// single profile cannot describe them: studio-wide on the read they do as\n// staff, their own rows on the write they do as a member.\n//\n// So a policy is compiled PER ROLE, each with that role's own reach, and the\n// results are merged here. A principal may do anything any of their roles\n// permits, which is what makes holding two roles additive rather than a\n// conflict to be refused.\n//\n// MERGE RULE: per entity and phase, the BROADEST rule set wins — fewest match\n// rules, since every match narrows. Profiles are refinements of a default\n// (personal = the tenant rule plus one more), so \"fewest\" is \"widest\" in\n// practice, and a phase only one role grants keeps that role's rules intact\n// (which is what carries a member's identity stamp onto a write no other role\n// grants).\n// ═══════════════════════════════════════════════════════════════\n\nconst matchCount = (rules: readonly (ScopeMatch | ScopeRule)[] | undefined): number =>\n (rules ?? []).filter((r) => 'match' in r).length;\n\n/** The union of several compiled policies: anything any of them permits. */\nexport const mergeScopePolicies = (policies: readonly ScopePolicy[]): ScopePolicy => {\n const entities: Record<string, { read?: ScopeMatch[]; insert?: ScopeRule[]; update?: ScopeRule[]; delete?: ScopeMatch[] }> = {};\n for (const policy of policies) {\n for (const [table, rule] of Object.entries(policy.entities)) {\n if (rule === undefined || 'public' in rule || 'deny' in rule) continue;\n const into = (entities[table] ??= {});\n for (const phase of ['read', 'insert', 'update', 'delete'] as const) {\n const incoming = rule[phase];\n if (incoming === undefined) continue;\n const held = into[phase];\n // Absent means the phase is refused, so the first grant always wins the\n // slot; after that, fewer matches means wider access.\n if (held === undefined || matchCount(incoming) < matchCount(held)) {\n (into as Record<string, unknown>)[phase] = incoming;\n }\n }\n }\n }\n return { default: 'deny', entities };\n};\n","import type { Query } from '../schemas/query.schema.js';\nimport type { Filter } from '../schemas/filter.schema.js';\nimport type { ComputeExpression } from '../schemas/compute.schema.js';\nimport type { AggregateExpression } from '../schemas/aggregate.schema.js';\nimport type { FieldOrValue } from '../schemas/value.schema.js';\nimport { refuseOptional } from './optional.js';\nimport type { DatabaseSchema, EntitySchema, FieldSchema, NormalizedType } from '../schemas/database.schema.js';\nimport type {\n ResolvedQuery,\n ResolvedSource,\n ResolvedField,\n ResolvedJoin,\n ResolvedFilter,\n ResolvedSemantic,\n ResolvedExists,\n} from './engine.types.js';\nimport { VexError } from '../errors.js';\nimport { isFieldPathShape, isIdentifier } from '../schemas/identifier.schema.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Levenshtein distance for \"did you mean?\" suggestions\n// ═══════════════════════════════════════════════════════════════\n\nconst levenshtein = (a: string, b: string): number => {\n const la = a.length;\n const lb = b.length;\n if (la === 0) return lb;\n if (lb === 0) return la;\n\n // Two-row approach to save memory\n let prev = Array.from({ length: lb + 1 }, (_, i) => i);\n let curr = new Array<number>(lb + 1);\n\n for (let i = 1; i <= la; i++) {\n curr[0] = i;\n for (let j = 1; j <= lb; j++) {\n const cost = a[i - 1] === b[j - 1] ? 0 : 1;\n const prevJ = prev[j] ?? 0;\n const currJ1 = curr[j - 1] ?? 0;\n const prevJ1 = prev[j - 1] ?? 0;\n curr[j] = Math.min(prevJ + 1, currJ1 + 1, prevJ1 + cost);\n }\n [prev, curr] = [curr, prev];\n }\n\n return prev[lb] ?? 0;\n};\n\nconst findClosest = (target: string, candidates: string[]): string | undefined => {\n let best: string | undefined;\n let bestDist = Infinity;\n for (const c of candidates) {\n const dist = levenshtein(target.toLowerCase(), c.toLowerCase());\n if (dist < bestDist) {\n bestDist = dist;\n best = c;\n }\n }\n // Only suggest if reasonably close\n if (bestDist <= Math.max(3, Math.ceil(target.length / 2))) {\n return best;\n }\n return undefined;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Alias generation\n// ═══════════════════════════════════════════════════════════════\n\ntype AliasCounter = Map<string, number>;\n\nconst generateAlias = (name: string, counter: AliasCounter): string => {\n const prefix = name.charAt(0).toLowerCase();\n const current = counter.get(prefix) ?? 0;\n const next = current + 1;\n counter.set(prefix, next);\n return `${prefix}${next}`;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Entity & field lookup\n// ═══════════════════════════════════════════════════════════════\n\nconst findEntity = (name: string, schema: DatabaseSchema): EntitySchema => {\n const found = schema.entities.find((e) => e.name === name);\n if (found !== undefined) return found;\n\n const allNames = schema.entities.map((e) => e.name);\n const suggestion = findClosest(name, allNames);\n const hint = suggestion !== undefined ? ` Did you mean \"${suggestion}\"?` : '';\n throw new VexError(\n 'invalid_dsl',\n `Entity \"${name}\" not found in schema.${hint}`,\n { suggestion, options: allNames },\n );\n};\n\nconst findField = (fieldName: string, entity: EntitySchema): FieldSchema => {\n const found = entity.fields.find((f) => f.name === fieldName);\n if (found !== undefined) return found;\n\n const allFields = entity.fields.map((f) => f.name);\n const suggestion = findClosest(fieldName, allFields);\n const hint = suggestion !== undefined ? ` Did you mean \"${suggestion}\"?` : '';\n throw new VexError(\n 'invalid_dsl',\n `Field \"${fieldName}\" not found on entity \"${entity.name}\".${hint} Available fields: ${allFields.join(', ')}`,\n { suggestion, options: allFields },\n );\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Path parsing\n// ═══════════════════════════════════════════════════════════════\n\n// Both halves are names, so both are held to the name grammar — a field path\n// that resolves is a column the schema has, and one that does not is refused\n// here rather than reaching SQL as text.\nconst parsePath = (path: string): { entity: string; field: string } => {\n if (!isFieldPathShape(path)) {\n throw new VexError(\n 'invalid_dsl',\n `Invalid field path \"${path}\". Expected format: entity.field`,\n );\n }\n const dotIndex = path.indexOf('.');\n return {\n entity: path.substring(0, dotIndex),\n field: path.substring(dotIndex + 1),\n };\n};\n\n// A name the author chose — an output alias, a compute or aggregate key, a\n// subquery alias — becomes SQL text, so it must be a name and nothing else.\n// The schema says the same thing; this says it for a DSL that skipped the\n// schema (`engine.compile`, `engine.test`).\nconst assertName = (name: string, what: string): void => {\n if (!isIdentifier(name)) {\n throw new VexError('invalid_dsl', `Invalid ${what} \"${name}\": letters, digits and underscores, not starting with a digit.`);\n }\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Join discovery\n// ═══════════════════════════════════════════════════════════════\n\nconst findJoinBetween = (\n fromEntity: EntitySchema,\n toEntity: EntitySchema,\n fromAlias: string,\n toAlias: string,\n): ResolvedJoin | undefined => {\n // Check if fromEntity has a relation pointing to toEntity. The FK columns\n // live on the referencing side — when ANY of them is nullable, the join is\n // LEFT so a null never silently drops the referencing row. Any, not the\n // first: a composite key is MATCH SIMPLE by default, unenforced as a whole\n // once one column is null, so the row exists with no counterpart to join.\n for (const rel of fromEntity.relations) {\n if (rel.entity === toEntity.name) {\n const fkNullable = rel.localFields.some(\n (column) => fromEntity.fields.find((f) => f.name === column)?.nullable === true,\n );\n return {\n fromAlias,\n fromColumns: rel.localFields,\n toAlias,\n toColumns: rel.foreignFields,\n toTable: toEntity.table,\n kind: fkNullable ? 'left' : 'inner',\n };\n }\n }\n\n // Check reverse: toEntity has a relation pointing to fromEntity — a\n // one-to-many expansion (rows multiply per child), inner by design.\n for (const rel of toEntity.relations) {\n if (rel.entity === fromEntity.name) {\n return {\n fromAlias,\n fromColumns: rel.foreignFields,\n toAlias,\n toColumns: rel.localFields,\n toTable: toEntity.table,\n kind: 'inner',\n };\n }\n }\n\n return undefined;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Filter path resolution\n// ═══════════════════════════════════════════════════════════════\n\ntype PathResolution = { alias: string; column: string; schema: FieldSchema };\ntype EntityLookup = Map<string, { entity: EntitySchema; alias: string }>;\n\nconst resolveFieldPath = (\n path: string,\n entityLookup: EntityLookup,\n schema: DatabaseSchema,\n): { resolved: ResolvedField; entityName: string } => {\n const parsed = parsePath(path);\n const lookup = entityLookup.get(parsed.entity);\n\n if (lookup === undefined) {\n // Check if it's a known entity that's not in from\n const entityExists = schema.entities.some((e) => e.name === parsed.entity);\n if (entityExists) {\n throw new VexError(\n 'invalid_dsl',\n `Entity \"${parsed.entity}\" is referenced in field path \"${path}\" but not listed in \"from\"`,\n );\n }\n const allNames = schema.entities.map((e) => e.name);\n const suggestion = findClosest(parsed.entity, allNames);\n const hint = suggestion !== undefined ? ` Did you mean \"${suggestion}\"?` : '';\n throw new VexError(\n 'invalid_dsl',\n `Entity \"${parsed.entity}\" not found in schema.${hint}`,\n { suggestion, options: allNames },\n );\n }\n\n const fieldSchema = findField(parsed.field, lookup.entity);\n\n return {\n resolved: {\n path,\n alias: lookup.alias,\n column: fieldSchema.name,\n outputName: parsed.field,\n schema: fieldSchema,\n },\n entityName: parsed.entity,\n };\n};\n\n// In a VALUE position, a string is a column exactly when it is shaped like one;\n// anything else is a literal. (In a FIELD position there is no such choice —\n// see resolveFilterFieldPath.)\nconst isFieldPath = isFieldPathShape;\n\nconst collectFilterPaths = (\n filter: Filter,\n entityLookup: EntityLookup,\n schema: DatabaseSchema,\n resolvedPaths: Map<string, PathResolution>,\n // Both optional for a caller that structurally cannot meet an `exists`\n // (aggregate arguments). The filter path AND the compute-case path pass\n // them, so an exists resolves identically wherever a condition may sit —\n // which is what lets a derived standing ask \"do they hold a subscription?\"\n // from inside a computed CASE.\n existsOut?: Map<object, ResolvedExists>,\n aliasCounter?: AliasCounter,\n): void => {\n if ('eq' in filter || 'neq' in filter || 'gt' in filter || 'gte' in filter || 'lt' in filter || 'lte' in filter) {\n const pair = ('eq' in filter) ? filter.eq\n : ('neq' in filter) ? filter.neq\n : ('gt' in filter) ? filter.gt\n : ('gte' in filter) ? filter.gte\n : ('lt' in filter) ? filter.lt\n : filter.lte;\n resolveFilterFieldOrValue(pair[0], entityLookup, schema, resolvedPaths);\n resolveFilterFieldOrValue(pair[1], entityLookup, schema, resolvedPaths);\n return;\n }\n\n if ('in' in filter || 'notIn' in filter) {\n const tuple = 'in' in filter ? filter.in : filter.notIn;\n resolveFilterFieldPath(tuple[0], entityLookup, schema, resolvedPaths);\n const target = tuple[1];\n if (Array.isArray(target)) {\n for (const v of target) {\n resolveFilterFieldOrValue(v, entityLookup, schema, resolvedPaths);\n }\n }\n return;\n }\n\n if ('like' in filter || 'ilike' in filter) {\n const tuple = 'like' in filter ? filter.like : filter.ilike;\n resolveFilterFieldPath(tuple[0], entityLookup, schema, resolvedPaths);\n resolveFilterFieldOrValue(tuple[1], entityLookup, schema, resolvedPaths);\n return;\n }\n\n if ('isNull' in filter) {\n resolveFilterFieldPath(filter.isNull, entityLookup, schema, resolvedPaths);\n return;\n }\n\n if ('isNotNull' in filter) {\n resolveFilterFieldPath(filter.isNotNull, entityLookup, schema, resolvedPaths);\n return;\n }\n\n // An EXISTS resolves as its own little query, and is recorded against the\n // node so the compiler can find it again. Its sources are added to a lookup\n // LAYERED OVER the outer one: an inner path resolves to the inner alias, and\n // anything the inner filter mentions that the subquery does not read falls\n // through to the outer query — which is exactly what a correlation is.\n if ('exists' in filter) {\n if (existsOut === undefined || aliasCounter === undefined) return;\n const inner: EntityLookup = new Map(entityLookup);\n const innerSources: ResolvedSource[] = [];\n const innerEntities: Array<{ entity: EntitySchema; alias: string }> = [];\n const innerJoins: ResolvedJoin[] = [];\n const innerAliasMap = new Map<string, string>();\n\n for (const name of filter.exists.from) {\n const entity = findEntity(name, schema);\n // The alias counter is SHARED with the outer query, so an inner `rooms`\n // can never take the same alias as an outer one and quietly correlate a\n // table with itself.\n const alias = generateAlias(name, aliasCounter);\n inner.set(name, { entity, alias });\n innerSources.push({ alias, entity, table: entity.table });\n innerEntities.push({ entity, alias });\n }\n\n for (let i = 1; i < innerEntities.length; i += 1) {\n const curr = innerEntities[i];\n if (curr === undefined) continue;\n let found = false;\n for (let j = 0; j < i; j += 1) {\n const earlier = innerEntities[j];\n if (earlier === undefined) continue;\n const join = findJoinBetween(earlier.entity, curr.entity, earlier.alias, curr.alias);\n if (join !== undefined) {\n innerJoins.push(join);\n found = true;\n break;\n }\n }\n if (!found) throw new VexError('invalid_dsl', `No foreign key relationship found between the entities of an \"exists\" and \"${curr.entity.name}\".`);\n }\n\n let innerFilter: ResolvedFilter | undefined;\n if (filter.exists.filter !== undefined) {\n const innerPaths = new Map<string, PathResolution>();\n collectFilterPaths(filter.exists.filter, inner, schema, innerPaths, existsOut, aliasCounter);\n innerFilter = { original: filter.exists.filter, resolvedPaths: innerPaths };\n for (const [path, res] of innerPaths) {\n // Only paths the SUBQUERY owns go in its map; the rest are the outer\n // query's and resolve there.\n const owner = path.slice(0, path.indexOf('.'));\n if (filter.exists.from.includes(owner)) innerAliasMap.set(path, `${res.alias}.${res.column}`);\n else resolvedPaths.set(path, res);\n }\n }\n\n existsOut.set(filter.exists, { sources: innerSources, joins: innerJoins, filter: innerFilter, aliasMap: innerAliasMap });\n return;\n }\n\n if ('and' in filter) {\n for (const sub of filter.and) {\n collectFilterPaths(sub, entityLookup, schema, resolvedPaths, existsOut, aliasCounter);\n }\n return;\n }\n\n if ('or' in filter) {\n for (const sub of filter.or) {\n collectFilterPaths(sub, entityLookup, schema, resolvedPaths, existsOut, aliasCounter);\n }\n return;\n }\n\n if ('not' in filter) {\n collectFilterPaths(filter.not, entityLookup, schema, resolvedPaths, existsOut, aliasCounter);\n return;\n }\n\n if ('semantic' in filter) {\n resolveFilterFieldPath(filter.semantic.field, entityLookup, schema, resolvedPaths);\n return;\n }\n\n if ('fuzzy' in filter) {\n resolveFilterFieldPath(filter.fuzzy.field, entityLookup, schema, resolvedPaths);\n return;\n }\n\n // Resolved away before the pipeline — see engine/optional.ts.\n if ('optional' in filter) refuseOptional('field resolution');\n};\n\nconst resolveFilterFieldPath = (\n path: string,\n entityLookup: EntityLookup,\n schema: DatabaseSchema,\n resolvedPaths: Map<string, PathResolution>,\n): void => {\n if (resolvedPaths.has(path)) return;\n // A FIELD position (`in`, `like`, `isNull`, `semantic`, …) holds a column and\n // nothing else. It resolves or the query is refused — it used to return\n // quietly for a string without a dot, and the compiler then pasted that\n // string into the statement verbatim.\n const { resolved } = resolveFieldPath(path, entityLookup, schema);\n resolvedPaths.set(path, { alias: resolved.alias, column: resolved.column, schema: resolved.schema });\n};\n\nconst resolveFilterFieldOrValue = (\n fov: FieldOrValue,\n entityLookup: EntityLookup,\n schema: DatabaseSchema,\n resolvedPaths: Map<string, PathResolution>,\n): void => {\n if (typeof fov === 'string' && isFieldPath(fov)) {\n resolveFilterFieldPath(fov, entityLookup, schema, resolvedPaths);\n }\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Semantic filter extraction\n// ═══════════════════════════════════════════════════════════════\n\nconst extractSemantic = (\n filter: Filter,\n entityLookup: EntityLookup,\n schema: DatabaseSchema,\n): ResolvedSemantic | undefined => {\n if ('semantic' in filter) {\n const { resolved } = resolveFieldPath(filter.semantic.field, entityLookup, schema);\n const queryRef = filter.semantic.query;\n const contextPath = '$context' in queryRef ? queryRef.$context : queryRef.$scope;\n return {\n field: resolved,\n contextPath,\n minScore: filter.semantic.minScore,\n };\n }\n\n if ('and' in filter) {\n for (const sub of filter.and) {\n const result = extractSemantic(sub, entityLookup, schema);\n if (result !== undefined) return result;\n }\n }\n\n if ('or' in filter) {\n for (const sub of filter.or) {\n const result = extractSemantic(sub, entityLookup, schema);\n if (result !== undefined) return result;\n }\n }\n\n if ('not' in filter) {\n return extractSemantic(filter.not, entityLookup, schema);\n }\n\n return undefined;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Main resolver\n// ═══════════════════════════════════════════════════════════════\n\nexport const resolve = (dsl: Query, schema: DatabaseSchema): ResolvedQuery => {\n const aliasCounter: AliasCounter = new Map();\n const entityLookup: EntityLookup = new Map();\n const aliasMap = new Map<string, string>();\n const sources: ResolvedSource[] = [];\n const joins: ResolvedJoin[] = [];\n\n // ─── Resolve sources ───────────────────────────────────────\n const entitySources: Array<{ entity: EntitySchema; alias: string }> = [];\n\n for (const source of dsl.from) {\n if (typeof source === 'string') {\n const entity = findEntity(source, schema);\n const alias = generateAlias(source, aliasCounter);\n\n entityLookup.set(source, { entity, alias });\n sources.push({ alias, entity, table: entity.table });\n entitySources.push({ entity, alias });\n } else {\n // Subquery source — after the typeof string check, source is narrowed\n assertName(source.as, 'subquery alias');\n const subResolved = resolve(source.query, schema);\n const alias = source.as;\n\n // Expose the subquery's OUTPUT columns as a synthetic entity, so the\n // outer query can reference them as `alias.field`. That's every selected\n // field (under its output name — `as` if aliased), plus every compute and\n // aggregate alias. Without the aggregate outputs, a cross-joined count\n // subquery's `alias.n` would not resolve.\n const synthField = (name: string, normalizedType: NormalizedType): FieldSchema => ({\n name,\n type: normalizedType,\n normalizedType,\n nullable: true,\n primaryKey: false,\n });\n const syntheticFields: FieldSchema[] = [\n ...subResolved.fields.map((f) => ({ ...f.schema, name: f.outputName })),\n ...subResolved.computes.map((c) => synthField(c.name, 'unknown')),\n ...subResolved.aggregates.map((a) => synthField(a.name, 'number')),\n ];\n const syntheticEntity: EntitySchema = {\n name: alias,\n table: alias,\n fields: syntheticFields,\n relations: [],\n indexes: [],\n };\n\n entityLookup.set(alias, { entity: syntheticEntity, alias });\n sources.push({ alias, subquery: subResolved });\n }\n }\n\n // ─── Discover joins ────────────────────────────────────────\n for (let i = 1; i < entitySources.length; i++) {\n const prev = entitySources[i - 1];\n const curr = entitySources[i];\n if (prev === undefined || curr === undefined) continue;\n\n // Try to find a join path from any previously seen entity to current\n let joinFound = false;\n for (let j = 0; j < i; j++) {\n const earlier = entitySources[j];\n if (earlier === undefined) continue;\n\n const join = findJoinBetween(earlier.entity, curr.entity, earlier.alias, curr.alias);\n if (join !== undefined) {\n joins.push(join);\n joinFound = true;\n break;\n }\n }\n\n if (!joinFound) {\n throw new VexError(\n 'invalid_dsl',\n `No foreign key relationship found between any previous entity and \"${curr.entity.name}\". Cannot determine join condition.`,\n );\n }\n }\n\n // ─── Resolve fields ────────────────────────────────────────\n // `fields` is optional (an aggregate-only query selects none); an entry may be\n // a bare `entity.field` or `{ field, as }`, where `as` overrides the output key.\n const fields: ResolvedField[] = [];\n for (const ref of dsl.fields ?? []) {\n const path = typeof ref === 'string' ? ref : ref.field;\n if (typeof ref !== 'string') assertName(ref.as, 'field alias');\n const { resolved } = resolveFieldPath(path, entityLookup, schema);\n fields.push(typeof ref === 'string' ? resolved : { ...resolved, outputName: ref.as });\n aliasMap.set(path, `${resolved.alias}.${resolved.column}`);\n }\n\n // ─── Resolve filter ────────────────────────────────────────\n let resolvedFilter: ResolvedFilter | undefined;\n let semantic: ResolvedSemantic | undefined;\n\n const existsMap = new Map<object, ResolvedExists>();\n\n if (dsl.filter !== undefined) {\n const resolvedPaths = new Map<string, PathResolution>();\n collectFilterPaths(dsl.filter, entityLookup, schema, resolvedPaths, existsMap, aliasCounter);\n resolvedFilter = { original: dsl.filter, resolvedPaths };\n\n // Also populate aliasMap with filter paths\n for (const [path, res] of resolvedPaths) {\n aliasMap.set(path, `${res.alias}.${res.column}`);\n }\n\n // Extract semantic filter if present\n semantic = extractSemantic(dsl.filter, entityLookup, schema);\n }\n\n // ─── Resolve computes ──────────────────────────────────────\n // The exists collector is the same map the filter fills: a computed CASE\n // whose condition is an EXISTS (how a derived standing asks \"do they hold a\n // subscription?\") resolves into the one flat map that scope placement and\n // the compiler both walk, so an exists behaves identically wherever it sits.\n const computes: Array<{ name: string; expression: ComputeExpression }> = [];\n if (dsl.compute !== undefined) {\n for (const [name, expr] of Object.entries(dsl.compute)) {\n if (expr !== undefined) {\n assertName(name, 'compute name');\n resolveComputePaths(expr, entityLookup, schema, aliasMap, existsMap, aliasCounter);\n computes.push({ name, expression: expr });\n }\n }\n }\n\n // ─── Resolve aggregates ────────────────────────────────────\n const aggregates: Array<{ name: string; expression: AggregateExpression }> = [];\n if (dsl.aggregate !== undefined) {\n for (const [name, expr] of Object.entries(dsl.aggregate)) {\n if (expr !== undefined) {\n assertName(name, 'aggregate name');\n resolveAggregatePaths(expr, entityLookup, schema, aliasMap);\n aggregates.push({ name, expression: expr });\n }\n }\n }\n\n // ─── Resolve groupBy ───────────────────────────────────────\n const groupBy: ResolvedField[] = [];\n if (dsl.groupBy !== undefined) {\n for (const path of dsl.groupBy) {\n const { resolved } = resolveFieldPath(path, entityLookup, schema);\n groupBy.push(resolved);\n aliasMap.set(path, `${resolved.alias}.${resolved.column}`);\n }\n }\n\n // ─── Resolve sort ──────────────────────────────────────────\n const sort: Array<{ field: ResolvedField | string; dir: 'asc' | 'desc' }> = [];\n if (dsl.sort !== undefined) {\n const computeNames = new Set(computes.map((c) => c.name));\n const aggregateNames = new Set(aggregates.map((a) => a.name));\n\n for (const entry of dsl.sort) {\n const dir = entry.dir ?? 'asc';\n\n if (computeNames.has(entry.field) || aggregateNames.has(entry.field)) {\n // Sort by computed/aggregate alias\n sort.push({ field: entry.field, dir });\n } else {\n // Sort by entity.field\n const { resolved } = resolveFieldPath(entry.field, entityLookup, schema);\n aliasMap.set(entry.field, `${resolved.alias}.${resolved.column}`);\n sort.push({ field: resolved, dir });\n }\n }\n }\n\n return {\n sources,\n joins,\n fields,\n filter: resolvedFilter,\n semantic,\n computes,\n aggregates,\n groupBy,\n sort,\n limit: dsl.limit,\n distinct: dsl.distinct ?? false,\n aliasMap,\n ...(existsMap.size > 0 ? { existsMap } : {}),\n };\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Compute/aggregate path resolution helpers\n// ═══════════════════════════════════════════════════════════════\n\nconst resolveComputePaths = (\n expr: ComputeExpression,\n entityLookup: EntityLookup,\n schema: DatabaseSchema,\n aliasMap: Map<string, string>,\n existsOut?: Map<object, ResolvedExists>,\n aliasCounter?: AliasCounter,\n): void => {\n const resolveFieldOrValue = (fov: FieldOrValue): void => {\n if (typeof fov === 'string' && isFieldPath(fov)) {\n if (!aliasMap.has(fov)) {\n const { resolved } = resolveFieldPath(fov, entityLookup, schema);\n aliasMap.set(fov, `${resolved.alias}.${resolved.column}`);\n }\n }\n };\n\n if ('add' in expr || 'subtract' in expr || 'multiply' in expr || 'divide' in expr) {\n const pair = ('add' in expr) ? expr.add\n : ('subtract' in expr) ? expr.subtract\n : ('multiply' in expr) ? expr.multiply\n : expr.divide;\n resolveFieldOrValue(pair[0]);\n resolveFieldOrValue(pair[1]);\n return;\n }\n\n if ('concat' in expr) {\n for (const v of expr.concat) resolveFieldOrValue(v);\n return;\n }\n\n if ('coalesce' in expr) {\n for (const v of expr.coalesce) resolveFieldOrValue(v);\n return;\n }\n\n if ('case' in expr) {\n for (const when of expr.case.when) {\n // Resolve field paths inside the condition filter — WITH the exists\n // collector, so a condition may be an EXISTS like any filter may.\n const resolvedPaths = new Map<string, PathResolution>();\n collectFilterPaths(when.condition, entityLookup, schema, resolvedPaths, existsOut, aliasCounter);\n for (const [path, res] of resolvedPaths) {\n aliasMap.set(path, `${res.alias}.${res.column}`);\n }\n resolveFieldOrValue(when.then);\n }\n resolveFieldOrValue(expr.case.else);\n }\n};\n\nconst resolveAggregatePaths = (\n expr: AggregateExpression,\n entityLookup: EntityLookup,\n schema: DatabaseSchema,\n aliasMap: Map<string, string>,\n): void => {\n const arg = ('count' in expr) ? expr.count\n : ('countDistinct' in expr) ? expr.countDistinct\n : ('sum' in expr) ? expr.sum\n : ('avg' in expr) ? expr.avg\n : ('min' in expr) ? expr.min\n : expr.max;\n\n // COUNT(*) is special — no field path.\n if (arg === '*') return;\n\n // sum/avg/min/max may take a compute expression — resolve the columns it refs.\n if (typeof arg !== 'string') {\n resolveComputePaths(arg, entityLookup, schema, aliasMap);\n return;\n }\n\n // A field position: resolves or refuses, like a filter's.\n if (!aliasMap.has(arg)) {\n const { resolved } = resolveFieldPath(arg, entityLookup, schema);\n aliasMap.set(arg, `${resolved.alias}.${resolved.column}`);\n }\n};\n","import type {\n ResolvedQuery,\n ResolvedSource,\n AnalysisResult,\n AnalysisConfig,\n} from './engine.types.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Nesting depth\n// ═══════════════════════════════════════════════════════════════\n\nconst measureNestingDepth = (source: ResolvedSource): number => {\n if (source.subquery === undefined) return 0;\n let maxChild = 0;\n for (const childSource of source.subquery.sources) {\n const childDepth = measureNestingDepth(childSource);\n if (childDepth > maxChild) maxChild = childDepth;\n }\n return 1 + maxChild;\n};\n\nconst getMaxNestingDepth = (resolved: ResolvedQuery): number => {\n let max = 0;\n for (const source of resolved.sources) {\n const depth = measureNestingDepth(source);\n if (depth > max) max = depth;\n }\n return max;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Cartesian product detection\n// ═══════════════════════════════════════════════════════════════\n\nconst hasCartesianProduct = (resolved: ResolvedQuery): boolean => {\n // Only relevant when there are multiple entity sources (not subqueries)\n const entitySources = resolved.sources.filter((s) => s.entity !== undefined);\n if (entitySources.length <= 1) return false;\n\n // Check that each source after the first has at least one join connecting it\n // to a previously-seen source\n const seenAliases = new Set<string>();\n const firstSource = entitySources[0];\n if (firstSource !== undefined) {\n seenAliases.add(firstSource.alias);\n }\n\n for (let i = 1; i < entitySources.length; i++) {\n const source = entitySources[i];\n if (source === undefined) continue;\n\n const hasJoin = resolved.joins.some(\n (j) =>\n (j.toAlias === source.alias && seenAliases.has(j.fromAlias)) ||\n (j.fromAlias === source.alias && seenAliases.has(j.toAlias)),\n );\n\n if (!hasJoin) return true;\n\n seenAliases.add(source.alias);\n }\n\n return false;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Unindexed filter check\n// ═══════════════════════════════════════════════════════════════\n\nconst findUnindexedFilterColumns = (resolved: ResolvedQuery): string[] => {\n if (resolved.filter === undefined) return [];\n\n const unindexed: string[] = [];\n\n for (const [path, res] of resolved.filter.resolvedPaths) {\n // Find the entity for this alias\n const source = resolved.sources.find((s) => s.alias === res.alias);\n if (source === undefined || source.entity === undefined) continue;\n\n // Check if the column appears in any index\n const isIndexed = source.entity.indexes.some((idx) =>\n idx.fields.includes(res.column),\n );\n\n // Also consider primary keys as indexed\n const isPrimaryKey = source.entity.fields.some(\n (f) => f.name === res.column && f.primaryKey,\n );\n\n if (!isIndexed && !isPrimaryKey) {\n unindexed.push(path);\n }\n }\n\n return unindexed;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Aggregates without groupBy\n// ═══════════════════════════════════════════════════════════════\n\nconst hasAggregatesWithoutGroupBy = (resolved: ResolvedQuery): boolean =>\n resolved.aggregates.length > 0 && resolved.groupBy.length === 0;\n\n// ═══════════════════════════════════════════════════════════════\n// Public API\n// ═══════════════════════════════════════════════════════════════\n\nexport const analyze = (resolved: ResolvedQuery, config: AnalysisConfig): AnalysisResult => {\n const warnings: string[] = [];\n const errors: string[] = [];\n\n // Check nesting depth\n const depth = getMaxNestingDepth(resolved);\n if (depth > config.maxNestingDepth) {\n errors.push(\n `Subquery nesting depth ${depth} exceeds maximum allowed depth of ${config.maxNestingDepth}`,\n );\n }\n\n // Check for cartesian products\n if (config.rejectCartesianProducts && hasCartesianProduct(resolved)) {\n errors.push(\n 'Cartesian product detected: multiple sources with no join between them. Add a join or reduce sources.',\n );\n }\n\n // Check for unindexed filter columns\n const unindexed = findUnindexedFilterColumns(resolved);\n if (unindexed.length > 0) {\n const message = `Unindexed filter columns: ${unindexed.join(', ')}. Consider adding indexes for better performance.`;\n if (config.rejectUnindexedFilters) {\n errors.push(message);\n } else if (config.warnUnindexedFilters) {\n warnings.push(message);\n }\n }\n\n // Check for aggregates without groupBy\n if (hasAggregatesWithoutGroupBy(resolved)) {\n warnings.push(\n 'Aggregate functions used without groupBy. The result will be a single aggregated row.',\n );\n }\n\n // Check for unindexed vector field in semantic search\n if (resolved.semantic !== undefined) {\n const semanticField = resolved.semantic.field;\n const vectorSource = resolved.sources.find(\n (s) => s.alias === semanticField.alias,\n );\n if (vectorSource !== undefined && vectorSource.entity !== undefined) {\n const hasVectorIndex = vectorSource.entity.indexes.some(\n (idx) =>\n idx.fields.includes(semanticField.column) &&\n (idx.type === 'hnsw' || idx.type === 'ivfflat'),\n );\n if (!hasVectorIndex) {\n warnings.push(\n `Vector field \"${semanticField.path}\" has no HNSW or IVFFlat index. Semantic search may be slow.`,\n );\n }\n }\n }\n\n return { warnings, errors };\n};\n","import type { CacheBackend, CacheEntry } from './cache.types.js';\n\nexport const createMemoryCache = (): CacheBackend => {\n const store = new Map<string, CacheEntry>();\n\n const get = async (key: string): Promise<CacheEntry | undefined> => {\n return store.get(key);\n };\n\n const set = async (key: string, entry: CacheEntry): Promise<void> => {\n store.set(key, entry);\n };\n\n const del = async (key: string): Promise<void> => {\n store.delete(key);\n };\n\n const clear = async (): Promise<void> => {\n store.clear();\n };\n\n const keys = async (): Promise<string[]> => {\n return [...store.keys()];\n };\n\n // Read-only snapshot — does not increment hit counts.\n const entries = async (): Promise<Array<{ key: string; entry: CacheEntry }>> => {\n return [...store.entries()].map(([key, entry]) => ({ key, entry }));\n };\n\n return { get, set, delete: del, clear, keys, entries };\n};\n","import type { Row } from '../adapters/adapter.types.js';\nimport { hashText } from '../utils/canonical.js';\n\n// ═══════════════════════════════════════════════════════════════\n// LIVE ROWS — what makes a `refresh: 'reactive'` read reactive.\n//\n// Two structures, kept apart on purpose:\n//\n// ROWS — key → the rows a query returned. A cache: bounded by entries,\n// by bytes and by age, least-recently-used first out. Evicting\n// one never breaks anything; it costs one query.\n// FOLLOWS — key → what somebody is watching: the tables the query reads,\n// how to run it again, and who to tell. Small, and bounded by\n// what is mounted, not by this module: a follow ends when its\n// last follower's signal aborts.\n//\n// THE KEY IS THE COMPILED SQL AND ITS BOUND VALUES, which the engine hashes\n// before it gets here. Scope compiles into both — row rules into the SQL,\n// scope values into the parameters — so two callers share rows exactly when\n// they would provably have got the same rows. Nothing here reasons about\n// policy, and nothing needs to.\n//\n// A WRITE BUMPS ITS TABLES' VERSIONS. Rows remember the versions they were\n// read at; a stored entry whose tables moved is stale, checked on read — so\n// invalidation is a counter bump, not a walk over the cache. The same stamp\n// closes the race that would otherwise poison it: rows fetched by a read\n// that started BEFORE a write and finished after it carry the versions from\n// before, so they are stale the moment they land.\n//\n// Followed keys are refetched once per burst (debounced, trailing), and a\n// follower hears only when its own answer changed.\n// ═══════════════════════════════════════════════════════════════\n\nexport type LiveRowsConfig = {\n /** How long stored rows are trusted, and how often a followed read is re-checked when nothing wrote. Default 60 000. */\n ttlMs?: number;\n /** Most stored results. Default 5 000. */\n maxEntries?: number;\n /** Most stored text, measured as the length of each result's JSON. Default 64 MiB. */\n maxBytes?: number;\n /** Largest single result worth storing; bigger ones are refetched every time. Default a tenth of `maxBytes`. */\n maxEntryBytes?: number;\n /** How long a burst of writes is gathered before followed reads refetch. Default 10. */\n debounceMs?: number;\n};\n\nexport type LiveRowsStats = {\n entries: number;\n bytes: number;\n follows: number;\n followers: number;\n hits: number;\n misses: number;\n evictions: number;\n oversized: number;\n refreshes: number;\n};\n\nexport type LiveRowsEvent =\n | { type: 'rows.evict'; reason: 'capacity' | 'oversized'; bytes: number }\n | { type: 'rows.error'; message: string };\n\n// What running a query again needs, and which tables it reads.\nexport type RowsSource = {\n tables: readonly string[];\n fetch: () => Promise<Row[]>;\n};\n\nexport type RowsFollower = {\n // New rows for the key. The follower decides whether its own answer changed.\n deliver: (rows: Row[]) => void;\n};\n\nexport type LiveRows = {\n read: (key: string, source: RowsSource) => Promise<Row[]>;\n // Start following `key`. `rows` is what the follower was just answered\n // with. Ends when `signal` aborts.\n follow: (key: string, source: RowsSource, rows: Row[], follower: RowsFollower, signal: AbortSignal) => void;\n invalidate: (tables: readonly string[]) => void;\n stats: () => LiveRowsStats;\n // Stop every timer — for hosts that outlive the engine (tests, embedded tools).\n stop: () => void;\n};\n\nconst DEFAULT_TTL_MS = 60_000;\nconst DEFAULT_MAX_ENTRIES = 5_000;\nconst DEFAULT_MAX_BYTES = 64 * 1024 * 1024;\nconst DEFAULT_DEBOUNCE_MS = 10;\n// A cache that evicts faster than it answers is too small for what it holds.\n// Said at most once a minute, and only past a floor, so a cold start is quiet.\nconst THRASH_WINDOW_MS = 60_000;\nconst THRASH_FLOOR = 100;\n\ntype Stored = { rows: Row[]; bytes: number; tables: readonly string[]; seen: readonly number[]; at: number };\ntype Flight = { promise: Promise<Row[]>; tables: readonly string[]; seen: readonly number[] };\ntype Follow = {\n source: RowsSource;\n followers: Set<RowsFollower>;\n // The rows every follower was last brought up to, as a hash — when a refetch\n // returns the same, nobody's answer can have changed and nobody is mapped.\n rowsHash: string;\n // Refetches are numbered so a slow one landing after a newer one is dropped.\n issued: number;\n landed: number;\n timer?: ReturnType<typeof setTimeout>;\n};\n\nconst unref = (timer: ReturnType<typeof setTimeout>): void => {\n if (typeof timer === 'object' && timer !== null && 'unref' in timer && typeof timer.unref === 'function') timer.unref();\n};\n\nexport const createLiveRows = (\n config: LiveRowsConfig = {},\n emit: (event: LiveRowsEvent) => void = () => {},\n now: () => number = Date.now,\n): LiveRows => {\n const ttlMs = config.ttlMs ?? DEFAULT_TTL_MS;\n const maxEntries = config.maxEntries ?? DEFAULT_MAX_ENTRIES;\n const maxBytes = config.maxBytes ?? DEFAULT_MAX_BYTES;\n const maxEntryBytes = config.maxEntryBytes ?? Math.floor(maxBytes / 10);\n const debounceMs = config.debounceMs ?? DEFAULT_DEBOUNCE_MS;\n\n const versions = new Map<string, number>();\n const versionOf = (table: string): number => versions.get(table) ?? 0;\n const snapshot = (tables: readonly string[]): number[] => tables.map(versionOf);\n const unchanged = (tables: readonly string[], seen: readonly number[]): boolean =>\n tables.every((table, i) => versionOf(table) === seen[i]);\n\n // Insertion order is recency: a hit is re-inserted, the oldest is first out.\n const stored = new Map<string, Stored>();\n let bytes = 0;\n const flights = new Map<string, Flight>();\n const follows = new Map<string, Follow>();\n const followsByTable = new Map<string, Set<string>>();\n\n const counts = { hits: 0, misses: 0, evictions: 0, oversized: 0, refreshes: 0 };\n const thrash = { start: now(), hits: 0, evictions: 0, warned: 0 };\n\n const drop = (key: string): void => {\n const entry = stored.get(key);\n if (entry === undefined) return;\n stored.delete(key);\n bytes -= entry.bytes;\n };\n\n const noteEviction = (): void => {\n const at = now();\n if (at - thrash.start > THRASH_WINDOW_MS) {\n thrash.start = at;\n thrash.hits = 0;\n thrash.evictions = 0;\n }\n thrash.evictions += 1;\n if (thrash.evictions >= THRASH_FLOOR && thrash.evictions > thrash.hits && at - thrash.warned > THRASH_WINDOW_MS) {\n thrash.warned = at;\n console.warn(\n `[vex:rows] evicting faster than answering (${thrash.evictions} evictions, ${thrash.hits} hits this minute) — raise the engine's rows.maxBytes / rows.maxEntries.`,\n );\n }\n };\n\n const store = (key: string, rows: Row[], tables: readonly string[], seen: readonly number[]): void => {\n drop(key);\n const size = (JSON.stringify(rows) ?? '').length;\n if (size > maxEntryBytes) {\n counts.oversized += 1;\n emit({ type: 'rows.evict', reason: 'oversized', bytes: size });\n return;\n }\n stored.set(key, { rows, bytes: size, tables, seen, at: now() });\n bytes += size;\n while (stored.size > maxEntries || bytes > maxBytes) {\n const oldest = stored.keys().next();\n if (oldest.done === true) break;\n const evicted = stored.get(oldest.value);\n drop(oldest.value);\n counts.evictions += 1;\n emit({ type: 'rows.evict', reason: 'capacity', bytes: evicted?.bytes ?? 0 });\n noteEviction();\n }\n };\n\n const read = (key: string, source: RowsSource): Promise<Row[]> => {\n const hit = stored.get(key);\n if (hit !== undefined) {\n if (now() - hit.at < ttlMs && unchanged(hit.tables, hit.seen)) {\n stored.delete(key);\n stored.set(key, hit);\n counts.hits += 1;\n thrash.hits += 1;\n return Promise.resolve(hit.rows);\n }\n drop(key);\n }\n counts.misses += 1;\n // Join a fetch already out — but only one that started after the last\n // write to these tables; an older one is about to return stale rows.\n const flight = flights.get(key);\n if (flight !== undefined && unchanged(flight.tables, flight.seen)) return flight.promise;\n\n const seen = snapshot(source.tables);\n const promise = source.fetch().then((rows) => {\n store(key, rows, source.tables, seen);\n return rows;\n });\n const entry: Flight = { promise, tables: source.tables, seen };\n flights.set(key, entry);\n const settle = (): void => {\n if (flights.get(key) === entry) flights.delete(key);\n };\n promise.then(settle, settle);\n return promise;\n };\n\n // ── follows ───────────────────────────────────────────────\n\n const dirty = new Set<string>();\n let flushTimer: ReturnType<typeof setTimeout> | undefined;\n\n const schedule = (key: string): void => {\n dirty.add(key);\n if (flushTimer !== undefined) return;\n flushTimer = setTimeout(() => {\n flushTimer = undefined;\n const keys = [...dirty];\n dirty.clear();\n for (const next of keys) void refresh(next, false);\n }, debounceMs);\n unref(flushTimer);\n };\n\n // Nothing wrote, but a lost invalidation (a write vex never saw, a signal\n // from another process that never came) must not leave a screen stale for\n // ever: every followed read is re-checked once per TTL, bypassing the cache.\n const arm = (key: string, follow: Follow): void => {\n if (follow.timer !== undefined) clearTimeout(follow.timer);\n if (!Number.isFinite(ttlMs)) return;\n follow.timer = setTimeout(() => void refresh(key, true), ttlMs);\n unref(follow.timer);\n };\n\n const refresh = async (key: string, bypass: boolean): Promise<void> => {\n const follow = follows.get(key);\n if (follow === undefined) return;\n follow.issued += 1;\n const ticket = follow.issued;\n if (bypass) drop(key);\n let rows: Row[];\n try {\n rows = await read(key, follow.source);\n } catch (err) {\n // The screen keeps its last good answer; the next write or TTL tries again.\n emit({ type: 'rows.error', message: err instanceof Error ? err.message : String(err) });\n if (follows.get(key) === follow) arm(key, follow);\n return;\n }\n if (follows.get(key) !== follow || ticket < follow.landed) return;\n follow.landed = ticket;\n counts.refreshes += 1;\n arm(key, follow);\n const rowsHash = hashText(JSON.stringify(rows) ?? '');\n if (rowsHash === follow.rowsHash) return;\n follow.rowsHash = rowsHash;\n for (const follower of [...follow.followers]) {\n try {\n follower.deliver(rows);\n } catch (err) {\n emit({ type: 'rows.error', message: err instanceof Error ? err.message : String(err) });\n }\n }\n };\n\n const unfollow = (key: string, follower: RowsFollower): void => {\n const follow = follows.get(key);\n if (follow === undefined) return;\n follow.followers.delete(follower);\n if (follow.followers.size > 0) return;\n follows.delete(key);\n dirty.delete(key);\n if (follow.timer !== undefined) clearTimeout(follow.timer);\n for (const table of follow.source.tables) {\n const keys = followsByTable.get(table);\n keys?.delete(key);\n if (keys !== undefined && keys.size === 0) followsByTable.delete(table);\n }\n };\n\n const follow = (key: string, source: RowsSource, rows: Row[], follower: RowsFollower, signal: AbortSignal): void => {\n if (signal.aborted) return;\n let existing = follows.get(key);\n if (existing === undefined) {\n existing = { source, followers: new Set(), rowsHash: hashText(JSON.stringify(rows) ?? ''), issued: 0, landed: 0 };\n follows.set(key, existing);\n for (const table of source.tables) {\n let keys = followsByTable.get(table);\n if (keys === undefined) {\n keys = new Set();\n followsByTable.set(table, keys);\n }\n keys.add(key);\n }\n arm(key, existing);\n }\n // A follower joining a follow that already exists keeps the follow's own\n // record of what everybody was last brought up to — if its rows are\n // newer, the refresh already scheduled will say so to everyone, and the\n // newcomer's own comparison drops the repeat.\n existing.followers.add(follower);\n signal.addEventListener('abort', () => unfollow(key, follower), { once: true });\n };\n\n const invalidate = (tables: readonly string[]): void => {\n for (const table of tables) versions.set(table, versionOf(table) + 1);\n for (const table of tables) {\n for (const key of followsByTable.get(table) ?? []) schedule(key);\n }\n };\n\n const stats = (): LiveRowsStats => {\n let followers = 0;\n for (const entry of follows.values()) followers += entry.followers.size;\n return { entries: stored.size, bytes, follows: follows.size, followers, ...counts };\n };\n\n const stop = (): void => {\n if (flushTimer !== undefined) clearTimeout(flushTimer);\n flushTimer = undefined;\n for (const entry of follows.values()) if (entry.timer !== undefined) clearTimeout(entry.timer);\n };\n\n return { read, follow, invalidate, stats, stop };\n};\n","import type { QueryEngine, QueryEngineConfig, ExecuteOptions, GenerationCaller } from '../types.js';\nimport type { DatabaseSchema } from '../schemas/database.schema.js';\nimport type { Query } from '../schemas/query.schema.js';\nimport type { QueryRequest, QueryResponse } from '../schemas/request.schema.js';\nimport type { CompiledQuery } from '../adapters/adapter.types.js';\nimport type { TestResult, AnalysisConfig } from './engine.types.js';\nimport type { ScopeValues, ScopePolicy } from '../scope/scope.types.js';\nimport type { CacheBackend, CacheEntry, OkCacheEntry } from '../cache/cache.types.js';\nimport { z } from 'zod';\nimport { QueryRequestSchema } from '../schemas/request.schema.js';\nimport { QuerySchema } from '../schemas/query.schema.js';\nimport { discoverEntities } from '../scope/discover.js';\nimport { checkScope, scopeResolved, canReadTable } from '../scope/apply.js';\nimport { behaviorColumns, scopeBindings } from '../scope/grants.js';\nimport { resolve } from './resolver.js';\nimport { analyze } from './analyzer.js';\nimport { executeQuery, buildContextContract, findMissingContext, requireScope } from './executor.js';\nimport { pruneOptional, presenceOf, presenceSignature, optionalKeysOf } from './optional.js';\nimport { createMemoryCache } from '../cache/memory.js';\nimport { computeSchemaFingerprint, computeRequestHash, computePolicyKey, mintFingerprint } from '../cache/hash.js';\nimport { isEntryFresh, isTouchDue, fireAndForget } from '../cache/util.js';\nimport { buildValidationContext, resolveParams } from '../utils/context.js';\nimport { canonicalHash } from '../utils/canonical.js';\nimport { createLiveRows } from './live.js';\nimport type { RowsSource } from './live.js';\nimport type { Refresh } from '../cache/cache.types.js';\nimport type { Row } from '../adapters/adapter.types.js';\nimport { VexError, isVexError } from '../errors.js';\nimport { depthRefusal, exceedsDepth } from '@niscorp/strata';\nimport type { CompiledIr, JsonObject, JsonValue } from '@niscorp/prism';\nimport { execute as executePrism } from '@niscorp/prism';\n\n// `sortBy`/`sortDir` are reserved context keys: when present they replace the\n// query's literal `sort` (its default) with a single ORDER BY for this run. The\n// column is validated downstream by resolve()/resolveFieldPath — an unknown\n// column throws — and never becomes a param (operators.ts guards $context refs).\nexport const applySortContext = (dsl: Query, context: Record<string, unknown>): Query => {\n const sortBy = context['sortBy'];\n if (typeof sortBy !== 'string' || sortBy === '') return dsl;\n const dir: 'asc' | 'desc' = context['sortDir'] === 'desc' ? 'desc' : 'asc';\n // The caller's column LEADS; the entry's own keys stay behind it as\n // tiebreakers. This used to replace the sort outright, which quietly broke\n // any entry whose last sort key was there to make the order TOTAL — a keyset\n // page ordered by (name, id) became ordered by name alone, and two people\n // sharing a name could straddle a page boundary and never be reached.\n // A trailing key is not decoration; it is what makes \"the next fifty\" mean\n // anything. The caller's own column is dropped from the tail so it cannot\n // appear twice with two directions.\n const tiebreakers = (dsl.sort ?? []).filter((entry) => entry.field !== sortBy);\n return { ...dsl, sort: [{ field: sortBy, dir }, ...tiebreakers] };\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Pipeline result (compiled query + analysis warnings)\n// ═══════════════════════════════════════════════════════════════\n\ntype PipelineResult = {\n compiled: CompiledQuery;\n warnings: string[];\n // Set when the LIMIT in `compiled` is the engine's number rather than the\n // query's own: the default it was given, or the maximum it was clamped to.\n engineLimit?: number;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Configuration defaults\n// ═══════════════════════════════════════════════════════════════\n\nconst DEFAULT_MAX_NESTING_DEPTH = 2;\nconst DEFAULT_LIMIT = 100;\nconst DEFAULT_MAX_LIMIT = 1000;\nconst DEFAULT_STATEMENT_TIMEOUT_MS = 10_000;\nconst DEFAULT_UNSATISFIABLE_TTL_MS = 300_000;\nconst DEFAULT_MAX_PRESENCE_VARIANTS = 32;\n\n// ═══════════════════════════════════════════════════════════════\n// Runtime factory\n// ═══════════════════════════════════════════════════════════════\n\nexport const createQueryEngine = (engineConfig: QueryEngineConfig): QueryEngine => {\n const { adapter, scope: scopePolicy, generateDsl, mapToShape, embed, behaviors } = engineConfig;\n const emit = engineConfig.onEvent ?? (() => {});\n const maxNestingDepth = engineConfig.config?.maxNestingDepth ?? DEFAULT_MAX_NESTING_DEPTH;\n const defaultLimit = engineConfig.config?.defaultLimit ?? DEFAULT_LIMIT;\n const maxLimit = engineConfig.config?.maxLimit ?? DEFAULT_MAX_LIMIT;\n const capAuthored = engineConfig.config?.capAuthored ?? false;\n const rejectCartesianProducts = engineConfig.config?.rejectCartesianProducts ?? true;\n const warnUnindexedFilters = engineConfig.config?.warnUnindexedFilters ?? true;\n const rejectUnindexedFilters = engineConfig.config?.rejectUnindexedFilters ?? false;\n const unsatisfiableTtlMs = engineConfig.config?.unsatisfiableTtlMs ?? DEFAULT_UNSATISFIABLE_TTL_MS;\n\n const analysisConfig: AnalysisConfig = {\n maxNestingDepth,\n rejectCartesianProducts,\n warnUnindexedFilters,\n rejectUnindexedFilters,\n };\n\n // The rows behind `refresh: 'reactive'` entries (engine/live.ts). Snapshot\n // reads never touch it.\n const live = createLiveRows(engineConfig.rows, emit);\n\n let cachedSchema: DatabaseSchema | undefined;\n let cachedFingerprint: string | undefined;\n const cache: CacheBackend = engineConfig.cache ?? createMemoryCache();\n\n // ── how many SHAPES one entry is being asked for ──\n //\n // Optional conditions trade one artifact for up to 2^n compiled forms. That\n // is the deal and it is a good one — but it is worth SAYING when an entry\n // starts behaving like a query builder, because at that point a caller is\n // composing rather than choosing, and the closed grammar is doing less work\n // than it looks like it is.\n //\n // A warning rather than a refusal: every variant is still a query the author\n // wrote, scope still applies, and failing a legitimate read to make a point\n // about authoring would be the wrong trade. There is no per-call cost here\n // either — vex compiles per request already, so a new shape is not a cache\n // miss, it is just a different string.\n const variantsSeen = new Map<string, Set<string>>();\n const maxPresenceVariants = engineConfig.config?.maxPresenceVariants ?? DEFAULT_MAX_PRESENCE_VARIANTS;\n\n const noteVariant = (fingerprint: string | undefined, signature: string, warnings: string[]): void => {\n if (fingerprint === undefined || signature === '') return;\n let seen = variantsSeen.get(fingerprint);\n if (seen === undefined) {\n seen = new Set<string>();\n variantsSeen.set(fingerprint, seen);\n }\n if (seen.has(signature)) return;\n seen.add(signature);\n if (seen.size > maxPresenceVariants) {\n warnings.push(\n `\"${fingerprint}\" has now compiled ${seen.size} distinct optional-key combinations (limit ${maxPresenceVariants}). An entry answering this many shapes is closer to a query builder than to a question — consider splitting it.`,\n );\n }\n };\n\n // Single-flight: collapse concurrent identical misses (same request\n // identity) so a burst of N requests triggers one agent generation,\n // not N. Keyed by request hash; only the shared generation is pooled,\n // each request still runs its own scope/execute.\n const inFlight = new Map<string, Promise<Query>>();\n\n // ─── Introspect ────────────────────────────────────────────\n\n const introspect = async (): Promise<DatabaseSchema> => {\n const options = engineConfig.config?.entities !== undefined\n ? { entities: engineConfig.config.entities }\n : undefined;\n const schema = await adapter.introspect(options);\n // Every read bounded, from here on. Said once when the database cannot\n // enforce it (PGlite, a pool that cannot transact) — dev, not production.\n const readLimit = engineConfig.config?.statementTimeoutMs ?? DEFAULT_STATEMENT_TIMEOUT_MS;\n if (adapter.limitReads !== undefined && (await adapter.limitReads(readLimit)) === 'unenforced' && readLimit > 0) {\n console.warn(`[vex] reads are not bounded: this database cannot enforce statement_timeout (${readLimit}ms asked). Fine for development; production wants Postgres.`);\n }\n // The behaviors are read for who a caller is (GenerationCaller.bindings):\n // a rule naming a table or a column the database does not have would tell\n // a generation something false, so it refuses here, at boot.\n if (behaviors !== undefined) {\n const missing = behaviorColumns(behaviors).filter(({ entity, field }) => !schema.entities.some((e) => e.name === entity && e.fields.some((f) => f.name === field)));\n if (missing.length > 0) {\n throw new VexError('execution_error', `The behaviors name columns the database does not have: ${missing.map((m) => `${m.entity}.${m.field}`).join(', ')}.`);\n }\n }\n cachedSchema = schema;\n cachedFingerprint = computeSchemaFingerprint(schema);\n return schema;\n };\n\n // ─── Internal pipeline ─────────────────────────────────────\n\n const ensureSchema = (): DatabaseSchema => {\n if (cachedSchema === undefined) {\n throw new VexError(\n 'execution_error',\n 'Database schema not loaded. Call introspect() first.',\n );\n }\n return cachedSchema;\n };\n\n // WHO IS ASKING never decides WHETHER the policy applies. An engine with a\n // policy enforces it on every run; the caller's scope values only fill the\n // row rules' `$scope` slots at bind time, and a slot nobody filled is a\n // refusal (`requireScope`), not a pass. Omitting the values used to switch\n // the whole policy off — table access included — so a call that forgot to\n // say who it was for read as everybody.\n //\n // THE LIMIT, AND WHOSE NUMBER IT IS. Every query runs with one. A query that\n // states none is given `defaultLimit`. One that states more than `maxLimit`\n // is clamped to it — unless its author SEEDED it: `maxLimit` is a guard on a\n // query nobody reviewed, and clamping a seeded entry replaces the number its\n // author chose with a smaller one, in a reply that does not say so.\n // `capAuthored` puts the clamp back on seeded entries too.\n const runPipeline = (dsl: Query, policyOverride?: ScopePolicy, seeded = false): PipelineResult => {\n const schema = ensureSchema();\n\n let processedDsl = dsl;\n let engineLimit: number | undefined;\n if (processedDsl.limit === undefined) {\n processedDsl = { ...processedDsl, limit: defaultLimit };\n engineLimit = defaultLimit;\n } else if (processedDsl.limit > maxLimit && (capAuthored || !seeded)) {\n processedDsl = { ...processedDsl, limit: maxLimit };\n engineLimit = maxLimit;\n }\n\n // Discover entities\n const entities = discoverEntities(processedDsl);\n\n // Scope, in two halves. A per-request policy (from ExecuteOptions)\n // overrides the engine's configured default for this run.\n //\n // The ACCESS CHECK runs first, on entity names alone, so a denied table is\n // refused before any work is done. The ROW RULES are placed AFTER\n // resolution, because only the resolver knows which tables are left-joined\n // and a row rule in the WHERE of a left join silently deletes rows whose\n // optional FK is null. See scope/apply.ts.\n const activePolicy = policyOverride ?? scopePolicy;\n if (activePolicy !== undefined) checkScope(entities, activePolicy);\n\n // Resolve\n const resolved = resolve(processedDsl, schema);\n if (activePolicy !== undefined) scopeResolved(resolved, activePolicy);\n\n // Analyze\n const analysis = analyze(resolved, analysisConfig);\n if (analysis.errors.length > 0) {\n throw new VexError(\n 'invalid_dsl',\n `Analysis failed: ${analysis.errors.join('; ')}`,\n { errors: analysis.errors, warnings: analysis.warnings },\n );\n }\n\n // Compile\n const compiled = adapter.compile(resolved);\n\n return { compiled, warnings: analysis.warnings, ...(engineLimit !== undefined ? { engineLimit } : {}) };\n };\n\n // ── when the engine's number may have ended a list ──\n //\n // A list that comes back with exactly as many rows as a limit its author\n // never chose has probably been cut, and until this said so nothing did: the\n // reply looked complete. It is \"may\": no extra row is fetched to find out,\n // so a list of exactly that many rows is told the same thing. Only for a\n // list — a single-row answer uses the first row and cannot be cut.\n //\n // Said in the reply, and once per named entry on the console: a host that\n // hands its callers `result` without `meta` would otherwise show it to no one.\n const cutSaid = new Set<string>();\n\n const cutNote = (engineLimit: number | undefined, stated: number | undefined, rowCount: number, shape: unknown, fingerprint: string | undefined): string | undefined => {\n if (engineLimit === undefined || rowCount !== engineLimit) return undefined;\n if (shape !== undefined && !Array.isArray(shape)) return undefined;\n const note =\n stated === undefined\n ? `This list states no limit, so it ran with the engine's defaultLimit of ${engineLimit}, and exactly ${engineLimit} rows came back — it may have been cut. State a \\`limit\\`.`\n : `This query asks for ${stated} rows, the engine's maxLimit is ${engineLimit}, and exactly ${engineLimit} came back — the list may have been cut. Raise \\`maxLimit\\` to read more.`;\n if (fingerprint !== undefined && !cutSaid.has(fingerprint)) {\n cutSaid.add(fingerprint);\n console.warn(`[vex] \"${fingerprint}\": ${note}`);\n }\n return note;\n };\n\n // ─── Compile ───────────────────────────────────────────────\n\n // No caller, so no presence to resolve against: `all` compiles the WIDEST\n // form of the query, every optional condition included. That is the right\n // default for both of these — a compile is asking \"does this query build\",\n // and a test is asking \"does the hardest version of it run\".\n const compile = (dsl: Query): CompiledQuery =>\n runPipeline(pruneOptional(dsl, 'all')).compiled;\n\n // ─── Test ──────────────────────────────────────────────────\n\n const test = async (dsl: Query, scopeValues?: ScopeValues): Promise<TestResult> => {\n try {\n // Override limit to 5 for test queries\n const testDsl: Query = { ...pruneOptional(dsl, 'all'), limit: 5 };\n const { compiled, warnings } = runPipeline(testDsl);\n\n // Build synthetic context for testing\n const syntheticContext = buildValidationContext(compiled.contextContract);\n\n // Scope is never synthetic: a test runs AS somebody or it is refused.\n const scope: ScopeValues = scopeValues ?? {};\n requireScope(compiled, scope);\n\n const rows = await executeQuery(compiled, syntheticContext, scope, adapter, embed);\n\n return { rows, warnings, errors: [] };\n } catch (err) {\n const message = err instanceof Error ? err.message : String(err);\n return { rows: [], warnings: [], errors: [message] };\n }\n };\n\n // ─── Cache resolution (fingerprint identity) ───────────────\n\n type Resolution = {\n fingerprint: string;\n // Present on a hit — the stored artifact.\n dsl?: Query;\n cachedIr?: CompiledIr;\n intent?: string;\n // The stored shape — drives the array-vs-single mapping envelope on\n // fingerprint-only replays (the request carries no shape then).\n shape?: unknown;\n refresh?: Refresh;\n // The entry was put there by the host: protected, and carrying no request\n // hash. That is what `seedCache` writes, and what a host writes when it\n // stores an entry through the cache backend itself. No request can produce\n // it — a generated entry always carries the hash of the request it was\n // born from, and the one field a wire call can change on a stored entry is\n // `protected`.\n seeded?: boolean;\n hit: boolean;\n // A named slot existed but its stored request differed — this run\n // regenerates and REPLACES it.\n replaced: boolean;\n };\n\n // Fresh = not past TTL and written against the current schema. A\n // non-fresh entry is evicted here, then treated as a miss.\n const freshOrEvict = (entry: CacheEntry, key: string): boolean => {\n if (isEntryFresh(entry, cachedFingerprint)) return true;\n void cache.delete(key);\n return false;\n };\n\n // Lifetime = usage: a hit stamps lastUsedAt (off the hot path) so a GC\n // sweep can evict entries that stopped being replayed — at most once per\n // TOUCH_EVERY_MS, not on every replay (cache/util.ts).\n const touch = (key: string, entry: CacheEntry): void => {\n const now = Date.now();\n if (isTouchDue(entry, now)) fireAndForget(cache.set(key, { ...entry, lastUsedAt: now }));\n };\n\n const resolveFingerprint = async (\n validRequest: QueryRequest,\n hasRequest: boolean,\n requestHash: string | undefined,\n ): Promise<Resolution> => {\n const fp = validRequest.fingerprint;\n if (fp === undefined) {\n // Explore: always a fresh generation under a minted, immutable pin.\n return { fingerprint: mintFingerprint(), hit: false, replaced: false };\n }\n\n const entry = await cache.get(fp);\n if (entry?.kind === 'mutation') {\n throw new VexError(\n 'invalid_request',\n `Fingerprint \"${fp}\" names a mutation — the query engine cannot execute writes. Replay it through the vex endpoint.`,\n );\n }\n if (entry?.kind === 'ok' && freshOrEvict(entry, fp)) {\n if (!hasRequest || entry.requestHash === requestHash) {\n touch(fp, entry);\n return {\n fingerprint: fp,\n dsl: entry.dsl,\n ...(entry.prismIr !== undefined ? { cachedIr: entry.prismIr } : {}),\n ...(entry.intent !== undefined ? { intent: entry.intent } : {}),\n ...(entry.shape !== undefined ? { shape: entry.shape } : {}),\n ...(entry.refresh !== undefined ? { refresh: entry.refresh } : {}),\n seeded: entry.protected === true && entry.requestHash === undefined,\n hit: true,\n replaced: false,\n };\n }\n if (entry.protected === true) {\n throw new VexError(\n 'fingerprint_protected',\n `Fingerprint \"${fp}\" is protected and this request no longer matches its stored one. Replay it with the fingerprint alone, or use a new name.`,\n );\n }\n // The name is the caller's; its content follows the caller's request.\n return { fingerprint: fp, hit: false, replaced: true };\n }\n\n if (!hasRequest) {\n throw new VexError('cache_miss', `Unknown fingerprint \"${fp}\" — pass intent + shape to (re)generate it.`);\n }\n return { fingerprint: fp, hit: false, replaced: false };\n };\n\n // ─── DSL generation (single-flight + negative caching) ─────\n\n // WHAT A GENERATION MAY TOUCH is what its caller may touch. The hook is\n // handed a `read` capability that runs the engine's own pipeline under the\n // caller's policy and scope values — the only way anything it does reaches\n // the database — and a schema holding only the tables that policy lets the\n // caller read. The DSL it writes is still caller-neutral (scope is applied\n // again on every replay); what it SAW while writing it is the caller's.\n const callerOf = (policy: ScopePolicy | undefined, scope: ScopeValues, tables: readonly string[]): GenerationCaller => ({\n bindings: scopeBindings(behaviors ?? {}, tables, scope),\n read: async (dsl) => {\n const { compiled, warnings } = runPipeline(pruneOptional(dsl, 'all'), policy);\n requireScope(compiled, scope);\n if (compiled.paramSlots.some((slot) => slot.kind === 'semantic')) {\n return { rows: [], sql: compiled.sql, warnings: [...warnings, 'Semantic params present — execution skipped, SQL structure validated only'] };\n }\n // `$context` binds NULL — a probe asks whether a query runs, not what it\n // answers, and NULL compares against a column of any type. Typed guesses\n // were a trap: an empty string against a date column is a cast ERROR,\n // which taught the agent the DSL could not compare dates. Scope binds the\n // caller's own values.\n const params = compiled.paramSlots.map((slot) => (slot.kind === 'scope' ? scope[slot.key] : null));\n return { rows: await adapter.execute(compiled, params), sql: compiled.sql, warnings };\n },\n });\n\n const generateMissingDsl = async (\n validRequest: QueryRequest,\n flightKey: string,\n negKey: string,\n entities: string[] | undefined,\n policy: ScopePolicy | undefined,\n scope: ScopeValues,\n ): Promise<Query> => {\n if (generateDsl === undefined) {\n throw new VexError('agent_failed', 'No query generation function available and no cached query found');\n }\n\n const fullSchema = ensureSchema();\n const agentSchema = {\n ...fullSchema,\n entities: fullSchema.entities.filter(\n (e) => (entities === undefined || entities.includes(e.name)) && (policy === undefined || canReadTable(policy, e.name)),\n ),\n };\n\n const generate = async (): Promise<Query> => {\n try {\n return await generateDsl(validRequest, agentSchema, callerOf(policy, scope, agentSchema.entities.map((e) => e.name)));\n } catch (err) {\n // Cache a negative result so a known-impossible request doesn't\n // re-run the agent. TTL'd — a schema change may make it possible.\n if (isVexError(err) && err.code === 'unsatisfiable') {\n const now = Date.now();\n await cache.set(negKey, {\n kind: 'unsatisfiable',\n reason: err.message,\n createdAt: now,\n expiresAt: now + unsatisfiableTtlMs,\n ...(validRequest.intent !== undefined ? { intent: validRequest.intent } : {}),\n shape: validRequest.shape,\n ...(cachedFingerprint !== undefined ? { schemaFingerprint: cachedFingerprint } : {}),\n });\n }\n throw err;\n }\n };\n\n // Single-flight: a burst of identical requests (same request\n // identity) triggers one generation, not N.\n //\n // Keyed by request AND policy: two callers who can see different tables\n // are asking different agents, and one's answer — or one's \"cannot\n // satisfy\" — is not the other's.\n const existing = inFlight.get(flightKey);\n if (existing !== undefined) return existing;\n\n const generation = generate();\n inFlight.set(flightKey, generation);\n try {\n return await generation;\n } finally {\n inFlight.delete(flightKey);\n }\n };\n\n // ─── Execute SQL + map to shape ────────────────────────────\n\n type MapResult = { result: JsonValue; rowCount: number; executionMs: number; mappingMs?: number; mappedIr?: CompiledIr };\n\n // Prism runs ONCE and its output IS the result. The shape decides the\n // envelope: an ARRAY shape maps over the whole row set (`$.result` is the\n // array — a `$map`/identity); a non-array shape maps the SINGLE (first)\n // row (`$.result` is that row — a detail/aggregate reads `$.result.field`,\n // no `[0]`). Vex never forces an array: the mapping owns the shape.\n //\n // `$.result` is the rows, and it is what every mapping was written\n // against. `$.context` and `$.scope` sit BESIDE it — additive, so nothing\n // authored before this line changes meaning.\n //\n // WHY A MAPPING NEEDS THE SCOPE. A mapping is where a row becomes words\n // (\"Active\", \"Fri 14 Mar\", \"€45\"), and words have a language. Without\n // this, the deepest layer of an application's display strings is the one\n // layer that structurally cannot be localised — and the only escape is to\n // stop mapping in vex and re-derive the same fields somewhere further out,\n // which is worse in every direction.\n //\n // Scope values are ENGINE-side (moss injects them per session; a request\n // cannot author one), so reading them here does not widen what a caller\n // can reach — it widens what the app can say about a caller it already\n // knows. It is also why a reactive read shares ROWS between callers and\n // maps them per caller: the rows are the same, the words may not be.\n const mapRows = (\n rows: Row[],\n shape: unknown,\n ir: CompiledIr,\n context: Record<string, unknown>,\n scope: Record<string, unknown>,\n ): JsonValue => {\n const single = !Array.isArray(shape);\n const source = {\n result: single ? (rows[0] ?? null) : rows,\n context,\n scope,\n } as unknown as JsonObject;\n return executePrism(ir, source);\n };\n\n const executeAndMap = async (\n compiled: CompiledQuery,\n validRequest: QueryRequest,\n cachedIr: CompiledIr | undefined,\n context: Record<string, unknown>,\n scope: Record<string, unknown>,\n ): Promise<MapResult> => {\n const execStart = Date.now();\n const rows = await executeQuery(compiled, context, scope, adapter, embed);\n const executionMs = Date.now() - execStart;\n emit({ type: 'query.rows', count: rows.length, executionMs });\n\n // No shape declared → hand back the raw rows untouched.\n let result: JsonValue = rows as unknown as JsonValue;\n let mappingMs: number | undefined;\n let mappedIr: CompiledIr | undefined = cachedIr;\n\n if (validRequest.shape !== undefined) {\n if (cachedIr !== undefined) {\n const mapStart = Date.now();\n result = mapRows(rows, validRequest.shape, cachedIr, context, scope);\n mappingMs = Date.now() - mapStart;\n } else if (mapToShape !== undefined) {\n const mapStart = Date.now();\n const mapped = await mapToShape(rows, validRequest.shape);\n mappingMs = Date.now() - mapStart;\n result = mapped.transformed;\n mappedIr = mapped.ir;\n }\n if (mappingMs !== undefined) emit({ type: 'query.mapped', mappingMs });\n }\n\n return { result, rowCount: rows.length, executionMs, mappingMs, mappedIr };\n };\n\n // ─── Execute ───────────────────────────────────────────────\n\n const execute = async (\n request: QueryRequest,\n options?: ExecuteOptions,\n ): Promise<QueryResponse> => {\n if (exceedsDepth(request)) throw new VexError('invalid_request', `Invalid request: ${depthRefusal()}`);\n const parsed = QueryRequestSchema.safeParse(request);\n if (!parsed.success) {\n throw new VexError('invalid_request', `Invalid request: ${parsed.error.message}`);\n }\n\n const validRequest = parsed.data;\n const scope: ScopeValues = options?.scope ?? {};\n const activePolicy = options?.scopePolicy ?? scopePolicy;\n const t0 = Date.now();\n\n const hasRequest = validRequest.shape !== undefined && validRequest.shape !== null;\n if (validRequest.fingerprint === undefined && !hasRequest) {\n throw new VexError('invalid_request', 'Pass a fingerprint (replay) or intent + shape (generate) — or both (named slot).');\n }\n const requestHash = hasRequest ? computeRequestHash(validRequest) : undefined;\n const flightKey = requestHash !== undefined ? `${requestHash}:${computePolicyKey(activePolicy)}` : undefined;\n const negKey = flightKey !== undefined ? `neg:${flightKey}` : undefined;\n emit({\n type: 'query.start',\n intent: validRequest.intent,\n shape: validRequest.shape,\n fingerprint: validRequest.fingerprint,\n entities: options?.entities,\n });\n\n // Resolve identity: replay a pin/name, or decide to generate.\n const cached = await resolveFingerprint(validRequest, hasRequest, requestHash);\n emit({ type: 'query.cache', hit: cached.hit, fingerprint: cached.fingerprint, replaced: cached.replaced });\n\n // Generate on miss (consulting the negative cache first).\n let dsl = cached.dsl;\n let agentMs: number | undefined;\n if (dsl === undefined) {\n if (options?.locked === true) {\n throw new VexError('locked', 'This endpoint is replay-only — unknown or changed fingerprints cannot generate here.');\n }\n if (flightKey === undefined || negKey === undefined) {\n throw new VexError('invalid_request', 'Generation needs intent + shape.');\n }\n const negative = await cache.get(negKey);\n if (negative?.kind === 'unsatisfiable' && freshOrEvict(negative, negKey)) {\n emit({ type: 'query.error', code: 'unsatisfiable', message: negative.reason });\n throw new VexError('unsatisfiable', negative.reason);\n }\n const agentStart = Date.now();\n dsl = await generateMissingDsl(validRequest, flightKey, negKey, options?.entities, activePolicy, scope);\n agentMs = Date.now() - agentStart;\n emit({ type: 'query.dsl', dsl, agentMs });\n }\n\n // Run the pipeline. Two caller-driven rewrites happen here and NOWHERE\n // else, both against the stored `dsl` rather than replacing it:\n // · `sortBy`/`sortDir` override the literal `sort` for this run\n // · optional conditions the caller did not key are pruned OUT entirely\n // The cached entry keeps its full form — every run re-derives its own\n // shape, so one stored artifact answers every combination of keys.\n const presence = presenceOf(validRequest.context);\n const shaped = pruneOptional(applySortContext(dsl, validRequest.context), presence);\n const { compiled, warnings, engineLimit } = runPipeline(shaped, activePolicy, cached.seeded === true);\n noteVariant(cached.fingerprint, presenceSignature(dsl, presence), warnings);\n emit({ type: 'query.sql', sql: compiled.sql, warnings });\n\n // A missing SCOPE value is the host's fault and refuses; a missing CONTEXT\n // value is the caller's and answers empty with the contract it missed.\n requireScope(compiled, scope);\n const context = validRequest.context;\n const missingKeys = findMissingContext(compiled, context);\n\n if (missingKeys.length > 0) {\n return {\n result: [],\n meta: {\n cache: {\n hit: cached.hit,\n fingerprint: cached.fingerprint,\n intent: cached.intent ?? validRequest.intent,\n ...(cached.replaced ? { replaced: true } : {}),\n },\n context: buildContextContract(compiled, optionalKeysOf(dsl)),\n warnings: warnings.length > 0 ? warnings : undefined,\n missingContext: missingKeys,\n },\n };\n }\n\n // Execute SQL + map rows to the requested shape. A fingerprint-only\n // replay carries no shape — the stored one drives the envelope.\n const effectiveRequest = hasRequest ? validRequest : { ...validRequest, shape: cached.shape };\n\n // A REACTIVE READ answers from the shared rows and, when the caller asks\n // to follow it, keeps answering. Only a stored entry can be reactive —\n // the mode is authored, never generated — and only one whose mapping is\n // already compiled, because a later answer must never wait on a model.\n const reactiveIr = cached.cachedIr;\n if (cached.hit && cached.refresh === 'reactive' && (effectiveRequest.shape === undefined || reactiveIr !== undefined)) {\n const shape = effectiveRequest.shape;\n const shapeRows = (rows: Row[]): JsonValue =>\n shape === undefined || reactiveIr === undefined ? (rows as unknown as JsonValue) : mapRows(rows, shape, reactiveIr, context, scope);\n const params = await resolveParams(compiled.paramSlots, context, scope, embed);\n // The compiled SQL and its bound values: scope is inside both, so two\n // callers share rows exactly when they would get the same rows.\n const key = canonicalHash([compiled.sql, params]);\n const source: RowsSource = { tables: [...discoverEntities(shaped)], fetch: () => adapter.execute(compiled, params) };\n const execStart = Date.now();\n const rows = await live.read(key, source);\n const executionMs = Date.now() - execStart;\n emit({ type: 'query.rows', count: rows.length, executionMs });\n const result = shapeRows(rows);\n // Per answer: a followed list that grows to the engine's limit says so\n // then, and one that shrinks below it stops saying so.\n const metaOf = (rowCount: number): Omit<QueryResponse['meta'], 'timing'> => {\n const cut = cutNote(engineLimit, shaped.limit, rowCount, shape, validRequest.fingerprint);\n const said = cut === undefined ? warnings : [...warnings, cut];\n return {\n cache: {\n hit: cached.hit,\n fingerprint: cached.fingerprint,\n intent: cached.intent ?? validRequest.intent,\n },\n context: buildContextContract(compiled, optionalKeysOf(dsl)),\n warnings: said.length > 0 ? said : undefined,\n };\n };\n const { signal, onChange } = options ?? {};\n if (signal !== undefined && onChange !== undefined) {\n let lastHash = canonicalHash(result);\n live.follow(key, source, rows, {\n deliver: (next) => {\n const nextResult = shapeRows(next);\n const nextHash = canonicalHash(nextResult);\n if (nextHash === lastHash) return;\n lastHash = nextHash;\n onChange({ result: nextResult, meta: metaOf(next.length) });\n },\n }, signal);\n }\n emit({ type: 'query.done', totalMs: Date.now() - t0 });\n return { result, meta: { ...metaOf(rows.length), timing: { executionMs } } };\n }\n const { result, rowCount, executionMs, mappingMs, mappedIr } = await executeAndMap(\n compiled, effectiveRequest, cached.cachedIr, context, scope,\n );\n const cut = cutNote(engineLimit, shaped.limit, rowCount, effectiveRequest.shape, validRequest.fingerprint);\n const said = cut === undefined ? warnings : [...warnings, cut];\n\n // Store the artifact under its fingerprint. Runtime writes are never\n // protected — that bit belongs to seeds and explicit PATCHes only.\n if (!cached.hit) {\n const now = Date.now();\n const entry: OkCacheEntry = {\n kind: 'ok',\n dsl,\n ...(mappedIr !== undefined ? { prismIr: mappedIr } : {}),\n createdAt: now,\n lastUsedAt: now,\n ...(requestHash !== undefined ? { requestHash } : {}),\n ...(validRequest.intent !== undefined ? { intent: validRequest.intent } : {}),\n shape: validRequest.shape,\n ...(cachedFingerprint !== undefined ? { schemaFingerprint: cachedFingerprint } : {}),\n };\n await cache.set(cached.fingerprint, entry);\n }\n\n emit({ type: 'query.done', totalMs: Date.now() - t0 });\n\n return {\n result,\n meta: {\n cache: {\n hit: cached.hit,\n fingerprint: cached.fingerprint,\n intent: cached.intent ?? validRequest.intent,\n ...(cached.replaced ? { replaced: true } : {}),\n },\n context: buildContextContract(compiled, optionalKeysOf(dsl)),\n timing: {\n ...(agentMs !== undefined ? { agentMs } : {}),\n executionMs,\n ...(mappingMs !== undefined ? { mappingMs } : {}),\n },\n warnings: said.length > 0 ? said : undefined,\n },\n };\n };\n\n // ─── getDslSchema ─────────────────────────────────────────\n\n const getDslSchema = (): object =>\n z.toJSONSchema(QuerySchema, { target: 'draft-7', reused: 'ref' });\n\n // ─── getSchema ─────────────────────────────────────────────\n\n const getSchema = (): DatabaseSchema | undefined => cachedSchema;\n\n return {\n introspect,\n execute,\n compile,\n test,\n getDslSchema,\n getSchema,\n cache,\n invalidate: live.invalidate,\n rows: { stats: live.stats, stop: live.stop },\n };\n};\n","import type {\n DatabaseSchema,\n EntitySchema,\n FieldSchema,\n RelationSchema,\n IndexSchema,\n NormalizedType,\n} from '../../schemas/database.schema.js';\nimport type { IntrospectOptions } from '../adapter.types.js';\n\n// ═══════════════════════════════════════════════════════════════\n// PgPool type (no dependency on `pg` package)\n// ═══════════════════════════════════════════════════════════════\n\nexport type PgQuery = (\n text: string,\n values?: unknown[],\n) => Promise<{ rows: Record<string, unknown>[]; fields?: Array<{ name: string; dataTypeID: number }> }>;\n\nexport type PgPool = {\n query: PgQuery;\n // Several statements land together or not at all.\n //\n // This was missing, and it was not a gap in a future feature: vex's own\n // `executeMutation` throws \"Batch mutations require a transactional client\"\n // whenever a mutation entry is an ARRAY, and no adapter in the repo\n // supplied one — so every batch write failed at runtime with a message\n // about a client nobody could construct. Optional because a pool that\n // genuinely cannot transact should say so by omission rather than by\n // pretending and breaking atomicity quietly.\n transaction?: <T>(fn: (tx: { query: PgQuery }) => Promise<T>) => Promise<T>;\n // False when the database behind the pool cannot enforce\n // `statement_timeout` at all (PGlite: single-threaded, the timer never\n // fires) — see ./statement-timeout.ts. Absent means it can.\n statementTimeouts?: false;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Type mapping\n// ═══════════════════════════════════════════════════════════════\n\nconst normalizeType = (pgType: string): NormalizedType => {\n const lower = pgType.toLowerCase();\n\n // String types\n if (\n lower.startsWith('varchar') ||\n lower.startsWith('character varying') ||\n lower === 'text' ||\n lower.startsWith('char') ||\n lower === 'name' ||\n lower === 'citext'\n ) {\n return 'string';\n }\n\n // Number types\n if (\n lower === 'integer' ||\n lower === 'int' ||\n lower === 'bigint' ||\n lower === 'smallint' ||\n lower === 'serial' ||\n lower === 'bigserial' ||\n lower === 'smallserial' ||\n lower === 'numeric' ||\n lower.startsWith('numeric') ||\n lower === 'decimal' ||\n lower.startsWith('decimal') ||\n lower === 'real' ||\n lower === 'double precision' ||\n lower === 'float' ||\n lower.startsWith('float')\n ) {\n return 'number';\n }\n\n // Boolean\n if (lower === 'boolean' || lower === 'bool') return 'boolean';\n\n // Date\n if (lower === 'date') return 'date';\n\n // Timestamp\n if (lower.startsWith('timestamp')) return 'timestamp';\n\n // UUID\n if (lower === 'uuid') return 'uuid';\n\n // JSON\n if (lower === 'json' || lower === 'jsonb') return 'json';\n\n // Array types (e.g., text[], integer[], etc.)\n if (lower === 'array' || lower.endsWith('[]') || lower.startsWith('_')) return 'array';\n\n // Vector (pgvector)\n if (lower === 'vector' || lower.startsWith('vector')) return 'vector';\n\n return 'unknown';\n};\n\nconst extractVectorDimensions = (pgType: string): number | undefined => {\n // vector(384) → 384\n const match = /vector\\((\\d+)\\)/i.exec(pgType);\n if (match !== null && match[1] !== undefined) {\n return parseInt(match[1], 10);\n }\n return undefined;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// SQL queries for introspection\n// ═══════════════════════════════════════════════════════════════\n\n// A table's and a column's COMMENT is its description: what the schema's author\n// says it means, where Postgres keeps that — and what a query writer needs\n// beside a name (\"members\" are the people in the room). Not part of the schema\n// fingerprint: rewording a comment changes no query.\nconst TABLES_QUERY = `\n SELECT t.table_name, obj_description(cl.oid, 'pg_class') AS description\n FROM information_schema.tables t\n JOIN pg_namespace ns ON ns.nspname = t.table_schema\n JOIN pg_class cl ON cl.relname = t.table_name AND cl.relnamespace = ns.oid\n WHERE t.table_schema = $1\n AND t.table_type = 'BASE TABLE'\n ORDER BY t.table_name\n`;\n\nconst COLUMNS_QUERY = `\n SELECT\n c.table_name,\n c.column_name,\n c.data_type,\n c.udt_name,\n c.is_nullable,\n c.column_default,\n CASE\n WHEN c.data_type = 'USER-DEFINED' THEN c.udt_name\n WHEN c.data_type = 'ARRAY' THEN c.udt_name\n ELSE c.data_type\n END AS effective_type,\n COALESCE(\n (SELECT format_type(a.atttypid, a.atttypmod)\n FROM pg_attribute a\n JOIN pg_class cl ON a.attrelid = cl.oid\n JOIN pg_namespace ns ON cl.relnamespace = ns.oid\n WHERE cl.relname = c.table_name\n AND ns.nspname = $1\n AND a.attname = c.column_name\n AND a.attnum > 0),\n c.data_type\n ) AS full_type,\n (SELECT col_description(a.attrelid, a.attnum)\n FROM pg_attribute a\n JOIN pg_class cl ON a.attrelid = cl.oid\n JOIN pg_namespace ns ON cl.relnamespace = ns.oid\n WHERE cl.relname = c.table_name\n AND ns.nspname = $1\n AND a.attname = c.column_name\n AND a.attnum > 0) AS description\n FROM information_schema.columns c\n WHERE c.table_schema = $1\n ORDER BY c.table_name, c.ordinal_position\n`;\n\n// Every key at once — primary, unique and foreign — from pg_constraint, with\n// the columns in the key's own order and a foreign key's referencing and\n// referenced columns zipped BY POSITION: a two-column key is one row with\n// two ordered pairs.\n//\n// information_schema cannot say this. key_column_usage (the referencing\n// columns) and constraint_column_usage (the referenced ones) share only the\n// constraint's name, so joining them pairs every referencing column with\n// every referenced one, and a key over N columns came back as N×N rows —\n// each read as its own relation, the first of which the resolver joined on.\n// Which came first was row order. A key referencing (id, builder_id) joined\n// on role_id = builder_id and matched nothing, and nothing said so.\n//\n// Ordered by OID, which is creation order. Where two tables reference each\n// other both ways the first-declared key wins the join, and a schema that\n// leans on that (a tenant's builder over a builder's home tenant) is leaning\n// on this ORDER BY. The referenced table must share the schema; a key into\n// another schema names a table no entity here carries and is left out, as\n// before.\nconst CONSTRAINTS_QUERY = `\n SELECT\n c.contype::text AS kind,\n rel.relname AS from_table,\n frel.relname AS to_table,\n array_agg(a.attname ORDER BY k.n)::text[] AS from_columns,\n array_agg(fa.attname ORDER BY k.n)::text[] AS to_columns\n FROM pg_constraint c\n JOIN pg_class rel ON rel.oid = c.conrelid\n JOIN pg_namespace ns ON ns.oid = rel.relnamespace\n LEFT JOIN pg_class frel ON frel.oid = c.confrelid AND frel.relnamespace = rel.relnamespace\n CROSS JOIN LATERAL unnest(c.conkey, c.confkey) WITH ORDINALITY AS k(attnum, fattnum, n)\n JOIN pg_attribute a ON a.attrelid = c.conrelid AND a.attnum = k.attnum\n LEFT JOIN pg_attribute fa ON fa.attrelid = c.confrelid AND fa.attnum = k.fattnum\n WHERE ns.nspname = $1\n AND c.contype IN ('p', 'u', 'f')\n GROUP BY c.oid, c.contype, rel.relname, frel.relname\n ORDER BY c.oid\n`;\n\nconst INDEXES_QUERY = `\n SELECT\n i.tablename AS table_name,\n i.indexname AS index_name,\n ix.indisunique AS is_unique,\n am.amname AS index_type,\n array_agg(a.attname ORDER BY k.n)::text[] AS columns\n FROM pg_indexes i\n JOIN pg_class c ON c.relname = i.indexname\n JOIN pg_index ix ON ix.indexrelid = c.oid\n JOIN pg_am am ON am.oid = c.relam\n CROSS JOIN LATERAL unnest(ix.indkey) WITH ORDINALITY AS k(attnum, n)\n JOIN pg_attribute a ON a.attrelid = ix.indrelid AND a.attnum = k.attnum\n WHERE i.schemaname = $1\n GROUP BY i.tablename, i.indexname, ix.indisunique, am.amname\n ORDER BY i.tablename, i.indexname\n`;\n\nconst ROW_COUNTS_QUERY = `\n SELECT\n relname AS table_name,\n n_live_tup AS row_count\n FROM pg_stat_user_tables\n WHERE schemaname = $1\n`;\n\n// ═══════════════════════════════════════════════════════════════\n// Introspection\n// ═══════════════════════════════════════════════════════════════\n\nexport const introspectPostgres = async (\n pool: PgPool,\n options?: IntrospectOptions,\n): Promise<DatabaseSchema> => {\n const schemaName = options?.schema ?? 'public';\n\n // Run all queries in parallel\n const [tablesResult, columnsResult, keysResult, indexesResult, rowCountsResult] = await Promise.all([\n pool.query(TABLES_QUERY, [schemaName]),\n pool.query(COLUMNS_QUERY, [schemaName]),\n pool.query(CONSTRAINTS_QUERY, [schemaName]),\n pool.query(INDEXES_QUERY, [schemaName]),\n pool.query(ROW_COUNTS_QUERY, [schemaName]),\n ]);\n\n // ─── Keys ──────────────────────────────────────────────────\n type Key = {\n kind: 'p' | 'u' | 'f';\n fromTable: string;\n toTable: string | null;\n fromColumns: string[];\n toColumns: Array<string | null>;\n };\n\n const keys: Key[] = keysResult.rows.map((row) => ({\n kind: row['kind'] as Key['kind'],\n fromTable: row['from_table'] as string,\n toTable: (row['to_table'] as string | null) ?? null,\n fromColumns: row['from_columns'] as string[],\n toColumns: row['to_columns'] as Array<string | null>,\n }));\n\n // Primary keys: table -> PK column names (flags the field)\n const pkMap = new Map<string, Set<string>>();\n // Every column set that makes a row unique — primary and unique keys,\n // whole. A foreign key's reverse is hasOne when the key CONTAINS one of\n // these sets, not when one of its columns appears in any of them:\n // UNIQUE (builder_id, name) says nothing about builder_id alone.\n const uniqueSets = new Map<string, string[][]>();\n for (const key of keys) {\n if (key.kind === 'f') continue;\n if (key.kind === 'p') {\n let cols = pkMap.get(key.fromTable);\n if (cols === undefined) {\n cols = new Set();\n pkMap.set(key.fromTable, cols);\n }\n for (const col of key.fromColumns) cols.add(col);\n }\n let sets = uniqueSets.get(key.fromTable);\n if (sets === undefined) {\n sets = [];\n uniqueSets.set(key.fromTable, sets);\n }\n sets.push(key.fromColumns);\n }\n\n // Row counts: table -> count\n const rowCountMap = new Map<string, number>();\n for (const row of rowCountsResult.rows) {\n const table = row['table_name'] as string;\n const count = Number(row['row_count'] ?? 0);\n rowCountMap.set(table, count);\n }\n\n // ─── Columns grouped by table ─────────────────────────────\n const columnsByTable = new Map<string, FieldSchema[]>();\n for (const row of columnsResult.rows) {\n const table = row['table_name'] as string;\n const colName = row['column_name'] as string;\n const dataType = row['effective_type'] as string;\n const fullType = row['full_type'] as string;\n const isNullable = row['is_nullable'] as string;\n const colDefault = row['column_default'] as string | null;\n const colDescription = row['description'] as string | null;\n\n const tablePks = pkMap.get(table);\n const isPk = tablePks !== undefined && tablePks.has(colName);\n\n const nt = normalizeType(fullType ?? dataType);\n const vecDims = nt === 'vector' ? extractVectorDimensions(fullType ?? dataType) : undefined;\n\n const field: FieldSchema = {\n name: colName,\n type: fullType ?? dataType,\n normalizedType: nt,\n nullable: isNullable === 'YES',\n primaryKey: isPk,\n ...(colDefault !== null ? { defaultValue: colDefault } : {}),\n ...(colDescription !== null && colDescription !== '' ? { description: colDescription } : {}),\n ...(vecDims !== undefined ? { vectorDimensions: vecDims } : {}),\n };\n\n let fields = columnsByTable.get(table);\n if (fields === undefined) {\n fields = [];\n columnsByTable.set(table, fields);\n }\n fields.push(field);\n }\n\n // ─── Foreign keys → Relations ──────────────────────────────\n // One key, two relations: the referencing side's belongsTo and the\n // referenced side's reverse, each carrying the whole key as ordered pairs.\n const relationsByTable = new Map<string, RelationSchema[]>();\n const addRelation = (table: string, relation: RelationSchema): void => {\n let rels = relationsByTable.get(table);\n if (rels === undefined) {\n rels = [];\n relationsByTable.set(table, rels);\n }\n rels.push(relation);\n };\n\n for (const key of keys) {\n if (key.kind !== 'f' || key.toTable === null) continue;\n const foreignFields = key.toColumns.filter((col): col is string => col !== null);\n if (foreignFields.length !== key.fromColumns.length) continue;\n\n const isFkUnique = (uniqueSets.get(key.fromTable) ?? []).some((set) =>\n set.every((col) => key.fromColumns.includes(col)),\n );\n\n // belongsTo: this table's key points at the other table\n addRelation(key.fromTable, {\n type: 'belongsTo',\n entity: key.toTable,\n localFields: key.fromColumns,\n foreignFields,\n });\n\n // hasOne or hasMany: the other table's reverse of the same key\n addRelation(key.toTable, {\n type: isFkUnique ? 'hasOne' : 'hasMany',\n entity: key.fromTable,\n localFields: foreignFields,\n foreignFields: key.fromColumns,\n });\n }\n\n // ─── Indexes ───────────────────────────────────────────────\n const indexesByTable = new Map<string, IndexSchema[]>();\n\n for (const row of indexesResult.rows) {\n const table = row['table_name'] as string;\n const indexName = row['index_name'] as string;\n const isUnique = row['is_unique'] as boolean;\n const indexType = row['index_type'] as string;\n const columns = row['columns'] as string[];\n\n const mappedType = mapIndexType(indexType);\n\n const idx: IndexSchema = {\n name: indexName,\n fields: columns,\n unique: isUnique,\n type: mappedType,\n };\n\n let idxList = indexesByTable.get(table);\n if (idxList === undefined) {\n idxList = [];\n indexesByTable.set(table, idxList);\n }\n idxList.push(idx);\n }\n\n // ─── Build entities ────────────────────────────────────────\n const filteredTables = tablesResult.rows.filter((row) => {\n const name = row['table_name'] as string;\n if (options?.entities !== undefined && !options.entities.includes(name)) return false;\n if (options?.exclude !== undefined && options.exclude.includes(name)) return false;\n return true;\n });\n\n const entities: EntitySchema[] = filteredTables.map((row) => {\n const tableName = row['table_name'] as string;\n const tableDescription = row['description'] as string | null;\n return {\n name: tableName,\n table: tableName,\n ...(tableDescription !== null && tableDescription !== '' ? { description: tableDescription } : {}),\n fields: columnsByTable.get(tableName) ?? [],\n relations: relationsByTable.get(tableName) ?? [],\n indexes: indexesByTable.get(tableName) ?? [],\n rowCount: rowCountMap.get(tableName),\n };\n });\n\n return { entities };\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Helpers\n// ═══════════════════════════════════════════════════════════════\n\nconst mapIndexType = (pgType: string): IndexSchema['type'] => {\n const lower = pgType.toLowerCase();\n if (lower === 'btree') return 'btree';\n if (lower === 'hash') return 'hash';\n if (lower === 'gin') return 'gin';\n if (lower === 'gist') return 'gist';\n if (lower === 'ivfflat') return 'ivfflat';\n if (lower === 'hnsw') return 'hnsw';\n return 'other';\n};\n","import type { ResolvedQuery } from '../../engine/engine.types.js';\nimport type { CompiledQuery, ParamSlot, ContextContract } from '../adapter.types.js';\nimport { compileFilter, compileCompute, compileAggregate, compileJoinPairs, quoteIdent } from './operators.js';\nimport { VexError } from '../../errors.js';\nimport type { CompilationContext } from './operators.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Query compilation\n// ═══════════════════════════════════════════════════════════════\n\nexport const compileQuery = (resolved: ResolvedQuery): CompiledQuery => {\n const paramSlots: ParamSlot[] = [];\n const paramCounter = { value: 0 };\n\n const ctx: CompilationContext = {\n resolvedPaths: resolved.filter?.resolvedPaths ?? new Map(),\n aliasMap: resolved.aliasMap,\n paramSlots,\n paramCounter,\n ...(resolved.existsMap !== undefined ? { existsMap: resolved.existsMap } : {}),\n };\n\n const sqlParts: string[] = [];\n\n // ─── SELECT ────────────────────────────────────────────────\n const selectParts: string[] = [];\n\n if (resolved.distinct) {\n selectParts.push('DISTINCT');\n }\n\n // Regular fields\n const fieldColumns = resolved.fields.map((f) =>\n `${f.alias}.${f.column} AS ${quoteIdent(f.outputName)}`,\n );\n\n // Computed fields\n const computeColumns = resolved.computes.map((c) => {\n const expr = compileCompute(c.expression, ctx);\n return `${expr} AS ${quoteIdent(c.name)}`;\n });\n\n // Aggregate fields\n const aggregateColumns = resolved.aggregates.map((a) => {\n const expr = compileAggregate(a.expression, ctx);\n return `${expr} AS ${quoteIdent(a.name)}`;\n });\n\n // Semantic score column\n const semanticColumns: string[] = [];\n if (resolved.semantic !== undefined) {\n const col = `${resolved.semantic.field.alias}.${resolved.semantic.field.column}`;\n\n // The semantic parameter was already added when compiling the filter\n // We need to add the score column using the same parameter reference\n // Find the semantic param slot index\n const semanticParamIndex = findSemanticParamIndex(paramSlots);\n if (semanticParamIndex !== undefined) {\n semanticColumns.push(`1 - (${col} <=> $${semanticParamIndex}) AS \"$score\"`);\n }\n }\n\n const allColumns = [...fieldColumns, ...computeColumns, ...aggregateColumns, ...semanticColumns];\n if (selectParts.length > 0) {\n sqlParts.push(`SELECT ${selectParts.join(' ')} ${allColumns.join(', ')}`);\n } else {\n sqlParts.push(`SELECT ${allColumns.join(', ')}`);\n }\n\n // ─── FROM ──────────────────────────────────────────────────\n const firstSource = resolved.sources[0];\n if (firstSource !== undefined) {\n if (firstSource.subquery !== undefined) {\n const subSql = compileQuery(firstSource.subquery);\n // Merge sub-params into our slots (offset positions)\n mergeSubqueryParams(subSql, paramSlots, paramCounter);\n sqlParts.push(`FROM (${subSql.sql}) AS ${firstSource.alias}`);\n } else if (firstSource.table !== undefined) {\n sqlParts.push(`FROM ${firstSource.table} AS ${firstSource.alias}`);\n }\n }\n\n // ─── JOIN ──────────────────────────────────────────────────\n // A join's ON clause is the FK condition plus anything scope put there. The\n // extras only ever appear on LEFT joins, and they are the whole reason a LEFT\n // join survives a row rule: in WHERE they would annihilate every driving row\n // whose optional FK is null.\n for (const join of resolved.joins) {\n const joinSource = resolved.sources.find((s) => s.alias === join.toAlias);\n if (joinSource !== undefined) {\n const keyword = join.kind === 'left' ? 'LEFT JOIN' : 'JOIN';\n const conditions = [\n ...compileJoinPairs(join),\n ...(join.on ?? []).map((extra) => compileFilter(extra.original, ctx)),\n ];\n const on = conditions.join(' AND ');\n if (joinSource.subquery !== undefined) {\n const subSql = compileQuery(joinSource.subquery);\n mergeSubqueryParams(subSql, paramSlots, paramCounter);\n sqlParts.push(`${keyword} (${subSql.sql}) AS ${join.toAlias} ON ${on}`);\n } else {\n sqlParts.push(`${keyword} ${join.toTable} AS ${join.toAlias} ON ${on}`);\n }\n }\n }\n\n // ─── CROSS JOIN ────────────────────────────────────────────\n // Sources past the first with no join condition are cross-joined. A string\n // entity always gets an FK join (or the resolver throws), so in practice only\n // subquery sources land here — independent derived tables the author chose to\n // combine (e.g. four single-row COUNT aggregates → one row of counts). The\n // cartesian product is therefore intended, not an inferred mistake.\n const joinedAliases = new Set(resolved.joins.map((j) => j.toAlias));\n for (const source of resolved.sources) {\n if (source.alias === firstSource?.alias || joinedAliases.has(source.alias)) continue;\n if (source.subquery !== undefined) {\n const subSql = compileQuery(source.subquery);\n mergeSubqueryParams(subSql, paramSlots, paramCounter);\n sqlParts.push(`CROSS JOIN (${subSql.sql}) AS ${source.alias}`);\n } else if (source.table !== undefined) {\n sqlParts.push(`CROSS JOIN ${source.table} AS ${source.alias}`);\n }\n }\n\n // ─── WHERE ─────────────────────────────────────────────────\n if (resolved.filter !== undefined) {\n const whereClause = compileFilter(resolved.filter.original, ctx);\n sqlParts.push(`WHERE ${whereClause}`);\n }\n\n // ─── GROUP BY ──────────────────────────────────────────────\n if (resolved.groupBy.length > 0) {\n const groupByParts = resolved.groupBy.map((f) => `${f.alias}.${f.column}`);\n sqlParts.push(`GROUP BY ${groupByParts.join(', ')}`);\n }\n\n // ─── ORDER BY ──────────────────────────────────────────────\n if (resolved.sort.length > 0) {\n const orderByParts = resolved.sort.map((s) => {\n if (typeof s.field === 'string') {\n return `${quoteIdent(s.field)} ${s.dir === 'desc' ? 'DESC' : 'ASC'}`;\n }\n return `${s.field.alias}.${s.field.column} ${s.dir === 'desc' ? 'DESC' : 'ASC'}`;\n });\n sqlParts.push(`ORDER BY ${orderByParts.join(', ')}`);\n } else if (resolved.semantic !== undefined) {\n const semanticIdx = findSemanticParamIndex(paramSlots);\n if (semanticIdx !== undefined) {\n const col = `${resolved.semantic.field.alias}.${resolved.semantic.field.column}`;\n sqlParts.push(`ORDER BY ${col} <=> $${semanticIdx} ASC`);\n }\n }\n\n // ─── LIMIT ─────────────────────────────────────────────────\n if (resolved.limit !== undefined) {\n // The schema says a positive integer; a DSL that skipped the schema is held\n // to it here, because this is text, not a parameter.\n if (!Number.isInteger(resolved.limit) || resolved.limit < 1) {\n throw new VexError('invalid_dsl', `LIMIT must be a positive integer, not ${String(resolved.limit)}.`);\n }\n sqlParts.push(`LIMIT ${resolved.limit}`);\n }\n\n // ─── Build context contract ────────────────────────────────\n const contextContract: ContextContract = {};\n for (const slot of paramSlots) {\n contextContract[slot.key] = { type: slot.type, kind: slot.kind };\n }\n\n return {\n sql: sqlParts.join(' '),\n paramSlots,\n contextContract,\n };\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Helpers\n// ═══════════════════════════════════════════════════════════════\n\nconst findSemanticParamIndex = (slots: ParamSlot[]): number | undefined => {\n for (let i = 0; i < slots.length; i++) {\n const slot = slots[i];\n if (slot !== undefined && slot.kind === 'semantic') {\n return i + 1; // 1-indexed for $N references\n }\n }\n return undefined;\n};\n\nconst mergeSubqueryParams = (\n subCompiled: CompiledQuery,\n parentSlots: ParamSlot[],\n parentCounter: { value: number },\n): void => {\n // Subqueries have their own parameter numbering which we need to\n // offset when embedding in the parent query. For simplicity in this\n // implementation, subquery parameters are compiled independently.\n // A full implementation would rewrite $N references in the subquery SQL.\n // For now, subqueries that reference context/scope params work because\n // the executor resolves all params from all slots in order.\n for (const slot of subCompiled.paramSlots) {\n parentCounter.value += 1;\n parentSlots.push(slot);\n }\n};\n","import type { PgPool } from './introspect.js';\n\n// ═══════════════════════════════════════════════════════════════\n// HOW LONG ONE READ MAY RUN, enforced where it is cheapest.\n//\n// The engine asks for a ceiling (`config.statementTimeoutMs`); the database\n// is what has to enforce it — a client that stops waiting leaves the query\n// running on the server (measured: `query_timeout` gave up at 200ms and the\n// sleep was still active in pg_stat_activity). Postgres enforces\n// `statement_timeout` two ways, and they cost very differently (Postgres 17,\n// 500 reads each):\n//\n// · on the connection (the pool's own `statement_timeout`, a role or a\n// database default) — 0.36ms a read, the same as none;\n// · per statement (`SET LOCAL` in a transaction) — 1.37ms a read, 3.4×,\n// and more across a network.\n//\n// So the adapter asks the database once what its connections already\n// enforce. At or under the ceiling: reads run plain. Otherwise each read is\n// wrapped. A pool that cannot enforce it at all (PGlite: single-threaded, the\n// timer never fires — a 2s sleep ran 2.9s under a 200ms limit) says so, and\n// reads run unbounded with one warning.\n// ═══════════════════════════════════════════════════════════════\n\nexport type TimeoutEnforcement = 'connection' | 'statement' | 'unenforced';\n\n// `SHOW statement_timeout` answers in Postgres units: '0', '250ms', '5s',\n// '1min', '2h', '1d'; a bare number is milliseconds.\nconst UNIT_MS: Record<string, number> = { '': 1, ms: 1, s: 1000, min: 60_000, h: 3_600_000, d: 86_400_000 };\n\nexport const parseTimeout = (shown: string): number | undefined => {\n const match = /^\\s*(\\d+(?:\\.\\d+)?)\\s*(ms|s|min|h|d)?\\s*$/.exec(shown);\n if (match === null) return undefined;\n const unit = UNIT_MS[match[2] ?? ''];\n return unit === undefined ? undefined : Number(match[1]) * unit;\n};\n\nexport const enforcementFor = async (pool: PgPool, ceilingMs: number): Promise<TimeoutEnforcement> => {\n if (pool.statementTimeouts === false) return 'unenforced';\n const shown = await pool.query('SHOW statement_timeout');\n const current = parseTimeout(String(shown.rows[0]?.['statement_timeout'] ?? ''));\n if (current !== undefined && current > 0 && current <= ceilingMs) return 'connection';\n return pool.transaction === undefined ? 'unenforced' : 'statement';\n};\n","import type { DatabaseAdapter, AdapterCapabilities, CompiledQuery, BoundParams, Row, IntrospectOptions } from '../adapter.types.js';\nimport type { DatabaseSchema } from '../../schemas/database.schema.js';\nimport type { ResolvedQuery } from '../../engine/engine.types.js';\nimport { introspectPostgres } from './introspect.js';\nimport type { PgPool } from './introspect.js';\nimport { compileQuery } from './compile.js';\nimport { enforcementFor, type TimeoutEnforcement } from './statement-timeout.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Config\n// ═══════════════════════════════════════════════════════════════\n\nexport type PostgresAdapterConfig = {\n pool: PgPool;\n schema?: string;\n // Tables this adapter never reports. Set once at construction because the\n // caller that knows a table is not application data is the one wiring the\n // adapter, not each caller of `introspect()` — and `QueryEngine.introspect`\n // takes no arguments, so per-call is not reachable from a host anyway.\n exclude?: string[];\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Adapter factory\n// ═══════════════════════════════════════════════════════════════\n\nconst NUMERIC_OIDS = new Set([\n 20, // int8\n 700, // float4\n 701, // float8\n 1700, // numeric\n]);\n\ntype PgField = { name: string; dataTypeID: number };\n\nconst coerceNumericColumns = (rows: Row[], fields: PgField[]): Row[] => {\n const numericKeys = fields\n .filter(f => NUMERIC_OIDS.has(f.dataTypeID))\n .map(f => f.name);\n if (numericKeys.length === 0 || rows.length === 0) return rows;\n return rows.map(row => {\n const out = { ...row };\n for (const key of numericKeys) {\n const v = out[key];\n if (typeof v === 'string') {\n const n = Number(v);\n if (Number.isFinite(n)) out[key] = n;\n }\n }\n return out;\n });\n};\n\nexport const createPostgresAdapter = (config: PostgresAdapterConfig): DatabaseAdapter => {\n const { pool, schema = 'public', exclude } = config;\n\n const capabilities: AdapterCapabilities = {\n vectorSearch: true,\n fuzzyMatch: false, // Requires pg_trgm extension, not guaranteed\n jsonFields: true,\n fullTextSearch: true,\n returningClause: true,\n cte: true,\n windowFunctions: true,\n statementTimeout: true,\n };\n\n const introspect = async (options?: IntrospectOptions): Promise<DatabaseSchema> =>\n introspectPostgres(pool, {\n ...options,\n schema: options?.schema ?? schema,\n exclude: options?.exclude ?? exclude,\n });\n\n const compile = (resolved: ResolvedQuery): CompiledQuery =>\n compileQuery(resolved);\n\n // How reads are bounded (./statement-timeout.ts): unbounded until the\n // engine asks; then plain when the connection already enforces the limit,\n // wrapped per statement when it does not.\n let perStatementMs: number | undefined;\n const limitReads = async (ms: number): Promise<TimeoutEnforcement> => {\n perStatementMs = undefined;\n if (ms <= 0) return 'unenforced';\n const enforcement = await enforcementFor(pool, ms);\n if (enforcement === 'statement') perStatementMs = Math.round(ms);\n return enforcement;\n };\n\n const execute = async (query: CompiledQuery, params: BoundParams): Promise<Row[]> => {\n const limit = perStatementMs;\n // `transaction` is called ON the pool, never taken off it: a driver's own\n // object (a PGlite) has it as a method that needs its receiver.\n const result =\n limit === undefined || pool.transaction === undefined\n ? await pool.query(query.sql, params)\n : await pool.transaction(async (tx) => {\n // SET cannot take a bind parameter; the limit is an integer the\n // engine configured, never request data.\n await tx.query(`SET LOCAL statement_timeout = ${limit}`);\n return tx.query(query.sql, params);\n });\n return coerceNumericColumns(result.rows, result.fields as PgField[]);\n };\n\n return {\n id: 'postgres',\n introspect,\n compile,\n execute,\n capabilities,\n limitReads,\n };\n};\n","// ═══════════════════════════════════════════════════════════\n// The agent-facing Vex guide — exported knowledge, not app prose.\n//\n// Any agent that reads or embeds Vex endpoints injects THIS text\n// (plus `handleDiscovery` output for the live per-endpoint facts:\n// entities, existing fingerprints, the DSL schema). Apps add only\n// their genuinely app-specific lines (URLs, house rules) — they\n// never re-explain Vex, so the contract can't drift per app.\n// ═══════════════════════════════════════════════════════════\n\nexport const vexGuide = (): string =>\n [\n 'VEX — how to read data. A Vex endpoint answers POST with a JSON body and returns { result, meta }.',\n '',\n 'The request body takes one of three postures:',\n ' 1. GENERATE: { intent, shape, context? } — intent is plain English (all detail: filters, thresholds, sorting, grouping); shape is a JSON EXAMPLE of the output (an ARRAY with one example element returns a LIST; a plain OBJECT returns ONE record; values are type markers: \"\" 0 false). The result is cached and meta.cache.fingerprint carries its identity.',\n ' 2. REPLAY: { fingerprint, context? } — re-runs the exact cached query. Never regenerates. Unknown fingerprint → error cache_miss.',\n ' 3. NAMED SLOT: { fingerprint, intent, shape, context? } — hit when the stored request matches; regenerate-and-replace when it differs (protected slots refuse with fingerprint_protected).',\n '',\n 'context — runtime values, bound as SQL parameters:',\n ' - Keys are part of the query\\'s contract; VALUES vary freely per call. Replaying one fingerprint with different context values re-runs the same query with new parameters — this is how a search term, an id, a threshold, or a date flows in per call.',\n ' - The query binds ONLY keys you pass at generation. To parameterize a query: name the value in the intent AND pass the key with a real value in context — e.g. intent \"companies whose name contains the search text\" with context { \"q\": \"acme\" }. Replays then pass new values for the same keys.',\n ' - Reserved keys: sortBy (an \"entity.field\", schema-validated) and sortDir (\"asc\"|\"desc\") drive ORDER BY directly on any replay.',\n ' - A value the query filters with ILIKE is a pattern: \"%text%\" matches contains.',\n ' - OPTIONAL keys: meta.context marks some keys `optional: true`. Those switch a condition ON — send the key and it applies, omit it and the condition is not in the query at all (it does not match everything by accident, and omitting it is never an error). A key marked `absent: true` is one you did not send on this run. This is how one fingerprint answers \"everyone\", \"everyone matching a search\", and \"one by id\".',\n '',\n 'result — exactly the requested shape (array, object, or scalar). meta.cache = { hit, fingerprint, replaced? }; meta.missingContext lists REQUIRED context keys you did not send — the query ran without them, so the result is WRONG. Supply the keys and re-run before trusting it. Optional keys never appear there; leaving one out is a choice, not a mistake.',\n '',\n 'GET on the same URL returns the endpoint\\'s self-description: its entities, the query body contract, and every existing named fingerprint with its intent — check it before generating a query that may already exist.',\n ].join('\\n');\n","import type { Query } from '../schemas/query.schema.js';\nimport type { CompiledIr } from '@niscorp/prism';\nimport type { MutationDefinition } from '../mutations/schema.js';\nimport type { Sequence } from '@niscorp/strata';\n\n// ───────────────────────────────────────────────────────────────\n// Cache entries\n//\n// Discriminated on `kind`:\n// - 'ok' — a successful shape→DSL synthesis (+ optional\n// Prism mapping IR). The happy path.\n// - 'mutation' — a WRITE artifact: a dev-authored mutation def\n// replayed by fingerprint. Never generated; enters\n// only through the seed path (and is normally\n// protected). Replay-only under any posture.\n// - 'unsatisfiable' — a negative result: the agent decided this\n// shape/intent cannot be satisfied. Cached so we\n// don't re-run the agent on a known-impossible\n// request. Always carries an `expiresAt` (a shape\n// impossible today may be possible after a schema\n// change).\n// ───────────────────────────────────────────────────────────────\n\n// ───────────────────────────────────────────────────────────────\n// When a read's answer is refreshed.\n//\n// 'snapshot' — the default, and what every read was before this existed:\n// answered when asked, never again.\n// 'reactive' — answered when asked, and again whenever a write lands on a\n// table the query reads, for as long as somebody follows it\n// (see engine/live.ts). Rows are shared between callers whose\n// compiled SQL and bound values are identical.\n//\n// A mode, not a flag, because it will grow: time as a source of change\n// (a read that depends on `today`) is the next state it is waiting for.\n// ───────────────────────────────────────────────────────────────\n\nexport const REFRESH_MODES = ['snapshot', 'reactive'] as const;\nexport type Refresh = (typeof REFRESH_MODES)[number];\n\nexport const isRefresh = (value: unknown): value is Refresh => REFRESH_MODES.some((mode) => mode === value);\n\ntype CacheEntryMeta = {\n createdAt: number;\n /**\n * Touch-on-read timestamp. Lifetime is usage: a GC sweep evicts\n * entries unused for a configured window; protected entries never\n * sweep. Replaces the provisional/permanent distinction entirely.\n */\n lastUsedAt?: number;\n expiresAt?: number;\n /**\n * Protected entries refuse replacement: a fingerprint request whose\n * intent/shape differ from the stored ones errors instead of\n * regenerating. Written ONLY by the seed path and an explicit PATCH —\n * never by query execution.\n */\n protected?: boolean;\n /**\n * Identity of the request that produced this entry (intent + normalized\n * shape + context key names). A fingerprint request with a matching\n * hash is a hit; a differing one regenerates (or 409s when protected).\n */\n requestHash?: string;\n /**\n * Fingerprint of the database schema at write time. When it no longer\n * matches the current schema, the entry is stale (its DSL may\n * reference columns that have since changed) and is treated as a miss.\n */\n schemaFingerprint?: string;\n /**\n * The originating request's intent and shape — descriptive metadata\n * for inspection and the GET overview. Never part of identity.\n */\n intent?: string;\n shape?: unknown;\n};\n\nexport type OkCacheEntry = CacheEntryMeta & {\n kind: 'ok';\n dsl: Query;\n prismIr?: CompiledIr;\n /**\n * THE REACH THIS READ REQUIRES, whatever the caller's roles say.\n *\n * Reach is normally the caller's: a scope profile named by their role, applied\n * to every table they touch. That is right for a read whose answer legitimately\n * widens with the reader — a roster, a schedule, a members list.\n *\n * It is wrong for a read that means \"mine\". A principal may hold several roles\n * and the compiled policies merge to the WIDEST reach any of them grants, so an\n * instructor who also trains at the studio reads `bookings` studio-wide — and\n * \"the classes you have booked\" then answers with the whole studio's.\n *\n * An entry naming a reach is served at that profile instead, with the caller's\n * own grants unchanged. It can only narrow: a read the caller holds no verb for\n * is still refused. If the profile cannot be compiled, the read is refused\n * rather than served wide.\n */\n reach?: string;\n /** When this read's answer is refreshed. Absent means 'snapshot'. */\n refresh?: Refresh;\n};\n\nexport type UnsatisfiableCacheEntry = CacheEntryMeta & {\n kind: 'unsatisfiable';\n reason: string;\n};\n\nexport type MutationCacheEntry = CacheEntryMeta & {\n kind: 'mutation';\n mutation: MutationDefinition;\n /**\n * THE REACH THIS WRITE REQUIRES — the same word reads use, and it belongs\n * here for a sharper reason.\n *\n * A read served too wide shows somebody too much. A write served too wide\n * CHANGES somebody else's row: `me/cancel` is \"cancel MY booking\", and its\n * whole safety is that the policy's update rules pin the row to the caller.\n * Take a principal who holds two roles and the merge widens those rules to\n * the broadest either grants — so the same fingerprint, replayed by somebody\n * who is a member AND something else, could reach a booking that is not\n * theirs.\n *\n * Declaring it here means the write is compiled at that profile whoever asks.\n */\n reach?: string;\n};\n\nexport type CacheEntry = OkCacheEntry | UnsatisfiableCacheEntry | MutationCacheEntry;\n\n// ───────────────────────────────────────────────────────────────\n// Backend interface\n//\n// `get/set/delete/clear/keys` are the core contract every backend\n// implements. `init` and `entries` are optional capabilities: backends\n// that need setup (Postgres) expose `init`, and backends that can\n// enumerate without N+1 reads (Postgres, memory) expose `entries`. The\n// tiered cache uses both for warm-up; a management UI would use\n// `entries` for browsing.\n// ───────────────────────────────────────────────────────────────\n\nexport type CacheBackend = {\n get: (key: string) => Promise<CacheEntry | undefined>;\n set: (key: string, entry: CacheEntry) => Promise<void>;\n delete: (key: string) => Promise<void>;\n clear: () => Promise<void>;\n keys: () => Promise<string[]>;\n init?: () => Promise<void>;\n // The tables this backend owns, as a strata sequence (Postgres). A host that\n // migrates several owners in one run (moss) collects it; `init` applies it\n // alone for everyone else. Either way it goes through the ledger.\n sequence?: Sequence;\n entries?: () => Promise<Array<{ key: string; entry: CacheEntry }>>;\n};\n","import { QuerySchema } from '../schemas/query.schema.js';\nimport { MutationDefinitionSchema } from '../mutations/schema.js';\nimport { depthRefusal, exceedsDepth } from '@niscorp/strata';\nimport type { CacheEntry } from './cache.types.js';\nimport { isRefresh } from './cache.types.js';\n\n// ───────────────────────────────────────────────────────────────\n// Entry validation\n//\n// Every persisted (jsonb) write is validated before it lands, and every\n// entry promoted from a durable backend into memory is validated before\n// it is trusted. This is the guard that keeps a corrupt or\n// schema-drifted row from poisoning the cache. It is deliberately cheap\n// and synchronous so it can sit on the write path and the promotion\n// path without adding a round-trip.\n// ───────────────────────────────────────────────────────────────\n\n// Prism does not export a Zod schema for the *compiled* IR (only for\n// the input Config), so we validate structurally. The runtime-attached\n// `__op`/`__segments` handlers are non-enumerable and do not survive a\n// JSON round-trip — that is fine, Prism's evaluator falls back to its\n// discriminant chain when they are absent. We only assert the\n// serializable skeleton is intact.\nconst isCompiledIr = (value: unknown): boolean => {\n if (value === null || typeof value !== 'object') return false;\n const ir = value as Record<string, unknown>;\n if (ir['irVersion'] !== 1) return false;\n if (!('core' in ir)) return false;\n const tables = ir['tables'];\n if (tables === null || typeof tables !== 'object') return false;\n const t = tables as Record<string, unknown>;\n return Array.isArray(t['paths']) && Array.isArray(t['strings']);\n};\n\n/**\n * Returns `null` if the entry is valid, or a human-readable reason\n * string if it is not.\n */\nexport const validateEntry = (entry: CacheEntry): string | null => {\n if (typeof entry.createdAt !== 'number') return 'createdAt must be a number';\n if (entry.expiresAt !== undefined && typeof entry.expiresAt !== 'number') {\n return 'expiresAt must be a number when present';\n }\n\n if (entry.kind === 'unsatisfiable') {\n return typeof entry.reason === 'string' && entry.reason.length > 0\n ? null\n : 'unsatisfiable entry requires a non-empty reason';\n }\n\n if (entry.kind === 'ok') {\n if (exceedsDepth(entry.dsl)) return `invalid dsl: ${depthRefusal()}`;\n const parsed = QuerySchema.safeParse(entry.dsl);\n if (!parsed.success) return `invalid dsl: ${parsed.error.message}`;\n if (entry.prismIr !== undefined && !isCompiledIr(entry.prismIr)) {\n return 'invalid prismIr: not a CompiledIr structure';\n }\n if (entry.refresh !== undefined && !isRefresh(entry.refresh)) {\n return `invalid refresh: ${String(entry.refresh)}`;\n }\n return null;\n }\n\n if (entry.kind === 'mutation') {\n if (exceedsDepth(entry.mutation)) return `invalid mutation: ${depthRefusal()}`;\n const parsed = MutationDefinitionSchema.safeParse(entry.mutation);\n return parsed.success ? null : `invalid mutation: ${parsed.error.message}`;\n }\n\n return `unknown cache entry kind: ${String((entry as { kind: unknown }).kind)}`;\n};\n","import type { PgPool } from '../adapters/postgres/introspect.js';\nimport type { Query } from '../schemas/query.schema.js';\nimport type { CompiledIr } from '@niscorp/prism';\nimport type { MutationDefinition } from '../mutations/schema.js';\nimport type { CacheBackend, CacheEntry } from './cache.types.js';\nimport { isRefresh } from './cache.types.js';\nimport { validateEntry } from './validate.js';\nimport { fireAndForget } from './util.js';\nimport type { Sequence } from '@niscorp/strata';\nimport { migrate } from '@niscorp/strata/postgres';\n\nexport type { PgPool };\n\n// ═══════════════════════════════════════════════════════════════\n// Postgres cache backend (L2 — durable source of truth)\n//\n// Stores entries as jsonb in a configurable schema/table. Designed to\n// sit *behind* an in-memory tier (see createTieredCache): on its own it\n// reads from Postgres on every get, which is correct but not what you\n// want on the hot path. Use it directly only when you don't want an L1.\n//\n// Guarantees:\n// - Every write is schema-validated first. An invalid entry is never\n// written — it is logged via onError (or thrown if no handler).\n// - Reads are validated too (rare: L2 misses / warm-up). A corrupt or\n// schema-drifted row is evicted on read so it can't keep failing.\n// - TTL (expires_at) is enforced server-side; expired rows read as\n// misses and are excluded from keys()/entries().\n// ═══════════════════════════════════════════════════════════════\n\nexport type PostgresCacheConfig = {\n /** A pg Pool (or anything matching its query shape). The caller owns its lifecycle. */\n pool: PgPool;\n /** Schema to place the cache table in. Default: 'public'. */\n schema?: string;\n /** Table name. Default: 'vex_cache'. */\n table?: string;\n /** Called on rejected writes and evicted-on-read invalid rows. */\n onError?: (err: unknown) => void;\n};\n\nexport type PostgresCache = CacheBackend & {\n init: () => Promise<void>;\n sequence: Sequence;\n entries: () => Promise<Array<{ key: string; entry: CacheEntry }>>;\n};\n\n// Identifiers cannot be parameterized in SQL, so they are validated\n// against a strict allowlist and double-quoted.\nconst IDENT = /^[A-Za-z_][A-Za-z0-9_]*$/;\nconst quoteIdent = (name: string, label: string): string => {\n if (!IDENT.test(name)) {\n throw new Error(`Invalid ${label} identifier for postgres cache: \"${name}\"`);\n }\n return `\"${name}\"`;\n};\n\nconst SELECT_COLS =\n 'key, kind, intent, shape, dsl, prism_ir, reach, reason, created_at, expires_at, schema_fingerprint, protected, last_used_at, request_hash, refresh';\n\nconst rowToEntry = (row: Record<string, unknown>): CacheEntry => {\n const createdAt = (row['created_at'] as Date).getTime();\n const expiresAtRaw = row['expires_at'] as Date | null;\n const lastUsedRaw = row['last_used_at'] as Date | null;\n const fingerprint = row['schema_fingerprint'] as string | null;\n const meta = {\n createdAt,\n ...(expiresAtRaw ? { expiresAt: expiresAtRaw.getTime() } : {}),\n ...(lastUsedRaw ? { lastUsedAt: lastUsedRaw.getTime() } : {}),\n ...(row['protected'] === true ? { protected: true } : {}),\n ...(row['request_hash'] != null ? { requestHash: String(row['request_hash']) } : {}),\n ...(fingerprint ? { schemaFingerprint: fingerprint } : {}),\n ...(row['intent'] != null ? { intent: String(row['intent']) } : {}),\n ...(row['shape'] != null ? { shape: row['shape'] } : {}),\n };\n\n if (row['kind'] === 'unsatisfiable') {\n return { kind: 'unsatisfiable', reason: String(row['reason'] ?? ''), ...meta };\n }\n // A mutation entry stores its def in the same jsonb slot a query's DSL\n // uses — one column, discriminated by `kind`.\n if (row['kind'] === 'mutation') {\n return {\n kind: 'mutation',\n mutation: row['dsl'] as MutationDefinition,\n ...(row['reach'] != null ? { reach: row['reach'] as string } : {}),\n ...meta,\n };\n }\n return {\n kind: 'ok',\n dsl: row['dsl'] as Query,\n ...(row['prism_ir'] != null ? { prismIr: row['prism_ir'] as CompiledIr } : {}),\n // A DECLARED REACH IS PART OF THE ENTRY, so it has to survive the round\n // trip. Dropping it here would not fail loudly — the read would simply be\n // served at the caller's own, wider reach, which is the exact thing the\n // field exists to prevent.\n ...(row['reach'] != null ? { reach: row['reach'] as string } : {}),\n // So must the refresh mode: dropped, a reactive read would quietly answer\n // once and never again.\n ...(isRefresh(row['refresh']) ? { refresh: row['refresh'] } : {}),\n ...meta,\n };\n};\n\nexport const createPostgresCache = (config: PostgresCacheConfig): PostgresCache => {\n const { pool, onError } = config;\n const schema = quoteIdent(config.schema ?? 'public', 'schema');\n const table = quoteIdent(config.table ?? 'vex_cache', 'table');\n const qualified = `${schema}.${table}`;\n\n // THE TABLE, AS A STRATA SEQUENCE. Migration 1 is the DDL every boot used to\n // run, verbatim — CREATE … IF NOT EXISTS plus the ADD COLUMN IF NOT EXISTS\n // that caught older tables up — so it converges ANY earlier shape of the\n // table to the current one: a fresh database and a deployment from months\n // ago both land here, once, and the ledger remembers. Changes from now on are\n // appended as plain migrations; this list is never edited.\n //\n // One sequence per table: a cache under a non-default name is its own owner.\n const isDefault = (config.schema ?? 'public') === 'public' && (config.table ?? 'vex_cache') === 'vex_cache';\n const slug = `${config.schema ?? 'public'}-${config.table ?? 'vex_cache'}`.toLowerCase().replace(/[^a-z0-9-]/g, '-');\n const sequence: Sequence = {\n id: isDefault ? 'nisc.vex.cache' : `nisc.vex.cache.${slug}`,\n migrations: [\n {\n description: 'The vex cache table, converged from any earlier shape',\n steps: [\n { kind: 'sql', sql: `CREATE SCHEMA IF NOT EXISTS ${schema}` },\n {\n kind: 'sql',\n sql: `CREATE TABLE IF NOT EXISTS ${qualified} (\n key text PRIMARY KEY,\n kind text NOT NULL DEFAULT 'ok',\n intent text,\n shape jsonb,\n dsl jsonb,\n prism_ir jsonb,\n reach text,\n reason text,\n created_at timestamptz NOT NULL DEFAULT now(),\n expires_at timestamptz,\n schema_fingerprint text,\n protected boolean NOT NULL DEFAULT false,\n last_used_at timestamptz,\n request_hash text,\n refresh text\n )`,\n },\n { kind: 'sql', sql: `ALTER TABLE ${qualified} ADD COLUMN IF NOT EXISTS protected boolean NOT NULL DEFAULT false` },\n { kind: 'sql', sql: `ALTER TABLE ${qualified} ADD COLUMN IF NOT EXISTS last_used_at timestamptz` },\n { kind: 'sql', sql: `ALTER TABLE ${qualified} ADD COLUMN IF NOT EXISTS request_hash text` },\n { kind: 'sql', sql: `ALTER TABLE ${qualified} ADD COLUMN IF NOT EXISTS reach text` },\n { kind: 'sql', sql: `ALTER TABLE ${qualified} ADD COLUMN IF NOT EXISTS refresh text` },\n ],\n },\n ],\n };\n\n // Applies the sequence through the ledger — once, recorded — not every boot.\n const init = async (): Promise<void> => {\n await migrate(pool, [sequence]);\n };\n\n const evict = (key: string, reason: string): void => {\n fireAndForget(pool.query(`DELETE FROM ${qualified} WHERE key = $1`, [key]), onError);\n const err = new Error(`[vex:cache:postgres] evicted invalid row for key \"${key}\": ${reason}`);\n if (onError) onError(err);\n else console.error(err);\n };\n\n const get = async (key: string): Promise<CacheEntry | undefined> => {\n const res = await pool.query(\n `SELECT ${SELECT_COLS} FROM ${qualified}\n WHERE key = $1 AND (expires_at IS NULL OR expires_at > now())`,\n [key],\n );\n const row = res.rows[0];\n if (row === undefined) return undefined;\n\n const entry = rowToEntry(row);\n const error = validateEntry(entry);\n if (error !== null) {\n evict(key, error);\n return undefined;\n }\n return entry;\n };\n\n const set = async (key: string, entry: CacheEntry): Promise<void> => {\n const error = validateEntry(entry);\n if (error !== null) {\n const wrapped = new Error(\n `[vex:cache:postgres] refusing to write invalid entry for key \"${key}\": ${error}`,\n );\n if (onError) {\n onError(wrapped);\n return;\n }\n throw wrapped;\n }\n\n const isOk = entry.kind === 'ok';\n const dsl = isOk ? JSON.stringify(entry.dsl) : entry.kind === 'mutation' ? JSON.stringify(entry.mutation) : null;\n const prismIr = isOk && entry.prismIr !== undefined ? JSON.stringify(entry.prismIr) : null;\n const reason = entry.kind === 'unsatisfiable' ? entry.reason : null;\n const intent = entry.intent ?? null;\n const shape = entry.shape !== undefined ? JSON.stringify(entry.shape) : null;\n const createdAt = new Date(entry.createdAt);\n const expiresAt = entry.expiresAt !== undefined ? new Date(entry.expiresAt) : null;\n const fingerprint = entry.schemaFingerprint ?? null;\n const isProtected = entry.protected === true;\n const lastUsedAt = entry.lastUsedAt !== undefined ? new Date(entry.lastUsedAt) : null;\n const requestHash = entry.requestHash ?? null;\n const reach = entry.kind === 'unsatisfiable' ? null : (entry.reach ?? null);\n const refresh = entry.kind === 'ok' ? (entry.refresh ?? null) : null;\n\n await pool.query(\n `INSERT INTO ${qualified} (key, kind, intent, shape, dsl, prism_ir, reach, reason, created_at, expires_at, schema_fingerprint, protected, last_used_at, request_hash, refresh)\n VALUES ($1, $2, $3, $4::jsonb, $5::jsonb, $6::jsonb, $7, $8, $9, $10, $11, $12, $13, $14, $15)\n ON CONFLICT (key) DO UPDATE SET\n kind = EXCLUDED.kind,\n intent = EXCLUDED.intent,\n shape = EXCLUDED.shape,\n dsl = EXCLUDED.dsl,\n prism_ir = EXCLUDED.prism_ir,\n reach = EXCLUDED.reach,\n reason = EXCLUDED.reason,\n created_at = EXCLUDED.created_at,\n expires_at = EXCLUDED.expires_at,\n schema_fingerprint = EXCLUDED.schema_fingerprint,\n protected = EXCLUDED.protected,\n last_used_at = EXCLUDED.last_used_at,\n request_hash = EXCLUDED.request_hash,\n refresh = EXCLUDED.refresh`,\n [key, entry.kind, intent, shape, dsl, prismIr, reach, reason, createdAt, expiresAt, fingerprint, isProtected, lastUsedAt, requestHash, refresh],\n );\n };\n\n const del = async (key: string): Promise<void> => {\n await pool.query(`DELETE FROM ${qualified} WHERE key = $1`, [key]);\n };\n\n const clear = async (): Promise<void> => {\n await pool.query(`DELETE FROM ${qualified}`);\n };\n\n const keys = async (): Promise<string[]> => {\n const res = await pool.query(\n `SELECT key FROM ${qualified} WHERE expires_at IS NULL OR expires_at > now()`,\n );\n return res.rows.map((r) => String(r['key']));\n };\n\n // Bulk read for warm-up. Validates and evicts invalid rows (same as get).\n const entries = async (): Promise<Array<{ key: string; entry: CacheEntry }>> => {\n const res = await pool.query(\n `SELECT ${SELECT_COLS} FROM ${qualified}\n WHERE expires_at IS NULL OR expires_at > now()`,\n );\n const out: Array<{ key: string; entry: CacheEntry }> = [];\n for (const row of res.rows) {\n const key = String(row['key']);\n const entry = rowToEntry(row);\n const error = validateEntry(entry);\n if (error !== null) {\n evict(key, error);\n continue;\n }\n out.push({ key, entry });\n }\n return out;\n };\n\n return { init, sequence, get, set, delete: del, clear, keys, entries };\n};\n","import type { CacheBackend, CacheEntry } from './cache.types.js';\nimport { validateEntry } from './validate.js';\nimport { fireAndForget } from './util.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Tiered cache (L1 in-memory + L2 durable)\n//\n// Read-through / write-through:\n// - get: L1 → on miss, L2 → validate → promote into L1.\n// - set: L1 synchronously + L2 fire-and-forget (off the hot path).\n// - init: warm-up, per the configured mode (see WarmupMode).\n//\n// The hot read never validates and never touches L2: every entry in L1\n// was validated on the way in (at promotion or at write). Validation\n// cost lands only at startup and the occasional L1 miss. An L2 entry\n// that fails validation (corrupt / schema-drifted) is evicted from L2,\n// not just skipped, so it can't keep failing.\n//\n// Single-instance only. Multiple processes sharing one L2 would each\n// keep their own L1; an entry written by process A is invisible to\n// process B's L1 until B restarts (a TTL-based L1 refresh would fix\n// this — deliberately deferred).\n// ═══════════════════════════════════════════════════════════════\n\nexport type WarmupMode =\n /** Load all of L2 into L1 on init (default). Start fully hot. */\n | 'full'\n /** Don't preload; L1 fills on demand via get→promote. Bounded memory. */\n | 'lazy'\n /** Preload only these fingerprints; lazy-fill the rest. */\n | { mode: 'partial'; fingerprints: string[] };\n\nexport type TieredCacheConfig = {\n /** Fast, volatile tier (e.g. createMemoryCache()). */\n l1: CacheBackend;\n /** Durable source of truth (e.g. createPostgresCache(...)). */\n l2: CacheBackend;\n /** Warm-up strategy run by init(). Default: 'full'. */\n warmup?: WarmupMode;\n /** Called on background failures (async L2 writes) and dropped invalid entries. */\n onError?: (err: unknown) => void;\n};\n\nexport type TieredCache = CacheBackend & {\n init: () => Promise<void>;\n};\n\nexport const createTieredCache = (config: TieredCacheConfig): TieredCache => {\n const { l1, l2, onError } = config;\n const warmup: WarmupMode = config.warmup ?? 'full';\n\n // Validate, then lift an entry into L1. Returns false if the L2 entry\n // is corrupt or schema-drifted — and evicts it from L2 so it can't\n // keep failing future reads.\n const promote = async (key: string, entry: CacheEntry): Promise<boolean> => {\n const error = validateEntry(entry);\n if (error !== null) {\n const wrapped = new Error(`[vex:cache:tiered] evicting invalid L2 entry for key \"${key}\": ${error}`);\n if (onError) onError(wrapped);\n else console.error(wrapped);\n fireAndForget(l2.delete(key), onError);\n return false;\n }\n await l1.set(key, entry);\n return true;\n };\n\n const init = async (): Promise<void> => {\n await l2.init?.();\n await l1.init?.();\n\n if (warmup === 'lazy') return;\n\n if (typeof warmup === 'object' && warmup.mode === 'partial') {\n for (const key of warmup.fingerprints) {\n const entry = await l2.get(key);\n if (entry !== undefined) await promote(key, entry);\n }\n return;\n }\n\n // 'full' — load everything. Prefer a bulk read (no N+1) when L2\n // supports it; otherwise fall back to key-by-key.\n if (l2.entries) {\n const all = await l2.entries();\n for (const { key, entry } of all) await promote(key, entry);\n return;\n }\n const keys = await l2.keys();\n for (const key of keys) {\n const entry = await l2.get(key);\n if (entry !== undefined) await promote(key, entry);\n }\n };\n\n const get = async (key: string): Promise<CacheEntry | undefined> => {\n const hit = await l1.get(key);\n if (hit !== undefined) return hit;\n\n const fromL2 = await l2.get(key);\n if (fromL2 === undefined) return undefined;\n\n const ok = await promote(key, fromL2);\n return ok ? fromL2 : undefined;\n };\n\n const set = async (key: string, entry: CacheEntry): Promise<void> => {\n await l1.set(key, entry);\n fireAndForget(l2.set(key, entry), onError);\n };\n\n const del = async (key: string): Promise<void> => {\n await l1.delete(key);\n fireAndForget(l2.delete(key), onError);\n };\n\n const clear = async (): Promise<void> => {\n await l1.clear();\n fireAndForget(l2.clear(), onError);\n };\n\n // L1 holds the full set after warm-up and receives every write, so it\n // is the authoritative key list for the running process.\n const keys = async (): Promise<string[]> => l1.keys();\n\n return { init, get, set, delete: del, clear, keys, ...(l2.sequence !== undefined ? { sequence: l2.sequence } : {}) };\n};\n","import { compile } from '@niscorp/prism';\nimport type { CacheBackend } from './cache.types.js';\nimport type { Query } from '../schemas/query.schema.js';\nimport type { MutationDefinition } from '../mutations/schema.js';\nimport { lintMutation } from '../mutations/signature.js';\nimport { canonicalText } from '../utils/canonical.js';\nimport type { Refresh } from './cache.types.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Seeding — authored entries → protected cache rows.\n//\n// The seeds ARE the API surface under the locked posture: every read and\n// write an app serves is a named, protected entry, replayed by fingerprint\n// (`{ fingerprint, context }` on the wire — definitions never travel).\n// This is the machinery every app used to hand-roll; the app authors the\n// ENTRIES (content), this compiles and stores them.\n//\n// Idempotent against a durable cache: a stored row that already matches\n// its authored definition is left untouched; anything else at that\n// fingerprint — edited, unprotected, regenerated, missing — converges to\n// the authored definition, protected. The code is the API surface; the\n// surviving rows are not. Protection keeps meaning what it means: a\n// drifted REQUEST still 409s — the seed path is the author it serves.\n// Mutations run the authoring lint every boot, edits included (\"if it\n// boots, it's coherent\" for writes).\n// ═══════════════════════════════════════════════════════════════\n\n// A read seed — vex's own cache row, minus what the seed derives: `mapping`\n// is uncompiled Prism (compiled to prism IR here; absent = identity, the\n// DSL already aliases columns to the shape's keys).\nexport type SeedEntry = {\n fingerprint: string;\n intent?: string;\n shape?: unknown;\n dsl: Query;\n mapping?: unknown;\n /** The reach this read requires whatever the caller holds — see `OkCacheEntry.reach`. */\n reach?: string;\n /** When this read's answer is refreshed — see `Refresh`. Absent means 'snapshot'. */\n refresh?: Refresh;\n};\n\n// A write seed — the same idea, `kind: 'mutation'`.\nexport type SeedMutation = {\n fingerprint: string;\n intent?: string;\n mutation: MutationDefinition;\n /** The reach this write requires whatever the caller holds — see `MutationCacheEntry.reach`. */\n reach?: string;\n};\n\n// Stored definitions round-trip through jsonb, which reorders object keys —\n// equality is canonical (utils/canonical.ts).\nconst same = (a: unknown, b: unknown): boolean =>\n a === undefined || b === undefined ? a === b : canonicalText(a) === canonicalText(b);\n\nexport const seedCache = async (cache: CacheBackend, entries: readonly (SeedEntry | SeedMutation)[]): Promise<void> => {\n for (const entry of entries) {\n const existing = await cache.get(entry.fingerprint);\n\n if ('mutation' in entry) {\n const issues = lintMutation(entry.mutation);\n if (issues.length > 0) {\n throw new Error(`Mutation seed \"${entry.fingerprint}\" fails the authoring lint:\\n ${issues.join('\\n ')}`);\n }\n const current =\n existing?.kind === 'mutation' &&\n existing.protected === true &&\n same(existing.mutation, entry.mutation) &&\n same(existing.reach, entry.reach) &&\n same(existing.intent, entry.intent);\n if (current) continue;\n await cache.set(entry.fingerprint, {\n kind: 'mutation',\n mutation: entry.mutation,\n ...(entry.reach !== undefined ? { reach: entry.reach } : {}),\n ...(entry.intent !== undefined ? { intent: entry.intent } : {}),\n protected: true,\n createdAt: Date.now(),\n });\n continue;\n }\n\n // Identity IR is seeded explicitly: a NULL mapping would make the reader\n // fall through to the LLM mapper on every replay.\n const prismIr = await compile(entry.mapping ?? { $ref: '$.result' });\n // The IR stamps its compile time, so it is compared by meta.fingerprint —\n // prism's hash of the compiled core — never by value.\n const current =\n existing?.kind === 'ok' &&\n existing.protected === true &&\n existing.prismIr?.meta.fingerprint === prismIr.meta.fingerprint &&\n same(existing.dsl, entry.dsl) &&\n same(existing.shape, entry.shape) &&\n same(existing.reach, entry.reach) &&\n same(existing.intent, entry.intent) &&\n (existing.refresh ?? 'snapshot') === (entry.refresh ?? 'snapshot');\n if (current) continue;\n await cache.set(entry.fingerprint, {\n kind: 'ok',\n ...(entry.refresh !== undefined ? { refresh: entry.refresh } : {}),\n dsl: entry.dsl,\n prismIr,\n ...(entry.reach !== undefined ? { reach: entry.reach } : {}),\n ...(entry.intent !== undefined ? { intent: entry.intent } : {}),\n ...(entry.shape !== undefined ? { shape: entry.shape } : {}),\n protected: true,\n createdAt: Date.now(),\n });\n }\n};\n"]}
|