@niscorp/vex 0.1.0 → 0.2.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.
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/schemas/request.schema.ts","../src/schemas/value.schema.ts","../src/schemas/identifier.schema.ts","../src/schemas/filter.schema.ts","../src/schemas/compute.schema.ts","../src/schemas/aggregate.schema.ts","../src/schemas/query.schema.ts","../src/errors.ts","../src/engine/optional.ts","../src/scope/discover.ts","../src/scope/scope.types.ts","../src/scope/apply.ts","../src/scope/grants.ts","../src/engine/resolver.ts","../src/engine/analyzer.ts","../src/utils/context.ts","../src/engine/executor.ts","../src/cache/memory.ts","../src/cache/hash.ts","../src/cache/util.ts","../src/utils/canonical.ts","../src/engine/live.ts","../src/engine/runtime.ts","../src/adapters/postgres/introspect.ts","../src/adapters/postgres/operators.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/mutations/schema.ts","../src/cache/validate.ts","../src/cache/postgres.ts","../src/cache/tiered.ts","../src/mutations/signature.ts","../src/cache/seed.ts","../src/mutations/engine.ts","../src/handler.ts"],"names":["z","createHash","canonical","follow","compile","executePrism","exceedsDepth","depthRefusal","rows","executionMs","result","isFieldPath","fieldPath","quoteIdent","migrate","keys","current","findEntity","where","gate"],"mappings":";;;;;;;;;AAMO,IAAM,wCAAwB,IAAI,GAAA,CAAY,CAAC,QAAA,EAAU,SAAS,CAAC,CAAA;AAEnE,IAAM,aAAA,GAAgBA,MAC1B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,KAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC5B,OAAA,EAASA,MAAE,IAAA,CAAK,CAAC,OAAO,MAAM,CAAC,EAAE,QAAA;AACnC,CAAC,CAAA,CACA,QAAA,CAASA,KAAA,CAAE,OAAA,EAAS,CAAA,CACpB,QAAA;AAAA,EACC;AACF,CAAA;AAEK,IAAM,kBAAA,GAAqBA,MAAE,MAAA,CAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMzC,aAAaA,KAAA,CAAE,MAAA,GAAS,GAAA,CAAI,CAAC,EAAE,QAAA,EAAS;AAAA,EACxC,MAAA,EAAQA,KAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC5B,KAAA,EAAOA,KAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EAC5B,OAAA,EAAS,aAAA,CAAc,OAAA,CAAQ,EAAE;AACnC,CAAC;AC1BM,IAAM,gBAAA,GAAmBA,MAC7B,MAAA,CAAO;AAAA,EACN,QAAA,EAAUA,KAAAA,CAAE,MAAA,EAAO,CAAE,SAAS,8CAA8C;AAC9E,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,8CAA8C,CAAA;AAEnD,IAAM,cAAA,GAAiBA,MAC3B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,KAAAA,CAAE,MAAA,EAAO,CAAE,SAAS,gDAAgD;AAC9E,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,6DAA6D,CAAA;AAElE,IAAM,kBAAA,GAAqBA,MAC/B,KAAA,CAAM;AAAA,EACLA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,wDAAwD,CAAA;AAAA,EAC5EA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,kBAAkB,CAAA;AAAA,EACtCA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,CAAS,mBAAmB,CAAA;AAAA,EACxCA,KAAAA,CAAE,IAAA,EAAK,CAAE,QAAA,CAAS,gBAAgB,CAAA;AAAA,EAClC,gBAAA;AAAA,EACA;AACF,CAAC,CAAA,CACA,SAAS,mDAAmD,CAAA;ACA/D,IAAM,UAAA,GAAa,0BAAA;AACnB,IAAM,UAAA,GAAa,kDAAA;AAEZ,IAAM,YAAA,GAAe,CAAC,KAAA,KAA2B,UAAA,CAAW,KAAK,KAAK,CAAA;AAEtE,IAAM,gBAAA,GAAmB,CAAC,KAAA,KAAoC,OAAO,UAAU,QAAA,IAAY,UAAA,CAAW,KAAK,KAAK,CAAA;AAEhH,IAAM,mBAAmBA,KAAAA,CAC7B,MAAA,EAAO,CACP,KAAA,CAAM,YAAY,sEAAsE,CAAA;AAEpF,IAAM,kBAAkBA,KAAAA,CAC5B,MAAA,EAAO,CACP,KAAA,CAAM,YAAY,0GAAqG,CAAA;;;ACS1H,IAAM,cAAA,GAAiBA,MACpB,KAAA,CAAM,CAAC,oBAAoB,kBAAkB,CAAC,CAAA,CAC9C,QAAA,CAAS,uEAAkE,CAAA;AAE9E,IAAM,WAAA,GAAc,eAAA,CAAgB,QAAA,CAAS,mCAAmC,CAAA;AAEhF,IAAM,gBAAA,GAAmBA,MACtB,KAAA,CAAM;AAAA,EACLA,KAAAA,CAAE,MAAM,kBAAkB,CAAA,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,uCAAuC,CAAA;AAAA,EACnF,gBAAA;AAAA,EACA;AACF,CAAC,CAAA,CACA,SAAS,0DAA0D,CAAA;AAEtE,IAAM,eAAuCA,KAAAA,CAAE,IAAA;AAAA,EAAK,MAClDA,MACG,MAAA,CAAO;AAAA,IACN,IAAA,EAAMA,KAAAA,CAAE,KAAA,CAAMA,KAAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,yEAAyE,CAAA;AAAA,IACnH,MAAA,EAAQ,YAAA,CAAa,QAAA,EAAS,CAAE,SAAS,qIAAqI;AAAA,GAC/K,EACA,MAAA;AACL,CAAA;AAEO,IAAM,eAAkCA,KAAAA,CAAE,IAAA;AAAA,EAAK,MACpDA,MAAE,KAAA,CAAM;AAAA,IACNA,KAAAA,CAAE,MAAA,CAAO,EAAE,MAAA,EAAQ,YAAA,EAAc,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,wFAAwF,CAAA;AAAA,IAC7IA,KAAAA,CAAE,MAAA,CAAO,EAAE,EAAA,EAAI,cAAA,EAAgB,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,2CAA2C,CAAA;AAAA,IAC9FA,KAAAA,CAAE,MAAA,CAAO,EAAE,GAAA,EAAK,cAAA,EAAgB,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,YAAY,CAAA;AAAA,IAChEA,KAAAA,CAAE,MAAA,CAAO,EAAE,EAAA,EAAI,cAAA,EAAgB,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,cAAc,CAAA;AAAA,IACjEA,KAAAA,CAAE,MAAA,CAAO,EAAE,GAAA,EAAK,cAAA,EAAgB,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,uBAAuB,CAAA;AAAA,IAC3EA,KAAAA,CAAE,MAAA,CAAO,EAAE,EAAA,EAAI,cAAA,EAAgB,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,WAAW,CAAA;AAAA,IAC9DA,KAAAA,CAAE,MAAA,CAAO,EAAE,GAAA,EAAK,cAAA,EAAgB,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,oBAAoB,CAAA;AAAA,IACxEA,MAAE,MAAA,CAAO,EAAE,EAAA,EAAIA,KAAAA,CAAE,MAAM,CAAC,WAAA,EAAa,gBAAgB,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,yBAAyB,CAAA;AAAA,IACtGA,MAAE,MAAA,CAAO,EAAE,KAAA,EAAOA,KAAAA,CAAE,MAAM,CAAC,WAAA,EAAa,gBAAgB,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,6BAA6B,CAAA;AAAA,IAC7GA,MAAE,MAAA,CAAO,EAAE,IAAA,EAAMA,KAAAA,CAAE,MAAM,CAAC,WAAA,EAAa,kBAAkB,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,uDAAuD,CAAA;AAAA,IACxIA,MAAE,MAAA,CAAO,EAAE,KAAA,EAAOA,KAAAA,CAAE,MAAM,CAAC,WAAA,EAAa,kBAAkB,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,0DAA0D,CAAA;AAAA,IAC5IA,KAAAA,CAAE,MAAA,CAAO,EAAE,MAAA,EAAQ,WAAA,EAAa,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,qBAAqB,CAAA;AAAA,IACzEA,KAAAA,CAAE,MAAA,CAAO,EAAE,SAAA,EAAW,WAAA,EAAa,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,yBAAyB,CAAA;AAAA,IAChFA,MAAE,MAAA,CAAO,EAAE,GAAA,EAAKA,KAAAA,CAAE,MAAM,YAAY,CAAA,CAAE,GAAA,CAAI,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,0CAA0C,CAAA;AAAA,IAC5GA,MAAE,MAAA,CAAO,EAAE,EAAA,EAAIA,KAAAA,CAAE,MAAM,YAAY,CAAA,CAAE,GAAA,CAAI,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,iDAAiD,CAAA;AAAA,IAClHA,KAAAA,CAAE,MAAA,CAAO,EAAE,GAAA,EAAK,YAAA,EAAc,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,oCAAoC,CAAA;AAAA,IACtFA,MAAE,MAAA,CAAO;AAAA,MACP,QAAA,EAAUA,MAAE,MAAA,CAAO;AAAA,QACjB,KAAA,EAAO,eAAA,CAAgB,QAAA,CAAS,yCAAyC,CAAA;AAAA,QACzE,KAAA,EAAOA,MAAE,KAAA,CAAM,CAAC,kBAAkB,cAAc,CAAC,CAAA,CAAE,QAAA,CAAS,2BAA2B,CAAA;AAAA,QACvF,QAAA,EAAUA,KAAAA,CAAE,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,EAAS,CAAE,SAAS,sCAAiC;AAAA,OACzF,EAAE,MAAA;AAAO,KACX,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,mCAAmC,CAAA;AAAA,IACxDA,MAAE,MAAA,CAAO;AAAA,MACP,KAAA,EAAOA,MAAE,MAAA,CAAO;AAAA,QACd,KAAA,EAAO,eAAA,CAAgB,QAAA,CAAS,mBAAmB,CAAA;AAAA,QACnD,KAAA,EAAOA,MAAE,KAAA,CAAM,CAAC,kBAAkB,cAAc,CAAC,CAAA,CAAE,QAAA,CAAS,qBAAqB,CAAA;AAAA,QACjF,WAAA,EAAaA,KAAAA,CAAE,MAAA,EAAO,CAAE,GAAA,EAAI,CAAE,WAAA,EAAY,CAAE,QAAA,EAAS,CAAE,QAAA,CAAS,mCAAmC;AAAA,OACpG,EAAE,MAAA;AAAO,KACX,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,oBAAoB,CAAA;AAAA,IACzCA,MAAE,MAAA,CAAO;AAAA,MACP,QAAA,EAAUA,MAAE,MAAA,CAAO;AAAA,QACjB,GAAA,EAAKA,KAAAA,CAAE,KAAA,CAAM,CAACA,KAAAA,CAAE,QAAO,CAAE,GAAA,CAAI,CAAC,CAAA,EAAGA,KAAAA,CAAE,KAAA,CAAMA,MAAE,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAC,CAAC,CAAA,CAChE,QAAA,CAAS,uQAAkQ,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAO9Q,IAAA,EAAM;AAAA,OACP,EAAE,MAAA;AAAO,KACX,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA;AAAA,MACV;AAAA;AACF,GACD;AACH;AClHA,IAAM,cAAA,GAAiBA,MACpB,MAAA,CAAO;AAAA,EACN,SAAA,EAAW,YAAA;AAAA,EACX,IAAA,EAAM,kBAAA,CAAmB,QAAA,CAAS,8BAA8B;AAClE,CAAC,EACA,MAAA,EAAO;AAEH,IAAM,uBAAA,GAA0BA,MACpC,KAAA,CAAM;AAAA,EACLA,MAAE,MAAA,CAAO,EAAE,GAAA,EAAKA,KAAAA,CAAE,MAAM,CAAC,kBAAA,EAAoB,kBAAkB,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,iBAAiB,CAAA;AAAA,EACxGA,MAAE,MAAA,CAAO,EAAE,QAAA,EAAUA,KAAAA,CAAE,MAAM,CAAC,kBAAA,EAAoB,kBAAkB,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,oBAAoB,CAAA;AAAA,EAChHA,MAAE,MAAA,CAAO,EAAE,QAAA,EAAUA,KAAAA,CAAE,MAAM,CAAC,kBAAA,EAAoB,kBAAkB,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,uBAAuB,CAAA;AAAA,EACnHA,MAAE,MAAA,CAAO,EAAE,MAAA,EAAQA,KAAAA,CAAE,MAAM,CAAC,kBAAA,EAAoB,kBAAkB,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,iBAAiB,CAAA;AAAA,EAC3GA,MAAE,MAAA,CAAO,EAAE,MAAA,EAAQA,KAAAA,CAAE,MAAM,kBAAkB,CAAA,CAAE,GAAA,CAAI,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,sBAAsB,CAAA;AAAA,EACjGA,MAAE,MAAA,CAAO,EAAE,QAAA,EAAUA,KAAAA,CAAE,MAAM,kBAAkB,CAAA,CAAE,GAAA,CAAI,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,8BAA8B,CAAA;AAAA,EAC3GA,MAAE,MAAA,CAAO;AAAA,IACP,IAAA,EAAMA,MACH,MAAA,CAAO;AAAA,MACN,IAAA,EAAMA,MAAE,KAAA,CAAM,cAAc,EAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,2CAA2C,CAAA;AAAA,MACzF,IAAA,EAAM,kBAAA,CAAmB,QAAA,CAAS,yCAAyC;AAAA,KAC5E,EACA,MAAA;AAAO,GACX,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,kCAAkC;AACzD,CAAC,CAAA,CACA,SAAS,yDAAyD;ACxBrE,IAAM,SAAA,GAAY,eAAA,CAAgB,QAAA,CAAS,mCAAmC,CAAA;AAK9E,IAAM,WAAA,GAAcA,MAAE,KAAA,CAAM,CAAC,WAAW,uBAAuB,CAAC,CAAA,CAAE,QAAA,CAAS,sCAAsC,CAAA;AAE1G,IAAM,yBAAA,GAA4BA,MACtC,KAAA,CAAM;AAAA,EACLA,KAAAA,CAAE,OAAO,EAAE,KAAA,EAAOA,MAAE,KAAA,CAAM,CAAC,eAAA,EAAiBA,KAAAA,CAAE,OAAA,CAAQ,GAAG,CAAC,CAAC,CAAA,CAAE,SAAS,gCAAgC,CAAA,EAAG,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,OAAO,CAAA;AAAA,EACpIA,KAAAA,CAAE,MAAA,CAAO,EAAE,aAAA,EAAe,eAAA,CAAgB,QAAA,CAAS,uDAAuD,CAAA,EAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,uBAAuB,CAAA;AAAA,EACxJA,KAAAA,CAAE,MAAA,CAAO,EAAE,GAAA,EAAK,WAAA,EAAa,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,KAAK,CAAA;AAAA,EACtDA,KAAAA,CAAE,MAAA,CAAO,EAAE,GAAA,EAAK,WAAA,EAAa,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,KAAK,CAAA;AAAA,EACtDA,KAAAA,CAAE,MAAA,CAAO,EAAE,GAAA,EAAK,WAAA,EAAa,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,KAAK,CAAA;AAAA,EACtDA,KAAAA,CAAE,MAAA,CAAO,EAAE,GAAA,EAAK,WAAA,EAAa,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,KAAK;AACxD,CAAC,CAAA,CACA,SAAS,qDAAqD;;;ACX1D,IAAM,eAAA,GAAkBA,MAC5B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MAAE,KAAA,CAAM,CAAC,iBAAiB,gBAAgB,CAAC,CAAA,CAAE,QAAA,CAAS,oEAAoE,CAAA;AAAA,EACjI,GAAA,EAAKA,KAAAA,CAAE,IAAA,CAAK,CAAC,KAAA,EAAO,MAAM,CAAC,CAAA,CAAE,OAAA,CAAQ,KAAK,CAAA,CAAE,QAAA,CAAS,gBAAgB;AACvE,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,oBAAoB,CAAA;AAyBhC,IAAM,oBAAA,GAAuBA,MAC1B,MAAA,CAAO;AAAA,EACN,EAAA,EAAI,gBAAA,CAAiB,QAAA,CAAS,gEAA2D,CAAA;AAAA,EACzF,OAAOA,KAAAA,CAAE,IAAA,CAAK,MAAwB,WAAW,CAAA,CAAE,SAAS,gBAAgB;AAC9E,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,2UAA2U,CAAA;AAEvV,IAAM,YAAA,GAAeA,MAClB,KAAA,CAAM;AAAA,EACLA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,sCAAsC,CAAA;AAAA,EAC1D;AACF,CAAC,CAAA,CACA,SAAS,sCAAsC,CAAA;AAElD,IAAM,cAAA,GAAiBA,MACpB,KAAA,CAAM;AAAA,EACL,eAAA,CAAgB,SAAS,iCAAiC,CAAA;AAAA,EAC1DA,MACG,MAAA,CAAO;AAAA,IACN,KAAA,EAAO,eAAA,CAAgB,QAAA,CAAS,iCAAiC,CAAA;AAAA,IACjE,EAAA,EAAI,gBAAA,CAAiB,QAAA,CAAS,4BAA4B;AAAA,GAC3D,CAAA,CACA,MAAA,EAAO,CACP,SAAS,iEAAiE;AAC/E,CAAC,CAAA,CACA,SAAS,2FAAsF,CAAA;AAE3F,IAAM,cAAgCA,KAAAA,CAAE,IAAA;AAAA,EAAK,MAClDA,MACG,MAAA,CAAO;AAAA,IACN,IAAA,EAAMA,MAAE,KAAA,CAAM,YAAY,EAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,yWAA+V,CAAA;AAAA,IAC3Y,MAAA,EAAQA,MAAE,KAAA,CAAM,cAAc,EAAE,QAAA,EAAS,CAAE,SAAS,oQAA0P,CAAA;AAAA,IAC9S,MAAA,EAAQ,YAAA,CAAa,QAAA,EAAS,CAAE,SAAS,mBAAmB,CAAA;AAAA,IAC5D,OAAA,EAASA,MAAE,MAAA,CAAO,gBAAA,EAAkB,uBAAuB,CAAA,CAAE,QAAA,EAAS,CAAE,QAAA,CAAS,qEAAgE,CAAA;AAAA,IACjJ,SAAA,EAAWA,MAAE,MAAA,CAAO,gBAAA,EAAkB,yBAAyB,CAAA,CAAE,QAAA,EAAS,CAAE,QAAA,CAAS,uEAAkE,CAAA;AAAA,IACvJ,OAAA,EAASA,MAAE,KAAA,CAAM,eAAe,EAAE,QAAA,EAAS,CAAE,SAAS,oCAAoC,CAAA;AAAA,IAC1F,IAAA,EAAMA,MAAE,KAAA,CAAM,eAAe,EAAE,QAAA,EAAS,CAAE,SAAS,YAAY,CAAA;AAAA,IAC/D,KAAA,EAAOA,KAAAA,CAAE,MAAA,EAAO,CAAE,GAAA,EAAI,CAAE,QAAA,EAAS,CAAE,QAAA,EAAS,CAAE,QAAA,CAAS,wBAAwB,CAAA;AAAA,IAC/E,UAAUA,KAAAA,CAAE,OAAA,GAAU,QAAA,EAAS,CAAE,SAAS,0BAA0B;AAAA,GACrE,CAAA,CACA,MAAA,EAAO,CACP,MAAA;AAAA,IACC,CAAC,CAAA,KAAA,CAAO,CAAA,CAAE,MAAA,EAAQ,UAAU,CAAA,IAAK,CAAA,IAAK,MAAA,CAAO,IAAA,CAAK,CAAA,CAAE,SAAA,IAAa,EAAE,EAAE,MAAA,GAAS,CAAA;AAAA,IAC9E,EAAE,SAAS,8DAAA;AAA+D;AAEhF;;;ACpFO,IAAM,QAAA,GAAN,cAAuB,KAAA,CAAM;AAAA,EACzB,IAAA;AAAA,EACA,OAAA;AAAA,EAET,WAAA,CAAY,IAAA,EAAsB,OAAA,EAAiB,OAAA,EAAmC;AACpF,IAAA,KAAA,CAAM,OAAO,CAAA;AACb,IAAA,IAAA,CAAK,IAAA,GAAO,UAAA;AACZ,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,OAAA,GAAU,OAAA;AAAA,EACjB;AACF;;;ACwBA,IAAM,QAAA,GAAW,CAAC,GAAA,KAAsC,KAAA,CAAM,QAAQ,GAAG,CAAA,GAAI,GAAA,GAAM,CAAC,GAAG,CAAA;AAGhF,IAAM,cAAA,GAAiB,CAAC,GAAA,KAAyB;AACtD,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,MAAM,IAAA,GAAO,CAAC,MAAA,KAAyB;AACrC,IAAA,IAAI,cAAc,MAAA,EAAQ;AACxB,MAAA,KAAA,MAAW,GAAA,IAAO,QAAA,CAAS,MAAA,CAAO,QAAA,CAAS,GAAG,CAAA,EAAG;AAC/C,QAAA,IAAI,CAAC,IAAA,CAAK,QAAA,CAAS,GAAG,CAAA,EAAG,IAAA,CAAK,KAAK,GAAG,CAAA;AAAA,MACxC;AACA,MAAA,IAAA,CAAK,MAAA,CAAO,SAAS,IAAI,CAAA;AACzB,MAAA;AAAA,IACF;AACA,IAAA,IAAI,SAAS,MAAA,EAAQ;AAAE,MAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,GAAA,EAAK,IAAA,CAAK,GAAG,CAAA;AAAG,MAAA;AAAA,IAAQ;AACxE,IAAA,IAAI,QAAQ,MAAA,EAAQ;AAAE,MAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,EAAA,EAAI,IAAA,CAAK,GAAG,CAAA;AAAG,MAAA;AAAA,IAAQ;AACtE,IAAA,IAAI,SAAS,MAAA,EAAQ;AAAE,MAAA,IAAA,CAAK,OAAO,GAAG,CAAA;AAAG,MAAA;AAAA,IAAQ;AAAA,EACnD,CAAA;AACA,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,MAAA,EAAW,IAAA,CAAK,IAAI,MAAM,CAAA;AAC7C,EAAA,KAAA,MAAW,MAAA,IAAU,IAAI,IAAA,EAAM;AAC7B,IAAA,IAAI,OAAO,MAAA,KAAW,QAAA,OAAe,IAAA,CAAK,GAAG,eAAe,MAAA,CAAO,KAAK,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAC,KAAK,QAAA,CAAS,CAAC,CAAC,CAAC,CAAA;AAAA,EAC5G;AACA,EAAA,OAAO,IAAA;AACT;AAyBO,IAAM,UAAA,GAAa,CAAC,OAAA,KAA0D;AACnF,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,OAAO,CAAA,EAAG;AAClD,IAAA,IAAI,UAAU,MAAA,IAAa,KAAA,KAAU,IAAA,EAAM,OAAA,CAAQ,IAAI,GAAG,CAAA;AAAA,EAC5D;AACA,EAAA,OAAO,OAAA;AACT;AAKO,IAAM,iBAAA,GAAoB,CAAC,GAAA,EAAY,OAAA,KAAiD;AAC7F,EAAA,MAAM,IAAA,GAAO,eAAe,GAAG,CAAA;AAC/B,EAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,EAAA;AAC9B,EAAA,IAAI,OAAA,KAAY,KAAA,EAAO,OAAO,IAAA,CAAK,KAAK,GAAG,CAAA;AAC3C,EAAA,OAAO,IAAA,CAAK,MAAA,CAAO,CAAC,CAAA,KAAM,OAAA,CAAQ,IAAI,CAAC,CAAC,CAAA,CAAE,IAAA,CAAK,GAAG,CAAA;AACpD,CAAA;AAKA,IAAM,KAAA,GAAQ,CAAC,MAAA,EAAgB,OAAA,EAAsC,YAAA,KAA8C;AACjH,EAAA,IAAI,cAAc,MAAA,EAAQ;AAMxB,IAAA,MAAM,IAAA,GAAO,QAAA,CAAS,MAAA,CAAO,QAAA,CAAS,GAAG,CAAA;AACzC,IAAA,IAAI,YAAA,EAAc;AAChB,MAAA,MAAM,IAAI,SAAS,aAAA,EAAe,CAAA,wBAAA,EAA2B,KAAK,IAAA,CAAK,IAAI,CAAC,CAAA,8EAAA,CAA2E,CAAA;AAAA,IACzJ;AAGA,IAAA,IAAI,OAAA,KAAY,KAAA,IAAS,CAAC,IAAA,CAAK,KAAA,CAAM,CAAC,GAAA,KAAQ,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAC,CAAA,EAAG,OAAO,MAAA;AACxE,IAAA,OAAO,KAAA,CAAM,MAAA,CAAO,QAAA,CAAS,IAAA,EAAM,SAAS,YAAY,CAAA;AAAA,EAC1D;AAEA,EAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,IAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,MAAA,CAAO,MAAA,KAAW,MAAA,GAAY,MAAA,GAAY,KAAA,CAAM,MAAA,CAAO,MAAA,CAAO,MAAA,EAAQ,OAAA,EAAS,IAAI,CAAA;AACxG,IAAA,OAAO,KAAA,KAAU,SACb,EAAE,MAAA,EAAQ,EAAE,IAAA,EAAM,MAAA,CAAO,OAAO,IAAA,EAAK,KACrC,EAAE,MAAA,EAAQ,EAAE,IAAA,EAAM,MAAA,CAAO,OAAO,IAAA,EAAM,MAAA,EAAQ,OAAM,EAAE;AAAA,EAC5D;AAEA,EAAA,IAAI,KAAA,IAAS,MAAA,IAAU,IAAA,IAAQ,MAAA,EAAQ;AACrC,IAAA,MAAM,QAAQ,KAAA,IAAS,MAAA;AACvB,IAAA,MAAM,QAAQ,KAAA,GAAQ,MAAA,CAAO,MAAM,MAAA,CAAO,EAAA,EACvC,IAAI,CAAC,GAAA,KAAQ,MAAM,GAAA,EAAK,OAAA,EAAS,YAAY,CAAC,CAAA,CAC9C,OAAO,CAAC,GAAA,KAAuB,QAAQ,MAAS,CAAA;AAGnD,IAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AAC9B,IAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,KAAK,CAAC,CAAA;AACpC,IAAA,OAAO,QAAQ,EAAE,GAAA,EAAK,MAAK,GAAI,EAAE,IAAI,IAAA,EAAK;AAAA,EAC5C;AAEA,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,MAAA,CAAO,GAAA,EAAK,SAAS,YAAY,CAAA;AAIrD,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,MAAM,IAAI,QAAA,CAAS,aAAA,EAAe,0GAAqG,CAAA;AAAA,IACzI;AACA,IAAA,OAAO,EAAE,KAAK,KAAA,EAAM;AAAA,EACtB;AAEA,EAAA,OAAO,MAAA;AACT,CAAA;AAQO,IAAM,aAAA,GAAgB,CAAC,GAAA,EAAY,OAAA,KAAgD;AACxF,EAAA,MAAM,IAAA,GAAiB,IAAI,IAAA,CAAK,GAAA;AAAA,IAAI,CAAC,MAAA,KACnC,OAAO,MAAA,KAAW,WAAW,MAAA,GAAS,EAAE,EAAA,EAAI,MAAA,CAAO,IAAI,KAAA,EAAO,aAAA,CAAc,MAAA,CAAO,KAAA,EAAO,OAAO,CAAA;AAAE,GACrG;AAEA,EAAA,IAAI,IAAI,MAAA,KAAW,MAAA,SAAkB,EAAE,GAAG,KAAK,IAAA,EAAK;AAEpD,EAAA,MAAM,MAAA,GAAS,KAAA,CAAM,GAAA,CAAI,MAAA,EAAQ,SAAS,KAAK,CAAA;AAC/C,EAAA,IAAI,WAAW,MAAA,EAAW;AACxB,IAAA,MAAM,EAAE,MAAA,EAAQ,QAAA,EAAU,GAAG,MAAK,GAAI,GAAA;AACtC,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,IAAA,EAAK;AAAA,EACzB;AACA,EAAA,OAAO,EAAE,GAAG,GAAA,EAAK,IAAA,EAAM,MAAA,EAAO;AAChC;AAGO,IAAM,cAAA,GAAiB,CAAC,KAAA,KAAyB;AACtD,EAAA,MAAM,IAAI,QAAA;AAAA,IACR,aAAA;AAAA,IACA,iCAAiC,KAAK,CAAA,qLAAA;AAAA,GACxC;AACF,CAAA;;;ACzKO,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;;;ACtOO,IAAM,UAAA,GAAa,CAAC,CAAA,KAAsC,IAAA,IAAQ,CAAA;;;ACvBlE,IAAM,aAAA,GAAN,cAA4B,QAAA,CAAS;AAAA,EACjC,MAAA;AAAA,EAET,WAAA,CAAY,QAAgB,OAAA,EAAiB;AAC3C,IAAA,KAAA,CAAM,gBAAgB,OAAO,CAAA;AAC7B,IAAA,IAAA,CAAK,IAAA,GAAO,eAAA;AACZ,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AAAA,EAChB;AACF;AA0BA,IAAM,UAAA,GAAa,CAAC,MAAA,EAAgB,IAAA,EAAmC,GAAA,KAAwC;AAC7G,EAAA,IAAI,SAAS,MAAA,EAAW;AACtB,IAAA,IAAI,GAAA,KAAQ,QAAQ,MAAM,IAAI,cAAc,MAAA,EAAQ,CAAA,QAAA,EAAW,MAAM,CAAA,gDAAA,CAAkD,CAAA;AACvH,IAAA,OAAO,EAAC;AAAA,EACV;AACA,EAAA,IAAI,QAAA,IAAY,IAAA,EAAM,OAAO,EAAC;AAC9B,EAAA,IAAI,MAAA,IAAU,MAAM,MAAM,IAAI,cAAc,MAAA,EAAQ,CAAA,QAAA,EAAW,MAAM,CAAA,2BAAA,CAA6B,CAAA;AAClG,EAAA,IAAI,IAAA,CAAK,SAAS,MAAA,EAAW;AAC3B,IAAA,IAAI,GAAA,KAAQ,QAAQ,MAAM,IAAI,cAAc,MAAA,EAAQ,CAAA,UAAA,EAAa,MAAM,CAAA,iDAAA,CAAmD,CAAA;AAC1H,IAAA,OAAO,EAAC;AAAA,EACV;AACA,EAAA,OAAO,IAAA,CAAK,IAAA;AACd,CAAA;AAMO,IAAM,YAAA,GAAe,CAAC,MAAA,EAAqB,KAAA,KAA2B;AAC3E,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA;AAClC,EAAA,IAAI,IAAA,KAAS,MAAA,EAAW,OAAO,MAAA,CAAO,OAAA,KAAY,OAAA;AAClD,EAAA,IAAI,QAAA,IAAY,MAAM,OAAO,IAAA;AAC7B,EAAA,IAAI,MAAA,IAAU,MAAM,OAAO,KAAA;AAC3B,EAAA,OAAO,IAAA,CAAK,IAAA,KAAS,MAAA,IAAa,MAAA,CAAO,OAAA,KAAY,OAAA;AACvD,CAAA;AASO,IAAM,UAAA,GAAa,CAAC,QAAA,EAAuB,MAAA,KAA8B;AAC9E,EAAA,KAAA,MAAW,MAAA,IAAU,UAAU,UAAA,CAAW,MAAA,EAAQ,OAAO,QAAA,CAAS,MAAM,CAAA,EAAG,MAAA,CAAO,OAAO,CAAA;AAC3F;AAMA,IAAM,QAAA,GAAW,CAAC,QAAA,EAAsC,SAAA,KAA4D;AAClH,EAAA,IAAI,SAAA,CAAU,MAAA,KAAW,CAAA,EAAG,OAAO,QAAA;AACnC,EAAA,MAAM,MAAM,QAAA,KAAa,MAAA,GAAY,YAAY,CAAC,QAAA,EAAU,GAAG,SAAS,CAAA;AACxE,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,IAAI,CAAC,CAAA;AAElC,EAAA,MAAM,KAAA,uBAAY,GAAA,EAA8D;AAChF,EAAA,KAAA,MAAW,IAAA,IAAQ,GAAA,EAAK,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,CAAA,IAAK,IAAA,CAAK,aAAA,EAAe,KAAA,CAAM,GAAA,CAAI,GAAA,EAAK,KAAc,CAAA;AACpG,EAAA,OAAO,EAAE,QAAA,EAAU,EAAE,GAAA,EAAK,GAAA,CAAI,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,QAAQ,CAAA,EAAE,EAAG,eAAe,KAAA,EAAe;AACxF,CAAA;AAGA,IAAM,YAAA,GAAe,CACnB,UAAA,EACA,KAAA,EACA,OACA,MAAA,KAC+B;AAC/B,EAAA,MAAM,KAAA,GAAQ,OAAO,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,MAAM,KAAK,CAAA;AAGvD,EAAA,IAAI,KAAA,KAAU,MAAA,EAAW,MAAM,IAAI,aAAA,CAAc,UAAA,EAAY,CAAA,gBAAA,EAAmB,UAAU,CAAA,gBAAA,EAAmB,KAAA,CAAM,KAAK,CAAA,gCAAA,CAAkC,CAAA;AAC1J,EAAA,MAAM,IAAA,GAAO,CAAA,EAAG,UAAU,CAAA,CAAA,EAAI,MAAM,KAAK,CAAA,CAAA;AAKzC,EAAA,MAAM,QAAA,GAAmB,UAAA,CAAW,KAAK,CAAA,GACrC,EAAE,IAAI,CAAC,IAAA,EAAM,EAAE,MAAA,EAAQ,KAAA,CAAM,EAAA,EAAI,CAAA,EAAE,GACnC,EAAE,EAAA,EAAI,CAAC,IAAA,EAAM,EAAE,MAAA,EAAQ,KAAA,CAAM,EAAA,EAAI,CAAA,EAAE;AACvC,EAAA,OAAO,EAAE,QAAA,EAAU,aAAA,sBAAmB,GAAA,CAAI,CAAC,CAAC,IAAA,EAAM,EAAE,KAAA,EAAO,MAAA,EAAQ,MAAM,KAAA,EAAO,MAAA,EAAQ,OAAgB,CAAC,CAAC,CAAA,EAAW;AACvH,CAAA;AAYA,IAAM,SAAA,GAAY,CAAC,KAAA,EAAmB,MAAA,KAA8B;AAClE,EAAA,MAAM,iBAAmC,EAAC;AAE1C,EAAA,KAAA,MAAW,MAAA,IAAU,MAAM,OAAA,EAAS;AAClC,IAAA,MAAM,SAAS,MAAA,CAAO,MAAA;AACtB,IAAA,IAAI,WAAW,MAAA,EAAW;AAE1B,IAAA,MAAM,IAAA,GAAO,MAAM,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,OAAA,KAAY,MAAA,CAAO,KAAK,CAAA;AAC/D,IAAA,KAAA,MAAW,KAAA,IAAS,UAAA,CAAW,MAAA,CAAO,IAAA,EAAM,MAAA,CAAO,QAAA,CAAS,MAAA,CAAO,IAAI,CAAA,EAAG,MAAA,CAAO,OAAO,CAAA,EAAG;AACzF,MAAA,MAAM,SAAA,GAAY,aAAa,MAAA,CAAO,IAAA,EAAM,OAAO,KAAA,EAAO,KAAA,EAAO,OAAO,MAAM,CAAA;AAC9E,MAAA,IAAI,cAAc,MAAA,EAAW;AAK7B,MAAA,KAAA,CAAM,QAAA,CAAS,GAAA,CAAI,CAAA,EAAG,MAAA,CAAO,IAAI,CAAA,CAAA,EAAI,KAAA,CAAM,KAAK,CAAA,CAAA,EAAI,GAAG,MAAA,CAAO,KAAK,CAAA,CAAA,EAAI,KAAA,CAAM,KAAK,CAAA,CAAE,CAAA;AAEpF,MAAA,IAAI,IAAA,KAAS,MAAA,IAAa,IAAA,CAAK,IAAA,KAAS,MAAA,EAAQ,IAAA,CAAK,EAAA,GAAK,CAAC,GAAI,IAAA,CAAK,EAAA,IAAM,IAAK,SAAS,CAAA;AAAA,WACnF,cAAA,CAAe,KAAK,SAAS,CAAA;AAAA,IACpC;AAAA,EACF;AAEA,EAAA,MAAM,MAAA,GAAS,QAAA,CAAS,KAAA,CAAM,MAAA,EAAQ,cAAc,CAAA;AACpD,EAAA,IAAI,MAAA,KAAW,MAAA,EAAW,KAAA,CAAM,MAAA,GAAS,MAAA;AAC3C,CAAA;AAWO,IAAM,aAAA,GAAgB,CAAC,QAAA,EAAyB,MAAA,KAAuC;AAC5F,EAAA,KAAA,MAAW,MAAA,IAAU,SAAS,OAAA,EAAS;AACrC,IAAA,IAAI,OAAO,QAAA,KAAa,MAAA,EAAW,aAAA,CAAc,MAAA,CAAO,UAAU,MAAM,CAAA;AAAA,EAC1E;AAIA,EAAA,KAAA,MAAW,QAAQ,QAAA,CAAS,SAAA,EAAW,MAAA,EAAO,IAAK,EAAC,EAAG;AACrD,IAAA,SAAA,CAAU,MAAM,MAAM,CAAA;AAAA,EACxB;AAEA,EAAA,SAAA,CAAU,UAAU,MAAM,CAAA;AAC1B,EAAA,OAAO,QAAA;AACT;AAOO,IAAM,UAAA,GAAa,CAAC,GAAA,EAAY,QAAA,EAAuB,MAAA,KAA+B;AAC3F,EAAA,UAAA,CAAW,UAAU,MAAM,CAAA;AAC3B,EAAA,OAAO,GAAA;AACT;;;ACzKO,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;;;AChKA,IAAM,cAAA,GAAiB,CAAC,IAAA,KAAqC;AAC3D,EAAA,IAAI,IAAA,KAAS,UAAU,OAAO,EAAA;AAC9B,EAAA,IAAI,IAAA,KAAS,UAAU,OAAO,CAAA;AAC9B,EAAA,IAAI,IAAA,KAAS,WAAW,OAAO,KAAA;AAC/B,EAAA,IAAI,IAAA,KAAS,UAAA,EAAY,OAAO,CAAC,EAAE,CAAA;AACnC,EAAA,IAAI,IAAA,KAAS,UAAA,EAAY,OAAO,CAAC,CAAC,CAAA;AAClC,EAAA,IAAI,IAAA,KAAS,MAAA,EAAQ,OAAO,EAAC;AAC7B,EAAA,OAAO,EAAA;AACT,CAAA;AAEO,IAAM,sBAAA,GAAyB,CAAC,QAAA,KAAuD;AAC5F,EAAA,MAAM,MAA+B,EAAC;AACtC,EAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,IAAA,CAAK,QAAQ,CAAA,EAAG;AACvC,IAAA,MAAM,IAAA,GAAO,SAAS,GAAG,CAAA;AACzB,IAAA,IAAI,SAAS,MAAA,EAAW;AAExB,IAAA,IAAI,IAAA,CAAK,SAAS,UAAA,EAAY;AAC9B,IAAA,GAAA,CAAI,GAAG,CAAA,GAAI,cAAA,CAAe,IAAA,CAAK,IAAI,CAAA;AAAA,EACrC;AACA,EAAA,OAAO,GAAA;AACT;AAMO,IAAM,aAAA,GAAgB,OAC3B,KAAA,EACA,OAAA,EACA,OACA,KAAA,KACuB;AACvB,EAAA,MAAM,UAAqB,EAAC;AAE5B,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,IAAA,CAAK,SAAS,SAAA,EAAW;AAC3B,MAAA,OAAA,CAAQ,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,GAAG,CAAC,CAAA;AAC9B,MAAA;AAAA,IACF;AAEA,IAAA,IAAI,IAAA,CAAK,SAAS,OAAA,EAAS;AACzB,MAAA,OAAA,CAAQ,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,GAAG,CAAC,CAAA;AAC5B,MAAA;AAAA,IACF;AAGA,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,oBAAA,EAAuB,IAAA,CAAK,GAAG,CAAA,4BAAA,CAA8B,CAAA;AAAA,IAC/E;AACA,IAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,IAAA,CAAK,GAAG,CAAA;AAC7B,IAAA,IAAI,OAAO,SAAS,QAAA,EAAU;AAC5B,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,oBAAA,EAAuB,IAAA,CAAK,GAAG,CAAA,oCAAA,CAAsC,CAAA;AAAA,IACvF;AACA,IAAA,MAAM,MAAA,GAAS,MAAM,KAAA,CAAM,IAAA,EAAM,KAAK,UAAU,CAAA;AAChD,IAAA,OAAA,CAAQ,KAAK,CAAA,CAAA,EAAI,MAAA,CAAO,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,EACtC;AAEA,EAAA,OAAO,OAAA;AACT;;;ACvDO,IAAM,eAAe,OAC1B,QAAA,EACA,OAAA,EACA,KAAA,EACA,SACA,KAAA,KACmB;AACnB,EAAA,MAAM,cAAc,MAAM,aAAA;AAAA,IACxB,QAAA,CAAS,UAAA;AAAA,IACT,OAAA;AAAA,IACA,KAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,OAAO,OAAA,CAAQ,OAAA,CAAQ,QAAA,EAAU,WAAW,CAAA;AAC9C;AAMO,IAAM,oBAAA,GAAuB,CAClC,QAAA,EAKA,YAAA,GAAkC,EAAC,KACH;AAChC,EAAA,MAAM,WAAwC,EAAC;AAE/C,EAAA,KAAA,MAAW,IAAA,IAAQ,SAAS,UAAA,EAAY;AACtC,IAAA,QAAA,CAAS,IAAA,CAAK,GAAG,CAAA,GAAI;AAAA,MACnB,MAAM,IAAA,CAAK,IAAA;AAAA,MACX,MAAM,IAAA,CAAK,IAAA;AAAA,MACX,GAAI,YAAA,CAAa,QAAA,CAAS,IAAA,CAAK,GAAG,IAAI,EAAE,QAAA,EAAU,IAAA,EAAc,GAAI;AAAC,KACvE;AAAA,EACF;AAEA,EAAA,KAAA,MAAW,OAAO,YAAA,EAAc;AAC9B,IAAA,IAAI,QAAA,CAAS,GAAG,CAAA,KAAM,MAAA,EAAW;AACjC,IAAA,QAAA,CAAS,GAAG,IAAI,EAAE,IAAA,EAAM,WAAW,QAAA,EAAU,IAAA,EAAM,QAAQ,IAAA,EAAK;AAAA,EAClE;AAEA,EAAA,OAAO,QAAA;AACT;AASO,IAAM,kBAAA,GAAqB,CAChC,QAAA,EACA,OAAA,KACa;AACb,EAAA,MAAM,UAAoB,EAAC;AAE3B,EAAA,KAAA,MAAW,IAAA,IAAQ,SAAS,UAAA,EAAY;AACtC,IAAA,IAAA,CAAK,IAAA,CAAK,IAAA,KAAS,SAAA,IAAa,IAAA,CAAK,IAAA,KAAS,eAAe,OAAA,CAAQ,IAAA,CAAK,GAAG,CAAA,KAAM,MAAA,EAAW;AAC5F,MAAA,OAAA,CAAQ,IAAA,CAAK,KAAK,GAAG,CAAA;AAAA,IACvB;AAAA,EACF;AAEA,EAAA,OAAO,OAAA;AACT;AAWO,IAAM,YAAA,GAAe,CAAC,QAAA,EAAoE,KAAA,KAAyC;AACxI,EAAA,MAAM,OAAA,GAAU,CAAC,GAAG,IAAI,GAAA,CAAI,SAAS,UAAA,CAAW,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,IAAA,KAAS,WAAW,KAAA,CAAM,IAAA,CAAK,GAAG,CAAA,KAAM,MAAS,CAAA,CAAE,GAAA,CAAI,CAAC,IAAA,KAAS,IAAA,CAAK,GAAG,CAAC,CAAC,CAAA;AACjJ,EAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtB,IAAA,MAAM,IAAI,QAAA,CAAS,eAAA,EAAiB,CAAA,4BAAA,EAA+B,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAC,CAAA,gCAAA,CAAA,EAAoC,EAAE,IAAA,EAAM,OAAA,EAAS,CAAA;AAAA,EAC5I;AACF,CAAA;;;ACzFO,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;ACxBA,IAAM,QAAA,GAAW,CAAC,KAAA,KAChB,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA,IAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA;AAE9D,IAAM,cAAA,GAAiB,CAAC,KAAA,KAA4B;AACzD,EAAA,IAAI,KAAA,KAAU,MAAM,OAAO,MAAA;AAC3B,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,SAAA;AAEhC,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AAExB,IAAA,MAAM,KAAA,GAAiB,MAAM,CAAC,CAAA;AAC9B,IAAA,OAAO,UAAU,MAAA,GAAY,CAAC,eAAe,KAAK,CAAC,IAAI,EAAC;AAAA,EAC1D;AAEA,EAAA,IAAI,QAAA,CAAS,KAAK,CAAA,EAAG;AACnB,IAAA,MAAM,UAAA,GAAa,MAAA,CAAO,IAAA,CAAK,KAAK,EAAE,IAAA,EAAK;AAC3C,IAAA,MAAM,aAAsC,EAAC;AAC7C,IAAA,KAAA,MAAW,OAAO,UAAA,EAAY;AAC5B,MAAA,UAAA,CAAW,GAAG,CAAA,GAAI,cAAA,CAAe,KAAA,CAAM,GAAG,CAAC,CAAA;AAAA,IAC7C;AACA,IAAA,OAAO,UAAA;AAAA,EACT;AAEA,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,OAAO,QAAA;AACtC,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,OAAO,QAAA;AACtC,EAAA,IAAI,OAAO,KAAA,KAAU,SAAA,EAAW,OAAO,SAAA;AAGvC,EAAA,OAAO,SAAA;AACT;AAYO,IAAM,eAAA,GAAkB,MAC7B,CAAA,GAAA,EAAMC,iBAAA,CAAW,QAAQ,CAAA,CAAE,MAAA,CAAO,CAAA,EAAG,IAAA,CAAK,GAAA,EAAK,IAAI,IAAA,CAAK,MAAA,EAAQ,CAAA,CAAE,CAAA,CAAE,MAAA,CAAO,KAAK,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,EAAE,CAAC,CAAA;AA+BzF,IAAM,kBAAA,GAAqB,CAAC,OAAA,KAIrB;AACZ,EAAA,MAAM,QAAA,GAAW;AAAA,IACf,MAAA,EAAQ,QAAQ,MAAA,IAAU,IAAA;AAAA,IAC1B,KAAA,EAAO,cAAA,CAAe,OAAA,CAAQ,KAAK,CAAA;AAAA,IACnC,WAAA,EAAa,OAAO,IAAA,CAAK,OAAA,CAAQ,WAAW,EAAE,EAAE,IAAA;AAAK,GACvD;AACA,EAAA,OAAOA,iBAAA,CAAW,QAAQ,CAAA,CAAE,MAAA,CAAO,IAAA,CAAK,UAAU,QAAQ,CAAC,CAAA,CAAE,MAAA,CAAO,KAAK,CAAA;AAC3E;AAMA,IAAM,SAAA,GAAY,CAAC,KAAA,KAA4B;AAC7C,EAAA,IAAI,MAAM,OAAA,CAAQ,KAAK,GAAG,OAAO,KAAA,CAAM,IAAI,SAAS,CAAA;AACpD,EAAA,IAAI,QAAA,CAAS,KAAK,CAAA,EAAG;AACnB,IAAA,MAAM,MAA+B,EAAC;AACtC,IAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,CAAE,IAAA,EAAK,EAAG,GAAA,CAAI,GAAG,CAAA,GAAI,SAAA,CAAU,KAAA,CAAM,GAAG,CAAC,CAAA;AAC5E,IAAA,OAAO,GAAA;AAAA,EACT;AACA,EAAA,OAAO,KAAA;AACT,CAAA;AAEO,IAAM,gBAAA,GAAmB,CAAC,MAAA,KAC/B,MAAA,KAAW,SAAY,MAAA,GAASA,iBAAA,CAAW,QAAQ,CAAA,CAAE,MAAA,CAAO,IAAA,CAAK,UAAU,SAAA,CAAU,MAAM,CAAC,CAAC,CAAA,CAAE,OAAO,KAAK,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAEnH,IAAM,wBAAA,GAA2B,CAAC,MAAA,KAAmC;AAC1E,EAAA,MAAM,MAAA,GAAS,CAAC,CAAA,EAAqB,CAAA,KAAwB,EAAE,IAAA,CAAK,aAAA,CAAc,EAAE,IAAI,CAAA;AAExF,EAAA,MAAM,MAAA,GAAS;AAAA,IACb,QAAA,EAAU,CAAC,GAAG,MAAA,CAAO,QAAQ,CAAA,CAAE,IAAA,CAAK,MAAM,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,MACtD,MAAM,CAAA,CAAE,IAAA;AAAA,MACR,OAAO,CAAA,CAAE,KAAA;AAAA,MACT,MAAA,EAAQ,CAAC,GAAG,CAAA,CAAE,MAAM,CAAA,CAAE,IAAA,CAAK,MAAM,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,QAC7C,MAAM,CAAA,CAAE,IAAA;AAAA,QACR,MAAM,CAAA,CAAE,IAAA;AAAA,QACR,gBAAgB,CAAA,CAAE,cAAA;AAAA,QAClB,UAAU,CAAA,CAAE,QAAA;AAAA,QACZ,YAAY,CAAA,CAAE,UAAA;AAAA,QACd,GAAI,EAAE,gBAAA,KAAqB,MAAA,GAAY,EAAE,gBAAA,EAAkB,CAAA,CAAE,gBAAA,EAAiB,GAAI;AAAC,OACrF,CAAE,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAKF,SAAA,EAAW,CAAC,GAAG,CAAA,CAAE,SAAS,CAAA,CACvB,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,EAAG,EAAE,MAAM,CAAA,CAAA,EAAI,EAAE,WAAA,CAAY,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAG,aAAA,CAAc,CAAA,EAAG,CAAA,CAAE,MAAM,IAAI,CAAA,CAAE,WAAA,CAAY,KAAK,GAAG,CAAC,EAAE,CAAC,CAAA,CAC/G,GAAA,CAAI,CAAC,CAAA,MAAO,EAAE,MAAM,CAAA,CAAE,IAAA,EAAM,MAAA,EAAQ,CAAA,CAAE,MAAA,EAAQ,WAAA,EAAa,EAAE,WAAA,EAAa,aAAA,EAAe,CAAA,CAAE,aAAA,EAAc,CAAE,CAAA;AAAA;AAAA;AAAA,MAG9G,OAAA,EAAS,CAAC,GAAG,CAAA,CAAE,OAAO,CAAA,CAAE,IAAA,CAAK,MAAM,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,QAC/C,MAAM,CAAA,CAAE,IAAA;AAAA,QACR,QAAQ,CAAA,CAAE,MAAA;AAAA,QACV,QAAQ,CAAA,CAAE,MAAA;AAAA,QACV,MAAM,CAAA,CAAE;AAAA,OACV,CAAE;AAAA,KACJ,CAAE;AAAA,GACJ;AAEA,EAAA,OAAOA,iBAAA,CAAW,QAAQ,CAAA,CAAE,MAAA,CAAO,IAAA,CAAK,UAAU,MAAM,CAAC,CAAA,CAAE,MAAA,CAAO,KAAK,CAAA;AACzE;;;ACxIO,IAAM,aAAA,GAAgB,CAAC,CAAA,EAAqB,OAAA,KAA2C;AAC5F,EAAA,KAAK,CAAA,CAAE,KAAA,CAAM,CAAC,GAAA,KAAQ;AACpB,IAAA,IAAI,OAAA,UAAiB,GAAG,CAAA;AAAA,SACnB,OAAA,CAAQ,KAAA,CAAM,aAAA,EAAe,GAAG,CAAA;AAAA,EACvC,CAAC,CAAA;AACH,CAAA;AAQO,IAAM,cAAA,GAAiB,GAAA;AAGvB,IAAM,UAAA,GAAa,CAAC,KAAA,EAAmB,GAAA,KAC5C,MAAM,UAAA,KAAe,MAAA,IAAa,GAAA,GAAM,KAAA,CAAM,UAAA,IAAc,cAAA;AAQvD,IAAM,YAAA,GAAe,CAAC,KAAA,EAAmB,kBAAA,KAAyC;AACvF,EAAA,MAAM,UAAU,KAAA,CAAM,SAAA,KAAc,UAAa,KAAA,CAAM,SAAA,IAAa,KAAK,GAAA,EAAI;AAC7E,EAAA,MAAM,QACJ,KAAA,CAAM,iBAAA,KAAsB,UAC5B,kBAAA,KAAuB,MAAA,IACvB,MAAM,iBAAA,KAAsB,kBAAA;AAC9B,EAAA,OAAO,CAAC,WAAW,CAAC,KAAA;AACtB,CAAA;AASO,IAAM,UAAA,GAAa,OACxB,KAAA,EAMA,OAAA,KACoB;AACpB,EAAA,MAAM,MAAA,GAAS,IAAA,CAAK,GAAA,EAAI,GAAI,OAAA,CAAQ,SAAA;AACpC,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,OAAA,KAAY,MAAA,GAC3B,MAAM,KAAA,CAAM,OAAA,EAAQ,GACpB,MAAM,OAAA,CAAQ,GAAA,CAAA,CAAK,MAAM,KAAA,CAAM,IAAA,EAAK,EAAG,GAAA,CAAI,OAAO,GAAA,MAAS,EAAE,GAAA,EAAK,KAAA,EAAO,MAAM,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA,EAAE,CAAE,CAAC,CAAA;AAErG,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,KAAA,MAAW,EAAE,GAAA,EAAK,KAAA,EAAM,IAAK,IAAA,EAAM;AACjC,IAAA,IAAI,UAAU,MAAA,EAAW;AACzB,IAAA,IAAI,KAAA,CAAM,cAAc,IAAA,EAAM;AAC9B,IAAA,MAAM,SAAA,GAAY,KAAA,CAAM,UAAA,IAAc,KAAA,CAAM,SAAA;AAC5C,IAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,MAAA,MAAM,KAAA,CAAM,OAAO,GAAG,CAAA;AACtB,MAAA,OAAA,IAAW,CAAA;AAAA,IACb;AAAA,EACF;AACA,EAAA,OAAO,OAAA;AACT;AC9DO,IAAMC,UAAAA,GAAY,CAAC,KAAA,KAA4B;AACpD,EAAA,IAAI,MAAM,OAAA,CAAQ,KAAK,GAAG,OAAO,KAAA,CAAM,IAAIA,UAAS,CAAA;AACpD,EAAA,IAAI,UAAU,IAAA,IAAQ,OAAO,UAAU,QAAA,IAAY,EAAE,iBAAiB,IAAA,CAAA,EAAO;AAC3E,IAAA,MAAM,SAAkC,EAAC;AACzC,IAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,CAAA,IAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,CAAE,IAAA,CAAK,CAAC,CAAC,CAAC,CAAA,EAAG,CAAC,CAAC,CAAA,KAAO,CAAA,GAAI,CAAA,GAAI,EAAA,GAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAE,CAAA,EAAG,MAAA,CAAO,GAAG,CAAA,GAAIA,UAAAA,CAAU,KAAK,CAAA;AAChI,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,OAAO,KAAA;AACT,CAAA;AAEO,IAAM,aAAA,GAAgB,CAAC,KAAA,KAA2B,IAAA,CAAK,UAAUA,UAAAA,CAAU,KAAK,CAAC,CAAA,IAAK,WAAA;AAEtF,IAAM,QAAA,GAAW,CAAC,IAAA,KAAyBD,iBAAAA,CAAW,QAAQ,EAAE,MAAA,CAAO,IAAI,CAAA,CAAE,MAAA,CAAO,KAAK,CAAA;AAEzF,IAAM,gBAAgB,CAAC,KAAA,KAA2B,QAAA,CAAS,aAAA,CAAc,KAAK,CAAC,CAAA;;;AC2DtF,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,EAAaE,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,aAAA,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,MAAM,OAAA,GAAU,OACd,OAAA,EACA,OAAA,KAC2B;AAC3B,IAAA,IAAIC,mBAAA,CAAa,OAAO,CAAA,EAAG,MAAM,IAAI,SAAS,iBAAA,EAAmB,CAAA,iBAAA,EAAoBC,mBAAA,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,MACnBT,KAAAA,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,IACA,OAAA;AAAA,IACA,OAAA,EAAAI,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;;;ACzaA,IAAM,iBAAA,GAAoB,CAAC,GAAA,KAAsB;AAC/C,EAAA,IAAI,qBAAA,CAAsB,IAAI,GAAG,CAAA;AAC/B,IAAA,MAAM,IAAI,QAAA;AAAA,MACR,aAAA;AAAA,MACA,IAAI,GAAG,CAAA,kFAAA;AAAA,KACT;AACJ,CAAA;AAsCO,IAAM,YAAA,GAAe,CAAC,CAAA,KAAsB;AACjD,EAAA,MAAM,OAAA,GAAU,CAAA,CAAE,OAAA,CAAQ,IAAA,EAAM,IAAI,CAAA;AAIpC,EAAA,OAAO,CAAA,CAAE,QAAA,CAAS,IAAI,CAAA,GAAI,CAAA,EAAA,EAAK,OAAA,CAAQ,OAAA,CAAQ,KAAA,EAAO,MAAM,CAAC,CAAA,CAAA,CAAA,GAAM,CAAA,CAAA,EAAI,OAAO,CAAA,CAAA,CAAA;AAChF,CAAA;AAEO,IAAM,UAAA,GAAa,CAAC,IAAA,KAAyB,CAAA,CAAA,EAAI,KAAK,OAAA,CAAQ,IAAA,EAAM,IAAI,CAAC,CAAA,CAAA,CAAA;AAGzE,IAAM,aAAA,GAAgB,CAAC,CAAA,KAAsB;AAClD,EAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,EAAG,MAAM,IAAI,QAAA,CAAS,aAAA,EAAe,CAAA,EAAG,MAAA,CAAO,CAAC,CAAC,CAAA,8BAAA,CAAgC,CAAA;AACvG,EAAA,OAAO,OAAO,CAAC,CAAA;AACjB,CAAA;AAEA,IAAM,QAAA,GAAW,CAAC,IAAA,EAAc,GAAA,KAAoC;AAClE,EAAA,MAAM,MAAA,GAAS,GAAA,CAAI,QAAA,CAAS,GAAA,CAAI,IAAI,CAAA;AACpC,EAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AACjC,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,aAAA,CAAc,GAAA,CAAI,IAAI,CAAA;AACtC,EAAA,IAAI,GAAA,KAAQ,QAAW,OAAO,CAAA,EAAG,IAAI,KAAK,CAAA,CAAA,EAAI,IAAI,MAAM,CAAA,CAAA;AACxD,EAAA,MAAM,IAAI,QAAA,CAAS,aAAA,EAAe,CAAA,CAAA,EAAI,IAAI,CAAA,mCAAA,CAAqC,CAAA;AACjF,CAAA;AAEA,IAAMO,YAAAA,GAAc,gBAAA;AAEpB,IAAM,cAAA,GAAiB,CAAC,IAAA,EAAc,aAAA,KAAkE;AACtG,EAAA,MAAM,GAAA,GAAM,aAAA,CAAc,GAAA,CAAI,IAAI,CAAA;AAClC,EAAA,IAAI,GAAA,KAAQ,QAAW,OAAO,QAAA;AAC9B,EAAA,MAAM,EAAA,GAAK,IAAI,MAAA,CAAO,cAAA;AACtB,EAAA,IAAI,EAAA,KAAO,UAAU,OAAO,QAAA;AAC5B,EAAA,IAAI,EAAA,KAAO,WAAW,OAAO,SAAA;AAC7B,EAAA,OAAO,QAAA;AACT,CAAA;AAEO,IAAM,mBAAA,GAAsB,CACjC,GAAA,EACA,GAAA,KACW;AACX,EAAA,IAAI,GAAA,KAAQ,MAAM,OAAO,MAAA;AACzB,EAAA,IAAI,OAAO,GAAA,KAAQ,SAAA,EAAW,OAAO,MAAM,MAAA,GAAS,OAAA;AACpD,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,EAAU,OAAO,cAAc,GAAG,CAAA;AAErD,EAAA,IAAI,OAAO,QAAQ,QAAA,EAAU;AAG3B,IAAA,OAAOA,YAAAA,CAAY,GAAG,CAAA,GAAI,QAAA,CAAS,KAAK,GAAG,CAAA,GAAI,aAAa,GAAG,CAAA;AAAA,EACjE;AAGA,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,IAAY,GAAA,KAAQ,IAAA,IAAQ,cAAc,GAAA,EAAK;AAChE,IAAA,MAAM,MAAM,GAAA,CAAI,QAAA;AAChB,IAAA,iBAAA,CAAkB,GAAG,CAAA;AACrB,IAAA,GAAA,CAAI,aAAa,KAAA,IAAS,CAAA;AAC1B,IAAA,GAAA,CAAI,WAAW,IAAA,CAAK;AAAA,MAClB,GAAA;AAAA,MACA,IAAA,EAAM,SAAA;AAAA,MACN,IAAA,EAAM,cAAA,CAAe,GAAA,EAAK,GAAA,CAAI,aAAa;AAAA,KAC5C,CAAA;AACD,IAAA,OAAO,CAAA,CAAA,EAAI,GAAA,CAAI,YAAA,CAAa,KAAK,CAAA,CAAA;AAAA,EACnC;AAEA,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,IAAY,GAAA,KAAQ,IAAA,IAAQ,YAAY,GAAA,EAAK;AAC9D,IAAA,MAAM,MAAM,GAAA,CAAI,MAAA;AAChB,IAAA,GAAA,CAAI,aAAa,KAAA,IAAS,CAAA;AAC1B,IAAA,GAAA,CAAI,WAAW,IAAA,CAAK;AAAA,MAClB,GAAA;AAAA,MACA,IAAA,EAAM,OAAA;AAAA,MACN,IAAA,EAAM,cAAA,CAAe,GAAA,EAAK,GAAA,CAAI,aAAa;AAAA,KAC5C,CAAA;AACD,IAAA,OAAO,CAAA,CAAA,EAAI,GAAA,CAAI,YAAA,CAAa,KAAK,CAAA,CAAA;AAAA,EACnC;AAEA,EAAA,OAAO,MAAA;AACT;AAWO,IAAM,gBAAA,GAAmB,CAAC,IAAA,KAC/B,IAAA,CAAK,YAAY,GAAA,CAAI,CAAC,QAAQ,CAAA,KAAM;AAClC,EAAA,MAAM,EAAA,GAAK,IAAA,CAAK,SAAA,CAAU,CAAC,CAAA;AAC3B,EAAA,IAAI,OAAO,MAAA,EAAW;AACpB,IAAA,MAAM,IAAI,QAAA;AAAA,MACR,aAAA;AAAA,MACA,kBAAkB,IAAA,CAAK,SAAS,SAAS,IAAA,CAAK,OAAO,YAAY,MAAM,CAAA,iBAAA;AAAA,KACzE;AAAA,EACF;AACA,EAAA,OAAO,CAAA,EAAG,KAAK,SAAS,CAAA,CAAA,EAAI,MAAM,CAAA,GAAA,EAAM,IAAA,CAAK,OAAO,CAAA,CAAA,EAAI,EAAE,CAAA,CAAA;AAC5D,CAAC,CAAA;AAMH,IAAM,uBAAA,GAA0B,CAC9B,EAAA,EACA,IAAA,EACA,GAAA,KACW;AACX,EAAA,MAAM,IAAA,GAAO,mBAAA,CAAoB,IAAA,CAAK,CAAC,GAAG,GAAG,CAAA;AAC7C,EAAA,MAAM,KAAA,GAAQ,mBAAA,CAAoB,IAAA,CAAK,CAAC,GAAG,GAAG,CAAA;AAC9C,EAAA,OAAO,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,EAAE,IAAI,KAAK,CAAA,CAAA;AAC/B,CAAA;AAEO,IAAM,aAAA,GAAgB,CAC3B,MAAA,EACA,GAAA,KACW;AAQX,EAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,IAAA,MAAM,QAAA,GAAW,GAAA,CAAI,SAAA,EAAW,GAAA,CAAI,OAAO,MAAM,CAAA;AACjD,IAAA,IAAI,aAAa,MAAA,EAAW,MAAM,IAAI,QAAA,CAAS,eAAe,CAAA,4EAAA,CAA+E,CAAA;AAE7I,IAAA,MAAM,KAAA,GAA4B;AAAA,MAChC,GAAG,GAAA;AAAA,MACH,aAAA,EAAe,QAAA,CAAS,MAAA,EAAQ,aAAA,IAAiB,GAAA,CAAI,aAAA;AAAA;AAAA;AAAA,MAGrD,QAAA,EAAU,IAAI,GAAA,CAAI,CAAC,GAAG,IAAI,QAAA,EAAU,GAAG,QAAA,CAAS,QAAQ,CAAC;AAAA,KAC3D;AAEA,IAAA,MAAM,KAAA,GAAkB,CAAC,UAAU,CAAA;AACnC,IAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,OAAA,CAAQ,CAAC,CAAA;AAChC,IAAA,IAAI,KAAA,EAAO,KAAA,KAAU,MAAA,EAAW,KAAA,CAAM,IAAA,CAAK,CAAA,KAAA,EAAQ,KAAA,CAAM,KAAK,CAAA,IAAA,EAAO,KAAA,CAAM,KAAK,CAAA,CAAE,CAAA;AAClF,IAAA,KAAA,MAAW,IAAA,IAAQ,SAAS,KAAA,EAAO;AACjC,MAAA,MAAM,MAAA,GAAS,SAAS,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,KAAA,KAAU,IAAA,CAAK,OAAO,CAAA;AACpE,MAAA,IAAI,MAAA,EAAQ,UAAU,MAAA,EAAW;AACjC,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,KAAK,CAAC;AAAA,OACxE;AACA,MAAA,KAAA,CAAM,IAAA,CAAK,CAAA,EAAG,OAAO,CAAA,CAAA,EAAI,OAAO,KAAK,CAAA,IAAA,EAAO,IAAA,CAAK,OAAO,CAAA,IAAA,EAAO,UAAA,CAAW,IAAA,CAAK,OAAO,CAAC,CAAA,CAAE,CAAA;AAAA,IAC3F;AACA,IAAA,IAAI,QAAA,CAAS,MAAA,KAAW,MAAA,EAAW,KAAA,CAAM,IAAA,CAAK,CAAA,MAAA,EAAS,aAAA,CAAc,QAAA,CAAS,MAAA,CAAO,QAAA,EAAU,KAAK,CAAC,CAAA,CAAE,CAAA;AAEvG,IAAA,OAAO,CAAA,QAAA,EAAW,KAAA,CAAM,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,EACnC;AAEA,EAAA,IAAI,QAAQ,MAAA,EAAQ,OAAO,wBAAwB,GAAA,EAAK,MAAA,CAAO,IAAI,GAAG,CAAA;AACtE,EAAA,IAAI,SAAS,MAAA,EAAQ,OAAO,wBAAwB,IAAA,EAAM,MAAA,CAAO,KAAK,GAAG,CAAA;AACzE,EAAA,IAAI,QAAQ,MAAA,EAAQ,OAAO,wBAAwB,GAAA,EAAK,MAAA,CAAO,IAAI,GAAG,CAAA;AACtE,EAAA,IAAI,SAAS,MAAA,EAAQ,OAAO,wBAAwB,IAAA,EAAM,MAAA,CAAO,KAAK,GAAG,CAAA;AACzE,EAAA,IAAI,QAAQ,MAAA,EAAQ,OAAO,wBAAwB,GAAA,EAAK,MAAA,CAAO,IAAI,GAAG,CAAA;AACtE,EAAA,IAAI,SAAS,MAAA,EAAQ,OAAO,wBAAwB,IAAA,EAAM,MAAA,CAAO,KAAK,GAAG,CAAA;AAEzE,EAAA,IAAI,QAAQ,MAAA,EAAQ;AAClB,IAAA,MAAM,MAAM,QAAA,CAAS,MAAA,CAAO,EAAA,CAAG,CAAC,GAAG,GAAG,CAAA;AACtC,IAAA,MAAM,MAAA,GAAS,MAAA,CAAO,EAAA,CAAG,CAAC,CAAA;AAE1B,IAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,EAAG;AACzB,MAAA,MAAM,MAAA,GAAS,OAAO,GAAA,CAAI,CAAC,MAAM,mBAAA,CAAoB,CAAA,EAAG,GAAG,CAAC,CAAA;AAC5D,MAAA,OAAO,GAAG,GAAG,CAAA,KAAA,EAAQ,MAAA,CAAO,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAAA,IACxC;AAGA,IAAA,IAAI,cAAc,MAAA,EAAQ;AACxB,MAAA,iBAAA,CAAkB,OAAO,QAAQ,CAAA;AACjC,MAAA,GAAA,CAAI,aAAa,KAAA,IAAS,CAAA;AAC1B,MAAA,GAAA,CAAI,UAAA,CAAW,IAAA,CAAK,EAAE,GAAA,EAAK,MAAA,CAAO,UAAU,IAAA,EAAM,SAAA,EAAW,IAAA,EAAM,UAAA,EAAY,CAAA;AAC/E,MAAA,OAAO,CAAA,EAAG,GAAG,CAAA,QAAA,EAAW,GAAA,CAAI,aAAa,KAAK,CAAA,CAAA,CAAA;AAAA,IAChD;AACA,IAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,MAAA,GAAA,CAAI,aAAa,KAAA,IAAS,CAAA;AAC1B,MAAA,GAAA,CAAI,UAAA,CAAW,IAAA,CAAK,EAAE,GAAA,EAAK,MAAA,CAAO,QAAQ,IAAA,EAAM,OAAA,EAAS,IAAA,EAAM,UAAA,EAAY,CAAA;AAC3E,MAAA,OAAO,CAAA,EAAG,GAAG,CAAA,QAAA,EAAW,GAAA,CAAI,aAAa,KAAK,CAAA,CAAA,CAAA;AAAA,IAChD;AAEA,IAAA,OAAO,GAAG,GAAG,CAAA,MAAA,CAAA;AAAA,EACf;AAEA,EAAA,IAAI,WAAW,MAAA,EAAQ;AACrB,IAAA,MAAM,MAAM,QAAA,CAAS,MAAA,CAAO,KAAA,CAAM,CAAC,GAAG,GAAG,CAAA;AACzC,IAAA,MAAM,MAAA,GAAS,MAAA,CAAO,KAAA,CAAM,CAAC,CAAA;AAE7B,IAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,EAAG;AACzB,MAAA,MAAM,MAAA,GAAS,OAAO,GAAA,CAAI,CAAC,MAAM,mBAAA,CAAoB,CAAA,EAAG,GAAG,CAAC,CAAA;AAC5D,MAAA,OAAO,GAAG,GAAG,CAAA,SAAA,EAAY,MAAA,CAAO,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAAA,IAC5C;AAEA,IAAA,IAAI,cAAc,MAAA,EAAQ;AACxB,MAAA,iBAAA,CAAkB,OAAO,QAAQ,CAAA;AACjC,MAAA,GAAA,CAAI,aAAa,KAAA,IAAS,CAAA;AAC1B,MAAA,GAAA,CAAI,UAAA,CAAW,IAAA,CAAK,EAAE,GAAA,EAAK,MAAA,CAAO,UAAU,IAAA,EAAM,SAAA,EAAW,IAAA,EAAM,UAAA,EAAY,CAAA;AAC/E,MAAA,OAAO,CAAA,EAAG,GAAG,CAAA,SAAA,EAAY,GAAA,CAAI,aAAa,KAAK,CAAA,CAAA,CAAA;AAAA,IACjD;AACA,IAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,MAAA,GAAA,CAAI,aAAa,KAAA,IAAS,CAAA;AAC1B,MAAA,GAAA,CAAI,UAAA,CAAW,IAAA,CAAK,EAAE,GAAA,EAAK,MAAA,CAAO,QAAQ,IAAA,EAAM,OAAA,EAAS,IAAA,EAAM,UAAA,EAAY,CAAA;AAC3E,MAAA,OAAO,CAAA,EAAG,GAAG,CAAA,SAAA,EAAY,GAAA,CAAI,aAAa,KAAK,CAAA,CAAA,CAAA;AAAA,IACjD;AAEA,IAAA,OAAO,GAAG,GAAG,CAAA,UAAA,CAAA;AAAA,EACf;AAEA,EAAA,IAAI,UAAU,MAAA,EAAQ;AACpB,IAAA,MAAM,MAAM,QAAA,CAAS,MAAA,CAAO,IAAA,CAAK,CAAC,GAAG,GAAG,CAAA;AACxC,IAAA,MAAM,UAAU,mBAAA,CAAoB,MAAA,CAAO,IAAA,CAAK,CAAC,GAAG,GAAG,CAAA;AACvD,IAAA,OAAO,CAAA,EAAG,GAAG,CAAA,MAAA,EAAS,OAAO,CAAA,CAAA;AAAA,EAC/B;AAEA,EAAA,IAAI,WAAW,MAAA,EAAQ;AACrB,IAAA,MAAM,MAAM,QAAA,CAAS,MAAA,CAAO,KAAA,CAAM,CAAC,GAAG,GAAG,CAAA;AACzC,IAAA,MAAM,UAAU,mBAAA,CAAoB,MAAA,CAAO,KAAA,CAAM,CAAC,GAAG,GAAG,CAAA;AACxD,IAAA,OAAO,CAAA,EAAG,GAAG,CAAA,OAAA,EAAU,OAAO,CAAA,CAAA;AAAA,EAChC;AAEA,EAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,IAAA,OAAO,CAAA,EAAG,QAAA,CAAS,MAAA,CAAO,MAAA,EAAQ,GAAG,CAAC,CAAA,QAAA,CAAA;AAAA,EACxC;AAEA,EAAA,IAAI,eAAe,MAAA,EAAQ;AACzB,IAAA,OAAO,CAAA,EAAG,QAAA,CAAS,MAAA,CAAO,SAAA,EAAW,GAAG,CAAC,CAAA,YAAA,CAAA;AAAA,EAC3C;AAEA,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,MAAM,KAAA,GAAQ,OAAO,GAAA,CAAI,GAAA,CAAI,CAAC,GAAA,KAAQ,aAAA,CAAc,GAAA,EAAK,GAAG,CAAC,CAAA;AAC7D,IAAA,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,IAAA,CAAK,OAAO,CAAC,CAAA,CAAA,CAAA;AAAA,EAChC;AAEA,EAAA,IAAI,QAAQ,MAAA,EAAQ;AAClB,IAAA,MAAM,KAAA,GAAQ,OAAO,EAAA,CAAG,GAAA,CAAI,CAAC,GAAA,KAAQ,aAAA,CAAc,GAAA,EAAK,GAAG,CAAC,CAAA;AAC5D,IAAA,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,IAAA,CAAK,MAAM,CAAC,CAAA,CAAA,CAAA;AAAA,EAC/B;AAEA,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,MAAA,CAAO,GAAA,EAAK,GAAG,CAAA;AAC3C,IAAA,OAAO,QAAQ,KAAK,CAAA,CAAA,CAAA;AAAA,EACtB;AAEA,EAAA,IAAI,cAAc,MAAA,EAAQ;AAExB,IAAA,MAAMC,UAAAA,GAAY,OAAO,QAAA,CAAS,KAAA;AAClC,IAAA,MAAM,GAAA,GAAM,QAAA,CAASA,UAAAA,EAAW,GAAG,CAAA;AAEnC,IAAA,MAAM,QAAA,GAAW,OAAO,QAAA,CAAS,KAAA;AACjC,IAAA,MAAM,GAAA,GAAM,UAAA,IAAc,QAAA,GAAW,QAAA,CAAS,WAAW,QAAA,CAAS,MAAA;AAClE,IAAA,IAAI,UAAA,IAAc,QAAA,EAAU,iBAAA,CAAkB,QAAA,CAAS,QAAQ,CAAA;AAG/D,IAAA,MAAM,GAAA,GAAM,GAAA,CAAI,aAAA,CAAc,GAAA,CAAIA,UAAS,CAAA;AAC3C,IAAA,MAAM,UAAA,GAAa,KAAK,MAAA,CAAO,gBAAA;AAE/B,IAAA,GAAA,CAAI,aAAa,KAAA,IAAS,CAAA;AAC1B,IAAA,GAAA,CAAI,WAAW,IAAA,CAAK;AAAA,MAClB,GAAA;AAAA,MACA,IAAA,EAAM,UAAA;AAAA,MACN,IAAA,EAAM,QAAA;AAAA,MACN;AAAA,KACD,CAAA;AAED,IAAA,MAAM,QAAA,GAAW,CAAA,CAAA,EAAI,GAAA,CAAI,YAAA,CAAa,KAAK,CAAA,CAAA;AAC3C,IAAA,MAAM,QAAA,GAAW,aAAA,CAAc,MAAA,CAAO,QAAA,CAAS,YAAY,CAAC,CAAA;AAC5D,IAAA,OAAO,CAAA,KAAA,EAAQ,GAAG,CAAA,KAAA,EAAQ,QAAQ,QAAQ,QAAQ,CAAA,CAAA;AAAA,EACpD;AAEA,EAAA,IAAI,WAAW,MAAA,EAAQ;AACrB,IAAA,MAAM,GAAA,GAAM,QAAA,CAAS,MAAA,CAAO,KAAA,CAAM,OAAO,GAAG,CAAA;AAE5C,IAAA,MAAM,QAAA,GAAW,OAAO,KAAA,CAAM,KAAA;AAC9B,IAAA,MAAM,GAAA,GAAM,UAAA,IAAc,QAAA,GAAW,QAAA,CAAS,WAAW,QAAA,CAAS,MAAA;AAClE,IAAA,MAAM,IAAA,GAAO,UAAA,IAAc,QAAA,GAAW,SAAA,GAAqB,OAAA;AAC3D,IAAA,IAAI,UAAA,IAAc,QAAA,EAAU,iBAAA,CAAkB,QAAA,CAAS,QAAQ,CAAA;AAE/D,IAAA,GAAA,CAAI,aAAa,KAAA,IAAS,CAAA;AAC1B,IAAA,GAAA,CAAI,WAAW,IAAA,CAAK,EAAE,KAAK,IAAA,EAAM,IAAA,EAAM,UAAU,CAAA;AAEjD,IAAA,MAAM,QAAA,GAAW,CAAA,CAAA,EAAI,GAAA,CAAI,YAAA,CAAa,KAAK,CAAA,CAAA;AAC3C,IAAA,MAAM,WAAA,GAAc,OAAO,KAAA,CAAM,WAAA;AAEjC,IAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,MAAA,OAAO,eAAe,GAAG,CAAA,EAAA,EAAK,QAAQ,CAAA,KAAA,EAAQ,aAAA,CAAc,WAAW,CAAC,CAAA,CAAA;AAAA,IAC1E;AAEA,IAAA,OAAO,CAAA,EAAG,GAAG,CAAA,GAAA,EAAM,QAAQ,CAAA,CAAA;AAAA,EAC7B;AAOA,EAAA,IAAI,UAAA,IAAc,MAAA,EAAQ,cAAA,CAAe,iBAAiB,CAAA;AAG1D,EAAA,OAAO,MAAA;AACT;AAMO,IAAM,cAAA,GAAiB,CAC5B,IAAA,EACA,GAAA,KACW;AACX,EAAA,IAAI,SAAS,IAAA,EAAM;AACjB,IAAA,MAAM,IAAI,mBAAA,CAAoB,IAAA,CAAK,GAAA,CAAI,CAAC,GAAG,GAAG,CAAA;AAC9C,IAAA,MAAM,IAAI,mBAAA,CAAoB,IAAA,CAAK,GAAA,CAAI,CAAC,GAAG,GAAG,CAAA;AAC9C,IAAA,OAAO,CAAA,CAAA,EAAI,CAAC,CAAA,GAAA,EAAM,CAAC,CAAA,CAAA,CAAA;AAAA,EACrB;AAEA,EAAA,IAAI,cAAc,IAAA,EAAM;AACtB,IAAA,MAAM,IAAI,mBAAA,CAAoB,IAAA,CAAK,QAAA,CAAS,CAAC,GAAG,GAAG,CAAA;AACnD,IAAA,MAAM,IAAI,mBAAA,CAAoB,IAAA,CAAK,QAAA,CAAS,CAAC,GAAG,GAAG,CAAA;AACnD,IAAA,OAAO,CAAA,CAAA,EAAI,CAAC,CAAA,GAAA,EAAM,CAAC,CAAA,CAAA,CAAA;AAAA,EACrB;AAEA,EAAA,IAAI,cAAc,IAAA,EAAM;AACtB,IAAA,MAAM,IAAI,mBAAA,CAAoB,IAAA,CAAK,QAAA,CAAS,CAAC,GAAG,GAAG,CAAA;AACnD,IAAA,MAAM,IAAI,mBAAA,CAAoB,IAAA,CAAK,QAAA,CAAS,CAAC,GAAG,GAAG,CAAA;AACnD,IAAA,OAAO,CAAA,CAAA,EAAI,CAAC,CAAA,GAAA,EAAM,CAAC,CAAA,CAAA,CAAA;AAAA,EACrB;AAEA,EAAA,IAAI,YAAY,IAAA,EAAM;AACpB,IAAA,MAAM,IAAI,mBAAA,CAAoB,IAAA,CAAK,MAAA,CAAO,CAAC,GAAG,GAAG,CAAA;AACjD,IAAA,MAAM,IAAI,mBAAA,CAAoB,IAAA,CAAK,MAAA,CAAO,CAAC,GAAG,GAAG,CAAA;AACjD,IAAA,OAAO,CAAA,CAAA,EAAI,CAAC,CAAA,GAAA,EAAM,CAAC,CAAA,CAAA,CAAA;AAAA,EACrB;AAEA,EAAA,IAAI,YAAY,IAAA,EAAM;AACpB,IAAA,MAAM,KAAA,GAAQ,KAAK,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,KAAM,mBAAA,CAAoB,CAAA,EAAG,GAAG,CAAC,CAAA;AAChE,IAAA,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,IAAA,CAAK,MAAM,CAAC,CAAA,CAAA,CAAA;AAAA,EAC/B;AAEA,EAAA,IAAI,cAAc,IAAA,EAAM;AACtB,IAAA,MAAM,KAAA,GAAQ,KAAK,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,KAAM,mBAAA,CAAoB,CAAA,EAAG,GAAG,CAAC,CAAA;AAClE,IAAA,OAAO,CAAA,SAAA,EAAY,KAAA,CAAM,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAAA,EACrC;AAEA,EAAA,IAAI,UAAU,IAAA,EAAM;AAClB,IAAA,MAAM,cAAc,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,KAAM;AAC5C,MAAA,MAAM,IAAA,GAAO,aAAA,CAAc,CAAA,CAAE,SAAA,EAAW,GAAG,CAAA;AAC3C,MAAA,MAAM,GAAA,GAAM,mBAAA,CAAoB,CAAA,CAAE,IAAA,EAAM,GAAG,CAAA;AAC3C,MAAA,OAAO,CAAA,KAAA,EAAQ,IAAI,CAAA,MAAA,EAAS,GAAG,CAAA,CAAA;AAAA,IACjC,CAAC,CAAA;AACD,IAAA,MAAM,OAAA,GAAU,mBAAA,CAAoB,IAAA,CAAK,IAAA,CAAK,MAAM,GAAG,CAAA;AACvD,IAAA,OAAO,QAAQ,WAAA,CAAY,IAAA,CAAK,GAAG,CAAC,SAAS,OAAO,CAAA,IAAA,CAAA;AAAA,EACtD;AAEA,EAAA,OAAO,MAAA;AACT,CAAA;AAQA,IAAM,MAAA,GAAS,CAAC,GAAA,EAAiC,GAAA,KAC/C,OAAO,GAAA,KAAQ,QAAA,GAAW,QAAA,CAAS,GAAA,EAAK,GAAG,CAAA,GAAI,cAAA,CAAe,KAAK,GAAG,CAAA;AAEjE,IAAM,gBAAA,GAAmB,CAC9B,IAAA,EACA,GAAA,KACW;AACX,EAAA,IAAI,WAAW,IAAA,EAAM;AACnB,IAAA,IAAI,IAAA,CAAK,KAAA,KAAU,GAAA,EAAK,OAAO,UAAA;AAC/B,IAAA,OAAO,CAAA,MAAA,EAAS,QAAA,CAAS,IAAA,CAAK,KAAA,EAAO,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,EAC3C;AACA,EAAA,IAAI,eAAA,IAAmB,MAAM,OAAO,CAAA,eAAA,EAAkB,SAAS,IAAA,CAAK,aAAA,EAAe,GAAG,CAAC,CAAA,CAAA,CAAA;AACvF,EAAA,IAAI,KAAA,IAAS,MAAM,OAAO,CAAA,IAAA,EAAO,OAAO,IAAA,CAAK,GAAA,EAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AACtD,EAAA,IAAI,KAAA,IAAS,MAAM,OAAO,CAAA,IAAA,EAAO,OAAO,IAAA,CAAK,GAAA,EAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AACtD,EAAA,IAAI,KAAA,IAAS,MAAM,OAAO,CAAA,IAAA,EAAO,OAAO,IAAA,CAAK,GAAA,EAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AACtD,EAAA,IAAI,KAAA,IAAS,MAAM,OAAO,CAAA,IAAA,EAAO,OAAO,IAAA,CAAK,GAAA,EAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AACtD,EAAA,OAAO,MAAA;AACT,CAAA;;;AC3aO,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,MAAMR,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,EAAE,aAAY,GAAI,IAAA;AACxB,IAAA,MAAM,KAAA,GAAQ,cAAA;AACd,IAAA,MAAM,MAAA,GACJ,KAAA,KAAU,MAAA,IAAa,WAAA,KAAgB,SACnC,MAAM,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,KAAK,MAAM,CAAA,GAClC,MAAM,WAAA,CAAY,OAAO,EAAA,KAAO;AAG9B,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;;;ACtGO,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,GAAeJ,MAClB,MAAA,CAAO;AAAA,EACN,OAAA,EAASA,MACN,MAAA,CAAO;AAAA,IACN,IAAA,EAAMA,KAAAA,CAAE,MAAA,EAAO,CAAE,SAAS,8BAA8B,CAAA;AAAA,IACxD,KAAA,EAAOA,KAAAA,CAAE,MAAA,EAAO,CAAE,SAAS,6BAA6B,CAAA;AAAA,IACxD,KAAA,EAAO,YAAA,CAAa,QAAA,CAAS,uDAAkD;AAAA,GAChF,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,2FAA2F,CAAA;AAOvG,IAAM,WAAA,GAAcA,MAAE,KAAA,CAAM;AAAA,EAC1BA,MAAE,MAAA,EAAO;AAAA,EACTA,MAAE,MAAA,EAAO;AAAA,EACTA,MAAE,OAAA,EAAQ;AAAA,EACVA,MAAE,IAAA,EAAK;AAAA,EACPA,KAAAA,CAAE,OAAO,EAAE,QAAA,EAAUA,MAAE,MAAA,EAAO,EAAG,CAAA,CAAE,MAAA,EAAO;AAAA,EAC1C;AACF,CAAC,CAAA;AAED,IAAM,OAAA,GAAUA,MACb,MAAA,CAAOA,KAAAA,CAAE,QAAO,EAAG,WAAW,EAC9B,MAAA,CAAO,CAAC,MAAM,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,CAAE,MAAA,GAAS,GAAG,EAAE,OAAA,EAAS,wCAAwC,CAAA;AAY/F,IAAM,gBAAA,GAAmBA,MACtB,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,KAAAA,CAAE,KAAA,CAAMA,KAAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,sEAAiE,CAAA;AAAA,EAC7G,GAAA,EAAK,OAAA,CAAQ,QAAA,EAAS,CAAE,SAAS,oGAA+F;AAClI,CAAC,EACA,MAAA,EAAO;AAIV,IAAM,YAAA,GAAeA,MAAE,MAAA,CAAO,EAAE,IAAIA,KAAAA,CAAE,OAAA,CAAQ,QAAQ,CAAA,EAAG,KAAA,EAAOA,MAAE,MAAA,EAAO,EAAG,QAAQ,OAAA,EAAS,UAAA,EAAY,iBAAiB,QAAA,EAAS,EAAG,CAAA,CAAE,MAAA,EAAO;AAC/I,IAAM,eAAeA,KAAAA,CAAE,MAAA,CAAO,EAAE,EAAA,EAAIA,KAAAA,CAAE,QAAQ,QAAQ,CAAA,EAAG,OAAOA,KAAAA,CAAE,MAAA,IAAU,GAAA,EAAK,OAAA,EAAS,OAAO,YAAA,EAAc,EAAE,MAAA,EAAO;AACxH,IAAM,eAAeA,KAAAA,CAAE,MAAA,CAAO,EAAE,EAAA,EAAIA,MAAE,OAAA,CAAQ,QAAQ,CAAA,EAAG,KAAA,EAAOA,MAAE,MAAA,EAAO,EAAG,OAAO,YAAA,EAAc,EAAE,MAAA,EAAO;AAU1G,IAAM,aAAA,GAAgBA,KAAAA,CACnB,MAAA,CAAO,EAAE,KAAA,EAAOA,KAAAA,CAAE,MAAA,EAAO,EAAG,CAAA,CAC5B,MAAA,EAAO,CACP,SAAS,iEAAiE,CAAA;AAE7E,IAAM,WAAA,GAAcA,KAAAA,CACjB,MAAA,CAAOA,KAAAA,CAAE,MAAA,EAAO,EAAGA,KAAAA,CAAE,KAAA,CAAM,CAAC,WAAA,EAAa,aAAa,CAAC,CAAC,EACxD,MAAA,CAAO,CAAC,CAAA,KAAM,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,CAAE,MAAA,GAAS,CAAA,EAAG,EAAE,OAAA,EAAS,sCAAA,EAAwC,CAAA;AAE/F,IAAM,gBAAA,GAAmBA,MACtB,MAAA,CAAO;AAAA,EACN,EAAA,EAAIA,KAAAA,CAAE,OAAA,CAAQ,YAAY,CAAA;AAAA,EAC1B,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,KAAA,EAAOA,KAAAA,CAAE,MAAA,CAAO,EAAE,QAAA,EAAUA,KAAAA,CAAE,MAAA,EAAO,EAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,6EAAwE,CAAA;AAAA,EACpI,MAAA,EAAQ,WAAA;AAAA,EACR,UAAA,EAAY,iBAAiB,QAAA;AAC/B,CAAC,EACA,MAAA,EAAO;AAMV,IAAM,YAAA,GAAeA,MAClB,MAAA,CAAO;AAAA,EACN,EAAA,EAAIA,KAAAA,CAAE,OAAA,CAAQ,QAAQ,CAAA;AAAA,EACtB,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,OAAA,EAAS,OAAA;AAAA;AAAA,EACT,MAAA,EAAQ,QAAQ,QAAA,EAAS;AAAA;AAAA,EACzB,GAAA,EAAKA,MAAE,MAAA;AACT,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,0JAA0J,CAAA;AAE/J,IAAM,cAAA,GAAiBA,KAAAA,CAAE,kBAAA,CAAmB,IAAA,EAAM,CAAC,cAAc,gBAAA,EAAkB,YAAA,EAAc,YAAA,EAAc,YAAY,CAAC;AAQ5H,IAAM,wBAAA,GAA2BA,KAAAA,CAAE,KAAA,CAAM,CAAC,cAAA,EAAgB,cAAA,CAAe,KAAA,EAAM,CAAE,GAAA,CAAI,CAAC,CAAC,CAAC;ACxG/F,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,oBAAa,KAAA,CAAM,GAAG,GAAG,OAAO,CAAA,aAAA,EAAgBC,qBAAc,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,oBAAa,KAAA,CAAM,QAAQ,GAAG,OAAO,CAAA,kBAAA,EAAqBC,qBAAc,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,IAAMM,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,MAAMC,gBAAA,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;;;AC3GA,IAAM,eAAe,CAAC,CAAA,KACpB,CAAA,KAAM,IAAA,IAAQ,OAAO,CAAA,KAAM,QAAA,IAAY,CAAC,KAAA,CAAM,QAAQ,CAAC,CAAA,IAAK,OAAQ,CAAA,CAA8B,UAAU,CAAA,KAAM,QAAA;AAEpH,IAAM,UAAA,GAAa,CAAC,IAAA,EAAc,MAAA,KAAqD;AACrF,EAAA,MAAM,CAAC,KAAA,EAAO,KAAK,CAAA,GAAI,IAAA,CAAK,MAAM,GAAG,CAAA;AACrC,EAAA,MAAM,MAAA,GAAS,MAAA,EAAQ,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,KAAA,KAAU,KAAA,IAAS,CAAA,CAAE,IAAA,KAAS,KAAK,CAAA;AACjF,EAAA,MAAM,CAAA,GAAI,QAAQ,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,KAAK,CAAA;AACrD,EAAA,OAAO,EAAE,IAAA,EAAM,CAAA,EAAG,cAAA,IAAkB,SAAA,EAAW,QAAQ,IAAA,EAAK;AAC9D,CAAA;AAIA,IAAM,QAAA,GAAW,CAAC,GAAA,EAAuB,GAAA,EAAa,KAAA,KAA8B;AAClF,EAAA,MAAM,QAAA,GAAW,IAAI,GAAG,CAAA;AACxB,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,GAAA,CAAI,GAAG,CAAA,GAAI,KAAA;AACX,IAAA;AAAA,EACF;AACA,EAAA,IAAI,QAAA,CAAS,IAAA,KAAS,SAAA,IAAa,KAAA,CAAM,SAAS,SAAA,EAAW;AAC3D,IAAA,GAAA,CAAI,GAAG,CAAA,GAAI,EAAE,GAAG,OAAO,GAAI,QAAA,CAAS,IAAA,KAAS,MAAA,GAAY,EAAE,IAAA,EAAM,QAAA,CAAS,IAAA,EAAK,GAAI,EAAC,EAAG;AAAA,EACzF;AACF,CAAA;AAIA,IAAM,QAAA,GAAW,CAAC,KAAA,EAAgB,GAAA,KAAgC;AAChE,EAAA,IAAI,YAAA,CAAa,KAAK,CAAA,EAAG;AACvB,IAAA,QAAA,CAAS,KAAK,KAAA,CAAM,QAAA,EAAU,EAAE,IAAA,EAAM,WAAW,CAAA;AACjD,IAAA;AAAA,EACF;AACA,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACxB,IAAA,KAAA,MAAW,CAAA,IAAK,KAAA,EAAO,QAAA,CAAS,CAAA,EAAG,GAAG,CAAA;AACtC,IAAA;AAAA,EACF;AACA,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA,EAAU;AAC/C,IAAA,KAAA,MAAW,KAAK,MAAA,CAAO,MAAA,CAAO,KAAK,CAAA,EAAG,QAAA,CAAS,GAAG,GAAG,CAAA;AAAA,EACvD;AACF,CAAA;AAIA,IAAM,cAAc,CAAC,IAAA,EAAM,OAAO,IAAA,EAAM,KAAA,EAAO,MAAM,KAAK,CAAA;AAE1D,IAAM,UAAA,GAAa,CAAC,MAAA,EAAgB,MAAA,EAAoC,GAAA,KAAgC;AACtG,EAAA,MAAM,CAAA,GAAI,MAAA;AACV,EAAA,KAAA,MAAW,MAAM,WAAA,EAAa;AAC5B,IAAA,MAAM,IAAA,GAAO,EAAE,EAAE,CAAA;AACjB,IAAA,IAAI,MAAM,OAAA,CAAQ,IAAI,CAAA,IAAK,IAAA,CAAK,WAAW,CAAA,EAAG;AAC5C,MAAA,MAAM,CAAC,CAAA,EAAG,CAAC,CAAA,GAAI,IAAA;AACf,MAAA,IAAI,OAAO,CAAA,KAAM,QAAA,IAAY,YAAA,CAAa,CAAC,CAAA,EAAG,QAAA,CAAS,GAAA,EAAK,CAAA,CAAE,QAAA,EAAU,UAAA,CAAW,CAAA,EAAG,MAAM,CAAC,CAAA;AAAA,WAAA,IACpF,OAAO,CAAA,KAAM,QAAA,IAAY,YAAA,CAAa,CAAC,CAAA,EAAG,QAAA,CAAS,GAAA,EAAK,CAAA,CAAE,QAAA,EAAU,UAAA,CAAW,CAAA,EAAG,MAAM,CAAC,CAAA;AAAA,WAC7F,QAAA,CAAS,MAAM,GAAG,CAAA;AACvB,MAAA;AAAA,IACF;AAAA,EACF;AACA,EAAA,IAAI,IAAA,IAAQ,CAAA,IAAK,OAAA,IAAW,CAAA,EAAG;AAC7B,IAAA,MAAM,CAAC,MAAM,MAAM,CAAA,GAAK,EAAE,IAAI,CAAA,IAAK,EAAE,OAAO,CAAA;AAC5C,IAAA,IAAI,YAAA,CAAa,MAAM,CAAA,EAAG,QAAA,CAAS,KAAK,MAAA,CAAO,QAAA,EAAU,EAAE,GAAG,UAAA,CAAW,MAAM,MAAM,CAAA,EAAG,MAAM,CAAA,EAAG,UAAA,CAAW,MAAM,MAAM,CAAA,CAAE,IAAI,CAAA,EAAA,CAAA,EAAM,CAAA;AAAA,SAC/H,QAAA,CAAS,QAAQ,GAAG,CAAA;AACzB,IAAA;AAAA,EACF;AACA,EAAA,IAAI,MAAA,IAAU,CAAA,IAAK,OAAA,IAAW,CAAA,EAAG;AAC/B,IAAA,MAAM,CAAC,MAAM,CAAC,CAAA,GAAK,EAAE,MAAM,CAAA,IAAK,EAAE,OAAO,CAAA;AACzC,IAAA,IAAI,YAAA,CAAa,CAAC,CAAA,EAAG,QAAA,CAAS,KAAK,CAAA,CAAE,QAAA,EAAU,EAAE,IAAA,EAAM,QAAA,EAAU,MAAA,EAAQ,IAAA,EAAM,IAAA,EAAM,WAAW,CAAA;AAChG,IAAA;AAAA,EACF;AACA,EAAA,IAAI,KAAA,IAAS,CAAA,IAAK,IAAA,IAAQ,CAAA,EAAG;AAC3B,IAAA,KAAA,MAAW,GAAA,IAAQ,CAAA,CAAE,KAAK,CAAA,IAAK,CAAA,CAAE,IAAI,CAAA,EAAgB,UAAA,CAAW,GAAA,EAAK,MAAA,EAAQ,GAAG,CAAA;AAChF,IAAA;AAAA,EACF;AACA,EAAA,IAAI,SAAS,CAAA,EAAG;AACd,IAAA,UAAA,CAAW,CAAA,CAAE,KAAK,CAAA,EAAa,MAAA,EAAQ,GAAG,CAAA;AAC1C,IAAA;AAAA,EACF;AAGA,EAAA,QAAA,CAAS,GAAG,GAAG,CAAA;AACjB,CAAA;AAEA,IAAM,WAAA,GAAc,CAAC,CAAA,KACnB,CAAA,KAAM,IAAA,IAAQ,OAAO,CAAA,KAAM,QAAA,IAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,CAAC,KAAK,SAAA,IAAa,CAAA;AAE3E,IAAM,YAAY,CAAC,CAAA,KACjB,CAAA,CAAE,EAAA,KAAO,YAAY,CAAA,CAAE,EAAA,KAAO,YAAA,GAC1B,EAAE,GAAG,CAAA,CAAE,MAAA,EAAQ,GAAI,CAAA,CAAE,UAAA,EAAY,OAAO,EAAC,EAAG,GAC5C,CAAA,CAAE,OAAO,QAAA,GACP,CAAA,CAAE,GAAA,GACF,CAAA,CAAE,OAAO,QAAA,GACP,EAAE,GAAG,CAAA,CAAE,SAAS,GAAI,CAAA,CAAE,UAAU,EAAC,KACjC,EAAC;AAEJ,IAAM,sBAAA,GAAyB,CAAC,GAAA,EAAyB,MAAA,KAA8C;AAC5G,EAAA,MAAM,MAAwB,EAAC;AAC/B,EAAA,MAAM,OAAO,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA,GAAI,GAAA,GAAM,CAAC,GAAG,CAAA;AAC5C,EAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,IAAA,KAAA,MAAW,CAAC,KAAK,CAAC,CAAA,IAAK,OAAO,OAAA,CAAQ,SAAA,CAAU,CAAC,CAAC,CAAA,EAAG;AACnD,MAAA,IAAI,WAAA,CAAY,CAAC,CAAA,EAAG;AAElB,QAAA,UAAA,CAAW,CAAA,CAAE,OAAA,CAAQ,KAAA,EAAO,MAAA,EAAQ,GAAG,CAAA;AACvC,QAAA;AAAA,MACF;AACA,MAAA,IAAI,CAAC,YAAA,CAAa,CAAC,CAAA,EAAG;AACtB,MAAA,MAAM,UAAA,GAAa,EAAE,EAAA,KAAO,QAAA,IAAY,EAAE,MAAA,KAAW,MAAA,IAAa,OAAO,CAAA,CAAE,MAAA;AAC3E,MAAA,QAAA,CAAS,GAAA,EAAK,EAAE,QAAA,EAAU,EAAE,GAAG,UAAA,CAAW,CAAA,EAAG,CAAA,CAAE,KAAK,CAAA,CAAA,EAAI,GAAG,IAAI,MAAM,CAAA,EAAG,GAAI,UAAA,GAAa,EAAE,MAAM,aAAA,EAAc,GAAI,EAAC,EAAI,CAAA;AAAA,IAC1H;AACA,IAAA,IAAI,CAAA,CAAE,EAAA,KAAO,QAAA,IAAY,CAAA,CAAE,EAAA,KAAO,UAAU,UAAA,CAAW,CAAA,CAAE,KAAA,EAAO,MAAA,EAAQ,GAAG,CAAA;AAC3E,IAAA,IAAI,CAAA,CAAE,OAAO,YAAA,EAAc;AACzB,MAAA,MAAM,QAAA,GAAW,OAAO,MAAA,CAAO,CAAA,CAAE,MAAM,CAAA,CACpC,MAAA,CAAO,CAAC,CAAA,KAA8B,CAAA,KAAM,QAAQ,OAAO,CAAA,KAAM,YAAY,OAAA,IAAW,CAAC,EACzF,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,KAAK,CAAA;AACrB,MAAA,GAAA,CAAI,EAAE,KAAA,CAAM,QAAQ,IAAI,EAAE,IAAA,EAAM,QAAQ,IAAA,EAAM,CAAA,oDAAA,EAAkD,SAAS,MAAA,GAAS,CAAA,GAAI,WAAW,QAAA,CAAS,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA,GAAM,EAAE,CAAA,CAAA,EAAG;AAAA,IACjK;AACA,IAAA,IAAI,CAAA,CAAE,OAAO,QAAA,EAAU;AACrB,MAAA,GAAA,CAAI,EAAE,GAAG,CAAA,GAAI,EAAE,GAAG,WAAW,CAAA,EAAG,CAAA,CAAE,KAAK,CAAA,CAAA,EAAI,EAAE,GAAG,CAAA,CAAA,EAAI,MAAM,CAAA,EAAG,MAAM,kEAAA,EAA8D;AAAA,IACnI;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAEO,IAAM,mBAAA,GAAsB,CAAC,GAAA,EAAY,MAAA,KAA8C;AAC5F,EAAA,MAAM,MAAwB,EAAC;AAC/B,EAAA,MAAM,SAAA,GAAY,CAAC,CAAA,KAAmB;AACpC,IAAA,KAAA,MAAW,MAAA,IAAU,EAAE,IAAA,EAAM;AAC3B,MAAA,IAAI,OAAO,MAAA,KAAW,QAAA,EAAU,SAAA,CAAU,OAAO,KAAK,CAAA;AAAA,IACxD;AACA,IAAA,IAAI,EAAE,MAAA,KAAW,MAAA,aAAsB,CAAA,CAAE,MAAA,EAAQ,QAAQ,GAAG,CAAA;AAC5D,IAAA,IAAI,EAAE,OAAA,KAAY,MAAA,EAAW,QAAA,CAAS,CAAA,CAAE,SAAS,GAAG,CAAA;AACpD,IAAA,IAAI,EAAE,SAAA,KAAc,MAAA,EAAW,QAAA,CAAS,CAAA,CAAE,WAAW,GAAG,CAAA;AAAA,EAC1D,CAAA;AACA,EAAA,SAAA,CAAU,GAAG,CAAA;AACb,EAAA,OAAO,GAAA;AACT;AAEO,IAAM,cAAA,GAAiB,CAAC,GAAA,KAA8C;AAC3E,EAAA,MAAM,OAAO,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA,GAAI,GAAA,GAAM,CAAC,GAAG,CAAA;AAC5C,EAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,CAAC,CAAA,KAAM;AACzB,IAAA,MAAM,OAAuB,EAAE,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,OAAO,CAAA,CAAE,KAAA,EAAO,OAAA,EAAS,MAAA,CAAO,KAAK,SAAA,CAAU,CAAC,CAAC,CAAA,CAAE,MAAK,EAAE;AAGnG,IAAA,MAAM,WAAA,GAAA,CAAe,CAAA,CAAE,EAAA,KAAO,QAAA,IAAY,CAAA,CAAE,EAAA,KAAO,YAAA,KAAiB,CAAA,CAAE,UAAA,EAAY,GAAA,KAAQ,MAAA,GAAY,CAAA,CAAE,WAAW,GAAA,GAAM,MAAA;AACzH,IAAA,IAAI,WAAA,KAAgB,MAAA,EAAW,OAAO,CAAC,IAAI,CAAA;AAC3C,IAAA,OAAO,CAAC,IAAA,EAAM,EAAE,EAAA,EAAI,UAAU,KAAA,EAAO,CAAA,CAAE,KAAA,EAAO,OAAA,EAAS,OAAO,IAAA,CAAK,WAAW,CAAA,CAAE,IAAA,IAAQ,CAAA;AAAA,EAC1F,CAAC,CAAA;AACH;AAKO,IAAM,mBAAA,GAAsB,CAAC,CAAA,KAA8B;AAChE,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,IAAA,GAAO,EAAE,EAAA,KAAO,QAAA,IAAY,EAAE,EAAA,KAAO,YAAA,GAAe,EAAE,GAAG,CAAA,CAAE,MAAA,EAAQ,GAAI,CAAA,CAAE,UAAA,EAAY,GAAA,IAAO,EAAC,EAAG,GAAI,EAAE,EAAA,KAAO,QAAA,GAAW,CAAA,CAAE,GAAA,GAAM,EAAC;AACvI,EAAA,KAAA,MAAW,CAAA,IAAK,MAAA,CAAO,MAAA,CAAO,IAAI,CAAA,EAAG;AACnC,IAAA,IAAI,aAAa,CAAC,CAAA,EAAG,IAAA,CAAK,GAAA,CAAI,EAAE,QAAQ,CAAA;AAAA,SAAA,IAC/B,WAAA,CAAY,CAAC,CAAA,EAAG;AACvB,MAAA,MAAM,MAAwB,EAAC;AAC/B,MAAA,QAAA,CAAS,CAAA,CAAE,OAAA,CAAQ,KAAA,EAAO,GAAG,CAAA;AAC7B,MAAA,KAAA,MAAW,KAAK,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,EAAG,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,IAC9C;AAAA,EACF;AACA,EAAA,IAAI,EAAE,EAAA,KAAO,YAAA,OAAmB,GAAA,CAAI,CAAA,CAAE,MAAM,QAAQ,CAAA;AACpD,EAAA,IAAI,CAAA,CAAE,EAAA,KAAO,QAAA,IAAY,CAAA,CAAE,OAAO,QAAA,EAAU;AAC1C,IAAA,MAAM,MAAwB,EAAC;AAC/B,IAAA,QAAA,CAAS,CAAA,CAAE,OAAO,GAAG,CAAA;AACrB,IAAA,KAAA,MAAW,KAAK,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,EAAG,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,EAC9C;AACA,EAAA,OAAO,CAAC,GAAG,IAAI,CAAA,CAAE,IAAA,EAAK;AACxB;AAWA,IAAM,YAAA,GAAe,CAAC,KAAA,KAA4B;AAChD,EAAA,IAAI,MAAM,OAAA,CAAQ,KAAK,GAAG,OAAO,KAAA,CAAM,KAAK,YAAY,CAAA;AACxD,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,UAAU,OAAO,KAAA;AACxD,EAAA,IAAI,UAAA,IAAc,OAAO,OAAO,IAAA;AAChC,EAAA,OAAO,MAAA,CAAO,MAAA,CAAO,KAAK,CAAA,CAAE,KAAK,YAAY,CAAA;AAC/C,CAAA;AAEO,IAAM,YAAA,GAAe,CAAC,GAAA,KAAsC;AACjE,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,MAAM,OAAO,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA,GAAI,GAAA,GAAM,CAAC,GAAG,CAAA;AAC5C,EAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,IAAA,IAAI,YAAA,CAAa,CAAC,CAAA,EAAG;AACnB,MAAA,MAAA,CAAO,KAAK,CAAA,EAAG,CAAA,CAAE,EAAE,CAAA,KAAA,EAAQ,CAAA,CAAE,KAAK,CAAA,uGAAA,CAAoG,CAAA;AAAA,IACxI;AACA,IAAA,IAAI,CAAA,CAAE,EAAA,KAAO,QAAA,IAAY,CAAA,CAAE,OAAO,QAAA,EAAU;AAC5C,IAAA,MAAM,MAAwB,EAAC;AAC/B,IAAA,QAAA,CAAS,CAAA,CAAE,OAAO,GAAG,CAAA;AACrB,IAAA,IAAI,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,WAAW,CAAA,EAAG;AACjC,MAAA,MAAA,CAAO,KAAK,CAAA,EAAG,CAAA,CAAE,EAAE,CAAA,KAAA,EAAQ,CAAA,CAAE,KAAK,CAAA,oEAAA,CAAiE,CAAA;AAAA,IACrG;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT;;;ACrKA,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,MAAMZ,aAAA,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;;;AC3EA,IAAM,QAAA,GAAW,CAAC,CAAA,KAChB,CAAA,KAAM,IAAA,IAAQ,OAAO,CAAA,KAAM,QAAA,IAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,CAAC,KAAK,SAAA,IAAa,CAAA;AAC3E,IAAM,SAAA,GAAY,CAAC,CAAA,KACjB,CAAA,KAAM,IAAA,IAAQ,OAAO,CAAA,KAAM,QAAA,IAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,CAAC,KAAK,OAAA,IAAW,CAAA;AAEzE,IAAM,cAAA,GAAiB,CAAC,CAAA,KAAkD;AACxE,EAAA,MAAM,MAAgC,EAAC;AACvC,EAAA,MAAM,IAAA,GAAO,CAAC,IAAA,KAAoD;AAChE,IAAA,KAAA,MAAW,CAAA,IAAK,MAAA,CAAO,MAAA,CAAO,IAAA,IAAQ,EAAE,CAAA,EAAG,IAAI,QAAA,CAAS,CAAC,CAAA,EAAG,GAAA,CAAI,IAAA,CAAK,EAAE,OAAO,CAAA;AAAA,EAChF,CAAA;AACA,EAAA,IAAI,CAAA,CAAE,EAAA,KAAO,QAAA,IAAY,CAAA,CAAE,OAAO,YAAA,EAAc;AAC9C,IAAA,IAAA,CAAK,EAAE,MAAM,CAAA;AACb,IAAA,IAAA,CAAK,CAAA,CAAE,YAAY,GAAG,CAAA;AAAA,EACxB;AACA,EAAA,IAAI,CAAA,CAAE,EAAA,KAAO,QAAA,EAAU,IAAA,CAAK,EAAE,GAAG,CAAA;AACjC,EAAA,OAAO,GAAA;AACT,CAAA;AAMA,IAAMa,WAAAA,GAAa,CAAC,KAAA,EAAe,MAAA,KACjC,OAAO,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,KAAA,KAAU,KAAA,IAAS,CAAA,CAAE,SAAS,KAAK,CAAA;AAOnE,IAAM,oBAAA,GAAuB,CAAC,KAAA,EAAe,MAAA,EAAkB,MAAA,KAAwH;AACrL,EAAA,MAAM,UAAA,GAAa;AAAA,IACjB,MAAA,CAAO,MAAA,CAAO,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,UAAU,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAA;AAAA,IAC3D,GAAG,MAAA,CAAO,OAAA,CAAQ,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,MAAM,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,GAAG,CAAA,CAAE,MAAM,CAAC;AAAA,IAClE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,CAAC,CAAA;AAC5B,EAAA,IAAI,UAAA,CAAW,WAAW,CAAA,EAAG;AAC7B,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,MAAM,CAAA;AAC3B,EAAA,MAAM,KAAK,UAAA,CAAW,IAAA,CAAK,CAAC,CAAA,KAAM,EAAE,MAAA,KAAW,IAAA,CAAK,IAAA,IAAQ,CAAA,CAAE,MAAM,CAAC,CAAA,KAAM,KAAK,GAAA,CAAI,CAAC,CAAC,CAAC,CAAA;AACvF,EAAA,IAAI,CAAC,EAAA,EAAI;AACP,IAAA,MAAM,IAAI,QAAA;AAAA,MACR,aAAA;AAAA,MACA,CAAA,mBAAA,EAAsB,OAAO,IAAA,CAAK,IAAI,CAAC,CAAA,yCAAA,EAA4C,KAAK,0BAA0B,UAAA,CAAW,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAA,EAAI,EAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAG,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA;AAAA,KACxK;AAAA,EACF;AACF,CAAA;AAOA,IAAM,aAAA,GAAgB,CAAC,MAAA,KAA6B;AAClD,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,MAAM,KAAA,GAAQ,CAAC,CAAA,KAAqB;AAClC,IAAA,IAAI,gBAAA,CAAiB,CAAC,CAAA,EAAG,GAAA,CAAI,KAAK,CAAC,CAAA;AAAA,EACrC,CAAA;AACA,EAAA,MAAM,IAAA,GAAO,CAAC,CAAA,KAAoB;AAChC,IAAA,IAAI,SAAS,CAAA,EAAG,OAAO,CAAA,CAAE,GAAA,CAAI,QAAQ,IAAI,CAAA;AACzC,IAAA,IAAI,QAAQ,CAAA,EAAG,OAAO,CAAA,CAAE,EAAA,CAAG,QAAQ,IAAI,CAAA;AACvC,IAAA,IAAI,KAAA,IAAS,CAAA,EAAG,OAAO,IAAA,CAAK,EAAE,GAAG,CAAA;AACjC,IAAA,IAAI,QAAQ,CAAA,EAAG,OAAO,CAAA,CAAE,EAAA,CAAG,QAAQ,KAAK,CAAA;AACxC,IAAA,IAAI,SAAS,CAAA,EAAG,OAAO,CAAA,CAAE,GAAA,CAAI,QAAQ,KAAK,CAAA;AAC1C,IAAA,IAAI,QAAQ,CAAA,EAAG,OAAO,CAAA,CAAE,EAAA,CAAG,QAAQ,KAAK,CAAA;AACxC,IAAA,IAAI,SAAS,CAAA,EAAG,OAAO,CAAA,CAAE,GAAA,CAAI,QAAQ,KAAK,CAAA;AAC1C,IAAA,IAAI,QAAQ,CAAA,EAAG,OAAO,CAAA,CAAE,EAAA,CAAG,QAAQ,KAAK,CAAA;AACxC,IAAA,IAAI,SAAS,CAAA,EAAG,OAAO,CAAA,CAAE,GAAA,CAAI,QAAQ,KAAK,CAAA;AAC1C,IAAA,IAAI,IAAA,IAAQ,CAAA,IAAK,OAAA,IAAW,CAAA,EAAG;AAC7B,MAAA,MAAM,CAAC,OAAO,MAAM,CAAA,GAAI,QAAQ,CAAA,GAAI,CAAA,CAAE,KAAK,CAAA,CAAE,KAAA;AAC7C,MAAA,GAAA,CAAI,KAAK,KAAK,CAAA;AACd,MAAA,IAAI,MAAM,OAAA,CAAQ,MAAM,CAAA,EAAG,MAAA,CAAO,QAAQ,KAAK,CAAA;AAC/C,MAAA;AAAA,IACF;AACA,IAAA,IAAI,MAAA,IAAU,CAAA,IAAK,OAAA,IAAW,CAAA,EAAG;AAC/B,MAAA,MAAM,CAAC,OAAO,OAAO,CAAA,GAAI,UAAU,CAAA,GAAI,CAAA,CAAE,OAAO,CAAA,CAAE,KAAA;AAClD,MAAA,GAAA,CAAI,KAAK,KAAK,CAAA;AACd,MAAA,OAAO,MAAM,OAAO,CAAA;AAAA,IACtB;AACA,IAAA,IAAI,YAAY,CAAA,EAAG,OAAO,KAAK,GAAA,CAAI,IAAA,CAAK,EAAE,MAAM,CAAA;AAChD,IAAA,IAAI,eAAe,CAAA,EAAG,OAAO,KAAK,GAAA,CAAI,IAAA,CAAK,EAAE,SAAS,CAAA;AACtD,IAAA,IAAI,UAAA,IAAc,GAAG,OAAO,KAAK,IAAI,IAAA,CAAK,CAAA,CAAE,SAAS,KAAK,CAAA;AAC1D,IAAA,IAAI,OAAA,IAAW,GAAG,OAAO,KAAK,IAAI,IAAA,CAAK,CAAA,CAAE,MAAM,KAAK,CAAA;AAAA,EAGtD,CAAA;AACA,EAAA,IAAA,CAAK,MAAM,CAAA;AACX,EAAA,OAAO,GAAA;AACT,CAAA;AAMA,IAAM,mBAAA,GAAsB,CAAC,MAAA,EAAgB,KAAA,EAAe,QAAwB,KAAA,KAAwB;AAC1G,EAAA,MAAM,MAAA,GAASA,WAAAA,CAAW,KAAA,EAAO,MAAM,CAAA;AACvC,EAAA,IAAI,MAAA,KAAW,MAAA,EAAW,MAAM,IAAI,QAAA,CAAS,eAAe,CAAA,eAAA,EAAkB,KAAK,CAAA,KAAA,EAAQ,KAAK,CAAA,CAAA,CAAG,CAAA;AACnG,EAAA,KAAA,MAAW,IAAA,IAAQ,aAAA,CAAc,MAAM,CAAA,EAAG;AACxC,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA;AAC5B,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,GAAG,CAAA;AAC/B,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,KAAA,CAAM,GAAA,GAAM,CAAC,CAAA;AACjC,IAAA,IAAI,CAAC,gBAAA,CAAiB,IAAI,CAAA,IAAK,UAAU,KAAA,IAAS,CAAC,MAAA,CAAO,MAAA,CAAO,KAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAM,CAAA,EAAG;AAC/F,MAAA,MAAM,IAAI,SAAS,aAAA,EAAe,CAAA,CAAA,EAAI,IAAI,CAAA,KAAA,EAAQ,KAAK,CAAA,qBAAA,EAAwB,KAAK,CAAA,EAAA,CAAI,CAAA;AAAA,IAC1F;AAAA,EACF;AACF,CAAA;AAEA,IAAM,qBAAA,GAAwB,CAAC,CAAA,EAAqB,MAAA,KAAiC;AACnF,EAAA,MAAM,MAAA,GAASA,WAAAA,CAAW,CAAA,CAAE,KAAA,EAAO,MAAM,CAAA;AACzC,EAAA,IAAI,MAAA,KAAW,QAAW,MAAM,IAAI,SAAS,aAAA,EAAe,CAAA,eAAA,EAAkB,CAAA,CAAE,KAAK,CAAA,EAAA,CAAI,CAAA;AACzF,EAAA,IAAI,CAAA,CAAE,EAAA,KAAO,QAAA,IAAY,CAAA,CAAE,EAAA,KAAO,QAAA,EAAU,mBAAA,CAAoB,CAAA,CAAE,KAAA,EAAO,CAAA,CAAE,KAAA,EAAO,MAAA,EAAQ,WAAW,CAAA;AACrG,EAAA,MAAM,KAAA,GAAQ,IAAI,GAAA,CAAI,MAAA,CAAO,MAAA,CAAO,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAA;AACtD,EAAA,MAAM,IAAA,GAAO,EAAE,EAAA,KAAO,QAAA,IAAY,EAAE,EAAA,KAAO,YAAA,GAAe,OAAO,IAAA,CAAK,CAAA,CAAE,MAAM,CAAA,GAAI,CAAA,CAAE,OAAO,QAAA,GAAW,MAAA,CAAO,KAAK,CAAA,CAAE,GAAG,IAAI,EAAC;AAC5H,EAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,IAAA,IAAI,CAAC,KAAA,CAAM,GAAA,CAAI,CAAC,GAAG,MAAM,IAAI,QAAA,CAAS,aAAA,EAAe,CAAA,gBAAA,EAAmB,CAAA,CAAE,KAAK,CAAA,CAAA,EAAI,CAAC,CAAA,EAAA,CAAI,CAAA;AAAA,EAC1F;AAGA,EAAA,KAAA,MAAW,CAAA,IAAK,cAAA,CAAe,CAAC,CAAA,EAAG;AACjC,IAAA,MAAM,EAAA,GAAKA,WAAAA,CAAW,CAAA,CAAE,IAAA,EAAM,MAAM,CAAA;AACpC,IAAA,IAAI,EAAA,KAAO,QAAW,MAAM,IAAI,SAAS,aAAA,EAAe,CAAA,eAAA,EAAkB,CAAA,CAAE,IAAI,CAAA,aAAA,CAAe,CAAA;AAC/F,IAAA,IAAI,CAAC,GAAG,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,CAAA,CAAE,KAAK,GAAG,MAAM,IAAI,SAAS,aAAA,EAAe,CAAA,gBAAA,EAAmB,EAAE,IAAI,CAAA,CAAA,EAAI,CAAA,CAAE,KAAK,CAAA,aAAA,CAAe,CAAA;AACrI,IAAA,mBAAA,CAAoB,CAAA,CAAE,KAAA,EAAO,CAAA,CAAE,IAAA,EAAM,QAAQ,WAAW,CAAA;AAAA,EAC1D;AACA,EAAA,IAAA,CAAK,CAAA,CAAE,OAAO,QAAA,IAAY,CAAA,CAAE,OAAO,YAAA,KAAiB,CAAA,CAAE,eAAe,MAAA,EAAW;AAC9E,IAAA,KAAA,MAAW,CAAA,IAAK,CAAC,GAAG,CAAA,CAAE,WAAW,MAAA,EAAQ,GAAG,MAAA,CAAO,IAAA,CAAK,EAAE,UAAA,CAAW,GAAA,IAAO,EAAE,CAAC,CAAA,EAAG;AAChF,MAAA,IAAI,CAAC,KAAA,CAAM,GAAA,CAAI,CAAC,GAAG,MAAM,IAAI,QAAA,CAAS,aAAA,EAAe,CAAA,gBAAA,EAAmB,CAAA,CAAE,KAAK,CAAA,CAAA,EAAI,CAAC,CAAA,gBAAA,CAAkB,CAAA;AAAA,IACxG;AACA,IAAA,oBAAA,CAAqB,CAAA,CAAE,KAAA,EAAO,CAAA,CAAE,UAAA,CAAW,QAAQ,MAAM,CAAA;AACzD,IAAA,IAAI,CAAA,CAAE,UAAA,CAAW,KAAA,KAAU,MAAA,EAAW,mBAAA,CAAoB,CAAA,CAAE,UAAA,CAAW,KAAA,EAAO,CAAA,CAAE,KAAA,EAAO,MAAA,EAAQ,YAAY,CAAA;AAAA,EAC7G;AACF,CAAA;AAiBA,IAAM,cAAA,GAAiB,CAAC,KAAA,EAAe,MAAA,KAAsC;AAC3E,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA;AAClC,EAAA,IAAI,SAAS,MAAA,EAAW;AACtB,IAAA,IAAI,MAAA,CAAO,YAAY,MAAA,EAAQ,MAAM,IAAI,aAAA,CAAc,KAAA,EAAO,CAAA,iBAAA,EAAoB,KAAK,CAAA,wDAAA,CAA0D,CAAA;AACjJ,IAAA,OAAO,EAAC;AAAA,EACV;AACA,EAAA,IAAI,QAAA,IAAY,IAAA,EAAM,OAAO,EAAC;AAC9B,EAAA,IAAI,MAAA,IAAU,MAAM,MAAM,IAAI,cAAc,KAAA,EAAO,CAAA,iBAAA,EAAoB,KAAK,CAAA,mCAAA,CAAqC,CAAA;AACjH,EAAA,IAAI,IAAA,CAAK,SAAS,MAAA,EAAW;AAC3B,IAAA,IAAI,MAAA,CAAO,YAAY,MAAA,EAAQ,MAAM,IAAI,aAAA,CAAc,KAAA,EAAO,CAAA,iBAAA,EAAoB,KAAK,CAAA,8CAAA,CAAgD,CAAA;AACvI,IAAA,OAAO,EAAC;AAAA,EACV;AACA,EAAA,OAAO,IAAA,CAAK,IAAA;AACd,CAAA;AAMA,IAAM,aAAa,CAAC,KAAA,EAAe,CAAA,KACjC,UAAA,CAAW,CAAC,CAAA,GAAI,EAAE,EAAA,EAAI,CAAC,GAAG,KAAK,CAAA,CAAA,EAAI,CAAA,CAAE,KAAK,IAAI,EAAE,MAAA,EAAQ,CAAA,CAAE,EAAA,EAAI,CAAA,EAAE,GAAI,EAAE,EAAA,EAAI,CAAC,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,CAAA,CAAE,KAAK,CAAA,CAAA,EAAI,EAAE,QAAQ,CAAA,CAAE,EAAA,EAAI,CAAA,EAAE;AAEtH,IAAM,YAAA,GAAe,CAAoC,IAAA,EAAyB,MAAA,KAA2C;AAC3H,EAAA,MAAM,MAAyB,EAAC;AAChC,EAAA,KAAA,MAAW,CAAC,CAAA,EAAG,CAAC,KAAK,MAAA,CAAO,OAAA,CAAQ,IAAI,CAAA,EAAG;AACzC,IAAA,IAAI,CAAC,QAAA,CAAS,CAAC,CAAA,EAAG;AAChB,MAAA,GAAA,CAAI,CAAC,CAAA,GAAI,CAAA;AACT,MAAA;AAAA,IACF;AACA,IAAA,IAAI,KAAA,GAAgB,EAAE,OAAA,CAAQ,KAAA;AAC9B,IAAA,KAAA,MAAW,KAAK,cAAA,CAAe,CAAA,CAAE,OAAA,CAAQ,IAAA,EAAM,MAAM,CAAA,EAAG;AACtD,MAAA,KAAA,GAAQ,EAAE,GAAA,EAAK,CAAC,KAAA,EAAO,UAAA,CAAW,EAAE,OAAA,CAAQ,IAAA,EAAM,CAAC,CAAC,CAAA,EAAE;AAAA,IACxD;AAEA,IAAA,GAAA,CAAI,CAAC,IAAI,EAAE,OAAA,EAAS,EAAE,GAAG,CAAA,CAAE,OAAA,EAAS,KAAA,EAAM,EAAE;AAAA,EAC9C;AACA,EAAA,OAAO,GAAA;AACT,CAAA;AAOA,IAAM,SAAA,GAAY,CAAC,KAAA,EAAe,EAAA,EAAoC,MAAA,KAA+C;AACnH,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA;AAClC,EAAA,IAAI,SAAS,MAAA,EAAW;AACtB,IAAA,IAAI,MAAA,CAAO,YAAY,MAAA,EAAQ,MAAM,IAAI,aAAA,CAAc,KAAA,EAAO,CAAA,WAAA,EAAc,KAAK,CAAA,kDAAA,CAAoD,CAAA;AACrI,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,IAAI,QAAA,IAAY,MAAM,OAAO,MAAA;AAC7B,EAAA,IAAI,MAAA,IAAU,MAAM,MAAM,IAAI,cAAc,KAAA,EAAO,CAAA,WAAA,EAAc,KAAK,CAAA,6BAAA,CAA+B,CAAA;AACrG,EAAA,MAAM,QAAA,GAAW,OAAO,QAAA,GAAW,IAAA,CAAK,SAAS,EAAA,KAAO,QAAA,GAAW,IAAA,CAAK,MAAA,GAAS,IAAA,CAAK,MAAA;AACtF,EAAA,IAAI,IAAA,CAAK,KAAA,KAAU,MAAA,IAAa,QAAA,KAAa,MAAA,EAAW;AACtD,IAAA,IAAI,MAAA,CAAO,OAAA,KAAY,MAAA,EAAQ,MAAM,IAAI,aAAA,CAAc,KAAA,EAAO,CAAA,CAAA,EAAI,EAAE,CAAA,MAAA,EAAS,KAAK,CAAA,iDAAA,CAAmD,CAAA;AACrI,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,OAAO,EAAE,IAAA,EAAM,KAAA,EAAO,CAAC,GAAI,IAAA,CAAK,KAAA,IAAS,EAAC,EAAI,GAAI,QAAA,IAAY,EAAG,CAAA,EAAE;AACrE,CAAA;AASA,IAAM,gBAAA,GAAmB,CACvB,KAAA,EACA,SAAA,EACA,aACA,MAAA,KACiG;AACjG,EAAA,IAAI,MAAA,GAAiD,YAAA,CAAa,SAAA,EAAW,MAAM,CAAA;AACnF,EAAA,IAAI,QAAA,GACF,WAAA,KAAgB,MAAA,IAAa,WAAA,CAAY,QAAQ,MAAA,GAAY,WAAA,GAAc,EAAE,GAAG,aAAa,GAAA,EAAK,YAAA,CAAa,WAAA,CAAY,GAAA,EAAK,MAAM,CAAA,EAAE;AAE1I,EAAA,MAAM,IAAA,GAAO,SAAA,CAAU,KAAA,EAAO,QAAA,EAAU,MAAM,CAAA;AAC9C,EAAA,IAAI,IAAA,KAAS,MAAA,EAAW,OAAO,EAAE,QAAQ,QAAA,EAAS;AAElD,EAAA,KAAA,MAAW,CAAA,IAAK,KAAK,KAAA,EAAO;AAa1B,IAAA,IAAI,OAAA,IAAW,CAAA,IAAK,UAAA,CAAW,CAAC,CAAA,EAAG;AACjC,MAAA,MAAM,IAAI,aAAA;AAAA,QACR,KAAA;AAAA,QACA,mBAAmB,KAAK,CAAA,kBAAA,EAAqB,EAAE,KAAK,CAAA,MAAA,EAAS,EAAE,EAAE,CAAA,iKAAA;AAAA,OACnE;AAAA,IACF;AAGA,IAAA,MAAA,GAAS,EAAE,GAAG,MAAA,EAAQ,CAAC,SAAS,CAAA,GAAI,CAAA,CAAE,GAAA,GAAM,CAAA,CAAE,KAAK,GAAG,EAAE,MAAA,EAAQ,CAAA,CAAE,IAAG,EAAE;AAAA,EACzE;AAEA,EAAA,IAAI,QAAA,EAAU,QAAQ,MAAA,EAAW;AAC/B,IAAA,IAAI,KAAK,IAAA,CAAK,KAAA,KAAU,UAAa,IAAA,CAAK,IAAA,CAAK,WAAW,MAAA,EAAW;AACnE,MAAA,MAAM,IAAI,aAAA,CAAc,KAAA,EAAO,CAAA,eAAA,EAAkB,KAAK,CAAA,6DAAA,CAA+D,CAAA;AAAA,IACvH;AACA,IAAA,KAAA,MAAW,CAAA,IAAK,CAAC,GAAI,IAAA,CAAK,KAAK,KAAA,IAAS,EAAC,EAAI,GAAI,IAAA,CAAK,IAAA,CAAK,MAAA,IAAU,EAAG,CAAA,EAAG;AACzE,MAAA,IAAI,SAAS,CAAA,EAAG;AACd,QAAA,QAAA,GAAW,EAAE,GAAG,QAAA,EAAU,KAAK,EAAE,GAAI,SAAS,GAAA,IAAO,IAAK,CAAC,CAAA,CAAE,GAAG,GAAG,EAAE,QAAQ,CAAA,CAAE,EAAA,IAAK,EAAE;AAAA,MACxF,WAAW,CAAC,QAAA,CAAS,OAAO,QAAA,CAAS,CAAA,CAAE,KAAK,CAAA,EAAG;AAC7C,QAAA,MAAM,QAAA,GAAW,UAAA,CAAW,KAAA,EAAO,CAAC,CAAA;AACpC,QAAA,QAAA,GAAW,EAAE,GAAG,QAAA,EAAU,KAAA,EAAO,SAAS,KAAA,KAAU,MAAA,GAAY,QAAA,GAAW,EAAE,KAAK,CAAC,QAAA,CAAS,KAAA,EAAO,QAAQ,GAAE,EAAE;AAAA,MACjH;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,QAAQ,QAAA,EAAS;AAC5B,CAAA;AAEA,IAAM,aAAA,GAAgB,CAAC,CAAA,EAAiB,MAAA,KAA0C;AAChF,EAAA,IAAI,CAAA,CAAE,OAAO,QAAA,EAAU;AACrB,IAAA,MAAM,EAAE,MAAA,EAAQ,QAAA,EAAS,GAAI,gBAAA,CAAiB,CAAA,CAAE,KAAA,EAAO,CAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,UAAA,EAAY,MAAM,CAAA;AACrF,IAAA,OAAO,EAAE,EAAA,EAAI,QAAA,EAAU,KAAA,EAAO,EAAE,KAAA,EAAO,MAAA,EAAQ,GAAI,QAAA,KAAa,SAAY,EAAC,GAAI,EAAE,UAAA,EAAY,UAAS,EAAG;AAAA,EAC7G;AACA,EAAA,IAAI,CAAA,CAAE,OAAO,YAAA,EAAc;AACzB,IAAA,MAAM,EAAE,MAAA,EAAQ,QAAA,EAAS,GAAI,gBAAA,CAAiB,CAAA,CAAE,KAAA,EAAO,CAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,UAAA,EAAY,MAAM,CAAA;AACrF,IAAA,OAAO,EAAE,EAAA,EAAI,YAAA,EAAc,OAAO,CAAA,CAAE,KAAA,EAAO,OAAO,CAAA,CAAE,KAAA,EAAO,MAAA,EAAQ,GAAI,aAAa,MAAA,GAAY,KAAK,EAAE,UAAA,EAAY,UAAS,EAAG;AAAA,EACjI;AACA,EAAA,IAAI,CAAA,CAAE,OAAO,QAAA,EAAU;AACrB,IAAA,IAAI,GAAA,GAAqC,YAAA,CAAa,CAAA,CAAE,GAAA,EAAK,MAAM,CAAA;AACnE,IAAA,IAAIC,SAAgB,CAAA,CAAE,KAAA;AACtB,IAAA,MAAMC,KAAAA,GAAO,SAAA,CAAU,CAAA,CAAE,KAAA,EAAO,UAAU,MAAM,CAAA;AAChD,IAAA,IAAIA,UAAS,MAAA,EAAW;AACtB,MAAA,KAAA,MAAW,CAAA,IAAKA,MAAK,KAAA,EAAO;AAE1B,QAAA,IAAI,KAAA,IAAS,CAAA,EAAG,GAAA,GAAM,EAAE,GAAG,GAAA,EAAK,CAAC,CAAA,CAAE,GAAG,GAAG,EAAE,MAAA,EAAQ,CAAA,CAAE,IAAG,EAAE;AAAA,aAIrDD,MAAAA,GAAQ,EAAE,GAAA,EAAK,CAACA,MAAAA,EAAO,UAAA,CAAW,CAAA,CAAE,KAAA,EAAO,CAAC,CAAC,CAAA,EAAE;AAAA,MACtD;AAAA,IACF;AACA,IAAA,OAAO,EAAE,IAAI,QAAA,EAAU,KAAA,EAAO,EAAE,KAAA,EAAO,GAAA,EAAK,OAAAA,MAAAA,EAAM;AAAA,EACpD;AAEA,EAAA,IAAI,QAAgB,CAAA,CAAE,KAAA;AACtB,EAAA,MAAM,IAAA,GAAO,SAAA,CAAU,CAAA,CAAE,KAAA,EAAO,UAAU,MAAM,CAAA;AAChD,EAAA,IAAI,SAAS,MAAA,EAAW;AACtB,IAAA,KAAA,MAAW,CAAA,IAAK,KAAK,KAAA,EAAO;AAC1B,MAAA,IAAI,OAAA,IAAW,CAAA,EAAG,KAAA,GAAQ,EAAE,GAAA,EAAK,CAAC,KAAA,EAAO,UAAA,CAAW,CAAA,CAAE,KAAA,EAAO,CAAC,CAAC,CAAA,EAAE;AAAA,IACnE;AAAA,EACF;AACA,EAAA,OAAO,EAAE,EAAA,EAAI,QAAA,EAAU,KAAA,EAAO,CAAA,CAAE,OAAO,KAAA,EAAM;AAC/C,CAAA;AAYA,IAAM,SAAS,OAA2B;AAAA,EACxC,aAAA,sBAAmB,GAAA,EAAI;AAAA,EACvB,QAAA,sBAAc,GAAA,EAAI;AAAA,EAClB,YAAY,EAAC;AAAA,EACb,YAAA,EAAc,EAAE,KAAA,EAAO,CAAA;AACzB,CAAA,CAAA;AAKA,IAAM,iBAAA,GAAoB,CAAC,MAAA,EAAgB,QAAA,KAAwC;AACjF,EAAA,KAAA,MAAW,QAAQ,aAAA,CAAc,MAAM,GAAG,QAAA,CAAS,GAAA,CAAI,MAAM,IAAI,CAAA;AACnE,CAAA;AAKA,IAAM,YAAA,GAAe,CAAC,CAAA,EAAkB,GAAA,KAAoC;AAC1E,EAAA,IAAI,QAAA,CAAS,CAAC,CAAA,EAAG;AACf,IAAA,iBAAA,CAAkB,CAAA,CAAE,OAAA,CAAQ,KAAA,EAAO,GAAA,CAAI,QAAQ,CAAA;AAC/C,IAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,CAAA,CAAE,OAAA,CAAQ,OAAO,GAAG,CAAA;AAChD,IAAA,OAAO,CAAA,QAAA,EAAW,EAAE,OAAA,CAAQ,KAAK,SAAS,CAAA,CAAE,OAAA,CAAQ,IAAI,CAAA,OAAA,EAAU,KAAK,CAAA,CAAA,CAAA;AAAA,EACzE;AACA,EAAA,OAAO,mBAAA,CAAoB,GAAG,GAAG,CAAA;AACnC,CAAA;AAIA,IAAM,qBAAqB,CAAC,KAAA,EAAe,MAAA,EAAgB,CAAA,EAAkB,KAAyB,MAAA,KAAmC;AACvI,EAAA,MAAM,MAAA,GAAS,IAAI,UAAA,CAAW,MAAA;AAC9B,EAAA,MAAM,GAAA,GAAM,YAAA,CAAa,CAAA,EAAG,GAAG,CAAA;AAC/B,EAAA,MAAM,IAAA,GAAOD,WAAAA,CAAW,KAAA,EAAO,MAAM,CAAA,EAAG,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAM,GAAG,cAAA,KAAmB,MAAA;AAClG,EAAA,IAAI,QAAQ,OAAO,CAAA,KAAM,YAAY,CAAA,KAAM,IAAA,IAAQ,cAAc,CAAA,EAAG;AAClE,IAAA,MAAM,IAAA,GAAO,GAAA,CAAI,UAAA,CAAW,MAAM,CAAA;AAClC,IAAA,IAAI,IAAA,KAAS,MAAA,EAAW,GAAA,CAAI,UAAA,CAAW,MAAM,IAAI,EAAE,GAAG,IAAA,EAAM,MAAA,EAAQ,MAAA,EAAO;AAAA,EAC7E;AACA,EAAA,OAAO,GAAA;AACT,CAAA;AAEA,IAAM,eAAA,GAAkB,CAAC,CAAA,EAAuD,GAAA,EAAyB,MAAA,KAAmC;AAC1I,EAAA,MAAM,IAAI,CAAA,CAAE,UAAA;AACZ,EAAA,IAAI,CAAA,KAAM,QAAW,OAAO,EAAA;AAC5B,EAAA,IAAI,CAAA,CAAE,QAAQ,MAAA,EAAW,OAAO,iBAAiB,CAAA,CAAE,MAAA,CAAO,IAAA,CAAK,IAAI,CAAC,CAAA,YAAA,CAAA;AACpE,EAAA,MAAM,IAAA,GAAO,OAAO,OAAA,CAAQ,CAAA,CAAE,GAAG,CAAA,CAAE,GAAA,CAAI,CAAC,CAAC,GAAA,EAAK,CAAC,MAAM,CAAA,EAAG,GAAG,CAAA,GAAA,EAAM,kBAAA,CAAmB,CAAA,CAAE,KAAA,EAAO,KAAK,CAAA,EAAG,GAAA,EAAK,MAAM,CAAC,CAAA,CAAE,CAAA;AACnH,EAAA,IAAI,KAAA,GAAQ,EAAA;AACZ,EAAA,IAAI,CAAA,CAAE,UAAU,MAAA,EAAW;AACzB,IAAA,iBAAA,CAAkB,CAAA,CAAE,KAAA,EAAO,GAAA,CAAI,QAAQ,CAAA;AACvC,IAAA,KAAA,GAAQ,CAAA,OAAA,EAAU,aAAA,CAAc,CAAA,CAAE,KAAA,EAAO,GAAG,CAAC,CAAA,CAAA;AAAA,EAC/C;AACA,EAAA,OAAO,CAAA,cAAA,EAAiB,CAAA,CAAE,MAAA,CAAO,IAAA,CAAK,IAAI,CAAC,CAAA,gBAAA,EAAmB,IAAA,CAAK,IAAA,CAAK,IAAI,CAAC,CAAA,EAAG,KAAK,CAAA,CAAA;AACvF,CAAA;AAIA,IAAM,SAAA,GAAoC;AAAA,EACxC,MAAA,EAAQ,SAAA;AAAA,EACR,OAAA,EAAS,SAAA;AAAA,EACT,IAAA,EAAM,MAAA;AAAA,EACN,SAAA,EAAW,aAAA;AAAA,EACX,IAAA,EAAM;AACR,CAAA;AAGA,IAAM,eAAA,GAAkB,CAAC,CAAA,EAAqB,MAAA,KAAqC;AACjF,EAAA,MAAM,MAAM,MAAA,EAAO;AACnB,EAAA,IAAI,CAAA,CAAE,OAAO,QAAA,EAAU;AACrB,IAAA,MAAM,OAAA,GAAU,MAAA,CAAO,OAAA,CAAQ,CAAA,CAAE,MAAM,CAAA;AACvC,IAAA,MAAM,OAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;AACnC,IAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG,CAAC,CAAA,KAAM,kBAAA,CAAmB,EAAE,KAAA,EAAO,CAAA,EAAG,CAAA,EAAG,GAAA,EAAK,MAAM,CAAC,CAAA;AACnF,IAAA,OAAO,EAAE,GAAA,EAAK,CAAA,YAAA,EAAe,CAAA,CAAE,KAAK,KAAK,IAAA,CAAK,IAAA,CAAK,IAAI,CAAC,CAAA,UAAA,EAAa,IAAA,CAAK,KAAK,IAAI,CAAC,CAAA,CAAA,EAAI,eAAA,CAAgB,CAAA,EAAG,GAAA,EAAK,MAAM,CAAC,CAAA,YAAA,CAAA,EAAgB,KAAA,EAAO,GAAA,CAAI,UAAA,EAAW;AAAA,EAC/J;AACA,EAAA,IAAI,CAAA,CAAE,OAAO,YAAA,EAAc;AACzB,IAAA,MAAM,MAAA,GAASA,WAAAA,CAAW,CAAA,CAAE,KAAA,EAAO,MAAM,CAAA;AACzC,IAAA,MAAM,OAAA,GAAU,MAAA,CAAO,OAAA,CAAQ,CAAA,CAAE,MAAM,CAAA;AACvC,IAAA,MAAM,OAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;AACnC,IAAA,MAAM,QAAQ,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,GAAA,EAAK,CAAC,CAAA,KAAM;AACtC,MAAA,IAAI,SAAA,CAAU,CAAC,CAAA,EAAG;AAChB,QAAA,MAAM,EAAA,GAAK,MAAA,EAAQ,MAAA,CAAO,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,GAAG,CAAA,EAAG,cAAA,IAAkB,QAAA;AACzE,QAAA,IAAI,OAAO,MAAA,EAAQ,OAAO,gBAAgB,YAAA,CAAa,CAAA,CAAE,KAAK,CAAC,CAAA,CAAA,CAAA;AAC/D,QAAA,MAAM,IAAA,GAAO,UAAU,EAAE,CAAA;AACzB,QAAA,MAAM,GAAA,GAAM,CAAA,cAAA,EAAiB,YAAA,CAAa,CAAA,CAAE,KAAK,CAAC,CAAA,CAAA,CAAA;AAClD,QAAA,OAAO,SAAS,MAAA,GAAY,GAAA,GAAM,CAAA,EAAG,GAAG,KAAK,IAAI,CAAA,CAAA;AAAA,MACnD;AACA,MAAA,OAAO,YAAA,CAAa,GAAG,GAAG,CAAA;AAAA,IAC5B,CAAC,CAAA;AACD,IAAA,GAAA,CAAI,aAAa,KAAA,IAAS,CAAA;AAC1B,IAAA,GAAA,CAAI,UAAA,CAAW,IAAA,CAAK,EAAE,GAAA,EAAK,CAAA,CAAE,KAAA,CAAM,QAAA,EAAU,IAAA,EAAM,SAAA,EAAW,IAAA,EAAM,MAAA,EAAQ,CAAA;AAC5E,IAAA,MAAM,MAAA,GAAS,CAAA,sBAAA,EAAyB,GAAA,CAAI,YAAA,CAAa,KAAK,CAAA,gBAAA,CAAA;AAC9D,IAAA,OAAO;AAAA,MACL,GAAA,EAAK,eAAe,CAAA,CAAE,KAAK,KAAK,IAAA,CAAK,IAAA,CAAK,IAAI,CAAC,CAAA,SAAA,EAAY,MAAM,IAAA,CAAK,IAAI,CAAC,CAAA,MAAA,EAAS,MAAM,GAAG,eAAA,CAAgB,CAAA,EAAG,GAAA,EAAK,MAAM,CAAC,CAAA,YAAA,CAAA;AAAA,MAC5H,OAAO,GAAA,CAAI;AAAA,KACb;AAAA,EACF;AACA,EAAA,IAAI,CAAA,CAAE,OAAO,QAAA,EAAU;AACrB,IAAA,MAAM,IAAA,GAAO,OAAO,OAAA,CAAQ,CAAA,CAAE,GAAG,CAAA,CAAE,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG,CAAC,MAAM,CAAA,EAAG,CAAC,CAAA,GAAA,EAAM,kBAAA,CAAmB,CAAA,CAAE,KAAA,EAAO,GAAG,CAAA,EAAG,GAAA,EAAK,MAAM,CAAC,CAAA,CAAE,CAAA;AAC7G,IAAA,iBAAA,CAAkB,CAAA,CAAE,KAAA,EAAO,GAAA,CAAI,QAAQ,CAAA;AACvC,IAAA,MAAMC,MAAAA,GAAQ,aAAA,CAAc,CAAA,CAAE,KAAA,EAAO,GAAG,CAAA;AACxC,IAAA,OAAO,EAAE,GAAA,EAAK,CAAA,OAAA,EAAU,CAAA,CAAE,KAAK,CAAA,KAAA,EAAQ,IAAA,CAAK,IAAA,CAAK,IAAI,CAAC,CAAA,OAAA,EAAUA,MAAK,CAAA,YAAA,CAAA,EAAgB,KAAA,EAAO,IAAI,UAAA,EAAW;AAAA,EAC7G;AACA,EAAA,iBAAA,CAAkB,CAAA,CAAE,KAAA,EAAO,GAAA,CAAI,QAAQ,CAAA;AACvC,EAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,CAAA,CAAE,KAAA,EAAO,GAAG,CAAA;AACxC,EAAA,OAAO,EAAE,GAAA,EAAK,CAAA,YAAA,EAAe,CAAA,CAAE,KAAK,UAAU,KAAK,CAAA,YAAA,CAAA,EAAgB,KAAA,EAAO,GAAA,CAAI,UAAA,EAAW;AAC3F,CAAA;AAKA,IAAM,KAAA,GAAyH;AAAA,EAC7H,MAAA,EAAQ,CAAC,CAAA,EAAG,OAAA,KAAY;AACtB,IAAA,MAAM,KAAA,GAAQ,QAAQ,CAAA,CAAE,GAAG,MAAM,MAAA,IAAa,OAAA,CAAQ,CAAA,CAAE,GAAG,CAAA,KAAM,EAAA;AACjE,IAAA,OAAO,QACH,EAAE,EAAA,EAAI,UAAU,KAAA,EAAO,CAAA,CAAE,OAAO,GAAA,EAAK,CAAA,CAAE,SAAS,KAAA,EAAO,EAAE,IAAI,CAAC,CAAA,EAAG,EAAE,KAAK,CAAA,CAAA,EAAI,EAAE,GAAG,CAAA,CAAA,EAAI,EAAE,QAAA,EAAU,CAAA,CAAE,KAAK,CAAA,IAAI,GAC5G,EAAE,IAAI,QAAA,EAAU,KAAA,EAAO,EAAE,KAAA,EAAO,MAAA,EAAQ,EAAE,GAAG,CAAA,CAAE,SAAS,GAAG,CAAA,CAAE,QAAO,EAAE;AAAA,EAC5E;AACF,CAAA;AAEA,IAAM,eAAA,GAAkB,CAAC,CAAA,EAAa,OAAA,KAAmD;AACvF,EAAA,MAAM,OAAA,GAAU,KAAA,CAAM,CAAA,CAAE,EAAE,CAAA;AAC1B,EAAA,OAAO,OAAA,KAAY,MAAA,GAAa,CAAA,GAAqB,OAAA,CAAQ,GAAG,OAAO,CAAA;AACzE,CAAA;AAiBO,IAAM,aAAA,GAAgB,OAAO,MAAA,EAAwB,GAAA,EAAyB,IAAA,KAAkD;AACrI,EAAA,MAAM,MAAA,GAAS,wBAAA,CAAyB,KAAA,CAAM,GAAG,CAAA;AACjD,EAAA,MAAM,UAAU,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,GAAI,MAAA,GAAS,CAAC,MAAM,CAAA;AACxD,EAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,GAAA,CAAI,CAAC,KAAA,KAAU;AACtC,IAAA,MAAM,IAAA,GAAO,eAAA,CAAgB,KAAA,EAAO,IAAA,CAAK,OAAO,CAAA;AAGhD,IAAA,MAAM,OAAA,GAAU,mBAAA,CAAoB,IAAI,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM,IAAA,CAAK,OAAA,CAAQ,CAAC,CAAA,KAAM,MAAS,CAAA;AACrF,IAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtB,MAAA,MAAM,IAAI,SAAS,iBAAA,EAAmB,CAAA,6BAAA,EAAgC,QAAQ,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA,EAAK;AAAA,QAC3F,QAAA,EAAU,sBAAA,CAAuB,MAAA,EAAQ,IAAA,CAAK,MAAM;AAAA,OACrD,CAAA;AAAA,IACH;AACA,IAAA,MAAM,CAAA,GAAI,aAAA,CAAc,IAAA,EAAM,IAAA,CAAK,MAAM,CAAA;AACzC,IAAA,qBAAA,CAAsB,CAAA,EAAG,KAAK,MAAM,CAAA;AACpC,IAAA,MAAM,SAAA,GAAY,eAAA,CAAgB,CAAA,EAAG,IAAA,CAAK,MAAM,CAAA;AAGhD,IAAA,YAAA,CAAa,EAAE,UAAA,EAAY,SAAA,CAAU,KAAA,EAAM,EAAG,KAAK,KAAK,CAAA;AACxD,IAAA,OAAO,EAAE,GAAG,SAAA,EAAW,KAAA,EAAO,CAAA,CAAE,KAAA,EAAO,EAAA,EAAK,CAAA,CAAE,EAAA,KAAO,YAAA,GAAe,QAAA,GAAW,CAAA,CAAE,EAAA,EAAyB;AAAA,EAC5G,CAAC,CAAA;AAED,EAAA,MAAM,MAAA,GAAS,OAAO,CAAA,KAA0C;AAC9D,IAAA,MAAM,UAAyB,EAAC;AAChC,IAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,MAAA,MAAM,MAAA,GAAS,MAAM,aAAA,CAAc,CAAA,CAAE,OAAO,IAAA,CAAK,OAAA,EAAS,KAAK,KAAK,CAAA;AAIpE,MAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,GAAA,CAAI,CAAC,OAAO,CAAA,KAAM;AACrC,QAAA,IAAI,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,EAAG,WAAW,MAAA,EAAQ,OAAO,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA,GAAW,IAAA,CAAK,SAAA,CAAU,KAAK,CAAA,GAAI,KAAA;AAChH,QAAA,IAAI,EAAE,KAAA,CAAM,CAAC,CAAA,EAAG,IAAA,KAAS,QAAQ,OAAO,KAAA;AACxC,QAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACzB,UAAA,MAAM,IAAI,QAAA,CAAS,iBAAA,EAAmB,CAAA,CAAA,EAAI,CAAA,CAAE,MAAM,CAAC,CAAA,EAAG,GAAA,IAAO,EAAE,CAAA,6DAAA,CAA+D,CAAA;AAAA,QAChI;AACA,QAAA,OAAO,IAAA,CAAK,UAAU,KAAK,CAAA;AAAA,MAC7B,CAAC,CAAA;AACD,MAAA,MAAM,MAAM,MAAM,CAAA,CAAE,KAAA,CAAM,CAAA,CAAE,KAAK,KAAkB,CAAA;AACnD,MAAA,OAAA,CAAQ,IAAA,CAAK,EAAE,KAAA,EAAO,CAAA,CAAE,KAAA,EAAO,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,IAAA,EAAM,GAAA,CAAI,IAAA,EAAe,CAAA;AAAA,IACpE;AACA,IAAA,OAAO,OAAA;AAAA,EACT,CAAA;AAGA,EAAA,IAAI,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG,OAAO,OAAO,MAAM,CAAA;AAC/C,EAAA,IAAI,MAAA,CAAO,gBAAgB,MAAA,EAAW;AACpC,IAAA,MAAM,IAAI,QAAA,CAAS,iBAAA,EAAmB,iDAAiD,CAAA;AAAA,EACzF;AACA,EAAA,OAAO,OAAO,WAAA,CAAY,CAAC,EAAA,KAAO,MAAA,CAAO,EAAE,CAAC,CAAA;AAC9C;AAIO,IAAM,eAAA,GAAkB,OAAO,MAAA,EAAwB,GAAA,EAAyB,UACpF,MAAM,aAAA,CAAc,MAAA,EAAQ,GAAA,EAAK,IAAI,CAAA,EAAG,OAAA,CAAQ,CAAC,CAAA,KAAM,EAAE,IAAI;ACxczD,IAAM,eAAA,GAAkB,CAAC,MAAA,EAAgC,MAAA,KAAiD;AAC/G,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,WAAA,GAAc,CAAC,KAAA,KAAA,CAClB,MAAA,EAAQ,QAAA,CAAS,IAAA,CAAK,CAAC,MAAA,KAAW,MAAA,CAAO,IAAA,KAAS,KAAK,CAAA,EAAG,SAAA,IAAa,EAAC,EACtE,MAAA,CAAO,CAAC,QAAA,KAAa,QAAA,CAAS,IAAA,KAAS,WAAW,CAAA,CAClD,GAAA,CAAI,CAAC,QAAA,KAAa,QAAA,CAAS,MAAM,CAAA;AACtC,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,IAAA,IAAI,KAAA,CAAM,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG;AAC7B,IAAA,OAAA,CAAQ,GAAA,CAAI,MAAM,KAAK,CAAA;AACvB,IAAA,IAAI,KAAA,CAAM,OAAO,QAAA,EAAU;AAC3B,IAAA,MAAM,OAAA,GAAU,CAAC,KAAA,CAAM,KAAK,CAAA;AAC5B,IAAA,KAAA,IAAS,IAAA,GAAO,QAAQ,GAAA,EAAI,EAAG,SAAS,MAAA,EAAW,IAAA,GAAO,OAAA,CAAQ,GAAA,EAAI,EAAG;AACvE,MAAA,KAAA,MAAW,KAAA,IAAS,WAAA,CAAY,IAAI,CAAA,EAAG;AACrC,QAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,KAAK,CAAA,EAAG;AACxB,QAAA,OAAA,CAAQ,IAAI,KAAK,CAAA;AACjB,QAAA,OAAA,CAAQ,KAAK,KAAK,CAAA;AAAA,MACpB;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,OAAO,CAAA;AACpB;AA6FA,IAAM,YAAA,GAAe,CAAC,MAAA,EAAoC,QAAA,KAAwC;AAChG,EAAA,IAAI,MAAA,KAAW,MAAA,EAAW,OAAO,EAAC;AAClC,EAAA,IAAI,aAAa,MAAA,IAAa,QAAA,CAAS,MAAA,KAAW,CAAA,SAAU,MAAA,CAAO,QAAA;AACnE,EAAA,OAAO,MAAA,CAAO,SAAS,MAAA,CAAO,CAAA,CAAA,KAAK,SAAS,QAAA,CAAS,CAAA,CAAE,IAAI,CAAC,CAAA;AAC9D,CAAA;AAOA,IAAM,aAAA,GAAgB,CAAC,MAAA,EAAqB,KAAA,EAAe,EAAA,KAAwB;AACjF,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA;AAClC,EAAA,IAAI,IAAA,KAAS,MAAA,EAAW,OAAO,MAAA,CAAO,OAAA,KAAY,OAAA;AAClD,EAAA,IAAI,QAAA,IAAY,MAAM,OAAO,IAAA;AAC7B,EAAA,IAAI,MAAA,IAAU,MAAM,OAAO,KAAA;AAC3B,EAAA,IAAI,KAAK,KAAA,KAAU,MAAA,IAAa,MAAA,CAAO,OAAA,KAAY,SAAS,OAAO,IAAA;AAEnE,EAAA,IAAI,OAAO,QAAA,IAAY,EAAA,KAAO,YAAA,EAAc,OAAO,KAAK,MAAA,KAAW,MAAA;AACnE,EAAA,IAAI,EAAA,KAAO,QAAA,EAAU,OAAO,IAAA,CAAK,MAAA,KAAW,MAAA;AAC5C,EAAA,IAAI,EAAA,KAAO,QAAA,EAAU,OAAO,IAAA,CAAK,MAAA,KAAW,MAAA;AAE5C,EAAA,IAAI,OAAO,QAAA,EAAU,OAAO,KAAK,MAAA,KAAW,MAAA,IAAa,KAAK,MAAA,KAAW,MAAA;AACzE,EAAA,OAAO,KAAA;AACT,CAAA;AAIA,IAAM,aAAA,GAAgB,CAAC,GAAA,KAAyB;AAC9C,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,MAAM,IAAA,GAAO,CAAC,CAAA,KAAmB;AAC/B,IAAA,KAAA,MAAW,GAAA,IAAO,EAAE,IAAA,EAAM;AACxB,MAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,EAAU,GAAA,CAAI,KAAK,GAAG,CAAA;AAAA,WACpC,IAAA,CAAK,IAAI,KAAK,CAAA;AAAA,IACrB;AAAA,EACF,CAAA;AACA,EAAA,IAAA,CAAK,GAAG,CAAA;AACR,EAAA,OAAO,GAAA;AACT,CAAA;AAEA,IAAM,YAAA,GAAe,CAAC,MAAA,EAAqB,KAAA,KAA+B;AACxE,EAAA,IAAI,KAAA,CAAM,IAAA,KAAS,IAAA,EAAM,OAAO,cAAc,KAAA,CAAM,GAAG,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,KAAM,YAAA,CAAa,MAAA,EAAQ,CAAC,CAAC,CAAA;AAC7F,EAAA,IAAI,MAAM,IAAA,KAAS,UAAA,EAAY,OAAO,cAAA,CAAe,MAAM,QAAQ,CAAA,CAAE,KAAA,CAAM,CAAC,MAAM,aAAA,CAAc,MAAA,EAAQ,EAAE,KAAA,EAAO,CAAA,CAAE,EAAE,CAAC,CAAA;AACtH,EAAA,OAAO,KAAA;AACT,CAAA;AAEA,IAAM,gBAAA,GAAmB,OAAO,MAAA,EAAqB,MAAA,KAA0D;AAC7G,EAAA,IAAI,MAAA,CAAO,KAAA,CAAM,OAAA,KAAY,MAAA,SAAkB,EAAC;AAChD,EAAA,MAAM,MAAA,GAAS,OAAO,SAAA,EAAU;AAChC,EAAA,MAAM,OAAA,GAAU,MAAA,KAAW,MAAA,GAAY,wBAAA,CAAyB,MAAM,CAAA,GAAI,MAAA;AAC1E,EAAA,MAAM,IAAA,GAAO,MAAM,MAAA,CAAO,KAAA,CAAM,OAAA,EAAQ;AACxC,EAAA,OAAO,KACJ,MAAA,CAAO,CAAC,EAAE,GAAA,EAAK,OAAM,KAAA,CAAO,KAAA,CAAM,IAAA,KAAS,IAAA,IAAQ,MAAM,IAAA,KAAS,UAAA,KAAe,CAAC,GAAA,CAAI,WAAW,MAAM,CAAC,CAAA,CACxG,MAAA,CAAO,CAAC,EAAE,KAAA,EAAM,KAAM,MAAA,KAAW,UAAa,YAAA,CAAa,MAAA,EAAQ,KAAK,CAAC,EACzE,GAAA,CAAI,CAAC,EAAE,GAAA,EAAK,OAAM,MAAO;AAAA,IACxB,WAAA,EAAa,GAAA;AAAA,IACb,IAAA,EAAM,KAAA,CAAM,IAAA,KAAS,UAAA,GAAc,UAAA,GAAwB,OAAA;AAAA,IAC3D,SAAA,EAAW,MAAM,SAAA,KAAc,IAAA;AAAA,IAC/B,WAAA,EAAa,YAAA,CAAa,KAAA,EAAO,OAAO,CAAA;AAAA,IACxC,GAAI,MAAM,MAAA,KAAW,MAAA,GAAY,EAAE,MAAA,EAAQ,KAAA,CAAM,MAAA,EAAO,GAAI,EAAC;AAAA,IAC7D,WAAW,KAAA,CAAM,SAAA;AAAA,IACjB,GAAI,MAAM,UAAA,KAAe,MAAA,GAAY,EAAE,UAAA,EAAY,KAAA,CAAM,UAAA,EAAW,GAAI,EAAC;AAAA;AAAA,IAEzE,GAAI,KAAA,CAAM,IAAA,KAAS,IAAA,GACf;AAAA,MACE,OAAA,EAAS,mBAAA,CAAoB,KAAA,CAAM,GAAA,EAAK,MAAM,CAAA;AAAA,MAC9C,GAAI,MAAM,KAAA,KAAU,MAAA,GAAY,EAAE,KAAA,EAAO,KAAA,CAAM,KAAA,EAAM,GAAI;AAAC,KAC5D,GACA,KAAA,CAAM,IAAA,KAAS,UAAA,GACb;AAAA,MACE,OAAA,EAAS,sBAAA,CAAuB,KAAA,CAAM,QAAA,EAAU,MAAM,CAAA;AAAA,MACtD,MAAA,EAAQ,cAAA,CAAe,KAAA,CAAM,QAAQ;AAAA,QAEvC;AAAC,GACT,CAAE,CAAA;AACN,CAAA;AAEO,IAAM,eAAA,GAAkB,OAAO,MAAA,KAAyD;AAC7F,EAAA,MAAM,EAAE,MAAA,EAAQ,QAAA,EAAU,YAAA,EAAc,aAAY,GAAI,MAAA;AAIxD,EAAA,MAAM,WAAW,YAAA,CAAa,MAAA,CAAO,SAAA,EAAU,EAAG,YAAY,CAAA,CAAE,MAAA;AAAA,IAC9D,CAAC,CAAA,KAAM,WAAA,KAAgB,UAAa,YAAA,CAAa,WAAA,EAAa,EAAE,IAAI;AAAA,GACtE;AACA,EAAA,MAAM,YAAA,GAAe,MAAM,gBAAA,CAAiB,MAAA,EAAQ,WAAW,CAAA;AAC/D,EAAA,MAAM,iBAAiB,YAAA,CAAa,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,CAAA,CAAE,MAAA;AAE/D,EAAA,OAAO;AAAA,IACL,YAAY,cAAA,KAAmB,CAAA,GAAI,SAAS,cAAA,KAAmB,YAAA,CAAa,SAAS,KAAA,GAAQ,MAAA;AAAA,IAC7F,MAAA,EAAQ,OAAO,MAAA,KAAW,IAAA;AAAA,IAC1B,YAAA;AAAA,IACA,GAAA,EAAK,KAAA;AAAA,IACL,WAAA,EAAa,8DAAA;AAAA,IACb,QAAA,EAAU,QAAA,CAAS,GAAA,CAAI,CAAA,CAAA,MAAM;AAAA,MAC3B,MAAM,CAAA,CAAE,IAAA;AAAA,MACR,MAAA,EAAQ,CAAA,CAAE,MAAA,CAAO,GAAA,CAAI,CAAA,CAAA,MAAM;AAAA,QACzB,MAAM,CAAA,CAAE,IAAA;AAAA,QACR,MAAM,CAAA,CAAE,cAAA;AAAA,QACR,UAAU,CAAA,CAAE,QAAA;AAAA,QACZ,YAAY,CAAA,CAAE;AAAA,OAChB,CAAE,CAAA;AAAA,MACF,SAAA,EAAW,CAAA,CAAE,SAAA,CAAU,GAAA,CAAI,CAAA,CAAA,MAAM;AAAA,QAC/B,QAAQ,CAAA,CAAE,MAAA;AAAA,QACV,MAAM,CAAA,CAAE,IAAA;AAAA,QACR,KAAK,CAAA,CAAE;AAAA,OACT,CAAE,CAAA;AAAA,MACF,UAAU,CAAA,CAAE;AAAA,KACd,CAAE,CAAA;AAAA,IACF,KAAA,EAAO;AAAA,MACL,MAAA,EAAQ,MAAA;AAAA,MACR,OAAA,EAAS,kBAAA;AAAA,MACT,IAAA,EAAM;AAAA,QACJ,WAAA,EAAa;AAAA,UACX,IAAA,EAAM,QAAA;AAAA,UACN,QAAA,EAAU,KAAA;AAAA,UACV,WAAA,EACE;AAAA,SAGJ;AAAA,QACA,MAAA,EAAQ;AAAA,UACN,IAAA,EAAM,QAAA;AAAA,UACN,QAAA,EAAU,KAAA;AAAA,UACV,WAAA,EAAa;AAAA,SACf;AAAA,QACA,KAAA,EAAO;AAAA,UACL,IAAA,EAAM,KAAA;AAAA,UACN,QAAA,EAAU,KAAA;AAAA,UACV,WAAA,EAAa;AAAA,SACf;AAAA,QACA,OAAA,EAAS;AAAA,UACP,IAAA,EAAM,yBAAA;AAAA,UACN,QAAA,EAAU,KAAA;AAAA,UACV,WAAA,EAAa;AAAA;AACf;AACF,KACF;AAAA,IACA,GAAA,EAAKlB,MAAE,YAAA,CAAa,WAAA,EAAa,EAAE,MAAA,EAAQ,SAAA,EAAW,MAAA,EAAQ,KAAA,EAAO;AAAA,GACvE;AACF;AAaA,IAAM,MAAA,GAAS,CAAC,MAAA,KACd,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,GAAI,MAAA,CAAO,MAAA,GAAS,MAAA,KAAW,IAAA,IAAQ,MAAA,KAAW,SAAY,CAAA,GAAI,CAAA;AAEjF,IAAM,WAAA,GAAc,OACzB,MAAA,EACA,IAAA,EACA,OACA,IAAA,KACyB;AAGzB,EAAA,IAAI,MAAA,CAAO,cAAc,MAAA,EAAW,OAAO,SAAS,MAAA,EAAQ,IAAA,EAAM,KAAA,EAAO,MAAA,EAAW,IAAI,CAAA;AAExF,EAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,GAAA,EAAI,GAAI,GAAA;AACnC,EAAA,MAAM,KAAK,YAAA,EAAa;AACxB,EAAA,MAAM,KAAA,GAAsB,EAAE,IAAA,EAAM,OAAA,EAAQ;AAC5C,EAAA,MAAM,SAAS,MAAM,QAAA,CAAS,QAAQ,IAAA,EAAM,KAAA,EAAO,OAAO,IAAI,CAAA;AAC9D,EAAA,MAAM,MAAA,GAAwB;AAAA,IAC5B,MAAM,KAAA,CAAM,IAAA;AAAA;AAAA;AAAA,IAGZ,MAAA,EAAQ,OAAO,MAAA,KAAW,GAAA,GAAM,OAAO,MAAA,CAAO,MAAA,KAAW,MAAM,SAAA,GAAY,OAAA;AAAA,IAC3E,aAAA;AAAA,IACA,WAAA,EAAa,aAAA,GAAA,CAAiB,YAAA,EAAa,GAAI,EAAA,IAAM,GAAA;AAAA,IACrD,KAAA;AAAA,IACA,GAAI,MAAM,WAAA,KAAgB,MAAA,GAAY,EAAE,WAAA,EAAa,KAAA,CAAM,WAAA,EAAY,GAAI,EAAC;AAAA,IAC5E,GAAI,MAAM,KAAA,KAAU,MAAA,GAAY,EAAE,KAAA,EAAO,KAAA,CAAM,KAAA,EAAM,GAAI,EAAC;AAAA,IAC1D,GAAI,MAAM,QAAA,KAAa,MAAA,GAAY,EAAE,QAAA,EAAU,KAAA,CAAM,QAAA,EAAS,GAAI,EAAC;AAAA,IACnE,GAAI,MAAM,IAAA,KAAS,MAAA,GAAY,EAAE,IAAA,EAAM,KAAA,CAAM,IAAA,EAAK,GAAI;AAAC,GACzD;AACA,EAAA,IAAI;AACF,IAAA,MAAA,CAAO,UAAU,MAAM,CAAA;AAAA,EACzB,SAAS,GAAA,EAAK;AACZ,IAAA,OAAA,CAAQ,KAAA,CAAM,mBAAmB,GAAG,CAAA;AAAA,EACtC;AACA,EAAA,OAAO,MAAA;AACT;AAKA,IAAM,YAAA,GAAe,MAAe,OAAO,WAAA,KAAgB,cAAc,WAAA,CAAY,GAAA,EAAI,GAAI,IAAA,CAAK,GAAA,EAAI;AAEtG,IAAM,WAAW,OACf,MAAA,EACA,IAAA,EACA,KAAA,EACA,OACA,IAAA,KACyB;AACzB,EAAA,MAAM,EAAE,QAAO,GAAI,MAAA;AAGnB,EAAA,IAAIM,mBAAAA,CAAa,IAAI,CAAA,EAAG,OAAO,EAAE,MAAA,EAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,KAAA,EAAO,iBAAA,EAAmB,OAAA,EAASC,mBAAAA,IAAe,EAAE;AAC1G,EAAA,MAAM,MAAA,GAAS,kBAAA,CAAmB,SAAA,CAAU,IAAI,CAAA;AAChD,EAAA,IAAI,CAAC,OAAO,OAAA,EAAS;AACnB,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,GAAA;AAAA,MACR,IAAA,EAAM;AAAA,QACJ,KAAA,EAAO,iBAAA;AAAA,QACP,OAAA,EAAS,OAAO,KAAA,CAAM;AAAA;AACxB,KACF;AAAA,EACF;AAEA,EAAA,MAAM,WAAW,MAAA,CAAO,IAAA,CAAK,UAAU,MAAA,IAAa,MAAA,CAAO,KAAK,KAAA,KAAU,IAAA;AAC1E,EAAA,IAAI,CAAC,QAAA,IAAY,MAAA,CAAO,IAAA,CAAK,gBAAgB,MAAA,EAAW;AACtD,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,GAAA;AAAA,MACR,IAAA,EAAM;AAAA,QACJ,KAAA,EAAO,iBAAA;AAAA,QACP,OAAA,EAAS;AAAA;AACX,KACF;AAAA,EACF;AAIA,EAAA,IAAI,KAAA,KAAU,UAAa,MAAA,CAAO,IAAA,CAAK,gBAAgB,MAAA,EAAW,KAAA,CAAM,WAAA,GAAc,MAAA,CAAO,IAAA,CAAK,WAAA;AAElG,EAAA,IAAI;AAIF,IAAA,IAAI,UAAA;AACJ,IAAA,IAAI,MAAA,CAAO,IAAA,CAAK,WAAA,KAAgB,KAAA,CAAA,EAAW;AACzC,MAAA,MAAM,QAAQ,MAAM,MAAA,CAAO,MAAM,GAAA,CAAI,MAAA,CAAO,KAAK,WAAW,CAAA;AAC5D,MAAA,IAAI,UAAU,KAAA,CAAA,IAAa,KAAA,CAAM,IAAA,KAAS,IAAA,eAAmB,KAAA,CAAM,KAAA;AACnE,MAAA,IAAI,KAAA,KAAU,KAAA,CAAA,IAAa,UAAA,KAAe,KAAA,CAAA,QAAiB,KAAA,GAAQ,UAAA;AACnE,MAAA,IAAI,KAAA,KAAU,KAAA,CAAA,IAAa,KAAA,CAAM,IAAA,KAAS,UAAA,EAAY;AACpD,QAAA,IAAI,UAAU,KAAA,CAAA,EAAW;AACvB,UAAA,KAAA,CAAM,IAAA,GAAO,UAAA;AACb,UAAA,IAAI,KAAA,CAAM,KAAA,KAAU,KAAA,CAAA,EAAW,KAAA,CAAM,QAAQ,KAAA,CAAM,KAAA;AAAA,QACrD;AACA,QAAA,IAAI,MAAA,CAAO,cAAc,KAAA,CAAA,EAAW;AAClC,UAAA,OAAO;AAAA,YACL,MAAA,EAAQ,GAAA;AAAA,YACR,IAAA,EAAM,EAAE,KAAA,EAAO,iBAAA,EAAmB,SAAS,qFAAA;AAAiF,WAC9H;AAAA,QACF;AACA,QAAA,MAAM,MAAA,GAAS,OAAO,SAAA,EAAU;AAChC,QAAA,IAAI,WAAW,KAAA,CAAA,EAAW;AACxB,UAAA,OAAO,EAAE,QAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,KAAA,EAAO,iBAAA,EAAmB,OAAA,EAAS,8BAAA,EAA+B,EAAE;AAAA,QACpG;AAIA,QAAA,IAAI,WAAA,GAAc,OAAO,SAAA,CAAU,MAAA;AACnC,QAAA,IAAI,KAAA,CAAM,UAAU,KAAA,CAAA,EAAW;AAC7B,UAAA,IAAI,MAAA,CAAO,mBAAmB,KAAA,CAAA,EAAW;AACvC,YAAA,OAAO;AAAA,cACL,MAAA,EAAQ,GAAA;AAAA,cACR,IAAA,EAAM;AAAA,gBACJ,KAAA,EAAO,iBAAA;AAAA,gBACP,OAAA,EAAS,UAAU,MAAA,CAAO,IAAA,CAAK,eAAe,EAAE,CAAA,kBAAA,EAAqB,MAAM,KAAK,CAAA,yCAAA;AAAA;AAClF,aACF;AAAA,UACF;AACA,UAAA,MAAM,QAAA,GAAW,MAAM,MAAA,CAAO,cAAA,CAAe,MAAM,KAAK,CAAA;AACxD,UAAA,IAAI,aAAa,KAAA,CAAA,EAAW;AAC1B,YAAA,OAAO;AAAA,cACL,MAAA,EAAQ,GAAA;AAAA,cACR,IAAA,EAAM,EAAE,KAAA,EAAO,cAAA,EAAgB,SAAS,CAAA,OAAA,EAAU,KAAA,CAAM,KAAK,CAAA,qCAAA,CAAA;AAAwC,aACvG;AAAA,UACF;AACA,UAAA,WAAA,GAAc,QAAA;AAAA,QAChB;AAEA,QAAA,MAAM,SAAS,MAAM,aAAA,CAAc,OAAO,SAAA,CAAU,MAAA,EAAQ,MAAM,QAAA,EAAU;AAAA,UAC1E,OAAA,EAAS,OAAO,IAAA,CAAK,OAAA;AAAA,UACrB,KAAA;AAAA,UACA,MAAA,EAAQ,WAAA;AAAA,UACR;AAAA,SACD,CAAA;AACD,QAAA,MAAM,OAAO,MAAA,CAAO,OAAA,CAAQ,CAAC,CAAA,KAAM,EAAE,IAAI,CAAA;AAMzC,QAAA,MAAA,CAAO,UAAA,CAAW,eAAA,CAAgB,MAAA,EAAQ,MAAM,CAAC,CAAA;AAIjD,QAAA,IAAI,MAAA,CAAO,SAAA,CAAU,OAAA,KAAY,KAAA,CAAA,EAAW;AAC1C,UAAA,IAAI;AACF,YAAA,MAAA,CAAO,SAAA,CAAU,QAAQ,EAAE,WAAA,EAAa,OAAO,IAAA,CAAK,WAAA,EAAa,MAAA,EAAQ,KAAA,EAAO,CAAA;AAAA,UAClF,SAAS,GAAA,EAAK;AACZ,YAAA,OAAA,CAAQ,KAAA,CAAM,iBAAiB,GAAG,CAAA;AAAA,UACpC;AAAA,QACF;AAIA,QAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,QAAA,IAAI,WAAW,KAAA,EAAO,GAAG,CAAA,EAAG,aAAA,CAAc,OAAO,KAAA,CAAM,GAAA,CAAI,MAAA,CAAO,IAAA,CAAK,aAAa,EAAE,GAAG,OAAO,UAAA,EAAY,GAAA,EAAK,CAAC,CAAA;AAClH,QAAA,IAAI,KAAA,KAAU,KAAA,CAAA,EAAW,KAAA,CAAM,IAAA,GAAO,IAAA,CAAK,MAAA;AAG3C,QAAA,OAAO,EAAE,MAAA,EAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,MAAA,EAAQ,IAAA,CAAK,MAAA,KAAW,CAAA,GAAI,IAAA,CAAK,CAAC,CAAA,GAAI,MAAK,EAAE;AAAA,MAC7E;AAAA,IACF;AAYA,IAAA,IAAI,aAAa,MAAA,CAAO,WAAA;AACxB,IAAA,IAAI,eAAe,KAAA,CAAA,EAAW;AAC5B,MAAA,IAAI,MAAA,CAAO,mBAAmB,KAAA,CAAA,EAAW;AACvC,QAAA,OAAO;AAAA,UACL,MAAA,EAAQ,GAAA;AAAA,UACR,IAAA,EAAM;AAAA,YACJ,KAAA,EAAO,iBAAA;AAAA,YACP,SAAS,CAAA,OAAA,EAAU,MAAA,CAAO,KAAK,WAAA,IAAe,EAAE,qBAAqB,UAAU,CAAA,yCAAA;AAAA;AACjF,SACF;AAAA,MACF;AACA,MAAA,UAAA,GAAa,MAAM,MAAA,CAAO,cAAA,CAAe,UAAU,CAAA;AACnD,MAAA,IAAI,eAAe,KAAA,CAAA,EAAW;AAC5B,QAAA,OAAO;AAAA,UACL,MAAA,EAAQ,GAAA;AAAA,UACR,MAAM,EAAE,KAAA,EAAO,gBAAgB,OAAA,EAAS,CAAA,OAAA,EAAU,UAAU,CAAA,qCAAA,CAAA;AAAwC,SACtG;AAAA,MACF;AAAA,IACF;AAEA,IAAA,MAAM,QAAA,GAAW,MAAM,MAAA,CAAO,OAAA,CAAQ,OAAO,IAAA,EAAM;AAAA,MACjD,KAAA;AAAA,MACA,UAAU,MAAA,CAAO,QAAA;AAAA,MACjB,GAAI,OAAO,MAAA,KAAW,IAAA,GAAO,EAAE,MAAA,EAAQ,IAAA,KAAS,EAAC;AAAA,MACjD,GAAI,UAAA,KAAe,KAAA,CAAA,GAAY,EAAE,WAAA,EAAa,UAAA,KAAe,EAAC;AAAA,MAC9D,GAAI,IAAA,KAAS,KAAA,CAAA,GAAY,EAAE,MAAA,EAAQ,IAAA,CAAK,MAAA,EAAQ,QAAA,EAAU,IAAA,CAAK,QAAA,EAAS,GAAI;AAAC,KAC9E,CAAA;AACD,IAAA,IAAI,UAAU,KAAA,CAAA,EAAW;AACvB,MAAA,KAAA,CAAM,QAAA,GAAW,QAAA,CAAS,IAAA,CAAK,KAAA,CAAM,GAAA;AAGrC,MAAA,IAAI,QAAA,CAAS,KAAK,KAAA,CAAM,WAAA,KAAgB,QAAW,KAAA,CAAM,WAAA,GAAc,QAAA,CAAS,IAAA,CAAK,KAAA,CAAM,WAAA;AAC3F,MAAA,KAAA,CAAM,IAAA,GAAO,MAAA,CAAO,QAAA,CAAS,MAAM,CAAA;AAAA,IACrC;AACA,IAAA,OAAO,EAAE,MAAA,EAAQ,GAAA,EAAK,IAAA,EAAM,QAAA,EAAS;AAAA,EACvC,SAAS,GAAA,EAAK;AAIZ,IAAA,IAAI,GAAA,YAAe,QAAA,IAAY,GAAA,CAAI,IAAA,KAAS,eAAA,EAAiB;AAC3D,MAAA,OAAA,CAAQ,KAAA,CAAM,mDAAA,EAAqD,GAAA,CAAI,OAAO,CAAA;AAC9E,MAAA,OAAO,EAAE,QAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,KAAA,EAAO,eAAA,EAAiB,OAAA,EAAS,yDAAA,EAA0D,EAAE;AAAA,IAC7H;AACA,IAAA,IAAI,eAAe,QAAA,EAAU;AAC3B,MAAA,MAAM,MAAA,GAAS,IAAI,IAAA,KAAS,uBAAA,GAA0B,MAAM,GAAA,CAAI,IAAA,KAAS,eAAe,GAAA,GAAM,GAAA;AAC9F,MAAA,OAAO;AAAA,QACL,MAAA;AAAA,QACA,IAAA,EAAM;AAAA,UACJ,OAAO,GAAA,CAAI,IAAA;AAAA,UACX,SAAS,GAAA,CAAI,OAAA;AAAA,UACb,SAAS,GAAA,CAAI;AAAA;AACf,OACF;AAAA,IACF;AACA,IAAA,OAAA,CAAQ,KAAA,CAAM,0BAA0B,GAAG,CAAA;AAC3C,IAAA,MAAM,MAAA,GAAS,GAAA;AACf,IAAA,MAAM,OAAA,GAAU,GAAA,YAAe,KAAA,GAC3B,GAAA,CAAI,OAAA,GACH,OAAO,MAAA,EAAQ,OAAA,KAAY,QAAA,GAAW,MAAA,CAAO,OAAA,GAAU,eAAA;AAC5D,IAAA,MAAM,OAAO,OAAO,MAAA,EAAQ,IAAA,KAAS,QAAA,GAAW,OAAO,IAAA,GAAO,iBAAA;AAC9D,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,GAAA;AAAA,MACR,IAAA,EAAM,EAAE,KAAA,EAAO,IAAA,EAAM,OAAA;AAAQ,KAC/B;AAAA,EACF;AACF,CAAA;AAOO,IAAM,sBAAA,GAAyB,OACpC,MAAA,EACA,WAAA,EACA,KAAA,KACyB;AACzB,EAAA,IAAI,MAAA,CAAO,WAAW,IAAA,EAAM;AAC1B,IAAA,OAAO,EAAE,QAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,KAAA,EAAO,QAAA,EAAU,OAAA,EAAS,qEAAA,EAAiE,EAAE;AAAA,EAC7H;AACA,EAAA,MAAM,QAAQ,MAAM,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,IAAI,WAAW,CAAA;AACvD,EAAA,IAAI,UAAU,MAAA,IAAc,KAAA,CAAM,SAAS,IAAA,IAAQ,KAAA,CAAM,SAAS,UAAA,EAAa;AAC7E,IAAA,OAAO,EAAE,MAAA,EAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,KAAA,EAAO,YAAA,EAAc,OAAA,EAAS,CAAA,qBAAA,EAAwB,WAAW,CAAA,CAAA,CAAA,EAAI,EAAE;AAAA,EACvG;AACA,EAAA,IAAI,OAAO,KAAA,CAAM,SAAA,KAAc,SAAA,EAAW;AACxC,IAAA,OAAO,EAAE,QAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,KAAA,EAAO,iBAAA,EAAmB,OAAA,EAAS,qCAAA,EAAsC,EAAE;AAAA,EAC3G;AACA,EAAA,MAAM,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,GAAA,CAAI,WAAA,EAAa,EAAE,GAAG,KAAA,EAAO,SAAA,EAAW,KAAA,CAAM,SAAA,EAAW,CAAA;AACnF,EAAA,OAAO,EAAE,QAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,WAAA,EAAa,SAAA,EAAW,KAAA,CAAM,SAAA,EAAU,EAAE;AAC1E;AAEO,IAAM,uBAAA,GAA0B,OACrC,MAAA,EACA,WAAA,KACyB;AACzB,EAAA,IAAI,MAAA,CAAO,WAAW,IAAA,EAAM;AAC1B,IAAA,OAAO,EAAE,QAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,KAAA,EAAO,QAAA,EAAU,OAAA,EAAS,qEAAA,EAAiE,EAAE;AAAA,EAC7H;AACA,EAAA,MAAM,QAAQ,MAAM,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,IAAI,WAAW,CAAA;AACvD,EAAA,IAAI,UAAU,MAAA,EAAW;AACvB,IAAA,OAAO,EAAE,MAAA,EAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,KAAA,EAAO,YAAA,EAAc,OAAA,EAAS,CAAA,qBAAA,EAAwB,WAAW,CAAA,CAAA,CAAA,EAAI,EAAE;AAAA,EACvG;AACA,EAAA,IAAI,KAAA,CAAM,IAAA,KAAS,IAAA,IAAQ,KAAA,CAAM,cAAc,IAAA,EAAM;AACnD,IAAA,OAAO,EAAE,MAAA,EAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,KAAA,EAAO,uBAAA,EAAyB,OAAA,EAAS,CAAA,CAAA,EAAI,WAAW,CAAA,yCAAA,CAAA,EAAuC,EAAE;AAAA,EACjI;AACA,EAAA,MAAM,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,MAAA,CAAO,WAAW,CAAA;AAC5C,EAAA,OAAO,EAAE,QAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,WAAA,EAAa,OAAA,EAAS,MAAK,EAAE;AAC7D","file":"index.cjs","sourcesContent":["import { z } from 'zod';\nimport type { JsonValue } from '@niscorp/prism';\n\n// Context keys the engine consumes directly (for ORDER BY) instead of binding as\n// SQL parameters. A `{ $context: 'sortBy' }` ref is rejected at compile so these\n// can never reach the param path.\nexport const RESERVED_CONTEXT_KEYS = new Set<string>(['sortBy', 'sortDir']);\n\nexport const ContextSchema = z\n .object({\n sortBy: z.string().optional(),\n sortDir: z.enum(['asc', 'desc']).optional(),\n })\n .catchall(z.unknown())\n .describe(\n 'Caller runtime values. Keys referenced from the DSL via { $context: \"key\" } are bound as SQL parameters. `sortBy` (an entity.field, schema-validated) and `sortDir` (\"asc\"|\"desc\") are reserved keys that drive ORDER BY directly and are never bound as parameters.',\n );\n\nexport const QueryRequestSchema = z.object({\n // The ONE cache identity. Server-minted (`fp_…`) when absent — returned in\n // meta.cache.fingerprint, an immutable pin. Caller-chosen strings are\n // mutable named slots: the name is yours, its content follows your request.\n // Alone → replay-or-error. With intent/shape → hit when the stored request\n // matches, regenerate-and-replace when it differs (409 when protected).\n fingerprint: z.string().min(1).optional(),\n intent: z.string().optional(),\n shape: z.unknown().optional(),\n context: ContextSchema.default({}),\n});\n\nexport type QueryRequest = z.infer<typeof QueryRequestSchema>;\n\nexport type CacheMeta = {\n hit: boolean;\n // The entry's identity — minted (`fp_…`) or the caller's own name.\n fingerprint?: string;\n // True when this execution regenerated and REPLACED a named slot whose\n // stored request no longer matched.\n replaced?: boolean;\n // The intent stored with the cached query (on a hit) or the request's own intent\n // (on a miss) — descriptive only, so a caller can see what the query is for.\n intent?: string;\n};\n\nexport type TimingMeta = {\n agentMs?: number;\n executionMs: number;\n mappingMs?: number;\n transformMs?: number;\n};\n\nexport type ContextMeta = {\n // Mirrors ParamSlot['type'] (adapters/adapter.types.ts) — the contract a\n // caller reads is built from the slots the compiler bound, one for one.\n // Absent on a key that is optional and was not supplied: nothing bound it\n // this run, so there is no slot to read a type off.\n type?: 'string' | 'number' | 'boolean' | 'string[]' | 'number[]' | 'json';\n kind: 'context' | 'scope' | 'semantic';\n // True when the key controls an `optional` condition — supply it and the\n // condition applies, omit it and the condition is not in the query. DERIVED\n // from the stored DSL rather than declared beside it, for the same reason\n // mutation signatures are (see \"Derived context signatures\" in DOCS.md): a\n // contract somebody maintains by hand is a contract that eventually lies.\n optional?: true;\n // True when this run did not supply the key, so its condition was pruned.\n // The key is still published — that is the point of listing it — so a caller\n // can discover what a fingerprint accepts without failing a request first.\n absent?: true;\n};\n\nexport type QueryResponse = {\n // Whatever the Prism mapping produced over the full row set: an array (the\n // common case — a `$map` or identity over `$.result`), a single object (a\n // detail picking `$.result[0]`), or a scalar (an aggregate). Vex no longer\n // forces an array — the mapping owns the output shape.\n result: JsonValue;\n meta: {\n cache: CacheMeta;\n context: Record<string, ContextMeta>;\n timing?: TimingMeta;\n warnings?: string[];\n missingContext?: string[];\n };\n};\n\nexport type QueryErrorResponse = {\n error: string;\n message: string;\n details?: {\n suggestion?: string;\n options?: string[];\n };\n};\n\nexport type QueryErrorCode =\n | 'invalid_request'\n | 'invalid_dsl'\n | 'missing_scope'\n | 'scope_denied'\n | 'missing_context'\n | 'execution_error'\n | 'agent_failed'\n | 'cache_miss'\n | 'fingerprint_protected'\n | 'locked'\n | 'unsatisfiable';\n","import { z } from 'zod';\n\nexport const ContextRefSchema = z\n .object({\n $context: z.string().describe('Key to look up in the request context object'),\n })\n .strict()\n .describe('Reference to a caller-provided context value');\n\nexport const ScopeRefSchema = z\n .object({\n $scope: z.string().describe('Key to look up in the server-side scope values'),\n })\n .strict()\n .describe('Reference to a server-injected scope value (access control)');\n\nexport const FieldOrValueSchema = z\n .union([\n z.string().describe('A field path (entity.field format) or a literal string'),\n z.number().describe('A literal number'),\n z.boolean().describe('A literal boolean'),\n z.null().describe('A literal null'),\n ContextRefSchema,\n ScopeRefSchema,\n ])\n .describe('A field path, literal value, or dynamic reference');\n\nexport type ContextRef = z.infer<typeof ContextRefSchema>;\nexport type ScopeRef = z.infer<typeof ScopeRefSchema>;\nexport type FieldOrValue = z.infer<typeof FieldOrValueSchema>;\n","import { z } from 'zod';\n\n// ═══════════════════════════════════════════════════════════════\n// THE NAMES A QUERY MAY SAY — and the one rule for telling them apart.\n//\n// Every string an author (a person, a seed, a model) puts in a NAME position\n// ends up in SQL text: a column reference, an output alias, a subquery alias.\n// Values never do — they bind as parameters or are quoted as literals. So a\n// name is the only place authored text meets the statement, and it is held to\n// a grammar that cannot carry anything but a name: letters, digits and\n// underscores, not starting with a digit.\n//\n// This is the parse-time half. The resolver checks the same predicates again,\n// because `engine.compile()` and `engine.test()` take a DSL that never went\n// through Zod, and the compiler refuses to emit a field position that did not\n// resolve against the introspected schema. Three layers, one grammar.\n//\n// `isFieldPathShape` is also what decides, in a value position, whether a\n// string is a column or a literal. It used to be \"contains a dot\", which made\n// every email address an unknown entity and every string with a dot a column\n// reference — so a literal like \"u1@x.com\" threw, and a string that merely\n// looked dotted went to SQL as a name. Now a column is exactly `ident.ident`,\n// and everything else is a literal.\n// ═══════════════════════════════════════════════════════════════\n\nconst IDENTIFIER = /^[A-Za-z_][A-Za-z0-9_]*$/;\nconst FIELD_PATH = /^[A-Za-z_][A-Za-z0-9_]*\\.[A-Za-z_][A-Za-z0-9_]*$/;\n\nexport const isIdentifier = (value: string): boolean => IDENTIFIER.test(value);\n\nexport const isFieldPathShape = (value: unknown): value is string => typeof value === 'string' && FIELD_PATH.test(value);\n\nexport const IdentifierSchema = z\n .string()\n .regex(IDENTIFIER, 'A name is letters, digits and underscores, not starting with a digit');\n\nexport const FieldPathSchema = z\n .string()\n .regex(FIELD_PATH, 'A field path is entity.field — each part letters, digits and underscores, not starting with a digit');\n","import { z } from 'zod';\nimport { ContextRefSchema, ScopeRefSchema, FieldOrValueSchema } from './value.schema.js';\nimport { FieldPathSchema } from './identifier.schema.js';\nimport type { ContextRef, ScopeRef, FieldOrValue } from './value.schema.js';\n\n// EXISTS — \"is there a row over there that points back at this one\".\n//\n// It is the same `{ from, filter }` a query already is, and deliberately no\n// more than that: no fields, no sort, no limit, nothing to select. EXISTS asks\n// whether a row is there, so anything that shapes output would be noise the\n// planner discards, and refusing it is what keeps this an operator rather than\n// an invitation to nest arbitrary SQL.\n//\n// The CORRELATION needs no new vocabulary. A dotted string on either side of a\n// comparison is already a field path, so pointing the inner table at the outer\n// one is an ordinary `eq` between two columns:\n//\n// { exists: { from: ['tasks'], filter: { eq: ['tasks.issue_id', 'issues.id'] } } }\n//\n// and `not` composes for NOT EXISTS. Whoever writes SQL writes this on the\n// first try, which is the entire design goal.\nexport type ExistsQuery = {\n from: string[];\n filter?: Filter;\n};\n\nexport type Filter =\n | { exists: ExistsQuery }\n | { eq: [FieldOrValue, FieldOrValue] }\n | { neq: [FieldOrValue, FieldOrValue] }\n | { gt: [FieldOrValue, FieldOrValue] }\n | { gte: [FieldOrValue, FieldOrValue] }\n | { lt: [FieldOrValue, FieldOrValue] }\n | { lte: [FieldOrValue, FieldOrValue] }\n | { in: [string, FieldOrValue[] | ContextRef | ScopeRef] }\n | { notIn: [string, FieldOrValue[] | ContextRef | ScopeRef] }\n | { like: [string, FieldOrValue] }\n | { ilike: [string, FieldOrValue] }\n | { isNull: string }\n | { isNotNull: string }\n | { and: Filter[] }\n | { or: Filter[] }\n | { not: Filter }\n | { semantic: { field: string; query: ContextRef | ScopeRef; minScore?: number } }\n | { fuzzy: { field: string; query: ContextRef | ScopeRef; maxDistance?: number } }\n | { optional: { key: string | string[]; then: Filter } };\n\nconst comparisonPair = z\n .tuple([FieldOrValueSchema, FieldOrValueSchema])\n .describe('[left, right] — both can be field paths, literals, or references');\n\nconst fieldString = FieldPathSchema.describe('Field path in entity.field format');\n\nconst collectionTarget = z\n .union([\n z.array(FieldOrValueSchema).min(1).describe('Array of literal values or references'),\n ContextRefSchema,\n ScopeRefSchema,\n ])\n .describe('A set of values or a reference that resolves to an array');\n\nconst ExistsSchema: z.ZodType<ExistsQuery> = z.lazy(() =>\n z\n .object({\n from: z.array(z.string()).min(1).describe('Entities the subquery reads. Joined by foreign key like any other from.'),\n filter: FilterSchema.optional().describe('The correlation, and any extra condition. Reference the outer query by its own entity path: { eq: [\"<inner>.<fk>\", \"<outer>.id\"] }.'),\n })\n .strict(),\n);\n\nexport const FilterSchema: z.ZodType<Filter> = z.lazy(() =>\n z.union([\n z.object({ exists: ExistsSchema }).strict().describe('EXISTS: true when the subquery matches at least one row. Wrap in `not` for NOT EXISTS.'),\n z.object({ eq: comparisonPair }).strict().describe('Equals: tests equality between two values'),\n z.object({ neq: comparisonPair }).strict().describe('Not equals'),\n z.object({ gt: comparisonPair }).strict().describe('Greater than'),\n z.object({ gte: comparisonPair }).strict().describe('Greater than or equal'),\n z.object({ lt: comparisonPair }).strict().describe('Less than'),\n z.object({ lte: comparisonPair }).strict().describe('Less than or equal'),\n z.object({ in: z.tuple([fieldString, collectionTarget]) }).strict().describe('Field value is in a set'),\n z.object({ notIn: z.tuple([fieldString, collectionTarget]) }).strict().describe('Field value is not in a set'),\n z.object({ like: z.tuple([fieldString, FieldOrValueSchema]) }).strict().describe('Case-sensitive LIKE pattern match (use % as wildcard)'),\n z.object({ ilike: z.tuple([fieldString, FieldOrValueSchema]) }).strict().describe('Case-insensitive ILIKE pattern match (use % as wildcard)'),\n z.object({ isNull: fieldString }).strict().describe('Field value is NULL'),\n z.object({ isNotNull: fieldString }).strict().describe('Field value is NOT NULL'),\n z.object({ and: z.array(FilterSchema).min(2) }).strict().describe('Logical AND: all conditions must be true'),\n z.object({ or: z.array(FilterSchema).min(2) }).strict().describe('Logical OR: at least one condition must be true'),\n z.object({ not: FilterSchema }).strict().describe('Logical NOT: negates the condition'),\n z.object({\n semantic: z.object({\n field: FieldPathSchema.describe('Vector column field path (entity.field)'),\n query: z.union([ContextRefSchema, ScopeRefSchema]).describe('Text to embed and compare'),\n minScore: z.number().min(0).max(1).optional().describe('Minimum cosine similarity (0–1)'),\n }).strict(),\n }).strict().describe('Semantic vector similarity search'),\n z.object({\n fuzzy: z.object({\n field: FieldPathSchema.describe('String field path'),\n query: z.union([ContextRefSchema, ScopeRefSchema]).describe('Text to fuzzy-match'),\n maxDistance: z.number().int().nonnegative().optional().describe('Maximum Levenshtein edit distance'),\n }).strict(),\n }).strict().describe('Fuzzy string match'),\n z.object({\n optional: z.object({\n key: z.union([z.string().min(1), z.array(z.string().min(1)).min(1)])\n .describe('The context key this condition depends on, or EVERY key it depends on. A condition referencing two keys must name both — gating on one leaves the other conditionally required, which surfaces as an empty result rather than as a condition that did not apply.'),\n // BARE, never `.describe()`d. That call CLONES the schema, and zod\n // detects a recursive reference by instance identity — a clone is a\n // different instance, so `to-json-schema` stops seeing the cycle and\n // expands the filter union into itself until the stack goes. Every\n // other recursive slot here (`not`, `and`, `or`) uses it bare for the\n // same reason; the description belongs on the wrapper below.\n then: FilterSchema,\n }).strict(),\n }).strict().describe(\n 'A condition the caller turns on by supplying context keys. When any named key is absent the condition is REMOVED from the query before it compiles — it does not match everything, it is not there. Absent means missing, undefined or null; \"\" is a value and keeps the condition. Direction follows position: under `and` supplying the key NARROWS, under `or` it WIDENS. Either way an absent key reads exactly as if the condition had never been written, and scope is injected afterwards regardless. Reads only: a mutation may not contain one, and neither may the inside of an `exists` (its correlation must be unconditional).',\n ),\n ]),\n);\n","import { z } from 'zod';\nimport { FieldOrValueSchema } from './value.schema.js';\nimport { FilterSchema } from './filter.schema.js';\n\nconst CaseWhenSchema = z\n .object({\n condition: FilterSchema,\n then: FieldOrValueSchema.describe('Value when condition is true'),\n })\n .strict();\n\nexport const ComputeExpressionSchema = z\n .union([\n z.object({ add: z.tuple([FieldOrValueSchema, FieldOrValueSchema]) }).strict().describe('Addition: a + b'),\n z.object({ subtract: z.tuple([FieldOrValueSchema, FieldOrValueSchema]) }).strict().describe('Subtraction: a - b'),\n z.object({ multiply: z.tuple([FieldOrValueSchema, FieldOrValueSchema]) }).strict().describe('Multiplication: a * b'),\n z.object({ divide: z.tuple([FieldOrValueSchema, FieldOrValueSchema]) }).strict().describe('Division: a / b'),\n z.object({ concat: z.array(FieldOrValueSchema).min(2) }).strict().describe('String concatenation'),\n z.object({ coalesce: z.array(FieldOrValueSchema).min(2) }).strict().describe('Returns first non-null value'),\n z.object({\n case: z\n .object({\n when: z.array(CaseWhenSchema).min(1).describe('Condition/result pairs evaluated in order'),\n else: FieldOrValueSchema.describe('Default value when no condition matches'),\n })\n .strict(),\n }).strict().describe('CASE WHEN conditional expression'),\n ])\n .describe('Computed expression: arithmetic, string, or conditional');\n\nexport type ComputeExpression = z.infer<typeof ComputeExpressionSchema>;\n","import { z } from 'zod';\nimport { ComputeExpressionSchema } from './compute.schema.js';\nimport { FieldPathSchema } from './identifier.schema.js';\n\nconst fieldPath = FieldPathSchema.describe('Field path in entity.field format');\n\n// SUM/AVG/MIN/MAX take either a field path or a compute expression — so the\n// argument can be a derived value (e.g. SUM(value * win_probability / 100)),\n// not just a column. A bare string stays valid (non-breaking).\nconst fieldOrExpr = z.union([fieldPath, ComputeExpressionSchema]).describe('A field path or a compute expression');\n\nexport const AggregateExpressionSchema = z\n .union([\n z.object({ count: z.union([FieldPathSchema, z.literal('*')]).describe('Field path or \"*\" for COUNT(*)') }).strict().describe('COUNT'),\n z.object({ countDistinct: FieldPathSchema.describe('Field path whose distinct non-null values are counted') }).strict().describe('COUNT(DISTINCT field)'),\n z.object({ sum: fieldOrExpr }).strict().describe('SUM'),\n z.object({ avg: fieldOrExpr }).strict().describe('AVG'),\n z.object({ min: fieldOrExpr }).strict().describe('MIN'),\n z.object({ max: fieldOrExpr }).strict().describe('MAX'),\n ])\n .describe('Aggregate function applied to a field or expression');\n\nexport type AggregateExpression = z.infer<typeof AggregateExpressionSchema>;\n","import { z } from 'zod';\nimport { FilterSchema } from './filter.schema.js';\nimport { ComputeExpressionSchema } from './compute.schema.js';\nimport { AggregateExpressionSchema } from './aggregate.schema.js';\nimport { FieldPathSchema, IdentifierSchema } from './identifier.schema.js';\nimport type { Filter } from './filter.schema.js';\nimport type { ComputeExpression } from './compute.schema.js';\nimport type { AggregateExpression } from './aggregate.schema.js';\n\nexport const SortEntrySchema = z\n .object({\n field: z.union([FieldPathSchema, IdentifierSchema]).describe('Field path (entity.field), computed field name, or aggregate alias'),\n dir: z.enum(['asc', 'desc']).default('asc').describe('Sort direction'),\n })\n .strict()\n .describe('Sort specification');\n\nexport type SortEntry = z.infer<typeof SortEntrySchema>;\n\nexport type Source = string | { as: string; query: Query };\n\n// A selected field: a bare `entity.field` path, or an aliased one whose output\n// key is `as` (so joined columns that would collide — three `name`s — get\n// distinct keys without a compute hack).\nexport type FieldRef = string | { field: string; as: string };\n\nexport type Query = {\n from: Source[];\n // Optional: a query may select only aggregates (e.g. a bare `COUNT(*)`); the\n // schema requires at least one of `fields` / `aggregate`.\n fields?: FieldRef[];\n filter?: Filter;\n compute?: Record<string, ComputeExpression>;\n aggregate?: Record<string, AggregateExpression>;\n groupBy?: string[];\n sort?: SortEntry[];\n limit?: number;\n distinct?: boolean;\n};\n\nconst SubquerySourceSchema = z\n .object({\n as: IdentifierSchema.describe('Alias for subquery results — use as prefix in field paths'),\n query: z.lazy((): z.ZodType<Query> => QuerySchema).describe('A nested query'),\n })\n .strict()\n .describe('Subquery data source: a nested query read as a table under `as`, its columns referenced as `<as>.<field>` anywhere in the outer query. Joined by foreign key like an entity when one links them; otherwise every outer row is paired with every subquery row (a cross join), so a one-row subquery puts its values beside each outer row.');\n\nconst SourceSchema = z\n .union([\n z.string().describe('Entity name from the database schema'),\n SubquerySourceSchema,\n ])\n .describe('Data source: entity name or subquery');\n\nconst FieldRefSchema = z\n .union([\n FieldPathSchema.describe('A column in entity.field format'),\n z\n .object({\n field: FieldPathSchema.describe('A column in entity.field format'),\n as: IdentifierSchema.describe('Output key for this column'),\n })\n .strict()\n .describe('An aliased column: output under `as` instead of the column name'),\n ])\n .describe('A selected field — a bare `entity.field`, or `{ field, as }` to alias the output key');\n\nexport const QuerySchema: z.ZodType<Query> = z.lazy(() =>\n z\n .object({\n from: z.array(SourceSchema).min(1).describe('Data sources — entity names or subqueries. Every entity used anywhere in the query must be listed here. Listed entities are JOINED FOR YOU along their foreign keys — a nullable key as a LEFT JOIN, so a row whose key is empty is kept, with the joined columns null. Never restate a join as a filter comparing the two keys: that throws those rows away.'),\n fields: z.array(FieldRefSchema).optional().describe('Raw columns to select — each `entity.field`, or `{ field, as }` to alias the output key (no SELECT *). Optional: omit it for an aggregate-only query (e.g. a bare COUNT). Do not list compute or aggregate aliases here — those are added automatically.'),\n filter: FilterSchema.optional().describe('Filter conditions'),\n compute: z.record(IdentifierSchema, ComputeExpressionSchema).optional().describe('Computed fields — key is output alias, value is the expression'),\n aggregate: z.record(IdentifierSchema, AggregateExpressionSchema).optional().describe('Aggregate functions — key is output alias, value is the function'),\n groupBy: z.array(FieldPathSchema).optional().describe('Fields to group by for aggregation'),\n sort: z.array(SortEntrySchema).optional().describe('Sort order'),\n limit: z.number().int().positive().optional().describe('Maximum rows to return'),\n distinct: z.boolean().optional().describe('Eliminate duplicate rows'),\n })\n .strict()\n .refine(\n (q) => (q.fields?.length ?? 0) > 0 || Object.keys(q.aggregate ?? {}).length > 0,\n { message: 'A query must select at least one of `fields` or `aggregate`.' },\n ),\n);\n\nexport { SubquerySourceSchema, SourceSchema };\n","import type { QueryErrorCode } from './schemas/request.schema.js';\n\nexport class VexError extends Error {\n readonly code: QueryErrorCode;\n readonly details?: Record<string, unknown>;\n\n constructor(code: QueryErrorCode, message: string, details?: Record<string, unknown>) {\n super(message);\n this.name = 'VexError';\n this.code = code;\n this.details = details;\n }\n}\n","import type { Query, Source } from '../schemas/query.schema.js';\nimport type { Filter } from '../schemas/filter.schema.js';\nimport { VexError } from '../errors.js';\n\n// ═══════════════════════════════════════════════════════════════\n// OPTIONAL CONDITIONS — resolved BEFORE the pipeline, never inside it.\n//\n// `{ optional: { key, then } }` is the one thing a caller can do to the SHAPE\n// of a query rather than to its values: supply the key and the condition is\n// there, omit it and the condition is gone. That is what makes one entry able\n// to answer \"everybody\", \"everybody matching a search\", and \"one person by id\"\n// — questions that were three entries because every `$context` ref was\n// mandatory (`executor.ts` findMissingContext).\n//\n// It is a DSL→DSL rewrite, run at the same point as `applySortContext`, and\n// that placement is the whole safety argument. The resolver, the compiler and\n// the scope walker never see this node. They cannot: by the time any of them\n// runs, every optional has already become either its condition or nothing at\n// all. So there is no third walker to teach, and — crucially — no way for an\n// entity to enter the query AFTER `discoverEntities` has decided what to scope.\n// All three throw if they ever meet one, so a future caller that reaches past\n// this pass gets an error rather than an unscoped read.\n//\n// WHAT IS DELIBERATELY NOT DONE HERE: the joins stay. `from` is untouched when\n// a condition drops, so which keys a caller sends can never change the row\n// multiplicity of the result — only how many rows survive the WHERE. A pruned\n// query is the same query with fewer conditions, never a differently-shaped one.\n// ═══════════════════════════════════════════════════════════════\n\n/** The keys one optional gate names — one, or all of several. A condition that\n * reads two context values depends on BOTH, and gating it on one would leave\n * the other conditionally required: supply `after` without `afterId` and the\n * clause survives with a hole in it, which surfaces as an empty result and\n * `missingContext`, not as a condition that quietly did not apply. On a paging\n * cursor an empty result reads as \"end of list\", which is the wrong answer\n * arrived at silently. */\nconst gateKeys = (key: string | string[]): string[] => (Array.isArray(key) ? key : [key]);\n\n/** Every optional key mentioned anywhere in a query, in declaration order. */\nexport const optionalKeysOf = (dsl: Query): string[] => {\n const keys: string[] = [];\n const walk = (filter: Filter): void => {\n if ('optional' in filter) {\n for (const key of gateKeys(filter.optional.key)) {\n if (!keys.includes(key)) keys.push(key);\n }\n walk(filter.optional.then);\n return;\n }\n if ('and' in filter) { for (const sub of filter.and) walk(sub); return; }\n if ('or' in filter) { for (const sub of filter.or) walk(sub); return; }\n if ('not' in filter) { walk(filter.not); return; }\n };\n if (dsl.filter !== undefined) walk(dsl.filter);\n for (const source of dsl.from) {\n if (typeof source !== 'string') keys.push(...optionalKeysOf(source.query).filter((k) => !keys.includes(k)));\n }\n return keys;\n};\n\n/** Which context keys the caller actually supplied.\n *\n * ABSENT MEANS MISSING, `undefined`, OR `null`. The empty string is a value —\n * searching for `''` is a real search — but null is not, for two reasons that\n * agree:\n *\n * · SQL. A bound null in a comparison can never match: `col = NULL` and\n * `col ILIKE NULL` are both NULL, never true. So \"send null\" could only ever\n * have meant \"I have nothing\", and vex already has `isNull`/`isNotNull` for\n * the question people actually mean by it. Nothing is lost.\n *\n * · The wire. JSON has no `undefined`, and a request prism assembles a fixed\n * object — it cannot conditionally omit a key. Without null counting as\n * absent, every caller with an empty search box would have to bind a\n * sentinel again, which is the exact thing this feature removes.\n *\n * This is deliberately WIDER than `findMissingContext`'s test, which stays on\n * `undefined` alone. A required key sent as null still binds null and matches\n * nothing; an optional key sent as null drops its condition. That reads like a\n * contradiction and is not: the author chose which keys are optional, and for\n * those they have already said absence means \"this does not apply\". A caller\n * gains nothing by it either — omitting the key does the same thing, and scope\n * is injected after this either way. */\nexport const presenceOf = (context: Record<string, unknown>): ReadonlySet<string> => {\n const present = new Set<string>();\n for (const [key, value] of Object.entries(context)) {\n if (value !== undefined && value !== null) present.add(key);\n }\n return present;\n};\n\n/** A stable name for \"which optionals were live on this run\" — used to report\n * how many distinct shapes one entry is being asked for. `all` is the compile\n * and test path, where there is no caller. */\nexport const presenceSignature = (dsl: Query, present: ReadonlySet<string> | 'all'): string => {\n const keys = optionalKeysOf(dsl);\n if (keys.length === 0) return '';\n if (present === 'all') return keys.join(',');\n return keys.filter((k) => present.has(k)).join(',');\n};\n\n// `undefined` means THIS NODE IS GONE — not \"false\", not \"true\". The caller of\n// each recursion decides what its absence means in context, which is the only\n// way `and` (identity true) and `or` (identity false) can both be correct.\nconst prune = (filter: Filter, present: ReadonlySet<string> | 'all', insideExists: boolean): Filter | undefined => {\n if ('optional' in filter) {\n // The correlation of an EXISTS is what ties it to the outer row. Let a\n // caller switch that off and `exists` stops asking \"is there one of these\n // for THIS row\" and starts asking \"is there one of these at all\" — a\n // different question that happens to be true far more often. Refused\n // outright rather than defended per-case.\n const keys = gateKeys(filter.optional.key);\n if (insideExists) {\n throw new VexError('invalid_dsl', `An optional condition (\"${keys.join(', ')}\") cannot live inside an exists — its correlation must hold on every run.`);\n }\n // ALL of them, not any: a condition needing two values and given one is a\n // condition that cannot run.\n if (present !== 'all' && !keys.every((key) => present.has(key))) return undefined;\n return prune(filter.optional.then, present, insideExists);\n }\n\n if ('exists' in filter) {\n const inner = filter.exists.filter === undefined ? undefined : prune(filter.exists.filter, present, true);\n return inner === undefined\n ? { exists: { from: filter.exists.from } }\n : { exists: { from: filter.exists.from, filter: inner } };\n }\n\n if ('and' in filter || 'or' in filter) {\n const isAnd = 'and' in filter;\n const kept = (isAnd ? filter.and : filter.or)\n .map((sub) => prune(sub, present, insideExists))\n .filter((sub): sub is Filter => sub !== undefined);\n // The schema requires two arms, so a pruned pair has to collapse rather\n // than emit a one-armed `and` that would fail its own validation.\n if (kept.length === 0) return undefined;\n if (kept.length === 1) return kept[0];\n return isAnd ? { and: kept } : { or: kept };\n }\n\n if ('not' in filter) {\n const inner = prune(filter.not, present, insideExists);\n // `not` of a condition that is not there is not \"true\" or \"false\" — it is\n // a question nobody asked. An author who wants \"exclude these when the key\n // is given\" writes `{ optional: { key, then: { not: … } } }`, which says it.\n if (inner === undefined) {\n throw new VexError('invalid_dsl', 'An optional condition cannot be the whole body of a `not` — wrap the `not` in the optional instead.');\n }\n return { not: inner };\n }\n\n return filter;\n};\n\n/** Resolve every optional condition against the keys a caller supplied.\n *\n * A query whose filter prunes away entirely comes back with NO filter, which\n * is the point: `people/list` with no lens, no search and no cursor is the\n * whole roll, and it says so by having nothing to say. Scope is injected\n * after this, so \"no filter\" still never means \"every tenant\". */\nexport const pruneOptional = (dsl: Query, present: ReadonlySet<string> | 'all'): Query => {\n const from: Source[] = dsl.from.map((source) =>\n typeof source === 'string' ? source : { as: source.as, query: pruneOptional(source.query, present) },\n );\n\n if (dsl.filter === undefined) return { ...dsl, from };\n\n const filter = prune(dsl.filter, present, false);\n if (filter === undefined) {\n const { filter: _dropped, ...rest } = dsl;\n return { ...rest, from };\n }\n return { ...dsl, from, filter };\n};\n\n/** Belt and braces for the three walkers that must never meet this node. */\nexport const refuseOptional = (where: string): never => {\n throw new VexError(\n 'invalid_dsl',\n `An optional condition reached ${where}. It should have been resolved by pruneOptional before the pipeline ran — reaching this point means a query was compiled without knowing which context keys the caller supplied.`,\n );\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 '../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","// Scope is server-side, LLM-invisible access control, applied to the resolved\n// query/mutation AFTER it is authored — so a generated or injected DSL can never\n// reference, dodge, or forge it. There are two roles, named for the SQL they\n// produce:\n// • match — RLS: the row's column must equal a scope value (a WHERE filter,\n// and on INSERT the column is pinned to that value so you can't write\n// outside your boundary).\n// • set — identity: the engine writes the column from a scope value on\n// EVERY column-writing op — INSERT values and UPDATE set alike (`write`\n// means every write; delete writes no columns, so it is structurally\n// exempt). It doesn't touch reads.\n\n// Caller runtime values, injected at execute via options.scope, keyed by name\n// (e.g. { userId, accountId }). A rule's `to` names one of these keys.\nexport type ScopeValues = Record<string, unknown>;\n\n// RLS filter: `<entity>.<match>` must equal the `to` scope value — or, in the\n// set-valued form, must be ONE OF the `in` scope value.\n//\n// THE SET IS FOR READS. A reach that covers several rows is a real concept —\n// \"mine, and the people I am answerable for\" — and the scalar form cannot say\n// it. What the set deliberately CANNOT do is pin a write: a `match` on an\n// INSERT writes the column (engine.ts), and a set has no single value to\n// write. That is not a gap to fill later; it is the property that keeps a\n// write's subject unforgeable. The mutation engine throws rather than\n// guessing, so a set-valued write rule is unauthorable rather than merely\n// discouraged.\n//\n// Fail-closed comes from SQL rather than from a guard here: the set compiles\n// to `col = ANY($n)`, an absent scope value binds NULL (`= ANY(NULL)` is NULL,\n// so the row drops) and an empty one binds `{}` (false). Neither can be\n// forgotten, because neither was written.\nexport type ScopeMatchOne = { match: string; to: string };\nexport type ScopeMatchAny = { match: string; in: string };\nexport type ScopeMatch = ScopeMatchOne | ScopeMatchAny;\n\n/** The set-valued form, told apart by its key — `to` and `in` never coexist. */\nexport const isSetMatch = (m: ScopeMatch): m is ScopeMatchAny => 'in' in m;\n\n// Identity write: `<set>` is filled from the `to` scope value on every\n// column-writing mutation (INSERT and UPDATE).\nexport type ScopeSet = { set: string; to: string };\n\nexport type ScopeRule = ScopeMatch | ScopeSet;\n\nexport type ScopeEntityRule =\n | { public: true } // fully open (read + write, no rules)\n | { deny: true } // fully closed\n | {\n // Reads (SELECT): each match becomes a WHERE filter. Match only — there is\n // nothing to stamp on a read.\n read?: ScopeMatch[];\n // Writes. `write` is the UMBRELLA: its presence grants insert, update\n // and delete, and its rules apply to every one of them. The specific\n // phases refine it: their presence grants just that op, and their rules\n // apply ON TOP of the umbrella's. An op is allowed iff its specific\n // phase or `write` exists. Rule mechanics per op: a `match` filters\n // UPDATE/DELETE and pins the column on INSERT; a `set` writes the\n // column on INSERT and UPDATE (delete writes no columns, so `delete`\n // is match-only at the type level).\n write?: ScopeRule[];\n insert?: ScopeRule[];\n update?: ScopeRule[];\n delete?: ScopeMatch[];\n };\n\nexport type ScopePolicy = {\n // Fallback for an entity that isn't listed, and for a listed entity's absent\n // phase: 'allow' = unrestricted, 'deny' = no access.\n default: 'allow' | 'deny';\n entities: Record<string, ScopeEntityRule>;\n};\n","import type { Query } from '../schemas/query.schema.js';\nimport type { Filter } from '../schemas/filter.schema.js';\nimport type { ResolvedQuery, ResolvedFilter, ResolvedSource, ResolvedJoin } from '../engine/engine.types.js';\nimport type { ScopePolicy, ScopeEntityRule, ScopeMatch } from './scope.types.js';\nimport { isSetMatch } from './scope.types.js';\nimport { VexError } from '../errors.js';\n\n// ───────────────────────────────────────────────────────────────\n// Error\n// ───────────────────────────────────────────────────────────────\n\n// A scope denial IS a VexError (code 'scope_denied') so the HTTP layer maps\n// it to a 400 like every other request error — a denied read or write is the\n// caller's problem, not a 500. `entity` is kept for callers that inspect it.\nexport class VexScopeError extends VexError {\n readonly entity: string;\n\n constructor(entity: string, message: string) {\n super('scope_denied', message);\n this.name = 'VexScopeError';\n this.entity = entity;\n }\n}\n\n// ───────────────────────────────────────────────────────────────\n// TWO QUESTIONS, DELIBERATELY SEPARATED\n// ───────────────────────────────────────────────────────────────\n//\n// Scope answers two things that used to be answered in one pass, and\n// conflating them produced a silent, universal row-loss bug:\n//\n// 1. MAY this caller touch this table at all? — a pure allow/deny over\n// entity names. Needs no schema, no aliases, no joins. Runs before\n// resolution, over every entity discovered anywhere in the tree.\n//\n// 2. WHERE does the row rule go? — needs to know HOW the table is reached,\n// because a row rule on a LEFT-joined table belongs in that join's ON\n// clause. It used to be merged into the DSL's `filter`, which compiles to\n// WHERE, which turns every LEFT join into an INNER one: a driving row\n// whose optional FK is null gets null-padded columns, `null = $tenant` is\n// null rather than true, and the row vanishes. No error, no warning, a\n// shorter list. It hid for as long as no data had a null FK.\n//\n// Only the resolver knows join kinds, so (2) moved after resolution. That also\n// means scope no longer writes anything into the authored `Query` — the\n// document integrations ship over the wire carries no engine-trusted field,\n// which is a property worth having on its own.\n\nconst matchesFor = (entity: string, rule: ScopeEntityRule | undefined, def: 'allow' | 'deny'): ScopeMatch[] => {\n if (rule === undefined) {\n if (def === 'deny') throw new VexScopeError(entity, `Entity \"${entity}\" is not allowed by scope policy (default: deny)`);\n return [];\n }\n if ('public' in rule) return [];\n if ('deny' in rule) throw new VexScopeError(entity, `Entity \"${entity}\" is denied by scope policy`);\n if (rule.read === undefined) {\n if (def === 'deny') throw new VexScopeError(entity, `Reads of \"${entity}\" are not allowed by scope policy (default: deny)`);\n return [];\n }\n return rule.read;\n};\n\n// Whether a policy lets a caller read a table at all — the same answer\n// `checkScope` enforces, as a predicate for anything that must decide what to\n// SHOW (discovery, the schema a generating agent is handed) rather than what\n// to refuse.\nexport const canReadTable = (policy: ScopePolicy, table: string): boolean => {\n const rule = policy.entities[table];\n if (rule === undefined) return policy.default === 'allow';\n if ('public' in rule) return true;\n if ('deny' in rule) return false;\n return rule.read !== undefined || policy.default === 'allow';\n};\n\n// ───────────────────────────────────────────────────────────────\n// 1. May they touch it\n// ───────────────────────────────────────────────────────────────\n\n// Throws on the first denied entity. A denied entity ANYWHERE denies the query,\n// including inside a subquery or an `exists` — `discoverEntities` walks the\n// whole tree, so a table cannot be reached by hiding it one level down.\nexport const checkScope = (entities: Set<string>, policy: ScopePolicy): void => {\n for (const entity of entities) matchesFor(entity, policy.entities[entity], policy.default);\n};\n\n// ───────────────────────────────────────────────────────────────\n// 2. Where the row rule goes\n// ───────────────────────────────────────────────────────────────\n\nconst andMerge = (existing: ResolvedFilter | undefined, additions: ResolvedFilter[]): ResolvedFilter | undefined => {\n if (additions.length === 0) return existing;\n const all = existing === undefined ? additions : [existing, ...additions];\n if (all.length === 1) return all[0];\n\n const paths = new Map<string, { alias: string; column: string; schema: never }>();\n for (const part of all) for (const [key, value] of part.resolvedPaths) paths.set(key, value as never);\n return { original: { and: all.map((f) => f.original) }, resolvedPaths: paths as never };\n};\n\n// One row rule, resolved against the alias the table actually got.\nconst predicateFor = (\n entityName: string,\n alias: string,\n match: ScopeMatch,\n fields: { name: string; nullable: boolean }[],\n): ResolvedFilter | undefined => {\n const field = fields.find((f) => f.name === match.match);\n // A rule naming a column the table does not have is a policy bug, not a\n // request bug — but failing the read closed is the only safe reading of it.\n if (field === undefined) throw new VexScopeError(entityName, `Scope rule for \"${entityName}\" names column \"${match.match}\", which the table does not have`);\n const path = `${entityName}.${match.match}`;\n // The set-valued form compiles to `col = ANY($n)`, which the operator table\n // already emits for `in` against a scope ref — so a reach covering several\n // rows needs no compile branch of its own, and binds through the same slot\n // machinery. An absent or empty set matches nothing (see scope.types.ts).\n const original: Filter = isSetMatch(match)\n ? { in: [path, { $scope: match.in }] }\n : { eq: [path, { $scope: match.to }] };\n return { original, resolvedPaths: new Map([[path, { alias, column: match.match, schema: field as never }]]) as never };\n};\n\n// One LEVEL of a resolved tree — an outer query, a subquery, or an `exists`.\n// They differ in what else they carry; for placing row rules they are the same\n// four things, so they get the same code and cannot drift apart.\ntype ScopeLevel = {\n sources: ResolvedSource[];\n joins: ResolvedJoin[];\n aliasMap: Map<string, string>;\n filter?: ResolvedFilter;\n};\n\nconst placeInto = (level: ScopeLevel, policy: ScopePolicy): void => {\n const whereAdditions: ResolvedFilter[] = [];\n\n for (const source of level.sources) {\n const entity = source.entity;\n if (entity === undefined) continue;\n\n const join = level.joins.find((j) => j.toAlias === source.alias);\n for (const match of matchesFor(entity.name, policy.entities[entity.name], policy.default)) {\n const predicate = predicateFor(entity.name, source.alias, match, entity.fields);\n if (predicate === undefined) continue;\n\n // The compiler resolves `entity.column` through the alias map, and these\n // predicates never went through the resolver's field pass, so they say\n // where they point.\n level.aliasMap.set(`${entity.name}.${match.match}`, `${source.alias}.${match.match}`);\n\n if (join !== undefined && join.kind === 'left') join.on = [...(join.on ?? []), predicate];\n else whereAdditions.push(predicate);\n }\n }\n\n const merged = andMerge(level.filter, whereAdditions);\n if (merged !== undefined) level.filter = merged;\n};\n\n// Walk the resolved tree and place every row rule. Subqueries and `exists`\n// nodes recurse: a rule on `tasks` lands inside the level whose FROM actually\n// reads tasks, never on an outer query that only sees an alias.\n//\n// The `exists` recursion is not tidiness — it is the boundary. An EXISTS\n// returns a boolean, but a boolean about somebody else's rows is still an\n// answer about somebody else's rows: an uncorrelated `exists` over a scoped\n// table would report whether ANY tenant has such a row. Access-checking the\n// table is not enough; the rule has to be inside the subquery too.\nexport const scopeResolved = (resolved: ResolvedQuery, policy: ScopePolicy): ResolvedQuery => {\n for (const source of resolved.sources) {\n if (source.subquery !== undefined) scopeResolved(source.subquery, policy);\n }\n\n // Every `exists` at every depth — the resolver collects nested ones into the\n // same flat map, so one pass covers the tree.\n for (const node of resolved.existsMap?.values() ?? []) {\n placeInto(node, policy);\n }\n\n placeInto(resolved, policy);\n return resolved;\n};\n\n// ───────────────────────────────────────────────────────────────\n// Deprecated shape, kept so a caller that only wanted the access check still\n// gets one. It no longer returns a filtered DSL, because scope is not a DSL\n// concern any more — `scopeResolved` does the placing.\n// ───────────────────────────────────────────────────────────────\nexport const applyScope = (dsl: Query, entities: Set<string>, policy: ScopePolicy): Query => {\n checkScope(entities, policy);\n return dsl;\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 { ContextContract, ParamSlot } from '../adapters/adapter.types.js';\n\n// ───────────────────────────────────────────────────────────────\n// Validation context builder\n// ───────────────────────────────────────────────────────────────\n\nconst defaultForType = (type: ParamSlot['type']): unknown => {\n if (type === 'string') return '';\n if (type === 'number') return 0;\n if (type === 'boolean') return false;\n if (type === 'string[]') return [''];\n if (type === 'number[]') return [0];\n if (type === 'json') return [];\n return '';\n};\n\nexport const buildValidationContext = (contract: ContextContract): Record<string, unknown> => {\n const ctx: Record<string, unknown> = {};\n for (const key of Object.keys(contract)) {\n const slot = contract[key];\n if (slot === undefined) continue;\n // Skip semantic slots — handled separately by the test path\n if (slot.kind === 'semantic') continue;\n ctx[key] = defaultForType(slot.type);\n }\n return ctx;\n};\n\n// ───────────────────────────────────────────────────────────────\n// Parameter resolution\n// ───────────────────────────────────────────────────────────────\n\nexport const resolveParams = async (\n slots: ParamSlot[],\n context: Record<string, unknown>,\n scope: Record<string, unknown>,\n embed?: (text: string, dimensions?: number) => Promise<number[]>,\n): Promise<unknown[]> => {\n const results: unknown[] = [];\n\n for (const slot of slots) {\n if (slot.kind === 'context') {\n results.push(context[slot.key]);\n continue;\n }\n\n if (slot.kind === 'scope') {\n results.push(scope[slot.key]);\n continue;\n }\n\n // kind === 'semantic'\n if (embed === undefined) {\n throw new Error(`Semantic parameter \"${slot.key}\" requires an embed function`);\n }\n const text = context[slot.key];\n if (typeof text !== 'string') {\n throw new Error(`Semantic parameter \"${slot.key}\" requires a string value in context`);\n }\n const vector = await embed(text, slot.dimensions);\n results.push(`[${vector.join(',')}]`);\n }\n\n return results;\n};\n","import type { CompiledQuery, Row, DatabaseAdapter } from '../adapters/adapter.types.js';\nimport type { ContextMeta } from '../schemas/request.schema.js';\nimport { resolveParams } from '../utils/context.js';\nimport { VexError } from '../errors.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Execution\n// ═══════════════════════════════════════════════════════════════\n\nexport const executeQuery = async (\n compiled: CompiledQuery,\n context: Record<string, unknown>,\n scope: Record<string, unknown>,\n adapter: DatabaseAdapter,\n embed?: (text: string, dimensions?: number) => Promise<number[]>,\n): Promise<Row[]> => {\n const boundParams = await resolveParams(\n compiled.paramSlots,\n context,\n scope,\n embed,\n );\n return adapter.execute(compiled, boundParams);\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Context contract builder\n// ═══════════════════════════════════════════════════════════════\n\nexport const buildContextContract = (\n compiled: CompiledQuery,\n // Every key that controls an `optional` condition anywhere in the STORED\n // dsl — including the ones this run pruned away, which have no slot and so\n // would otherwise be invisible to the caller who most needs to know they\n // exist: the one who did not send them.\n optionalKeys: readonly string[] = [],\n): Record<string, ContextMeta> => {\n const contract: Record<string, ContextMeta> = {};\n\n for (const slot of compiled.paramSlots) {\n contract[slot.key] = {\n type: slot.type,\n kind: slot.kind,\n ...(optionalKeys.includes(slot.key) ? { optional: true as const } : {}),\n };\n }\n\n for (const key of optionalKeys) {\n if (contract[key] !== undefined) continue;\n contract[key] = { kind: 'context', optional: true, absent: true };\n }\n\n return contract;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Missing context detection\n// ═══════════════════════════════════════════════════════════════\n\n// The CALLER's half: context keys the request did not supply. A read with\n// holes answers empty and hands back the contract it missed — the caller can\n// fix that. Scope is not in here; see requireScope.\nexport const findMissingContext = (\n compiled: CompiledQuery,\n context: Record<string, unknown>,\n): string[] => {\n const missing: string[] = [];\n\n for (const slot of compiled.paramSlots) {\n if ((slot.kind === 'context' || slot.kind === 'semantic') && context[slot.key] === undefined) {\n missing.push(slot.key);\n }\n }\n\n return missing;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Missing scope — the HOST's half\n// ═══════════════════════════════════════════════════════════════\n\n// A `$scope` slot the host did not fill is not a hole a caller can mend: the\n// caller cannot supply scope, and binding it would bind NULL — which matches\n// no row on a read and STAMPS NULL on a write. So it refuses, loudly, before\n// anything runs. The keys ride in `details` for the host's logs; the HTTP\n// layer does not hand them to the client.\nexport const requireScope = (compiled: { paramSlots: readonly { kind: string; key: string }[] }, scope: Record<string, unknown>): void => {\n const missing = [...new Set(compiled.paramSlots.filter((slot) => slot.kind === 'scope' && scope[slot.key] === undefined).map((slot) => slot.key))];\n if (missing.length > 0) {\n throw new VexError('missing_scope', `This statement is scoped by ${missing.join(', ')}, which the host did not supply.`, { keys: missing });\n }\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 { createHash } from 'node:crypto';\nimport type { DatabaseSchema } from '../schemas/database.schema.js';\n\n// ───────────────────────────────────────────────────────────────\n// Shape normalization\n// ───────────────────────────────────────────────────────────────\n\nconst isRecord = (value: unknown): value is Record<string, unknown> =>\n value !== null && typeof value === 'object' && !Array.isArray(value);\n\nexport const normalizeShape = (shape: unknown): unknown => {\n if (shape === null) return 'null';\n if (shape === undefined) return 'unknown';\n\n if (Array.isArray(shape)) {\n // Collapse to first-element shape (all elements assumed same shape)\n const first: unknown = shape[0];\n return first !== undefined ? [normalizeShape(first)] : [];\n }\n\n if (isRecord(shape)) {\n const sortedKeys = Object.keys(shape).sort();\n const normalized: Record<string, unknown> = {};\n for (const key of sortedKeys) {\n normalized[key] = normalizeShape(shape[key]);\n }\n return normalized;\n }\n\n if (typeof shape === 'string') return 'string';\n if (typeof shape === 'number') return 'number';\n if (typeof shape === 'boolean') return 'boolean';\n\n // functions, symbols, bigint, etc.\n return 'unknown';\n};\n\n// ───────────────────────────────────────────────────────────────\n// Fingerprints\n//\n// The ONE cache identity. Minted (`fp_…`) when a request arrives\n// without one — an immutable pin the caller can embed and replay.\n// Caller-chosen strings are mutable named slots. Shape hashes are no\n// longer keys anywhere; normalizeShape survives only inside\n// computeRequestHash (request-identity comparison).\n// ───────────────────────────────────────────────────────────────\n\nexport const mintFingerprint = (): string =>\n `fp_${createHash('sha256').update(`${Date.now()}:${Math.random()}`).digest('hex').slice(0, 16)}`;\n\n// ───────────────────────────────────────────────────────────────\n// Schema fingerprint\n//\n// A hash of the *structural* (DDL) shape of the database schema, stored\n// on each cache entry so a cached DSL — which references concrete\n// columns — can be invalidated when the schema changes out from under it\n// (a dropped/renamed column would otherwise compile to broken SQL on a\n// cache hit).\n//\n// Critically, this must be STABLE across restarts for an unchanged\n// schema, or warm-up entries would be wrongly judged stale and thrown\n// away on first read. So we project to a canonical, sorted form and\n// deliberately exclude volatile data: rowCount (a drifting pg estimate)\n// and cosmetic fields (description, defaultValue). A row-count change is\n// not a schema change — the cached SQL is still valid.\n// ───────────────────────────────────────────────────────────────\n\n// ───────────────────────────────────────────────────────────────\n// Request identity hash\n//\n// Unlike the shape hash (which keys the positive cache and intentionally\n// ignores intent), this identifies the *whole request*: intent + shape\n// class + the set of context keys. It keys things where intent matters —\n// the negative cache (whether a request is satisfiable depends on the\n// intent, not just the output shape) and single-flight de-duplication of\n// concurrent identical misses. Context *values* are excluded (runtime\n// data, potentially sensitive); only the key names participate.\n// ───────────────────────────────────────────────────────────────\n\nexport const computeRequestHash = (request: {\n intent?: string;\n shape?: unknown;\n context?: Record<string, unknown>;\n}): string => {\n const identity = {\n intent: request.intent ?? null,\n shape: normalizeShape(request.shape),\n contextKeys: Object.keys(request.context ?? {}).sort(),\n };\n return createHash('sha256').update(JSON.stringify(identity)).digest('hex');\n};\n\n// Which POLICY a generation ran under — part of the single-flight and\n// negative-cache keys, because an agent that can see different tables is a\n// different agent. Key order is normalised so two structurally equal policies\n// built in different orders share a key. `none` is the engine with no policy.\nconst canonical = (value: unknown): unknown => {\n if (Array.isArray(value)) return value.map(canonical);\n if (isRecord(value)) {\n const out: Record<string, unknown> = {};\n for (const key of Object.keys(value).sort()) out[key] = canonical(value[key]);\n return out;\n }\n return value;\n};\n\nexport const computePolicyKey = (policy: unknown): string =>\n policy === undefined ? 'none' : createHash('sha256').update(JSON.stringify(canonical(policy))).digest('hex').slice(0, 16);\n\nexport const computeSchemaFingerprint = (schema: DatabaseSchema): string => {\n const byName = (a: { name: string }, b: { name: string }) => a.name.localeCompare(b.name);\n\n const stable = {\n entities: [...schema.entities].sort(byName).map((e) => ({\n name: e.name,\n table: e.table,\n fields: [...e.fields].sort(byName).map((f) => ({\n name: f.name,\n type: f.type,\n normalizedType: f.normalizedType,\n nullable: f.nullable,\n primaryKey: f.primaryKey,\n ...(f.vectorDimensions !== undefined ? { vectorDimensions: f.vectorDimensions } : {}),\n })),\n // Column order within a relation is the key's own order, so it is\n // preserved; relations are sorted by target and columns. This shape\n // changed when keys became composite, so every entry cached before\n // revalidates once on the next boot — the drift eviction, by design.\n relations: [...e.relations]\n .sort((a, b) => `${a.entity}.${a.localFields.join(',')}`.localeCompare(`${b.entity}.${b.localFields.join(',')}`))\n .map((r) => ({ type: r.type, entity: r.entity, localFields: r.localFields, foreignFields: r.foreignFields })),\n // Index field order is significant (composite indexes) and stable\n // from introspection, so it is preserved; indexes are sorted by name.\n indexes: [...e.indexes].sort(byName).map((i) => ({\n name: i.name,\n fields: i.fields,\n unique: i.unique,\n type: i.type,\n })),\n })),\n };\n\n return createHash('sha256').update(JSON.stringify(stable)).digest('hex');\n};\n","import type { CacheEntry } from './cache.types.js';\n\n/**\n * Run a promise we don't want to await (background writes, hit bumps,\n * evictions). Failures are routed to `onError` or logged, never thrown\n * into the caller's path.\n */\nexport const fireAndForget = (p: Promise<unknown>, onError?: (err: unknown) => void): void => {\n void p.catch((err) => {\n if (onError) onError(err);\n else console.error('[vex:cache]', err);\n });\n};\n\n/**\n * How often a replay stamps `lastUsedAt`. The stamp rewrites the entry, and\n * a stamp on EVERY replay made every read a write too; once a minute keeps\n * what reads it — the sweep (idle limits of days), discovery's \"last used\" —\n * accurate to the minute, for a write per fingerprint per minute at most.\n */\nexport const TOUCH_EVERY_MS = 60_000;\n\n/** Whether a replay at `now` should stamp this entry's `lastUsedAt`. */\nexport const isTouchDue = (entry: CacheEntry, now: number): boolean =>\n entry.lastUsedAt === undefined || now - entry.lastUsedAt >= TOUCH_EVERY_MS;\n\n/**\n * Pure freshness check (no side effects). An entry is fresh when it is\n * not past its TTL and was written against the current schema. A\n * different fingerprint means the entry's DSL may reference columns that\n * have since changed. Callers decide whether to evict a non-fresh entry.\n */\nexport const isEntryFresh = (entry: CacheEntry, currentFingerprint?: string): boolean => {\n const expired = entry.expiresAt !== undefined && entry.expiresAt <= Date.now();\n const stale =\n entry.schemaFingerprint !== undefined &&\n currentFingerprint !== undefined &&\n entry.schemaFingerprint !== currentFingerprint;\n return !expired && !stale;\n};\n\n/**\n * Lifetime = usage. Evicts unprotected entries that have not been\n * replayed within `maxIdleMs` (falling back to createdAt for entries\n * never touched). Protected entries never sweep. Run it on whatever\n * cadence suits the app (startup, a timer, a cron) — it is hygiene,\n * not a correctness requirement: entries are single-digit KB.\n */\nexport const sweepCache = async (\n cache: {\n entries?: () => Promise<Array<{ key: string; entry: CacheEntry }>>;\n keys: () => Promise<string[]>;\n get: (key: string) => Promise<CacheEntry | undefined>;\n delete: (key: string) => Promise<void>;\n },\n options: { maxIdleMs: number },\n): Promise<number> => {\n const cutoff = Date.now() - options.maxIdleMs;\n const rows = cache.entries !== undefined\n ? await cache.entries()\n : await Promise.all((await cache.keys()).map(async (key) => ({ key, entry: await cache.get(key) })));\n\n let evicted = 0;\n for (const { key, entry } of rows) {\n if (entry === undefined) continue;\n if (entry.protected === true) continue;\n const lastAlive = entry.lastUsedAt ?? entry.createdAt;\n if (lastAlive < cutoff) {\n await cache.delete(key);\n evicted += 1;\n }\n }\n return evicted;\n};\n","import { createHash } from 'node:crypto';\n\n// ═══════════════════════════════════════════════════════════════\n// Canonical JSON — one text per value, whatever order its keys arrived in.\n//\n// Stored definitions round-trip through jsonb, which reorders object keys,\n// and a value compared by its first serialisation would call every such row\n// \"changed\". Keys are sorted recursively; arrays keep their order, because\n// their order is part of what they mean.\n// ═══════════════════════════════════════════════════════════════\n\nexport const canonical = (value: unknown): unknown => {\n if (Array.isArray(value)) return value.map(canonical);\n if (value !== null && typeof value === 'object' && !(value instanceof Date)) {\n const sorted: Record<string, unknown> = {};\n for (const [key, inner] of Object.entries(value).sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0))) sorted[key] = canonical(inner);\n return sorted;\n }\n return value;\n};\n\nexport const canonicalText = (value: unknown): string => JSON.stringify(canonical(value)) ?? 'undefined';\n\nexport const hashText = (text: string): string => createHash('sha256').update(text).digest('hex');\n\nexport const canonicalHash = (value: unknown): string => hashText(canonicalText(value));\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 { 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 type { ParamSlot } from '../adapter.types.js';\nimport type { FieldSchema } from '../../schemas/database.schema.js';\nimport type { ResolvedExists, ResolvedJoin } from '../../engine/engine.types.js';\nimport { RESERVED_CONTEXT_KEYS } from '../../schemas/request.schema.js';\nimport { refuseOptional } from '../../engine/optional.js';\nimport { VexError } from '../../errors.js';\nimport { isFieldPathShape } from '../../schemas/identifier.schema.js';\n\n// A `$context` ref naming a reserved sort key would otherwise become a bound\n// param; reject it at compile so reserved keys only ever drive ORDER BY.\nconst assertNotReserved = (key: string): void => {\n if (RESERVED_CONTEXT_KEYS.has(key))\n throw new VexError(\n 'invalid_dsl',\n `\"${key}\" is a reserved sort key (applied to ORDER BY); it cannot be bound as a parameter.`,\n );\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Types\n// ═══════════════════════════════════════════════════════════════\n\ntype PathResolution = { alias: string; column: string; schema: FieldSchema };\n\ntype CompilationContext = {\n resolvedPaths: Map<string, PathResolution>;\n aliasMap: Map<string, string>;\n paramSlots: ParamSlot[];\n paramCounter: { value: number };\n // Every `exists` in this query's filter, resolved. Keyed by the node, because\n // the compiler walks the raw filter tree and needs to find the resolution for\n // the node in front of it.\n existsMap?: Map<object, ResolvedExists>;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// FieldOrValue compilation\n// ═══════════════════════════════════════════════════════════════\n\n// ═══════════════════════════════════════════════════════════════\n// SQL TEXT — the only three ways authored input reaches a statement.\n//\n// · a COLUMN, which must have resolved against the introspected schema —\n// `columnOf` emits the resolver's alias.column or refuses. There is no\n// \"pass it through\" branch, anywhere: the fallback that used to exist here\n// pasted whatever string sat in a field position into the statement.\n// · a LITERAL, quoted by `quoteLiteral` exactly as Postgres's own\n// quote_literal() does, so it is safe whatever standard_conforming_strings\n// says.\n// · an OUTPUT NAME, quoted by `quoteIdent`.\n//\n// Values from a request never reach text at all: they bind as parameters.\n// ═══════════════════════════════════════════════════════════════\n\nexport const quoteLiteral = (s: string): string => {\n const doubled = s.replace(/'/g, \"''\");\n // With standard_conforming_strings off, a backslash in '…' is an escape and\n // `\\'` closes the string. The E'' form escapes backslashes explicitly, so the\n // literal means the same thing under either setting.\n return s.includes('\\\\') ? `E'${doubled.replace(/\\\\/g, '\\\\\\\\')}'` : `'${doubled}'`;\n};\n\nexport const quoteIdent = (name: string): string => `\"${name.replace(/\"/g, '\"\"')}\"`;\n\n// A number that is not finite has no SQL spelling — `NaN` would read as a name.\nexport const numberLiteral = (n: number): string => {\n if (!Number.isFinite(n)) throw new VexError('invalid_dsl', `${String(n)} is not a number SQL can hold.`);\n return String(n);\n};\n\nconst columnOf = (path: string, ctx: CompilationContext): string => {\n const mapped = ctx.aliasMap.get(path);\n if (mapped !== undefined) return mapped;\n const res = ctx.resolvedPaths.get(path);\n if (res !== undefined) return `${res.alias}.${res.column}`;\n throw new VexError('invalid_dsl', `\"${path}\" is not a column this query reads.`);\n};\n\nconst isFieldPath = isFieldPathShape;\n\nconst inferParamType = (path: string, resolvedPaths: Map<string, PathResolution>): ParamSlot['type'] => {\n const res = resolvedPaths.get(path);\n if (res === undefined) return 'string';\n const nt = res.schema.normalizedType;\n if (nt === 'number') return 'number';\n if (nt === 'boolean') return 'boolean';\n return 'string';\n};\n\nexport const compileFieldOrValue = (\n fov: FieldOrValue,\n ctx: CompilationContext,\n): string => {\n if (fov === null) return 'NULL';\n if (typeof fov === 'boolean') return fov ? 'TRUE' : 'FALSE';\n if (typeof fov === 'number') return numberLiteral(fov);\n\n if (typeof fov === 'string') {\n // Shaped like a column → it is one, and it resolved (or this refuses).\n // Anything else is a literal.\n return isFieldPath(fov) ? columnOf(fov, ctx) : quoteLiteral(fov);\n }\n\n // Object: $context or $scope — after eliminating primitives, only these remain\n if (typeof fov === 'object' && fov !== null && '$context' in fov) {\n const key = fov.$context;\n assertNotReserved(key);\n ctx.paramCounter.value += 1;\n ctx.paramSlots.push({\n key,\n kind: 'context',\n type: inferParamType(key, ctx.resolvedPaths),\n });\n return `$${ctx.paramCounter.value}`;\n }\n\n if (typeof fov === 'object' && fov !== null && '$scope' in fov) {\n const key = fov.$scope;\n ctx.paramCounter.value += 1;\n ctx.paramSlots.push({\n key,\n kind: 'scope',\n type: inferParamType(key, ctx.resolvedPaths),\n });\n return `$${ctx.paramCounter.value}`;\n }\n\n return 'NULL';\n};\n\n\n// ═══════════════════════════════════════════════════════════════\n// Join pairs\n//\n// The whole key, one equality per column pair, for the query's joins and\n// the joins inside an `exists` alike — two emitters, one rule, so a\n// composite key can never be half-joined in one of them.\n// ═══════════════════════════════════════════════════════════════\n\nexport const compileJoinPairs = (join: ResolvedJoin): string[] =>\n join.fromColumns.map((column, i) => {\n const to = join.toColumns[i];\n if (to === undefined) {\n throw new VexError(\n 'invalid_dsl',\n `The join from \"${join.fromAlias}\" to \"${join.toAlias}\" pairs \"${column}\" with no column.`,\n );\n }\n return `${join.fromAlias}.${column} = ${join.toAlias}.${to}`;\n });\n\n// ═══════════════════════════════════════════════════════════════\n// Filter compilation\n// ═══════════════════════════════════════════════════════════════\n\nconst compileComparisonFilter = (\n op: string,\n pair: [FieldOrValue, FieldOrValue],\n ctx: CompilationContext,\n): string => {\n const left = compileFieldOrValue(pair[0], ctx);\n const right = compileFieldOrValue(pair[1], ctx);\n return `${left} ${op} ${right}`;\n};\n\nexport const compileFilter = (\n filter: Filter,\n ctx: CompilationContext,\n): string => {\n // EXISTS compiles INLINE, into the parent's own parameter counter and slot\n // list. That is deliberate: the other subquery path compiles independently\n // and then tries to renumber, which is how two parameterised subqueries came\n // to collide on $1. There is nothing to renumber if nothing was numbered\n // separately.\n //\n // `SELECT 1` because EXISTS asks whether a row is there, not what is in it.\n if ('exists' in filter) {\n const resolved = ctx.existsMap?.get(filter.exists);\n if (resolved === undefined) throw new VexError('invalid_dsl', 'An \"exists\" filter was not resolved. It must appear in a query\\'s own filter.');\n\n const inner: CompilationContext = {\n ...ctx,\n resolvedPaths: resolved.filter?.resolvedPaths ?? ctx.resolvedPaths,\n // The inner map LAYERS OVER the outer one, so an inner path resolves to\n // the inner alias and an outer path — the correlation — still resolves.\n aliasMap: new Map([...ctx.aliasMap, ...resolved.aliasMap]),\n };\n\n const parts: string[] = ['SELECT 1'];\n const first = resolved.sources[0];\n if (first?.table !== undefined) parts.push(`FROM ${first.table} AS ${first.alias}`);\n for (const join of resolved.joins) {\n const source = resolved.sources.find((s) => s.alias === join.toAlias);\n if (source?.table === undefined) continue;\n const keyword = join.kind === 'left' ? 'LEFT JOIN' : 'JOIN';\n const conditions = [\n ...compileJoinPairs(join),\n ...(join.on ?? []).map((extra) => compileFilter(extra.original, inner)),\n ];\n parts.push(`${keyword} ${source.table} AS ${join.toAlias} ON ${conditions.join(' AND ')}`);\n }\n if (resolved.filter !== undefined) parts.push(`WHERE ${compileFilter(resolved.filter.original, inner)}`);\n\n return `EXISTS (${parts.join(' ')})`;\n }\n\n if ('eq' in filter) return compileComparisonFilter('=', filter.eq, ctx);\n if ('neq' in filter) return compileComparisonFilter('<>', filter.neq, ctx);\n if ('gt' in filter) return compileComparisonFilter('>', filter.gt, ctx);\n if ('gte' in filter) return compileComparisonFilter('>=', filter.gte, ctx);\n if ('lt' in filter) return compileComparisonFilter('<', filter.lt, ctx);\n if ('lte' in filter) return compileComparisonFilter('<=', filter.lte, ctx);\n\n if ('in' in filter) {\n const col = columnOf(filter.in[0], ctx);\n const target = filter.in[1];\n\n if (Array.isArray(target)) {\n const values = target.map((v) => compileFieldOrValue(v, ctx));\n return `${col} IN (${values.join(', ')})`;\n }\n\n // ContextRef or ScopeRef → array parameter\n if ('$context' in target) {\n assertNotReserved(target.$context);\n ctx.paramCounter.value += 1;\n ctx.paramSlots.push({ key: target.$context, kind: 'context', type: 'string[]' });\n return `${col} = ANY($${ctx.paramCounter.value})`;\n }\n if ('$scope' in target) {\n ctx.paramCounter.value += 1;\n ctx.paramSlots.push({ key: target.$scope, kind: 'scope', type: 'string[]' });\n return `${col} = ANY($${ctx.paramCounter.value})`;\n }\n\n return `${col} IN ()`;\n }\n\n if ('notIn' in filter) {\n const col = columnOf(filter.notIn[0], ctx);\n const target = filter.notIn[1];\n\n if (Array.isArray(target)) {\n const values = target.map((v) => compileFieldOrValue(v, ctx));\n return `${col} NOT IN (${values.join(', ')})`;\n }\n\n if ('$context' in target) {\n assertNotReserved(target.$context);\n ctx.paramCounter.value += 1;\n ctx.paramSlots.push({ key: target.$context, kind: 'context', type: 'string[]' });\n return `${col} <> ALL($${ctx.paramCounter.value})`;\n }\n if ('$scope' in target) {\n ctx.paramCounter.value += 1;\n ctx.paramSlots.push({ key: target.$scope, kind: 'scope', type: 'string[]' });\n return `${col} <> ALL($${ctx.paramCounter.value})`;\n }\n\n return `${col} NOT IN ()`;\n }\n\n if ('like' in filter) {\n const col = columnOf(filter.like[0], ctx);\n const pattern = compileFieldOrValue(filter.like[1], ctx);\n return `${col} LIKE ${pattern}`;\n }\n\n if ('ilike' in filter) {\n const col = columnOf(filter.ilike[0], ctx);\n const pattern = compileFieldOrValue(filter.ilike[1], ctx);\n return `${col} ILIKE ${pattern}`;\n }\n\n if ('isNull' in filter) {\n return `${columnOf(filter.isNull, ctx)} IS NULL`;\n }\n\n if ('isNotNull' in filter) {\n return `${columnOf(filter.isNotNull, ctx)} IS NOT NULL`;\n }\n\n if ('and' in filter) {\n const parts = filter.and.map((sub) => compileFilter(sub, ctx));\n return `(${parts.join(' AND ')})`;\n }\n\n if ('or' in filter) {\n const parts = filter.or.map((sub) => compileFilter(sub, ctx));\n return `(${parts.join(' OR ')})`;\n }\n\n if ('not' in filter) {\n const inner = compileFilter(filter.not, ctx);\n return `NOT (${inner})`;\n }\n\n if ('semantic' in filter) {\n // Semantic filter: cosine distance using pgvector <=> operator\n const fieldPath = filter.semantic.field;\n const col = columnOf(fieldPath, ctx);\n\n const queryRef = filter.semantic.query;\n const key = '$context' in queryRef ? queryRef.$context : queryRef.$scope;\n if ('$context' in queryRef) assertNotReserved(queryRef.$context);\n\n // Look up vector dimensions from resolved paths\n const res = ctx.resolvedPaths.get(fieldPath);\n const dimensions = res?.schema.vectorDimensions;\n\n ctx.paramCounter.value += 1;\n ctx.paramSlots.push({\n key,\n kind: 'semantic',\n type: 'string',\n dimensions,\n });\n\n const paramRef = `$${ctx.paramCounter.value}`;\n const minScore = numberLiteral(filter.semantic.minScore ?? 0);\n return `1 - (${col} <=> ${paramRef}) >= ${minScore}`;\n }\n\n if ('fuzzy' in filter) {\n const col = columnOf(filter.fuzzy.field, ctx);\n\n const queryRef = filter.fuzzy.query;\n const key = '$context' in queryRef ? queryRef.$context : queryRef.$scope;\n const kind = '$context' in queryRef ? 'context' as const : 'scope' as const;\n if ('$context' in queryRef) assertNotReserved(queryRef.$context);\n\n ctx.paramCounter.value += 1;\n ctx.paramSlots.push({ key, kind, type: 'string' });\n\n const paramRef = `$${ctx.paramCounter.value}`;\n const maxDistance = filter.fuzzy.maxDistance;\n\n if (maxDistance !== undefined) {\n return `levenshtein(${col}, ${paramRef}) <= ${numberLiteral(maxDistance)}`;\n }\n // pg_trgm similarity\n return `${col} % ${paramRef}`;\n }\n\n // Resolved away before the pipeline — see engine/optional.ts. Named\n // explicitly because the fallthrough below is `TRUE`: an unrecognised node\n // would quietly compile to \"match everything\", which for an optional\n // condition is the right answer reached by the wrong route, and for anything\n // else is a filter that silently stopped filtering.\n if ('optional' in filter) refuseOptional('SQL compilation');\n\n // Should not reach here if the filter was validated\n return 'TRUE';\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Compute expression compilation\n// ═══════════════════════════════════════════════════════════════\n\nexport const compileCompute = (\n expr: ComputeExpression,\n ctx: CompilationContext,\n): string => {\n if ('add' in expr) {\n const a = compileFieldOrValue(expr.add[0], ctx);\n const b = compileFieldOrValue(expr.add[1], ctx);\n return `(${a} + ${b})`;\n }\n\n if ('subtract' in expr) {\n const a = compileFieldOrValue(expr.subtract[0], ctx);\n const b = compileFieldOrValue(expr.subtract[1], ctx);\n return `(${a} - ${b})`;\n }\n\n if ('multiply' in expr) {\n const a = compileFieldOrValue(expr.multiply[0], ctx);\n const b = compileFieldOrValue(expr.multiply[1], ctx);\n return `(${a} * ${b})`;\n }\n\n if ('divide' in expr) {\n const a = compileFieldOrValue(expr.divide[0], ctx);\n const b = compileFieldOrValue(expr.divide[1], ctx);\n return `(${a} / ${b})`;\n }\n\n if ('concat' in expr) {\n const parts = expr.concat.map((v) => compileFieldOrValue(v, ctx));\n return `(${parts.join(' || ')})`;\n }\n\n if ('coalesce' in expr) {\n const parts = expr.coalesce.map((v) => compileFieldOrValue(v, ctx));\n return `COALESCE(${parts.join(', ')})`;\n }\n\n if ('case' in expr) {\n const whenClauses = expr.case.when.map((w) => {\n const cond = compileFilter(w.condition, ctx);\n const val = compileFieldOrValue(w.then, ctx);\n return `WHEN ${cond} THEN ${val}`;\n });\n const elseVal = compileFieldOrValue(expr.case.else, ctx);\n return `CASE ${whenClauses.join(' ')} ELSE ${elseVal} END`;\n }\n\n return 'NULL';\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Aggregate expression compilation\n// ═══════════════════════════════════════════════════════════════\n\n// SUM/AVG/MIN/MAX take a field path (mapped to its qualified column) OR a\n// compute expression (compiled to SQL). count stays a plain field/`*`.\nconst aggArg = (arg: string | ComputeExpression, ctx: CompilationContext): string =>\n typeof arg === 'string' ? columnOf(arg, ctx) : compileCompute(arg, ctx);\n\nexport const compileAggregate = (\n expr: AggregateExpression,\n ctx: CompilationContext,\n): string => {\n if ('count' in expr) {\n if (expr.count === '*') return 'COUNT(*)';\n return `COUNT(${columnOf(expr.count, ctx)})`;\n }\n if ('countDistinct' in expr) return `COUNT(DISTINCT ${columnOf(expr.countDistinct, ctx)})`;\n if ('sum' in expr) return `SUM(${aggArg(expr.sum, ctx)})`;\n if ('avg' in expr) return `AVG(${aggArg(expr.avg, ctx)})`;\n if ('min' in expr) return `MIN(${aggArg(expr.min, ctx)})`;\n if ('max' in expr) return `MAX(${aggArg(expr.max, ctx)})`;\n return 'NULL';\n};\n\nexport type { CompilationContext };\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 { transaction } = pool;\n const limit = perStatementMs;\n const result =\n limit === undefined || transaction === undefined\n ? await pool.query(query.sql, params)\n : await 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 { z } from 'zod';\nimport { FilterSchema } from '../schemas/filter.schema.js';\nimport type { Filter } from '../schemas/filter.schema.js';\nimport type { FieldOrValue } from '../schemas/value.schema.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Mutation grammar — the WRITE sibling of the query DSL.\n//\n// Closed on purpose. A mutation is authored data (a cache entry seeded by a\n// developer), never generated and never client-supplied: the wire replays a\n// fingerprint, and the def the fingerprint names lives server-side. The\n// grammar rejects the dangerous shapes at parse: `$scope` is unauthorable\n// (identity/tenant is engine-injected — see scopeMutation), and update/delete\n// REQUIRE a `where` (a write with no WHERE touches every row).\n// ═══════════════════════════════════════════════════════════════\n\n// A scalar subquery in value position: read ONE value from another table at\n// write time — `(SELECT field FROM from WHERE ...)`. This is how a statement\n// references a row it cannot otherwise name (e.g. a person found by email).\n// The lookup READS, so the read-phase scope rules of `from` are applied to its\n// WHERE by the engine — a write entry is never a read-scope bypass. The WHERE\n// should hit a unique key: more than one matching row is a runtime error\n// (deliberately — silently picking an arbitrary row would be worse).\nconst LookupSchema = z\n .object({\n $lookup: z\n .object({\n from: z.string().describe('Table the value is read from'),\n field: z.string().describe('Column the subquery returns'),\n where: FilterSchema.describe('Bounds the lookup — should match at most one row'),\n })\n .strict(),\n })\n .strict()\n .describe('Scalar subquery: reads one value from another table at write time; read scope rules apply');\n\n// A value an AUTHORED mutation may set: a literal, a `{ $context }` ref to\n// the caller's runtime values, or a `{ $lookup }` scalar subquery. NOT\n// `$scope` — the engine injects it post-parse, so a stored or injected\n// mutation cannot place, omit, or redirect it. NOT a field path either — a\n// write sets values, it does not read columns.\nconst ValueSchema = z.union([\n z.string(),\n z.number(),\n z.boolean(),\n z.null(),\n z.object({ $context: z.string() }).strict(),\n LookupSchema,\n]);\n\nconst Columns = z\n .record(z.string(), ValueSchema)\n .refine((r) => Object.keys(r).length > 0, { message: 'a write must set at least one column' });\n\n// ── ON CONFLICT ────────────────────────────────────────────────\n// The DB-arbitrated sibling of the `upsert` sugar below. `upsert` branches on\n// what the CALLER sent (key present → update); `onConflict` branches on what\n// the DATABASE holds (row exists → update/nothing), atomically. `target` must\n// name a unique constraint — validated against the introspected schema, so an\n// ON CONFLICT that arrests nothing is an authoring error, not a runtime\n// surprise. `set` present → DO UPDATE SET (RETURNING yields the row on both\n// paths — re-setting one inserted value as a no-op \"touch\" is the idiom for\n// create-or-fetch). `set` absent → DO NOTHING, which returns NO row on\n// conflict; callers can read that absence as \"already existed\".\nconst OnConflictSchema = z\n .object({\n target: z.array(z.string()).min(1).describe('Conflict columns — must match a unique index or the primary key'),\n set: Columns.optional().describe('DO UPDATE SET when the row already exists; omitted → DO NOTHING (no row returned on conflict)'),\n })\n .strict();\n\n// `where` is a real vex `Filter` — `$context`/`$scope` and scope injection\n// behave exactly as they do for reads.\nconst InsertSchema = z.object({ op: z.literal('insert'), table: z.string(), values: Columns, onConflict: OnConflictSchema.optional() }).strict();\nconst UpdateSchema = z.object({ op: z.literal('update'), table: z.string(), set: Columns, where: FilterSchema }).strict();\nconst DeleteSchema = z.object({ op: z.literal('delete'), table: z.string(), where: FilterSchema }).strict();\n\n// ── insertEach ─────────────────────────────────────────────────\n// One INSERT for a caller-sized list — `INSERT ... SELECT ... FROM\n// jsonb_array_elements($items)`. `items` names a context key holding an array\n// of objects; a `{ $item }` value reads a key from the current element (cast\n// to the column's type from the schema); every other value (literal,\n// `$context`, `$lookup`, engine-injected `$scope`) is constant across rows.\n// This is how \"one template row per ticked weekday\" stays a single authored\n// statement instead of a code loop.\nconst ItemRefSchema = z\n .object({ $item: z.string() })\n .strict()\n .describe('insertEach only: a key read from the current element of `items`');\n\nconst EachColumns = z\n .record(z.string(), z.union([ValueSchema, ItemRefSchema]))\n .refine((r) => Object.keys(r).length > 0, { message: 'a write must set at least one column' });\n\nconst InsertEachSchema = z\n .object({\n op: z.literal('insertEach'),\n table: z.string(),\n items: z.object({ $context: z.string() }).strict().describe('Context key holding an array of objects — one inserted row per element'),\n values: EachColumns,\n onConflict: OnConflictSchema.optional(),\n })\n .strict();\n\n// ── Sugar ──────────────────────────────────────────────────────\n// A sugar op rewrites to the core ops above before anything runs (see\n// desugarMutation). `upsert` is insert-or-update keyed on `key`: present in\n// the call's context → update that row, absent/empty → insert.\nconst UpsertSchema = z\n .object({\n op: z.literal('upsert'),\n table: z.string(),\n columns: Columns, // set on BOTH branches (update SET, and part of the insert)\n insert: Columns.optional(), // extra columns set ONLY on insert — immutable-on-create (e.g. a FK)\n key: z.string(),\n })\n .strict()\n .describe('Sugar: insert-or-update by `key` (e.g. \"id\"). Desugars to update (SET columns WHERE key) when the key is present, else insert (columns + `insert`-only).');\n\nexport const MutationSchema = z.discriminatedUnion('op', [InsertSchema, InsertEachSchema, UpdateSchema, DeleteSchema, UpsertSchema]);\nexport type Mutation = z.infer<typeof MutationSchema>;\n\n// The core ops a sugar desugars TO — what the pipeline (scope/validate/\n// compile) actually handles. `upsert` never reaches them.\nexport type CoreMutation = Exclude<Mutation, { op: 'upsert' }>;\n\n// One write, or a batch run together in a single transaction.\nexport const MutationDefinitionSchema = z.union([MutationSchema, MutationSchema.array().min(1)]);\nexport type MutationDefinition = z.infer<typeof MutationDefinitionSchema>;\n\n// The value shapes as the ENGINE sees them (authored + injected).\nexport type LookupValue = { $lookup: { from: string; field: string; where: Filter } };\nexport type ItemRef = { $item: string };\nexport type MutationValue = FieldOrValue | LookupValue;\n\n// After scopeMutation the engine may have injected `{ $scope }` refs that the\n// authored grammar forbids — so the resolved form's columns widen to the full\n// `MutationValue`. It may also have widened `onConflict` with a `where` (the\n// RLS filter on the DO UPDATE half — `match` rules land there when the\n// conflict target does not already pin them). Authored (`Mutation`) →\n// resolved is a pure widening.\nexport type ResolvedOnConflict = { target: string[]; set?: Record<string, MutationValue>; where?: Filter };\nexport type ResolvedMutation =\n | { op: 'insert'; table: string; values: Record<string, MutationValue>; onConflict?: ResolvedOnConflict }\n | { op: 'insertEach'; table: string; items: { $context: string }; values: Record<string, MutationValue | ItemRef>; onConflict?: ResolvedOnConflict }\n | { op: 'update'; table: string; set: Record<string, MutationValue>; where: Filter }\n | { op: 'delete'; table: string; where: Filter };\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 type { Query } from '../schemas/query.schema.js';\nimport type { Filter } from '../schemas/filter.schema.js';\nimport type { DatabaseSchema } from '../schemas/database.schema.js';\nimport type { Mutation, MutationDefinition, CoreMutation } from './schema.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Context signatures — the derived input contract of a cache entry.\n//\n// A fingerprint hides the def; the def contains `{ $context }` refs; the refs\n// sit at positions whose column types the schema knows. So the contract of\n// \"what do I pass this fingerprint\" is COMPUTED from the artifact — walked\n// out of the stored DSL/def — never authored, and therefore never stale.\n// Discovery serves it; the mutation error path teaches it.\n// ═══════════════════════════════════════════════════════════════\n\nexport type ContextField = { type: string; column?: string; note?: string };\nexport type ContextSignature = Record<string, ContextField>;\nexport type MutationEffect = { op: Mutation['op']; table: string; columns: string[] };\n\nconst isContextRef = (v: unknown): v is { $context: string } =>\n v !== null && typeof v === 'object' && !Array.isArray(v) && typeof (v as Record<string, unknown>)['$context'] === 'string';\n\nconst columnInfo = (path: string, schema: DatabaseSchema | undefined): ContextField => {\n const [table, field] = path.split('.');\n const entity = schema?.entities.find((e) => e.table === table || e.name === table);\n const f = entity?.fields.find((x) => x.name === field);\n return { type: f?.normalizedType ?? 'unknown', column: path };\n};\n\n// First specific description wins; a later, better-typed sighting upgrades an\n// 'unknown' one. Notes stick once set.\nconst addField = (sig: ContextSignature, key: string, field: ContextField): void => {\n const existing = sig[key];\n if (existing === undefined) {\n sig[key] = field;\n return;\n }\n if (existing.type === 'unknown' && field.type !== 'unknown') {\n sig[key] = { ...field, ...(existing.note !== undefined ? { note: existing.note } : {}) };\n }\n};\n\n// Last-resort sweep: find `{ $context }` anywhere in a value (compute args,\n// exotic filter ops) and record the key with an unknown type.\nconst deepScan = (value: unknown, sig: ContextSignature): void => {\n if (isContextRef(value)) {\n addField(sig, value.$context, { type: 'unknown' });\n return;\n }\n if (Array.isArray(value)) {\n for (const v of value) deepScan(v, sig);\n return;\n }\n if (value !== null && typeof value === 'object') {\n for (const v of Object.values(value)) deepScan(v, sig);\n }\n};\n\n// Comparison positions pair a field path with a value — when the value is a\n// `{ $context }` ref, the path's column gives the ref its type.\nconst COMPARISONS = ['eq', 'neq', 'gt', 'gte', 'lt', 'lte'] as const;\n\nconst walkFilter = (filter: Filter, schema: DatabaseSchema | undefined, sig: ContextSignature): void => {\n const f = filter as Record<string, unknown>;\n for (const op of COMPARISONS) {\n const pair = f[op];\n if (Array.isArray(pair) && pair.length === 2) {\n const [a, b] = pair as [unknown, unknown];\n if (typeof a === 'string' && isContextRef(b)) addField(sig, b.$context, columnInfo(a, schema));\n else if (typeof b === 'string' && isContextRef(a)) addField(sig, a.$context, columnInfo(b, schema));\n else deepScan(pair, sig);\n return;\n }\n }\n if ('in' in f || 'notIn' in f) {\n const [path, target] = (f['in'] ?? f['notIn']) as [string, unknown];\n if (isContextRef(target)) addField(sig, target.$context, { ...columnInfo(path, schema), type: `${columnInfo(path, schema).type}[]` });\n else deepScan(target, sig);\n return;\n }\n if ('like' in f || 'ilike' in f) {\n const [path, v] = (f['like'] ?? f['ilike']) as [string, unknown];\n if (isContextRef(v)) addField(sig, v.$context, { type: 'string', column: path, note: 'pattern' });\n return;\n }\n if ('and' in f || 'or' in f) {\n for (const sub of (f['and'] ?? f['or']) as Filter[]) walkFilter(sub, schema, sig);\n return;\n }\n if ('not' in f) {\n walkFilter(f['not'] as Filter, schema, sig);\n return;\n }\n // isNull / isNotNull carry no values; semantic/fuzzy and anything future get\n // the generic sweep so no ref is ever silently dropped.\n deepScan(f, sig);\n};\n\nconst isLookupRef = (v: unknown): v is { $lookup: { from: string; field: string; where: Filter } } =>\n v !== null && typeof v === 'object' && !Array.isArray(v) && '$lookup' in v;\n\nconst columnsOf = (m: Mutation): Record<string, unknown> =>\n m.op === 'insert' || m.op === 'insertEach'\n ? { ...m.values, ...(m.onConflict?.set ?? {}) }\n : m.op === 'update'\n ? m.set\n : m.op === 'upsert'\n ? { ...m.columns, ...(m.insert ?? {}) }\n : {};\n\nexport const collectMutationContext = (def: MutationDefinition, schema?: DatabaseSchema): ContextSignature => {\n const sig: ContextSignature = {};\n const list = Array.isArray(def) ? def : [def];\n for (const m of list) {\n for (const [col, v] of Object.entries(columnsOf(m))) {\n if (isLookupRef(v)) {\n // The lookup's WHERE binds context like any filter does.\n walkFilter(v.$lookup.where, schema, sig);\n continue;\n }\n if (!isContextRef(v)) continue;\n const insertOnly = m.op === 'upsert' && m.insert !== undefined && col in m.insert;\n addField(sig, v.$context, { ...columnInfo(`${m.table}.${col}`, schema), ...(insertOnly ? { note: 'insert only' } : {}) });\n }\n if (m.op === 'update' || m.op === 'delete') walkFilter(m.where, schema, sig);\n if (m.op === 'insertEach') {\n const itemKeys = Object.values(m.values)\n .filter((v): v is { $item: string } => v !== null && typeof v === 'object' && '$item' in v)\n .map((v) => v.$item);\n sig[m.items.$context] = { type: 'json', note: `array of objects — one inserted row per element${itemKeys.length > 0 ? ` (keys: ${itemKeys.join(', ')})` : ''}` };\n }\n if (m.op === 'upsert') {\n sig[m.key] = { ...columnInfo(`${m.table}.${m.key}`, schema), note: 'upsert key — present updates that row, absent/empty inserts' };\n }\n }\n return sig;\n};\n\nexport const collectQueryContext = (dsl: Query, schema?: DatabaseSchema): ContextSignature => {\n const sig: ContextSignature = {};\n const walkQuery = (q: Query): void => {\n for (const source of q.from) {\n if (typeof source !== 'string') walkQuery(source.query);\n }\n if (q.filter !== undefined) walkFilter(q.filter, schema, sig);\n if (q.compute !== undefined) deepScan(q.compute, sig);\n if (q.aggregate !== undefined) deepScan(q.aggregate, sig);\n };\n walkQuery(dsl);\n return sig;\n};\n\nexport const mutationEffect = (def: MutationDefinition): MutationEffect[] => {\n const list = Array.isArray(def) ? def : [def];\n return list.flatMap((m) => {\n const base: MutationEffect = { op: m.op, table: m.table, columns: Object.keys(columnsOf(m)).sort() };\n // ON CONFLICT DO UPDATE also updates — declare it, so visibility and\n // grants treat the entry as the insert-plus-update it really is.\n const conflictSet = (m.op === 'insert' || m.op === 'insertEach') && m.onConflict?.set !== undefined ? m.onConflict.set : undefined;\n if (conflictSet === undefined) return [base];\n return [base, { op: 'update', table: m.table, columns: Object.keys(conflictSet).sort() }];\n });\n};\n\n// The keys a DESUGARED core mutation actually binds — the hard requirement\n// checked before execution (an upsert's absent key is legal: it selects the\n// insert branch, so requirement is computed after desugaring).\nexport const requiredContextKeys = (m: CoreMutation): string[] => {\n const keys = new Set<string>();\n const cols = m.op === 'insert' || m.op === 'insertEach' ? { ...m.values, ...(m.onConflict?.set ?? {}) } : m.op === 'update' ? m.set : {};\n for (const v of Object.values(cols)) {\n if (isContextRef(v)) keys.add(v.$context);\n else if (isLookupRef(v)) {\n const sub: ContextSignature = {};\n deepScan(v.$lookup.where, sub);\n for (const k of Object.keys(sub)) keys.add(k);\n }\n }\n if (m.op === 'insertEach') keys.add(m.items.$context);\n if (m.op === 'update' || m.op === 'delete') {\n const sub: ContextSignature = {};\n deepScan(m.where, sub);\n for (const k of Object.keys(sub)) keys.add(k);\n }\n return [...keys].sort();\n};\n\n// Authoring lint (run by the seed path): an update/delete whose WHERE binds no\n// `$context` is not caller-bounded — its only row limit is the scope policy.\n// Loud at boot, never at runtime.\n// An `optional` condition is a READ construct. In a WHERE it would mean \"this\n// bound disappears when the caller omits a key\" — which is precisely the\n// unkeyed update the lint below exists to refuse, only reachable by omission\n// rather than by authoring. Writes keep the rule they have always had: every\n// key is mandatory, and a missing one is a hard `missing_context` (see\n// mutations/engine.ts), never a wider statement.\nconst findOptional = (value: unknown): boolean => {\n if (Array.isArray(value)) return value.some(findOptional);\n if (value === null || typeof value !== 'object') return false;\n if ('optional' in value) return true;\n return Object.values(value).some(findOptional);\n};\n\nexport const lintMutation = (def: MutationDefinition): string[] => {\n const issues: string[] = [];\n const list = Array.isArray(def) ? def : [def];\n for (const m of list) {\n if (findOptional(m)) {\n issues.push(`${m.op} on \"${m.table}\" contains an optional condition — a write's bounds cannot depend on what the caller chose to send`);\n }\n if (m.op !== 'update' && m.op !== 'delete') continue;\n const sub: ContextSignature = {};\n deepScan(m.where, sub);\n if (Object.keys(sub).length === 0) {\n issues.push(`${m.op} on \"${m.table}\" has no $context-keyed WHERE — the write is not caller-bounded`);\n }\n }\n return issues;\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","import { compileFilter, compileFieldOrValue, quoteLiteral } from '../adapters/postgres/operators.js';\nimport type { CompilationContext } from '../adapters/postgres/operators.js';\nimport type { ParamSlot, Row } from '../adapters/adapter.types.js';\nimport type { Filter } from '../schemas/filter.schema.js';\nimport type { DatabaseSchema } from '../schemas/database.schema.js';\nimport type { ScopePolicy, ScopeValues, ScopeMatch, ScopeRule } from '../scope/scope.types.js';\nimport { isSetMatch } from '../scope/scope.types.js';\nimport { VexScopeError } from '../scope/apply.js';\nimport { VexError } from '../errors.js';\nimport { isFieldPathShape } from '../schemas/identifier.schema.js';\nimport { resolveParams } from '../utils/context.js';\nimport { requireScope } from '../engine/executor.js';\nimport { MutationDefinitionSchema } from './schema.js';\nimport type { Mutation, MutationDefinition, CoreMutation, ResolvedMutation, ResolvedOnConflict, MutationValue, LookupValue, ItemRef } from './schema.js';\nimport { collectMutationContext, requiredContextKeys } from './signature.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Mutation engine — the write pipeline. Validate (closed grammar, bounded\n// WHERE) → desugar → require context → scope (RLS + identity stamp) → check\n// columns → compile → execute. Every gate runs before a single statement\n// does. Reuses the read pipeline's own machinery for SQL and params\n// (compileFilter / compileFieldOrValue / resolveParams), so values bind as\n// SQL parameters exactly as they do for reads — never inlined.\n// ═══════════════════════════════════════════════════════════════\n\n// The database the writes run against — structural, so PGlite, a pg Pool\n// wrapper, or a test double all fit without vex importing any driver.\nexport type MutationTx = {\n query: (sql: string, params?: unknown[]) => Promise<{ rows: unknown[] }>;\n};\nexport type MutationClient = MutationTx & {\n transaction?: <T>(fn: (tx: MutationTx) => Promise<T>) => Promise<T>;\n};\n\n// ─── Value guards ──────────────────────────────────────────────\nconst isLookup = (v: unknown): v is LookupValue =>\n v !== null && typeof v === 'object' && !Array.isArray(v) && '$lookup' in v;\nconst isItemRef = (v: unknown): v is ItemRef =>\n v !== null && typeof v === 'object' && !Array.isArray(v) && '$item' in v;\n\nconst collectLookups = (m: ResolvedMutation): LookupValue['$lookup'][] => {\n const out: LookupValue['$lookup'][] = [];\n const scan = (cols: Record<string, unknown> | undefined): void => {\n for (const v of Object.values(cols ?? {})) if (isLookup(v)) out.push(v.$lookup);\n };\n if (m.op === 'insert' || m.op === 'insertEach') {\n scan(m.values);\n scan(m.onConflict?.set);\n }\n if (m.op === 'update') scan(m.set);\n return out;\n};\n\n// ─── Schema validation (anti-hallucination) ────────────────────\n// The engine already introspected for reads; reject an unknown table or a\n// written column not in it. A misauthored `contats` / `naem` fails closed,\n// before any SQL runs.\nconst findEntity = (table: string, schema: DatabaseSchema) =>\n schema.entities.find((e) => e.table === table || e.name === table);\n\n// An ON CONFLICT whose target names no unique constraint never arrests\n// anything — the insert would simply throw on the real constraint, or worse,\n// never conflict at all. The schema knows the unique column sets (PK +\n// introspected unique indexes), so a mismatched target is an AUTHORING error,\n// caught before any SQL runs, with the real options in the message.\nconst assertConflictTarget = (table: string, target: string[], entity: { fields: { name: string; primaryKey: boolean }[]; indexes: { fields: string[]; unique: boolean }[] }): void => {\n const uniqueSets = [\n entity.fields.filter((f) => f.primaryKey).map((f) => f.name),\n ...entity.indexes.filter((i) => i.unique).map((i) => [...i.fields]),\n ].filter((s) => s.length > 0);\n if (uniqueSets.length === 0) return; // the schema carries no uniqueness info — nothing to check against\n const want = new Set(target);\n const ok = uniqueSets.some((s) => s.length === want.size && s.every((c) => want.has(c)));\n if (!ok) {\n throw new VexError(\n 'invalid_dsl',\n `onConflict target (${target.join(', ')}) does not match a unique constraint on \"${table}\". Unique column sets: ${uniqueSets.map((s) => `(${s.join(', ')})`).join(' ')}.`,\n );\n }\n};\n\n// Every column a write's filter names — field positions, and value positions\n// shaped like a column (the same rule the read compiler uses to tell a column\n// from a literal). A field position is collected whatever it looks like, so a\n// string that is not a column is refused by the check below instead of being\n// compiled.\nconst filterColumns = (filter: Filter): string[] => {\n const out: string[] = [];\n const value = (v: unknown): void => {\n if (isFieldPathShape(v)) out.push(v);\n };\n const walk = (f: Filter): void => {\n if ('and' in f) return f.and.forEach(walk);\n if ('or' in f) return f.or.forEach(walk);\n if ('not' in f) return walk(f.not);\n if ('eq' in f) return f.eq.forEach(value);\n if ('neq' in f) return f.neq.forEach(value);\n if ('gt' in f) return f.gt.forEach(value);\n if ('gte' in f) return f.gte.forEach(value);\n if ('lt' in f) return f.lt.forEach(value);\n if ('lte' in f) return f.lte.forEach(value);\n if ('in' in f || 'notIn' in f) {\n const [field, target] = 'in' in f ? f.in : f.notIn;\n out.push(field);\n if (Array.isArray(target)) target.forEach(value);\n return;\n }\n if ('like' in f || 'ilike' in f) {\n const [field, pattern] = 'like' in f ? f.like : f.ilike;\n out.push(field);\n return value(pattern);\n }\n if ('isNull' in f) return void out.push(f.isNull);\n if ('isNotNull' in f) return void out.push(f.isNotNull);\n if ('semantic' in f) return void out.push(f.semantic.field);\n if ('fuzzy' in f) return void out.push(f.fuzzy.field);\n // `exists` and `optional` have no single-table meaning in a write; the\n // compiler refuses both loudly.\n };\n walk(filter);\n return out;\n};\n\n// A write's filter reads ONE table — the one it writes, or the one a `$lookup`\n// reads — and every column it names must be that table's. This is what makes\n// the compiler's identity mapping below safe: nothing reaches it that the\n// schema does not have.\nconst assertFilterColumns = (filter: Filter, table: string, schema: DatabaseSchema, where: string): void => {\n const entity = findEntity(table, schema);\n if (entity === undefined) throw new VexError('invalid_dsl', `Unknown table \"${table}\" in ${where}.`);\n for (const path of filterColumns(filter)) {\n const dot = path.indexOf('.');\n const owner = path.slice(0, dot);\n const column = path.slice(dot + 1);\n if (!isFieldPathShape(path) || owner !== table || !entity.fields.some((f) => f.name === column)) {\n throw new VexError('invalid_dsl', `\"${path}\" in ${where} is not a column of \"${table}\".`);\n }\n }\n};\n\nconst assertWritableColumns = (m: ResolvedMutation, schema: DatabaseSchema): void => {\n const entity = findEntity(m.table, schema);\n if (entity === undefined) throw new VexError('invalid_dsl', `Unknown table \"${m.table}\".`);\n if (m.op === 'update' || m.op === 'delete') assertFilterColumns(m.where, m.table, schema, 'the WHERE');\n const known = new Set(entity.fields.map((f) => f.name));\n const cols = m.op === 'insert' || m.op === 'insertEach' ? Object.keys(m.values) : m.op === 'update' ? Object.keys(m.set) : [];\n for (const c of cols) {\n if (!known.has(c)) throw new VexError('invalid_dsl', `Unknown column \"${m.table}.${c}\".`);\n }\n // A lookup reads a real table and column, or fails closed like any other\n // misauthored name.\n for (const l of collectLookups(m)) {\n const le = findEntity(l.from, schema);\n if (le === undefined) throw new VexError('invalid_dsl', `Unknown table \"${l.from}\" in $lookup.`);\n if (!le.fields.some((f) => f.name === l.field)) throw new VexError('invalid_dsl', `Unknown column \"${l.from}.${l.field}\" in $lookup.`);\n assertFilterColumns(l.where, l.from, schema, 'a $lookup');\n }\n if ((m.op === 'insert' || m.op === 'insertEach') && m.onConflict !== undefined) {\n for (const c of [...m.onConflict.target, ...Object.keys(m.onConflict.set ?? {})]) {\n if (!known.has(c)) throw new VexError('invalid_dsl', `Unknown column \"${m.table}.${c}\" in onConflict.`);\n }\n assertConflictTarget(m.table, m.onConflict.target, entity);\n if (m.onConflict.where !== undefined) assertFilterColumns(m.onConflict.where, m.table, schema, 'onConflict');\n }\n};\n\n// ─── Scope — applied by the ENGINE, never authored in the DSL ──\n// The same `ScopePolicy` reads use, its write-phase rules applied AFTER the\n// entry is parsed — so identity/tenant binding can't be touched by a stored\n// or injected mutation. `write` is the UMBRELLA phase (grants + rules for\n// insert/update/delete); the specific phases refine it — an op is allowed\n// iff its specific phase or `write` exists, and its rules are the umbrella's\n// plus the specific's. Mechanics: a `set` writes its column from scope on\n// each column-writing op (insert values, update set) — delete writes no\n// columns, so it is structurally exempt, not special-cased. A `match` pins\n// its column on insert and ANDs a filter into update/delete WHERE (the RLS\n// boundary). No applicable phase (or unlisted table) falls to `default`:\n// deny throws, allow leaves the mutation ungoverned.\n// A `$lookup` READS its table, so the read-phase rules of THAT table apply —\n// a mutation entry is never a read-scope bypass. Match rules AND into the\n// lookup's WHERE; a table the principal cannot read refuses the whole write.\nconst readMatchesFor = (table: string, policy: ScopePolicy): ScopeMatch[] => {\n const rule = policy.entities[table];\n if (rule === undefined) {\n if (policy.default === 'deny') throw new VexScopeError(table, `A $lookup reads \"${table}\", which is not allowed by scope policy (default: deny).`);\n return [];\n }\n if ('public' in rule) return [];\n if ('deny' in rule) throw new VexScopeError(table, `A $lookup reads \"${table}\", which is denied by scope policy.`);\n if (rule.read === undefined) {\n if (policy.default === 'deny') throw new VexScopeError(table, `A $lookup reads \"${table}\", which this principal has no read grant for.`);\n return [];\n }\n return rule.read;\n};\n\n// ONE SPELLING of the RLS boundary, for every place a match rule becomes a\n// WHERE — a `$lookup`'s filter, an ON CONFLICT DO UPDATE, an UPDATE and a\n// DELETE. Four copies of `{ eq: [...] }` is four places a new match shape has\n// to be remembered, and the one that was forgotten would be the hole.\nconst boundaryOf = (table: string, r: ScopeMatch): Filter =>\n isSetMatch(r) ? { in: [`${table}.${r.match}`, { $scope: r.in }] } : { eq: [`${table}.${r.match}`, { $scope: r.to }] };\n\nconst scopeLookups = <V extends MutationValue | ItemRef>(cols: Record<string, V>, policy: ScopePolicy): Record<string, V> => {\n const out: Record<string, V> = {};\n for (const [k, v] of Object.entries(cols)) {\n if (!isLookup(v)) {\n out[k] = v;\n continue;\n }\n let where: Filter = v.$lookup.where;\n for (const r of readMatchesFor(v.$lookup.from, policy)) {\n where = { and: [where, boundaryOf(v.$lookup.from, r)] };\n }\n // A scoped lookup is still a lookup — the transform is type-preserving.\n out[k] = { $lookup: { ...v.$lookup, where } } as V;\n }\n return out;\n};\n\n// The gate every write passes: throws when denied, returns `undefined` when\n// the table is ungoverned (public / default allow), else the entity rule and\n// the applicable phase rules (umbrella + specific).\ntype WriteGate = { rule: Extract<ScopePolicy['entities'][string], { read?: unknown }>; rules: readonly ScopeRule[] };\n\nconst writeGate = (table: string, op: 'insert' | 'update' | 'delete', policy: ScopePolicy): WriteGate | undefined => {\n const rule = policy.entities[table];\n if (rule === undefined) {\n if (policy.default === 'deny') throw new VexScopeError(table, `Writes to \"${table}\" are not allowed by scope policy (default: deny).`);\n return undefined;\n }\n if ('public' in rule) return undefined;\n if ('deny' in rule) throw new VexScopeError(table, `Writes to \"${table}\" are denied by scope policy.`);\n const specific = op === 'insert' ? rule.insert : op === 'update' ? rule.update : rule.delete;\n if (rule.write === undefined && specific === undefined) {\n if (policy.default === 'deny') throw new VexScopeError(table, `\"${op}\" on \"${table}\" is not allowed by scope policy (default: deny).`);\n return undefined;\n }\n return { rule, rules: [...(rule.write ?? []), ...(specific ?? [])] };\n};\n\n// The shared insert-shaped half: lookups scoped, insert rules applied to the\n// values, and the ON CONFLICT half gated and governed as the UPDATE it is.\n// `set` rules stamp identity into the DO UPDATE SET; `match` rules whose\n// column the conflict target already pins are inherently satisfied (the\n// inserted, scope-pinned value must equal the existing row's for a conflict\n// to arise at all); any other `match` becomes a WHERE on the DO UPDATE half —\n// the RLS boundary again.\nconst scopeInsertParts = <V extends MutationValue | ItemRef>(\n table: string,\n rawValues: Record<string, V>,\n rawConflict: ResolvedOnConflict | undefined,\n policy: ScopePolicy,\n): { values: Record<string, V | { $scope: string }>; conflict: ResolvedOnConflict | undefined } => {\n let values: Record<string, V | { $scope: string }> = scopeLookups(rawValues, policy);\n let conflict: ResolvedOnConflict | undefined =\n rawConflict === undefined || rawConflict.set === undefined ? rawConflict : { ...rawConflict, set: scopeLookups(rawConflict.set, policy) };\n\n const gate = writeGate(table, 'insert', policy);\n if (gate === undefined) return { values, conflict };\n\n for (const r of gate.rules) {\n // A WRITE'S SUBJECT IS ONE VALUE, AND THIS IS WHERE THAT IS ENFORCED.\n //\n // A `match` on an INSERT does not filter — there is no row yet — it WRITES\n // the column, which is what makes \"insert outside your boundary\"\n // unsayable rather than merely refused. A set has no single value to\n // write, so there is no honest thing to do with one here.\n //\n // Throwing rather than picking, ignoring, or compiling a guard: a reach\n // that covers several rows for READING must not silently become a reach\n // that lets a caller CHOOSE which of them to write as. A write's subject\n // comes from scope (one value) or through a `$lookup` whose own read\n // rules the engine applies — never from a set the caller indexes into.\n if ('match' in r && isSetMatch(r)) {\n throw new VexScopeError(\n table,\n `Scope rule for \"${table}\" is set-valued (\"${r.match}\" in \"${r.in}\") and cannot pin an INSERT — a write's subject must be a single value. Use a scalar match, or carry the subject in a $lookup whose own read rules bound it.`,\n );\n }\n // A `set` writes identity; a scalar `match` pins the RLS boundary — on an\n // INSERT both land in the values.\n values = { ...values, ['set' in r ? r.set : r.match]: { $scope: r.to } };\n }\n\n if (conflict?.set !== undefined) {\n if (gate.rule.write === undefined && gate.rule.update === undefined) {\n throw new VexScopeError(table, `onConflict on \"${table}\" declares DO UPDATE, but this principal has no update grant.`);\n }\n for (const r of [...(gate.rule.write ?? []), ...(gate.rule.update ?? [])]) {\n if ('set' in r) {\n conflict = { ...conflict, set: { ...(conflict.set ?? {}), [r.set]: { $scope: r.to } } };\n } else if (!conflict.target.includes(r.match)) {\n const boundary = boundaryOf(table, r);\n conflict = { ...conflict, where: conflict.where === undefined ? boundary : { and: [conflict.where, boundary] } };\n }\n }\n }\n\n return { values, conflict };\n};\n\nconst scopeMutation = (m: CoreMutation, policy: ScopePolicy): ResolvedMutation => {\n if (m.op === 'insert') {\n const { values, conflict } = scopeInsertParts(m.table, m.values, m.onConflict, policy);\n return { op: 'insert', table: m.table, values, ...(conflict === undefined ? {} : { onConflict: conflict }) };\n }\n if (m.op === 'insertEach') {\n const { values, conflict } = scopeInsertParts(m.table, m.values, m.onConflict, policy);\n return { op: 'insertEach', table: m.table, items: m.items, values, ...(conflict === undefined ? {} : { onConflict: conflict }) };\n }\n if (m.op === 'update') {\n let set: Record<string, MutationValue> = scopeLookups(m.set, policy);\n let where: Filter = m.where;\n const gate = writeGate(m.table, 'update', policy);\n if (gate !== undefined) {\n for (const r of gate.rules) {\n // The column is written from scope on insert AND update alike.\n if ('set' in r) set = { ...set, [r.set]: { $scope: r.to } };\n // RLS boundary on update — AND the scope filter into WHERE. A set is\n // safe HERE, unlike on insert: the rows already exist and this only\n // narrows which of them may be touched.\n else where = { and: [where, boundaryOf(m.table, r)] };\n }\n }\n return { op: 'update', table: m.table, set, where };\n }\n // delete — writes no columns, so `set` rules are structurally exempt.\n let where: Filter = m.where;\n const gate = writeGate(m.table, 'delete', policy);\n if (gate !== undefined) {\n for (const r of gate.rules) {\n if ('match' in r) where = { and: [where, boundaryOf(m.table, r)] };\n }\n }\n return { op: 'delete', table: m.table, where };\n};\n\n// ─── Compile (reuses the read pipeline's SQL + param machinery) ─\n// Only the INSERT/UPDATE/DELETE skeleton is assembled here; vex's\n// `compileFieldOrValue` / `compileFilter` fill the fragments and accumulate\n// the param slots, which `resolveParams` then binds. One catch: for a\n// comparison, vex quotes an unmapped `entity.field` as a STRING LITERAL (it\n// can't know it's a column). A single-table write has no resolver to build\n// the alias map, so we seed it ourselves — identity-mapping each `where`\n// field path to itself, which a single-table UPDATE/DELETE qualifies fine.\ntype Compiled = { sql: string; slots: ParamSlot[] };\n\nconst newCtx = (): CompilationContext => ({\n resolvedPaths: new Map(),\n aliasMap: new Map(),\n paramSlots: [],\n paramCounter: { value: 0 },\n});\n\n// Every column the filter names maps to itself — a single-table statement\n// qualifies `table.column` fine. Only ever called on a filter\n// `assertFilterColumns` has already held to the table's real columns.\nconst indexFilterFields = (filter: Filter, aliasMap: Map<string, string>): void => {\n for (const path of filterColumns(filter)) aliasMap.set(path, path);\n};\n\n// A value that may be a `$lookup` compiles to a scalar subquery INLINE, into\n// the parent's own parameter counter and slot list — the same no-renumbering\n// rule EXISTS follows on the read side.\nconst compileValue = (v: MutationValue, ctx: CompilationContext): string => {\n if (isLookup(v)) {\n indexFilterFields(v.$lookup.where, ctx.aliasMap);\n const where = compileFilter(v.$lookup.where, ctx);\n return `(SELECT ${v.$lookup.field} FROM ${v.$lookup.from} WHERE ${where})`;\n }\n return compileFieldOrValue(v, ctx);\n};\n\n// A value written into a json/jsonb column: the slot its context value binds\n// through is marked, so the array or object goes over the wire as JSON text.\nconst compileColumnValue = (table: string, column: string, v: MutationValue, ctx: CompilationContext, schema: DatabaseSchema): string => {\n const before = ctx.paramSlots.length;\n const sql = compileValue(v, ctx);\n const json = findEntity(table, schema)?.fields.find((f) => f.name === column)?.normalizedType === 'json';\n if (json && typeof v === 'object' && v !== null && '$context' in v) {\n const slot = ctx.paramSlots[before];\n if (slot !== undefined) ctx.paramSlots[before] = { ...slot, encode: 'json' };\n }\n return sql;\n};\n\nconst compileConflict = (m: { table: string; onConflict?: ResolvedOnConflict }, ctx: CompilationContext, schema: DatabaseSchema): string => {\n const c = m.onConflict;\n if (c === undefined) return '';\n if (c.set === undefined) return ` ON CONFLICT (${c.target.join(', ')}) DO NOTHING`;\n const sets = Object.entries(c.set).map(([col, v]) => `${col} = ${compileColumnValue(m.table, col, v, ctx, schema)}`);\n let where = '';\n if (c.where !== undefined) {\n indexFilterFields(c.where, ctx.aliasMap);\n where = ` WHERE ${compileFilter(c.where, ctx)}`;\n }\n return ` ON CONFLICT (${c.target.join(', ')}) DO UPDATE SET ${sets.join(', ')}${where}`;\n};\n\n// jsonb `->>` yields text; the cast restores the column's type so the INSERT\n// binds like any other. `json` columns keep `->` (stays jsonb, no cast).\nconst ITEM_CAST: Record<string, string> = {\n number: 'numeric',\n boolean: 'boolean',\n date: 'date',\n timestamp: 'timestamptz',\n uuid: 'uuid',\n};\n\n\nconst compileMutation = (m: ResolvedMutation, schema: DatabaseSchema): Compiled => {\n const ctx = newCtx();\n if (m.op === 'insert') {\n const entries = Object.entries(m.values);\n const cols = entries.map(([c]) => c);\n const vals = entries.map(([c, v]) => compileColumnValue(m.table, c, v, ctx, schema));\n return { sql: `INSERT INTO ${m.table} (${cols.join(', ')}) VALUES (${vals.join(', ')})${compileConflict(m, ctx, schema)} RETURNING *`, slots: ctx.paramSlots };\n }\n if (m.op === 'insertEach') {\n const entity = findEntity(m.table, schema);\n const entries = Object.entries(m.values);\n const cols = entries.map(([c]) => c);\n const exprs = entries.map(([col, v]) => {\n if (isItemRef(v)) {\n const nt = entity?.fields.find((f) => f.name === col)?.normalizedType ?? 'string';\n if (nt === 'json') return `(item.value->${quoteLiteral(v.$item)})`;\n const cast = ITEM_CAST[nt];\n const raw = `(item.value->>${quoteLiteral(v.$item)})`;\n return cast === undefined ? raw : `${raw}::${cast}`;\n }\n return compileValue(v, ctx);\n });\n ctx.paramCounter.value += 1;\n ctx.paramSlots.push({ key: m.items.$context, kind: 'context', type: 'json' });\n const source = `jsonb_array_elements($${ctx.paramCounter.value}::jsonb) AS item`;\n return {\n sql: `INSERT INTO ${m.table} (${cols.join(', ')}) SELECT ${exprs.join(', ')} FROM ${source}${compileConflict(m, ctx, schema)} RETURNING *`,\n slots: ctx.paramSlots,\n };\n }\n if (m.op === 'update') {\n const sets = Object.entries(m.set).map(([c, v]) => `${c} = ${compileColumnValue(m.table, c, v, ctx, schema)}`);\n indexFilterFields(m.where, ctx.aliasMap);\n const where = compileFilter(m.where, ctx);\n return { sql: `UPDATE ${m.table} SET ${sets.join(', ')} WHERE ${where} RETURNING *`, slots: ctx.paramSlots };\n }\n indexFilterFields(m.where, ctx.aliasMap);\n const where = compileFilter(m.where, ctx);\n return { sql: `DELETE FROM ${m.table} WHERE ${where} RETURNING *`, slots: ctx.paramSlots };\n};\n\n// ─── Desugar (sugar → core) ────────────────────────────────────\n// Rewrite each sugar op to a core insert/update/delete BEFORE context/scope/\n// validate/compile, so those stages only ever see the three primitives.\nconst SUGAR: { [K in Mutation['op']]?: (m: Extract<Mutation, { op: K }>, context: Record<string, unknown>) => CoreMutation } = {\n upsert: (m, context) => {\n const keyed = context[m.key] !== undefined && context[m.key] !== '';\n return keyed\n ? { op: 'update', table: m.table, set: m.columns, where: { eq: [`${m.table}.${m.key}`, { $context: m.key }] } }\n : { op: 'insert', table: m.table, values: { ...m.columns, ...m.insert } };\n },\n};\n\nconst desugarMutation = (m: Mutation, context: Record<string, unknown>): CoreMutation => {\n const rewrite = SUGAR[m.op] as ((m: Mutation, c: Record<string, unknown>) => CoreMutation) | undefined;\n return rewrite === undefined ? (m as CoreMutation) : rewrite(m, context);\n};\n\n// ─── Execute ───────────────────────────────────────────────────\nexport type MutationContext = {\n context: Record<string, unknown>; // dynamic values for `$context` refs (the caller's data)\n scope: ScopeValues; // server-injected values for `$scope` refs (identity / tenant)\n policy: ScopePolicy;\n schema: DatabaseSchema;\n};\n\n// One executed statement, named by what it did: the table, the op that\n// actually ran (post-desugar — an upsert reports the branch it took, an\n// insertEach reports 'insert' because that is what it is), and the rows the\n// database returned. This is the grain a write observer needs: a two-\n// statement mutation is two writes, each with its own rows.\nexport type WriteResult = { table: string; op: 'insert' | 'update' | 'delete'; rows: Row[] };\n\nexport const executeWrites = async (client: MutationClient, def: MutationDefinition, mctx: MutationContext): Promise<WriteResult[]> => {\n const parsed = MutationDefinitionSchema.parse(def);\n const entries = Array.isArray(parsed) ? parsed : [parsed];\n const compiled = entries.map((entry) => {\n const core = desugarMutation(entry, mctx.context);\n // A write never executes with holes: every `$context` the (desugared)\n // statement binds must be present. The error teaches the WHOLE contract.\n const missing = requiredContextKeys(core).filter((k) => mctx.context[k] === undefined);\n if (missing.length > 0) {\n throw new VexError('missing_context', `Mutation is missing context: ${missing.join(', ')}.`, {\n expected: collectMutationContext(parsed, mctx.schema),\n });\n }\n const m = scopeMutation(core, mctx.policy);\n assertWritableColumns(m, mctx.schema);\n const statement = compileMutation(m, mctx.schema);\n // A `set` rule with no value would STAMP NULL — an insert owned by nobody,\n // written anyway. Every scope slot is filled or nothing runs.\n requireScope({ paramSlots: statement.slots }, mctx.scope);\n return { ...statement, table: m.table, op: (m.op === 'insertEach' ? 'insert' : m.op) as WriteResult['op'] };\n });\n\n const runAll = async (q: MutationTx): Promise<WriteResult[]> => {\n const results: WriteResult[] = [];\n for (const c of compiled) {\n const params = await resolveParams(c.slots, mctx.context, mctx.scope);\n // A `json` slot (insertEach items) is bound as a JSON string — drivers\n // would otherwise turn a JS array into a postgres ARRAY literal, which\n // `::jsonb` refuses. Anything but an array fails loudly here.\n const bound = params.map((value, i) => {\n if (c.slots[i]?.encode === 'json') return value !== null && typeof value === 'object' ? JSON.stringify(value) : value;\n if (c.slots[i]?.type !== 'json') return value;\n if (!Array.isArray(value)) {\n throw new VexError('invalid_request', `\"${c.slots[i]?.key ?? ''}\" must be an array of objects (one inserted row per element).`);\n }\n return JSON.stringify(value);\n });\n const res = await q.query(c.sql, bound as unknown[]);\n results.push({ table: c.table, op: c.op, rows: res.rows as Row[] });\n }\n return results;\n };\n\n // A batch runs atomically; a single write needs no transaction.\n if (compiled.length === 1) return runAll(client);\n if (client.transaction === undefined) {\n throw new VexError('execution_error', 'Batch mutations require a transactional client.');\n }\n return client.transaction((tx) => runAll(tx));\n};\n\n// The rows alone, statement order preserved — the shape every existing\n// caller wants when it does not care which statement returned what.\nexport const executeMutation = async (client: MutationClient, def: MutationDefinition, mctx: MutationContext): Promise<Row[]> =>\n (await executeWrites(client, def, mctx)).flatMap((w) => w.rows);\n","import { z } from 'zod';\nimport type { QueryEngine } from './types.js';\nimport type { ScopePolicy, ScopeValues } from './scope/scope.types.js';\nimport type { DatabaseSchema, EntitySchema } from './schemas/database.schema.js';\nimport { QueryRequestSchema } from './schemas/request.schema.js';\nimport { QuerySchema } from './schemas/query.schema.js';\nimport { isEntryFresh, isTouchDue, fireAndForget } from './cache/util.js';\nimport { computeSchemaFingerprint } from './cache/hash.js';\nimport { executeWrites } from './mutations/engine.js';\nimport type { MutationClient, WriteResult } from './mutations/engine.js';\nimport { collectMutationContext, collectQueryContext, mutationEffect } from './mutations/signature.js';\nimport type { ContextSignature, MutationEffect } from './mutations/signature.js';\nimport type { CacheEntry } from './cache/cache.types.js';\nimport type { QueryResponse } from './schemas/request.schema.js';\nimport type { Query } from './schemas/query.schema.js';\nimport { VexError } from './errors.js';\nimport { depthRefusal, exceedsDepth } from '@niscorp/strata';\nimport { canReadTable } from './scope/apply.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Types\n// ═══════════════════════════════════════════════════════════════\n\nexport type VexHandlerConfig = {\n engine: QueryEngine;\n entities?: string[];\n // Replay-only posture (production): requests needing generation fail\n // with 'locked'; fingerprint management (PATCH/DELETE) is refused too.\n // Mutation replay is unaffected — writes are ALWAYS replay-only.\n locked?: boolean;\n // Per-request read policy — overrides the engine default for reads on\n // this request (the read-side twin of `mutations.policy`). A host that\n // resolves a policy per principal passes the SAME policy here and in\n // `mutations.policy`, so reads and writes enforce one principal's phases.\n scopePolicy?: ScopePolicy;\n // Compiles the SAME principal's policy at a named reach, for entries that\n // declare one (`OkCacheEntry.reach`). Vex holds neither grants nor behaviors,\n // so it cannot build this itself — the host does, and returning `undefined`\n // refuses the read rather than serving it at the caller's own, wider reach.\n policyForReach?: (reach: string) => Promise<ScopePolicy | undefined> | ScopePolicy | undefined;\n // Enables replay of `kind: 'mutation'` cache entries. The client is\n // structural (PGlite, a pg wrapper, a test double); the policy is the\n // same ScopePolicy reads use, its `write` rules applied by the engine.\n mutations?: {\n client: MutationClient;\n policy: ScopePolicy;\n // The write observer. Fired once per successful mutation replay, AFTER\n // the commit — per-statement writes with the rows the database returned,\n // plus the scope the request could not forge. Vex is the choke point\n // every write passes through, so this is where a host learns about all\n // of them; what the host does with the news (mint facts, wake shells)\n // is not the engine's business. A listener that throws cannot unwrite\n // a committed write, so its error is contained, never the request's.\n onWrite?: (event: WriteEvent) => void;\n };\n // The execution observer — the read/write twin of `mutations.onWrite`, and\n // vex's whole telemetry surface. Fired once per `handleQuery`, AFTER the\n // outcome is known, with vex-vocabulary facts (fingerprint, reach, cache,\n // rows, status, timing) and the unforgeable scope. Vex knows nothing of spans\n // or OTLP; a host maps this record to whatever it emits. Absent → not even the\n // record is built (see `handleQuery`), so an unobserved endpoint pays nothing.\n // A listener that throws is contained, never the request's.\n onExecute?: (record: ExecuteRecord) => void;\n};\n\nexport type WriteEvent = { fingerprint: string; writes: WriteResult[]; scope: ScopeValues };\n\n// A CALLER THAT FOLLOWS THE ANSWER. In-process only: an HTTP request cannot\n// carry a callback, so a host that runs its own clients next to the handler\n// (moss's server shells) passes one here, and a reactive entry keeps\n// answering through it until `signal` aborts. See `refresh` on an entry.\nexport type VexLive = {\n signal: AbortSignal;\n onChange: (response: QueryResponse) => void;\n};\n\n// WHICH TABLES A WRITE CHANGED. The statements' own tables, plus — for a\n// delete — every table that references one of them, transitively: an\n// `ON DELETE CASCADE` or `SET NULL` changes rows vex never wrote. The\n// introspected schema carries the reference but not its rule, so a delete is\n// assumed to reach every referencing table. Over-telling costs a refetch;\n// under-telling leaves a screen stale.\nexport const tablesChangedBy = (writes: readonly WriteResult[], schema: DatabaseSchema | undefined): string[] => {\n const changed = new Set<string>();\n const referencing = (table: string): string[] =>\n (schema?.entities.find((entity) => entity.name === table)?.relations ?? [])\n .filter((relation) => relation.type !== 'belongsTo')\n .map((relation) => relation.entity);\n for (const write of writes) {\n if (write.rows.length === 0) continue;\n changed.add(write.table);\n if (write.op !== 'delete') continue;\n const pending = [write.table];\n for (let next = pending.pop(); next !== undefined; next = pending.pop()) {\n for (const table of referencing(next)) {\n if (changed.has(table)) continue;\n changed.add(table);\n pending.push(table);\n }\n }\n }\n return [...changed];\n};\n\n// What one execution DID, in vex's own vocabulary — the record `onExecute`\n// hands a host. Not a span: vex holds no telemetry model, so a host maps these\n// facts to whatever it emits. `startUnixNano`/`endUnixNano` are epoch nanos at\n// millisecond anchoring with a sub-millisecond monotonic span between them —\n// exact enough for durations, coarse in the low bits — copied through verbatim.\nexport type ExecuteRecord = {\n kind: 'query' | 'mutation';\n status: 'ok' | 'error' | 'refused';\n fingerprint?: string;\n reach?: string;\n // Reads: whether the entry was already compiled. Mutations always replay.\n cacheHit?: boolean;\n // Rows returned (reads) or written (mutations).\n rows?: number;\n startUnixNano: number;\n endUnixNano: number;\n // The scope the request could not forge, passed exactly as `onWrite` passes\n // it — for a host to read principal PRESENCE from, never a value into a span.\n scope: ScopeValues;\n};\n\n// The mutable half of the record, filled by `runQuery` as it goes and read once\n// by `handleQuery`. Built only when an observer is attached.\ntype ExecuteProbe = {\n kind: 'query' | 'mutation';\n fingerprint?: string;\n reach?: string;\n cacheHit?: boolean;\n rows?: number;\n};\n\nexport type DiscoveryFingerprint = {\n fingerprint: string;\n kind: 'query' | 'mutation';\n protected: boolean;\n schemaFresh: boolean;\n intent?: string;\n createdAt: number;\n lastUsedAt?: number;\n // The derived input contract: every `$context` key the stored def binds,\n // typed from the schema by its position. Computed, never authored.\n context?: ContextSignature;\n // Reads: the stored result shape. Mutations: what the write changes.\n shape?: unknown;\n effect?: MutationEffect[];\n};\n\nexport type DiscoveryResponse = {\n vex: string;\n description: string;\n entities: DiscoveryEntity[];\n // Governance summary + the endpoint's known queries — self-description\n // an agent (or a management UI) can read before generating anything.\n protection: 'all' | 'some' | 'none';\n locked: boolean;\n fingerprints: DiscoveryFingerprint[];\n query: {\n method: string;\n accepts: string;\n body: Record<string, DiscoveryField>;\n };\n dsl: object;\n};\n\ntype DiscoveryEntity = {\n name: string;\n fields: Array<{\n name: string;\n type: string;\n nullable: boolean;\n primaryKey: boolean;\n }>;\n relations: Array<{\n entity: string;\n type: string;\n via: string[];\n }>;\n rowCount?: number;\n};\n\ntype DiscoveryField = {\n type: string;\n required: boolean;\n description: string;\n};\n// (queryParams are gone — the request body carries all cache semantics.)\n\n// ═══════════════════════════════════════════════════════════════\n// Discovery\n// ═══════════════════════════════════════════════════════════════\n\nconst filterSchema = (schema: DatabaseSchema | undefined, entities?: string[]): EntitySchema[] => {\n if (schema === undefined) return [];\n if (entities === undefined || entities.length === 0) return schema.entities;\n return schema.entities.filter(e => entities.includes(e.name));\n};\n\n// ─── Visibility under a policy — discovery advertises only what the\n// policy can touch. These mirror the ENFORCEMENT semantics (applyScope /\n// scopeMutation) as pure predicates: a phase exists, is public, or falls\n// to the default. Enforcement still runs on every request; this only\n// keeps the catalog honest per principal. ───────────────────────\nconst canWriteTable = (policy: ScopePolicy, table: string, op: string): boolean => {\n const rule = policy.entities[table];\n if (rule === undefined) return policy.default === 'allow';\n if ('public' in rule) return true;\n if ('deny' in rule) return false;\n if (rule.write !== undefined || policy.default === 'allow') return true;\n // insertEach is an insert that happens N times — same phase.\n if (op === 'insert' || op === 'insertEach') return rule.insert !== undefined;\n if (op === 'update') return rule.update !== undefined;\n if (op === 'delete') return rule.delete !== undefined;\n // upsert desugars to insert or update per call — advertise if either exists\n if (op === 'upsert') return rule.insert !== undefined || rule.update !== undefined;\n return false;\n};\n\n// Every table a read touches — string sources, recursing into subquery\n// sources (`{ as, query }`).\nconst collectTables = (dsl: Query): string[] => {\n const out: string[] = [];\n const walk = (q: Query): void => {\n for (const src of q.from) {\n if (typeof src === 'string') out.push(src);\n else walk(src.query);\n }\n };\n walk(dsl);\n return out;\n};\n\nconst entryVisible = (policy: ScopePolicy, entry: CacheEntry): boolean => {\n if (entry.kind === 'ok') return collectTables(entry.dsl).every((t) => canReadTable(policy, t));\n if (entry.kind === 'mutation') return mutationEffect(entry.mutation).every((e) => canWriteTable(policy, e.table, e.op));\n return false;\n};\n\nconst listFingerprints = async (engine: QueryEngine, policy?: ScopePolicy): Promise<DiscoveryFingerprint[]> => {\n if (engine.cache.entries === undefined) return [];\n const schema = engine.getSchema();\n const current = schema !== undefined ? computeSchemaFingerprint(schema) : undefined;\n const rows = await engine.cache.entries();\n return rows\n .filter(({ key, entry }) => (entry.kind === 'ok' || entry.kind === 'mutation') && !key.startsWith('neg:'))\n .filter(({ entry }) => policy === undefined || entryVisible(policy, entry))\n .map(({ key, entry }) => ({\n fingerprint: key,\n kind: entry.kind === 'mutation' ? ('mutation' as const) : ('query' as const),\n protected: entry.protected === true,\n schemaFresh: isEntryFresh(entry, current),\n ...(entry.intent !== undefined ? { intent: entry.intent } : {}),\n createdAt: entry.createdAt,\n ...(entry.lastUsedAt !== undefined ? { lastUsedAt: entry.lastUsedAt } : {}),\n // The derived contract — what to pass, straight from the stored def.\n ...(entry.kind === 'ok'\n ? {\n context: collectQueryContext(entry.dsl, schema),\n ...(entry.shape !== undefined ? { shape: entry.shape } : {}),\n }\n : entry.kind === 'mutation'\n ? {\n context: collectMutationContext(entry.mutation, schema),\n effect: mutationEffect(entry.mutation),\n }\n : {}),\n }));\n};\n\nexport const handleDiscovery = async (config: VexHandlerConfig): Promise<DiscoveryResponse> => {\n const { engine, entities: entityFilter, scopePolicy } = config;\n // Under a scopePolicy, discovery is per-principal: entities and entries\n // the policy cannot touch are not advertised (what you can't reach\n // doesn't exist for you — deny by absence, in the catalog too).\n const filtered = filterSchema(engine.getSchema(), entityFilter).filter(\n (e) => scopePolicy === undefined || canReadTable(scopePolicy, e.name),\n );\n const fingerprints = await listFingerprints(engine, scopePolicy);\n const protectedCount = fingerprints.filter((f) => f.protected).length;\n\n return {\n protection: protectedCount === 0 ? 'none' : protectedCount === fingerprints.length ? 'all' : 'some',\n locked: config.locked === true,\n fingerprints,\n vex: '1.0',\n description: 'Query this resource using natural language or structured DSL',\n entities: filtered.map(e => ({\n name: e.name,\n fields: e.fields.map(f => ({\n name: f.name,\n type: f.normalizedType,\n nullable: f.nullable,\n primaryKey: f.primaryKey,\n })),\n relations: e.relations.map(r => ({\n entity: r.entity,\n type: r.type,\n via: r.localFields,\n })),\n rowCount: e.rowCount,\n })),\n query: {\n method: 'POST',\n accepts: 'application/json',\n body: {\n fingerprint: {\n type: 'string',\n required: false,\n description:\n 'Cache identity. Alone → replay a known query (no generation). With intent+shape → a named slot: ' +\n 'matching request hits, differing request regenerates and replaces (409 when protected). ' +\n 'Omitted → generate fresh; the minted fingerprint returns in meta.cache.fingerprint.',\n },\n intent: {\n type: 'string',\n required: false,\n description: 'Natural language description of what data you need',\n },\n shape: {\n type: 'any',\n required: false,\n description: 'Example of the response structure — use empty strings, zeros, booleans as type indicators. Required unless replaying by fingerprint.',\n },\n context: {\n type: 'Record<string, unknown>',\n required: false,\n description: 'Runtime parameters referenced in filters as { $context: \"key\" }',\n },\n },\n },\n dsl: z.toJSONSchema(QuerySchema, { target: 'draft-7', reused: 'ref' }),\n };\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Query execution\n// ═══════════════════════════════════════════════════════════════\n\nexport type QueryResult = {\n status: number;\n body: unknown;\n};\n\n// Rows an execution touched, for the observer's `rows` — an array's length, a\n// single object as one, nothing as zero. Never inspects the values.\nconst rowsOf = (result: unknown): number =>\n Array.isArray(result) ? result.length : result === null || result === undefined ? 0 : 1;\n\nexport const handleQuery = async (\n config: VexHandlerConfig,\n body: unknown,\n scope: ScopeValues,\n live?: VexLive,\n): Promise<QueryResult> => {\n // Unobserved: the fast path builds no probe, takes no timestamps, allocates\n // no record. An endpoint with no telemetry pays exactly nothing.\n if (config.onExecute === undefined) return runQuery(config, body, scope, undefined, live);\n\n const startUnixNano = Date.now() * 1e6;\n const t0 = elapsedClock();\n const probe: ExecuteProbe = { kind: 'query' };\n const result = await runQuery(config, body, scope, probe, live);\n const record: ExecuteRecord = {\n kind: probe.kind,\n // 200 succeeded; 403 is a policy/reach refusal (a normal outcome, not a\n // fault); everything else is an error.\n status: result.status === 200 ? 'ok' : result.status === 403 ? 'refused' : 'error',\n startUnixNano,\n endUnixNano: startUnixNano + (elapsedClock() - t0) * 1e6,\n scope,\n ...(probe.fingerprint !== undefined ? { fingerprint: probe.fingerprint } : {}),\n ...(probe.reach !== undefined ? { reach: probe.reach } : {}),\n ...(probe.cacheHit !== undefined ? { cacheHit: probe.cacheHit } : {}),\n ...(probe.rows !== undefined ? { rows: probe.rows } : {}),\n };\n try {\n config.onExecute(record);\n } catch (err) {\n console.error('[vex:onExecute]', err);\n }\n return result;\n};\n\n// Sub-millisecond monotonic reading in milliseconds. `performance` is present\n// on every runtime vex targets; the wall clock is the fallback that keeps the\n// duration honest (0) rather than throwing where it is not.\nconst elapsedClock = (): number => (typeof performance !== 'undefined' ? performance.now() : Date.now());\n\nconst runQuery = async (\n config: VexHandlerConfig,\n body: unknown,\n scope: ScopeValues,\n probe: ExecuteProbe | undefined,\n live: VexLive | undefined,\n): Promise<QueryResult> => {\n const { engine } = config;\n\n // Before the schema: a deep enough body overflows it (strata depth.ts).\n if (exceedsDepth(body)) return { status: 400, body: { error: 'invalid_request', message: depthRefusal() } };\n const parsed = QueryRequestSchema.safeParse(body);\n if (!parsed.success) {\n return {\n status: 400,\n body: {\n error: 'invalid_request',\n message: parsed.error.message,\n },\n };\n }\n\n const hasShape = parsed.data.shape !== undefined && parsed.data.shape !== null;\n if (!hasShape && parsed.data.fingerprint === undefined) {\n return {\n status: 400,\n body: {\n error: 'invalid_request',\n message: 'Pass a fingerprint (replay) or intent + shape (generate) — or both (named slot).',\n },\n };\n }\n\n // Recorded before anything can refuse, so a refusal span still carries the\n // fingerprint it refused. A read that mints one overwrites this from meta.\n if (probe !== undefined && parsed.data.fingerprint !== undefined) probe.fingerprint = parsed.data.fingerprint;\n\n try {\n // ONE wire shape: `{ fingerprint, context }`. The entry's kind decides\n // the pipeline — a mutation fingerprint replays the write path; anything\n // else is the read path (which owns misses, generation, and locked).\n let entryReach: string | undefined;\n if (parsed.data.fingerprint !== undefined) {\n const entry = await engine.cache.get(parsed.data.fingerprint);\n if (entry !== undefined && entry.kind === 'ok') entryReach = entry.reach;\n if (probe !== undefined && entryReach !== undefined) probe.reach = entryReach;\n if (entry !== undefined && entry.kind === 'mutation') {\n if (probe !== undefined) {\n probe.kind = 'mutation';\n if (entry.reach !== undefined) probe.reach = entry.reach;\n }\n if (config.mutations === undefined) {\n return {\n status: 500,\n body: { error: 'execution_error', message: 'This endpoint serves no mutations — handler has no mutation client configured.' },\n };\n }\n const schema = engine.getSchema();\n if (schema === undefined) {\n return { status: 500, body: { error: 'execution_error', message: 'Vex schema not introspected.' } };\n }\n // A WRITE MAY DEMAND A NARROWER REACH TOO, and the stakes are higher\n // than for a read: too wide here changes somebody else's row rather\n // than merely showing it.\n let writePolicy = config.mutations.policy;\n if (entry.reach !== undefined) {\n if (config.policyForReach === undefined) {\n return {\n status: 500,\n body: {\n error: 'execution_error',\n message: `Entry \"${parsed.data.fingerprint ?? ''}\" requires reach \"${entry.reach}\" and this handler has no policyForReach.`,\n },\n };\n }\n const narrowed = await config.policyForReach(entry.reach);\n if (narrowed === undefined) {\n return {\n status: 403,\n body: { error: 'scope_denied', message: `Reach \"${entry.reach}\" is not available to this principal.` },\n };\n }\n writePolicy = narrowed;\n }\n\n const writes = await executeWrites(config.mutations.client, entry.mutation, {\n context: parsed.data.context,\n scope,\n policy: writePolicy,\n schema,\n });\n const rows = writes.flatMap((w) => w.rows);\n // Every reactive read over these tables is now stale. Here, not in\n // any host's observer: this is the one door every vex write passes —\n // a request, a server function's `executeAs`, a reflex's effect — and\n // a read that heard about only some of them would be live only\n // sometimes, which is worse than a snapshot that says what it is.\n engine.invalidate(tablesChangedBy(writes, schema));\n // The commit happened; the observer hears about it now, and its\n // failure is its own — the response must tell the truth about a\n // write that already landed.\n if (config.mutations.onWrite !== undefined) {\n try {\n config.mutations.onWrite({ fingerprint: parsed.data.fingerprint, writes, scope });\n } catch (err) {\n console.error('[vex:onWrite]', err);\n }\n }\n // Lifetime = usage, for writes exactly as for reads: stamp\n // lastUsedAt (off the hot path, at most once per TOUCH_EVERY_MS) so\n // the GC sweep sees replays.\n const now = Date.now();\n if (isTouchDue(entry, now)) fireAndForget(engine.cache.set(parsed.data.fingerprint, { ...entry, lastUsedAt: now }));\n if (probe !== undefined) probe.rows = rows.length;\n // A single statement returns its one affected row; a batch returns\n // the array — the same `{ result }` envelope a query reply uses.\n return { status: 200, body: { result: rows.length === 1 ? rows[0] : rows } };\n }\n }\n\n // AN ENTRY MAY REQUIRE A NARROWER REACH THAN ITS CALLER HAS.\n //\n // \"The classes you have booked\" means the caller's own, and a principal\n // holding two roles reaches as wide as either grants. So the entry names\n // the profile it must be served at and the host recompiles the same grants\n // under it — narrowing rows, never widening verbs.\n //\n // Fail closed: a declared reach the host cannot compile refuses the read.\n // Serving it at the caller's own reach is the exact failure the field\n // exists to prevent, and it would be invisible.\n let readPolicy = config.scopePolicy;\n if (entryReach !== undefined) {\n if (config.policyForReach === undefined) {\n return {\n status: 500,\n body: {\n error: 'execution_error',\n message: `Entry \"${parsed.data.fingerprint ?? ''}\" requires reach \"${entryReach}\" and this handler has no policyForReach.`,\n },\n };\n }\n readPolicy = await config.policyForReach(entryReach);\n if (readPolicy === undefined) {\n return {\n status: 403,\n body: { error: 'scope_denied', message: `Reach \"${entryReach}\" is not available to this principal.` },\n };\n }\n }\n\n const response = await engine.execute(parsed.data, {\n scope,\n entities: config.entities,\n ...(config.locked === true ? { locked: true } : {}),\n ...(readPolicy !== undefined ? { scopePolicy: readPolicy } : {}),\n ...(live !== undefined ? { signal: live.signal, onChange: live.onChange } : {}),\n });\n if (probe !== undefined) {\n probe.cacheHit = response.meta.cache.hit;\n // The identity actually served — the caller's replay key, or the one just\n // minted for a miss.\n if (response.meta.cache.fingerprint !== undefined) probe.fingerprint = response.meta.cache.fingerprint;\n probe.rows = rowsOf(response.result);\n }\n return { status: 200, body: response };\n } catch (err) {\n // The host did not say who is asking. That is the server's fault, not the\n // request's, and the names of the missing keys are the host's business —\n // they go to the log, not over the wire.\n if (err instanceof VexError && err.code === 'missing_scope') {\n console.error('[vex] refused a statement the host did not scope:', err.message);\n return { status: 500, body: { error: 'missing_scope', message: 'The server did not supply the scope this request needs.' } };\n }\n if (err instanceof VexError) {\n const status = err.code === 'fingerprint_protected' ? 409 : err.code === 'cache_miss' ? 404 : 400;\n return {\n status,\n body: {\n error: err.code,\n message: err.message,\n details: err.details,\n },\n };\n }\n console.error('[vex] unhandled error:', err);\n const errObj = err as Record<string, unknown> | null;\n const message = err instanceof Error\n ? err.message\n : (typeof errObj?.message === 'string' ? errObj.message : 'Unknown error');\n const code = typeof errObj?.code === 'string' ? errObj.code : 'execution_error';\n return {\n status: 500,\n body: { error: code, message },\n };\n }\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Fingerprint management — protect (PATCH) and evict (DELETE).\n// The ONLY writers of the `protected` bit besides the seed path.\n// ═══════════════════════════════════════════════════════════════\n\nexport const handleFingerprintPatch = async (\n config: VexHandlerConfig,\n fingerprint: string,\n patch: { protected?: boolean },\n): Promise<QueryResult> => {\n if (config.locked === true) {\n return { status: 403, body: { error: 'locked', message: 'This endpoint is locked — fingerprints cannot be managed here.' } };\n }\n const entry = await config.engine.cache.get(fingerprint);\n if (entry === undefined || (entry.kind !== 'ok' && entry.kind !== 'mutation')) {\n return { status: 404, body: { error: 'cache_miss', message: `Unknown fingerprint \"${fingerprint}\"` } };\n }\n if (typeof patch.protected !== 'boolean') {\n return { status: 400, body: { error: 'invalid_request', message: 'Body must be { protected: boolean }' } };\n }\n await config.engine.cache.set(fingerprint, { ...entry, protected: patch.protected });\n return { status: 200, body: { fingerprint, protected: patch.protected } };\n};\n\nexport const handleFingerprintDelete = async (\n config: VexHandlerConfig,\n fingerprint: string,\n): Promise<QueryResult> => {\n if (config.locked === true) {\n return { status: 403, body: { error: 'locked', message: 'This endpoint is locked — fingerprints cannot be managed here.' } };\n }\n const entry = await config.engine.cache.get(fingerprint);\n if (entry === undefined) {\n return { status: 404, body: { error: 'cache_miss', message: `Unknown fingerprint \"${fingerprint}\"` } };\n }\n if (entry.kind === 'ok' && entry.protected === true) {\n return { status: 409, body: { error: 'fingerprint_protected', message: `\"${fingerprint}\" is protected — unprotect it first.` } };\n }\n await config.engine.cache.delete(fingerprint);\n return { status: 200, body: { fingerprint, deleted: true } };\n};\n"]}
1
+ {"version":3,"sources":["../src/schemas/request.schema.ts","../src/schemas/value.schema.ts","../src/schemas/identifier.schema.ts","../src/schemas/filter.schema.ts","../src/schemas/compute.schema.ts","../src/schemas/aggregate.schema.ts","../src/schemas/query.schema.ts","../src/errors.ts","../src/engine/optional.ts","../src/scope/discover.ts","../src/scope/scope.types.ts","../src/scope/apply.ts","../src/scope/grants.ts","../src/engine/resolver.ts","../src/engine/analyzer.ts","../src/utils/context.ts","../src/engine/executor.ts","../src/cache/memory.ts","../src/cache/hash.ts","../src/cache/util.ts","../src/utils/canonical.ts","../src/engine/live.ts","../src/engine/runtime.ts","../src/adapters/postgres/introspect.ts","../src/adapters/postgres/operators.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/mutations/schema.ts","../src/cache/validate.ts","../src/cache/postgres.ts","../src/cache/tiered.ts","../src/mutations/signature.ts","../src/cache/seed.ts","../src/mutations/engine.ts","../src/handler.ts"],"names":["z","createHash","canonical","follow","compile","executePrism","exceedsDepth","depthRefusal","rows","executionMs","result","isFieldPath","fieldPath","quoteIdent","migrate","keys","current","findEntity","where","gate"],"mappings":";;;;;;;;;AAMO,IAAM,wCAAwB,IAAI,GAAA,CAAY,CAAC,QAAA,EAAU,SAAS,CAAC,CAAA;AAEnE,IAAM,aAAA,GAAgBA,MAC1B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,KAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC5B,OAAA,EAASA,MAAE,IAAA,CAAK,CAAC,OAAO,MAAM,CAAC,EAAE,QAAA;AACnC,CAAC,CAAA,CACA,QAAA,CAASA,KAAA,CAAE,OAAA,EAAS,CAAA,CACpB,QAAA;AAAA,EACC;AACF,CAAA;AAEK,IAAM,kBAAA,GAAqBA,MAAE,MAAA,CAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMzC,aAAaA,KAAA,CAAE,MAAA,GAAS,GAAA,CAAI,CAAC,EAAE,QAAA,EAAS;AAAA,EACxC,MAAA,EAAQA,KAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC5B,KAAA,EAAOA,KAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EAC5B,OAAA,EAAS,aAAA,CAAc,OAAA,CAAQ,EAAE;AACnC,CAAC;AC1BM,IAAM,gBAAA,GAAmBA,MAC7B,MAAA,CAAO;AAAA,EACN,QAAA,EAAUA,KAAAA,CAAE,MAAA,EAAO,CAAE,SAAS,8CAA8C;AAC9E,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,8CAA8C,CAAA;AAEnD,IAAM,cAAA,GAAiBA,MAC3B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,KAAAA,CAAE,MAAA,EAAO,CAAE,SAAS,gDAAgD;AAC9E,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,6DAA6D,CAAA;AAElE,IAAM,kBAAA,GAAqBA,MAC/B,KAAA,CAAM;AAAA,EACLA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,wDAAwD,CAAA;AAAA,EAC5EA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,kBAAkB,CAAA;AAAA,EACtCA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,CAAS,mBAAmB,CAAA;AAAA,EACxCA,KAAAA,CAAE,IAAA,EAAK,CAAE,QAAA,CAAS,gBAAgB,CAAA;AAAA,EAClC,gBAAA;AAAA,EACA;AACF,CAAC,CAAA,CACA,SAAS,mDAAmD,CAAA;ACA/D,IAAM,UAAA,GAAa,0BAAA;AACnB,IAAM,UAAA,GAAa,kDAAA;AAEZ,IAAM,YAAA,GAAe,CAAC,KAAA,KAA2B,UAAA,CAAW,KAAK,KAAK,CAAA;AAEtE,IAAM,gBAAA,GAAmB,CAAC,KAAA,KAAoC,OAAO,UAAU,QAAA,IAAY,UAAA,CAAW,KAAK,KAAK,CAAA;AAEhH,IAAM,mBAAmBA,KAAAA,CAC7B,MAAA,EAAO,CACP,KAAA,CAAM,YAAY,sEAAsE,CAAA;AAEpF,IAAM,kBAAkBA,KAAAA,CAC5B,MAAA,EAAO,CACP,KAAA,CAAM,YAAY,0GAAqG,CAAA;;;ACS1H,IAAM,cAAA,GAAiBA,MACpB,KAAA,CAAM,CAAC,oBAAoB,kBAAkB,CAAC,CAAA,CAC9C,QAAA,CAAS,uEAAkE,CAAA;AAE9E,IAAM,WAAA,GAAc,eAAA,CAAgB,QAAA,CAAS,mCAAmC,CAAA;AAEhF,IAAM,gBAAA,GAAmBA,MACtB,KAAA,CAAM;AAAA,EACLA,KAAAA,CAAE,MAAM,kBAAkB,CAAA,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,uCAAuC,CAAA;AAAA,EACnF,gBAAA;AAAA,EACA;AACF,CAAC,CAAA,CACA,SAAS,0DAA0D,CAAA;AAEtE,IAAM,eAAuCA,KAAAA,CAAE,IAAA;AAAA,EAAK,MAClDA,MACG,MAAA,CAAO;AAAA,IACN,IAAA,EAAMA,KAAAA,CAAE,KAAA,CAAMA,KAAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,yEAAyE,CAAA;AAAA,IACnH,MAAA,EAAQ,YAAA,CAAa,QAAA,EAAS,CAAE,SAAS,qIAAqI;AAAA,GAC/K,EACA,MAAA;AACL,CAAA;AAEO,IAAM,eAAkCA,KAAAA,CAAE,IAAA;AAAA,EAAK,MACpDA,MAAE,KAAA,CAAM;AAAA,IACNA,KAAAA,CAAE,MAAA,CAAO,EAAE,MAAA,EAAQ,YAAA,EAAc,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,wFAAwF,CAAA;AAAA,IAC7IA,KAAAA,CAAE,MAAA,CAAO,EAAE,EAAA,EAAI,cAAA,EAAgB,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,2CAA2C,CAAA;AAAA,IAC9FA,KAAAA,CAAE,MAAA,CAAO,EAAE,GAAA,EAAK,cAAA,EAAgB,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,YAAY,CAAA;AAAA,IAChEA,KAAAA,CAAE,MAAA,CAAO,EAAE,EAAA,EAAI,cAAA,EAAgB,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,cAAc,CAAA;AAAA,IACjEA,KAAAA,CAAE,MAAA,CAAO,EAAE,GAAA,EAAK,cAAA,EAAgB,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,uBAAuB,CAAA;AAAA,IAC3EA,KAAAA,CAAE,MAAA,CAAO,EAAE,EAAA,EAAI,cAAA,EAAgB,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,WAAW,CAAA;AAAA,IAC9DA,KAAAA,CAAE,MAAA,CAAO,EAAE,GAAA,EAAK,cAAA,EAAgB,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,oBAAoB,CAAA;AAAA,IACxEA,MAAE,MAAA,CAAO,EAAE,EAAA,EAAIA,KAAAA,CAAE,MAAM,CAAC,WAAA,EAAa,gBAAgB,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,yBAAyB,CAAA;AAAA,IACtGA,MAAE,MAAA,CAAO,EAAE,KAAA,EAAOA,KAAAA,CAAE,MAAM,CAAC,WAAA,EAAa,gBAAgB,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,6BAA6B,CAAA;AAAA,IAC7GA,MAAE,MAAA,CAAO,EAAE,IAAA,EAAMA,KAAAA,CAAE,MAAM,CAAC,WAAA,EAAa,kBAAkB,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,uDAAuD,CAAA;AAAA,IACxIA,MAAE,MAAA,CAAO,EAAE,KAAA,EAAOA,KAAAA,CAAE,MAAM,CAAC,WAAA,EAAa,kBAAkB,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,0DAA0D,CAAA;AAAA,IAC5IA,KAAAA,CAAE,MAAA,CAAO,EAAE,MAAA,EAAQ,WAAA,EAAa,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,qBAAqB,CAAA;AAAA,IACzEA,KAAAA,CAAE,MAAA,CAAO,EAAE,SAAA,EAAW,WAAA,EAAa,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,yBAAyB,CAAA;AAAA,IAChFA,MAAE,MAAA,CAAO,EAAE,GAAA,EAAKA,KAAAA,CAAE,MAAM,YAAY,CAAA,CAAE,GAAA,CAAI,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,0CAA0C,CAAA;AAAA,IAC5GA,MAAE,MAAA,CAAO,EAAE,EAAA,EAAIA,KAAAA,CAAE,MAAM,YAAY,CAAA,CAAE,GAAA,CAAI,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,iDAAiD,CAAA;AAAA,IAClHA,KAAAA,CAAE,MAAA,CAAO,EAAE,GAAA,EAAK,YAAA,EAAc,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,oCAAoC,CAAA;AAAA,IACtFA,MAAE,MAAA,CAAO;AAAA,MACP,QAAA,EAAUA,MAAE,MAAA,CAAO;AAAA,QACjB,KAAA,EAAO,eAAA,CAAgB,QAAA,CAAS,yCAAyC,CAAA;AAAA,QACzE,KAAA,EAAOA,MAAE,KAAA,CAAM,CAAC,kBAAkB,cAAc,CAAC,CAAA,CAAE,QAAA,CAAS,2BAA2B,CAAA;AAAA,QACvF,QAAA,EAAUA,KAAAA,CAAE,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,EAAS,CAAE,SAAS,sCAAiC;AAAA,OACzF,EAAE,MAAA;AAAO,KACX,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,mCAAmC,CAAA;AAAA,IACxDA,MAAE,MAAA,CAAO;AAAA,MACP,KAAA,EAAOA,MAAE,MAAA,CAAO;AAAA,QACd,KAAA,EAAO,eAAA,CAAgB,QAAA,CAAS,mBAAmB,CAAA;AAAA,QACnD,KAAA,EAAOA,MAAE,KAAA,CAAM,CAAC,kBAAkB,cAAc,CAAC,CAAA,CAAE,QAAA,CAAS,qBAAqB,CAAA;AAAA,QACjF,WAAA,EAAaA,KAAAA,CAAE,MAAA,EAAO,CAAE,GAAA,EAAI,CAAE,WAAA,EAAY,CAAE,QAAA,EAAS,CAAE,QAAA,CAAS,mCAAmC;AAAA,OACpG,EAAE,MAAA;AAAO,KACX,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,oBAAoB,CAAA;AAAA,IACzCA,MAAE,MAAA,CAAO;AAAA,MACP,QAAA,EAAUA,MAAE,MAAA,CAAO;AAAA,QACjB,GAAA,EAAKA,KAAAA,CAAE,KAAA,CAAM,CAACA,KAAAA,CAAE,QAAO,CAAE,GAAA,CAAI,CAAC,CAAA,EAAGA,KAAAA,CAAE,KAAA,CAAMA,MAAE,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAC,CAAC,CAAA,CAChE,QAAA,CAAS,uQAAkQ,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAO9Q,IAAA,EAAM;AAAA,OACP,EAAE,MAAA;AAAO,KACX,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA;AAAA,MACV;AAAA;AACF,GACD;AACH;AClHA,IAAM,cAAA,GAAiBA,MACpB,MAAA,CAAO;AAAA,EACN,SAAA,EAAW,YAAA;AAAA,EACX,IAAA,EAAM,kBAAA,CAAmB,QAAA,CAAS,8BAA8B;AAClE,CAAC,EACA,MAAA,EAAO;AAEH,IAAM,uBAAA,GAA0BA,MACpC,KAAA,CAAM;AAAA,EACLA,MAAE,MAAA,CAAO,EAAE,GAAA,EAAKA,KAAAA,CAAE,MAAM,CAAC,kBAAA,EAAoB,kBAAkB,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,iBAAiB,CAAA;AAAA,EACxGA,MAAE,MAAA,CAAO,EAAE,QAAA,EAAUA,KAAAA,CAAE,MAAM,CAAC,kBAAA,EAAoB,kBAAkB,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,oBAAoB,CAAA;AAAA,EAChHA,MAAE,MAAA,CAAO,EAAE,QAAA,EAAUA,KAAAA,CAAE,MAAM,CAAC,kBAAA,EAAoB,kBAAkB,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,uBAAuB,CAAA;AAAA,EACnHA,MAAE,MAAA,CAAO,EAAE,MAAA,EAAQA,KAAAA,CAAE,MAAM,CAAC,kBAAA,EAAoB,kBAAkB,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,iBAAiB,CAAA;AAAA,EAC3GA,MAAE,MAAA,CAAO,EAAE,MAAA,EAAQA,KAAAA,CAAE,MAAM,kBAAkB,CAAA,CAAE,GAAA,CAAI,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,sBAAsB,CAAA;AAAA,EACjGA,MAAE,MAAA,CAAO,EAAE,QAAA,EAAUA,KAAAA,CAAE,MAAM,kBAAkB,CAAA,CAAE,GAAA,CAAI,CAAC,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,8BAA8B,CAAA;AAAA,EAC3GA,MAAE,MAAA,CAAO;AAAA,IACP,IAAA,EAAMA,MACH,MAAA,CAAO;AAAA,MACN,IAAA,EAAMA,MAAE,KAAA,CAAM,cAAc,EAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,2CAA2C,CAAA;AAAA,MACzF,IAAA,EAAM,kBAAA,CAAmB,QAAA,CAAS,yCAAyC;AAAA,KAC5E,EACA,MAAA;AAAO,GACX,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,kCAAkC;AACzD,CAAC,CAAA,CACA,SAAS,yDAAyD;ACxBrE,IAAM,SAAA,GAAY,eAAA,CAAgB,QAAA,CAAS,mCAAmC,CAAA;AAK9E,IAAM,WAAA,GAAcA,MAAE,KAAA,CAAM,CAAC,WAAW,uBAAuB,CAAC,CAAA,CAAE,QAAA,CAAS,sCAAsC,CAAA;AAE1G,IAAM,yBAAA,GAA4BA,MACtC,KAAA,CAAM;AAAA,EACLA,KAAAA,CAAE,OAAO,EAAE,KAAA,EAAOA,MAAE,KAAA,CAAM,CAAC,eAAA,EAAiBA,KAAAA,CAAE,OAAA,CAAQ,GAAG,CAAC,CAAC,CAAA,CAAE,SAAS,gCAAgC,CAAA,EAAG,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,OAAO,CAAA;AAAA,EACpIA,KAAAA,CAAE,MAAA,CAAO,EAAE,aAAA,EAAe,eAAA,CAAgB,QAAA,CAAS,uDAAuD,CAAA,EAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,uBAAuB,CAAA;AAAA,EACxJA,KAAAA,CAAE,MAAA,CAAO,EAAE,GAAA,EAAK,WAAA,EAAa,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,KAAK,CAAA;AAAA,EACtDA,KAAAA,CAAE,MAAA,CAAO,EAAE,GAAA,EAAK,WAAA,EAAa,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,KAAK,CAAA;AAAA,EACtDA,KAAAA,CAAE,MAAA,CAAO,EAAE,GAAA,EAAK,WAAA,EAAa,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,KAAK,CAAA;AAAA,EACtDA,KAAAA,CAAE,MAAA,CAAO,EAAE,GAAA,EAAK,WAAA,EAAa,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,KAAK;AACxD,CAAC,CAAA,CACA,SAAS,qDAAqD;;;ACX1D,IAAM,eAAA,GAAkBA,MAC5B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MAAE,KAAA,CAAM,CAAC,iBAAiB,gBAAgB,CAAC,CAAA,CAAE,QAAA,CAAS,oEAAoE,CAAA;AAAA,EACjI,GAAA,EAAKA,KAAAA,CAAE,IAAA,CAAK,CAAC,KAAA,EAAO,MAAM,CAAC,CAAA,CAAE,OAAA,CAAQ,KAAK,CAAA,CAAE,QAAA,CAAS,gBAAgB;AACvE,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,oBAAoB,CAAA;AAyBhC,IAAM,oBAAA,GAAuBA,MAC1B,MAAA,CAAO;AAAA,EACN,EAAA,EAAI,gBAAA,CAAiB,QAAA,CAAS,gEAA2D,CAAA;AAAA,EACzF,OAAOA,KAAAA,CAAE,IAAA,CAAK,MAAwB,WAAW,CAAA,CAAE,SAAS,gBAAgB;AAC9E,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,2UAA2U,CAAA;AAEvV,IAAM,YAAA,GAAeA,MAClB,KAAA,CAAM;AAAA,EACLA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,sCAAsC,CAAA;AAAA,EAC1D;AACF,CAAC,CAAA,CACA,SAAS,sCAAsC,CAAA;AAElD,IAAM,cAAA,GAAiBA,MACpB,KAAA,CAAM;AAAA,EACL,eAAA,CAAgB,SAAS,iCAAiC,CAAA;AAAA,EAC1DA,MACG,MAAA,CAAO;AAAA,IACN,KAAA,EAAO,eAAA,CAAgB,QAAA,CAAS,iCAAiC,CAAA;AAAA,IACjE,EAAA,EAAI,gBAAA,CAAiB,QAAA,CAAS,4BAA4B;AAAA,GAC3D,CAAA,CACA,MAAA,EAAO,CACP,SAAS,iEAAiE;AAC/E,CAAC,CAAA,CACA,SAAS,2FAAsF,CAAA;AAE3F,IAAM,cAAgCA,KAAAA,CAAE,IAAA;AAAA,EAAK,MAClDA,MACG,MAAA,CAAO;AAAA,IACN,IAAA,EAAMA,MAAE,KAAA,CAAM,YAAY,EAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,yWAA+V,CAAA;AAAA,IAC3Y,MAAA,EAAQA,MAAE,KAAA,CAAM,cAAc,EAAE,QAAA,EAAS,CAAE,SAAS,oQAA0P,CAAA;AAAA,IAC9S,MAAA,EAAQ,YAAA,CAAa,QAAA,EAAS,CAAE,SAAS,mBAAmB,CAAA;AAAA,IAC5D,OAAA,EAASA,MAAE,MAAA,CAAO,gBAAA,EAAkB,uBAAuB,CAAA,CAAE,QAAA,EAAS,CAAE,QAAA,CAAS,qEAAgE,CAAA;AAAA,IACjJ,SAAA,EAAWA,MAAE,MAAA,CAAO,gBAAA,EAAkB,yBAAyB,CAAA,CAAE,QAAA,EAAS,CAAE,QAAA,CAAS,uEAAkE,CAAA;AAAA,IACvJ,OAAA,EAASA,MAAE,KAAA,CAAM,eAAe,EAAE,QAAA,EAAS,CAAE,SAAS,oCAAoC,CAAA;AAAA,IAC1F,IAAA,EAAMA,MAAE,KAAA,CAAM,eAAe,EAAE,QAAA,EAAS,CAAE,SAAS,YAAY,CAAA;AAAA,IAC/D,KAAA,EAAOA,KAAAA,CAAE,MAAA,EAAO,CAAE,GAAA,EAAI,CAAE,QAAA,EAAS,CAAE,QAAA,EAAS,CAAE,QAAA,CAAS,wBAAwB,CAAA;AAAA,IAC/E,UAAUA,KAAAA,CAAE,OAAA,GAAU,QAAA,EAAS,CAAE,SAAS,0BAA0B;AAAA,GACrE,CAAA,CACA,MAAA,EAAO,CACP,MAAA;AAAA,IACC,CAAC,CAAA,KAAA,CAAO,CAAA,CAAE,MAAA,EAAQ,UAAU,CAAA,IAAK,CAAA,IAAK,MAAA,CAAO,IAAA,CAAK,CAAA,CAAE,SAAA,IAAa,EAAE,EAAE,MAAA,GAAS,CAAA;AAAA,IAC9E,EAAE,SAAS,8DAAA;AAA+D;AAEhF;;;ACpFO,IAAM,QAAA,GAAN,cAAuB,KAAA,CAAM;AAAA,EACzB,IAAA;AAAA,EACA,OAAA;AAAA,EAET,WAAA,CAAY,IAAA,EAAsB,OAAA,EAAiB,OAAA,EAAmC;AACpF,IAAA,KAAA,CAAM,OAAO,CAAA;AACb,IAAA,IAAA,CAAK,IAAA,GAAO,UAAA;AACZ,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,OAAA,GAAU,OAAA;AAAA,EACjB;AACF;;;ACwBA,IAAM,QAAA,GAAW,CAAC,GAAA,KAAsC,KAAA,CAAM,QAAQ,GAAG,CAAA,GAAI,GAAA,GAAM,CAAC,GAAG,CAAA;AAGhF,IAAM,cAAA,GAAiB,CAAC,GAAA,KAAyB;AACtD,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,MAAM,IAAA,GAAO,CAAC,MAAA,KAAyB;AACrC,IAAA,IAAI,cAAc,MAAA,EAAQ;AACxB,MAAA,KAAA,MAAW,GAAA,IAAO,QAAA,CAAS,MAAA,CAAO,QAAA,CAAS,GAAG,CAAA,EAAG;AAC/C,QAAA,IAAI,CAAC,IAAA,CAAK,QAAA,CAAS,GAAG,CAAA,EAAG,IAAA,CAAK,KAAK,GAAG,CAAA;AAAA,MACxC;AACA,MAAA,IAAA,CAAK,MAAA,CAAO,SAAS,IAAI,CAAA;AACzB,MAAA;AAAA,IACF;AACA,IAAA,IAAI,SAAS,MAAA,EAAQ;AAAE,MAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,GAAA,EAAK,IAAA,CAAK,GAAG,CAAA;AAAG,MAAA;AAAA,IAAQ;AACxE,IAAA,IAAI,QAAQ,MAAA,EAAQ;AAAE,MAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,EAAA,EAAI,IAAA,CAAK,GAAG,CAAA;AAAG,MAAA;AAAA,IAAQ;AACtE,IAAA,IAAI,SAAS,MAAA,EAAQ;AAAE,MAAA,IAAA,CAAK,OAAO,GAAG,CAAA;AAAG,MAAA;AAAA,IAAQ;AAAA,EACnD,CAAA;AACA,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,MAAA,EAAW,IAAA,CAAK,IAAI,MAAM,CAAA;AAC7C,EAAA,KAAA,MAAW,MAAA,IAAU,IAAI,IAAA,EAAM;AAC7B,IAAA,IAAI,OAAO,MAAA,KAAW,QAAA,OAAe,IAAA,CAAK,GAAG,eAAe,MAAA,CAAO,KAAK,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAC,KAAK,QAAA,CAAS,CAAC,CAAC,CAAC,CAAA;AAAA,EAC5G;AACA,EAAA,OAAO,IAAA;AACT;AAyBO,IAAM,UAAA,GAAa,CAAC,OAAA,KAA0D;AACnF,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,OAAO,CAAA,EAAG;AAClD,IAAA,IAAI,UAAU,MAAA,IAAa,KAAA,KAAU,IAAA,EAAM,OAAA,CAAQ,IAAI,GAAG,CAAA;AAAA,EAC5D;AACA,EAAA,OAAO,OAAA;AACT;AAKO,IAAM,iBAAA,GAAoB,CAAC,GAAA,EAAY,OAAA,KAAiD;AAC7F,EAAA,MAAM,IAAA,GAAO,eAAe,GAAG,CAAA;AAC/B,EAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,EAAA;AAC9B,EAAA,IAAI,OAAA,KAAY,KAAA,EAAO,OAAO,IAAA,CAAK,KAAK,GAAG,CAAA;AAC3C,EAAA,OAAO,IAAA,CAAK,MAAA,CAAO,CAAC,CAAA,KAAM,OAAA,CAAQ,IAAI,CAAC,CAAC,CAAA,CAAE,IAAA,CAAK,GAAG,CAAA;AACpD,CAAA;AAKA,IAAM,KAAA,GAAQ,CAAC,MAAA,EAAgB,OAAA,EAAsC,YAAA,KAA8C;AACjH,EAAA,IAAI,cAAc,MAAA,EAAQ;AAMxB,IAAA,MAAM,IAAA,GAAO,QAAA,CAAS,MAAA,CAAO,QAAA,CAAS,GAAG,CAAA;AACzC,IAAA,IAAI,YAAA,EAAc;AAChB,MAAA,MAAM,IAAI,SAAS,aAAA,EAAe,CAAA,wBAAA,EAA2B,KAAK,IAAA,CAAK,IAAI,CAAC,CAAA,8EAAA,CAA2E,CAAA;AAAA,IACzJ;AAGA,IAAA,IAAI,OAAA,KAAY,KAAA,IAAS,CAAC,IAAA,CAAK,KAAA,CAAM,CAAC,GAAA,KAAQ,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAC,CAAA,EAAG,OAAO,MAAA;AACxE,IAAA,OAAO,KAAA,CAAM,MAAA,CAAO,QAAA,CAAS,IAAA,EAAM,SAAS,YAAY,CAAA;AAAA,EAC1D;AAEA,EAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,IAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,MAAA,CAAO,MAAA,KAAW,MAAA,GAAY,MAAA,GAAY,KAAA,CAAM,MAAA,CAAO,MAAA,CAAO,MAAA,EAAQ,OAAA,EAAS,IAAI,CAAA;AACxG,IAAA,OAAO,KAAA,KAAU,SACb,EAAE,MAAA,EAAQ,EAAE,IAAA,EAAM,MAAA,CAAO,OAAO,IAAA,EAAK,KACrC,EAAE,MAAA,EAAQ,EAAE,IAAA,EAAM,MAAA,CAAO,OAAO,IAAA,EAAM,MAAA,EAAQ,OAAM,EAAE;AAAA,EAC5D;AAEA,EAAA,IAAI,KAAA,IAAS,MAAA,IAAU,IAAA,IAAQ,MAAA,EAAQ;AACrC,IAAA,MAAM,QAAQ,KAAA,IAAS,MAAA;AACvB,IAAA,MAAM,QAAQ,KAAA,GAAQ,MAAA,CAAO,MAAM,MAAA,CAAO,EAAA,EACvC,IAAI,CAAC,GAAA,KAAQ,MAAM,GAAA,EAAK,OAAA,EAAS,YAAY,CAAC,CAAA,CAC9C,OAAO,CAAC,GAAA,KAAuB,QAAQ,MAAS,CAAA;AAGnD,IAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AAC9B,IAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,KAAK,CAAC,CAAA;AACpC,IAAA,OAAO,QAAQ,EAAE,GAAA,EAAK,MAAK,GAAI,EAAE,IAAI,IAAA,EAAK;AAAA,EAC5C;AAEA,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,MAAA,CAAO,GAAA,EAAK,SAAS,YAAY,CAAA;AAIrD,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,MAAM,IAAI,QAAA,CAAS,aAAA,EAAe,0GAAqG,CAAA;AAAA,IACzI;AACA,IAAA,OAAO,EAAE,KAAK,KAAA,EAAM;AAAA,EACtB;AAEA,EAAA,OAAO,MAAA;AACT,CAAA;AAQO,IAAM,aAAA,GAAgB,CAAC,GAAA,EAAY,OAAA,KAAgD;AACxF,EAAA,MAAM,IAAA,GAAiB,IAAI,IAAA,CAAK,GAAA;AAAA,IAAI,CAAC,MAAA,KACnC,OAAO,MAAA,KAAW,WAAW,MAAA,GAAS,EAAE,EAAA,EAAI,MAAA,CAAO,IAAI,KAAA,EAAO,aAAA,CAAc,MAAA,CAAO,KAAA,EAAO,OAAO,CAAA;AAAE,GACrG;AAEA,EAAA,IAAI,IAAI,MAAA,KAAW,MAAA,SAAkB,EAAE,GAAG,KAAK,IAAA,EAAK;AAEpD,EAAA,MAAM,MAAA,GAAS,KAAA,CAAM,GAAA,CAAI,MAAA,EAAQ,SAAS,KAAK,CAAA;AAC/C,EAAA,IAAI,WAAW,MAAA,EAAW;AACxB,IAAA,MAAM,EAAE,MAAA,EAAQ,QAAA,EAAU,GAAG,MAAK,GAAI,GAAA;AACtC,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,IAAA,EAAK;AAAA,EACzB;AACA,EAAA,OAAO,EAAE,GAAG,GAAA,EAAK,IAAA,EAAM,MAAA,EAAO;AAChC;AAGO,IAAM,cAAA,GAAiB,CAAC,KAAA,KAAyB;AACtD,EAAA,MAAM,IAAI,QAAA;AAAA,IACR,aAAA;AAAA,IACA,iCAAiC,KAAK,CAAA,qLAAA;AAAA,GACxC;AACF,CAAA;;;ACzKO,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;;;ACtOO,IAAM,UAAA,GAAa,CAAC,CAAA,KAAsC,IAAA,IAAQ,CAAA;;;ACvBlE,IAAM,aAAA,GAAN,cAA4B,QAAA,CAAS;AAAA,EACjC,MAAA;AAAA,EAET,WAAA,CAAY,QAAgB,OAAA,EAAiB;AAC3C,IAAA,KAAA,CAAM,gBAAgB,OAAO,CAAA;AAC7B,IAAA,IAAA,CAAK,IAAA,GAAO,eAAA;AACZ,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AAAA,EAChB;AACF;AA0BA,IAAM,UAAA,GAAa,CAAC,MAAA,EAAgB,IAAA,EAAmC,GAAA,KAAwC;AAC7G,EAAA,IAAI,SAAS,MAAA,EAAW;AACtB,IAAA,IAAI,GAAA,KAAQ,QAAQ,MAAM,IAAI,cAAc,MAAA,EAAQ,CAAA,QAAA,EAAW,MAAM,CAAA,gDAAA,CAAkD,CAAA;AACvH,IAAA,OAAO,EAAC;AAAA,EACV;AACA,EAAA,IAAI,QAAA,IAAY,IAAA,EAAM,OAAO,EAAC;AAC9B,EAAA,IAAI,MAAA,IAAU,MAAM,MAAM,IAAI,cAAc,MAAA,EAAQ,CAAA,QAAA,EAAW,MAAM,CAAA,2BAAA,CAA6B,CAAA;AAClG,EAAA,IAAI,IAAA,CAAK,SAAS,MAAA,EAAW;AAC3B,IAAA,IAAI,GAAA,KAAQ,QAAQ,MAAM,IAAI,cAAc,MAAA,EAAQ,CAAA,UAAA,EAAa,MAAM,CAAA,iDAAA,CAAmD,CAAA;AAC1H,IAAA,OAAO,EAAC;AAAA,EACV;AACA,EAAA,OAAO,IAAA,CAAK,IAAA;AACd,CAAA;AAMO,IAAM,YAAA,GAAe,CAAC,MAAA,EAAqB,KAAA,KAA2B;AAC3E,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA;AAClC,EAAA,IAAI,IAAA,KAAS,MAAA,EAAW,OAAO,MAAA,CAAO,OAAA,KAAY,OAAA;AAClD,EAAA,IAAI,QAAA,IAAY,MAAM,OAAO,IAAA;AAC7B,EAAA,IAAI,MAAA,IAAU,MAAM,OAAO,KAAA;AAC3B,EAAA,OAAO,IAAA,CAAK,IAAA,KAAS,MAAA,IAAa,MAAA,CAAO,OAAA,KAAY,OAAA;AACvD,CAAA;AASO,IAAM,UAAA,GAAa,CAAC,QAAA,EAAuB,MAAA,KAA8B;AAC9E,EAAA,KAAA,MAAW,MAAA,IAAU,UAAU,UAAA,CAAW,MAAA,EAAQ,OAAO,QAAA,CAAS,MAAM,CAAA,EAAG,MAAA,CAAO,OAAO,CAAA;AAC3F;AAMA,IAAM,QAAA,GAAW,CAAC,QAAA,EAAsC,SAAA,KAA4D;AAClH,EAAA,IAAI,SAAA,CAAU,MAAA,KAAW,CAAA,EAAG,OAAO,QAAA;AACnC,EAAA,MAAM,MAAM,QAAA,KAAa,MAAA,GAAY,YAAY,CAAC,QAAA,EAAU,GAAG,SAAS,CAAA;AACxE,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,IAAI,CAAC,CAAA;AAElC,EAAA,MAAM,KAAA,uBAAY,GAAA,EAA8D;AAChF,EAAA,KAAA,MAAW,IAAA,IAAQ,GAAA,EAAK,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,CAAA,IAAK,IAAA,CAAK,aAAA,EAAe,KAAA,CAAM,GAAA,CAAI,GAAA,EAAK,KAAc,CAAA;AACpG,EAAA,OAAO,EAAE,QAAA,EAAU,EAAE,GAAA,EAAK,GAAA,CAAI,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,QAAQ,CAAA,EAAE,EAAG,eAAe,KAAA,EAAe;AACxF,CAAA;AAGA,IAAM,YAAA,GAAe,CACnB,UAAA,EACA,KAAA,EACA,OACA,MAAA,KAC+B;AAC/B,EAAA,MAAM,KAAA,GAAQ,OAAO,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,MAAM,KAAK,CAAA;AAGvD,EAAA,IAAI,KAAA,KAAU,MAAA,EAAW,MAAM,IAAI,aAAA,CAAc,UAAA,EAAY,CAAA,gBAAA,EAAmB,UAAU,CAAA,gBAAA,EAAmB,KAAA,CAAM,KAAK,CAAA,gCAAA,CAAkC,CAAA;AAC1J,EAAA,MAAM,IAAA,GAAO,CAAA,EAAG,UAAU,CAAA,CAAA,EAAI,MAAM,KAAK,CAAA,CAAA;AAKzC,EAAA,MAAM,QAAA,GAAmB,UAAA,CAAW,KAAK,CAAA,GACrC,EAAE,IAAI,CAAC,IAAA,EAAM,EAAE,MAAA,EAAQ,KAAA,CAAM,EAAA,EAAI,CAAA,EAAE,GACnC,EAAE,EAAA,EAAI,CAAC,IAAA,EAAM,EAAE,MAAA,EAAQ,KAAA,CAAM,EAAA,EAAI,CAAA,EAAE;AACvC,EAAA,OAAO,EAAE,QAAA,EAAU,aAAA,sBAAmB,GAAA,CAAI,CAAC,CAAC,IAAA,EAAM,EAAE,KAAA,EAAO,MAAA,EAAQ,MAAM,KAAA,EAAO,MAAA,EAAQ,OAAgB,CAAC,CAAC,CAAA,EAAW;AACvH,CAAA;AAYA,IAAM,SAAA,GAAY,CAAC,KAAA,EAAmB,MAAA,KAA8B;AAClE,EAAA,MAAM,iBAAmC,EAAC;AAE1C,EAAA,KAAA,MAAW,MAAA,IAAU,MAAM,OAAA,EAAS;AAClC,IAAA,MAAM,SAAS,MAAA,CAAO,MAAA;AACtB,IAAA,IAAI,WAAW,MAAA,EAAW;AAE1B,IAAA,MAAM,IAAA,GAAO,MAAM,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,OAAA,KAAY,MAAA,CAAO,KAAK,CAAA;AAC/D,IAAA,KAAA,MAAW,KAAA,IAAS,UAAA,CAAW,MAAA,CAAO,IAAA,EAAM,MAAA,CAAO,QAAA,CAAS,MAAA,CAAO,IAAI,CAAA,EAAG,MAAA,CAAO,OAAO,CAAA,EAAG;AACzF,MAAA,MAAM,SAAA,GAAY,aAAa,MAAA,CAAO,IAAA,EAAM,OAAO,KAAA,EAAO,KAAA,EAAO,OAAO,MAAM,CAAA;AAC9E,MAAA,IAAI,cAAc,MAAA,EAAW;AAK7B,MAAA,KAAA,CAAM,QAAA,CAAS,GAAA,CAAI,CAAA,EAAG,MAAA,CAAO,IAAI,CAAA,CAAA,EAAI,KAAA,CAAM,KAAK,CAAA,CAAA,EAAI,GAAG,MAAA,CAAO,KAAK,CAAA,CAAA,EAAI,KAAA,CAAM,KAAK,CAAA,CAAE,CAAA;AAEpF,MAAA,IAAI,IAAA,KAAS,MAAA,IAAa,IAAA,CAAK,IAAA,KAAS,MAAA,EAAQ,IAAA,CAAK,EAAA,GAAK,CAAC,GAAI,IAAA,CAAK,EAAA,IAAM,IAAK,SAAS,CAAA;AAAA,WACnF,cAAA,CAAe,KAAK,SAAS,CAAA;AAAA,IACpC;AAAA,EACF;AAEA,EAAA,MAAM,MAAA,GAAS,QAAA,CAAS,KAAA,CAAM,MAAA,EAAQ,cAAc,CAAA;AACpD,EAAA,IAAI,MAAA,KAAW,MAAA,EAAW,KAAA,CAAM,MAAA,GAAS,MAAA;AAC3C,CAAA;AAWO,IAAM,aAAA,GAAgB,CAAC,QAAA,EAAyB,MAAA,KAAuC;AAC5F,EAAA,KAAA,MAAW,MAAA,IAAU,SAAS,OAAA,EAAS;AACrC,IAAA,IAAI,OAAO,QAAA,KAAa,MAAA,EAAW,aAAA,CAAc,MAAA,CAAO,UAAU,MAAM,CAAA;AAAA,EAC1E;AAIA,EAAA,KAAA,MAAW,QAAQ,QAAA,CAAS,SAAA,EAAW,MAAA,EAAO,IAAK,EAAC,EAAG;AACrD,IAAA,SAAA,CAAU,MAAM,MAAM,CAAA;AAAA,EACxB;AAEA,EAAA,SAAA,CAAU,UAAU,MAAM,CAAA;AAC1B,EAAA,OAAO,QAAA;AACT;AAOO,IAAM,UAAA,GAAa,CAAC,GAAA,EAAY,QAAA,EAAuB,MAAA,KAA+B;AAC3F,EAAA,UAAA,CAAW,UAAU,MAAM,CAAA;AAC3B,EAAA,OAAO,GAAA;AACT;;;ACzKO,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;;;AChKA,IAAM,cAAA,GAAiB,CAAC,IAAA,KAAqC;AAC3D,EAAA,IAAI,IAAA,KAAS,UAAU,OAAO,EAAA;AAC9B,EAAA,IAAI,IAAA,KAAS,UAAU,OAAO,CAAA;AAC9B,EAAA,IAAI,IAAA,KAAS,WAAW,OAAO,KAAA;AAC/B,EAAA,IAAI,IAAA,KAAS,UAAA,EAAY,OAAO,CAAC,EAAE,CAAA;AACnC,EAAA,IAAI,IAAA,KAAS,UAAA,EAAY,OAAO,CAAC,CAAC,CAAA;AAClC,EAAA,IAAI,IAAA,KAAS,MAAA,EAAQ,OAAO,EAAC;AAC7B,EAAA,OAAO,EAAA;AACT,CAAA;AAEO,IAAM,sBAAA,GAAyB,CAAC,QAAA,KAAuD;AAC5F,EAAA,MAAM,MAA+B,EAAC;AACtC,EAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,IAAA,CAAK,QAAQ,CAAA,EAAG;AACvC,IAAA,MAAM,IAAA,GAAO,SAAS,GAAG,CAAA;AACzB,IAAA,IAAI,SAAS,MAAA,EAAW;AAExB,IAAA,IAAI,IAAA,CAAK,SAAS,UAAA,EAAY;AAC9B,IAAA,GAAA,CAAI,GAAG,CAAA,GAAI,cAAA,CAAe,IAAA,CAAK,IAAI,CAAA;AAAA,EACrC;AACA,EAAA,OAAO,GAAA;AACT;AAMO,IAAM,aAAA,GAAgB,OAC3B,KAAA,EACA,OAAA,EACA,OACA,KAAA,KACuB;AACvB,EAAA,MAAM,UAAqB,EAAC;AAE5B,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,IAAA,CAAK,SAAS,SAAA,EAAW;AAC3B,MAAA,OAAA,CAAQ,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,GAAG,CAAC,CAAA;AAC9B,MAAA;AAAA,IACF;AAEA,IAAA,IAAI,IAAA,CAAK,SAAS,OAAA,EAAS;AACzB,MAAA,OAAA,CAAQ,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,GAAG,CAAC,CAAA;AAC5B,MAAA;AAAA,IACF;AAGA,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,oBAAA,EAAuB,IAAA,CAAK,GAAG,CAAA,4BAAA,CAA8B,CAAA;AAAA,IAC/E;AACA,IAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,IAAA,CAAK,GAAG,CAAA;AAC7B,IAAA,IAAI,OAAO,SAAS,QAAA,EAAU;AAC5B,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,oBAAA,EAAuB,IAAA,CAAK,GAAG,CAAA,oCAAA,CAAsC,CAAA;AAAA,IACvF;AACA,IAAA,MAAM,MAAA,GAAS,MAAM,KAAA,CAAM,IAAA,EAAM,KAAK,UAAU,CAAA;AAChD,IAAA,OAAA,CAAQ,KAAK,CAAA,CAAA,EAAI,MAAA,CAAO,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,EACtC;AAEA,EAAA,OAAO,OAAA;AACT;;;ACvDO,IAAM,eAAe,OAC1B,QAAA,EACA,OAAA,EACA,KAAA,EACA,SACA,KAAA,KACmB;AACnB,EAAA,MAAM,cAAc,MAAM,aAAA;AAAA,IACxB,QAAA,CAAS,UAAA;AAAA,IACT,OAAA;AAAA,IACA,KAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,OAAO,OAAA,CAAQ,OAAA,CAAQ,QAAA,EAAU,WAAW,CAAA;AAC9C;AAMO,IAAM,oBAAA,GAAuB,CAClC,QAAA,EAKA,YAAA,GAAkC,EAAC,KACH;AAChC,EAAA,MAAM,WAAwC,EAAC;AAE/C,EAAA,KAAA,MAAW,IAAA,IAAQ,SAAS,UAAA,EAAY;AACtC,IAAA,QAAA,CAAS,IAAA,CAAK,GAAG,CAAA,GAAI;AAAA,MACnB,MAAM,IAAA,CAAK,IAAA;AAAA,MACX,MAAM,IAAA,CAAK,IAAA;AAAA,MACX,GAAI,YAAA,CAAa,QAAA,CAAS,IAAA,CAAK,GAAG,IAAI,EAAE,QAAA,EAAU,IAAA,EAAc,GAAI;AAAC,KACvE;AAAA,EACF;AAEA,EAAA,KAAA,MAAW,OAAO,YAAA,EAAc;AAC9B,IAAA,IAAI,QAAA,CAAS,GAAG,CAAA,KAAM,MAAA,EAAW;AACjC,IAAA,QAAA,CAAS,GAAG,IAAI,EAAE,IAAA,EAAM,WAAW,QAAA,EAAU,IAAA,EAAM,QAAQ,IAAA,EAAK;AAAA,EAClE;AAEA,EAAA,OAAO,QAAA;AACT;AASO,IAAM,kBAAA,GAAqB,CAChC,QAAA,EACA,OAAA,KACa;AACb,EAAA,MAAM,UAAoB,EAAC;AAE3B,EAAA,KAAA,MAAW,IAAA,IAAQ,SAAS,UAAA,EAAY;AACtC,IAAA,IAAA,CAAK,IAAA,CAAK,IAAA,KAAS,SAAA,IAAa,IAAA,CAAK,IAAA,KAAS,eAAe,OAAA,CAAQ,IAAA,CAAK,GAAG,CAAA,KAAM,MAAA,EAAW;AAC5F,MAAA,OAAA,CAAQ,IAAA,CAAK,KAAK,GAAG,CAAA;AAAA,IACvB;AAAA,EACF;AAEA,EAAA,OAAO,OAAA;AACT;AAWO,IAAM,YAAA,GAAe,CAAC,QAAA,EAAoE,KAAA,KAAyC;AACxI,EAAA,MAAM,OAAA,GAAU,CAAC,GAAG,IAAI,GAAA,CAAI,SAAS,UAAA,CAAW,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,IAAA,KAAS,WAAW,KAAA,CAAM,IAAA,CAAK,GAAG,CAAA,KAAM,MAAS,CAAA,CAAE,GAAA,CAAI,CAAC,IAAA,KAAS,IAAA,CAAK,GAAG,CAAC,CAAC,CAAA;AACjJ,EAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtB,IAAA,MAAM,IAAI,QAAA,CAAS,eAAA,EAAiB,CAAA,4BAAA,EAA+B,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAC,CAAA,gCAAA,CAAA,EAAoC,EAAE,IAAA,EAAM,OAAA,EAAS,CAAA;AAAA,EAC5I;AACF,CAAA;;;ACzFO,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;ACxBA,IAAM,QAAA,GAAW,CAAC,KAAA,KAChB,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA,IAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA;AAE9D,IAAM,cAAA,GAAiB,CAAC,KAAA,KAA4B;AACzD,EAAA,IAAI,KAAA,KAAU,MAAM,OAAO,MAAA;AAC3B,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,SAAA;AAEhC,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AAExB,IAAA,MAAM,KAAA,GAAiB,MAAM,CAAC,CAAA;AAC9B,IAAA,OAAO,UAAU,MAAA,GAAY,CAAC,eAAe,KAAK,CAAC,IAAI,EAAC;AAAA,EAC1D;AAEA,EAAA,IAAI,QAAA,CAAS,KAAK,CAAA,EAAG;AACnB,IAAA,MAAM,UAAA,GAAa,MAAA,CAAO,IAAA,CAAK,KAAK,EAAE,IAAA,EAAK;AAC3C,IAAA,MAAM,aAAsC,EAAC;AAC7C,IAAA,KAAA,MAAW,OAAO,UAAA,EAAY;AAC5B,MAAA,UAAA,CAAW,GAAG,CAAA,GAAI,cAAA,CAAe,KAAA,CAAM,GAAG,CAAC,CAAA;AAAA,IAC7C;AACA,IAAA,OAAO,UAAA;AAAA,EACT;AAEA,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,OAAO,QAAA;AACtC,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,OAAO,QAAA;AACtC,EAAA,IAAI,OAAO,KAAA,KAAU,SAAA,EAAW,OAAO,SAAA;AAGvC,EAAA,OAAO,SAAA;AACT;AAYO,IAAM,eAAA,GAAkB,MAC7B,CAAA,GAAA,EAAMC,iBAAA,CAAW,QAAQ,CAAA,CAAE,MAAA,CAAO,CAAA,EAAG,IAAA,CAAK,GAAA,EAAK,IAAI,IAAA,CAAK,MAAA,EAAQ,CAAA,CAAE,CAAA,CAAE,MAAA,CAAO,KAAK,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,EAAE,CAAC,CAAA;AA+BzF,IAAM,kBAAA,GAAqB,CAAC,OAAA,KAIrB;AACZ,EAAA,MAAM,QAAA,GAAW;AAAA,IACf,MAAA,EAAQ,QAAQ,MAAA,IAAU,IAAA;AAAA,IAC1B,KAAA,EAAO,cAAA,CAAe,OAAA,CAAQ,KAAK,CAAA;AAAA,IACnC,WAAA,EAAa,OAAO,IAAA,CAAK,OAAA,CAAQ,WAAW,EAAE,EAAE,IAAA;AAAK,GACvD;AACA,EAAA,OAAOA,iBAAA,CAAW,QAAQ,CAAA,CAAE,MAAA,CAAO,IAAA,CAAK,UAAU,QAAQ,CAAC,CAAA,CAAE,MAAA,CAAO,KAAK,CAAA;AAC3E;AAMA,IAAM,SAAA,GAAY,CAAC,KAAA,KAA4B;AAC7C,EAAA,IAAI,MAAM,OAAA,CAAQ,KAAK,GAAG,OAAO,KAAA,CAAM,IAAI,SAAS,CAAA;AACpD,EAAA,IAAI,QAAA,CAAS,KAAK,CAAA,EAAG;AACnB,IAAA,MAAM,MAA+B,EAAC;AACtC,IAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,CAAE,IAAA,EAAK,EAAG,GAAA,CAAI,GAAG,CAAA,GAAI,SAAA,CAAU,KAAA,CAAM,GAAG,CAAC,CAAA;AAC5E,IAAA,OAAO,GAAA;AAAA,EACT;AACA,EAAA,OAAO,KAAA;AACT,CAAA;AAEO,IAAM,gBAAA,GAAmB,CAAC,MAAA,KAC/B,MAAA,KAAW,SAAY,MAAA,GAASA,iBAAA,CAAW,QAAQ,CAAA,CAAE,MAAA,CAAO,IAAA,CAAK,UAAU,SAAA,CAAU,MAAM,CAAC,CAAC,CAAA,CAAE,OAAO,KAAK,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAEnH,IAAM,wBAAA,GAA2B,CAAC,MAAA,KAAmC;AAC1E,EAAA,MAAM,MAAA,GAAS,CAAC,CAAA,EAAqB,CAAA,KAAwB,EAAE,IAAA,CAAK,aAAA,CAAc,EAAE,IAAI,CAAA;AAExF,EAAA,MAAM,MAAA,GAAS;AAAA,IACb,QAAA,EAAU,CAAC,GAAG,MAAA,CAAO,QAAQ,CAAA,CAAE,IAAA,CAAK,MAAM,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,MACtD,MAAM,CAAA,CAAE,IAAA;AAAA,MACR,OAAO,CAAA,CAAE,KAAA;AAAA,MACT,MAAA,EAAQ,CAAC,GAAG,CAAA,CAAE,MAAM,CAAA,CAAE,IAAA,CAAK,MAAM,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,QAC7C,MAAM,CAAA,CAAE,IAAA;AAAA,QACR,MAAM,CAAA,CAAE,IAAA;AAAA,QACR,gBAAgB,CAAA,CAAE,cAAA;AAAA,QAClB,UAAU,CAAA,CAAE,QAAA;AAAA,QACZ,YAAY,CAAA,CAAE,UAAA;AAAA,QACd,GAAI,EAAE,gBAAA,KAAqB,MAAA,GAAY,EAAE,gBAAA,EAAkB,CAAA,CAAE,gBAAA,EAAiB,GAAI;AAAC,OACrF,CAAE,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAKF,SAAA,EAAW,CAAC,GAAG,CAAA,CAAE,SAAS,CAAA,CACvB,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,EAAG,EAAE,MAAM,CAAA,CAAA,EAAI,EAAE,WAAA,CAAY,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAG,aAAA,CAAc,CAAA,EAAG,CAAA,CAAE,MAAM,IAAI,CAAA,CAAE,WAAA,CAAY,KAAK,GAAG,CAAC,EAAE,CAAC,CAAA,CAC/G,GAAA,CAAI,CAAC,CAAA,MAAO,EAAE,MAAM,CAAA,CAAE,IAAA,EAAM,MAAA,EAAQ,CAAA,CAAE,MAAA,EAAQ,WAAA,EAAa,EAAE,WAAA,EAAa,aAAA,EAAe,CAAA,CAAE,aAAA,EAAc,CAAE,CAAA;AAAA;AAAA;AAAA,MAG9G,OAAA,EAAS,CAAC,GAAG,CAAA,CAAE,OAAO,CAAA,CAAE,IAAA,CAAK,MAAM,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,QAC/C,MAAM,CAAA,CAAE,IAAA;AAAA,QACR,QAAQ,CAAA,CAAE,MAAA;AAAA,QACV,QAAQ,CAAA,CAAE,MAAA;AAAA,QACV,MAAM,CAAA,CAAE;AAAA,OACV,CAAE;AAAA,KACJ,CAAE;AAAA,GACJ;AAEA,EAAA,OAAOA,iBAAA,CAAW,QAAQ,CAAA,CAAE,MAAA,CAAO,IAAA,CAAK,UAAU,MAAM,CAAC,CAAA,CAAE,MAAA,CAAO,KAAK,CAAA;AACzE;;;ACxIO,IAAM,aAAA,GAAgB,CAAC,CAAA,EAAqB,OAAA,KAA2C;AAC5F,EAAA,KAAK,CAAA,CAAE,KAAA,CAAM,CAAC,GAAA,KAAQ;AACpB,IAAA,IAAI,OAAA,UAAiB,GAAG,CAAA;AAAA,SACnB,OAAA,CAAQ,KAAA,CAAM,aAAA,EAAe,GAAG,CAAA;AAAA,EACvC,CAAC,CAAA;AACH,CAAA;AAQO,IAAM,cAAA,GAAiB,GAAA;AAGvB,IAAM,UAAA,GAAa,CAAC,KAAA,EAAmB,GAAA,KAC5C,MAAM,UAAA,KAAe,MAAA,IAAa,GAAA,GAAM,KAAA,CAAM,UAAA,IAAc,cAAA;AAQvD,IAAM,YAAA,GAAe,CAAC,KAAA,EAAmB,kBAAA,KAAyC;AACvF,EAAA,MAAM,UAAU,KAAA,CAAM,SAAA,KAAc,UAAa,KAAA,CAAM,SAAA,IAAa,KAAK,GAAA,EAAI;AAC7E,EAAA,MAAM,QACJ,KAAA,CAAM,iBAAA,KAAsB,UAC5B,kBAAA,KAAuB,MAAA,IACvB,MAAM,iBAAA,KAAsB,kBAAA;AAC9B,EAAA,OAAO,CAAC,WAAW,CAAC,KAAA;AACtB,CAAA;AASO,IAAM,UAAA,GAAa,OACxB,KAAA,EAMA,OAAA,KACoB;AACpB,EAAA,MAAM,MAAA,GAAS,IAAA,CAAK,GAAA,EAAI,GAAI,OAAA,CAAQ,SAAA;AACpC,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,OAAA,KAAY,MAAA,GAC3B,MAAM,KAAA,CAAM,OAAA,EAAQ,GACpB,MAAM,OAAA,CAAQ,GAAA,CAAA,CAAK,MAAM,KAAA,CAAM,IAAA,EAAK,EAAG,GAAA,CAAI,OAAO,GAAA,MAAS,EAAE,GAAA,EAAK,KAAA,EAAO,MAAM,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA,EAAE,CAAE,CAAC,CAAA;AAErG,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,KAAA,MAAW,EAAE,GAAA,EAAK,KAAA,EAAM,IAAK,IAAA,EAAM;AACjC,IAAA,IAAI,UAAU,MAAA,EAAW;AACzB,IAAA,IAAI,KAAA,CAAM,cAAc,IAAA,EAAM;AAC9B,IAAA,MAAM,SAAA,GAAY,KAAA,CAAM,UAAA,IAAc,KAAA,CAAM,SAAA;AAC5C,IAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,MAAA,MAAM,KAAA,CAAM,OAAO,GAAG,CAAA;AACtB,MAAA,OAAA,IAAW,CAAA;AAAA,IACb;AAAA,EACF;AACA,EAAA,OAAO,OAAA;AACT;AC9DO,IAAMC,UAAAA,GAAY,CAAC,KAAA,KAA4B;AACpD,EAAA,IAAI,MAAM,OAAA,CAAQ,KAAK,GAAG,OAAO,KAAA,CAAM,IAAIA,UAAS,CAAA;AACpD,EAAA,IAAI,UAAU,IAAA,IAAQ,OAAO,UAAU,QAAA,IAAY,EAAE,iBAAiB,IAAA,CAAA,EAAO;AAC3E,IAAA,MAAM,SAAkC,EAAC;AACzC,IAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,CAAA,IAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,CAAE,IAAA,CAAK,CAAC,CAAC,CAAC,CAAA,EAAG,CAAC,CAAC,CAAA,KAAO,CAAA,GAAI,CAAA,GAAI,EAAA,GAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAE,CAAA,EAAG,MAAA,CAAO,GAAG,CAAA,GAAIA,UAAAA,CAAU,KAAK,CAAA;AAChI,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,OAAO,KAAA;AACT,CAAA;AAEO,IAAM,aAAA,GAAgB,CAAC,KAAA,KAA2B,IAAA,CAAK,UAAUA,UAAAA,CAAU,KAAK,CAAC,CAAA,IAAK,WAAA;AAEtF,IAAM,QAAA,GAAW,CAAC,IAAA,KAAyBD,iBAAAA,CAAW,QAAQ,EAAE,MAAA,CAAO,IAAI,CAAA,CAAE,MAAA,CAAO,KAAK,CAAA;AAEzF,IAAM,gBAAgB,CAAC,KAAA,KAA2B,QAAA,CAAS,aAAA,CAAc,KAAK,CAAC,CAAA;;;AC2DtF,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,EAAaE,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,aAAA,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,MAAM,OAAA,GAAU,OACd,OAAA,EACA,OAAA,KAC2B;AAC3B,IAAA,IAAIC,mBAAA,CAAa,OAAO,CAAA,EAAG,MAAM,IAAI,SAAS,iBAAA,EAAmB,CAAA,iBAAA,EAAoBC,mBAAA,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,MACnBT,KAAAA,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,IACA,OAAA;AAAA,IACA,OAAA,EAAAI,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;;;ACzaA,IAAM,iBAAA,GAAoB,CAAC,GAAA,KAAsB;AAC/C,EAAA,IAAI,qBAAA,CAAsB,IAAI,GAAG,CAAA;AAC/B,IAAA,MAAM,IAAI,QAAA;AAAA,MACR,aAAA;AAAA,MACA,IAAI,GAAG,CAAA,kFAAA;AAAA,KACT;AACJ,CAAA;AAsCO,IAAM,YAAA,GAAe,CAAC,CAAA,KAAsB;AACjD,EAAA,MAAM,OAAA,GAAU,CAAA,CAAE,OAAA,CAAQ,IAAA,EAAM,IAAI,CAAA;AAIpC,EAAA,OAAO,CAAA,CAAE,QAAA,CAAS,IAAI,CAAA,GAAI,CAAA,EAAA,EAAK,OAAA,CAAQ,OAAA,CAAQ,KAAA,EAAO,MAAM,CAAC,CAAA,CAAA,CAAA,GAAM,CAAA,CAAA,EAAI,OAAO,CAAA,CAAA,CAAA;AAChF,CAAA;AAEO,IAAM,UAAA,GAAa,CAAC,IAAA,KAAyB,CAAA,CAAA,EAAI,KAAK,OAAA,CAAQ,IAAA,EAAM,IAAI,CAAC,CAAA,CAAA,CAAA;AAGzE,IAAM,aAAA,GAAgB,CAAC,CAAA,KAAsB;AAClD,EAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,EAAG,MAAM,IAAI,QAAA,CAAS,aAAA,EAAe,CAAA,EAAG,MAAA,CAAO,CAAC,CAAC,CAAA,8BAAA,CAAgC,CAAA;AACvG,EAAA,OAAO,OAAO,CAAC,CAAA;AACjB,CAAA;AAEA,IAAM,QAAA,GAAW,CAAC,IAAA,EAAc,GAAA,KAAoC;AAClE,EAAA,MAAM,MAAA,GAAS,GAAA,CAAI,QAAA,CAAS,GAAA,CAAI,IAAI,CAAA;AACpC,EAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AACjC,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,aAAA,CAAc,GAAA,CAAI,IAAI,CAAA;AACtC,EAAA,IAAI,GAAA,KAAQ,QAAW,OAAO,CAAA,EAAG,IAAI,KAAK,CAAA,CAAA,EAAI,IAAI,MAAM,CAAA,CAAA;AACxD,EAAA,MAAM,IAAI,QAAA,CAAS,aAAA,EAAe,CAAA,CAAA,EAAI,IAAI,CAAA,mCAAA,CAAqC,CAAA;AACjF,CAAA;AAEA,IAAMO,YAAAA,GAAc,gBAAA;AAEpB,IAAM,cAAA,GAAiB,CAAC,IAAA,EAAc,aAAA,KAAkE;AACtG,EAAA,MAAM,GAAA,GAAM,aAAA,CAAc,GAAA,CAAI,IAAI,CAAA;AAClC,EAAA,IAAI,GAAA,KAAQ,QAAW,OAAO,QAAA;AAC9B,EAAA,MAAM,EAAA,GAAK,IAAI,MAAA,CAAO,cAAA;AACtB,EAAA,IAAI,EAAA,KAAO,UAAU,OAAO,QAAA;AAC5B,EAAA,IAAI,EAAA,KAAO,WAAW,OAAO,SAAA;AAC7B,EAAA,OAAO,QAAA;AACT,CAAA;AAEO,IAAM,mBAAA,GAAsB,CACjC,GAAA,EACA,GAAA,KACW;AACX,EAAA,IAAI,GAAA,KAAQ,MAAM,OAAO,MAAA;AACzB,EAAA,IAAI,OAAO,GAAA,KAAQ,SAAA,EAAW,OAAO,MAAM,MAAA,GAAS,OAAA;AACpD,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,EAAU,OAAO,cAAc,GAAG,CAAA;AAErD,EAAA,IAAI,OAAO,QAAQ,QAAA,EAAU;AAG3B,IAAA,OAAOA,YAAAA,CAAY,GAAG,CAAA,GAAI,QAAA,CAAS,KAAK,GAAG,CAAA,GAAI,aAAa,GAAG,CAAA;AAAA,EACjE;AAGA,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,IAAY,GAAA,KAAQ,IAAA,IAAQ,cAAc,GAAA,EAAK;AAChE,IAAA,MAAM,MAAM,GAAA,CAAI,QAAA;AAChB,IAAA,iBAAA,CAAkB,GAAG,CAAA;AACrB,IAAA,GAAA,CAAI,aAAa,KAAA,IAAS,CAAA;AAC1B,IAAA,GAAA,CAAI,WAAW,IAAA,CAAK;AAAA,MAClB,GAAA;AAAA,MACA,IAAA,EAAM,SAAA;AAAA,MACN,IAAA,EAAM,cAAA,CAAe,GAAA,EAAK,GAAA,CAAI,aAAa;AAAA,KAC5C,CAAA;AACD,IAAA,OAAO,CAAA,CAAA,EAAI,GAAA,CAAI,YAAA,CAAa,KAAK,CAAA,CAAA;AAAA,EACnC;AAEA,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,IAAY,GAAA,KAAQ,IAAA,IAAQ,YAAY,GAAA,EAAK;AAC9D,IAAA,MAAM,MAAM,GAAA,CAAI,MAAA;AAChB,IAAA,GAAA,CAAI,aAAa,KAAA,IAAS,CAAA;AAC1B,IAAA,GAAA,CAAI,WAAW,IAAA,CAAK;AAAA,MAClB,GAAA;AAAA,MACA,IAAA,EAAM,OAAA;AAAA,MACN,IAAA,EAAM,cAAA,CAAe,GAAA,EAAK,GAAA,CAAI,aAAa;AAAA,KAC5C,CAAA;AACD,IAAA,OAAO,CAAA,CAAA,EAAI,GAAA,CAAI,YAAA,CAAa,KAAK,CAAA,CAAA;AAAA,EACnC;AAEA,EAAA,OAAO,MAAA;AACT;AAWO,IAAM,gBAAA,GAAmB,CAAC,IAAA,KAC/B,IAAA,CAAK,YAAY,GAAA,CAAI,CAAC,QAAQ,CAAA,KAAM;AAClC,EAAA,MAAM,EAAA,GAAK,IAAA,CAAK,SAAA,CAAU,CAAC,CAAA;AAC3B,EAAA,IAAI,OAAO,MAAA,EAAW;AACpB,IAAA,MAAM,IAAI,QAAA;AAAA,MACR,aAAA;AAAA,MACA,kBAAkB,IAAA,CAAK,SAAS,SAAS,IAAA,CAAK,OAAO,YAAY,MAAM,CAAA,iBAAA;AAAA,KACzE;AAAA,EACF;AACA,EAAA,OAAO,CAAA,EAAG,KAAK,SAAS,CAAA,CAAA,EAAI,MAAM,CAAA,GAAA,EAAM,IAAA,CAAK,OAAO,CAAA,CAAA,EAAI,EAAE,CAAA,CAAA;AAC5D,CAAC,CAAA;AAMH,IAAM,uBAAA,GAA0B,CAC9B,EAAA,EACA,IAAA,EACA,GAAA,KACW;AACX,EAAA,MAAM,IAAA,GAAO,mBAAA,CAAoB,IAAA,CAAK,CAAC,GAAG,GAAG,CAAA;AAC7C,EAAA,MAAM,KAAA,GAAQ,mBAAA,CAAoB,IAAA,CAAK,CAAC,GAAG,GAAG,CAAA;AAC9C,EAAA,OAAO,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,EAAE,IAAI,KAAK,CAAA,CAAA;AAC/B,CAAA;AAEO,IAAM,aAAA,GAAgB,CAC3B,MAAA,EACA,GAAA,KACW;AAQX,EAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,IAAA,MAAM,QAAA,GAAW,GAAA,CAAI,SAAA,EAAW,GAAA,CAAI,OAAO,MAAM,CAAA;AACjD,IAAA,IAAI,aAAa,MAAA,EAAW,MAAM,IAAI,QAAA,CAAS,eAAe,CAAA,4EAAA,CAA+E,CAAA;AAE7I,IAAA,MAAM,KAAA,GAA4B;AAAA,MAChC,GAAG,GAAA;AAAA,MACH,aAAA,EAAe,QAAA,CAAS,MAAA,EAAQ,aAAA,IAAiB,GAAA,CAAI,aAAA;AAAA;AAAA;AAAA,MAGrD,QAAA,EAAU,IAAI,GAAA,CAAI,CAAC,GAAG,IAAI,QAAA,EAAU,GAAG,QAAA,CAAS,QAAQ,CAAC;AAAA,KAC3D;AAEA,IAAA,MAAM,KAAA,GAAkB,CAAC,UAAU,CAAA;AACnC,IAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,OAAA,CAAQ,CAAC,CAAA;AAChC,IAAA,IAAI,KAAA,EAAO,KAAA,KAAU,MAAA,EAAW,KAAA,CAAM,IAAA,CAAK,CAAA,KAAA,EAAQ,KAAA,CAAM,KAAK,CAAA,IAAA,EAAO,KAAA,CAAM,KAAK,CAAA,CAAE,CAAA;AAClF,IAAA,KAAA,MAAW,IAAA,IAAQ,SAAS,KAAA,EAAO;AACjC,MAAA,MAAM,MAAA,GAAS,SAAS,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,KAAA,KAAU,IAAA,CAAK,OAAO,CAAA;AACpE,MAAA,IAAI,MAAA,EAAQ,UAAU,MAAA,EAAW;AACjC,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,KAAK,CAAC;AAAA,OACxE;AACA,MAAA,KAAA,CAAM,IAAA,CAAK,CAAA,EAAG,OAAO,CAAA,CAAA,EAAI,OAAO,KAAK,CAAA,IAAA,EAAO,IAAA,CAAK,OAAO,CAAA,IAAA,EAAO,UAAA,CAAW,IAAA,CAAK,OAAO,CAAC,CAAA,CAAE,CAAA;AAAA,IAC3F;AACA,IAAA,IAAI,QAAA,CAAS,MAAA,KAAW,MAAA,EAAW,KAAA,CAAM,IAAA,CAAK,CAAA,MAAA,EAAS,aAAA,CAAc,QAAA,CAAS,MAAA,CAAO,QAAA,EAAU,KAAK,CAAC,CAAA,CAAE,CAAA;AAEvG,IAAA,OAAO,CAAA,QAAA,EAAW,KAAA,CAAM,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,EACnC;AAEA,EAAA,IAAI,QAAQ,MAAA,EAAQ,OAAO,wBAAwB,GAAA,EAAK,MAAA,CAAO,IAAI,GAAG,CAAA;AACtE,EAAA,IAAI,SAAS,MAAA,EAAQ,OAAO,wBAAwB,IAAA,EAAM,MAAA,CAAO,KAAK,GAAG,CAAA;AACzE,EAAA,IAAI,QAAQ,MAAA,EAAQ,OAAO,wBAAwB,GAAA,EAAK,MAAA,CAAO,IAAI,GAAG,CAAA;AACtE,EAAA,IAAI,SAAS,MAAA,EAAQ,OAAO,wBAAwB,IAAA,EAAM,MAAA,CAAO,KAAK,GAAG,CAAA;AACzE,EAAA,IAAI,QAAQ,MAAA,EAAQ,OAAO,wBAAwB,GAAA,EAAK,MAAA,CAAO,IAAI,GAAG,CAAA;AACtE,EAAA,IAAI,SAAS,MAAA,EAAQ,OAAO,wBAAwB,IAAA,EAAM,MAAA,CAAO,KAAK,GAAG,CAAA;AAEzE,EAAA,IAAI,QAAQ,MAAA,EAAQ;AAClB,IAAA,MAAM,MAAM,QAAA,CAAS,MAAA,CAAO,EAAA,CAAG,CAAC,GAAG,GAAG,CAAA;AACtC,IAAA,MAAM,MAAA,GAAS,MAAA,CAAO,EAAA,CAAG,CAAC,CAAA;AAE1B,IAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,EAAG;AACzB,MAAA,MAAM,MAAA,GAAS,OAAO,GAAA,CAAI,CAAC,MAAM,mBAAA,CAAoB,CAAA,EAAG,GAAG,CAAC,CAAA;AAC5D,MAAA,OAAO,GAAG,GAAG,CAAA,KAAA,EAAQ,MAAA,CAAO,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAAA,IACxC;AAGA,IAAA,IAAI,cAAc,MAAA,EAAQ;AACxB,MAAA,iBAAA,CAAkB,OAAO,QAAQ,CAAA;AACjC,MAAA,GAAA,CAAI,aAAa,KAAA,IAAS,CAAA;AAC1B,MAAA,GAAA,CAAI,UAAA,CAAW,IAAA,CAAK,EAAE,GAAA,EAAK,MAAA,CAAO,UAAU,IAAA,EAAM,SAAA,EAAW,IAAA,EAAM,UAAA,EAAY,CAAA;AAC/E,MAAA,OAAO,CAAA,EAAG,GAAG,CAAA,QAAA,EAAW,GAAA,CAAI,aAAa,KAAK,CAAA,CAAA,CAAA;AAAA,IAChD;AACA,IAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,MAAA,GAAA,CAAI,aAAa,KAAA,IAAS,CAAA;AAC1B,MAAA,GAAA,CAAI,UAAA,CAAW,IAAA,CAAK,EAAE,GAAA,EAAK,MAAA,CAAO,QAAQ,IAAA,EAAM,OAAA,EAAS,IAAA,EAAM,UAAA,EAAY,CAAA;AAC3E,MAAA,OAAO,CAAA,EAAG,GAAG,CAAA,QAAA,EAAW,GAAA,CAAI,aAAa,KAAK,CAAA,CAAA,CAAA;AAAA,IAChD;AAEA,IAAA,OAAO,GAAG,GAAG,CAAA,MAAA,CAAA;AAAA,EACf;AAEA,EAAA,IAAI,WAAW,MAAA,EAAQ;AACrB,IAAA,MAAM,MAAM,QAAA,CAAS,MAAA,CAAO,KAAA,CAAM,CAAC,GAAG,GAAG,CAAA;AACzC,IAAA,MAAM,MAAA,GAAS,MAAA,CAAO,KAAA,CAAM,CAAC,CAAA;AAE7B,IAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,EAAG;AACzB,MAAA,MAAM,MAAA,GAAS,OAAO,GAAA,CAAI,CAAC,MAAM,mBAAA,CAAoB,CAAA,EAAG,GAAG,CAAC,CAAA;AAC5D,MAAA,OAAO,GAAG,GAAG,CAAA,SAAA,EAAY,MAAA,CAAO,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAAA,IAC5C;AAEA,IAAA,IAAI,cAAc,MAAA,EAAQ;AACxB,MAAA,iBAAA,CAAkB,OAAO,QAAQ,CAAA;AACjC,MAAA,GAAA,CAAI,aAAa,KAAA,IAAS,CAAA;AAC1B,MAAA,GAAA,CAAI,UAAA,CAAW,IAAA,CAAK,EAAE,GAAA,EAAK,MAAA,CAAO,UAAU,IAAA,EAAM,SAAA,EAAW,IAAA,EAAM,UAAA,EAAY,CAAA;AAC/E,MAAA,OAAO,CAAA,EAAG,GAAG,CAAA,SAAA,EAAY,GAAA,CAAI,aAAa,KAAK,CAAA,CAAA,CAAA;AAAA,IACjD;AACA,IAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,MAAA,GAAA,CAAI,aAAa,KAAA,IAAS,CAAA;AAC1B,MAAA,GAAA,CAAI,UAAA,CAAW,IAAA,CAAK,EAAE,GAAA,EAAK,MAAA,CAAO,QAAQ,IAAA,EAAM,OAAA,EAAS,IAAA,EAAM,UAAA,EAAY,CAAA;AAC3E,MAAA,OAAO,CAAA,EAAG,GAAG,CAAA,SAAA,EAAY,GAAA,CAAI,aAAa,KAAK,CAAA,CAAA,CAAA;AAAA,IACjD;AAEA,IAAA,OAAO,GAAG,GAAG,CAAA,UAAA,CAAA;AAAA,EACf;AAEA,EAAA,IAAI,UAAU,MAAA,EAAQ;AACpB,IAAA,MAAM,MAAM,QAAA,CAAS,MAAA,CAAO,IAAA,CAAK,CAAC,GAAG,GAAG,CAAA;AACxC,IAAA,MAAM,UAAU,mBAAA,CAAoB,MAAA,CAAO,IAAA,CAAK,CAAC,GAAG,GAAG,CAAA;AACvD,IAAA,OAAO,CAAA,EAAG,GAAG,CAAA,MAAA,EAAS,OAAO,CAAA,CAAA;AAAA,EAC/B;AAEA,EAAA,IAAI,WAAW,MAAA,EAAQ;AACrB,IAAA,MAAM,MAAM,QAAA,CAAS,MAAA,CAAO,KAAA,CAAM,CAAC,GAAG,GAAG,CAAA;AACzC,IAAA,MAAM,UAAU,mBAAA,CAAoB,MAAA,CAAO,KAAA,CAAM,CAAC,GAAG,GAAG,CAAA;AACxD,IAAA,OAAO,CAAA,EAAG,GAAG,CAAA,OAAA,EAAU,OAAO,CAAA,CAAA;AAAA,EAChC;AAEA,EAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,IAAA,OAAO,CAAA,EAAG,QAAA,CAAS,MAAA,CAAO,MAAA,EAAQ,GAAG,CAAC,CAAA,QAAA,CAAA;AAAA,EACxC;AAEA,EAAA,IAAI,eAAe,MAAA,EAAQ;AACzB,IAAA,OAAO,CAAA,EAAG,QAAA,CAAS,MAAA,CAAO,SAAA,EAAW,GAAG,CAAC,CAAA,YAAA,CAAA;AAAA,EAC3C;AAEA,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,MAAM,KAAA,GAAQ,OAAO,GAAA,CAAI,GAAA,CAAI,CAAC,GAAA,KAAQ,aAAA,CAAc,GAAA,EAAK,GAAG,CAAC,CAAA;AAC7D,IAAA,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,IAAA,CAAK,OAAO,CAAC,CAAA,CAAA,CAAA;AAAA,EAChC;AAEA,EAAA,IAAI,QAAQ,MAAA,EAAQ;AAClB,IAAA,MAAM,KAAA,GAAQ,OAAO,EAAA,CAAG,GAAA,CAAI,CAAC,GAAA,KAAQ,aAAA,CAAc,GAAA,EAAK,GAAG,CAAC,CAAA;AAC5D,IAAA,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,IAAA,CAAK,MAAM,CAAC,CAAA,CAAA,CAAA;AAAA,EAC/B;AAEA,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,MAAA,CAAO,GAAA,EAAK,GAAG,CAAA;AAC3C,IAAA,OAAO,QAAQ,KAAK,CAAA,CAAA,CAAA;AAAA,EACtB;AAEA,EAAA,IAAI,cAAc,MAAA,EAAQ;AAExB,IAAA,MAAMC,UAAAA,GAAY,OAAO,QAAA,CAAS,KAAA;AAClC,IAAA,MAAM,GAAA,GAAM,QAAA,CAASA,UAAAA,EAAW,GAAG,CAAA;AAEnC,IAAA,MAAM,QAAA,GAAW,OAAO,QAAA,CAAS,KAAA;AACjC,IAAA,MAAM,GAAA,GAAM,UAAA,IAAc,QAAA,GAAW,QAAA,CAAS,WAAW,QAAA,CAAS,MAAA;AAClE,IAAA,IAAI,UAAA,IAAc,QAAA,EAAU,iBAAA,CAAkB,QAAA,CAAS,QAAQ,CAAA;AAG/D,IAAA,MAAM,GAAA,GAAM,GAAA,CAAI,aAAA,CAAc,GAAA,CAAIA,UAAS,CAAA;AAC3C,IAAA,MAAM,UAAA,GAAa,KAAK,MAAA,CAAO,gBAAA;AAE/B,IAAA,GAAA,CAAI,aAAa,KAAA,IAAS,CAAA;AAC1B,IAAA,GAAA,CAAI,WAAW,IAAA,CAAK;AAAA,MAClB,GAAA;AAAA,MACA,IAAA,EAAM,UAAA;AAAA,MACN,IAAA,EAAM,QAAA;AAAA,MACN;AAAA,KACD,CAAA;AAED,IAAA,MAAM,QAAA,GAAW,CAAA,CAAA,EAAI,GAAA,CAAI,YAAA,CAAa,KAAK,CAAA,CAAA;AAC3C,IAAA,MAAM,QAAA,GAAW,aAAA,CAAc,MAAA,CAAO,QAAA,CAAS,YAAY,CAAC,CAAA;AAC5D,IAAA,OAAO,CAAA,KAAA,EAAQ,GAAG,CAAA,KAAA,EAAQ,QAAQ,QAAQ,QAAQ,CAAA,CAAA;AAAA,EACpD;AAEA,EAAA,IAAI,WAAW,MAAA,EAAQ;AACrB,IAAA,MAAM,GAAA,GAAM,QAAA,CAAS,MAAA,CAAO,KAAA,CAAM,OAAO,GAAG,CAAA;AAE5C,IAAA,MAAM,QAAA,GAAW,OAAO,KAAA,CAAM,KAAA;AAC9B,IAAA,MAAM,GAAA,GAAM,UAAA,IAAc,QAAA,GAAW,QAAA,CAAS,WAAW,QAAA,CAAS,MAAA;AAClE,IAAA,MAAM,IAAA,GAAO,UAAA,IAAc,QAAA,GAAW,SAAA,GAAqB,OAAA;AAC3D,IAAA,IAAI,UAAA,IAAc,QAAA,EAAU,iBAAA,CAAkB,QAAA,CAAS,QAAQ,CAAA;AAE/D,IAAA,GAAA,CAAI,aAAa,KAAA,IAAS,CAAA;AAC1B,IAAA,GAAA,CAAI,WAAW,IAAA,CAAK,EAAE,KAAK,IAAA,EAAM,IAAA,EAAM,UAAU,CAAA;AAEjD,IAAA,MAAM,QAAA,GAAW,CAAA,CAAA,EAAI,GAAA,CAAI,YAAA,CAAa,KAAK,CAAA,CAAA;AAC3C,IAAA,MAAM,WAAA,GAAc,OAAO,KAAA,CAAM,WAAA;AAEjC,IAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,MAAA,OAAO,eAAe,GAAG,CAAA,EAAA,EAAK,QAAQ,CAAA,KAAA,EAAQ,aAAA,CAAc,WAAW,CAAC,CAAA,CAAA;AAAA,IAC1E;AAEA,IAAA,OAAO,CAAA,EAAG,GAAG,CAAA,GAAA,EAAM,QAAQ,CAAA,CAAA;AAAA,EAC7B;AAOA,EAAA,IAAI,UAAA,IAAc,MAAA,EAAQ,cAAA,CAAe,iBAAiB,CAAA;AAG1D,EAAA,OAAO,MAAA;AACT;AAMO,IAAM,cAAA,GAAiB,CAC5B,IAAA,EACA,GAAA,KACW;AACX,EAAA,IAAI,SAAS,IAAA,EAAM;AACjB,IAAA,MAAM,IAAI,mBAAA,CAAoB,IAAA,CAAK,GAAA,CAAI,CAAC,GAAG,GAAG,CAAA;AAC9C,IAAA,MAAM,IAAI,mBAAA,CAAoB,IAAA,CAAK,GAAA,CAAI,CAAC,GAAG,GAAG,CAAA;AAC9C,IAAA,OAAO,CAAA,CAAA,EAAI,CAAC,CAAA,GAAA,EAAM,CAAC,CAAA,CAAA,CAAA;AAAA,EACrB;AAEA,EAAA,IAAI,cAAc,IAAA,EAAM;AACtB,IAAA,MAAM,IAAI,mBAAA,CAAoB,IAAA,CAAK,QAAA,CAAS,CAAC,GAAG,GAAG,CAAA;AACnD,IAAA,MAAM,IAAI,mBAAA,CAAoB,IAAA,CAAK,QAAA,CAAS,CAAC,GAAG,GAAG,CAAA;AACnD,IAAA,OAAO,CAAA,CAAA,EAAI,CAAC,CAAA,GAAA,EAAM,CAAC,CAAA,CAAA,CAAA;AAAA,EACrB;AAEA,EAAA,IAAI,cAAc,IAAA,EAAM;AACtB,IAAA,MAAM,IAAI,mBAAA,CAAoB,IAAA,CAAK,QAAA,CAAS,CAAC,GAAG,GAAG,CAAA;AACnD,IAAA,MAAM,IAAI,mBAAA,CAAoB,IAAA,CAAK,QAAA,CAAS,CAAC,GAAG,GAAG,CAAA;AACnD,IAAA,OAAO,CAAA,CAAA,EAAI,CAAC,CAAA,GAAA,EAAM,CAAC,CAAA,CAAA,CAAA;AAAA,EACrB;AAEA,EAAA,IAAI,YAAY,IAAA,EAAM;AACpB,IAAA,MAAM,IAAI,mBAAA,CAAoB,IAAA,CAAK,MAAA,CAAO,CAAC,GAAG,GAAG,CAAA;AACjD,IAAA,MAAM,IAAI,mBAAA,CAAoB,IAAA,CAAK,MAAA,CAAO,CAAC,GAAG,GAAG,CAAA;AACjD,IAAA,OAAO,CAAA,CAAA,EAAI,CAAC,CAAA,GAAA,EAAM,CAAC,CAAA,CAAA,CAAA;AAAA,EACrB;AAEA,EAAA,IAAI,YAAY,IAAA,EAAM;AACpB,IAAA,MAAM,KAAA,GAAQ,KAAK,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,KAAM,mBAAA,CAAoB,CAAA,EAAG,GAAG,CAAC,CAAA;AAChE,IAAA,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,IAAA,CAAK,MAAM,CAAC,CAAA,CAAA,CAAA;AAAA,EAC/B;AAEA,EAAA,IAAI,cAAc,IAAA,EAAM;AACtB,IAAA,MAAM,KAAA,GAAQ,KAAK,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,KAAM,mBAAA,CAAoB,CAAA,EAAG,GAAG,CAAC,CAAA;AAClE,IAAA,OAAO,CAAA,SAAA,EAAY,KAAA,CAAM,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAAA,EACrC;AAEA,EAAA,IAAI,UAAU,IAAA,EAAM;AAClB,IAAA,MAAM,cAAc,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,KAAM;AAC5C,MAAA,MAAM,IAAA,GAAO,aAAA,CAAc,CAAA,CAAE,SAAA,EAAW,GAAG,CAAA;AAC3C,MAAA,MAAM,GAAA,GAAM,mBAAA,CAAoB,CAAA,CAAE,IAAA,EAAM,GAAG,CAAA;AAC3C,MAAA,OAAO,CAAA,KAAA,EAAQ,IAAI,CAAA,MAAA,EAAS,GAAG,CAAA,CAAA;AAAA,IACjC,CAAC,CAAA;AACD,IAAA,MAAM,OAAA,GAAU,mBAAA,CAAoB,IAAA,CAAK,IAAA,CAAK,MAAM,GAAG,CAAA;AACvD,IAAA,OAAO,QAAQ,WAAA,CAAY,IAAA,CAAK,GAAG,CAAC,SAAS,OAAO,CAAA,IAAA,CAAA;AAAA,EACtD;AAEA,EAAA,OAAO,MAAA;AACT,CAAA;AAQA,IAAM,MAAA,GAAS,CAAC,GAAA,EAAiC,GAAA,KAC/C,OAAO,GAAA,KAAQ,QAAA,GAAW,QAAA,CAAS,GAAA,EAAK,GAAG,CAAA,GAAI,cAAA,CAAe,KAAK,GAAG,CAAA;AAEjE,IAAM,gBAAA,GAAmB,CAC9B,IAAA,EACA,GAAA,KACW;AACX,EAAA,IAAI,WAAW,IAAA,EAAM;AACnB,IAAA,IAAI,IAAA,CAAK,KAAA,KAAU,GAAA,EAAK,OAAO,UAAA;AAC/B,IAAA,OAAO,CAAA,MAAA,EAAS,QAAA,CAAS,IAAA,CAAK,KAAA,EAAO,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,EAC3C;AACA,EAAA,IAAI,eAAA,IAAmB,MAAM,OAAO,CAAA,eAAA,EAAkB,SAAS,IAAA,CAAK,aAAA,EAAe,GAAG,CAAC,CAAA,CAAA,CAAA;AACvF,EAAA,IAAI,KAAA,IAAS,MAAM,OAAO,CAAA,IAAA,EAAO,OAAO,IAAA,CAAK,GAAA,EAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AACtD,EAAA,IAAI,KAAA,IAAS,MAAM,OAAO,CAAA,IAAA,EAAO,OAAO,IAAA,CAAK,GAAA,EAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AACtD,EAAA,IAAI,KAAA,IAAS,MAAM,OAAO,CAAA,IAAA,EAAO,OAAO,IAAA,CAAK,GAAA,EAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AACtD,EAAA,IAAI,KAAA,IAAS,MAAM,OAAO,CAAA,IAAA,EAAO,OAAO,IAAA,CAAK,GAAA,EAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AACtD,EAAA,OAAO,MAAA;AACT,CAAA;;;AC3aO,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,MAAMR,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,EAAE,aAAY,GAAI,IAAA;AACxB,IAAA,MAAM,KAAA,GAAQ,cAAA;AACd,IAAA,MAAM,MAAA,GACJ,KAAA,KAAU,MAAA,IAAa,WAAA,KAAgB,SACnC,MAAM,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,KAAK,MAAM,CAAA,GAClC,MAAM,WAAA,CAAY,OAAO,EAAA,KAAO;AAG9B,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;;;ACtGO,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,GAAeJ,MAClB,MAAA,CAAO;AAAA,EACN,OAAA,EAASA,MACN,MAAA,CAAO;AAAA,IACN,IAAA,EAAMA,KAAAA,CAAE,MAAA,EAAO,CAAE,SAAS,8BAA8B,CAAA;AAAA,IACxD,KAAA,EAAOA,KAAAA,CAAE,MAAA,EAAO,CAAE,SAAS,6BAA6B,CAAA;AAAA,IACxD,KAAA,EAAO,YAAA,CAAa,QAAA,CAAS,uDAAkD;AAAA,GAChF,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,2FAA2F,CAAA;AAOvG,IAAM,WAAA,GAAcA,MAAE,KAAA,CAAM;AAAA,EAC1BA,MAAE,MAAA,EAAO;AAAA,EACTA,MAAE,MAAA,EAAO;AAAA,EACTA,MAAE,OAAA,EAAQ;AAAA,EACVA,MAAE,IAAA,EAAK;AAAA,EACPA,KAAAA,CAAE,OAAO,EAAE,QAAA,EAAUA,MAAE,MAAA,EAAO,EAAG,CAAA,CAAE,MAAA,EAAO;AAAA,EAC1C;AACF,CAAC,CAAA;AAED,IAAM,OAAA,GAAUA,MACb,MAAA,CAAOA,KAAAA,CAAE,QAAO,EAAG,WAAW,EAC9B,MAAA,CAAO,CAAC,MAAM,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,CAAE,MAAA,GAAS,GAAG,EAAE,OAAA,EAAS,wCAAwC,CAAA;AAY/F,IAAM,gBAAA,GAAmBA,MACtB,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,KAAAA,CAAE,KAAA,CAAMA,KAAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,sEAAiE,CAAA;AAAA,EAC7G,GAAA,EAAK,OAAA,CAAQ,QAAA,EAAS,CAAE,SAAS,oGAA+F;AAClI,CAAC,EACA,MAAA,EAAO;AAIV,IAAM,YAAA,GAAeA,MAAE,MAAA,CAAO,EAAE,IAAIA,KAAAA,CAAE,OAAA,CAAQ,QAAQ,CAAA,EAAG,KAAA,EAAOA,MAAE,MAAA,EAAO,EAAG,QAAQ,OAAA,EAAS,UAAA,EAAY,iBAAiB,QAAA,EAAS,EAAG,CAAA,CAAE,MAAA,EAAO;AAC/I,IAAM,eAAeA,KAAAA,CAAE,MAAA,CAAO,EAAE,EAAA,EAAIA,KAAAA,CAAE,QAAQ,QAAQ,CAAA,EAAG,OAAOA,KAAAA,CAAE,MAAA,IAAU,GAAA,EAAK,OAAA,EAAS,OAAO,YAAA,EAAc,EAAE,MAAA,EAAO;AACxH,IAAM,eAAeA,KAAAA,CAAE,MAAA,CAAO,EAAE,EAAA,EAAIA,MAAE,OAAA,CAAQ,QAAQ,CAAA,EAAG,KAAA,EAAOA,MAAE,MAAA,EAAO,EAAG,OAAO,YAAA,EAAc,EAAE,MAAA,EAAO;AAU1G,IAAM,aAAA,GAAgBA,KAAAA,CACnB,MAAA,CAAO,EAAE,KAAA,EAAOA,KAAAA,CAAE,MAAA,EAAO,EAAG,CAAA,CAC5B,MAAA,EAAO,CACP,SAAS,iEAAiE,CAAA;AAE7E,IAAM,WAAA,GAAcA,KAAAA,CACjB,MAAA,CAAOA,KAAAA,CAAE,MAAA,EAAO,EAAGA,KAAAA,CAAE,KAAA,CAAM,CAAC,WAAA,EAAa,aAAa,CAAC,CAAC,EACxD,MAAA,CAAO,CAAC,CAAA,KAAM,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,CAAE,MAAA,GAAS,CAAA,EAAG,EAAE,OAAA,EAAS,sCAAA,EAAwC,CAAA;AAE/F,IAAM,gBAAA,GAAmBA,MACtB,MAAA,CAAO;AAAA,EACN,EAAA,EAAIA,KAAAA,CAAE,OAAA,CAAQ,YAAY,CAAA;AAAA,EAC1B,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,KAAA,EAAOA,KAAAA,CAAE,MAAA,CAAO,EAAE,QAAA,EAAUA,KAAAA,CAAE,MAAA,EAAO,EAAG,CAAA,CAAE,MAAA,EAAO,CAAE,SAAS,6EAAwE,CAAA;AAAA,EACpI,MAAA,EAAQ,WAAA;AAAA,EACR,UAAA,EAAY,iBAAiB,QAAA;AAC/B,CAAC,EACA,MAAA,EAAO;AAMV,IAAM,YAAA,GAAeA,MAClB,MAAA,CAAO;AAAA,EACN,EAAA,EAAIA,KAAAA,CAAE,OAAA,CAAQ,QAAQ,CAAA;AAAA,EACtB,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,OAAA,EAAS,OAAA;AAAA;AAAA,EACT,MAAA,EAAQ,QAAQ,QAAA,EAAS;AAAA;AAAA,EACzB,GAAA,EAAKA,MAAE,MAAA;AACT,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,0JAA0J,CAAA;AAE/J,IAAM,cAAA,GAAiBA,KAAAA,CAAE,kBAAA,CAAmB,IAAA,EAAM,CAAC,cAAc,gBAAA,EAAkB,YAAA,EAAc,YAAA,EAAc,YAAY,CAAC;AAQ5H,IAAM,wBAAA,GAA2BA,KAAAA,CAAE,KAAA,CAAM,CAAC,cAAA,EAAgB,cAAA,CAAe,KAAA,EAAM,CAAE,GAAA,CAAI,CAAC,CAAC,CAAC;ACxG/F,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,oBAAa,KAAA,CAAM,GAAG,GAAG,OAAO,CAAA,aAAA,EAAgBC,qBAAc,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,oBAAa,KAAA,CAAM,QAAQ,GAAG,OAAO,CAAA,kBAAA,EAAqBC,qBAAc,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,IAAMM,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,MAAMC,gBAAA,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;;;AC3GA,IAAM,eAAe,CAAC,CAAA,KACpB,CAAA,KAAM,IAAA,IAAQ,OAAO,CAAA,KAAM,QAAA,IAAY,CAAC,KAAA,CAAM,QAAQ,CAAC,CAAA,IAAK,OAAQ,CAAA,CAA8B,UAAU,CAAA,KAAM,QAAA;AAEpH,IAAM,UAAA,GAAa,CAAC,IAAA,EAAc,MAAA,KAAqD;AACrF,EAAA,MAAM,CAAC,KAAA,EAAO,KAAK,CAAA,GAAI,IAAA,CAAK,MAAM,GAAG,CAAA;AACrC,EAAA,MAAM,MAAA,GAAS,MAAA,EAAQ,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,KAAA,KAAU,KAAA,IAAS,CAAA,CAAE,IAAA,KAAS,KAAK,CAAA;AACjF,EAAA,MAAM,CAAA,GAAI,QAAQ,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,KAAK,CAAA;AACrD,EAAA,OAAO,EAAE,IAAA,EAAM,CAAA,EAAG,cAAA,IAAkB,SAAA,EAAW,QAAQ,IAAA,EAAK;AAC9D,CAAA;AAIA,IAAM,QAAA,GAAW,CAAC,GAAA,EAAuB,GAAA,EAAa,KAAA,KAA8B;AAClF,EAAA,MAAM,QAAA,GAAW,IAAI,GAAG,CAAA;AACxB,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,GAAA,CAAI,GAAG,CAAA,GAAI,KAAA;AACX,IAAA;AAAA,EACF;AACA,EAAA,IAAI,QAAA,CAAS,IAAA,KAAS,SAAA,IAAa,KAAA,CAAM,SAAS,SAAA,EAAW;AAC3D,IAAA,GAAA,CAAI,GAAG,CAAA,GAAI,EAAE,GAAG,OAAO,GAAI,QAAA,CAAS,IAAA,KAAS,MAAA,GAAY,EAAE,IAAA,EAAM,QAAA,CAAS,IAAA,EAAK,GAAI,EAAC,EAAG;AAAA,EACzF;AACF,CAAA;AAIA,IAAM,QAAA,GAAW,CAAC,KAAA,EAAgB,GAAA,KAAgC;AAChE,EAAA,IAAI,YAAA,CAAa,KAAK,CAAA,EAAG;AACvB,IAAA,QAAA,CAAS,KAAK,KAAA,CAAM,QAAA,EAAU,EAAE,IAAA,EAAM,WAAW,CAAA;AACjD,IAAA;AAAA,EACF;AACA,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACxB,IAAA,KAAA,MAAW,CAAA,IAAK,KAAA,EAAO,QAAA,CAAS,CAAA,EAAG,GAAG,CAAA;AACtC,IAAA;AAAA,EACF;AACA,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA,EAAU;AAC/C,IAAA,KAAA,MAAW,KAAK,MAAA,CAAO,MAAA,CAAO,KAAK,CAAA,EAAG,QAAA,CAAS,GAAG,GAAG,CAAA;AAAA,EACvD;AACF,CAAA;AAIA,IAAM,cAAc,CAAC,IAAA,EAAM,OAAO,IAAA,EAAM,KAAA,EAAO,MAAM,KAAK,CAAA;AAE1D,IAAM,UAAA,GAAa,CAAC,MAAA,EAAgB,MAAA,EAAoC,GAAA,KAAgC;AACtG,EAAA,MAAM,CAAA,GAAI,MAAA;AACV,EAAA,KAAA,MAAW,MAAM,WAAA,EAAa;AAC5B,IAAA,MAAM,IAAA,GAAO,EAAE,EAAE,CAAA;AACjB,IAAA,IAAI,MAAM,OAAA,CAAQ,IAAI,CAAA,IAAK,IAAA,CAAK,WAAW,CAAA,EAAG;AAC5C,MAAA,MAAM,CAAC,CAAA,EAAG,CAAC,CAAA,GAAI,IAAA;AACf,MAAA,IAAI,OAAO,CAAA,KAAM,QAAA,IAAY,YAAA,CAAa,CAAC,CAAA,EAAG,QAAA,CAAS,GAAA,EAAK,CAAA,CAAE,QAAA,EAAU,UAAA,CAAW,CAAA,EAAG,MAAM,CAAC,CAAA;AAAA,WAAA,IACpF,OAAO,CAAA,KAAM,QAAA,IAAY,YAAA,CAAa,CAAC,CAAA,EAAG,QAAA,CAAS,GAAA,EAAK,CAAA,CAAE,QAAA,EAAU,UAAA,CAAW,CAAA,EAAG,MAAM,CAAC,CAAA;AAAA,WAC7F,QAAA,CAAS,MAAM,GAAG,CAAA;AACvB,MAAA;AAAA,IACF;AAAA,EACF;AACA,EAAA,IAAI,IAAA,IAAQ,CAAA,IAAK,OAAA,IAAW,CAAA,EAAG;AAC7B,IAAA,MAAM,CAAC,MAAM,MAAM,CAAA,GAAK,EAAE,IAAI,CAAA,IAAK,EAAE,OAAO,CAAA;AAC5C,IAAA,IAAI,YAAA,CAAa,MAAM,CAAA,EAAG,QAAA,CAAS,KAAK,MAAA,CAAO,QAAA,EAAU,EAAE,GAAG,UAAA,CAAW,MAAM,MAAM,CAAA,EAAG,MAAM,CAAA,EAAG,UAAA,CAAW,MAAM,MAAM,CAAA,CAAE,IAAI,CAAA,EAAA,CAAA,EAAM,CAAA;AAAA,SAC/H,QAAA,CAAS,QAAQ,GAAG,CAAA;AACzB,IAAA;AAAA,EACF;AACA,EAAA,IAAI,MAAA,IAAU,CAAA,IAAK,OAAA,IAAW,CAAA,EAAG;AAC/B,IAAA,MAAM,CAAC,MAAM,CAAC,CAAA,GAAK,EAAE,MAAM,CAAA,IAAK,EAAE,OAAO,CAAA;AACzC,IAAA,IAAI,YAAA,CAAa,CAAC,CAAA,EAAG,QAAA,CAAS,KAAK,CAAA,CAAE,QAAA,EAAU,EAAE,IAAA,EAAM,QAAA,EAAU,MAAA,EAAQ,IAAA,EAAM,IAAA,EAAM,WAAW,CAAA;AAChG,IAAA;AAAA,EACF;AACA,EAAA,IAAI,KAAA,IAAS,CAAA,IAAK,IAAA,IAAQ,CAAA,EAAG;AAC3B,IAAA,KAAA,MAAW,GAAA,IAAQ,CAAA,CAAE,KAAK,CAAA,IAAK,CAAA,CAAE,IAAI,CAAA,EAAgB,UAAA,CAAW,GAAA,EAAK,MAAA,EAAQ,GAAG,CAAA;AAChF,IAAA;AAAA,EACF;AACA,EAAA,IAAI,SAAS,CAAA,EAAG;AACd,IAAA,UAAA,CAAW,CAAA,CAAE,KAAK,CAAA,EAAa,MAAA,EAAQ,GAAG,CAAA;AAC1C,IAAA;AAAA,EACF;AAGA,EAAA,QAAA,CAAS,GAAG,GAAG,CAAA;AACjB,CAAA;AAEA,IAAM,WAAA,GAAc,CAAC,CAAA,KACnB,CAAA,KAAM,IAAA,IAAQ,OAAO,CAAA,KAAM,QAAA,IAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,CAAC,KAAK,SAAA,IAAa,CAAA;AAE3E,IAAM,YAAY,CAAC,CAAA,KACjB,CAAA,CAAE,EAAA,KAAO,YAAY,CAAA,CAAE,EAAA,KAAO,YAAA,GAC1B,EAAE,GAAG,CAAA,CAAE,MAAA,EAAQ,GAAI,CAAA,CAAE,UAAA,EAAY,OAAO,EAAC,EAAG,GAC5C,CAAA,CAAE,OAAO,QAAA,GACP,CAAA,CAAE,GAAA,GACF,CAAA,CAAE,OAAO,QAAA,GACP,EAAE,GAAG,CAAA,CAAE,SAAS,GAAI,CAAA,CAAE,UAAU,EAAC,KACjC,EAAC;AAEJ,IAAM,sBAAA,GAAyB,CAAC,GAAA,EAAyB,MAAA,KAA8C;AAC5G,EAAA,MAAM,MAAwB,EAAC;AAC/B,EAAA,MAAM,OAAO,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA,GAAI,GAAA,GAAM,CAAC,GAAG,CAAA;AAC5C,EAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,IAAA,KAAA,MAAW,CAAC,KAAK,CAAC,CAAA,IAAK,OAAO,OAAA,CAAQ,SAAA,CAAU,CAAC,CAAC,CAAA,EAAG;AACnD,MAAA,IAAI,WAAA,CAAY,CAAC,CAAA,EAAG;AAElB,QAAA,UAAA,CAAW,CAAA,CAAE,OAAA,CAAQ,KAAA,EAAO,MAAA,EAAQ,GAAG,CAAA;AACvC,QAAA;AAAA,MACF;AACA,MAAA,IAAI,CAAC,YAAA,CAAa,CAAC,CAAA,EAAG;AACtB,MAAA,MAAM,UAAA,GAAa,EAAE,EAAA,KAAO,QAAA,IAAY,EAAE,MAAA,KAAW,MAAA,IAAa,OAAO,CAAA,CAAE,MAAA;AAC3E,MAAA,QAAA,CAAS,GAAA,EAAK,EAAE,QAAA,EAAU,EAAE,GAAG,UAAA,CAAW,CAAA,EAAG,CAAA,CAAE,KAAK,CAAA,CAAA,EAAI,GAAG,IAAI,MAAM,CAAA,EAAG,GAAI,UAAA,GAAa,EAAE,MAAM,aAAA,EAAc,GAAI,EAAC,EAAI,CAAA;AAAA,IAC1H;AACA,IAAA,IAAI,CAAA,CAAE,EAAA,KAAO,QAAA,IAAY,CAAA,CAAE,EAAA,KAAO,UAAU,UAAA,CAAW,CAAA,CAAE,KAAA,EAAO,MAAA,EAAQ,GAAG,CAAA;AAC3E,IAAA,IAAI,CAAA,CAAE,OAAO,YAAA,EAAc;AACzB,MAAA,MAAM,QAAA,GAAW,OAAO,MAAA,CAAO,CAAA,CAAE,MAAM,CAAA,CACpC,MAAA,CAAO,CAAC,CAAA,KAA8B,CAAA,KAAM,QAAQ,OAAO,CAAA,KAAM,YAAY,OAAA,IAAW,CAAC,EACzF,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,KAAK,CAAA;AACrB,MAAA,GAAA,CAAI,EAAE,KAAA,CAAM,QAAQ,IAAI,EAAE,IAAA,EAAM,QAAQ,IAAA,EAAM,CAAA,oDAAA,EAAkD,SAAS,MAAA,GAAS,CAAA,GAAI,WAAW,QAAA,CAAS,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA,GAAM,EAAE,CAAA,CAAA,EAAG;AAAA,IACjK;AACA,IAAA,IAAI,CAAA,CAAE,OAAO,QAAA,EAAU;AACrB,MAAA,GAAA,CAAI,EAAE,GAAG,CAAA,GAAI,EAAE,GAAG,WAAW,CAAA,EAAG,CAAA,CAAE,KAAK,CAAA,CAAA,EAAI,EAAE,GAAG,CAAA,CAAA,EAAI,MAAM,CAAA,EAAG,MAAM,kEAAA,EAA8D;AAAA,IACnI;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAEO,IAAM,mBAAA,GAAsB,CAAC,GAAA,EAAY,MAAA,KAA8C;AAC5F,EAAA,MAAM,MAAwB,EAAC;AAC/B,EAAA,MAAM,SAAA,GAAY,CAAC,CAAA,KAAmB;AACpC,IAAA,KAAA,MAAW,MAAA,IAAU,EAAE,IAAA,EAAM;AAC3B,MAAA,IAAI,OAAO,MAAA,KAAW,QAAA,EAAU,SAAA,CAAU,OAAO,KAAK,CAAA;AAAA,IACxD;AACA,IAAA,IAAI,EAAE,MAAA,KAAW,MAAA,aAAsB,CAAA,CAAE,MAAA,EAAQ,QAAQ,GAAG,CAAA;AAC5D,IAAA,IAAI,EAAE,OAAA,KAAY,MAAA,EAAW,QAAA,CAAS,CAAA,CAAE,SAAS,GAAG,CAAA;AACpD,IAAA,IAAI,EAAE,SAAA,KAAc,MAAA,EAAW,QAAA,CAAS,CAAA,CAAE,WAAW,GAAG,CAAA;AAAA,EAC1D,CAAA;AACA,EAAA,SAAA,CAAU,GAAG,CAAA;AACb,EAAA,OAAO,GAAA;AACT;AAEO,IAAM,cAAA,GAAiB,CAAC,GAAA,KAA8C;AAC3E,EAAA,MAAM,OAAO,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA,GAAI,GAAA,GAAM,CAAC,GAAG,CAAA;AAC5C,EAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,CAAC,CAAA,KAAM;AACzB,IAAA,MAAM,OAAuB,EAAE,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,OAAO,CAAA,CAAE,KAAA,EAAO,OAAA,EAAS,MAAA,CAAO,KAAK,SAAA,CAAU,CAAC,CAAC,CAAA,CAAE,MAAK,EAAE;AAGnG,IAAA,MAAM,WAAA,GAAA,CAAe,CAAA,CAAE,EAAA,KAAO,QAAA,IAAY,CAAA,CAAE,EAAA,KAAO,YAAA,KAAiB,CAAA,CAAE,UAAA,EAAY,GAAA,KAAQ,MAAA,GAAY,CAAA,CAAE,WAAW,GAAA,GAAM,MAAA;AACzH,IAAA,IAAI,WAAA,KAAgB,MAAA,EAAW,OAAO,CAAC,IAAI,CAAA;AAC3C,IAAA,OAAO,CAAC,IAAA,EAAM,EAAE,EAAA,EAAI,UAAU,KAAA,EAAO,CAAA,CAAE,KAAA,EAAO,OAAA,EAAS,OAAO,IAAA,CAAK,WAAW,CAAA,CAAE,IAAA,IAAQ,CAAA;AAAA,EAC1F,CAAC,CAAA;AACH;AAKO,IAAM,mBAAA,GAAsB,CAAC,CAAA,KAA8B;AAChE,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,IAAA,GAAO,EAAE,EAAA,KAAO,QAAA,IAAY,EAAE,EAAA,KAAO,YAAA,GAAe,EAAE,GAAG,CAAA,CAAE,MAAA,EAAQ,GAAI,CAAA,CAAE,UAAA,EAAY,GAAA,IAAO,EAAC,EAAG,GAAI,EAAE,EAAA,KAAO,QAAA,GAAW,CAAA,CAAE,GAAA,GAAM,EAAC;AACvI,EAAA,KAAA,MAAW,CAAA,IAAK,MAAA,CAAO,MAAA,CAAO,IAAI,CAAA,EAAG;AACnC,IAAA,IAAI,aAAa,CAAC,CAAA,EAAG,IAAA,CAAK,GAAA,CAAI,EAAE,QAAQ,CAAA;AAAA,SAAA,IAC/B,WAAA,CAAY,CAAC,CAAA,EAAG;AACvB,MAAA,MAAM,MAAwB,EAAC;AAC/B,MAAA,QAAA,CAAS,CAAA,CAAE,OAAA,CAAQ,KAAA,EAAO,GAAG,CAAA;AAC7B,MAAA,KAAA,MAAW,KAAK,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,EAAG,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,IAC9C;AAAA,EACF;AACA,EAAA,IAAI,EAAE,EAAA,KAAO,YAAA,OAAmB,GAAA,CAAI,CAAA,CAAE,MAAM,QAAQ,CAAA;AACpD,EAAA,IAAI,CAAA,CAAE,EAAA,KAAO,QAAA,IAAY,CAAA,CAAE,OAAO,QAAA,EAAU;AAC1C,IAAA,MAAM,MAAwB,EAAC;AAC/B,IAAA,QAAA,CAAS,CAAA,CAAE,OAAO,GAAG,CAAA;AACrB,IAAA,KAAA,MAAW,KAAK,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,EAAG,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,EAC9C;AACA,EAAA,OAAO,CAAC,GAAG,IAAI,CAAA,CAAE,IAAA,EAAK;AACxB;AAWA,IAAM,YAAA,GAAe,CAAC,KAAA,KAA4B;AAChD,EAAA,IAAI,MAAM,OAAA,CAAQ,KAAK,GAAG,OAAO,KAAA,CAAM,KAAK,YAAY,CAAA;AACxD,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,UAAU,OAAO,KAAA;AACxD,EAAA,IAAI,UAAA,IAAc,OAAO,OAAO,IAAA;AAChC,EAAA,OAAO,MAAA,CAAO,MAAA,CAAO,KAAK,CAAA,CAAE,KAAK,YAAY,CAAA;AAC/C,CAAA;AAEO,IAAM,YAAA,GAAe,CAAC,GAAA,KAAsC;AACjE,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,MAAM,OAAO,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA,GAAI,GAAA,GAAM,CAAC,GAAG,CAAA;AAC5C,EAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,IAAA,IAAI,YAAA,CAAa,CAAC,CAAA,EAAG;AACnB,MAAA,MAAA,CAAO,KAAK,CAAA,EAAG,CAAA,CAAE,EAAE,CAAA,KAAA,EAAQ,CAAA,CAAE,KAAK,CAAA,uGAAA,CAAoG,CAAA;AAAA,IACxI;AACA,IAAA,IAAI,CAAA,CAAE,EAAA,KAAO,QAAA,IAAY,CAAA,CAAE,OAAO,QAAA,EAAU;AAC5C,IAAA,MAAM,MAAwB,EAAC;AAC/B,IAAA,QAAA,CAAS,CAAA,CAAE,OAAO,GAAG,CAAA;AACrB,IAAA,IAAI,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,WAAW,CAAA,EAAG;AACjC,MAAA,MAAA,CAAO,KAAK,CAAA,EAAG,CAAA,CAAE,EAAE,CAAA,KAAA,EAAQ,CAAA,CAAE,KAAK,CAAA,oEAAA,CAAiE,CAAA;AAAA,IACrG;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT;;;ACrKA,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,MAAMZ,aAAA,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;;;AC3EA,IAAM,QAAA,GAAW,CAAC,CAAA,KAChB,CAAA,KAAM,IAAA,IAAQ,OAAO,CAAA,KAAM,QAAA,IAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,CAAC,KAAK,SAAA,IAAa,CAAA;AAC3E,IAAM,SAAA,GAAY,CAAC,CAAA,KACjB,CAAA,KAAM,IAAA,IAAQ,OAAO,CAAA,KAAM,QAAA,IAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,CAAC,KAAK,OAAA,IAAW,CAAA;AAEzE,IAAM,cAAA,GAAiB,CAAC,CAAA,KAAkD;AACxE,EAAA,MAAM,MAAgC,EAAC;AACvC,EAAA,MAAM,IAAA,GAAO,CAAC,IAAA,KAAoD;AAChE,IAAA,KAAA,MAAW,CAAA,IAAK,MAAA,CAAO,MAAA,CAAO,IAAA,IAAQ,EAAE,CAAA,EAAG,IAAI,QAAA,CAAS,CAAC,CAAA,EAAG,GAAA,CAAI,IAAA,CAAK,EAAE,OAAO,CAAA;AAAA,EAChF,CAAA;AACA,EAAA,IAAI,CAAA,CAAE,EAAA,KAAO,QAAA,IAAY,CAAA,CAAE,OAAO,YAAA,EAAc;AAC9C,IAAA,IAAA,CAAK,EAAE,MAAM,CAAA;AACb,IAAA,IAAA,CAAK,CAAA,CAAE,YAAY,GAAG,CAAA;AAAA,EACxB;AACA,EAAA,IAAI,CAAA,CAAE,EAAA,KAAO,QAAA,EAAU,IAAA,CAAK,EAAE,GAAG,CAAA;AACjC,EAAA,OAAO,GAAA;AACT,CAAA;AAMA,IAAMa,WAAAA,GAAa,CAAC,KAAA,EAAe,MAAA,KACjC,OAAO,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,KAAA,KAAU,KAAA,IAAS,CAAA,CAAE,SAAS,KAAK,CAAA;AAOnE,IAAM,oBAAA,GAAuB,CAAC,KAAA,EAAe,MAAA,EAAkB,MAAA,KAAwH;AACrL,EAAA,MAAM,UAAA,GAAa;AAAA,IACjB,MAAA,CAAO,MAAA,CAAO,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,UAAU,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAA;AAAA,IAC3D,GAAG,MAAA,CAAO,OAAA,CAAQ,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,MAAM,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,GAAG,CAAA,CAAE,MAAM,CAAC;AAAA,IAClE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,CAAC,CAAA;AAC5B,EAAA,IAAI,UAAA,CAAW,WAAW,CAAA,EAAG;AAC7B,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,MAAM,CAAA;AAC3B,EAAA,MAAM,KAAK,UAAA,CAAW,IAAA,CAAK,CAAC,CAAA,KAAM,EAAE,MAAA,KAAW,IAAA,CAAK,IAAA,IAAQ,CAAA,CAAE,MAAM,CAAC,CAAA,KAAM,KAAK,GAAA,CAAI,CAAC,CAAC,CAAC,CAAA;AACvF,EAAA,IAAI,CAAC,EAAA,EAAI;AACP,IAAA,MAAM,IAAI,QAAA;AAAA,MACR,aAAA;AAAA,MACA,CAAA,mBAAA,EAAsB,OAAO,IAAA,CAAK,IAAI,CAAC,CAAA,yCAAA,EAA4C,KAAK,0BAA0B,UAAA,CAAW,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAA,EAAI,EAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAG,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA;AAAA,KACxK;AAAA,EACF;AACF,CAAA;AAOA,IAAM,aAAA,GAAgB,CAAC,MAAA,KAA6B;AAClD,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,MAAM,KAAA,GAAQ,CAAC,CAAA,KAAqB;AAClC,IAAA,IAAI,gBAAA,CAAiB,CAAC,CAAA,EAAG,GAAA,CAAI,KAAK,CAAC,CAAA;AAAA,EACrC,CAAA;AACA,EAAA,MAAM,IAAA,GAAO,CAAC,CAAA,KAAoB;AAChC,IAAA,IAAI,SAAS,CAAA,EAAG,OAAO,CAAA,CAAE,GAAA,CAAI,QAAQ,IAAI,CAAA;AACzC,IAAA,IAAI,QAAQ,CAAA,EAAG,OAAO,CAAA,CAAE,EAAA,CAAG,QAAQ,IAAI,CAAA;AACvC,IAAA,IAAI,KAAA,IAAS,CAAA,EAAG,OAAO,IAAA,CAAK,EAAE,GAAG,CAAA;AACjC,IAAA,IAAI,QAAQ,CAAA,EAAG,OAAO,CAAA,CAAE,EAAA,CAAG,QAAQ,KAAK,CAAA;AACxC,IAAA,IAAI,SAAS,CAAA,EAAG,OAAO,CAAA,CAAE,GAAA,CAAI,QAAQ,KAAK,CAAA;AAC1C,IAAA,IAAI,QAAQ,CAAA,EAAG,OAAO,CAAA,CAAE,EAAA,CAAG,QAAQ,KAAK,CAAA;AACxC,IAAA,IAAI,SAAS,CAAA,EAAG,OAAO,CAAA,CAAE,GAAA,CAAI,QAAQ,KAAK,CAAA;AAC1C,IAAA,IAAI,QAAQ,CAAA,EAAG,OAAO,CAAA,CAAE,EAAA,CAAG,QAAQ,KAAK,CAAA;AACxC,IAAA,IAAI,SAAS,CAAA,EAAG,OAAO,CAAA,CAAE,GAAA,CAAI,QAAQ,KAAK,CAAA;AAC1C,IAAA,IAAI,IAAA,IAAQ,CAAA,IAAK,OAAA,IAAW,CAAA,EAAG;AAC7B,MAAA,MAAM,CAAC,OAAO,MAAM,CAAA,GAAI,QAAQ,CAAA,GAAI,CAAA,CAAE,KAAK,CAAA,CAAE,KAAA;AAC7C,MAAA,GAAA,CAAI,KAAK,KAAK,CAAA;AACd,MAAA,IAAI,MAAM,OAAA,CAAQ,MAAM,CAAA,EAAG,MAAA,CAAO,QAAQ,KAAK,CAAA;AAC/C,MAAA;AAAA,IACF;AACA,IAAA,IAAI,MAAA,IAAU,CAAA,IAAK,OAAA,IAAW,CAAA,EAAG;AAC/B,MAAA,MAAM,CAAC,OAAO,OAAO,CAAA,GAAI,UAAU,CAAA,GAAI,CAAA,CAAE,OAAO,CAAA,CAAE,KAAA;AAClD,MAAA,GAAA,CAAI,KAAK,KAAK,CAAA;AACd,MAAA,OAAO,MAAM,OAAO,CAAA;AAAA,IACtB;AACA,IAAA,IAAI,YAAY,CAAA,EAAG,OAAO,KAAK,GAAA,CAAI,IAAA,CAAK,EAAE,MAAM,CAAA;AAChD,IAAA,IAAI,eAAe,CAAA,EAAG,OAAO,KAAK,GAAA,CAAI,IAAA,CAAK,EAAE,SAAS,CAAA;AACtD,IAAA,IAAI,UAAA,IAAc,GAAG,OAAO,KAAK,IAAI,IAAA,CAAK,CAAA,CAAE,SAAS,KAAK,CAAA;AAC1D,IAAA,IAAI,OAAA,IAAW,GAAG,OAAO,KAAK,IAAI,IAAA,CAAK,CAAA,CAAE,MAAM,KAAK,CAAA;AAAA,EAGtD,CAAA;AACA,EAAA,IAAA,CAAK,MAAM,CAAA;AACX,EAAA,OAAO,GAAA;AACT,CAAA;AAMA,IAAM,mBAAA,GAAsB,CAAC,MAAA,EAAgB,KAAA,EAAe,QAAwB,KAAA,KAAwB;AAC1G,EAAA,MAAM,MAAA,GAASA,WAAAA,CAAW,KAAA,EAAO,MAAM,CAAA;AACvC,EAAA,IAAI,MAAA,KAAW,MAAA,EAAW,MAAM,IAAI,QAAA,CAAS,eAAe,CAAA,eAAA,EAAkB,KAAK,CAAA,KAAA,EAAQ,KAAK,CAAA,CAAA,CAAG,CAAA;AACnG,EAAA,KAAA,MAAW,IAAA,IAAQ,aAAA,CAAc,MAAM,CAAA,EAAG;AACxC,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA;AAC5B,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,GAAG,CAAA;AAC/B,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,KAAA,CAAM,GAAA,GAAM,CAAC,CAAA;AACjC,IAAA,IAAI,CAAC,gBAAA,CAAiB,IAAI,CAAA,IAAK,UAAU,KAAA,IAAS,CAAC,MAAA,CAAO,MAAA,CAAO,KAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAM,CAAA,EAAG;AAC/F,MAAA,MAAM,IAAI,SAAS,aAAA,EAAe,CAAA,CAAA,EAAI,IAAI,CAAA,KAAA,EAAQ,KAAK,CAAA,qBAAA,EAAwB,KAAK,CAAA,EAAA,CAAI,CAAA;AAAA,IAC1F;AAAA,EACF;AACF,CAAA;AAEA,IAAM,qBAAA,GAAwB,CAAC,CAAA,EAAqB,MAAA,KAAiC;AACnF,EAAA,MAAM,MAAA,GAASA,WAAAA,CAAW,CAAA,CAAE,KAAA,EAAO,MAAM,CAAA;AACzC,EAAA,IAAI,MAAA,KAAW,QAAW,MAAM,IAAI,SAAS,aAAA,EAAe,CAAA,eAAA,EAAkB,CAAA,CAAE,KAAK,CAAA,EAAA,CAAI,CAAA;AACzF,EAAA,IAAI,CAAA,CAAE,EAAA,KAAO,QAAA,IAAY,CAAA,CAAE,EAAA,KAAO,QAAA,EAAU,mBAAA,CAAoB,CAAA,CAAE,KAAA,EAAO,CAAA,CAAE,KAAA,EAAO,MAAA,EAAQ,WAAW,CAAA;AACrG,EAAA,MAAM,KAAA,GAAQ,IAAI,GAAA,CAAI,MAAA,CAAO,MAAA,CAAO,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAA;AACtD,EAAA,MAAM,IAAA,GAAO,EAAE,EAAA,KAAO,QAAA,IAAY,EAAE,EAAA,KAAO,YAAA,GAAe,OAAO,IAAA,CAAK,CAAA,CAAE,MAAM,CAAA,GAAI,CAAA,CAAE,OAAO,QAAA,GAAW,MAAA,CAAO,KAAK,CAAA,CAAE,GAAG,IAAI,EAAC;AAC5H,EAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,IAAA,IAAI,CAAC,KAAA,CAAM,GAAA,CAAI,CAAC,GAAG,MAAM,IAAI,QAAA,CAAS,aAAA,EAAe,CAAA,gBAAA,EAAmB,CAAA,CAAE,KAAK,CAAA,CAAA,EAAI,CAAC,CAAA,EAAA,CAAI,CAAA;AAAA,EAC1F;AAGA,EAAA,KAAA,MAAW,CAAA,IAAK,cAAA,CAAe,CAAC,CAAA,EAAG;AACjC,IAAA,MAAM,EAAA,GAAKA,WAAAA,CAAW,CAAA,CAAE,IAAA,EAAM,MAAM,CAAA;AACpC,IAAA,IAAI,EAAA,KAAO,QAAW,MAAM,IAAI,SAAS,aAAA,EAAe,CAAA,eAAA,EAAkB,CAAA,CAAE,IAAI,CAAA,aAAA,CAAe,CAAA;AAC/F,IAAA,IAAI,CAAC,GAAG,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,CAAA,CAAE,KAAK,GAAG,MAAM,IAAI,SAAS,aAAA,EAAe,CAAA,gBAAA,EAAmB,EAAE,IAAI,CAAA,CAAA,EAAI,CAAA,CAAE,KAAK,CAAA,aAAA,CAAe,CAAA;AACrI,IAAA,mBAAA,CAAoB,CAAA,CAAE,KAAA,EAAO,CAAA,CAAE,IAAA,EAAM,QAAQ,WAAW,CAAA;AAAA,EAC1D;AACA,EAAA,IAAA,CAAK,CAAA,CAAE,OAAO,QAAA,IAAY,CAAA,CAAE,OAAO,YAAA,KAAiB,CAAA,CAAE,eAAe,MAAA,EAAW;AAC9E,IAAA,KAAA,MAAW,CAAA,IAAK,CAAC,GAAG,CAAA,CAAE,WAAW,MAAA,EAAQ,GAAG,MAAA,CAAO,IAAA,CAAK,EAAE,UAAA,CAAW,GAAA,IAAO,EAAE,CAAC,CAAA,EAAG;AAChF,MAAA,IAAI,CAAC,KAAA,CAAM,GAAA,CAAI,CAAC,GAAG,MAAM,IAAI,QAAA,CAAS,aAAA,EAAe,CAAA,gBAAA,EAAmB,CAAA,CAAE,KAAK,CAAA,CAAA,EAAI,CAAC,CAAA,gBAAA,CAAkB,CAAA;AAAA,IACxG;AACA,IAAA,oBAAA,CAAqB,CAAA,CAAE,KAAA,EAAO,CAAA,CAAE,UAAA,CAAW,QAAQ,MAAM,CAAA;AACzD,IAAA,IAAI,CAAA,CAAE,UAAA,CAAW,KAAA,KAAU,MAAA,EAAW,mBAAA,CAAoB,CAAA,CAAE,UAAA,CAAW,KAAA,EAAO,CAAA,CAAE,KAAA,EAAO,MAAA,EAAQ,YAAY,CAAA;AAAA,EAC7G;AACF,CAAA;AAiBA,IAAM,cAAA,GAAiB,CAAC,KAAA,EAAe,MAAA,KAAsC;AAC3E,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA;AAClC,EAAA,IAAI,SAAS,MAAA,EAAW;AACtB,IAAA,IAAI,MAAA,CAAO,YAAY,MAAA,EAAQ,MAAM,IAAI,aAAA,CAAc,KAAA,EAAO,CAAA,iBAAA,EAAoB,KAAK,CAAA,wDAAA,CAA0D,CAAA;AACjJ,IAAA,OAAO,EAAC;AAAA,EACV;AACA,EAAA,IAAI,QAAA,IAAY,IAAA,EAAM,OAAO,EAAC;AAC9B,EAAA,IAAI,MAAA,IAAU,MAAM,MAAM,IAAI,cAAc,KAAA,EAAO,CAAA,iBAAA,EAAoB,KAAK,CAAA,mCAAA,CAAqC,CAAA;AACjH,EAAA,IAAI,IAAA,CAAK,SAAS,MAAA,EAAW;AAC3B,IAAA,IAAI,MAAA,CAAO,YAAY,MAAA,EAAQ,MAAM,IAAI,aAAA,CAAc,KAAA,EAAO,CAAA,iBAAA,EAAoB,KAAK,CAAA,8CAAA,CAAgD,CAAA;AACvI,IAAA,OAAO,EAAC;AAAA,EACV;AACA,EAAA,OAAO,IAAA,CAAK,IAAA;AACd,CAAA;AAMA,IAAM,aAAa,CAAC,KAAA,EAAe,CAAA,KACjC,UAAA,CAAW,CAAC,CAAA,GAAI,EAAE,EAAA,EAAI,CAAC,GAAG,KAAK,CAAA,CAAA,EAAI,CAAA,CAAE,KAAK,IAAI,EAAE,MAAA,EAAQ,CAAA,CAAE,EAAA,EAAI,CAAA,EAAE,GAAI,EAAE,EAAA,EAAI,CAAC,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,CAAA,CAAE,KAAK,CAAA,CAAA,EAAI,EAAE,QAAQ,CAAA,CAAE,EAAA,EAAI,CAAA,EAAE;AAEtH,IAAM,YAAA,GAAe,CAAoC,IAAA,EAAyB,MAAA,KAA2C;AAC3H,EAAA,MAAM,MAAyB,EAAC;AAChC,EAAA,KAAA,MAAW,CAAC,CAAA,EAAG,CAAC,KAAK,MAAA,CAAO,OAAA,CAAQ,IAAI,CAAA,EAAG;AACzC,IAAA,IAAI,CAAC,QAAA,CAAS,CAAC,CAAA,EAAG;AAChB,MAAA,GAAA,CAAI,CAAC,CAAA,GAAI,CAAA;AACT,MAAA;AAAA,IACF;AACA,IAAA,IAAI,KAAA,GAAgB,EAAE,OAAA,CAAQ,KAAA;AAC9B,IAAA,KAAA,MAAW,KAAK,cAAA,CAAe,CAAA,CAAE,OAAA,CAAQ,IAAA,EAAM,MAAM,CAAA,EAAG;AACtD,MAAA,KAAA,GAAQ,EAAE,GAAA,EAAK,CAAC,KAAA,EAAO,UAAA,CAAW,EAAE,OAAA,CAAQ,IAAA,EAAM,CAAC,CAAC,CAAA,EAAE;AAAA,IACxD;AAEA,IAAA,GAAA,CAAI,CAAC,IAAI,EAAE,OAAA,EAAS,EAAE,GAAG,CAAA,CAAE,OAAA,EAAS,KAAA,EAAM,EAAE;AAAA,EAC9C;AACA,EAAA,OAAO,GAAA;AACT,CAAA;AAOA,IAAM,SAAA,GAAY,CAAC,KAAA,EAAe,EAAA,EAAoC,MAAA,KAA+C;AACnH,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA;AAClC,EAAA,IAAI,SAAS,MAAA,EAAW;AACtB,IAAA,IAAI,MAAA,CAAO,YAAY,MAAA,EAAQ,MAAM,IAAI,aAAA,CAAc,KAAA,EAAO,CAAA,WAAA,EAAc,KAAK,CAAA,kDAAA,CAAoD,CAAA;AACrI,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,IAAI,QAAA,IAAY,MAAM,OAAO,MAAA;AAC7B,EAAA,IAAI,MAAA,IAAU,MAAM,MAAM,IAAI,cAAc,KAAA,EAAO,CAAA,WAAA,EAAc,KAAK,CAAA,6BAAA,CAA+B,CAAA;AACrG,EAAA,MAAM,QAAA,GAAW,OAAO,QAAA,GAAW,IAAA,CAAK,SAAS,EAAA,KAAO,QAAA,GAAW,IAAA,CAAK,MAAA,GAAS,IAAA,CAAK,MAAA;AACtF,EAAA,IAAI,IAAA,CAAK,KAAA,KAAU,MAAA,IAAa,QAAA,KAAa,MAAA,EAAW;AACtD,IAAA,IAAI,MAAA,CAAO,OAAA,KAAY,MAAA,EAAQ,MAAM,IAAI,aAAA,CAAc,KAAA,EAAO,CAAA,CAAA,EAAI,EAAE,CAAA,MAAA,EAAS,KAAK,CAAA,iDAAA,CAAmD,CAAA;AACrI,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,OAAO,EAAE,IAAA,EAAM,KAAA,EAAO,CAAC,GAAI,IAAA,CAAK,KAAA,IAAS,EAAC,EAAI,GAAI,QAAA,IAAY,EAAG,CAAA,EAAE;AACrE,CAAA;AASA,IAAM,gBAAA,GAAmB,CACvB,KAAA,EACA,SAAA,EACA,aACA,MAAA,KACiG;AACjG,EAAA,IAAI,MAAA,GAAiD,YAAA,CAAa,SAAA,EAAW,MAAM,CAAA;AACnF,EAAA,IAAI,QAAA,GACF,WAAA,KAAgB,MAAA,IAAa,WAAA,CAAY,QAAQ,MAAA,GAAY,WAAA,GAAc,EAAE,GAAG,aAAa,GAAA,EAAK,YAAA,CAAa,WAAA,CAAY,GAAA,EAAK,MAAM,CAAA,EAAE;AAE1I,EAAA,MAAM,IAAA,GAAO,SAAA,CAAU,KAAA,EAAO,QAAA,EAAU,MAAM,CAAA;AAC9C,EAAA,IAAI,IAAA,KAAS,MAAA,EAAW,OAAO,EAAE,QAAQ,QAAA,EAAS;AAElD,EAAA,KAAA,MAAW,CAAA,IAAK,KAAK,KAAA,EAAO;AAa1B,IAAA,IAAI,OAAA,IAAW,CAAA,IAAK,UAAA,CAAW,CAAC,CAAA,EAAG;AACjC,MAAA,MAAM,IAAI,aAAA;AAAA,QACR,KAAA;AAAA,QACA,mBAAmB,KAAK,CAAA,kBAAA,EAAqB,EAAE,KAAK,CAAA,MAAA,EAAS,EAAE,EAAE,CAAA,iKAAA;AAAA,OACnE;AAAA,IACF;AAGA,IAAA,MAAA,GAAS,EAAE,GAAG,MAAA,EAAQ,CAAC,SAAS,CAAA,GAAI,CAAA,CAAE,GAAA,GAAM,CAAA,CAAE,KAAK,GAAG,EAAE,MAAA,EAAQ,CAAA,CAAE,IAAG,EAAE;AAAA,EACzE;AAEA,EAAA,IAAI,QAAA,EAAU,QAAQ,MAAA,EAAW;AAC/B,IAAA,IAAI,KAAK,IAAA,CAAK,KAAA,KAAU,UAAa,IAAA,CAAK,IAAA,CAAK,WAAW,MAAA,EAAW;AACnE,MAAA,MAAM,IAAI,aAAA,CAAc,KAAA,EAAO,CAAA,eAAA,EAAkB,KAAK,CAAA,6DAAA,CAA+D,CAAA;AAAA,IACvH;AACA,IAAA,KAAA,MAAW,CAAA,IAAK,CAAC,GAAI,IAAA,CAAK,KAAK,KAAA,IAAS,EAAC,EAAI,GAAI,IAAA,CAAK,IAAA,CAAK,MAAA,IAAU,EAAG,CAAA,EAAG;AACzE,MAAA,IAAI,SAAS,CAAA,EAAG;AACd,QAAA,QAAA,GAAW,EAAE,GAAG,QAAA,EAAU,KAAK,EAAE,GAAI,SAAS,GAAA,IAAO,IAAK,CAAC,CAAA,CAAE,GAAG,GAAG,EAAE,QAAQ,CAAA,CAAE,EAAA,IAAK,EAAE;AAAA,MACxF,WAAW,CAAC,QAAA,CAAS,OAAO,QAAA,CAAS,CAAA,CAAE,KAAK,CAAA,EAAG;AAC7C,QAAA,MAAM,QAAA,GAAW,UAAA,CAAW,KAAA,EAAO,CAAC,CAAA;AACpC,QAAA,QAAA,GAAW,EAAE,GAAG,QAAA,EAAU,KAAA,EAAO,SAAS,KAAA,KAAU,MAAA,GAAY,QAAA,GAAW,EAAE,KAAK,CAAC,QAAA,CAAS,KAAA,EAAO,QAAQ,GAAE,EAAE;AAAA,MACjH;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,QAAQ,QAAA,EAAS;AAC5B,CAAA;AAEA,IAAM,aAAA,GAAgB,CAAC,CAAA,EAAiB,MAAA,KAA0C;AAChF,EAAA,IAAI,CAAA,CAAE,OAAO,QAAA,EAAU;AACrB,IAAA,MAAM,EAAE,MAAA,EAAQ,QAAA,EAAS,GAAI,gBAAA,CAAiB,CAAA,CAAE,KAAA,EAAO,CAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,UAAA,EAAY,MAAM,CAAA;AACrF,IAAA,OAAO,EAAE,EAAA,EAAI,QAAA,EAAU,KAAA,EAAO,EAAE,KAAA,EAAO,MAAA,EAAQ,GAAI,QAAA,KAAa,SAAY,EAAC,GAAI,EAAE,UAAA,EAAY,UAAS,EAAG;AAAA,EAC7G;AACA,EAAA,IAAI,CAAA,CAAE,OAAO,YAAA,EAAc;AACzB,IAAA,MAAM,EAAE,MAAA,EAAQ,QAAA,EAAS,GAAI,gBAAA,CAAiB,CAAA,CAAE,KAAA,EAAO,CAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,UAAA,EAAY,MAAM,CAAA;AACrF,IAAA,OAAO,EAAE,EAAA,EAAI,YAAA,EAAc,OAAO,CAAA,CAAE,KAAA,EAAO,OAAO,CAAA,CAAE,KAAA,EAAO,MAAA,EAAQ,GAAI,aAAa,MAAA,GAAY,KAAK,EAAE,UAAA,EAAY,UAAS,EAAG;AAAA,EACjI;AACA,EAAA,IAAI,CAAA,CAAE,OAAO,QAAA,EAAU;AACrB,IAAA,IAAI,GAAA,GAAqC,YAAA,CAAa,CAAA,CAAE,GAAA,EAAK,MAAM,CAAA;AACnE,IAAA,IAAIC,SAAgB,CAAA,CAAE,KAAA;AACtB,IAAA,MAAMC,KAAAA,GAAO,SAAA,CAAU,CAAA,CAAE,KAAA,EAAO,UAAU,MAAM,CAAA;AAChD,IAAA,IAAIA,UAAS,MAAA,EAAW;AACtB,MAAA,KAAA,MAAW,CAAA,IAAKA,MAAK,KAAA,EAAO;AAE1B,QAAA,IAAI,KAAA,IAAS,CAAA,EAAG,GAAA,GAAM,EAAE,GAAG,GAAA,EAAK,CAAC,CAAA,CAAE,GAAG,GAAG,EAAE,MAAA,EAAQ,CAAA,CAAE,IAAG,EAAE;AAAA,aAIrDD,MAAAA,GAAQ,EAAE,GAAA,EAAK,CAACA,MAAAA,EAAO,UAAA,CAAW,CAAA,CAAE,KAAA,EAAO,CAAC,CAAC,CAAA,EAAE;AAAA,MACtD;AAAA,IACF;AACA,IAAA,OAAO,EAAE,IAAI,QAAA,EAAU,KAAA,EAAO,EAAE,KAAA,EAAO,GAAA,EAAK,OAAAA,MAAAA,EAAM;AAAA,EACpD;AAEA,EAAA,IAAI,QAAgB,CAAA,CAAE,KAAA;AACtB,EAAA,MAAM,IAAA,GAAO,SAAA,CAAU,CAAA,CAAE,KAAA,EAAO,UAAU,MAAM,CAAA;AAChD,EAAA,IAAI,SAAS,MAAA,EAAW;AACtB,IAAA,KAAA,MAAW,CAAA,IAAK,KAAK,KAAA,EAAO;AAC1B,MAAA,IAAI,OAAA,IAAW,CAAA,EAAG,KAAA,GAAQ,EAAE,GAAA,EAAK,CAAC,KAAA,EAAO,UAAA,CAAW,CAAA,CAAE,KAAA,EAAO,CAAC,CAAC,CAAA,EAAE;AAAA,IACnE;AAAA,EACF;AACA,EAAA,OAAO,EAAE,EAAA,EAAI,QAAA,EAAU,KAAA,EAAO,CAAA,CAAE,OAAO,KAAA,EAAM;AAC/C,CAAA;AAYA,IAAM,SAAS,OAA2B;AAAA,EACxC,aAAA,sBAAmB,GAAA,EAAI;AAAA,EACvB,QAAA,sBAAc,GAAA,EAAI;AAAA,EAClB,YAAY,EAAC;AAAA,EACb,YAAA,EAAc,EAAE,KAAA,EAAO,CAAA;AACzB,CAAA,CAAA;AAKA,IAAM,iBAAA,GAAoB,CAAC,MAAA,EAAgB,QAAA,KAAwC;AACjF,EAAA,KAAA,MAAW,QAAQ,aAAA,CAAc,MAAM,GAAG,QAAA,CAAS,GAAA,CAAI,MAAM,IAAI,CAAA;AACnE,CAAA;AAKA,IAAM,YAAA,GAAe,CAAC,CAAA,EAAkB,GAAA,KAAoC;AAC1E,EAAA,IAAI,QAAA,CAAS,CAAC,CAAA,EAAG;AACf,IAAA,iBAAA,CAAkB,CAAA,CAAE,OAAA,CAAQ,KAAA,EAAO,GAAA,CAAI,QAAQ,CAAA;AAC/C,IAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,CAAA,CAAE,OAAA,CAAQ,OAAO,GAAG,CAAA;AAChD,IAAA,OAAO,CAAA,QAAA,EAAW,EAAE,OAAA,CAAQ,KAAK,SAAS,CAAA,CAAE,OAAA,CAAQ,IAAI,CAAA,OAAA,EAAU,KAAK,CAAA,CAAA,CAAA;AAAA,EACzE;AACA,EAAA,OAAO,mBAAA,CAAoB,GAAG,GAAG,CAAA;AACnC,CAAA;AAIA,IAAM,qBAAqB,CAAC,KAAA,EAAe,MAAA,EAAgB,CAAA,EAAkB,KAAyB,MAAA,KAAmC;AACvI,EAAA,MAAM,MAAA,GAAS,IAAI,UAAA,CAAW,MAAA;AAC9B,EAAA,MAAM,GAAA,GAAM,YAAA,CAAa,CAAA,EAAG,GAAG,CAAA;AAC/B,EAAA,MAAM,IAAA,GAAOD,WAAAA,CAAW,KAAA,EAAO,MAAM,CAAA,EAAG,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAM,GAAG,cAAA,KAAmB,MAAA;AAClG,EAAA,IAAI,QAAQ,OAAO,CAAA,KAAM,YAAY,CAAA,KAAM,IAAA,IAAQ,cAAc,CAAA,EAAG;AAClE,IAAA,MAAM,IAAA,GAAO,GAAA,CAAI,UAAA,CAAW,MAAM,CAAA;AAClC,IAAA,IAAI,IAAA,KAAS,MAAA,EAAW,GAAA,CAAI,UAAA,CAAW,MAAM,IAAI,EAAE,GAAG,IAAA,EAAM,MAAA,EAAQ,MAAA,EAAO;AAAA,EAC7E;AACA,EAAA,OAAO,GAAA;AACT,CAAA;AAEA,IAAM,eAAA,GAAkB,CAAC,CAAA,EAAuD,GAAA,EAAyB,MAAA,KAAmC;AAC1I,EAAA,MAAM,IAAI,CAAA,CAAE,UAAA;AACZ,EAAA,IAAI,CAAA,KAAM,QAAW,OAAO,EAAA;AAC5B,EAAA,IAAI,CAAA,CAAE,QAAQ,MAAA,EAAW,OAAO,iBAAiB,CAAA,CAAE,MAAA,CAAO,IAAA,CAAK,IAAI,CAAC,CAAA,YAAA,CAAA;AACpE,EAAA,MAAM,IAAA,GAAO,OAAO,OAAA,CAAQ,CAAA,CAAE,GAAG,CAAA,CAAE,GAAA,CAAI,CAAC,CAAC,GAAA,EAAK,CAAC,MAAM,CAAA,EAAG,GAAG,CAAA,GAAA,EAAM,kBAAA,CAAmB,CAAA,CAAE,KAAA,EAAO,KAAK,CAAA,EAAG,GAAA,EAAK,MAAM,CAAC,CAAA,CAAE,CAAA;AACnH,EAAA,IAAI,KAAA,GAAQ,EAAA;AACZ,EAAA,IAAI,CAAA,CAAE,UAAU,MAAA,EAAW;AACzB,IAAA,iBAAA,CAAkB,CAAA,CAAE,KAAA,EAAO,GAAA,CAAI,QAAQ,CAAA;AACvC,IAAA,KAAA,GAAQ,CAAA,OAAA,EAAU,aAAA,CAAc,CAAA,CAAE,KAAA,EAAO,GAAG,CAAC,CAAA,CAAA;AAAA,EAC/C;AACA,EAAA,OAAO,CAAA,cAAA,EAAiB,CAAA,CAAE,MAAA,CAAO,IAAA,CAAK,IAAI,CAAC,CAAA,gBAAA,EAAmB,IAAA,CAAK,IAAA,CAAK,IAAI,CAAC,CAAA,EAAG,KAAK,CAAA,CAAA;AACvF,CAAA;AAIA,IAAM,SAAA,GAAoC;AAAA,EACxC,MAAA,EAAQ,SAAA;AAAA,EACR,OAAA,EAAS,SAAA;AAAA,EACT,IAAA,EAAM,MAAA;AAAA,EACN,SAAA,EAAW,aAAA;AAAA,EACX,IAAA,EAAM;AACR,CAAA;AAGA,IAAM,eAAA,GAAkB,CAAC,CAAA,EAAqB,MAAA,KAAqC;AACjF,EAAA,MAAM,MAAM,MAAA,EAAO;AACnB,EAAA,IAAI,CAAA,CAAE,OAAO,QAAA,EAAU;AACrB,IAAA,MAAM,OAAA,GAAU,MAAA,CAAO,OAAA,CAAQ,CAAA,CAAE,MAAM,CAAA;AACvC,IAAA,MAAM,OAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;AACnC,IAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG,CAAC,CAAA,KAAM,kBAAA,CAAmB,EAAE,KAAA,EAAO,CAAA,EAAG,CAAA,EAAG,GAAA,EAAK,MAAM,CAAC,CAAA;AACnF,IAAA,OAAO,EAAE,GAAA,EAAK,CAAA,YAAA,EAAe,CAAA,CAAE,KAAK,KAAK,IAAA,CAAK,IAAA,CAAK,IAAI,CAAC,CAAA,UAAA,EAAa,IAAA,CAAK,KAAK,IAAI,CAAC,CAAA,CAAA,EAAI,eAAA,CAAgB,CAAA,EAAG,GAAA,EAAK,MAAM,CAAC,CAAA,YAAA,CAAA,EAAgB,KAAA,EAAO,GAAA,CAAI,UAAA,EAAW;AAAA,EAC/J;AACA,EAAA,IAAI,CAAA,CAAE,OAAO,YAAA,EAAc;AACzB,IAAA,MAAM,MAAA,GAASA,WAAAA,CAAW,CAAA,CAAE,KAAA,EAAO,MAAM,CAAA;AACzC,IAAA,MAAM,OAAA,GAAU,MAAA,CAAO,OAAA,CAAQ,CAAA,CAAE,MAAM,CAAA;AACvC,IAAA,MAAM,OAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;AACnC,IAAA,MAAM,QAAQ,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,GAAA,EAAK,CAAC,CAAA,KAAM;AACtC,MAAA,IAAI,SAAA,CAAU,CAAC,CAAA,EAAG;AAChB,QAAA,MAAM,EAAA,GAAK,MAAA,EAAQ,MAAA,CAAO,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,GAAG,CAAA,EAAG,cAAA,IAAkB,QAAA;AACzE,QAAA,IAAI,OAAO,MAAA,EAAQ,OAAO,gBAAgB,YAAA,CAAa,CAAA,CAAE,KAAK,CAAC,CAAA,CAAA,CAAA;AAC/D,QAAA,MAAM,IAAA,GAAO,UAAU,EAAE,CAAA;AACzB,QAAA,MAAM,GAAA,GAAM,CAAA,cAAA,EAAiB,YAAA,CAAa,CAAA,CAAE,KAAK,CAAC,CAAA,CAAA,CAAA;AAClD,QAAA,OAAO,SAAS,MAAA,GAAY,GAAA,GAAM,CAAA,EAAG,GAAG,KAAK,IAAI,CAAA,CAAA;AAAA,MACnD;AACA,MAAA,OAAO,YAAA,CAAa,GAAG,GAAG,CAAA;AAAA,IAC5B,CAAC,CAAA;AACD,IAAA,GAAA,CAAI,aAAa,KAAA,IAAS,CAAA;AAC1B,IAAA,GAAA,CAAI,UAAA,CAAW,IAAA,CAAK,EAAE,GAAA,EAAK,CAAA,CAAE,KAAA,CAAM,QAAA,EAAU,IAAA,EAAM,SAAA,EAAW,IAAA,EAAM,MAAA,EAAQ,CAAA;AAC5E,IAAA,MAAM,MAAA,GAAS,CAAA,sBAAA,EAAyB,GAAA,CAAI,YAAA,CAAa,KAAK,CAAA,gBAAA,CAAA;AAC9D,IAAA,OAAO;AAAA,MACL,GAAA,EAAK,eAAe,CAAA,CAAE,KAAK,KAAK,IAAA,CAAK,IAAA,CAAK,IAAI,CAAC,CAAA,SAAA,EAAY,MAAM,IAAA,CAAK,IAAI,CAAC,CAAA,MAAA,EAAS,MAAM,GAAG,eAAA,CAAgB,CAAA,EAAG,GAAA,EAAK,MAAM,CAAC,CAAA,YAAA,CAAA;AAAA,MAC5H,OAAO,GAAA,CAAI;AAAA,KACb;AAAA,EACF;AACA,EAAA,IAAI,CAAA,CAAE,OAAO,QAAA,EAAU;AACrB,IAAA,MAAM,IAAA,GAAO,OAAO,OAAA,CAAQ,CAAA,CAAE,GAAG,CAAA,CAAE,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG,CAAC,MAAM,CAAA,EAAG,CAAC,CAAA,GAAA,EAAM,kBAAA,CAAmB,CAAA,CAAE,KAAA,EAAO,GAAG,CAAA,EAAG,GAAA,EAAK,MAAM,CAAC,CAAA,CAAE,CAAA;AAC7G,IAAA,iBAAA,CAAkB,CAAA,CAAE,KAAA,EAAO,GAAA,CAAI,QAAQ,CAAA;AACvC,IAAA,MAAMC,MAAAA,GAAQ,aAAA,CAAc,CAAA,CAAE,KAAA,EAAO,GAAG,CAAA;AACxC,IAAA,OAAO,EAAE,GAAA,EAAK,CAAA,OAAA,EAAU,CAAA,CAAE,KAAK,CAAA,KAAA,EAAQ,IAAA,CAAK,IAAA,CAAK,IAAI,CAAC,CAAA,OAAA,EAAUA,MAAK,CAAA,YAAA,CAAA,EAAgB,KAAA,EAAO,IAAI,UAAA,EAAW;AAAA,EAC7G;AACA,EAAA,iBAAA,CAAkB,CAAA,CAAE,KAAA,EAAO,GAAA,CAAI,QAAQ,CAAA;AACvC,EAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,CAAA,CAAE,KAAA,EAAO,GAAG,CAAA;AACxC,EAAA,OAAO,EAAE,GAAA,EAAK,CAAA,YAAA,EAAe,CAAA,CAAE,KAAK,UAAU,KAAK,CAAA,YAAA,CAAA,EAAgB,KAAA,EAAO,GAAA,CAAI,UAAA,EAAW;AAC3F,CAAA;AAKA,IAAM,KAAA,GAAyH;AAAA,EAC7H,MAAA,EAAQ,CAAC,CAAA,EAAG,OAAA,KAAY;AACtB,IAAA,MAAM,KAAA,GAAQ,QAAQ,CAAA,CAAE,GAAG,MAAM,MAAA,IAAa,OAAA,CAAQ,CAAA,CAAE,GAAG,CAAA,KAAM,EAAA;AACjE,IAAA,OAAO,QACH,EAAE,EAAA,EAAI,UAAU,KAAA,EAAO,CAAA,CAAE,OAAO,GAAA,EAAK,CAAA,CAAE,SAAS,KAAA,EAAO,EAAE,IAAI,CAAC,CAAA,EAAG,EAAE,KAAK,CAAA,CAAA,EAAI,EAAE,GAAG,CAAA,CAAA,EAAI,EAAE,QAAA,EAAU,CAAA,CAAE,KAAK,CAAA,IAAI,GAC5G,EAAE,IAAI,QAAA,EAAU,KAAA,EAAO,EAAE,KAAA,EAAO,MAAA,EAAQ,EAAE,GAAG,CAAA,CAAE,SAAS,GAAG,CAAA,CAAE,QAAO,EAAE;AAAA,EAC5E;AACF,CAAA;AAEA,IAAM,eAAA,GAAkB,CAAC,CAAA,EAAa,OAAA,KAAmD;AACvF,EAAA,MAAM,OAAA,GAAU,KAAA,CAAM,CAAA,CAAE,EAAE,CAAA;AAC1B,EAAA,OAAO,OAAA,KAAY,MAAA,GAAa,CAAA,GAAqB,OAAA,CAAQ,GAAG,OAAO,CAAA;AACzE,CAAA;AAiBO,IAAM,aAAA,GAAgB,OAAO,MAAA,EAAwB,GAAA,EAAyB,IAAA,KAAkD;AACrI,EAAA,MAAM,MAAA,GAAS,wBAAA,CAAyB,KAAA,CAAM,GAAG,CAAA;AACjD,EAAA,MAAM,UAAU,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,GAAI,MAAA,GAAS,CAAC,MAAM,CAAA;AACxD,EAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,GAAA,CAAI,CAAC,KAAA,KAAU;AACtC,IAAA,MAAM,IAAA,GAAO,eAAA,CAAgB,KAAA,EAAO,IAAA,CAAK,OAAO,CAAA;AAGhD,IAAA,MAAM,OAAA,GAAU,mBAAA,CAAoB,IAAI,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM,IAAA,CAAK,OAAA,CAAQ,CAAC,CAAA,KAAM,MAAS,CAAA;AACrF,IAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtB,MAAA,MAAM,IAAI,SAAS,iBAAA,EAAmB,CAAA,6BAAA,EAAgC,QAAQ,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA,EAAK;AAAA,QAC3F,QAAA,EAAU,sBAAA,CAAuB,MAAA,EAAQ,IAAA,CAAK,MAAM;AAAA,OACrD,CAAA;AAAA,IACH;AACA,IAAA,MAAM,CAAA,GAAI,aAAA,CAAc,IAAA,EAAM,IAAA,CAAK,MAAM,CAAA;AACzC,IAAA,qBAAA,CAAsB,CAAA,EAAG,KAAK,MAAM,CAAA;AACpC,IAAA,MAAM,SAAA,GAAY,eAAA,CAAgB,CAAA,EAAG,IAAA,CAAK,MAAM,CAAA;AAGhD,IAAA,YAAA,CAAa,EAAE,UAAA,EAAY,SAAA,CAAU,KAAA,EAAM,EAAG,KAAK,KAAK,CAAA;AACxD,IAAA,OAAO,EAAE,GAAG,SAAA,EAAW,KAAA,EAAO,CAAA,CAAE,KAAA,EAAO,EAAA,EAAK,CAAA,CAAE,EAAA,KAAO,YAAA,GAAe,QAAA,GAAW,CAAA,CAAE,EAAA,EAAyB;AAAA,EAC5G,CAAC,CAAA;AAED,EAAA,MAAM,MAAA,GAAS,OAAO,CAAA,KAA0C;AAC9D,IAAA,MAAM,UAAyB,EAAC;AAChC,IAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,MAAA,MAAM,MAAA,GAAS,MAAM,aAAA,CAAc,CAAA,CAAE,OAAO,IAAA,CAAK,OAAA,EAAS,KAAK,KAAK,CAAA;AAIpE,MAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,GAAA,CAAI,CAAC,OAAO,CAAA,KAAM;AACrC,QAAA,IAAI,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,EAAG,WAAW,MAAA,EAAQ,OAAO,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA,GAAW,IAAA,CAAK,SAAA,CAAU,KAAK,CAAA,GAAI,KAAA;AAChH,QAAA,IAAI,EAAE,KAAA,CAAM,CAAC,CAAA,EAAG,IAAA,KAAS,QAAQ,OAAO,KAAA;AACxC,QAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACzB,UAAA,MAAM,IAAI,QAAA,CAAS,iBAAA,EAAmB,CAAA,CAAA,EAAI,CAAA,CAAE,MAAM,CAAC,CAAA,EAAG,GAAA,IAAO,EAAE,CAAA,6DAAA,CAA+D,CAAA;AAAA,QAChI;AACA,QAAA,OAAO,IAAA,CAAK,UAAU,KAAK,CAAA;AAAA,MAC7B,CAAC,CAAA;AACD,MAAA,MAAM,MAAM,MAAM,CAAA,CAAE,KAAA,CAAM,CAAA,CAAE,KAAK,KAAkB,CAAA;AACnD,MAAA,OAAA,CAAQ,IAAA,CAAK,EAAE,KAAA,EAAO,CAAA,CAAE,KAAA,EAAO,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,IAAA,EAAM,GAAA,CAAI,IAAA,EAAe,CAAA;AAAA,IACpE;AACA,IAAA,OAAO,OAAA;AAAA,EACT,CAAA;AAGA,EAAA,IAAI,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG,OAAO,OAAO,MAAM,CAAA;AAC/C,EAAA,IAAI,MAAA,CAAO,gBAAgB,MAAA,EAAW;AACpC,IAAA,MAAM,IAAI,QAAA,CAAS,iBAAA,EAAmB,iDAAiD,CAAA;AAAA,EACzF;AACA,EAAA,OAAO,OAAO,WAAA,CAAY,CAAC,EAAA,KAAO,MAAA,CAAO,EAAE,CAAC,CAAA;AAC9C;AAIO,IAAM,eAAA,GAAkB,OAAO,MAAA,EAAwB,GAAA,EAAyB,UACpF,MAAM,aAAA,CAAc,MAAA,EAAQ,GAAA,EAAK,IAAI,CAAA,EAAG,OAAA,CAAQ,CAAC,CAAA,KAAM,EAAE,IAAI;ACxczD,IAAM,eAAA,GAAkB,CAAC,MAAA,EAAgC,MAAA,KAAiD;AAC/G,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,WAAA,GAAc,CAAC,KAAA,KAAA,CAClB,MAAA,EAAQ,QAAA,CAAS,IAAA,CAAK,CAAC,MAAA,KAAW,MAAA,CAAO,IAAA,KAAS,KAAK,CAAA,EAAG,SAAA,IAAa,EAAC,EACtE,MAAA,CAAO,CAAC,QAAA,KAAa,QAAA,CAAS,IAAA,KAAS,WAAW,CAAA,CAClD,GAAA,CAAI,CAAC,QAAA,KAAa,QAAA,CAAS,MAAM,CAAA;AACtC,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,IAAA,IAAI,KAAA,CAAM,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG;AAC7B,IAAA,OAAA,CAAQ,GAAA,CAAI,MAAM,KAAK,CAAA;AACvB,IAAA,IAAI,KAAA,CAAM,OAAO,QAAA,EAAU;AAC3B,IAAA,MAAM,OAAA,GAAU,CAAC,KAAA,CAAM,KAAK,CAAA;AAC5B,IAAA,KAAA,IAAS,IAAA,GAAO,QAAQ,GAAA,EAAI,EAAG,SAAS,MAAA,EAAW,IAAA,GAAO,OAAA,CAAQ,GAAA,EAAI,EAAG;AACvE,MAAA,KAAA,MAAW,KAAA,IAAS,WAAA,CAAY,IAAI,CAAA,EAAG;AACrC,QAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,KAAK,CAAA,EAAG;AACxB,QAAA,OAAA,CAAQ,IAAI,KAAK,CAAA;AACjB,QAAA,OAAA,CAAQ,KAAK,KAAK,CAAA;AAAA,MACpB;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,OAAO,CAAA;AACpB;AA6FA,IAAM,YAAA,GAAe,CAAC,MAAA,EAAoC,QAAA,KAAwC;AAChG,EAAA,IAAI,MAAA,KAAW,MAAA,EAAW,OAAO,EAAC;AAClC,EAAA,IAAI,aAAa,MAAA,IAAa,QAAA,CAAS,MAAA,KAAW,CAAA,SAAU,MAAA,CAAO,QAAA;AACnE,EAAA,OAAO,MAAA,CAAO,SAAS,MAAA,CAAO,CAAA,CAAA,KAAK,SAAS,QAAA,CAAS,CAAA,CAAE,IAAI,CAAC,CAAA;AAC9D,CAAA;AAOA,IAAM,aAAA,GAAgB,CAAC,MAAA,EAAqB,KAAA,EAAe,EAAA,KAAwB;AACjF,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA;AAClC,EAAA,IAAI,IAAA,KAAS,MAAA,EAAW,OAAO,MAAA,CAAO,OAAA,KAAY,OAAA;AAClD,EAAA,IAAI,QAAA,IAAY,MAAM,OAAO,IAAA;AAC7B,EAAA,IAAI,MAAA,IAAU,MAAM,OAAO,KAAA;AAC3B,EAAA,IAAI,KAAK,KAAA,KAAU,MAAA,IAAa,MAAA,CAAO,OAAA,KAAY,SAAS,OAAO,IAAA;AAEnE,EAAA,IAAI,OAAO,QAAA,IAAY,EAAA,KAAO,YAAA,EAAc,OAAO,KAAK,MAAA,KAAW,MAAA;AACnE,EAAA,IAAI,EAAA,KAAO,QAAA,EAAU,OAAO,IAAA,CAAK,MAAA,KAAW,MAAA;AAC5C,EAAA,IAAI,EAAA,KAAO,QAAA,EAAU,OAAO,IAAA,CAAK,MAAA,KAAW,MAAA;AAE5C,EAAA,IAAI,OAAO,QAAA,EAAU,OAAO,KAAK,MAAA,KAAW,MAAA,IAAa,KAAK,MAAA,KAAW,MAAA;AACzE,EAAA,OAAO,KAAA;AACT,CAAA;AAIA,IAAM,aAAA,GAAgB,CAAC,GAAA,KAAyB;AAC9C,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,MAAM,IAAA,GAAO,CAAC,CAAA,KAAmB;AAC/B,IAAA,KAAA,MAAW,GAAA,IAAO,EAAE,IAAA,EAAM;AACxB,MAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,EAAU,GAAA,CAAI,KAAK,GAAG,CAAA;AAAA,WACpC,IAAA,CAAK,IAAI,KAAK,CAAA;AAAA,IACrB;AAAA,EACF,CAAA;AACA,EAAA,IAAA,CAAK,GAAG,CAAA;AACR,EAAA,OAAO,GAAA;AACT,CAAA;AAEA,IAAM,YAAA,GAAe,CAAC,MAAA,EAAqB,KAAA,KAA+B;AACxE,EAAA,IAAI,KAAA,CAAM,IAAA,KAAS,IAAA,EAAM,OAAO,cAAc,KAAA,CAAM,GAAG,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,KAAM,YAAA,CAAa,MAAA,EAAQ,CAAC,CAAC,CAAA;AAC7F,EAAA,IAAI,MAAM,IAAA,KAAS,UAAA,EAAY,OAAO,cAAA,CAAe,MAAM,QAAQ,CAAA,CAAE,KAAA,CAAM,CAAC,MAAM,aAAA,CAAc,MAAA,EAAQ,EAAE,KAAA,EAAO,CAAA,CAAE,EAAE,CAAC,CAAA;AACtH,EAAA,OAAO,KAAA;AACT,CAAA;AAEA,IAAM,gBAAA,GAAmB,OAAO,MAAA,EAAqB,MAAA,KAA0D;AAC7G,EAAA,IAAI,MAAA,CAAO,KAAA,CAAM,OAAA,KAAY,MAAA,SAAkB,EAAC;AAChD,EAAA,MAAM,MAAA,GAAS,OAAO,SAAA,EAAU;AAChC,EAAA,MAAM,OAAA,GAAU,MAAA,KAAW,MAAA,GAAY,wBAAA,CAAyB,MAAM,CAAA,GAAI,MAAA;AAC1E,EAAA,MAAM,IAAA,GAAO,MAAM,MAAA,CAAO,KAAA,CAAM,OAAA,EAAQ;AACxC,EAAA,OAAO,KACJ,MAAA,CAAO,CAAC,EAAE,GAAA,EAAK,OAAM,KAAA,CAAO,KAAA,CAAM,IAAA,KAAS,IAAA,IAAQ,MAAM,IAAA,KAAS,UAAA,KAAe,CAAC,GAAA,CAAI,WAAW,MAAM,CAAC,CAAA,CACxG,MAAA,CAAO,CAAC,EAAE,KAAA,EAAM,KAAM,MAAA,KAAW,UAAa,YAAA,CAAa,MAAA,EAAQ,KAAK,CAAC,EACzE,GAAA,CAAI,CAAC,EAAE,GAAA,EAAK,OAAM,MAAO;AAAA,IACxB,WAAA,EAAa,GAAA;AAAA,IACb,IAAA,EAAM,KAAA,CAAM,IAAA,KAAS,UAAA,GAAc,UAAA,GAAwB,OAAA;AAAA,IAC3D,SAAA,EAAW,MAAM,SAAA,KAAc,IAAA;AAAA,IAC/B,WAAA,EAAa,YAAA,CAAa,KAAA,EAAO,OAAO,CAAA;AAAA,IACxC,GAAI,MAAM,MAAA,KAAW,MAAA,GAAY,EAAE,MAAA,EAAQ,KAAA,CAAM,MAAA,EAAO,GAAI,EAAC;AAAA,IAC7D,WAAW,KAAA,CAAM,SAAA;AAAA,IACjB,GAAI,MAAM,UAAA,KAAe,MAAA,GAAY,EAAE,UAAA,EAAY,KAAA,CAAM,UAAA,EAAW,GAAI,EAAC;AAAA;AAAA,IAEzE,GAAI,KAAA,CAAM,IAAA,KAAS,IAAA,GACf;AAAA,MACE,OAAA,EAAS,mBAAA,CAAoB,KAAA,CAAM,GAAA,EAAK,MAAM,CAAA;AAAA,MAC9C,GAAI,MAAM,KAAA,KAAU,MAAA,GAAY,EAAE,KAAA,EAAO,KAAA,CAAM,KAAA,EAAM,GAAI;AAAC,KAC5D,GACA,KAAA,CAAM,IAAA,KAAS,UAAA,GACb;AAAA,MACE,OAAA,EAAS,sBAAA,CAAuB,KAAA,CAAM,QAAA,EAAU,MAAM,CAAA;AAAA,MACtD,MAAA,EAAQ,cAAA,CAAe,KAAA,CAAM,QAAQ;AAAA,QAEvC;AAAC,GACT,CAAE,CAAA;AACN,CAAA;AAEO,IAAM,eAAA,GAAkB,OAAO,MAAA,KAAyD;AAC7F,EAAA,MAAM,EAAE,MAAA,EAAQ,QAAA,EAAU,YAAA,EAAc,aAAY,GAAI,MAAA;AAIxD,EAAA,MAAM,WAAW,YAAA,CAAa,MAAA,CAAO,SAAA,EAAU,EAAG,YAAY,CAAA,CAAE,MAAA;AAAA,IAC9D,CAAC,CAAA,KAAM,WAAA,KAAgB,UAAa,YAAA,CAAa,WAAA,EAAa,EAAE,IAAI;AAAA,GACtE;AACA,EAAA,MAAM,YAAA,GAAe,MAAM,gBAAA,CAAiB,MAAA,EAAQ,WAAW,CAAA;AAC/D,EAAA,MAAM,iBAAiB,YAAA,CAAa,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,CAAA,CAAE,MAAA;AAE/D,EAAA,OAAO;AAAA,IACL,YAAY,cAAA,KAAmB,CAAA,GAAI,SAAS,cAAA,KAAmB,YAAA,CAAa,SAAS,KAAA,GAAQ,MAAA;AAAA,IAC7F,MAAA,EAAQ,OAAO,MAAA,KAAW,IAAA;AAAA,IAC1B,YAAA;AAAA,IACA,GAAA,EAAK,KAAA;AAAA,IACL,WAAA,EAAa,8DAAA;AAAA,IACb,QAAA,EAAU,QAAA,CAAS,GAAA,CAAI,CAAA,CAAA,MAAM;AAAA,MAC3B,MAAM,CAAA,CAAE,IAAA;AAAA,MACR,MAAA,EAAQ,CAAA,CAAE,MAAA,CAAO,GAAA,CAAI,CAAA,CAAA,MAAM;AAAA,QACzB,MAAM,CAAA,CAAE,IAAA;AAAA,QACR,MAAM,CAAA,CAAE,cAAA;AAAA,QACR,UAAU,CAAA,CAAE,QAAA;AAAA,QACZ,YAAY,CAAA,CAAE;AAAA,OAChB,CAAE,CAAA;AAAA,MACF,SAAA,EAAW,CAAA,CAAE,SAAA,CAAU,GAAA,CAAI,CAAA,CAAA,MAAM;AAAA,QAC/B,QAAQ,CAAA,CAAE,MAAA;AAAA,QACV,MAAM,CAAA,CAAE,IAAA;AAAA,QACR,KAAK,CAAA,CAAE;AAAA,OACT,CAAE,CAAA;AAAA,MACF,UAAU,CAAA,CAAE;AAAA,KACd,CAAE,CAAA;AAAA,IACF,KAAA,EAAO;AAAA,MACL,MAAA,EAAQ,MAAA;AAAA,MACR,OAAA,EAAS,kBAAA;AAAA,MACT,IAAA,EAAM;AAAA,QACJ,WAAA,EAAa;AAAA,UACX,IAAA,EAAM,QAAA;AAAA,UACN,QAAA,EAAU,KAAA;AAAA,UACV,WAAA,EACE;AAAA,SAGJ;AAAA,QACA,MAAA,EAAQ;AAAA,UACN,IAAA,EAAM,QAAA;AAAA,UACN,QAAA,EAAU,KAAA;AAAA,UACV,WAAA,EAAa;AAAA,SACf;AAAA,QACA,KAAA,EAAO;AAAA,UACL,IAAA,EAAM,KAAA;AAAA,UACN,QAAA,EAAU,KAAA;AAAA,UACV,WAAA,EAAa;AAAA,SACf;AAAA,QACA,OAAA,EAAS;AAAA,UACP,IAAA,EAAM,yBAAA;AAAA,UACN,QAAA,EAAU,KAAA;AAAA,UACV,WAAA,EAAa;AAAA;AACf;AACF,KACF;AAAA,IACA,GAAA,EAAKlB,MAAE,YAAA,CAAa,WAAA,EAAa,EAAE,MAAA,EAAQ,SAAA,EAAW,MAAA,EAAQ,KAAA,EAAO;AAAA,GACvE;AACF;AAaA,IAAM,MAAA,GAAS,CAAC,MAAA,KACd,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,GAAI,MAAA,CAAO,MAAA,GAAS,MAAA,KAAW,IAAA,IAAQ,MAAA,KAAW,SAAY,CAAA,GAAI,CAAA;AAEjF,IAAM,WAAA,GAAc,OACzB,MAAA,EACA,IAAA,EACA,OACA,IAAA,KACyB;AAGzB,EAAA,IAAI,MAAA,CAAO,cAAc,MAAA,EAAW,OAAO,SAAS,MAAA,EAAQ,IAAA,EAAM,KAAA,EAAO,MAAA,EAAW,IAAI,CAAA;AAExF,EAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,GAAA,EAAI,GAAI,GAAA;AACnC,EAAA,MAAM,KAAK,YAAA,EAAa;AACxB,EAAA,MAAM,KAAA,GAAsB,EAAE,IAAA,EAAM,OAAA,EAAQ;AAC5C,EAAA,MAAM,SAAS,MAAM,QAAA,CAAS,QAAQ,IAAA,EAAM,KAAA,EAAO,OAAO,IAAI,CAAA;AAC9D,EAAA,MAAM,MAAA,GAAwB;AAAA,IAC5B,MAAM,KAAA,CAAM,IAAA;AAAA;AAAA;AAAA,IAGZ,MAAA,EAAQ,OAAO,MAAA,KAAW,GAAA,GAAM,OAAO,MAAA,CAAO,MAAA,KAAW,MAAM,SAAA,GAAY,OAAA;AAAA,IAC3E,aAAA;AAAA,IACA,WAAA,EAAa,aAAA,GAAA,CAAiB,YAAA,EAAa,GAAI,EAAA,IAAM,GAAA;AAAA,IACrD,KAAA;AAAA,IACA,GAAI,MAAM,WAAA,KAAgB,MAAA,GAAY,EAAE,WAAA,EAAa,KAAA,CAAM,WAAA,EAAY,GAAI,EAAC;AAAA,IAC5E,GAAI,MAAM,KAAA,KAAU,MAAA,GAAY,EAAE,KAAA,EAAO,KAAA,CAAM,KAAA,EAAM,GAAI,EAAC;AAAA,IAC1D,GAAI,MAAM,QAAA,KAAa,MAAA,GAAY,EAAE,QAAA,EAAU,KAAA,CAAM,QAAA,EAAS,GAAI,EAAC;AAAA,IACnE,GAAI,MAAM,IAAA,KAAS,MAAA,GAAY,EAAE,IAAA,EAAM,KAAA,CAAM,IAAA,EAAK,GAAI;AAAC,GACzD;AACA,EAAA,IAAI;AACF,IAAA,MAAA,CAAO,UAAU,MAAM,CAAA;AAAA,EACzB,SAAS,GAAA,EAAK;AACZ,IAAA,OAAA,CAAQ,KAAA,CAAM,mBAAmB,GAAG,CAAA;AAAA,EACtC;AACA,EAAA,OAAO,MAAA;AACT;AAKA,IAAM,YAAA,GAAe,MAAe,OAAO,WAAA,KAAgB,cAAc,WAAA,CAAY,GAAA,EAAI,GAAI,IAAA,CAAK,GAAA,EAAI;AAEtG,IAAM,WAAW,OACf,MAAA,EACA,IAAA,EACA,KAAA,EACA,OACA,IAAA,KACyB;AACzB,EAAA,MAAM,EAAE,QAAO,GAAI,MAAA;AAGnB,EAAA,IAAIM,mBAAAA,CAAa,IAAI,CAAA,EAAG,OAAO,EAAE,MAAA,EAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,KAAA,EAAO,iBAAA,EAAmB,OAAA,EAASC,mBAAAA,IAAe,EAAE;AAC1G,EAAA,MAAM,MAAA,GAAS,kBAAA,CAAmB,SAAA,CAAU,IAAI,CAAA;AAChD,EAAA,IAAI,CAAC,OAAO,OAAA,EAAS;AACnB,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,GAAA;AAAA,MACR,IAAA,EAAM;AAAA,QACJ,KAAA,EAAO,iBAAA;AAAA,QACP,OAAA,EAAS,OAAO,KAAA,CAAM;AAAA;AACxB,KACF;AAAA,EACF;AAEA,EAAA,MAAM,WAAW,MAAA,CAAO,IAAA,CAAK,UAAU,MAAA,IAAa,MAAA,CAAO,KAAK,KAAA,KAAU,IAAA;AAC1E,EAAA,IAAI,CAAC,QAAA,IAAY,MAAA,CAAO,IAAA,CAAK,gBAAgB,MAAA,EAAW;AACtD,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,GAAA;AAAA,MACR,IAAA,EAAM;AAAA,QACJ,KAAA,EAAO,iBAAA;AAAA,QACP,OAAA,EAAS;AAAA;AACX,KACF;AAAA,EACF;AAIA,EAAA,IAAI,KAAA,KAAU,UAAa,MAAA,CAAO,IAAA,CAAK,gBAAgB,MAAA,EAAW,KAAA,CAAM,WAAA,GAAc,MAAA,CAAO,IAAA,CAAK,WAAA;AAElG,EAAA,IAAI;AAIF,IAAA,IAAI,UAAA;AACJ,IAAA,IAAI,MAAA,CAAO,IAAA,CAAK,WAAA,KAAgB,KAAA,CAAA,EAAW;AACzC,MAAA,MAAM,QAAQ,MAAM,MAAA,CAAO,MAAM,GAAA,CAAI,MAAA,CAAO,KAAK,WAAW,CAAA;AAC5D,MAAA,IAAI,UAAU,KAAA,CAAA,IAAa,KAAA,CAAM,IAAA,KAAS,IAAA,eAAmB,KAAA,CAAM,KAAA;AACnE,MAAA,IAAI,KAAA,KAAU,KAAA,CAAA,IAAa,UAAA,KAAe,KAAA,CAAA,QAAiB,KAAA,GAAQ,UAAA;AACnE,MAAA,IAAI,KAAA,KAAU,KAAA,CAAA,IAAa,KAAA,CAAM,IAAA,KAAS,UAAA,EAAY;AACpD,QAAA,IAAI,UAAU,KAAA,CAAA,EAAW;AACvB,UAAA,KAAA,CAAM,IAAA,GAAO,UAAA;AACb,UAAA,IAAI,KAAA,CAAM,KAAA,KAAU,KAAA,CAAA,EAAW,KAAA,CAAM,QAAQ,KAAA,CAAM,KAAA;AAAA,QACrD;AACA,QAAA,IAAI,MAAA,CAAO,cAAc,KAAA,CAAA,EAAW;AAClC,UAAA,OAAO;AAAA,YACL,MAAA,EAAQ,GAAA;AAAA,YACR,IAAA,EAAM,EAAE,KAAA,EAAO,iBAAA,EAAmB,SAAS,qFAAA;AAAiF,WAC9H;AAAA,QACF;AACA,QAAA,MAAM,MAAA,GAAS,OAAO,SAAA,EAAU;AAChC,QAAA,IAAI,WAAW,KAAA,CAAA,EAAW;AACxB,UAAA,OAAO,EAAE,QAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,KAAA,EAAO,iBAAA,EAAmB,OAAA,EAAS,8BAAA,EAA+B,EAAE;AAAA,QACpG;AAIA,QAAA,IAAI,WAAA,GAAc,OAAO,SAAA,CAAU,MAAA;AACnC,QAAA,IAAI,KAAA,CAAM,UAAU,KAAA,CAAA,EAAW;AAC7B,UAAA,IAAI,MAAA,CAAO,mBAAmB,KAAA,CAAA,EAAW;AACvC,YAAA,OAAO;AAAA,cACL,MAAA,EAAQ,GAAA;AAAA,cACR,IAAA,EAAM;AAAA,gBACJ,KAAA,EAAO,iBAAA;AAAA,gBACP,OAAA,EAAS,UAAU,MAAA,CAAO,IAAA,CAAK,eAAe,EAAE,CAAA,kBAAA,EAAqB,MAAM,KAAK,CAAA,yCAAA;AAAA;AAClF,aACF;AAAA,UACF;AACA,UAAA,MAAM,QAAA,GAAW,MAAM,MAAA,CAAO,cAAA,CAAe,MAAM,KAAK,CAAA;AACxD,UAAA,IAAI,aAAa,KAAA,CAAA,EAAW;AAC1B,YAAA,OAAO;AAAA,cACL,MAAA,EAAQ,GAAA;AAAA,cACR,IAAA,EAAM,EAAE,KAAA,EAAO,cAAA,EAAgB,SAAS,CAAA,OAAA,EAAU,KAAA,CAAM,KAAK,CAAA,qCAAA,CAAA;AAAwC,aACvG;AAAA,UACF;AACA,UAAA,WAAA,GAAc,QAAA;AAAA,QAChB;AAEA,QAAA,MAAM,SAAS,MAAM,aAAA,CAAc,OAAO,SAAA,CAAU,MAAA,EAAQ,MAAM,QAAA,EAAU;AAAA,UAC1E,OAAA,EAAS,OAAO,IAAA,CAAK,OAAA;AAAA,UACrB,KAAA;AAAA,UACA,MAAA,EAAQ,WAAA;AAAA,UACR;AAAA,SACD,CAAA;AACD,QAAA,MAAM,OAAO,MAAA,CAAO,OAAA,CAAQ,CAAC,CAAA,KAAM,EAAE,IAAI,CAAA;AAMzC,QAAA,MAAA,CAAO,UAAA,CAAW,eAAA,CAAgB,MAAA,EAAQ,MAAM,CAAC,CAAA;AAIjD,QAAA,IAAI,MAAA,CAAO,SAAA,CAAU,OAAA,KAAY,KAAA,CAAA,EAAW;AAC1C,UAAA,IAAI;AACF,YAAA,MAAA,CAAO,SAAA,CAAU,QAAQ,EAAE,WAAA,EAAa,OAAO,IAAA,CAAK,WAAA,EAAa,MAAA,EAAQ,KAAA,EAAO,CAAA;AAAA,UAClF,SAAS,GAAA,EAAK;AACZ,YAAA,OAAA,CAAQ,KAAA,CAAM,iBAAiB,GAAG,CAAA;AAAA,UACpC;AAAA,QACF;AAIA,QAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,QAAA,IAAI,WAAW,KAAA,EAAO,GAAG,CAAA,EAAG,aAAA,CAAc,OAAO,KAAA,CAAM,GAAA,CAAI,MAAA,CAAO,IAAA,CAAK,aAAa,EAAE,GAAG,OAAO,UAAA,EAAY,GAAA,EAAK,CAAC,CAAA;AAClH,QAAA,IAAI,KAAA,KAAU,KAAA,CAAA,EAAW,KAAA,CAAM,IAAA,GAAO,IAAA,CAAK,MAAA;AAG3C,QAAA,OAAO,EAAE,MAAA,EAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,MAAA,EAAQ,IAAA,CAAK,MAAA,KAAW,CAAA,GAAI,IAAA,CAAK,CAAC,CAAA,GAAI,MAAK,EAAE;AAAA,MAC7E;AAAA,IACF;AAYA,IAAA,IAAI,aAAa,MAAA,CAAO,WAAA;AACxB,IAAA,IAAI,eAAe,KAAA,CAAA,EAAW;AAC5B,MAAA,IAAI,MAAA,CAAO,mBAAmB,KAAA,CAAA,EAAW;AACvC,QAAA,OAAO;AAAA,UACL,MAAA,EAAQ,GAAA;AAAA,UACR,IAAA,EAAM;AAAA,YACJ,KAAA,EAAO,iBAAA;AAAA,YACP,SAAS,CAAA,OAAA,EAAU,MAAA,CAAO,KAAK,WAAA,IAAe,EAAE,qBAAqB,UAAU,CAAA,yCAAA;AAAA;AACjF,SACF;AAAA,MACF;AACA,MAAA,UAAA,GAAa,MAAM,MAAA,CAAO,cAAA,CAAe,UAAU,CAAA;AACnD,MAAA,IAAI,eAAe,KAAA,CAAA,EAAW;AAC5B,QAAA,OAAO;AAAA,UACL,MAAA,EAAQ,GAAA;AAAA,UACR,MAAM,EAAE,KAAA,EAAO,gBAAgB,OAAA,EAAS,CAAA,OAAA,EAAU,UAAU,CAAA,qCAAA,CAAA;AAAwC,SACtG;AAAA,MACF;AAAA,IACF;AAEA,IAAA,MAAM,QAAA,GAAW,MAAM,MAAA,CAAO,OAAA,CAAQ,OAAO,IAAA,EAAM;AAAA,MACjD,KAAA;AAAA,MACA,UAAU,MAAA,CAAO,QAAA;AAAA,MACjB,GAAI,OAAO,MAAA,KAAW,IAAA,GAAO,EAAE,MAAA,EAAQ,IAAA,KAAS,EAAC;AAAA,MACjD,GAAI,UAAA,KAAe,KAAA,CAAA,GAAY,EAAE,WAAA,EAAa,UAAA,KAAe,EAAC;AAAA,MAC9D,GAAI,IAAA,KAAS,KAAA,CAAA,GAAY,EAAE,MAAA,EAAQ,IAAA,CAAK,MAAA,EAAQ,QAAA,EAAU,IAAA,CAAK,QAAA,EAAS,GAAI;AAAC,KAC9E,CAAA;AACD,IAAA,IAAI,UAAU,KAAA,CAAA,EAAW;AACvB,MAAA,KAAA,CAAM,QAAA,GAAW,QAAA,CAAS,IAAA,CAAK,KAAA,CAAM,GAAA;AAGrC,MAAA,IAAI,QAAA,CAAS,KAAK,KAAA,CAAM,WAAA,KAAgB,QAAW,KAAA,CAAM,WAAA,GAAc,QAAA,CAAS,IAAA,CAAK,KAAA,CAAM,WAAA;AAC3F,MAAA,KAAA,CAAM,IAAA,GAAO,MAAA,CAAO,QAAA,CAAS,MAAM,CAAA;AAAA,IACrC;AACA,IAAA,OAAO,EAAE,MAAA,EAAQ,GAAA,EAAK,IAAA,EAAM,QAAA,EAAS;AAAA,EACvC,SAAS,GAAA,EAAK;AAIZ,IAAA,IAAI,GAAA,YAAe,QAAA,IAAY,GAAA,CAAI,IAAA,KAAS,eAAA,EAAiB;AAC3D,MAAA,OAAA,CAAQ,KAAA,CAAM,mDAAA,EAAqD,GAAA,CAAI,OAAO,CAAA;AAC9E,MAAA,OAAO,EAAE,QAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,KAAA,EAAO,eAAA,EAAiB,OAAA,EAAS,yDAAA,EAA0D,EAAE;AAAA,IAC7H;AACA,IAAA,IAAI,eAAe,QAAA,EAAU;AAC3B,MAAA,MAAM,MAAA,GAAS,IAAI,IAAA,KAAS,uBAAA,GAA0B,MAAM,GAAA,CAAI,IAAA,KAAS,eAAe,GAAA,GAAM,GAAA;AAC9F,MAAA,OAAO;AAAA,QACL,MAAA;AAAA,QACA,IAAA,EAAM;AAAA,UACJ,OAAO,GAAA,CAAI,IAAA;AAAA,UACX,SAAS,GAAA,CAAI,OAAA;AAAA,UACb,SAAS,GAAA,CAAI;AAAA;AACf,OACF;AAAA,IACF;AACA,IAAA,OAAA,CAAQ,KAAA,CAAM,0BAA0B,GAAG,CAAA;AAC3C,IAAA,MAAM,MAAA,GAAS,GAAA;AACf,IAAA,MAAM,OAAA,GAAU,GAAA,YAAe,KAAA,GAC3B,GAAA,CAAI,OAAA,GACH,OAAO,MAAA,EAAQ,OAAA,KAAY,QAAA,GAAW,MAAA,CAAO,OAAA,GAAU,eAAA;AAC5D,IAAA,MAAM,OAAO,OAAO,MAAA,EAAQ,IAAA,KAAS,QAAA,GAAW,OAAO,IAAA,GAAO,iBAAA;AAC9D,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,GAAA;AAAA,MACR,IAAA,EAAM,EAAE,KAAA,EAAO,IAAA,EAAM,OAAA;AAAQ,KAC/B;AAAA,EACF;AACF,CAAA;AAOO,IAAM,sBAAA,GAAyB,OACpC,MAAA,EACA,WAAA,EACA,KAAA,KACyB;AACzB,EAAA,IAAI,MAAA,CAAO,WAAW,IAAA,EAAM;AAC1B,IAAA,OAAO,EAAE,QAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,KAAA,EAAO,QAAA,EAAU,OAAA,EAAS,qEAAA,EAAiE,EAAE;AAAA,EAC7H;AACA,EAAA,MAAM,QAAQ,MAAM,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,IAAI,WAAW,CAAA;AACvD,EAAA,IAAI,UAAU,MAAA,IAAc,KAAA,CAAM,SAAS,IAAA,IAAQ,KAAA,CAAM,SAAS,UAAA,EAAa;AAC7E,IAAA,OAAO,EAAE,MAAA,EAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,KAAA,EAAO,YAAA,EAAc,OAAA,EAAS,CAAA,qBAAA,EAAwB,WAAW,CAAA,CAAA,CAAA,EAAI,EAAE;AAAA,EACvG;AACA,EAAA,IAAI,OAAO,KAAA,CAAM,SAAA,KAAc,SAAA,EAAW;AACxC,IAAA,OAAO,EAAE,QAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,KAAA,EAAO,iBAAA,EAAmB,OAAA,EAAS,qCAAA,EAAsC,EAAE;AAAA,EAC3G;AACA,EAAA,MAAM,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,GAAA,CAAI,WAAA,EAAa,EAAE,GAAG,KAAA,EAAO,SAAA,EAAW,KAAA,CAAM,SAAA,EAAW,CAAA;AACnF,EAAA,OAAO,EAAE,QAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,WAAA,EAAa,SAAA,EAAW,KAAA,CAAM,SAAA,EAAU,EAAE;AAC1E;AAEO,IAAM,uBAAA,GAA0B,OACrC,MAAA,EACA,WAAA,KACyB;AACzB,EAAA,IAAI,MAAA,CAAO,WAAW,IAAA,EAAM;AAC1B,IAAA,OAAO,EAAE,QAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,KAAA,EAAO,QAAA,EAAU,OAAA,EAAS,qEAAA,EAAiE,EAAE;AAAA,EAC7H;AACA,EAAA,MAAM,QAAQ,MAAM,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,IAAI,WAAW,CAAA;AACvD,EAAA,IAAI,UAAU,MAAA,EAAW;AACvB,IAAA,OAAO,EAAE,MAAA,EAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,KAAA,EAAO,YAAA,EAAc,OAAA,EAAS,CAAA,qBAAA,EAAwB,WAAW,CAAA,CAAA,CAAA,EAAI,EAAE;AAAA,EACvG;AACA,EAAA,IAAA,CAAK,KAAA,CAAM,SAAS,IAAA,IAAQ,KAAA,CAAM,SAAS,UAAA,KAAe,KAAA,CAAM,cAAc,IAAA,EAAM;AAClF,IAAA,OAAO,EAAE,MAAA,EAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,KAAA,EAAO,uBAAA,EAAyB,OAAA,EAAS,CAAA,CAAA,EAAI,WAAW,CAAA,yCAAA,CAAA,EAAuC,EAAE;AAAA,EACjI;AACA,EAAA,MAAM,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,MAAA,CAAO,WAAW,CAAA;AAC5C,EAAA,OAAO,EAAE,QAAQ,GAAA,EAAK,IAAA,EAAM,EAAE,WAAA,EAAa,OAAA,EAAS,MAAK,EAAE;AAC7D","file":"index.cjs","sourcesContent":["import { z } from 'zod';\nimport type { JsonValue } from '@niscorp/prism';\n\n// Context keys the engine consumes directly (for ORDER BY) instead of binding as\n// SQL parameters. A `{ $context: 'sortBy' }` ref is rejected at compile so these\n// can never reach the param path.\nexport const RESERVED_CONTEXT_KEYS = new Set<string>(['sortBy', 'sortDir']);\n\nexport const ContextSchema = z\n .object({\n sortBy: z.string().optional(),\n sortDir: z.enum(['asc', 'desc']).optional(),\n })\n .catchall(z.unknown())\n .describe(\n 'Caller runtime values. Keys referenced from the DSL via { $context: \"key\" } are bound as SQL parameters. `sortBy` (an entity.field, schema-validated) and `sortDir` (\"asc\"|\"desc\") are reserved keys that drive ORDER BY directly and are never bound as parameters.',\n );\n\nexport const QueryRequestSchema = z.object({\n // The ONE cache identity. Server-minted (`fp_…`) when absent — returned in\n // meta.cache.fingerprint, an immutable pin. Caller-chosen strings are\n // mutable named slots: the name is yours, its content follows your request.\n // Alone → replay-or-error. With intent/shape → hit when the stored request\n // matches, regenerate-and-replace when it differs (409 when protected).\n fingerprint: z.string().min(1).optional(),\n intent: z.string().optional(),\n shape: z.unknown().optional(),\n context: ContextSchema.default({}),\n});\n\nexport type QueryRequest = z.infer<typeof QueryRequestSchema>;\n\nexport type CacheMeta = {\n hit: boolean;\n // The entry's identity — minted (`fp_…`) or the caller's own name.\n fingerprint?: string;\n // True when this execution regenerated and REPLACED a named slot whose\n // stored request no longer matched.\n replaced?: boolean;\n // The intent stored with the cached query (on a hit) or the request's own intent\n // (on a miss) — descriptive only, so a caller can see what the query is for.\n intent?: string;\n};\n\nexport type TimingMeta = {\n agentMs?: number;\n executionMs: number;\n mappingMs?: number;\n transformMs?: number;\n};\n\nexport type ContextMeta = {\n // Mirrors ParamSlot['type'] (adapters/adapter.types.ts) — the contract a\n // caller reads is built from the slots the compiler bound, one for one.\n // Absent on a key that is optional and was not supplied: nothing bound it\n // this run, so there is no slot to read a type off.\n type?: 'string' | 'number' | 'boolean' | 'string[]' | 'number[]' | 'json';\n kind: 'context' | 'scope' | 'semantic';\n // True when the key controls an `optional` condition — supply it and the\n // condition applies, omit it and the condition is not in the query. DERIVED\n // from the stored DSL rather than declared beside it, for the same reason\n // mutation signatures are (see \"Derived context signatures\" in DOCS.md): a\n // contract somebody maintains by hand is a contract that eventually lies.\n optional?: true;\n // True when this run did not supply the key, so its condition was pruned.\n // The key is still published — that is the point of listing it — so a caller\n // can discover what a fingerprint accepts without failing a request first.\n absent?: true;\n};\n\nexport type QueryResponse = {\n // Whatever the Prism mapping produced over the full row set: an array (the\n // common case — a `$map` or identity over `$.result`), a single object (a\n // detail picking `$.result[0]`), or a scalar (an aggregate). Vex no longer\n // forces an array — the mapping owns the output shape.\n result: JsonValue;\n meta: {\n cache: CacheMeta;\n context: Record<string, ContextMeta>;\n timing?: TimingMeta;\n warnings?: string[];\n missingContext?: string[];\n };\n};\n\nexport type QueryErrorResponse = {\n error: string;\n message: string;\n details?: {\n suggestion?: string;\n options?: string[];\n };\n};\n\nexport type QueryErrorCode =\n | 'invalid_request'\n | 'invalid_dsl'\n | 'missing_scope'\n | 'scope_denied'\n | 'missing_context'\n | 'execution_error'\n | 'agent_failed'\n | 'cache_miss'\n | 'fingerprint_protected'\n | 'locked'\n | 'unsatisfiable';\n","import { z } from 'zod';\n\nexport const ContextRefSchema = z\n .object({\n $context: z.string().describe('Key to look up in the request context object'),\n })\n .strict()\n .describe('Reference to a caller-provided context value');\n\nexport const ScopeRefSchema = z\n .object({\n $scope: z.string().describe('Key to look up in the server-side scope values'),\n })\n .strict()\n .describe('Reference to a server-injected scope value (access control)');\n\nexport const FieldOrValueSchema = z\n .union([\n z.string().describe('A field path (entity.field format) or a literal string'),\n z.number().describe('A literal number'),\n z.boolean().describe('A literal boolean'),\n z.null().describe('A literal null'),\n ContextRefSchema,\n ScopeRefSchema,\n ])\n .describe('A field path, literal value, or dynamic reference');\n\nexport type ContextRef = z.infer<typeof ContextRefSchema>;\nexport type ScopeRef = z.infer<typeof ScopeRefSchema>;\nexport type FieldOrValue = z.infer<typeof FieldOrValueSchema>;\n","import { z } from 'zod';\n\n// ═══════════════════════════════════════════════════════════════\n// THE NAMES A QUERY MAY SAY — and the one rule for telling them apart.\n//\n// Every string an author (a person, a seed, a model) puts in a NAME position\n// ends up in SQL text: a column reference, an output alias, a subquery alias.\n// Values never do — they bind as parameters or are quoted as literals. So a\n// name is the only place authored text meets the statement, and it is held to\n// a grammar that cannot carry anything but a name: letters, digits and\n// underscores, not starting with a digit.\n//\n// This is the parse-time half. The resolver checks the same predicates again,\n// because `engine.compile()` and `engine.test()` take a DSL that never went\n// through Zod, and the compiler refuses to emit a field position that did not\n// resolve against the introspected schema. Three layers, one grammar.\n//\n// `isFieldPathShape` is also what decides, in a value position, whether a\n// string is a column or a literal. It used to be \"contains a dot\", which made\n// every email address an unknown entity and every string with a dot a column\n// reference — so a literal like \"u1@x.com\" threw, and a string that merely\n// looked dotted went to SQL as a name. Now a column is exactly `ident.ident`,\n// and everything else is a literal.\n// ═══════════════════════════════════════════════════════════════\n\nconst IDENTIFIER = /^[A-Za-z_][A-Za-z0-9_]*$/;\nconst FIELD_PATH = /^[A-Za-z_][A-Za-z0-9_]*\\.[A-Za-z_][A-Za-z0-9_]*$/;\n\nexport const isIdentifier = (value: string): boolean => IDENTIFIER.test(value);\n\nexport const isFieldPathShape = (value: unknown): value is string => typeof value === 'string' && FIELD_PATH.test(value);\n\nexport const IdentifierSchema = z\n .string()\n .regex(IDENTIFIER, 'A name is letters, digits and underscores, not starting with a digit');\n\nexport const FieldPathSchema = z\n .string()\n .regex(FIELD_PATH, 'A field path is entity.field — each part letters, digits and underscores, not starting with a digit');\n","import { z } from 'zod';\nimport { ContextRefSchema, ScopeRefSchema, FieldOrValueSchema } from './value.schema.js';\nimport { FieldPathSchema } from './identifier.schema.js';\nimport type { ContextRef, ScopeRef, FieldOrValue } from './value.schema.js';\n\n// EXISTS — \"is there a row over there that points back at this one\".\n//\n// It is the same `{ from, filter }` a query already is, and deliberately no\n// more than that: no fields, no sort, no limit, nothing to select. EXISTS asks\n// whether a row is there, so anything that shapes output would be noise the\n// planner discards, and refusing it is what keeps this an operator rather than\n// an invitation to nest arbitrary SQL.\n//\n// The CORRELATION needs no new vocabulary. A dotted string on either side of a\n// comparison is already a field path, so pointing the inner table at the outer\n// one is an ordinary `eq` between two columns:\n//\n// { exists: { from: ['tasks'], filter: { eq: ['tasks.issue_id', 'issues.id'] } } }\n//\n// and `not` composes for NOT EXISTS. Whoever writes SQL writes this on the\n// first try, which is the entire design goal.\nexport type ExistsQuery = {\n from: string[];\n filter?: Filter;\n};\n\nexport type Filter =\n | { exists: ExistsQuery }\n | { eq: [FieldOrValue, FieldOrValue] }\n | { neq: [FieldOrValue, FieldOrValue] }\n | { gt: [FieldOrValue, FieldOrValue] }\n | { gte: [FieldOrValue, FieldOrValue] }\n | { lt: [FieldOrValue, FieldOrValue] }\n | { lte: [FieldOrValue, FieldOrValue] }\n | { in: [string, FieldOrValue[] | ContextRef | ScopeRef] }\n | { notIn: [string, FieldOrValue[] | ContextRef | ScopeRef] }\n | { like: [string, FieldOrValue] }\n | { ilike: [string, FieldOrValue] }\n | { isNull: string }\n | { isNotNull: string }\n | { and: Filter[] }\n | { or: Filter[] }\n | { not: Filter }\n | { semantic: { field: string; query: ContextRef | ScopeRef; minScore?: number } }\n | { fuzzy: { field: string; query: ContextRef | ScopeRef; maxDistance?: number } }\n | { optional: { key: string | string[]; then: Filter } };\n\nconst comparisonPair = z\n .tuple([FieldOrValueSchema, FieldOrValueSchema])\n .describe('[left, right] — both can be field paths, literals, or references');\n\nconst fieldString = FieldPathSchema.describe('Field path in entity.field format');\n\nconst collectionTarget = z\n .union([\n z.array(FieldOrValueSchema).min(1).describe('Array of literal values or references'),\n ContextRefSchema,\n ScopeRefSchema,\n ])\n .describe('A set of values or a reference that resolves to an array');\n\nconst ExistsSchema: z.ZodType<ExistsQuery> = z.lazy(() =>\n z\n .object({\n from: z.array(z.string()).min(1).describe('Entities the subquery reads. Joined by foreign key like any other from.'),\n filter: FilterSchema.optional().describe('The correlation, and any extra condition. Reference the outer query by its own entity path: { eq: [\"<inner>.<fk>\", \"<outer>.id\"] }.'),\n })\n .strict(),\n);\n\nexport const FilterSchema: z.ZodType<Filter> = z.lazy(() =>\n z.union([\n z.object({ exists: ExistsSchema }).strict().describe('EXISTS: true when the subquery matches at least one row. Wrap in `not` for NOT EXISTS.'),\n z.object({ eq: comparisonPair }).strict().describe('Equals: tests equality between two values'),\n z.object({ neq: comparisonPair }).strict().describe('Not equals'),\n z.object({ gt: comparisonPair }).strict().describe('Greater than'),\n z.object({ gte: comparisonPair }).strict().describe('Greater than or equal'),\n z.object({ lt: comparisonPair }).strict().describe('Less than'),\n z.object({ lte: comparisonPair }).strict().describe('Less than or equal'),\n z.object({ in: z.tuple([fieldString, collectionTarget]) }).strict().describe('Field value is in a set'),\n z.object({ notIn: z.tuple([fieldString, collectionTarget]) }).strict().describe('Field value is not in a set'),\n z.object({ like: z.tuple([fieldString, FieldOrValueSchema]) }).strict().describe('Case-sensitive LIKE pattern match (use % as wildcard)'),\n z.object({ ilike: z.tuple([fieldString, FieldOrValueSchema]) }).strict().describe('Case-insensitive ILIKE pattern match (use % as wildcard)'),\n z.object({ isNull: fieldString }).strict().describe('Field value is NULL'),\n z.object({ isNotNull: fieldString }).strict().describe('Field value is NOT NULL'),\n z.object({ and: z.array(FilterSchema).min(2) }).strict().describe('Logical AND: all conditions must be true'),\n z.object({ or: z.array(FilterSchema).min(2) }).strict().describe('Logical OR: at least one condition must be true'),\n z.object({ not: FilterSchema }).strict().describe('Logical NOT: negates the condition'),\n z.object({\n semantic: z.object({\n field: FieldPathSchema.describe('Vector column field path (entity.field)'),\n query: z.union([ContextRefSchema, ScopeRefSchema]).describe('Text to embed and compare'),\n minScore: z.number().min(0).max(1).optional().describe('Minimum cosine similarity (0–1)'),\n }).strict(),\n }).strict().describe('Semantic vector similarity search'),\n z.object({\n fuzzy: z.object({\n field: FieldPathSchema.describe('String field path'),\n query: z.union([ContextRefSchema, ScopeRefSchema]).describe('Text to fuzzy-match'),\n maxDistance: z.number().int().nonnegative().optional().describe('Maximum Levenshtein edit distance'),\n }).strict(),\n }).strict().describe('Fuzzy string match'),\n z.object({\n optional: z.object({\n key: z.union([z.string().min(1), z.array(z.string().min(1)).min(1)])\n .describe('The context key this condition depends on, or EVERY key it depends on. A condition referencing two keys must name both — gating on one leaves the other conditionally required, which surfaces as an empty result rather than as a condition that did not apply.'),\n // BARE, never `.describe()`d. That call CLONES the schema, and zod\n // detects a recursive reference by instance identity — a clone is a\n // different instance, so `to-json-schema` stops seeing the cycle and\n // expands the filter union into itself until the stack goes. Every\n // other recursive slot here (`not`, `and`, `or`) uses it bare for the\n // same reason; the description belongs on the wrapper below.\n then: FilterSchema,\n }).strict(),\n }).strict().describe(\n 'A condition the caller turns on by supplying context keys. When any named key is absent the condition is REMOVED from the query before it compiles — it does not match everything, it is not there. Absent means missing, undefined or null; \"\" is a value and keeps the condition. Direction follows position: under `and` supplying the key NARROWS, under `or` it WIDENS. Either way an absent key reads exactly as if the condition had never been written, and scope is injected afterwards regardless. Reads only: a mutation may not contain one, and neither may the inside of an `exists` (its correlation must be unconditional).',\n ),\n ]),\n);\n","import { z } from 'zod';\nimport { FieldOrValueSchema } from './value.schema.js';\nimport { FilterSchema } from './filter.schema.js';\n\nconst CaseWhenSchema = z\n .object({\n condition: FilterSchema,\n then: FieldOrValueSchema.describe('Value when condition is true'),\n })\n .strict();\n\nexport const ComputeExpressionSchema = z\n .union([\n z.object({ add: z.tuple([FieldOrValueSchema, FieldOrValueSchema]) }).strict().describe('Addition: a + b'),\n z.object({ subtract: z.tuple([FieldOrValueSchema, FieldOrValueSchema]) }).strict().describe('Subtraction: a - b'),\n z.object({ multiply: z.tuple([FieldOrValueSchema, FieldOrValueSchema]) }).strict().describe('Multiplication: a * b'),\n z.object({ divide: z.tuple([FieldOrValueSchema, FieldOrValueSchema]) }).strict().describe('Division: a / b'),\n z.object({ concat: z.array(FieldOrValueSchema).min(2) }).strict().describe('String concatenation'),\n z.object({ coalesce: z.array(FieldOrValueSchema).min(2) }).strict().describe('Returns first non-null value'),\n z.object({\n case: z\n .object({\n when: z.array(CaseWhenSchema).min(1).describe('Condition/result pairs evaluated in order'),\n else: FieldOrValueSchema.describe('Default value when no condition matches'),\n })\n .strict(),\n }).strict().describe('CASE WHEN conditional expression'),\n ])\n .describe('Computed expression: arithmetic, string, or conditional');\n\nexport type ComputeExpression = z.infer<typeof ComputeExpressionSchema>;\n","import { z } from 'zod';\nimport { ComputeExpressionSchema } from './compute.schema.js';\nimport { FieldPathSchema } from './identifier.schema.js';\n\nconst fieldPath = FieldPathSchema.describe('Field path in entity.field format');\n\n// SUM/AVG/MIN/MAX take either a field path or a compute expression — so the\n// argument can be a derived value (e.g. SUM(value * win_probability / 100)),\n// not just a column. A bare string stays valid (non-breaking).\nconst fieldOrExpr = z.union([fieldPath, ComputeExpressionSchema]).describe('A field path or a compute expression');\n\nexport const AggregateExpressionSchema = z\n .union([\n z.object({ count: z.union([FieldPathSchema, z.literal('*')]).describe('Field path or \"*\" for COUNT(*)') }).strict().describe('COUNT'),\n z.object({ countDistinct: FieldPathSchema.describe('Field path whose distinct non-null values are counted') }).strict().describe('COUNT(DISTINCT field)'),\n z.object({ sum: fieldOrExpr }).strict().describe('SUM'),\n z.object({ avg: fieldOrExpr }).strict().describe('AVG'),\n z.object({ min: fieldOrExpr }).strict().describe('MIN'),\n z.object({ max: fieldOrExpr }).strict().describe('MAX'),\n ])\n .describe('Aggregate function applied to a field or expression');\n\nexport type AggregateExpression = z.infer<typeof AggregateExpressionSchema>;\n","import { z } from 'zod';\nimport { FilterSchema } from './filter.schema.js';\nimport { ComputeExpressionSchema } from './compute.schema.js';\nimport { AggregateExpressionSchema } from './aggregate.schema.js';\nimport { FieldPathSchema, IdentifierSchema } from './identifier.schema.js';\nimport type { Filter } from './filter.schema.js';\nimport type { ComputeExpression } from './compute.schema.js';\nimport type { AggregateExpression } from './aggregate.schema.js';\n\nexport const SortEntrySchema = z\n .object({\n field: z.union([FieldPathSchema, IdentifierSchema]).describe('Field path (entity.field), computed field name, or aggregate alias'),\n dir: z.enum(['asc', 'desc']).default('asc').describe('Sort direction'),\n })\n .strict()\n .describe('Sort specification');\n\nexport type SortEntry = z.infer<typeof SortEntrySchema>;\n\nexport type Source = string | { as: string; query: Query };\n\n// A selected field: a bare `entity.field` path, or an aliased one whose output\n// key is `as` (so joined columns that would collide — three `name`s — get\n// distinct keys without a compute hack).\nexport type FieldRef = string | { field: string; as: string };\n\nexport type Query = {\n from: Source[];\n // Optional: a query may select only aggregates (e.g. a bare `COUNT(*)`); the\n // schema requires at least one of `fields` / `aggregate`.\n fields?: FieldRef[];\n filter?: Filter;\n compute?: Record<string, ComputeExpression>;\n aggregate?: Record<string, AggregateExpression>;\n groupBy?: string[];\n sort?: SortEntry[];\n limit?: number;\n distinct?: boolean;\n};\n\nconst SubquerySourceSchema = z\n .object({\n as: IdentifierSchema.describe('Alias for subquery results — use as prefix in field paths'),\n query: z.lazy((): z.ZodType<Query> => QuerySchema).describe('A nested query'),\n })\n .strict()\n .describe('Subquery data source: a nested query read as a table under `as`, its columns referenced as `<as>.<field>` anywhere in the outer query. Joined by foreign key like an entity when one links them; otherwise every outer row is paired with every subquery row (a cross join), so a one-row subquery puts its values beside each outer row.');\n\nconst SourceSchema = z\n .union([\n z.string().describe('Entity name from the database schema'),\n SubquerySourceSchema,\n ])\n .describe('Data source: entity name or subquery');\n\nconst FieldRefSchema = z\n .union([\n FieldPathSchema.describe('A column in entity.field format'),\n z\n .object({\n field: FieldPathSchema.describe('A column in entity.field format'),\n as: IdentifierSchema.describe('Output key for this column'),\n })\n .strict()\n .describe('An aliased column: output under `as` instead of the column name'),\n ])\n .describe('A selected field — a bare `entity.field`, or `{ field, as }` to alias the output key');\n\nexport const QuerySchema: z.ZodType<Query> = z.lazy(() =>\n z\n .object({\n from: z.array(SourceSchema).min(1).describe('Data sources — entity names or subqueries. Every entity used anywhere in the query must be listed here. Listed entities are JOINED FOR YOU along their foreign keys — a nullable key as a LEFT JOIN, so a row whose key is empty is kept, with the joined columns null. Never restate a join as a filter comparing the two keys: that throws those rows away.'),\n fields: z.array(FieldRefSchema).optional().describe('Raw columns to select — each `entity.field`, or `{ field, as }` to alias the output key (no SELECT *). Optional: omit it for an aggregate-only query (e.g. a bare COUNT). Do not list compute or aggregate aliases here — those are added automatically.'),\n filter: FilterSchema.optional().describe('Filter conditions'),\n compute: z.record(IdentifierSchema, ComputeExpressionSchema).optional().describe('Computed fields — key is output alias, value is the expression'),\n aggregate: z.record(IdentifierSchema, AggregateExpressionSchema).optional().describe('Aggregate functions — key is output alias, value is the function'),\n groupBy: z.array(FieldPathSchema).optional().describe('Fields to group by for aggregation'),\n sort: z.array(SortEntrySchema).optional().describe('Sort order'),\n limit: z.number().int().positive().optional().describe('Maximum rows to return'),\n distinct: z.boolean().optional().describe('Eliminate duplicate rows'),\n })\n .strict()\n .refine(\n (q) => (q.fields?.length ?? 0) > 0 || Object.keys(q.aggregate ?? {}).length > 0,\n { message: 'A query must select at least one of `fields` or `aggregate`.' },\n ),\n);\n\nexport { SubquerySourceSchema, SourceSchema };\n","import type { QueryErrorCode } from './schemas/request.schema.js';\n\nexport class VexError extends Error {\n readonly code: QueryErrorCode;\n readonly details?: Record<string, unknown>;\n\n constructor(code: QueryErrorCode, message: string, details?: Record<string, unknown>) {\n super(message);\n this.name = 'VexError';\n this.code = code;\n this.details = details;\n }\n}\n","import type { Query, Source } from '../schemas/query.schema.js';\nimport type { Filter } from '../schemas/filter.schema.js';\nimport { VexError } from '../errors.js';\n\n// ═══════════════════════════════════════════════════════════════\n// OPTIONAL CONDITIONS — resolved BEFORE the pipeline, never inside it.\n//\n// `{ optional: { key, then } }` is the one thing a caller can do to the SHAPE\n// of a query rather than to its values: supply the key and the condition is\n// there, omit it and the condition is gone. That is what makes one entry able\n// to answer \"everybody\", \"everybody matching a search\", and \"one person by id\"\n// — questions that were three entries because every `$context` ref was\n// mandatory (`executor.ts` findMissingContext).\n//\n// It is a DSL→DSL rewrite, run at the same point as `applySortContext`, and\n// that placement is the whole safety argument. The resolver, the compiler and\n// the scope walker never see this node. They cannot: by the time any of them\n// runs, every optional has already become either its condition or nothing at\n// all. So there is no third walker to teach, and — crucially — no way for an\n// entity to enter the query AFTER `discoverEntities` has decided what to scope.\n// All three throw if they ever meet one, so a future caller that reaches past\n// this pass gets an error rather than an unscoped read.\n//\n// WHAT IS DELIBERATELY NOT DONE HERE: the joins stay. `from` is untouched when\n// a condition drops, so which keys a caller sends can never change the row\n// multiplicity of the result — only how many rows survive the WHERE. A pruned\n// query is the same query with fewer conditions, never a differently-shaped one.\n// ═══════════════════════════════════════════════════════════════\n\n/** The keys one optional gate names — one, or all of several. A condition that\n * reads two context values depends on BOTH, and gating it on one would leave\n * the other conditionally required: supply `after` without `afterId` and the\n * clause survives with a hole in it, which surfaces as an empty result and\n * `missingContext`, not as a condition that quietly did not apply. On a paging\n * cursor an empty result reads as \"end of list\", which is the wrong answer\n * arrived at silently. */\nconst gateKeys = (key: string | string[]): string[] => (Array.isArray(key) ? key : [key]);\n\n/** Every optional key mentioned anywhere in a query, in declaration order. */\nexport const optionalKeysOf = (dsl: Query): string[] => {\n const keys: string[] = [];\n const walk = (filter: Filter): void => {\n if ('optional' in filter) {\n for (const key of gateKeys(filter.optional.key)) {\n if (!keys.includes(key)) keys.push(key);\n }\n walk(filter.optional.then);\n return;\n }\n if ('and' in filter) { for (const sub of filter.and) walk(sub); return; }\n if ('or' in filter) { for (const sub of filter.or) walk(sub); return; }\n if ('not' in filter) { walk(filter.not); return; }\n };\n if (dsl.filter !== undefined) walk(dsl.filter);\n for (const source of dsl.from) {\n if (typeof source !== 'string') keys.push(...optionalKeysOf(source.query).filter((k) => !keys.includes(k)));\n }\n return keys;\n};\n\n/** Which context keys the caller actually supplied.\n *\n * ABSENT MEANS MISSING, `undefined`, OR `null`. The empty string is a value —\n * searching for `''` is a real search — but null is not, for two reasons that\n * agree:\n *\n * · SQL. A bound null in a comparison can never match: `col = NULL` and\n * `col ILIKE NULL` are both NULL, never true. So \"send null\" could only ever\n * have meant \"I have nothing\", and vex already has `isNull`/`isNotNull` for\n * the question people actually mean by it. Nothing is lost.\n *\n * · The wire. JSON has no `undefined`, and a request prism assembles a fixed\n * object — it cannot conditionally omit a key. Without null counting as\n * absent, every caller with an empty search box would have to bind a\n * sentinel again, which is the exact thing this feature removes.\n *\n * This is deliberately WIDER than `findMissingContext`'s test, which stays on\n * `undefined` alone. A required key sent as null still binds null and matches\n * nothing; an optional key sent as null drops its condition. That reads like a\n * contradiction and is not: the author chose which keys are optional, and for\n * those they have already said absence means \"this does not apply\". A caller\n * gains nothing by it either — omitting the key does the same thing, and scope\n * is injected after this either way. */\nexport const presenceOf = (context: Record<string, unknown>): ReadonlySet<string> => {\n const present = new Set<string>();\n for (const [key, value] of Object.entries(context)) {\n if (value !== undefined && value !== null) present.add(key);\n }\n return present;\n};\n\n/** A stable name for \"which optionals were live on this run\" — used to report\n * how many distinct shapes one entry is being asked for. `all` is the compile\n * and test path, where there is no caller. */\nexport const presenceSignature = (dsl: Query, present: ReadonlySet<string> | 'all'): string => {\n const keys = optionalKeysOf(dsl);\n if (keys.length === 0) return '';\n if (present === 'all') return keys.join(',');\n return keys.filter((k) => present.has(k)).join(',');\n};\n\n// `undefined` means THIS NODE IS GONE — not \"false\", not \"true\". The caller of\n// each recursion decides what its absence means in context, which is the only\n// way `and` (identity true) and `or` (identity false) can both be correct.\nconst prune = (filter: Filter, present: ReadonlySet<string> | 'all', insideExists: boolean): Filter | undefined => {\n if ('optional' in filter) {\n // The correlation of an EXISTS is what ties it to the outer row. Let a\n // caller switch that off and `exists` stops asking \"is there one of these\n // for THIS row\" and starts asking \"is there one of these at all\" — a\n // different question that happens to be true far more often. Refused\n // outright rather than defended per-case.\n const keys = gateKeys(filter.optional.key);\n if (insideExists) {\n throw new VexError('invalid_dsl', `An optional condition (\"${keys.join(', ')}\") cannot live inside an exists — its correlation must hold on every run.`);\n }\n // ALL of them, not any: a condition needing two values and given one is a\n // condition that cannot run.\n if (present !== 'all' && !keys.every((key) => present.has(key))) return undefined;\n return prune(filter.optional.then, present, insideExists);\n }\n\n if ('exists' in filter) {\n const inner = filter.exists.filter === undefined ? undefined : prune(filter.exists.filter, present, true);\n return inner === undefined\n ? { exists: { from: filter.exists.from } }\n : { exists: { from: filter.exists.from, filter: inner } };\n }\n\n if ('and' in filter || 'or' in filter) {\n const isAnd = 'and' in filter;\n const kept = (isAnd ? filter.and : filter.or)\n .map((sub) => prune(sub, present, insideExists))\n .filter((sub): sub is Filter => sub !== undefined);\n // The schema requires two arms, so a pruned pair has to collapse rather\n // than emit a one-armed `and` that would fail its own validation.\n if (kept.length === 0) return undefined;\n if (kept.length === 1) return kept[0];\n return isAnd ? { and: kept } : { or: kept };\n }\n\n if ('not' in filter) {\n const inner = prune(filter.not, present, insideExists);\n // `not` of a condition that is not there is not \"true\" or \"false\" — it is\n // a question nobody asked. An author who wants \"exclude these when the key\n // is given\" writes `{ optional: { key, then: { not: … } } }`, which says it.\n if (inner === undefined) {\n throw new VexError('invalid_dsl', 'An optional condition cannot be the whole body of a `not` — wrap the `not` in the optional instead.');\n }\n return { not: inner };\n }\n\n return filter;\n};\n\n/** Resolve every optional condition against the keys a caller supplied.\n *\n * A query whose filter prunes away entirely comes back with NO filter, which\n * is the point: `people/list` with no lens, no search and no cursor is the\n * whole roll, and it says so by having nothing to say. Scope is injected\n * after this, so \"no filter\" still never means \"every tenant\". */\nexport const pruneOptional = (dsl: Query, present: ReadonlySet<string> | 'all'): Query => {\n const from: Source[] = dsl.from.map((source) =>\n typeof source === 'string' ? source : { as: source.as, query: pruneOptional(source.query, present) },\n );\n\n if (dsl.filter === undefined) return { ...dsl, from };\n\n const filter = prune(dsl.filter, present, false);\n if (filter === undefined) {\n const { filter: _dropped, ...rest } = dsl;\n return { ...rest, from };\n }\n return { ...dsl, from, filter };\n};\n\n/** Belt and braces for the three walkers that must never meet this node. */\nexport const refuseOptional = (where: string): never => {\n throw new VexError(\n 'invalid_dsl',\n `An optional condition reached ${where}. It should have been resolved by pruneOptional before the pipeline ran — reaching this point means a query was compiled without knowing which context keys the caller supplied.`,\n );\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 '../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","// Scope is server-side, LLM-invisible access control, applied to the resolved\n// query/mutation AFTER it is authored — so a generated or injected DSL can never\n// reference, dodge, or forge it. There are two roles, named for the SQL they\n// produce:\n// • match — RLS: the row's column must equal a scope value (a WHERE filter,\n// and on INSERT the column is pinned to that value so you can't write\n// outside your boundary).\n// • set — identity: the engine writes the column from a scope value on\n// EVERY column-writing op — INSERT values and UPDATE set alike (`write`\n// means every write; delete writes no columns, so it is structurally\n// exempt). It doesn't touch reads.\n\n// Caller runtime values, injected at execute via options.scope, keyed by name\n// (e.g. { userId, accountId }). A rule's `to` names one of these keys.\nexport type ScopeValues = Record<string, unknown>;\n\n// RLS filter: `<entity>.<match>` must equal the `to` scope value — or, in the\n// set-valued form, must be ONE OF the `in` scope value.\n//\n// THE SET IS FOR READS. A reach that covers several rows is a real concept —\n// \"mine, and the people I am answerable for\" — and the scalar form cannot say\n// it. What the set deliberately CANNOT do is pin a write: a `match` on an\n// INSERT writes the column (engine.ts), and a set has no single value to\n// write. That is not a gap to fill later; it is the property that keeps a\n// write's subject unforgeable. The mutation engine throws rather than\n// guessing, so a set-valued write rule is unauthorable rather than merely\n// discouraged.\n//\n// Fail-closed comes from SQL rather than from a guard here: the set compiles\n// to `col = ANY($n)`, an absent scope value binds NULL (`= ANY(NULL)` is NULL,\n// so the row drops) and an empty one binds `{}` (false). Neither can be\n// forgotten, because neither was written.\nexport type ScopeMatchOne = { match: string; to: string };\nexport type ScopeMatchAny = { match: string; in: string };\nexport type ScopeMatch = ScopeMatchOne | ScopeMatchAny;\n\n/** The set-valued form, told apart by its key — `to` and `in` never coexist. */\nexport const isSetMatch = (m: ScopeMatch): m is ScopeMatchAny => 'in' in m;\n\n// Identity write: `<set>` is filled from the `to` scope value on every\n// column-writing mutation (INSERT and UPDATE).\nexport type ScopeSet = { set: string; to: string };\n\nexport type ScopeRule = ScopeMatch | ScopeSet;\n\nexport type ScopeEntityRule =\n | { public: true } // fully open (read + write, no rules)\n | { deny: true } // fully closed\n | {\n // Reads (SELECT): each match becomes a WHERE filter. Match only — there is\n // nothing to stamp on a read.\n read?: ScopeMatch[];\n // Writes. `write` is the UMBRELLA: its presence grants insert, update\n // and delete, and its rules apply to every one of them. The specific\n // phases refine it: their presence grants just that op, and their rules\n // apply ON TOP of the umbrella's. An op is allowed iff its specific\n // phase or `write` exists. Rule mechanics per op: a `match` filters\n // UPDATE/DELETE and pins the column on INSERT; a `set` writes the\n // column on INSERT and UPDATE (delete writes no columns, so `delete`\n // is match-only at the type level).\n write?: ScopeRule[];\n insert?: ScopeRule[];\n update?: ScopeRule[];\n delete?: ScopeMatch[];\n };\n\nexport type ScopePolicy = {\n // Fallback for an entity that isn't listed, and for a listed entity's absent\n // phase: 'allow' = unrestricted, 'deny' = no access.\n default: 'allow' | 'deny';\n entities: Record<string, ScopeEntityRule>;\n};\n","import type { Query } from '../schemas/query.schema.js';\nimport type { Filter } from '../schemas/filter.schema.js';\nimport type { ResolvedQuery, ResolvedFilter, ResolvedSource, ResolvedJoin } from '../engine/engine.types.js';\nimport type { ScopePolicy, ScopeEntityRule, ScopeMatch } from './scope.types.js';\nimport { isSetMatch } from './scope.types.js';\nimport { VexError } from '../errors.js';\n\n// ───────────────────────────────────────────────────────────────\n// Error\n// ───────────────────────────────────────────────────────────────\n\n// A scope denial IS a VexError (code 'scope_denied') so the HTTP layer maps\n// it to a 400 like every other request error — a denied read or write is the\n// caller's problem, not a 500. `entity` is kept for callers that inspect it.\nexport class VexScopeError extends VexError {\n readonly entity: string;\n\n constructor(entity: string, message: string) {\n super('scope_denied', message);\n this.name = 'VexScopeError';\n this.entity = entity;\n }\n}\n\n// ───────────────────────────────────────────────────────────────\n// TWO QUESTIONS, DELIBERATELY SEPARATED\n// ───────────────────────────────────────────────────────────────\n//\n// Scope answers two things that used to be answered in one pass, and\n// conflating them produced a silent, universal row-loss bug:\n//\n// 1. MAY this caller touch this table at all? — a pure allow/deny over\n// entity names. Needs no schema, no aliases, no joins. Runs before\n// resolution, over every entity discovered anywhere in the tree.\n//\n// 2. WHERE does the row rule go? — needs to know HOW the table is reached,\n// because a row rule on a LEFT-joined table belongs in that join's ON\n// clause. It used to be merged into the DSL's `filter`, which compiles to\n// WHERE, which turns every LEFT join into an INNER one: a driving row\n// whose optional FK is null gets null-padded columns, `null = $tenant` is\n// null rather than true, and the row vanishes. No error, no warning, a\n// shorter list. It hid for as long as no data had a null FK.\n//\n// Only the resolver knows join kinds, so (2) moved after resolution. That also\n// means scope no longer writes anything into the authored `Query` — the\n// document integrations ship over the wire carries no engine-trusted field,\n// which is a property worth having on its own.\n\nconst matchesFor = (entity: string, rule: ScopeEntityRule | undefined, def: 'allow' | 'deny'): ScopeMatch[] => {\n if (rule === undefined) {\n if (def === 'deny') throw new VexScopeError(entity, `Entity \"${entity}\" is not allowed by scope policy (default: deny)`);\n return [];\n }\n if ('public' in rule) return [];\n if ('deny' in rule) throw new VexScopeError(entity, `Entity \"${entity}\" is denied by scope policy`);\n if (rule.read === undefined) {\n if (def === 'deny') throw new VexScopeError(entity, `Reads of \"${entity}\" are not allowed by scope policy (default: deny)`);\n return [];\n }\n return rule.read;\n};\n\n// Whether a policy lets a caller read a table at all — the same answer\n// `checkScope` enforces, as a predicate for anything that must decide what to\n// SHOW (discovery, the schema a generating agent is handed) rather than what\n// to refuse.\nexport const canReadTable = (policy: ScopePolicy, table: string): boolean => {\n const rule = policy.entities[table];\n if (rule === undefined) return policy.default === 'allow';\n if ('public' in rule) return true;\n if ('deny' in rule) return false;\n return rule.read !== undefined || policy.default === 'allow';\n};\n\n// ───────────────────────────────────────────────────────────────\n// 1. May they touch it\n// ───────────────────────────────────────────────────────────────\n\n// Throws on the first denied entity. A denied entity ANYWHERE denies the query,\n// including inside a subquery or an `exists` — `discoverEntities` walks the\n// whole tree, so a table cannot be reached by hiding it one level down.\nexport const checkScope = (entities: Set<string>, policy: ScopePolicy): void => {\n for (const entity of entities) matchesFor(entity, policy.entities[entity], policy.default);\n};\n\n// ───────────────────────────────────────────────────────────────\n// 2. Where the row rule goes\n// ───────────────────────────────────────────────────────────────\n\nconst andMerge = (existing: ResolvedFilter | undefined, additions: ResolvedFilter[]): ResolvedFilter | undefined => {\n if (additions.length === 0) return existing;\n const all = existing === undefined ? additions : [existing, ...additions];\n if (all.length === 1) return all[0];\n\n const paths = new Map<string, { alias: string; column: string; schema: never }>();\n for (const part of all) for (const [key, value] of part.resolvedPaths) paths.set(key, value as never);\n return { original: { and: all.map((f) => f.original) }, resolvedPaths: paths as never };\n};\n\n// One row rule, resolved against the alias the table actually got.\nconst predicateFor = (\n entityName: string,\n alias: string,\n match: ScopeMatch,\n fields: { name: string; nullable: boolean }[],\n): ResolvedFilter | undefined => {\n const field = fields.find((f) => f.name === match.match);\n // A rule naming a column the table does not have is a policy bug, not a\n // request bug — but failing the read closed is the only safe reading of it.\n if (field === undefined) throw new VexScopeError(entityName, `Scope rule for \"${entityName}\" names column \"${match.match}\", which the table does not have`);\n const path = `${entityName}.${match.match}`;\n // The set-valued form compiles to `col = ANY($n)`, which the operator table\n // already emits for `in` against a scope ref — so a reach covering several\n // rows needs no compile branch of its own, and binds through the same slot\n // machinery. An absent or empty set matches nothing (see scope.types.ts).\n const original: Filter = isSetMatch(match)\n ? { in: [path, { $scope: match.in }] }\n : { eq: [path, { $scope: match.to }] };\n return { original, resolvedPaths: new Map([[path, { alias, column: match.match, schema: field as never }]]) as never };\n};\n\n// One LEVEL of a resolved tree — an outer query, a subquery, or an `exists`.\n// They differ in what else they carry; for placing row rules they are the same\n// four things, so they get the same code and cannot drift apart.\ntype ScopeLevel = {\n sources: ResolvedSource[];\n joins: ResolvedJoin[];\n aliasMap: Map<string, string>;\n filter?: ResolvedFilter;\n};\n\nconst placeInto = (level: ScopeLevel, policy: ScopePolicy): void => {\n const whereAdditions: ResolvedFilter[] = [];\n\n for (const source of level.sources) {\n const entity = source.entity;\n if (entity === undefined) continue;\n\n const join = level.joins.find((j) => j.toAlias === source.alias);\n for (const match of matchesFor(entity.name, policy.entities[entity.name], policy.default)) {\n const predicate = predicateFor(entity.name, source.alias, match, entity.fields);\n if (predicate === undefined) continue;\n\n // The compiler resolves `entity.column` through the alias map, and these\n // predicates never went through the resolver's field pass, so they say\n // where they point.\n level.aliasMap.set(`${entity.name}.${match.match}`, `${source.alias}.${match.match}`);\n\n if (join !== undefined && join.kind === 'left') join.on = [...(join.on ?? []), predicate];\n else whereAdditions.push(predicate);\n }\n }\n\n const merged = andMerge(level.filter, whereAdditions);\n if (merged !== undefined) level.filter = merged;\n};\n\n// Walk the resolved tree and place every row rule. Subqueries and `exists`\n// nodes recurse: a rule on `tasks` lands inside the level whose FROM actually\n// reads tasks, never on an outer query that only sees an alias.\n//\n// The `exists` recursion is not tidiness — it is the boundary. An EXISTS\n// returns a boolean, but a boolean about somebody else's rows is still an\n// answer about somebody else's rows: an uncorrelated `exists` over a scoped\n// table would report whether ANY tenant has such a row. Access-checking the\n// table is not enough; the rule has to be inside the subquery too.\nexport const scopeResolved = (resolved: ResolvedQuery, policy: ScopePolicy): ResolvedQuery => {\n for (const source of resolved.sources) {\n if (source.subquery !== undefined) scopeResolved(source.subquery, policy);\n }\n\n // Every `exists` at every depth — the resolver collects nested ones into the\n // same flat map, so one pass covers the tree.\n for (const node of resolved.existsMap?.values() ?? []) {\n placeInto(node, policy);\n }\n\n placeInto(resolved, policy);\n return resolved;\n};\n\n// ───────────────────────────────────────────────────────────────\n// Deprecated shape, kept so a caller that only wanted the access check still\n// gets one. It no longer returns a filtered DSL, because scope is not a DSL\n// concern any more — `scopeResolved` does the placing.\n// ───────────────────────────────────────────────────────────────\nexport const applyScope = (dsl: Query, entities: Set<string>, policy: ScopePolicy): Query => {\n checkScope(entities, policy);\n return dsl;\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 { ContextContract, ParamSlot } from '../adapters/adapter.types.js';\n\n// ───────────────────────────────────────────────────────────────\n// Validation context builder\n// ───────────────────────────────────────────────────────────────\n\nconst defaultForType = (type: ParamSlot['type']): unknown => {\n if (type === 'string') return '';\n if (type === 'number') return 0;\n if (type === 'boolean') return false;\n if (type === 'string[]') return [''];\n if (type === 'number[]') return [0];\n if (type === 'json') return [];\n return '';\n};\n\nexport const buildValidationContext = (contract: ContextContract): Record<string, unknown> => {\n const ctx: Record<string, unknown> = {};\n for (const key of Object.keys(contract)) {\n const slot = contract[key];\n if (slot === undefined) continue;\n // Skip semantic slots — handled separately by the test path\n if (slot.kind === 'semantic') continue;\n ctx[key] = defaultForType(slot.type);\n }\n return ctx;\n};\n\n// ───────────────────────────────────────────────────────────────\n// Parameter resolution\n// ───────────────────────────────────────────────────────────────\n\nexport const resolveParams = async (\n slots: ParamSlot[],\n context: Record<string, unknown>,\n scope: Record<string, unknown>,\n embed?: (text: string, dimensions?: number) => Promise<number[]>,\n): Promise<unknown[]> => {\n const results: unknown[] = [];\n\n for (const slot of slots) {\n if (slot.kind === 'context') {\n results.push(context[slot.key]);\n continue;\n }\n\n if (slot.kind === 'scope') {\n results.push(scope[slot.key]);\n continue;\n }\n\n // kind === 'semantic'\n if (embed === undefined) {\n throw new Error(`Semantic parameter \"${slot.key}\" requires an embed function`);\n }\n const text = context[slot.key];\n if (typeof text !== 'string') {\n throw new Error(`Semantic parameter \"${slot.key}\" requires a string value in context`);\n }\n const vector = await embed(text, slot.dimensions);\n results.push(`[${vector.join(',')}]`);\n }\n\n return results;\n};\n","import type { CompiledQuery, Row, DatabaseAdapter } from '../adapters/adapter.types.js';\nimport type { ContextMeta } from '../schemas/request.schema.js';\nimport { resolveParams } from '../utils/context.js';\nimport { VexError } from '../errors.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Execution\n// ═══════════════════════════════════════════════════════════════\n\nexport const executeQuery = async (\n compiled: CompiledQuery,\n context: Record<string, unknown>,\n scope: Record<string, unknown>,\n adapter: DatabaseAdapter,\n embed?: (text: string, dimensions?: number) => Promise<number[]>,\n): Promise<Row[]> => {\n const boundParams = await resolveParams(\n compiled.paramSlots,\n context,\n scope,\n embed,\n );\n return adapter.execute(compiled, boundParams);\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Context contract builder\n// ═══════════════════════════════════════════════════════════════\n\nexport const buildContextContract = (\n compiled: CompiledQuery,\n // Every key that controls an `optional` condition anywhere in the STORED\n // dsl — including the ones this run pruned away, which have no slot and so\n // would otherwise be invisible to the caller who most needs to know they\n // exist: the one who did not send them.\n optionalKeys: readonly string[] = [],\n): Record<string, ContextMeta> => {\n const contract: Record<string, ContextMeta> = {};\n\n for (const slot of compiled.paramSlots) {\n contract[slot.key] = {\n type: slot.type,\n kind: slot.kind,\n ...(optionalKeys.includes(slot.key) ? { optional: true as const } : {}),\n };\n }\n\n for (const key of optionalKeys) {\n if (contract[key] !== undefined) continue;\n contract[key] = { kind: 'context', optional: true, absent: true };\n }\n\n return contract;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Missing context detection\n// ═══════════════════════════════════════════════════════════════\n\n// The CALLER's half: context keys the request did not supply. A read with\n// holes answers empty and hands back the contract it missed — the caller can\n// fix that. Scope is not in here; see requireScope.\nexport const findMissingContext = (\n compiled: CompiledQuery,\n context: Record<string, unknown>,\n): string[] => {\n const missing: string[] = [];\n\n for (const slot of compiled.paramSlots) {\n if ((slot.kind === 'context' || slot.kind === 'semantic') && context[slot.key] === undefined) {\n missing.push(slot.key);\n }\n }\n\n return missing;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Missing scope — the HOST's half\n// ═══════════════════════════════════════════════════════════════\n\n// A `$scope` slot the host did not fill is not a hole a caller can mend: the\n// caller cannot supply scope, and binding it would bind NULL — which matches\n// no row on a read and STAMPS NULL on a write. So it refuses, loudly, before\n// anything runs. The keys ride in `details` for the host's logs; the HTTP\n// layer does not hand them to the client.\nexport const requireScope = (compiled: { paramSlots: readonly { kind: string; key: string }[] }, scope: Record<string, unknown>): void => {\n const missing = [...new Set(compiled.paramSlots.filter((slot) => slot.kind === 'scope' && scope[slot.key] === undefined).map((slot) => slot.key))];\n if (missing.length > 0) {\n throw new VexError('missing_scope', `This statement is scoped by ${missing.join(', ')}, which the host did not supply.`, { keys: missing });\n }\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 { createHash } from 'node:crypto';\nimport type { DatabaseSchema } from '../schemas/database.schema.js';\n\n// ───────────────────────────────────────────────────────────────\n// Shape normalization\n// ───────────────────────────────────────────────────────────────\n\nconst isRecord = (value: unknown): value is Record<string, unknown> =>\n value !== null && typeof value === 'object' && !Array.isArray(value);\n\nexport const normalizeShape = (shape: unknown): unknown => {\n if (shape === null) return 'null';\n if (shape === undefined) return 'unknown';\n\n if (Array.isArray(shape)) {\n // Collapse to first-element shape (all elements assumed same shape)\n const first: unknown = shape[0];\n return first !== undefined ? [normalizeShape(first)] : [];\n }\n\n if (isRecord(shape)) {\n const sortedKeys = Object.keys(shape).sort();\n const normalized: Record<string, unknown> = {};\n for (const key of sortedKeys) {\n normalized[key] = normalizeShape(shape[key]);\n }\n return normalized;\n }\n\n if (typeof shape === 'string') return 'string';\n if (typeof shape === 'number') return 'number';\n if (typeof shape === 'boolean') return 'boolean';\n\n // functions, symbols, bigint, etc.\n return 'unknown';\n};\n\n// ───────────────────────────────────────────────────────────────\n// Fingerprints\n//\n// The ONE cache identity. Minted (`fp_…`) when a request arrives\n// without one — an immutable pin the caller can embed and replay.\n// Caller-chosen strings are mutable named slots. Shape hashes are no\n// longer keys anywhere; normalizeShape survives only inside\n// computeRequestHash (request-identity comparison).\n// ───────────────────────────────────────────────────────────────\n\nexport const mintFingerprint = (): string =>\n `fp_${createHash('sha256').update(`${Date.now()}:${Math.random()}`).digest('hex').slice(0, 16)}`;\n\n// ───────────────────────────────────────────────────────────────\n// Schema fingerprint\n//\n// A hash of the *structural* (DDL) shape of the database schema, stored\n// on each cache entry so a cached DSL — which references concrete\n// columns — can be invalidated when the schema changes out from under it\n// (a dropped/renamed column would otherwise compile to broken SQL on a\n// cache hit).\n//\n// Critically, this must be STABLE across restarts for an unchanged\n// schema, or warm-up entries would be wrongly judged stale and thrown\n// away on first read. So we project to a canonical, sorted form and\n// deliberately exclude volatile data: rowCount (a drifting pg estimate)\n// and cosmetic fields (description, defaultValue). A row-count change is\n// not a schema change — the cached SQL is still valid.\n// ───────────────────────────────────────────────────────────────\n\n// ───────────────────────────────────────────────────────────────\n// Request identity hash\n//\n// Unlike the shape hash (which keys the positive cache and intentionally\n// ignores intent), this identifies the *whole request*: intent + shape\n// class + the set of context keys. It keys things where intent matters —\n// the negative cache (whether a request is satisfiable depends on the\n// intent, not just the output shape) and single-flight de-duplication of\n// concurrent identical misses. Context *values* are excluded (runtime\n// data, potentially sensitive); only the key names participate.\n// ───────────────────────────────────────────────────────────────\n\nexport const computeRequestHash = (request: {\n intent?: string;\n shape?: unknown;\n context?: Record<string, unknown>;\n}): string => {\n const identity = {\n intent: request.intent ?? null,\n shape: normalizeShape(request.shape),\n contextKeys: Object.keys(request.context ?? {}).sort(),\n };\n return createHash('sha256').update(JSON.stringify(identity)).digest('hex');\n};\n\n// Which POLICY a generation ran under — part of the single-flight and\n// negative-cache keys, because an agent that can see different tables is a\n// different agent. Key order is normalised so two structurally equal policies\n// built in different orders share a key. `none` is the engine with no policy.\nconst canonical = (value: unknown): unknown => {\n if (Array.isArray(value)) return value.map(canonical);\n if (isRecord(value)) {\n const out: Record<string, unknown> = {};\n for (const key of Object.keys(value).sort()) out[key] = canonical(value[key]);\n return out;\n }\n return value;\n};\n\nexport const computePolicyKey = (policy: unknown): string =>\n policy === undefined ? 'none' : createHash('sha256').update(JSON.stringify(canonical(policy))).digest('hex').slice(0, 16);\n\nexport const computeSchemaFingerprint = (schema: DatabaseSchema): string => {\n const byName = (a: { name: string }, b: { name: string }) => a.name.localeCompare(b.name);\n\n const stable = {\n entities: [...schema.entities].sort(byName).map((e) => ({\n name: e.name,\n table: e.table,\n fields: [...e.fields].sort(byName).map((f) => ({\n name: f.name,\n type: f.type,\n normalizedType: f.normalizedType,\n nullable: f.nullable,\n primaryKey: f.primaryKey,\n ...(f.vectorDimensions !== undefined ? { vectorDimensions: f.vectorDimensions } : {}),\n })),\n // Column order within a relation is the key's own order, so it is\n // preserved; relations are sorted by target and columns. This shape\n // changed when keys became composite, so every entry cached before\n // revalidates once on the next boot — the drift eviction, by design.\n relations: [...e.relations]\n .sort((a, b) => `${a.entity}.${a.localFields.join(',')}`.localeCompare(`${b.entity}.${b.localFields.join(',')}`))\n .map((r) => ({ type: r.type, entity: r.entity, localFields: r.localFields, foreignFields: r.foreignFields })),\n // Index field order is significant (composite indexes) and stable\n // from introspection, so it is preserved; indexes are sorted by name.\n indexes: [...e.indexes].sort(byName).map((i) => ({\n name: i.name,\n fields: i.fields,\n unique: i.unique,\n type: i.type,\n })),\n })),\n };\n\n return createHash('sha256').update(JSON.stringify(stable)).digest('hex');\n};\n","import type { CacheEntry } from './cache.types.js';\n\n/**\n * Run a promise we don't want to await (background writes, hit bumps,\n * evictions). Failures are routed to `onError` or logged, never thrown\n * into the caller's path.\n */\nexport const fireAndForget = (p: Promise<unknown>, onError?: (err: unknown) => void): void => {\n void p.catch((err) => {\n if (onError) onError(err);\n else console.error('[vex:cache]', err);\n });\n};\n\n/**\n * How often a replay stamps `lastUsedAt`. The stamp rewrites the entry, and\n * a stamp on EVERY replay made every read a write too; once a minute keeps\n * what reads it — the sweep (idle limits of days), discovery's \"last used\" —\n * accurate to the minute, for a write per fingerprint per minute at most.\n */\nexport const TOUCH_EVERY_MS = 60_000;\n\n/** Whether a replay at `now` should stamp this entry's `lastUsedAt`. */\nexport const isTouchDue = (entry: CacheEntry, now: number): boolean =>\n entry.lastUsedAt === undefined || now - entry.lastUsedAt >= TOUCH_EVERY_MS;\n\n/**\n * Pure freshness check (no side effects). An entry is fresh when it is\n * not past its TTL and was written against the current schema. A\n * different fingerprint means the entry's DSL may reference columns that\n * have since changed. Callers decide whether to evict a non-fresh entry.\n */\nexport const isEntryFresh = (entry: CacheEntry, currentFingerprint?: string): boolean => {\n const expired = entry.expiresAt !== undefined && entry.expiresAt <= Date.now();\n const stale =\n entry.schemaFingerprint !== undefined &&\n currentFingerprint !== undefined &&\n entry.schemaFingerprint !== currentFingerprint;\n return !expired && !stale;\n};\n\n/**\n * Lifetime = usage. Evicts unprotected entries that have not been\n * replayed within `maxIdleMs` (falling back to createdAt for entries\n * never touched). Protected entries never sweep. Run it on whatever\n * cadence suits the app (startup, a timer, a cron) — it is hygiene,\n * not a correctness requirement: entries are single-digit KB.\n */\nexport const sweepCache = async (\n cache: {\n entries?: () => Promise<Array<{ key: string; entry: CacheEntry }>>;\n keys: () => Promise<string[]>;\n get: (key: string) => Promise<CacheEntry | undefined>;\n delete: (key: string) => Promise<void>;\n },\n options: { maxIdleMs: number },\n): Promise<number> => {\n const cutoff = Date.now() - options.maxIdleMs;\n const rows = cache.entries !== undefined\n ? await cache.entries()\n : await Promise.all((await cache.keys()).map(async (key) => ({ key, entry: await cache.get(key) })));\n\n let evicted = 0;\n for (const { key, entry } of rows) {\n if (entry === undefined) continue;\n if (entry.protected === true) continue;\n const lastAlive = entry.lastUsedAt ?? entry.createdAt;\n if (lastAlive < cutoff) {\n await cache.delete(key);\n evicted += 1;\n }\n }\n return evicted;\n};\n","import { createHash } from 'node:crypto';\n\n// ═══════════════════════════════════════════════════════════════\n// Canonical JSON — one text per value, whatever order its keys arrived in.\n//\n// Stored definitions round-trip through jsonb, which reorders object keys,\n// and a value compared by its first serialisation would call every such row\n// \"changed\". Keys are sorted recursively; arrays keep their order, because\n// their order is part of what they mean.\n// ═══════════════════════════════════════════════════════════════\n\nexport const canonical = (value: unknown): unknown => {\n if (Array.isArray(value)) return value.map(canonical);\n if (value !== null && typeof value === 'object' && !(value instanceof Date)) {\n const sorted: Record<string, unknown> = {};\n for (const [key, inner] of Object.entries(value).sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0))) sorted[key] = canonical(inner);\n return sorted;\n }\n return value;\n};\n\nexport const canonicalText = (value: unknown): string => JSON.stringify(canonical(value)) ?? 'undefined';\n\nexport const hashText = (text: string): string => createHash('sha256').update(text).digest('hex');\n\nexport const canonicalHash = (value: unknown): string => hashText(canonicalText(value));\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 { 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 type { ParamSlot } from '../adapter.types.js';\nimport type { FieldSchema } from '../../schemas/database.schema.js';\nimport type { ResolvedExists, ResolvedJoin } from '../../engine/engine.types.js';\nimport { RESERVED_CONTEXT_KEYS } from '../../schemas/request.schema.js';\nimport { refuseOptional } from '../../engine/optional.js';\nimport { VexError } from '../../errors.js';\nimport { isFieldPathShape } from '../../schemas/identifier.schema.js';\n\n// A `$context` ref naming a reserved sort key would otherwise become a bound\n// param; reject it at compile so reserved keys only ever drive ORDER BY.\nconst assertNotReserved = (key: string): void => {\n if (RESERVED_CONTEXT_KEYS.has(key))\n throw new VexError(\n 'invalid_dsl',\n `\"${key}\" is a reserved sort key (applied to ORDER BY); it cannot be bound as a parameter.`,\n );\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Types\n// ═══════════════════════════════════════════════════════════════\n\ntype PathResolution = { alias: string; column: string; schema: FieldSchema };\n\ntype CompilationContext = {\n resolvedPaths: Map<string, PathResolution>;\n aliasMap: Map<string, string>;\n paramSlots: ParamSlot[];\n paramCounter: { value: number };\n // Every `exists` in this query's filter, resolved. Keyed by the node, because\n // the compiler walks the raw filter tree and needs to find the resolution for\n // the node in front of it.\n existsMap?: Map<object, ResolvedExists>;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// FieldOrValue compilation\n// ═══════════════════════════════════════════════════════════════\n\n// ═══════════════════════════════════════════════════════════════\n// SQL TEXT — the only three ways authored input reaches a statement.\n//\n// · a COLUMN, which must have resolved against the introspected schema —\n// `columnOf` emits the resolver's alias.column or refuses. There is no\n// \"pass it through\" branch, anywhere: the fallback that used to exist here\n// pasted whatever string sat in a field position into the statement.\n// · a LITERAL, quoted by `quoteLiteral` exactly as Postgres's own\n// quote_literal() does, so it is safe whatever standard_conforming_strings\n// says.\n// · an OUTPUT NAME, quoted by `quoteIdent`.\n//\n// Values from a request never reach text at all: they bind as parameters.\n// ═══════════════════════════════════════════════════════════════\n\nexport const quoteLiteral = (s: string): string => {\n const doubled = s.replace(/'/g, \"''\");\n // With standard_conforming_strings off, a backslash in '…' is an escape and\n // `\\'` closes the string. The E'' form escapes backslashes explicitly, so the\n // literal means the same thing under either setting.\n return s.includes('\\\\') ? `E'${doubled.replace(/\\\\/g, '\\\\\\\\')}'` : `'${doubled}'`;\n};\n\nexport const quoteIdent = (name: string): string => `\"${name.replace(/\"/g, '\"\"')}\"`;\n\n// A number that is not finite has no SQL spelling — `NaN` would read as a name.\nexport const numberLiteral = (n: number): string => {\n if (!Number.isFinite(n)) throw new VexError('invalid_dsl', `${String(n)} is not a number SQL can hold.`);\n return String(n);\n};\n\nconst columnOf = (path: string, ctx: CompilationContext): string => {\n const mapped = ctx.aliasMap.get(path);\n if (mapped !== undefined) return mapped;\n const res = ctx.resolvedPaths.get(path);\n if (res !== undefined) return `${res.alias}.${res.column}`;\n throw new VexError('invalid_dsl', `\"${path}\" is not a column this query reads.`);\n};\n\nconst isFieldPath = isFieldPathShape;\n\nconst inferParamType = (path: string, resolvedPaths: Map<string, PathResolution>): ParamSlot['type'] => {\n const res = resolvedPaths.get(path);\n if (res === undefined) return 'string';\n const nt = res.schema.normalizedType;\n if (nt === 'number') return 'number';\n if (nt === 'boolean') return 'boolean';\n return 'string';\n};\n\nexport const compileFieldOrValue = (\n fov: FieldOrValue,\n ctx: CompilationContext,\n): string => {\n if (fov === null) return 'NULL';\n if (typeof fov === 'boolean') return fov ? 'TRUE' : 'FALSE';\n if (typeof fov === 'number') return numberLiteral(fov);\n\n if (typeof fov === 'string') {\n // Shaped like a column → it is one, and it resolved (or this refuses).\n // Anything else is a literal.\n return isFieldPath(fov) ? columnOf(fov, ctx) : quoteLiteral(fov);\n }\n\n // Object: $context or $scope — after eliminating primitives, only these remain\n if (typeof fov === 'object' && fov !== null && '$context' in fov) {\n const key = fov.$context;\n assertNotReserved(key);\n ctx.paramCounter.value += 1;\n ctx.paramSlots.push({\n key,\n kind: 'context',\n type: inferParamType(key, ctx.resolvedPaths),\n });\n return `$${ctx.paramCounter.value}`;\n }\n\n if (typeof fov === 'object' && fov !== null && '$scope' in fov) {\n const key = fov.$scope;\n ctx.paramCounter.value += 1;\n ctx.paramSlots.push({\n key,\n kind: 'scope',\n type: inferParamType(key, ctx.resolvedPaths),\n });\n return `$${ctx.paramCounter.value}`;\n }\n\n return 'NULL';\n};\n\n\n// ═══════════════════════════════════════════════════════════════\n// Join pairs\n//\n// The whole key, one equality per column pair, for the query's joins and\n// the joins inside an `exists` alike — two emitters, one rule, so a\n// composite key can never be half-joined in one of them.\n// ═══════════════════════════════════════════════════════════════\n\nexport const compileJoinPairs = (join: ResolvedJoin): string[] =>\n join.fromColumns.map((column, i) => {\n const to = join.toColumns[i];\n if (to === undefined) {\n throw new VexError(\n 'invalid_dsl',\n `The join from \"${join.fromAlias}\" to \"${join.toAlias}\" pairs \"${column}\" with no column.`,\n );\n }\n return `${join.fromAlias}.${column} = ${join.toAlias}.${to}`;\n });\n\n// ═══════════════════════════════════════════════════════════════\n// Filter compilation\n// ═══════════════════════════════════════════════════════════════\n\nconst compileComparisonFilter = (\n op: string,\n pair: [FieldOrValue, FieldOrValue],\n ctx: CompilationContext,\n): string => {\n const left = compileFieldOrValue(pair[0], ctx);\n const right = compileFieldOrValue(pair[1], ctx);\n return `${left} ${op} ${right}`;\n};\n\nexport const compileFilter = (\n filter: Filter,\n ctx: CompilationContext,\n): string => {\n // EXISTS compiles INLINE, into the parent's own parameter counter and slot\n // list. That is deliberate: the other subquery path compiles independently\n // and then tries to renumber, which is how two parameterised subqueries came\n // to collide on $1. There is nothing to renumber if nothing was numbered\n // separately.\n //\n // `SELECT 1` because EXISTS asks whether a row is there, not what is in it.\n if ('exists' in filter) {\n const resolved = ctx.existsMap?.get(filter.exists);\n if (resolved === undefined) throw new VexError('invalid_dsl', 'An \"exists\" filter was not resolved. It must appear in a query\\'s own filter.');\n\n const inner: CompilationContext = {\n ...ctx,\n resolvedPaths: resolved.filter?.resolvedPaths ?? ctx.resolvedPaths,\n // The inner map LAYERS OVER the outer one, so an inner path resolves to\n // the inner alias and an outer path — the correlation — still resolves.\n aliasMap: new Map([...ctx.aliasMap, ...resolved.aliasMap]),\n };\n\n const parts: string[] = ['SELECT 1'];\n const first = resolved.sources[0];\n if (first?.table !== undefined) parts.push(`FROM ${first.table} AS ${first.alias}`);\n for (const join of resolved.joins) {\n const source = resolved.sources.find((s) => s.alias === join.toAlias);\n if (source?.table === undefined) continue;\n const keyword = join.kind === 'left' ? 'LEFT JOIN' : 'JOIN';\n const conditions = [\n ...compileJoinPairs(join),\n ...(join.on ?? []).map((extra) => compileFilter(extra.original, inner)),\n ];\n parts.push(`${keyword} ${source.table} AS ${join.toAlias} ON ${conditions.join(' AND ')}`);\n }\n if (resolved.filter !== undefined) parts.push(`WHERE ${compileFilter(resolved.filter.original, inner)}`);\n\n return `EXISTS (${parts.join(' ')})`;\n }\n\n if ('eq' in filter) return compileComparisonFilter('=', filter.eq, ctx);\n if ('neq' in filter) return compileComparisonFilter('<>', filter.neq, ctx);\n if ('gt' in filter) return compileComparisonFilter('>', filter.gt, ctx);\n if ('gte' in filter) return compileComparisonFilter('>=', filter.gte, ctx);\n if ('lt' in filter) return compileComparisonFilter('<', filter.lt, ctx);\n if ('lte' in filter) return compileComparisonFilter('<=', filter.lte, ctx);\n\n if ('in' in filter) {\n const col = columnOf(filter.in[0], ctx);\n const target = filter.in[1];\n\n if (Array.isArray(target)) {\n const values = target.map((v) => compileFieldOrValue(v, ctx));\n return `${col} IN (${values.join(', ')})`;\n }\n\n // ContextRef or ScopeRef → array parameter\n if ('$context' in target) {\n assertNotReserved(target.$context);\n ctx.paramCounter.value += 1;\n ctx.paramSlots.push({ key: target.$context, kind: 'context', type: 'string[]' });\n return `${col} = ANY($${ctx.paramCounter.value})`;\n }\n if ('$scope' in target) {\n ctx.paramCounter.value += 1;\n ctx.paramSlots.push({ key: target.$scope, kind: 'scope', type: 'string[]' });\n return `${col} = ANY($${ctx.paramCounter.value})`;\n }\n\n return `${col} IN ()`;\n }\n\n if ('notIn' in filter) {\n const col = columnOf(filter.notIn[0], ctx);\n const target = filter.notIn[1];\n\n if (Array.isArray(target)) {\n const values = target.map((v) => compileFieldOrValue(v, ctx));\n return `${col} NOT IN (${values.join(', ')})`;\n }\n\n if ('$context' in target) {\n assertNotReserved(target.$context);\n ctx.paramCounter.value += 1;\n ctx.paramSlots.push({ key: target.$context, kind: 'context', type: 'string[]' });\n return `${col} <> ALL($${ctx.paramCounter.value})`;\n }\n if ('$scope' in target) {\n ctx.paramCounter.value += 1;\n ctx.paramSlots.push({ key: target.$scope, kind: 'scope', type: 'string[]' });\n return `${col} <> ALL($${ctx.paramCounter.value})`;\n }\n\n return `${col} NOT IN ()`;\n }\n\n if ('like' in filter) {\n const col = columnOf(filter.like[0], ctx);\n const pattern = compileFieldOrValue(filter.like[1], ctx);\n return `${col} LIKE ${pattern}`;\n }\n\n if ('ilike' in filter) {\n const col = columnOf(filter.ilike[0], ctx);\n const pattern = compileFieldOrValue(filter.ilike[1], ctx);\n return `${col} ILIKE ${pattern}`;\n }\n\n if ('isNull' in filter) {\n return `${columnOf(filter.isNull, ctx)} IS NULL`;\n }\n\n if ('isNotNull' in filter) {\n return `${columnOf(filter.isNotNull, ctx)} IS NOT NULL`;\n }\n\n if ('and' in filter) {\n const parts = filter.and.map((sub) => compileFilter(sub, ctx));\n return `(${parts.join(' AND ')})`;\n }\n\n if ('or' in filter) {\n const parts = filter.or.map((sub) => compileFilter(sub, ctx));\n return `(${parts.join(' OR ')})`;\n }\n\n if ('not' in filter) {\n const inner = compileFilter(filter.not, ctx);\n return `NOT (${inner})`;\n }\n\n if ('semantic' in filter) {\n // Semantic filter: cosine distance using pgvector <=> operator\n const fieldPath = filter.semantic.field;\n const col = columnOf(fieldPath, ctx);\n\n const queryRef = filter.semantic.query;\n const key = '$context' in queryRef ? queryRef.$context : queryRef.$scope;\n if ('$context' in queryRef) assertNotReserved(queryRef.$context);\n\n // Look up vector dimensions from resolved paths\n const res = ctx.resolvedPaths.get(fieldPath);\n const dimensions = res?.schema.vectorDimensions;\n\n ctx.paramCounter.value += 1;\n ctx.paramSlots.push({\n key,\n kind: 'semantic',\n type: 'string',\n dimensions,\n });\n\n const paramRef = `$${ctx.paramCounter.value}`;\n const minScore = numberLiteral(filter.semantic.minScore ?? 0);\n return `1 - (${col} <=> ${paramRef}) >= ${minScore}`;\n }\n\n if ('fuzzy' in filter) {\n const col = columnOf(filter.fuzzy.field, ctx);\n\n const queryRef = filter.fuzzy.query;\n const key = '$context' in queryRef ? queryRef.$context : queryRef.$scope;\n const kind = '$context' in queryRef ? 'context' as const : 'scope' as const;\n if ('$context' in queryRef) assertNotReserved(queryRef.$context);\n\n ctx.paramCounter.value += 1;\n ctx.paramSlots.push({ key, kind, type: 'string' });\n\n const paramRef = `$${ctx.paramCounter.value}`;\n const maxDistance = filter.fuzzy.maxDistance;\n\n if (maxDistance !== undefined) {\n return `levenshtein(${col}, ${paramRef}) <= ${numberLiteral(maxDistance)}`;\n }\n // pg_trgm similarity\n return `${col} % ${paramRef}`;\n }\n\n // Resolved away before the pipeline — see engine/optional.ts. Named\n // explicitly because the fallthrough below is `TRUE`: an unrecognised node\n // would quietly compile to \"match everything\", which for an optional\n // condition is the right answer reached by the wrong route, and for anything\n // else is a filter that silently stopped filtering.\n if ('optional' in filter) refuseOptional('SQL compilation');\n\n // Should not reach here if the filter was validated\n return 'TRUE';\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Compute expression compilation\n// ═══════════════════════════════════════════════════════════════\n\nexport const compileCompute = (\n expr: ComputeExpression,\n ctx: CompilationContext,\n): string => {\n if ('add' in expr) {\n const a = compileFieldOrValue(expr.add[0], ctx);\n const b = compileFieldOrValue(expr.add[1], ctx);\n return `(${a} + ${b})`;\n }\n\n if ('subtract' in expr) {\n const a = compileFieldOrValue(expr.subtract[0], ctx);\n const b = compileFieldOrValue(expr.subtract[1], ctx);\n return `(${a} - ${b})`;\n }\n\n if ('multiply' in expr) {\n const a = compileFieldOrValue(expr.multiply[0], ctx);\n const b = compileFieldOrValue(expr.multiply[1], ctx);\n return `(${a} * ${b})`;\n }\n\n if ('divide' in expr) {\n const a = compileFieldOrValue(expr.divide[0], ctx);\n const b = compileFieldOrValue(expr.divide[1], ctx);\n return `(${a} / ${b})`;\n }\n\n if ('concat' in expr) {\n const parts = expr.concat.map((v) => compileFieldOrValue(v, ctx));\n return `(${parts.join(' || ')})`;\n }\n\n if ('coalesce' in expr) {\n const parts = expr.coalesce.map((v) => compileFieldOrValue(v, ctx));\n return `COALESCE(${parts.join(', ')})`;\n }\n\n if ('case' in expr) {\n const whenClauses = expr.case.when.map((w) => {\n const cond = compileFilter(w.condition, ctx);\n const val = compileFieldOrValue(w.then, ctx);\n return `WHEN ${cond} THEN ${val}`;\n });\n const elseVal = compileFieldOrValue(expr.case.else, ctx);\n return `CASE ${whenClauses.join(' ')} ELSE ${elseVal} END`;\n }\n\n return 'NULL';\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Aggregate expression compilation\n// ═══════════════════════════════════════════════════════════════\n\n// SUM/AVG/MIN/MAX take a field path (mapped to its qualified column) OR a\n// compute expression (compiled to SQL). count stays a plain field/`*`.\nconst aggArg = (arg: string | ComputeExpression, ctx: CompilationContext): string =>\n typeof arg === 'string' ? columnOf(arg, ctx) : compileCompute(arg, ctx);\n\nexport const compileAggregate = (\n expr: AggregateExpression,\n ctx: CompilationContext,\n): string => {\n if ('count' in expr) {\n if (expr.count === '*') return 'COUNT(*)';\n return `COUNT(${columnOf(expr.count, ctx)})`;\n }\n if ('countDistinct' in expr) return `COUNT(DISTINCT ${columnOf(expr.countDistinct, ctx)})`;\n if ('sum' in expr) return `SUM(${aggArg(expr.sum, ctx)})`;\n if ('avg' in expr) return `AVG(${aggArg(expr.avg, ctx)})`;\n if ('min' in expr) return `MIN(${aggArg(expr.min, ctx)})`;\n if ('max' in expr) return `MAX(${aggArg(expr.max, ctx)})`;\n return 'NULL';\n};\n\nexport type { CompilationContext };\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 { transaction } = pool;\n const limit = perStatementMs;\n const result =\n limit === undefined || transaction === undefined\n ? await pool.query(query.sql, params)\n : await 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 { z } from 'zod';\nimport { FilterSchema } from '../schemas/filter.schema.js';\nimport type { Filter } from '../schemas/filter.schema.js';\nimport type { FieldOrValue } from '../schemas/value.schema.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Mutation grammar — the WRITE sibling of the query DSL.\n//\n// Closed on purpose. A mutation is authored data (a cache entry seeded by a\n// developer), never generated and never client-supplied: the wire replays a\n// fingerprint, and the def the fingerprint names lives server-side. The\n// grammar rejects the dangerous shapes at parse: `$scope` is unauthorable\n// (identity/tenant is engine-injected — see scopeMutation), and update/delete\n// REQUIRE a `where` (a write with no WHERE touches every row).\n// ═══════════════════════════════════════════════════════════════\n\n// A scalar subquery in value position: read ONE value from another table at\n// write time — `(SELECT field FROM from WHERE ...)`. This is how a statement\n// references a row it cannot otherwise name (e.g. a person found by email).\n// The lookup READS, so the read-phase scope rules of `from` are applied to its\n// WHERE by the engine — a write entry is never a read-scope bypass. The WHERE\n// should hit a unique key: more than one matching row is a runtime error\n// (deliberately — silently picking an arbitrary row would be worse).\nconst LookupSchema = z\n .object({\n $lookup: z\n .object({\n from: z.string().describe('Table the value is read from'),\n field: z.string().describe('Column the subquery returns'),\n where: FilterSchema.describe('Bounds the lookup — should match at most one row'),\n })\n .strict(),\n })\n .strict()\n .describe('Scalar subquery: reads one value from another table at write time; read scope rules apply');\n\n// A value an AUTHORED mutation may set: a literal, a `{ $context }` ref to\n// the caller's runtime values, or a `{ $lookup }` scalar subquery. NOT\n// `$scope` — the engine injects it post-parse, so a stored or injected\n// mutation cannot place, omit, or redirect it. NOT a field path either — a\n// write sets values, it does not read columns.\nconst ValueSchema = z.union([\n z.string(),\n z.number(),\n z.boolean(),\n z.null(),\n z.object({ $context: z.string() }).strict(),\n LookupSchema,\n]);\n\nconst Columns = z\n .record(z.string(), ValueSchema)\n .refine((r) => Object.keys(r).length > 0, { message: 'a write must set at least one column' });\n\n// ── ON CONFLICT ────────────────────────────────────────────────\n// The DB-arbitrated sibling of the `upsert` sugar below. `upsert` branches on\n// what the CALLER sent (key present → update); `onConflict` branches on what\n// the DATABASE holds (row exists → update/nothing), atomically. `target` must\n// name a unique constraint — validated against the introspected schema, so an\n// ON CONFLICT that arrests nothing is an authoring error, not a runtime\n// surprise. `set` present → DO UPDATE SET (RETURNING yields the row on both\n// paths — re-setting one inserted value as a no-op \"touch\" is the idiom for\n// create-or-fetch). `set` absent → DO NOTHING, which returns NO row on\n// conflict; callers can read that absence as \"already existed\".\nconst OnConflictSchema = z\n .object({\n target: z.array(z.string()).min(1).describe('Conflict columns — must match a unique index or the primary key'),\n set: Columns.optional().describe('DO UPDATE SET when the row already exists; omitted → DO NOTHING (no row returned on conflict)'),\n })\n .strict();\n\n// `where` is a real vex `Filter` — `$context`/`$scope` and scope injection\n// behave exactly as they do for reads.\nconst InsertSchema = z.object({ op: z.literal('insert'), table: z.string(), values: Columns, onConflict: OnConflictSchema.optional() }).strict();\nconst UpdateSchema = z.object({ op: z.literal('update'), table: z.string(), set: Columns, where: FilterSchema }).strict();\nconst DeleteSchema = z.object({ op: z.literal('delete'), table: z.string(), where: FilterSchema }).strict();\n\n// ── insertEach ─────────────────────────────────────────────────\n// One INSERT for a caller-sized list — `INSERT ... SELECT ... FROM\n// jsonb_array_elements($items)`. `items` names a context key holding an array\n// of objects; a `{ $item }` value reads a key from the current element (cast\n// to the column's type from the schema); every other value (literal,\n// `$context`, `$lookup`, engine-injected `$scope`) is constant across rows.\n// This is how \"one template row per ticked weekday\" stays a single authored\n// statement instead of a code loop.\nconst ItemRefSchema = z\n .object({ $item: z.string() })\n .strict()\n .describe('insertEach only: a key read from the current element of `items`');\n\nconst EachColumns = z\n .record(z.string(), z.union([ValueSchema, ItemRefSchema]))\n .refine((r) => Object.keys(r).length > 0, { message: 'a write must set at least one column' });\n\nconst InsertEachSchema = z\n .object({\n op: z.literal('insertEach'),\n table: z.string(),\n items: z.object({ $context: z.string() }).strict().describe('Context key holding an array of objects — one inserted row per element'),\n values: EachColumns,\n onConflict: OnConflictSchema.optional(),\n })\n .strict();\n\n// ── Sugar ──────────────────────────────────────────────────────\n// A sugar op rewrites to the core ops above before anything runs (see\n// desugarMutation). `upsert` is insert-or-update keyed on `key`: present in\n// the call's context → update that row, absent/empty → insert.\nconst UpsertSchema = z\n .object({\n op: z.literal('upsert'),\n table: z.string(),\n columns: Columns, // set on BOTH branches (update SET, and part of the insert)\n insert: Columns.optional(), // extra columns set ONLY on insert — immutable-on-create (e.g. a FK)\n key: z.string(),\n })\n .strict()\n .describe('Sugar: insert-or-update by `key` (e.g. \"id\"). Desugars to update (SET columns WHERE key) when the key is present, else insert (columns + `insert`-only).');\n\nexport const MutationSchema = z.discriminatedUnion('op', [InsertSchema, InsertEachSchema, UpdateSchema, DeleteSchema, UpsertSchema]);\nexport type Mutation = z.infer<typeof MutationSchema>;\n\n// The core ops a sugar desugars TO — what the pipeline (scope/validate/\n// compile) actually handles. `upsert` never reaches them.\nexport type CoreMutation = Exclude<Mutation, { op: 'upsert' }>;\n\n// One write, or a batch run together in a single transaction.\nexport const MutationDefinitionSchema = z.union([MutationSchema, MutationSchema.array().min(1)]);\nexport type MutationDefinition = z.infer<typeof MutationDefinitionSchema>;\n\n// The value shapes as the ENGINE sees them (authored + injected).\nexport type LookupValue = { $lookup: { from: string; field: string; where: Filter } };\nexport type ItemRef = { $item: string };\nexport type MutationValue = FieldOrValue | LookupValue;\n\n// After scopeMutation the engine may have injected `{ $scope }` refs that the\n// authored grammar forbids — so the resolved form's columns widen to the full\n// `MutationValue`. It may also have widened `onConflict` with a `where` (the\n// RLS filter on the DO UPDATE half — `match` rules land there when the\n// conflict target does not already pin them). Authored (`Mutation`) →\n// resolved is a pure widening.\nexport type ResolvedOnConflict = { target: string[]; set?: Record<string, MutationValue>; where?: Filter };\nexport type ResolvedMutation =\n | { op: 'insert'; table: string; values: Record<string, MutationValue>; onConflict?: ResolvedOnConflict }\n | { op: 'insertEach'; table: string; items: { $context: string }; values: Record<string, MutationValue | ItemRef>; onConflict?: ResolvedOnConflict }\n | { op: 'update'; table: string; set: Record<string, MutationValue>; where: Filter }\n | { op: 'delete'; table: string; where: Filter };\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 type { Query } from '../schemas/query.schema.js';\nimport type { Filter } from '../schemas/filter.schema.js';\nimport type { DatabaseSchema } from '../schemas/database.schema.js';\nimport type { Mutation, MutationDefinition, CoreMutation } from './schema.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Context signatures — the derived input contract of a cache entry.\n//\n// A fingerprint hides the def; the def contains `{ $context }` refs; the refs\n// sit at positions whose column types the schema knows. So the contract of\n// \"what do I pass this fingerprint\" is COMPUTED from the artifact — walked\n// out of the stored DSL/def — never authored, and therefore never stale.\n// Discovery serves it; the mutation error path teaches it.\n// ═══════════════════════════════════════════════════════════════\n\nexport type ContextField = { type: string; column?: string; note?: string };\nexport type ContextSignature = Record<string, ContextField>;\nexport type MutationEffect = { op: Mutation['op']; table: string; columns: string[] };\n\nconst isContextRef = (v: unknown): v is { $context: string } =>\n v !== null && typeof v === 'object' && !Array.isArray(v) && typeof (v as Record<string, unknown>)['$context'] === 'string';\n\nconst columnInfo = (path: string, schema: DatabaseSchema | undefined): ContextField => {\n const [table, field] = path.split('.');\n const entity = schema?.entities.find((e) => e.table === table || e.name === table);\n const f = entity?.fields.find((x) => x.name === field);\n return { type: f?.normalizedType ?? 'unknown', column: path };\n};\n\n// First specific description wins; a later, better-typed sighting upgrades an\n// 'unknown' one. Notes stick once set.\nconst addField = (sig: ContextSignature, key: string, field: ContextField): void => {\n const existing = sig[key];\n if (existing === undefined) {\n sig[key] = field;\n return;\n }\n if (existing.type === 'unknown' && field.type !== 'unknown') {\n sig[key] = { ...field, ...(existing.note !== undefined ? { note: existing.note } : {}) };\n }\n};\n\n// Last-resort sweep: find `{ $context }` anywhere in a value (compute args,\n// exotic filter ops) and record the key with an unknown type.\nconst deepScan = (value: unknown, sig: ContextSignature): void => {\n if (isContextRef(value)) {\n addField(sig, value.$context, { type: 'unknown' });\n return;\n }\n if (Array.isArray(value)) {\n for (const v of value) deepScan(v, sig);\n return;\n }\n if (value !== null && typeof value === 'object') {\n for (const v of Object.values(value)) deepScan(v, sig);\n }\n};\n\n// Comparison positions pair a field path with a value — when the value is a\n// `{ $context }` ref, the path's column gives the ref its type.\nconst COMPARISONS = ['eq', 'neq', 'gt', 'gte', 'lt', 'lte'] as const;\n\nconst walkFilter = (filter: Filter, schema: DatabaseSchema | undefined, sig: ContextSignature): void => {\n const f = filter as Record<string, unknown>;\n for (const op of COMPARISONS) {\n const pair = f[op];\n if (Array.isArray(pair) && pair.length === 2) {\n const [a, b] = pair as [unknown, unknown];\n if (typeof a === 'string' && isContextRef(b)) addField(sig, b.$context, columnInfo(a, schema));\n else if (typeof b === 'string' && isContextRef(a)) addField(sig, a.$context, columnInfo(b, schema));\n else deepScan(pair, sig);\n return;\n }\n }\n if ('in' in f || 'notIn' in f) {\n const [path, target] = (f['in'] ?? f['notIn']) as [string, unknown];\n if (isContextRef(target)) addField(sig, target.$context, { ...columnInfo(path, schema), type: `${columnInfo(path, schema).type}[]` });\n else deepScan(target, sig);\n return;\n }\n if ('like' in f || 'ilike' in f) {\n const [path, v] = (f['like'] ?? f['ilike']) as [string, unknown];\n if (isContextRef(v)) addField(sig, v.$context, { type: 'string', column: path, note: 'pattern' });\n return;\n }\n if ('and' in f || 'or' in f) {\n for (const sub of (f['and'] ?? f['or']) as Filter[]) walkFilter(sub, schema, sig);\n return;\n }\n if ('not' in f) {\n walkFilter(f['not'] as Filter, schema, sig);\n return;\n }\n // isNull / isNotNull carry no values; semantic/fuzzy and anything future get\n // the generic sweep so no ref is ever silently dropped.\n deepScan(f, sig);\n};\n\nconst isLookupRef = (v: unknown): v is { $lookup: { from: string; field: string; where: Filter } } =>\n v !== null && typeof v === 'object' && !Array.isArray(v) && '$lookup' in v;\n\nconst columnsOf = (m: Mutation): Record<string, unknown> =>\n m.op === 'insert' || m.op === 'insertEach'\n ? { ...m.values, ...(m.onConflict?.set ?? {}) }\n : m.op === 'update'\n ? m.set\n : m.op === 'upsert'\n ? { ...m.columns, ...(m.insert ?? {}) }\n : {};\n\nexport const collectMutationContext = (def: MutationDefinition, schema?: DatabaseSchema): ContextSignature => {\n const sig: ContextSignature = {};\n const list = Array.isArray(def) ? def : [def];\n for (const m of list) {\n for (const [col, v] of Object.entries(columnsOf(m))) {\n if (isLookupRef(v)) {\n // The lookup's WHERE binds context like any filter does.\n walkFilter(v.$lookup.where, schema, sig);\n continue;\n }\n if (!isContextRef(v)) continue;\n const insertOnly = m.op === 'upsert' && m.insert !== undefined && col in m.insert;\n addField(sig, v.$context, { ...columnInfo(`${m.table}.${col}`, schema), ...(insertOnly ? { note: 'insert only' } : {}) });\n }\n if (m.op === 'update' || m.op === 'delete') walkFilter(m.where, schema, sig);\n if (m.op === 'insertEach') {\n const itemKeys = Object.values(m.values)\n .filter((v): v is { $item: string } => v !== null && typeof v === 'object' && '$item' in v)\n .map((v) => v.$item);\n sig[m.items.$context] = { type: 'json', note: `array of objects — one inserted row per element${itemKeys.length > 0 ? ` (keys: ${itemKeys.join(', ')})` : ''}` };\n }\n if (m.op === 'upsert') {\n sig[m.key] = { ...columnInfo(`${m.table}.${m.key}`, schema), note: 'upsert key — present updates that row, absent/empty inserts' };\n }\n }\n return sig;\n};\n\nexport const collectQueryContext = (dsl: Query, schema?: DatabaseSchema): ContextSignature => {\n const sig: ContextSignature = {};\n const walkQuery = (q: Query): void => {\n for (const source of q.from) {\n if (typeof source !== 'string') walkQuery(source.query);\n }\n if (q.filter !== undefined) walkFilter(q.filter, schema, sig);\n if (q.compute !== undefined) deepScan(q.compute, sig);\n if (q.aggregate !== undefined) deepScan(q.aggregate, sig);\n };\n walkQuery(dsl);\n return sig;\n};\n\nexport const mutationEffect = (def: MutationDefinition): MutationEffect[] => {\n const list = Array.isArray(def) ? def : [def];\n return list.flatMap((m) => {\n const base: MutationEffect = { op: m.op, table: m.table, columns: Object.keys(columnsOf(m)).sort() };\n // ON CONFLICT DO UPDATE also updates — declare it, so visibility and\n // grants treat the entry as the insert-plus-update it really is.\n const conflictSet = (m.op === 'insert' || m.op === 'insertEach') && m.onConflict?.set !== undefined ? m.onConflict.set : undefined;\n if (conflictSet === undefined) return [base];\n return [base, { op: 'update', table: m.table, columns: Object.keys(conflictSet).sort() }];\n });\n};\n\n// The keys a DESUGARED core mutation actually binds — the hard requirement\n// checked before execution (an upsert's absent key is legal: it selects the\n// insert branch, so requirement is computed after desugaring).\nexport const requiredContextKeys = (m: CoreMutation): string[] => {\n const keys = new Set<string>();\n const cols = m.op === 'insert' || m.op === 'insertEach' ? { ...m.values, ...(m.onConflict?.set ?? {}) } : m.op === 'update' ? m.set : {};\n for (const v of Object.values(cols)) {\n if (isContextRef(v)) keys.add(v.$context);\n else if (isLookupRef(v)) {\n const sub: ContextSignature = {};\n deepScan(v.$lookup.where, sub);\n for (const k of Object.keys(sub)) keys.add(k);\n }\n }\n if (m.op === 'insertEach') keys.add(m.items.$context);\n if (m.op === 'update' || m.op === 'delete') {\n const sub: ContextSignature = {};\n deepScan(m.where, sub);\n for (const k of Object.keys(sub)) keys.add(k);\n }\n return [...keys].sort();\n};\n\n// Authoring lint (run by the seed path): an update/delete whose WHERE binds no\n// `$context` is not caller-bounded — its only row limit is the scope policy.\n// Loud at boot, never at runtime.\n// An `optional` condition is a READ construct. In a WHERE it would mean \"this\n// bound disappears when the caller omits a key\" — which is precisely the\n// unkeyed update the lint below exists to refuse, only reachable by omission\n// rather than by authoring. Writes keep the rule they have always had: every\n// key is mandatory, and a missing one is a hard `missing_context` (see\n// mutations/engine.ts), never a wider statement.\nconst findOptional = (value: unknown): boolean => {\n if (Array.isArray(value)) return value.some(findOptional);\n if (value === null || typeof value !== 'object') return false;\n if ('optional' in value) return true;\n return Object.values(value).some(findOptional);\n};\n\nexport const lintMutation = (def: MutationDefinition): string[] => {\n const issues: string[] = [];\n const list = Array.isArray(def) ? def : [def];\n for (const m of list) {\n if (findOptional(m)) {\n issues.push(`${m.op} on \"${m.table}\" contains an optional condition — a write's bounds cannot depend on what the caller chose to send`);\n }\n if (m.op !== 'update' && m.op !== 'delete') continue;\n const sub: ContextSignature = {};\n deepScan(m.where, sub);\n if (Object.keys(sub).length === 0) {\n issues.push(`${m.op} on \"${m.table}\" has no $context-keyed WHERE — the write is not caller-bounded`);\n }\n }\n return issues;\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","import { compileFilter, compileFieldOrValue, quoteLiteral } from '../adapters/postgres/operators.js';\nimport type { CompilationContext } from '../adapters/postgres/operators.js';\nimport type { ParamSlot, Row } from '../adapters/adapter.types.js';\nimport type { Filter } from '../schemas/filter.schema.js';\nimport type { DatabaseSchema } from '../schemas/database.schema.js';\nimport type { ScopePolicy, ScopeValues, ScopeMatch, ScopeRule } from '../scope/scope.types.js';\nimport { isSetMatch } from '../scope/scope.types.js';\nimport { VexScopeError } from '../scope/apply.js';\nimport { VexError } from '../errors.js';\nimport { isFieldPathShape } from '../schemas/identifier.schema.js';\nimport { resolveParams } from '../utils/context.js';\nimport { requireScope } from '../engine/executor.js';\nimport { MutationDefinitionSchema } from './schema.js';\nimport type { Mutation, MutationDefinition, CoreMutation, ResolvedMutation, ResolvedOnConflict, MutationValue, LookupValue, ItemRef } from './schema.js';\nimport { collectMutationContext, requiredContextKeys } from './signature.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Mutation engine — the write pipeline. Validate (closed grammar, bounded\n// WHERE) → desugar → require context → scope (RLS + identity stamp) → check\n// columns → compile → execute. Every gate runs before a single statement\n// does. Reuses the read pipeline's own machinery for SQL and params\n// (compileFilter / compileFieldOrValue / resolveParams), so values bind as\n// SQL parameters exactly as they do for reads — never inlined.\n// ═══════════════════════════════════════════════════════════════\n\n// The database the writes run against — structural, so PGlite, a pg Pool\n// wrapper, or a test double all fit without vex importing any driver.\nexport type MutationTx = {\n query: (sql: string, params?: unknown[]) => Promise<{ rows: unknown[] }>;\n};\nexport type MutationClient = MutationTx & {\n transaction?: <T>(fn: (tx: MutationTx) => Promise<T>) => Promise<T>;\n};\n\n// ─── Value guards ──────────────────────────────────────────────\nconst isLookup = (v: unknown): v is LookupValue =>\n v !== null && typeof v === 'object' && !Array.isArray(v) && '$lookup' in v;\nconst isItemRef = (v: unknown): v is ItemRef =>\n v !== null && typeof v === 'object' && !Array.isArray(v) && '$item' in v;\n\nconst collectLookups = (m: ResolvedMutation): LookupValue['$lookup'][] => {\n const out: LookupValue['$lookup'][] = [];\n const scan = (cols: Record<string, unknown> | undefined): void => {\n for (const v of Object.values(cols ?? {})) if (isLookup(v)) out.push(v.$lookup);\n };\n if (m.op === 'insert' || m.op === 'insertEach') {\n scan(m.values);\n scan(m.onConflict?.set);\n }\n if (m.op === 'update') scan(m.set);\n return out;\n};\n\n// ─── Schema validation (anti-hallucination) ────────────────────\n// The engine already introspected for reads; reject an unknown table or a\n// written column not in it. A misauthored `contats` / `naem` fails closed,\n// before any SQL runs.\nconst findEntity = (table: string, schema: DatabaseSchema) =>\n schema.entities.find((e) => e.table === table || e.name === table);\n\n// An ON CONFLICT whose target names no unique constraint never arrests\n// anything — the insert would simply throw on the real constraint, or worse,\n// never conflict at all. The schema knows the unique column sets (PK +\n// introspected unique indexes), so a mismatched target is an AUTHORING error,\n// caught before any SQL runs, with the real options in the message.\nconst assertConflictTarget = (table: string, target: string[], entity: { fields: { name: string; primaryKey: boolean }[]; indexes: { fields: string[]; unique: boolean }[] }): void => {\n const uniqueSets = [\n entity.fields.filter((f) => f.primaryKey).map((f) => f.name),\n ...entity.indexes.filter((i) => i.unique).map((i) => [...i.fields]),\n ].filter((s) => s.length > 0);\n if (uniqueSets.length === 0) return; // the schema carries no uniqueness info — nothing to check against\n const want = new Set(target);\n const ok = uniqueSets.some((s) => s.length === want.size && s.every((c) => want.has(c)));\n if (!ok) {\n throw new VexError(\n 'invalid_dsl',\n `onConflict target (${target.join(', ')}) does not match a unique constraint on \"${table}\". Unique column sets: ${uniqueSets.map((s) => `(${s.join(', ')})`).join(' ')}.`,\n );\n }\n};\n\n// Every column a write's filter names — field positions, and value positions\n// shaped like a column (the same rule the read compiler uses to tell a column\n// from a literal). A field position is collected whatever it looks like, so a\n// string that is not a column is refused by the check below instead of being\n// compiled.\nconst filterColumns = (filter: Filter): string[] => {\n const out: string[] = [];\n const value = (v: unknown): void => {\n if (isFieldPathShape(v)) out.push(v);\n };\n const walk = (f: Filter): void => {\n if ('and' in f) return f.and.forEach(walk);\n if ('or' in f) return f.or.forEach(walk);\n if ('not' in f) return walk(f.not);\n if ('eq' in f) return f.eq.forEach(value);\n if ('neq' in f) return f.neq.forEach(value);\n if ('gt' in f) return f.gt.forEach(value);\n if ('gte' in f) return f.gte.forEach(value);\n if ('lt' in f) return f.lt.forEach(value);\n if ('lte' in f) return f.lte.forEach(value);\n if ('in' in f || 'notIn' in f) {\n const [field, target] = 'in' in f ? f.in : f.notIn;\n out.push(field);\n if (Array.isArray(target)) target.forEach(value);\n return;\n }\n if ('like' in f || 'ilike' in f) {\n const [field, pattern] = 'like' in f ? f.like : f.ilike;\n out.push(field);\n return value(pattern);\n }\n if ('isNull' in f) return void out.push(f.isNull);\n if ('isNotNull' in f) return void out.push(f.isNotNull);\n if ('semantic' in f) return void out.push(f.semantic.field);\n if ('fuzzy' in f) return void out.push(f.fuzzy.field);\n // `exists` and `optional` have no single-table meaning in a write; the\n // compiler refuses both loudly.\n };\n walk(filter);\n return out;\n};\n\n// A write's filter reads ONE table — the one it writes, or the one a `$lookup`\n// reads — and every column it names must be that table's. This is what makes\n// the compiler's identity mapping below safe: nothing reaches it that the\n// schema does not have.\nconst assertFilterColumns = (filter: Filter, table: string, schema: DatabaseSchema, where: string): void => {\n const entity = findEntity(table, schema);\n if (entity === undefined) throw new VexError('invalid_dsl', `Unknown table \"${table}\" in ${where}.`);\n for (const path of filterColumns(filter)) {\n const dot = path.indexOf('.');\n const owner = path.slice(0, dot);\n const column = path.slice(dot + 1);\n if (!isFieldPathShape(path) || owner !== table || !entity.fields.some((f) => f.name === column)) {\n throw new VexError('invalid_dsl', `\"${path}\" in ${where} is not a column of \"${table}\".`);\n }\n }\n};\n\nconst assertWritableColumns = (m: ResolvedMutation, schema: DatabaseSchema): void => {\n const entity = findEntity(m.table, schema);\n if (entity === undefined) throw new VexError('invalid_dsl', `Unknown table \"${m.table}\".`);\n if (m.op === 'update' || m.op === 'delete') assertFilterColumns(m.where, m.table, schema, 'the WHERE');\n const known = new Set(entity.fields.map((f) => f.name));\n const cols = m.op === 'insert' || m.op === 'insertEach' ? Object.keys(m.values) : m.op === 'update' ? Object.keys(m.set) : [];\n for (const c of cols) {\n if (!known.has(c)) throw new VexError('invalid_dsl', `Unknown column \"${m.table}.${c}\".`);\n }\n // A lookup reads a real table and column, or fails closed like any other\n // misauthored name.\n for (const l of collectLookups(m)) {\n const le = findEntity(l.from, schema);\n if (le === undefined) throw new VexError('invalid_dsl', `Unknown table \"${l.from}\" in $lookup.`);\n if (!le.fields.some((f) => f.name === l.field)) throw new VexError('invalid_dsl', `Unknown column \"${l.from}.${l.field}\" in $lookup.`);\n assertFilterColumns(l.where, l.from, schema, 'a $lookup');\n }\n if ((m.op === 'insert' || m.op === 'insertEach') && m.onConflict !== undefined) {\n for (const c of [...m.onConflict.target, ...Object.keys(m.onConflict.set ?? {})]) {\n if (!known.has(c)) throw new VexError('invalid_dsl', `Unknown column \"${m.table}.${c}\" in onConflict.`);\n }\n assertConflictTarget(m.table, m.onConflict.target, entity);\n if (m.onConflict.where !== undefined) assertFilterColumns(m.onConflict.where, m.table, schema, 'onConflict');\n }\n};\n\n// ─── Scope — applied by the ENGINE, never authored in the DSL ──\n// The same `ScopePolicy` reads use, its write-phase rules applied AFTER the\n// entry is parsed — so identity/tenant binding can't be touched by a stored\n// or injected mutation. `write` is the UMBRELLA phase (grants + rules for\n// insert/update/delete); the specific phases refine it — an op is allowed\n// iff its specific phase or `write` exists, and its rules are the umbrella's\n// plus the specific's. Mechanics: a `set` writes its column from scope on\n// each column-writing op (insert values, update set) — delete writes no\n// columns, so it is structurally exempt, not special-cased. A `match` pins\n// its column on insert and ANDs a filter into update/delete WHERE (the RLS\n// boundary). No applicable phase (or unlisted table) falls to `default`:\n// deny throws, allow leaves the mutation ungoverned.\n// A `$lookup` READS its table, so the read-phase rules of THAT table apply —\n// a mutation entry is never a read-scope bypass. Match rules AND into the\n// lookup's WHERE; a table the principal cannot read refuses the whole write.\nconst readMatchesFor = (table: string, policy: ScopePolicy): ScopeMatch[] => {\n const rule = policy.entities[table];\n if (rule === undefined) {\n if (policy.default === 'deny') throw new VexScopeError(table, `A $lookup reads \"${table}\", which is not allowed by scope policy (default: deny).`);\n return [];\n }\n if ('public' in rule) return [];\n if ('deny' in rule) throw new VexScopeError(table, `A $lookup reads \"${table}\", which is denied by scope policy.`);\n if (rule.read === undefined) {\n if (policy.default === 'deny') throw new VexScopeError(table, `A $lookup reads \"${table}\", which this principal has no read grant for.`);\n return [];\n }\n return rule.read;\n};\n\n// ONE SPELLING of the RLS boundary, for every place a match rule becomes a\n// WHERE — a `$lookup`'s filter, an ON CONFLICT DO UPDATE, an UPDATE and a\n// DELETE. Four copies of `{ eq: [...] }` is four places a new match shape has\n// to be remembered, and the one that was forgotten would be the hole.\nconst boundaryOf = (table: string, r: ScopeMatch): Filter =>\n isSetMatch(r) ? { in: [`${table}.${r.match}`, { $scope: r.in }] } : { eq: [`${table}.${r.match}`, { $scope: r.to }] };\n\nconst scopeLookups = <V extends MutationValue | ItemRef>(cols: Record<string, V>, policy: ScopePolicy): Record<string, V> => {\n const out: Record<string, V> = {};\n for (const [k, v] of Object.entries(cols)) {\n if (!isLookup(v)) {\n out[k] = v;\n continue;\n }\n let where: Filter = v.$lookup.where;\n for (const r of readMatchesFor(v.$lookup.from, policy)) {\n where = { and: [where, boundaryOf(v.$lookup.from, r)] };\n }\n // A scoped lookup is still a lookup — the transform is type-preserving.\n out[k] = { $lookup: { ...v.$lookup, where } } as V;\n }\n return out;\n};\n\n// The gate every write passes: throws when denied, returns `undefined` when\n// the table is ungoverned (public / default allow), else the entity rule and\n// the applicable phase rules (umbrella + specific).\ntype WriteGate = { rule: Extract<ScopePolicy['entities'][string], { read?: unknown }>; rules: readonly ScopeRule[] };\n\nconst writeGate = (table: string, op: 'insert' | 'update' | 'delete', policy: ScopePolicy): WriteGate | undefined => {\n const rule = policy.entities[table];\n if (rule === undefined) {\n if (policy.default === 'deny') throw new VexScopeError(table, `Writes to \"${table}\" are not allowed by scope policy (default: deny).`);\n return undefined;\n }\n if ('public' in rule) return undefined;\n if ('deny' in rule) throw new VexScopeError(table, `Writes to \"${table}\" are denied by scope policy.`);\n const specific = op === 'insert' ? rule.insert : op === 'update' ? rule.update : rule.delete;\n if (rule.write === undefined && specific === undefined) {\n if (policy.default === 'deny') throw new VexScopeError(table, `\"${op}\" on \"${table}\" is not allowed by scope policy (default: deny).`);\n return undefined;\n }\n return { rule, rules: [...(rule.write ?? []), ...(specific ?? [])] };\n};\n\n// The shared insert-shaped half: lookups scoped, insert rules applied to the\n// values, and the ON CONFLICT half gated and governed as the UPDATE it is.\n// `set` rules stamp identity into the DO UPDATE SET; `match` rules whose\n// column the conflict target already pins are inherently satisfied (the\n// inserted, scope-pinned value must equal the existing row's for a conflict\n// to arise at all); any other `match` becomes a WHERE on the DO UPDATE half —\n// the RLS boundary again.\nconst scopeInsertParts = <V extends MutationValue | ItemRef>(\n table: string,\n rawValues: Record<string, V>,\n rawConflict: ResolvedOnConflict | undefined,\n policy: ScopePolicy,\n): { values: Record<string, V | { $scope: string }>; conflict: ResolvedOnConflict | undefined } => {\n let values: Record<string, V | { $scope: string }> = scopeLookups(rawValues, policy);\n let conflict: ResolvedOnConflict | undefined =\n rawConflict === undefined || rawConflict.set === undefined ? rawConflict : { ...rawConflict, set: scopeLookups(rawConflict.set, policy) };\n\n const gate = writeGate(table, 'insert', policy);\n if (gate === undefined) return { values, conflict };\n\n for (const r of gate.rules) {\n // A WRITE'S SUBJECT IS ONE VALUE, AND THIS IS WHERE THAT IS ENFORCED.\n //\n // A `match` on an INSERT does not filter — there is no row yet — it WRITES\n // the column, which is what makes \"insert outside your boundary\"\n // unsayable rather than merely refused. A set has no single value to\n // write, so there is no honest thing to do with one here.\n //\n // Throwing rather than picking, ignoring, or compiling a guard: a reach\n // that covers several rows for READING must not silently become a reach\n // that lets a caller CHOOSE which of them to write as. A write's subject\n // comes from scope (one value) or through a `$lookup` whose own read\n // rules the engine applies — never from a set the caller indexes into.\n if ('match' in r && isSetMatch(r)) {\n throw new VexScopeError(\n table,\n `Scope rule for \"${table}\" is set-valued (\"${r.match}\" in \"${r.in}\") and cannot pin an INSERT — a write's subject must be a single value. Use a scalar match, or carry the subject in a $lookup whose own read rules bound it.`,\n );\n }\n // A `set` writes identity; a scalar `match` pins the RLS boundary — on an\n // INSERT both land in the values.\n values = { ...values, ['set' in r ? r.set : r.match]: { $scope: r.to } };\n }\n\n if (conflict?.set !== undefined) {\n if (gate.rule.write === undefined && gate.rule.update === undefined) {\n throw new VexScopeError(table, `onConflict on \"${table}\" declares DO UPDATE, but this principal has no update grant.`);\n }\n for (const r of [...(gate.rule.write ?? []), ...(gate.rule.update ?? [])]) {\n if ('set' in r) {\n conflict = { ...conflict, set: { ...(conflict.set ?? {}), [r.set]: { $scope: r.to } } };\n } else if (!conflict.target.includes(r.match)) {\n const boundary = boundaryOf(table, r);\n conflict = { ...conflict, where: conflict.where === undefined ? boundary : { and: [conflict.where, boundary] } };\n }\n }\n }\n\n return { values, conflict };\n};\n\nconst scopeMutation = (m: CoreMutation, policy: ScopePolicy): ResolvedMutation => {\n if (m.op === 'insert') {\n const { values, conflict } = scopeInsertParts(m.table, m.values, m.onConflict, policy);\n return { op: 'insert', table: m.table, values, ...(conflict === undefined ? {} : { onConflict: conflict }) };\n }\n if (m.op === 'insertEach') {\n const { values, conflict } = scopeInsertParts(m.table, m.values, m.onConflict, policy);\n return { op: 'insertEach', table: m.table, items: m.items, values, ...(conflict === undefined ? {} : { onConflict: conflict }) };\n }\n if (m.op === 'update') {\n let set: Record<string, MutationValue> = scopeLookups(m.set, policy);\n let where: Filter = m.where;\n const gate = writeGate(m.table, 'update', policy);\n if (gate !== undefined) {\n for (const r of gate.rules) {\n // The column is written from scope on insert AND update alike.\n if ('set' in r) set = { ...set, [r.set]: { $scope: r.to } };\n // RLS boundary on update — AND the scope filter into WHERE. A set is\n // safe HERE, unlike on insert: the rows already exist and this only\n // narrows which of them may be touched.\n else where = { and: [where, boundaryOf(m.table, r)] };\n }\n }\n return { op: 'update', table: m.table, set, where };\n }\n // delete — writes no columns, so `set` rules are structurally exempt.\n let where: Filter = m.where;\n const gate = writeGate(m.table, 'delete', policy);\n if (gate !== undefined) {\n for (const r of gate.rules) {\n if ('match' in r) where = { and: [where, boundaryOf(m.table, r)] };\n }\n }\n return { op: 'delete', table: m.table, where };\n};\n\n// ─── Compile (reuses the read pipeline's SQL + param machinery) ─\n// Only the INSERT/UPDATE/DELETE skeleton is assembled here; vex's\n// `compileFieldOrValue` / `compileFilter` fill the fragments and accumulate\n// the param slots, which `resolveParams` then binds. One catch: for a\n// comparison, vex quotes an unmapped `entity.field` as a STRING LITERAL (it\n// can't know it's a column). A single-table write has no resolver to build\n// the alias map, so we seed it ourselves — identity-mapping each `where`\n// field path to itself, which a single-table UPDATE/DELETE qualifies fine.\ntype Compiled = { sql: string; slots: ParamSlot[] };\n\nconst newCtx = (): CompilationContext => ({\n resolvedPaths: new Map(),\n aliasMap: new Map(),\n paramSlots: [],\n paramCounter: { value: 0 },\n});\n\n// Every column the filter names maps to itself — a single-table statement\n// qualifies `table.column` fine. Only ever called on a filter\n// `assertFilterColumns` has already held to the table's real columns.\nconst indexFilterFields = (filter: Filter, aliasMap: Map<string, string>): void => {\n for (const path of filterColumns(filter)) aliasMap.set(path, path);\n};\n\n// A value that may be a `$lookup` compiles to a scalar subquery INLINE, into\n// the parent's own parameter counter and slot list — the same no-renumbering\n// rule EXISTS follows on the read side.\nconst compileValue = (v: MutationValue, ctx: CompilationContext): string => {\n if (isLookup(v)) {\n indexFilterFields(v.$lookup.where, ctx.aliasMap);\n const where = compileFilter(v.$lookup.where, ctx);\n return `(SELECT ${v.$lookup.field} FROM ${v.$lookup.from} WHERE ${where})`;\n }\n return compileFieldOrValue(v, ctx);\n};\n\n// A value written into a json/jsonb column: the slot its context value binds\n// through is marked, so the array or object goes over the wire as JSON text.\nconst compileColumnValue = (table: string, column: string, v: MutationValue, ctx: CompilationContext, schema: DatabaseSchema): string => {\n const before = ctx.paramSlots.length;\n const sql = compileValue(v, ctx);\n const json = findEntity(table, schema)?.fields.find((f) => f.name === column)?.normalizedType === 'json';\n if (json && typeof v === 'object' && v !== null && '$context' in v) {\n const slot = ctx.paramSlots[before];\n if (slot !== undefined) ctx.paramSlots[before] = { ...slot, encode: 'json' };\n }\n return sql;\n};\n\nconst compileConflict = (m: { table: string; onConflict?: ResolvedOnConflict }, ctx: CompilationContext, schema: DatabaseSchema): string => {\n const c = m.onConflict;\n if (c === undefined) return '';\n if (c.set === undefined) return ` ON CONFLICT (${c.target.join(', ')}) DO NOTHING`;\n const sets = Object.entries(c.set).map(([col, v]) => `${col} = ${compileColumnValue(m.table, col, v, ctx, schema)}`);\n let where = '';\n if (c.where !== undefined) {\n indexFilterFields(c.where, ctx.aliasMap);\n where = ` WHERE ${compileFilter(c.where, ctx)}`;\n }\n return ` ON CONFLICT (${c.target.join(', ')}) DO UPDATE SET ${sets.join(', ')}${where}`;\n};\n\n// jsonb `->>` yields text; the cast restores the column's type so the INSERT\n// binds like any other. `json` columns keep `->` (stays jsonb, no cast).\nconst ITEM_CAST: Record<string, string> = {\n number: 'numeric',\n boolean: 'boolean',\n date: 'date',\n timestamp: 'timestamptz',\n uuid: 'uuid',\n};\n\n\nconst compileMutation = (m: ResolvedMutation, schema: DatabaseSchema): Compiled => {\n const ctx = newCtx();\n if (m.op === 'insert') {\n const entries = Object.entries(m.values);\n const cols = entries.map(([c]) => c);\n const vals = entries.map(([c, v]) => compileColumnValue(m.table, c, v, ctx, schema));\n return { sql: `INSERT INTO ${m.table} (${cols.join(', ')}) VALUES (${vals.join(', ')})${compileConflict(m, ctx, schema)} RETURNING *`, slots: ctx.paramSlots };\n }\n if (m.op === 'insertEach') {\n const entity = findEntity(m.table, schema);\n const entries = Object.entries(m.values);\n const cols = entries.map(([c]) => c);\n const exprs = entries.map(([col, v]) => {\n if (isItemRef(v)) {\n const nt = entity?.fields.find((f) => f.name === col)?.normalizedType ?? 'string';\n if (nt === 'json') return `(item.value->${quoteLiteral(v.$item)})`;\n const cast = ITEM_CAST[nt];\n const raw = `(item.value->>${quoteLiteral(v.$item)})`;\n return cast === undefined ? raw : `${raw}::${cast}`;\n }\n return compileValue(v, ctx);\n });\n ctx.paramCounter.value += 1;\n ctx.paramSlots.push({ key: m.items.$context, kind: 'context', type: 'json' });\n const source = `jsonb_array_elements($${ctx.paramCounter.value}::jsonb) AS item`;\n return {\n sql: `INSERT INTO ${m.table} (${cols.join(', ')}) SELECT ${exprs.join(', ')} FROM ${source}${compileConflict(m, ctx, schema)} RETURNING *`,\n slots: ctx.paramSlots,\n };\n }\n if (m.op === 'update') {\n const sets = Object.entries(m.set).map(([c, v]) => `${c} = ${compileColumnValue(m.table, c, v, ctx, schema)}`);\n indexFilterFields(m.where, ctx.aliasMap);\n const where = compileFilter(m.where, ctx);\n return { sql: `UPDATE ${m.table} SET ${sets.join(', ')} WHERE ${where} RETURNING *`, slots: ctx.paramSlots };\n }\n indexFilterFields(m.where, ctx.aliasMap);\n const where = compileFilter(m.where, ctx);\n return { sql: `DELETE FROM ${m.table} WHERE ${where} RETURNING *`, slots: ctx.paramSlots };\n};\n\n// ─── Desugar (sugar → core) ────────────────────────────────────\n// Rewrite each sugar op to a core insert/update/delete BEFORE context/scope/\n// validate/compile, so those stages only ever see the three primitives.\nconst SUGAR: { [K in Mutation['op']]?: (m: Extract<Mutation, { op: K }>, context: Record<string, unknown>) => CoreMutation } = {\n upsert: (m, context) => {\n const keyed = context[m.key] !== undefined && context[m.key] !== '';\n return keyed\n ? { op: 'update', table: m.table, set: m.columns, where: { eq: [`${m.table}.${m.key}`, { $context: m.key }] } }\n : { op: 'insert', table: m.table, values: { ...m.columns, ...m.insert } };\n },\n};\n\nconst desugarMutation = (m: Mutation, context: Record<string, unknown>): CoreMutation => {\n const rewrite = SUGAR[m.op] as ((m: Mutation, c: Record<string, unknown>) => CoreMutation) | undefined;\n return rewrite === undefined ? (m as CoreMutation) : rewrite(m, context);\n};\n\n// ─── Execute ───────────────────────────────────────────────────\nexport type MutationContext = {\n context: Record<string, unknown>; // dynamic values for `$context` refs (the caller's data)\n scope: ScopeValues; // server-injected values for `$scope` refs (identity / tenant)\n policy: ScopePolicy;\n schema: DatabaseSchema;\n};\n\n// One executed statement, named by what it did: the table, the op that\n// actually ran (post-desugar — an upsert reports the branch it took, an\n// insertEach reports 'insert' because that is what it is), and the rows the\n// database returned. This is the grain a write observer needs: a two-\n// statement mutation is two writes, each with its own rows.\nexport type WriteResult = { table: string; op: 'insert' | 'update' | 'delete'; rows: Row[] };\n\nexport const executeWrites = async (client: MutationClient, def: MutationDefinition, mctx: MutationContext): Promise<WriteResult[]> => {\n const parsed = MutationDefinitionSchema.parse(def);\n const entries = Array.isArray(parsed) ? parsed : [parsed];\n const compiled = entries.map((entry) => {\n const core = desugarMutation(entry, mctx.context);\n // A write never executes with holes: every `$context` the (desugared)\n // statement binds must be present. The error teaches the WHOLE contract.\n const missing = requiredContextKeys(core).filter((k) => mctx.context[k] === undefined);\n if (missing.length > 0) {\n throw new VexError('missing_context', `Mutation is missing context: ${missing.join(', ')}.`, {\n expected: collectMutationContext(parsed, mctx.schema),\n });\n }\n const m = scopeMutation(core, mctx.policy);\n assertWritableColumns(m, mctx.schema);\n const statement = compileMutation(m, mctx.schema);\n // A `set` rule with no value would STAMP NULL — an insert owned by nobody,\n // written anyway. Every scope slot is filled or nothing runs.\n requireScope({ paramSlots: statement.slots }, mctx.scope);\n return { ...statement, table: m.table, op: (m.op === 'insertEach' ? 'insert' : m.op) as WriteResult['op'] };\n });\n\n const runAll = async (q: MutationTx): Promise<WriteResult[]> => {\n const results: WriteResult[] = [];\n for (const c of compiled) {\n const params = await resolveParams(c.slots, mctx.context, mctx.scope);\n // A `json` slot (insertEach items) is bound as a JSON string — drivers\n // would otherwise turn a JS array into a postgres ARRAY literal, which\n // `::jsonb` refuses. Anything but an array fails loudly here.\n const bound = params.map((value, i) => {\n if (c.slots[i]?.encode === 'json') return value !== null && typeof value === 'object' ? JSON.stringify(value) : value;\n if (c.slots[i]?.type !== 'json') return value;\n if (!Array.isArray(value)) {\n throw new VexError('invalid_request', `\"${c.slots[i]?.key ?? ''}\" must be an array of objects (one inserted row per element).`);\n }\n return JSON.stringify(value);\n });\n const res = await q.query(c.sql, bound as unknown[]);\n results.push({ table: c.table, op: c.op, rows: res.rows as Row[] });\n }\n return results;\n };\n\n // A batch runs atomically; a single write needs no transaction.\n if (compiled.length === 1) return runAll(client);\n if (client.transaction === undefined) {\n throw new VexError('execution_error', 'Batch mutations require a transactional client.');\n }\n return client.transaction((tx) => runAll(tx));\n};\n\n// The rows alone, statement order preserved — the shape every existing\n// caller wants when it does not care which statement returned what.\nexport const executeMutation = async (client: MutationClient, def: MutationDefinition, mctx: MutationContext): Promise<Row[]> =>\n (await executeWrites(client, def, mctx)).flatMap((w) => w.rows);\n","import { z } from 'zod';\nimport type { QueryEngine } from './types.js';\nimport type { ScopePolicy, ScopeValues } from './scope/scope.types.js';\nimport type { DatabaseSchema, EntitySchema } from './schemas/database.schema.js';\nimport { QueryRequestSchema } from './schemas/request.schema.js';\nimport { QuerySchema } from './schemas/query.schema.js';\nimport { isEntryFresh, isTouchDue, fireAndForget } from './cache/util.js';\nimport { computeSchemaFingerprint } from './cache/hash.js';\nimport { executeWrites } from './mutations/engine.js';\nimport type { MutationClient, WriteResult } from './mutations/engine.js';\nimport { collectMutationContext, collectQueryContext, mutationEffect } from './mutations/signature.js';\nimport type { ContextSignature, MutationEffect } from './mutations/signature.js';\nimport type { CacheEntry } from './cache/cache.types.js';\nimport type { QueryResponse } from './schemas/request.schema.js';\nimport type { Query } from './schemas/query.schema.js';\nimport { VexError } from './errors.js';\nimport { depthRefusal, exceedsDepth } from '@niscorp/strata';\nimport { canReadTable } from './scope/apply.js';\n\n// ═══════════════════════════════════════════════════════════════\n// Types\n// ═══════════════════════════════════════════════════════════════\n\nexport type VexHandlerConfig = {\n engine: QueryEngine;\n entities?: string[];\n // Replay-only posture (production): requests needing generation fail\n // with 'locked'; fingerprint management (PATCH/DELETE) is refused too.\n // Mutation replay is unaffected — writes are ALWAYS replay-only.\n locked?: boolean;\n // Per-request read policy — overrides the engine default for reads on\n // this request (the read-side twin of `mutations.policy`). A host that\n // resolves a policy per principal passes the SAME policy here and in\n // `mutations.policy`, so reads and writes enforce one principal's phases.\n scopePolicy?: ScopePolicy;\n // Compiles the SAME principal's policy at a named reach, for entries that\n // declare one (`OkCacheEntry.reach`). Vex holds neither grants nor behaviors,\n // so it cannot build this itself — the host does, and returning `undefined`\n // refuses the read rather than serving it at the caller's own, wider reach.\n policyForReach?: (reach: string) => Promise<ScopePolicy | undefined> | ScopePolicy | undefined;\n // Enables replay of `kind: 'mutation'` cache entries. The client is\n // structural (PGlite, a pg wrapper, a test double); the policy is the\n // same ScopePolicy reads use, its `write` rules applied by the engine.\n mutations?: {\n client: MutationClient;\n policy: ScopePolicy;\n // The write observer. Fired once per successful mutation replay, AFTER\n // the commit — per-statement writes with the rows the database returned,\n // plus the scope the request could not forge. Vex is the choke point\n // every write passes through, so this is where a host learns about all\n // of them; what the host does with the news (mint facts, wake shells)\n // is not the engine's business. A listener that throws cannot unwrite\n // a committed write, so its error is contained, never the request's.\n onWrite?: (event: WriteEvent) => void;\n };\n // The execution observer — the read/write twin of `mutations.onWrite`, and\n // vex's whole telemetry surface. Fired once per `handleQuery`, AFTER the\n // outcome is known, with vex-vocabulary facts (fingerprint, reach, cache,\n // rows, status, timing) and the unforgeable scope. Vex knows nothing of spans\n // or OTLP; a host maps this record to whatever it emits. Absent → not even the\n // record is built (see `handleQuery`), so an unobserved endpoint pays nothing.\n // A listener that throws is contained, never the request's.\n onExecute?: (record: ExecuteRecord) => void;\n};\n\nexport type WriteEvent = { fingerprint: string; writes: WriteResult[]; scope: ScopeValues };\n\n// A CALLER THAT FOLLOWS THE ANSWER. In-process only: an HTTP request cannot\n// carry a callback, so a host that runs its own clients next to the handler\n// (moss's server shells) passes one here, and a reactive entry keeps\n// answering through it until `signal` aborts. See `refresh` on an entry.\nexport type VexLive = {\n signal: AbortSignal;\n onChange: (response: QueryResponse) => void;\n};\n\n// WHICH TABLES A WRITE CHANGED. The statements' own tables, plus — for a\n// delete — every table that references one of them, transitively: an\n// `ON DELETE CASCADE` or `SET NULL` changes rows vex never wrote. The\n// introspected schema carries the reference but not its rule, so a delete is\n// assumed to reach every referencing table. Over-telling costs a refetch;\n// under-telling leaves a screen stale.\nexport const tablesChangedBy = (writes: readonly WriteResult[], schema: DatabaseSchema | undefined): string[] => {\n const changed = new Set<string>();\n const referencing = (table: string): string[] =>\n (schema?.entities.find((entity) => entity.name === table)?.relations ?? [])\n .filter((relation) => relation.type !== 'belongsTo')\n .map((relation) => relation.entity);\n for (const write of writes) {\n if (write.rows.length === 0) continue;\n changed.add(write.table);\n if (write.op !== 'delete') continue;\n const pending = [write.table];\n for (let next = pending.pop(); next !== undefined; next = pending.pop()) {\n for (const table of referencing(next)) {\n if (changed.has(table)) continue;\n changed.add(table);\n pending.push(table);\n }\n }\n }\n return [...changed];\n};\n\n// What one execution DID, in vex's own vocabulary — the record `onExecute`\n// hands a host. Not a span: vex holds no telemetry model, so a host maps these\n// facts to whatever it emits. `startUnixNano`/`endUnixNano` are epoch nanos at\n// millisecond anchoring with a sub-millisecond monotonic span between them —\n// exact enough for durations, coarse in the low bits — copied through verbatim.\nexport type ExecuteRecord = {\n kind: 'query' | 'mutation';\n status: 'ok' | 'error' | 'refused';\n fingerprint?: string;\n reach?: string;\n // Reads: whether the entry was already compiled. Mutations always replay.\n cacheHit?: boolean;\n // Rows returned (reads) or written (mutations).\n rows?: number;\n startUnixNano: number;\n endUnixNano: number;\n // The scope the request could not forge, passed exactly as `onWrite` passes\n // it — for a host to read principal PRESENCE from, never a value into a span.\n scope: ScopeValues;\n};\n\n// The mutable half of the record, filled by `runQuery` as it goes and read once\n// by `handleQuery`. Built only when an observer is attached.\ntype ExecuteProbe = {\n kind: 'query' | 'mutation';\n fingerprint?: string;\n reach?: string;\n cacheHit?: boolean;\n rows?: number;\n};\n\nexport type DiscoveryFingerprint = {\n fingerprint: string;\n kind: 'query' | 'mutation';\n protected: boolean;\n schemaFresh: boolean;\n intent?: string;\n createdAt: number;\n lastUsedAt?: number;\n // The derived input contract: every `$context` key the stored def binds,\n // typed from the schema by its position. Computed, never authored.\n context?: ContextSignature;\n // Reads: the stored result shape. Mutations: what the write changes.\n shape?: unknown;\n effect?: MutationEffect[];\n};\n\nexport type DiscoveryResponse = {\n vex: string;\n description: string;\n entities: DiscoveryEntity[];\n // Governance summary + the endpoint's known queries — self-description\n // an agent (or a management UI) can read before generating anything.\n protection: 'all' | 'some' | 'none';\n locked: boolean;\n fingerprints: DiscoveryFingerprint[];\n query: {\n method: string;\n accepts: string;\n body: Record<string, DiscoveryField>;\n };\n dsl: object;\n};\n\ntype DiscoveryEntity = {\n name: string;\n fields: Array<{\n name: string;\n type: string;\n nullable: boolean;\n primaryKey: boolean;\n }>;\n relations: Array<{\n entity: string;\n type: string;\n via: string[];\n }>;\n rowCount?: number;\n};\n\ntype DiscoveryField = {\n type: string;\n required: boolean;\n description: string;\n};\n// (queryParams are gone — the request body carries all cache semantics.)\n\n// ═══════════════════════════════════════════════════════════════\n// Discovery\n// ═══════════════════════════════════════════════════════════════\n\nconst filterSchema = (schema: DatabaseSchema | undefined, entities?: string[]): EntitySchema[] => {\n if (schema === undefined) return [];\n if (entities === undefined || entities.length === 0) return schema.entities;\n return schema.entities.filter(e => entities.includes(e.name));\n};\n\n// ─── Visibility under a policy — discovery advertises only what the\n// policy can touch. These mirror the ENFORCEMENT semantics (applyScope /\n// scopeMutation) as pure predicates: a phase exists, is public, or falls\n// to the default. Enforcement still runs on every request; this only\n// keeps the catalog honest per principal. ───────────────────────\nconst canWriteTable = (policy: ScopePolicy, table: string, op: string): boolean => {\n const rule = policy.entities[table];\n if (rule === undefined) return policy.default === 'allow';\n if ('public' in rule) return true;\n if ('deny' in rule) return false;\n if (rule.write !== undefined || policy.default === 'allow') return true;\n // insertEach is an insert that happens N times — same phase.\n if (op === 'insert' || op === 'insertEach') return rule.insert !== undefined;\n if (op === 'update') return rule.update !== undefined;\n if (op === 'delete') return rule.delete !== undefined;\n // upsert desugars to insert or update per call — advertise if either exists\n if (op === 'upsert') return rule.insert !== undefined || rule.update !== undefined;\n return false;\n};\n\n// Every table a read touches — string sources, recursing into subquery\n// sources (`{ as, query }`).\nconst collectTables = (dsl: Query): string[] => {\n const out: string[] = [];\n const walk = (q: Query): void => {\n for (const src of q.from) {\n if (typeof src === 'string') out.push(src);\n else walk(src.query);\n }\n };\n walk(dsl);\n return out;\n};\n\nconst entryVisible = (policy: ScopePolicy, entry: CacheEntry): boolean => {\n if (entry.kind === 'ok') return collectTables(entry.dsl).every((t) => canReadTable(policy, t));\n if (entry.kind === 'mutation') return mutationEffect(entry.mutation).every((e) => canWriteTable(policy, e.table, e.op));\n return false;\n};\n\nconst listFingerprints = async (engine: QueryEngine, policy?: ScopePolicy): Promise<DiscoveryFingerprint[]> => {\n if (engine.cache.entries === undefined) return [];\n const schema = engine.getSchema();\n const current = schema !== undefined ? computeSchemaFingerprint(schema) : undefined;\n const rows = await engine.cache.entries();\n return rows\n .filter(({ key, entry }) => (entry.kind === 'ok' || entry.kind === 'mutation') && !key.startsWith('neg:'))\n .filter(({ entry }) => policy === undefined || entryVisible(policy, entry))\n .map(({ key, entry }) => ({\n fingerprint: key,\n kind: entry.kind === 'mutation' ? ('mutation' as const) : ('query' as const),\n protected: entry.protected === true,\n schemaFresh: isEntryFresh(entry, current),\n ...(entry.intent !== undefined ? { intent: entry.intent } : {}),\n createdAt: entry.createdAt,\n ...(entry.lastUsedAt !== undefined ? { lastUsedAt: entry.lastUsedAt } : {}),\n // The derived contract — what to pass, straight from the stored def.\n ...(entry.kind === 'ok'\n ? {\n context: collectQueryContext(entry.dsl, schema),\n ...(entry.shape !== undefined ? { shape: entry.shape } : {}),\n }\n : entry.kind === 'mutation'\n ? {\n context: collectMutationContext(entry.mutation, schema),\n effect: mutationEffect(entry.mutation),\n }\n : {}),\n }));\n};\n\nexport const handleDiscovery = async (config: VexHandlerConfig): Promise<DiscoveryResponse> => {\n const { engine, entities: entityFilter, scopePolicy } = config;\n // Under a scopePolicy, discovery is per-principal: entities and entries\n // the policy cannot touch are not advertised (what you can't reach\n // doesn't exist for you — deny by absence, in the catalog too).\n const filtered = filterSchema(engine.getSchema(), entityFilter).filter(\n (e) => scopePolicy === undefined || canReadTable(scopePolicy, e.name),\n );\n const fingerprints = await listFingerprints(engine, scopePolicy);\n const protectedCount = fingerprints.filter((f) => f.protected).length;\n\n return {\n protection: protectedCount === 0 ? 'none' : protectedCount === fingerprints.length ? 'all' : 'some',\n locked: config.locked === true,\n fingerprints,\n vex: '1.0',\n description: 'Query this resource using natural language or structured DSL',\n entities: filtered.map(e => ({\n name: e.name,\n fields: e.fields.map(f => ({\n name: f.name,\n type: f.normalizedType,\n nullable: f.nullable,\n primaryKey: f.primaryKey,\n })),\n relations: e.relations.map(r => ({\n entity: r.entity,\n type: r.type,\n via: r.localFields,\n })),\n rowCount: e.rowCount,\n })),\n query: {\n method: 'POST',\n accepts: 'application/json',\n body: {\n fingerprint: {\n type: 'string',\n required: false,\n description:\n 'Cache identity. Alone → replay a known query (no generation). With intent+shape → a named slot: ' +\n 'matching request hits, differing request regenerates and replaces (409 when protected). ' +\n 'Omitted → generate fresh; the minted fingerprint returns in meta.cache.fingerprint.',\n },\n intent: {\n type: 'string',\n required: false,\n description: 'Natural language description of what data you need',\n },\n shape: {\n type: 'any',\n required: false,\n description: 'Example of the response structure — use empty strings, zeros, booleans as type indicators. Required unless replaying by fingerprint.',\n },\n context: {\n type: 'Record<string, unknown>',\n required: false,\n description: 'Runtime parameters referenced in filters as { $context: \"key\" }',\n },\n },\n },\n dsl: z.toJSONSchema(QuerySchema, { target: 'draft-7', reused: 'ref' }),\n };\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Query execution\n// ═══════════════════════════════════════════════════════════════\n\nexport type QueryResult = {\n status: number;\n body: unknown;\n};\n\n// Rows an execution touched, for the observer's `rows` — an array's length, a\n// single object as one, nothing as zero. Never inspects the values.\nconst rowsOf = (result: unknown): number =>\n Array.isArray(result) ? result.length : result === null || result === undefined ? 0 : 1;\n\nexport const handleQuery = async (\n config: VexHandlerConfig,\n body: unknown,\n scope: ScopeValues,\n live?: VexLive,\n): Promise<QueryResult> => {\n // Unobserved: the fast path builds no probe, takes no timestamps, allocates\n // no record. An endpoint with no telemetry pays exactly nothing.\n if (config.onExecute === undefined) return runQuery(config, body, scope, undefined, live);\n\n const startUnixNano = Date.now() * 1e6;\n const t0 = elapsedClock();\n const probe: ExecuteProbe = { kind: 'query' };\n const result = await runQuery(config, body, scope, probe, live);\n const record: ExecuteRecord = {\n kind: probe.kind,\n // 200 succeeded; 403 is a policy/reach refusal (a normal outcome, not a\n // fault); everything else is an error.\n status: result.status === 200 ? 'ok' : result.status === 403 ? 'refused' : 'error',\n startUnixNano,\n endUnixNano: startUnixNano + (elapsedClock() - t0) * 1e6,\n scope,\n ...(probe.fingerprint !== undefined ? { fingerprint: probe.fingerprint } : {}),\n ...(probe.reach !== undefined ? { reach: probe.reach } : {}),\n ...(probe.cacheHit !== undefined ? { cacheHit: probe.cacheHit } : {}),\n ...(probe.rows !== undefined ? { rows: probe.rows } : {}),\n };\n try {\n config.onExecute(record);\n } catch (err) {\n console.error('[vex:onExecute]', err);\n }\n return result;\n};\n\n// Sub-millisecond monotonic reading in milliseconds. `performance` is present\n// on every runtime vex targets; the wall clock is the fallback that keeps the\n// duration honest (0) rather than throwing where it is not.\nconst elapsedClock = (): number => (typeof performance !== 'undefined' ? performance.now() : Date.now());\n\nconst runQuery = async (\n config: VexHandlerConfig,\n body: unknown,\n scope: ScopeValues,\n probe: ExecuteProbe | undefined,\n live: VexLive | undefined,\n): Promise<QueryResult> => {\n const { engine } = config;\n\n // Before the schema: a deep enough body overflows it (strata depth.ts).\n if (exceedsDepth(body)) return { status: 400, body: { error: 'invalid_request', message: depthRefusal() } };\n const parsed = QueryRequestSchema.safeParse(body);\n if (!parsed.success) {\n return {\n status: 400,\n body: {\n error: 'invalid_request',\n message: parsed.error.message,\n },\n };\n }\n\n const hasShape = parsed.data.shape !== undefined && parsed.data.shape !== null;\n if (!hasShape && parsed.data.fingerprint === undefined) {\n return {\n status: 400,\n body: {\n error: 'invalid_request',\n message: 'Pass a fingerprint (replay) or intent + shape (generate) — or both (named slot).',\n },\n };\n }\n\n // Recorded before anything can refuse, so a refusal span still carries the\n // fingerprint it refused. A read that mints one overwrites this from meta.\n if (probe !== undefined && parsed.data.fingerprint !== undefined) probe.fingerprint = parsed.data.fingerprint;\n\n try {\n // ONE wire shape: `{ fingerprint, context }`. The entry's kind decides\n // the pipeline — a mutation fingerprint replays the write path; anything\n // else is the read path (which owns misses, generation, and locked).\n let entryReach: string | undefined;\n if (parsed.data.fingerprint !== undefined) {\n const entry = await engine.cache.get(parsed.data.fingerprint);\n if (entry !== undefined && entry.kind === 'ok') entryReach = entry.reach;\n if (probe !== undefined && entryReach !== undefined) probe.reach = entryReach;\n if (entry !== undefined && entry.kind === 'mutation') {\n if (probe !== undefined) {\n probe.kind = 'mutation';\n if (entry.reach !== undefined) probe.reach = entry.reach;\n }\n if (config.mutations === undefined) {\n return {\n status: 500,\n body: { error: 'execution_error', message: 'This endpoint serves no mutations — handler has no mutation client configured.' },\n };\n }\n const schema = engine.getSchema();\n if (schema === undefined) {\n return { status: 500, body: { error: 'execution_error', message: 'Vex schema not introspected.' } };\n }\n // A WRITE MAY DEMAND A NARROWER REACH TOO, and the stakes are higher\n // than for a read: too wide here changes somebody else's row rather\n // than merely showing it.\n let writePolicy = config.mutations.policy;\n if (entry.reach !== undefined) {\n if (config.policyForReach === undefined) {\n return {\n status: 500,\n body: {\n error: 'execution_error',\n message: `Entry \"${parsed.data.fingerprint ?? ''}\" requires reach \"${entry.reach}\" and this handler has no policyForReach.`,\n },\n };\n }\n const narrowed = await config.policyForReach(entry.reach);\n if (narrowed === undefined) {\n return {\n status: 403,\n body: { error: 'scope_denied', message: `Reach \"${entry.reach}\" is not available to this principal.` },\n };\n }\n writePolicy = narrowed;\n }\n\n const writes = await executeWrites(config.mutations.client, entry.mutation, {\n context: parsed.data.context,\n scope,\n policy: writePolicy,\n schema,\n });\n const rows = writes.flatMap((w) => w.rows);\n // Every reactive read over these tables is now stale. Here, not in\n // any host's observer: this is the one door every vex write passes —\n // a request, a server function's `executeAs`, a reflex's effect — and\n // a read that heard about only some of them would be live only\n // sometimes, which is worse than a snapshot that says what it is.\n engine.invalidate(tablesChangedBy(writes, schema));\n // The commit happened; the observer hears about it now, and its\n // failure is its own — the response must tell the truth about a\n // write that already landed.\n if (config.mutations.onWrite !== undefined) {\n try {\n config.mutations.onWrite({ fingerprint: parsed.data.fingerprint, writes, scope });\n } catch (err) {\n console.error('[vex:onWrite]', err);\n }\n }\n // Lifetime = usage, for writes exactly as for reads: stamp\n // lastUsedAt (off the hot path, at most once per TOUCH_EVERY_MS) so\n // the GC sweep sees replays.\n const now = Date.now();\n if (isTouchDue(entry, now)) fireAndForget(engine.cache.set(parsed.data.fingerprint, { ...entry, lastUsedAt: now }));\n if (probe !== undefined) probe.rows = rows.length;\n // A single statement returns its one affected row; a batch returns\n // the array — the same `{ result }` envelope a query reply uses.\n return { status: 200, body: { result: rows.length === 1 ? rows[0] : rows } };\n }\n }\n\n // AN ENTRY MAY REQUIRE A NARROWER REACH THAN ITS CALLER HAS.\n //\n // \"The classes you have booked\" means the caller's own, and a principal\n // holding two roles reaches as wide as either grants. So the entry names\n // the profile it must be served at and the host recompiles the same grants\n // under it — narrowing rows, never widening verbs.\n //\n // Fail closed: a declared reach the host cannot compile refuses the read.\n // Serving it at the caller's own reach is the exact failure the field\n // exists to prevent, and it would be invisible.\n let readPolicy = config.scopePolicy;\n if (entryReach !== undefined) {\n if (config.policyForReach === undefined) {\n return {\n status: 500,\n body: {\n error: 'execution_error',\n message: `Entry \"${parsed.data.fingerprint ?? ''}\" requires reach \"${entryReach}\" and this handler has no policyForReach.`,\n },\n };\n }\n readPolicy = await config.policyForReach(entryReach);\n if (readPolicy === undefined) {\n return {\n status: 403,\n body: { error: 'scope_denied', message: `Reach \"${entryReach}\" is not available to this principal.` },\n };\n }\n }\n\n const response = await engine.execute(parsed.data, {\n scope,\n entities: config.entities,\n ...(config.locked === true ? { locked: true } : {}),\n ...(readPolicy !== undefined ? { scopePolicy: readPolicy } : {}),\n ...(live !== undefined ? { signal: live.signal, onChange: live.onChange } : {}),\n });\n if (probe !== undefined) {\n probe.cacheHit = response.meta.cache.hit;\n // The identity actually served — the caller's replay key, or the one just\n // minted for a miss.\n if (response.meta.cache.fingerprint !== undefined) probe.fingerprint = response.meta.cache.fingerprint;\n probe.rows = rowsOf(response.result);\n }\n return { status: 200, body: response };\n } catch (err) {\n // The host did not say who is asking. That is the server's fault, not the\n // request's, and the names of the missing keys are the host's business —\n // they go to the log, not over the wire.\n if (err instanceof VexError && err.code === 'missing_scope') {\n console.error('[vex] refused a statement the host did not scope:', err.message);\n return { status: 500, body: { error: 'missing_scope', message: 'The server did not supply the scope this request needs.' } };\n }\n if (err instanceof VexError) {\n const status = err.code === 'fingerprint_protected' ? 409 : err.code === 'cache_miss' ? 404 : 400;\n return {\n status,\n body: {\n error: err.code,\n message: err.message,\n details: err.details,\n },\n };\n }\n console.error('[vex] unhandled error:', err);\n const errObj = err as Record<string, unknown> | null;\n const message = err instanceof Error\n ? err.message\n : (typeof errObj?.message === 'string' ? errObj.message : 'Unknown error');\n const code = typeof errObj?.code === 'string' ? errObj.code : 'execution_error';\n return {\n status: 500,\n body: { error: code, message },\n };\n }\n};\n\n// ═══════════════════════════════════════════════════════════════\n// Fingerprint management — protect (PATCH) and evict (DELETE).\n// The ONLY writers of the `protected` bit besides the seed path.\n// ═══════════════════════════════════════════════════════════════\n\nexport const handleFingerprintPatch = async (\n config: VexHandlerConfig,\n fingerprint: string,\n patch: { protected?: boolean },\n): Promise<QueryResult> => {\n if (config.locked === true) {\n return { status: 403, body: { error: 'locked', message: 'This endpoint is locked — fingerprints cannot be managed here.' } };\n }\n const entry = await config.engine.cache.get(fingerprint);\n if (entry === undefined || (entry.kind !== 'ok' && entry.kind !== 'mutation')) {\n return { status: 404, body: { error: 'cache_miss', message: `Unknown fingerprint \"${fingerprint}\"` } };\n }\n if (typeof patch.protected !== 'boolean') {\n return { status: 400, body: { error: 'invalid_request', message: 'Body must be { protected: boolean }' } };\n }\n await config.engine.cache.set(fingerprint, { ...entry, protected: patch.protected });\n return { status: 200, body: { fingerprint, protected: patch.protected } };\n};\n\nexport const handleFingerprintDelete = async (\n config: VexHandlerConfig,\n fingerprint: string,\n): Promise<QueryResult> => {\n if (config.locked === true) {\n return { status: 403, body: { error: 'locked', message: 'This endpoint is locked — fingerprints cannot be managed here.' } };\n }\n const entry = await config.engine.cache.get(fingerprint);\n if (entry === undefined) {\n return { status: 404, body: { error: 'cache_miss', message: `Unknown fingerprint \"${fingerprint}\"` } };\n }\n if ((entry.kind === 'ok' || entry.kind === 'mutation') && entry.protected === true) {\n return { status: 409, body: { error: 'fingerprint_protected', message: `\"${fingerprint}\" is protected — unprotect it first.` } };\n }\n await config.engine.cache.delete(fingerprint);\n return { status: 200, body: { fingerprint, deleted: true } };\n};\n"]}