@nicia-ai/typegraph 0.32.0 → 0.34.0

package/dist/chunk-WNORITK6.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/core/temporal.ts","../src/store/collections/temporal-read-params.ts","../src/store/types.ts","../src/store/store-view.ts","../src/query/subquery-utils.ts","../src/query/predicates.ts","../src/query/compiler/schema.ts","../src/query/compiler/emitter/plan-inspector.ts","../src/query/compiler/emitter/recursive.ts","../src/query/compiler/emitter/set-operations.ts","../src/query/compiler/emitter/standard.ts","../src/query/ast.ts","../src/query/compiler/predicates.ts","../src/query/compiler/predicate-utils.ts","../src/query/compiler/typed-json-extract.ts","../src/query/compiler/emitter/standard-builders.ts","../src/query/compiler/passes/fulltext.ts","../src/query/compiler/passes/fusion.ts","../src/query/compiler/passes/recursive.ts","../src/query/compiler/passes/runner.ts","../src/query/compiler/temporal.ts","../src/query/compiler/passes/temporal.ts","../src/query/compiler/passes/vector.ts","../src/query/compiler/plan/lowering.ts","../src/query/compiler/recursive.ts","../src/query/execution/value-decoder.ts","../src/store/recursive-cte.ts","../src/store/row-mappers.ts","../src/store/subgraph.ts","../src/query/compiler/set-operations.ts","../src/query/compiler/standard-pass-pipeline.ts","../src/query/compiler/index.ts","../src/utils/id.ts","../src/utils/path.ts","../src/query/execution/result-mapper.ts","../src/query/cursor.ts","../src/query/execution/pagination.ts","../src/query/execution/field-tracker.ts","../src/query/execution/selective-result-mapper.ts","../src/query/builder/prepared-query.ts","../src/query/builder/validation.ts","../src/query/builder/ast-builder.ts","../src/query/builder/compile-options.ts","../src/query/builder/executable-query.ts","../src/query/builder/executable-aggregate-query.ts","../src/query/builder/dynamic.ts","../src/query/builder/traversal-builder.ts","../src/query/builder/query-builder.ts","../src/query/builder/unionable-query.ts","../src/query/builder/aggregates.ts","../src/query/builder/fragment.ts","../src/query/builder/index.ts","../src/query/builder.ts","../src/store/fulltext-sync.ts","../src/store/fulltext-rebuild.ts","../src/store/embedding-sync.ts","../src/store/search.ts","../src/store/search-facade.ts","../src/graph-extension/classify.ts","../src/graph-extension/remove.ts","../src/registry/builders.ts","../src/store/algorithms/context.ts","../src/store/algorithms/degree.ts","../src/store/algorithms/reachable.ts","../src/store/algorithms/shortest-path.ts","../src/store/algorithms/index.ts","../src/store/collections/edge-collection.ts","../src/store/node-fetch.ts","../src/store/collections/node-collection.ts","../src/store/collection-factory.ts","../src/store/introspect.ts","../src/store/materialize-shared.ts","../src/store/materialize-indexes.ts","../src/store/materialize-removals.ts","../src/constraints/index.ts","../src/store/constraints.ts","../src/store/operations/edge-operations.ts","../src/store/uniqueness.ts","../src/store/operations/node-operations.ts","../src/store/store.ts"],"names":["target","field","expr","quoteIdentifier","sql","qualifier","normalizeValueType","literal","pattern","left","opSql","arrayField","predicate","hasVariableLengthTraversal","compileKindFilter","compileRecursiveBranch","nullToUndefined","compileQuery","collectRequiredColumnsByAlias","compileSetOperation","having","RESERVED_NODE_KEYS","RESERVED_EDGE_KEYS","jsonPointer","value","rawRows","outputName","aliasObject","NOT_COMPUTED","max","min","coordinate","entry","rank","rowToEdge","executeEdgeCreate","executeEdgeCreateNoReturnBatch","executeEdgeCreateBatch","executeEdgeUpdate","executeEdgeUpsertUpdate","executeEdgeDelete","executeEdgeHardDelete","results","rows","rowToNode","executeNodeCreate","executeNodeCreateNoReturnBatch","executeNodeCreateBatch","executeNodeUpdate","executeNodeUpsertUpdate","executeNodeDelete","executeNodeHardDelete","result","materializeOne","count","exists","edge"],"mappings":";;;;;;;;;;;;;;;;;;AAwCO,SAAS,qBAAA,CACd,IAAA,EACA,IAAA,EACA,UAAA,EACgB;AAChB,EAAA,IAAI,IAAA,KAAS,MAAA,IAAU,IAAA,KAAS,MAAA,EAAW;AACzC,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,kBAAkB,IAAI,CAAA,kCAAA,CAAA;AAAA,MACtB;AAAA,QACE,MAAA,EAAQ;AAAA,UACN;AAAA,YACE,IAAA,EAAM,MAAA;AAAA,YACN,OAAA,EAAS,6CAA6C,IAAI,CAAA,CAAA;AAAA;AAC5D;AACF,OACF;AAAA,MACA;AAAA,QACE,UAAA,EACE;AAAA;AACJ,KACF;AAAA,EACF;AACA,EAAA,eAAA;AAAA,IACE,IAAA;AAAA,IACA,IAAA;AAAA,IACA,UAAA,KAAe,MAAA,GAAY,MAAA,GAAY,EAAE,UAAA;AAAW,GACtD;AACA,EAAA,OAAO,EAAE,KAAA,EAAO,IAAA,KAAS,MAAA,GAAY,EAAE,MAAK,GAAI,EAAE,IAAA,EAAM,IAAA,EAAK,EAAE;AACjE;AAwBA,SAAS,eAAA,CACP,IAAA,EACA,IAAA,EACA,OAAA,EACM;AACN,EAAA,IAAI,IAAA,KAAS,MAAA,IAAU,IAAA,KAAS,MAAA,EAAW;AACzC,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,2CAAA;AAAA,MACA;AAAA,QACE,MAAA,EAAQ;AAAA,UACN,EAAE,IAAA,EAAM,MAAA,EAAQ,OAAA,EAAS,qCAAA;AAAsC;AACjE,OACF;AAAA,MACA;AAAA,QACE,UAAA,EACE,SAAS,UAAA,IACT;AAAA;AACJ,KACF;AAAA,EACF;AACA,EAAA,IAAI,SAAS,MAAA,EAAW;AACtB,IAAA,wBAAA,CAAyB,MAAM,MAAM,CAAA;AAAA,EACvC;AACF;AASO,SAAS,mBAAmB,UAAA,EAAoC;AACrE,EAAA,MAAM,EAAE,IAAA,EAAM,IAAA,EAAK,GAAI,UAAA,CAAW,KAAA;AAClC,EAAA,OAAO,IAAA,KAAS,SAAY,CAAA,MAAA,EAAS,IAAI,MAAM,CAAA,MAAA,EAAS,IAAI,UAAU,IAAI,CAAA,CAAA;AAC5E;AAMO,SAAS,kBACd,UAAA,EACyB;AACzB,EAAA,MAAM,EAAE,IAAA,EAAM,IAAA,EAAK,GAAI,UAAA,CAAW,KAAA;AAClC,EAAA,OAAO,EAAE,cAAc,IAAA,EAAM,GAAI,SAAS,MAAA,IAAa,EAAE,MAAK,EAAG;AACnE;;;ACtHO,SAAS,eAAe,UAAA,EAA0C;AACvE,EAAA,MAAM,EAAE,IAAA,EAAM,IAAA,EAAK,GAAI,UAAA,CAAW,KAAA;AAClC,EAAA,OAAO,IAAA,KAAS,SACZ,EAAE,YAAA,EAAc,MAAK,GACrB,EAAE,YAAA,EAAc,IAAA,EAAM,IAAA,EAAK;AACjC;AA0BO,SAAS,yBAAA,CACd,SACA,mBAAA,EACoB;AACpB,EAAA,MAAM,EAAE,OAAM,GAAI,qBAAA;AAAA,IAChB,SAAS,YAAA,IAAgB,mBAAA;AAAA,IACzB,OAAA,EAAS;AAAA,GACX;AACA,EAAA,MAAM,EAAE,IAAA,EAAM,IAAA,EAAK,GAAI,KAAA;AACvB,EAAA,MAAM,IAAA,GAAO;AAAA,IACX,gBAAgB,IAAA,KAAS,mBAAA;AAAA,IACzB,YAAA,EAAc;AAAA,GAChB;AACA,EAAA,IAAI,IAAA,KAAS,SAAA,IAAa,IAAA,KAAS,MAAA,EAAQ;AACzC,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,IAAA,EAAM,IAAA,IAAQ,QAAO,EAAE;AAAA,EAC3C;AACA,EAAA,OAAO,IAAA;AACT;;;ACy9BO,IAAM,uBAAA,GAA0B;AAAA,EACrC,kBAAA;AAAA,EACA,sBAAA;AAAA,EACA;AACF,CAAA;;;ACt5BA,IAAM,aAAA,uBAAyC,GAAA,CAAI;AAAA,EACjD,MAAA;AAAA,EACA,OAAA;AAAA,EACA,SAAA;AAAA,EACA;AACF,CAAC,CAAA;AAOD,SAAS,qBAAA,CACP,MAAA,EACA,MAAA,EACA,UAAA,EACa;AACb,EAAA,OAAO,MAAM;AACX,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,CAAA,EAAI,MAAM,CAAA,6CAAA,EAAgD,kBAAA,CAAmB,UAAU,CAAC,CAAA,oFAAA,CAAA;AAAA,MAExF;AAAA,QACE,IAAA,EAAM,sBAAA;AAAA,QACN,MAAA;AAAA,QACA,MAAA;AAAA,QACA,GAAG,kBAAkB,UAAU;AAAA;AACjC,KACF;AAAA,EACF,CAAA;AACF;AASA,SAAS,wBAAA,CACP,MAAA,EACA,MAAA,EACA,UAAA,EACsB;AACtB,EAAA,OAAO,MACL,OAAA,CAAQ,MAAA;AAAA,IACN,IAAI,kBAAA;AAAA,MACF,CAAA,CAAA,EAAI,MAAM,CAAA,mCAAA,EAAsC,kBAAA,CAAmB,UAAU,CAAC,CAAA,yJAAA,CAAA;AAAA,MAG9E;AAAA,QACE,IAAA,EAAM,yBAAA;AAAA,QACN,MAAA;AAAA,QACA,MAAA;AAAA,QACA,GAAG,kBAAkB,UAAU;AAAA;AACjC;AACF,GACF;AACJ;AASA,IAAM,qBAA0C,IAAI,GAAA;AAAA,EAClD;AACF,CAAA;AAiBA,SAAS,uBAAA,CACP,KAAA,EACA,IAAA,EACA,UAAA,EACA,MAAA,EACG;AACH,EAAA,MAAM,SAAA,GAAY,UAAA,CAAW,KAAA,CAAM,IAAA,KAAS,SAAA;AAC5C,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,MAAA,CAAO,KAAK,CAAA;AAClC,EAAA,OAAO,IAAI,MAAM,MAAA,EAAQ;AAAA,IACvB,GAAA,CAAIA,OAAAA,EAAQ,QAAA,EAAU,QAAA,EAAU;AAC9B,MAAA,IACE,OAAO,QAAA,KAAa,QAAA,IACpB,CAAC,MAAA,CAAO,MAAA,CAAOA,OAAAA,EAAQ,QAAQ,CAAA,IAC/B,MAAA,CAAO,MAAA,CAAO,IAAA,EAAM,QAAQ,CAAA,EAC5B;AACA,QAAA,IAAI,kBAAA,CAAmB,GAAA,CAAI,QAAQ,CAAA,EAAG;AACpC,UAAA,OAAO,YACF,IAAA,CAAiC,QAAQ,IAC1C,wBAAA,CAAyB,MAAA,EAAQ,UAAU,UAAU,CAAA;AAAA,QAC3D;AACA,QAAA,OAAO,qBAAA,CAAsB,MAAA,EAAQ,QAAA,EAAU,UAAU,CAAA;AAAA,MAC3D;AACA,MAAA,OAAO,OAAA,CAAQ,GAAA,CAAIA,OAAAA,EAAQ,QAAA,EAAU,QAAQ,CAAA;AAAA,IAC/C,CAAA;AAAA,IACA,GAAA,CAAIA,SAAQ,QAAA,EAAU;AAKpB,MAAA,OACG,OAAO,QAAA,KAAa,QAAA,IAAY,MAAA,CAAO,MAAA,CAAO,IAAA,EAAM,QAAQ,CAAA,IAC7D,OAAA,CAAQ,GAAA,CAAIA,OAAAA,EAAQ,QAAQ,CAAA;AAAA,IAEhC,CAAA;AAAA,IACA,GAAA,GAAM;AACJ,MAAA,OAAO,KAAA;AAAA,IACT,CAAA;AAAA,IACA,cAAA,GAAiB;AACf,MAAA,OAAO,KAAA;AAAA,IACT,CAAA;AAAA,IACA,cAAA,GAAiB;AACf,MAAA,OAAO,KAAA;AAAA,IACT;AAAA,GACD,CAAA;AACH;AAEA,SAAS,oBAAA,CACP,MACA,UAAA,EACmC;AACnC,EAAA,MAAM,QAAA,GAAW,eAAe,UAAU,CAAA;AAG1C,EAAA,MAAM,KAAA,GAGF;AAAA,IACF,SAAS,CAAC,EAAA,KAAO,IAAA,CAAK,OAAA,CAAQ,IAAI,QAAQ,CAAA;AAAA,IAC1C,UAAU,CAAC,GAAA,KAAQ,IAAA,CAAK,QAAA,CAAS,KAAK,QAAQ,CAAA;AAAA;AAAA;AAAA;AAAA,IAI9C,MAAM,CAAC,MAAA,KAAW,IAAA,CAAK,IAAA,CAAK,QAAQ,QAAQ,CAAA;AAAA,IAC5C,KAAA,EAAO,MAAM,IAAA,CAAK,KAAA,CAAM,QAAQ;AAAA,GAClC;AACA,EAAA,OAAO,uBAAA;AAAA,IACL,KAAA;AAAA,IACA,IAAA;AAAA,IACA,UAAA;AAAA,IACA;AAAA,GACF;AACF;AAEA,SAAS,oBAAA,CACP,MACA,UAAA,EAC0D;AAC1D,EAAA,MAAM,QAAA,GAAW,eAAe,UAAU,CAAA;AAC1C,EAAA,MAAM,KAAA,GAAkE;AAAA,IACtE,SAAS,CAAC,EAAA,KAAO,IAAA,CAAK,OAAA,CAAQ,IAAI,QAAQ,CAAA;AAAA,IAC1C,UAAU,CAAC,GAAA,KAAQ,IAAA,CAAK,QAAA,CAAS,KAAK,QAAQ,CAAA;AAAA;AAAA;AAAA;AAAA,IAI9C,MAAM,CAAC,MAAA,KAAW,IAAA,CAAK,IAAA,CAAK,QAAQ,QAAQ,CAAA;AAAA,IAC5C,OAAO,CAAC,MAAA,KAAW,IAAA,CAAK,KAAA,CAAM,QAAQ,QAAQ,CAAA;AAAA,IAC9C,UAAU,CAAC,IAAA,KAAS,IAAA,CAAK,QAAA,CAAS,MAAM,QAAQ,CAAA;AAAA,IAChD,QAAQ,CAAC,EAAA,KAAO,IAAA,CAAK,MAAA,CAAO,IAAI,QAAQ,CAAA;AAAA,IACxC,eAAA,EAAiB,CAAC,IAAA,EAAM,EAAA,EAAI,OAAA,KAC1B,KAAK,eAAA,CAAgB,IAAA,EAAM,EAAA,EAAI,OAAA,EAAS,QAAQ;AAAA,GACpD;AACA,EAAA,OAAO,uBAAA,CAAwB,KAAA,EAAO,IAAA,EAAM,UAAA,EAAY,MAAM,CAAA;AAChE;AASA,SAAS,iBAAA,CACP,IAAA,EACA,UAAA,EACA,IAAA,EACmB;AACnB,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAe;AACjC,EAAA,OAAO,IAAI,KAAA;AAAA,IACT,EAAC;AAAA,IACD;AAAA,MACE,GAAA,CAAI,SAAS,IAAA,EAAM;AACjB,QAAA,IAAI,OAAO,IAAA,KAAS,QAAA,IAAY,aAAA,CAAc,GAAA,CAAI,IAAI,CAAA,EAAG;AACzD,QAAA,MAAM,MAAA,GAAS,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA;AAC7B,QAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AACjC,QAAA,MAAM,OAAA,GAAU,IAAA,CAAM,IAAA,CAA2B,IAAI,GAAI,UAAU,CAAA;AACnE,QAAA,KAAA,CAAM,GAAA,CAAI,MAAM,OAAO,CAAA;AACvB,QAAA,OAAO,OAAA;AAAA,MACT;AAAA;AACF,GACF;AACF;AAcA,IAAM,wBAAA,GAA2B;AAAA,EAC/B,UAAA;AAAA,EACA,QAAA;AAAA,EACA;AACF,CAAA;AACA,IAAM,sBAA2C,IAAI,GAAA;AAAA,EACnD;AACF,CAAA;AASA,SAAS,aAAA,CACP,MAAA,EACA,UAAA,EACA,SAAA,EACoB;AACpB,EAAA,OAAO,YACH,IAAI,kBAAA;AAAA,IACF,gBAAgB,MAAM,CAAA,gGAAA,CAAA;AAAA,IAEtB;AAAA,MACE,IAAA,EAAM,sBAAA;AAAA,MACN,MAAA;AAAA,MACA,GAAG,kBAAkB,UAAU;AAAA;AACjC,MAEF,IAAI,kBAAA;AAAA,IACF,CAAA,aAAA,EAAgB,MAAM,CAAA,kCAAA,EAAqC,kBAAA,CAAmB,UAAU,CAAC,CAAA,sKAAA,CAAA;AAAA,IAIzF;AAAA,MACE,IAAA,EAAM,+BAAA;AAAA,MACN,MAAA;AAAA,MACA,GAAG,kBAAkB,UAAU;AAAA;AACjC,GACF;AACN;AAUA,SAAS,YAAA,CACP,OACA,UAAA,EACgB;AAChB,EAAA,MAAM,SAAA,GAAY,UAAA,CAAW,KAAA,CAAM,IAAA,KAAS,SAAA;AAC5C,EAAA,MAAM,IAAA,GACJ,SAAA,GACG,KAAA,CAAM,MAAA,GAIP,MAAA;AACJ,EAAA,OAAO,IAAI,KAAA,CAAM,EAAC,EAAqB;AAAA,IACrC,GAAA,CAAI,MAAA,EAAQ,MAAA,EAAQ,QAAA,EAAU;AAG5B,MAAA,IAAI,OAAO,MAAA,KAAW,QAAA,IAAY,aAAA,CAAc,GAAA,CAAI,MAAM,CAAA,EAAG;AAC3D,QAAA;AAAA,MACF;AAGA,MAAA,IAAI,MAAA,CAAO,MAAA,CAAO,MAAA,CAAO,SAAA,EAAW,MAAM,CAAA,EAAG;AAC3C,QAAA,MAAM,cAAA,GAA0B,OAAA,CAAQ,GAAA,CAAI,MAAA,EAAQ,QAAQ,QAAQ,CAAA;AACpE,QAAA,OAAO,cAAA;AAAA,MACT;AACA,MAAA,IAAI,IAAA,KAAS,MAAA,IAAa,mBAAA,CAAoB,GAAA,CAAI,MAAM,CAAA,EAAG;AACzD,QAAA,OAAO,IAAI,IAAA,KAA6B,IAAA,CAAK,MAAM,CAAA,CAAG,GAAG,IAAI,CAAA;AAAA,MAC/D;AACA,MAAA,OAAO,MAAM,OAAA,CAAQ,MAAA,CAAO,cAAc,MAAA,EAAQ,UAAA,EAAY,SAAS,CAAC,CAAA;AAAA,IAC1E;AAAA,GACD,CAAA;AACH;AAmBO,IAAM,YAAN,MAAoC;AAAA,EAChC,MAAA;AAAA,EACA,WAAA;AAAA,EACT,MAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EAEA,WAAA,CAAY,OAAiB,UAAA,EAAiC;AAC5D,IAAA,IAAA,CAAK,MAAA,GAAS,KAAA;AACd,IAAA,IAAA,CAAK,WAAA,GAAc,qBAAA;AAAA,MACjB,UAAA,CAAW,IAAA;AAAA,MACX,UAAA,CAAW,IAAA;AAAA,MACX;AAAA,KACF;AAAA,EACF;AAAA;AAAA,EAGA,IAAI,IAAA,GAAqB;AACvB,IAAA,OAAO,IAAA,CAAK,YAAY,KAAA,CAAM,IAAA;AAAA,EAChC;AAAA;AAAA,EAGA,IAAI,IAAA,GAA2B;AAC7B,IAAA,OAAO,IAAA,CAAK,YAAY,KAAA,CAAM,IAAA;AAAA,EAChC;AAAA;AAAA,EAGA,IAAI,KAAA,GAAqC;AACvC,IAAA,IAAA,CAAK,MAAA,KAAW,iBAAA;AAAA,MACd,KAAK,MAAA,CAAO,KAAA;AAAA,MACZ,IAAA,CAAK,WAAA;AAAA,MACL;AAAA,KACF;AACA,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,KAAA,GAAqC;AACvC,IAAA,IAAA,CAAK,MAAA,KAAW,iBAAA;AAAA,MACd,KAAK,MAAA,CAAO,KAAA;AAAA,MACZ,IAAA,CAAK,WAAA;AAAA,MACL;AAAA,KACF;AACA,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,KAAA,GAAyB;AACvB,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,WAAA,CAAY,IAAA,CAAK,WAAW,CAAA;AAAA,EACjD;AAAA;AAAA,EAGA,QAAA,CAKE,QACA,OAAA,EACuC;AACvC,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,QAAA,CAAS,MAAA,EAAQ;AAAA,MAClC,GAAG,OAAA;AAAA,MACH,GAAG,cAAA,CAAe,IAAA,CAAK,WAAW;AAAA,KACnC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,YAAA,CACE,IAAA,EACA,EAAA,EACA,OAAA,EACyC;AACzC,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,UAAA,CAAW,YAAA,CAAa,MAAM,EAAA,EAAI;AAAA,MACnD,GAAG,OAAA;AAAA,MACH,GAAG,cAAA,CAAe,IAAA,CAAK,WAAW;AAAA,KACnC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,SAAA,CACE,MACA,OAAA,EACmC;AACnC,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,UAAA,CAAW,SAAA,CAAU,IAAA,EAAM;AAAA,MAC5C,GAAG,OAAA;AAAA,MACH,GAAG,cAAA,CAAe,IAAA,CAAK,WAAW;AAAA,KACnC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,QAAA,CACE,IAAA,EACA,EAAA,EACA,OAAA,EACkB;AAClB,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,UAAA,CAAW,QAAA,CAAS,MAAM,EAAA,EAAI;AAAA,MAC/C,GAAG,OAAA;AAAA,MACH,GAAG,cAAA,CAAe,IAAA,CAAK,WAAW;AAAA,KACnC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,SAAA,CACE,MACA,OAAA,EACmC;AACnC,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,UAAA,CAAW,SAAA,CAAU,IAAA,EAAM;AAAA,MAC5C,GAAG,OAAA;AAAA,MACH,GAAG,cAAA,CAAe,IAAA,CAAK,WAAW;AAAA,KACnC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,MAAA,CACE,MACA,OAAA,EACiB;AACjB,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,UAAA,CAAW,MAAA,CAAO,IAAA,EAAM;AAAA,MACzC,GAAG,OAAA;AAAA,MACH,GAAG,cAAA,CAAe,IAAA,CAAK,WAAW;AAAA,KACnC,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,IAAI,MAAA,GAAyB;AAC3B,IAAA,IAAA,CAAK,OAAA,KAAY,YAAA,CAAgB,IAAA,CAAK,MAAA,EAAQ,KAAK,WAAW,CAAA;AAC9D,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AACF;;;AC/kBA,SAAS,mBAAmB,SAAA,EAA8C;AACxE,EAAA,IAAI,SAAA,KAAc,MAAA,IAAa,SAAA,KAAc,SAAA,EAAW;AACtD,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,OAAO,SAAA;AACT;AAKO,SAAS,iCACd,SAAA,EACS;AACT,EAAA,MAAM,UAAA,GAAa,mBAAmB,SAAS,CAAA;AAC/C,EAAA,OACE,UAAA,KAAe,OAAA,IACf,UAAA,KAAe,QAAA,IACf,UAAA,KAAe,WAAA;AAEnB;AAQO,SAAS,0BAAA,CACd,MACA,KAAA,EACS;AACT,EAAA,MAAM,cAAA,GAAiB,mBAAmB,IAAI,CAAA;AAC9C,EAAA,MAAM,eAAA,GAAkB,mBAAmB,KAAK,CAAA;AAEhD,EAAA,IAAI,cAAA,KAAmB,MAAA,IAAa,eAAA,KAAoB,MAAA,EAAW;AACjE,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,OAAO,cAAA,KAAmB,eAAA;AAC5B;AAKA,SAAS,sBACP,SAAA,EACuB;AACvB,EAAA,QAAQ,UAAU,QAAA;AAAU,IAC1B,KAAK,OAAA;AAAA,IACL,KAAK,eAAA;AAAA,IACL,KAAK,KAAA;AAAA,IACL,KAAK,KAAA,EAAO;AACV,MAAA,OAAO,QAAA;AAAA,IACT;AAAA,IACA,KAAK,KAAA;AAAA,IACL,KAAK,KAAA,EAAO;AACV,MAAA,OAAO,kBAAA,CAAmB,SAAA,CAAU,KAAA,CAAM,SAAS,CAAA;AAAA,IACrD;AAAA;AAEJ;AAQA,SAAS,uBACP,QAAA,EACoC;AACpC,EAAA,IAAI,QAAA,CAAS,eAAA,IAAmB,QAAA,CAAS,eAAA,CAAgB,SAAS,CAAA,EAAG;AACnE,IAAA,OAAO,SAAS,eAAA,CAAgB,GAAA;AAAA,MAAI,CAACC,MAAAA,KACnC,kBAAA,CAAmBA,MAAAA,CAAM,SAAS;AAAA,KACpC;AAAA,EACF;AAEA,EAAA,OAAO,QAAA,CAAS,UAAA,CAAW,MAAA,CAAO,GAAA,CAAI,CAACA,MAAAA,KAAU;AAC/C,IAAA,IAAIA,MAAAA,CAAM,MAAA,CAAO,MAAA,KAAW,WAAA,EAAa;AACvC,MAAA,OAAO,qBAAA,CAAsBA,OAAM,MAAM,CAAA;AAAA,IAC3C;AACA,IAAA,OAAO,kBAAA,CAAmBA,MAAAA,CAAM,MAAA,CAAO,SAAS,CAAA;AAAA,EAClD,CAAC,CAAA;AACH;AAKO,SAAS,uBAAuB,QAAA,EAA4B;AACjE,EAAA,OAAO,sBAAA,CAAuB,QAAQ,CAAA,CAAE,MAAA;AAC1C;AAKO,SAAS,iCACd,QAAA,EACuB;AACvB,EAAA,MAAM,UAAA,GAAa,uBAAuB,QAAQ,CAAA;AAClD,EAAA,IAAI,UAAA,CAAW,WAAW,CAAA,EAAG;AAC3B,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,OAAO,WAAW,CAAC,CAAA;AACrB;;;AC3CA,SAAS,UAAU,IAAA,EAAsC;AACvD,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,IAAA;AAAA,IACR,GAAA,EAAK,CAAC,KAAA,KACJ,SAAA,CAAU;AAAA,MACR,MAAA,EAAQ,KAAA;AAAA,MACR,UAAA,EAAY,CAAC,IAAA,EAAM,KAAA,CAAM,MAAM;AAAA,KAChC,CAAA;AAAA,IACH,EAAA,EAAI,CAAC,KAAA,KACH,SAAA,CAAU;AAAA,MACR,MAAA,EAAQ,IAAA;AAAA,MACR,UAAA,EAAY,CAAC,IAAA,EAAM,KAAA,CAAM,MAAM;AAAA,KAChC,CAAA;AAAA,IACH,GAAA,EAAK,MACH,SAAA,CAAU;AAAA,MACR,MAAA,EAAQ,KAAA;AAAA,MACR,SAAA,EAAW;AAAA,KACZ;AAAA,GACL;AACF;AAyBO,SAAS,MAAM,IAAA,EAA4B;AAChD,EAAA,OAAO,EAAE,MAAA,EAAQ,WAAA,EAAa,IAAA,EAAK;AACrC;AAKO,SAAS,eAAe,KAAA,EAAuC;AACpE,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,MAAM,OAAO,KAAA;AAExD,EAAA,OAAQ,MAAuB,MAAA,KAAW,WAAA;AAC5C;AAiQO,SAAS,QAAA,CACd,KAAA,EACA,IAAA,EACA,OAAA,EACU;AACV,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,WAAA;AAAA,IACR,KAAA;AAAA,IACA,IAAA;AAAA,IACA,GAAI,OAAA,EAAS,WAAA,KAAgB,MAAA,IAAa;AAAA,MACxC,aAAa,OAAA,CAAQ;AAAA,KACvB;AAAA,IACA,GAAI,OAAA,EAAS,SAAA,KAAc,UAAa,EAAE,SAAA,EAAW,QAAQ,SAAA,EAAU;AAAA,IACvE,GAAI,OAAA,EAAS,WAAA,KAAgB,MAAA,IAAa;AAAA,MACxC,aAAa,OAAA,CAAQ;AAAA;AACvB,GACF;AACF;AAEA,SAAS,mBAAmB,KAAA,EAAkD;AAC5E,EAAA,IAAI,iBAAiB,IAAA,EAAM;AACzB,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,IACE,OAAO,UAAU,QAAA,IACjB,OAAO,UAAU,QAAA,IACjB,OAAO,UAAU,SAAA,EACjB;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,IAAI,KAAA,CAAM,CAAA,gCAAA,EAAmC,OAAO,KAAK,CAAA,CAAE,CAAA;AACnE;AAEA,SAAS,sBAAsB,KAAA,EAA6C;AAC1E,EAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,IAAA,OAAO,QAAA;AAAA,EACT;AACA,EAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,IAAA,OAAO,QAAA;AAAA,EACT;AACA,EAAA,OAAO,SAAA;AACT;AAKA,SAAS,QAAQ,KAAA,EAAuD;AACtE,EAAA,IAAI,iBAAiB,IAAA,EAAM;AACzB,IAAA,OAAO,EAAE,QAAQ,SAAA,EAAW,KAAA,EAAO,MAAM,WAAA,EAAY,EAAG,WAAW,MAAA,EAAO;AAAA,EAC5E;AACA,EAAA,MAAM,SAAA,GAAY,sBAAsB,KAAK,CAAA;AAC7C,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,SAAA;AAAA,IACR,KAAA;AAAA,IACA;AAAA,GACF;AACF;AAKA,SAAS,UAAA,CACP,EAAA,EACAA,MAAAA,EACA,KAAA,EACW;AACX,EAAA,IAAI,cAAA,CAAe,KAAK,CAAA,EAAG;AACzB,IAAA,MAAMC,KAAAA,GAA4B;AAAA,MAChC,MAAA,EAAQ,YAAA;AAAA,MACR,EAAA;AAAA,MACA,IAAA,EAAMD,MAAAA;AAAA,MACN,KAAA,EAAO;AAAA,KACT;AACA,IAAA,OAAO,UAAUC,KAAI,CAAA;AAAA,EACvB;AACA,EAAA,MAAM,YAAA,GAAe,mBAAmB,KAAK,CAAA;AAC7C,EAAA,MAAM,IAAA,GAA4B;AAAA,IAChC,MAAA,EAAQ,YAAA;AAAA,IACR,EAAA;AAAA,IACA,IAAA,EAAMD,MAAAA;AAAA,IACN,KAAA,EAAO,QAAQ,YAAY;AAAA,GAC7B;AACA,EAAA,OAAO,UAAU,IAAI,CAAA;AACvB;AAKA,SAAS,YAAA,CACP,EAAA,EACAA,MAAAA,EACA,MAAA,EACW;AACX,EAAA,MAAM,QAAA,GAAW,OAAO,GAAA,CAAI,CAAC,UAAU,OAAA,CAAQ,kBAAA,CAAmB,KAAK,CAAC,CAAC,CAAA;AACzE,EAAA,MAAM,IAAA,GAA4B;AAAA,IAChC,MAAA,EAAQ,YAAA;AAAA,IACR,EAAA;AAAA,IACA,IAAA,EAAMA,MAAAA;AAAA,IACN,KAAA,EAAO;AAAA,GACT;AACA,EAAA,OAAO,UAAU,IAAI,CAAA;AACvB;AAKA,SAAS,QAAA,CACP,EAAA,EACAA,MAAAA,EACA,OAAA,EACW;AACX,EAAA,IAAI,cAAA,CAAe,OAAO,CAAA,EAAG;AAC3B,IAAA,MAAMC,KAAAA,GAAwB;AAAA,MAC5B,MAAA,EAAQ,WAAA;AAAA,MACR,EAAA;AAAA,MACA,KAAA,EAAAD,MAAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,OAAO,UAAUC,KAAI,CAAA;AAAA,EACvB;AACA,EAAA,MAAM,IAAA,GAAwB;AAAA,IAC5B,MAAA,EAAQ,WAAA;AAAA,IACR,EAAA;AAAA,IACA,KAAA,EAAAD,MAAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,OAAO,UAAU,IAAI,CAAA;AACvB;AAKA,SAAS,SAAA,CAAU,IAAiBA,MAAAA,EAA4B;AAC9D,EAAA,MAAM,IAAA,GAAsB;AAAA,IAC1B,MAAA,EAAQ,YAAA;AAAA,IACR,EAAA;AAAA,IACA,KAAA,EAAAA;AAAA,GACF;AACA,EAAA,OAAO,UAAU,IAAI,CAAA;AACvB;AAKA,SAAS,OAAA,CACPA,MAAAA,EACA,KAAA,EACA,KAAA,EACW;AACX,EAAA,MAAM,IAAA,GAAyB;AAAA,IAC7B,MAAA,EAAQ,SAAA;AAAA,IACR,KAAA,EAAAA,MAAAA;AAAA,IACA,OAAO,cAAA,CAAe,KAAK,CAAA,GAAI,KAAA,GAAQ,QAAQ,KAAK,CAAA;AAAA,IACpD,OAAO,cAAA,CAAe,KAAK,CAAA,GAAI,KAAA,GAAQ,QAAQ,KAAK;AAAA,GACtD;AACA,EAAA,OAAO,UAAU,IAAI,CAAA;AACvB;AAKA,SAAS,iBAAiBA,MAAAA,EAAmC;AAC3D,EAAA,OAAO;AAAA,IACL,IAAI,CAAC,KAAA,KAAU,UAAA,CAAW,IAAA,EAAMA,QAAO,KAAK,CAAA;AAAA,IAC5C,KAAK,CAAC,KAAA,KAAU,UAAA,CAAW,KAAA,EAAOA,QAAO,KAAK,CAAA;AAAA,IAC9C,MAAA,EAAQ,MAAM,SAAA,CAAU,QAAA,EAAUA,MAAK,CAAA;AAAA,IACvC,SAAA,EAAW,MAAM,SAAA,CAAU,WAAA,EAAaA,MAAK,CAAA;AAAA,IAC7C,IAAI,CAAC,MAAA,KAAW,YAAA,CAAa,IAAA,EAAMA,QAAO,MAAM,CAAA;AAAA,IAChD,OAAO,CAAC,MAAA,KAAW,YAAA,CAAa,OAAA,EAASA,QAAO,MAAM;AAAA,GACxD;AACF;AASO,SAAS,YAAYA,MAAAA,EAAqC;AAC/D,EAAA,OAAO;AAAA,IACL,GAAG,iBAAiBA,MAAK,CAAA;AAAA,IACzB,IAAI,CAAC,KAAA,KAAU,UAAA,CAAW,IAAA,EAAMA,QAAO,KAAK,CAAA;AAAA,IAC5C,KAAK,CAAC,KAAA,KAAU,UAAA,CAAW,KAAA,EAAOA,QAAO,KAAK,CAAA;AAAA,IAC9C,IAAI,CAAC,KAAA,KAAU,UAAA,CAAW,IAAA,EAAMA,QAAO,KAAK,CAAA;AAAA,IAC5C,KAAK,CAAC,KAAA,KAAU,UAAA,CAAW,KAAA,EAAOA,QAAO,KAAK,CAAA;AAAA,IAC9C,UAAU,CAAC,OAAA,KAAY,QAAA,CAAS,UAAA,EAAYA,QAAO,OAAO,CAAA;AAAA,IAC1D,YAAY,CAAC,OAAA,KAAY,QAAA,CAAS,YAAA,EAAcA,QAAO,OAAO,CAAA;AAAA,IAC9D,UAAU,CAAC,OAAA,KAAY,QAAA,CAAS,UAAA,EAAYA,QAAO,OAAO,CAAA;AAAA,IAC1D,MAAM,CAAC,OAAA,KAAY,QAAA,CAAS,MAAA,EAAQA,QAAO,OAAO,CAAA;AAAA,IAClD,OAAO,CAAC,OAAA,KAAY,QAAA,CAAS,OAAA,EAASA,QAAO,OAAO;AAAA,GACtD;AACF;AAOA,IAAM,wBAAA,GAA2B,EAAA;AAoB1B,SAAS,sBAAA,CACd,OACA,kBAAA,EACkB;AAClB,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,CAAC,KAAA,EAAO,CAAA,EAAG,OAAA,KAAY;AAC9B,MAAA,IAAI,CAAC,oBAAmB,EAAG;AACzB,QAAA,MAAM,IAAI,yBAAA;AAAA,UACR,8CAA8C,KAAK,CAAA,kIAAA;AAAA,SAGrD;AAAA,MACF;AACA,MAAA,OAAO,aAAA;AAAA,QACL,QAAA,CAAS,KAAA,EAAO,CAAC,WAAW,CAAC,CAAA;AAAA,QAC7B,KAAA;AAAA,QACA,CAAA,IAAK,wBAAA;AAAA,QACL;AAAA,OACF;AAAA,IACF;AAAA,GACF;AACF;AAKA,SAAS,aAAA,CACPA,MAAAA,EACA,KAAA,EACA,KAAA,EACA,OAAA,EACW;AACX,EAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,IAAK,SAAS,CAAA,EAAG;AACzC,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,CAAA,sDAAA,EAAyD,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,KACxE;AAAA,EACF;AACA,EAAA,MAAM,IAAA,GAA+B;AAAA,IACnC,MAAA,EAAQ,gBAAA;AAAA,IACR,KAAA,EAAAA,MAAAA;AAAA,IACA,KAAA;AAAA,IACA,IAAA,EAAM,SAAS,IAAA,IAAQ,WAAA;AAAA,IACvB,KAAA;AAAA,IACA,GAAI,SAAS,QAAA,KAAa,MAAA,GAAY,EAAC,GAAI,EAAE,QAAA,EAAU,OAAA,CAAQ,QAAA,EAAS;AAAA,IACxE,GAAI,SAAS,QAAA,KAAa,MAAA,GAAY,EAAC,GAAI,EAAE,QAAA,EAAU,OAAA,CAAQ,QAAA;AAAS,GAC1E;AACA,EAAA,OAAO,UAAU,IAAI,CAAA;AACvB;AAKO,SAAS,YAAYA,MAAAA,EAAqC;AAC/D,EAAA,OAAO;AAAA,IACL,GAAG,iBAAiBA,MAAK,CAAA;AAAA,IACzB,IAAI,CAAC,KAAA,KAAU,UAAA,CAAW,IAAA,EAAMA,QAAO,KAAK,CAAA;AAAA,IAC5C,KAAK,CAAC,KAAA,KAAU,UAAA,CAAW,KAAA,EAAOA,QAAO,KAAK,CAAA;AAAA,IAC9C,IAAI,CAAC,KAAA,KAAU,UAAA,CAAW,IAAA,EAAMA,QAAO,KAAK,CAAA;AAAA,IAC5C,KAAK,CAAC,KAAA,KAAU,UAAA,CAAW,KAAA,EAAOA,QAAO,KAAK,CAAA;AAAA,IAC9C,SAAS,CAAC,KAAA,EAAO,UAAU,OAAA,CAAQA,MAAAA,EAAO,OAAO,KAAK;AAAA,GACxD;AACF;AAKO,SAAS,UAAUA,MAAAA,EAAmC;AAC3D,EAAA,OAAO;AAAA,IACL,GAAG,iBAAiBA,MAAK,CAAA;AAAA,IACzB,IAAI,CAAC,KAAA,KAAU,UAAA,CAAW,IAAA,EAAMA,QAAO,KAAK,CAAA;AAAA,IAC5C,KAAK,CAAC,KAAA,KAAU,UAAA,CAAW,KAAA,EAAOA,QAAO,KAAK,CAAA;AAAA,IAC9C,IAAI,CAAC,KAAA,KAAU,UAAA,CAAW,IAAA,EAAMA,QAAO,KAAK,CAAA;AAAA,IAC5C,KAAK,CAAC,KAAA,KAAU,UAAA,CAAW,KAAA,EAAOA,QAAO,KAAK,CAAA;AAAA,IAC9C,SAAS,CAAC,KAAA,EAAO,UAAU,OAAA,CAAQA,MAAAA,EAAO,OAAO,KAAK;AAAA,GACxD;AACF;AAMO,SAAS,UAAUA,MAAAA,EAAmC;AAC3D,EAAA,OAAO,iBAAiBA,MAAK,CAAA;AAC/B;AAKA,SAAS,OAAA,CACP,EAAA,EACAA,MAAAA,EACA,MAAA,EACA,MAAA,EACW;AACX,EAAA,MAAM,IAAA,GAAuB;AAAA,IAC3B,MAAA,EAAQ,UAAA;AAAA,IACR,EAAA;AAAA,IACA,KAAA,EAAAA,MAAAA;AAAA,IACA,GAAI,WAAW,MAAA,IAAa;AAAA,MAC1B,MAAA,EAAQ,OAAO,GAAA,CAAI,CAAC,UAAU,OAAA,CAAQ,kBAAA,CAAmB,KAAK,CAAC,CAAC;AAAA,KAClE;AAAA,IACA,GAAI,MAAA,KAAW,MAAA,IAAa,EAAE,MAAA;AAAO,GACvC;AACA,EAAA,OAAO,UAAU,IAAI,CAAA;AACvB;AAKO,SAAS,WAAwBA,MAAAA,EAAuC;AAI7E,EAAA,OAAO;AAAA,IACL,GAAG,iBAAiBA,MAAK,CAAA;AAAA,IACzB,QAAA,EAAU,CAAC,KAAA,KAAa,OAAA,CAAQ,YAAYA,MAAAA,EAAO,CAAC,KAAK,CAAC,CAAA;AAAA,IAC1D,aAAa,CAAC,MAAA,KACZ,OAAA,CAAQ,aAAA,EAAeA,QAAO,MAAM,CAAA;AAAA,IACtC,aAAa,CAAC,MAAA,KACZ,OAAA,CAAQ,aAAA,EAAeA,QAAO,MAAM,CAAA;AAAA,IACtC,OAAA,EAAS,MAAM,OAAA,CAAQ,SAAA,EAAWA,MAAK,CAAA;AAAA,IACvC,UAAA,EAAY,MAAM,OAAA,CAAQ,YAAA,EAAcA,MAAK,CAAA;AAAA,IAC7C,UAAU,CAAC,MAAA,KAAmB,QAAQ,UAAA,EAAYA,MAAAA,EAAO,QAAW,MAAM,CAAA;AAAA,IAC1E,UAAU,CAAC,MAAA,KAAmB,QAAQ,UAAA,EAAYA,MAAAA,EAAO,QAAW,MAAM,CAAA;AAAA,IAC1E,WAAW,CAAC,MAAA,KACV,QAAQ,WAAA,EAAaA,MAAAA,EAAO,QAAW,MAAM,CAAA;AAAA,IAC/C,UAAU,CAAC,MAAA,KAAmB,QAAQ,UAAA,EAAYA,MAAAA,EAAO,QAAW,MAAM,CAAA;AAAA,IAC1E,WAAW,CAAC,MAAA,KACV,QAAQ,WAAA,EAAaA,MAAAA,EAAO,QAAW,MAAM;AAAA,GACjD;AACF;AAKA,SAAS,gBAAA,CACPA,MAAAA,EACA,cAAA,EACA,KAAA,EACA,OAAA,EACW;AACX,EAAA,MAAM,IAAA,GAAkC;AAAA,IACtC,MAAA,EAAQ,mBAAA;AAAA,IACR,KAAA,EAAAA,MAAAA;AAAA,IACA,cAAA;AAAA;AAAA;AAAA;AAAA,IAIA,GAAI,OAAA,EAAS,MAAA,KAAW,UAAa,EAAE,MAAA,EAAQ,QAAQ,MAAA,EAAO;AAAA,IAC9D,KAAA;AAAA,IACA,GAAI,OAAA,EAAS,QAAA,KAAa,UAAa,EAAE,QAAA,EAAU,QAAQ,QAAA;AAAS,GACtE;AACA,EAAA,OAAO,UAAU,IAAI,CAAA;AACvB;AAKO,SAAS,eAAeA,MAAAA,EAAwC;AACrE,EAAA,OAAO;AAAA,IACL,GAAG,iBAAiBA,MAAK,CAAA;AAAA,IACzB,SAAA,EAAW,CAAC,cAAA,EAAgB,CAAA,EAAG,YAC7B,gBAAA,CAAiBA,MAAAA,EAAO,cAAA,EAAgB,CAAA,EAAG,OAAO;AAAA,GACtD;AACF;AAEO,SAAS,4BAAA,CACdA,QACA,QAAA,EACkB;AAClB,EAAA,IAAI,CAAC,QAAA,EAAU;AACb,IAAA,OAAO,UAAUA,MAAK,CAAA;AAAA,EACxB;AAEA,EAAA,QAAQ,SAAS,SAAA;AAAW,IAC1B,KAAK,QAAA,EAAU;AACb,MAAA,OAAO,YAAYA,MAAK,CAAA;AAAA,IAC1B;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA,OAAO,YAAYA,MAAK,CAAA;AAAA,IAC1B;AAAA,IACA,KAAK,SAAA,EAAW;AACd,MAAA,OAAO,UAAUA,MAAK,CAAA;AAAA,IACxB;AAAA,IACA,KAAK,MAAA,EAAQ;AACX,MAAA,OAAO,UAAUA,MAAK,CAAA;AAAA,IACxB;AAAA,IACA,KAAK,OAAA,EAAS;AACZ,MAAA,OAAO,WAAWA,MAAK,CAAA;AAAA,IACzB;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA,OAAO,WAAA,CAAYA,MAAAA,EAAO,EAAE,QAAA,EAAU,CAAA;AAAA,IACxC;AAAA,IACA,KAAK,WAAA,EAAa;AAChB,MAAA,OAAO,eAAeA,MAAK,CAAA;AAAA,IAC7B;AAAA,IACA,KAAK,SAAA,EAAW;AACd,MAAA,OAAO,UAAUA,MAAK,CAAA;AAAA,IACxB;AAAA;AAEJ;AAEA,SAAS,sBAAA,CACP,UACA,OAAA,EAC2B;AAC3B,EAAA,OAAO,iCAAA,CAAkC,UAAU,OAAO,CAAA;AAC5D;AAUA,SAAS,QAAA,CACP,EAAA,EACAA,MAAAA,EACA,OAAA,EACA,OACA,OAAA,EACW;AACX,EAAA,MAAM,IAAA,GAAwB;AAAA,IAC5B,MAAA,EAAQ,WAAA;AAAA,IACR,EAAA;AAAA,IACA,KAAA,EAAAA,MAAAA;AAAA,IACA,OAAA;AAAA,IACA,GAAI,UAAU,MAAA,IAAa;AAAA,MACzB,KAAA,EAAO,OAAA,CAAQ,kBAAA,CAAmB,KAAK,CAAC;AAAA,KAC1C;AAAA,IACA,GAAI,OAAA,EAAS,SAAA,KAAc,UAAa,EAAE,SAAA,EAAW,QAAQ,SAAA,EAAU;AAAA,IACvE,GAAI,OAAA,EAAS,WAAA,KAAgB,MAAA,IAAa;AAAA,MACxC,aAAa,OAAA,CAAQ;AAAA;AACvB,GACF;AACA,EAAA,OAAO,UAAU,IAAI,CAAA;AACvB;AASO,SAAS,WAAA,CAEdA,QAAiB,OAAA,EAAqD;AACtE,EAAA,MAAM,cAAcA,MAAAA,CAAM,WAAA;AAE1B,EAAA,OAAO;AAAA,IACL,GAAG,iBAAiBA,MAAK,CAAA;AAAA,IACzB,GAAA,EAAK,CAA6B,GAAA,KAAW;AAC3C,MAAA,MAAM,OAAA,GAAU,WAAA,CAAY,CAAC,GAAG,CAAC,CAAA;AACjC,MAAA,MAAM,aAAA,GAAgB,gBAAA,CAAiB,WAAA,EAAa,OAAO,CAAA;AAC3D,MAAA,MAAM,QAAA,GAAW,sBAAA,CAAuB,OAAA,EAAS,QAAA,EAAU,OAAO,CAAA;AAClE,MAAA,MAAM,SAAA,GAAY,QAAA,CAASA,MAAAA,CAAM,KAAA,EAAOA,OAAM,IAAA,EAAM;AAAA,QAClD,WAAA,EAAa,aAAA;AAAA,QACb,GAAI,QAAA,EAAU,SAAA,KAAc,MAAA,IAAa;AAAA,UACvC,WAAW,QAAA,CAAS;AAAA,SACtB;AAAA,QACA,GAAI,QAAA,EAAU,WAAA,KAAgB,MAAA,IAAa;AAAA,UACzC,aAAa,QAAA,CAAS;AAAA;AACxB,OACD,CAAA;AACD,MAAA,OAAO,4BAAA,CAA6B,WAAW,QAAQ,CAAA;AAAA,IAGzD,CAAA;AAAA,IACA,MAAA,EAAQ,CAAC,GAAA,KAAQ;AACf,MAAA,MAAM,OAAA,GAAU,WAAA,CAAY,CAAC,GAAG,CAAC,CAAA;AACjC,MAAA,sBAAA,CAAuB,OAAA,EAAS,UAAU,OAAO,CAAA;AACjD,MAAA,OAAO,QAAA,CAAS,QAAA,EAAUA,MAAAA,EAAO,OAAO,CAAA;AAAA,IAC1C,CAAA;AAAA,IACA,OAAA,EAAS,CAAgC,OAAA,KAAe;AACtD,MAAA,MAAM,UAAA,GAAa,qBAAqB,OAA8B,CAAA;AACtE,MAAA,sBAAA,CAAuB,OAAA,EAAS,UAAU,UAAU,CAAA;AACpD,MAAA,OAAO,QAAA,CAAS,SAAA,EAAWA,MAAAA,EAAO,UAAU,CAAA;AAAA,IAC9C,CAAA;AAAA,IACA,UAAA,EAAY,CACV,OAAA,EACA,KAAA,KACG;AACH,MAAA,MAAM,UAAA,GAAa,qBAAqB,OAA8B,CAAA;AACtE,MAAA,MAAM,QAAA,GAAW,sBAAA,CAAuB,OAAA,EAAS,QAAA,EAAU,UAAU,CAAA;AACrE,MAAA,IACE,aACC,QAAA,CAAS,SAAA,KAAc,OAAA,IAAW,QAAA,CAAS,cAAc,QAAA,CAAA,EAC1D;AACA,QAAA,MAAM,IAAI,MAAM,qDAAqD,CAAA;AAAA,MACvE;AACA,MAAA,MAAM,gBAAA,GACJ,UAAU,SAAA,KAAc,MAAA,GACtB,SACA,EAAE,SAAA,EAAW,SAAS,SAAA,EAAU;AACpC,MAAA,OAAO,QAAA,CAAS,YAAA,EAAcA,MAAAA,EAAO,UAAA,EAAY,OAAO,gBAAgB,CAAA;AAAA,IAC1E,CAAA;AAAA,IACA,YAAA,EAAc,CACZ,OAAA,EACA,KAAA,KACG;AACH,MAAA,MAAM,UAAA,GAAa,qBAAqB,OAA8B,CAAA;AACtE,MAAA,MAAM,QAAA,GAAW,sBAAA,CAAuB,OAAA,EAAS,QAAA,EAAU,UAAU,CAAA;AACrE,MAAA,IAAI,QAAA,IAAY,QAAA,CAAS,SAAA,KAAc,OAAA,EAAS;AAC9C,QAAA,MAAM,IAAI,MAAM,sDAAsD,CAAA;AAAA,MACxE;AACA,MAAA,MAAM,gBAAA,GACJ,UAAU,WAAA,KAAgB,MAAA,GACxB,SACA,EAAE,WAAA,EAAa,SAAS,WAAA,EAAY;AACxC,MAAA,OAAO,QAAA;AAAA,QACL,cAAA;AAAA,QACAA,MAAAA;AAAA,QACA,UAAA;AAAA,QACA,KAAA;AAAA,QACA;AAAA,OACF;AAAA,IACF,CAAA;AAAA,IACA,UAAA,EAAY,CAAgC,OAAA,KAAe;AACzD,MAAA,MAAM,UAAA,GAAa,qBAAqB,OAA8B,CAAA;AACtE,MAAA,MAAM,QAAA,GAAW,sBAAA,CAAuB,OAAA,EAAS,QAAA,EAAU,UAAU,CAAA;AACrE,MAAA,MAAM,gBAAA,GACJ,UAAU,SAAA,KAAc,MAAA,GACtB,SACA,EAAE,SAAA,EAAW,SAAS,SAAA,EAAU;AACpC,MAAA,OAAO,QAAA;AAAA,QACL,YAAA;AAAA,QACAA,MAAAA;AAAA,QACA,UAAA;AAAA,QACA,MAAA;AAAA,QACA;AAAA,OACF;AAAA,IACF,CAAA;AAAA,IACA,aAAA,EAAe,CAAgC,OAAA,KAAe;AAC5D,MAAA,MAAM,UAAA,GAAa,qBAAqB,OAA8B,CAAA;AACtE,MAAA,MAAM,QAAA,GAAW,sBAAA,CAAuB,OAAA,EAAS,QAAA,EAAU,UAAU,CAAA;AACrE,MAAA,MAAM,gBAAA,GACJ,UAAU,SAAA,KAAc,MAAA,GACtB,SACA,EAAE,SAAA,EAAW,SAAS,SAAA,EAAU;AACpC,MAAA,OAAO,QAAA;AAAA,QACL,eAAA;AAAA,QACAA,MAAAA;AAAA,QACA,UAAA;AAAA,QACA,MAAA;AAAA,QACA;AAAA,OACF;AAAA,IACF,CAAA;AAAA,IACA,KAAA,EAAO,CAAgC,OAAA,KAAe;AACpD,MAAA,MAAM,UAAA,GAAa,qBAAqB,OAA8B,CAAA;AACtE,MAAA,MAAM,aAAA,GAAgB,gBAAA,CAAiB,WAAA,EAAa,UAAU,CAAA;AAC9D,MAAA,MAAM,QAAA,GAAW,sBAAA,CAAuB,OAAA,EAAS,QAAA,EAAU,UAAU,CAAA;AACrE,MAAA,MAAM,SAAA,GAAY,QAAA,CAASA,MAAAA,CAAM,KAAA,EAAOA,OAAM,IAAA,EAAM;AAAA,QAClD,WAAA,EAAa,aAAA;AAAA,QACb,GAAI,QAAA,EAAU,SAAA,KAAc,MAAA,IAAa;AAAA,UACvC,WAAW,QAAA,CAAS;AAAA,SACtB;AAAA,QACA,GAAI,QAAA,EAAU,WAAA,KAAgB,MAAA,IAAa;AAAA,UACzC,aAAa,QAAA,CAAS;AAAA;AACxB,OACD,CAAA;AACD,MAAA,OAAO,4BAAA,CAA6B,WAAW,QAAQ,CAAA;AAAA,IAGzD;AAAA,GACF;AACF;AA2BO,SAAS,OAAO,QAAA,EAA+B;AACpD,EAAA,MAAM,IAAA,GAAuB;AAAA,IAC3B,MAAA,EAAQ,QAAA;AAAA,IACR,QAAA;AAAA,IACA,OAAA,EAAS;AAAA,GACX;AACA,EAAA,OAAO,UAAU,IAAI,CAAA;AACvB;AAQO,SAAS,UAAU,QAAA,EAA+B;AACvD,EAAA,MAAM,IAAA,GAAuB;AAAA,IAC3B,MAAA,EAAQ,QAAA;AAAA,IACR,QAAA;AAAA,IACA,OAAA,EAAS;AAAA,GACX;AACA,EAAA,OAAO,UAAU,IAAI,CAAA;AACvB;AA0BO,SAAS,UAAA,CAAWA,QAAiB,QAAA,EAA+B;AACzE,EAAA,0BAAA,CAA2B,QAAQ,CAAA;AACnC,EAAA,kCAAA,CAAmCA,QAAO,QAAQ,CAAA;AAClD,EAAA,MAAM,IAAA,GAAmB;AAAA,IACvB,MAAA,EAAQ,aAAA;AAAA,IACR,KAAA,EAAAA,MAAAA;AAAA,IACA,QAAA;AAAA,IACA,OAAA,EAAS;AAAA,GACX;AACA,EAAA,OAAO,UAAU,IAAI,CAAA;AACvB;AASO,SAAS,aAAA,CAAcA,QAAiB,QAAA,EAA+B;AAC5E,EAAA,0BAAA,CAA2B,QAAQ,CAAA;AACnC,EAAA,kCAAA,CAAmCA,QAAO,QAAQ,CAAA;AAClD,EAAA,MAAM,IAAA,GAAmB;AAAA,IACvB,MAAA,EAAQ,aAAA;AAAA,IACR,KAAA,EAAAA,MAAAA;AAAA,IACA,QAAA;AAAA,IACA,OAAA,EAAS;AAAA,GACX;AACA,EAAA,OAAO,UAAU,IAAI,CAAA;AACvB;AAKA,SAAS,2BAA2B,QAAA,EAA0B;AAC5D,EAAA,MAAM,WAAA,GAAc,uBAAuB,QAAQ,CAAA;AACnD,EAAA,IAAI,gBAAgB,CAAA,EAAG;AAEvB,EAAA,MAAM,IAAI,yBAAA;AAAA,IACR,6DAA6D,WAAW,CAAA,CAAA;AAAA,IACxE,EAAE,qBAAqB,WAAA,EAAY;AAAA,IACnC;AAAA,MACE,UAAA,EACE;AAAA;AACJ,GACF;AACF;AAKA,SAAS,kCAAA,CACPA,QACA,QAAA,EACM;AACN,EAAA,MAAM,iBAAiBA,MAAAA,CAAM,SAAA;AAC7B,EAAA,MAAM,iBAAA,GAAoB,iCAAiC,QAAQ,CAAA;AACnE,EAAA,MAAM,oBAAoB,cAAA,IAAkB,iBAAA;AAE5C,EAAA,IAAI,gCAAA,CAAiC,iBAAiB,CAAA,EAAG;AACvD,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,CAAA,oCAAA,EAAuC,MAAA,CAAO,iBAAiB,CAAC,CAAA,OAAA,CAAA;AAAA,MAChE,EAAE,WAAW,iBAAA,EAAkB;AAAA,MAC/B;AAAA,QACE,UAAA,EACE;AAAA;AACJ,KACF;AAAA,EACF;AAEA,EAAA,IAAI,0BAAA,CAA2B,cAAA,EAAgB,iBAAiB,CAAA,EAAG;AACjE,IAAA;AAAA,EACF;AAEA,EAAA,MAAM,IAAI,yBAAA;AAAA,IACR,wCAAwC,MAAA,CAAO,cAAc,CAAC,CAAA,uCAAA,EAA0C,MAAA,CAAO,iBAAiB,CAAC,CAAA,CAAA,CAAA;AAAA,IACjI;AAAA,MACE,cAAA;AAAA,MACA;AAAA;AACF,GACF;AACF;AC7iCA,IAAM,mBAAA,GAAqC;AAAA,EACzC,KAAA,EAAO,iBAAA;AAAA,EACP,KAAA,EAAO,iBAAA;AAAA,EACP,QAAA,EAAU,yBAAA;AAAA,EACV,OAAA,EAAS;AACX,CAAA;AAQA,IAAM,wBAAA,GAA2B,sBAAA;AAOjC,SAAS,iBAAA,CAAkB,MAAc,KAAA,EAAqB;AAC5D,EAAA,IAAI,CAAC,IAAA,IAAQ,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG;AAC9B,IAAA,MAAM,IAAI,kBAAA,CAAmB,CAAA,EAAG,KAAK,CAAA,2BAAA,CAA6B,CAAA;AAAA,EACpE;AACA,EAAA,IAAI,IAAA,CAAK,SAAS,wBAAA,EAA0B;AAC1C,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,EAAG,KAAK,CAAA,sCAAA,EAAyC,wBAAwB,CAAA,WAAA;AAAA,KAC3E;AAAA,EACF;AACA,EAAA,IAAI,CAAC,wBAAA,CAAyB,IAAA,CAAK,IAAI,CAAA,EAAG;AACxC,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,EAAG,KAAK,CAAA,aAAA,EAAgB,IAAI,CAAA,mJAAA;AAAA,KAE9B;AAAA,EACF;AACF;AAQA,SAASE,iBAAgB,IAAA,EAAsB;AAC7C,EAAA,OAAO,CAAA,CAAA,EAAI,IAAA,CAAK,UAAA,CAAW,GAAA,EAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AACvC;AAyBO,SAAS,eAAA,CAAgB,KAAA,GAAgC,EAAC,EAAc;AAC7E,EAAA,MAAM,MAAA,GAAwB,EAAE,GAAG,mBAAA,EAAqB,GAAG,KAAA,EAAM;AAGjE,EAAA,iBAAA,CAAkB,MAAA,CAAO,OAAO,OAAO,CAAA;AACvC,EAAA,iBAAA,CAAkB,MAAA,CAAO,OAAO,OAAO,CAAA;AACvC,EAAA,iBAAA,CAAkB,MAAA,CAAO,UAAU,UAAU,CAAA;AAC7C,EAAA,iBAAA,CAAkB,MAAA,CAAO,SAAS,SAAS,CAAA;AAE3C,EAAA,OAAO;AAAA,IACL,MAAA;AAAA,IACA,YAAY,GAAA,CAAI,GAAA,CAAIA,gBAAAA,CAAgB,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,IACjD,YAAY,GAAA,CAAI,GAAA,CAAIA,gBAAAA,CAAgB,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,IACjD,eAAe,GAAA,CAAI,GAAA,CAAIA,gBAAAA,CAAgB,MAAA,CAAO,QAAQ,CAAC;AAAA,GACzD;AACF;AAKO,IAAM,qBAAgC,eAAA;AA0BtC,SAAS,aAAA,CAAc,UAAkB,SAAA,EAA2B;AACzE,EAAA,OAAO,CAAA,EAAG,QAAQ,CAAA,EAAA,EAAS,SAAS,CAAA,CAAA;AACtC;AAOO,IAAM,gBAAA,GAAmB,MAAA;AACzB,IAAM,oBAAA,GAAuB,gBAAA;AAC7B,IAAM,kBAAA,GAAqB,cAAA;AAC3B,IAAM,2BAAA,GAA8B,0BAAA;;;ACvJ3C,SAAS,qBAAA,CAAsB,MAAuB,GAAA,EAAwB;AAC5E,EAAA,GAAA,CAAI,GAAA,CAAI,KAAK,EAAE,CAAA;AAEf,EAAA,QAAQ,KAAK,EAAA;AAAI,IACf,KAAK,WAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,gBAAA;AAAA,IACL,KAAK,MAAA;AAAA,IACL,KAAK,cAAA;AAAA,IACL,KAAK,SAAA;AAAA,IACL,KAAK,kBAAA;AAAA,IACL,KAAK,MAAA;AAAA,IACL,KAAK,YAAA,EAAc;AACjB,MAAA,qBAAA,CAAsB,IAAA,CAAK,OAAO,GAAG,CAAA;AACrC,MAAA;AAAA,IACF;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA,qBAAA,CAAsB,IAAA,CAAK,MAAM,GAAG,CAAA;AACpC,MAAA,qBAAA,CAAsB,IAAA,CAAK,OAAO,GAAG,CAAA;AACrC,MAAA;AAAA,IACF;AAAA,IACA,KAAK,MAAA,EAAQ;AACX,MAAA;AAAA,IACF;AAAA;AAEJ;AAEA,SAAS,2BAAA,CACP,UACA,EAAA,EACmB;AACnB,EAAA,IAAI,cAA+B,QAAA,CAAS,KAAA;AAE5C,EAAA,WAAS;AACP,IAAA,IAAI,WAAA,CAAY,OAAO,EAAA,EAAI;AACzB,MAAA,OAAO,WAAA;AAAA,IACT;AAEA,IAAA,QAAQ,YAAY,EAAA;AAAI,MACtB,KAAK,WAAA;AAAA,MACL,KAAK,QAAA;AAAA,MACL,KAAK,gBAAA;AAAA,MACL,KAAK,MAAA;AAAA,MACL,KAAK,cAAA;AAAA,MACL,KAAK,kBAAA;AAAA,MACL,KAAK,MAAA;AAAA,MACL,KAAK,YAAA,EAAc;AACjB,QAAA,WAAA,GAAc,WAAA,CAAY,KAAA;AAC1B,QAAA;AAAA,MACF;AAAA,MACA,KAAK,SAAA;AAAA,MACL,KAAK,MAAA;AAAA,MACL,KAAK,QAAA,EAAU;AACb,QAAA,OAAO,MAAA;AAAA,MACT;AAAA;AACF,EACF;AACF;AAEA,SAAS,mBAAmB,WAAA,EAA4C;AACtE,EAAA,IAAI,WAAA,CAAY,IAAA,CAAK,EAAA,KAAO,SAAA,EAAW;AACrC,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,CAAA,6DAAA,EAAgE,WAAA,CAAY,IAAA,CAAK,EAAE,CAAA,CAAA,CAAA;AAAA,MACnF,EAAE,WAAW,gBAAA;AAAiB,KAChC;AAAA,EACF;AAEA,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAY;AACnC,EAAA,qBAAA,CAAsB,WAAA,CAAY,MAAM,UAAU,CAAA;AAElD,EAAA,MAAM,eAAA,GAAkB,2BAAA;AAAA,IACtB,WAAA,CAAY,IAAA;AAAA,IACZ;AAAA,GACF;AACA,EAAA,MAAM,QAAA,GAAW,2BAAA;AAAA,IACf,WAAA,CAAY,IAAA;AAAA,IACZ;AAAA,GACF;AAEA,EAAA,OAAO;AAAA,IACL,YAAA,EAAc,UAAA,CAAW,GAAA,CAAI,WAAW,CAAA;AAAA,IACxC,gBAAA,EAAkB,UAAA,CAAW,GAAA,CAAI,gBAAgB,CAAA;AAAA,IACjD,cAAA,EAAgB,UAAA,CAAW,GAAA,CAAI,cAAc,CAAA;AAAA,IAC7C,kBAAA,EAAoB,UAAA,CAAW,GAAA,CAAI,kBAAkB,CAAA;AAAA,IACrD,eAAA,EAAiB,UAAA,CAAW,GAAA,CAAI,QAAQ,CAAA;AAAA,IACxC,OAAA,EAAS,UAAA,CAAW,GAAA,CAAI,MAAM,CAAA;AAAA,IAC9B,YAAA,EAAc,UAAA,CAAW,GAAA,CAAI,YAAY,CAAA;AAAA,IACzC,eAAA;AAAA,IACA,iBAAiB,WAAA,CAAY,IAAA;AAAA,IAC7B;AAAA,GACF;AACF;AAEO,SAAS,2BACd,WAAA,EACkB;AAClB,EAAA,MAAM,KAAA,GAAQ,mBAAmB,WAAW,CAAA;AAC5C,EAAA,IAAI,MAAM,eAAA,EAAiB;AACzB,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,uEAAA;AAAA,MACA,EAAE,WAAW,gBAAA;AAAiB,KAChC;AAAA,EACF;AACA,EAAA,IAAI,MAAM,kBAAA,EAAoB;AAC5B,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,iFAAA;AAAA,MACA,EAAE,WAAW,gBAAA;AAAiB,KAChC;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAEO,SAAS,4BACd,WAAA,EACkB;AAClB,EAAA,MAAM,KAAA,GAAQ,mBAAmB,WAAW,CAAA;AAC5C,EAAA,IAAI,CAAC,MAAM,kBAAA,EAAoB;AAC7B,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,kFAAA;AAAA,MACA,EAAE,WAAW,gBAAA;AAAiB,KAChC;AAAA,EACF;AACA,EAAA,IAAI,MAAM,eAAA,EAAiB;AACzB,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,wEAAA;AAAA,MACA,EAAE,WAAW,gBAAA;AAAiB,KAChC;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,4BACP,QAAA,EACiC;AACjC,EAAA,IAAI,WAAA,GAA+B,QAAA;AAEnC,EAAA,WAAS;AACP,IAAA,IAAI,WAAA,CAAY,OAAO,cAAA,EAAgB;AACrC,MAAA,OAAO,WAAA;AAAA,IACT;AAEA,IAAA,QAAQ,YAAY,EAAA;AAAI,MACtB,KAAK,WAAA;AAAA,MACL,KAAK,QAAA;AAAA,MACL,KAAK,gBAAA;AAAA,MACL,KAAK,MAAA;AAAA,MACL,KAAK,SAAA;AAAA,MACL,KAAK,kBAAA;AAAA,MACL,KAAK,MAAA;AAAA,MACL,KAAK,YAAA,EAAc;AACjB,QAAA,WAAA,GAAc,WAAA,CAAY,KAAA;AAC1B,QAAA;AAAA,MACF;AAAA,MACA,KAAK,MAAA;AAAA,MACL,KAAK,QAAA,EAAU;AACb,QAAA,OAAO,MAAA;AAAA,MACT;AAAA;AACF,EACF;AACF;AAEA,SAAS,qBACP,QAAA,EAC0B;AAC1B,EAAA,IAAI,WAAA,GAA+B,QAAA;AAEnC,EAAA,WAAS;AACP,IAAA,IAAI,WAAA,CAAY,OAAO,MAAA,EAAQ;AAC7B,MAAA,OAAO,WAAA;AAAA,IACT;AAEA,IAAA,QAAQ,YAAY,EAAA;AAAI,MACtB,KAAK,WAAA;AAAA,MACL,KAAK,QAAA;AAAA,MACL,KAAK,gBAAA;AAAA,MACL,KAAK,MAAA;AAAA,MACL,KAAK,cAAA;AAAA,MACL,KAAK,SAAA;AAAA,MACL,KAAK,kBAAA;AAAA,MACL,KAAK,YAAA,EAAc;AACjB,QAAA,WAAA,GAAc,WAAA,CAAY,KAAA;AAC1B,QAAA;AAAA,MACF;AAAA,MACA,KAAK,MAAA;AAAA,MACL,KAAK,QAAA,EAAU;AACb,QAAA,OAAO,MAAA;AAAA,MACT;AAAA;AACF,EACF;AACF;AAEO,SAAS,wBACd,WAAA,EACuB;AACvB,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAY;AACnC,EAAA,qBAAA,CAAsB,WAAA,CAAY,MAAM,UAAU,CAAA;AAElD,EAAA,IAAI,CAAC,UAAA,CAAW,GAAA,CAAI,QAAQ,CAAA,EAAG;AAC7B,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,4EAAA;AAAA,MACA,EAAE,WAAW,gBAAA;AAAiB,KAChC;AAAA,EACF;AAEA,EAAA,MAAM,eAAA,GAAkB,2BAAA,CAA4B,WAAA,CAAY,IAAI,CAAA;AACpE,EAAA,MAAM,QAAA,GAAW,oBAAA,CAAqB,WAAA,CAAY,IAAI,CAAA;AAEtD,EAAA,OAAO;AAAA,IACL,gBAAgB,eAAA,KAAoB,MAAA;AAAA,IACpC,eAAA,EAAiB,IAAA;AAAA,IACjB,SAAS,QAAA,KAAa,MAAA;AAAA,IACtB,eAAA;AAAA,IACA;AAAA,GACF;AACF;ACrOA,SAAS,qCAAA,CACP,aACA,KAAA,EACM;AACN,EAAA,MAAM,SAAA,GAAY,4BAA4B,WAAW,CAAA;AACzD,EAAA,IAAI,SAAA,CAAU,OAAA,IAAW,KAAA,CAAM,OAAA,KAAY,MAAA,EAAW;AACpD,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,gFAAA;AAAA,MACA,EAAE,WAAW,mBAAA;AAAoB,KACnC;AAAA,EACF;AACA,EAAA,IAAI,CAAC,SAAA,CAAU,OAAA,IAAW,KAAA,CAAM,YAAY,MAAA,EAAW;AACrD,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,8EAAA;AAAA,MACA,EAAE,WAAW,mBAAA;AAAoB,KACnC;AAAA,EACF;AACA,EAAA,IAAI,SAAA,CAAU,cAAA,IAAkB,KAAA,CAAM,WAAA,KAAgB,MAAA,EAAW;AAC/D,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,4FAAA;AAAA,MACA,EAAE,WAAW,mBAAA;AAAoB,KACnC;AAAA,EACF;AACA,EAAA,IAAI,CAAC,SAAA,CAAU,cAAA,IAAkB,KAAA,CAAM,gBAAgB,MAAA,EAAW;AAChE,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,0FAAA;AAAA,MACA,EAAE,WAAW,mBAAA;AAAoB,KACnC;AAAA,EACF;AACF;AAEO,SAAS,sBAAsB,KAAA,EAAwC;AAC5E,EAAA,qCAAA,CAAsC,KAAA,CAAM,aAAa,KAAK,CAAA;AAE9D,EAAA,MAAM,KAAA,GAAe;AAAA,IACnBC,GAAAA,CAAAA,cAAAA,CAAAA;AAAA,IACA,KAAA,CAAM,YAAA;AAAA,IACNA,GAAAA,CAAAA,OAAAA,EAAa,MAAM,UAAU,CAAA,CAAA;AAAA,IAC7BA,GAAAA,CAAAA,kBAAAA,CAAAA;AAAA,IACA,KAAA,CAAM;AAAA,GACR;AAEA,EAAA,IAAI,KAAA,CAAM,YAAY,MAAA,EAAW;AAC/B,IAAA,KAAA,CAAM,IAAA,CAAK,MAAM,OAAO,CAAA;AAAA,EAC1B;AACA,EAAA,IAAI,KAAA,CAAM,gBAAgB,MAAA,EAAW;AACnC,IAAA,KAAA,CAAM,IAAA,CAAK,MAAM,WAAW,CAAA;AAAA,EAC9B;AAEA,EAAA,OAAOA,GAAAA,CAAI,IAAA,CAAK,KAAA,EAAOA,GAAAA,CAAAA,CAAAA,CAAM,CAAA;AAC/B;ACpDA,SAAS,wCAAA,CACP,aACA,aAAA,EACM;AACN,EAAA,MAAM,KAAA,GAAQ,wBAAwB,WAAW,CAAA;AACjD,EAAA,MAAM,gBAAA,GACJ,aAAA,KAAkB,MAAA,IAAa,aAAA,CAAc,MAAA,GAAS,CAAA;AAExD,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,IAAW,CAAC,KAAA,CAAM,kBAAkB,gBAAA,EAAkB;AAC/D,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,2GAAA;AAAA,MACA,EAAE,WAAW,uBAAA;AAAwB,KACvC;AAAA,EACF;AAEA,EAAA,IAAI,CAAC,gBAAA,EAAkB;AACrB,IAAA,IAAI,KAAA,CAAM,OAAA,IAAW,KAAA,CAAM,cAAA,EAAgB;AACzC,MAAA,MAAM,IAAI,sBAAA;AAAA,QACR,4GAAA;AAAA,QACA,EAAE,WAAW,uBAAA;AAAwB,OACvC;AAAA,IACF;AACA,IAAA;AAAA,EACF;AAEA,EAAA,MAAM,sBAAA,GACJ,KAAA,CAAM,eAAA,KAAoB,MAAA,GACxB,KACC,KAAA,CAAM,eAAA,CAAgB,KAAA,KAAU,MAAA,GAAY,IAAI,CAAA,KAChD,KAAA,CAAM,eAAA,CAAgB,MAAA,KAAW,SAAY,CAAA,GAAI,CAAA,CAAA;AACtD,EAAA,MAAM,mBAAA,GAAA,CACH,KAAA,CAAM,QAAA,KAAa,MAAA,GAAY,IAAI,CAAA,IAAK,sBAAA;AAE3C,EAAA,IAAI,aAAA,CAAc,WAAW,mBAAA,EAAqB;AAChD,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,CAAA,mCAAA,EAAsC,OAAO,mBAAmB,CAAC,sDAAsD,MAAA,CAAO,aAAA,CAAc,MAAM,CAAC,CAAA,CAAA;AAAA,MACnJ,EAAE,WAAW,uBAAA;AAAwB,KACvC;AAAA,EACF;AACF;AAEO,SAAS,yBACd,KAAA,EACK;AACL,EAAA,wCAAA;AAAA,IACE,KAAA,CAAM,WAAA;AAAA,IACN,KAAA,CAAM;AAAA,GACR;AAEA,EAAA,MAAM,QAAe,EAAC;AACtB,EAAA,IAAI,MAAM,IAAA,KAAS,MAAA,IAAa,KAAA,CAAM,IAAA,CAAK,SAAS,CAAA,EAAG;AACrD,IAAA,KAAA,CAAM,IAAA,CAAKA,GAAAA,CAAAA,KAAAA,EAAWA,GAAAA,CAAI,IAAA,CAAK,CAAC,GAAG,KAAA,CAAM,IAAI,CAAA,EAAGA,GAAAA,CAAAA,EAAAA,CAAO,CAAC,CAAA,CAAE,CAAA;AAAA,EAC5D;AAEA,EAAA,KAAA,CAAM,IAAA,CAAK,MAAM,SAAS,CAAA;AAE1B,EAAA,IAAI,MAAM,aAAA,KAAkB,MAAA,IAAa,KAAA,CAAM,aAAA,CAAc,SAAS,CAAA,EAAG;AACvE,IAAA,KAAA,CAAM,IAAA,CAAK,GAAG,KAAA,CAAM,aAAa,CAAA;AAAA,EACnC;AAEA,EAAA,OAAOA,GAAAA,CAAI,IAAA,CAAK,KAAA,EAAOA,GAAAA,CAAAA,CAAAA,CAAM,CAAA;AAC/B;ACzDA,SAAS,oCAAA,CACP,aACA,KAAA,EACM;AACN,EAAA,MAAM,SAAA,GAAY,2BAA2B,WAAW,CAAA;AACxD,EAAA,IAAI,KAAA,CAAM,OAAA,KAAY,MAAA,IAAa,CAAC,UAAU,YAAA,EAAc;AAC1D,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,kFAAA;AAAA,MACA,EAAE,WAAW,kBAAA;AAAmB,KAClC;AAAA,EACF;AACA,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,MAAA,IAAa,CAAC,UAAU,YAAA,EAAc;AACzD,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,gFAAA;AAAA,MACA,EAAE,WAAW,kBAAA;AAAmB,KAClC;AAAA,EACF;AACA,EAAA,MAAM,cAAA,GACJ,SAAA,CAAU,OAAA,IAAW,SAAA,CAAU,gBAAgB,SAAA,CAAU,gBAAA;AAC3D,EAAA,IAAI,cAAA,IAAkB,KAAA,CAAM,OAAA,KAAY,MAAA,EAAW;AACjD,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,8GAAA;AAAA,MACA,EAAE,WAAW,kBAAA;AAAmB,KAClC;AAAA,EACF;AACA,EAAA,IAAI,CAAC,cAAA,IAAkB,KAAA,CAAM,OAAA,KAAY,MAAA,EAAW;AAClD,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,4GAAA;AAAA,MACA,EAAE,WAAW,kBAAA;AAAmB,KAClC;AAAA,EACF;AACA,EAAA,IAAI,SAAA,CAAU,cAAA,IAAkB,KAAA,CAAM,WAAA,KAAgB,MAAA,EAAW;AAC/D,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,2FAAA;AAAA,MACA,EAAE,WAAW,kBAAA;AAAmB,KAClC;AAAA,EACF;AACA,EAAA,IAAI,CAAC,SAAA,CAAU,cAAA,IAAkB,KAAA,CAAM,gBAAgB,MAAA,EAAW;AAChE,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,yFAAA;AAAA,MACA,EAAE,WAAW,kBAAA;AAAmB,KAClC;AAAA,EACF;AACF;AAEO,SAAS,qBAAqB,KAAA,EAAuC;AAC1E,EAAA,oCAAA,CAAqC,KAAA,CAAM,aAAa,KAAK,CAAA;AAE7D,EAAA,MAAM,QAAe,EAAC;AACtB,EAAA,IAAI,KAAA,CAAM,IAAA,CAAK,MAAA,GAAS,CAAA,EAAG;AACzB,IAAA,KAAA,CAAM,IAAA,CAAKA,GAAAA,CAAAA,KAAAA,EAAWA,GAAAA,CAAI,IAAA,CAAK,CAAC,GAAG,KAAA,CAAM,IAAI,CAAA,EAAGA,GAAAA,CAAAA,EAAAA,CAAO,CAAC,CAAA,CAAE,CAAA;AAAA,EAC5D;AAEA,EAAA,KAAA,CAAM,KAAKA,GAAAA,CAAAA,OAAAA,EAAa,KAAA,CAAM,UAAU,CAAA,CAAA,EAAI,MAAM,UAAU,CAAA;AAE5D,EAAA,IAAI,KAAA,CAAM,YAAY,MAAA,EAAW;AAC/B,IAAA,KAAA,CAAM,IAAA,CAAK,MAAM,OAAO,CAAA;AAAA,EAC1B;AACA,EAAA,IAAI,KAAA,CAAM,WAAW,MAAA,EAAW;AAC9B,IAAA,KAAA,CAAM,IAAA,CAAK,MAAM,MAAM,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,KAAA,CAAM,YAAY,MAAA,EAAW;AAC/B,IAAA,KAAA,CAAM,IAAA,CAAK,MAAM,OAAO,CAAA;AAAA,EAC1B;AACA,EAAA,IAAI,KAAA,CAAM,gBAAgB,MAAA,EAAW;AACnC,IAAA,KAAA,CAAM,IAAA,CAAK,MAAM,WAAW,CAAA;AAAA,EAC9B;AAEA,EAAA,OAAOA,GAAAA,CAAI,IAAA,CAAK,KAAA,EAAOA,GAAAA,CAAAA,CAAAA,CAAM,CAAA;AAC/B;;;ACiQO,IAAM,aAAA,GAAgB,EAAA;AAGtB,IAAM,kBAAA,GAAqB,CAAA;AA0G3B,SAAS,eAAe,SAAA,EAAyC;AACtE,EAAA,MAAM,UAAU,SAAA,CAAU,gBAAA;AAC1B,EAAA,IAAI,YAAY,MAAA,IAAa,OAAA,CAAQ,MAAA,KAAW,CAAA,SAAU,SAAA,CAAU,SAAA;AAEpE,EAAA,OAAO;AAAA,IACL,GAAG,SAAA,CAAU,SAAA;AAAA,IACb,GAAG,OAAA,CAAQ,MAAA,CAAO,CAAC,IAAA,KAAS,CAAC,SAAA,CAAU,SAAA,CAAU,QAAA,CAAS,IAAI,CAAC;AAAA,GACjE;AACF;ACpaA,IAAM,iBAAA,GAA4C;AAAA,EAChD,EAAA,EAAI,GAAA;AAAA,EACJ,GAAA,EAAK,IAAA;AAAA,EACL,EAAA,EAAI,GAAA;AAAA,EACJ,GAAA,EAAK,IAAA;AAAA,EACL,EAAA,EAAI,GAAA;AAAA,EACJ,GAAA,EAAK;AACP,CAAA;AAgBO,SAAS,kBAAA,CACdH,MAAAA,EACA,QAAA,EACA,eAAA,EACK;AAGL,EAAA,IAAI,oBAAoB,MAAA,EAAW;AACjC,IAAA,MAAMI,UAAAA,GAAY,eAAA,KAAoB,EAAA,GAAK,EAAA,GAAK,GAAG,eAAe,CAAA,CAAA,CAAA;AAElE,IAAA,IAAIJ,MAAAA,CAAM,KAAK,MAAA,KAAW,CAAA,IAAKA,OAAM,IAAA,CAAK,CAAC,MAAM,IAAA,EAAM;AACrD,MAAA,OAAOG,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAGC,UAAS,CAAA,EAAA,CAAI,CAAA;AAAA,IACjC;AACA,IAAA,IAAIJ,MAAAA,CAAM,KAAK,MAAA,KAAW,CAAA,IAAKA,OAAM,IAAA,CAAK,CAAC,MAAM,MAAA,EAAQ;AACvD,MAAA,OAAOG,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAGC,UAAS,CAAA,IAAA,CAAM,CAAA;AAAA,IACnC;AACA,IAAA,IAAIJ,MAAAA,CAAM,KAAK,MAAA,GAAS,CAAA,IAAKA,OAAM,IAAA,CAAK,CAAC,MAAM,OAAA,EAAS;AACtD,MAAA,OAAOG,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAGC,UAAS,CAAA,KAAA,CAAO,CAAA;AAAA,IACpC;AAEA,IAAA,OAAOD,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAGC,UAAS,CAAA,EAAGJ,OAAM,IAAA,CAAK,IAAA,CAAK,GAAG,CAAC,CAAA,CAAE,CAAA;AAAA,EACtD;AAGA,EAAA,MAAM,SAASA,MAAAA,CAAM,KAAA;AACrB,EAAA,MAAM,SAAA,GAAY,QAAA,GAAW,CAAA,EAAG,QAAQ,CAAA,CAAA,CAAA,GAAM,EAAA;AAE9C,EAAA,IAAIA,MAAAA,CAAM,KAAK,MAAA,KAAW,CAAA,IAAKA,OAAM,IAAA,CAAK,CAAC,MAAM,IAAA,EAAM;AACrD,IAAA,OAAOG,IAAI,GAAA,CAAI,CAAA,EAAG,SAAS,CAAA,EAAG,MAAM,CAAA,GAAA,CAAK,CAAA;AAAA,EAC3C;AACA,EAAA,IAAIH,MAAAA,CAAM,KAAK,MAAA,KAAW,CAAA,IAAKA,OAAM,IAAA,CAAK,CAAC,MAAM,MAAA,EAAQ;AACvD,IAAA,OAAOG,IAAI,GAAA,CAAI,CAAA,EAAG,SAAS,CAAA,EAAG,MAAM,CAAA,KAAA,CAAO,CAAA;AAAA,EAC7C;AACA,EAAA,IAAIH,MAAAA,CAAM,KAAK,MAAA,GAAS,CAAA,IAAKA,OAAM,IAAA,CAAK,CAAC,MAAM,OAAA,EAAS;AACtD,IAAA,OAAOG,IAAI,GAAA,CAAI,CAAA,EAAG,SAAS,CAAA,EAAG,MAAM,CAAA,MAAA,CAAQ,CAAA;AAAA,EAC9C;AAEA,EAAA,OAAOA,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAG,SAAS,CAAA,EAAG,MAAM,CAAA,CAAA,EAAIH,MAAAA,CAAM,IAAA,CAAK,IAAA,CAAK,GAAG,CAAC,CAAA,CAAE,CAAA;AAChE;AAKA,SAAS,gBAAgBA,MAAAA,EAA0C;AACjE,EAAA,IAAIA,MAAAA,CAAM,gBAAgB,MAAA,EAAW;AACnC,IAAA,OAAOA,MAAAA,CAAM,WAAA;AAAA,EACf;AAEA,EAAA,IAAIA,MAAAA,CAAM,KAAK,MAAA,GAAS,CAAA,IAAKA,OAAM,IAAA,CAAK,CAAC,MAAM,OAAA,EAAS;AACtD,IAAA,OAAO,WAAA,CAAYA,MAAAA,CAAM,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,EACxC;AAEA,EAAA,OAAO,MAAA;AACT;AAKA,SAAS,YAAYA,MAAAA,EAA0B;AAC7C,EAAA,OAAOA,OAAM,IAAA,CAAK,MAAA,GAAS,KAAKA,MAAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,OAAA;AACpD;AAKA,SAASK,oBACP,SAAA,EACuB;AACvB,EAAA,IAAI,CAAC,SAAA,IAAa,SAAA,KAAc,SAAA,EAAW;AACzC,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,OAAO,SAAA;AACT;AAKO,SAAS,kBACdL,MAAAA,EACA,OAAA,EACA,SAAA,EACA,QAAA,EACA,iBACA,eAAA,EACK;AACL,EAAA,MAAM,QAAA,GAAWK,oBAAmB,SAAS,CAAA;AAC7C,EAAA,MAAM,MAAA,GAAS,kBAAA,CAAmBL,MAAAA,EAAO,QAAA,EAAU,eAAe,CAAA;AAElE,EAAA,IAAI,CAAC,WAAA,CAAYA,MAAK,CAAA,EAAG;AACvB,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,OAAA,GAAU,eAAA,IAAmB,eAAA,CAAgBA,MAAK,CAAA;AACxD,EAAA,IAAI,CAAC,OAAA,IAAW,OAAA,KAAY,EAAA,EAAI;AAC9B,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,QAAQ,QAAA;AAAU,IAChB,KAAK,QAAA,EAAU;AACb,MAAA,OAAO,OAAA,CAAQ,iBAAA,CAAkB,MAAA,EAAQ,OAAO,CAAA;AAAA,IAClD;AAAA,IACA,KAAK,SAAA,EAAW;AACd,MAAA,OAAO,OAAA,CAAQ,kBAAA,CAAmB,MAAA,EAAQ,OAAO,CAAA;AAAA,IACnD;AAAA,IACA,KAAK,MAAA,EAAQ;AACX,MAAA,OAAO,OAAA,CAAQ,eAAA,CAAgB,MAAA,EAAQ,OAAO,CAAA;AAAA,IAChD;AAAA,IACA,KAAK,OAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,WAAA,EAAa;AAGhB,MAAA,OAAO,OAAA,CAAQ,WAAA,CAAY,MAAA,EAAQ,OAAO,CAAA;AAAA,IAC5C;AAAA,IACA,KAAK,QAAA;AAAA,IACL,KAAK,SAAA;AAAA,IACL,KAAK,MAAA,EAAW;AACd,MAAA,OAAO,OAAA,CAAQ,eAAA,CAAgB,MAAA,EAAQ,OAAO,CAAA;AAAA,IAChD;AAAA;AAEJ;AAKA,SAAS,qBAAA,CACPA,MAAAA,EACA,OAAA,EACA,QAAA,EACA,iBACA,eAAA,EACK;AACL,EAAA,MAAM,MAAA,GAAS,kBAAA,CAAmBA,MAAAA,EAAO,QAAA,EAAU,eAAe,CAAA;AAClE,EAAA,IAAI,CAAC,WAAA,CAAYA,MAAK,CAAA,EAAG;AACvB,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,OAAA,GAA6B,eAAA,CAAgBA,MAAK,CAAA;AACxD,EAAA,IAAI,CAAC,OAAA,IAAW,OAAA,KAAY,EAAA,EAAI;AAC9B,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,OAAO,OAAA,CAAQ,eAAA,CAAgB,MAAA,EAAQ,OAAO,CAAA;AAChD;AAKA,SAAS,qBAAA,CACPA,MAAAA,EACA,OAAA,EACA,QAAA,EACA,iBACA,eAAA,EACK;AACL,EAAA,MAAM,MAAA,GAAS,kBAAA,CAAmBA,MAAAA,EAAO,QAAA,EAAU,eAAe,CAAA;AAClE,EAAA,IAAI,CAAC,WAAA,CAAYA,MAAK,CAAA,EAAG;AACvB,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,OAAA,GAAU,eAAA,IAAmB,eAAA,CAAgBA,MAAK,CAAA;AACxD,EAAA,IAAI,CAAC,OAAA,IAAW,OAAA,KAAY,EAAA,EAAI;AAC9B,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,OAAO,OAAA,CAAQ,WAAA,CAAY,MAAA,EAAQ,OAAO,CAAA;AAC5C;AASA,SAAS,yBACP,QAAA,EACuB;AACvB,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAe;AAEpC,EAAA,KAAA,MAAWM,YAAW,QAAA,EAAU;AAC9B,IAAA,MAAM,SAAA,GAAYD,mBAAAA,CAAmBC,QAAAA,CAAQ,SAAS,CAAA;AACtD,IAAA,IAAI,SAAA,EAAW;AACb,MAAA,QAAA,CAAS,IAAI,SAAS,CAAA;AAAA,IACxB;AAAA,EACF;AAEA,EAAA,IAAI,QAAA,CAAS,OAAO,CAAA,EAAG;AACrB,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,2DAAA;AAAA,MACA,EAAE,UAAA,EAAY,CAAC,GAAG,QAAQ,CAAA;AAAE,KAC9B;AAAA,EACF;AAEA,EAAA,OAAO,QAAA,CAAS,MAAA,EAAO,CAAE,IAAA,EAAK,CAAE,KAAA;AAClC;AAKA,SAAS,0BAAA,CACPN,QACA,KAAA,EACuB;AACvB,EAAA,IAAI,cAAA,CAAe,KAAK,CAAA,EAAG;AACzB,IAAA,OACEK,oBAAmB,KAAA,CAAM,SAAS,CAAA,IAAKA,mBAAAA,CAAmBL,OAAM,SAAS,CAAA;AAAA,EAE7E;AACA,EAAA,MAAM,WAAW,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,GAAI,KAAA,GAAQ,CAAC,KAAK,CAAA;AACtD,EAAA,MAAM,WAAA,GAAc,yBAAyB,QAAQ,CAAA;AACrD,EAAA,MAAM,SAAA,GAAYK,mBAAAA,CAAmBL,MAAAA,CAAM,SAAS,CAAA;AAGpD,EAAA,IAAI,SAAA,KAAc,MAAA,IAAU,WAAA,KAAgB,QAAA,EAAU;AACpD,IAAA,OAAO,SAAA;AAAA,EACT;AAEA,EAAA,IAAI,WAAA,EAAa;AACf,IAAA,OAAO,WAAA;AAAA,EACT;AAEA,EAAA,OAAO,SAAA;AACT;AAKA,SAAS,yBAAA,CACP,WACAM,QAAAA,EACuB;AACvB,EAAA,MAAM,mBAAA,GAAsBD,oBAAmB,SAAS,CAAA;AACxD,EAAA,IAAI,mBAAA,EAAqB;AACvB,IAAA,OAAO,mBAAA;AAAA,EACT;AAEA,EAAA,OAAOC,QAAAA,GAAUD,mBAAAA,CAAmBC,QAAAA,CAAQ,SAAS,CAAA,GAAI,MAAA;AAC3D;AAUA,SAAS,kBAAA,CAAmB,OAAgB,OAAA,EAAkC;AAC5E,EAAA,OAAO,OAAA,CAAQ,UAAU,KAAK,CAAA;AAChC;AASA,SAAS,oBAAA,CAAqB,IAAY,OAAA,EAAyB;AACjE,EAAA,MAAM,OAAA,GAAU,OAAA,CACb,UAAA,CAAW,GAAA,EAAK,MAAA,CAAO,OAAO,CAAA,CAC9B,UAAA,CAAW,GAAA,EAAK,MAAA,CAAO,GAAA,CAAA,EAAA,CAAO,CAAA;AAEjC,EAAA,QAAQ,EAAA;AAAI,IACV,KAAK,UAAA,EAAY;AACf,MAAA,OAAO,IAAI,OAAO,CAAA,CAAA,CAAA;AAAA,IACpB;AAAA,IACA,KAAK,YAAA,EAAc;AACjB,MAAA,OAAO,GAAG,OAAO,CAAA,CAAA,CAAA;AAAA,IACnB;AAAA,IACA,KAAK,UAAA,EAAY;AACf,MAAA,OAAO,IAAI,OAAO,CAAA,CAAA;AAAA,IACpB;AAAA,IACA,KAAK,MAAA;AAAA,IACL,KAAK,OAAA,EAAS;AACZ,MAAA,OAAO,OAAA;AAAA,IACT;AAAA,IACA,SAAS;AACP,MAAA,OAAO,OAAA;AAAA,IACT;AAAA;AAEJ;AAKA,SAAS,2BAA2B,SAAA,EAAqB;AACvD,EAAA,OAAOH,8BAA8B,SAAS,CAAA,yCAAA,CAAA;AAChD;AAKA,SAAS,iCAAA,CAAkC,IAAY,SAAA,EAAqB;AAC1E,EAAA,QAAQ,EAAA;AAAI,IACV,KAAK,UAAA,EAAY;AACf,MAAA,MAAM,OAAA,GAAU,2BAA2B,SAAS,CAAA;AACpD,MAAA,OAAOA,aAAa,OAAO,CAAA,OAAA,CAAA;AAAA,IAC7B;AAAA,IACA,KAAK,YAAA,EAAc;AACjB,MAAA,MAAM,OAAA,GAAU,2BAA2B,SAAS,CAAA;AACpD,MAAA,OAAOA,MAAM,OAAO,CAAA,OAAA,CAAA;AAAA,IACtB;AAAA,IACA,KAAK,UAAA,EAAY;AACf,MAAA,MAAM,OAAA,GAAU,2BAA2B,SAAS,CAAA;AACpD,MAAA,OAAOA,aAAa,OAAO,CAAA,CAAA;AAAA,IAC7B;AAAA,IACA,KAAK,MAAA;AAAA,IACL,KAAK,OAAA,EAAS;AACZ,MAAA,OAAO,SAAA;AAAA,IACT;AAAA,IACA,SAAS;AACP,MAAA,OAAO,2BAA2B,SAAS,CAAA;AAAA,IAC7C;AAAA;AAEJ;AA6CO,SAAS,0BAAA,CACd,MACA,GAAA,EACK;AACL,EAAA,MAAM,EAAE,SAAQ,GAAI,GAAA;AAEpB,EAAA,MAAM,kBAAkB,GAAA,CAAI,eAAA;AAE5B,EAAA,QAAQ,KAAK,MAAA;AAAQ,IACnB,KAAK,YAAA,EAAc;AACjB,MAAA,OAAO,0BAAA,CAA2B,IAAA,EAAM,OAAA,EAAS,eAAe,CAAA;AAAA,IAClE;AAAA,IAEA,KAAK,WAAA,EAAa;AAChB,MAAA,MAAMH,MAAAA,GAAQ,qBAAA;AAAA,QACZ,IAAA,CAAK,KAAA;AAAA,QACL,OAAA;AAAA,QACA,MAAA;AAAA,QACA,MAAA;AAAA,QACA;AAAA,OACF;AAEA,MAAA,IAAI,cAAA,CAAe,IAAA,CAAK,OAAO,CAAA,EAAG;AAChC,QAAA,MAAM,cAAcG,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,YAAY,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAC,CAAA,CAAA;AAC5D,QAAA,MAAMI,QAAAA,GAAU,iCAAA,CAAkC,IAAA,CAAK,EAAA,EAAI,WAAW,CAAA;AACtE,QAAA,IACE,IAAA,CAAK,EAAA,KAAO,OAAA,IACZ,IAAA,CAAK,EAAA,KAAO,UAAA,IACZ,IAAA,CAAK,EAAA,KAAO,YAAA,IACZ,IAAA,CAAK,EAAA,KAAO,UAAA,EACZ;AACA,UAAA,OAAO,OAAA,CAAQ,KAAA,CAAMP,MAAAA,EAAOO,QAAO,CAAA;AAAA,QACrC;AACA,QAAA,OAAOJ,GAAAA,CAAAA,EAAMH,MAAK,CAAA,MAAA,EAASO,QAAO,CAAA,CAAA;AAAA,MACpC;AAEA,MAAA,MAAM,OAAA,GAAU,oBAAA,CAAqB,IAAA,CAAK,EAAA,EAAI,KAAK,OAAO,CAAA;AAI1D,MAAA,IACE,IAAA,CAAK,EAAA,KAAO,OAAA,IACZ,IAAA,CAAK,EAAA,KAAO,UAAA,IACZ,IAAA,CAAK,EAAA,KAAO,YAAA,IACZ,IAAA,CAAK,EAAA,KAAO,UAAA,EACZ;AACA,QAAA,OAAO,OAAA,CAAQ,KAAA,CAAMP,MAAAA,EAAO,OAAO,CAAA;AAAA,MACrC;AAEA,MAAA,OAAOG,GAAAA,CAAAA,EAAMH,MAAK,CAAA,MAAA,EAAS,OAAO,CAAA,CAAA;AAAA,IACpC;AAAA,IAEA,KAAK,YAAA,EAAc;AACjB,MAAA,MAAMA,MAAAA,GAAQ,qBAAA;AAAA,QACZ,IAAA,CAAK,KAAA;AAAA,QACL,OAAA;AAAA,QACA,MAAA;AAAA,QACA,MAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,OAAO,KAAK,EAAA,KAAO,QAAA,GACfG,MAAMH,MAAK,CAAA,QAAA,CAAA,GACXG,MAAMH,MAAK,CAAA,YAAA,CAAA;AAAA,IACjB;AAAA,IAEA,KAAK,SAAA,EAAW;AACd,MAAA,MAAM,YAAA,GAAe,cAAA,CAAe,IAAA,CAAK,KAAK,CAAA;AAC9C,MAAA,MAAM,YAAA,GAAe,cAAA,CAAe,IAAA,CAAK,KAAK,CAAA;AAG9C,MAAA,MAAM,gBAAgC,EAAC;AACvC,MAAA,IAAI,CAAC,YAAA,EAAc,aAAA,CAAc,IAAA,CAAK,KAAK,KAAK,CAAA;AAChD,MAAA,IAAI,CAAC,YAAA,EAAc,aAAA,CAAc,IAAA,CAAK,KAAK,KAAK,CAAA;AAEhD,MAAA,MAAM,SAAA,GACJ,aAAA,CAAc,MAAA,GAAS,CAAA,GACrB,0BAAA,CAA2B,IAAA,CAAK,KAAA,EAAO,aAAa,CAAA,GACpDK,mBAAAA,CAAmB,IAAA,CAAK,KAAA,CAAM,SAAS,CAAA;AAE3C,MAAA,IAAI,SAAA,KAAc,OAAA,IAAW,SAAA,KAAc,QAAA,EAAU;AACnD,QAAA,MAAM,IAAI,yBAAA;AAAA,UACR;AAAA,SACF;AAAA,MACF;AACA,MAAA,MAAML,MAAAA,GAAQ,iBAAA;AAAA,QACZ,IAAA,CAAK,KAAA;AAAA,QACL,OAAA;AAAA,QACA,SAAA;AAAA,QACA,MAAA;AAAA,QACA,MAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,MAAM,KAAA,GACJ,YAAA,GACEG,GAAAA,CAAI,WAAA,CAAY,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA,GAC/B,kBAAA,CAAmB,IAAA,CAAK,KAAA,CAAM,KAAA,EAAO,OAAO,CAAA;AAChD,MAAA,MAAM,KAAA,GACJ,YAAA,GACEA,GAAAA,CAAI,WAAA,CAAY,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA,GAC/B,kBAAA,CAAmB,IAAA,CAAK,KAAA,CAAM,KAAA,EAAO,OAAO,CAAA;AAChD,MAAA,OAAOA,GAAAA,CAAAA,EAAMH,MAAK,CAAA,SAAA,EAAY,KAAK,QAAQ,KAAK,CAAA,CAAA;AAAA,IAClD;AAAA,IAEA,KAAK,KAAA,EAAO;AACV,MAAA,MAAM,KAAA,GAAQ,KAAK,UAAA,CAAW,GAAA;AAAA,QAAI,CAAC,CAAA,KACjC,0BAAA,CAA2B,CAAA,EAAG,GAAG;AAAA,OACnC;AACA,MAAA,OAAOG,GAAAA,CAAAA,CAAAA,EAAOA,GAAAA,CAAI,IAAA,CAAK,KAAA,EAAOA,UAAU,CAAC,CAAA,CAAA,CAAA;AAAA,IAC3C;AAAA,IAEA,KAAK,IAAA,EAAM;AACT,MAAA,MAAM,KAAA,GAAQ,KAAK,UAAA,CAAW,GAAA;AAAA,QAAI,CAAC,CAAA,KACjC,0BAAA,CAA2B,CAAA,EAAG,GAAG;AAAA,OACnC;AACA,MAAA,OAAOA,GAAAA,CAAAA,CAAAA,EAAOA,GAAAA,CAAI,IAAA,CAAK,KAAA,EAAOA,SAAS,CAAC,CAAA,CAAA,CAAA;AAAA,IAC1C;AAAA,IAEA,KAAK,KAAA,EAAO;AACV,MAAA,MAAM,KAAA,GAAQ,0BAAA,CAA2B,IAAA,CAAK,SAAA,EAAW,GAAG,CAAA;AAC5D,MAAA,OAAOA,WAAW,KAAK,CAAA,CAAA,CAAA;AAAA,IACzB;AAAA,IAEA,KAAK,UAAA,EAAY;AACf,MAAA,OAAO,qBAAA,CAAsB,IAAA,EAAM,OAAA,EAAS,eAAe,CAAA;AAAA,IAC7D;AAAA,IAEA,KAAK,WAAA,EAAa;AAChB,MAAA,OAAO,sBAAA,CAAuB,IAAA,EAAM,OAAA,EAAS,eAAe,CAAA;AAAA,IAC9D;AAAA,IAEA,KAAK,sBAAA,EAAwB;AAC3B,MAAA,OAAO,yBAAA,CAA0B,MAAM,OAAO,CAAA;AAAA,IAChD;AAAA,IAEA,KAAK,QAAA,EAAU;AACb,MAAA,OAAO,qBAAA,CAAsB,MAAM,GAAG,CAAA;AAAA,IACxC;AAAA,IAEA,KAAK,aAAA,EAAe;AAClB,MAAA,OAAO,iBAAA,CAAkB,MAAM,GAAG,CAAA;AAAA,IACpC;AAAA,IAEA,KAAK,mBAAA;AAAA,IACL,KAAK,gBAAA,EAAkB;AAIrB,MAAA,OAAO,yBAAA;AAAA,IACT;AAAA;AAEJ;AAEA,IAAM,yBAAA,GAA4BA,GAAAA,CAAI,GAAA,CAAI,KAAK,CAAA;AAK/C,SAAS,0BAAA,CACP,IAAA,EAMA,OAAA,EACA,eAAA,EACK;AAEL,EAAA,IAAI,cAAA,CAAe,IAAA,CAAK,KAAK,CAAA,EAAG;AAC9B,IAAA,MAAM,kBAAA,GACJE,oBAAmB,IAAA,CAAK,KAAA,CAAM,SAAS,CAAA,IACvCA,mBAAAA,CAAmB,IAAA,CAAK,IAAA,CAAK,SAAS,CAAA;AACxC,IAAA,MAAMG,KAAAA,GAAO,iBAAA;AAAA,MACX,IAAA,CAAK,IAAA;AAAA,MACL,OAAA;AAAA,MACA,kBAAA;AAAA,MACA,MAAA;AAAA,MACA,MAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,MAAMC,MAAAA,GAAQ,iBAAA,CAAkB,IAAA,CAAK,EAAE,CAAA;AACvC,IAAA,IAAI,CAACA,MAAAA,EAAO;AACV,MAAA,MAAM,IAAI,yBAAA;AAAA,QACR,CAAA,sBAAA,EAAyB,KAAK,EAAE,CAAA,+CAAA;AAAA,OAClC;AAAA,IACF;AACA,IAAA,OAAON,GAAAA,CAAAA,EAAMK,KAAI,CAAA,CAAA,EAAIL,GAAAA,CAAI,GAAA,CAAIM,MAAK,CAAC,CAAA,CAAA,EAAIN,GAAAA,CAAI,WAAA,CAAY,IAAA,CAAK,KAAA,CAAM,IAAI,CAAC,CAAA,CAAA;AAAA,EACzE;AAEA,EAAA,MAAM,SAAA,GAAY,0BAAA,CAA2B,IAAA,CAAK,IAAA,EAAM,KAAK,KAAK,CAAA;AAElE,EAAA,IAAI,SAAA,KAAc,OAAA,IAAW,SAAA,KAAc,QAAA,EAAU;AACnD,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,CAAA,sBAAA,EAAyB,IAAA,CAAK,EAAE,CAAA,uBAAA,EAA0B,SAAS,CAAA,OAAA;AAAA,KACrE;AAAA,EACF;AAEA,EAAA,MAAM,IAAA,GAAO,iBAAA;AAAA,IACX,IAAA,CAAK,IAAA;AAAA,IACL,OAAA;AAAA,IACA,SAAA;AAAA,IACA,MAAA;AAAA,IACA,MAAA;AAAA,IACA;AAAA,GACF;AAEA,EAAA,IAAI,IAAA,CAAK,EAAA,KAAO,IAAA,IAAQ,IAAA,CAAK,OAAO,OAAA,EAAS;AAC3C,IAAA,MAAM,MAAA,GACJ,KAAA,CAAM,OAAA,CAAQ,IAAA,CAAK,KAAK,IAAI,IAAA,CAAK,KAAA,GAAQ,CAAC,IAAA,CAAK,KAAqB,CAAA;AACtE,IAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AACvB,MAAA,OAAO,IAAA,CAAK,OAAO,IAAA,GAAOA,GAAAA,CAAI,IAAI,KAAK,CAAA,GAAIA,GAAAA,CAAI,GAAA,CAAI,KAAK,CAAA;AAAA,IAC1D;AACA,IAAA,MAAM,eAAe,MAAA,CAAO,GAAA;AAAA,MAC1B,CAAC,CAAA,KAAMA,GAAAA,CAAAA,EAAM,mBAAmB,CAAA,CAAE,KAAA,EAAO,OAAO,CAAC,CAAA;AAAA,KACnD;AACA,IAAA,MAAM,EAAA,GAAK,IAAA,CAAK,EAAA,KAAO,IAAA,GAAOA,GAAAA,CAAI,IAAI,IAAI,CAAA,GAAIA,GAAAA,CAAI,GAAA,CAAI,QAAQ,CAAA;AAC9D,IAAA,OAAOA,GAAAA,CAAAA,EAAM,IAAI,CAAA,CAAA,EAAI,EAAE,KAAKA,GAAAA,CAAI,IAAA,CAAK,YAAA,EAAcA,GAAAA,CAAAA,EAAAA,CAAO,CAAC,CAAA,CAAA,CAAA;AAAA,EAC7D;AAGA,EAAA,MAAM,QAAQ,IAAA,CAAK,KAAA;AAEnB,EAAA,MAAM,aAA2B,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,GAAI,KAAA,CAAM,CAAC,CAAA,GAAK,KAAA;AAEpE,EAAA,MAAM,cAAA,GAAiB,kBAAA,CAAmB,UAAA,CAAW,KAAA,EAAO,OAAO,CAAA;AACnE,EAAA,MAAM,KAAA,GAAQ,iBAAA,CAAkB,IAAA,CAAK,EAAE,CAAA;AACvC,EAAA,IAAI,CAAC,KAAA,EAAO;AACV,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,CAAA,sBAAA,EAAyB,KAAK,EAAE,CAAA,kBAAA;AAAA,KAClC;AAAA,EACF;AACA,EAAA,OAAOA,GAAAA,CAAAA,EAAM,IAAI,CAAA,CAAA,EAAIA,GAAAA,CAAI,IAAI,KAAK,CAAC,IAAI,cAAc,CAAA,CAAA;AACvD;AAKA,SAAS,qBAAA,CACP,IAAA,EACA,OAAA,EACA,eAAA,EACK;AACL,EAAA,MAAMH,MAAAA,GAAQ,qBAAA;AAAA,IACZ,IAAA,CAAK,KAAA;AAAA,IACL,OAAA;AAAA,IACA,MAAA;AAAA,IACA,MAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,MAAM,MAAA,GACJ,IAAA,CAAK,MAAA,EAAQ,GAAA,CAAI,CAAC,CAAA,KAAM,kBAAA,CAAmB,CAAA,CAAE,KAAA,EAAO,OAAO,CAAC,CAAA,IAAK,EAAC;AAEpE,EAAA,QAAQ,KAAK,EAAA;AAAI,IACf,KAAK,SAAA,EAAW;AACd,MAAA,OAAOG,OAAOH,MAAK,CAAA,YAAA,EAAe,OAAA,CAAQ,eAAA,CAAgBA,MAAK,CAAC,CAAA,KAAA,CAAA;AAAA,IAClE;AAAA,IACA,KAAK,YAAA,EAAc;AACjB,MAAA,OAAOG,OAAOH,MAAK,CAAA,iBAAA,EAAoB,OAAA,CAAQ,eAAA,CAAgBA,MAAK,CAAC,CAAA,KAAA,CAAA;AAAA,IACvE;AAAA,IACA,KAAK,UAAA,EAAY;AACf,MAAA,OAAOG,MAAM,OAAA,CAAQ,eAAA,CAAgBH,MAAK,CAAC,CAAA,GAAA,EAAM,KAAK,MAAM,CAAA,CAAA;AAAA,IAC9D;AAAA,IACA,KAAK,UAAA,EAAY;AACf,MAAA,OAAOG,MAAM,OAAA,CAAQ,eAAA,CAAgBH,MAAK,CAAC,CAAA,GAAA,EAAM,KAAK,MAAM,CAAA,CAAA;AAAA,IAC9D;AAAA,IACA,KAAK,WAAA,EAAa;AAChB,MAAA,OAAOG,MAAM,OAAA,CAAQ,eAAA,CAAgBH,MAAK,CAAC,CAAA,IAAA,EAAO,KAAK,MAAM,CAAA,CAAA;AAAA,IAC/D;AAAA,IACA,KAAK,UAAA,EAAY;AACf,MAAA,OAAOG,MAAM,OAAA,CAAQ,eAAA,CAAgBH,MAAK,CAAC,CAAA,GAAA,EAAM,KAAK,MAAM,CAAA,CAAA;AAAA,IAC9D;AAAA,IACA,KAAK,WAAA,EAAa;AAChB,MAAA,OAAOG,MAAM,OAAA,CAAQ,eAAA,CAAgBH,MAAK,CAAC,CAAA,IAAA,EAAO,KAAK,MAAM,CAAA,CAAA;AAAA,IAC/D;AAAA,IACA,KAAK,UAAA,EAAY;AACf,MAAA,MAAM,KAAA,GAAQ,OAAO,CAAC,CAAA;AACtB,MAAA,IAAI,UAAU,MAAA,EAAW;AACvB,QAAA,OAAOG,GAAAA,CAAI,IAAI,KAAK,CAAA;AAAA,MACtB;AACA,MAAA,OAAO,OAAA,CAAQ,iBAAA,CAAkBH,MAAAA,EAAO,KAAK,CAAA;AAAA,IAC/C;AAAA,IACA,KAAK,aAAA,EAAe;AAClB,MAAA,OAAO,OAAA,CAAQ,oBAAA,CAAqBA,MAAAA,EAAO,MAAM,CAAA;AAAA,IACnD;AAAA,IACA,KAAK,aAAA,EAAe;AAClB,MAAA,OAAO,OAAA,CAAQ,oBAAA,CAAqBA,MAAAA,EAAO,MAAM,CAAA;AAAA,IACnD;AAAA;AAEJ;AAKA,SAAS,sBAAA,CACP,IAAA,EACA,OAAA,EACA,eAAA,EACK;AACL,EAAA,MAAM,WAAA,GAAc,eAAA,CAAgB,IAAA,CAAK,KAAK,CAAA;AAC9C,EAAA,MAAM,OAAA,GAAU,gBAAA,CAAiB,WAAA,EAAa,IAAA,CAAK,OAAO,CAAA;AAC1D,EAAA,MAAM,MAAA,GAAS,kBAAA,CAAmB,IAAA,CAAK,KAAA,EAAO,QAAW,eAAe,CAAA;AAExE,EAAA,QAAQ,KAAK,EAAA;AAAI,IACf,KAAK,QAAA;AAAA,IACL,KAAK,SAAA,EAAW;AACd,MAAA,OAAO,OAAA,CAAQ,WAAA,CAAY,MAAA,EAAQ,OAAO,CAAA;AAAA,IAC5C;AAAA,IAEA,KAAK,YAAA,EAAc;AACjB,MAAA,IAAI,CAAC,KAAK,KAAA,EAAO;AACf,QAAA,MAAM,IAAI,yBAAA;AAAA,UACR;AAAA,SACF;AAAA,MACF;AACA,MAAA,MAAM,SAAA,GAAY,yBAAA,CAA0B,IAAA,CAAK,SAAA,EAAW,KAAK,KAAK,CAAA;AACtE,MAAA,IAAI,SAAA,KAAc,OAAA,IAAW,SAAA,KAAc,QAAA,EAAU;AACnD,QAAA,MAAM,IAAI,yBAAA;AAAA,UACR;AAAA,SACF;AAAA,MACF;AACA,MAAA,MAAM,IAAA,GAAO,iBAAA;AAAA,QACX,IAAA,CAAK,KAAA;AAAA,QACL,OAAA;AAAA,QACA,SAAA;AAAA,QACA,MAAA;AAAA,QACA,OAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,OAAOG,GAAAA,CAAAA,EAAM,IAAI,CAAA,GAAA,EAAM,kBAAA,CAAmB,KAAK,KAAA,CAAM,KAAA,EAAO,OAAO,CAAC,CAAA,CAAA;AAAA,IACtE;AAAA,IAEA,KAAK,cAAA,EAAgB;AACnB,MAAA,IAAI,CAAC,KAAK,KAAA,EAAO;AACf,QAAA,MAAM,IAAI,yBAAA;AAAA,UACR;AAAA,SACF;AAAA,MACF;AACA,MAAA,MAAMO,WAAAA,GAAa,qBAAA;AAAA,QACjB,IAAA,CAAK,KAAA;AAAA,QACL,OAAA;AAAA,QACA,MAAA;AAAA,QACA,OAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,OAAO,OAAA,CAAQ,iBAAA;AAAA,QACbA,WAAAA;AAAA,QACA,kBAAA,CAAmB,IAAA,CAAK,KAAA,CAAM,KAAA,EAAO,OAAO;AAAA,OAC9C;AAAA,IACF;AAAA,IAEA,KAAK,YAAA,EAAc;AACjB,MAAA,OAAO,OAAA,CAAQ,cAAA,CAAe,MAAA,EAAQ,OAAO,CAAA;AAAA,IAC/C;AAAA,IAEA,KAAK,eAAA,EAAiB;AACpB,MAAA,OAAO,OAAA,CAAQ,iBAAA,CAAkB,MAAA,EAAQ,OAAO,CAAA;AAAA,IAClD;AAAA;AAEJ;AAcA,SAAS,yBAAA,CACP,MAMA,OAAA,EACK;AACL,EAAA,MAAM,SAAA,GAAY,oBAAA,CAAqB,IAAA,CAAK,SAAA,EAAW,OAAO,CAAA;AAE9D,EAAA,MAAM,EAAA,GAAK,iBAAA,CAAkB,IAAA,CAAK,EAAE,CAAA;AACpC,EAAA,IAAI,CAAC,EAAA,EAAI;AACP,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,CAAA,sBAAA,EAAyB,KAAK,EAAE,CAAA,2CAAA;AAAA,KAClC;AAAA,EACF;AAEA,EAAA,MAAM,cAAA,GAAiB,kBAAA,CAAmB,IAAA,CAAK,KAAA,CAAM,OAAO,OAAO,CAAA;AACnE,EAAA,OAAOP,GAAAA,CAAAA,EAAM,SAAS,CAAA,CAAA,EAAIA,GAAAA,CAAI,IAAI,EAAE,CAAC,IAAI,cAAc,CAAA,CAAA;AACzD;AAKA,SAAS,oBAAA,CACP,MACA,OAAA,EACK;AACL,EAAA,MAAM,QAAA,GAAW,CAAA,IAAA,EAAO,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA,CAAA;AACxC,EAAA,MAAMH,MAAAA,GAAQ,iBAAA;AAAA,IACZ,IAAA,CAAK,KAAA;AAAA,IACL,OAAA;AAAA,IACA,KAAK,KAAA,CAAM,SAAA;AAAA,IACX;AAAA,GACF;AAEA,EAAA,QAAQ,KAAK,QAAA;AAAU,IACrB,KAAK,OAAA,EAAS;AACZ,MAAA,OAAOG,YAAYH,MAAK,CAAA,CAAA,CAAA;AAAA,IAC1B;AAAA,IACA,KAAK,eAAA,EAAiB;AACpB,MAAA,OAAOG,qBAAqBH,MAAK,CAAA,CAAA,CAAA;AAAA,IACnC;AAAA,IACA,KAAK,KAAA,EAAO;AACV,MAAA,OAAOG,UAAUH,MAAK,CAAA,CAAA,CAAA;AAAA,IACxB;AAAA,IACA,KAAK,KAAA,EAAO;AACV,MAAA,OAAOG,UAAUH,MAAK,CAAA,CAAA,CAAA;AAAA,IACxB;AAAA,IACA,KAAK,KAAA,EAAO;AACV,MAAA,OAAOG,UAAUH,MAAK,CAAA,CAAA,CAAA;AAAA,IACxB;AAAA,IACA,KAAK,KAAA,EAAO;AACV,MAAA,OAAOG,UAAUH,MAAK,CAAA,CAAA,CAAA;AAAA,IACxB;AAAA,IACA,SAAS;AACP,MAAA,MAAM,IAAI,yBAAA;AAAA,QACR,CAAA,4BAAA,EAA+B,KAAK,QAAQ,CAAA;AAAA,OAC9C;AAAA,IACF;AAAA;AAEJ;AAKA,SAAS,qBAAA,CACP,MACA,GAAA,EACK;AACL,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,OAAA,KAAY,MAAA,EAAW;AACvC,IAAA,MAAM,IAAI,0BAA0B,qCAAqC,CAAA;AAAA,EAC3E;AACA,EAAA,MAAM,SAAS,GAAA,CAAI,YAAA,CAAa,KAAK,QAAA,EAAU,IAAA,CAAK,SAAS,OAAO,CAAA;AACpE,EAAA,OAAO,KAAK,OAAA,GAAUG,GAAAA,CAAAA,YAAAA,EAAkB,MAAM,CAAA,CAAA,CAAA,GAAMA,cAAc,MAAM,CAAA,CAAA,CAAA;AAC1E;AAKA,SAAS,iBAAA,CACP,MACA,GAAA,EACK;AACL,EAAA,MAAM,mBAAA,GAAsB,sBAAA,CAAuB,IAAA,CAAK,QAAQ,CAAA;AAChE,EAAA,IAAI,wBAAwB,CAAA,EAAG;AAC7B,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,6DAA6D,mBAAmB,CAAA,CAAA;AAAA,MAChF,EAAE,mBAAA;AAAoB,KACxB;AAAA,EACF;AAEA,EAAA,MAAM,cAAA,GAAiBE,mBAAAA,CAAmB,IAAA,CAAK,KAAA,CAAM,SAAS,CAAA;AAC9D,EAAA,MAAM,iBAAA,GAAoB,gCAAA,CAAiC,IAAA,CAAK,QAAQ,CAAA;AACxE,EAAA,MAAM,oBAAoB,cAAA,IAAkB,iBAAA;AAE5C,EAAA,IAAI,gCAAA,CAAiC,iBAAiB,CAAA,EAAG;AACvD,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,CAAA,oCAAA,EAAuC,MAAA,CAAO,iBAAiB,CAAC,CAAA,OAAA,CAAA;AAAA,MAChE,EAAE,WAAW,iBAAA;AAAkB,KACjC;AAAA,EACF;AAEA,EAAA,IAAI,CAAC,0BAAA,CAA2B,cAAA,EAAgB,iBAAiB,CAAA,EAAG;AAClE,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,wCAAwC,MAAA,CAAO,cAAc,CAAC,CAAA,uCAAA,EAA0C,MAAA,CAAO,iBAAiB,CAAC,CAAA,CAAA,CAAA;AAAA,MACjI;AAAA,QACE,cAAA;AAAA,QACA;AAAA;AACF,KACF;AAAA,EACF;AAEA,EAAA,MAAM,YAAY,cAAA,IAAkB,iBAAA;AACpC,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,OAAA,KAAY,MAAA,EAAW;AACvC,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR;AAAA,KACF;AAAA,EACF;AACA,EAAA,MAAM,QAAA,GAAW,iBAAA;AAAA,IACf,IAAA,CAAK,KAAA;AAAA,IACL,GAAA,CAAI,OAAA;AAAA,IACJ,SAAA;AAAA,IACA,MAAA;AAAA,IACA,MAAA;AAAA,IACA,GAAA,CAAI;AAAA,GACN;AACA,EAAA,MAAM,SAAS,GAAA,CAAI,YAAA,CAAa,KAAK,QAAA,EAAU,IAAA,CAAK,SAAS,OAAO,CAAA;AACpE,EAAA,OAAO,IAAA,CAAK,OAAA,GACRF,GAAAA,CAAAA,EAAM,QAAQ,CAAA,SAAA,EAAY,MAAM,CAAA,CAAA,CAAA,GAChCA,GAAAA,CAAAA,EAAM,QAAQ,CAAA,KAAA,EAAQ,MAAM,CAAA,CAAA,CAAA;AAClC;AA4BA,SAAS,2BAAA,CACP,UAAA,EACA,OAAA,EACA,gBAAA,EACK;AACL,EAAA,MAAM,UAAe,EAAC;AAEtB,EAAA,SAAS,KAAA,CAAM,MAA2B,kBAAA,EAAmC;AAC3E,IAAA,IAAI,OAAA,CAAQ,IAAI,CAAA,EAAG;AACjB,MAAA,IAAI,kBAAA,EAAoB;AACtB,QAAA,MAAM,IAAI,0BAA0B,gBAAgB,CAAA;AAAA,MACtD;AACA,MAAA,OAAA,CAAQ,KAAK,IAAI,CAAA;AACjB,MAAA;AAAA,IACF;AACA,IAAA,QAAQ,KAAK,MAAA;AAAQ,MACnB,KAAK,KAAA,EAAO;AACV,QAAA,KAAA,MAAW,KAAA,IAAS,IAAA,CAAK,UAAA,EAAY,KAAA,CAAM,OAAO,kBAAkB,CAAA;AACpE,QAAA;AAAA,MACF;AAAA,MACA,KAAK,IAAA,EAAM;AACT,QAAA,KAAA,MAAW,KAAA,IAAS,IAAA,CAAK,UAAA,EAAY,KAAA,CAAM,OAAO,IAAI,CAAA;AACtD,QAAA;AAAA,MACF;AAAA,MACA,KAAK,KAAA,EAAO;AACV,QAAA,KAAA,CAAM,IAAA,CAAK,WAAW,IAAI,CAAA;AAC1B,QAAA;AAAA,MACF;AAAA,MACA,KAAK,YAAA;AAAA,MACL,KAAK,WAAA;AAAA,MACL,KAAK,YAAA;AAAA,MACL,KAAK,SAAA;AAAA,MACL,KAAK,UAAA;AAAA,MACL,KAAK,WAAA;AAAA,MACL,KAAK,sBAAA;AAAA,MACL,KAAK,QAAA;AAAA,MACL,KAAK,aAAA;AAAA,MACL,KAAK,mBAAA;AAAA,MACL,KAAK,gBAAA,EAAkB;AACrB,QAAA;AAAA,MACF;AAAA;AACF,EACF;AAEA,EAAA,KAAA,MAAW,IAAA,IAAQ,UAAA,EAAY,KAAA,CAAM,IAAA,CAAK,YAAY,KAAK,CAAA;AAC3D,EAAA,OAAO,OAAA;AACT;AAEO,SAAS,kCACd,UAAA,EAC6B;AAC7B,EAAA,OAAO,2BAAA;AAAA,IACL,UAAA;AAAA,IACA,CAAC,IAAA,KACC,IAAA,CAAK,MAAA,KAAW,mBAAA;AAAA,IAClB;AAAA,GAEF;AACF;AAEO,SAAS,+BACd,UAAA,EAC0B;AAC1B,EAAA,OAAO,2BAAA;AAAA,IACL,UAAA;AAAA,IACA,CAAC,IAAA,KAAyC,IAAA,CAAK,MAAA,KAAW,gBAAA;AAAA,IAC1D;AAAA,GAEF;AACF;;;ACl/BA,IAAM,mBAA6C,EAAC;AAMpD,SAAS,sBAAA,CAAuB,OAAe,UAAA,EAAgC;AAC7E,EAAA,OAAO,CAAA,EAAG,KAAK,CAAA,EAAA,EAAS,UAAU,CAAA,CAAA;AACpC;AAEA,SAAS,2BAA2BQ,UAAAA,EAAsC;AACxE,EAAA,OAAOA,UAAAA,CAAU,UAAA,KAAe,MAAA,GAAS,MAAA,GAAS,MAAA;AACpD;AAEO,SAAS,oBAAoB,GAAA,EAA+B;AACjE,EAAA,MAAM,cAAA,uBAAqB,GAAA,EAA6B;AACxD,EAAA,KAAA,MAAWA,UAAAA,IAAa,IAAI,UAAA,EAAY;AACtC,IAAA,MAAM,GAAA,GAAM,sBAAA;AAAA,MACVA,UAAAA,CAAU,WAAA;AAAA,MACV,2BAA2BA,UAAS;AAAA,KACtC;AACA,IAAA,MAAM,QAAA,GAAW,cAAA,CAAe,GAAA,CAAI,GAAG,CAAA;AACvC,IAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,MAAA,cAAA,CAAe,GAAA,CAAI,GAAA,EAAK,CAACA,UAAS,CAAC,CAAA;AAAA,IACrC,CAAA,MAAO;AACL,MAAA,QAAA,CAAS,KAAKA,UAAS,CAAA;AAAA,IACzB;AAAA,EACF;AACA,EAAA,OAAO,EAAE,cAAA,EAAe;AAC1B;AAEO,SAAS,qBAAA,CACd,cAAA,EACA,KAAA,EACA,UAAA,EAC0B;AAC1B,EAAA,OACE,eAAe,cAAA,CAAe,GAAA;AAAA,IAC5B,sBAAA,CAAuB,OAAO,UAAU;AAAA,GAC1C,IAAK,gBAAA;AAET;AAEO,SAAS,uBAAA,CACd,YACA,gBAAA,EACO;AACP,EAAA,OAAO,UAAA,CAAW,GAAA;AAAA,IAAI,CAACA,UAAAA,KACrB,0BAAA,CAA2BA,UAAAA,CAAU,YAAY,gBAAgB;AAAA,GACnE;AACF;AAEO,SAAS,iBAAA,CAAkB,QAAa,KAAA,EAA+B;AAC5E,EAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AACtB,IAAA,OAAOR,GAAAA,CAAAA,KAAAA,CAAAA;AAAA,EACT;AACA,EAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AACtB,IAAA,OAAOA,GAAAA,CAAAA,EAAM,MAAM,CAAA,GAAA,EAAM,KAAA,CAAM,CAAC,CAAC,CAAA,CAAA;AAAA,EACnC;AACA,EAAA,OAAOA,GAAAA,CAAAA,EAAM,MAAM,CAAA,KAAA,EAAQA,GAAAA,CAAI,IAAA;AAAA,IAC7B,MAAM,GAAA,CAAI,CAAC,IAAA,KAASA,GAAAA,CAAAA,EAAM,IAAI,CAAA,CAAE,CAAA;AAAA,IAChCA,GAAAA,CAAAA,EAAAA;AAAA,GACD,CAAA,CAAA,CAAA;AACH;AAEO,SAAS,oBAAA,CACd,KACA,KAAA,EACmB;AACnB,EAAA,IAAI,KAAA,KAAU,GAAA,CAAI,KAAA,CAAM,KAAA,EAAO;AAC7B,IAAA,OAAO,IAAI,KAAA,CAAM,KAAA;AAAA,EACnB;AAEA,EAAA,KAAA,MAAW,SAAA,IAAa,IAAI,UAAA,EAAY;AACtC,IAAA,IAAI,SAAA,CAAU,cAAc,KAAA,EAAO;AACjC,MAAA,OAAO,SAAA,CAAU,SAAA;AAAA,IACnB;AAAA,EACF;AAEA,EAAA,MAAM,IAAI,sBAAA,CAAuB,CAAA,gCAAA,EAAmC,KAAK,CAAA,CAAE,CAAA;AAC7E;AASO,SAAS,oBAAA,CACd,iBACA,iBAAA,EACoB;AACpB,EAAA,IAAI,CAAC,eAAA,IAAmB,CAAC,iBAAA,EAAmB,OAAO,MAAA;AACnD,EAAA,OAAO,eAAA,CAAgB,MAAM,KAAA,KAAU,iBAAA,CAAkB,MAAM,KAAA,GAC3D,eAAA,CAAgB,MAAM,KAAA,GACtB,MAAA;AACN;;;ACjGO,SAAS,wBAAwB,KAAA,EAAmC;AACzE,EAAA,MAAM,EAAE,MAAA,EAAQ,OAAA,EAAS,OAAA,EAAS,WAAU,GAAI,KAAA;AAChD,EAAA,MAAM,QAAA,GAAW,MAAM,QAAA,IAAY,MAAA;AAEnC,EAAA,QAAQ,SAAA;AAAW,IACjB,KAAK,QAAA,EAAU;AACb,MAAA,OAAO,OAAA,CAAQ,eAAA,CAAgB,MAAA,EAAQ,OAAO,CAAA;AAAA,IAChD;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA,OAAO,OAAA,CAAQ,iBAAA,CAAkB,MAAA,EAAQ,OAAO,CAAA;AAAA,IAClD;AAAA,IACA,KAAK,SAAA,EAAW;AACd,MAAA,OAAO,OAAA,CAAQ,kBAAA,CAAmB,MAAA,EAAQ,OAAO,CAAA;AAAA,IACnD;AAAA,IACA,KAAK,MAAA,EAAQ;AACX,MAAA,OAAO,OAAA,CAAQ,eAAA,CAAgB,MAAA,EAAQ,OAAO,CAAA;AAAA,IAChD;AAAA,IACA,KAAK,OAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,WAAA;AAAA,IACL,KAAK,SAAA;AAAA,IACL,KAAK,MAAA,EAAW;AACd,MAAA,OAAO,QAAA,KAAa,MAAA,GAChB,OAAA,CAAQ,eAAA,CAAgB,MAAA,EAAQ,OAAO,CAAA,GACvC,OAAA,CAAQ,WAAA,CAAY,MAAA,EAAQ,OAAO,CAAA;AAAA,IACzC;AAAA,IACA,SAAS;AACP,MAAA,OAAO,QAAA,KAAa,MAAA,GAChB,OAAA,CAAQ,eAAA,CAAgB,MAAA,EAAQ,OAAO,CAAA,GACvC,OAAA,CAAQ,WAAA,CAAY,MAAA,EAAQ,OAAO,CAAA;AAAA,IACzC;AAAA;AAEJ;;;ACQA,SAAS,sBAAA,CACP,YACA,MAAA,EACK;AACL,EAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,IAAA,OAAOA,GAAAA,CAAI,IAAI,MAAM,CAAA;AAAA,EACvB;AACA,EAAA,OAAOA,GAAAA,CAAAA,EAAMA,IAAI,GAAA,CAAI,UAAU,CAAC,CAAA,CAAA,EAAIA,GAAAA,CAAI,GAAA,CAAI,MAAM,CAAC,CAAA,CAAA;AACrD;AAEA,SAAS,aAAA,CAAc,OAAe,IAAA,EAAmB;AACvD,EAAA,OAAOA,MAAM,eAAA,CAAgB,KAAK,CAAC,CAAA,CAAA,EAAI,eAAA,CAAgB,IAAI,CAAC,CAAA,CAAA;AAC9D;AAEA,IAAM,4BAAA,GAA+B,wBAAA;AAErC,SAAS,2BAA2B,SAAA,EAAwB;AAC1D,EAAA,MAAM,QAAA,GAAW,CAAA,EAAG,gBAAgB,CAAA,EAAG,SAAS,CAAA,CAAA;AAChD,EAAA,OAAOA,GAAAA;AAAA;AAAA;AAAA,UAAA,EAGG,aAAA,CAAc,QAAA,EAAU,CAAA,EAAG,SAAS,KAAK,CAAC,CAAA;AAAA,UAAA,EAC1C,aAAA,CAAc,QAAA,EAAU,CAAA,EAAG,SAAS,OAAO,CAAC,CAAA;AAAA,aAAA,EACzC,eAAA,CAAgB,QAAQ,CAAC;AAAA,WAAA,EAC3BA,GAAAA,CAAI,GAAA,CAAI,4BAA4B,CAAC;AAAA,EAAA,CAAA;AAElD;AAEA,SAAS,wBAAA,CACP,UAAA,EACA,KAAA,EACA,eAAA,EACO;AACP,EAAA,OAAO,YAAA,CAAa,MAAA;AAAA,IAClB,CAAC,WACC,MAAA,KAAW,IAAA,IACX,WAAW,MAAA,IACX,mBAAA,CAAoB,iBAAiB,MAAM;AAAA,GAC/C,CAAE,GAAA;AAAA,IACA,CAAC,MAAA,KACCA,GAAAA,CAAAA,EAAM,sBAAA,CAAuB,YAAY,MAAM,CAAC,CAAA,IAAA,EAAOA,GAAAA,CAAI,IAAI,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,MAAM,EAAE,CAAC,CAAA;AAAA,GACxF;AACF;AAEA,SAAS,wBAAA,CACP,UAAA,EACA,KAAA,EACA,eAAA,EACO;AACP,EAAA,OAAO,YAAA,CAAa,MAAA;AAAA,IAAO,CAAC,MAAA,KAC1B,mBAAA,CAAoB,eAAA,EAAiB,MAAM;AAAA,GAC7C,CAAE,GAAA;AAAA,IACA,CAAC,MAAA,KACCA,GAAAA,CAAAA,EAAM,sBAAA,CAAuB,YAAY,MAAM,CAAC,CAAA,IAAA,EAAOA,GAAAA,CAAI,IAAI,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,MAAM,EAAE,CAAC,CAAA;AAAA,GACxF;AACF;AAgBO,SAAS,sBAAsB,KAAA,EAAwC;AAC5E,EAAA,MAAM,EAAE,GAAA,EAAK,GAAA,EAAK,OAAA,EAAS,cAAA,EAAgB,wBAAuB,GAAI,KAAA;AACtE,EAAA,MAAM,KAAA,GAAQ,IAAI,KAAA,CAAM,KAAA;AACxB,EAAA,MAAM,KAAA,GAAQ,IAAI,KAAA,CAAM,KAAA;AACxB,EAAA,MAAM,kBAAA,GACJ,GAAA,CAAI,OAAA,CAAQ,YAAA,CAAa,0BACvBA,GAAAA,CAAAA,iBAAAA,CAAAA,GACAA,GAAAA,CAAAA,CAAAA;AAEJ,EAAA,MAAM,aAAa,iBAAA,CAAkBA,GAAAA,CAAI,GAAA,CAAI,MAAM,GAAG,KAAK,CAAA;AAC3D,EAAA,MAAM,cAAA,GAAiB,KAAA,CAAM,kBAAA,CAAmB,QAAA,EAAS;AACzD,EAAA,MAAM,UAAA,GAAuC,EAAE,GAAG,GAAA,EAAK,iBAAiB,EAAA,EAAG;AAC3E,EAAA,MAAM,gBAAA,GAAmB,uBAAA;AAAA,IACvB,qBAAA,CAAsB,cAAA,EAAgB,KAAA,EAAO,MAAM,CAAA;AAAA,IACnD;AAAA,GACF;AAEA,EAAA,MAAM,YAAA,GAAe;AAAA,IACnBA,iBAAiB,OAAO,CAAA,CAAA;AAAA,IACxB,UAAA;AAAA,IACA,cAAA;AAAA,IACA,GAAG;AAAA,GACL;AAEA,EAAA,MAAM,2BACJ,sBAAA,GACG,sBAAA,CAAuB,GAAA,CAAI,KAAK,KAAK,sBAAA,GACtC,MAAA;AAEJ,EAAA,MAAM,WAAA,GACJ,MAAM,WAAA,KAAgB,MAAA,GAAYA,QAChC,KAAA,CAAM,WAAA,CAAY,WAAW,MAAA,GAC7BA,GAAAA;AAAA,cAAA,EACU,KAAA,CAAM,YAAY,KAAK;AAAA,MAAA,CAAA,GAEjCA,GAAAA;AAAA,YAAA,EACQ,MAAM,WAAA,CAAY,KAAK,CAAA,QAAA,EAAW,KAAA,CAAM,YAAY,MAAM;AAAA,IAAA,CAAA;AAGtE,EAAA,OAAOA,GAAAA;AAAA,QAAA,EACCA,GAAAA,CAAI,GAAA,CAAI,KAAK,CAAC,OAAO,kBAAkB,CAAA;AAAA,aAAA,EAClCA,GAAAA,CAAI,IAAA;AAAA,IACX,wBAAA,CAAyB,MAAA,EAAW,KAAA,EAAO,wBAAwB,CAAA;AAAA,IACnEA,GAAAA,CAAAA,EAAAA;AAAA,GACD;AAAA,WAAA,EACM,GAAA,CAAI,OAAO,UAAU;AAAA,YAAA,EACpBA,IAAI,IAAA,CAAK,YAAA,EAAcA,GAAAA,CAAAA,KAAAA,CAAU,CAAC,GAAG,WAAW;AAAA;AAAA,EAAA,CAAA;AAG9D;AAeO,SAAS,0BACd,KAAA,EACK;AACL,EAAA,MAAM;AAAA,IACJ,GAAA;AAAA,IACA,2BAAA;AAAA,IACA,GAAA;AAAA,IACA,OAAA;AAAA,IACA,cAAA;AAAA,IACA,cAAA;AAAA,IACA,sBAAA;AAAA,IACA,kBAAA;AAAA,IACA,cAAA;AAAA,IACA;AAAA,GACF,GAAI,KAAA;AACJ,EAAA,MAAM,SAAA,GAAY,GAAA,CAAI,UAAA,CAAW,cAAc,CAAA;AAC/C,EAAA,MAAM,sBACJ,cAAA,KAAmB,GAAA,CAAI,UAAA,CAAW,MAAA,GAAS,IAAI,cAAA,GAAiB,MAAA;AAElE,EAAA,MAAM,iBAAA,GAAoB,oBAAA,CAAqB,GAAA,EAAK,SAAA,CAAU,aAAa,CAAA;AAC3E,EAAA,MAAM,kBAAkB,CAAC,GAAG,IAAI,GAAA,CAAI,SAAA,CAAU,SAAS,CAAC,CAAA;AACxD,EAAA,MAAM,gBAAA,GACJ,SAAA,CAAU,gBAAA,KAAqB,MAAA,GAC7B,EAAC,GACD,CAAC,GAAG,IAAI,GAAA,CAAI,SAAA,CAAU,gBAAgB,CAAC,CAAA;AAE3C,EAAA,MAAM,YAAY,SAAA,CAAU,SAAA;AAC5B,EAAA,MAAM,iBAAiB,iBAAA,CAAkBA,GAAAA,CAAI,GAAA,CAAI,QAAQ,GAAG,SAAS,CAAA;AAErE,EAAA,MAAM,kBAAA,GAAqB,kBAAA,CAAmB,QAAA,CAAS,GAAG,CAAA;AAC1D,EAAA,MAAM,kBAAA,GAAqB,kBAAA,CAAmB,QAAA,CAAS,GAAG,CAAA;AAE1D,EAAA,MAAM,cAAA,GAA2C;AAAA,IAC/C,GAAG,GAAA;AAAA,IACH,eAAA,EAAiB;AAAA,GACnB;AACA,EAAA,MAAM,oBAAA,GAAuB,uBAAA;AAAA,IAC3B,qBAAA,CAAsB,cAAA,EAAgB,SAAA,CAAU,SAAA,EAAW,MAAM,CAAA;AAAA,IACjE;AAAA,GACF;AAEA,EAAA,MAAM,cAAA,GAA2C;AAAA,IAC/C,GAAG,GAAA;AAAA,IACH,eAAA,EAAiB;AAAA,GACnB;AACA,EAAA,MAAM,oBAAA,GAAuB,uBAAA;AAAA,IAC3B,qBAAA,CAAsB,cAAA,EAAgB,SAAA,CAAU,SAAA,EAAW,MAAM,CAAA;AAAA,IACjE;AAAA,GACF;AAEA,EAAA,MAAM,gBAAA,GAAmB;AAAA,IACvBA,mBAAmB,OAAO,CAAA,CAAA;AAAA,IAC1B,cAAA;AAAA,IACA,kBAAA;AAAA,IACA,kBAAA;AAAA,IACA,GAAG,oBAAA;AAAA,IACH,GAAG;AAAA,GACL;AAEA,EAAA,MAAM,gBAAgB,SAAA,CAAU,aAAA;AAChC,EAAA,MAAM,YAAY,SAAA,CAAU,SAAA;AAC5B,EAAA,MAAM,YAAY,SAAA,CAAU,SAAA;AAC5B,EAAA,MAAM,sBACJ,sBAAA,GACG,sBAAA,CAAuB,GAAA,CAAI,SAAS,KAAK,sBAAA,GAC1C,MAAA;AACJ,EAAA,MAAM,sBACJ,sBAAA,GACG,sBAAA,CAAuB,GAAA,CAAI,SAAS,KAAK,sBAAA,GAC1C,MAAA;AACJ,EAAA,MAAM,kBAAA,GACJ,8BACE,CAACA,GAAAA,CAAAA,IAAAA,EAAUA,IAAI,GAAA,CAAI,aAAa,CAAC,CAAA,EAAA,CAAI,CAAA,GACrC;AAAA,IACEA,GAAAA,CAAAA,IAAAA,EAAUA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAIA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,OAAA,EAAUA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,GAAA,CAAA;AAAA,IAC1FA,GAAAA,CAAAA,IAAAA,EAAUA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAIA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,SAAA,EAAYA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,KAAA;AAAA,GAC9F;AACJ,EAAA,MAAM,aAAA,GAAgB;AAAA,IACpB,GAAG,kBAAA;AAAA,IACH,GAAG,wBAAA,CAAyB,GAAA,EAAK,SAAA,EAAW,mBAAmB,CAAA;AAAA,IAC/D,GAAG,wBAAA,CAAyB,GAAA,EAAK,SAAA,EAAW,mBAAmB;AAAA,GACjE;AACA,EAAA,MAAM,qBACJ,cAAA,GAAiBA,GAAAA,CAAAA,aAAAA,CAAAA,GACf,IAAI,OAAA,CAAQ,YAAA,CAAa,0BAA0BA,GAAAA,CAAAA,iBAAAA,CAAAA,GACnDA,GAAAA,CAAAA,CAAAA;AAEJ,EAAA,SAAS,uBACP,MAAA,EAQK;AACL,IAAA,MAAM,YAAA,GAAe;AAAA,MACnB,GAAG,gBAAA;AAAA,MACH,kBAAkBA,GAAAA,CAAI,GAAA,CAAI,QAAQ,CAAA,EAAG,OAAO,SAAS,CAAA;AAAA,MACrD,iBAAA;AAAA,QACEA,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAA,EAAK,MAAA,CAAO,aAAa,CAAA,CAAE,CAAA;AAAA,QACnC;AAAA,OACF;AAAA,MACA,iBAAA,CAAkBA,IAAI,GAAA,CAAI,CAAA,EAAA,EAAK,OAAO,eAAe,CAAA,CAAE,GAAG,SAAS;AAAA,KACrE;AAEA,IAAA,IAAI,MAAA,CAAO,mBAAmB,MAAA,EAAW;AACvC,MAAA,YAAA,CAAa,IAAA,CAAK,OAAO,cAAc,CAAA;AAAA,IACzC;AAEA,IAAA,OAAOA,GAAAA;AAAA,aAAA,EACIA,GAAAA,CAAI,IAAA,CAAK,aAAA,EAAeA,GAAAA,CAAAA,EAAAA,CAAO,CAAC;AAAA,eAAA,EAC9BA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC;AAAA,WAAA,EAC1B,IAAI,MAAA,CAAO,UAAU,aAAaA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAIA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,QAAA,EAAWA,IAAI,GAAA,CAAI,MAAA,CAAO,SAAS,CAAC;AAAA,gBAAA,EACjHA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC,IAAIA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,UAAA,EAAaA,GAAAA,CAAI,GAAA,CAAI,MAAA,CAAO,aAAa,CAAC;AAAA,WAAA,EAC/F,GAAA,CAAI,OAAO,UAAU,CAAA;AAAA,qBAAA,EACXA,GAAAA,CAAI,GAAA,CAAI,MAAA,CAAO,WAAW,CAAC;AAAA,uBAAA,EACzBA,GAAAA,CAAI,GAAA,CAAI,MAAA,CAAO,eAAe,CAAC;AAAA,YAAA,EAC1CA,GAAAA,CAAI,IAAA,CAAK,YAAA,EAAcA,GAAAA,CAAAA,KAAAA,CAAU,CAAC;AAAA,IAAA,CAAA;AAAA,EAE9C;AAEA,EAAA,MAAM,eAAA,GAAkB,SAAA,CAAU,SAAA,KAAc,KAAA,GAAQ,SAAA,GAAY,OAAA;AACpE,EAAA,MAAM,iBAAA,GAAoB,SAAA,CAAU,SAAA,KAAc,KAAA,GAAQ,OAAA,GAAU,SAAA;AACpE,EAAA,MAAM,mBAAA,GACJ,SAAA,CAAU,SAAA,KAAc,KAAA,GAAQ,WAAA,GAAc,SAAA;AAChD,EAAA,MAAM,qBAAA,GACJ,SAAA,CAAU,SAAA,KAAc,KAAA,GAAQ,SAAA,GAAY,WAAA;AAE9C,EAAA,MAAM,eAAe,sBAAA,CAAuB;AAAA,IAC1C,SAAA,EAAW,eAAA;AAAA,IACX,SAAA,EAAW,eAAA;AAAA,IACX,aAAA,EAAe,mBAAA;AAAA,IACf,WAAA,EAAa,iBAAA;AAAA,IACb,eAAA,EAAiB;AAAA,GAClB,CAAA;AAED,EAAA,IAAI,gBAAA,CAAiB,WAAW,CAAA,EAAG;AACjC,IAAA,IAAI,wBAAwB,MAAA,EAAW;AACrC,MAAA,OAAOA,GAAAA;AAAA,YAAA,EACCA,GAAAA,CAAI,GAAA,CAAI,SAAS,CAAC,OAAO,kBAAkB,CAAA;AAAA;AAAA,YAAA,EAE3C,YAAY;AAAA;AAAA,gBAAA,EAER,mBAAmB;AAAA;AAAA,MAAA,CAAA;AAAA,IAGjC;AAEA,IAAA,OAAOA,GAAAA;AAAA,UAAA,EACCA,GAAAA,CAAI,GAAA,CAAI,SAAS,CAAC,OAAO,kBAAkB,CAAA;AAAA,QAAA,EAC7C,YAAY;AAAA;AAAA,IAAA,CAAA;AAAA,EAGpB;AAEA,EAAA,MAAM,gBAAA,GAAmB,SAAA,CAAU,SAAA,KAAc,KAAA,GAAQ,OAAA,GAAU,SAAA;AACnE,EAAA,MAAM,kBAAA,GACJ,SAAA,CAAU,SAAA,KAAc,KAAA,GAAQ,SAAA,GAAY,OAAA;AAC9C,EAAA,MAAM,oBAAA,GACJ,SAAA,CAAU,SAAA,KAAc,KAAA,GAAQ,SAAA,GAAY,WAAA;AAC9C,EAAA,MAAM,sBAAA,GACJ,SAAA,CAAU,SAAA,KAAc,KAAA,GAAQ,WAAA,GAAc,SAAA;AAEhD,EAAA,MAAM,mBAAmB,gBAAA,CAAiB,MAAA;AAAA,IAAO,CAAC,IAAA,KAChD,eAAA,CAAgB,QAAA,CAAS,IAAI;AAAA,GAC/B;AAEA,EAAA,MAAM,cAAA,GACJ,gBAAA,CAAiB,MAAA,GAAS,CAAA,GACxBA,GAAAA,CAAAA,6BAAAA,EAAmC,iBAAA;AAAA,IACjCA,GAAAA,CAAI,IAAI,QAAQ,CAAA;AAAA,IAChB;AAAA,GACD,CAAA,CAAA,CAAA,GACD,MAAA;AAEJ,EAAA,MAAM,gBAAgB,sBAAA,CAAuB;AAAA,IAC3C,cAAA;AAAA,IACA,SAAA,EAAW,gBAAA;AAAA,IACX,SAAA,EAAW,gBAAA;AAAA,IACX,aAAA,EAAe,oBAAA;AAAA,IACf,WAAA,EAAa,kBAAA;AAAA,IACb,eAAA,EAAiB;AAAA,GAClB,CAAA;AAED,EAAA,IAAI,wBAAwB,MAAA,EAAW;AACrC,IAAA,OAAOA,GAAAA;AAAA,UAAA,EACCA,GAAAA,CAAI,GAAA,CAAI,SAAS,CAAC,OAAO,kBAAkB,CAAA;AAAA;AAAA,UAAA,EAE3C,YAAY;AAAA;AAAA,UAAA,EAEZ,aAAa;AAAA;AAAA,cAAA,EAET,mBAAmB;AAAA;AAAA,IAAA,CAAA;AAAA,EAGjC;AAEA,EAAA,OAAOA,GAAAA;AAAA,QAAA,EACCA,GAAAA,CAAI,GAAA,CAAI,SAAS,CAAC,OAAO,kBAAkB,CAAA;AAAA,MAAA,EAC7C,YAAY;AAAA;AAAA,MAAA,EAEZ,aAAa;AAAA;AAAA,EAAA,CAAA;AAGrB;AAEA,SAAS,8BAAA,CACP,MACA,OAAA,EACK;AACL,EAAA,MAAM,EAAE,KAAA,EAAAH,MAAAA,EAAM,GAAI,IAAA;AAClB,EAAA,MAAM,KAAK,IAAA,CAAK,QAAA;AAEhB,EAAA,QAAQ,EAAA;AAAI,IACV,KAAK,OAAA;AAAA,IACL,KAAK,eAAA;AAAA,IACL,KAAK,KAAA;AAAA,IACL,KAAK,KAAA;AAAA,IACL,KAAK,KAAA;AAAA,IACL,KAAK,KAAA,EAAO;AACV,MAAA,MAAM,QAAA,GAAW,CAAA,IAAA,EAAOA,MAAAA,CAAM,KAAK,CAAA,CAAA;AACnC,MAAA,MAAM,MAAA,GAAS,iBAAA;AAAA,QACbA,MAAAA;AAAA,QACA,OAAA;AAAA,QACAA,MAAAA,CAAM,SAAA;AAAA,QACN;AAAA,OACF;AACA,MAAA,IAAI,OAAO,eAAA,EAAiB;AAC1B,QAAA,OAAOG,qBAAqB,MAAM,CAAA,CAAA,CAAA;AAAA,MACpC;AACA,MAAA,OAAOA,GAAAA,CAAAA,EAAMA,IAAI,GAAA,CAAI,EAAA,CAAG,aAAa,CAAC,IAAI,MAAM,CAAA,CAAA,CAAA;AAAA,IAClD;AAAA,IACA,SAAS;AACP,MAAA,MAAM,IAAI,yBAAA;AAAA,QACR,CAAA,4BAAA,EAA+B,MAAA,CAAO,EAAE,CAAC,CAAA;AAAA,OAC3C;AAAA,IACF;AAAA;AAEJ;AAEA,SAAS,sBAAA,CACPH,QAIA,OAAA,EACK;AACL,EAAA,IAAI,eAAA,CAAgBA,MAAAA,CAAM,MAAM,CAAA,EAAG;AACjC,IAAA,OAAO,8BAAA,CAA+BA,MAAAA,CAAM,MAAA,EAAQ,OAAO,CAAA;AAAA,EAC7D;AACA,EAAA,MAAM,WAAWA,MAAAA,CAAM,QAAA,IAAY,CAAA,IAAA,EAAOA,MAAAA,CAAM,OAAO,KAAK,CAAA,CAAA;AAC5D,EAAA,OAAO,iBAAA;AAAA,IACLA,MAAAA,CAAM,MAAA;AAAA,IACN,OAAA;AAAA,IACAA,OAAM,MAAA,CAAO,SAAA;AAAA,IACb;AAAA,GACF;AACF;AAQO,SAAS,wBACd,KAAA,EACK;AACL,EAAA,MAAM,EAAE,GAAA,EAAK,0BAAA,EAA4B,OAAA,EAAQ,GAAI,KAAA;AACrD,EAAA,IAAI,GAAA,CAAI,eAAA,IAAmB,GAAA,CAAI,eAAA,CAAgB,SAAS,CAAA,EAAG;AACzD,IAAA,OAAO,0BAAA;AAAA,MACL,GAAA,CAAI,eAAA;AAAA,MACJ,OAAA;AAAA,MACA,GAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAEA,EAAA,MAAM,MAAA,GAAS,IAAI,UAAA,CAAW,MAAA;AAC9B,EAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AACvB,IAAA,OAAOG,GAAAA,CAAI,IAAI,GAAG,CAAA;AAAA,EACpB;AAEA,EAAA,MAAM,eAAA,GAAkB,MAAA,CAAO,GAAA,CAAI,CAACH,MAAAA,KAAU;AAC5C,IAAA,MAAM,MAAA,GAAS,sBAAA,CAAuBA,MAAAA,EAAO,OAAO,CAAA;AACpD,IAAA,OAAOG,MAAM,MAAM,CAAA,IAAA,EAAO,eAAA,CAAgBH,MAAAA,CAAM,UAAU,CAAC,CAAA,CAAA;AAAA,EAC7D,CAAC,CAAA;AACD,EAAA,OAAOG,GAAAA,CAAI,IAAA,CAAK,eAAA,EAAiBA,GAAAA,CAAAA,EAAAA,CAAO,CAAA;AAC1C;AAMA,SAAS,mBAAmB,GAAA,EAAoC;AAC9D,EAAA,MAAM,GAAA,uBAAU,GAAA,CAAoB;AAAA,IAClC,CAAC,IAAI,KAAA,CAAM,KAAA,EAAO,OAAO,GAAA,CAAI,KAAA,CAAM,KAAK,CAAA,CAAE;AAAA,GAC3C,CAAA;AACD,EAAA,KAAA,MAAW,SAAA,IAAa,IAAI,UAAA,EAAY;AACtC,IAAA,GAAA,CAAI,IAAI,SAAA,CAAU,SAAA,EAAW,CAAA,IAAA,EAAO,SAAA,CAAU,SAAS,CAAA,CAAE,CAAA;AACzD,IAAA,GAAA,CAAI,IAAI,SAAA,CAAU,SAAA,EAAW,CAAA,IAAA,EAAO,SAAA,CAAU,SAAS,CAAA,CAAE,CAAA;AAAA,EAC3D;AACA,EAAA,OAAO,GAAA;AACT;AAEA,SAAS,0BAAA,CACP,MAAA,EACA,OAAA,EACA,GAAA,EACA,0BAAA,EACK;AACL,EAAA,MAAM,UAAA,GAAa,mBAAmB,GAAG,CAAA;AAEzC,EAAA,MAAM,OAAA,GAAU,MAAA,CAAO,GAAA,CAAI,CAACH,MAAAA,KAAU;AACpC,IAAA,MAAM,QAAA,GACJ,8BACA,UAAA,CAAW,GAAA,CAAIA,OAAM,KAAK,CAAA,IAC1B,CAAA,IAAA,EAAOA,MAAAA,CAAM,KAAK,CAAA,CAAA;AAEpB,IAAA,IAAIA,OAAM,aAAA,EAAe;AACvB,MAAA,MAAM,QAAA,GAAW,+BAAA,CAAgCA,MAAAA,CAAM,KAAK,CAAA;AAE5D,MAAA,OAAOG,MAAMA,GAAAA,CAAI,GAAA,CAAI,QAAQ,CAAC,CAAA,CAAA,EAAIA,IAAI,GAAA,CAAI,CAAA,EAAGH,OAAM,KAAK,CAAA,CAAA,EAAI,QAAQ,CAAA,CAAE,CAAC,OAAO,eAAA,CAAgBA,MAAAA,CAAM,UAAU,CAAC,CAAA,CAAA;AAAA,IACjH;AAEA,IAAA,MAAM,WAAA,GAAc,CAAA,EAAGA,MAAAA,CAAM,KAAK,CAAA,MAAA,CAAA;AAClC,IAAA,MAAM,MAAA,GAASG,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,QAAQ,CAAC,CAAA,CAAA,EAAIA,GAAAA,CAAI,GAAA,CAAI,WAAW,CAAC,CAAA,CAAA;AAC9D,IAAA,MAAM,OAAA,GAAU,WAAA,CAAY,CAACH,MAAAA,CAAM,KAAK,CAAC,CAAA;AACzC,IAAA,MAAM,YAAY,uBAAA,CAAwB;AAAA,MACxC,MAAA;AAAA,MACA,OAAA;AAAA,MACA,OAAA;AAAA,MACA,WAAWA,MAAAA,CAAM;AAAA,KAClB,CAAA;AACD,IAAA,OAAOG,MAAM,SAAS,CAAA,IAAA,EAAO,eAAA,CAAgBH,MAAAA,CAAM,UAAU,CAAC,CAAA,CAAA;AAAA,EAChE,CAAC,CAAA;AAED,EAAA,OAAOG,GAAAA,CAAI,IAAA,CAAK,OAAA,EAASA,GAAAA,CAAAA,EAAAA,CAAO,CAAA;AAClC;AAEA,SAAS,mBAAA,CACP,iBACA,iBAAA,EACO;AACP,EAAA,MAAM,iBAAA,GAAoB,oBAAA;AAAA,IACxB,eAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,IAAI,sBAAsB,MAAA,EAAW;AACnC,IAAA,OAAO;AAAA,MACL,yBAAyB,iBAAiB,CAAA;AAAA,MAC1C,kBAAA,CAAmB,oBAAA,EAAsB,iBAAA,EAAmB,WAAW,CAAA;AAAA,MACvE,kBAAA,CAAmB,kBAAA,EAAoB,iBAAA,EAAmB,WAAW;AAAA,KACvE;AAAA,EACF;AAEA,EAAA,MAAM,QAAe,EAAC;AACtB,EAAA,IAAI,eAAA,EAAiB;AACnB,IAAA,KAAA,CAAM,IAAA;AAAA,MACJ,kBAAA,CAAmB,oBAAA,EAAsB,eAAA,CAAgB,KAAA,CAAM,KAAK;AAAA,KACtE;AAAA,EACF;AACA,EAAA,IAAI,iBAAA,EAAmB;AACrB,IAAA,KAAA,CAAM,IAAA;AAAA,MACJ,kBAAA,CAAmB,kBAAA,EAAoB,iBAAA,CAAkB,KAAA,CAAM,KAAK;AAAA,KACtE;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,yBAAyB,SAAA,EAAwB;AACxD,EAAA,MAAM,YAAA,GAAeA,GAAAA,CAAI,GAAA,CAAI,2BAA2B,CAAA;AACxD,EAAA,MAAM,OAAOA,GAAAA,CAAI,GAAA,CAAI,GAAG,gBAAgB,CAAA,EAAG,SAAS,CAAA,CAAE,CAAA;AACtD,EAAA,MAAM,QAAA,GAAWA,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAG,SAAS,CAAA,GAAA,CAAK,CAAA;AAC1C,EAAA,MAAM,UAAA,GAAaA,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAG,SAAS,CAAA,KAAA,CAAO,CAAA;AAC9C,EAAA,OAAOA,GAAAA,CAAAA,WAAAA,EAAiB,YAAY,CAAA,IAAA,EAAO,YAAY,CAAA,WAAA,EAAc,IAAI,CAAA,CAAA,EAAI,QAAQ,CAAA,KAAA,EAAQ,YAAY,CAAA,aAAA,EAAgB,IAAI,IAAI,UAAU,CAAA,CAAA;AAC7I;AAEA,SAAS,kBAAA,CACP,QAAA,EACA,SAAA,EACA,QAAA,GAAW,YAAA,EACN;AACL,EAAA,MAAM,GAAA,GAAMA,GAAAA,CAAI,GAAA,CAAI,QAAQ,CAAA;AAC5B,EAAA,MAAM,OAAOA,GAAAA,CAAI,GAAA,CAAI,GAAG,gBAAgB,CAAA,EAAG,SAAS,CAAA,CAAE,CAAA;AACtD,EAAA,MAAM,QAAA,GAAWA,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAG,SAAS,CAAA,GAAA,CAAK,CAAA;AAC1C,EAAA,MAAM,UAAA,GAAaA,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAG,SAAS,CAAA,KAAA,CAAO,CAAA;AAC9C,EAAA,OAAOA,MAAMA,GAAAA,CAAI,GAAA,CAAI,QAAQ,CAAC,CAAA,CAAA,EAAI,GAAG,CAAA,IAAA,EAAO,GAAG,CAAA,WAAA,EAAc,IAAI,IAAI,QAAQ,CAAA,KAAA,EAAQ,GAAG,CAAA,aAAA,EAAgB,IAAI,IAAI,UAAU,CAAA,CAAA;AAC5H;AASO,SAAS,wBACd,KAAA,EACK;AACL,EAAA,MAAM;AAAA,IACJ,GAAA;AAAA,IACA,0BAAA;AAAA,IACA,iBAAA;AAAA,IACA;AAAA,GACF,GAAI,KAAA;AACJ,EAAA,IAAI,+BAA+B,MAAA,EAAW;AAC5C,IAAA,OAAOA,GAAAA,CAAAA,KAAAA,EAAWA,GAAAA,CAAI,GAAA,CAAI,0BAA0B,CAAC,CAAA,CAAA;AAAA,EACvD;AAEA,EAAA,MAAM,UAAA,GAAa,IAAI,KAAA,CAAM,KAAA;AAC7B,EAAA,MAAM,UAAA,GAAaA,GAAAA,CAAAA,SAAAA,EAAeA,GAAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,CAAA;AAErD,EAAA,MAAM,QAAe,EAAC;AACtB,EAAA,KAAA,MAAW,SAAA,IAAa,IAAI,UAAA,EAAY;AACtC,IAAA,MAAM,QAAA,GAAW,CAAA,IAAA,EAAO,SAAA,CAAU,SAAS,CAAA,CAAA;AAC3C,IAAA,MAAM,gBAAgB,SAAA,CAAU,aAAA;AAChC,IAAA,MAAM,QAAA,GAAW,SAAA,CAAU,QAAA,GAAW,WAAA,GAAc,YAAA;AACpD,IAAA,KAAA,CAAM,IAAA;AAAA,MACJA,GAAAA,CAAAA,EAAMA,IAAI,GAAA,CAAI,QAAQ,CAAC,CAAA,CAAA,EAAIA,GAAAA,CAAI,GAAA,CAAI,QAAQ,CAAC,CAAA,IAAA,EAAOA,IAAI,GAAA,CAAI,QAAQ,CAAC,CAAA,CAAA,EAAIA,GAAAA,CAAI,IAAI,aAAa,CAAC,CAAA,UAAA,EAAaA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAIA,GAAAA,CAAI,IAAI,aAAa,CAAC,WAAWA,GAAAA,CAAI,GAAA,CAAI,QAAQ,CAAC,CAAA,CAAA,EAAIA,GAAAA,CAAI,IAAI,aAAa,CAAC,CAAA,YAAA,EAAeA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAIA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,KAAA;AAAA,KAClR;AAAA,EACF;AAMA,EAAA,KAAA,MAAW,IAAA,IAAQ,mBAAA,CAAoB,eAAA,EAAiB,iBAAiB,CAAA,EAAG;AAC1E,IAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA,EACjB;AAEA,EAAA,OAAO,KAAA,CAAM,MAAA,KAAW,CAAA,GACpB,UAAA,GACAA,GAAAA,CAAAA,EAAM,UAAU,CAAA,CAAA,EAAIA,GAAAA,CAAI,IAAA,CAAK,KAAA,EAAOA,GAAAA,CAAAA,CAAAA,CAAM,CAAC,CAAA,CAAA;AACjD;AAQO,SAAS,qBACd,KAAA,EACiB;AACjB,EAAA,MAAM,EAAE,GAAA,EAAK,0BAAA,EAA4B,OAAA,EAAQ,GAAI,KAAA;AACrD,EAAA,IAAI,CAAC,GAAA,CAAI,OAAA,IAAW,GAAA,CAAI,OAAA,CAAQ,WAAW,CAAA,EAAG;AAC5C,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,UAAA,GAAa,mBAAmB,GAAG,CAAA;AACzC,EAAA,MAAM,QAAe,EAAC;AACtB,EAAA,KAAA,MAAW,SAAA,IAAa,IAAI,OAAA,EAAS;AACnC,IAAA,MAAM,SAAA,GAAY,UAAU,KAAA,CAAM,SAAA;AAClC,IAAA,IAAI,SAAA,KAAc,OAAA,IAAW,SAAA,KAAc,QAAA,EAAU;AACnD,MAAA,MAAM,IAAI,yBAAA;AAAA,QACR;AAAA,OACF;AAAA,IACF;AACA,IAAA,MAAM,QAAA,GACJ,0BAAA,IACA,UAAA,CAAW,GAAA,CAAI,SAAA,CAAU,KAAA,CAAM,KAAK,CAAA,IACpC,CAAA,IAAA,EAAO,SAAA,CAAU,KAAA,CAAM,KAAK,CAAA,CAAA;AAC9B,IAAA,MAAMH,MAAAA,GAAQ,iBAAA;AAAA,MACZ,SAAA,CAAU,KAAA;AAAA,MACV,OAAA;AAAA,MACA,SAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,MAAM,YAAYG,GAAAA,CAAI,GAAA,CAAI,SAAA,CAAU,SAAA,CAAU,aAAa,CAAA;AAC3D,IAAA,MAAM,QACJ,SAAA,CAAU,KAAA,KAAU,SAAA,CAAU,SAAA,KAAc,QAAQ,MAAA,GAAS,OAAA,CAAA;AAC/D,IAAA,MAAM,iBAAiBA,GAAAA,CAAI,GAAA,CAAI,KAAA,KAAU,OAAA,GAAU,SAAS,KAAK,CAAA;AACjE,IAAA,KAAA,CAAM,IAAA;AAAA,MACJA,GAAAA,CAAAA,CAAAA,EAAOH,MAAK,CAAA,UAAA,EAAa,cAAc,CAAA,CAAA;AAAA,MACvCG,GAAAA,CAAAA,EAAMH,MAAK,CAAA,CAAA,EAAI,SAAS,CAAA;AAAA,KAC1B;AAAA,EACF;AAEA,EAAA,OAAOG,GAAAA,CAAAA,SAAAA,EAAeA,GAAAA,CAAI,IAAA,CAAK,KAAA,EAAOA,OAAO,CAAC,CAAA,CAAA;AAChD;AAEA,SAAS,YAAYH,MAAAA,EAAyB;AAC5C,EAAA,MAAM,OAAA,GAAUA,OAAM,WAAA,IAAe,EAAA;AACrC,EAAA,OAAO,CAAA,EAAGA,MAAAA,CAAM,KAAK,CAAA,CAAA,EAAIA,MAAAA,CAAM,KAAK,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,EAAI,OAAO,CAAA,CAAA;AAC1D;AAEA,SAAS,0BAA0BA,MAAAA,EAAyB;AAC1D,EAAA,IACEA,MAAAA,CAAM,gBAAgB,MAAA,IACtBA,MAAAA,CAAM,gBAAgB,EAAA,IACtBA,MAAAA,CAAM,gBAAgB,GAAA,EACtB;AACA,IAAA,OAAOA,MAAAA,CAAM,YAAY,OAAA,CAAQ,MAAA,EAAQ,EAAE,CAAA,CAAE,UAAA,CAAW,KAAK,GAAG,CAAA;AAAA,EAClE;AAEA,EAAA,IAAIA,MAAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,OAAA,EAAS;AAC7B,IAAA,OAAOA,OAAM,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA,CAAE,KAAK,GAAG,CAAA;AAAA,EACrC;AAEA,EAAA,OAAOA,MAAAA,CAAM,IAAA,CAAK,IAAA,CAAK,GAAG,CAAA;AAC5B;AAOO,SAAS,qBACd,KAAA,EACiB;AACjB,EAAA,MAAM,EAAE,GAAA,EAAK,OAAA,EAAQ,GAAI,KAAA;AACzB,EAAA,IAAI,CAAC,GAAA,CAAI,OAAA,IAAW,IAAI,OAAA,CAAQ,MAAA,CAAO,WAAW,CAAA,EAAG;AACnD,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAY;AACjC,EAAA,MAAM,YAAwB,EAAC;AAE/B,EAAA,KAAA,MAAW,cAAA,IAAkB,GAAA,CAAI,UAAA,CAAW,MAAA,EAAQ;AAClD,IAAA,IAAI,cAAA,CAAe,MAAA,CAAO,MAAA,KAAW,WAAA,EAAa;AAChD,MAAA,MAAM,GAAA,GAAM,WAAA,CAAY,cAAA,CAAe,MAAM,CAAA;AAC7C,MAAA,IAAI,CAAC,QAAA,CAAS,GAAA,CAAI,GAAG,CAAA,EAAG;AACtB,QAAA,QAAA,CAAS,IAAI,GAAG,CAAA;AAChB,QAAA,SAAA,CAAU,IAAA,CAAK,eAAe,MAAM,CAAA;AAAA,MACtC;AAAA,IACF;AAAA,EACF;AAEA,EAAA,KAAA,MAAWA,MAAAA,IAAS,GAAA,CAAI,OAAA,CAAQ,MAAA,EAAQ;AACtC,IAAA,MAAM,GAAA,GAAM,YAAYA,MAAK,CAAA;AAC7B,IAAA,IAAI,CAAC,QAAA,CAAS,GAAA,CAAI,GAAG,CAAA,EAAG;AACtB,MAAA,QAAA,CAAS,IAAI,GAAG,CAAA;AAChB,MAAA,SAAA,CAAU,KAAKA,MAAK,CAAA;AAAA,IACtB;AAAA,EACF;AAEA,EAAA,IAAI,SAAA,CAAU,WAAW,CAAA,EAAG;AAC1B,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,UAAA,GAAa,mBAAmB,GAAG,CAAA;AACzC,EAAA,MAAM,QAAQ,SAAA,CAAU,GAAA;AAAA,IAAI,CAACA,MAAAA,KAC3B,iBAAA;AAAA,MACEA,MAAAA;AAAA,MACA,OAAA;AAAA,MACAA,MAAAA,CAAM,SAAA;AAAA,MACN,WAAW,GAAA,CAAIA,MAAAA,CAAM,KAAK,CAAA,IAAK,CAAA,IAAA,EAAOA,OAAM,KAAK,CAAA;AAAA;AACnD,GACF;AAEA,EAAA,OAAOG,GAAAA,CAAAA,SAAAA,EAAeA,GAAAA,CAAI,IAAA,CAAK,KAAA,EAAOA,OAAO,CAAC,CAAA,CAAA;AAChD;AAOO,SAAS,oBACd,KAAA,EACiB;AACjB,EAAA,MAAM,EAAE,GAAA,EAAK,GAAA,EAAI,GAAI,KAAA;AACrB,EAAA,IAAI,CAAC,IAAI,MAAA,EAAQ;AACf,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,SAAA,GAAY,0BAAA,CAA2B,GAAA,CAAI,MAAA,EAAQ,GAAG,CAAA;AAC5D,EAAA,OAAOA,aAAa,SAAS,CAAA,CAAA;AAC/B;AAoBO,SAAS,2BACd,KAAA,EACK;AACL,EAAA,MAAM,EAAE,GAAA,EAAK,OAAA,EAAS,SAAA,EAAW,iBAAgB,GAAI,KAAA;AACrD,EAAA,MAAM,EAAE,KAAA,EAAAH,MAAAA,EAAO,MAAA,EAAQ,QAAA,EAAU,gBAAe,GAAI,eAAA;AAEpD,EAAA,IAAI,SAAA,CAAU,WAAW,CAAA,EAAG;AAC1B,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR;AAAA,KACF;AAAA,EACF;AAEA,EAAA,MAAM,EAAE,gBAAe,GAAI,GAAA;AAC3B,EAAA,IAAI,mBAAmB,MAAA,EAAW;AAChC,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR;AAAA,KACF;AAAA,EACF;AAEA,EAAA,MAAM,SAAA,GAAY,0BAA0BA,MAAK,CAAA;AACjD,EAAA,MAAM,cAAc,GAAA,CAAI,WAAA;AACxB,EAAA,MAAM,WAAA,GAAc,0BAAA,CAA2BA,MAAAA,CAAM,KAAK,CAAA;AAO1D,EAAA,MAAM,iBAAiB,SAAA,CAAU,MAAA;AAAA,IAAO,CAAC,IAAA,KACvC,WAAA,EAAa,IAAI,aAAA,CAAc,IAAA,EAAM,SAAS,CAAC;AAAA,GACjD;AAQA,EAAA,MAAM,QAAA,GAAW,cAAA,CAAe,GAAA,CAAI,CAAC,IAAA,KAAS;AAC5C,IAAA,MAAM,SAAA,GAAY,cAAA,CAAe,SAAA,CAAU,OAAA,EAAS,MAAM,SAAS,CAAA;AAInE,IAAA,MAAM,YAAA,GACJ,UACA,WAAA,EAAa,GAAA,CAAI,cAAc,IAAA,EAAM,SAAS,CAAC,CAAA,EAAG,MAAA,IAClD,QAAA;AACF,IAAA,MAAM,eAAe,cAAA,CAAe,kBAAA;AAAA,MAClC,aAAA,CAAc,WAAW,WAAW,CAAA;AAAA,MACpC,cAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,MAAM,SAAA,GAAY,qBAAA,CAAsB,YAAA,EAAc,YAAY,CAAA;AAElE,IAAA,MAAM,UAAA,GAAoB;AAAA,MACxBG,MAAM,aAAA,CAAc,SAAA,EAAW,UAAU,CAAC,MAAM,OAAO,CAAA;AAAA,KACzD;AACA,IAAA,IAAI,aAAa,MAAA,EAAW;AAG1B,MAAA,UAAA,CAAW,IAAA;AAAA,QACT,uBAAA,CAAwB,YAAA,EAAc,YAAA,EAAc,QAAQ;AAAA,OAC9D;AAAA,IACF;AAEA,IAAA,OAAOA,GAAAA;AAAA;AAAA,QAAA,EAED,aAAA,CAAc,SAAA,EAAW,SAAS,CAAC,CAAA;AAAA,QAAA,EACnC,IAAI,CAAA;AAAA,QAAA,EACJ,YAAY,CAAA;AAAA,QAAA,EACZ,SAAS,CAAA;AAAA,WAAA,EACN,eAAA,CAAgB,SAAS,CAAC;AAAA,iBAAA,EACpB,WAAW;AAAA,WAAA,EACjBA,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAG,4BAA4B,UAAU,CAAC,CAAA;AAAA,WAAA,EAClD,aAAA,CAAc,SAAA,EAAW,SAAS,CAAC;AAAA,WAAA,EACnCA,IAAI,GAAA,CAAI,CAAA,EAAG,4BAA4B,CAAA,UAAA,CAAY,CAAC,MAAM,IAAI;AAAA,YAAA,EAC7DA,GAAAA,CAAI,IAAA,CAAK,UAAA,EAAYA,GAAAA,CAAAA,KAAAA,CAAU,CAAC;AAAA,IAAA,CAAA;AAAA,EAE5C,CAAC,CAAA;AAKD,EAAA,MAAM,YACJ,QAAA,CAAS,MAAA,KAAW,CAAA,GAClB,mBAAA,KACAA,GAAAA,CAAI,IAAA;AAAA,IACF,QAAA;AAAA,IACAA,GAAAA;AAAA;AAAA,QAAA;AAAA,GAGF;AAOJ,EAAA,OAAOA,GAAAA;AAAA,IAAA,EACHA,GAAAA,CAAI,GAAA,CAAI,oBAAoB,CAAC,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAAA,EAQzB,SAAS;AAAA;AAAA,cAAA,EAEH,gBAAgB,KAAK;AAAA;AAAA;AAAA,EAAA,CAAA;AAIrC;AAOA,SAAS,mBAAA,GAA2B;AAClC,EAAA,OAAOA,GAAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAAA,CAAA;AAQT;AAaO,SAAS,yBACd,KAAA,EACK;AACL,EAAA,MAAM,EAAE,GAAA,EAAK,iBAAA,EAAmB,OAAA,EAAS,WAAU,GAAI,KAAA;AACvD,EAAA,MAAM,EAAE,OAAA,EAAS,MAAA,EAAO,GAAI,GAAA;AAC5B,EAAA,MAAM,EAAE,KAAA,EAAO,IAAA,EAAM,QAAA,EAAU,KAAA,EAAO,UAAS,GAAI,iBAAA;AAEnD,EAAA,IAAI,SAAA,CAAU,WAAW,CAAA,EAAG;AAC1B,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR;AAAA,KACF;AAAA,EACF;AAEA,EAAA,MAAM,SAAA,GAAY,OAAO,MAAA,CAAO,QAAA;AAChC,EAAA,MAAM,WAAA,GAAc,0BAAA,CAA2B,iBAAA,CAAkB,KAAA,CAAM,KAAK,CAAA;AAC5E,EAAA,MAAM,mBAAmB,OAAA,CAAQ,QAAA;AACjC,EAAA,IAAI,qBAAqB,MAAA,EAAW;AAClC,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,CAAA,yDAAA,EAA4D,QAAQ,IAAI,CAAA,CAAA;AAAA,KAC1E;AAAA,EACF;AACA,EAAA,MAAM,iBAAiB,gBAAA,CAAiB,cAAA;AAAA,IACtC,SAAA;AAAA,IACA,KAAA;AAAA,IACA,IAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,MAAM,iBAAiB,gBAAA,CAAiB,cAAA;AAAA,IACtC,SAAA;AAAA,IACA,KAAA;AAAA,IACA,IAAA;AAAA,IACA;AAAA,GACF;AAEA,EAAA,MAAM,UAAA,GAAoB;AAAA,IACxBA,MAAM,aAAA,CAAc,SAAA,EAAW,UAAU,CAAC,MAAM,OAAO,CAAA,CAAA;AAAA,IACvD,iBAAA,CAAkB,aAAA,CAAc,SAAA,EAAW,WAAW,GAAG,SAAS,CAAA;AAAA,IAClE;AAAA,GACF;AACA,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,UAAA,CAAW,IAAA,CAAKA,GAAAA,CAAAA,EAAM,cAAc,CAAA,IAAA,EAAO,QAAQ,CAAA,CAAE,CAAA;AAAA,EACvD;AAQA,EAAA,OAAOA,GAAAA;AAAA,IAAA,EACHA,GAAAA,CAAI,GAAA,CAAI,kBAAkB,CAAC,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAAA,EAQrB,aAAA,CAAc,SAAA,EAAW,SAAS,CAAC,CAAA;AAAA,UAAA,EACnC,aAAA,CAAc,SAAA,EAAW,WAAW,CAAC,CAAA;AAAA,UAAA,EACrC,cAAc,CAAA;AAAA,aAAA,EACX,OAAO,aAAa;AAAA,mBAAA,EACd,WAAW;AAAA,aAAA,EACjBA,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAG,4BAA4B,UAAU,CAAC,CAAA;AAAA,aAAA,EAClD,aAAA,CAAc,SAAA,EAAW,SAAS,CAAC;AAAA,aAAA,EACnCA,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAG,4BAA4B,YAAY,CAAC,CAAA;AAAA,aAAA,EACpD,aAAA,CAAc,SAAA,EAAW,WAAW,CAAC;AAAA,cAAA,EACpCA,GAAAA,CAAI,IAAA,CAAK,UAAA,EAAYA,GAAAA,CAAAA,KAAAA,CAAU,CAAC;AAAA,4BAAA,EAClB,aAAA,CAAc,SAAA,EAAW,SAAS,CAAC,CAAA;AAAA,cAAA,EACjD,KAAK;AAAA;AAAA;AAAA,EAAA,CAAA;AAIrB;AAEO,SAAS,+BAAA,GAAuC;AACrD,EAAA,OAAOA,GAAAA;AAAA,IAAA,EACHA,GAAAA,CAAI,GAAA,CAAI,2BAA2B,CAAC,CAAA;AAAA,qCAAA,EACHA,GAAAA,CAAI,GAAA,CAAI,oBAAoB,CAAC;AAAA;AAAA,qCAAA,EAE7BA,GAAAA,CAAI,GAAA,CAAI,kBAAkB,CAAC;AAAA;AAAA,EAAA,CAAA;AAGlE;AAOA,SAAS,kBAAA,CACP,KACA,OAAA,EACgB;AAChB,EAAA,IAAI,CAAC,IAAI,OAAA,IAAW,GAAA,CAAI,QAAQ,MAAA,KAAW,CAAA,SAAU,EAAC;AAEtD,EAAA,MAAM,UAAA,GAAa,mBAAmB,GAAG,CAAA;AACzC,EAAA,MAAM,YAAmB,EAAC;AAC1B,EAAA,KAAA,MAAW,SAAA,IAAa,IAAI,OAAA,EAAS;AACnC,IAAA,MAAM,SAAA,GAAY,UAAU,KAAA,CAAM,SAAA;AAClC,IAAA,IAAI,SAAA,KAAc,OAAA,IAAW,SAAA,KAAc,QAAA,EAAU;AACnD,MAAA,MAAM,IAAI,yBAAA;AAAA,QACR;AAAA,OACF;AAAA,IACF;AACA,IAAA,MAAM,QAAA,GACJ,UAAA,CAAW,GAAA,CAAI,SAAA,CAAU,KAAA,CAAM,KAAK,CAAA,IACpC,CAAA,EAAG,gBAAgB,CAAA,EAAG,SAAA,CAAU,KAAA,CAAM,KAAK,CAAA,CAAA;AAC7C,IAAA,MAAMH,MAAAA,GAAQ,iBAAA;AAAA,MACZ,SAAA,CAAU,KAAA;AAAA,MACV,OAAA;AAAA,MACA,SAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,MAAM,YAAYG,GAAAA,CAAI,GAAA,CAAI,SAAA,CAAU,SAAA,CAAU,aAAa,CAAA;AAC3D,IAAA,MAAM,QACJ,SAAA,CAAU,KAAA,KAAU,SAAA,CAAU,SAAA,KAAc,QAAQ,MAAA,GAAS,OAAA,CAAA;AAC/D,IAAA,MAAM,iBAAiBA,GAAAA,CAAI,GAAA,CAAI,KAAA,KAAU,OAAA,GAAU,SAAS,KAAK,CAAA;AACjE,IAAA,SAAA,CAAU,IAAA;AAAA,MACRA,GAAAA,CAAAA,CAAAA,EAAOH,MAAK,CAAA,UAAA,EAAa,cAAc,CAAA,CAAA;AAAA,MACvCG,GAAAA,CAAAA,EAAMH,MAAK,CAAA,CAAA,EAAI,SAAS,CAAA;AAAA,KAC1B;AAAA,EACF;AACA,EAAA,OAAO,SAAA;AACT;AAWO,SAAS,6BACd,KAAA,EACK;AACL,EAAA,MAAM,EAAE,GAAA,EAAK,OAAA,EAAQ,GAAI,KAAA;AACzB,EAAA,MAAM,SAAA,GAAYG,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAG,kBAAkB,CAAA,UAAA,CAAY,CAAA;AAC3D,EAAA,MAAM,UAAA,GAAa,kBAAA,CAAmB,GAAA,EAAK,OAAO,CAAA;AAClD,EAAA,OAAOA,GAAAA,CAAAA,SAAAA,EAAeA,IAAI,IAAA,CAAK,CAAC,WAAW,GAAG,UAAU,CAAA,EAAGA,GAAAA,CAAAA,EAAAA,CAAO,CAAC,CAAA,CAAA;AACrE;AAuBO,SAAS,8BACd,KAAA,EACK;AACL,EAAA,MAAM,EAAE,GAAA,EAAK,OAAA,EAAS,MAAA,EAAO,GAAI,KAAA;AACjC,EAAA,MAAM,CAAA,GAAI,QAAQ,CAAA,IAAK,aAAA;AACvB,EAAA,MAAM,YAAA,GAAe,MAAA,EAAQ,OAAA,EAAS,MAAA,IAAU,kBAAA;AAChD,EAAA,MAAM,cAAA,GAAiB,MAAA,EAAQ,OAAA,EAAS,QAAA,IAAY,kBAAA;AAMpD,EAAA,MAAM,WAAWA,GAAAA,CAAI,GAAA;AAAA,IACnB,CAAA,UAAA,EAAa,YAAY,CAAA,IAAA,EAAO,CAAC,CAAA,GAAA,EAAM,oBAAoB,CAAA,qBAAA,EAC7C,cAAc,CAAA,IAAA,EAAO,CAAC,CAAA,GAAA,EAAM,kBAAkB,CAAA,eAAA;AAAA,GAC9D;AAMA,EAAA,MAAM,aAAaA,GAAAA,CAAI,GAAA;AAAA,IACrB,CAAA,SAAA,EAAY,kBAAkB,CAAA,UAAA,EAAa,oBAAoB,CAAA,aAAA;AAAA,GACjE;AACA,EAAA,MAAM,UAAA,GAAa,kBAAA,CAAmB,GAAA,EAAK,OAAO,CAAA;AAClD,EAAA,OAAOA,GAAAA,CAAAA,SAAAA,EAAeA,GAAAA,CAAI,IAAA,CAAK,CAAC,QAAA,EAAU,GAAG,UAAA,EAAY,UAAU,CAAA,EAAGA,GAAAA,CAAAA,EAAAA,CAAO,CAAC,CAAA,CAAA;AAChF;AAOO,SAAS,2BACd,KAAA,EACK;AACL,EAAA,MAAM,EAAE,GAAA,EAAK,OAAA,EAAQ,GAAI,KAAA;AACzB,EAAA,MAAM,aAAA,GAAgBA,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAG,oBAAoB,CAAA,aAAA,CAAe,CAAA;AACpE,EAAA,MAAM,UAAA,GAAa,kBAAA,CAAmB,GAAA,EAAK,OAAO,CAAA;AAClD,EAAA,OAAOA,GAAAA,CAAAA,SAAAA,EAAeA,IAAI,IAAA,CAAK,CAAC,eAAe,GAAG,UAAU,CAAA,EAAGA,GAAAA,CAAAA,EAAAA,CAAO,CAAC,CAAA,CAAA;AACzE;AAOO,SAAS,uBACd,KAAA,EACiB;AACjB,EAAA,MAAM,EAAE,KAAA,EAAO,MAAA,EAAO,GAAI,KAAA;AAC1B,EAAA,MAAM,QAAe,EAAC;AAEtB,EAAA,IAAI,UAAU,MAAA,EAAW;AACvB,IAAA,KAAA,CAAM,IAAA,CAAKA,GAAAA,CAAAA,MAAAA,EAAY,KAAK,CAAA,CAAE,CAAA;AAAA,EAChC;AACA,EAAA,IAAI,WAAW,MAAA,EAAW;AACxB,IAAA,KAAA,CAAM,IAAA,CAAKA,GAAAA,CAAAA,OAAAA,EAAa,MAAM,CAAA,CAAE,CAAA;AAAA,EAClC;AAEA,EAAA,OAAO,MAAM,MAAA,GAAS,CAAA,GAAIA,IAAI,IAAA,CAAK,KAAA,EAAOA,MAAM,CAAA,GAAI,MAAA;AACtD;;;AC5mCO,SAAS,wBAAA,CACd,KACA,OAAA,EAC6B;AAC7B,EAAA,MAAM,kBAAA,GAAqB,8BAAA,CAA+B,GAAA,CAAI,UAAU,CAAA;AACxE,EAAA,IAAI,kBAAA,CAAmB,SAAS,CAAA,EAAG;AACjC,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR;AAAA,KACF;AAAA,EACF;AAEA,EAAA,MAAM,iBAAA,GAAoB,mBAAmB,CAAC,CAAA;AAC9C,EAAA,IAAI,sBAAsB,MAAA,EAAW;AACnC,IAAA,OAAO,EAAE,mBAAmB,MAAA,EAAU;AAAA,EACxC;AAEA,EAAA,IAAI,CAAC,OAAA,CAAQ,YAAA,CAAa,gBAAA,EAAkB;AAC1C,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,CAAA,yDAAA,EAA4D,QAAQ,IAAI,CAAA,CAAA;AAAA,KAC1E;AAAA,EACF;AAEA,EAAA,MAAM,WAAW,OAAA,CAAQ,QAAA;AACzB,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,CAAA,SAAA,EAAY,QAAQ,IAAI,CAAA,4DAAA;AAAA,KAC1B;AAAA,EACF;AAEA,EAAA,IAAI,CAAC,QAAA,CAAS,cAAA,CAAe,QAAA,CAAS,iBAAA,CAAkB,IAAI,CAAA,EAAG;AAC7D,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,CAAA,qBAAA,EAAwB,iBAAA,CAAkB,IAAI,CAAA,2BAAA,EAA8B,QAAA,CAAS,IAAI,CAAA,6BAAA,EAAgC,QAAA,CAAS,cAAA,CAAe,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA;AAAA,KAC7J;AAAA,EACF;AAEA,EAAA,IACE,iBAAA,CAAkB,QAAA,KAAa,MAAA,IAC/B,CAAC,SAAS,wBAAA,EACV;AACA,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,CAAA,mBAAA,EAAsB,SAAS,IAAI,CAAA,wLAAA;AAAA,KAGrC;AAAA,EACF;AAEA,EAAA,IACE,CAAC,OAAO,QAAA,CAAS,iBAAA,CAAkB,KAAK,CAAA,IACxC,iBAAA,CAAkB,SAAS,CAAA,EAC3B;AACA,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,CAAA,2DAAA,EAA8D,MAAA,CAAO,iBAAA,CAAkB,KAAK,CAAC,CAAA;AAAA,KAC/F;AAAA,EACF;AAEA,EAAA,MAAM,EAAE,UAAS,GAAI,iBAAA;AACrB,EAAA,IAAI,aAAa,MAAA,IAAa,CAAC,MAAA,CAAO,QAAA,CAAS,QAAQ,CAAA,EAAG;AACxD,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,CAAA,+CAAA,EAAkD,MAAA,CAAO,QAAQ,CAAC,CAAA;AAAA,KACpE;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,iBAAA,EAAkB;AAC7B;AASO,SAAS,yBAAA,CACd,UACA,iBAAA,EACoB;AACpB,EAAA,IAAI,sBAAsB,MAAA,EAAW;AACnC,IAAA,OAAO,QAAA;AAAA,EACT;AACA,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,OAAO,iBAAA,CAAkB,KAAA;AAAA,EAC3B;AACA,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,QAAA,EAAU,iBAAA,CAAkB,KAAK,CAAA;AACnD;;;AChFO,SAAS,mBAAA,CACd,GAAA,EACA,eAAA,EACA,iBAAA,EACwB;AACxB,EAAA,MAAM,SAAS,GAAA,CAAI,MAAA;AACnB,EAAA,IAAI,MAAA,KAAW,MAAA,EAAW,OAAO,EAAE,QAAQ,MAAA,EAAU;AAErD,EAAA,IAAI,eAAA,KAAoB,MAAA,IAAa,iBAAA,KAAsB,MAAA,EAAW;AACpE,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,CAAA,kJAAA;AAAA,KAGF;AAAA,EACF;AACA,EAAA,IAAI,eAAA,CAAgB,KAAA,CAAM,KAAA,KAAU,iBAAA,CAAkB,MAAM,KAAA,EAAO;AACjE,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,wGACqC,eAAA,CAAgB,KAAA,CAAM,KAAK,CAAA,WAAA,EAClD,iBAAA,CAAkB,MAAM,KAAK,CAAA,CAAA;AAAA,KAC7C;AAAA,EACF;AACA,EAAA,OAAO,EAAE,MAAA,EAAO;AAClB;;;ACvBO,SAAS,mCACd,GAAA,EACyB;AACzB,EAAA,MAAM,uBAAA,GAA0B,IAAI,UAAA,CAAW,IAAA;AAAA,IAC7C,CAAC,SAAA,KACC,SAAA,CAAU,cAAA,KAAmB;AAAA,GACjC;AAEA,EAAA,IAAI,4BAA4B,MAAA,EAAW;AACzC,IAAA,MAAM,IAAI,uBAAuB,oCAAoC,CAAA;AAAA,EACvE;AAEA,EAAA,IAAI,GAAA,CAAI,UAAA,CAAW,MAAA,GAAS,CAAA,EAAG;AAC7B,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR;AAAA,KAEF;AAAA,EACF;AAEA,EAAA,OAAO,uBAAA;AACT;;;AC9BO,SAAS,eAAA,CACd,OACA,IAAA,EAC4B;AAC5B,EAAA,MAAM,MAAA,GAAS,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAA;AACjC,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,IAAA,CAAK,MAAA,CAAO,KAAA,EAAO,MAAM;AAAA,GAClC;AACF;ACgCO,SAAS,sBAAsB,OAAA,EAAqC;AACzE,EAAA,MAAM,EAAE,IAAA,EAAM,IAAA,EAAM,UAAA,EAAY,kBAAiB,GAAI,OAAA;AAGrD,EAAA,MAAM,MAAA,GAAS,UAAA,GAAaA,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAG,UAAU,CAAA,CAAA,CAAG,CAAA,GAAIA,GAAAA,CAAI,GAAA,CAAI,EAAE,CAAA;AAClE,EAAA,MAAM,SAAA,GAAYA,MAAM,MAAM,CAAA,UAAA,CAAA;AAC9B,EAAA,MAAM,SAAA,GAAYA,MAAM,MAAM,CAAA,UAAA,CAAA;AAC9B,EAAA,MAAM,OAAA,GAAUA,MAAM,MAAM,CAAA,QAAA,CAAA;AAE5B,EAAA,QAAQ,IAAA;AAAM,IACZ,KAAK,SAAA,EAAW;AACd,MAAA,MAAM,MAAM,gBAAA,IAAoBA,GAAAA,CAAAA,iBAAAA,CAAAA;AAChC,MAAA,OAAOA,GAAAA,CAAAA,EAAM,SAAS,CAAA,cAAA,EAAiB,SAAS,CAAA,YAAA,EAAe,SAAS,CAAA,IAAA,EAAO,GAAG,CAAA,OAAA,EAAU,OAAO,CAAA,YAAA,EAAe,OAAO,MAAM,GAAG,CAAA,CAAA,CAAA;AAAA,IACpI;AAAA,IAEA,KAAK,MAAA,EAAQ;AACX,MAAA,IAAI,SAAS,MAAA,EAAW;AACtB,QAAA,MAAM,IAAI,MAAM,CAAA,mDAAA,CAAqD,CAAA;AAAA,MACvE;AACA,MAAA,MAAM,SAAA,GAAY,IAAA;AAClB,MAAA,OAAOA,GAAAA,CAAAA,EAAM,SAAS,CAAA,cAAA,EAAiB,SAAS,CAAA,YAAA,EAAe,SAAS,CAAA,IAAA,EAAO,SAAS,CAAA,OAAA,EAAU,OAAO,CAAA,YAAA,EAAe,OAAO,MAAM,SAAS,CAAA,CAAA,CAAA;AAAA,IAChJ;AAAA,IAEA,KAAK,cAAA,EAAgB;AAEnB,MAAA,OAAOA,MAAM,SAAS,CAAA,QAAA,CAAA;AAAA,IACxB;AAAA,IAEA,KAAK,mBAAA,EAAqB;AAExB,MAAA,OAAOA,GAAAA,CAAI,IAAI,KAAK,CAAA;AAAA,IACtB;AAAA;AAEJ;AASO,SAAS,sBAAA,CACd,KACA,UAAA,EACuB;AACvB,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,IAAI,YAAA,CAAa,IAAA;AAAA,IACvB,IAAA,EAAM,IAAI,YAAA,CAAa,IAAA;AAAA,IACvB;AAAA,GACF;AACF;;;ACtFO,SAAS,wBAAA,CACd,KACA,gBAAA,EACoB;AACpB,EAAA,OAAO;AAAA,IACL,SAAS,UAAA,EAA0B;AACjC,MAAA,OAAO,qBAAA,CAAsB;AAAA,QAC3B,GAAG,sBAAA,CAAuB,GAAA,EAAK,UAAU,CAAA;AAAA,QACzC;AAAA,OACD,CAAA;AAAA,IACH;AAAA,GACF;AACF;;;ACDO,SAAS,sBAAA,CACd,GAAA,EACA,OAAA,EACA,cAAA,EAC2B;AAC3B,EAAA,MAAM,gBAAA,GAAmB,iCAAA,CAAkC,GAAA,CAAI,UAAU,CAAA;AACzE,EAAA,IAAI,gBAAA,CAAiB,SAAS,CAAA,EAAG;AAC/B,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR;AAAA,KACF;AAAA,EACF;AAEA,EAAA,MAAM,eAAA,GAAkB,iBAAiB,CAAC,CAAA;AAC1C,EAAA,IAAI,oBAAoB,MAAA,EAAW;AACjC,IAAA,OAAO,EAAE,iBAAiB,MAAA,EAAU;AAAA,EACtC;AAEA,EAAA,MAAM,iBAAA,GAAoB,QAAQ,YAAA,CAAa,uBAAA;AAC/C,EAAA,IAAI,iBAAA,KAAsB,aAAA,IAAiB,CAAC,OAAA,CAAQ,eAAA,EAAiB;AACnE,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,CAAA,4DAAA,EAA+D,QAAQ,IAAI,CAAA,CAAA;AAAA,KAC7E;AAAA,EACF;AAKA,EAAA,IAAI,eAAA,CAAgB,WAAW,MAAA,EAAW;AACxC,IAAA,MAAM,gBAAA,GACJ,cAAA,EAAgB,YAAA,CAAa,OAAA,IAC7B,QAAQ,YAAA,CAAa,aAAA;AACvB,IAAA,IAAI,CAAC,gBAAA,CAAiB,QAAA,CAAS,eAAA,CAAgB,MAAM,CAAA,EAAG;AACtD,MAAA,MAAM,IAAI,yBAAA;AAAA,QACR,mBAAmB,MAAA,GACjB,CAAA,eAAA,EAAkB,gBAAgB,MAAM,CAAA,gCAAA,EAAmC,QAAQ,IAAI,CAAA,CAAA,CAAA,GACvF,kBAAkB,eAAA,CAAgB,MAAM,0CAA0C,cAAA,CAAe,IAAI,iBAAiB,gBAAA,CAAiB,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA;AAAA,OACrJ;AAAA,IACF;AAAA,EACF;AAEA,EAAA,IAAI,CAAC,OAAO,QAAA,CAAS,eAAA,CAAgB,KAAK,CAAA,IAAK,eAAA,CAAgB,SAAS,CAAA,EAAG;AACzE,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,CAAA,6DAAA,EAAgE,MAAA,CAAO,eAAA,CAAgB,KAAK,CAAC,CAAA;AAAA,KAC/F;AAAA,EACF;AAEA,EAAA,MAAM,EAAE,UAAS,GAAI,eAAA;AACrB,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,QAAQ,CAAA,EAAG;AAC9B,MAAA,MAAM,IAAI,yBAAA;AAAA,QACR,CAAA,6CAAA,EAAgD,MAAA,CAAO,QAAQ,CAAC,CAAA;AAAA,OAClE;AAAA,IACF;AACA,IAAA,IAAI,gBAAgB,MAAA,KAAW,QAAA,IAAY,KAAK,GAAA,CAAI,QAAQ,IAAI,CAAA,EAAG;AACjE,MAAA,MAAM,IAAI,yBAAA;AAAA,QACR,CAAA,8CAAA,EAAiD,MAAA,CAAO,QAAQ,CAAC,CAAA;AAAA,OACnE;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,eAAA,EAAgB;AAC3B;AAQO,SAAS,uBAAA,CACd,UACA,eAAA,EACoB;AACpB,EAAA,IAAI,oBAAoB,MAAA,EAAW;AACjC,IAAA,OAAO,QAAA;AAAA,EACT;AACA,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,OAAO,eAAA,CAAgB,KAAA;AAAA,EACzB;AACA,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,QAAA,EAAU,eAAA,CAAgB,KAAK,CAAA;AACjD;;;ACzCA,SAAS,uBAAA,GAAwC;AAC/C,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,OAAO,SAAS,cAAA,GAAyB;AACvC,IAAA,OAAA,IAAW,CAAA;AACX,IAAA,OAAO,CAAA,KAAA,EAAQ,OAAA,CAAQ,QAAA,CAAS,EAAE,CAAC,CAAA,CAAA;AAAA,EACrC,CAAA;AACF;AAEA,SAAS,4BAA4B,GAAA,EAAyC;AAC5E,EAAA,MAAM,aAA8B,EAAC;AAErC,EAAA,KAAA,MAAWH,MAAAA,IAAS,GAAA,CAAI,UAAA,CAAW,MAAA,EAAQ;AACzC,IAAA,IAAI,YAAYA,MAAAA,CAAM,MAAA,IAAUA,MAAAA,CAAM,MAAA,CAAO,WAAW,WAAA,EAAa;AACnE,MAAA,UAAA,CAAW,IAAA,CAAKA,OAAM,MAAM,CAAA;AAAA,IAC9B;AAAA,EACF;AAEA,EAAA,OAAO,UAAA;AACT;AAEA,SAAS,kBAAA,CACP,GAAA,EACA,KAAA,EACA,mBAAA,EAC0B;AAC1B,EAAA,OAAO,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,CAACW,UAAAA,KAAc;AAC1C,IAAA,MAAM,UAAA,GAAaA,WAAU,UAAA,IAAc,MAAA;AAC3C,IAAA,OACEA,UAAAA,CAAU,WAAA,KAAgB,KAAA,IAAS,UAAA,KAAe,mBAAA;AAAA,EAEtD,CAAC,CAAA;AACH;AAEA,SAAS,uBAAA,CACP,WAAA,EACA,GAAA,EACA,KAAA,EACA,qBACA,cAAA,EACiB;AACjB,EAAA,MAAM,eAAA,GAAkB,kBAAA,CAAmB,GAAA,EAAK,KAAA,EAAO,mBAAmB,CAAA;AAC1E,EAAA,IAAI,eAAA,CAAgB,WAAW,CAAA,EAAG;AAChC,IAAA,OAAO,WAAA;AAAA,EACT;AAEA,EAAA,OAAO;AAAA,IACL,KAAA;AAAA,IACA,IAAI,cAAA,EAAe;AAAA,IACnB,KAAA,EAAO,WAAA;AAAA,IACP,EAAA,EAAI,QAAA;AAAA,IACJ,mBAAA;AAAA,IACA,YAAY,eAAA,CAAgB,GAAA,CAAI,CAACA,UAAAA,KAAcA,WAAU,UAAU;AAAA,GACrE;AACF;AAEA,SAAS,uCAAA,CACP,WAAA,EACA,GAAA,EACA,cAAA,EACA,OACA,0BAAA,EACiB;AACjB,EAAA,IAAI,IAAA,GAAO,WAAA;AAEX,EAAA,MAAM,oBAAA,GAAuB,4BAA4B,GAAG,CAAA;AAC5D,EAAA,IACE,oBAAA,CAAqB,SAAS,CAAA,IAC9B,GAAA,CAAI,YAAY,MAAA,IAChB,GAAA,CAAI,WAAW,MAAA,EACf;AACA,IAAA,MAAM,aAAA,GAAmC;AAAA,MACvC,UAAA,EAAY,oBAAA;AAAA,MACZ,OAAA,EAAS,GAAA,CAAI,OAAA,EAAS,MAAA,IAAU,EAAC;AAAA,MACjC,IAAI,cAAA,EAAe;AAAA,MACnB,KAAA,EAAO,IAAA;AAAA,MACP,EAAA,EAAI;AAAA,KACN;AACA,IAAA,IAAA,GACE,GAAA,CAAI,WAAW,MAAA,GACb,aAAA,GACA,EAAE,GAAG,aAAA,EAAe,MAAA,EAAQ,GAAA,CAAI,MAAA,EAAO;AAAA,EAC7C;AAEA,EAAA,IAAI,IAAI,OAAA,KAAY,MAAA,IAAa,GAAA,CAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACvD,IAAA,IAAA,GAAO;AAAA,MACL,IAAI,cAAA,EAAe;AAAA,MACnB,KAAA,EAAO,IAAA;AAAA,MACP,EAAA,EAAI,MAAA;AAAA,MACJ,SAAS,GAAA,CAAI;AAAA,KACf;AAAA,EACF;AAEA,EAAA,IAAI,KAAA,KAAU,MAAA,IAAa,GAAA,CAAI,MAAA,KAAW,MAAA,EAAW;AACnD,IAAA,MAAM,mBAAA,GAAqE;AAAA,MACzE,IAAI,cAAA,EAAe;AAAA,MACnB,KAAA,EAAO,IAAA;AAAA,MACP,EAAA,EAAI;AAAA,KACN;AACA,IAAA,MAAM,WAAW,KAAA,KAAU,MAAA;AAC3B,IAAA,MAAM,SAAA,GAAY,IAAI,MAAA,KAAW,MAAA;AAEjC,IAAA,IAAI,YAAY,SAAA,EAAW;AACzB,MAAA,IAAA,GAAO;AAAA,QACL,GAAG,mBAAA;AAAA,QACH,KAAA;AAAA,QACA,QAAQ,GAAA,CAAI;AAAA,OACd;AAAA,IACF,WAAW,QAAA,EAAU;AACnB,MAAA,IAAA,GAAO,EAAE,GAAG,mBAAA,EAAqB,KAAA,EAAM;AAAA,IACzC,WAAW,SAAA,EAAW;AACpB,MAAA,IAAA,GAAO,EAAE,GAAG,mBAAA,EAAqB,MAAA,EAAQ,IAAI,MAAA,EAAO;AAAA,IACtD,CAAA,MAAO;AACL,MAAA,MAAM,IAAI,sBAAA;AAAA,QACR;AAAA,OACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,eAAA,GAAoE;AAAA,IACxE,MAAA,EAAQ,IAAI,UAAA,CAAW,MAAA;AAAA,IACvB,IAAI,cAAA,EAAe;AAAA,IACnB,KAAA,EAAO,IAAA;AAAA,IACP,EAAA,EAAI;AAAA,GACN;AACA,EAAA,OAAO,0BAAA,KAA+B,SAAY,eAAA,GAC9C;AAAA,IACE,GAAG,eAAA;AAAA,IACH,uBAAA,EAAyB;AAAA,GAC3B;AAEN;AAQA,SAAS,oCACP,KAAA,EACiB;AACjB,EAAA,MAAM,EAAE,GAAA,EAAK,cAAA,EAAe,GAAI,KAAA;AAEhC,EAAA,IAAI,WAAA,GAA+B;AAAA,IACjC,KAAA,EAAO,IAAI,KAAA,CAAM,KAAA;AAAA,IACjB,SAAS,KAAA,CAAM,OAAA;AAAA,IACf,IAAI,cAAA,EAAe;AAAA,IACnB,KAAA,EAAO,IAAI,KAAA,CAAM,KAAA;AAAA,IACjB,EAAA,EAAI,MAAA;AAAA,IACJ,MAAA,EAAQ;AAAA,GACV;AAEA,EAAA,WAAA,GAAc,uBAAA;AAAA,IACZ,WAAA;AAAA,IACA,GAAA;AAAA,IACA,IAAI,KAAA,CAAM,KAAA;AAAA,IACV,MAAA;AAAA,IACA;AAAA,GACF;AAEA,EAAA,KAAA,MAAW,SAAA,IAAa,IAAI,UAAA,EAAY;AACtC,IAAA,WAAA,GAAc;AAAA,MACZ,WAAW,SAAA,CAAU,SAAA;AAAA,MACrB,WAAW,SAAA,CAAU,SAAA;AAAA,MACrB,WAAW,SAAA,CAAU,SAAA;AAAA,MACrB,IAAI,cAAA,EAAe;AAAA,MACnB,KAAA,EAAO,WAAA;AAAA,MACP,gBAAA,EAAkB,SAAA,CAAU,gBAAA,IAAoB,EAAC;AAAA,MACjD,eAAe,SAAA,CAAU,aAAA;AAAA,MACzB,QAAA,EAAU,SAAA,CAAU,QAAA,GAAW,MAAA,GAAS,OAAA;AAAA,MACxC,WAAW,SAAA,CAAU,SAAA;AAAA,MACrB,WAAW,SAAA,CAAU,SAAA;AAAA,MACrB,EAAA,EAAI;AAAA,KACN;AAEA,IAAA,WAAA,GAAc,uBAAA;AAAA,MACZ,WAAA;AAAA,MACA,GAAA;AAAA,MACA,SAAA,CAAU,SAAA;AAAA,MACV,MAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,WAAA,GAAc,uBAAA;AAAA,MACZ,WAAA;AAAA,MACA,GAAA;AAAA,MACA,SAAA,CAAU,SAAA;AAAA,MACV,MAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAEA,EAAA,IAAI,KAAA,CAAM,oBAAoB,MAAA,EAAW;AACvC,IAAA,WAAA,GAAc;AAAA,MACZ,IAAI,cAAA,EAAe;AAAA,MACnB,KAAA,EAAO,WAAA;AAAA,MACP,EAAA,EAAI,YAAA;AAAA,MACJ,WAAW,KAAA,CAAM;AAAA,KACnB;AAAA,EACF;AAEA,EAAA,IAAI,KAAA,CAAM,sBAAsB,MAAA,EAAW;AACzC,IAAA,WAAA,GAAc;AAAA,MACZ,IAAI,cAAA,EAAe;AAAA,MACnB,KAAA,EAAO,WAAA;AAAA,MACP,EAAA,EAAI,gBAAA;AAAA,MACJ,WAAW,KAAA,CAAM;AAAA,KACnB;AAAA,EACF;AAEA,EAAA,OAAO,uCAAA;AAAA,IACL,WAAA;AAAA,IACA,GAAA;AAAA,IACA,cAAA;AAAA,IACA,KAAA,CAAM,cAAA;AAAA,IACN,KAAA,CAAM;AAAA,GACR;AACF;AAQA,SAAS,qCACP,KAAA,EACiB;AACjB,EAAA,MAAM,EAAE,GAAA,EAAK,cAAA,EAAe,GAAI,KAAA;AAChC,EAAA,MAAM,SAAA,GACJ,KAAA,CAAM,SAAA,IAAa,kCAAA,CAAmC,MAAM,GAAG,CAAA;AAEjE,EAAA,IAAI,WAAA,GAA+B;AAAA,IACjC,KAAA,EAAO,IAAI,KAAA,CAAM,KAAA;AAAA,IACjB,SAAS,KAAA,CAAM,OAAA;AAAA,IACf,IAAI,cAAA,EAAe;AAAA,IACnB,KAAA,EAAO,IAAI,KAAA,CAAM,KAAA;AAAA,IACjB,EAAA,EAAI,MAAA;AAAA,IACJ,MAAA,EAAQ;AAAA,GACV;AAEA,EAAA,WAAA,GAAc,uBAAA;AAAA,IACZ,WAAA;AAAA,IACA,GAAA;AAAA,IACA,IAAI,KAAA,CAAM,KAAA;AAAA,IACV,MAAA;AAAA,IACA;AAAA,GACF;AAEA,EAAA,WAAA,GAAc;AAAA,IACZ,WAAW,SAAA,CAAU,SAAA;AAAA,IACrB,WAAW,SAAA,CAAU,SAAA;AAAA,IACrB,IAAI,cAAA,EAAe;AAAA,IACnB,KAAA,EAAO,WAAA;AAAA,IACP,gBAAA,EAAkB,SAAA,CAAU,gBAAA,IAAoB,EAAC;AAAA,IACjD,WAAW,SAAA,CAAU,SAAA;AAAA,IACrB,WAAW,SAAA,CAAU,SAAA;AAAA,IACrB,EAAA,EAAI,kBAAA;AAAA,IACJ,WAAW,SAAA,CAAU;AAAA,GACvB;AAEA,EAAA,WAAA,GAAc,uBAAA;AAAA,IACZ,WAAA;AAAA,IACA,GAAA;AAAA,IACA,SAAA,CAAU,SAAA;AAAA,IACV,MAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,WAAA,GAAc,uBAAA;AAAA,IACZ,WAAA;AAAA,IACA,GAAA;AAAA,IACA,SAAA,CAAU,SAAA;AAAA,IACV,MAAA;AAAA,IACA;AAAA,GACF;AAEA,EAAA,OAAO,uCAAA;AAAA,IACL,WAAA;AAAA,IACA,GAAA;AAAA,IACA,cAAA;AAAA,IACA,GAAA,CAAI;AAAA,GACN;AACF;AAEA,SAAS,qCAAA,CACP,KAAA,EACA,OAAA,EACA,OAAA,EACA,gBACA,cAAA,EACiB;AACjB,EAAA,IAAI,YAAY,KAAA,EAAO;AACrB,IAAA,OAAO,kCAAA;AAAA,MACL,KAAA;AAAA,MACA,OAAA;AAAA,MACA,OAAA;AAAA,MACA,cAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAEA,EAAA,MAAMC,2BAAAA,GAA6B,MAAM,UAAA,CAAW,IAAA;AAAA,IAClD,CAAC,SAAA,KAAc,SAAA,CAAU,cAAA,KAAmB;AAAA,GAC9C;AACA,EAAA,IAAIA,2BAAAA,EAA4B;AAC9B,IAAA,OAAO,oCAAA,CAAqC;AAAA,MAC1C,GAAA,EAAK,KAAA;AAAA,MAEL,OAAA;AAAA,MACA;AAAA,KACD,CAAA;AAAA,EACH;AAEA,EAAA,MAAM,cAAA,GAAiB,WAAW,OAAO,CAAA;AACzC,EAAA,MAAM,eAAA,GAAkB,sBAAA;AAAA,IACtB,KAAA;AAAA,IACA,cAAA;AAAA,IACA;AAAA,GACF,CAAE,eAAA;AACF,EAAA,MAAM,iBAAA,GAAoB,wBAAA;AAAA,IACxB,KAAA;AAAA,IACA;AAAA,GACF,CAAE,iBAAA;AACF,EAAA,MAAM,gBAAA,GAAmB,uBAAA;AAAA,IACvB,KAAA,CAAM,KAAA;AAAA,IACN;AAAA,GACF;AACA,EAAA,MAAM,cAAA,GAAiB,yBAAA;AAAA,IACrB,gBAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,MAAM,aAAA,GAAgB;AAAA,IACpB,GAAA,EAAK,KAAA;AAAA,IAEL,OAAA;AAAA,IACA,cAAA;AAAA,IACA,GAAI,cAAA,KAAmB,MAAA,GAAY,EAAC,GAAI,EAAE,cAAA,EAAe;AAAA,IACzD,GAAI,eAAA,KAAoB,MAAA,GAAY,EAAC,GAAI,EAAE,eAAA,EAAgB;AAAA,IAC3D,GAAI,iBAAA,KAAsB,MAAA,GAAY,EAAC,GAAI,EAAE,iBAAA;AAAkB,GACjE;AACA,EAAA,OAAO,oCAAoC,aAAa,CAAA;AAC1D;AAEA,SAAS,kCAAA,CACP,EAAA,EACA,OAAA,EACA,OAAA,EACA,gBACA,cAAA,EACiB;AACjB,EAAA,IAAI,WAAA,GAA+B;AAAA,IACjC,IAAI,cAAA,EAAe;AAAA,IACnB,IAAA,EAAM,qCAAA;AAAA,MACJ,EAAA,CAAG,IAAA;AAAA,MACH,OAAA;AAAA,MACA,OAAA;AAAA,MACA,cAAA;AAAA,MACA;AAAA,KACF;AAAA,IACA,EAAA,EAAI,QAAA;AAAA,IACJ,UAAU,EAAA,CAAG,QAAA;AAAA,IACb,KAAA,EAAO,qCAAA;AAAA,MACL,EAAA,CAAG,KAAA;AAAA,MACH,OAAA;AAAA,MACA,OAAA;AAAA,MACA,cAAA;AAAA,MACA;AAAA;AACF,GACF;AAEA,EAAA,IAAI,GAAG,OAAA,KAAY,MAAA,IAAa,EAAA,CAAG,OAAA,CAAQ,SAAS,CAAA,EAAG;AACrD,IAAA,WAAA,GAAc;AAAA,MACZ,IAAI,cAAA,EAAe;AAAA,MACnB,KAAA,EAAO,WAAA;AAAA,MACP,EAAA,EAAI,MAAA;AAAA,MACJ,SAAS,EAAA,CAAG;AAAA,KACd;AAAA,EACF;AAEA,EAAA,IAAI,EAAA,CAAG,KAAA,KAAU,MAAA,IAAa,EAAA,CAAG,WAAW,MAAA,EAAW;AACrD,IAAA,MAAM,eAAA,GAAkB;AAAA,MACtB,IAAI,cAAA,EAAe;AAAA,MACnB,KAAA,EAAO,WAAA;AAAA,MACP,EAAA,EAAI;AAAA,KACN;AACA,IAAA,IAAI,EAAA,CAAG,KAAA,KAAU,MAAA,IAAa,EAAA,CAAG,WAAW,MAAA,EAAW;AACrD,MAAA,WAAA,GAAc,EAAE,GAAG,eAAA,EAAiB,KAAA,EAAO,GAAG,KAAA,EAAO,MAAA,EAAQ,GAAG,MAAA,EAAO;AAAA,IACzE,CAAA,MAAA,IAAW,EAAA,CAAG,KAAA,KAAU,MAAA,EAAW;AACjC,MAAA,WAAA,GAAc,EAAE,GAAG,eAAA,EAAiB,MAAA,EAAQ,GAAG,MAAA,EAAQ;AAAA,IACzD,CAAA,MAAO;AACL,MAAA,WAAA,GAAc,EAAE,GAAG,eAAA,EAAiB,KAAA,EAAO,GAAG,KAAA,EAAM;AAAA,IACtD;AAAA,EACF;AAEA,EAAA,OAAO,WAAA;AACT;AAEO,SAAS,gCACd,KAAA,EACa;AACb,EAAA,MAAM,iBAAiB,uBAAA,EAAwB;AAC/C,EAAA,OAAO;AAAA,IACL,QAAA,EAAU;AAAA,MACR,SAAS,KAAA,CAAM,OAAA;AAAA,MACf,SAAS,KAAA,CAAM;AAAA,KACjB;AAAA,IACA,MAAM,mCAAA,CAAoC;AAAA,MACxC,GAAG,KAAA;AAAA,MACH;AAAA,KACD;AAAA,GACH;AACF;AAEO,SAAS,iCACd,KAAA,EACa;AACb,EAAA,MAAM,iBAAiB,uBAAA,EAAwB;AAC/C,EAAA,OAAO;AAAA,IACL,QAAA,EAAU;AAAA,MACR,SAAS,KAAA,CAAM,OAAA;AAAA,MACf,SAAS,KAAA,CAAM;AAAA,KACjB;AAAA,IACA,MAAM,oCAAA,CAAqC;AAAA,MACzC,GAAG,KAAA;AAAA,MACH;AAAA,KACD;AAAA,GACH;AACF;AAEO,SAAS,+BACd,KAAA,EACa;AACb,EAAA,MAAM,iBAAiB,uBAAA,EAAwB;AAC/C,EAAA,OAAO;AAAA,IACL,QAAA,EAAU;AAAA,MACR,SAAS,KAAA,CAAM,OAAA;AAAA,MACf,SAAS,KAAA,CAAM;AAAA,KACjB;AAAA,IACA,IAAA,EAAM,kCAAA;AAAA,MACJ,KAAA,CAAM,EAAA;AAAA,MACN,KAAA,CAAM,OAAA;AAAA,MACN,KAAA,CAAM,OAAA;AAAA,MACN,cAAA;AAAA,MACA,KAAA,CAAM;AAAA;AACR,GACF;AACF;;;ACncO,IAAM,mBAAA,GAAsB;AAQ5B,IAAM,4BAAA,GAA+B;AAE5C,IAAM,0BAAA,uBAAiC,GAAA,EAAY;AAYnD,SAAS,6BAAA,CACP,GAAA,EACA,OAAA,EACA,GAAA,EACyB;AACzB,EAAA,IAAI,KAAA,GAAiC;AAAA,IACnC,GAAA;AAAA,IACA,GAAA;AAAA,IACA,OAAA;AAAA,IACA,WAAA,EAAa,MAAA;AAAA,IACb,sBAAA,EAAwB,MAAA;AAAA,IACxB,kBAAA,EAAoB,MAAA;AAAA,IACpB,SAAA,EAAW;AAAA,GACb;AAEA,EAAA,MAAM,sBAAA,GAAyB,gBAAgB,KAAA,EAAO;AAAA,IACpD,IAAA,EAAM,qBAAA;AAAA,IACN,QAAQ,YAAA,EAAuC;AAC7C,MAAA,OAAO,kCAAA,CAAmC,aAAa,GAAG,CAAA;AAAA,IAC5D,CAAA;AAAA,IACA,MAAA,CAAO,cAAc,SAAA,EAAoC;AACvD,MAAA,OAAO;AAAA,QACL,GAAG,YAAA;AAAA,QACH;AAAA,OACF;AAAA,IACF;AAAA,GACD,CAAA;AACD,EAAA,KAAA,GAAQ,sBAAA,CAAuB,KAAA;AAE/B,EAAA,MAAM,YAAA,GAAe,gBAAgB,KAAA,EAAO;AAAA,IAC1C,IAAA,EAAM,kBAAA;AAAA,IACN,QAAQ,YAAA,EAAkC;AACxC,MAAA,OAAO,wBAAA;AAAA,QACL,YAAA,CAAa,GAAA;AAAA,QACb,YAAA,CAAa,GAAA,CAAI,OAAA,CAAQ,gBAAA;AAAiB,OAC5C;AAAA,IACF,CAAA;AAAA,IACA,MAAA,CAAO,cAAc,kBAAA,EAA6C;AAChE,MAAA,OAAO;AAAA,QACL,GAAG,YAAA;AAAA,QACH;AAAA,OACF;AAAA,IACF;AAAA,GACD,CAAA;AACD,EAAA,KAAA,GAAQ,YAAA,CAAa,KAAA;AAErB,EAAA,MAAM,iBAAA,GAAoB,gBAAgB,KAAA,EAAO;AAAA,IAC/C,IAAA,EAAM,gBAAA;AAAA,IACN,QAAQ,YAAA,EAAkD;AACxD,MAAA,MAAM,YAAY,YAAA,CAAa,SAAA;AAC/B,MAAA,IAAI,cAAc,MAAA,EAAW;AAC3B,QAAA,MAAM,IAAI,sBAAA;AAAA,UACR;AAAA,SACF;AAAA,MACF;AACA,MAAA,OAAO,6BAAA,CAA8B,YAAA,CAAa,GAAA,EAAK,SAAS,CAAA;AAAA,IAClE,CAAA;AAAA,IACA,MAAA,CAAO,cAAc,sBAAA,EAAiD;AACpE,MAAA,OAAO;AAAA,QACL,GAAG,YAAA;AAAA,QACH;AAAA,OACF;AAAA,IACF;AAAA,GACD,CAAA;AACD,EAAA,KAAA,GAAQ,iBAAA,CAAkB,KAAA;AAE1B,EAAA,MAAM,eAAA,GAAkB,gBAAgB,KAAA,EAAO;AAAA,IAC7C,IAAA,EAAM,cAAA;AAAA,IACN,QAAQ,YAAA,EAA2B;AACjC,MAAA,MAAM,aAAA,GAAgB;AAAA,QACpB,KAAK,YAAA,CAAa,GAAA;AAAA,QAClB,OAAA,EAAS,YAAA,CAAa,GAAA,CAAI,OAAA,CAAQ,IAAA;AAAA,QAClC,SAAS,YAAA,CAAa,OAAA;AAAA,QACtB,GAAI,aAAa,SAAA,KAAc,MAAA,GAC7B,EAAC,GACD,EAAE,SAAA,EAAW,YAAA,CAAa,SAAA;AAAU,OACxC;AACA,MAAA,OAAO,iCAAiC,aAAa,CAAA;AAAA,IACvD,CAAA;AAAA,IACA,MAAA,CAAO,cAAc,WAAA,EAAsC;AACzD,MAAA,OAAO;AAAA,QACL,GAAG,YAAA;AAAA,QACH;AAAA,OACF;AAAA,IACF;AAAA,GACD,CAAA;AACD,EAAA,KAAA,GAAQ,eAAA,CAAgB,KAAA;AAExB,EAAA,OAAO,KAAA;AACT;AAcO,SAAS,0BAAA,CACd,GAAA,EACA,OAAA,EACA,GAAA,EACK;AACL,EAAA,MAAM,QAAA,GAAW,GAAA,CAAI,OAAA,CAAQ,YAAA,CAAa,sBAAA;AAC1C,EAAA,MAAM,OAAA,GAAU,kCAAkC,QAAQ,CAAA;AAC1D,EAAA,OAAO,OAAA,CAAQ,GAAA,EAAK,OAAA,EAAS,GAAG,CAAA;AAClC;AAQA,IAAM,iCAAA,GAGF;AAAA,EACF,aAAA,EAAe;AACjB,CAAA;AAEA,SAAS,kDAAA,CACP,GAAA,EACA,OAAA,EACA,GAAA,EACK;AACL,EAAA,MAAM,SAAA,GAAY,6BAAA,CAA8B,GAAA,EAAK,OAAA,EAAS,GAAG,CAAA;AAEjE,EAAA,MAAM,EAAE,SAAQ,GAAI,GAAA;AACpB,EAAA,MAAM;AAAA,IACJ,WAAA;AAAA,IACA,sBAAA;AAAA,IACA,kBAAA;AAAA,IACA,SAAA,EAAW;AAAA,GACb,GAAI,SAAA;AAEJ,EAAA,IAAI,uBAAuB,MAAA,EAAW;AACpC,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR;AAAA,KACF;AAAA,EACF;AACA,EAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR;AAAA,KACF;AAAA,EACF;AACA,EAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR;AAAA,KACF;AAAA,EACF;AAGA,EAAA,MAAM,YAAA,GAAe,mBAAA;AAAA,IACnB,GAAA;AAAA,IACA,WAAA;AAAA,IACA,OAAA;AAAA,IACA,GAAA;AAAA,IACA,sBAAA;AAAA,IACA;AAAA,GACF;AAGA,EAAA,MAAM,UAAA,GAAa,0BAAA,CAA2B,GAAA,EAAK,WAAA,EAAa,OAAO,CAAA;AAGvE,EAAA,MAAM,QAAA,GAAW,YAAY,cAAA,CAAe,QAAA;AAC5C,EAAA,MAAM,WAAA,GACJ,WAAW,CAAA,GAAIT,GAAAA,CAAAA,eAAAA,EAAqB,QAAQ,CAAA,CAAA,GAAKA,GAAAA,CAAI,IAAI,EAAE,CAAA;AAG7D,EAAA,MAAM,OAAA,GAAU,uBAAA,CAAwB,GAAA,EAAK,OAAO,CAAA;AACpD,EAAA,MAAM,WAAA,GAAc,mBAAmB,GAAG,CAAA;AAE1C,EAAA,OAAO,qBAAA,CAAsB;AAAA,IAC3B,WAAA;AAAA,IACA,GAAI,WAAA,KAAgB,MAAA,GAAY,EAAC,GAAI,EAAE,WAAA,EAAY;AAAA,IACnD,WAAA;AAAA,IACA,GAAI,OAAA,KAAY,MAAA,GAAY,EAAC,GAAI,EAAE,OAAA,EAAQ;AAAA,IAC3C,UAAA;AAAA,IACA;AAAA,GACD,CAAA;AACH;AAKO,SAAS,2BAA2B,GAAA,EAAwB;AACjE,EAAA,OAAO,IAAI,UAAA,CAAW,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,mBAAmB,MAAS,CAAA;AAClE;AASA,SAAS,oBACP,GAAA,EACA,SAAA,EACA,OAAA,EACA,GAAA,EACA,wBACA,kBAAA,EACK;AACL,EAAA,MAAM,EAAE,SAAQ,GAAI,GAAA;AACpB,EAAA,MAAM,UAAA,GAAa,IAAI,KAAA,CAAM,KAAA;AAC7B,EAAA,MAAM,UAAA,GAAa,IAAI,KAAA,CAAM,KAAA;AAC7B,EAAA,MAAM,YAAY,SAAA,CAAU,SAAA;AAC5B,EAAA,MAAM,kBAAkB,CAAC,GAAG,IAAI,GAAA,CAAI,SAAA,CAAU,SAAS,CAAC,CAAA;AACxD,EAAA,MAAM,gBAAA,GACJ,SAAA,CAAU,gBAAA,KAAqB,MAAA,GAC7B,EAAC,GACD,CAAC,GAAG,IAAI,GAAA,CAAI,SAAA,CAAU,gBAAgB,CAAC,CAAA;AAC3C,EAAA,MAAM,4BAAA,GACJ,QAAQ,YAAA,CAAa,qCAAA;AACvB,EAAA,MAAM,YAAY,SAAA,CAAU,SAAA;AAC5B,EAAA,MAAM,iBAAA,GAAoB,CAAC,mBAAG,IAAI,GAAA,CAAI,CAAC,GAAG,UAAA,EAAY,GAAG,SAAS,CAAC,CAAC,CAAA;AACpE,EAAA,MAAM,YAAY,SAAA,CAAU,SAAA;AAC5B,EAAA,MAAM,KAAK,SAAA,CAAU,cAAA;AACrB,EAAA,MAAM,uBAAA,GAA0B,GAAG,WAAA,KAAgB,OAAA;AACnD,EAAA,MAAM,eAAA,GAAkB,uBAAA,IAA2B,EAAA,CAAG,SAAA,KAAc,MAAA;AACpE,EAAA,MAAM,4BAAA,mBAA+B,IAAI,GAAA,CAAY,CAAC,IAAI,CAAC,CAAA;AAC3D,EAAA,IAAI,iBAAA,CAAkB,SAAS,CAAA,EAAG;AAChC,IAAA,4BAAA,CAA6B,IAAI,MAAM,CAAA;AAAA,EACzC;AACA,EAAA,MAAM,uBACJ,sBAAA,GACG,sBAAA,CAAuB,GAAA,CAAI,UAAU,KAAK,sBAAA,GAC3C,MAAA;AACJ,EAAA,MAAM,sBACJ,sBAAA,GACG,sBAAA,CAAuB,GAAA,CAAI,SAAS,KAAK,sBAAA,GAC1C,MAAA;AACJ,EAAA,MAAM,oBAAA,GAAuB,iCAAA;AAAA,IAC3B,IAAA;AAAA,IACA,UAAA;AAAA,IACA,oBAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,MAAM,yBAAA,GAA4B,wCAAA;AAAA,IAChC,UAAA;AAAA,IACA,oBAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,MAAM,mBAAA,GAAsB,iCAAA;AAAA,IAC1B,IAAA;AAAA,IACA,SAAA;AAAA,IACA,mBAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,MAAM,wBAAA,GAA2B,iCAAA;AAAA,IAC/B,GAAA;AAAA,IACA,SAAA;AAAA,IACA,mBAAA;AAAA,IACA;AAAA,GACF;AAEA,EAAA,MAAM,eAAA,GAAkBU,kBAAAA,CAAkB,UAAA,EAAY,SAAS,CAAA;AAC/D,EAAA,MAAM,cAAA,GAAiBA,kBAAAA,CAAkB,SAAA,EAAW,QAAQ,CAAA;AAE5D,EAAA,MAAM,mBAAA,GAAsB,kBAAA,CAAmB,QAAA,CAAS,IAAI,CAAA;AAC5D,EAAA,MAAM,kBAAA,GAAqB,kBAAA,CAAmB,QAAA,CAAS,GAAG,CAAA;AAC1D,EAAA,MAAM,kBAAA,GAAqB,kBAAA,CAAmB,QAAA,CAAS,GAAG,CAAA;AAG1D,EAAA,MAAM,YAAA,GAAe,EAAE,GAAG,GAAA,EAAK,iBAAiB,EAAA,EAAG;AACnD,EAAA,MAAM,eAAA,GAAkB,qBAAA,CAAsB,GAAA,EAAK,UAAA,EAAY,YAAY,CAAA;AAG3E,EAAA,MAAM,WAAA,GAAc,EAAE,GAAG,GAAA,EAAK,iBAAiB,GAAA,EAAI;AACnD,EAAA,MAAM,cAAA,GAAiB,qBAAA;AAAA,IACrB,GAAA;AAAA,IACA,SAAA,CAAU,SAAA;AAAA,IACV;AAAA,GACF;AAGA,EAAA,MAAM,aAAA,GAAgB,EAAE,GAAG,GAAA,EAAK,iBAAiB,GAAA,EAAI;AACrD,EAAA,MAAM,oBAAA,GAAuB,qBAAA;AAAA,IAC3B,GAAA;AAAA,IACA,SAAA;AAAA,IACA;AAAA,GACF;AAKA,EAAA,IAAI,EAAA,CAAG,WAAW,4BAAA,EAA8B;AAC9C,IAAA,MAAM,IAAI,yBAAA;AAAA,MACR,CAAA,4BAAA,EAA+B,EAAA,CAAG,QAAQ,CAAA,oCAAA,EAAuC,4BAA4B,CAAA;AAAA,KAC/G;AAAA,EACF;AACA,EAAA,MAAM,iBAAA,GAAoB,EAAA,CAAG,QAAA,GAAW,CAAA,GAAI,GAAG,QAAA,GAAW,mBAAA;AAC1D,EAAA,MAAM,iBAAA,GAAoBV,gBAAgB,iBAAiB,CAAA,CAAA;AAE3D,EAAA,MAAM,UAAA,GACJ,uBAAA,GACE,OAAA,CAAQ,UAAA,CAAWA,GAAAA,CAAI,GAAA,CAAI,MAAM,CAAA,EAAGA,GAAAA,CAAI,GAAA,CAAI,QAAQ,CAAC,CAAA,GACrD,MAAA;AACJ,EAAA,MAAM,WAAA,GACJ,kBAAkB,OAAA,CAAQ,cAAA,CAAeA,IAAI,GAAA,CAAI,OAAO,CAAC,CAAA,GAAI,MAAA;AAC/D,EAAA,MAAM,aAAA,GACJ,eAAA,GACE,OAAA,CAAQ,UAAA,CAAWA,GAAAA,CAAI,GAAA,CAAI,QAAQ,CAAA,EAAGA,GAAAA,CAAI,GAAA,CAAI,MAAM,CAAC,CAAA,GACrD,MAAA;AAGJ,EAAA,MAAM,gBAAA,GAAmB;AAAA,IACvBA,oBAAoB,OAAO,CAAA,CAAA;AAAA,IAC3B,eAAA;AAAA,IACA,mBAAA;AAAA,IACA,GAAG;AAAA,GACL;AAEA,EAAA,MAAM,yBAAA,GAAmC;AAAA,IACvCA,mBAAmB,OAAO,CAAA,CAAA;AAAA,IAC1B,cAAA;AAAA,IACA,kBAAA;AAAA,IACA,kBAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,IAAA,yBAAA,CAA0B,KAAK,UAAU,CAAA;AAAA,EAC3C;AACA,EAAA,yBAAA,CAA0B,IAAA,CAAK,GAAG,cAAA,EAAgB,GAAG,oBAAoB,CAAA;AAEzE,EAAA,SAASW,wBACP,MAAA,EAQK;AACL,IAAA,MAAM,sBAAA,GAAyB;AAAA,MAC7B,GAAG,yBAAA;AAAA,MACHD,kBAAAA,CAAkB,MAAA,CAAO,SAAA,EAAW,QAAQ,CAAA;AAAA,MAC5CA,kBAAAA,CAAkB,iBAAA,EAAmB,CAAA,EAAA,EAAK,MAAA,CAAO,aAAa,CAAA,CAAE,CAAA;AAAA,MAChEA,kBAAAA,CAAkB,SAAA,EAAW,CAAA,EAAA,EAAK,MAAA,CAAO,eAAe,CAAA,CAAE;AAAA,KAC5D;AAEA,IAAA,IAAI,MAAA,CAAO,mBAAmB,MAAA,EAAW;AACvC,MAAA,sBAAA,CAAuB,IAAA,CAAK,OAAO,cAAc,CAAA;AAAA,IACnD;AAEA,IAAA,MAAM,sBAAA,GAAyB;AAAA,MAC7B,GAAG,yBAAA;AAAA,MACH,GAAG,wBAAA;AAAA,MACHV,GAAAA,CAAAA,oBAAAA;AAAA,KACF;AACA,IAAA,IAAI,kBAAkB,MAAA,EAAW;AAC/B,MAAA,sBAAA,CAAuB,IAAA,CAAKA,GAAAA,CAAAA,EAAM,aAAa,CAAA,QAAA,CAAU,CAAA;AAAA,IAC3D;AACA,IAAA,MAAM,oBAAA,GAA8B;AAAA,MAClCA,GAAAA,CAAAA,EAAAA,EAAQA,GAAAA,CAAI,GAAA,CAAI,MAAA,CAAO,SAAS,CAAC,CAAA,KAAA,EAAQA,GAAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,GAAA;AAAA,KAC7D;AACA,IAAA,IAAI,iBAAA,CAAkB,SAAS,CAAA,EAAG;AAChC,MAAA,oBAAA,CAAqB,IAAA;AAAA,QACnBA,GAAAA,CAAAA,EAAAA,EAAQA,GAAAA,CAAI,GAAA,CAAI,MAAA,CAAO,aAAa,CAAC,CAAA,KAAA,EAAQA,GAAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,KAAA;AAAA,OACjE;AAAA,IACF;AAEA,IAAA,IAAI,4BAAA,EAA8B;AAChC,MAAA,MAAM,qBAAA,GAAwB;AAAA,QAC5B,GAAG,oBAAA;AAAA,QACH,GAAG;AAAA,OACL;AAEA,MAAA,OAAOA,GAAAA;AAAA,eAAA,EACIA,GAAAA,CAAI,IAAA,CAAK,sBAAA,EAAwBA,GAAAA,CAAAA,EAAAA,CAAO,CAAC;AAAA;AAAA,mBAAA,EAErC,GAAA,CAAI,OAAO,UAAU,CAAA;AAAA,aAAA,EAC3B,GAAA,CAAI,OAAO,UAAU,CAAA;AAAA,uBAAA,EACXA,GAAAA,CAAI,GAAA,CAAI,MAAA,CAAO,WAAW,CAAC;AAAA,yBAAA,EACzBA,GAAAA,CAAI,GAAA,CAAI,MAAA,CAAO,eAAe,CAAC;AAAA,cAAA,EAC1CA,GAAAA,CAAI,IAAA,CAAK,qBAAA,EAAuBA,GAAAA,CAAAA,KAAAA,CAAU,CAAC;AAAA,MAAA,CAAA;AAAA,IAEvD;AAEA,IAAA,OAAOA,GAAAA;AAAA,aAAA,EACIA,GAAAA,CAAI,IAAA,CAAK,sBAAA,EAAwBA,GAAAA,CAAAA,EAAAA,CAAO,CAAC;AAAA;AAAA,WAAA,EAE3C,GAAA,CAAI,OAAO,UAAU,CAAA,MAAA,EAASA,IAAI,IAAA,CAAK,oBAAA,EAAsBA,UAAU,CAAC;AAAA,WAAA,EACxE,GAAA,CAAI,OAAO,UAAU,CAAA;AAAA,qBAAA,EACXA,GAAAA,CAAI,GAAA,CAAI,MAAA,CAAO,WAAW,CAAC;AAAA,uBAAA,EACzBA,GAAAA,CAAI,GAAA,CAAI,MAAA,CAAO,eAAe,CAAC;AAAA,YAAA,EAC1CA,GAAAA,CAAI,IAAA,CAAK,sBAAA,EAAwBA,GAAAA,CAAAA,KAAAA,CAAU,CAAC;AAAA,IAAA,CAAA;AAAA,EAExD;AAEA,EAAA,MAAM,eAAA,GAAkB,SAAA,KAAc,KAAA,GAAQ,SAAA,GAAY,OAAA;AAC1D,EAAA,MAAM,iBAAA,GAAoB,SAAA,KAAc,KAAA,GAAQ,OAAA,GAAU,SAAA;AAC1D,EAAA,MAAM,mBAAA,GAAsB,SAAA,KAAc,KAAA,GAAQ,WAAA,GAAc,SAAA;AAChE,EAAA,MAAM,qBAAA,GAAwB,SAAA,KAAc,KAAA,GAAQ,SAAA,GAAY,WAAA;AAEhE,EAAA,MAAM,eAAeW,uBAAAA,CAAuB;AAAA,IAC1C,SAAA,EAAW,eAAA;AAAA,IACX,WAAA,EAAa,iBAAA;AAAA,IACb,aAAA,EAAe,mBAAA;AAAA,IACf,eAAA,EAAiB,qBAAA;AAAA,IACjB,SAAA,EAAW;AAAA,GACZ,CAAA;AAED,EAAA,SAAS,6BAAA,GAAqC;AAC5C,IAAA,MAAM,gBAAA,GAAmB,SAAA,KAAc,KAAA,GAAQ,OAAA,GAAU,SAAA;AACzD,IAAA,MAAM,kBAAA,GAAqB,SAAA,KAAc,KAAA,GAAQ,SAAA,GAAY,OAAA;AAC7D,IAAA,MAAM,oBAAA,GAAuB,SAAA,KAAc,KAAA,GAAQ,SAAA,GAAY,WAAA;AAC/D,IAAA,MAAM,sBAAA,GACJ,SAAA,KAAc,KAAA,GAAQ,WAAA,GAAc,SAAA;AACtC,IAAA,MAAM,mBAAmB,gBAAA,CAAiB,MAAA;AAAA,MAAO,CAAC,IAAA,KAChD,eAAA,CAAgB,QAAA,CAAS,IAAI;AAAA,KAC/B;AAEA,IAAA,MAAM,cAAA,GACJ,iBAAiB,MAAA,GAAS,CAAA,GACxBX,mCAAmCU,kBAAAA,CAAkB,gBAAA,EAAkB,QAAQ,CAAC,CAAA,CAAA,CAAA,GAChF,MAAA;AAEJ,IAAA,MAAM,gBAAgBC,uBAAAA,CAAuB;AAAA,MAC3C,SAAA,EAAW,gBAAA;AAAA,MACX,WAAA,EAAa,kBAAA;AAAA,MACb,aAAA,EAAe,oBAAA;AAAA,MACf,eAAA,EAAiB,sBAAA;AAAA,MACjB,SAAA,EAAW,gBAAA;AAAA,MACX;AAAA,KACD,CAAA;AAED,IAAA,OAAOX,GAAAA;AAAA,MAAA,EACH,YAAY;AAAA;AAAA,MAAA,EAEZ,aAAa;AAAA,IAAA,CAAA;AAAA,EAEnB;AAEA,EAAA,MAAM,kBAAA,GACJ,gBAAA,CAAiB,MAAA,KAAW,CAAA,GAC1B,eACA,6BAAA,EAA8B;AAClC,EAAA,MAAM,iBAAA,GAAoB;AAAA,IACxB,GAAG,oBAAA;AAAA,IACH,GAAG,mBAAA;AAAA,IACHA,GAAAA,CAAAA,UAAAA;AAAA,GACF;AACA,EAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,IAAA,iBAAA,CAAkB,IAAA,CAAKA,GAAAA,CAAAA,EAAM,WAAW,CAAA,QAAA,CAAU,CAAA;AAAA,EACpD;AAEA,EAAA,OAAOA,GAAAA;AAAA;AAAA;AAAA,aAAA,EAGMA,GAAAA,CAAI,IAAA,CAAK,iBAAA,EAAmBA,GAAAA,CAAAA,EAAAA,CAAO,CAAC;AAAA,WAAA,EACtC,GAAA,CAAI,OAAO,UAAU,CAAA;AAAA,YAAA,EACpBA,GAAAA,CAAI,IAAA,CAAK,gBAAA,EAAkBA,GAAAA,CAAAA,KAAAA,CAAU,CAAC;;AAAA;;AAAA;AAAA,MAAA,EAK5C,kBAAkB;AAAA;AAAA,EAAA,CAAA;AAG1B;AAWA,SAASU,kBAAAA,CAAkB,OAA0B,UAAA,EAAyB;AAC5E,EAAA,OAAO,iBAAA,CAAwBV,GAAAA,CAAI,GAAA,CAAI,UAAU,GAAG,KAAK,CAAA;AAC3D;AAMA,SAAS,qBAAA,CACP,GAAA,EACA,KAAA,EACA,GAAA,EACO;AACP,EAAA,OAAO,IAAI,UAAA,CACR,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,gBAAgB,KAAA,IAAS,CAAA,CAAE,eAAe,MAAM,CAAA,CAChE,IAAI,CAAC,CAAA,KAAM,2BAA2B,CAAA,CAAE,UAAA,EAAY,GAAG,CAAC,CAAA;AAC7D;AAMA,SAAS,qBAAA,CACP,GAAA,EACA,SAAA,EACA,GAAA,EACO;AACP,EAAA,OAAO,IAAI,UAAA,CACR,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,gBAAgB,SAAA,IAAa,CAAA,CAAE,eAAe,MAAM,CAAA,CACpE,IAAI,CAAC,CAAA,KAAM,2BAA2B,CAAA,CAAE,UAAA,EAAY,GAAG,CAAC,CAAA;AAC7D;AAEA,SAAS,6BAAA,CACP,KACA,SAAA,EACoC;AACpC,EAAA,MAAM,kBAAkB,GAAA,CAAI,eAAA;AAC5B,EAAA,IAAI,eAAA,KAAoB,MAAA,IAAa,eAAA,CAAgB,MAAA,KAAW,CAAA,EAAG;AACjE,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,sBAAA,uBAA6B,GAAA,EAAyB;AAC5D,EAAA,MAAM,iBAAA,GAAoB;AAAA,IACxB,mBAAG,IAAI,GAAA,CAAI,CAAC,GAAG,GAAA,CAAI,KAAA,CAAM,KAAA,EAAO,GAAG,SAAA,CAAU,SAAS,CAAC;AAAA,GACzD;AAGA,EAAA,iBAAA,CAAkB,sBAAA,EAAwB,SAAA,CAAU,SAAA,EAAW,IAAI,CAAA;AACnE,EAAA,IAAI,iBAAA,CAAkB,SAAS,CAAA,EAAG;AAChC,IAAA,iBAAA,CAAkB,sBAAA,EAAwB,SAAA,CAAU,SAAA,EAAW,MAAM,CAAA;AAAA,EACvE;AAEA,EAAA,KAAA,MAAWH,UAAS,eAAA,EAAiB;AACnC,IAAA,4BAAA,CAA6B,wBAAwBA,MAAK,CAAA;AAAA,EAC5D;AAEA,EAAA,IAAI,IAAI,OAAA,EAAS;AACf,IAAA,KAAA,MAAW,SAAA,IAAa,IAAI,OAAA,EAAS;AACnC,MAAA,sBAAA,CAAuB,sBAAA,EAAwB,UAAU,KAAK,CAAA;AAAA,IAChE;AAAA,EACF;AAEA,EAAA,OAAO,sBAAA;AACT;AAEA,SAAS,iCAAA,CACP,UAAA,EACA,KAAA,EACA,eAAA,EACA,qBAAA,EACO;AACP,EAAA,OAAO,YAAA,CAAa,MAAA;AAAA,IAAO,CAAC,MAAA,KAC1B,mBAAA,CAAoB,eAAA,EAAiB,QAAQ,qBAAqB;AAAA,GACpE,CAAE,GAAA;AAAA,IACA,CAAC,WACCG,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,IAAI,UAAU,CAAC,IAAIA,GAAAA,CAAI,GAAA,CAAI,MAAM,CAAC,CAAA,IAAA,EAAOA,IAAI,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,MAAM,EAAE,CAAC,CAAA;AAAA,GACpF;AACF;AAEA,SAAS,wCAAA,CACP,KAAA,EACA,eAAA,EACA,qBAAA,EACO;AACP,EAAA,OAAO,YAAA,CAAa,MAAA;AAAA,IAAO,CAAC,MAAA,KAC1B,mBAAA,CAAoB,eAAA,EAAiB,QAAQ,qBAAqB;AAAA,GACpE,CAAE,GAAA,CAAI,CAAC,MAAA,KAAW;AAChB,IAAA,MAAM,SAAA,GAAY,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,MAAM,CAAA,CAAA;AACpC,IAAA,OAAOA,GAAAA,CAAAA,EAAAA,EAAQA,IAAI,GAAA,CAAI,SAAS,CAAC,CAAA,IAAA,EAAOA,GAAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,CAAA;AAAA,EAC5D,CAAC,CAAA;AACH;AAKA,SAAS,0BAAA,CACP,GAAA,EACA,SAAA,EACA,OAAA,EACK;AACL,EAAA,IAAI,GAAA,CAAI,eAAA,IAAmB,GAAA,CAAI,eAAA,CAAgB,SAAS,CAAA,EAAG;AACzD,IAAA,OAAO,mCAAA;AAAA,MACL,GAAA,CAAI,eAAA;AAAA,MACJ,GAAA;AAAA,MACA,SAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAEA,EAAA,MAAM,UAAA,GAAa,IAAI,KAAA,CAAM,KAAA;AAC7B,EAAA,MAAM,YAAY,SAAA,CAAU,SAAA;AAC5B,EAAA,MAAM,KAAK,SAAA,CAAU,cAAA;AAErB,EAAA,MAAM,MAAA,GAAgB;AAAA;AAAA,IAEpBA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,GAAA,CAAA;AAAA,IACzBA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,KAAA,CAAA;AAAA,IACzBA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,MAAA,CAAA;AAAA,IACzBA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,QAAA,CAAA;AAAA,IACzBA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,WAAA,CAAA;AAAA,IACzBA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,SAAA,CAAA;AAAA,IACzBA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,WAAA,CAAA;AAAA,IACzBA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,WAAA,CAAA;AAAA,IACzBA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,WAAA,CAAA;AAAA;AAAA,IAEzBA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,GAAA,CAAA;AAAA,IACxBA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,KAAA,CAAA;AAAA,IACxBA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,MAAA,CAAA;AAAA,IACxBA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,QAAA,CAAA;AAAA,IACxBA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,WAAA,CAAA;AAAA,IACxBA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,SAAA,CAAA;AAAA,IACxBA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,WAAA,CAAA;AAAA,IACxBA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,WAAA,CAAA;AAAA,IACxBA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,WAAA;AAAA,GAC1B;AAEA,EAAA,IAAI,EAAA,CAAG,eAAe,MAAA,EAAW;AAC/B,IAAA,MAAA,CAAO,KAAKA,GAAAA,CAAAA,SAAAA,EAAe,eAAA,CAAgB,EAAA,CAAG,UAAU,CAAC,CAAA,CAAE,CAAA;AAAA,EAC7D;AAEA,EAAA,IAAI,EAAA,CAAG,cAAc,MAAA,EAAW;AAC9B,IAAA,MAAA,CAAO,KAAKA,GAAAA,CAAAA,QAAAA,EAAc,eAAA,CAAgB,EAAA,CAAG,SAAS,CAAC,CAAA,CAAE,CAAA;AAAA,EAC3D;AAEA,EAAA,OAAOA,GAAAA,CAAI,IAAA,CAAK,MAAA,EAAQA,GAAAA,CAAAA,EAAAA,CAAO,CAAA;AACjC;AAEA,SAAS,mCAAA,CACP,MAAA,EACA,GAAA,EACA,SAAA,EACA,OAAA,EACK;AACL,EAAA,MAAM,cAAA,uBAAqB,GAAA,CAAI,CAAC,IAAI,KAAA,CAAM,KAAA,EAAO,SAAA,CAAU,SAAS,CAAC,CAAA;AAErE,EAAA,MAAM,OAAA,GAAiB,MAAA,CAAO,GAAA,CAAI,CAACH,MAAAA,KAAU;AAC3C,IAAA,IAAI,CAAC,cAAA,CAAe,GAAA,CAAIA,MAAAA,CAAM,KAAK,CAAA,EAAG;AACpC,MAAA,MAAM,IAAI,yBAAA;AAAA,QACR,CAAA,sEAAA,EAAyEA,OAAM,KAAK,CAAA,CAAA;AAAA,OACtF;AAAA,IACF;AAEA,IAAA,IAAIA,OAAM,aAAA,EAAe;AACvB,MAAA,MAAM,QAAA,GAAW,+BAAA,CAAgCA,MAAAA,CAAM,KAAK,CAAA;AAC5D,MAAA,OAAOG,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAGH,OAAM,KAAK,CAAA,CAAA,EAAI,QAAQ,CAAA,CAAE,CAAC,CAAA,IAAA,EAAO,eAAA,CAAgBA,MAAAA,CAAM,UAAU,CAAC,CAAA,CAAA;AAAA,IAC5F;AAEA,IAAA,MAAM,SAASG,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAGH,MAAAA,CAAM,KAAK,CAAA,MAAA,CAAQ,CAAA;AAC7C,IAAA,MAAM,YAAY,uBAAA,CAAwB;AAAA,MACxC,MAAA;AAAA,MACA,OAAA;AAAA,MACA,OAAA,EAAS,WAAA,CAAY,CAACA,MAAAA,CAAM,KAAK,CAAC,CAAA;AAAA,MAClC,WAAWA,MAAAA,CAAM;AAAA,KAClB,CAAA;AACD,IAAA,OAAOG,MAAM,SAAS,CAAA,IAAA,EAAO,eAAA,CAAgBH,MAAAA,CAAM,UAAU,CAAC,CAAA,CAAA;AAAA,EAChE,CAAC,CAAA;AAGD,EAAA,MAAM,KAAK,SAAA,CAAU,cAAA;AACrB,EAAA,IAAI,EAAA,CAAG,eAAe,MAAA,EAAW;AAC/B,IAAA,OAAA,CAAQ,KAAKG,GAAAA,CAAAA,SAAAA,EAAe,eAAA,CAAgB,EAAA,CAAG,UAAU,CAAC,CAAA,CAAE,CAAA;AAAA,EAC9D;AACA,EAAA,IAAI,EAAA,CAAG,cAAc,MAAA,EAAW;AAC9B,IAAA,OAAA,CAAQ,KAAKA,GAAAA,CAAAA,QAAAA,EAAc,eAAA,CAAgB,EAAA,CAAG,SAAS,CAAC,CAAA,CAAE,CAAA;AAAA,EAC5D;AAEA,EAAA,OAAOA,GAAAA,CAAI,IAAA,CAAK,OAAA,EAASA,GAAAA,CAAAA,EAAAA,CAAO,CAAA;AAClC;AAKA,SAAS,uBAAA,CACP,KACA,OAAA,EACiB;AACjB,EAAA,IAAI,CAAC,GAAA,CAAI,OAAA,IAAW,GAAA,CAAI,OAAA,CAAQ,WAAW,CAAA,EAAG;AAC5C,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,QAAe,EAAC;AAEtB,EAAA,KAAA,MAAW,SAAA,IAAa,IAAI,OAAA,EAAS;AACnC,IAAA,MAAM,SAAA,GAAY,UAAU,KAAA,CAAM,SAAA;AAClC,IAAA,IAAI,SAAA,KAAc,OAAA,IAAW,SAAA,KAAc,QAAA,EAAU;AACnD,MAAA,MAAM,IAAI,yBAAA;AAAA,QACR;AAAA,OACF;AAAA,IACF;AACA,IAAA,MAAMH,MAAAA,GAAQ,iBAAA,CAAkB,SAAA,CAAU,KAAA,EAAO,SAAS,SAAS,CAAA;AACnE,IAAA,MAAM,YAAYG,GAAAA,CAAI,GAAA,CAAI,SAAA,CAAU,SAAA,CAAU,aAAa,CAAA;AAC3D,IAAA,MAAM,QACJ,SAAA,CAAU,KAAA,KAAU,SAAA,CAAU,SAAA,KAAc,QAAQ,MAAA,GAAS,OAAA,CAAA;AAC/D,IAAA,MAAM,iBAAiBA,GAAAA,CAAI,GAAA,CAAI,KAAA,KAAU,OAAA,GAAU,SAAS,KAAK,CAAA;AAEjE,IAAA,KAAA,CAAM,IAAA;AAAA,MACJA,GAAAA,CAAAA,CAAAA,EAAOH,MAAK,CAAA,UAAA,EAAa,cAAc,CAAA,CAAA;AAAA,MACvCG,GAAAA,CAAAA,EAAMH,MAAK,CAAA,CAAA,EAAI,SAAS,CAAA;AAAA,KAC1B;AAAA,EACF;AAEA,EAAA,OAAOG,GAAAA,CAAAA,SAAAA,EAAeA,GAAAA,CAAI,IAAA,CAAK,KAAA,EAAOA,OAAO,CAAC,CAAA,CAAA;AAChD;AAKA,SAAS,mBAAmB,GAAA,EAAgC;AAC1D,EAAA,MAAM,QAAe,EAAC;AAEtB,EAAA,IAAI,GAAA,CAAI,UAAU,MAAA,EAAW;AAC3B,IAAA,KAAA,CAAM,IAAA,CAAKA,GAAAA,CAAAA,MAAAA,EAAY,GAAA,CAAI,KAAK,CAAA,CAAE,CAAA;AAAA,EACpC;AACA,EAAA,IAAI,GAAA,CAAI,WAAW,MAAA,EAAW;AAC5B,IAAA,KAAA,CAAM,IAAA,CAAKA,GAAAA,CAAAA,OAAAA,EAAa,GAAA,CAAI,MAAM,CAAA,CAAE,CAAA;AAAA,EACtC;AAEA,EAAA,OAAO,MAAM,MAAA,GAAS,CAAA,GAAIA,IAAI,IAAA,CAAK,KAAA,EAAOA,MAAM,CAAA,GAAI,MAAA;AACtD;;;ACnxBO,SAAS,gBAAgB,KAAA,EAAyB;AACvD,EAAA,OAAO,KAAA,KAAU,OAAO,MAAA,GAAY,KAAA;AACtC;AAEO,SAAS,mBAAA,CACd,OACA,QAAA,EACS;AACT,EAAA,MAAM,UAAA,GAAa,gBAAgB,KAAK,CAAA;AACxC,EAAA,IAAI,UAAA,KAAe,QAAW,OAAO,MAAA;AAErC,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,OAAO,UAAA;AAAA,EACT;AAEA,EAAA,OAAO,iBAAA,CAAkB,UAAA,EAAY,QAAA,CAAS,SAAS,CAAA;AACzD;AAEA,SAAS,iBAAA,CAAkB,OAAgB,SAAA,EAA+B;AACxE,EAAA,QAAQ,SAAA;AAAW,IACjB,KAAK,SAAA,EAAW;AACd,MAAA,IAAI,OAAO,KAAA,KAAU,SAAA,EAAW,OAAO,KAAA;AACvC,MAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,OAAO,KAAA,KAAU,CAAA;AAChD,MAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,QAAA,IAAI,KAAA,KAAU,KAAK,OAAO,KAAA;AAC1B,QAAA,IAAI,KAAA,KAAU,KAAK,OAAO,IAAA;AAC1B,QAAA,IAAI,KAAA,CAAM,WAAA,EAAY,KAAM,MAAA,EAAQ,OAAO,IAAA;AAC3C,QAAA,IAAI,KAAA,CAAM,WAAA,EAAY,KAAM,OAAA,EAAS,OAAO,KAAA;AAAA,MAC9C;AACA,MAAA,OAAO,QAAQ,KAAK,CAAA;AAAA,IACtB;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,OAAO,KAAA;AACtC,MAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,QAAA,MAAM,MAAA,GAAS,OAAO,KAAK,CAAA;AAC3B,QAAA,OAAO,MAAA,CAAO,KAAA,CAAM,MAAM,CAAA,GAAI,KAAA,GAAQ,MAAA;AAAA,MACxC;AACA,MAAA,OAAO,KAAA;AAAA,IACT;AAAA,IACA,KAAK,OAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,WAAA,EAAa;AAChB,MAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,OAAO,KAAA;AACtC,MAAA,MAAM,OAAA,GAAU,MAAM,IAAA,EAAK;AAC3B,MAAA,MAAM,YAAY,OAAA,CAAQ,UAAA,CAAW,GAAG,CAAA,IAAK,OAAA,CAAQ,WAAW,GAAG,CAAA;AACnE,MAAA,IAAI,CAAC,WAAW,OAAO,KAAA;AACvB,MAAA,IAAI;AACF,QAAA,OAAO,IAAA,CAAK,MAAM,OAAO,CAAA;AAAA,MAC3B,CAAA,CAAA,MAAQ;AACN,QAAA,OAAO,KAAA;AAAA,MACT;AAAA,IACF;AAAA,IACA,KAAK,QAAA;AAAA,IACL,KAAK,MAAA;AAAA,IACL,KAAK,SAAA,EAAW;AACd,MAAA,OAAO,KAAA;AAAA,IACT;AAAA,IACA,SAAS;AAGP,MAAA,OAAO,KAAA;AAAA,IACT;AAAA;AAEJ;AC7CO,SAAS,kBAAkB,OAAA,EAAwC;AACxE,EAAA,MAAM,SAAA,GAAY,OAAA,CAAQ,WAAA,KAAgB,SAAA,IAAa,OAAA,CAAQ,WAAA;AAC/D,EAAA,MAAM,cAAA,GAAiB,iBAAA;AAAA,IACrBA,GAAAA,CAAI,IAAI,QAAQ,CAAA;AAAA,IAChB,OAAA,CAAQ;AAAA,GACV;AACA,EAAA,MAAM,gBAAA,GAAmB,OAAA,CAAQ,OAAA,CAAQ,gBAAA,EAAiB;AAC1D,EAAA,MAAM,qBAAqB,qBAAA,CAAsB;AAAA,IAC/C,MAAM,OAAA,CAAQ,YAAA;AAAA,IACd,MAAM,OAAA,CAAQ,IAAA;AAAA,IACd,UAAA,EAAY,GAAA;AAAA,IACZ;AAAA,GACD,CAAA;AACD,EAAA,MAAM,qBAAqB,qBAAA,CAAsB;AAAA,IAC/C,MAAM,OAAA,CAAQ,YAAA;AAAA,IACd,MAAM,OAAA,CAAQ,IAAA;AAAA,IACd,UAAA,EAAY,GAAA;AAAA,IACZ;AAAA,GACD,CAAA;AAED,EAAA,MAAM,WAAA,GACJ,YAAY,OAAA,CAAQ,OAAA,CAAQ,eAAeA,GAAAA,CAAI,GAAA,CAAI,MAAM,CAAC,CAAA,GAAI,MAAA;AAChE,EAAA,MAAM,aAAA,GACJ,SAAA,GACE,OAAA,CAAQ,OAAA,CAAQ,UAAA,CAAWA,GAAAA,CAAI,GAAA,CAAI,QAAQ,CAAA,EAAGA,GAAAA,CAAI,GAAA,CAAI,MAAM,CAAC,CAAA,GAC7D,MAAA;AACJ,EAAA,MAAM,UAAA,GACJ,OAAA,CAAQ,WAAA,KAAgB,SAAA,GACtB,QAAQ,OAAA,CAAQ,UAAA,CAAWA,GAAAA,CAAI,GAAA,CAAI,MAAM,CAAA,EAAGA,GAAAA,CAAI,GAAA,CAAI,QAAQ,CAAC,CAAA,GAC7D,MAAA;AAEJ,EAAA,MAAM,WAAA,GAAqB,CAACA,GAAAA,CAAAA,IAAAA,CAAAA,EAAWA,GAAAA,CAAAA,MAAAA,CAAAA,EAAaA,GAAAA,CAAAA,UAAAA,CAAe,CAAA;AACnE,EAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,IAAA,WAAA,CAAY,IAAA,CAAKA,GAAAA,CAAAA,EAAM,WAAW,CAAA,QAAA,CAAU,CAAA;AAAA,EAC9C;AAEA,EAAA,MAAM,WAAWA,GAAAA,CAAAA,OAAAA,EAAaA,GAAAA,CAAI,KAAK,WAAA,EAAaA,GAAAA,CAAAA,EAAAA,CAAO,CAAC,CAAA,MAAA,EAAS,OAAA,CAAQ,MAAA,CAAO,UAAU,yBAAyB,OAAA,CAAQ,OAAO,eAAe,OAAA,CAAQ,QAAQ,QAAQ,kBAAkB,CAAA,CAAA;AAE/L,EAAA,MAAM,gBAAA,GAA0B;AAAA,IAC9BA,GAAAA,CAAAA,IAAAA,CAAAA;AAAA,IACAA,GAAAA,CAAAA,MAAAA,CAAAA;AAAA,IACAA,GAAAA,CAAAA,oBAAAA;AAAA,GACF;AACA,EAAA,IAAI,kBAAkB,MAAA,EAAW;AAC/B,IAAA,gBAAA,CAAiB,IAAA,CAAKA,GAAAA,CAAAA,EAAM,aAAa,CAAA,QAAA,CAAU,CAAA;AAAA,EACrD;AAEA,EAAA,MAAM,cAAA,GAAwB;AAAA,IAC5BA,GAAAA,CAAAA,aAAAA,EAAmB,QAAQ,OAAO,CAAA,CAAA;AAAA,IAClC,cAAA;AAAA,IACA,kBAAA;AAAA,IACA,kBAAA;AAAA,IACAA,GAAAA,CAAAA,UAAAA,EAAgB,QAAQ,OAAO,CAAA;AAAA,GACjC;AACA,EAAA,IAAI,UAAA,KAAe,MAAA,EAAW,cAAA,CAAe,IAAA,CAAK,UAAU,CAAA;AAE5D,EAAA,MAAM,4BAAA,GACJ,OAAA,CAAQ,OAAA,CAAQ,YAAA,CAAa,qCAAA;AAE/B,EAAA,MAAM,gBAAgB,sBAAA,CAAuB;AAAA,IAC3C,gBAAA;AAAA,IACA,YAAA,EAAc,cAAA;AAAA,IACd,WAAW,OAAA,CAAQ,SAAA;AAAA,IACnB,4BAAA;AAAA,IACA,QAAQ,OAAA,CAAQ;AAAA,GACjB,CAAA;AAED,EAAA,OAAOA,GAAAA,CAAAA,6BAAAA,EAAmC,QAAQ,CAAA,WAAA,EAAc,aAAa,CAAA,CAAA,CAAA;AAC/E;AAUA,SAAS,uBAAuB,OAAA,EAA6C;AAC3E,EAAA,MAAM,YAAA,GAAeA,GAAAA,CAAAA,OAAAA,EAAaA,GAAAA,CAAI,IAAA,CAAK,CAAC,GAAG,OAAA,CAAQ,gBAAgB,CAAA,EAAGA,GAAAA,CAAAA,EAAAA,CAAO,CAAC,CAAA,CAAA;AAElF,EAAA,QAAQ,QAAQ,SAAA;AAAW,IACzB,KAAK,KAAA,EAAO;AACV,MAAA,OAAO,sBAAA,CAAuB;AAAA,QAC5B,YAAA;AAAA,QACA,cAAc,OAAA,CAAQ,YAAA;AAAA,QACtB,SAAA,EAAW,SAAA;AAAA,QACX,WAAA,EAAa,OAAA;AAAA,QACb,eAAA,EAAiB,SAAA;AAAA,QACjB,8BAA8B,OAAA,CAAQ,4BAAA;AAAA,QACtC,QAAQ,OAAA,CAAQ;AAAA,OACjB,CAAA;AAAA,IACH;AAAA,IACA,KAAK,IAAA,EAAM;AACT,MAAA,OAAO,sBAAA,CAAuB;AAAA,QAC5B,YAAA;AAAA,QACA,cAAc,OAAA,CAAQ,YAAA;AAAA,QACtB,SAAA,EAAW,OAAA;AAAA,QACX,WAAA,EAAa,SAAA;AAAA,QACb,eAAA,EAAiB,WAAA;AAAA,QACjB,8BAA8B,OAAA,CAAQ,4BAAA;AAAA,QACtC,QAAQ,OAAA,CAAQ;AAAA,OACjB,CAAA;AAAA,IACH;AAAA,IACA,KAAK,MAAA,EAAQ;AACX,MAAA,OAAO,wBAAA,CAAyB;AAAA,QAC9B,YAAA;AAAA,QACA,cAAc,OAAA,CAAQ,YAAA;AAAA,QACtB,8BAA8B,OAAA,CAAQ,4BAAA;AAAA,QACtC,QAAQ,OAAA,CAAQ;AAAA,OACjB,CAAA;AAAA,IACH;AAAA;AAEJ;AAYA,SAAS,uBAAuB,OAAA,EAAwC;AACtE,EAAA,MAAM,WAAWA,GAAAA,CAAAA,KAAAA,EAAW,OAAA,CAAQ,MAAA,CAAO,UAAU,8CAA8CA,GAAAA,CAAI,GAAA,CAAI,OAAA,CAAQ,WAAW,CAAC,CAAA,gBAAA,EAAmBA,GAAAA,CAAI,GAAA,CAAI,OAAA,CAAQ,eAAe,CAAC,CAAA,CAAA;AAElL,EAAA,IAAI,QAAQ,4BAAA,EAA8B;AACxC,IAAA,MAAM,QAAA,GAAW;AAAA,MACf,GAAG,OAAA,CAAQ,YAAA;AAAA,MACXA,GAAAA,CAAAA,EAAAA,EAAQA,GAAAA,CAAI,GAAA,CAAI,OAAA,CAAQ,SAAS,CAAC,CAAA,OAAA;AAAA,KACpC;AACA,IAAA,OAAOA,GAAAA,CAAAA,EAAM,OAAA,CAAQ,YAAY,CAAA,6BAAA,EAAgC,QAAQ,MAAA,CAAO,UAAU,CAAA,GAAA,EAAM,QAAQ,CAAA,OAAA,EAAUA,GAAAA,CAAI,IAAA,CAAK,QAAA,EAAUA,UAAU,CAAC,CAAA,CAAA;AAAA,EAClJ;AAEA,EAAA,OAAOA,GAAAA,CAAAA,EAAM,OAAA,CAAQ,YAAY,CAAA,uBAAA,EAA0B,OAAA,CAAQ,OAAO,UAAU,CAAA,QAAA,EAAWA,GAAAA,CAAI,GAAA,CAAI,OAAA,CAAQ,SAAS,CAAC,CAAA,QAAA,EAAW,QAAQ,CAAA,OAAA,EAAUA,GAAAA,CAAI,IAAA,CAAK,CAAC,GAAG,OAAA,CAAQ,YAAY,CAAA,EAAGA,GAAAA,CAAAA,KAAAA,CAAU,CAAC,CAAA,CAAA;AACvM;AASA,SAAS,yBAAyB,OAAA,EAA0C;AAG1E,EAAA,MAAM,QAAA,GAAWA,GAAAA,CAAAA,KAAAA,EAAW,OAAA,CAAQ,MAAA,CAAO,UAAU,CAAA,kKAAA,CAAA;AAErD,EAAA,IAAI,QAAQ,4BAAA,EAA8B;AACxC,IAAA,MAAM,QAAA,GAAW;AAAA,MACf,GAAG,OAAA,CAAQ,YAAA;AAAA,MACXA,GAAAA,CAAAA,oCAAAA;AAAA,KACF;AACA,IAAA,OAAOA,GAAAA,CAAAA,EAAM,OAAA,CAAQ,YAAY,CAAA,6BAAA,EAAgC,QAAQ,MAAA,CAAO,UAAU,CAAA,GAAA,EAAM,QAAQ,CAAA,OAAA,EAAUA,GAAAA,CAAI,IAAA,CAAK,QAAA,EAAUA,UAAU,CAAC,CAAA,CAAA;AAAA,EAClJ;AAEA,EAAA,OAAOA,MAAM,OAAA,CAAQ,YAAY,0BAA0B,OAAA,CAAQ,MAAA,CAAO,UAAU,CAAA,2CAAA,EAA8C,QAAQ,CAAA,OAAA,EAAUA,GAAAA,CAAI,KAAK,CAAC,GAAG,QAAQ,YAAY,CAAA,EAAGA,UAAU,CAAC,CAAA,CAAA;AACrM;;;AC9JA,SAASY,iBAAmB,KAAA,EAA4C;AACtE,EAAA,OAAO,KAAA,KAAU,OAAO,MAAA,GAAY,KAAA;AACtC;AASO,SAAS,UAAU,GAAA,EAAoB;AAC5C,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,KAAK,CAAA;AACrC,EAAA,MAAM,KAAA,GAAQ,kBAAA,CAAmB,QAAA,EAAU,kBAAkB,CAAA;AAC7D,EAAA,OAAO;AAAA,IACL,MAAM,GAAA,CAAI,IAAA;AAAA,IACV,IAAI,GAAA,CAAI,EAAA;AAAA,IACR,IAAA,EAAM,cAAc,GAAG,CAAA;AAAA,IACvB,GAAG;AAAA,GACL;AACF;AAEO,SAAS,cACd,GAAA,EASU;AACV,EAAA,OAAO;AAAA,IACL,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,SAAA,EAAWA,gBAAAA,CAAgB,GAAA,CAAI,UAAU,CAAA;AAAA,IACzC,OAAA,EAASA,gBAAAA,CAAgB,GAAA,CAAI,QAAQ,CAAA;AAAA,IACrC,WAAW,GAAA,CAAI,UAAA;AAAA,IACf,WAAW,GAAA,CAAI,UAAA;AAAA,IACf,SAAA,EAAWA,gBAAAA,CAAgB,GAAA,CAAI,UAAU;AAAA,GAC3C;AACF;AASO,SAAS,UAAU,GAAA,EAAoB;AAC5C,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,KAAK,CAAA;AACrC,EAAA,MAAM,KAAA,GAAQ,kBAAA,CAAmB,QAAA,EAAU,kBAAkB,CAAA;AAC7D,EAAA,OAAO;AAAA,IACL,IAAI,GAAA,CAAI,EAAA;AAAA,IACR,MAAM,GAAA,CAAI,IAAA;AAAA,IACV,UAAU,GAAA,CAAI,SAAA;AAAA,IACd,QAAQ,GAAA,CAAI,OAAA;AAAA,IACZ,QAAQ,GAAA,CAAI,OAAA;AAAA,IACZ,MAAM,GAAA,CAAI,KAAA;AAAA,IACV,IAAA,EAAM,cAAc,GAAG,CAAA;AAAA,IACvB,GAAG;AAAA,GACL;AACF;AAEO,SAAS,cACd,GAAA,EAIU;AACV,EAAA,OAAO;AAAA,IACL,SAAA,EAAWA,gBAAAA,CAAgB,GAAA,CAAI,UAAU,CAAA;AAAA,IACzC,OAAA,EAASA,gBAAAA,CAAgB,GAAA,CAAI,QAAQ,CAAA;AAAA,IACrC,WAAW,GAAA,CAAI,UAAA;AAAA,IACf,WAAW,GAAA,CAAI,UAAA;AAAA,IACf,SAAA,EAAWA,gBAAAA,CAAgB,GAAA,CAAI,UAAU;AAAA,GAC3C;AACF;;;ACrDA,IAAM,0BAAA,GAA6B,EAAA;AAEnC,IAAM,YAAA,GAAe,IAAI,WAAA,EAAY;AAMrC,SAAS,eAAA,CAAgB,OAAe,QAAA,EAA0B;AAChE,EAAA,MAAM,OAAA,GAAU,YAAA,CAAa,MAAA,CAAO,KAAK,CAAA;AACzC,EAAA,IAAI,OAAA,CAAQ,UAAA,IAAc,QAAA,EAAU,OAAO,KAAA;AAI3C,EAAA,IAAI,GAAA,GAAM,QAAA;AACV,EAAA,OAAO,GAAA,GAAM,KAAK,OAAA,CAAQ,GAAG,KAAM,GAAA,IAAQ,OAAA,CAAQ,GAAG,CAAA,GAAK,GAAA,EAAM;AAC/D,IAAA,GAAA,EAAA;AAAA,EACF;AAEA,EAAA,OAAO,IAAI,aAAY,CAAE,MAAA,CAAO,QAAQ,KAAA,CAAM,CAAA,EAAG,GAAG,CAAC,CAAA;AACvD;AAaA,SAAS,eAAA,CACP,YAAA,EACA,IAAA,EACAf,MAAAA,EACQ;AACR,EAAA,MAAM,MAAA,GAAS,YAAA,KAAiB,MAAA,GAAS,MAAA,GAAS,MAAA;AAClD,EAAA,MAAM,OAAO,WAAA,CAAY,CAAA,EAAG,IAAI,CAAA,EAAA,EAAKA,MAAK,CAAA,CAAE,CAAA;AAG5C,EAAA,MAAM,UAAA,GAAa,MAAA,CAAO,MAAA,GAAS,CAAA,GAAI,IAAI,IAAA,CAAK,MAAA;AAChD,EAAA,MAAM,eAAe,wBAAA,GAA2B,UAAA;AAChD,EAAA,MAAM,aAAA,GAAgB,eAAA,CAAgB,IAAA,EAAM,YAAY,CAAA;AACxD,EAAA,OAAO,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,aAAa,IAAI,IAAI,CAAA,CAAA;AAC3C;AAMA,SAAS,eAAe,KAAA,EAAwB;AAC9C,EAAA,OAAO,OAAO,UAAU,QAAA,GAAW,KAAA,GAAQ,KAAK,SAAA,CAAU,KAAA,IAAS,EAAE,CAAA;AACvE;AAqHO,SAAS,sBACd,MAAA,EACuD;AACvD,EAAA,OAAO,CAAqC,OAAA,KAAkB,OAAA;AAChE;AA4NA,eAAsB,gBAKpB,MAAA,EAQwC;AACxC,EAAA,MAAM,EAAE,SAAQ,GAAI,MAAA;AACpB,EAAA,MAAM,EAAE,KAAA,EAAO,UAAA,EAAW,GAAI,qBAAA;AAAA,IAC5B,OAAA,CAAQ,YAAA,IAAgB,MAAA,CAAO,KAAA,CAAM,QAAA,CAAS,YAAA;AAAA,IAC9C,OAAA,CAAQ;AAAA,GACV;AACA,EAAA,MAAM,eAAe,UAAA,CAAW,IAAA;AAEhC,EAAA,MAAM,WAAW,IAAA,CAAK,GAAA;AAAA,IACpB,QAAQ,QAAA,IAAY,0BAAA;AAAA,IACpB;AAAA,GACF;AAEA,EAAA,MAAM,GAAA,GAAuB;AAAA,IAC3B,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,QAAQ,MAAA,CAAO,MAAA;AAAA,IACf,WAAW,OAAA,CAAQ,KAAA;AAAA,IACnB,QAAA;AAAA,IACA,cAAc,OAAA,CAAQ,YAAA;AAAA,IACtB,WAAA,EAAa,QAAQ,WAAA,IAAe,KAAA;AAAA,IACpC,SAAA,EAAW,QAAQ,SAAA,IAAa,KAAA;AAAA,IAChC,WAAA,EAAa,QAAQ,WAAA,IAAe,SAAA;AAAA,IACpC,YAAA;AAAA,IACA,MAAM,UAAA,CAAW,IAAA;AAAA,IACjB,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,MAAA,EAAQ,OAAO,MAAA,IAAU,kBAAA;AAAA,IACzB,SAAS,MAAA,CAAO;AAAA,GAClB;AAEA,EAAA,MAAM,kBAAA,GAAqB,6BAAA,CAA8B,MAAA,CAAO,KAAK,CAAA;AACrE,EAAA,MAAM,kBAAA,GAAqB,mBAAA;AAAA,IACzB,oBAAA,CAAqB,MAAA,CAAO,KAAA,EAAO,OAAA,CAAQ,YAAY,CAAA;AAAA,IACvD,QAAQ,OAAA,EAAS,KAAA;AAAA,IACjB,CAAC,IAAA,EAAMA,MAAAA,KAAU,kBAAA,CAAmB,gBAAA,CAAiB,MAAMA,MAAK,CAAA;AAAA,IAChE;AAAA,GACF;AACA,EAAA,MAAM,kBAAA,GAAqB,mBAAA;AAAA,IACzB,aAAA,CAAc,QAAQ,KAAK,CAAA;AAAA,IAC3B,QAAQ,OAAA,EAAS,KAAA;AAAA,IACjB,CAAC,IAAA,EAAMA,MAAAA,KAAU,kBAAA,CAAmB,oBAAA,CAAqB,MAAMA,MAAK,CAAA;AAAA,IACpE;AAAA,GACF;AAEA,EAAA,MAAM,eAAe,iBAAA,CAAkB;AAAA,IACrC,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,UAAU,GAAA,CAAI,MAAA;AAAA,IACd,WAAW,GAAA,CAAI,SAAA;AAAA,IACf,SAAS,GAAA,CAAI,QAAA;AAAA,IACb,WAAW,GAAA,CAAI,SAAA;AAAA,IACf,aAAa,GAAA,CAAI,WAAA;AAAA,IACjB,WAAA,EAAa,KAAA;AAAA,IACb,cAAc,GAAA,CAAI,YAAA;AAAA,IAClB,GAAI,GAAA,CAAI,IAAA,KAAS,UAAa,EAAE,IAAA,EAAM,IAAI,IAAA,EAAK;AAAA,IAC/C,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,QAAQ,GAAA,CAAI;AAAA,GACb,CAAA;AACD,EAAA,MAAM,cAAA,GAAiB,oBAAoB,GAAG,CAAA;AAE9C,EAAA,MAAM,CAAC,QAAA,EAAU,QAAQ,CAAA,GAAI,MAAM,QAAQ,GAAA,CAAI;AAAA,IAC7C,kBAAA,CAAmB,GAAA,EAAK,YAAA,EAAc,cAAA,EAAgB,kBAAkB,CAAA;AAAA,IACxE,kBAAA,CAAmB,GAAA,EAAK,YAAA,EAAc,cAAA,EAAgB,kBAAkB;AAAA,GACzE,CAAA;AAED,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAkB;AACvC,EAAA,KAAA,MAAW,OAAO,QAAA,EAAU;AAC1B,IAAA,MAAM,IAAA,GAAO,kBAAA,CAAmB,GAAA,EAAK,kBAAkB,CAAA;AACvD,IAAA,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,IAAI,CAAA;AAAA,EAC5B;AAEA,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAiC;AACvD,EAAA,MAAM,gBAAA,uBAAuB,GAAA,EAAiC;AAC9D,EAAA,KAAA,MAAW,OAAO,QAAA,EAAU;AAC1B,IAAA,MAAM,IAAA,GAAO,kBAAA,CAAmB,GAAA,EAAK,kBAAkB,CAAA;AACvD,IAAA,oBAAA,CAAqB,SAAA,EAAW,IAAA,CAAK,MAAA,EAAQ,IAAA,CAAK,MAAM,IAAI,CAAA;AAC5D,IAAA,oBAAA,CAAqB,gBAAA,EAAkB,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,MAAM,IAAI,CAAA;AAAA,EACnE;AAEA,EAAA,MAAM,IAAA,GAAO,QAAA,CAAS,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AAEpC,EAAA,OAAO;AAAA,IACL,IAAA;AAAA,IACA,KAAA,EAAO,QAAA;AAAA,IACP,SAAA;AAAA,IACA;AAAA,GACF;AACF;AAWA,IAAM,iBAAA,uBAAwB,OAAA,EAAsC;AAEpE,SAAS,8BACP,KAAA,EACoB;AACpB,EAAA,MAAM,MAAA,GAAS,iBAAA,CAAkB,GAAA,CAAI,KAAK,CAAA;AAC1C,EAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AAEjC,EAAA,MAAM,YAAY,IAAI,GAAA;AAAA,IACpB,MAAA,CAAO,OAAA,CAAQ,KAAA,CAAM,KAAK,CAAA,CAAE,IAAI,CAAC,CAAC,IAAA,EAAM,UAAU,CAAA,KAAM;AAAA,MACtD,IAAA;AAAA,MACA,EAAE,MAAA,EAAQ,UAAA,CAAW,IAAA,CAAK,MAAA;AAAO,KAClC;AAAA,GACH;AACA,EAAA,MAAM,YAAY,IAAI,GAAA;AAAA,IACpB,MAAA,CAAO,OAAA,CAAQ,KAAA,CAAM,KAAK,CAAA,CAAE,IAAI,CAAC,CAAC,IAAA,EAAM,UAAU,CAAA,KAAM;AAAA,MACtD,IAAA;AAAA,MACA,EAAE,MAAA,EAAQ,UAAA,CAAW,IAAA,CAAK,MAAA;AAAO,KAClC;AAAA,GACH;AAEA,EAAA,MAAM,YAAA,GAAe,wBAAA,CAAyB,SAAA,EAAW,SAAS,CAAA;AAClE,EAAA,iBAAA,CAAkB,GAAA,CAAI,OAAO,YAAY,CAAA;AACzC,EAAA,OAAO,YAAA;AACT;AAEA,SAAS,mBAAA,CACP,KAAA,EACA,aAAA,EAGA,gBAAA,EACA,YAAA,EACgB;AAChB,EAAA,MAAM,cAAA,uBAAqB,GAAA,EAAgC;AAC3D,EAAA,MAAM,YAAsB,EAAC;AAE7B,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,SAAA,GAAY,gBAAgB,IAAI,CAAA;AACtC,IAAA,IAAI,cAAc,MAAA,EAAW;AAC3B,MAAA,SAAA,CAAU,KAAK,IAAI,CAAA;AACnB,MAAA;AAAA,IACF;AAEA,IAAA,cAAA,CAAe,GAAA;AAAA,MACb,IAAA;AAAA,MACA,uBAAA,CAAwB,IAAA,EAAM,SAAA,EAAW,gBAAA,EAAkB,YAAY;AAAA,KACzE;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,WAAW,cAAA,EAAe;AACrC;AAEA,SAAS,uBAAA,CACP,IAAA,EACA,SAAA,EACA,gBAAA,EACA,YAAA,EACoB;AACpB,EAAA,MAAM,cAAA,uBAAqB,GAAA,EAAyC;AACpE,EAAA,IAAI,WAAA,GAAc,KAAA;AAElB,EAAA,KAAA,MAAWA,UAAS,SAAA,EAAW;AAC7B,IAAA,IAAIA,WAAU,MAAA,EAAQ;AACpB,MAAA,WAAA,GAAc,IAAA;AACd,MAAA;AAAA,IACF;AAEA,IAAA,uBAAA,CAAwBA,MAAAA,EAAO,cAAc,IAAI,CAAA;AAEjD,IAAA,IAAI,CAAC,cAAA,CAAe,GAAA,CAAIA,MAAK,CAAA,EAAG;AAC9B,MAAA,cAAA,CAAe,IAAIA,MAAAA,EAAO;AAAA,QACxB,KAAA,EAAAA,MAAAA;AAAA,QACA,UAAA,EAAY,eAAA,CAAgB,YAAA,EAAc,IAAA,EAAMA,MAAK,CAAA;AAAA,QACrD,QAAA,EAAU,gBAAA,CAAiB,IAAA,EAAMA,MAAK;AAAA,OACvC,CAAA;AAAA,IACH;AAAA,EACF;AAEA,EAAA,OAAO;AAAA,IACL,WAAA;AAAA,IACA,cAAA,EAAgB,CAAC,GAAG,cAAA,CAAe,QAAQ;AAAA,GAC7C;AACF;AAEA,SAAS,oBAAA,CACP,OACA,YAAA,EACmB;AACnB,EAAA,IAAI,YAAA,KAAiB,MAAA,IAAa,YAAA,CAAa,MAAA,KAAW,CAAA,EAAG;AAC3D,IAAA,OAAO,MAAA,CAAO,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA;AAAA,EAChC;AAEA,EAAA,OAAO,cAAc,YAAY,CAAA;AACnC;AAEA,SAAS,cAAc,MAAA,EAA8C;AACnE,EAAA,OAAO,CAAC,GAAG,IAAI,GAAA,CAAI,MAAM,CAAC,CAAA;AAC5B;AAMA,SAAS,oBAAoB,GAAA,EAA2B;AACtD,EAAA,MAAM,UAAiB,EAAC;AAExB,EAAA,IAAI,IAAI,YAAA,KAAiB,MAAA,IAAa,GAAA,CAAI,YAAA,CAAa,SAAS,CAAA,EAAG;AACjE,IAAA,OAAA,CAAQ,IAAA,CAAK,kBAAkBG,GAAAA,CAAI,GAAA,CAAI,MAAM,CAAA,EAAG,GAAA,CAAI,YAAY,CAAC,CAAA;AAAA,EACnE;AAEA,EAAA,IAAI,IAAI,WAAA,EAAa;AACnB,IAAA,OAAA,CAAQ,IAAA,CAAKA,GAAAA,CAAAA,MAAAA,EAAY,GAAA,CAAI,MAAM,CAAA,CAAE,CAAA;AAAA,EACvC;AAEA,EAAA,MAAM,WAAA,GACJ,OAAA,CAAQ,MAAA,GAAS,CAAA,GAAIA,GAAAA,CAAAA,OAAAA,EAAaA,IAAI,IAAA,CAAK,OAAA,EAASA,GAAAA,CAAAA,KAAAA,CAAU,CAAC,CAAA,CAAA,GAAKA,GAAAA,CAAAA,CAAAA;AAEtE,EAAA,OAAOA,0DAA0D,WAAW,CAAA,CAAA,CAAA;AAC9E;AAEA,eAAe,kBAAA,CACb,GAAA,EACA,YAAA,EACA,cAAA,EACA,cAAA,EACiC;AACjC,EAAA,MAAM,OAAA,GAAiB;AAAA,IACrBA,GAAAA,CAAAA,MAAAA,CAAAA;AAAA,IACAA,GAAAA,CAAAA,IAAAA,CAAAA;AAAA,IACA,oBAAA,CAAqB,KAAK,cAAc,CAAA;AAAA,IACxC,GAAG,oBAAA,CAAqB,GAAA,EAAK,cAAA,EAAgB;AAAA,MAC3C,SAAA;AAAA,MACA,YAAA;AAAA,MACA,UAAA;AAAA,MACA,YAAA;AAAA,MACA,YAAA;AAAA,MACA;AAAA,KACD,CAAA;AAAA,IACD,GAAG,6BAAA,CAA8B,GAAA,EAAK,cAAA,EAAgB,IAAI,OAAO;AAAA,GACnE;AAEA,EAAA,MAAM,QAAQA,GAAAA,CAAAA,EAAM,YAAY,CAAA,EAAG,cAAc,WAAWA,GAAAA,CAAI,IAAA,CAAK,OAAA,EAASA,GAAAA,CAAAA,EAAAA,CAAO,CAAC,CAAA,MAAA,EAAS,GAAA,CAAI,OAAO,UAAU,CAAA,sBAAA,EAAyB,IAAI,OAAO,CAAA,0CAAA,CAAA;AAExJ,EAAA,OAAO,GAAA,CAAI,OAAA,CAAQ,OAAA,CAA8B,KAAK,CAAA;AAGxD;AAEA,eAAe,kBAAA,CACb,GAAA,EACA,YAAA,EACA,cAAA,EACA,cAAA,EACiC;AACjC,EAAA,MAAM,iBAAiB,iBAAA,CAAkBA,GAAAA,CAAI,IAAI,QAAQ,CAAA,EAAG,IAAI,SAAS,CAAA;AACzE,EAAA,MAAM,qBAAqB,qBAAA,CAAsB;AAAA,IAC/C,MAAM,GAAA,CAAI,YAAA;AAAA,IACV,MAAM,GAAA,CAAI,IAAA;AAAA,IACV,UAAA,EAAY,GAAA;AAAA,IACZ,gBAAA,EAAkB,GAAA,CAAI,OAAA,CAAQ,gBAAA;AAAiB,GAChD,CAAA;AACD,EAAA,MAAM,OAAA,GAAiB;AAAA,IACrBA,GAAAA,CAAAA,IAAAA,CAAAA;AAAA,IACAA,GAAAA,CAAAA,MAAAA,CAAAA;AAAA,IACAA,GAAAA,CAAAA,WAAAA,CAAAA;AAAA,IACAA,GAAAA,CAAAA,SAAAA,CAAAA;AAAA,IACAA,GAAAA,CAAAA,SAAAA,CAAAA;AAAA,IACAA,GAAAA,CAAAA,OAAAA,CAAAA;AAAA,IACA,oBAAA,CAAqB,KAAK,cAAc,CAAA;AAAA,IACxC,GAAG,oBAAA,CAAqB,GAAA,EAAK,cAAA,EAAgB;AAAA,MAC3C,YAAA;AAAA,MACA,UAAA;AAAA,MACA,YAAA;AAAA,MACA,YAAA;AAAA,MACA;AAAA,KACD,CAAA;AAAA,IACD,GAAG,6BAAA,CAA8B,GAAA,EAAK,cAAA,EAAgB,IAAI,OAAO;AAAA,GACnE;AAEA,EAAA,MAAM,KAAA,GAAQA,MAAM,YAAY,CAAA,EAAG,cAAc,CAAA,QAAA,EAAWA,GAAAA,CAAI,KAAK,OAAA,EAASA,GAAAA,CAAAA,EAAAA,CAAO,CAAC,CAAA,MAAA,EAAS,GAAA,CAAI,OAAO,UAAU,CAAA,sBAAA,EAAyB,IAAI,OAAO,CAAA,KAAA,EAAQ,cAAc,CAAA,KAAA,EAAQ,kBAAkB,CAAA,4FAAA,CAAA;AAExM,EAAA,OAAO,GAAA,CAAI,OAAA,CAAQ,OAAA,CAA8B,KAAK,CAAA;AAGxD;AAEA,SAAS,oBAAA,CACP,KAAA,EACA,IAAA,EACA,OAAA,EACgB;AAChB,EAAA,IAAI,IAAA,CAAK,cAAA,CAAe,IAAA,KAAS,CAAA,EAAG;AAClC,IAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,GAAA,KAAQA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,GAAG,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA;AAAA,EAChE;AAEA,EAAA,MAAM,SAAA,GAAsB,CAAC,GAAG,IAAA,CAAK,SAAS,CAAA;AAC9C,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,QAAQ,CAAA,IAAK,KAAK,cAAA,EAAgB;AAClD,IAAA,IAAI,QAAA,CAAS,WAAA,EAAa,SAAA,CAAU,IAAA,CAAK,IAAI,CAAA;AAAA,EAC/C;AAEA,EAAA,IAAI,SAAA,CAAU,WAAW,CAAA,EAAG;AAC1B,IAAA,OAAO,OAAA,CAAQ,IAAI,CAAC,GAAA,KAAQA,cAAcA,GAAAA,CAAI,GAAA,CAAI,GAAG,CAAC,CAAA,CAAE,CAAA;AAAA,EAC1D;AAGA,EAAA,IAAI,UAAU,MAAA,KAAW,IAAA,CAAK,UAAU,MAAA,GAAS,IAAA,CAAK,eAAe,IAAA,EAAM;AACzE,IAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,GAAA,KAAQA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,GAAG,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA;AAAA,EAChE;AAEA,EAAA,MAAM,MAAA,GAAS,kBAAkBA,GAAAA,CAAI,GAAA,CAAI,GAAG,KAAK,CAAA,KAAA,CAAO,GAAG,SAAS,CAAA;AACpE,EAAA,OAAO,OAAA,CAAQ,GAAA;AAAA,IACb,CAAC,GAAA,KACCA,GAAAA,CAAAA,UAAAA,EAAgB,MAAM,CAAA,MAAA,EAASA,IAAI,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,GAAG,CAAA,CAAE,CAAC,qBAAqBA,GAAAA,CAAI,GAAA,CAAI,GAAG,CAAC,CAAA;AAAA,GAC9F;AACF;AAEA,SAAS,oBAAA,CAAqB,OAAkB,IAAA,EAA2B;AACzE,EAAA,IAAI,IAAA,CAAK,cAAA,CAAe,IAAA,KAAS,CAAA,EAAG;AAClC,IAAA,OAAOA,MAAMA,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAG,KAAK,QAAQ,CAAC,CAAA,SAAA,CAAA;AAAA,EACxC;AAEA,EAAA,IAAI,IAAA,CAAK,SAAA,CAAU,MAAA,KAAW,CAAA,EAAG;AAC/B,IAAA,OAAOA,GAAAA,CAAAA,aAAAA,CAAAA;AAAA,EACT;AAEA,EAAA,MAAM,MAAA,GAAS,kBAAkBA,GAAAA,CAAI,GAAA,CAAI,GAAG,KAAK,CAAA,KAAA,CAAO,CAAA,EAAG,IAAA,CAAK,SAAS,CAAA;AACzE,EAAA,OAAOA,GAAAA,CAAAA,UAAAA,EAAgB,MAAM,CAAA,MAAA,EAASA,GAAAA,CAAI,IAAI,CAAA,EAAG,KAAK,QAAQ,CAAC,CAAA,uBAAA,CAAA;AACjE;AAEA,SAAS,6BAAA,CACP,KAAA,EACA,IAAA,EACA,OAAA,EACgB;AAChB,EAAA,MAAM,UAAiB,EAAC;AAExB,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,QAAQ,KAAK,IAAA,CAAK,cAAA,CAAe,SAAQ,EAAG;AAC5D,IAAA,KAAA,MAAW,SAAA,IAAa,SAAS,cAAA,EAAgB;AAC/C,MAAA,MAAM,YAAY,uBAAA,CAAwB;AAAA,QACxC,MAAA,EAAQA,GAAAA,CAAI,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,MAAA,CAAQ,CAAA;AAAA,QAChC,OAAA;AAAA,QACA,OAAA,EAAS,WAAA,CAAY,CAAC,SAAA,CAAU,KAAK,CAAC,CAAA;AAAA,QACtC,SAAA,EAAW,UAAU,QAAA,EAAU;AAAA,OAChC,CAAA;AAED,MAAA,OAAA,CAAQ,IAAA;AAAA,QACNA,GAAAA,CAAAA,UAAAA,EAAgBA,GAAAA,CAAI,GAAA,CAAI,KAAK,CAAC,CAAA,QAAA,EAAW,IAAI,CAAA,MAAA,EAAS,SAAS,CAAA,kBAAA,EAAqB,eAAA,CAAgB,SAAA,CAAU,UAAU,CAAC,CAAA;AAAA,OAC3H;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,OAAA;AACT;AAMA,SAAS,oBAAA,CACP,KAAA,EACA,MAAA,EACA,QAAA,EACA,IAAA,EACM;AACN,EAAA,IAAI,OAAA,GAAU,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AAC9B,EAAA,IAAI,YAAY,MAAA,EAAW;AACzB,IAAA,OAAA,uBAAc,GAAA,EAAI;AAClB,IAAA,KAAA,CAAM,GAAA,CAAI,QAAQ,OAAO,CAAA;AAAA,EAC3B;AACA,EAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,GAAA,CAAI,QAAQ,CAAA;AAClC,EAAA,IAAI,UAAU,MAAA,EAAW;AACvB,IAAA,OAAA,CAAQ,GAAA,CAAI,QAAA,EAAU,CAAC,IAAI,CAAC,CAAA;AAAA,EAC9B,CAAA,MAAO;AACL,IAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA,EACjB;AACF;AAMA,SAAS,oBAAA,CACP,MAAA,EACA,GAAA,EACA,QAAA,EACM;AACN,EAAA,KAAA,MAAW,SAAA,IAAa,SAAS,cAAA,EAAgB;AAC/C,IAAA,MAAA,CAAO,SAAA,CAAU,KAAK,CAAA,GAAI,mBAAA;AAAA,MACxB,GAAA,CAAI,UAAU,UAAU,CAAA;AAAA,MACxB,SAAA,CAAU;AAAA,KACZ;AAAA,EACF;AACF;AAEA,SAAS,kBAAA,CACP,KACA,cAAA,EACM;AACN,EAAA,MAAM,QAAA,GAAW,cAAA,CAAe,cAAA,CAAe,GAAA,CAAI,IAAI,IAAI,CAAA;AAC3D,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,OAAO,SAAA,CAAU;AAAA,MACf,GAAG,GAAA;AAAA,MACH,KAAA,EAAO,cAAA,CAAe,GAAA,CAAI,KAAK;AAAA,KAChC,CAAA;AAAA,EACH;AAEA,EAAA,MAAM,aAAA,GAAyC;AAAA,IAC7C,MAAM,GAAA,CAAI,IAAA;AAAA,IACV,IAAI,GAAA,CAAI;AAAA,GACV;AAEA,EAAA,IAAI,SAAS,WAAA,EAAa;AACxB,IAAA,aAAA,CAAc,IAAA,GAAO,cAAc,GAAG,CAAA;AAAA,EACxC;AAEA,EAAA,oBAAA,CAAqB,aAAA,EAAe,KAAK,QAAQ,CAAA;AACjD,EAAA,OAAO,aAAA;AACT;AAEA,SAAS,kBAAA,CACP,KACA,cAAA,EACM;AACN,EAAA,MAAM,QAAA,GAAW,cAAA,CAAe,cAAA,CAAe,GAAA,CAAI,IAAI,IAAI,CAAA;AAC3D,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,OAAO,SAAA,CAAU;AAAA,MACf,GAAG,GAAA;AAAA,MACH,KAAA,EAAO,cAAA,CAAe,GAAA,CAAI,KAAK;AAAA,KAChC,CAAA;AAAA,EACH;AAEA,EAAA,MAAM,aAAA,GAAyC;AAAA,IAC7C,IAAI,GAAA,CAAI,EAAA;AAAA,IACR,MAAM,GAAA,CAAI,IAAA;AAAA,IACV,UAAU,GAAA,CAAI,SAAA;AAAA,IACd,QAAQ,GAAA,CAAI,OAAA;AAAA,IACZ,QAAQ,GAAA,CAAI,OAAA;AAAA,IACZ,MAAM,GAAA,CAAI;AAAA,GACZ;AAEA,EAAA,IAAI,SAAS,WAAA,EAAa;AACxB,IAAA,aAAA,CAAc,IAAA,GAAO,cAAc,GAAG,CAAA;AAAA,EACxC;AAEA,EAAA,oBAAA,CAAqB,aAAA,EAAe,KAAK,QAAQ,CAAA;AACjD,EAAA,OAAO,aAAA;AACT;AC11BA,IAAM,YAAA,GAAiD;AAAA,EACrD,KAAA,EAAO,OAAA;AAAA,EACP,QAAA,EAAU,WAAA;AAAA,EACV,SAAA,EAAW,WAAA;AAAA,EACX,MAAA,EAAQ;AACV,CAAA;AASA,SAAS,2BAAA,CACP,EAAA,EACA,OAAA,EACA,OAAA,EACA,cAAA,EACuB;AACvB,EAAA,IAAI,KAAA,GAA+B;AAAA,IACjC,OAAA;AAAA,IACA,OAAA;AAAA,IACA,WAAA,EAAa,MAAA;AAAA,IACb;AAAA,GACF;AAEA,EAAA,MAAM,eAAA,GAAkB,gBAAgB,KAAA,EAAO;AAAA,IAC7C,IAAA,EAAM,cAAA;AAAA,IACN,QAAQ,YAAA,EAA2B;AACjC,MAAA,OAAO,8BAAA,CAA+B;AAAA,QACpC,OAAA,EAAS,aAAa,OAAA,CAAQ,IAAA;AAAA,QAC9B,SAAS,YAAA,CAAa,OAAA;AAAA,QACtB,IAAI,YAAA,CAAa,EAAA;AAAA,QACjB,GAAI,cAAA,KAAmB,MAAA,GAAY,EAAC,GAAI,EAAE,cAAA;AAAe,OAC1D,CAAA;AAAA,IACH,CAAA;AAAA,IACA,MAAA,CAAO,cAAc,WAAA,EAAoC;AACvD,MAAA,OAAO;AAAA,QACL,GAAG,YAAA;AAAA,QACH;AAAA,OACF;AAAA,IACF;AAAA,GACD,CAAA;AACD,EAAA,KAAA,GAAQ,eAAA,CAAgB,KAAA;AAExB,EAAA,OAAO,KAAA;AACT;AAsBO,SAAS,mBAAA,CACd,EAAA,EACA,OAAA,EACA,OAAA,EACAa,eACA,cAAA,EACK;AACL,EAAA,MAAM,SAAA,GAAY,2BAAA;AAAA,IAChB,EAAA;AAAA,IACA,OAAA;AAAA,IACA,OAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,MAAM,EAAE,aAAY,GAAI,SAAA;AACxB,EAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR;AAAA,KACF;AAAA,EACF;AAEA,EAAA,MAAM,OAAA,GAAU,uBAAA,CAAwB,EAAA,EAAI,OAAA,EAASA,eAAc,OAAO,CAAA;AAE1E,EAAA,MAAM,aAAA,GAAgB,8BAAA,CAA+B,EAAA,EAAI,OAAO,CAAA;AAChE,EAAA,OAAO,wBAAA,CAAyB;AAAA,IAC9B,SAAA,EAAW,OAAA;AAAA,IACX,WAAA;AAAA,IACA,GAAI,aAAA,CAAc,MAAA,KAAW,IAAI,EAAC,GAAI,EAAE,aAAA;AAAc,GACvD,CAAA;AACH;AAMA,SAAS,uBAAA,CACP,EAAA,EACA,OAAA,EACAA,aAAAA,EACA,OAAA,EACK;AACL,EAAA,MAAM,OAAO,sBAAA,CAAuB,EAAA,CAAG,IAAA,EAAM,OAAA,EAASA,eAAc,OAAO,CAAA;AAC3E,EAAA,MAAM,KAAA,GAAQ,sBAAA;AAAA,IACZ,EAAA,CAAG,KAAA;AAAA,IACH,OAAA;AAAA,IACAA,aAAAA;AAAA,IACA;AAAA,GACF;AAEA,EAAA,MAAM,QAAQb,GAAAA,CAAI,GAAA,CAAI,YAAA,CAAa,EAAA,CAAG,QAAQ,CAAC,CAAA;AAE/C,EAAA,OAAOA,GAAAA,CAAAA,EAAM,OAAA,CAAQ,uBAAA,CAAwB,IAAI,CAAC,CAAA,CAAA,EAAI,KAAK,CAAA,CAAA,EAAI,OAAA,CAAQ,uBAAA,CAAwB,KAAK,CAAC,CAAA,CAAA;AACvG;AAOA,SAAS,sBAAA,CACP,KAAA,EACA,OAAA,EACAa,aAAAA,EACA,OAAA,EACK;AACL,EAAA,IAAI,YAAY,KAAA,EAAO;AACrB,IAAA,OAAO,2BAAA,CAA4B,KAAA,EAAO,OAAA,EAASA,aAAAA,EAAc,OAAO,CAAA;AAAA,EAC1E;AACA,EAAA,OAAOA,aAAAA,CAAa,OAAO,OAAO,CAAA;AACpC;AASA,SAAS,2BAAA,CACP,EAAA,EACA,OAAA,EACAA,aAAAA,EACA,OAAA,EACK;AACL,EAAA,MAAM,IAAA,GAAO,uBAAA,CAAwB,EAAA,EAAI,OAAA,EAASA,eAAc,OAAO,CAAA;AACvE,EAAA,MAAM,aAAA,GAAgB,8BAAA,CAA+B,EAAA,EAAI,OAAO,CAAA;AAChE,EAAA,IAAI,aAAA,CAAc,MAAA,KAAW,CAAA,EAAG,OAAO,IAAA;AACvC,EAAA,OAAOb,IAAI,IAAA,CAAK,CAAC,MAAM,GAAG,aAAa,GAAGA,GAAAA,CAAAA,CAAAA,CAAM,CAAA;AAClD;AAUA,SAAS,sBAAsB,EAAA,EAA8B;AAC3D,EAAA,IAAI,UAA2B,EAAA,CAAG,IAAA;AAClC,EAAA,OAAO,YAAY,OAAA,EAAS;AAE1B,IAAA,OAAA,GAAU,OAAA,CAAQ,IAAA;AAAA,EACpB;AAEA,EAAA,OAAO,OAAA,CAAQ,UAAA;AACjB;AAWA,SAAS,qBAAqBH,MAAAA,EAAyB;AAErD,EAAA,IAAI,UAAmCA,MAAAA,CAAM,WAAA;AAC7C,EAAA,IACE,OAAA,KAAY,MAAA,IACZA,MAAAA,CAAM,IAAA,CAAK,MAAA,GAAS,KACpBA,MAAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,OAAA,EAClB;AACA,IAAA,OAAA,GAAU,WAAA,CAAYA,MAAAA,CAAM,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,EAC3C;AAGA,EAAA,MAAM,QAAA,GACJA,MAAAA,CAAM,IAAA,CAAK,MAAA,GAAS,KAAKA,MAAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,OAAA,GACzC,OAAA,GACAA,MAAAA,CAAM,IAAA,CAAK,KAAK,GAAG,CAAA;AAEvB,EAAA,OAAO,GAAGA,MAAAA,CAAM,KAAK,IAAI,QAAQ,CAAA,CAAA,EAAI,WAAW,EAAE,CAAA,CAAA;AACpD;AAQA,SAAS,sBAAA,CACPA,QACA,UAAA,EAC4B;AAC5B,EAAA,MAAM,SAAA,GAAY,qBAAqBA,MAAK,CAAA;AAE5C,EAAA,KAAA,MAAW,SAAA,IAAa,WAAW,MAAA,EAAQ;AACzC,IAAA,MAAM,SAAS,SAAA,CAAU,MAAA;AAGzB,IAAA,IAAI,EAAE,QAAA,IAAY,MAAA,CAAA,IAAW,MAAA,CAAO,WAAW,WAAA,EAAa;AAG5D,IAAA,IAAI,oBAAA,CAAqB,MAAM,CAAA,KAAM,SAAA,EAAW;AAC9C,MAAA,OAAO,SAAA;AAAA,IACT;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT;AAWA,SAAS,8BAAA,CACP,IACA,OAAA,EACO;AACP,EAAA,MAAM,UAAiB,EAAC;AAGxB,EAAA,IAAI,EAAA,CAAG,OAAA,IAAW,EAAA,CAAG,OAAA,CAAQ,SAAS,CAAA,EAAG;AACvC,IAAA,MAAM,UAAA,GAAa,sBAAsB,EAAE,CAAA;AAG3C,IAAA,IAAI,UAAA,CAAW,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG;AAClC,MAAA,MAAM,IAAI,yBAAA;AAAA,QACR;AAAA,OAGF;AAAA,IACF;AAEA,IAAA,MAAM,aAAoB,EAAC;AAE3B,IAAA,KAAA,MAAW,SAAA,IAAa,GAAG,OAAA,EAAS;AAClC,MAAA,MAAM,SAAA,GAAY,sBAAA,CAAuB,SAAA,CAAU,KAAA,EAAO,UAAU,CAAA;AAEpE,MAAA,IAAI,CAAC,SAAA,EAAW;AAEd,QAAA,MAAM,SAAA,GACJ,UAAU,KAAA,CAAM,WAAA,GACd,GAAG,SAAA,CAAU,KAAA,CAAM,KAAK,CAAA,MAAA,EAAS,SAAA,CAAU,KAAA,CAAM,WAAW,CAAA,CAAA,GAC5D,CAAA,EAAG,SAAA,CAAU,KAAA,CAAM,KAAK,CAAA,CAAA,EAAI,UAAU,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA;AAC9D,QAAA,MAAM,eAAA,GAAkB,UAAA,CAAW,MAAA,CAChC,GAAA,CAAI,CAAC,MAAM,CAAA,CAAE,UAAU,CAAA,CACvB,IAAA,CAAK,IAAI,CAAA;AACZ,QAAA,MAAM,IAAI,yBAAA;AAAA,UACR,CAAA,8BAAA,EAAiC,SAAS,CAAA,qHAAA,EAElB,eAAe,CAAA;AAAA,SACzC;AAAA,MACF;AAGA,MAAA,MAAM,YAAYG,GAAAA,CAAI,GAAA,CAAI,QAAQ,eAAA,CAAgB,SAAA,CAAU,UAAU,CAAC,CAAA;AACvE,MAAA,MAAM,MAAMA,GAAAA,CAAI,GAAA,CAAI,SAAA,CAAU,SAAA,CAAU,aAAa,CAAA;AAIrD,MAAA,MAAM,QACJ,SAAA,CAAU,KAAA,KAAU,SAAA,CAAU,SAAA,KAAc,QAAQ,MAAA,GAAS,OAAA,CAAA;AAC/D,MAAA,MAAM,WAAWA,GAAAA,CAAI,GAAA,CAAI,KAAA,KAAU,OAAA,GAAU,SAAS,KAAK,CAAA;AAG3D,MAAA,UAAA,CAAW,IAAA;AAAA,QACTA,GAAAA,CAAAA,CAAAA,EAAO,SAAS,CAAA,UAAA,EAAa,QAAQ,CAAA,CAAA;AAAA,QACrCA,GAAAA,CAAAA,EAAM,SAAS,CAAA,CAAA,EAAI,GAAG,CAAA;AAAA,OACxB;AAAA,IACF;AAEA,IAAA,OAAA,CAAQ,KAAKA,GAAAA,CAAAA,SAAAA,EAAeA,GAAAA,CAAI,KAAK,UAAA,EAAYA,GAAAA,CAAAA,EAAAA,CAAO,CAAC,CAAA,CAAE,CAAA;AAAA,EAC7D;AAGA,EAAA,IAAI,EAAA,CAAG,UAAU,MAAA,EAAW;AAC1B,IAAA,OAAA,CAAQ,IAAA,CAAKA,GAAAA,CAAAA,MAAAA,EAAY,EAAA,CAAG,KAAK,CAAA,CAAE,CAAA;AAAA,EACrC;AAGA,EAAA,IAAI,EAAA,CAAG,WAAW,MAAA,EAAW;AAC3B,IAAA,OAAA,CAAQ,IAAA,CAAKA,GAAAA,CAAAA,OAAAA,EAAa,EAAA,CAAG,MAAM,CAAA,CAAE,CAAA;AAAA,EACvC;AAEA,EAAA,OAAO,OAAA;AACT;;;ACnUA,IAAM,mCAAA,GAAsC,CAAA;AAC5C,IAAM,4BAAA,GAA+B,GAAA;AAErC,SAAS,uBAAuB,GAAA,EAAwB;AACtD,EAAA,IAAI,GAAA,CAAI,eAAA,IAAmB,GAAA,CAAI,eAAA,CAAgB,SAAS,CAAA,EAAG;AACzD,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAI,GAAA,CAAI,OAAA,IAAW,GAAA,CAAI,MAAA,EAAQ;AAC7B,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,OAAO,GAAA,CAAI,WAAW,MAAA,CAAO,IAAA;AAAA,IAC3B,CAACH,MAAAA,KAAUA,MAAAA,CAAM,MAAA,CAAO,MAAA,KAAW;AAAA,GACrC;AACF;AAEA,SAAS,6BAAA,CACP,wBACA,UAAA,EACM;AACN,EAAA,QAAQ,WAAW,MAAA;AAAQ,IACzB,KAAK,YAAA,EAAc;AACjB,MAAA,sBAAA,CAAuB,sBAAA,EAAwB,WAAW,IAAI,CAAA;AAC9D,MAAA;AAAA,IACF;AAAA,IACA,KAAK,WAAA;AAAA,IACL,KAAK,YAAA;AAAA,IACL,KAAK,SAAA;AAAA,IACL,KAAK,UAAA;AAAA,IACL,KAAK,WAAA,EAAa;AAChB,MAAA,sBAAA,CAAuB,sBAAA,EAAwB,WAAW,KAAK,CAAA;AAC/D,MAAA;AAAA,IACF;AAAA,IACA,KAAK,KAAA;AAAA,IACL,KAAK,IAAA,EAAM;AACT,MAAA,KAAA,MAAWW,UAAAA,IAAa,WAAW,UAAA,EAAY;AAC7C,QAAA,6BAAA,CAA8B,wBAAwBA,UAAS,CAAA;AAAA,MACjE;AACA,MAAA;AAAA,IACF;AAAA,IACA,KAAK,KAAA,EAAO;AACV,MAAA,6BAAA;AAAA,QACE,sBAAA;AAAA,QACA,UAAA,CAAW;AAAA,OACb;AACA,MAAA;AAAA,IACF;AAAA,IACA,KAAK,sBAAA,EAAwB;AAC3B,MAAA,sBAAA;AAAA,QACE,sBAAA;AAAA,QACA,WAAW,SAAA,CAAU;AAAA,OACvB;AACA,MAAA;AAAA,IACF;AAAA,IACA,KAAK,aAAA,EAAe;AAClB,MAAA,sBAAA,CAAuB,sBAAA,EAAwB,WAAW,KAAK,CAAA;AAC/D,MAAA;AAAA,IACF;AAAA,IACA,KAAK,mBAAA,EAAqB;AACxB,MAAA,sBAAA,CAAuB,sBAAA,EAAwB,WAAW,KAAK,CAAA;AAC/D,MAAA;AAAA,IACF;AAAA,IACA,KAAK,gBAAA,EAAkB;AACrB,MAAA,sBAAA,CAAuB,sBAAA,EAAwB,WAAW,KAAK,CAAA;AAC/D,MAAA;AAAA,IACF;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA;AAAA,IACF;AAAA;AAEJ;AAEA,SAASM,+BAA8B,GAAA,EAAuC;AAC5E,EAAA,MAAM,sBAAA,uBAA6B,GAAA,EAAyB;AAE5D,EAAA,iBAAA,CAAkB,sBAAA,EAAwB,GAAA,CAAI,KAAA,CAAM,KAAA,EAAO,IAAI,CAAA;AAC/D,EAAA,KAAA,MAAW,SAAA,IAAa,IAAI,UAAA,EAAY;AACtC,IAAA,iBAAA,CAAkB,sBAAA,EAAwB,SAAA,CAAU,SAAA,EAAW,IAAI,CAAA;AAAA,EACrE;AAEA,EAAA,IAAI,GAAA,CAAI,eAAA,IAAmB,GAAA,CAAI,eAAA,CAAgB,SAAS,CAAA,EAAG;AACzD,IAAA,KAAA,MAAWjB,MAAAA,IAAS,IAAI,eAAA,EAAiB;AACvC,MAAA,4BAAA,CAA6B,wBAAwBA,MAAK,CAAA;AAAA,IAC5D;AAAA,EACF,CAAA,MAAO;AACL,IAAA,KAAA,MAAW,cAAA,IAAkB,GAAA,CAAI,UAAA,CAAW,MAAA,EAAQ;AAClD,MAAA,MAAM,SAAS,cAAA,CAAe,MAAA;AAC9B,MAAA,IAAI,MAAA,CAAO,WAAW,WAAA,EAAa;AACjC,QAAA,sBAAA,CAAuB,wBAAwB,MAAM,CAAA;AAAA,MACvD,CAAA,MAAO;AACL,QAAA,iBAAA,CAAkB,sBAAA,EAAwB,MAAA,CAAO,KAAA,CAAM,KAAA,EAAO,IAAI,CAAA;AAClE,QAAA,sBAAA,CAAuB,sBAAA,EAAwB,OAAO,KAAK,CAAA;AAAA,MAC7D;AAAA,IACF;AAAA,EACF;AAEA,EAAA,IAAI,IAAI,OAAA,EAAS;AACf,IAAA,KAAA,MAAWA,MAAAA,IAAS,GAAA,CAAI,OAAA,CAAQ,MAAA,EAAQ;AACtC,MAAA,sBAAA,CAAuB,wBAAwBA,MAAK,CAAA;AAAA,IACtD;AAAA,EACF;AAEA,EAAA,IAAI,IAAI,OAAA,EAAS;AACf,IAAA,KAAA,MAAW,SAAA,IAAa,IAAI,OAAA,EAAS;AACnC,MAAA,sBAAA,CAAuB,sBAAA,EAAwB,UAAU,KAAK,CAAA;AAAA,IAChE;AAAA,EACF;AAEA,EAAA,IAAI,IAAI,MAAA,EAAQ;AACd,IAAA,6BAAA,CAA8B,sBAAA,EAAwB,IAAI,MAAM,CAAA;AAAA,EAClE;AAEA,EAAA,KAAA,MAAWW,UAAAA,IAAa,IAAI,UAAA,EAAY;AACtC,IAAA,6BAAA,CAA8B,sBAAA,EAAwBA,WAAU,UAAU,CAAA;AAAA,EAC5E;AAEA,EAAA,OAAO,sBAAA;AACT;AAEA,SAAS,sBAAA,CACP,YACA,KAAA,EACS;AACT,EAAA,QAAQ,WAAW,MAAA;AAAQ,IACzB,KAAK,YAAA,EAAc;AACjB,MAAA,OACE,UAAA,CAAW,OAAO,IAAA,IAClB,UAAA,CAAW,KAAK,KAAA,KAAU,KAAA,IAC1B,YAAA,CAAa,UAAA,CAAW,IAAI,CAAA;AAAA,IAEhC;AAAA,IACA,KAAK,KAAA,EAAO;AACV,MAAA,OAAO,WAAW,UAAA,CAAW,IAAA;AAAA,QAAK,CAACA,UAAAA,KACjC,sBAAA,CAAuBA,UAAAA,EAAW,KAAK;AAAA,OACzC;AAAA,IACF;AAAA,IACA,KAAK,IAAA;AAAA,IACL,KAAK,KAAA;AAAA,IACL,KAAK,WAAA;AAAA,IACL,KAAK,YAAA;AAAA,IACL,KAAK,SAAA;AAAA,IACL,KAAK,UAAA;AAAA,IACL,KAAK,WAAA;AAAA,IACL,KAAK,sBAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,aAAA;AAAA,IACL,KAAK,mBAAA;AAAA,IACL,KAAK,gBAAA,EAAkB;AACrB,MAAA,OAAO,KAAA;AAAA,IACT;AAAA;AAEJ;AAEA,SAAS,2BAAA,CACP,KACA,cAAA,EACS;AACT,EAAA,OAAO,sBAAsB,cAAA,EAAgB,GAAA,CAAI,KAAA,CAAM,KAAA,EAAO,MAAM,CAAA,CAAE,IAAA;AAAA,IACpE,CAACA,UAAAA,KACC,sBAAA,CAAuBA,WAAU,UAAA,EAAY,GAAA,CAAI,MAAM,KAAK;AAAA,GAChE;AACF;AAEA,SAAS,wBAAA,CACP,KACA,cAAA,EACoB;AACpB,EAAA,IAAI,GAAA,CAAI,UAAU,MAAA,EAAW;AAC3B,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,IAAI,GAAA,CAAI,WAAW,MAAA,EAAW;AAC5B,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,IAAI,GAAA,CAAI,SAAS,CAAA,EAAG;AAClB,IAAA,OAAO,CAAA;AAAA,EACT;AAEA,EAAA,IAAI,GAAA,CAAI,OAAA,IAAW,GAAA,CAAI,MAAA,EAAQ;AAC7B,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,IAAI,GAAA,CAAI,OAAA,IAAW,GAAA,CAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACzC,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,IAAI,GAAA,CAAI,UAAA,CAAW,MAAA,GAAS,CAAA,EAAG;AAC7B,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,IAAI,IAAI,UAAA,CAAW,IAAA,CAAK,CAAC,SAAA,KAAc,SAAA,CAAU,QAAQ,CAAA,EAAG;AAC1D,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,IAAI,CAAC,2BAAA,CAA4B,GAAA,EAAK,cAAc,CAAA,EAAG;AACrD,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,gBAAgB,IAAA,CAAK,GAAA;AAAA,IACzB,IAAI,KAAA,GAAQ,mCAAA;AAAA,IACZ;AAAA,GACF;AAEA,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,GAAA,CAAI,KAAA,EAAO,aAAa,CAAA;AAC1C;AAEA,SAAS,mCAAA,CACP,GAAA,EACA,eAAA,EACA,iBAAA,EACS;AACT,EAAA,IAAI,oBAAoB,MAAA,EAAW;AACjC,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,IAAI,sBAAsB,MAAA,EAAW;AACnC,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,IAAI,GAAA,CAAI,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG;AAC/B,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,IAAI,IAAI,UAAA,CAAW,IAAA,CAAK,CAAC,SAAA,KAAc,SAAA,CAAU,QAAQ,CAAA,EAAG;AAC1D,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,IAAI,qBAAA,GAAwB,IAAI,KAAA,CAAM,KAAA;AACtC,EAAA,KAAA,MAAW,SAAA,IAAa,IAAI,UAAA,EAAY;AACtC,IAAA,IAAI,SAAA,CAAU,kBAAkB,qBAAA,EAAuB;AACrD,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,qBAAA,GAAwB,SAAA,CAAU,SAAA;AAAA,EACpC;AAEA,EAAA,IAAI,CAAC,GAAA,CAAI,eAAA,IAAmB,GAAA,CAAI,eAAA,CAAgB,WAAW,CAAA,EAAG;AAC5D,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,IAAI,GAAA,CAAI,OAAA,IAAW,GAAA,CAAI,MAAA,EAAQ;AAC7B,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,IACE,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,IAAA,CAAK,CAACX,WAAUA,MAAAA,CAAM,MAAA,CAAO,MAAA,KAAW,WAAW,CAAA,EACzE;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,OAAO,IAAA;AACT;AAEO,SAAS,6BAAA,CACd,OAAA,EACA,cAAA,EACA,cAAA,EACS;AACT,EAAA,IAAI,CAAC,OAAA,CAAQ,YAAA,CAAa,oCAAA,EAAsC;AAC9D,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,IAAI,kBAAkB,CAAA,EAAG;AACvB,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,OAAO,iBAAiB,cAAA,GAAiB,CAAA;AAC3C;AAkBO,SAAS,4BAAA,CACd,GAAA,EACA,OAAA,EACA,GAAA,EACwB;AACxB,EAAA,IAAI,KAAA,GAAgC;AAAA,IAClC,GAAA;AAAA,IACA,0BAAA,EAA4B,MAAA;AAAA,IAC5B,GAAA;AAAA,IACA,cAAA,EAAgB,MAAA;AAAA,IAChB,iBAAA,EAAmB,MAAA;AAAA,IACnB,MAAA,EAAQ,MAAA;AAAA,IACR,WAAA,EAAa,MAAA;AAAA,IACb,cAAA,EAAgB,oBAAoB,GAAG,CAAA;AAAA,IACvC,sBAAA,EAAwB,MAAA;AAAA,IACxB,sCAAA,EAAwC,KAAA;AAAA,IACxC,kBAAA,EAAoB,MAAA;AAAA,IACpB,iBAAA,EAAmB,MAAA;AAAA,IACnB,eAAA,EAAiB;AAAA,GACnB;AAEA,EAAA,MAAM,UAAA,GAAa,gBAAgB,KAAA,EAAO;AAAA,IACxC,IAAA,EAAM,kBAAA;AAAA,IACN,QAAQ,YAAA,EAAqD;AAC3D,MAAA,OAAO,sBAAA;AAAA,QACL,YAAA,CAAa,GAAA;AAAA,QACb,aAAa,GAAA,CAAI,OAAA;AAAA,QACjB,aAAa,GAAA,CAAI;AAAA,OACnB,CAAE,eAAA;AAAA,IACJ,CAAA;AAAA,IACA,MAAA,CAAO,cAAc,eAAA,EAAyC;AAC5D,MAAA,OAAO;AAAA,QACL,GAAG,YAAA;AAAA,QACH;AAAA,OACF;AAAA,IACF;AAAA,GACD,CAAA;AACD,EAAA,KAAA,GAAQ,UAAA,CAAW,KAAA;AAEnB,EAAA,MAAM,YAAA,GAAe,gBAAgB,KAAA,EAAO;AAAA,IAC1C,IAAA,EAAM,oBAAA;AAAA,IACN,QAAQ,YAAA,EAAkD;AACxD,MAAA,OAAO,wBAAA;AAAA,QACL,YAAA,CAAa,GAAA;AAAA,QACb,aAAa,GAAA,CAAI;AAAA,OACnB,CAAE,iBAAA;AAAA,IACJ,CAAA;AAAA,IACA,MAAA,CAAO,cAAc,iBAAA,EAA2C;AAC9D,MAAA,OAAO;AAAA,QACL,GAAG,YAAA;AAAA,QACH;AAAA,OACF;AAAA,IACF;AAAA,GACD,CAAA;AACD,EAAA,KAAA,GAAQ,YAAA,CAAa,KAAA;AAErB,EAAA,MAAM,UAAA,GAAa,gBAAgB,KAAA,EAAO;AAAA,IACxC,IAAA,EAAM,eAAA;AAAA,IACN,QAAQ,YAAA,EAA+C;AACrD,MAAA,OAAO,mBAAA;AAAA,QACL,YAAA,CAAa,GAAA;AAAA,QACb,YAAA,CAAa,eAAA;AAAA,QACb,YAAA,CAAa;AAAA,OACf,CAAE,MAAA;AAAA,IACJ,CAAA;AAAA,IACA,MAAA,CAAO,cAAc,MAAA,EAAgC;AACnD,MAAA,OAAO;AAAA,QACL,GAAG,YAAA;AAAA,QACH;AAAA,OACF;AAAA,IACF;AAAA,GACD,CAAA;AACD,EAAA,KAAA,GAAQ,UAAA,CAAW,KAAA;AAEnB,EAAA,MAAM,YAAA,GAAe,gBAAgB,KAAA,EAAO;AAAA,IAC1C,IAAA,EAAM,kBAAA;AAAA,IACN,QAAQ,YAAA,EAAkC;AACxC,MAAA,OAAO,wBAAA;AAAA,QACL,YAAA,CAAa,GAAA;AAAA,QACb,YAAA,CAAa,GAAA,CAAI,OAAA,CAAQ,gBAAA;AAAiB,OAC5C;AAAA,IACF,CAAA;AAAA,IACA,MAAA,CAAO,cAAc,kBAAA,EAA4C;AAC/D,MAAA,OAAO;AAAA,QACL,GAAG,YAAA;AAAA,QACH;AAAA,OACF;AAAA,IACF;AAAA,GACD,CAAA;AACD,EAAA,KAAA,GAAQ,YAAA,CAAa,KAAA;AAErB,EAAA,MAAM,iBAAA,GAAoB,gBAAgB,KAAA,EAAO;AAAA,IAC/C,IAAA,EAAM,gBAAA;AAAA,IACN,QAAQ,YAAA,EAAkD;AACxD,MAAA,OAAO,uBAAuB,YAAA,CAAa,GAAG,IAC1CiB,8BAAAA,CAA8B,YAAA,CAAa,GAAG,CAAA,GAC9C,MAAA;AAAA,IACN,CAAA;AAAA,IACA,MAAA,CAAO,cAAc,sBAAA,EAAgD;AACnE,MAAA,OAAO;AAAA,QACL,GAAG,YAAA;AAAA,QACH;AAAA,OACF;AAAA,IACF;AAAA,GACD,CAAA;AACD,EAAA,KAAA,GAAQ,iBAAA,CAAkB,KAAA;AAE1B,EAAA,MAAM,4BAAA,GAA+B,gBAAgB,KAAA,EAAO;AAAA,IAC1D,IAAA,EAAM,4BAAA;AAAA,IACN,QAAQ,YAAA,EAGL;AACD,MAAA,MAAM,sCAAA,GACJ,mCAAA;AAAA,QACE,YAAA,CAAa,GAAA;AAAA,QACb,YAAA,CAAa,eAAA;AAAA,QACb,YAAA,CAAa;AAAA,OACf;AACF,MAAA,MAAM,aAAA,GAAgB,YAAA,CAAa,GAAA,CAAI,UAAA,CAAW,GAAG,EAAE,CAAA;AACvD,MAAA,MAAM,6BACJ,sCAAA,IAA0C,aAAA,KAAkB,SAC1D,CAAA,IAAA,EAAO,aAAA,CAAc,SAAS,CAAA,CAAA,GAC9B,MAAA;AAEJ,MAAA,OAAO;AAAA,QACL,0BAAA;AAAA,QACA;AAAA,OACF;AAAA,IACF,CAAA;AAAA,IACA,MAAA,CACE,YAAA,EACA,EAAE,0BAAA,EAA4B,wCAAuC,EAC7C;AACxB,MAAA,OAAO;AAAA,QACL,GAAG,YAAA;AAAA,QACH,0BAAA;AAAA,QACA;AAAA,OACF;AAAA,IACF;AAAA,GACD,CAAA;AACD,EAAA,KAAA,GAAQ,4BAAA,CAA6B,KAAA;AAErC,EAAA,MAAM,kBAAA,GAAqB,gBAAgB,KAAA,EAAO;AAAA,IAChD,IAAA,EAAM,iBAAA;AAAA,IACN,QAAQ,YAAA,EAAkC;AACxC,MAAA,OAAO,wBAAA;AAAA,QACL,YAAA,CAAa,GAAA;AAAA,QACb,YAAA,CAAa;AAAA,OACf;AAAA,IACF,CAAA;AAAA,IACA,MAAA,CAAO,cAAc,iBAAA,EAA2C;AAC9D,MAAA,OAAO;AAAA,QACL,GAAG,YAAA;AAAA,QACH;AAAA,OACF;AAAA,IACF;AAAA,GACD,CAAA;AACD,EAAA,KAAA,GAAQ,kBAAA,CAAmB,KAAA;AAI3B,EAAA,KAAA,GAAQ;AAAA,IACN,GAAG,KAAA;AAAA,IACH,cAAA,EAAgB,yBAAA;AAAA,MACd,uBAAA,CAAwB,KAAA,CAAM,GAAA,CAAI,KAAA,EAAO,MAAM,eAAe,CAAA;AAAA,MAC9D,KAAA,CAAM;AAAA;AACR,GACF;AAEA,EAAA,MAAM,eAAA,GAAkB,gBAAgB,KAAA,EAAO;AAAA,IAC7C,IAAA,EAAM,cAAA;AAAA,IACN,QAAQ,YAAA,EAA2B;AACjC,MAAA,MAAM,aAAA,GAAgB;AAAA,QACpB,KAAK,YAAA,CAAa,GAAA;AAAA,QAClB,OAAA,EAAS,YAAA,CAAa,GAAA,CAAI,OAAA,CAAQ,IAAA;AAAA,QAClC;AAAA,OACF;AAEA,MAAA,OAAO,+BAAA,CAAgC;AAAA,QACrC,GAAG,aAAA;AAAA,QACH,GAAI,YAAA,CAAa,0BAAA,KAA+B,MAAA,GAC9C,EAAC,GACD;AAAA,UACE,4BAA4B,YAAA,CAAa;AAAA,SAC3C;AAAA,QACF,GAAI,aAAa,cAAA,KAAmB,MAAA,GAClC,EAAC,GACD,EAAE,cAAA,EAAgB,YAAA,CAAa,cAAA,EAAe;AAAA,QAChD,GAAI,aAAa,eAAA,KAAoB,MAAA,GACnC,EAAC,GACD,EAAE,eAAA,EAAiB,YAAA,CAAa,eAAA,EAAgB;AAAA,QAClD,GAAI,aAAa,iBAAA,KAAsB,MAAA,GACrC,EAAC,GACD,EAAE,iBAAA,EAAmB,YAAA,CAAa,iBAAA;AAAkB,OACvD,CAAA;AAAA,IACH,CAAA;AAAA,IACA,MAAA,CAAO,cAAc,WAAA,EAAqC;AACxD,MAAA,OAAO;AAAA,QACL,GAAG,YAAA;AAAA,QACH;AAAA,OACF;AAAA,IACF;AAAA,GACD,CAAA;AACD,EAAA,KAAA,GAAQ,eAAA,CAAgB,KAAA;AAExB,EAAA,OAAO,KAAA;AACT;;;AC9VO,SAAS,YAAA,CACd,GAAA,EACA,OAAA,EACA,OAAA,GAA4C,QAAA,EACvC;AAEL,EAAA,MAAM,WACJ,OAAO,OAAA,KAAY,WAAW,EAAE,OAAA,EAAS,SAAQ,GAAI,OAAA;AACvD,EAAA,MAAM,OAAA,GAAU,SAAS,OAAA,IAAW,QAAA;AACpC,EAAA,MAAM,MAAA,GAAS,SAAS,MAAA,IAAU,kBAAA;AAElC,EAAA,MAAM,OAAA,GAAU,qBAAA,CAAsB,OAAA,EAAS,QAAA,CAAS,gBAAgB,CAAA;AACxE,EAAA,MAAM,GAAA,GAAgC;AAAA,IACpC,OAAA,EAAS,OAAA;AAAA,IACT,MAAA;AAAA,IACA,YAAA,EAAc,CAAC,MAAA,EAAQ,UAAA,KACrB,aAAa,MAAA,EAAQ,UAAA,EAAY,gBAAA,CAAiB,QAAQ,CAAC,CAAA;AAAA,IAC7D,GAAI,SAAS,cAAA,KAAmB,MAAA,GAC9B,EAAC,GACD,EAAE,cAAA,EAAgB,QAAA,CAAS,cAAA,EAAe;AAAA,IAC5C,eAAA,EAAiB,SAAS,eAAA,IAAmB,IAAA;AAAA,IAC7C,GAAI,SAAS,WAAA,KAAgB,MAAA,GAC3B,EAAC,GACD,EAAE,WAAA,EAAa,QAAA,CAAS,WAAA;AAAY,GACxC;AAGA,EAAA,IAAI,0BAAA,CAA2B,GAAG,CAAA,EAAG;AACnC,IAAA,MAAM,OAAA,GAAU,oCAAoC,GAAG,CAAA;AACvD,IAAA,IAAI,YAAY,MAAA,EAAW;AACzB,MAAA,OAAO,oBAAA,CAAqB,OAAA,EAAS,OAAA,EAAS,GAAG,CAAA;AAAA,IACnD;AACA,IAAA,OAAO,0BAAA,CAA2B,GAAA,EAAK,OAAA,EAAS,GAAG,CAAA;AAAA,EACrD;AAGA,EAAA,OAAO,oBAAA,CAAqB,GAAA,EAAK,OAAA,EAAS,GAAG,CAAA;AAC/C;AAEA,SAAS,oCACP,GAAA,EACsB;AACtB,EAAA,IAAI,GAAA,CAAI,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG;AAC/B,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,SAAA,GAAY,GAAA,CAAI,UAAA,CAAW,CAAC,CAAA;AAClC,EAAA,MAAM,iBAAiB,SAAA,CAAU,cAAA;AACjC,EAAA,IAAI,CAAC,cAAA,EAAgB;AACnB,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,IAAI,cAAA,CAAe,QAAA,KAAa,CAAA,IAAK,cAAA,CAAe,aAAa,CAAA,EAAG;AAClE,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,IACE,cAAA,CAAe,SAAA,KAAc,MAAA,IAC7B,cAAA,CAAe,eAAe,MAAA,EAC9B;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,EAAE,cAAA,EAAgB,GAAA,EAAK,GAAG,uBAAsB,GAAI,SAAA;AAE1D,EAAA,OAAO;AAAA,IACL,GAAG,GAAA;AAAA,IACH,UAAA,EAAY,CAAC,qBAAqB;AAAA,GACpC;AACF;AAUO,SAASC,oBAAAA,CACd,EAAA,EACA,OAAA,EACA,OAAA,GAA4C,QAAA,EACvC;AAEL,EAAA,MAAM,WACJ,OAAO,OAAA,KAAY,WAAW,EAAE,OAAA,EAAS,SAAQ,GAAI,OAAA;AACvD,EAAA,MAAM,OAAA,GAAU,SAAS,OAAA,IAAW,QAAA;AAEpC,EAAA,MAAM,OAAA,GAAU,qBAAA,CAAsB,OAAA,EAAS,QAAA,CAAS,gBAAgB,CAAA;AACxE,EAAA,OAAO,mBAAA;AAAA,IACL,EAAA;AAAA,IACA,OAAA;AAAA,IACA,OAAA;AAAA,IACA,CAAC,KAAK,GAAA,KAAQ,YAAA,CAAa,KAAK,GAAA,EAAK,gBAAA,CAAiB,QAAQ,CAAC,CAAA;AAAA,IAC/D,QAAA,CAAS;AAAA,GACX;AACF;AAUA,SAAS,qBAAA,CACP,SACA,gBAAA,EACgB;AAChB,EAAA,MAAM,WAAA,GAAc,WAAW,OAAO,CAAA;AACtC,EAAA,IACE,gBAAA,KAAqB,MAAA,IACrB,gBAAA,KAAqB,WAAA,CAAY,QAAA,EACjC;AACA,IAAA,OAAO,WAAA;AAAA,EACT;AACA,EAAA,OAAO,EAAE,GAAG,WAAA,EAAa,QAAA,EAAU,gBAAA,EAAiB;AACtD;AAGA,SAAS,iBAAiB,QAAA,EAAoD;AAC5E,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,SAAS,OAAA,IAAW,QAAA;AAAA,IAC7B,GAAI,SAAS,MAAA,KAAW,MAAA,GAAY,EAAC,GAAI,EAAE,MAAA,EAAQ,QAAA,CAAS,MAAA,EAAO;AAAA,IACnE,GAAI,SAAS,gBAAA,KAAqB,MAAA,GAChC,EAAC,GACD,EAAE,gBAAA,EAAkB,QAAA,CAAS,gBAAA,EAAiB;AAAA,IAChD,GAAI,SAAS,cAAA,KAAmB,MAAA,GAC9B,EAAC,GACD,EAAE,cAAA,EAAgB,QAAA,CAAS,cAAA,EAAe;AAAA,IAC5C,eAAA,EAAiB,SAAS,eAAA,IAAmB,IAAA;AAAA,IAC7C,GAAI,SAAS,WAAA,KAAgB,MAAA,GAC3B,EAAC,GACD,EAAE,WAAA,EAAa,QAAA,CAAS,WAAA;AAAY,GACxC;AACF;AAkBA,SAAS,8BACP,GAAA,EACwC;AACxC,EAAA,IAAI,GAAA,CAAI,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG;AAC/B,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,IAAI,GAAA,CAAI,OAAA,EAAS,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG;AACpC,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,IAAI,GAAA,CAAI,WAAW,MAAA,EAAW;AAC5B,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,IACE,GAAA,CAAI,OAAA,EAAS,IAAA,CAAK,CAAC,SAAA,KAAc,SAAA,CAAU,KAAA,CAAM,KAAA,KAAU,GAAA,CAAI,KAAA,CAAM,KAAK,CAAA,EAC1E;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,SAAA,GAAY,GAAA,CAAI,UAAA,CAAW,CAAC,CAAA;AAClC,EAAA,IAAA,CAAK,SAAA,CAAU,gBAAA,EAAkB,MAAA,IAAU,CAAA,IAAK,CAAA,EAAG;AACjD,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,UAAA,GAAa,GAAA,CAAI,OAAA,CAAQ,MAAA,CAAO,CAAC,CAAA;AACvC,EAAA,IAAI,UAAA,CAAW,UAAU,GAAA,CAAI,KAAA,CAAM,SAAS,CAAC,YAAA,CAAa,UAAU,CAAA,EAAG;AACrE,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,IAAI,iBAAA,GAAoB,KAAA;AACxB,EAAA,IAAI,yBAAA,GAA4B,KAAA;AAChC,EAAA,IAAI,iBAAA,GAAoB,KAAA;AACxB,EAAA,IAAI,yBAAA,GAA4B,KAAA;AAEhC,EAAA,KAAA,MAAW,cAAA,IAAkB,GAAA,CAAI,UAAA,CAAW,MAAA,EAAQ;AAClD,IAAA,MAAM,SAAS,cAAA,CAAe,MAAA;AAE9B,IAAA,IAAI,CAAC,eAAA,CAAgB,MAAM,CAAA,EAAG;AAC5B,MAAA,IAAI,MAAA,CAAO,KAAA,KAAU,GAAA,CAAI,KAAA,CAAM,KAAA,EAAO;AACpC,QAAA,OAAO,MAAA;AAAA,MACT;AACA,MAAA;AAAA,IACF;AAEA,IAAA,IAAI,CAAC,YAAA,CAAa,MAAA,CAAO,KAAK,CAAA,EAAG;AAC/B,MAAA,OAAO,MAAA;AAAA,IACT;AAEA,IAAA,MAAM,YAAA,GAAe,MAAA,CAAO,KAAA,CAAM,KAAA,KAAU,SAAA,CAAU,SAAA;AACtD,IAAA,MAAM,YAAA,GAAe,MAAA,CAAO,KAAA,CAAM,KAAA,KAAU,SAAA,CAAU,SAAA;AACtD,IAAA,IAAI,CAAC,YAAA,IAAgB,CAAC,YAAA,EAAc;AAClC,MAAA,OAAO,MAAA;AAAA,IACT;AAEA,IAAA,IAAI,MAAA,CAAO,aAAa,OAAA,EAAS;AAC/B,MAAA,IAAI,cAAc,iBAAA,GAAoB,IAAA;AAAA,WACjC,iBAAA,GAAoB,IAAA;AACzB,MAAA;AAAA,IACF;AAEA,IAAA,IAAI,MAAA,CAAO,aAAa,eAAA,EAAiB;AACvC,MAAA,IAAI,cAAc,yBAAA,GAA4B,IAAA;AAAA,WACzC,yBAAA,GAA4B,IAAA;AACjC,MAAA;AAAA,IACF;AAEA,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,IACE,CAAC,iBAAA,IACD,CAAC,6BACD,CAAC,iBAAA,IACD,CAAC,yBAAA,EACD;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,OAAO;AAAA,IACL,SAAA;AAAA,IACA,iBAAA;AAAA,IACA,yBAAA;AAAA,IACA,iBAAA;AAAA,IACA;AAAA,GACF;AACF;AAEA,SAAS,8BACP,GAAA,EACA,OAAA,EACA,KACA,WAAA,EACA,sBAAA,EACA,gBACA,kBAAA,EACiB;AACjB,EAAA,MAAM,IAAA,GAAO,8BAA8B,GAAG,CAAA;AAC9C,EAAA,IAAI,CAAC,IAAA,EAAM;AACT,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM;AAAA,IACJ,SAAA;AAAA,IACA,iBAAA;AAAA,IACA,yBAAA;AAAA,IACA,iBAAA;AAAA,IACA;AAAA,GACF,GAAI,IAAA;AACJ,EAAA,MAAM,EAAE,SAAQ,GAAI,GAAA;AACpB,EAAA,MAAM,UAAA,GAAa,IAAI,KAAA,CAAM,KAAA;AAC7B,EAAA,MAAM,gBAAgB,SAAA,CAAU,aAAA;AAChC,EAAA,MAAM,qBAAA,GAAwB,GAAG,aAAa,CAAA,GAAA,CAAA;AAC9C,EAAA,MAAM,uBAAA,GAA0B,GAAG,aAAa,CAAA,KAAA,CAAA;AAChD,EAAA,MAAM,aAAA,GAAgB,CAAA,IAAA,EAAO,SAAA,CAAU,SAAS,CAAA,OAAA,CAAA;AAChD,EAAA,MAAM,eAAA,GAAkB,CAAA,EAAG,SAAA,CAAU,SAAS,CAAA,MAAA,CAAA;AAC9C,EAAA,MAAM,uBAAA,GAA0B,CAAA,EAAG,SAAA,CAAU,SAAS,CAAA,eAAA,CAAA;AACtD,EAAA,MAAM,eAAA,GAAkB,CAAA,EAAG,SAAA,CAAU,SAAS,CAAA,MAAA,CAAA;AAC9C,EAAA,MAAM,uBAAA,GAA0B,CAAA,EAAG,SAAA,CAAU,SAAS,CAAA,eAAA,CAAA;AAEtD,EAAA,MAAM,iBAAA,GAAoB,oBAAA,CAAqB,GAAA,EAAK,SAAA,CAAU,aAAa,CAAA;AAC3E,EAAA,MAAM,YAAY,CAAC,GAAG,IAAI,GAAA,CAAI,SAAA,CAAU,SAAS,CAAC,CAAA;AAClD,EAAA,MAAM,YAAY,SAAA,CAAU,SAAA;AAE5B,EAAA,MAAM,kBAAA,GAAqB,kBAAA,CAAmB,QAAA,CAAS,GAAG,CAAA;AAC1D,EAAA,MAAM,kBAAA,GAAqB,kBAAA,CAAmB,QAAA,CAAS,GAAG,CAAA;AAE1D,EAAA,MAAM,oBAAA,GAAiD;AAAA,IACrD,GAAG,GAAA;AAAA,IACH,eAAA,EAAiB;AAAA,GACnB;AACA,EAAA,MAAM,oBAAA,GAAuB,uBAAA;AAAA,IAC3B,qBAAA,CAAsB,cAAA,EAAgB,SAAA,CAAU,SAAA,EAAW,MAAM,CAAA;AAAA,IACjE;AAAA,GACF;AAEA,EAAA,MAAM,oBAAA,GAAiD;AAAA,IACrD,GAAG,GAAA;AAAA,IACH,eAAA,EAAiB;AAAA,GACnB;AACA,EAAA,MAAM,oBAAA,GAAuB,uBAAA;AAAA,IAC3B,qBAAA,CAAsB,cAAA,EAAgB,SAAA,CAAU,SAAA,EAAW,MAAM,CAAA;AAAA,IACjE;AAAA,GACF;AAEA,EAAA,MAAM,SAAA,GAAY,SAAA,CAAU,SAAA,KAAc,KAAA,GAAQ,SAAA,GAAY,OAAA;AAC9D,EAAA,MAAM,WAAA,GAAc,SAAA,CAAU,SAAA,KAAc,KAAA,GAAQ,OAAA,GAAU,SAAA;AAC9D,EAAA,MAAM,aAAA,GAAgB,SAAA,CAAU,SAAA,KAAc,KAAA,GAAQ,WAAA,GAAc,SAAA;AACpE,EAAA,MAAM,eAAA,GACJ,SAAA,CAAU,SAAA,KAAc,KAAA,GAAQ,SAAA,GAAY,WAAA;AAQ9C,EAAA,MAAM,iBAAA,GAAoB,qBAAqB,MAAA,GAAS,CAAA;AACxD,EAAA,MAAM,gBAAA,GACJ,qBAAqB,yBAAA,IAA6B,iBAAA;AAiBpD,EAAA,MAAM,YAAA,GAAe,iBAAA;AAErB,EAAA,MAAM,YAAA,GAAe;AAAA,IACnBf,mBAAmB,OAAO,CAAA,CAAA;AAAA,IAC1B,iBAAA,CAAkBA,GAAAA,CAAI,GAAA,CAAI,QAAQ,GAAG,SAAS,CAAA;AAAA,IAC9C,kBAAkBA,GAAAA,CAAI,GAAA,CAAI,KAAK,aAAa,CAAA,CAAE,GAAG,iBAAiB,CAAA;AAAA,IAClE,kBAAkBA,GAAAA,CAAI,GAAA,CAAI,KAAK,eAAe,CAAA,CAAE,GAAG,SAAS,CAAA;AAAA,IAC5D,kBAAA;AAAA,IACA,GAAG,oBAAA;AAAA;AAAA,IAEH,GAAI,oBAAoB,YAAA,GACtB;AAAA,MACE,iBAAA,CAAkBA,GAAAA,CAAI,GAAA,CAAI,QAAQ,GAAG,SAAS,CAAA;AAAA,MAC9C,kBAAA;AAAA,MACA,GAAG;AAAA,QAEL;AAAC,GACL;AAEA,EAAA,MAAM,oBACJ,gBAAA,GACE,YAAA;AAAA;AAAA,IAEE;AAAA,MACEA,GAAAA,CAAAA,uBAAAA,CAAAA;AAAA,MACAA,GAAAA,CAAAA,SAAAA,EAAeA,GAAAA,CAAI,GAAA,CAAI,WAAW,CAAC,CAAA,CAAA;AAAA,MACnCA,GAAAA,CAAAA,WAAAA,EAAiBA,GAAAA,CAAI,GAAA,CAAI,eAAe,CAAC,CAAA;AAAA;AAC3C,MAIA;AAAA,IACEA,GAAAA,CAAAA,uBAAAA,CAAAA;AAAA,IACAA,GAAAA,CAAAA,SAAAA,EAAeA,GAAAA,CAAI,GAAA,CAAI,WAAW,CAAC,CAAA,CAAA;AAAA,IACnCA,GAAAA,CAAAA,WAAAA,EAAiBA,GAAAA,CAAI,GAAA,CAAI,eAAe,CAAC,CAAA,CAAA;AAAA,IACzC,iBAAA,CAAkBA,GAAAA,CAAI,GAAA,CAAI,QAAQ,GAAG,SAAS,CAAA;AAAA,IAC9C;AAAA,MAEJ,EAAC;AAEL,EAAA,MAAM,mBAA0B,EAAC;AACjC,EAAA,IAAI,iBAAA,EAAmB;AACrB,IAAA,gBAAA,CAAiB,KAAKA,GAAAA,CAAAA,eAAAA,EAAqBA,GAAAA,CAAI,GAAA,CAAI,eAAe,CAAC,CAAA,CAAE,CAAA;AAAA,EACvE;AACA,EAAA,IAAI,yBAAA,EAA2B;AAC7B,IAAA,gBAAA,CAAiB,IAAA;AAAA,MACfA,GAAAA,CAAAA,wBAAAA,EAA8BA,GAAAA,CAAI,GAAA,CAAI,uBAAuB,CAAC,CAAA;AAAA,KAChE;AAAA,EACF;AACA,EAAA,IAAI,iBAAA,EAAmB;AACrB,IAAA,gBAAA,CAAiB,KAAKA,GAAAA,CAAAA,eAAAA,EAAqBA,GAAAA,CAAI,GAAA,CAAI,eAAe,CAAC,CAAA,CAAE,CAAA;AAAA,EACvE;AACA,EAAA,IAAI,yBAAA,EAA2B;AAC7B,IAAA,gBAAA,CAAiB,IAAA;AAAA,MACfA,GAAAA,CAAAA,wBAAAA,EAA8BA,GAAAA,CAAI,GAAA,CAAI,uBAAuB,CAAC,CAAA;AAAA,KAChE;AAAA,EACF;AAeA,EAAA,MAAM,gBACJ,SAAA,CAAU,QAAA,IAAY,GAAA,CAAI,OAAA,KAAY,UAAa,GAAA,CAAI,KAAA,KAAU,MAAA,GAC/D,EAAE,OAAO,GAAA,CAAI,KAAA,EAAO,MAAA,EAAQ,GAAA,CAAI,QAAO,GACvC,MAAA;AAEJ,EAAA,MAAM,WAAW,qBAAA,CAAsB;AAAA,IACrC,GAAA;AAAA,IACA,GAAA;AAAA,IACA,OAAA;AAAA,IACA,cAAA;AAAA,IACA,sBAAA;AAAA,IACA,kBAAA;AAAA,IACA,GAAI,aAAA,KAAkB,MAAA,GAAY,EAAC,GAAI,EAAE,aAAa,aAAA;AAAc,GACrE,CAAA;AAED,EAAA,MAAM,qBAAA,GAAwB,eAAe,MAAA,GAAS,WAAA;AACtD,EAAA,MAAM,iBACJ,gBAAA,GACEA,GAAAA;AAAA,QAAA,EACIA,GAAAA,CAAI,GAAA,CAAI,qBAAqB,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,MAAA,CAAO,UAAU,CAAA,MAAA,EAASA,GAAAA,CAAI,IAAA,CAAK,iBAAA,EAAmBA,UAAU,CAAC;AAAA,MAAA,CAAA,GAE3GA,GAAAA,CAAAA,CAAAA;AAEJ,EAAA,MAAM,QAAA,GAAWA,GAAAA;AAAA,IAAA,EACbA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA;AAAA;AAAA,YAAA,EAEdA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAIA,GAAAA,CAAI,GAAA,CAAI,qBAAqB,CAAC,CAAA,IAAA,EAAOA,GAAAA,CAAI,GAAA,CAAI,qBAAqB,CAAC,CAAA;AAAA,YAAA,EAC7FA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAIA,GAAAA,CAAI,GAAA,CAAI,uBAAuB,CAAC,CAAA,IAAA,EAAOA,GAAAA,CAAI,GAAA,CAAI,uBAAuB,CAAC,CAAA;AAAA,QAAA,EACrGA,GAAAA,CAAI,IAAA,CAAK,gBAAA,EAAkBA,GAAAA,CAAAA,EAAAA,CAAO,CAAC;AAAA,eAAA,EAC5BA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC;AAAA,WAAA,EAC1B,IAAI,MAAA,CAAO,UAAU,CAAA,UAAA,EAAaA,GAAAA,CAAI,IAAI,aAAa,CAAC,CAAA,CAAA,EAAIA,GAAAA,CAAI,IAAI,qBAAqB,CAAC,QAAQA,GAAAA,CAAI,GAAA,CAAI,SAAS,CAAC;AAAA,gBAAA,EAC/GA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC,IAAIA,GAAAA,CAAI,GAAA,CAAI,uBAAuB,CAAC,QAAQA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC,GAAG,cAAc;AAAA,YAAA,EAC7GA,GAAAA,CAAI,IAAA,CAAK,YAAA,EAAcA,GAAAA,CAAAA,KAAAA,CAAU,CAAC;AAAA;AAAA,YAAA,EAElCA,GAAAA,CAAI,IAAI,aAAa,CAAC,IAAIA,GAAAA,CAAI,GAAA,CAAI,qBAAqB,CAAC,CAAA;AAAA,YAAA,EACxDA,GAAAA,CAAI,IAAI,aAAa,CAAC,IAAIA,GAAAA,CAAI,GAAA,CAAI,uBAAuB,CAAC;AAAA;AAAA,EAAA,CAAA;AAItE,EAAA,SAAS,mBAAmB,MAAA,EAA+B;AACzD,IAAA,MAAM,MAAA,GAAS,MAAA,CAAO,KAAA,CAAM,KAAA,KAAU,SAAA,CAAU,SAAA;AAChD,IAAA,IAAI,MAAA,CAAO,aAAa,eAAA,EAAiB;AACvC,MAAA,OAAO,SAAS,uBAAA,GAA0B,uBAAA;AAAA,IAC5C;AACA,IAAA,OAAO,SAAS,eAAA,GAAkB,eAAA;AAAA,EACpC;AAEA,EAAA,MAAM,aAAaA,GAAAA,CAAI,IAAA;AAAA,IACrB,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,GAAA,CAAI,CAAC,cAAA,KAAmB;AAC5C,MAAA,MAAM,SAAS,cAAA,CAAe,MAAA;AAE9B,MAAA,IAAI,CAAC,eAAA,CAAgB,MAAM,CAAA,EAAG;AAC5B,QAAA,MAAM,KAAA,GAAQ,iBAAA;AAAA,UACZ,MAAA;AAAA,UACA,OAAA;AAAA,UACA,MAAA,CAAO,SAAA;AAAA,UACP,CAAA,IAAA,EAAO,OAAO,KAAK,CAAA;AAAA,SACrB;AACA,QAAA,OAAOA,MAAM,KAAK,CAAA,IAAA,EAAO,eAAA,CAAgB,cAAA,CAAe,UAAU,CAAC,CAAA,CAAA;AAAA,MACrE;AAEA,MAAA,MAAM,oBAAA,GAAuB,mBAAmB,MAAM,CAAA;AACtD,MAAA,MAAM,UAAA,GAAaA,GAAAA,CAAAA,EAAMA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAIA,GAAAA,CAAI,GAAA,CAAI,oBAAoB,CAAC,CAAA,CAAA;AAChF,MAAA,MAAM,cAAA,GACJ,SAAA,CAAU,QAAA,GAAWA,GAAAA,CAAAA,SAAAA,EAAe,UAAU,CAAA,IAAA,CAAA,GAAS,UAAA;AAEzD,MAAA,OAAOA,MAAM,cAAc,CAAA,IAAA,EAAO,eAAA,CAAgB,cAAA,CAAe,UAAU,CAAC,CAAA,CAAA;AAAA,IAC9E,CAAC,CAAA;AAAA,IACDA,GAAAA,CAAAA,EAAAA;AAAA,GACF;AAEA,EAAA,MAAM,QAAA,GAAW,SAAA,CAAU,QAAA,GAAW,WAAA,GAAc,YAAA;AACpD,EAAA,MAAM,UAAA,GAAaA,GAAAA;AAAA,aAAA,EACNA,GAAAA,CAAI,GAAA,CAAI,UAAU,CAAC;AAAA,IAAA,EAC5BA,GAAAA,CAAI,IAAI,QAAQ,CAAC,IAAIA,GAAAA,CAAI,GAAA,CAAI,aAAa,CAAC;AAAA,SAAA,EACtCA,IAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAIA,GAAAA,CAAI,IAAI,qBAAqB,CAAC,CAAA,OAAA,EAAUA,GAAAA,CAAI,IAAI,aAAa,CAAC,IAAIA,GAAAA,CAAI,GAAA,CAAI,qBAAqB,CAAC;AAAA,UAAA,EACzHA,IAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAIA,GAAAA,CAAI,IAAI,uBAAuB,CAAC,CAAA,OAAA,EAAUA,GAAAA,CAAI,IAAI,aAAa,CAAC,IAAIA,GAAAA,CAAI,GAAA,CAAI,uBAAuB,CAAC;AAAA,EAAA,CAAA;AAGxI,EAAA,MAAM,OAAA,GAAU,oBAAA,CAAqB,EAAE,GAAA,EAAK,SAAS,CAAA;AAQrD,EAAA,MAAM,kBAAA,GACJ,aAAA,KAAkB,MAAA,GAAY,WAAA,GAC5B,yBAAyB,WAAW,CAAA;AAExC,EAAA,MAAM,WAAA,GACJ,aAAA,KAAkB,MAAA,GAChB,sBAAA,CAAuB,EAAE,KAAA,EAAO,GAAA,CAAI,KAAA,EAAO,MAAA,EAAQ,GAAA,CAAI,MAAA,EAAQ,CAAA,GAC/D,MAAA;AAEJ,EAAA,OAAO,oBAAA,CAAqB;AAAA,IAC1B,IAAA,EAAM,CAAC,QAAA,EAAU,QAAQ,CAAA;AAAA,IACzB,UAAA;AAAA,IACA,GAAI,OAAA,KAAY,MAAA,GAAY,EAAC,GAAI,EAAE,OAAA,EAAQ;AAAA,IAC3C,GAAI,WAAA,KAAgB,MAAA,GAAY,EAAC,GAAI,EAAE,WAAA,EAAY;AAAA,IACnD,WAAA,EAAa,kBAAA;AAAA,IACb;AAAA,GACD,CAAA;AACH;AASA,SAAS,yBAAyB,IAAA,EAAgC;AAChE,EAAA,OAAO,EAAE,GAAG,IAAA,EAAM,MAAM,4BAAA,CAA6B,IAAA,CAAK,IAAI,CAAA,EAAE;AAClE;AAEA,SAAS,6BAA6B,IAAA,EAAwC;AAC5E,EAAA,IAAI,IAAA,CAAK,OAAO,cAAA,EAAgB;AAC9B,IAAA,OAAO,4BAAA,CAA6B,KAAK,KAAK,CAAA;AAAA,EAChD;AACA,EAAA,IAAI,WAAW,IAAA,EAAM;AACnB,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,OAAO,4BAAA,CAA6B,IAAA,CAAK,KAAK,CAAA,EAAE;AAAA,EACpE;AACA,EAAA,OAAO,IAAA;AACT;AAWA,IAAM,gCAAA,GAGF;AAAA,EACF,WAAA,EAAa;AACf,CAAA;AAEA,SAAS,oBAAA,CACP,GAAA,EACA,OAAA,EACA,GAAA,EACK;AACL,EAAA,MAAM,QAAA,GAAW,GAAA,CAAI,OAAA,CAAQ,YAAA,CAAa,qBAAA;AAC1C,EAAA,MAAM,OAAA,GAAU,iCAAiC,QAAQ,CAAA;AACzD,EAAA,OAAO,OAAA,CAAQ,GAAA,EAAK,OAAA,EAAS,GAAG,CAAA;AAClC;AAWA,SAAS,sBACP,KAAA,EACiB;AACjB,EAAA,MAAM;AAAA,IACJ,GAAA;AAAA,IACA,0BAAA;AAAA,IACA,OAAA;AAAA,IACA,iBAAA;AAAA,IACA,MAAA;AAAA,IACA;AAAA,GACF,GAAI,KAAA;AACJ,EAAA,IAAI,mBAAmB,iBAAA,EAAmB;AACxC,IAAA,OAAO,6BAAA,CAA8B,EAAE,GAAA,EAAK,OAAA,EAAS,QAAQ,CAAA;AAAA,EAC/D;AACA,EAAA,IAAI,eAAA,EAAiB;AACnB,IAAA,OAAO,0BAAA,CAA2B,EAAE,GAAA,EAAK,OAAA,EAAS,CAAA;AAAA,EACpD;AACA,EAAA,IAAI,iBAAA,EAAmB;AACrB,IAAA,OAAO,4BAAA,CAA6B,EAAE,GAAA,EAAK,OAAA,EAAS,CAAA;AAAA,EACtD;AACA,EAAA,OAAO,oBAAA,CAAqB;AAAA,IAC1B,GAAA;AAAA,IACA,GAAI,0BAAA,KAA+B,MAAA,GACjC,EAAC,GACD,EAAE,0BAAA,EAA2B;AAAA,IAC/B;AAAA,GACD,CAAA;AACH;AAEA,SAAS,6BAAA,CACP,iBACA,iBAAA,EACQ;AACR,EAAA,IAAI,eAAA,KAAoB,MAAA,IAAa,iBAAA,KAAsB,MAAA,EAAW;AACpE,IAAA,OAAO,0BAAA;AAAA,EACT;AACA,EAAA,IAAI,eAAA,KAAoB,QAAW,OAAO,0BAAA;AAC1C,EAAA,OAAO,4BAAA;AACT;AAEA,SAAS,8BAAA,CACP,KACA,SAAA,EACM;AACN,EAAA,IAAI,IAAI,eAAA,EAAiB;AAEzB,EAAA,MAAM,IAAI,kBAAA;AAAA,IACR,GAAG,SAAS,CAAA,yFAAA,CAAA;AAAA,IACZ;AAAA,MACE,UAAA,EAAY,iBAAA;AAAA,MACZ,SAAA;AAAA,MACA,eAAA,EAAiB;AAAA,KACnB;AAAA,IACA;AAAA,MACE,UAAA,EACE;AAAA;AACJ,GACF;AACF;AAEA,SAAS,mCAAA,CACP,GAAA,EACA,OAAA,EACA,GAAA,EACK;AACL,EAAA,MAAM,EAAE,SAAQ,GAAI,GAAA;AACpB,EAAA,MAAM;AAAA,IACJ,0BAAA;AAAA,IACA,cAAA;AAAA,IACA,iBAAA;AAAA,IACA,MAAA;AAAA,IACA,WAAA;AAAA,IACA,cAAA;AAAA,IACA,sBAAA;AAAA,IACA,sCAAA;AAAA,IACA,kBAAA;AAAA,IACA,iBAAA;AAAA,IACA;AAAA,GACF,GAAI,4BAAA,CAA6B,GAAA,EAAK,OAAA,EAAS,GAAG,CAAA;AAElD,EAAA,IAAI,uBAAuB,MAAA,EAAW;AACpC,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,wDAAA;AAAA,MACA,EAAE,OAAO,wBAAA;AAAyB,KACpC;AAAA,EACF;AACA,EAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,iDAAA;AAAA,MACA,EAAE,OAAO,wBAAA;AAAyB,KACpC;AAAA,EACF;AAEA,EAAA,IAAI,eAAA,KAAoB,MAAA,IAAa,iBAAA,KAAsB,MAAA,EAAW;AACpE,IAAA,8BAAA;AAAA,MACE,GAAA;AAAA,MACA,6BAAA,CAA8B,iBAAiB,iBAAiB;AAAA,KAClE;AAAA,EACF;AAEA,EAAA,IAAI,CAAC,eAAA,IAAmB,CAAC,iBAAA,EAAmB;AAC1C,IAAA,MAAM,WAAA,GAAc,6BAAA;AAAA,MAClB,GAAA;AAAA,MACA,OAAA;AAAA,MACA,GAAA;AAAA,MACA,WAAA;AAAA,MACA,sBAAA;AAAA,MACA,cAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,IAAI,WAAA,EAAa;AACf,MAAA,OAAO,WAAA;AAAA,IACT;AAAA,EACF;AAGA,EAAA,MAAM,IAAA,GAAc;AAAA,IAClB,qBAAA,CAAsB;AAAA,MACpB,GAAA;AAAA,MACA,GAAA;AAAA,MACA,OAAA;AAAA,MACA,cAAA;AAAA,MACA,sBAAA;AAAA,MACA;AAAA,KACD;AAAA,GACH;AAGA,EAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,KAAA,GAAQ,GAAA,CAAI,UAAA,CAAW,QAAQ,KAAA,EAAA,EAAS;AAC1D,IAAA,MAAM,uBAAA,GAA0B,6BAAA;AAAA,MAC9B,OAAA;AAAA,MACA,IAAI,UAAA,CAAW,MAAA;AAAA,MACf;AAAA,KACF;AACA,IAAA,IAAA,CAAK,IAAA;AAAA,MACH,yBAAA,CAA0B;AAAA,QACxB,GAAA;AAAA,QACA,2BAAA,EAA6B,sCAAA;AAAA,QAC7B,GAAA;AAAA,QACA,OAAA;AAAA,QACA,cAAA,EAAgB,uBAAA;AAAA,QAChB,cAAA;AAAA,QACA,sBAAA;AAAA,QACA,kBAAA;AAAA,QACA,cAAA,EAAgB,KAAA;AAAA,QAChB,cAAA,EAAgB;AAAA,OACjB;AAAA,KACH;AAAA,EACF;AAGA,EAAA,IAAI,eAAA,EAAiB;AACnB,IAAA,MAAM,SAAA,GAAY,oBAAA,CAAqB,GAAA,EAAK,eAAA,CAAgB,MAAM,KAAK,CAAA;AACvE,IAAA,IAAA,CAAK,IAAA;AAAA,MACH,0BAAA,CAA2B;AAAA,QACzB,GAAA;AAAA,QACA,OAAA;AAAA,QACA,SAAA;AAAA,QACA;AAAA,OACD;AAAA,KACH;AAAA,EACF;AAGA,EAAA,IAAI,iBAAA,EAAmB;AACrB,IAAA,MAAM,SAAA,GAAY,oBAAA,CAAqB,GAAA,EAAK,iBAAA,CAAkB,MAAM,KAAK,CAAA;AACzE,IAAA,IAAA,CAAK,IAAA;AAAA,MACH,wBAAA,CAAyB;AAAA,QACvB,GAAA;AAAA,QACA,iBAAA;AAAA,QACA,OAAA;AAAA,QACA;AAAA,OACD;AAAA,KACH;AAAA,EACF;AAEA,EAAA,IAAI,oBAAA,CAAqB,eAAA,EAAiB,iBAAiB,CAAA,KAAM,MAAA,EAAW;AAC1E,IAAA,IAAA,CAAK,IAAA,CAAK,iCAAiC,CAAA;AAAA,EAC7C;AAGA,EAAA,MAAM,aAAa,uBAAA,CAAwB;AAAA,IACzC,GAAA;AAAA,IACA,GAAI,0BAAA,KAA+B,MAAA,GACjC,EAAC,GACD,EAAE,0BAAA,EAA2B;AAAA,IAC/B;AAAA,GACD,CAAA;AACD,EAAA,MAAM,aAAa,uBAAA,CAAwB;AAAA,IACzC,GAAA;AAAA,IACA,GAAI,0BAAA,KAA+B,MAAA,GACjC,EAAC,GACD,EAAE,0BAAA,EAA2B;AAAA,IAC/B,GAAI,eAAA,KAAoB,MAAA,GAAY,EAAC,GAAI,EAAE,eAAA,EAAgB;AAAA,IAC3D,GAAI,iBAAA,KAAsB,MAAA,GAAY,EAAC,GAAI,EAAE,iBAAA;AAAkB,GAChE,CAAA;AACD,EAAA,MAAM,OAAA,GAAU,oBAAA,CAAqB,EAAE,GAAA,EAAK,SAAS,CAAA;AACrD,EAAA,MAAMgB,OAAAA,GAAS,mBAAA,CAAoB,EAAE,GAAA,EAAK,KAAK,CAAA;AAE/C,EAAA,MAAM,UAAU,qBAAA,CAAsB;AAAA,IACpC,GAAA;AAAA,IACA,0BAAA;AAAA,IACA,OAAA;AAAA,IACA,iBAAA;AAAA,IACA,MAAA;AAAA,IACA;AAAA,GACD,CAAA;AAED,EAAA,MAAM,cAAc,sBAAA,CAAuB;AAAA,IACzC,KAAA,EAAO,cAAA;AAAA,IACP,QAAQ,GAAA,CAAI;AAAA,GACb,CAAA;AAED,EAAA,OAAO,oBAAA,CAAqB;AAAA,IAC1B,IAAA;AAAA,IACA,UAAA;AAAA,IACA,GAAI,OAAA,KAAY,MAAA,GAAY,EAAC,GAAI,EAAE,OAAA,EAAQ;AAAA,IAC3C,GAAIA,OAAAA,KAAW,MAAA,GAAY,EAAC,GAAI,EAAE,QAAAA,OAAAA,EAAO;AAAA,IACzC,GAAI,OAAA,KAAY,MAAA,GAAY,EAAC,GAAI,EAAE,OAAA,EAAQ;AAAA,IAC3C,GAAI,WAAA,KAAgB,MAAA,GAAY,EAAC,GAAI,EAAE,WAAA,EAAY;AAAA,IACnD,WAAA;AAAA,IACA;AAAA,GACD,CAAA;AACH;ACv7BO,SAAS,UAAA,GAAqB;AACnC,EAAA,OAAO,MAAA,EAAO;AAChB;;;ACOO,SAAS,gBAAgB,IAAA,EAAiC;AAC/D,EAAA,MAAM,SAAA,GAAY,CAAA,EAAG,qBAAqB,CAAA,EAAG,qBAAqB,CAAA,CAAA;AAClE,EAAA,IAAI,CAAC,IAAA,IAAQ,IAAA,KAAS,SAAA,SAAkB,EAAC;AAGzC,EAAA,MAAM,OAAA,GAAU,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAChC,EAAA,IAAI,OAAA,KAAY,EAAA,EAAI,OAAO,EAAC;AAE5B,EAAA,OAAO,OAAA,CAAQ,MAAM,qBAAqB,CAAA;AAC5C;AAMO,SAAS,aAAa,KAAA,EAAiC;AAC5D,EAAA,OACE,OAAO,UAAU,QAAA,IACjB,KAAA,CAAM,WAAW,qBAAqB,CAAA,IACtC,KAAA,CAAM,QAAA,CAAS,qBAAqB,CAAA;AAExC;AASO,SAAS,cAAc,KAAA,EAAmC;AAC/D,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACxB,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,IAAI,YAAA,CAAa,KAAK,CAAA,EAAG;AACvB,IAAA,OAAO,gBAAgB,KAAK,CAAA;AAAA,EAC9B;AACA,EAAA,IAAI,mBAAA,CAAoB,KAAK,CAAA,EAAG;AAC9B,IAAA,OAAO,uBAAuB,KAAK,CAAA;AAAA,EACrC;AACA,EAAA,OAAO,EAAC;AACV;AAKA,SAAS,oBAAoB,KAAA,EAAiC;AAC5D,EAAA,OACE,OAAO,UAAU,QAAA,IACjB,KAAA,CAAM,WAAW,cAAc,CAAA,IAC/B,KAAA,CAAM,QAAA,CAAS,YAAY,CAAA;AAE/B;AAMA,SAAS,uBAAuB,KAAA,EAAkC;AAChE,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAC/B,EAAA,IAAI,KAAA,KAAU,EAAA,EAAI,OAAO,EAAC;AAC1B,EAAA,OAAO,KAAA,CAAM,MAAM,yBAAyB,CAAA;AAC9C;;;AC/DO,SAAS,oBAAA,CACd,IAAA,EACA,KAAA,EACA,QAAA,EACoC;AAEpC,EAAA,MAAM,cAAwB,EAAC;AAC/B,EAAA,KAAA,MAAW,SAAA,IAAa,MAAM,UAAA,EAAY;AACxC,IAAA,IAAI,SAAA,CAAU,cAAA,EAAgB,SAAA,KAAc,MAAA,EAAW;AACrD,MAAA,WAAA,CAAY,IAAA,CAAK,SAAA,CAAU,cAAA,CAAe,SAAS,CAAA;AAAA,IACrD;AAAA,EACF;AAEA,EAAA,IAAI,WAAA,CAAY,MAAA,KAAW,CAAA,EAAG,OAAO,IAAA;AAErC,EAAA,MAAM,SAAoC,EAAC;AAC3C,EAAA,IAAI,OAAA,GAAU,KAAA;AACd,EAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,IAAA,IAAI,WAAA;AACJ,IAAA,KAAA,MAAW,SAAS,WAAA,EAAa;AAC/B,MAAA,MAAM,KAAA,GAAQ,IAAI,KAAK,CAAA;AACvB,MAAA,IAAI,UAAU,MAAA,IAAa,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AAChD,QAAA,WAAA,KAAgB,EAAE,GAAG,GAAA,EAAI;AACzB,QAAA,WAAA,CAAY,KAAK,CAAA,GAAI,aAAA,CAAc,KAAK,CAAA;AAAA,MAC1C;AAAA,IACF;AACA,IAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,MAAA,MAAA,CAAO,KAAK,GAAG,CAAA;AAAA,IACjB,CAAA,MAAO;AACL,MAAA,OAAA,GAAU,IAAA;AACV,MAAA,MAAA,CAAO,KAAK,WAAW,CAAA;AAAA,IACzB;AAAA,EACF;AAEA,EAAA,OAAO,UAAU,MAAA,GAAS,IAAA;AAC5B;AAGA,IAAMC,sCAAqB,IAAI,GAAA,CAAI,CAAC,IAAA,EAAM,MAAA,EAAQ,MAAM,CAAC,CAAA;AACzD,IAAMC,mBAAAA,uBAAyB,GAAA,CAAI,CAAC,MAAM,MAAA,EAAQ,QAAA,EAAU,MAAA,EAAQ,MAAM,CAAC,CAAA;AAM3E,SAASN,iBAAmB,KAAA,EAA4C;AACtE,EAAA,OAAO,KAAA,KAAU,OAAO,MAAA,GAAY,KAAA;AACtC;AAMA,SAAS,4BAAA,CACP,MAAA,EACA,KAAA,EACA,YAAA,EACM;AACN,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AAChD,IAAA,IAAI,CAAC,YAAA,CAAa,GAAA,CAAI,GAAG,CAAA,EAAG;AAC1B,MAAA,MAAA,CAAO,GAAG,CAAA,GAAI,KAAA;AAAA,IAChB;AAAA,EACF;AACF;AASO,SAAS,mBAAA,CACd,KACA,KAAA,EAC0B;AAC1B,EAAA,MAAM,EAAA,GAAK,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,GAAA,CAAK,CAAA;AAC5B,EAAA,MAAM,IAAA,GAAO,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,KAAA,CAAO,CAAA;AAChC,EAAA,MAAM,QAAA,GAAoB,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,MAAA,CAAQ,CAAA;AAC9C,EAAA,MAAM,QAAA,GACJ,OAAO,QAAA,KAAa,QAAA,GACjB,KAAK,KAAA,CAAM,QAAQ,CAAA,GAClB,QAAA,IAAoD,EAAC;AAI3D,EAAA,MAAM,OAAA,GAAU,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,QAAA,CAAU,CAAA;AACtC,EAAA,MAAM,SAAA,GAAYA,gBAAAA;AAAA,IAChB,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,WAAA,CAAa;AAAA,GAC3B;AACA,EAAA,MAAM,UAAUA,gBAAAA,CAAgB,GAAA,CAAI,CAAA,EAAG,KAAK,WAAW,CAAkB,CAAA;AACzE,EAAA,MAAM,SAAA,GAAY,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,WAAA,CAAa,CAAA;AAC3C,EAAA,MAAM,SAAA,GAAY,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,WAAA,CAAa,CAAA;AAC3C,EAAA,MAAM,SAAA,GAAYA,gBAAAA;AAAA,IAChB,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,WAAA,CAAa;AAAA,GAC3B;AAEA,EAAA,MAAM,MAAA,GAAkC;AAAA,IACtC,EAAA;AAAA,IACA,IAAA;AAAA,IACA,IAAA,EAAM;AAAA,MACJ,OAAA;AAAA,MACA,SAAA;AAAA,MACA,OAAA;AAAA,MACA,SAAA;AAAA,MACA,SAAA;AAAA,MACA;AAAA;AACF,GACF;AAEA,EAAA,4BAAA,CAA6B,MAAA,EAAQ,UAAUK,mBAAkB,CAAA;AACjE,EAAA,OAAO,MAAA;AACT;AAMA,SAAS,8BAAA,CACP,KACA,KAAA,EACsC;AACtC,EAAA,MAAM,EAAA,GAAK,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,GAAA,CAAK,CAAA;AAC5B,EAAA,IAAI,EAAA,KAAO,IAAA,IAAQ,EAAA,KAAO,MAAA,EAAW;AACnC,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,OAAO,mBAAA,CAAoB,KAAK,KAAK,CAAA;AACvC;AAUA,SAAS,mBAAA,CACP,KACA,KAAA,EAC4B;AAC5B,EAAA,MAAM,EAAA,GAAK,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,GAAA,CAAK,CAAA;AAG5B,EAAA,IAAI,EAAA,KAAO,IAAA,IAAQ,EAAA,KAAO,MAAA,EAAW;AACnC,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,IAAA,GAAO,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,KAAA,CAAO,CAAA;AAChC,EAAA,MAAM,MAAA,GAAS,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,QAAA,CAAU,CAAA;AACrC,EAAA,MAAM,IAAA,GAAO,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,MAAA,CAAQ,CAAA;AAEjC,EAAA,MAAM,QAAA,GAAoB,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,MAAA,CAAQ,CAAA;AAC9C,EAAA,MAAM,QAAA,GACJ,OAAO,QAAA,KAAa,QAAA,GACjB,KAAK,KAAA,CAAM,QAAQ,CAAA,GAClB,QAAA,IAAoD,EAAC;AAI3D,EAAA,MAAM,SAAA,GAAYL,gBAAAA;AAAA,IAChB,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,WAAA,CAAa;AAAA,GAC3B;AACA,EAAA,MAAM,UAAUA,gBAAAA,CAAgB,GAAA,CAAI,CAAA,EAAG,KAAK,WAAW,CAAkB,CAAA;AACzE,EAAA,MAAM,SAAA,GAAY,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,WAAA,CAAa,CAAA;AAC3C,EAAA,MAAM,SAAA,GAAY,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,WAAA,CAAa,CAAA;AAC3C,EAAA,MAAM,SAAA,GAAYA,gBAAAA;AAAA,IAChB,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,WAAA,CAAa;AAAA,GAC3B;AAEA,EAAA,MAAM,MAAA,GAAkC;AAAA,IACtC,EAAA;AAAA,IACA,IAAA;AAAA,IACA,MAAA;AAAA,IACA,IAAA;AAAA,IACA,IAAA,EAAM;AAAA,MACJ,SAAA;AAAA,MACA,OAAA;AAAA,MACA,SAAA;AAAA,MACA,SAAA;AAAA,MACA;AAAA;AACF,GACF;AAEA,EAAA,4BAAA,CAA6B,MAAA,EAAQ,UAAUM,mBAAkB,CAAA;AACjE,EAAA,OAAO,MAAA;AACT;AAMO,SAAS,kBAAA,CAMd,GAAA,EACA,UAAA,EACA,UAAA,EACuD;AAEvD,EAAA,MAAM,OAAA,GAOF;AAAA,IACF,CAAC,UAAU,GAAG,mBAAA,CAAoB,KAAK,UAAU;AAAA,GACnD;AAGA,EAAA,KAAA,MAAW,aAAa,UAAA,EAAY;AAClC,IAAA,MAAM,YAAY,SAAA,CAAU,SAAA;AAC5B,IAAA,MAAM,YAAY,SAAA,CAAU,SAAA;AAG5B,IAAA,OAAA,CAAQ,SAAS,CAAA,GACf,SAAA,CAAU,QAAA,GACR,8BAAA,CAA+B,KAAK,SAAS,CAAA,GAC7C,mBAAA,CAAoB,GAAA,EAAK,SAAS,CAAA;AAGtC,IAAA,OAAA,CAAQ,SAAS,CAAA,GAAI,mBAAA,CAAoB,GAAA,EAAK,SAAS,CAAA;AAGvD,IAAA,MAAM,KAAK,SAAA,CAAU,cAAA;AACrB,IAAA,IAAI,OAAO,MAAA,EAAW;AACpB,MAAA,IAAI,EAAA,CAAG,eAAe,MAAA,EAAW;AAC/B,QAAA,OAAA,CAAQ,EAAA,CAAG,UAAU,CAAA,GAAI,GAAA,CAAI,GAAG,UAAU,CAAA;AAAA,MAC5C;AACA,MAAA,IAAI,EAAA,CAAG,cAAc,MAAA,EAAW;AAC9B,QAAA,OAAA,CAAQ,EAAA,CAAG,SAAS,CAAA,GAAI,GAAA,CAAI,GAAG,SAAS,CAAA;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,OAAA;AACT;AAKO,SAAS,UAAA,CAOd,IAAA,EACA,UAAA,EACA,UAAA,EACA,cAAA,EACc;AACd,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ;AACvB,IAAA,MAAM,OAAA,GAAU,kBAAA;AAAA,MACd,GAAA;AAAA,MACA,UAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,OAAO,eAAe,OAAO,CAAA;AAAA,EAC/B,CAAC,CAAA;AACH;;;AChRA,IAAM,cAAA,GAAiB,CAAA;AAuBhB,SAAS,aAAa,IAAA,EAA0B;AACrD,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,SAAA,CAAU,IAAI,CAAA;AAEhC,EAAA,OAAO,IAAA,CAAK,IAAI,CAAA,CACb,UAAA,CAAW,GAAA,EAAK,GAAG,CAAA,CACnB,UAAA,CAAW,GAAA,EAAK,GAAG,CAAA,CACnB,OAAA,CAAQ,OAAO,EAAE,CAAA;AACtB;AAOO,SAAS,aAAa,MAAA,EAA4B;AACvD,EAAA,IAAI;AAEF,IAAA,IAAI,MAAA,GAAS,OAAO,UAAA,CAAW,GAAA,EAAK,GAAG,CAAA,CAAE,UAAA,CAAW,KAAK,GAAG,CAAA;AAE5D,IAAA,OAAO,MAAA,CAAO,SAAS,CAAA,EAAG;AACxB,MAAA,MAAA,IAAU,GAAA;AAAA,IACZ;AACA,IAAA,MAAM,IAAA,GAAO,KAAK,MAAM,CAAA;AACxB,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA;AAE3B,IAAA,IAAI,OAAO,GAAA,CAAI,CAAA,KAAM,QAAA,IAAY,GAAA,CAAI,IAAI,cAAA,EAAgB;AACvD,MAAA,MAAM,IAAI,eAAA;AAAA,QACR,+BAA+B,MAAA,CAAO,GAAA,CAAI,CAAC,CAAC,wBAAwB,cAAc,CAAA,CAAA;AAAA,QAClF;AAAA,UACE,MAAA,EAAQ;AAAA,YACN;AAAA,cACE,IAAA,EAAM,QAAA;AAAA,cACN,OAAA,EAAS,CAAA,eAAA,EAAkB,MAAA,CAAO,GAAA,CAAI,CAAC,CAAC,CAAA,iBAAA;AAAA;AAC1C;AACF,SACF;AAAA,QACA;AAAA,UACE,UAAA,EAAY,CAAA,2FAAA;AAAA;AACd,OACF;AAAA,IACF;AAEA,IAAA,IAAI,GAAA,CAAI,CAAA,KAAM,GAAA,IAAO,GAAA,CAAI,MAAM,GAAA,EAAK;AAClC,MAAA,MAAM,IAAI,eAAA,CAAgB,CAAA,0BAAA,EAA6B,OAAO,GAAA,CAAI,CAAC,CAAC,CAAA,CAAA,EAAI;AAAA,QACtE,MAAA,EAAQ;AAAA,UACN;AAAA,YACE,IAAA,EAAM,QAAA;AAAA,YACN,OAAA,EAAS,CAAA,iDAAA;AAAA;AACX;AACF,OACD,CAAA;AAAA,IACH;AAEA,IAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA,IAAK,CAAC,KAAA,CAAM,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA,EAAG;AACxD,MAAA,MAAM,IAAI,gBAAgB,0BAAA,EAA4B;AAAA,QACpD,MAAA,EAAQ;AAAA,UACN;AAAA,YACE,IAAA,EAAM,QAAA;AAAA,YACN,OAAA,EAAS;AAAA;AACX;AACF,OACD,CAAA;AAAA,IACH;AAEA,IAAA,IAAI,GAAA,CAAI,IAAA,CAAK,MAAA,KAAW,GAAA,CAAI,KAAK,MAAA,EAAQ;AACvC,MAAA,MAAM,IAAI,gBAAgB,8BAAA,EAAgC;AAAA,QACxD,MAAA,EAAQ;AAAA,UACN;AAAA,YACE,IAAA,EAAM,QAAA;AAAA,YACN,OAAA,EAAS,SAAS,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,YAAA,EAAe,GAAA,CAAI,KAAK,MAAM,CAAA,uBAAA;AAAA;AACjE;AACF,OACD,CAAA;AAAA,IACH;AAEA,IAAA,OAAO;AAAA,MACL,GAAG,GAAA,CAAI,CAAA;AAAA,MACP,GAAG,GAAA,CAAI,CAAA;AAAA,MACP,MAAM,GAAA,CAAI,IAAA;AAAA,MACV,MAAM,GAAA,CAAI;AAAA,KACZ;AAAA,EACF,SAAS,KAAA,EAAO;AACd,IAAA,IAAI,iBAAiB,eAAA,EAAiB;AACpC,MAAA,MAAM,KAAA;AAAA,IACR;AACA,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,uBAAA;AAAA,MACA;AAAA,QACE,QAAQ,CAAC,EAAE,MAAM,QAAA,EAAU,OAAA,EAAS,2BAA2B;AAAA,OACjE;AAAA,MACA,EAAE,OAAO,KAAA;AAAM,KACjB;AAAA,EACF;AACF;AAgBO,SAAS,cAAc,IAAA,EAAyB;AACrD,EAAA,MAAM,EAAE,KAAA,EAAO,IAAA,EAAM,WAAA,EAAAC,YAAAA,KAAgB,IAAA,CAAK,KAAA;AAI1C,EAAA,IAAI,KAAK,MAAA,KAAW,CAAA,IAAK,KAAK,CAAC,CAAA,KAAM,WAAWA,YAAAA,EAAa;AAC3D,IAAA,MAAM,QAASA,YAAAA,CAAuB,KAAA,CAAM,GAAG,CAAA,CAAE,OAAO,OAAO,CAAA;AAC/D,IAAA,OAAO,GAAG,KAAK,CAAA,CAAA,EAAI,KAAA,CAAM,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA;AAAA,EACpC;AAGA,EAAA,IAAI,KAAK,MAAA,IAAU,CAAA,IAAK,IAAA,CAAK,CAAC,MAAM,OAAA,EAAS;AAC3C,IAAA,OAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,IAAA,CAAK,MAAM,CAAC,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA;AAAA,EAC5C;AAGA,EAAA,OAAO,GAAG,KAAK,CAAA,CAAA,EAAI,IAAA,CAAK,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA;AACnC;AAWO,SAAS,kBAAA,CACd,KACA,IAAA,EACS;AACT,EAAA,MAAM,EAAE,KAAA,EAAO,IAAA,EAAM,WAAA,EAAAA,YAAAA,KAAgB,IAAA,CAAK,KAAA;AAG1C,EAAA,IAAI,OAAA,GAAmB,IAAI,KAAK,CAAA;AAChC,EAAA,IAAI,YAAY,MAAA,EAAW;AAEzB,IAAA,KAAA,MAAW,WAAW,IAAA,EAAM;AAC1B,MAAA,IAAI,OAAA,KAAY,IAAA,IAAQ,OAAA,KAAY,MAAA,EAAW,OAAO,MAAA;AACtD,MAAA,IAAI,OAAO,OAAA,KAAY,QAAA,EAAU,OAAO,MAAA;AAExC,MAAA,MAAM,MAAA,GAAS,OAAA;AACf,MAAA,IAAI,YAAY,OAAA,IAAW,CAAC,OAAO,MAAA,CAAO,MAAA,EAAQ,OAAO,CAAA,EAAG;AAC1D,QAAA;AAAA,MACF;AAEA,MAAA,OAAA,GAAU,OAAO,OAAO,CAAA;AAAA,IAC1B;AAGA,IAAA,IAAIA,YAAAA,EAAa;AACf,MAAA,OAAO,kBAAA,CAAmB,SAASA,YAAW,CAAA;AAAA,IAChD;AAEA,IAAA,OAAO,OAAA;AAAA,EACT;AAGA,EAAA,OAAA,GAAU,GAAA;AACV,EAAA,KAAA,MAAW,WAAW,IAAA,EAAM;AAC1B,IAAA,IAAI,OAAA,KAAY,IAAA,IAAQ,OAAA,KAAY,MAAA,EAAW,OAAO,MAAA;AACtD,IAAA,IAAI,OAAO,OAAA,KAAY,QAAA,EAAU,OAAO,MAAA;AACxC,IAAA,OAAA,GAAW,QAAoC,OAAO,CAAA;AAAA,EACxD;AACA,EAAA,OAAO,OAAA;AACT;AAUO,SAAS,kBAAA,CACd,GAAA,EACA,UAAA,EACA,SAAA,EACQ;AACR,EAAA,MAAM,IAAA,GAAO,WAAW,GAAA,CAAI,CAAC,SAAS,kBAAA,CAAmB,GAAA,EAAK,IAAI,CAAC,CAAA;AACnE,EAAA,MAAM,OAAO,UAAA,CAAW,GAAA,CAAI,CAAC,IAAA,KAAS,aAAA,CAAc,IAAI,CAAC,CAAA;AAEzD,EAAA,OAAO,YAAA,CAAa;AAAA,IAClB,CAAA,EAAG,cAAA;AAAA,IACH,CAAA,EAAG,SAAA;AAAA,IACH,IAAA;AAAA,IACA;AAAA,GACD,CAAA;AACH;AAOO,SAAS,qBAAA,CACd,YACA,UAAA,EACM;AACN,EAAA,MAAM,eAAe,UAAA,CAAW,GAAA,CAAI,CAAC,IAAA,KAAS,aAAA,CAAc,IAAI,CAAC,CAAA;AAEjE,EAAA,IAAI,UAAA,CAAW,IAAA,CAAK,MAAA,KAAW,YAAA,CAAa,MAAA,EAAQ;AAClD,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,cAAc,UAAA,CAAW,IAAA,CAAK,MAAM,CAAA,uBAAA,EAA0B,aAAa,MAAM,CAAA,iBAAA,CAAA;AAAA,MACjF;AAAA,QACE,MAAA,EAAQ;AAAA,UACN;AAAA,YACE,IAAA,EAAM,QAAA;AAAA,YACN,SAAS,CAAA,kCAAA,EAAqC,UAAA,CAAW,KAAK,MAAM,CAAA,YAAA,EAAe,aAAa,MAAM,CAAA;AAAA;AACxG;AACF,OACF;AAAA,MACA;AAAA,QACE,UAAA,EAAY,CAAA,oFAAA;AAAA;AACd,KACF;AAAA,EACF;AAEA,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,WAAW,CAAA,IAAK,YAAA,CAAa,SAAQ,EAAG;AACzD,IAAA,IAAI,UAAA,CAAW,IAAA,CAAK,KAAK,CAAA,KAAM,WAAA,EAAa;AAC1C,MAAA,MAAM,IAAI,eAAA;AAAA,QACR,CAAA,mCAAA,EAAsC,KAAK,CAAA,YAAA,EAAe,WAAW,WAAW,UAAA,CAAW,IAAA,CAAK,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,QACtG;AAAA,UACE,MAAA,EAAQ;AAAA,YACN;AAAA,cACE,IAAA,EAAM,QAAA;AAAA,cACN,OAAA,EAAS,UAAU,KAAK,CAAA,YAAA,EAAe,WAAW,CAAA,QAAA,EAAW,UAAA,CAAW,IAAA,CAAK,KAAK,CAAC,CAAA,CAAA;AAAA;AACrF;AACF,SACF;AAAA,QACA;AAAA,UACE,UAAA,EAAY,CAAA,oFAAA;AAAA;AACd,OACF;AAAA,IACF;AAAA,EACF;AACF;;;AC1MO,SAAS,oBAAA,CACd,UAAA,EACA,OAAA,EACA,SAAA,EACA,WAAA,EACe;AACf,EAAA,MAAM,SAAS,UAAA,CAAW,IAAA;AAG1B,EAAA,MAAM,eAAsC,EAAC;AAE7C,EAAA,KAAA,IAAS,KAAA,GAAQ,CAAA,EAAG,KAAA,GAAQ,OAAA,CAAQ,QAAQ,KAAA,EAAA,EAAS;AACnD,IAAA,MAAM,gBAAuC,EAAC;AAG9C,IAAA,KAAA,IAAS,MAAA,GAAS,CAAA,EAAG,MAAA,GAAS,KAAA,EAAO,MAAA,EAAA,EAAU;AAC7C,MAAA,MAAM,IAAA,GAAO,QAAQ,MAAM,CAAA;AAC3B,MAAA,MAAM,KAAA,GAAQ,OAAO,MAAM,CAAA;AAC3B,MAAA,aAAA,CAAc,IAAA,CAAK,sBAAA,CAAuB,IAAA,CAAK,KAAA,EAAO,KAAK,CAAC,CAAA;AAAA,IAC9D;AAGA,IAAA,MAAM,WAAA,GAAc,QAAQ,KAAK,CAAA;AACjC,IAAA,MAAM,YAAA,GAAe,OAAO,KAAK,CAAA;AACjC,IAAA,MAAM,KAAA,GAAQ,YAAY,SAAA,KAAc,KAAA;AACxC,IAAA,MAAM,YAAY,SAAA,KAAc,SAAA;AAGhC,IAAA,MAAM,EAAA,GAAK,KAAA,KAAU,SAAA,GAAY,IAAA,GAAO,IAAA;AAExC,IAAA,aAAA,CAAc,IAAA;AAAA,MACZ,wBAAA,CAAyB,WAAA,CAAY,KAAA,EAAO,EAAA,EAAI,YAAY;AAAA,KAC9D;AAGA,IAAA,IAAI,aAAA,CAAc,WAAW,CAAA,EAAG;AAC9B,MAAA,YAAA,CAAa,IAAA,CAAK,aAAA,CAAc,CAAC,CAAE,CAAA;AAAA,IACrC,CAAA,MAAO;AACL,MAAA,YAAA,CAAa,KAAK,EAAE,MAAA,EAAQ,KAAA,EAAO,UAAA,EAAY,eAAe,CAAA;AAAA,IAChE;AAAA,EACF;AAGA,EAAA,MAAM,UAAA,GACJ,YAAA,CAAa,MAAA,KAAW,CAAA,GACtB,YAAA,CAAa,CAAC,CAAA,GACd,EAAE,MAAA,EAAQ,IAAA,EAAM,UAAA,EAAY,YAAA,EAAa;AAE7C,EAAA,OAAO;AAAA,IACL,WAAA;AAAA,IACA;AAAA,GACF;AACF;AAKA,SAAS,sBAAA,CACPtB,QACA,KAAA,EACqB;AACrB,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,KAAA,KAAU,MAAA,EAAW;AACzC,IAAA,OAAO,EAAE,MAAA,EAAQ,YAAA,EAAc,EAAA,EAAI,QAAA,EAAU,OAAAA,MAAAA,EAAM;AAAA,EACrD;AACA,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,YAAA;AAAA,IACR,EAAA,EAAI,IAAA;AAAA,IACJ,IAAA,EAAMA,MAAAA;AAAA,IACN,KAAA,EAAO,EAAE,MAAA,EAAQ,SAAA,EAAW,KAAA;AAA0C,GACxE;AACF;AAKA,SAAS,wBAAA,CACPA,MAAAA,EACA,EAAA,EACA,KAAA,EACqB;AACrB,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,KAAA,KAAU,MAAA,EAAW;AAGzC,IAAA,OAAO,EAAE,MAAA,EAAQ,YAAA,EAAc,EAAA,EAAI,WAAA,EAAa,OAAAA,MAAAA,EAAM;AAAA,EACxD;AACA,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,YAAA;AAAA,IACR,EAAA;AAAA,IACA,IAAA,EAAMA,MAAAA;AAAA,IACN,KAAA,EAAO,EAAE,MAAA,EAAQ,SAAA,EAAW,KAAA;AAA0C,GACxE;AACF;AAKO,SAAS,sBAAA,CAId,OAAA,EACA,OAAA,EACA,SAAA,EACQ;AACR,EAAA,OAAO,kBAAA,CAAmB,OAAA,EAAS,OAAA,EAAS,SAAS,CAAA;AACvD;AAKO,SAAS,oBAAA,CAKd,MACA,WAAA,EACA,OAAA,EACA,OACA,OAAA,EACA,UAAA,EACA,QACA,YAAA,EAGoB;AACpB,EAAA,IAAI,UAAA;AACJ,EAAA,IAAI,cAAA;AAEJ,EAAA,IAAI,WAAA,CAAY,SAAS,CAAA,EAAG;AAC1B,IAAA,MAAM,QAAA,GAAW,YAAY,CAAC,CAAA;AAC9B,IAAA,MAAM,OAAA,GAAU,WAAA,CAAY,EAAA,CAAG,EAAE,CAAA;AAGjC,IAAA,MAAM,YAAA,GAAe,aAAa,QAAQ,CAAA;AAC1C,IAAA,MAAM,WAAA,GAAc,aAAa,OAAO,CAAA;AAGxC,IAAA,cAAA,GAAiB,sBAAA,CAAuB,YAAA,EAAc,OAAA,EAAS,GAAG,CAAA;AAClE,IAAA,UAAA,GAAa,sBAAA,CAAuB,WAAA,EAAa,OAAA,EAAS,GAAG,CAAA;AAAA,EAC/D;AAEA,EAAA,OAAO;AAAA,IACL,IAAA;AAAA,IACA,UAAA,EAAY,OAAA,IAAW,UAAA,GAAa,UAAA,GAAa,MAAA;AAAA,IACjD,UAAA,EACE,MAAA,KAAW,MAAA,IAAc,UAAA,IAAc,UACrC,cAAA,GACA,MAAA;AAAA,IACJ,WAAA,EAAa,UAAA,GAAa,MAAA,KAAW,MAAA,GAAY,OAAA;AAAA,IACjD,WAAA,EAAa,UAAA,GAAa,OAAA,GAAU,MAAA,KAAW;AAAA,GACjD;AACF;AAKA,gBAAuB,oBAAA,CACrB,WACA,QAAA,EACmB;AACnB,EAAA,IAAI,MAAA;AACJ,EAAA,IAAI,OAAA,GAAU,IAAA;AAEd,EAAA,OAAO,OAAA,EAAS;AACd,IAAA,MAAM,OAAA,GACJ,MAAA,GAAS,EAAE,KAAA,EAAO,SAAA,EAAW,OAAO,MAAA,EAAO,GAAI,EAAE,KAAA,EAAO,SAAA,EAAU;AACpE,IAAA,MAAM,IAAA,GAAO,MAAM,QAAA,CAAS,OAAO,CAAA;AAEnC,IAAA,KAAA,MAAW,IAAA,IAAQ,KAAK,IAAA,EAAM;AAC5B,MAAA,MAAM,IAAA;AAAA,IACR;AAEA,IAAA,MAAA,GAAS,IAAA,CAAK,UAAA;AACd,IAAA,OAAA,GAAU,IAAA,CAAK,WAAA;AAAA,EACjB;AACF;AAKO,SAAS,mBAAmB,OAAA,EAAiC;AAClE,EAAA,OAAO,SAAS,SAAA,IAAa,yBAAA;AAC/B;;;ACjOA,IAAM,2BAAA,uBAAkC,GAAA,CAAY;AAAA,EAClD,WAAA;AAAA,EACA,aAAA;AAAA,EACA,gBAAA;AAAA,EACA,eAAA;AAAA,EACA,sBAAA;AAAA,EACA,gBAAA;AAAA,EACA,UAAA;AAAA,EACA;AACF,CAAC,CAAA;AAMM,IAAM,qBAAN,MAAyB;AAAA,EACrB,OAAA,uBAAc,GAAA,EAA2B;AAAA,EAElD,MAAA,CAAO,KAAA,EAAeA,MAAAA,EAAe,aAAA,EAA8B;AACjE,IAAA,MAAM,GAAA,GAAM,CAAA,EAAG,KAAK,CAAA,EAAA,EAASA,MAAK,CAAA,CAAA;AAClC,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AAIrC,IAAA,IAAI,QAAA,KAAa,MAAA,IAAa,QAAA,CAAS,aAAA,IAAiB,CAAC,aAAA,EAAe;AACtE,MAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,OAAA,CAAQ,IAAI,GAAA,EAAK,EAAE,OAAO,KAAA,EAAAA,MAAAA,EAAO,eAAe,CAAA;AAAA,EACvD;AAAA,EAEA,iBAAA,GAA8C;AAC5C,IAAA,OAAO,CAAC,GAAG,IAAA,CAAK,OAAA,CAAQ,QAAQ,CAAA;AAAA,EAClC;AACF,CAAA;AAMO,SAAS,qBAAA,CACd,KAAA,EACA,OAAA,EACA,OAAA,EACyB;AACzB,EAAA,MAAM,OAAA,GAAmC;AAAA,IACvC,CAAC,KAAA,CAAM,UAAU,GAAG,uBAAA;AAAA,MAClB,KAAA,CAAM,UAAA;AAAA,MACN,KAAA,CAAM,UAAA;AAAA,MACN,OAAA;AAAA,MACA;AAAA;AACF,GACF;AAEA,EAAA,KAAA,MAAW,SAAA,IAAa,MAAM,UAAA,EAAY;AACxC,IAAA,MAAM,aAAA,GAAgB,eAAe,SAAS,CAAA;AAE9C,IAAA,MAAM,cAAA,GACJ,OAAA,CAAQ,wBAAA,KAA6B,QAAA,IAAY,SAAA,CAAU,QAAA;AAE7D,IAAA,OAAA,CAAQ,SAAA,CAAU,SAAS,CAAA,GACzB,cAAA,GAAiB,MAAA,GACf,uBAAA;AAAA,MACE,SAAA,CAAU,SAAA;AAAA,MACV,SAAA,CAAU,SAAA;AAAA,MACV,OAAA;AAAA,MACA;AAAA,KACF;AAGJ,IAAA,OAAA,CAAQ,SAAA,CAAU,SAAS,CAAA,GACzB,cAAA,GAAiB,MAAA,GACf,uBAAA;AAAA,MACE,SAAA,CAAU,SAAA;AAAA,MACV,aAAA;AAAA,MACA,OAAA;AAAA,MACA;AAAA,KACF;AAKJ,IAAA,MAAM,KAAK,SAAA,CAAU,cAAA;AACrB,IAAA,IAAI,OAAO,MAAA,EAAW;AACpB,MAAA,IAAI,EAAA,CAAG,eAAe,MAAA,EAAW;AAC/B,QAAA,OAAA,CAAQ,GAAG,UAAU,CAAA,GAAI,OAAA,CAAQ,IAAA,KAAS,UAAU,CAAA,GAAI,CAAA;AAAA,MAC1D;AACA,MAAA,IAAI,EAAA,CAAG,cAAc,MAAA,EAAW;AAC9B,QAAA,OAAA,CAAQ,EAAA,CAAG,SAAS,CAAA,GAAI,OAAA,CAAQ,SAAS,OAAA,GAAU,EAAC,GAAI,CAAC,aAAa,CAAA;AAAA,MACxE;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,OAAA;AACT;AAEA,SAAS,uBAAA,CACP,KAAA,EACA,SAAA,EACA,OAAA,EACA,OAAA,EACS;AACT,EAAA,OAAO,IAAI,KAAA;AAAA,IACT,EAAC;AAAA,IACD;AAAA,MACE,GAAA,EAAK,CAAC,CAAA,EAAG,QAAA,KAA8B;AACrC,QAAA,IAAI,OAAO,aAAa,QAAA,EAAU;AAClC,QAAA,IAAI,aAAa,MAAA,EAAQ;AACzB,QAAA,IAAI,aAAa,QAAA,EAAU;AAE3B,QAAA,IAAI,2BAAA,CAA4B,GAAA,CAAI,QAAQ,CAAA,EAAG;AAC7C,UAAA,IAAI,QAAA,KAAa,eAAe,OAAO,MAAA;AACvC,UAAA,IAAI,QAAA,KAAa,WAAA,EAAa,OAAO,MAAA,CAAO,SAAA;AAC5C,UAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,MAAA,CAAO,SAAA,EAAW,QAAQ,CAAA;AAAA,QAC/C;AAEA,QAAA,IAAI,QAAA,KAAa,IAAA,IAAQ,QAAA,KAAa,MAAA,EAAQ;AAC5C,UAAA,OAAA,CAAQ,MAAA,CAAO,KAAA,EAAO,QAAA,EAAU,IAAI,CAAA;AACpC,UAAA,OAAO,4BAAA,CAA6B,QAAA,EAAU,OAAA,CAAQ,IAAI,CAAA;AAAA,QAC5D;AAEA,QAAA,IAAI,aAAa,MAAA,EAAQ;AACvB,UAAA,KAAA,MAAW,OAAO,cAAA,EAAgB;AAChC,YAAA,OAAA,CAAQ,MAAA,CAAO,KAAA,EAAO,CAAA,KAAA,EAAQ,GAAG,IAAI,IAAI,CAAA;AAAA,UAC3C;AACA,UAAA,OAAO,wBAAA,CAAyB,QAAQ,IAAI,CAAA;AAAA,QAC9C;AAEA,QAAA,OAAA,CAAQ,MAAA,CAAO,KAAA,EAAO,QAAA,EAAU,KAAK,CAAA;AACrC,QAAA,MAAM,QAAA,GAAW,QAAQ,kBAAA,CAAmB,sBAAA;AAAA,UAC1C,SAAA;AAAA,UACA;AAAA,SACF;AACA,QAAA,OAAO,yBAAA,CAA0B,QAAA,EAAU,OAAA,CAAQ,IAAI,CAAA;AAAA,MACzD;AAAA;AACF,GACF;AACF;AAEA,SAAS,uBAAA,CACP,KAAA,EACA,aAAA,EACA,OAAA,EACA,OAAA,EACS;AACT,EAAA,OAAO,IAAI,KAAA;AAAA,IACT,EAAC;AAAA,IACD;AAAA,MACE,GAAA,EAAK,CAAC,CAAA,EAAG,QAAA,KAA8B;AACrC,QAAA,IAAI,OAAO,aAAa,QAAA,EAAU;AAClC,QAAA,IAAI,aAAa,MAAA,EAAQ;AACzB,QAAA,IAAI,aAAa,QAAA,EAAU;AAE3B,QAAA,IAAI,2BAAA,CAA4B,GAAA,CAAI,QAAQ,CAAA,EAAG;AAC7C,UAAA,IAAI,QAAA,KAAa,eAAe,OAAO,MAAA;AACvC,UAAA,IAAI,QAAA,KAAa,WAAA,EAAa,OAAO,MAAA,CAAO,SAAA;AAC5C,UAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,MAAA,CAAO,SAAA,EAAW,QAAQ,CAAA;AAAA,QAC/C;AAEA,QAAA,IACE,aAAa,IAAA,IACb,QAAA,KAAa,UACb,QAAA,KAAa,QAAA,IACb,aAAa,MAAA,EACb;AACA,UAAA,OAAA,CAAQ,MAAA,CAAO,KAAA,EAAO,QAAA,EAAU,IAAI,CAAA;AACpC,UAAA,OAAO,4BAAA,CAA6B,QAAA,EAAU,OAAA,CAAQ,IAAI,CAAA;AAAA,QAC5D;AAEA,QAAA,IAAI,aAAa,MAAA,EAAQ;AACvB,UAAA,KAAA,MAAW,OAAO,cAAA,EAAgB;AAChC,YAAA,OAAA,CAAQ,MAAA,CAAO,KAAA,EAAO,CAAA,KAAA,EAAQ,GAAG,IAAI,IAAI,CAAA;AAAA,UAC3C;AACA,UAAA,OAAO,wBAAA,CAAyB,QAAQ,IAAI,CAAA;AAAA,QAC9C;AAEA,QAAA,OAAA,CAAQ,MAAA,CAAO,KAAA,EAAO,QAAA,EAAU,KAAK,CAAA;AACrC,QAAA,MAAM,QAAA,GAAW,QAAQ,kBAAA,CAAmB,0BAAA;AAAA,UAC1C,aAAA;AAAA,UACA;AAAA,SACF;AACA,QAAA,OAAO,yBAAA,CAA0B,QAAA,EAAU,OAAA,CAAQ,IAAI,CAAA;AAAA,MACzD;AAAA;AACF,GACF;AACF;AAWO,SAAS,oBAAA,CACd,gBACA,OAAA,EAC2B;AAC3B,EAAA,MAAM,SAAA,GAAY,OAAA,GAAU,iBAAA,CAAkB,OAAA,CAAQ,KAAK,CAAA,GAAI,MAAA;AAE/D,EAAA,OAAO,cAAA,CACJ,GAAA,CAAI,CAAC,MAAA,KAAW;AACf,IAAA,MAAM,IAAA,GAAuB;AAAA,MAC3B,OAAO,MAAA,CAAO,KAAA;AAAA,MACd,OAAO,MAAA,CAAO,KAAA;AAAA,MACd,YAAY,CAAA,EAAG,MAAA,CAAO,KAAK,CAAA,CAAA,EAAI,OAAO,KAAK,CAAA,CAAA;AAAA,MAC3C,eAAe,MAAA,CAAO;AAAA,KACxB;AAEA,IAAA,IAAI,CAAC,OAAA,IAAW,MAAA,CAAO,aAAA,EAAe;AACpC,MAAA,OAAO,IAAA;AAAA,IACT;AAEA,IAAA,MAAM,IAAA,GAAO,SAAA,EAAW,GAAA,CAAI,MAAA,CAAO,KAAK,CAAA;AACxC,IAAA,IAAI,CAAC,IAAA,EAAM;AACT,MAAA,OAAO,IAAA;AAAA,IACT;AAEA,IAAA,MAAM,QAAA,GACJ,IAAA,CAAK,IAAA,KAAS,MAAA,GACZ,QAAQ,kBAAA,CAAmB,sBAAA;AAAA,MACzB,IAAA,CAAK,SAAA;AAAA,MACL,MAAA,CAAO;AAAA,KACT,GACA,QAAQ,kBAAA,CAAmB,0BAAA;AAAA,MACzB,IAAA,CAAK,SAAA;AAAA,MACL,MAAA,CAAO;AAAA,KACT;AAEJ,IAAA,OAAO;AAAA,MACL,GAAG,IAAA;AAAA,MACH,WAAW,QAAA,EAAU;AAAA,KACvB;AAAA,EACF,CAAC,CAAA,CACA,QAAA,CAAS,CAAC,GAAG,CAAA,KAAM;AAClB,IAAA,MAAM,YAAA,GAAe,CAAA,CAAE,KAAA,CAAM,aAAA,CAAc,EAAE,KAAK,CAAA;AAClD,IAAA,IAAI,YAAA,KAAiB,GAAG,OAAO,YAAA;AAC/B,IAAA,OAAO,CAAA,CAAE,KAAA,CAAM,aAAA,CAAc,CAAA,CAAE,KAAK,CAAA;AAAA,EACtC,CAAC,CAAA;AACL;AASA,SAAS,kBACP,KAAA,EACoC;AACpC,EAAA,MAAM,GAAA,uBAAU,GAAA,CAA2B;AAAA,IACzC;AAAA,MACE,KAAA,CAAM,UAAA;AAAA,MACN;AAAA,QACE,IAAA,EAAM,MAAA;AAAA,QACN,WAAW,KAAA,CAAM;AAAA;AACnB;AACF,GACD,CAAA;AAED,EAAA,KAAA,MAAW,SAAA,IAAa,MAAM,UAAA,EAAY;AACxC,IAAA,MAAM,aAAA,GAAgB,eAAe,SAAS,CAAA;AAE9C,IAAA,GAAA,CAAI,GAAA,CAAI,UAAU,SAAA,EAAW;AAAA,MAC3B,IAAA,EAAM,MAAA;AAAA,MACN,WAAW,SAAA,CAAU;AAAA,KACtB,CAAA;AACD,IAAA,GAAA,CAAI,GAAA,CAAI,UAAU,SAAA,EAAW;AAAA,MAC3B,IAAA,EAAM,MAAA;AAAA,MACN,SAAA,EAAW;AAAA,KACZ,CAAA;AAAA,EACH;AAEA,EAAA,OAAO,GAAA;AACT;AAMA,SAAS,4BAAA,CACPA,QACA,IAAA,EACS;AACT,EAAA,IACEA,WAAU,IAAA,IACVA,MAAAA,KAAU,UACVA,MAAAA,KAAU,QAAA,IACVA,WAAU,MAAA,EACV;AACA,IAAA,OAAO,IAAA,KAAS,UAAU,EAAA,GAAK,GAAA;AAAA,EACjC;AACA,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,yBAAyB,IAAA,EAO/B;AACD,EAAA,MAAM,QAAQ,IAAA,KAAS,OAAA;AACvB,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,QAAQ,CAAA,GAAI,CAAA;AAAA,IACrB,SAAA,EAAW,QAAQ,MAAA,GAAY,0BAAA;AAAA,IAC/B,OAAA,EAAS,MAAA;AAAA,IACT,SAAA,EAAW,0BAAA;AAAA,IACX,SAAA,EAAW,0BAAA;AAAA,IACX,SAAA,EAAW;AAAA,GACb;AACF;AAEA,SAAS,yBAAyB,IAAA,EAM/B;AACD,EAAA,MAAM,QAAQ,IAAA,KAAS,OAAA;AACvB,EAAA,OAAO;AAAA,IACL,SAAA,EAAW,QAAQ,MAAA,GAAY,0BAAA;AAAA,IAC/B,OAAA,EAAS,MAAA;AAAA,IACT,SAAA,EAAW,0BAAA;AAAA,IACX,SAAA,EAAW,0BAAA;AAAA,IACX,SAAA,EAAW;AAAA,GACb;AACF;AAEA,SAAS,yBAAA,CACP,UACA,IAAA,EACS;AACT,EAAA,IAAI,CAAC,QAAA,EAAU;AACb,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,OAAO,0BAAA,CAA2B,QAAA,CAAS,SAAA,EAAW,IAAI,CAAA;AAC5D;AAEA,SAAS,0BAAA,CACP,WACA,IAAA,EACS;AACT,EAAA,QAAQ,SAAA;AAAW,IACjB,KAAK,QAAA;AAAA,IACL,KAAK,MAAA,EAAQ;AACX,MAAA,IAAI,IAAA,KAAS,SAAS,OAAO,EAAA;AAC7B,MAAA,IAAI,IAAA,KAAS,OAAO,OAAO,QAAA;AAC3B,MAAA,OAAO,GAAA;AAAA,IACT;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA,IAAI,IAAA,KAAS,SAAS,OAAO,CAAA;AAC7B,MAAA,IAAI,IAAA,KAAS,OAAO,OAAO,GAAA;AAC3B,MAAA,OAAO,CAAA;AAAA,IACT;AAAA,IACA,KAAK,SAAA,EAAW;AACd,MAAA,OAAO,IAAA,KAAS,OAAA;AAAA,IAClB;AAAA,IACA,KAAK,OAAA;AAAA,IACL,KAAK,WAAA,EAAa;AAChB,MAAA,OAAO,EAAC;AAAA,IACV;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA,OAAO,EAAC;AAAA,IACV;AAAA,IACA,KAAK,SAAA,EAAW;AACd,MAAA,OAAO,MAAA;AAAA,IACT;AAAA;AAEJ;;;ACtYO,IAAM,0BAAA,GAAN,cAAyC,KAAA,CAAM;AAAA,EAC3C,KAAA;AAAA,EACA,KAAA;AAAA,EAET,WAAA,CAAY,OAAeA,MAAAA,EAAe;AACxC,IAAA,KAAA,CAAM,CAAA,4BAAA,EAA+B,KAAK,CAAA,CAAA,EAAIA,MAAK,CAAA,CAAE,CAAA;AACrD,IAAA,IAAA,CAAK,KAAA,GAAQ,KAAA;AACb,IAAA,IAAA,CAAK,KAAA,GAAQA,MAAAA;AAAA,EACf;AACF,CAAA;AAyCA,IAAM,uBAAA,0BAAiC,yBAAyB,CAAA;AAOhE,SAAS,wBACP,KAAA,EACgC;AAChC,EAAA,OACE,OAAO,KAAA,KAAU,QAAA,IACjB,KAAA,KAAU,QACV,uBAAA,IAA2B,KAAA;AAE/B;AAEA,SAAS,8BAA8B,KAAA,EAAyB;AAC9D,EAAA,MAAM,OAAA,uBAAc,OAAA,EAAgB;AAEpC,EAAA,SAAS,KAAK,OAAA,EAA2B;AACvC,IAAA,IAAI,uBAAA,CAAwB,OAAO,CAAA,EAAG,OAAO,IAAA;AAE7C,IAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,OAAO,CAAA,EAAG;AAC1B,MAAA,KAAA,MAAW,QAAQ,OAAA,EAAS;AAC1B,QAAA,IAAI,IAAA,CAAK,IAAI,CAAA,EAAG,OAAO,IAAA;AAAA,MACzB;AACA,MAAA,OAAO,KAAA;AAAA,IACT;AAEA,IAAA,IAAI,OAAO,OAAA,KAAY,QAAA,IAAY,OAAA,KAAY,IAAA,EAAM;AACnD,MAAA,OAAO,KAAA;AAAA,IACT;AAEA,IAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,OAAO,CAAA,EAAG,OAAO,KAAA;AACjC,IAAA,OAAA,CAAQ,IAAI,OAAO,CAAA;AAEnB,IAAA,KAAA,MAAWuB,MAAAA,IAAS,MAAA,CAAO,MAAA,CAAO,OAAO,CAAA,EAAG;AAC1C,MAAA,IAAI,IAAA,CAAKA,MAAK,CAAA,EAAG,OAAO,IAAA;AAAA,IAC1B;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,OAAO,KAAK,KAAK,CAAA;AACnB;AAMO,SAAS,mBAAA,CAKd,IAAA,EACA,KAAA,EACA,eAAA,EACA,oBACA,cAAA,EACc;AACd,EAAA,MAAM,KAAA,GAAQ,eAAA,CAAgB,KAAA,EAAO,eAAA,EAAiB,kBAAkB,CAAA;AAExE,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ;AACvB,IAAA,MAAM,OAAA,GAAU,qBAAA;AAAA,MACd,GAAA;AAAA,MACA,KAAA;AAAA,MACA,KAAA,CAAM;AAAA,KACR;AACA,IAAA,MAAM,MAAA,GAAS,eAAe,OAAO,CAAA;AAIrC,IAAA,IAAI,6BAAA,CAA8B,MAAM,CAAA,EAAG;AACzC,MAAA,MAAM,IAAI,0BAAA;AAAA,QACR,KAAA,CAAM,UAAA;AAAA,QACN;AAAA,OACF;AAAA,IACF;AAEA,IAAA,OAAO,MAAA;AAAA,EACT,CAAC,CAAA;AACH;AAMA,SAAS,eAAA,CACP,KAAA,EACA,eAAA,EACA,kBAAA,EACsB;AACtB,EAAA,MAAM,SAAA,uBAAgB,GAAA,CAOpB;AAAA,IACA;AAAA,MACE,KAAA,CAAM,UAAA;AAAA,MACN;AAAA,QACE,IAAA,EAAM,MAAA;AAAA,QACN,QAAA,EAAU,KAAA;AAAA,QACV,WAAW,KAAA,CAAM;AAAA;AACnB;AACF,GACD,CAAA;AAED,EAAA,KAAA,MAAW,SAAA,IAAa,MAAM,UAAA,EAAY;AACxC,IAAA,MAAM,aAAA,GAAgB,eAAe,SAAS,CAAA;AAE9C,IAAA,SAAA,CAAU,GAAA,CAAI,UAAU,SAAA,EAAW;AAAA,MACjC,IAAA,EAAM,MAAA;AAAA,MACN,UAAU,SAAA,CAAU,QAAA;AAAA,MACpB,WAAW,SAAA,CAAU;AAAA,KACtB,CAAA;AACD,IAAA,SAAA,CAAU,GAAA,CAAI,UAAU,SAAA,EAAW;AAAA,MACjC,IAAA,EAAM,MAAA;AAAA,MACN,UAAU,SAAA,CAAU,QAAA;AAAA,MACpB,SAAA,EAAW;AAAA,KACZ,CAAA;AAAA,EACH;AAEA,EAAA,MAAM,aAAA,uBAAoB,GAAA,EAA8B;AACxD,EAAA,KAAA,MAAWvB,UAAS,eAAA,EAAiB;AACnC,IAAA,MAAM,WAAW,aAAA,CAAc,GAAA,CAAIA,MAAAA,CAAM,KAAK,KAAK,EAAC;AACpD,IAAA,QAAA,CAAS,KAAKA,MAAK,CAAA;AACnB,IAAA,aAAA,CAAc,GAAA,CAAIA,MAAAA,CAAM,KAAA,EAAO,QAAQ,CAAA;AAAA,EACzC;AAEA,EAAA,MAAM,QAAqB,EAAC;AAE5B,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,IAAI,CAAA,IAAK,SAAA,CAAU,SAAQ,EAAG;AAC/C,IAAA,MAAM,MAAA,GAAS,aAAA,CAAc,GAAA,CAAI,KAAK,KAAK,EAAC;AAE5C,IAAA,MAAM,eAAkC,EAAC;AACzC,IAAA,MAAM,aAA8B,EAAC;AACrC,IAAA,MAAM,cAAgC,EAAC;AAEvC,IAAA,KAAA,MAAWA,UAAS,MAAA,EAAQ;AAC1B,MAAA,IAAIA,OAAM,aAAA,EAAe;AACvB,QAAA,IAAIA,MAAAA,CAAM,KAAA,CAAM,UAAA,CAAW,OAAO,CAAA,EAAG;AACnC,UAAA,UAAA,CAAW,IAAA,CAAK;AAAA,YACd,OAAA,EAASA,MAAAA,CAAM,KAAA,CAAM,KAAA,CAAM,CAAC,CAAA;AAAA,YAC5B,YAAYA,MAAAA,CAAM;AAAA,WACnB,CAAA;AAAA,QACH,CAAA,MAAO;AACL,UAAA,YAAA,CAAa,IAAA,CAAK;AAAA,YAChB,OAAOA,MAAAA,CAAM,KAAA;AAAA,YACb,YAAYA,MAAAA,CAAM;AAAA,WACnB,CAAA;AAAA,QACH;AAAA,MACF,CAAA,MAAO;AACL,QAAA,MAAM,QAAA,GACJ,IAAA,CAAK,IAAA,KAAS,MAAA,GACZ,kBAAA,CAAmB,sBAAA;AAAA,UACjB,IAAA,CAAK,SAAA;AAAA,UACLA,MAAAA,CAAM;AAAA,YAER,kBAAA,CAAmB,0BAAA;AAAA,UACjB,IAAA,CAAK,SAAA;AAAA,UACLA,MAAAA,CAAM;AAAA,SACR;AAEJ,QAAA,WAAA,CAAY,IAAA,CAAK;AAAA,UACf,OAAOA,MAAAA,CAAM,KAAA;AAAA,UACb,YAAYA,MAAAA,CAAM,UAAA;AAAA,UAClB;AAAA,SACD,CAAA;AAAA,MACH;AAAA,IACF;AAEA,IAAA,MAAM,YAAA,GACJ,aAAa,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,KAAA,KAAU,IAAI,CAAA,EAAG,UAAA,IAAc,MAAA;AAE5D,IAAA,KAAA,CAAM,IAAA,CAAK;AAAA,MACT,KAAA;AAAA,MACA,MAAM,IAAA,CAAK,IAAA;AAAA,MACX,UAAU,IAAA,CAAK,QAAA;AAAA,MACf,YAAA;AAAA,MACA,UAAA;AAAA,MACA,WAAA;AAAA,MACA,YAAA;AAAA,MACA,eAAA,EAAiB,IAAI,GAAA,CAAI,UAAA,CAAW,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,UAAU,CAAC,CAAA;AAAA,MAC5D,gBAAA,EAAkB,IAAI,GAAA,CAAI,WAAA,CAAY,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,UAAU,CAAC,CAAA;AAAA,MAC9D,iBAAA,EAAmB,IAAI,GAAA,CAAI,YAAA,CAAa,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,UAAU,CAAC;AAAA,KACjE,CAAA;AAAA,EACH;AAGA,EAAA,OAAO,KAAA,CAAM,QAAA,CAAS,CAAC,CAAA,EAAG,CAAA,KAAM,EAAE,KAAA,CAAM,aAAA,CAAc,CAAA,CAAE,KAAK,CAAC,CAAA;AAChE;AAMA,SAAS,qBAAA,CAIP,GAAA,EACA,KAAA,EACA,UAAA,EACqC;AACrC,EAAA,MAAM,UAAmC,EAAC;AAE1C,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,KAAA,GACJ,IAAA,CAAK,QAAA,IAAY,IAAA,CAAK,YAAA,KAAiB,MAAA,GACrC,uBAAA,CAAwB,GAAA,EAAK,IAAI,CAAA,GACjC,uBAAA,CAAwB,GAAA,EAAK,IAAI,CAAA;AACrC,IAAA,OAAA,CAAQ,IAAA,CAAK,KAAK,CAAA,GAAI,KAAA;AAAA,EACxB;AAGA,EAAA,KAAA,MAAW,aAAa,UAAA,EAAY;AAClC,IAAA,MAAM,KAAK,SAAA,CAAU,cAAA;AACrB,IAAA,IAAI,OAAO,MAAA,EAAW;AACpB,MAAA,IAAI,EAAA,CAAG,eAAe,MAAA,EAAW;AAC/B,QAAA,OAAA,CAAQ,EAAA,CAAG,UAAU,CAAA,GAAI,GAAA,CAAI,GAAG,UAAU,CAAA;AAAA,MAC5C;AACA,MAAA,IAAI,EAAA,CAAG,cAAc,MAAA,EAAW;AAC9B,QAAA,OAAA,CAAQ,GAAG,SAAS,CAAA,GAAI,cAAc,GAAA,CAAI,EAAA,CAAG,SAAS,CAAC,CAAA;AAAA,MACzD;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,OAAA;AACT;AAEA,SAAS,uBAAA,CACP,KACA,IAAA,EACS;AACT,EAAA,IAAI,IAAA,CAAK,iBAAiB,MAAA,EAAW;AACnC,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,MAAM,OAAA,GAAU,GAAA,CAAI,IAAA,CAAK,YAAY,CAAA;AAErC,EAAA,IAAI,OAAA,KAAY,IAAA,IAAQ,OAAA,KAAY,MAAA,EAAW;AAC7C,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,OAAO,uBAAA,CAAwB,KAAK,IAAI,CAAA;AAC1C;AAEA,SAAS,uBAAA,CACP,KACA,IAAA,EACS;AACT,EAAA,MAAM,IAAA,GAAgC;AAAA,IACpC,CAAC,uBAAuB,GAAG;AAAA,MACzB,OAAO,IAAA,CAAK,KAAA;AAAA,MACZ,MAAM,IAAA,CAAK;AAAA;AACb,GACF;AAEA,EAAA,KAAA,MAAWA,MAAAA,IAAS,KAAK,YAAA,EAAc;AACrC,IAAA,IAAA,CAAKA,OAAM,KAAK,CAAA,GAAI,gBAAgB,GAAA,CAAIA,MAAAA,CAAM,UAAU,CAAC,CAAA;AAAA,EAC3D;AAEA,EAAA,IAAI,IAAA,CAAK,UAAA,CAAW,MAAA,GAAS,CAAA,EAAG;AAC9B,IAAA,MAAM,OAAgC,EAAC;AACvC,IAAA,KAAA,MAAWA,MAAAA,IAAS,KAAK,UAAA,EAAY;AACnC,MAAA,IAAA,CAAKA,OAAM,OAAO,CAAA,GAAI,gBAAgB,GAAA,CAAIA,MAAAA,CAAM,UAAU,CAAC,CAAA;AAAA,IAC7D;AACA,IAAA,IAAA,CAAK,OAAO,kBAAA,CAAmB,IAAA,EAAM,CAAA,EAAG,IAAA,CAAK,KAAK,CAAA,KAAA,CAAO,CAAA;AAAA,EAC3D;AAEA,EAAA,KAAA,MAAWA,MAAAA,IAAS,KAAK,WAAA,EAAa;AACpC,IAAA,MAAM,UAAU,mBAAA,CAAoB,GAAA,CAAIA,OAAM,UAAU,CAAA,EAAGA,OAAM,QAAQ,CAAA;AACzE,IAAA,IAAA,CAAKA,MAAAA,CAAM,KAAK,CAAA,GAAI,OAAA;AAAA,EACtB;AAEA,EAAA,OAAO,kBAAA,CAAmB,IAAA,EAAM,IAAA,CAAK,KAAK,CAAA;AAC5C;AAEA,SAAS,kBAAA,CACP,QACA,SAAA,EACS;AACT,EAAA,OAAO,IAAI,MAAM,MAAA,EAAQ;AAAA,IACvB,GAAA,EAAK,CAAC,MAAA,EAAQ,QAAA,EAA2B,QAAA,KAAa;AACpD,MAAA,IAAI,OAAO,aAAa,QAAA,EAAU;AAChC,QAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,MAAA,EAAQ,QAAA,EAAU,QAAQ,CAAA;AAAA,MAC/C;AAEA,MAAA,IAAI,QAAA,KAAa,MAAA,IAAU,QAAA,KAAa,QAAA,EAAU;AAChD,QAAA;AAAA,MACF;AAEA,MAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,QAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,MAAA,EAAQ,QAAA,EAAU,QAAQ,CAAA;AAAA,MAC/C;AAEA,MAAA,IAAI,QAAA,IAAY,OAAO,SAAA,EAAW;AAChC,QAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,MAAA,CAAO,SAAA,EAAW,UAAU,QAAQ,CAAA;AAAA,MACzD;AAEA,MAAA,MAAM,IAAI,0BAAA,CAA2B,SAAA,EAAW,QAAQ,CAAA;AAAA,IAC1D;AAAA,GACD,CAAA;AACH;;;AC9UA,SAAS,UAAU,KAAA,EAA8B;AAC/C,EAAA,IAAI,UAAU,IAAA,EAAM;AAClB,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,yEAAA;AAAA,MACA,EAAE,aAAA,EAAe,OAAA,EAAS,SAAA,EAAW,MAAA;AAAO,KAC9C;AAAA,EACF;AACA,EAAA,IAAI,iBAAiB,IAAA,EAAM;AACzB,IAAA,OAAO,EAAE,QAAQ,SAAA,EAAW,KAAA,EAAO,MAAM,WAAA,EAAY,EAAG,WAAW,MAAA,EAAO;AAAA,EAC5E;AACA,EAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,IAAA,OAAO,EAAE,MAAA,EAAQ,SAAA,EAAW,KAAA,EAAO,WAAW,QAAA,EAAS;AAAA,EACzD;AACA,EAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,IAAA,OAAO,EAAE,MAAA,EAAQ,SAAA,EAAW,KAAA,EAAO,WAAW,QAAA,EAAS;AAAA,EACzD;AACA,EAAA,IAAI,OAAO,UAAU,SAAA,EAAW;AAC9B,IAAA,OAAO,EAAE,MAAA,EAAQ,SAAA,EAAW,KAAA,EAAO,WAAW,SAAA,EAAU;AAAA,EAC1D;AACA,EAAA,MAAM,IAAI,kBAAA;AAAA,IACR,CAAA,kCAAA,EAAqC,OAAO,KAAK,CAAA,CAAA;AAAA,IACjD,EAAE,aAAA,EAAe,OAAA,EAAS,UAAA,EAAY,OAAO,KAAA;AAAM,GACrD;AACF;AAMA,SAAS,6BAAA,CACP,MACA,QAAA,EACqB;AACrB,EAAA,QAAQ,KAAK,MAAA;AAAQ,IACnB,KAAK,YAAA,EAAc;AACjB,MAAA,IAAI,cAAA,CAAe,IAAA,CAAK,KAAK,CAAA,EAAG;AAC9B,QAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA;AACtC,QAAA,IAAI,UAAU,MAAA,EAAW;AACvB,UAAA,MAAM,IAAI,kBAAA;AAAA,YACR,CAAA,+BAAA,EAAkC,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA,CAAA,CAAA;AAAA,YACjD,EAAE,aAAA,EAAe,IAAA,CAAK,KAAA,CAAM,IAAA;AAAK,WACnC;AAAA,QACF;AACA,QAAA,OAAO;AAAA,UACL,GAAG,IAAA;AAAA,UACH,KAAA,EAAO,UAAU,KAAK;AAAA,SACxB;AAAA,MACF;AACA,MAAA,OAAO,IAAA;AAAA,IACT;AAAA,IAEA,KAAK,WAAA,EAAa;AAChB,MAAA,IAAI,cAAA,CAAe,IAAA,CAAK,OAAO,CAAA,EAAG;AAChC,QAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAA;AACxC,QAAA,IAAI,UAAU,MAAA,EAAW;AACvB,UAAA,MAAM,IAAI,kBAAA;AAAA,YACR,CAAA,+BAAA,EAAkC,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAA,CAAA,CAAA;AAAA,YACnD,EAAE,aAAA,EAAe,IAAA,CAAK,OAAA,CAAQ,IAAA;AAAK,WACrC;AAAA,QACF;AACA,QAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,UAAA,MAAM,IAAI,kBAAA;AAAA,YACR,CAAA,WAAA,EAAc,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAA,wCAAA,CAAA;AAAA,YAC/B,EAAE,aAAA,EAAe,IAAA,CAAK,QAAQ,IAAA,EAAM,UAAA,EAAY,OAAO,KAAA;AAAM,WAC/D;AAAA,QACF;AACA,QAAA,OAAO;AAAA,UACL,GAAG,IAAA;AAAA,UACH,OAAA,EAAS;AAAA,SACX;AAAA,MACF;AACA,MAAA,OAAO,IAAA;AAAA,IACT;AAAA,IAEA,KAAK,SAAA,EAAW;AACd,MAAA,MAAM,YAAA,GAAe,cAAA,CAAe,IAAA,CAAK,KAAK,CAAA;AAC9C,MAAA,MAAM,YAAA,GAAe,cAAA,CAAe,IAAA,CAAK,KAAK,CAAA;AAC9C,MAAA,IAAI,CAAC,YAAA,IAAgB,CAAC,YAAA,EAAc,OAAO,IAAA;AAE3C,MAAA,MAAM,KAAA,GACJ,YAAA,GACE,SAAA,CAAU,cAAA,CAAe,QAAA,EAAU,KAAK,KAAA,CAAM,IAAI,CAAC,CAAA,GACnD,IAAA,CAAK,KAAA;AACT,MAAA,MAAM,KAAA,GACJ,YAAA,GACE,SAAA,CAAU,cAAA,CAAe,QAAA,EAAU,KAAK,KAAA,CAAM,IAAI,CAAC,CAAA,GACnD,IAAA,CAAK,KAAA;AACT,MAAA,OAAO,EAAE,GAAG,IAAA,EAAM,KAAA,EAAO,KAAA,EAAM;AAAA,IACjC;AAAA,IAEA,KAAK,KAAA,EAAO;AACV,MAAA,OAAO;AAAA,QACL,GAAG,IAAA;AAAA,QACH,UAAA,EAAY,KAAK,UAAA,CAAW,GAAA;AAAA,UAAI,CAAC,CAAA,KAC/B,6BAAA,CAA8B,CAAA,EAAG,QAAQ;AAAA;AAC3C,OACF;AAAA,IACF;AAAA,IAEA,KAAK,IAAA,EAAM;AACT,MAAA,OAAO;AAAA,QACL,GAAG,IAAA;AAAA,QACH,UAAA,EAAY,KAAK,UAAA,CAAW,GAAA;AAAA,UAAI,CAAC,CAAA,KAC/B,6BAAA,CAA8B,CAAA,EAAG,QAAQ;AAAA;AAC3C,OACF;AAAA,IACF;AAAA,IAEA,KAAK,KAAA,EAAO;AACV,MAAA,OAAO;AAAA,QACL,GAAG,IAAA;AAAA,QACH,SAAA,EAAW,6BAAA,CAA8B,IAAA,CAAK,SAAA,EAAW,QAAQ;AAAA,OACnE;AAAA,IACF;AAAA;AAAA,IAGA,KAAK,YAAA;AAAA,IACL,KAAK,UAAA;AAAA,IACL,KAAK,WAAA;AAAA,IACL,KAAK,sBAAA;AAAA,IACL,KAAK,mBAAA;AAAA,IACL,KAAK,gBAAA,EAAkB;AACrB,MAAA,OAAO,IAAA;AAAA,IACT;AAAA,IAEA,KAAK,QAAA,EAAU;AACb,MAAA,OAAO;AAAA,QACL,GAAG,IAAA;AAAA,QACH,QAAA,EAAU,oBAAA,CAAqB,IAAA,CAAK,QAAA,EAAU,QAAQ;AAAA,OACxD;AAAA,IACF;AAAA,IAEA,KAAK,aAAA,EAAe;AAClB,MAAA,OAAO;AAAA,QACL,GAAG,IAAA;AAAA,QACH,QAAA,EAAU,oBAAA,CAAqB,IAAA,CAAK,QAAA,EAAU,QAAQ;AAAA,OACxD;AAAA,IACF;AAAA;AAEJ;AAEA,SAAS,cAAA,CACP,UACA,IAAA,EACS;AACT,EAAA,MAAM,KAAA,GAAQ,SAAS,IAAI,CAAA;AAC3B,EAAA,IAAI,UAAU,MAAA,EAAW;AACvB,IAAA,MAAM,IAAI,kBAAA,CAAmB,CAAA,+BAAA,EAAkC,IAAI,CAAA,CAAA,CAAA,EAAK;AAAA,MACtE,aAAA,EAAe;AAAA,KAChB,CAAA;AAAA,EACH;AACA,EAAA,OAAO,KAAA;AACT;AAKA,SAAS,oBAAA,CACP,KACA,QAAA,EACU;AACV,EAAA,OAAO;AAAA,IACL,GAAG,GAAA;AAAA,IACH,UAAA,EAAY,GAAA,CAAI,UAAA,CAAW,GAAA,CAAI,CAAC,IAAA,MAAU;AAAA,MACxC,GAAG,IAAA;AAAA,MACH,UAAA,EAAY,6BAAA,CAA8B,IAAA,CAAK,UAAA,EAAY,QAAQ;AAAA,KACrE,CAAE,CAAA;AAAA,IACF,GAAI,GAAA,CAAI,MAAA,KAAW,MAAA,IAAa;AAAA,MAC9B,MAAA,EAAQ,6BAAA,CAA8B,GAAA,CAAI,MAAA,EAAQ,QAAQ;AAAA;AAC5D,GACF;AACF;AAYA,SAAS,gBAAA,CACP,MAAA,EACA,QAAA,EACA,OAAA,EACW;AACX,EAAA,MAAM,OAAA,GAAU,WAAW,OAAO,CAAA;AAClC,EAAA,OAAO,MAAA,CAAO,GAAA,CAAI,CAAC,SAAA,KAAc;AAC/B,IAAA,IAAI,qBAAqB,WAAA,EAAa;AACpC,MAAA,MAAM,OAAO,SAAA,CAAU,IAAA;AACvB,MAAA,MAAM,KAAA,GAAQ,SAAS,IAAI,CAAA;AAC3B,MAAA,IAAI,UAAU,MAAA,EAAW;AACvB,QAAA,MAAM,IAAI,kBAAA;AAAA,UACR,kCAAkC,IAAI,CAAA,CAAA,CAAA;AAAA,UACtC,EAAE,eAAe,IAAA;AAAK,SACxB;AAAA,MACF;AACA,MAAA,IAAI,KAAA,YAAiB,IAAA,EAAM,OAAO,KAAA,CAAM,WAAA,EAAY;AACpD,MAAA,OAAO,OAAA,CAAQ,UAAU,KAAK,CAAA;AAAA,IAChC;AACA,IAAA,OAAO,SAAA;AAAA,EACT,CAAC,CAAA;AACH;AAuCO,IAAM,gBAAN,MAAuB;AAAA,EACnB,IAAA;AAAA,EACA,eAAA;AAAA,EACA,QAAA;AAAA,EACA,UAAA;AAAA,EACA,mBAAA;AAAA,EACA,qBAAA;AAAA,EACA,QAAA;AAAA,EACA,QAAA;AAAA,EACA,QAAA;AAAA,EACA,eAAA;AAAA,EACA,MAAA;AAAA,EACA,gBAAA;AAAA,EACA,SAAA;AAAA,EACA,mBAAA;AAAA,EACA,kBAAA;AAAA,EAET,YAAY,MAAA,EAAgC;AAC1C,IAAA,IAAA,CAAK,OAAO,MAAA,CAAO,GAAA;AACnB,IAAA,IAAA,CAAK,kBAAkB,MAAA,CAAO,cAAA;AAC9B,IAAA,IAAA,CAAK,WAAW,MAAA,CAAO,OAAA;AACvB,IAAA,IAAA,CAAK,aAAa,MAAA,CAAO,SAAA;AACzB,IAAA,IAAA,CAAK,sBAAsB,MAAA,CAAO,kBAAA;AAClC,IAAA,IAAA,CAAK,wBAAwB,MAAA,CAAO,oBAAA;AACpC,IAAA,IAAA,CAAK,WAAW,MAAA,CAAO,OAAA;AACvB,IAAA,IAAA,CAAK,WAAW,MAAA,CAAO,OAAA;AACvB,IAAA,IAAA,CAAK,WAAW,MAAA,CAAO,OAAA;AACvB,IAAA,IAAA,CAAK,kBAAkB,MAAA,CAAO,cAAA;AAC9B,IAAA,IAAA,CAAK,SAAS,MAAA,CAAO,KAAA;AACrB,IAAA,IAAA,CAAK,mBAAmB,MAAA,CAAO,eAAA;AAC/B,IAAA,IAAA,CAAK,YAAY,MAAA,CAAO,QAAA;AACxB,IAAA,IAAA,CAAK,sBAAsB,MAAA,CAAO,kBAAA;AAClC,IAAA,IAAA,CAAK,kBAAA,GAAqB,wBAAA,CAAyB,IAAA,CAAK,IAAI,CAAA;AAAA,EAC9D;AAAA;AAAA,EAGA,IAAI,cAAA,GAAsC;AACxC,IAAA,OAAO,KAAK,kBAAA,CAAmB,KAAA;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,OAAA,CACJ,QAAA,GAA8C,EAAC,EACxB;AACvB,IAAA,gBAAA,CAAiB,QAAA,EAAU,KAAK,kBAAkB,CAAA;AAElD,IAAA,IAAI,IAAA,CAAK,qBAAqB,MAAA,EAAW;AACvC,MAAA,IAAI;AACF,QAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,qBAAA,CAAsB,QAAQ,CAAA;AACtD,QAAA,OAAO,mBAAA;AAAA,UACL,IAAA;AAAA,UACA,IAAA,CAAK,MAAA;AAAA,UACL,IAAA,CAAK,gBAAA;AAAA,UACL,IAAA,CAAK,mBAAA;AAAA,UACL,IAAA,CAAK;AAAA,SACP;AAAA,MACF,SAAS,KAAA,EAAO;AACd,QAAA,IACE,KAAA,YAAiB,0BAAA,IACjB,KAAA,YAAiB,yBAAA,EACjB;AAKA,UAAA,OAAO,IAAA,CAAK,oBAAoB,QAAQ,CAAA;AAAA,QAC1C;AACA,QAAA,MAAM,KAAA;AAAA,MACR;AAAA,IACF;AAEA,IAAA,OAAO,IAAA,CAAK,oBAAoB,QAAQ,CAAA;AAAA,EAC1C;AAAA,EAEA,MAAM,sBACJ,QAAA,EAC6C;AAC7C,IAAA,IACE,IAAA,CAAK,aAAa,MAAA,IAClB,IAAA,CAAK,eAAe,MAAA,IACpB,IAAA,CAAK,QAAA,CAAS,UAAA,KAAe,MAAA,EAC7B;AACA,MAAA,MAAM,YAAA,GAAe,gBAAA;AAAA,QACnB,IAAA,CAAK,UAAA;AAAA,QACL,QAAA;AAAA,QACA,IAAA,CAAK;AAAA,OACP;AACA,MAAA,MAAMwB,QAAAA,GAAU,MAAM,IAAA,CAAK,QAAA,CAAS,UAAA;AAAA,QAClC,IAAA,CAAK,QAAA;AAAA,QACL;AAAA,OACF;AACA,MAAA,OAAO,oBAAA,CAAqBA,QAAAA,EAAS,IAAA,CAAK,MAAA,EAAQ,KAAK,QAAQ,CAAA;AAAA,IACjE;AAEA,IAAA,MAAM,WAAA,GAAc,oBAAA,CAAqB,IAAA,CAAK,IAAA,EAAM,QAAQ,CAAA;AAC5D,IAAA,MAAM,QAAA,GAAW,YAAA;AAAA,MACf,WAAA;AAAA,MACA,IAAA,CAAK,QAAA;AAAA,MACL,IAAA,CAAK;AAAA,KACP;AACA,IAAA,MAAM,OAAA,GACJ,MAAM,IAAA,CAAK,QAAA,CAAS,QAAiC,QAAQ,CAAA;AAC/D,IAAA,OAAO,oBAAA,CAAqB,OAAA,EAAS,IAAA,CAAK,MAAA,EAAQ,KAAK,QAAQ,CAAA;AAAA,EACjE;AAAA,EAEA,MAAM,oBACJ,QAAA,EACuB;AACvB,IAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,uBAAA,CAAwB,QAAQ,CAAA;AACxD,IAAA,OAAO,UAAA;AAAA,MACL,IAAA;AAAA,MACA,KAAK,MAAA,CAAO,UAAA;AAAA,MACZ,KAAK,MAAA,CAAO,UAAA;AAAA,MACZ,IAAA,CAAK;AAAA,KACP;AAAA,EACF;AAAA,EAEA,MAAM,wBACJ,QAAA,EAC6C;AAC7C,IAAA,IACE,IAAA,CAAK,wBAAwB,MAAA,IAC7B,IAAA,CAAK,0BAA0B,MAAA,IAC/B,IAAA,CAAK,QAAA,CAAS,UAAA,KAAe,MAAA,EAC7B;AACA,MAAA,MAAM,YAAA,GAAe,gBAAA;AAAA,QACnB,IAAA,CAAK,qBAAA;AAAA,QACL,QAAA;AAAA,QACA,IAAA,CAAK;AAAA,OACP;AACA,MAAA,MAAMA,QAAAA,GAAU,MAAM,IAAA,CAAK,QAAA,CAAS,UAAA;AAAA,QAClC,IAAA,CAAK,mBAAA;AAAA,QACL;AAAA,OACF;AACA,MAAA,OAAO,oBAAA,CAAqBA,QAAAA,EAAS,IAAA,CAAK,MAAA,EAAQ,KAAK,QAAQ,CAAA;AAAA,IACjE;AAEA,IAAA,MAAM,WAAA,GAAc,oBAAA,CAAqB,IAAA,CAAK,eAAA,EAAiB,QAAQ,CAAA;AACvE,IAAA,MAAM,QAAA,GAAW,YAAA;AAAA,MACf,WAAA;AAAA,MACA,IAAA,CAAK,QAAA;AAAA,MACL,IAAA,CAAK;AAAA,KACP;AACA,IAAA,MAAM,OAAA,GACJ,MAAM,IAAA,CAAK,QAAA,CAAS,QAAiC,QAAQ,CAAA;AAC/D,IAAA,OAAO,oBAAA,CAAqB,OAAA,EAAS,IAAA,CAAK,MAAA,EAAQ,KAAK,QAAQ,CAAA;AAAA,EACjE;AACF;AAQA,SAAS,yBAAyB,GAAA,EAAkC;AAClE,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,EAAA,MAAM,kBAAA,uBAAyB,GAAA,EAAY;AAE3C,EAAA,+BAAA,CAAgC,GAAA,EAAK,OAAO,kBAAkB,CAAA;AAE9D,EAAA,OAAO,EAAE,OAAO,kBAAA,EAAmB;AACrC;AAEO,SAAS,uBAAuB,GAAA,EAAwB;AAC7D,EAAA,OAAO,wBAAA,CAAyB,GAAG,CAAA,CAAE,KAAA,CAAM,IAAA,GAAO,CAAA;AACpD;AAEO,SAAS,sCACd,KAAA,EACS;AACT,EAAA,IAAI,YAAY,KAAA,EAAO;AACrB,IAAA,OACE,sCAAsC,KAAA,CAAM,IAAI,CAAA,IAChD,qCAAA,CAAsC,MAAM,KAAK,CAAA;AAAA,EAErD;AACA,EAAA,OAAO,uBAAuB,KAAK,CAAA;AACrC;AAEA,SAAS,+BAAA,CACP,GAAA,EACA,KAAA,EACA,kBAAA,EACM;AACN,EAAA,KAAA,MAAWb,UAAAA,IAAa,IAAI,UAAA,EAAY;AACtC,IAAA,sCAAA;AAAA,MACEA,UAAAA,CAAU,UAAA;AAAA,MACV,KAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AACA,EAAA,IAAI,GAAA,CAAI,WAAW,MAAA,EAAW;AAC5B,IAAA,sCAAA;AAAA,MACE,GAAA,CAAI,MAAA;AAAA,MACJ,KAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AACF;AAEA,SAAS,sCAAA,CACP,UAAA,EACA,KAAA,EACA,kBAAA,EACM;AACN,EAAA,QAAQ,WAAW,MAAA;AAAQ,IACzB,KAAK,YAAA,EAAc;AACjB,MAAA,IAAI,cAAA,CAAe,UAAA,CAAW,KAAK,CAAA,EAAG;AACpC,QAAA,KAAA,CAAM,GAAA,CAAI,UAAA,CAAW,KAAA,CAAM,IAAI,CAAA;AAAA,MACjC;AACA,MAAA;AAAA,IACF;AAAA,IACA,KAAK,WAAA,EAAa;AAChB,MAAA,IAAI,cAAA,CAAe,UAAA,CAAW,OAAO,CAAA,EAAG;AACtC,QAAA,KAAA,CAAM,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,IAAI,CAAA;AACjC,QAAA,kBAAA,CAAmB,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,IAAI,CAAA;AAAA,MAChD;AACA,MAAA;AAAA,IACF;AAAA,IACA,KAAK,SAAA,EAAW;AACd,MAAA,IAAI,cAAA,CAAe,UAAA,CAAW,KAAK,CAAA,EAAG;AACpC,QAAA,KAAA,CAAM,GAAA,CAAI,UAAA,CAAW,KAAA,CAAM,IAAI,CAAA;AAAA,MACjC;AACA,MAAA,IAAI,cAAA,CAAe,UAAA,CAAW,KAAK,CAAA,EAAG;AACpC,QAAA,KAAA,CAAM,GAAA,CAAI,UAAA,CAAW,KAAA,CAAM,IAAI,CAAA;AAAA,MACjC;AACA,MAAA;AAAA,IACF;AAAA,IACA,KAAK,KAAA;AAAA,IACL,KAAK,IAAA,EAAM;AACT,MAAA,KAAA,MAAWA,UAAAA,IAAa,WAAW,UAAA,EAAY;AAC7C,QAAA,sCAAA;AAAA,UACEA,UAAAA;AAAA,UACA,KAAA;AAAA,UACA;AAAA,SACF;AAAA,MACF;AACA,MAAA;AAAA,IACF;AAAA,IACA,KAAK,KAAA,EAAO;AACV,MAAA,sCAAA;AAAA,QACE,UAAA,CAAW,SAAA;AAAA,QACX,KAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA;AAAA,IACF;AAAA,IACA,KAAK,YAAA;AAAA,IACL,KAAK,UAAA;AAAA,IACL,KAAK,WAAA;AAAA,IACL,KAAK,sBAAA;AAAA,IACL,KAAK,mBAAA;AAAA,IACL,KAAK,gBAAA,EAAkB;AACrB,MAAA;AAAA,IACF;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA,+BAAA;AAAA,QACE,UAAA,CAAW,QAAA;AAAA,QACX,KAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA;AAAA,IACF;AAAA,IACA,KAAK,aAAA,EAAe;AAClB,MAAA,+BAAA;AAAA,QACE,UAAA,CAAW,QAAA;AAAA,QACX,KAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA;AAAA,IACF;AAAA;AAEJ;AAEA,SAAS,gBAAA,CACP,UACA,QAAA,EACM;AACN,EAAA,MAAM,EAAE,KAAA,EAAO,aAAA,EAAe,kBAAA,EAAmB,GAAI,QAAA;AAErD,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,KAAA,MAAW,QAAQ,aAAA,EAAe;AAChC,IAAA,IAAI,QAAA,CAAS,IAAI,CAAA,KAAM,MAAA,EAAW;AAChC,MAAA,OAAA,CAAQ,KAAK,IAAI,CAAA;AAAA,IACnB;AAAA,EACF;AAEA,EAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtB,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,iCAAiC,OAAA,CAAQ,MAAA,KAAW,CAAA,GAAI,EAAA,GAAK,GAAG,CAAA,EAAA,EAAK,OAAA,CAAQ,GAAA,CAAI,CAAC,SAAS,CAAA,CAAA,EAAI,IAAI,GAAG,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA;AAAA,MAClH,EAAE,mBAAmB,OAAA;AAAQ,KAC/B;AAAA,EACF;AAEA,EAAA,MAAM,UAAA,GAAa,MAAA,CAAO,IAAA,CAAK,QAAQ,CAAA,CAAE,MAAA;AAAA,IACvC,CAAC,IAAA,KAAS,CAAC,aAAA,CAAc,IAAI,IAAI;AAAA,GACnC;AACA,EAAA,IAAI,UAAA,CAAW,SAAS,CAAA,EAAG;AACzB,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,8BAAA,EAAiC,UAAA,CAAW,GAAA,CAAI,CAAC,IAAA,KAAS,CAAA,CAAA,EAAI,IAAI,CAAA,CAAA,CAAG,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA;AAAA,MACjF,EAAE,sBAAsB,UAAA;AAAW,KACrC;AAAA,EACF;AAIA,EAAA,KAAA,MAAW,QAAQ,aAAA,EAAe;AAChC,IAAA,MAAM,KAAA,GAAQ,SAAS,IAAI,CAAA;AAC3B,IAAA,oBAAA,CAAqB,IAAA,EAAM,KAAA,EAAO,kBAAA,CAAmB,GAAA,CAAI,IAAI,CAAC,CAAA;AAAA,EAChE;AACF;AAEA,SAAS,oBAAA,CACP,IAAA,EACA,KAAA,EACA,UAAA,EACM;AACN,EAAA,IAAI,UAAU,IAAA,EAAM;AAClB,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,yEAAA;AAAA,MACA,EAAE,aAAA,EAAe,IAAA,EAAM,SAAA,EAAW,MAAA;AAAO,KAC3C;AAAA,EACF;AACA,EAAA,IAAI,UAAA,EAAY;AACd,IAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,cAAc,IAAI,CAAA,wCAAA,CAAA;AAAA,QAClB,EAAE,aAAA,EAAe,IAAA,EAAM,UAAA,EAAY,OAAO,KAAA;AAAM,OAClD;AAAA,IACF;AACA,IAAA;AAAA,EACF;AACA,EAAA,IACE,KAAA,YAAiB,IAAA,IACjB,OAAO,KAAA,KAAU,QAAA,IACjB,OAAO,KAAA,KAAU,QAAA,IACjB,OAAO,KAAA,KAAU,SAAA,EACjB;AACA,IAAA;AAAA,EACF;AACA,EAAA,MAAM,IAAI,kBAAA;AAAA,IACR,CAAA,kCAAA,EAAqC,OAAO,KAAK,CAAA,CAAA;AAAA,IACjD,EAAE,aAAA,EAAe,IAAA,EAAM,UAAA,EAAY,OAAO,KAAA;AAAM,GAClD;AACF;;;ACpnBA,IAAM,sBAAA,GAAyB,+BAAA;AAK/B,IAAM,qBAAA,uBAA4B,GAAA,CAAI;AAAA,EACpC,QAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,KAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,IAAA;AAAA,EACA,QAAA;AAAA,EACA,OAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,QAAA;AAAA,EACA,OAAA;AAAA,EACA,WAAA;AAAA,EACA,QAAA;AAAA,EACA,KAAA;AAAA,EACA,UAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA,KAAA;AAAA,EACA,QAAA;AAAA,EACA,SAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,QAAA;AAAA,EACA,QAAA;AAAA,EACA,QAAA;AAAA,EACA,QAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA;AACF,CAAC,CAAA;AAQM,SAAS,sBAAsB,KAAA,EAAqB;AACzD,EAAA,IAAI,CAAC,sBAAA,CAAuB,IAAA,CAAK,KAAK,CAAA,EAAG;AACvC,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,kBAAkB,KAAK,CAAA,sHAAA,CAAA;AAAA,MAEvB;AAAA,QACE,MAAA,EAAQ;AAAA,UACN;AAAA,YACE,IAAA,EAAM,OAAA;AAAA,YACN,OAAA,EAAS,IAAI,KAAK,CAAA,+BAAA;AAAA;AACpB;AACF,OACF;AAAA,MACA;AAAA,QACE,UAAA,EAAY,CAAA,8DAAA;AAAA;AACd,KACF;AAAA,EACF;AAEA,EAAA,IAAI,KAAA,CAAM,WAAA,EAAY,CAAE,UAAA,CAAW,MAAM,CAAA,EAAG;AAC1C,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,kBAAkB,KAAK,CAAA,6DAAA,CAAA;AAAA,MACvB;AAAA,QACE,MAAA,EAAQ;AAAA,UACN;AAAA,YACE,IAAA,EAAM,OAAA;AAAA,YACN,OAAA,EAAS,IAAI,KAAK,CAAA,oCAAA;AAAA;AACpB;AACF,OACF;AAAA,MACA;AAAA,QACE,UAAA,EAAY,CAAA,gDAAA;AAAA;AACd,KACF;AAAA,EACF;AAEA,EAAA,IAAI,qBAAA,CAAsB,GAAA,CAAI,KAAA,CAAM,WAAA,EAAa,CAAA,EAAG;AAClD,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,CAAA,eAAA,EAAkB,KAAK,CAAA,IAAA,EAAO,KAAK,CAAA,2BAAA,CAAA;AAAA,MACnC;AAAA,QACE,MAAA,EAAQ;AAAA,UACN,EAAE,IAAA,EAAM,OAAA,EAAS,OAAA,EAAS,CAAA,CAAA,EAAI,KAAK,CAAA,2BAAA,CAAA;AAA8B;AACnE,OACF;AAAA,MACA;AAAA,QACE,UAAA,EAAY,CAAA,iFAAA;AAAA;AACd,KACF;AAAA,EACF;AACF;AASA,SAAS,oCAAA,CACP,UAAA,EACA,SAAA,EACA,UAAA,EACA,oBACA,IAAA,EACM;AACN,EAAA,IAAI,UAAA,CAAW,WAAW,SAAA,EAAW;AACnC,IAAA,IAAI,kBAAA,aAA+B,IAAI,CAAA;AACvC,IAAA;AAAA,EACF;AACA,EAAA,QAAQ,WAAW,MAAA;AAAQ,IACzB,KAAK,KAAA,EAAO;AACV,MAAA,KAAA,MAAW,CAAC,KAAA,EAAO,KAAK,KAAK,UAAA,CAAW,UAAA,CAAW,SAAQ,EAAG;AAC5D,QAAA,oCAAA;AAAA,UACE,KAAA;AAAA,UACA,SAAA;AAAA,UACA,UAAA;AAAA,UACA,kBAAA;AAAA,UACA,CAAA,EAAG,IAAI,CAAA,YAAA,EAAe,KAAK,CAAA,CAAA;AAAA,SAC7B;AAAA,MACF;AACA,MAAA;AAAA,IACF;AAAA,IACA,KAAK,IAAA,EAAM;AACT,MAAA,KAAA,MAAW,CAAC,KAAA,EAAO,KAAK,KAAK,UAAA,CAAW,UAAA,CAAW,SAAQ,EAAG;AAC5D,QAAA,oCAAA;AAAA,UACE,KAAA;AAAA,UACA,SAAA;AAAA,UACA,UAAA;AAAA,UACA,IAAA;AAAA,UACA,CAAA,EAAG,IAAI,CAAA,YAAA,EAAe,KAAK,CAAA,CAAA;AAAA,SAC7B;AAAA,MACF;AACA,MAAA;AAAA,IACF;AAAA,IACA,KAAK,KAAA,EAAO;AACV,MAAA,oCAAA;AAAA,QACE,UAAA,CAAW,SAAA;AAAA,QACX,SAAA;AAAA,QACA,UAAA;AAAA,QACA,IAAA;AAAA,QACA,GAAG,IAAI,CAAA,UAAA;AAAA,OACT;AACA,MAAA;AAAA,IACF;AAAA,IACA,KAAK,YAAA;AAAA,IACL,KAAK,WAAA;AAAA,IACL,KAAK,YAAA;AAAA,IACL,KAAK,SAAA;AAAA,IACL,KAAK,UAAA;AAAA,IACL,KAAK,WAAA;AAAA,IACL,KAAK,sBAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,aAAA;AAAA,IACL,KAAK,mBAAA;AAAA,IACL,KAAK,gBAAA,EAAkB;AACrB,MAAA;AAAA,IACF;AAAA;AAEJ;AAEA,SAAS,qCAAqC,IAAA,EAAqB;AACjE,EAAA,MAAM,IAAI,eAAA;AAAA,IACR,wGAAA;AAAA,IAEA;AAAA,MACE,MAAA,EAAQ;AAAA,QACN;AAAA,UACE,IAAA;AAAA,UACA,OAAA,EACE;AAAA;AAEJ;AACF,KACF;AAAA,IACA;AAAA,MACE,UAAA,EACE;AAAA;AAEJ,GACF;AACF;AAEA,SAAS,uCAAuC,IAAA,EAAqB;AACnE,EAAA,MAAM,IAAI,eAAA;AAAA,IACR,kHAAA;AAAA,IAEA;AAAA,MACE,MAAA,EAAQ;AAAA,QACN;AAAA,UACE,IAAA;AAAA,UACA,OAAA,EACE;AAAA;AAEJ;AACF,KACF;AAAA,IACA;AAAA,MACE,UAAA,EACE;AAAA;AAEJ,GACF;AACF;AAEO,SAAS,iCACd,UAAA,EACM;AACN,EAAA,KAAA,MAAW,CAAC,KAAA,EAAOA,UAAS,CAAA,IAAK,UAAA,CAAW,SAAQ,EAAG;AACrD,IAAA,oCAAA;AAAA,MACEA,UAAAA,CAAU,UAAA;AAAA,MACV,mBAAA;AAAA,MACA,oCAAA;AAAA,MACA,KAAA;AAAA,MACA,cAAc,KAAK,CAAA,YAAA;AAAA,KACrB;AAAA,EACF;AACF;AAEO,SAAS,mCACd,UAAA,EACM;AACN,EAAA,KAAA,MAAW,CAAC,KAAA,EAAOA,UAAS,CAAA,IAAK,UAAA,CAAW,SAAQ,EAAG;AACrD,IAAA,oCAAA;AAAA,MACEA,UAAAA,CAAU,UAAA;AAAA,MACV,gBAAA;AAAA,MACA,sCAAA;AAAA,MACA,KAAA;AAAA,MACA,cAAc,KAAK,CAAA,YAAA;AAAA,KACrB;AAAA,EACF;AACF;AAOO,SAAS,4BACd,OAAA,EACM;AAGN,EAAA,MAAM,SAAS,OAAA,CAAQ,MAAA;AACvB,EAAA,IAAI,MAAA,KAAW,MAAA,IAAa,MAAA,KAAW,KAAA,EAAO;AAC5C,IAAA,MAAM,IAAI,eAAA,CAAgB,CAAA,2BAAA,EAA8B,MAAM,CAAA,CAAA,EAAI;AAAA,MAChE,QAAQ,CAAC,EAAE,MAAM,eAAA,EAAiB,OAAA,EAAS,4BAA4B;AAAA,KACxE,CAAA;AAAA,EACH;AACA,EAAA,MAAM,EAAE,GAAE,GAAI,OAAA;AACd,EAAA,IAAI,CAAA,KAAM,WAAc,CAAC,MAAA,CAAO,SAAS,CAAC,CAAA,IAAK,KAAK,CAAA,CAAA,EAAI;AACtD,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,CAAA,gDAAA,EAAmD,MAAA,CAAO,CAAC,CAAC,CAAA,CAAA;AAAA,MAC5D;AAAA,QACE,QAAQ,CAAC,EAAE,MAAM,UAAA,EAAY,OAAA,EAAS,8BAA8B;AAAA;AACtE,KACF;AAAA,EACF;AACA,EAAA,MAAM,UAAU,OAAA,CAAQ,OAAA;AACxB,EAAA,IAAI,YAAY,MAAA,EAAW;AACzB,IAAA,KAAA,MAAW,GAAA,IAAO,CAAC,QAAA,EAAU,UAAU,CAAA,EAAY;AACjD,MAAA,MAAM,MAAA,GAAS,QAAQ,GAAG,CAAA;AAC1B,MAAA,IAAI,MAAA,KAAW,WAAc,CAAC,MAAA,CAAO,SAAS,MAAM,CAAA,IAAK,SAAS,CAAA,CAAA,EAAI;AACpE,QAAA,MAAM,IAAI,eAAA;AAAA,UACR,CAAA,mBAAA,EAAsB,GAAG,CAAA,6CAAA,EAAgD,MAAA,CAAO,MAAM,CAAC,CAAA,CAAA;AAAA,UACvF;AAAA,YACE,MAAA,EAAQ;AAAA,cACN;AAAA,gBACE,IAAA,EAAM,kBAAkB,GAAG,CAAA,CAAA;AAAA,gBAC3B,OAAA,EAAS;AAAA;AACX;AACF;AACF,SACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;;;AC1SO,SAAS,aAAA,CACd,QACA,KAAA,EACU;AACV,EAAA,gCAAA,CAAiC,MAAM,UAAU,CAAA;AACjD,EAAA,kCAAA,CAAmC,MAAM,UAAU,CAAA;AAEnD,EAAA,MAAM,YAAA,GAAmE;AAAA,IACvE,MAAM,KAAA,CAAM;AAAA,GACd;AACA,EAAA,IAAI,KAAA,CAAM,SAAS,MAAA,EAAW;AAC5B,IAAA,YAAA,CAAa,OAAO,KAAA,CAAM,IAAA;AAAA,EAC5B;AAEA,EAAA,OAAO;AAAA,IACL,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,KAAA,EAAO;AAAA,MACL,OAAO,KAAA,CAAM,UAAA;AAAA,MACb,OAAO,KAAA,CAAM,UAAA;AAAA,MACb,mBAAmB,KAAA,CAAM;AAAA,KAC3B;AAAA,IACA,YAAY,KAAA,CAAM,UAAA;AAAA,IAClB,YAAY,KAAA,CAAM,UAAA;AAAA,IAClB,UAAA,EAAY;AAAA,MACV,QAAQ,KAAA,CAAM;AAAA,KAChB;AAAA,IACA,YAAA;AAAA,IACA,GAAI,MAAM,OAAA,CAAQ,MAAA,GAAS,KAAK,EAAE,OAAA,EAAS,MAAM,OAAA,EAAQ;AAAA,IACzD,GAAI,KAAA,CAAM,KAAA,KAAU,UAAa,EAAE,KAAA,EAAO,MAAM,KAAA,EAAM;AAAA,IACtD,GAAI,KAAA,CAAM,MAAA,KAAW,UAAa,EAAE,MAAA,EAAQ,MAAM,MAAA,EAAO;AAAA,IACzD,GAAI,KAAA,CAAM,OAAA,KAAY,UAAa,EAAE,OAAA,EAAS,MAAM,OAAA,EAAQ;AAAA,IAC5D,GAAI,KAAA,CAAM,MAAA,KAAW,UAAa,EAAE,MAAA,EAAQ,MAAM,MAAA,EAAO;AAAA,IACzD,GAAI,KAAA,CAAM,MAAA,KAAW,UAAa,EAAE,MAAA,EAAQ,MAAM,MAAA;AAAO,GAC3D;AACF;;;ACrCO,SAAS,oBACd,MAAA,EACqB;AACrB,EAAA,MAAM,gBAAA,GAAmB,OAAO,OAAA,EAAS,gBAAA;AACzC,EAAA,MAAM,cAAA,GAAiB,OAAO,OAAA,EAAS,cAAA;AACvC,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,OAAO,OAAA,IAAW,QAAA;AAAA,IAC3B,QAAQ,MAAA,CAAO,MAAA;AAAA,IACf,eAAA,EAAiB,MAAA,CAAO,OAAA,EAAS,YAAA,CAAa,eAAA,IAAmB,IAAA;AAAA,IACjE,GAAI,gBAAA,KAAqB,MAAA,GAAY,EAAC,GAAI,EAAE,gBAAA,EAAiB;AAAA,IAC7D,GAAI,cAAA,KAAmB,MAAA,GACrB,EAAC,GACD,EAAE,cAAA,EAAgB,WAAA,EAAa,gBAAA,CAAiB,MAAA,CAAO,QAAQ,CAAA;AAAE,GACrE;AACF;AAQA,IAAM,gBAAA,uBAAuB,OAAA,EAAqC;AASlE,SAAS,iBAAiB,QAAA,EAAuC;AAC/D,EAAA,MAAM,MAAA,GAAS,gBAAA,CAAiB,GAAA,CAAI,QAAQ,CAAA;AAC5C,EAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AAEjC,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAkC;AACpD,EAAA,KAAA,MAAW,CAAC,QAAA,EAAU,QAAQ,CAAA,IAAK,SAAS,SAAA,EAAW;AACrD,IAAA,KAAA,MAAWX,MAAAA,IAAS,sBAAA,CAAuB,QAAA,CAAS,MAAM,CAAA,EAAG;AAC3D,MAAA,KAAA,CAAM,GAAA,CAAI,aAAA,CAAc,QAAA,EAAUA,MAAAA,CAAM,SAAS,CAAA,EAAG;AAAA,QAClD,YAAYA,MAAAA,CAAM,UAAA;AAAA,QAClB,QAAQA,MAAAA,CAAM,MAAA;AAAA,QACd,WAAWA,MAAAA,CAAM;AAAA,OAClB,CAAA;AAAA,IACH;AAAA,EACF;AACA,EAAA,gBAAA,CAAiB,GAAA,CAAI,UAAU,KAAK,CAAA;AACpC,EAAA,OAAO,KAAA;AACT;;;ACDA,IAAM,YAAA,0BAAsB,cAAc,CAAA;AAiB1C,IAAI,mBAAA;AAMG,SAAS,uBAAuB,GAAA,EAAsC;AAC3E,EAAA,mBAAA,GAAsB,GAAA;AACxB;AAKO,IAAM,eAAA,GAAN,MAAM,gBAAA,CAQX;AAAA,EACS,OAAA;AAAA,EACA,MAAA;AAAA,EACA,SAAA;AAAA,EAGT,eAAA,GAA6C,YAAA;AAAA,EAC7C,wBAAA,GAAsD,YAAA;AAAA,EACtD,gCAAA,GAGgB,YAAA;AAAA,EAChB,mCAAA,GAGgB,YAAA;AAAA,EAEhB,WAAA,CACE,MAAA,EACA,KAAA,EACA,cAAA,EAGA;AACA,IAAA,IAAA,CAAK,OAAA,GAAU,MAAA;AACf,IAAA,IAAA,CAAK,MAAA,GAAS,KAAA;AACd,IAAA,IAAA,CAAK,SAAA,GAAY,cAAA;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA,EAKA,KAAA,GAAkB;AAChB,IAAA,OAAO,aAAA,CAAc,IAAA,CAAK,OAAA,EAAS,IAAA,CAAK,MAAM,CAAA;AAAA,EAChD;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,CACE,KAAA,EACAA,MAAAA,EACA,SAAA,GAA2B,KAAA,EACoC;AAC/D,IAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,MAAA,CAAO,UAAA,CAAW,IAAA;AAAA,MAC3C,CAAC,SAAA,KAAc,SAAA,CAAU,SAAA,KAAc;AAAA,KACzC;AACA,IAAA,MAAM,SAAS,aAAA,KAAkB,MAAA;AACjC,IAAA,MAAM,QAAA,GACJA,WAAU,IAAA,IACVA,MAAAA,KAAU,UACT,MAAA,KAAWA,MAAAA,KAAU,aAAaA,MAAAA,KAAU,OAAA,CAAA;AAE/C,IAAA,IAAI,QAAA;AACJ,IAAA,IAAI,CAAC,QAAA,EAAU;AACb,MAAA,IAAI,MAAA,EAAQ;AACV,QAAA,MAAM,aAAA,GAAgB,eAAe,aAAa,CAAA;AAClD,QAAA,QAAA,GAAW,IAAA,CAAK,QAAQ,kBAAA,CAAmB,0BAAA;AAAA,UACzC,aAAA;AAAA,UACAA;AAAA,SACF;AAAA,MACF,CAAA,MAAO;AACL,QAAA,MAAM,SAAA,GACJ,KAAA,KAAU,IAAA,CAAK,MAAA,CAAO,UAAA,GACpB,KAAK,MAAA,CAAO,UAAA,GACZ,IAAA,CAAK,MAAA,CAAO,UAAA,CAAW,IAAA;AAAA,UACrB,CAAC,SAAA,KAAc,SAAA,CAAU,SAAA,KAAc;AAAA,SACzC,EAAG,SAAA;AACP,QAAA,QAAA,GACE,SAAA,GACE,IAAA,CAAK,OAAA,CAAQ,kBAAA,CAAmB,sBAAA;AAAA,UAC9B,SAAA;AAAA,UACAA;AAAA,SACF,GACA,MAAA;AAAA,MACN;AAAA,IACF;AAEA,IAAA,MAAM,YACJ,QAAA,GACE;AAAA,MACE,KAAA,EAAO,SAAS,KAAA,EAAO,CAACA,MAAK,CAAA,EAAG,EAAE,SAAA,EAAW,QAAA,EAAU,CAAA;AAAA,MACvD;AAAA,KACF,GACA;AAAA,MACE,KAAA,EAAO,QAAA,CAAS,KAAA,EAAO,CAAC,OAAO,CAAA,EAAG;AAAA,QAChC,WAAA,EAAa,WAAA,CAAY,CAACA,MAAK,CAAC,CAAA;AAAA,QAChC,WAAW,QAAA,EAAU,SAAA;AAAA,QACrB,aAAa,QAAA,EAAU;AAAA,OACxB,CAAA;AAAA,MACD;AAAA,KACF;AAEJ,IAAA,MAAM,QAAA,GAA8B;AAAA,MAClC,GAAG,IAAA,CAAK,MAAA;AAAA,MACR,SAAS,CAAC,GAAG,IAAA,CAAK,MAAA,CAAO,SAAS,SAAS;AAAA,KAC7C;AAEA,IAAA,OAAO,IAAI,gBAAA,CAAgB,IAAA,CAAK,OAAA,EAAS,QAAA,EAAU,KAAK,SAAS,CAAA;AAAA,EACnE;AAAA;AAAA;AAAA;AAAA,EAKA,MACE,CAAA,EAC+D;AAC/D,IAAA,OAAO,IAAI,gBAAA;AAAA,MACT,IAAA,CAAK,OAAA;AAAA,MACL,EAAE,GAAG,IAAA,CAAK,MAAA,EAAQ,OAAO,CAAA,EAAE;AAAA,MAC3B,IAAA,CAAK;AAAA,KACP;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OACE,CAAA,EAC+D;AAC/D,IAAA,OAAO,IAAI,gBAAA;AAAA,MACT,IAAA,CAAK,OAAA;AAAA,MACL,EAAE,GAAG,IAAA,CAAK,MAAA,EAAQ,QAAQ,CAAA,EAAE;AAAA,MAC5B,IAAA,CAAK;AAAA,KACP;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsBA,KACE,QAAA,EAGkE;AAClE,IAAA,OAAO,SAAS,IAAI,CAAA;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,KAAA,EAAmE;AACvE,IAAA,OAAO,IAAI,mBAAA,CAAoB,IAAA,CAAK,OAAA,EAAS;AAAA,MAC3C,IAAA,EAAM,KAAK,KAAA,EAAM;AAAA,MACjB,QAAA,EAAU,OAAA;AAAA,MACV,KAAA,EAAO,MAAM,KAAA,EAAM;AAAA;AAAA,MAEnB,UAAA,EAAY,KAAK,MAAA,CAAO,UAAA;AAAA,MACxB,UAAA,EAAY,KAAK,MAAA,CAAO,UAAA;AAAA;AAAA,MAExB,UAAU,IAAA,CAAK;AAAA,KAChB,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAS,KAAA,EAAmE;AAC1E,IAAA,OAAO,IAAI,mBAAA,CAAoB,IAAA,CAAK,OAAA,EAAS;AAAA,MAC3C,IAAA,EAAM,KAAK,KAAA,EAAM;AAAA,MACjB,QAAA,EAAU,UAAA;AAAA,MACV,KAAA,EAAO,MAAM,KAAA,EAAM;AAAA;AAAA,MAEnB,UAAA,EAAY,KAAK,MAAA,CAAO,UAAA;AAAA,MACxB,UAAA,EAAY,KAAK,MAAA,CAAO,UAAA;AAAA;AAAA,MAExB,UAAU,IAAA,CAAK;AAAA,KAChB,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAU,KAAA,EAAmE;AAC3E,IAAA,OAAO,IAAI,mBAAA,CAAoB,IAAA,CAAK,OAAA,EAAS;AAAA,MAC3C,IAAA,EAAM,KAAK,KAAA,EAAM;AAAA,MACjB,QAAA,EAAU,WAAA;AAAA,MACV,KAAA,EAAO,MAAM,KAAA,EAAM;AAAA;AAAA,MAEnB,UAAA,EAAY,KAAK,MAAA,CAAO,UAAA;AAAA,MACxB,UAAA,EAAY,KAAK,MAAA,CAAO,UAAA;AAAA;AAAA,MAExB,UAAU,IAAA,CAAK;AAAA,KAChB,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,KAAA,EAAmE;AACxE,IAAA,OAAO,IAAI,mBAAA,CAAoB,IAAA,CAAK,OAAA,EAAS;AAAA,MAC3C,IAAA,EAAM,KAAK,KAAA,EAAM;AAAA,MACjB,QAAA,EAAU,QAAA;AAAA,MACV,KAAA,EAAO,MAAM,KAAA,EAAM;AAAA;AAAA,MAEnB,UAAA,EAAY,KAAK,MAAA,CAAO,UAAA;AAAA,MACxB,UAAA,EAAY,KAAK,MAAA,CAAO,UAAA;AAAA;AAAA,MAExB,UAAU,IAAA,CAAK;AAAA,KAChB,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,KAAA,GAA+D;AAC7D,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,OAAA,EAAS,UAAA,EAAY;AACrC,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OAEF;AAAA,IACF;AACA,IAAA,OAAO,KAAK,OAAA,CAAQ,OAAA,CAAQ,UAAA,CAAW,IAAA,CAAK,SAAS,CAAA;AAAA,EACvD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,OAAA,GAAe;AACb,IAAA,IAAI,IAAA,CAAK,eAAA,KAAoB,YAAA,EAAc,OAAO,IAAA,CAAK,eAAA;AACvD,IAAA,MAAM,GAAA,GAAM,KAAK,KAAA,EAAM;AACvB,IAAA,MAAM,QAAA,GAAW,YAAA;AAAA,MACf,GAAA;AAAA,MACA,KAAK,OAAA,CAAQ,OAAA;AAAA,MACb,KAAK,eAAA;AAAgB,KACvB;AACA,IAAA,IAAA,CAAK,eAAA,GAAkB,QAAA;AACvB,IAAA,OAAO,QAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAyBA,OAAA,GAA4B;AAC1B,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,OAAA,EAAS;AACzB,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OAEF;AAAA,IACF;AAGA,IAAA,MAAM,OAAA,GAAU,aAAA,CAAc,IAAA,CAAK,OAAA,EAAS,KAAK,MAAM,CAAA;AAGvD,IAAA,MAAM,eAAA,GAAkB,KAAK,6BAAA,EAA8B;AAC3D,IAAA,MAAM,MACJ,eAAA,KAAoB,MAAA,GAAY,UAAU,EAAE,GAAG,SAAS,eAAA,EAAgB;AAC1E,IAAA,MAAM,cAAA,GAAiB,OAAA;AAGvB,IAAA,MAAM,cAAA,GAAiB,KAAK,eAAA,EAAgB;AAC5C,IAAA,MAAM,WAAW,YAAA,CAAa,GAAA,EAAK,IAAA,CAAK,OAAA,CAAQ,SAAS,cAAc,CAAA;AAGvE,IAAA,IAAI,OAAA;AACJ,IAAA,IAAI,SAAA;AACJ,IAAA,IAAI,kBAAA;AACJ,IAAA,IAAI,oBAAA;AACJ,IAAA,IAAI,IAAA,CAAK,OAAA,CAAQ,OAAA,CAAQ,UAAA,KAAe,MAAA,EAAW;AACjD,MAAA,MAAM,MAAA,GAAS,IAAA,CAAK,OAAA,CAAQ,OAAA,CAAQ,WAAW,QAAQ,CAAA;AACvD,MAAA,OAAA,GAAU,MAAA,CAAO,GAAA;AACjB,MAAA,SAAA,GAAY,MAAA,CAAO,MAAA;AAEnB,MAAA,MAAM,mBAAA,GAAsB,YAAA;AAAA,QAC1B,cAAA;AAAA,QACA,KAAK,OAAA,CAAQ,OAAA;AAAA,QACb;AAAA,OACF;AACA,MAAA,MAAM,iBAAA,GACJ,IAAA,CAAK,OAAA,CAAQ,OAAA,CAAQ,WAAW,mBAAmB,CAAA;AACrD,MAAA,kBAAA,GAAqB,iBAAA,CAAkB,GAAA;AACvC,MAAA,oBAAA,GAAuB,iBAAA,CAAkB,MAAA;AAAA,IAC3C;AAEA,IAAA,OAAO,IAAI,aAAA,CAAc;AAAA,MACvB,GAAA;AAAA,MACA,cAAA;AAAA,MACA,OAAA;AAAA,MACA,SAAA;AAAA,MACA,kBAAA;AAAA,MACA,oBAAA;AAAA,MACA,OAAA,EAAS,KAAK,OAAA,CAAQ,OAAA;AAAA,MACtB,OAAA,EAAS,IAAA,CAAK,OAAA,CAAQ,OAAA,IAAW,QAAA;AAAA,MACjC,OAAA,EAAS,KAAK,OAAA,CAAQ,OAAA;AAAA,MACtB,cAAA;AAAA,MACA,OAAO,IAAA,CAAK,MAAA;AAAA,MACZ,eAAA;AAAA;AAAA,MAEA,UAAU,IAAA,CAAK,SAAA;AAAA,MACf,kBAAA,EAAoB,KAAK,OAAA,CAAQ;AAAA,KAClC,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,eAAA,GAAuC;AACrC,IAAA,OAAO,mBAAA,CAAoB,KAAK,OAAO,CAAA;AAAA,EACzC;AAAA,EAEA,eAAA,GAAgC;AAC9B,IAAA,MAAM,EAAE,OAAA,EAAQ,GAAI,IAAA,CAAK,OAAA;AACzB,IAAA,IAAI,YAAY,MAAA,EAAW;AACzB,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OAEF;AAAA,IACF;AACA,IAAA,OAAO,OAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,MAAM,OAAA,GAAiC;AACrC,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,OAAA,EAAS;AACzB,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OAEF;AAAA,IACF;AAGA,IAAA,IAAI,sBAAA,CAAuB,IAAA,CAAK,KAAA,EAAO,CAAA,EAAG;AACxC,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OACF;AAAA,IACF;AAGA,IAAA,MAAM,eAAA,GAAkB,MAAM,IAAA,CAAK,sBAAA,EAAuB;AAC1D,IAAA,IAAI,oBAAoB,MAAA,EAAW;AACjC,MAAA,OAAO,eAAA;AAAA,IACT;AAGA,IAAA,MAAM,QAAA,GAAW,KAAK,OAAA,EAAQ;AAC9B,IAAA,MAAM,UACJ,MAAM,IAAA,CAAK,OAAA,CAAQ,OAAA,CAAQ,QAAiC,QAAQ,CAAA;AAGtE,IAAgB,IAAA,CAAK,OAAA,CAAQ,OAAA,IAAW;AACxC,IAAA,MAAM,IAAA,GAAO,oBAAA,CAAqB,OAAA,EAAS,IAAA,CAAK,MAAe,CAAA;AAG/D,IAAA,OAAO,UAAA;AAAA,MACL,IAAA;AAAA,MACA,KAAK,MAAA,CAAO,UAAA;AAAA,MACZ,KAAK,MAAA,CAAO,UAAA;AAAA,MACZ,IAAA,CAAK;AAAA,KACP;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,UACJ,OAAA,EACuB;AAEvB,IAAA,IAAI,sBAAA,CAAuB,IAAA,CAAK,KAAA,EAAO,CAAA,EAAG;AACxC,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OACF;AAAA,IACF;AAGA,IAAA,MAAM,eAAA,GAAkB,MAAM,IAAA,CAAK,wBAAA,CAAyB,OAAO,CAAA;AACnE,IAAA,IAAI,oBAAoB,MAAA,EAAW;AACjC,MAAA,OAAO,eAAA;AAAA,IACT;AAGA,IAAA,MAAM,QAAA,GAAW,KAAK,OAAA,EAAQ;AAC9B,IAAA,MAAM,OAAA,GAAU,MAAM,OAAA,CAAQ,OAAA,CAAiC,QAAQ,CAAA;AACvE,IAAgB,IAAA,CAAK,OAAA,CAAQ,OAAA,IAAW;AACxC,IAAA,MAAM,IAAA,GAAO,oBAAA,CAAqB,OAAA,EAAS,IAAA,CAAK,MAAe,CAAA;AAE/D,IAAA,OAAO,UAAA;AAAA,MACL,IAAA;AAAA,MACA,KAAK,MAAA,CAAO,UAAA;AAAA,MACZ,KAAK,MAAA,CAAO,UAAA;AAAA,MACZ,IAAA,CAAK;AAAA,KACP;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,sBAAA,GAA4D;AAChE,IAAA,MAAM,eAAA,GAAkB,KAAK,6BAAA,EAA8B;AAC3D,IAAA,IAAI,oBAAoB,MAAA,EAAW;AACjC,MAAA,OAAO,MAAA;AAAA,IACT;AAGA,IAAA,IAAI,QAAA;AACJ,IAAA,IAAI,IAAA,CAAK,6BAA6B,YAAA,EAAc;AAClD,MAAA,MAAM,OAAA,GAAU,aAAA,CAAc,IAAA,CAAK,OAAA,EAAS,KAAK,MAAM,CAAA;AACvD,MAAA,MAAM,YAAA,GAAe;AAAA,QACnB,GAAG,OAAA;AAAA,QACH;AAAA,OACF;AACA,MAAA,QAAA,GAAW,YAAA;AAAA,QACT,YAAA;AAAA,QACA,KAAK,OAAA,CAAQ,OAAA;AAAA,QACb,KAAK,eAAA;AAAgB,OACvB;AACA,MAAA,IAAA,CAAK,wBAAA,GAA2B,QAAA;AAAA,IAClC,CAAA,MAAO;AACL,MAAA,QAAA,GAAW,IAAA,CAAK,wBAAA;AAAA,IAClB;AAEA,IAAA,MAAM,mBACJ,MAAM,IAAA,CAAK,eAAA,EAAgB,CAAE,QAAiC,QAAQ,CAAA;AACxE,IAAgB,IAAA,CAAK,OAAA,CAAQ,OAAA,IAAW;AACxC,IAAA,MAAM,IAAA,GAAO,oBAAA,CAAqB,gBAAA,EAAkB,IAAA,CAAK,MAAe,CAAA;AAExE,IAAA,IAAI;AAEF,MAAA,OAAO,mBAAA;AAAA,QACL,IAAA;AAAA,QACA,IAAA,CAAK,MAAA;AAAA,QACL,eAAA;AAAA,QACA,KAAK,OAAA,CAAQ,kBAAA;AAAA,QACb,IAAA,CAAK;AAAA,OACP;AAAA,IACF,SAAS,KAAA,EAAO;AACd,MAAA,IAAI,iBAAiB,0BAAA,EAA4B;AAC/C,QAAA,IAAA,CAAK,gCAAA,GAAmC,MAAA;AACxC,QAAA,IAAA,CAAK,wBAAA,GAA2B,YAAA;AAChC,QAAA,OAAO,MAAA;AAAA,MACT;AACA,MAAA,IAAI,iBAAiB,yBAAA,EAA2B;AAC9C,QAAA,IAAA,CAAK,gCAAA,GAAmC,MAAA;AACxC,QAAA,IAAA,CAAK,wBAAA,GAA2B,YAAA;AAChC,QAAA,OAAO,MAAA;AAAA,MACT;AACA,MAAA,MAAM,KAAA;AAAA,IACR;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,yBACJ,OAAA,EACmC;AACnC,IAAA,MAAM,eAAA,GAAkB,KAAK,6BAAA,EAA8B;AAC3D,IAAA,IAAI,oBAAoB,MAAA,EAAW;AACjC,MAAA,OAAO,MAAA;AAAA,IACT;AAEA,IAAA,IAAI,QAAA;AACJ,IAAA,IAAI,IAAA,CAAK,6BAA6B,YAAA,EAAc;AAClD,MAAA,MAAM,OAAA,GAAU,aAAA,CAAc,IAAA,CAAK,OAAA,EAAS,KAAK,MAAM,CAAA;AACvD,MAAA,MAAM,YAAA,GAAe;AAAA,QACnB,GAAG,OAAA;AAAA,QACH;AAAA,OACF;AACA,MAAA,QAAA,GAAW,YAAA;AAAA,QACT,YAAA;AAAA,QACA,KAAK,OAAA,CAAQ,OAAA;AAAA,QACb,KAAK,eAAA;AAAgB,OACvB;AACA,MAAA,IAAA,CAAK,wBAAA,GAA2B,QAAA;AAAA,IAClC,CAAA,MAAO;AACL,MAAA,QAAA,GAAW,IAAA,CAAK,wBAAA;AAAA,IAClB;AAEA,IAAA,MAAM,gBAAA,GACJ,MAAM,OAAA,CAAQ,OAAA,CAAiC,QAAQ,CAAA;AACzD,IAAgB,IAAA,CAAK,OAAA,CAAQ,OAAA,IAAW;AACxC,IAAA,MAAM,IAAA,GAAO,oBAAA,CAAqB,gBAAA,EAAkB,IAAA,CAAK,MAAe,CAAA;AAExE,IAAA,IAAI;AACF,MAAA,OAAO,mBAAA;AAAA,QACL,IAAA;AAAA,QACA,IAAA,CAAK,MAAA;AAAA,QACL,eAAA;AAAA,QACA,KAAK,OAAA,CAAQ,kBAAA;AAAA,QACb,IAAA,CAAK;AAAA,OACP;AAAA,IACF,SAAS,KAAA,EAAO;AACd,MAAA,IAAI,iBAAiB,0BAAA,EAA4B;AAC/C,QAAA,IAAA,CAAK,gCAAA,GAAmC,MAAA;AACxC,QAAA,IAAA,CAAK,wBAAA,GAA2B,YAAA;AAChC,QAAA,OAAO,MAAA;AAAA,MACT;AACA,MAAA,IAAI,iBAAiB,yBAAA,EAA2B;AAC9C,QAAA,IAAA,CAAK,gCAAA,GAAmC,MAAA;AACxC,QAAA,IAAA,CAAK,wBAAA,GAA2B,YAAA;AAChC,QAAA,OAAO,MAAA;AAAA,MACT;AACA,MAAA,MAAM,KAAA;AAAA,IACR;AAAA,EACF;AAAA,EAEA,6BAA6B,OAAA,EAAmC;AAC9D,IAAA,MAAM,oBAAA,GAAuB,IAAA,CAAK,MAAA,CAAO,UAAA,CAAW,IAAA;AAAA,MAClD,CAAC,cAAc,SAAA,CAAU;AAAA,KAC3B;AAEA,IAAA,MAAM,eACJ,oBAAA,GACG;AAAA,MACC;AAAA,QACE,IAAA,EAAM,QAAA;AAAA,QACN,wBAAA,EAA0B;AAAA,OAC5B;AAAA,MACA;AAAA,QACE,IAAA,EAAM,OAAA;AAAA,QACN,wBAAA,EAA0B;AAAA,OAC5B;AAAA,MACA;AAAA,QACE,IAAA,EAAM,OAAA;AAAA,QACN,wBAAA,EAA0B;AAAA;AAC5B,KACF,GACC;AAAA,MACC;AAAA,QACE,IAAA,EAAM,QAAA;AAAA,QACN,wBAAA,EAA0B;AAAA,OAC5B;AAAA,MACA;AAAA,QACE,IAAA,EAAM,OAAA;AAAA,QACN,wBAAA,EAA0B;AAAA;AAC5B,KACF;AAEJ,IAAA,KAAA,MAAW,OAAO,YAAA,EAAc;AAC9B,MAAA,MAAM,eAAA,GAAkB,qBAAA,CAAsB,IAAA,CAAK,MAAA,EAAQ,OAAA,EAAS;AAAA,QAClE,kBAAA,EAAoB,KAAK,OAAA,CAAQ,kBAAA;AAAA,QACjC,MAAM,GAAA,CAAI,IAAA;AAAA,QACV,0BAA0B,GAAA,CAAI;AAAA,OAC/B,CAAA;AAED,MAAA,IAAI;AAGF,QAAA,KAAK,IAAA,CAAK,SAAA;AAAA,UACR;AAAA,SAKF;AAAA,MACF,CAAA,CAAA,MAAQ;AAAA,MAIR;AAAA,IACF;AAAA,EACF;AAAA,EAEA,6BAAA,GAAuE;AACrE,IAAA,IAAI,IAAA,CAAK,qCAAqC,MAAA,EAAW;AACvD,MAAA,OAAO,MAAA;AAAA,IACT;AAEA,IAAA,IAAI,IAAA,CAAK,qCAAqC,YAAA,EAAc;AAC1D,MAAA,OAAO,IAAA,CAAK,gCAAA;AAAA,IACd;AAEA,IAAA,MAAM,OAAA,GAAU,IAAI,kBAAA,EAAmB;AACvC,IAAA,IAAA,CAAK,6BAA6B,OAAO,CAAA;AAEzC,IAAA,MAAM,QAAA,GAAW,QAAQ,iBAAA,EAAkB;AAC3C,IAAA,IAAI,QAAA,CAAS,WAAW,CAAA,EAAG;AACzB,MAAA,IAAA,CAAK,gCAAA,GAAmC,MAAA;AACxC,MAAA,OAAO,MAAA;AAAA,IACT;AAEA,IAAA,MAAM,kBAAkB,IAAA,CAAK,mCAAA;AAAA,MAC3B,qBAAqB,QAAA,EAAU;AAAA,QAC7B,OAAO,IAAA,CAAK,MAAA;AAAA,QACZ,kBAAA,EAAoB,KAAK,OAAA,CAAQ;AAAA,OAClC;AAAA,KACH;AACA,IAAA,IAAA,CAAK,gCAAA,GAAmC,eAAA;AACxC,IAAA,OAAO,eAAA;AAAA,EACT;AAAA,EAEA,gCAAA,GAA0E;AACxE,IAAA,IAAI,IAAA,CAAK,wCAAwC,MAAA,EAAW;AAC1D,MAAA,OAAO,MAAA;AAAA,IACT;AAEA,IAAA,IAAI,IAAA,CAAK,wCAAwC,YAAA,EAAc;AAC7D,MAAA,OAAO,IAAA,CAAK,mCAAA;AAAA,IACd;AAEA,IAAA,MAAM,OAAA,GAAU,IAAI,kBAAA,EAAmB;AACvC,IAAA,IAAA,CAAK,6BAA6B,OAAO,CAAA;AACzC,IAAA,IAAI,CAAC,IAAA,CAAK,iCAAA,CAAkC,OAAO,CAAA,EAAG;AACpD,MAAA,IAAA,CAAK,mCAAA,GAAsC,MAAA;AAC3C,MAAA,OAAO,MAAA;AAAA,IACT;AAEA,IAAA,MAAM,kBAAkB,IAAA,CAAK,mCAAA;AAAA,MAC3B,oBAAA,CAAqB,OAAA,CAAQ,iBAAA,EAAkB,EAAG;AAAA,QAChD,OAAO,IAAA,CAAK,MAAA;AAAA,QACZ,kBAAA,EAAoB,KAAK,OAAA,CAAQ;AAAA,OAClC;AAAA,KACH;AACA,IAAA,IAAA,CAAK,mCAAA,GAAsC,eAAA;AAC3C,IAAA,OAAO,eAAA;AAAA,EACT;AAAA,EAEA,oCACE,eAAA,EAC2B;AAC3B,IAAA,MAAM,MAAA,GAAS,CAAC,GAAG,eAAe,CAAA;AAClC,IAAA,MAAM,OAAO,IAAI,GAAA;AAAA,MACf,MAAA,CAAO,GAAA;AAAA,QACL,CAACA,MAAAA,KACC,CAAA,EAAGA,MAAAA,CAAM,KAAK,CAAA,EAAA,EAASA,MAAAA,CAAM,KAAK,CAAA,EAAA,EAAS,MAAA,CAAOA,MAAAA,CAAM,aAAa,CAAC,CAAA;AAAA;AAC1E,KACF;AAEA,IAAA,SAAS,IAAI,KAAA,EAAqB;AAChC,MAAA,MAAM,GAAA,GAAM,GAAG,KAAK,CAAA,UAAA,CAAA;AACpB,MAAA,IAAI,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,EAAG;AACnB,MAAA,IAAA,CAAK,IAAI,GAAG,CAAA;AACZ,MAAA,MAAA,CAAO,IAAA,CAAK;AAAA,QACV,KAAA;AAAA,QACA,KAAA,EAAO,IAAA;AAAA,QACP,UAAA,EAAY,GAAG,KAAK,CAAA,GAAA,CAAA;AAAA,QACpB,aAAA,EAAe;AAAA,OAChB,CAAA;AAAA,IACH;AAEA,IAAA,KAAA,MAAW,SAAA,IAAa,IAAA,CAAK,MAAA,CAAO,UAAA,EAAY;AAC9C,MAAA,IAAI,CAAC,UAAU,QAAA,EAAU;AACzB,MAAA,GAAA,CAAI,UAAU,SAAS,CAAA;AACvB,MAAA,GAAA,CAAI,UAAU,SAAS,CAAA;AAAA,IACzB;AAEA,IAAA,OAAO,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,EAAG,CAAA,KAAM;AAC/B,MAAA,MAAM,YAAA,GAAe,CAAA,CAAE,KAAA,CAAM,aAAA,CAAc,EAAE,KAAK,CAAA;AAClD,MAAA,IAAI,YAAA,KAAiB,GAAG,OAAO,YAAA;AAC/B,MAAA,OAAO,CAAA,CAAE,KAAA,CAAM,aAAA,CAAc,CAAA,CAAE,KAAK,CAAA;AAAA,IACtC,CAAC,CAAA;AAAA,EACH;AAAA,EAEA,MAAM,qBAAA,CACJ,UAAA,EACA,WACA,SAAA,EACA,UAAA,EACA,QACA,UAAA,EACyC;AACzC,IAAA,MAAM,eAAA,GAAkB,KAAK,gCAAA,EAAiC;AAC9D,IAAA,IAAI,oBAAoB,MAAA,EAAW;AACjC,MAAA,OAAO,MAAA;AAAA,IACT;AAEA,IAAA,IAAI,IAAA;AACJ,IAAA,IAAI;AACF,MAAA,IAAA,GAAO,MAAM,IAAA,CAAK,kBAAA,CAAmB,UAAA,EAAY,WAAW,UAAA,EAAY;AAAA,QACtE;AAAA,OACD,CAAA;AAAA,IACH,SAAS,KAAA,EAAO;AACd,MAAA,IAAI,iBAAiB,yBAAA,EAA2B;AAC9C,QAAA,IAAA,CAAK,mCAAA,GAAsC,MAAA;AAC3C,QAAA,OAAO,MAAA;AAAA,MACT;AACA,MAAA,MAAM,KAAA;AAAA,IACR;AAEA,IAAA,MAAM,OAAA,GAAU,KAAK,MAAA,GAAS,SAAA;AAC9B,IAAA,MAAM,aAAa,OAAA,GAAU,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,SAAS,CAAA,GAAI,IAAA;AACxD,IAA0B,IAAA,CAAK,OAAA,CAAQ,OAAA,IAAW;AAClD,IAAA,MAAM,WAAA,GAAc,oBAAA;AAAA,MAClB,UAAA,GAAa,UAAA,CAAW,UAAA,EAAW,GAAI,UAAA;AAAA,MACvC,IAAA,CAAK,MAEP,CAAA;AAEA,IAAA,IAAI,IAAA;AACJ,IAAA,IAAI;AAEF,MAAA,IAAA,GAAO,mBAAA;AAAA,QACL,WAAA;AAAA,QACA,IAAA,CAAK,MAAA;AAAA,QACL,eAAA;AAAA,QACA,KAAK,OAAA,CAAQ,kBAAA;AAAA,QACb,IAAA,CAAK;AAAA,OACP;AAAA,IACF,SAAS,KAAA,EAAO;AACd,MAAA,IAAI,iBAAiB,0BAAA,EAA4B;AAC/C,QAAA,IAAA,CAAK,mCAAA,GAAsC,MAAA;AAC3C,QAAA,OAAO,MAAA;AAAA,MACT;AACA,MAAA,IAAI,iBAAiB,yBAAA,EAA2B;AAC9C,QAAA,IAAA,CAAK,mCAAA,GAAsC,MAAA;AAC3C,QAAA,OAAO,MAAA;AAAA,MACT;AACA,MAAA,MAAM,KAAA;AAAA,IACR;AAEA,IAAA,IAAI,UAAA;AACJ,IAAA,IAAI,cAAA;AAEJ,IAAA,IAAI,WAAA,CAAY,SAAS,CAAA,EAAG;AAC1B,MAAA,IAAI;AACF,QAAA,cAAA,GAAiB,IAAA,CAAK,4BAAA;AAAA,UACpB,YAAY,CAAC,CAAA;AAAA,UACb,eAAA;AAAA,UACA;AAAA,SACF;AACA,QAAA,UAAA,GAAa,IAAA,CAAK,4BAAA;AAAA,UAChB,WAAA,CAAY,GAAG,CAAA,CAAE,CAAA;AAAA,UACjB,eAAA;AAAA,UACA;AAAA,SACF;AAAA,MACF,SAAS,KAAA,EAAO;AACd,QAAA,IAAI,iBAAiB,0BAAA,EAA4B;AAC/C,UAAA,IAAA,CAAK,mCAAA,GAAsC,MAAA;AAC3C,UAAA,OAAO,MAAA;AAAA,QACT;AACA,QAAA,IAAI,iBAAiB,yBAAA,EAA2B;AAC9C,UAAA,IAAA,CAAK,mCAAA,GAAsC,MAAA;AAC3C,UAAA,OAAO,MAAA;AAAA,QACT;AACA,QAAA,MAAM,KAAA;AAAA,MACR;AAAA,IACF;AAEA,IAAA,OAAO;AAAA,MACL,IAAA;AAAA,MACA,UAAA,EAAY,OAAA,IAAW,UAAA,GAAa,UAAA,GAAa,MAAA;AAAA,MACjD,UAAA,EACE,MAAA,KAAW,MAAA,IAAc,UAAA,IAAc,UACrC,cAAA,GACA,MAAA;AAAA,MACJ,WAAA,EAAa,UAAA,GAAa,MAAA,KAAW,MAAA,GAAY,OAAA;AAAA,MACjD,WAAA,EAAa,UAAA,GAAa,OAAA,GAAU,MAAA,KAAW;AAAA,KACjD;AAAA,EACF;AAAA,EAEA,kCAAkC,OAAA,EAAsC;AACtE,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,MAAA,CAAO,OAAA,EAAS;AACtC,MAAA,MAAMA,SAAQ,IAAA,CAAK,KAAA;AAGnB,MAAA,IACEA,MAAAA,CAAM,IAAA,CAAK,MAAA,KAAW,CAAA,IACtBA,MAAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,OAAA,IAClBA,MAAAA,CAAM,WAAA,KAAgB,MAAA,EACtB;AACA,QAAA,OAAA,CAAQ,OAAOA,MAAAA,CAAM,KAAA,EAAOA,OAAM,IAAA,CAAK,CAAC,GAAI,IAAI,CAAA;AAChD,QAAA;AAAA,MACF;AAGA,MAAA,IAAIA,MAAAA,CAAM,KAAK,MAAA,KAAW,CAAA,IAAKA,OAAM,IAAA,CAAK,CAAC,MAAM,OAAA,EAAS;AACxD,QAAA,OAAO,KAAA;AAAA,MACT;AAEA,MAAA,IAAIA,MAAAA,CAAM,gBAAgB,MAAA,EAAW;AACnC,QAAA,OAAO,KAAA;AAAA,MACT;AAEA,MAAA,MAAM,QAAA,GAAW,gBAAA,CAAiBA,MAAAA,CAAM,WAAW,CAAA;AACnD,MAAA,IAAI,QAAA,CAAS,WAAW,CAAA,EAAG;AACzB,QAAA,OAAO,KAAA;AAAA,MACT;AAEA,MAAA,OAAA,CAAQ,OAAOA,MAAAA,CAAM,KAAA,EAAO,QAAA,CAAS,CAAC,GAAI,KAAK,CAAA;AAAA,IACjD;AAEA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,4BAAA,CACE,GAAA,EACA,eAAA,EACA,SAAA,EACQ;AACR,IAAA,MAAM,aAAa,IAAA,CAAK,mCAAA;AAAA,MACtB,GAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,OAAO,kBAAA,CAAmB,UAAA,EAAY,IAAA,CAAK,MAAA,CAAO,SAAS,SAAS,CAAA;AAAA,EACtE;AAAA,EAEA,mCAAA,CACE,KACA,eAAA,EACyB;AACzB,IAAA,MAAM,sBAAA,uBAA6B,GAAA,EAAoB;AACvD,IAAA,KAAA,MAAWA,UAAS,eAAA,EAAiB;AACnC,MAAA,sBAAA,CAAuB,GAAA;AAAA,QACrB,CAAA,EAAGA,MAAAA,CAAM,KAAK,CAAA,EAAA,EAASA,OAAM,KAAK,CAAA,CAAA;AAAA,QAClCA,MAAAA,CAAM;AAAA,OACR;AAAA,IACF;AAEA,IAAA,MAAM,mBAAA,uBAA0B,GAAA,EAAY;AAC5C,IAAA,KAAA,MAAW,SAAA,IAAa,IAAA,CAAK,MAAA,CAAO,UAAA,EAAY;AAC9C,MAAA,IAAI,UAAU,QAAA,EAAU;AACtB,QAAA,mBAAA,CAAoB,GAAA,CAAI,UAAU,SAAS,CAAA;AAAA,MAC7C;AAAA,IACF;AAEA,IAAA,MAAM,gBAAyC,EAAC;AAEhD,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,MAAA,CAAO,OAAA,EAAS;AACtC,MAAA,MAAM,KAAA,GAAQ,KAAK,KAAA,CAAM,KAAA;AACzB,MAAA,MAAMsB,YAAAA,GAAc,KAAK,KAAA,CAAM,WAAA;AAG/B,MAAA,IAAIA,iBAAgB,MAAA,EAAW;AAC7B,QAAA,IAAI,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG;AAChC,UAAA,MAAM,IAAI,0BAAA,CAA2B,KAAA,EAAO,SAAS,CAAA;AAAA,QACvD;AACA,QAAA,MAAM,SAAA,GAAY,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA;AACnC,QAAA,MAAMG,cAAa,sBAAA,CAAuB,GAAA;AAAA,UACxC,CAAA,EAAG,KAAK,CAAA,EAAA,EAAS,SAAS,CAAA;AAAA,SAC5B;AACA,QAAA,IAAIA,gBAAe,MAAA,EAAW;AAC5B,UAAA,MAAM,IAAI,0BAAA,CAA2B,KAAA,EAAO,SAAS,CAAA;AAAA,QACvD;AAEA,QAAA,MAAMC,YAAAA,GAAc,IAAA,CAAK,uBAAA,CAAwB,aAAA,EAAe,KAAK,CAAA;AACrE,QAAAA,aAAY,SAAS,CAAA,GAAI,eAAA,CAAgB,GAAA,CAAID,WAAU,CAAC,CAAA;AACxD,QAAA;AAAA,MACF;AAEA,MAAA,MAAM,QAAA,GAAW,iBAAiBH,YAAW,CAAA;AAC7C,MAAA,IAAI,QAAA,CAAS,WAAW,CAAA,EAAG;AACzB,QAAA,MAAM,IAAI,0BAAA,CAA2B,KAAA,EAAO,SAAS,CAAA;AAAA,MACvD;AAEA,MAAA,MAAM,QAAA,GAAW,SAAS,CAAC,CAAA;AAC3B,MAAA,MAAM,aAAa,sBAAA,CAAuB,GAAA;AAAA,QACxC,CAAA,EAAG,KAAK,CAAA,EAAA,EAAS,QAAQ,CAAA;AAAA,OAC3B;AACA,MAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,QAAA,MAAM,IAAI,0BAAA,CAA2B,KAAA,EAAO,QAAQ,CAAA;AAAA,MACtD;AAEA,MAAA,IAAI,mBAAA,CAAoB,GAAA,CAAI,KAAK,CAAA,EAAG;AAClC,QAAA,MAAM,YAAA,GAAe,sBAAA,CAAuB,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,IAAA,CAAU,CAAA;AAClE,QAAA,IAAI,iBAAiB,MAAA,EAAW;AAC9B,UAAA,MAAM,IAAI,0BAAA,CAA2B,KAAA,EAAO,IAAI,CAAA;AAAA,QAClD;AACA,QAAA,MAAM,OAAA,GAAU,IAAI,YAAY,CAAA;AAChC,QAAA,IAAI,OAAA,KAAY,IAAA,IAAQ,OAAA,KAAY,MAAA,EAAW;AAC7C,UAAA;AAAA,QACF;AAAA,MACF;AAEA,MAAA,MAAM,WAAA,GAAc,IAAA,CAAK,uBAAA,CAAwB,aAAA,EAAe,KAAK,CAAA;AAErE,MAAA,MAAM,SAAA,GAAY,IAAA,CAAK,yBAAA,CAA0B,KAAK,CAAA;AACtD,MAAA,MAAM,QAAA,GACJ,SAAA,GACE,IAAA,CAAK,OAAA,CAAQ,kBAAA,CAAmB,sBAAA;AAAA,QAC9B,SAAA;AAAA,QACA;AAAA,OACF,GACA,MAAA;AAEJ,MAAA,MAAM,OAAA,GAAU,mBAAA,CAAoB,GAAA,CAAI,UAAU,GAAG,QAAQ,CAAA;AAE7D,MAAA,IAAI,QAAA,CAAS,WAAW,CAAA,EAAG;AACzB,QAAA,WAAA,CAAY,QAAQ,CAAA,GAAI,OAAA;AACxB,QAAA;AAAA,MACF;AAEA,MAAA,IAAI,OAAA,GAAU,WAAA;AACd,MAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,KAAA,GAAQ,QAAA,CAAS,MAAA,GAAS,GAAG,KAAA,EAAA,EAAS;AACxD,QAAA,MAAM,OAAA,GAAU,SAAS,KAAK,CAAA;AAC9B,QAAA,MAAM,SAAA,GAAY,QAAQ,OAAO,CAAA;AACjC,QAAA,IAAI,OAAO,SAAA,KAAc,QAAA,IAAY,SAAA,KAAc,IAAA,EAAM;AACvD,UAAA,OAAA,GAAU,SAAA;AAAA,QACZ,CAAA,MAAO;AACL,UAAA,MAAM,UAAmC,EAAC;AAC1C,UAAA,OAAA,CAAQ,OAAO,CAAA,GAAI,OAAA;AACnB,UAAA,OAAA,GAAU,OAAA;AAAA,QACZ;AAAA,MACF;AACA,MAAA,OAAA,CAAQ,QAAA,CAAS,EAAA,CAAG,EAAE,CAAE,CAAA,GAAI,OAAA;AAAA,IAC9B;AAEA,IAAA,OAAO,aAAA;AAAA,EACT;AAAA,EAEA,uBAAA,CACE,eACA,KAAA,EACyB;AACzB,IAAA,MAAM,QAAA,GAAW,cAAc,KAAK,CAAA;AACpC,IAAA,IAAI,OAAO,QAAA,KAAa,QAAA,IAAY,QAAA,KAAa,IAAA,EAAM;AACrD,MAAA,OAAO,QAAA;AAAA,IACT;AACA,IAAA,MAAM,UAAmC,EAAC;AAC1C,IAAA,aAAA,CAAc,KAAK,CAAA,GAAI,OAAA;AACvB,IAAA,OAAO,OAAA;AAAA,EACT;AAAA,EAEA,0BAA0B,KAAA,EAA8C;AACtE,IAAA,IAAI,KAAA,KAAU,IAAA,CAAK,MAAA,CAAO,UAAA,EAAY;AACpC,MAAA,OAAO,KAAK,MAAA,CAAO,UAAA;AAAA,IACrB;AACA,IAAA,OAAO,IAAA,CAAK,OAAO,UAAA,CAAW,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,SAAA,KAAc,KAAK,CAAA,EAAG,SAAA;AAAA,EACpE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,MAAM,SAAS,OAAA,EAAuD;AACpE,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,OAAA,EAAS;AACzB,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OAEF;AAAA,IACF;AAGA,IAAA,IAAI,IAAA,CAAK,MAAA,CAAO,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG;AACpC,MAAA,MAAM,IAAI,eAAA;AAAA,QACR,wEAAA;AAAA,QACA;AAAA,UACE,MAAA,EAAQ;AAAA,YACN;AAAA,cACE,IAAA,EAAM,SAAA;AAAA,cACN,OAAA,EAAS;AAAA;AACX;AACF,SACF;AAAA,QACA;AAAA,UACE,UAAA,EAAY,CAAA,oEAAA;AAAA;AACd,OACF;AAAA,IACF;AAGA,IAAA,MAAM,UAAA,GACJ,OAAA,CAAQ,IAAA,KAAS,MAAA,IAAa,QAAQ,MAAA,KAAW,MAAA;AACnD,IAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,KAAA,IAAS,OAAA,CAAQ,IAAA,IAAQ,wBAAA;AAC/C,IAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,KAAA,IAAS,OAAA,CAAQ,MAAA;AAGxC,IAAA,IAAI,UAAA;AACJ,IAAA,IAAI,MAAA,EAAQ;AACV,MAAA,UAAA,GAAa,aAAa,MAAM,CAAA;AAChC,MAAA,qBAAA,CAAsB,UAAA,EAAY,IAAA,CAAK,MAAA,CAAO,OAAO,CAAA;AAAA,IACvD;AAGA,IAAA,MAAM,aAAa,KAAA,GAAQ,CAAA;AAE3B,IAAA,MAAM,SAAA,GAAY,aAAa,UAAA,GAAa,SAAA;AAC5C,IAAA,MAAM,SAAA,GAAY,MAAM,IAAA,CAAK,qBAAA;AAAA,MAC3B,UAAA;AAAA,MACA,SAAA;AAAA,MACA,KAAA;AAAA,MACA,UAAA;AAAA,MACA,MAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,IAAI,cAAc,MAAA,EAAW;AAC3B,MAAA,OAAO,SAAA;AAAA,IACT;AAGA,IAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,kBAAA;AAAA,MACtB,UAAA;AAAA,MACA,SAAA;AAAA,MACA;AAAA,KACF;AAGA,IAAA,MAAM,OAAA,GAAU,KAAK,MAAA,GAAS,KAAA;AAC9B,IAAA,MAAM,aAAa,OAAA,GAAU,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,KAAK,CAAA,GAAI,IAAA;AAGpD,IAAA,MAAM,WAAA,GAAc,UAAA,GAAa,UAAA,CAAW,UAAA,EAAW,GAAI,UAAA;AAG3D,IAAA,MAAM,IAAA,GAAO,UAAA;AAAA,MACX,WAAA;AAAA,MACA,KAAK,MAAA,CAAO,UAAA;AAAA,MACZ,KAAK,MAAA,CAAO,UAAA;AAAA,MACZ,IAAA,CAAK;AAAA,KACP;AAGA,IAAA,OAAO,oBAAA;AAAA,MACL,IAAA;AAAA,MACA,WAAA;AAAA,MACA,KAAK,MAAA,CAAO,OAAA;AAAA,MACZ,KAAA;AAAA,MACA,OAAA;AAAA,MACA,UAAA;AAAA,MACA,MAAA;AAAA,MACA,CAAC,GAAA,KACC,kBAAA;AAAA,QACE,GAAA;AAAA,QACA,KAAK,MAAA,CAAO,UAAA;AAAA,QACZ,KAAK,MAAA,CAAO;AAAA;AACd,KACJ;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,OAAO,OAAA,EAA2C;AAEhD,IAAA,IAAI,IAAA,CAAK,MAAA,CAAO,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG;AACpC,MAAA,MAAM,IAAI,eAAA;AAAA,QACR,8DAAA;AAAA,QACA;AAAA,UACE,MAAA,EAAQ;AAAA,YACN,EAAE,IAAA,EAAM,SAAA,EAAW,OAAA,EAAS,oCAAA;AAAqC;AACnE,SACF;AAAA,QACA;AAAA,UACE,UAAA,EAAY,CAAA,kEAAA;AAAA;AACd,OACF;AAAA,IACF;AAEA,IAAA,MAAM,SAAA,GAAY,mBAAmB,OAAO,CAAA;AAC5C,IAAA,OAAO,oBAAA;AAAA,MAAqB,SAAA;AAAA,MAAW,CAAC,eAAA,KACtC,IAAA,CAAK,QAAA,CAAS,eAAe;AAAA,KAC/B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,kBAAA,CACJ,UAAA,EACA,SAAA,EACA,OACA,OAAA,EAC6C;AAC7C,IAAA,MAAM,GAAA,GAAM,KAAK,KAAA,EAAM;AAGvB,IAAA,IAAI,OAAA,GAAU,KAAK,MAAA,CAAO,OAAA;AAC1B,IAAA,IAAI,cAAc,UAAA,EAAY;AAC5B,MAAA,OAAA,GAAU,OAAA,CAAQ,GAAA,CAAI,CAAC,IAAA,MAAU;AAAA,QAC/B,GAAG,IAAA;AAAA,QACH,SAAA,EACE,IAAA,CAAK,SAAA,KAAc,KAAA,GAAS,MAAA,GAAoB;AAAA,OACpD,CAAE,CAAA;AAAA,IACJ;AAGA,IAAA,IAAI,UAAA,GAAa,CAAC,GAAG,IAAA,CAAK,OAAO,UAAU,CAAA;AAC3C,IAAA,IAAI,UAAA,EAAY;AACd,MAAA,MAAM,eAAA,GAAkB,oBAAA;AAAA,QACtB,UAAA;AAAA,QACA,KAAK,MAAA,CAAO,OAAA;AAAA,QACZ,SAAA;AAAA,QACA,KAAK,MAAA,CAAO;AAAA,OACd;AACA,MAAA,UAAA,GAAa,CAAC,GAAG,UAAA,EAAY,eAAe,CAAA;AAAA,IAC9C;AAGA,IAAA,MAAM,EAAE,MAAA,EAAQ,UAAA,EAAY,GAAG,kBAAiB,GAAI,GAAA;AACpD,IAAA,MAAM,WAAA,GAAc;AAAA,MAClB,GAAG,gBAAA;AAAA,MACH,UAAA;AAAA,MACA,OAAA;AAAA,MACA,KAAA;AAAA,MACA,GAAI,OAAA,EAAS,eAAA,KAAoB,MAAA,IAAa;AAAA,QAC5C,iBAAiB,OAAA,CAAQ;AAAA;AAC3B,KACF;AAGA,IAAA,MAAM,QAAA,GAAW,YAAA;AAAA,MACf,WAAA;AAAA,MACA,KAAK,OAAA,CAAQ,OAAA;AAAA,MACb,KAAK,eAAA;AAAgB,KACvB;AACA,IAAA,MAAM,UACJ,MAAM,IAAA,CAAK,eAAA,EAAgB,CAAE,QAAiC,QAAQ,CAAA;AACxE,IAAgB,IAAA,CAAK,OAAA,CAAQ,OAAA,IAAW;AACxC,IAAA,OAAO,oBAAA,CAAqB,OAAA,EAAS,IAAA,CAAK,MAAe,CAAA;AAAA,EAC3D;AACF;;;ACjuCA,IAAMK,aAAAA,0BAAsB,cAAc,CAAA;AAiBnC,IAAM,wBAAA,GAAN,MAAM,yBAAA,CAIX;AAAA,EACS,OAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACT,eAAA,GAA6CA,aAAAA;AAAA,EAE7C,WAAA,CAAY,MAAA,EAA4B,KAAA,EAA0B,MAAA,EAAW;AAC3E,IAAA,IAAA,CAAK,OAAA,GAAU,MAAA;AACf,IAAA,IAAA,CAAK,MAAA,GAAS,KAAA;AACd,IAAA,IAAA,CAAK,OAAA,GAAU,MAAA;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA,EAKA,KAAA,GAAkB;AAChB,IAAA,OAAO,aAAA,CAAc,IAAA,CAAK,OAAA,EAAS,IAAA,CAAK,MAAM,CAAA;AAAA,EAChD;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,CAAA,EAAoD;AACxD,IAAA,OAAO,IAAI,yBAAA;AAAA,MACT,IAAA,CAAK,OAAA;AAAA,MACL,EAAE,GAAG,IAAA,CAAK,MAAA,EAAQ,OAAO,CAAA,EAAE;AAAA,MAC3B,IAAA,CAAK;AAAA,KACP;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,CAAA,EAAoD;AACzD,IAAA,OAAO,IAAI,yBAAA;AAAA,MACT,IAAA,CAAK,OAAA;AAAA,MACL,EAAE,GAAG,IAAA,CAAK,MAAA,EAAQ,QAAQ,CAAA,EAAE;AAAA,MAC5B,IAAA,CAAK;AAAA,KACP;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,KAAA,GAA+D;AAC7D,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,OAAA,EAAS,UAAA,EAAY;AACrC,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OAEF;AAAA,IACF;AACA,IAAA,OAAO,KAAK,OAAA,CAAQ,OAAA,CAAQ,UAAA,CAAW,IAAA,CAAK,SAAS,CAAA;AAAA,EACvD;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,GAAe;AACb,IAAA,IAAI,IAAA,CAAK,oBAAoBA,aAAAA,EAAc;AACzC,MAAA,OAAO,IAAA,CAAK,eAAA;AAAA,IACd;AACA,IAAA,MAAM,GAAA,GAAM,KAAK,KAAA,EAAM;AACvB,IAAA,MAAM,QAAA,GAAW,YAAA;AAAA,MACf,GAAA;AAAA,MACA,KAAK,OAAA,CAAQ,OAAA;AAAA,MACb,KAAK,eAAA;AAAgB,KACvB;AACA,IAAA,IAAA,CAAK,eAAA,GAAkB,QAAA;AACvB,IAAA,OAAO,QAAA;AAAA,EACT;AAAA,EAEA,eAAA,GAAuC;AACrC,IAAA,OAAO,mBAAA,CAAoB,KAAK,OAAO,CAAA;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,OAAA,GAAkD;AACtD,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,OAAA,EAAS;AACzB,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OAEF;AAAA,IACF;AAEA,IAAA,MAAM,QAAA,GAAW,KAAK,OAAA,EAAQ;AAC9B,IAAA,MAAM,OACJ,MAAM,IAAA,CAAK,OAAA,CAAQ,OAAA,CAAQ,QAAiC,QAAQ,CAAA;AAEtE,IAAA,OAAO,IAAA,CAAK,YAAY,IAAI,CAAA;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,YACE,IAAA,EAC+B;AAC/B,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ;AACvB,MAAA,MAAM,SAAkC,EAAC;AACzC,MAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,OAAO,CAAA,EAAG;AAC3C,QAAA,MAAM3B,MAAAA,GAAQ,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA;AAC9B,QAAA,IAAI,CAACA,MAAAA,EAAO;AACZ,QAAA,MAAM,KAAA,GAAQ,IAAI,GAAG,CAAA;AAErB,QAAA,IAAIA,MAAAA,CAAM,WAAW,WAAA,EAAa;AAEhC,UAAA,MAAA,CAAO,GAAG,CAAA,GAAI,OAAO,UAAU,QAAA,GAAW,MAAA,CAAO,KAAK,CAAA,GAAI,KAAA;AAC1D,UAAA;AAAA,QACF;AAEA,QAAA,MAAA,CAAO,GAAG,CAAA,GAAI,mBAAA,CAAoBA,MAAAA,EAAO,KAAK,CAAA;AAAA,MAChD;AACA,MAAA,OAAO,MAAA;AAAA,IACT,CAAC,CAAA;AAAA,EACH;AACF;AAQA,SAAS,sBAAsB,KAAA,EAAyB;AACtD,EAAA,IAAI,KAAA,KAAU,MAAM,OAAO,MAAA;AAC3B,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,KAAA,KAAU,KAAA,EAAO,OAAO,KAAA;AAC9C,EAAA,IAAI,KAAA,KAAU,GAAG,OAAO,IAAA;AACxB,EAAA,IAAI,KAAA,KAAU,GAAG,OAAO,KAAA;AACxB,EAAA,IAAI,KAAA,KAAU,QAAQ,OAAO,IAAA;AAC7B,EAAA,IAAI,KAAA,KAAU,SAAS,OAAO,KAAA;AAC9B,EAAA,IAAI,KAAA,KAAU,KAAK,OAAO,IAAA;AAC1B,EAAA,IAAI,KAAA,KAAU,KAAK,OAAO,KAAA;AAC1B,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,mBAAA,CAAoBA,QAAiB,KAAA,EAAyB;AACrE,EAAA,IAAIA,MAAAA,CAAM,cAAc,SAAA,EAAW;AACjC,IAAA,OAAO,sBAAsB,KAAK,CAAA;AAAA,EACpC;AAEA,EAAA,OAAO,KAAA,KAAU,OAAO,MAAA,GAAY,KAAA;AACtC;;;AChEA,SAAS,mBAAA,CACP,QACA,SAAA,EACQ;AACR,EAAA,IAAI,SAAA,KAAc,MAAA,IAAa,SAAA,CAAU,MAAA,KAAW,CAAA,EAAG;AACrD,IAAA,OAAO,GAAG,MAAM,CAAA,kBAAA,CAAA;AAAA,EAClB;AACA,EAAA,MAAM,IAAA,GAAO,SAAA,CAAU,GAAA,CAAI,CAAC,CAAA,KAAM,IAAI,CAAC,CAAA,CAAA,CAAG,CAAA,CAAE,IAAA,CAAK,KAAK,CAAA;AACtD,EAAA,OAAO,CAAA,EAAG,MAAM,CAAA,KAAA,EAAQ,SAAA,CAAU,SAAS,CAAA,GAAI,GAAA,GAAM,EAAE,CAAA,CAAA,EAAI,IAAI,CAAA,CAAA;AACjE;AAaO,SAAS,yBAAA,CACd,YAAA,EACA,KAAA,EACA,IAAA,EACA,WACA,MAAA,EACmB;AACnB,EAAA,MAAM,QAAA,GACJ,SAAA,KAAc,MAAA,GAAY,MAAA,GACxB,WAAW,MAAA,GAAS,YAAA,CAAa,sBAAA,CAAuB,SAAA,EAAW,IAAI,CAAA,GACvE,YAAA,CAAa,0BAAA,CAA2B,WAAW,IAAI,CAAA;AAE3D,EAAA,MAAM,KAAA,GAAQ,mBAAA,CAAoB,MAAA,EAAQ,SAAS,CAAA;AACnD,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,MAAM,IAAI,KAAA,CAAM,CAAA,UAAA,EAAa,IAAI,CAAA,qBAAA,EAAwB,KAAK,CAAA,CAAA,CAAG,CAAA;AAAA,EACnE;AAEA,EAAA,MAAM,GAAA,GAAM,QAAA,CAAS,KAAA,EAAO,CAAC,OAAO,CAAA,EAAG;AAAA,IACrC,WAAA,EAAa,WAAA,CAAY,CAAC,IAAI,CAAC,CAAA;AAAA,IAC/B,WAAW,QAAA,CAAS,SAAA;AAAA,IACpB,aAAa,QAAA,CAAS;AAAA,GACvB,CAAA;AACD,EAAA,MAAM,IAAA,GAAO,4BAAA,CAA6B,GAAA,EAAK,QAAQ,CAAA;AAEvD,EAAA,MAAM,MAAA,GAAS,CAAC,QAAA,KAA4D;AAC1E,IAAA,IAAI,QAAA,CAAS,cAAc,QAAA,EAAU;AACnC,MAAA,MAAM,IAAI,SAAA;AAAA,QACR,CAAA,UAAA,EAAa,IAAI,CAAA,KAAA,EAAQ,KAAK,OAAO,QAAA,CAAS,SAAS,SAAS,QAAQ,CAAA,CAAA;AAAA,OAC1E;AAAA,IACF;AACA,IAAA,OAAO,IAAA;AAAA,EACT,CAAA;AAEA,EAAA,OAAO;AAAA,IACL,GAAG,IAAA;AAAA,IACH,MAAA,EAAQ,MAAM,MAAA,CAAO,QAAQ,CAAA;AAAA,IAC7B,MAAA,EAAQ,MAAM,MAAA,CAAO,QAAQ,CAAA;AAAA,IAC7B,IAAA,EAAM,MAAM,MAAA,CAAO,MAAM,CAAA;AAAA,IACzB,KAAA,EAAO,MAAM,MAAA,CAAO,OAAO,CAAA;AAAA,IAC3B,MAAA,EAAQ,MAAM,MAAA,CAAO,QAAQ,CAAA;AAAA,IAC7B,SAAA,EAAW,MAAM,MAAA,CAAO,WAAW;AAAA,GACrC;AACF;;;ACzHA,IAAI,iBAAA;AAMG,SAAS,qBAAqB,GAAA,EAAoC;AACvE,EAAA,iBAAA,GAAoB,GAAA;AACtB;AAmBA,IAAM,6BAAA,GAAqD;AAAA,EACzD,OAAA,EAAS,KAAA;AAAA,EACT,QAAA,EAAU,CAAA;AAAA,EACV,QAAA,EAAU,EAAA;AAAA,EACV,WAAA,EAAa,SAAA;AAAA,EACb,WAAA,EAAa,KAAA;AAAA,EACb,YAAA,EAAc;AAChB,CAAA;AAEA,SAAS,gBAAgB4B,IAAAA,EAAmB;AAC1C,EAAA,IAAI,CAAC,OAAO,QAAA,CAASA,IAAG,KAAK,CAAC,MAAA,CAAO,SAAA,CAAUA,IAAG,CAAA,EAAG;AACnD,IAAA,MAAM,IAAI,UAAU,kCAAkC,CAAA;AAAA,EACxD;AACA,EAAA,IAAIA,OAAM,CAAA,EAAG;AACX,IAAA,MAAM,IAAI,MAAM,sBAAsB,CAAA;AAAA,EACxC;AACA,EAAA,IAAIA,OAAM,4BAAA,EAA8B;AACtC,IAAA,MAAM,IAAI,KAAA;AAAA,MACR,sBAAsB,4BAA4B,CAAA,2DAAA;AAAA,KAEpD;AAAA,EACF;AACF;AAEA,SAAS,gBAAgBC,IAAAA,EAAmB;AAC1C,EAAA,IAAI,CAAC,OAAO,QAAA,CAASA,IAAG,KAAK,CAAC,MAAA,CAAO,SAAA,CAAUA,IAAG,CAAA,EAAG;AACnD,IAAA,MAAM,IAAI,UAAU,kCAAkC,CAAA;AAAA,EACxD;AACA,EAAA,IAAIA,OAAM,CAAA,EAAG;AACX,IAAA,MAAM,IAAI,MAAM,sBAAsB,CAAA;AAAA,EACxC;AACF;AAEA,SAAS,mBACP,MAAA,EACoB;AACpB,EAAA,IAAI,MAAA,KAAW,MAAA,IAAa,MAAA,KAAW,KAAA,EAAO;AAC5C,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,WAAW,IAAA,EAAM;AACnB,IAAA;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;AAQO,IAAM,gBAAA,GAAN,MAAM,iBAAA,CAaX;AAAA,EACS,OAAA;AAAA,EACA,MAAA;AAAA,EACA,UAAA;AAAA,EACA,iBAAA;AAAA,EACA,UAAA;AAAA,EACA,UAAA;AAAA,EACA,UAAA;AAAA,EACA,SAAA;AAAA,EACA,eAAA;AAAA,EACA,sBAAA;AAAA,EAET,YACE,MAAA,EACA,KAAA,EACA,SAAA,EACA,SAAA,EACA,WACA,SAAA,EACA,gBAAA,GAAsC,EAAC,EACvC,WAAqB,KAAA,EACrB,cAAA,GAAsC,6BAAA,EACtC,qBAAA,GAAkD,EAAC,EACnD;AACA,IAAA,IAAA,CAAK,OAAA,GAAU,MAAA;AACf,IAAA,IAAA,CAAK,MAAA,GAAS,KAAA;AACd,IAAA,IAAA,CAAK,UAAA,GAAa,SAAA;AAClB,IAAA,IAAA,CAAK,iBAAA,GAAoB,gBAAA;AACzB,IAAA,IAAA,CAAK,UAAA,GAAa,SAAA;AAClB,IAAA,IAAA,CAAK,UAAA,GAAa,SAAA;AAClB,IAAA,IAAA,CAAK,UAAA,GAAa,SAAA;AAClB,IAAA,IAAA,CAAK,SAAA,GAAY,QAAA;AACjB,IAAA,IAAA,CAAK,eAAA,GAAkB,cAAA;AACvB,IAAA,IAAA,CAAK,sBAAA,GAAyB,qBAAA;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,UACE,OAAA,EAYA;AACA,IAAA,MAAM,QAAA,GAAW,OAAA,EAAS,OAAA,IAAW,IAAA,CAAK,eAAA,CAAgB,QAAA;AAC1D,IAAA,MAAM,QAAA,GAAW,OAAA,EAAS,OAAA,IAAW,IAAA,CAAK,eAAA,CAAgB,QAAA;AAC1D,IAAA,eAAA,CAAgB,QAAQ,CAAA;AACxB,IAAA,IAAI,OAAA,EAAS,YAAY,MAAA,EAAW;AAClC,MAAA,eAAA,CAAgB,QAAQ,CAAA;AAAA,IAC1B;AACA,IAAA,IAAI,QAAA,GAAW,CAAA,IAAK,QAAA,GAAW,QAAA,EAAU;AACvC,MAAA,MAAM,IAAI,MAAM,4BAA4B,CAAA;AAAA,IAC9C;AAEA,IAAA,MAAM,SAAA,GAAY,kBAAA,CAAmB,OAAA,EAAS,IAAI,CAAA;AAClD,IAAA,MAAM,UAAA,GAAa,kBAAA,CAAmB,OAAA,EAAS,KAAK,CAAA;AACpD,IAAA,IAAI,SAAA,KAAc,MAAA,EAAW,qBAAA,CAAsB,SAAS,CAAA;AAC5D,IAAA,IAAI,UAAA,KAAe,MAAA,EAAW,qBAAA,CAAsB,UAAU,CAAA;AAC9D,IAAA,MAAM,WAAA,GACJ,OAAA,EAAS,WAAA,IAAe,IAAA,CAAK,eAAA,CAAgB,WAAA;AAE/C,IAAA,OAAO,IAAI,iBAAA;AAAA,MACT,IAAA,CAAK,OAAA;AAAA,MACL,IAAA,CAAK,MAAA;AAAA,MACL,IAAA,CAAK,UAAA;AAAA,MACL,IAAA,CAAK,UAAA;AAAA,MACL,IAAA,CAAK,UAAA;AAAA,MACL,IAAA,CAAK,UAAA;AAAA,MACL,IAAA,CAAK,iBAAA;AAAA,MACL,IAAA,CAAK,SAAA;AAAA,MACL;AAAA,QACE,GAAG,IAAA,CAAK,eAAA;AAAA,QACR,OAAA,EAAS,IAAA;AAAA,QACT,QAAA;AAAA,QACA,QAAA;AAAA,QACA,WAAA;AAAA,QACA,GAAI,OAAA,EAAS,IAAA,KAAS,MAAA,IAAa;AAAA,UACjC,WAAA,EAAa,QAAQ,IAAA,KAAS,KAAA;AAAA,UAC9B,GAAI,SAAA,KAAc,MAAA,IAAa,EAAE,SAAA;AAAU,SAC7C;AAAA,QACA,GAAI,OAAA,EAAS,KAAA,KAAU,MAAA,IAAa;AAAA,UAClC,YAAA,EAAc,QAAQ,KAAA,KAAU,KAAA;AAAA,UAChC,GAAI,UAAA,KAAe,MAAA,IAAa,EAAE,UAAA;AAAW;AAC/C,OACF;AAAA,MACA,IAAA,CAAK;AAAA,KACP;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,SAAA,CACE,OACA,iBAAA,EAYA;AACA,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,mBAAA,CAAoB,KAAK,CAAA;AAC/C,IAAA,MAAMlB,UAAAA,GAAY,iBAAA;AAAA,MAChB;AAAA,KACF;AAEA,IAAA,MAAM,YAAA,GAA8B;AAAA,MAClC,WAAA,EAAa,KAAA;AAAA,MACb,UAAA,EAAY,MAAA;AAAA,MACZ,YAAYA,UAAAA,CAAU;AAAA,KACxB;AAEA,IAAA,OAAO,IAAI,iBAAA;AAAA,MACT,IAAA,CAAK,OAAA;AAAA,MACL,IAAA,CAAK,MAAA;AAAA,MACL,IAAA,CAAK,UAAA;AAAA,MACL,IAAA,CAAK,UAAA;AAAA,MACL,IAAA,CAAK,UAAA;AAAA,MACL,IAAA,CAAK,UAAA;AAAA,MACL,IAAA,CAAK,iBAAA;AAAA,MACL,IAAA,CAAK,SAAA;AAAA,MACL,IAAA,CAAK,eAAA;AAAA,MACL,CAAC,GAAG,IAAA,CAAK,sBAAA,EAAwB,YAAY;AAAA,KAC/C;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,oBAAoB,KAAA,EAA0C;AAC5D,IAAA,MAAM,YAAA,GAAe;AAAA,MACnB,GAAG,IAAA,CAAK,UAAA;AAAA,MACR,GAAG,KAAK,iBAAA,CAAkB,MAAA;AAAA,QACxB,CAAC,IAAA,KAAS,CAAC,IAAA,CAAK,UAAA,CAAW,SAAS,IAAI;AAAA;AAC1C,KACF;AAGA,IAAA,MAAM,UAAA,GAAa,WAAA;AAAA,MACjB,QAAA,CAAS,OAAO,CAAC,IAAI,GAAG,EAAE,SAAA,EAAW,UAAU;AAAA,KACjD;AACA,IAAA,MAAM,YAAA,GAAe,WAAA;AAAA,MACnB,QAAA,CAAS,OAAO,CAAC,MAAM,GAAG,EAAE,SAAA,EAAW,UAAU;AAAA,KACnD;AACA,IAAA,MAAM,cAAA,GAAiB,WAAA;AAAA,MACrB,QAAA,CAAS,OAAO,CAAC,SAAS,GAAG,EAAE,SAAA,EAAW,UAAU;AAAA,KACtD;AACA,IAAA,MAAM,YAAA,GAAe,WAAA;AAAA,MACnB,QAAA,CAAS,OAAO,CAAC,OAAO,GAAG,EAAE,SAAA,EAAW,UAAU;AAAA,KACpD;AAGA,IAAA,MAAM,kBAAA,GAAqB,CAAC,YAAA,KAA4C;AACtE,MAAA,MAAM,QAAA,GACJ,IAAA,CAAK,OAAA,CAAQ,kBAAA,CAAmB,0BAAA;AAAA,QAC9B,YAAA;AAAA,QACA;AAAA,OACF;AAEF,MAAA,MAAM,YAAY,QAAA,EAAU,SAAA;AAC5B,MAAA,MAAM,cAAc,QAAA,EAAU,WAAA;AAE9B,MAAA,MAAM,GAAA,GAAM,QAAA,CAAS,KAAA,EAAO,CAAC,OAAO,CAAA,EAAG;AAAA,QACrC,WAAA,EAAa,WAAA,CAAY,CAAC,YAAY,CAAC,CAAA;AAAA,QACvC,SAAA;AAAA,QACA;AAAA,OACD,CAAA;AAED,MAAA,QAAQ,SAAA;AAAW,QACjB,KAAK,QAAA,EAAU;AACb,UAAA,OAAO,YAAY,GAAG,CAAA;AAAA,QACxB;AAAA,QACA,KAAK,QAAA,EAAU;AACb,UAAA,OAAO,YAAY,GAAG,CAAA;AAAA,QACxB;AAAA,QACA,KAAK,SAAA,EAAW;AACd,UAAA,OAAO,UAAU,GAAG,CAAA;AAAA,QACtB;AAAA,QACA,KAAK,MAAA,EAAQ;AACX,UAAA,OAAO,UAAU,GAAG,CAAA;AAAA,QACtB;AAAA,QACA,KAAK,OAAA,EAAS;AACZ,UAAA,OAAO,WAAW,GAAG,CAAA;AAAA,QACvB;AAAA,QACA,KAAK,QAAA,EAAU;AACb,UAAA,OAAO,YAAY,GAAG,CAAA;AAAA,QACxB;AAAA,QACA,KAAK,WAAA;AAAA,QACL,KAAK,SAAA;AAAA,QACL,KAAK,MAAA,EAAW;AAEd,UAAA,OAAO,UAAU,GAAG,CAAA;AAAA,QACtB;AAAA;AACF,IACF,CAAA;AAEA,IAAA,IAAI,IAAA,CAAK,MAAA,CAAO,kBAAA,CAAmB,GAAA,CAAI,KAAK,CAAA,EAAG;AAC7C,MAAA,OAAO;AAAA,QACL,EAAA,EAAI,UAAA;AAAA,QACJ,IAAA,EAAM,YAAA;AAAA,QACN,MAAA,EAAQ,cAAA;AAAA,QACR,IAAA,EAAM,YAAA;AAAA,QACN,KAAA,EAAO,CAAC,IAAA,KACN,yBAAA;AAAA,UACE,KAAK,OAAA,CAAQ,kBAAA;AAAA,UACb,KAAA;AAAA,UACA,IAAA;AAAA,UACA,YAAA;AAAA,UACA;AAAA;AACF,OACJ;AAAA,IACF;AAGA,IAAA,OAAO,IAAI,KAAA,CAAM,EAAC,EAAgC;AAAA,MAChD,GAAA,EAAK,CAAC,CAAA,EAAG,QAAA,KAA8B;AAErC,QAAA,IAAI,OAAO,aAAa,QAAA,EAAU;AAClC,QAAA,IAAI,aAAa,MAAA,EAAQ;AACzB,QAAA,IAAI,aAAa,QAAA,EAAU;AAG3B,QAAA,IAAI,QAAA,KAAa,MAAM,OAAO,UAAA;AAC9B,QAAA,IAAI,QAAA,KAAa,QAAQ,OAAO,YAAA;AAChC,QAAA,IAAI,QAAA,KAAa,UAAU,OAAO,cAAA;AAClC,QAAA,IAAI,QAAA,KAAa,QAAQ,OAAO,YAAA;AAGhC,QAAA,OAAO,mBAAmB,QAAQ,CAAA;AAAA,MACpC;AAAA,KACD,CAAA;AAAA,EACH;AAAA,EAkCA,EAAA,CACE,IAAA,EACA,KAAA,EACA,OAAA,EAMA;AACA,IAAA,qBAAA,CAAsB,KAAK,CAAA;AAE3B,IAAA,MAAM,iBAAA,GAAoB,SAAS,iBAAA,IAAqB,KAAA;AACxD,IAAA,MAAM,KAAA,GACJ,oBAAoB,IAAA,CAAK,OAAA,CAAQ,SAAS,gBAAA,CAAiB,IAAI,CAAA,GAAI,CAAC,IAAI,CAAA;AAE1E,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,mBAAA,CAAoB,KAAA,EAAO,KAAK,CAAA;AAItD,IAAA,OAAO,IAAI,iBAAA,CAAkB,IAAA,CAAK,OAAA,EAAS,QAAQ,CAAA;AAAA,EAMrD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAA,CACE,IAAA,EACA,KAAA,EACA,OAAA,EAMA;AACA,IAAA,qBAAA,CAAsB,KAAK,CAAA;AAC3B,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,QAAA,CAAS,WAAA,CAAY,IAAI,CAAA,EAAG;AAC5C,MAAA,MAAM,IAAI,iBAAA,CAAkB,IAAA,EAAM,MAAA,EAAQ;AAAA,QACxC,OAAA,EAAS,KAAK,OAAA,CAAQ;AAAA,OACvB,CAAA;AAAA,IACH;AACA,IAAA,IAAA,CAAK,qBAAqB,IAAI,CAAA;AAE9B,IAAA,MAAM,iBAAA,GAAoB,SAAS,iBAAA,IAAqB,KAAA;AACxD,IAAA,MAAM,KAAA,GACJ,oBAAoB,IAAA,CAAK,OAAA,CAAQ,SAAS,gBAAA,CAAiB,IAAI,CAAA,GAAI,CAAC,IAAI,CAAA;AAE1E,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,mBAAA,CAAoB,KAAA,EAAO,KAAK,CAAA;AACvD,IAAA,MAAM,QAAA,GAA8B;AAAA,MAClC,GAAG,SAAA;AAAA,MACH,kBAAA,sBAAwB,GAAA,CAAI,CAAC,GAAG,SAAA,CAAU,kBAAA,EAAoB,KAAK,CAAC;AAAA,KACtE;AAEA,IAAA,OAAO,IAAI,iBAAA,CAAkB,IAAA,CAAK,OAAA,EAAS,QAAQ,CAAA;AAAA,EAMrD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,mBAAA,CACE,OACA,KAAA,EACmB;AACnB,IAAA,MAAM,aAAA,GAA2B;AAAA,MAC/B,WAAW,IAAA,CAAK,UAAA;AAAA,MAChB,WAAW,IAAA,CAAK,UAAA;AAAA,MAChB,WAAW,IAAA,CAAK,UAAA;AAAA,MAChB,SAAA,EAAW,KAAA;AAAA,MACX,SAAA,EAAW,KAAA;AAAA,MACX,eAAe,IAAA,CAAK,UAAA;AAAA,MACpB,aAAA,EAAe,IAAA,CAAK,UAAA,KAAe,KAAA,GAAQ,SAAA,GAAY,OAAA;AAAA,MACvD,UAAU,IAAA,CAAK;AAAA,KACjB;AAEA,IAAA,MAAM,aAAA,GACJ,IAAA,CAAK,iBAAA,CAAkB,MAAA,GAAS,CAAA,GAC9B,EAAE,GAAG,aAAA,EAAe,gBAAA,EAAkB,IAAA,CAAK,iBAAA,EAAkB,GAC7D,aAAA;AAEJ,IAAA,MAAM,SAAA,GACJ,IAAA,CAAK,eAAA,CAAgB,OAAA,GACnB;AAAA,MACE,GAAG,aAAA;AAAA,MACH,cAAA,EAAgB;AAAA,QACd,QAAA,EAAU,KAAK,eAAA,CAAgB,QAAA;AAAA,QAC/B,QAAA,EAAU,KAAK,eAAA,CAAgB,QAAA;AAAA,QAC/B,WAAA,EAAa,KAAK,eAAA,CAAgB,WAAA;AAAA,QAClC,GAAI,IAAA,CAAK,eAAA,CAAgB,WAAA,IAAe;AAAA,UACtC,SAAA,EAAW,IAAA,CAAK,eAAA,CAAgB,SAAA,IAAa,GAAG,KAAK,CAAA,KAAA;AAAA,SACvD;AAAA,QACA,GAAI,IAAA,CAAK,eAAA,CAAgB,YAAA,IAAgB;AAAA,UACvC,UAAA,EAAY,IAAA,CAAK,eAAA,CAAgB,UAAA,IAAc,GAAG,KAAK,CAAA,MAAA;AAAA;AACzD;AACF,KACF,GACA,aAAA;AAEJ,IAAA,OAAO;AAAA,MACL,GAAG,IAAA,CAAK,MAAA;AAAA,MACR,YAAY,CAAC,GAAG,IAAA,CAAK,MAAA,CAAO,YAAY,SAAS,CAAA;AAAA,MACjD,UAAA,EAAY,CAAC,GAAG,IAAA,CAAK,OAAO,UAAA,EAAY,GAAG,KAAK,sBAAsB,CAAA;AAAA,MACtE,YAAA,EAAc;AAAA,KAChB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,qBAAqB,UAAA,EAA0B;AAC7C,IAAA,MAAM,aAAA,uBAAoB,GAAA,EAAY;AACtC,IAAA,MAAM,eAAA,GAAkB,CAAC,QAAA,EAAkB,IAAA,KAA8B;AACvE,MAAA,MAAM,QAAA,GAAW,IAAA,CAAK,OAAA,CAAQ,QAAA,CAAS,YAAY,QAAQ,CAAA;AAC3D,MAAA,MAAM,SAAA,GAAY,WAAW,IAAI,CAAA;AACjC,MAAA,IAAI,CAAC,SAAA,EAAW;AAChB,MAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,QAAA,aAAA,CAAc,GAAA,CAAI,SAAS,IAAI,CAAA;AAAA,MACjC;AAAA,IACF,CAAA;AACA,IAAA,MAAM,WAAA,GAAc,IAAA,CAAK,UAAA,KAAe,KAAA,GAAQ,IAAA,GAAO,MAAA;AACvD,IAAA,MAAM,WAAA,GAAc,IAAA,CAAK,UAAA,KAAe,KAAA,GAAQ,MAAA,GAAS,IAAA;AACzD,IAAA,KAAA,MAAW,QAAA,IAAY,KAAK,UAAA,EAAY;AACtC,MAAA,eAAA,CAAgB,UAAU,WAAW,CAAA;AAAA,IACvC;AACA,IAAA,KAAA,MAAW,QAAA,IAAY,KAAK,iBAAA,EAAmB;AAC7C,MAAA,eAAA,CAAgB,UAAU,WAAW,CAAA;AAAA,IACvC;AAIA,IAAA,IAAI,aAAA,CAAc,SAAS,CAAA,EAAG;AAE9B,IAAA,KAAA,MAAW,YAAY,aAAA,EAAe;AACpC,MAAA,IAAI,KAAK,OAAA,CAAQ,QAAA,CAAS,cAAA,CAAe,UAAA,EAAY,QAAQ,CAAA,EAAG;AAAA,IAClE;AAEA,IAAA,MAAM,IAAI,aAAA,CAAc;AAAA,MACtB,QAAA,EAAU,IAAA,CAAK,UAAA,CAAW,CAAC,CAAA,IAAK,WAAA;AAAA,MAChC,QAAA,EAAU,WAAA;AAAA,MACV,UAAA,EAAY,UAAA;AAAA,MACZ,aAAA,EAAe,CAAC,GAAG,aAAa;AAAA,KACjC,CAAA;AAAA,EACH;AACF,CAAA;;;AC/hBA,SAAS,gBAAgB,KAAA,EAAiC;AACxD,EAAA,OAAO;AAAA,IACL;AAAA,MACE,UAAA,EAAY,GAAG,KAAK,CAAA,GAAA,CAAA;AAAA,MACpB,MAAA,EAAQ,QAAA,CAAS,KAAA,EAAO,CAAC,IAAI,CAAC;AAAA,KAChC;AAAA,IACA;AAAA,MACE,UAAA,EAAY,GAAG,KAAK,CAAA,KAAA,CAAA;AAAA,MACpB,MAAA,EAAQ,QAAA,CAAS,KAAA,EAAO,CAAC,MAAM,CAAC;AAAA,KAClC;AAAA,IACA;AAAA,MACE,UAAA,EAAY,GAAG,KAAK,CAAA,MAAA,CAAA;AAAA,MACpB,MAAA,EAAQ,QAAA,CAAS,KAAA,EAAO,CAAC,OAAO,CAAC;AAAA,KACnC;AAAA,IACA;AAAA,MACE,UAAA,EAAY,GAAG,KAAK,CAAA,QAAA,CAAA;AAAA,MACpB,MAAA,EAAQ,QAAA,CAAS,KAAA,EAAO,CAAC,SAAS,CAAC;AAAA,KACrC;AAAA,IACA;AAAA,MACE,UAAA,EAAY,GAAG,KAAK,CAAA,WAAA,CAAA;AAAA,MACpB,MAAA,EAAQ,QAAA,CAAS,KAAA,EAAO,CAAC,YAAY,CAAC;AAAA,KACxC;AAAA,IACA;AAAA,MACE,UAAA,EAAY,GAAG,KAAK,CAAA,SAAA,CAAA;AAAA,MACpB,MAAA,EAAQ,QAAA,CAAS,KAAA,EAAO,CAAC,UAAU,CAAC;AAAA,KACtC;AAAA,IACA;AAAA,MACE,UAAA,EAAY,GAAG,KAAK,CAAA,WAAA,CAAA;AAAA,MACpB,MAAA,EAAQ,QAAA,CAAS,KAAA,EAAO,CAAC,YAAY,CAAC;AAAA,KACxC;AAAA,IACA;AAAA,MACE,UAAA,EAAY,GAAG,KAAK,CAAA,WAAA,CAAA;AAAA,MACpB,MAAA,EAAQ,QAAA,CAAS,KAAA,EAAO,CAAC,YAAY,CAAC;AAAA,KACxC;AAAA,IACA;AAAA,MACE,UAAA,EAAY,GAAG,KAAK,CAAA,WAAA,CAAA;AAAA,MACpB,MAAA,EAAQ,QAAA,CAAS,KAAA,EAAO,CAAC,YAAY,CAAC;AAAA;AACxC,GACF;AACF;AAQA,SAAS,eAAA,CACP,WACA,YAAA,EACkB;AAClB,EAAA,MAAM,QAAA,GAAW,OAAO,YAAY,CAAA,CAAA;AACpC,EAAA,OAAO;AAAA,IACL;AAAA,MACE,UAAA,EAAY,GAAG,SAAS,CAAA,GAAA,CAAA;AAAA,MACxB,MAAA,EAAQ,QAAA,CAAS,SAAA,EAAW,CAAC,IAAI,CAAC,CAAA;AAAA,MAClC;AAAA,KACF;AAAA,IACA;AAAA,MACE,UAAA,EAAY,GAAG,SAAS,CAAA,KAAA,CAAA;AAAA,MACxB,MAAA,EAAQ,QAAA,CAAS,SAAA,EAAW,CAAC,MAAM,CAAC,CAAA;AAAA,MACpC;AAAA,KACF;AAAA,IACA;AAAA,MACE,UAAA,EAAY,GAAG,SAAS,CAAA,QAAA,CAAA;AAAA,MACxB,MAAA,EAAQ,QAAA,CAAS,SAAA,EAAW,CAAC,SAAS,CAAC,CAAA;AAAA,MACvC;AAAA,KACF;AAAA,IACA;AAAA,MACE,UAAA,EAAY,GAAG,SAAS,CAAA,MAAA,CAAA;AAAA,MACxB,MAAA,EAAQ,QAAA,CAAS,SAAA,EAAW,CAAC,OAAO,CAAC,CAAA;AAAA,MACrC;AAAA,KACF;AAAA,IACA;AAAA,MACE,UAAA,EAAY,GAAG,SAAS,CAAA,MAAA,CAAA;AAAA,MACxB,MAAA,EAAQ,QAAA,CAAS,SAAA,EAAW,CAAC,OAAO,CAAC,CAAA;AAAA,MACrC;AAAA,KACF;AAAA,IACA;AAAA,MACE,UAAA,EAAY,GAAG,SAAS,CAAA,WAAA,CAAA;AAAA,MACxB,MAAA,EAAQ,QAAA,CAAS,SAAA,EAAW,CAAC,YAAY,CAAC,CAAA;AAAA,MAC1C;AAAA,KACF;AAAA,IACA;AAAA,MACE,UAAA,EAAY,GAAG,SAAS,CAAA,SAAA,CAAA;AAAA,MACxB,MAAA,EAAQ,QAAA,CAAS,SAAA,EAAW,CAAC,UAAU,CAAC,CAAA;AAAA,MACxC;AAAA,KACF;AAAA,IACA;AAAA,MACE,UAAA,EAAY,GAAG,SAAS,CAAA,WAAA,CAAA;AAAA,MACxB,MAAA,EAAQ,QAAA,CAAS,SAAA,EAAW,CAAC,YAAY,CAAC,CAAA;AAAA,MAC1C;AAAA,KACF;AAAA,IACA;AAAA,MACE,UAAA,EAAY,GAAG,SAAS,CAAA,WAAA,CAAA;AAAA,MACxB,MAAA,EAAQ,QAAA,CAAS,SAAA,EAAW,CAAC,YAAY,CAAC,CAAA;AAAA,MAC1C;AAAA,KACF;AAAA,IACA;AAAA,MACE,UAAA,EAAY,GAAG,SAAS,CAAA,WAAA,CAAA;AAAA,MACxB,MAAA,EAAQ,QAAA,CAAS,SAAA,EAAW,CAAC,YAAY,CAAC,CAAA;AAAA,MAC1C;AAAA;AACF,GACF;AACF;AAUO,IAAM,YAAA,GAAN,MAAM,aAAA,CAQX;AAAA,EACS,OAAA;AAAA,EACA,MAAA;AAAA,EAET,WAAA,CAAY,QAA4B,KAAA,EAA0B;AAChE,IAAA,IAAA,CAAK,OAAA,GAAU,MAAA;AACf,IAAA,IAAA,CAAK,MAAA,GAAS,KAAA;AAAA,EAChB;AAAA,EA8BA,IAAA,CACE,IAAA,EACA,KAAA,EACA,OAAA,EAMA;AAEA,IAAA,qBAAA,CAAsB,KAAK,CAAA;AAE3B,IAAA,MAAM,iBAAA,GAAoB,SAAS,iBAAA,IAAqB,KAAA;AAGxD,IAAA,MAAM,KAAA,GACJ,oBAAoB,IAAA,CAAK,OAAA,CAAQ,SAAS,gBAAA,CAAiB,IAAI,CAAA,GAAI,CAAC,IAAI,CAAA;AAE1E,IAAA,MAAM,QAAA,GAA8B;AAAA,MAClC,GAAG,IAAA,CAAK,MAAA;AAAA,MACR,UAAA,EAAY,KAAA;AAAA,MACZ,YAAA,EAAc,KAAA;AAAA,MACd,UAAA,EAAY,KAAA;AAAA,MACZ;AAAA,KACF;AAEA,IAAA,OAAO,IAAI,aAAA,CAAa,IAAA,CAAK,OAAA,EAAS,QAAQ,CAAA;AAAA,EAChD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAA,CACE,IAAA,EACA,KAAA,EACA,OAAA,EAMA;AACA,IAAA,qBAAA,CAAsB,KAAK,CAAA;AAC3B,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,QAAA,CAAS,WAAA,CAAY,IAAI,CAAA,EAAG;AAC5C,MAAA,MAAM,IAAI,iBAAA,CAAkB,IAAA,EAAM,MAAA,EAAQ;AAAA,QACxC,OAAA,EAAS,KAAK,OAAA,CAAQ;AAAA,OACvB,CAAA;AAAA,IACH;AAEA,IAAA,MAAM,iBAAA,GAAoB,SAAS,iBAAA,IAAqB,KAAA;AACxD,IAAA,MAAM,KAAA,GACJ,oBAAoB,IAAA,CAAK,OAAA,CAAQ,SAAS,gBAAA,CAAiB,IAAI,CAAA,GAAI,CAAC,IAAI,CAAA;AAE1E,IAAA,MAAM,QAAA,GAA8B;AAAA,MAClC,GAAG,IAAA,CAAK,MAAA;AAAA,MACR,UAAA,EAAY,KAAA;AAAA,MACZ,YAAA,EAAc,KAAA;AAAA,MACd,UAAA,EAAY,KAAA;AAAA,MACZ,iBAAA;AAAA,MACA,kBAAA,sBAAwB,GAAA,CAAI,CAAC,GAAG,IAAA,CAAK,MAAA,CAAO,kBAAA,EAAoB,KAAK,CAAC;AAAA,KACxE;AAEA,IAAA,OAAO,IAAI,aAAA,CAAa,IAAA,CAAK,OAAA,EAAS,QAAQ,CAAA;AAAA,EAChD;AAAA;AAAA;AAAA;AAAA,EAKA,SAAA,CACE,OACA,iBAAA,EACyD;AACzD,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,mBAAA,CAAoB,KAAK,CAAA;AAC/C,IAAA,MAAMA,UAAAA,GAAY,iBAAA;AAAA,MAChB;AAAA,KACF;AAEA,IAAA,MAAM,QAAA,GAA8B;AAAA,MAClC,GAAG,IAAA,CAAK,MAAA;AAAA,MACR,UAAA,EAAY;AAAA,QACV,GAAG,KAAK,MAAA,CAAO,UAAA;AAAA,QACf;AAAA,UACE,WAAA,EAAa,KAAA;AAAA,UACb,YAAYA,UAAAA,CAAU;AAAA;AACxB;AACF,KACF;AAEA,IAAA,OAAO,IAAI,aAAA,CAAa,IAAA,CAAK,OAAA,EAAS,QAAQ,CAAA;AAAA,EAChD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,SAAA,CACE,OACA,iBAAA,EAGyD;AACzD,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,mBAAA,CAAoB,KAAK,CAAA;AAC/C,IAAA,MAAMA,UAAAA,GAAY,iBAAA;AAAA,MAChB;AAAA,KACF;AAEA,IAAA,MAAM,QAAA,GAA8B;AAAA,MAClC,GAAG,IAAA,CAAK,MAAA;AAAA,MACR,UAAA,EAAY;AAAA,QACV,GAAG,KAAK,MAAA,CAAO,UAAA;AAAA,QACf;AAAA,UACE,WAAA,EAAa,KAAA;AAAA,UACb,UAAA,EAAY,MAAA;AAAA,UACZ,YAAYA,UAAAA,CAAU;AAAA;AACxB;AACF,KACF;AAEA,IAAA,OAAO,IAAI,aAAA,CAAa,IAAA,CAAK,OAAA,EAAS,QAAQ,CAAA;AAAA,EAChD;AAAA,EA+DA,QAAA,CACE,QAAA,EACA,SAAA,EACA,OAAA,EAgBA;AAEA,IAAA,qBAAA,CAAsB,SAAS,CAAA;AAE/B,IAAA,MAAM,SAAA,GAAY,SAAS,SAAA,IAAa,KAAA;AACxC,IAAA,MAAM,SAAA,GAAY,OAAA,EAAS,MAAA,IAAU,IAAA,CAAK,OAAA,CAAQ,yBAAA;AAClD,IAAA,MAAM,oBAAA,GACJ,SAAA,KAAc,UAAA,IAAc,SAAA,KAAc,KAAA;AAC5C,IAAA,MAAM,mBAAA,GAAsB,SAAA,KAAc,SAAA,IAAa,SAAA,KAAc,KAAA;AAErE,IAAA,MAAM,SAAA,GAAY,OAAA,EAAS,IAAA,IAAQ,IAAA,CAAK,MAAA,CAAO,YAAA;AAG/C,IAAA,MAAM,YAAY,IAAA,CAAK,yBAAA;AAAA,MACrB,QAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,MAAM,mBACJ,mBAAA,GACE,IAAA,CAAK,iCAAiC,SAAA,EAAW,oBAAoB,IACrE,EAAC;AAEL,IAAA,OAAO,IAAI,gBAAA;AAAA,MACT,IAAA,CAAK,OAAA;AAAA,MACL,IAAA,CAAK,MAAA;AAAA,MACL,SAAA;AAAA,MACA,SAAA;AAAA,MACA,SAAA;AAAA,MACA,SAAA;AAAA,MACA,gBAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,eAAA,CACE,QAAA,EACA,SAAA,EACA,OAAA,EAgBA;AACA,IAAA,OAAO,IAAA,CAAK,sBAAA,CAAuB,QAAA,EAAU,SAAA,EAAW,OAAO,OAAO,CAAA;AAAA,EACxE;AAAA,EAuDA,gBAAA,CACE,QAAA,EACA,SAAA,EACA,OAAA,EAgBA;AAEA,IAAA,qBAAA,CAAsB,SAAS,CAAA;AAE/B,IAAA,MAAM,SAAA,GAAY,SAAS,SAAA,IAAa,KAAA;AACxC,IAAA,MAAM,SAAA,GAAY,OAAA,EAAS,MAAA,IAAU,IAAA,CAAK,OAAA,CAAQ,yBAAA;AAClD,IAAA,MAAM,oBAAA,GACJ,SAAA,KAAc,UAAA,IAAc,SAAA,KAAc,KAAA;AAC5C,IAAA,MAAM,mBAAA,GAAsB,SAAA,KAAc,SAAA,IAAa,SAAA,KAAc,KAAA;AAErE,IAAA,MAAM,SAAA,GAAY,OAAA,EAAS,IAAA,IAAQ,IAAA,CAAK,MAAA,CAAO,YAAA;AAG/C,IAAA,MAAM,YAAY,IAAA,CAAK,yBAAA;AAAA,MACrB,QAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,MAAM,mBACJ,mBAAA,GACE,IAAA,CAAK,iCAAiC,SAAA,EAAW,oBAAoB,IACrE,EAAC;AAEL,IAAA,OAAO,IAAI,gBAAA;AAAA,MACT,IAAA,CAAK,OAAA;AAAA,MACL,IAAA,CAAK,MAAA;AAAA,MACL,SAAA;AAAA,MACA,SAAA;AAAA,MACA,SAAA;AAAA,MACA,SAAA;AAAA,MACA,gBAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,uBAAA,CACE,QAAA,EACA,SAAA,EACA,OAAA,EAgBA;AACA,IAAA,OAAO,IAAA,CAAK,sBAAA,CAAuB,QAAA,EAAU,SAAA,EAAW,MAAM,OAAO,CAAA;AAAA,EACvE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,sBAAA,CACE,QAAA,EACA,SAAA,EACA,QAAA,EACA,OAAA,EAkBA;AACA,IAAA,qBAAA,CAAsB,SAAS,CAAA;AAC/B,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,QAAA,CAAS,WAAA,CAAY,QAAQ,CAAA,EAAG;AAChD,MAAA,MAAM,IAAI,iBAAA,CAAkB,QAAA,EAAU,MAAA,EAAQ;AAAA,QAC5C,OAAA,EAAS,KAAK,OAAA,CAAQ;AAAA,OACvB,CAAA;AAAA,IACH;AAEA,IAAA,MAAM,SAAA,GAAY,SAAS,SAAA,IAAa,KAAA;AACxC,IAAA,MAAM,SAAA,GAAY,OAAA,EAAS,MAAA,IAAU,IAAA,CAAK,OAAA,CAAQ,yBAAA;AAClD,IAAA,MAAM,oBAAA,GACJ,SAAA,KAAc,UAAA,IAAc,SAAA,KAAc,KAAA;AAC5C,IAAA,MAAM,mBAAA,GAAsB,SAAA,KAAc,SAAA,IAAa,SAAA,KAAc,KAAA;AACrE,IAAA,MAAM,SAAA,GAAY,OAAA,EAAS,IAAA,IAAQ,IAAA,CAAK,MAAA,CAAO,YAAA;AAE/C,IAAA,MAAM,YAAY,IAAA,CAAK,yBAAA;AAAA,MACrB,QAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,MAAM,mBACJ,mBAAA,GACE,IAAA,CAAK,iCAAiC,SAAA,EAAW,oBAAoB,IACrE,EAAC;AAEL,IAAA,MAAM,QAAA,GAA8B;AAAA,MAClC,GAAG,IAAA,CAAK,MAAA;AAAA,MACR,kBAAA,sBAAwB,GAAA,CAAI;AAAA,QAC1B,GAAG,KAAK,MAAA,CAAO,kBAAA;AAAA,QACf;AAAA,OACD;AAAA,KACH;AAEA,IAAA,OAAO,IAAI,gBAAA;AAAA,MACT,IAAA,CAAK,OAAA;AAAA,MACL,QAAA;AAAA,MACA,SAAA;AAAA,MACA,SAAA;AAAA,MACA,SAAA;AAAA,MACA,SAAA;AAAA,MACA,gBAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OACE,cAAA,EAG+D;AAK/D,IAAA,MAAM,WAAA,GAAc,eAAA,CAAgB,IAAA,CAAK,MAAA,CAAO,UAAU,CAAA;AAI1D,IAAA,MAAM,kBAAkB,IAAA,CAAK,MAAA,CAAO,UAAA,CAAW,OAAA,CAAQ,CAAC,SAAA,KAAc;AAAA,MACpE,GAAG,eAAA,CAAgB,SAAA,CAAU,SAAA,EAAW,UAAU,SAAS,CAAA;AAAA,MAC3D,GAAG,eAAA,CAAgB,SAAA,CAAU,SAAS;AAAA,KACvC,CAAA;AAED,IAAA,MAAM,UAAA,GAAa,CAAC,GAAG,WAAA,EAAa,GAAG,eAAe,CAAA;AAEtD,IAAA,MAAM,QAAA,GAA8B;AAAA,MAClC,GAAG,IAAA,CAAK,MAAA;AAAA,MACR;AAAA,KACF;AAEA,IAAA,OAAO,IAAI,eAAA,CAAgB,IAAA,CAAK,OAAA,EAAS,UAAU,cAAc,CAAA;AAAA,EACnE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,UACE,MAAA,EACyC;AACzC,IAAA,MAAM,iBAAiB,MAAA,CAAO,WAAA;AAAA,MAC5B,MAAA,CAAO,QAAQ,MAAM,CAAA,CAAE,IAAI,CAAC,CAAC,UAAA,EAAY,MAAM,CAAA,KAAM;AACnD,QAAA,IAAI,MAAA,CAAO,WAAW,WAAA,EAAa;AACjC,UAAA,OAAO,CAAC,YAAY,MAAM,CAAA;AAAA,QAC5B;AAEA,QAAA,IACE,MAAA,CAAO,SAAA,KAAc,MAAA,IACrB,MAAA,CAAO,KAAK,MAAA,KAAW,CAAA,IACvB,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,KAAM,OAAA,IACnB,MAAA,CAAO,gBAAgB,MAAA,EACvB;AACA,UAAA,OAAO,CAAC,YAAY,MAAM,CAAA;AAAA,QAC5B;AAEA,QAAA,MAAM,QAAA,GAAW,gBAAA,CAAiB,MAAA,CAAO,WAAW,CAAA;AACpD,QAAA,IAAI,QAAA,CAAS,WAAW,CAAA,EAAG;AACzB,UAAA,OAAO,CAAC,YAAY,MAAM,CAAA;AAAA,QAC5B;AAEA,QAAA,MAAM,YAAA,GAAe,SAAS,CAAC,CAAA;AAC/B,QAAA,IAAI,iBAAiB,MAAA,EAAW;AAC9B,UAAA,OAAO,CAAC,YAAY,MAAM,CAAA;AAAA,QAC5B;AAEA,QAAA,MAAM,SAAA,GAAY,IAAA,CAAK,qBAAA,CAAsB,MAAA,CAAO,KAAK,CAAA;AACzD,QAAA,MAAM,QAAA,GACJ,SAAA,GACE,IAAA,CAAK,OAAA,CAAQ,kBAAA,CAAmB,sBAAA;AAAA,UAC9B,SAAA;AAAA,UACA;AAAA,SACF,GACA,MAAA;AAEJ,QAAA,IAAI,CAAC,QAAA,EAAU;AACb,UAAA,OAAO,CAAC,YAAY,MAAM,CAAA;AAAA,QAC5B;AAEA,QAAA,OAAO;AAAA,UACL,UAAA;AAAA,UACA;AAAA,YACE,GAAG,MAAA;AAAA,YACH,WAAW,QAAA,CAAS,SAAA;AAAA,YACpB,aAAa,QAAA,CAAS;AAAA;AACxB,SACF;AAAA,MACF,CAAC;AAAA,KACH;AAEA,IAAA,MAAM,UAAA,GAA+B,MAAA,CAAO,OAAA,CAAQ,cAAc,CAAA,CAAE,GAAA;AAAA,MAClE,CAAC,CAAC,UAAA,EAAY,MAAM,CAAA,MAAO;AAAA,QACzB,UAAA;AAAA,QACA;AAAA,OACF;AAAA,KACF;AAEA,IAAA,MAAM,QAAA,GAA8B;AAAA,MAClC,GAAG,IAAA,CAAK,MAAA;AAAA,MACR;AAAA,KACF;AAEA,IAAA,OAAO,IAAI,wBAAA,CAAyB,IAAA,CAAK,OAAA,EAAS,UAAU,cAAc,CAAA;AAAA,EAC5E;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,CACE,KAAA,EACAX,MAAAA,EACA,SAAA,GAA2B,KAAA,EAC8B;AACzD,IAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,yBAAA,CAA0B,KAAK,CAAA;AAC1D,IAAA,MAAM,SAAS,aAAA,KAAkB,MAAA;AACjC,IAAA,MAAM,QAAA,GACJA,WAAU,IAAA,IACVA,MAAAA,KAAU,UACT,MAAA,KAAWA,MAAAA,KAAU,aAAaA,MAAAA,KAAU,OAAA,CAAA;AAC/C,IAAA,MAAM,WACJ,QAAA,GAAW,MAAA,GACT,MAAA,GACA,IAAA,CAAK,QAAQ,kBAAA,CAAmB,0BAAA;AAAA,MAC9B,aAAA;AAAA,MACAA;AAAA,KACF,GACA,IAAA,CAAK,mBAAA,CAAoB,KAAA,EAAOA,MAAK,CAAA;AACzC,IAAA,MAAM,YACJ,QAAA,GACE;AAAA,MACE,KAAA,EAAO,SAAS,KAAA,EAAO,CAACA,MAAK,CAAA,EAAG,EAAE,SAAA,EAAW,QAAA,EAAU,CAAA;AAAA,MACvD;AAAA,KACF,GACA;AAAA,MACE,KAAA,EAAO,QAAA,CAAS,KAAA,EAAO,CAAC,OAAO,CAAA,EAAG;AAAA,QAChC,WAAA,EAAa,WAAA,CAAY,CAACA,MAAK,CAAC,CAAA;AAAA,QAChC,WAAW,QAAA,EAAU,SAAA;AAAA,QACrB,aAAa,QAAA,EAAU;AAAA,OACxB,CAAA;AAAA,MACD;AAAA,KACF;AAEJ,IAAA,MAAM,QAAA,GAA8B;AAAA,MAClC,GAAG,IAAA,CAAK,MAAA;AAAA,MACR,SAAS,CAAC,GAAG,IAAA,CAAK,MAAA,CAAO,SAAS,SAAS;AAAA,KAC7C;AAEA,IAAA,OAAO,IAAI,aAAA,CAAa,IAAA,CAAK,OAAA,EAAS,QAAQ,CAAA;AAAA,EAChD;AAAA,EAEA,mBAAA,CAAoB,OAAeA,MAAAA,EAA0C;AAC3E,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,qBAAA,CAAsB,KAAK,CAAA;AAClD,IAAA,OAAO,YACH,IAAA,CAAK,OAAA,CAAQ,mBAAmB,sBAAA,CAAuB,SAAA,EAAWA,MAAK,CAAA,GACvE,MAAA;AAAA,EACN;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,CAAA,EAAoE;AACxE,IAAA,OAAO,IAAI,aAAA,CAAa,IAAA,CAAK,OAAA,EAAS;AAAA,MACpC,GAAG,IAAA,CAAK,MAAA;AAAA,MACR,KAAA,EAAO;AAAA,KACR,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,CAAA,EAAoE;AACzE,IAAA,OAAO,IAAI,aAAA,CAAa,IAAA,CAAK,OAAA,EAAS;AAAA,MACpC,GAAG,IAAA,CAAK,MAAA;AAAA,MACR,MAAA,EAAQ;AAAA,KACT,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,QAAA,CACE,MACA,IAAA,EACyD;AACzD,IAAA,IAAI,IAAA,CAAK,OAAA,CAAQ,gBAAA,KAAqB,MAAA,EAAW;AAC/C,MAAA,MAAM8B,WAAAA,GAAa,KAAK,OAAA,CAAQ,gBAAA;AAChC,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,CAAA,yFAAA,EAC0B,kBAAA,CAAmBA,WAAU,CAAC,CAAA,kFAAA,CAAA;AAAA,QAExD;AAAA,UACE,IAAA,EAAM,yBAAA;AAAA,UACN,GAAG,kBAAkBA,WAAU,CAAA;AAAA,UAC/B,aAAA,EAAe;AAAA;AACjB,OACF;AAAA,IACF;AACA,IAAA,MAAM,UAAA,GAAa,qBAAA;AAAA,MACjB,IAAA;AAAA,MACA,IAAA;AAAA,MACA,CAAA,2FAAA;AAAA,KACF;AACA,IAAA,OAAO,IAAI,aAAA,CAAa,IAAA,CAAK,OAAA,EAAS;AAAA,MACpC,GAAG,IAAA,CAAK,MAAA;AAAA,MACR,YAAA,EAAc,WAAW,KAAA,CAAM,IAAA;AAAA,MAC/B,IAAA,EAAM,WAAW,KAAA,CAAM;AAAA,KACxB,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAA,CACE,OACA9B,MAAAA,EACyD;AACzD,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,qBAAA,CAAsB,KAAK,CAAA;AAClD,IAAA,MAAM,QAAA,GACJ,YACE,IAAA,CAAK,OAAA,CAAQ,mBAAmB,sBAAA,CAAuB,SAAA,EAAWA,MAAK,CAAA,GACvE,MAAA;AAEJ,IAAA,MAAM,aAAA,GAA0B;AAAA,MAC9B,MAAA,EAAQ,WAAA;AAAA,MACR,KAAA;AAAA,MACA,IAAA,EAAM,CAAC,OAAO,CAAA;AAAA,MACd,WAAA,EAAa,WAAA,CAAY,CAACA,MAAK,CAAC,CAAA;AAAA,MAChC,WAAW,QAAA,EAAU,SAAA;AAAA,MACrB,aAAa,QAAA,EAAU;AAAA,KACzB;AAEA,IAAA,MAAM,cAAA,GAAiB,IAAA,CAAK,MAAA,CAAO,OAAA,EAAS,UAAU,EAAC;AACvD,IAAA,MAAM,UAAA,GAA0B;AAAA,MAC9B,MAAA,EAAQ,CAAC,GAAG,cAAA,EAAgB,aAAa;AAAA,KAC3C;AAEA,IAAA,OAAO,IAAI,aAAA,CAAa,IAAA,CAAK,OAAA,EAAS;AAAA,MACpC,GAAG,IAAA,CAAK,MAAA;AAAA,MACR,OAAA,EAAS;AAAA,KACV,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,YACE,KAAA,EACyD;AACzD,IAAA,MAAM,aAAA,GAA0B;AAAA,MAC9B,MAAA,EAAQ,WAAA;AAAA,MACR,KAAA;AAAA,MACA,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,MACX,SAAA,EAAW;AAAA,KACb;AAEA,IAAA,MAAM,cAAA,GAAiB,IAAA,CAAK,MAAA,CAAO,OAAA,EAAS,UAAU,EAAC;AACvD,IAAA,MAAM,UAAA,GAA0B;AAAA,MAC9B,MAAA,EAAQ,CAAC,GAAG,cAAA,EAAgB,aAAa;AAAA,KAC3C;AAEA,IAAA,OAAO,IAAI,aAAA,CAAa,IAAA,CAAK,OAAA,EAAS;AAAA,MACpC,GAAG,IAAA,CAAK,MAAA;AAAA,MACR,OAAA,EAAS;AAAA,KACV,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,OACEW,UAAAA,EACyD;AACzD,IAAA,OAAO,IAAI,aAAA,CAAa,IAAA,CAAK,OAAA,EAAS;AAAA,MACpC,GAAG,IAAA,CAAK,MAAA;AAAA,MACR,MAAA,EAAQA;AAAA,KACT,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAyBA,SACE,OAAA,EACyD;AACzD,IAAA,2BAAA,CAA4B,OAAO,CAAA;AACnC,IAAA,OAAO,IAAI,aAAA,CAAa,IAAA,CAAK,OAAA,EAAS;AAAA,MACpC,GAAG,IAAA,CAAK,MAAA;AAAA,MACR,MAAA,EAAQ;AAAA,KACT,CAAA;AAAA,EACH;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,EA2BA,KAKE,QAAA,EAG4D;AAC5D,IAAA,OAAO,SAAS,IAAI,CAAA;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAKA,sBAAsB,KAAA,EAA8C;AAClE,IAAA,IAAI,KAAA,KAAU,IAAA,CAAK,MAAA,CAAO,UAAA,EAAY;AACpC,MAAA,OAAO,KAAK,MAAA,CAAO,UAAA;AAAA,IACrB;AACA,IAAA,KAAA,MAAW,SAAA,IAAa,IAAA,CAAK,MAAA,CAAO,UAAA,EAAY;AAC9C,MAAA,IAAI,SAAA,CAAU,cAAc,KAAA,EAAO;AACjC,QAAA,OAAO,SAAA,CAAU,SAAA;AAAA,MACnB;AAAA,IACF;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,2BAAA,CACE,SAAA,EACA,QAAA,EACA,KAAA,EACmB;AACnB,IAAA,MAAM,QAAA,GACJ,SAAA,GACE,IAAA,CAAK,OAAA,CAAQ,kBAAA,CAAmB,sBAAA;AAAA,MAC9B,SAAA;AAAA,MACA;AAAA,KACF,GACA,MAAA;AAEJ,IAAA,MAAM,GAAA,GAAM,QAAA,CAAS,KAAA,EAAO,CAAC,OAAO,CAAA,EAAG;AAAA,MACrC,WAAA,EAAa,WAAA,CAAY,CAAC,QAAQ,CAAC,CAAA;AAAA,MACnC,WAAW,QAAA,EAAU,SAAA;AAAA,MACrB,aAAa,QAAA,EAAU;AAAA,KACxB,CAAA;AAED,IAAA,OAAO,IAAA,CAAK,6BAAA,CAA8B,GAAA,EAAK,QAAQ,CAAA;AAAA,EACzD;AAAA,EAEA,6BAAA,CACE,KACA,QAAA,EACmB;AACnB,IAAA,OAAO,4BAAA,CAA6B,KAAK,QAAQ,CAAA;AAAA,EACnD;AAAA,EAEA,oBAAoB,KAAA,EAAuC;AACzD,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,qBAAA,CAAsB,KAAK,CAAA;AAClD,IAAA,MAAM,UAAA,GAAa,WAAA;AAAA,MACjB,QAAA,CAAS,OAAO,CAAC,IAAI,GAAG,EAAE,SAAA,EAAW,UAAU;AAAA,KACjD;AACA,IAAA,MAAM,YAAA,GAAe,WAAA;AAAA,MACnB,QAAA,CAAS,OAAO,CAAC,MAAM,GAAG,EAAE,SAAA,EAAW,UAAU;AAAA,KACnD;AACA,IAAA,MAAM,gBAAA,GAAmB,sBAAA;AAAA,MAAuB,KAAA;AAAA,MAAO,MACrD,IAAA,CAAK,mBAAA,CAAoB,SAAS;AAAA,KACpC;AAEA,IAAA,IAAI,IAAA,CAAK,MAAA,CAAO,kBAAA,CAAmB,GAAA,CAAI,KAAK,CAAA,EAAG;AAC7C,MAAA,OAAO;AAAA,QACL,EAAA,EAAI,UAAA;AAAA,QACJ,IAAA,EAAM,YAAA;AAAA,QACN,SAAA,EAAW,gBAAA;AAAA,QACX,KAAA,EAAO,CAAC,IAAA,KACN,yBAAA;AAAA,UACE,KAAK,OAAA,CAAQ,kBAAA;AAAA,UACb,KAAA;AAAA,UACA,IAAA;AAAA,UACA,SAAA;AAAA,UACA;AAAA;AACF,OACJ;AAAA,IACF;AAGA,IAAA,OAAO,IAAI,KAAA,CAAM,EAAC,EAA6B;AAAA,MAC7C,GAAA,EAAK,CAAC,CAAA,EAAG,QAAA,KAA8B;AAErC,QAAA,IAAI,OAAO,aAAa,QAAA,EAAU;AAClC,QAAA,IAAI,aAAa,MAAA,EAAQ;AACzB,QAAA,IAAI,aAAa,QAAA,EAAU;AAG3B,QAAA,IAAI,QAAA,KAAa,MAAM,OAAO,UAAA;AAC9B,QAAA,IAAI,QAAA,KAAa,QAAQ,OAAO,YAAA;AAChC,QAAA,IAAI,QAAA,KAAa,aAAa,OAAO,gBAAA;AAGrC,QAAA,OAAO,IAAA,CAAK,2BAAA,CAA4B,SAAA,EAAW,QAAA,EAAU,KAAK,CAAA;AAAA,MACpE;AAAA,KACD,CAAA;AAAA,EACH;AAAA,EAEA,oBAAoB,SAAA,EAAmD;AACrE,IAAA,IAAI,CAAC,WAAW,OAAO,KAAA;AACvB,IAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,kBAAA,CAAmB,kBAAA,CAAmB,SAAS,CAAA;AAAA,EACrE;AAAA,EAEA,yBAAA,CACE,UACA,oBAAA,EACmB;AACnB,IAAA,OAAO,oBAAA,GACH,KAAK,OAAA,CAAQ,QAAA,CAAS,oBAAoB,QAAQ,CAAA,GAClD,CAAC,QAAQ,CAAA;AAAA,EACf;AAAA,EAEA,gCAAA,CACE,WACA,oBAAA,EACmB;AACnB,IAAA,MAAM,YAAA,uBAAmB,GAAA,EAAY;AAErC,IAAA,KAAA,MAAW,QAAQ,SAAA,EAAW;AAC5B,MAAA,MAAM,WAAA,GAAc,IAAA,CAAK,OAAA,CAAQ,QAAA,CAAS,eAAe,IAAI,CAAA;AAC7D,MAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,QAAA;AAAA,MACF;AAEA,MAAA,YAAA,CAAa,IAAI,WAAW,CAAA;AAE5B,MAAA,IAAI,CAAC,oBAAA,EAAsB;AACzB,QAAA;AAAA,MACF;AAEA,MAAA,KAAA,MAAW,YAAA,IAAgB,IAAA,CAAK,OAAA,CAAQ,QAAA,CAAS,mBAAA;AAAA,QAC/C;AAAA,OACF,EAAG;AACD,QAAA,YAAA,CAAa,IAAI,YAAY,CAAA;AAAA,MAC/B;AAAA,IACF;AAEA,IAAA,OAAO,CAAC,GAAG,YAAY,CAAA;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA,EAKA,0BAA0B,KAAA,EAA8C;AACtE,IAAA,KAAA,MAAW,SAAA,IAAa,IAAA,CAAK,MAAA,CAAO,UAAA,EAAY;AAC9C,MAAA,IAAI,SAAA,CAAU,cAAc,KAAA,EAAO;AACjC,QAAA,OAAO,eAAe,SAAS,CAAA;AAAA,MACjC;AAAA,IACF;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,+BAAA,CACE,aAAA,EACA,QAAA,EACA,KAAA,EACmB;AACnB,IAAA,MAAM,QAAA,GACJ,aAAA,GACE,IAAA,CAAK,OAAA,CAAQ,kBAAA,CAAmB,0BAAA;AAAA,MAC9B,aAAA;AAAA,MACA;AAAA,KACF,GACA,MAAA;AAEJ,IAAA,MAAM,GAAA,GAAM,QAAA,CAAS,KAAA,EAAO,CAAC,OAAO,CAAA,EAAG;AAAA,MACrC,WAAA,EAAa,WAAA,CAAY,CAAC,QAAQ,CAAC,CAAA;AAAA,MACnC,WAAW,QAAA,EAAU,SAAA;AAAA,MACrB,aAAa,QAAA,EAAU;AAAA,KACxB,CAAA;AAED,IAAA,OAAO,IAAA,CAAK,6BAAA,CAA8B,GAAA,EAAK,QAAQ,CAAA;AAAA,EACzD;AAAA,EAEA,oBAAoB,KAAA,EAAuC;AACzD,IAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,yBAAA,CAA0B,KAAK,CAAA;AAC1D,IAAA,MAAM,UAAA,GAAa,WAAA;AAAA,MACjB,QAAA,CAAS,OAAO,CAAC,IAAI,GAAG,EAAE,SAAA,EAAW,UAAU;AAAA,KACjD;AACA,IAAA,MAAM,YAAA,GAAe,WAAA;AAAA,MACnB,QAAA,CAAS,OAAO,CAAC,MAAM,GAAG,EAAE,SAAA,EAAW,UAAU;AAAA,KACnD;AACA,IAAA,MAAM,cAAA,GAAiB,WAAA;AAAA,MACrB,QAAA,CAAS,OAAO,CAAC,SAAS,GAAG,EAAE,SAAA,EAAW,UAAU;AAAA,KACtD;AACA,IAAA,MAAM,YAAA,GAAe,WAAA;AAAA,MACnB,QAAA,CAAS,OAAO,CAAC,OAAO,GAAG,EAAE,SAAA,EAAW,UAAU;AAAA,KACpD;AAEA,IAAA,IAAI,IAAA,CAAK,MAAA,CAAO,kBAAA,CAAmB,GAAA,CAAI,KAAK,CAAA,EAAG;AAC7C,MAAA,OAAO;AAAA,QACL,EAAA,EAAI,UAAA;AAAA,QACJ,IAAA,EAAM,YAAA;AAAA,QACN,MAAA,EAAQ,cAAA;AAAA,QACR,IAAA,EAAM,YAAA;AAAA,QACN,KAAA,EAAO,CAAC,IAAA,KACN,yBAAA;AAAA,UACE,KAAK,OAAA,CAAQ,kBAAA;AAAA,UACb,KAAA;AAAA,UACA,IAAA;AAAA,UACA,aAAA;AAAA,UACA;AAAA;AACF,OACJ;AAAA,IACF;AAGA,IAAA,OAAO,IAAI,KAAA,CAAM,EAAC,EAA6B;AAAA,MAC7C,GAAA,EAAK,CAAC,CAAA,EAAG,QAAA,KAA8B;AAErC,QAAA,IAAI,OAAO,aAAa,QAAA,EAAU;AAClC,QAAA,IAAI,aAAa,MAAA,EAAQ;AACzB,QAAA,IAAI,aAAa,QAAA,EAAU;AAG3B,QAAA,IAAI,QAAA,KAAa,MAAM,OAAO,UAAA;AAC9B,QAAA,IAAI,QAAA,KAAa,QAAQ,OAAO,YAAA;AAChC,QAAA,IAAI,QAAA,KAAa,UAAU,OAAO,cAAA;AAClC,QAAA,IAAI,QAAA,KAAa,QAAQ,OAAO,YAAA;AAGhC,QAAA,OAAO,IAAA,CAAK,+BAAA;AAAA,UACV,aAAA;AAAA,UACA,QAAA;AAAA,UACA;AAAA,SACF;AAAA,MACF;AAAA,KACD,CAAA;AAAA,EACH;AACF;;;AC7uCA,IAAMgB,aAAAA,0BAAsB,cAAc,CAAA;AAgCnC,IAAM,cAAA,GAAN,MAAM,eAAA,CAAsC;AAAA,EACxC,OAAA;AAAA,EACA,MAAA;AAAA,EACT,eAAA,GAA6CA,aAAAA;AAAA,EAE7C,WAAA,CAAY,QAA4B,KAAA,EAA4B;AAClE,IAAA,IAAA,CAAK,OAAA,GAAU,MAAA;AACf,IAAA,IAAA,CAAK,MAAA,GAAS,KAAA;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,KAAA,EAAwD;AAC5D,IAAA,OAAO,IAAI,eAAA,CAAe,IAAA,CAAK,OAAA,EAAS;AAAA,MACtC,IAAA,EAAM,KAAK,KAAA,EAAM;AAAA,MACjB,QAAA,EAAU,OAAA;AAAA,MACV,KAAA,EAAO,MAAM,KAAA,EAAM;AAAA;AAAA,MAEnB,GAAI,IAAA,CAAK,MAAA,CAAO,UAAA,KAAe,MAAA,IAAa;AAAA,QAC1C,UAAA,EAAY,KAAK,MAAA,CAAO;AAAA,OAC1B;AAAA,MACA,GAAI,IAAA,CAAK,MAAA,CAAO,UAAA,KAAe,MAAA,IAAa;AAAA,QAC1C,UAAA,EAAY,KAAK,MAAA,CAAO;AAAA,OAC1B;AAAA,MACA,GAAI,IAAA,CAAK,MAAA,CAAO,QAAA,KAAa,MAAA,IAAa;AAAA,QACxC,QAAA,EAAU,KAAK,MAAA,CAAO;AAAA;AACxB,KACD,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS,KAAA,EAAwD;AAC/D,IAAA,OAAO,IAAI,eAAA,CAAe,IAAA,CAAK,OAAA,EAAS;AAAA,MACtC,IAAA,EAAM,KAAK,KAAA,EAAM;AAAA,MACjB,QAAA,EAAU,UAAA;AAAA,MACV,KAAA,EAAO,MAAM,KAAA,EAAM;AAAA;AAAA,MAEnB,GAAI,IAAA,CAAK,MAAA,CAAO,UAAA,KAAe,MAAA,IAAa;AAAA,QAC1C,UAAA,EAAY,KAAK,MAAA,CAAO;AAAA,OAC1B;AAAA,MACA,GAAI,IAAA,CAAK,MAAA,CAAO,UAAA,KAAe,MAAA,IAAa;AAAA,QAC1C,UAAA,EAAY,KAAK,MAAA,CAAO;AAAA,OAC1B;AAAA,MACA,GAAI,IAAA,CAAK,MAAA,CAAO,QAAA,KAAa,MAAA,IAAa;AAAA,QACxC,QAAA,EAAU,KAAK,MAAA,CAAO;AAAA;AACxB,KACD,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU,KAAA,EAAwD;AAChE,IAAA,OAAO,IAAI,eAAA,CAAe,IAAA,CAAK,OAAA,EAAS;AAAA,MACtC,IAAA,EAAM,KAAK,KAAA,EAAM;AAAA,MACjB,QAAA,EAAU,WAAA;AAAA,MACV,KAAA,EAAO,MAAM,KAAA,EAAM;AAAA;AAAA,MAEnB,GAAI,IAAA,CAAK,MAAA,CAAO,UAAA,KAAe,MAAA,IAAa;AAAA,QAC1C,UAAA,EAAY,KAAK,MAAA,CAAO;AAAA,OAC1B;AAAA,MACA,GAAI,IAAA,CAAK,MAAA,CAAO,UAAA,KAAe,MAAA,IAAa;AAAA,QAC1C,UAAA,EAAY,KAAK,MAAA,CAAO;AAAA,OAC1B;AAAA,MACA,GAAI,IAAA,CAAK,MAAA,CAAO,QAAA,KAAa,MAAA,IAAa;AAAA,QACxC,QAAA,EAAU,KAAK,MAAA,CAAO;AAAA;AACxB,KACD,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,KAAA,EAAwD;AAC7D,IAAA,OAAO,IAAI,eAAA,CAAe,IAAA,CAAK,OAAA,EAAS;AAAA,MACtC,IAAA,EAAM,KAAK,KAAA,EAAM;AAAA,MACjB,QAAA,EAAU,QAAA;AAAA,MACV,KAAA,EAAO,MAAM,KAAA,EAAM;AAAA;AAAA,MAEnB,GAAI,IAAA,CAAK,MAAA,CAAO,UAAA,KAAe,MAAA,IAAa;AAAA,QAC1C,UAAA,EAAY,KAAK,MAAA,CAAO;AAAA,OAC1B;AAAA,MACA,GAAI,IAAA,CAAK,MAAA,CAAO,UAAA,KAAe,MAAA,IAAa;AAAA,QAC1C,UAAA,EAAY,KAAK,MAAA,CAAO;AAAA,OAC1B;AAAA,MACA,GAAI,IAAA,CAAK,MAAA,CAAO,QAAA,KAAa,MAAA,IAAa;AAAA,QACxC,QAAA,EAAU,KAAK,MAAA,CAAO;AAAA;AACxB,KACD,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,CAAA,EAAiC;AACrC,IAAA,OAAO,IAAI,eAAA,CAAe,IAAA,CAAK,OAAA,EAAS,EAAE,GAAG,IAAA,CAAK,MAAA,EAAQ,KAAA,EAAO,CAAA,EAAG,CAAA;AAAA,EACtE;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,CAAA,EAAiC;AACtC,IAAA,OAAO,IAAI,eAAA,CAAe,IAAA,CAAK,OAAA,EAAS,EAAE,GAAG,IAAA,CAAK,MAAA,EAAQ,MAAA,EAAQ,CAAA,EAAG,CAAA;AAAA,EACvE;AAAA;AAAA;AAAA;AAAA,EAKA,KAAA,GAAsB;AACpB,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,eAAA;AAAA,MACR,QAAA,EAAU,KAAK,MAAA,CAAO,QAAA;AAAA,MACtB,IAAA,EAAM,KAAK,MAAA,CAAO,IAAA;AAAA,MAClB,KAAA,EAAO,KAAK,MAAA,CAAO,KAAA;AAAA,MACnB,GAAI,KAAK,MAAA,CAAO,KAAA,KAAU,UAAa,EAAE,KAAA,EAAO,IAAA,CAAK,MAAA,CAAO,KAAA,EAAM;AAAA,MAClE,GAAI,KAAK,MAAA,CAAO,MAAA,KAAW,UAAa,EAAE,MAAA,EAAQ,IAAA,CAAK,MAAA,CAAO,MAAA;AAAO,KACvE;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,KAAA,GAA+D;AAC7D,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,OAAA,EAAS,UAAA,EAAY;AACrC,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OAEF;AAAA,IACF;AACA,IAAA,OAAO,KAAK,OAAA,CAAQ,OAAA,CAAQ,UAAA,CAAW,IAAA,CAAK,SAAS,CAAA;AAAA,EACvD;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,GAAe;AACb,IAAA,IAAI,IAAA,CAAK,oBAAoBA,aAAAA,EAAc;AACzC,MAAA,OAAO,IAAA,CAAK,eAAA;AAAA,IACd;AAEA,IAAA,MAAM,QAAA,GAAWT,oBAAAA;AAAA,MACf,KAAK,KAAA,EAAM;AAAA,MACX,KAAK,OAAA,CAAQ,OAAA;AAAA,MACb,KAAK,eAAA;AAAgB,KACvB;AACA,IAAA,IAAA,CAAK,eAAA,GAAkB,QAAA;AACvB,IAAA,OAAO,QAAA;AAAA,EACT;AAAA,EAEA,eAAA,GAAuC;AACrC,IAAA,OAAO,mBAAA,CAAoB,KAAK,OAAO,CAAA;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,OAAA,GAAiC;AACrC,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,OAAA,EAAS;AACzB,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OAEF;AAAA,IACF;AAEA,IAAA,IAAI,qCAAA,CAAsC,IAAA,CAAK,KAAA,EAAO,CAAA,EAAG;AACvD,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OACF;AAAA,IACF;AAEA,IAAA,MAAM,QAAA,GAAW,KAAK,OAAA,EAAQ;AAC9B,IAAA,MAAM,OACJ,MAAM,IAAA,CAAK,OAAA,CAAQ,OAAA,CAAQ,QAAiC,QAAQ,CAAA;AAGtE,IAAA,IAAI,IAAA,CAAK,MAAA,CAAO,QAAA,IAAY,IAAA,CAAK,OAAO,UAAA,EAAY;AAClD,MAAA,OAAO,UAAA;AAAA,QACL,IAAA;AAAA,QACA,KAAK,MAAA,CAAO,UAAA;AAAA,QACZ,IAAA,CAAK,MAAA,CAAO,UAAA,IAAc,EAAC;AAAA,QAC3B,KAAK,MAAA,CAAO;AAAA,OACd;AAAA,IACF;AAEA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,UACJ,OAAA,EACuB;AACvB,IAAA,IAAI,qCAAA,CAAsC,IAAA,CAAK,KAAA,EAAO,CAAA,EAAG;AACvD,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OACF;AAAA,IACF;AAEA,IAAA,MAAM,QAAA,GAAW,KAAK,OAAA,EAAQ;AAC9B,IAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,OAAA,CAAiC,QAAQ,CAAA;AAEpE,IAAA,IAAI,IAAA,CAAK,MAAA,CAAO,QAAA,IAAY,IAAA,CAAK,OAAO,UAAA,EAAY;AAClD,MAAA,OAAO,UAAA;AAAA,QACL,IAAA;AAAA,QACA,KAAK,MAAA,CAAO,UAAA;AAAA,QACZ,IAAA,CAAK,MAAA,CAAO,UAAA,IAAc,EAAC;AAAA,QAC3B,KAAK,MAAA,CAAO;AAAA,OACd;AAAA,IACF;AAEA,IAAA,OAAO,IAAA;AAAA,EACT;AACF;;;AC3PO,SAAS,KAAA,CAAM,OAAelB,MAAAA,EAA+B;AAClE,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,WAAA;AAAA,IACR,QAAA,EAAU,OAAA;AAAA,IACV,KAAA,EAAO;AAAA,MACL,MAAA,EAAQ,WAAA;AAAA,MACR,KAAA;AAAA,MACA,MAAMA,MAAAA,GAAQ,CAAC,OAAO,CAAA,GAAI,CAAC,IAAI,CAAA;AAAA,MAC/B,aAAaA,MAAAA,GAAQ,WAAA,CAAY,CAACA,MAAK,CAAC,CAAA,GAAI,MAAA;AAAA,MAC5C,SAAA,EAAWA,SAAQ,MAAA,GAAY;AAAA;AACjC,GACF;AACF;AAQO,SAAS,aAAA,CAAc,OAAeA,MAAAA,EAA+B;AAC1E,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,WAAA;AAAA,IACR,QAAA,EAAU,eAAA;AAAA,IACV,KAAA,EAAO;AAAA,MACL,MAAA,EAAQ,WAAA;AAAA,MACR,KAAA;AAAA,MACA,MAAMA,MAAAA,GAAQ,CAAC,OAAO,CAAA,GAAI,CAAC,IAAI,CAAA;AAAA,MAC/B,aAAaA,MAAAA,GAAQ,WAAA,CAAY,CAACA,MAAK,CAAC,CAAA,GAAI,MAAA;AAAA,MAC5C,SAAA,EAAWA,SAAQ,MAAA,GAAY;AAAA;AACjC,GACF;AACF;AAmCO,SAAS,WAAW,SAAA,EAAkC;AAC3D,EAAA,OAAO,MAAM,SAAS,CAAA;AACxB;AAWO,SAAS,mBAAmB,SAAA,EAAkC;AACnE,EAAA,OAAO,cAAc,SAAS,CAAA;AAChC;AAQO,SAAS,GAAA,CAAI,OAAeA,MAAAA,EAA8B;AAC/D,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,WAAA;AAAA,IACR,QAAA,EAAU,KAAA;AAAA,IACV,KAAA,EAAO;AAAA,MACL,MAAA,EAAQ,WAAA;AAAA,MACR,KAAA;AAAA,MACA,IAAA,EAAM,CAAC,OAAO,CAAA;AAAA,MACd,WAAA,EAAa,WAAA,CAAY,CAACA,MAAK,CAAC,CAAA;AAAA,MAChC,SAAA,EAAW;AAAA;AACb,GACF;AACF;AAQO,SAAS,GAAA,CAAI,OAAeA,MAAAA,EAA8B;AAC/D,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,WAAA;AAAA,IACR,QAAA,EAAU,KAAA;AAAA,IACV,KAAA,EAAO;AAAA,MACL,MAAA,EAAQ,WAAA;AAAA,MACR,KAAA;AAAA,MACA,IAAA,EAAM,CAAC,OAAO,CAAA;AAAA,MACd,WAAA,EAAa,WAAA,CAAY,CAACA,MAAK,CAAC,CAAA;AAAA,MAChC,SAAA,EAAW;AAAA;AACb,GACF;AACF;AAQO,SAAS,GAAA,CAAI,OAAeA,MAAAA,EAA8B;AAC/D,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,WAAA;AAAA,IACR,QAAA,EAAU,KAAA;AAAA,IACV,KAAA,EAAO;AAAA,MACL,MAAA,EAAQ,WAAA;AAAA,MACR,KAAA;AAAA,MACA,IAAA,EAAM,CAAC,OAAO,CAAA;AAAA,MACd,WAAA,EAAa,WAAA,CAAY,CAACA,MAAK,CAAC,CAAA;AAAA,MAChC,SAAA,EAAW;AAAA;AACb,GACF;AACF;AAQO,SAAS,GAAA,CAAI,OAAeA,MAAAA,EAA8B;AAC/D,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,WAAA;AAAA,IACR,QAAA,EAAU,KAAA;AAAA,IACV,KAAA,EAAO;AAAA,MACL,MAAA,EAAQ,WAAA;AAAA,MACR,KAAA;AAAA,MACA,IAAA,EAAM,CAAC,OAAO,CAAA;AAAA,MACd,WAAA,EAAa,WAAA,CAAY,CAACA,MAAK,CAAC,CAAA;AAAA,MAChC,SAAA,EAAW;AAAA;AACb,GACF;AACF;AAiBO,SAAS,KAAA,CAAM,UAAkB,IAAA,EAA0B;AAChE,EAAA,IAAI,KAAK,MAAA,KAAW,CAAA,IAAK,IAAA,CAAK,CAAC,MAAM,IAAA,EAAM;AACzC,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,WAAA;AAAA,MACR,KAAA;AAAA,MACA,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,MACX,SAAA,EAAW;AAAA,KACb;AAAA,EACF;AACA,EAAA,IAAI,IAAA,CAAK,CAAC,CAAA,KAAM,MAAA,EAAQ;AACtB,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,WAAA;AAAA,MACR,KAAA;AAAA,MACA,IAAA,EAAM,CAAC,MAAM,CAAA;AAAA,MACb,SAAA,EAAW;AAAA,KACb;AAAA,EACF;AACA,EAAA,IAAI,IAAA,CAAK,CAAC,CAAA,KAAM,OAAA,EAAS;AACvB,IAAA,MAAM,IAAI,KAAA;AAAA,MACR,2DAA2D,KAAK,CAAA,GAAA,EAAM,IAAA,CACnE,KAAA,CAAM,CAAC,CAAA,CACP,GAAA,CAAI,CAAC,CAAA,KAAM,IAAI,CAAC,CAAA,CAAA,CAAG,CAAA,CACnB,IAAA,CAAK,IAAI,CAAC,CAAA,UAAA;AAAA,KACf;AAAA,EACF;AACA,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,WAAA;AAAA,IACR,KAAA;AAAA,IACA,IAAA,EAAM,CAAC,OAAO,CAAA;AAAA,IACd,WAAA,EAAa,YAAY,IAAI;AAAA,GAC/B;AACF;AAsBO,SAAS,MAAA,CACd,SAAA,EACA,EAAA,EACA,KAAA,EAC8B;AAC9B,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,sBAAA;AAAA,IACR,EAAA;AAAA,IACA,SAAA;AAAA,IACA,KAAA,EAAO;AAAA,MACL,MAAA,EAAQ,SAAA;AAAA,MACR,KAAA;AAAA,MACA,SAAA,EAAW,OAAO,KAAA,KAAU,QAAA,GAAW,QAAA,GAAW;AAAA;AACpD,GACF;AACF;AAKO,SAAS,QAAA,CACd,WACA,KAAA,EAC8B;AAC9B,EAAA,OAAO,MAAA,CAAO,SAAA,EAAW,IAAA,EAAM,KAAK,CAAA;AACtC;AAKO,SAAS,SAAA,CACd,WACA,KAAA,EAC8B;AAC9B,EAAA,OAAO,MAAA,CAAO,SAAA,EAAW,KAAA,EAAO,KAAK,CAAA;AACvC;AAKO,SAAS,QAAA,CACd,WACA,KAAA,EAC8B;AAC9B,EAAA,OAAO,MAAA,CAAO,SAAA,EAAW,IAAA,EAAM,KAAK,CAAA;AACtC;AAKO,SAAS,SAAA,CACd,WACA,KAAA,EAC8B;AAC9B,EAAA,OAAO,MAAA,CAAO,SAAA,EAAW,KAAA,EAAO,KAAK,CAAA;AACvC;AAKO,SAAS,QAAA,CACd,WACA,KAAA,EAC8B;AAC9B,EAAA,OAAO,MAAA,CAAO,SAAA,EAAW,IAAA,EAAM,KAAK,CAAA;AACtC;;;AChNA,SAAS,iBAOP,EAAA,EAGwE;AACxE,EAAA,OAAO,EAAA;AACT;AAEO,SAAS,cAAA,GAS4D;AAC1E,EAAA,OAAO,gBAAA;AACT;AA6EO,SAAS,oBAEX,SAAA,EAEmC;AACtC,EAAA,OAAO,CAAC,OAAA,KAAY;AAClB,IAAA,IAAI,MAAA,GAAS,OAAA;AACb,IAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,MAAA,MAAA,GAAS,SAAS,MAAM,CAAA;AAAA,IAC1B;AACA,IAAA,OAAO,MAAA;AAAA,EACT,CAAA;AACF;AAcO,SAAS,eAAA,CACd,KAAA,EACAA,MAAAA,EACA,SAAA,GAA4B,KAAA,EAEU;AACtC,EAAA,OAAO,CAAC,OAAA,KAAY,OAAA,CAAQ,OAAA,CAAQ,KAAA,EAAOA,QAAO,SAAS,CAAA;AAC7D;AAUO,SAAS,cACd,CAAA,EAEsC;AACtC,EAAA,OAAO,CAAC,OAAA,KAAY,OAAA,CAAQ,KAAA,CAAM,CAAC,CAAA;AACrC;AAUO,SAAS,eACd,CAAA,EAEsC;AACtC,EAAA,OAAO,CAAC,OAAA,KAAY,OAAA,CAAQ,MAAA,CAAO,CAAC,CAAA;AACtC;;;AC/QA,oBAAA,CAAqB,YAAY,CAAA;AACjC,sBAAA,CAAuB,cAAc,CAAA;;;ACgF9B,SAAS,kBAAA,CACd,OAAA,EACA,QAAA,EACA,OAAA,EACiB;AACjB,EAAA,MAAM,kBAAA,GAAqB,wBAAA;AAAA,IACzB,QAAA,CAAS,SAAA;AAAA,IACT,QAAA,CAAS;AAAA,GACX;AAGA,EAAA,MAAM,MAAA,GAA6B;AAAA,IACjC,OAAA;AAAA,IACA,QAAA;AAAA,IACA,kBAAA;AAAA,IACA,yBAAA,EAA2B,SAAS,yBAAA,IAA6B,SAAA;AAAA,IACjE,GAAI,OAAA,EAAS,OAAA,KAAY,UAAa,EAAE,OAAA,EAAS,QAAQ,OAAA,EAAQ;AAAA,IACjE,GAAI,OAAA,EAAS,OAAA,KAAY,UAAa,EAAE,OAAA,EAAS,QAAQ,OAAA,EAAQ;AAAA,IACjE,GAAI,OAAA,EAAS,MAAA,KAAW,UAAa,EAAE,MAAA,EAAQ,QAAQ,MAAA,EAAO;AAAA,IAC9D,GAAI,OAAA,EAAS,gBAAA,KAAqB,MAAA,IAAa;AAAA,MAC7C,kBAAkB,OAAA,CAAQ;AAAA;AAC5B,GACF;AAIA,EAAA,MAAM,MAAA,GAAS,SAAS,gBAAA,EAAkB,KAAA;AAE1C,EAAA,MAAM,YAAA,GAAkC;AAAA,IACtC,UAAA,EAAY,EAAA;AAAA,IACZ,YAAA,EAAc,EAAA;AAAA,IACd,YAAY,EAAC;AAAA,IACb,iBAAA,EAAmB,KAAA;AAAA,IACnB,YAAY,EAAC;AAAA,IACb,YAAY,EAAC;AAAA,IACb,YAAY,EAAC;AAAA,IACb,SAAS,EAAC;AAAA,IACV,KAAA,EAAO,MAAA;AAAA,IACP,MAAA,EAAQ,MAAA;AAAA,IACR,YAAA,EAAc,QAAQ,IAAA,IAAQ,SAAA;AAAA,IAC9B,MAAM,MAAA,EAAQ,IAAA;AAAA,IACd,OAAA,EAAS,MAAA;AAAA,IACT,MAAA,EAAQ,MAAA;AAAA,IACR,MAAA,EAAQ,MAAA;AAAA,IACR,kBAAA,sBAAwB,GAAA,EAAI;AAAA,IAC5B,kBAAA,sBAAwB,GAAA;AAAI,GAC9B;AAEA,EAAA,OAAO,IAAI,YAAA,CAAa,MAAA,EAAQ,YAAY,CAAA;AAC9C;;;AC5GA,IAAM,qBAAA,uBAA4B,OAAA,EAGhC;AAQK,SAAS,oBACd,MAAA,EACgC;AAChC,EAAA,MAAM,MAAA,GAAS,qBAAA,CAAsB,GAAA,CAAI,MAAM,CAAA;AAC/C,EAAA,IAAI,QAAQ,OAAO,MAAA;AAEnB,EAAA,MAAM,MAAA,GAAS,wBAAwB,MAAM,CAAA;AAC7C,EAAA,qBAAA,CAAsB,GAAA,CAAI,QAAQ,MAAM,CAAA;AACxC,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,wBACP,MAAA,EACgC;AAChC,EAAA,IAAI,MAAA,CAAO,IAAA,KAAS,QAAA,EAAU,OAAO,EAAC;AAEtC,EAAA,MAAM,MAAM,MAAA,CAAO,GAAA;AACnB,EAAA,MAAM,QAAQ,GAAA,CAAI,KAAA;AAClB,EAAA,IAAI,CAAC,KAAA,EAAO,OAAO,EAAC;AAEpB,EAAA,MAAM,SAAgC,EAAC;AACvC,EAAA,KAAA,MAAW,CAAC,SAAA,EAAW,WAAW,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AAC5D,IAAA,MAAM,QAAA,GAAW,sBAAsB,WAAW,CAAA;AAClD,IAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,SAAA,EAAW,QAAA,EAAU,CAAA;AAAA,IACrC;AAAA,EACF;AACA,EAAA,0BAAA,CAA2B,MAAM,CAAA;AACjC,EAAA,OAAO,MAAA;AACT;AAUA,SAAS,2BACP,MAAA,EACM;AACN,EAAA,IAAI,MAAA,CAAO,SAAS,CAAA,EAAG;AACvB,EAAA,MAAM,SAAA,GAAY,IAAI,GAAA,CAAI,MAAA,CAAO,GAAA,CAAI,CAACA,MAAAA,KAAUA,MAAAA,CAAM,QAAA,CAAS,QAAQ,CAAC,CAAA;AACxE,EAAA,IAAI,SAAA,CAAU,OAAO,CAAA,EAAG;AACxB,EAAA,IAAI,OAAO,OAAA,KAAY,WAAA,IAAe,OAAO,OAAA,CAAQ,SAAS,UAAA,EAAY;AACxE,IAAA;AAAA,EACF;AACA,EAAA,MAAM,YAAA,GAAe,MAAA,CAClB,GAAA,CAAI,CAACA,WAAU,CAAA,EAAGA,MAAAA,CAAM,SAAS,CAAA,CAAA,EAAIA,OAAM,QAAA,CAAS,QAAQ,CAAA,CAAE,CAAA,CAC9D,KAAK,IAAI,CAAA;AACZ,EAAA,MAAM,OAAA,GAAU,MAAA,CAAO,CAAC,CAAA,EAAG,SAAS,QAAA,IAAY,2BAAA;AAChD,EAAA,OAAA,CAAQ,IAAA;AAAA,IACN,CAAA,+DAAA,EACM,YAAY,CAAA,gCAAA,EAAmC,OAAO,CAAA,2GAAA;AAAA,GAG9D;AACF;AAEA,IAAM,eAAA,GAAkB,IAAA;AAOxB,SAAS,wBACP,MAAA,EACQ;AACR,EAAA,OAAO,MAAA,CAAO,CAAC,CAAA,EAAG,QAAA,CAAS,QAAA,IAAY,2BAAA;AACzC;AASO,SAAS,sBAAA,CACd,QACA,KAAA,EACmD;AACnD,EAAA,MAAM,gBAAA,GAAmB,oBAAoB,MAAM,CAAA;AACnD,EAAA,IAAI,gBAAA,CAAiB,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AAE1C,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,KAAA,MAAWA,UAAS,gBAAA,EAAkB;AACpC,IAAA,MAAM,KAAA,GAAQ,KAAA,CAAMA,MAAAA,CAAM,SAAS,CAAA;AACnC,IAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,CAAM,SAAS,CAAA,EAAG;AACjD,MAAA,KAAA,CAAM,KAAK,KAAK,CAAA;AAAA,IAClB;AAAA,EACF;AACA,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AAE/B,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,KAAA,CAAM,IAAA,CAAK,eAAe,CAAA;AAAA,IACnC,QAAA,EAAU,wBAAwB,gBAAgB;AAAA,GACpD;AACF;AASA,eAAsB,YAAA,CACpB,GAAA,EACA,MAAA,EACA,KAAA,EACe;AACf,EAAA,MAAM,EAAE,SAAQ,GAAI,GAAA;AAEpB,EAAA,IAAI,CAAC,OAAA,CAAQ,cAAA,IAAkB,CAAC,QAAQ,cAAA,EAAgB;AACtD,IAAA;AAAA,EACF;AAMA,EAAA,MAAM,QAAA,GAAW,sBAAA,CAAuB,MAAA,EAAQ,KAAK,CAAA;AACrD,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,MAAM,QAAQ,cAAA,CAAe;AAAA,MAC3B,SAAS,GAAA,CAAI,OAAA;AAAA,MACb,UAAU,GAAA,CAAI,QAAA;AAAA,MACd,QAAQ,GAAA,CAAI,MAAA;AAAA,MACZ,SAAS,QAAA,CAAS,OAAA;AAAA,MAClB,UAAU,QAAA,CAAS;AAAA,KACpB,CAAA;AACD,IAAA;AAAA,EACF;AACA,EAAA,IAAI,mBAAA,CAAoB,MAAM,CAAA,CAAE,MAAA,KAAW,CAAA,EAAG;AAC9C,EAAA,MAAM,QAAQ,cAAA,CAAe;AAAA,IAC3B,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,UAAU,GAAA,CAAI,QAAA;AAAA,IACd,QAAQ,GAAA,CAAI;AAAA,GACb,CAAA;AACH;AAMA,eAAsB,kBAAA,CACpB,KACA,MAAA,EACe;AACf,EAAA,MAAM,EAAE,SAAQ,GAAI,GAAA;AAEpB,EAAA,IAAI,CAAC,QAAQ,cAAA,EAAgB;AAC3B,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,mBAAA,CAAoB,MAAM,CAAA,CAAE,MAAA,KAAW,CAAA,EAAG;AAC5C,IAAA;AAAA,EACF;AAEA,EAAA,MAAM,QAAQ,cAAA,CAAe;AAAA,IAC3B,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,UAAU,GAAA,CAAI,QAAA;AAAA,IACd,QAAQ,GAAA,CAAI;AAAA,GACb,CAAA;AACH;;;AC3LA,IAAM,iBAAA,GAAoB,GAAA;AAU1B,IAAM,uBAAA,GAA0B,GAAA;AA4ChC,SAAS,iBAAiB,KAAA,EAAmC;AAC3D,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,iBAAA;AAChC,EAAA,IAAI,CAAC,MAAA,CAAO,SAAA,CAAU,KAAK,CAAA,IAAK,SAAS,CAAA,EAAG;AAC1C,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,CAAA,0CAAA,EAA6C,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA;AAAA,MAC1D;AAAA,QACE,QAAQ,CAAC,EAAE,MAAM,UAAA,EAAY,OAAA,EAAS,+BAA+B;AAAA;AACvE,KACF;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,sBAAsB,KAAA,EAAmC;AAChE,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,uBAAA;AAChC,EAAA,IAAI,CAAC,MAAA,CAAO,SAAA,CAAU,KAAK,CAAA,IAAK,QAAQ,CAAA,EAAG;AACzC,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,CAAA,mDAAA,EAAsD,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA;AAAA,MACnE;AAAA,QACE,MAAA,EAAQ;AAAA,UACN;AAAA,YACE,IAAA,EAAM,eAAA;AAAA,YACN,OAAA,EAAS;AAAA;AACX;AACF;AACF,KACF;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,cAAc,KAAA,EAAkD;AACvE,EAAA,OAAO,OAAO,UAAU,QAAA,IAAY,KAAA,KAAU,QAAQ,CAAC,KAAA,CAAM,QAAQ,KAAK,CAAA;AAC5E;AAEA,eAAsB,oBAAA,CACpB,GAAA,EACA,QAAA,EACA,OAAA,EACgC;AAChC,EAAA,MAAM,EAAE,OAAA,EAAS,QAAA,EAAS,GAAI,GAAA;AAE9B,EAAA,IAAI,CAAC,OAAA,CAAQ,cAAA,IAAkB,CAAC,QAAQ,cAAA,EAAgB;AACtD,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,yDAAA;AAAA,MACA,EAAE,OAAA,EAAS,OAAA,CAAQ,OAAA,EAAS,YAAY,UAAA;AAAW,KACrD;AAAA,EACF;AAEA,EAAA,MAAM,QAAA,GAAW,gBAAA,CAAiB,OAAA,CAAQ,QAAQ,CAAA;AAClD,EAAA,MAAM,aAAA,GAAgB,qBAAA,CAAsB,OAAA,CAAQ,aAAa,CAAA;AAEjE,EAAA,MAAM,WAAA,GACJ,QAAA,KAAa,MAAA,GAAY,CAAC,GAAG,QAAA,CAAS,SAAA,CAAU,IAAA,EAAM,CAAA,GAAI,CAAC,QAAQ,CAAA;AAErE,EAAA,MAAM,eAAyB,EAAC;AAChC,EAAA,IAAI,SAAA,GAAY,CAAA;AAChB,EAAA,IAAI,QAAA,GAAW,CAAA;AACf,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,MAAM,aAAuB,EAAC;AAE9B,EAAA,KAAA,MAAW,QAAQ,WAAA,EAAa;AAC9B,IAAA,MAAM,QAAA,GAAW,QAAA,CAAS,WAAA,CAAY,IAAI,CAAA;AAC1C,IAAA,IAAI,CAAC,QAAA,EAAU;AACb,MAAA,MAAM,IAAI,kBAAA,CAAmB,CAAA,mBAAA,EAAsB,IAAI,CAAA,CAAA,EAAI,EAAE,MAAM,CAAA;AAAA,IACrE;AACA,IAAA,IAAI,mBAAA,CAAoB,QAAA,CAAS,MAAM,CAAA,CAAE,WAAW,CAAA,EAAG;AACrD,MAAA;AAAA,IACF;AAEA,IAAA,YAAA,CAAa,KAAK,IAAI,CAAA;AACtB,IAAA,IAAI,MAAA;AACJ,IAAA,WAAS;AAGP,MAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,eAAA,CAAgB;AAAA,QACzC,SAAS,GAAA,CAAI,OAAA;AAAA,QACb,IAAA;AAAA,QACA,KAAA,EAAO,QAAA;AAAA,QACP,cAAA,EAAgB,KAAA;AAAA,QAChB,OAAA,EAAS,IAAA;AAAA,QACT,GAAI,MAAA,KAAW,MAAA,GAAY,EAAC,GAAI,EAAE,OAAO,MAAA;AAAO,OACjD,CAAA;AACD,MAAA,IAAI,IAAA,CAAK,WAAW,CAAA,EAAG;AAEvB,MAAA,MAAM,UAAA,GAAa,WAAA,CAAY,QAAA,CAAS,MAAA,EAAQ,IAAI,CAAA;AACpD,MAAA,OAAA,IAAW,UAAA,CAAW,OAAA;AACtB,MAAA,MAAM,SAAA,GAAY,gBAAgB,UAAA,CAAW,MAAA;AAC7C,MAAA,IAAI,SAAA,GAAY,CAAA,IAAK,UAAA,CAAW,UAAA,CAAW,SAAS,CAAA,EAAG;AACrD,QAAA,UAAA,CAAW,KAAK,GAAG,UAAA,CAAW,WAAW,KAAA,CAAM,CAAA,EAAG,SAAS,CAAC,CAAA;AAAA,MAC9D;AAEA,MAAA,MAAM,SAAA,GAAY,OAChB,MAAA,KACkB;AAClB,QAAA,IAAI,UAAA,CAAW,QAAA,CAAS,MAAA,GAAS,CAAA,EAAG;AAClC,UAAA,IAAI,OAAO,mBAAA,EAAqB;AAC9B,YAAA,MAAM,OAAO,mBAAA,CAAoB;AAAA,cAC/B,SAAS,GAAA,CAAI,OAAA;AAAA,cACb,QAAA,EAAU,IAAA;AAAA,cACV,MAAM,UAAA,CAAW;AAAA,aAClB,CAAA;AAAA,UACH,CAAA,MAAA,IAAW,OAAO,cAAA,EAAgB;AAChC,YAAA,KAAA,MAAW,IAAA,IAAQ,WAAW,QAAA,EAAU;AACtC,cAAA,MAAM,OAAO,cAAA,CAAe;AAAA,gBAC1B,SAAS,GAAA,CAAI,OAAA;AAAA,gBACb,QAAA,EAAU,IAAA;AAAA,gBACV,QAAQ,IAAA,CAAK,MAAA;AAAA,gBACb,SAAS,IAAA,CAAK,OAAA;AAAA,gBACd,UAAU,IAAA,CAAK;AAAA,eAChB,CAAA;AAAA,YACH;AAAA,UACF;AAAA,QACF;AACA,QAAA,IAAI,UAAA,CAAW,QAAA,CAAS,MAAA,GAAS,CAAA,EAAG;AAClC,UAAA,IAAI,OAAO,mBAAA,EAAqB;AAC9B,YAAA,MAAM,OAAO,mBAAA,CAAoB;AAAA,cAC/B,SAAS,GAAA,CAAI,OAAA;AAAA,cACb,QAAA,EAAU,IAAA;AAAA,cACV,SAAS,UAAA,CAAW;AAAA,aACrB,CAAA;AAAA,UACH,CAAA,MAAA,IAAW,OAAO,cAAA,EAAgB;AAChC,YAAA,KAAA,MAAW,MAAA,IAAU,WAAW,QAAA,EAAU;AACxC,cAAA,MAAM,OAAO,cAAA,CAAe;AAAA,gBAC1B,SAAS,GAAA,CAAI,OAAA;AAAA,gBACb,QAAA,EAAU,IAAA;AAAA,gBACV;AAAA,eACD,CAAA;AAAA,YACH;AAAA,UACF;AAAA,QACF;AAAA,MACF,CAAA;AAMA,MAAA,MAAM,0BAAA,CAA2B,SAAS,SAAS,CAAA;AAEnD,MAAA,SAAA,IAAa,IAAA,CAAK,MAAA;AAClB,MAAA,QAAA,IAAY,WAAW,QAAA,CAAS,MAAA;AAChC,MAAA,OAAA,IAAW,WAAW,QAAA,CAAS,MAAA;AAE/B,MAAA,MAAM,OAAA,GAAU,IAAA,CAAK,EAAA,CAAG,EAAE,CAAA;AAC1B,MAAA,IAAI,CAAC,OAAA,EAAS;AACd,MAAA,MAAA,GAAS,OAAA,CAAQ,EAAA;AACjB,MAAA,IAAI,IAAA,CAAK,SAAS,QAAA,EAAU;AAAA,IAC9B;AAAA,EACF;AAEA,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,YAAA;AAAA,IACP,SAAA;AAAA,IACA,QAAA;AAAA,IACA,OAAA;AAAA,IACA,OAAA;AAAA,IACA,UAAA;AAAA,IACA,gBAAA,EAAkB,UAAU,UAAA,CAAW;AAAA,GACzC;AACF;AASA,SAAS,WAAA,CAAY,QAAmB,IAAA,EAAsC;AAC5E,EAAA,MAAM,WAAmC,EAAC;AAC1C,EAAA,MAAM,WAAqB,EAAC;AAC5B,EAAA,MAAM,aAAuB,EAAC;AAC9B,EAAA,IAAI,OAAA,GAAU,CAAA;AAEd,EAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,IAAA,IAAI,GAAA,CAAI,eAAe,MAAA,EAAW;AAChC,MAAA,QAAA,CAAS,IAAA,CAAK,IAAI,EAAE,CAAA;AACpB,MAAA;AAAA,IACF;AACA,IAAA,IAAI,MAAA;AACJ,IAAA,IAAI;AACF,MAAA,MAAA,GAAS,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,KAAK,CAAA;AAAA,IAC/B,CAAA,CAAA,MAAQ;AACN,MAAA,OAAA,IAAW,CAAA;AACX,MAAA,UAAA,CAAW,IAAA,CAAK,IAAI,EAAE,CAAA;AACtB,MAAA;AAAA,IACF;AACA,IAAA,IAAI,CAAC,aAAA,CAAc,MAAM,CAAA,EAAG;AAC1B,MAAA,OAAA,IAAW,CAAA;AACX,MAAA,UAAA,CAAW,IAAA,CAAK,IAAI,EAAE,CAAA;AACtB,MAAA;AAAA,IACF;AACA,IAAA,MAAM,QAAA,GAAW,sBAAA,CAAuB,MAAA,EAAQ,MAAM,CAAA;AACtD,IAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,MAAA,QAAA,CAAS,IAAA,CAAK,IAAI,EAAE,CAAA;AAAA,IACtB,CAAA,MAAO;AACL,MAAA,QAAA,CAAS,IAAA,CAAK;AAAA,QACZ,QAAQ,GAAA,CAAI,EAAA;AAAA,QACZ,SAAS,QAAA,CAAS,OAAA;AAAA,QAClB,UAAU,QAAA,CAAS;AAAA,OACpB,CAAA;AAAA,IACH;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,QAAA,EAAU,QAAA,EAAU,OAAA,EAAS,UAAA,EAAW;AACnD;;;ACjPA,IAAM,oBAAA,uBAA2B,OAAA,EAG/B;AAUK,SAAS,mBACd,MAAA,EAC+B;AAC/B,EAAA,MAAM,MAAA,GAAS,oBAAA,CAAqB,GAAA,CAAI,MAAM,CAAA;AAC9C,EAAA,IAAI,QAAQ,OAAO,MAAA;AACnB,EAAA,MAAM,MAAA,GAAS,uBAAuB,MAAM,CAAA;AAC5C,EAAA,oBAAA,CAAqB,GAAA,CAAI,QAAQ,MAAM,CAAA;AACvC,EAAA,OAAO,MAAA;AACT;AAaA,eAAsB,cAAA,CACpB,GAAA,EACA,MAAA,EACA,KAAA,EACe;AACf,EAAA,MAAM,EAAE,SAAQ,GAAI,GAAA;AAGpB,EAAA,IAAI,CAAC,OAAA,CAAQ,eAAA,IAAmB,CAAC,QAAQ,eAAA,EAAiB;AACxD,IAAA;AAAA,EACF;AAEA,EAAA,MAAM,eAAA,GAAkB,mBAAmB,MAAM,CAAA;AACjD,EAAA,IAAI,eAAA,CAAgB,WAAW,CAAA,EAAG;AAChC,IAAA;AAAA,EACF;AAEA,EAAA,KAAA,MAAWA,UAAS,eAAA,EAAiB;AACnC,IAAA,MAAM,KAAA,GAAQ,KAAA,CAAMA,MAAAA,CAAM,SAAS,CAAA;AAEnC,IAAA,IAAI,qBAAA,CAAsB,KAAK,CAAA,EAAG;AAEhC,MAAA,MAAM,QAAQ,eAAA,CAAgB;AAAA,QAC5B,SAAS,GAAA,CAAI,OAAA;AAAA,QACb,UAAU,GAAA,CAAI,QAAA;AAAA,QACd,QAAQ,GAAA,CAAI,MAAA;AAAA,QACZ,WAAWA,MAAAA,CAAM,SAAA;AAAA,QACjB,SAAA,EAAW,KAAA;AAAA,QACX,YAAYA,MAAAA,CAAM,UAAA;AAAA,QAClB,QAAQA,MAAAA,CAAM,MAAA;AAAA,QACd,WAAWA,MAAAA,CAAM;AAAA,OAClB,CAAA;AAAA,IACH,CAAA,MAAA,IAAW,UAAU,MAAA,EAAW;AAE9B,MAAA,MAAM,QAAQ,eAAA,CAAgB;AAAA,QAC5B,SAAS,GAAA,CAAI,OAAA;AAAA,QACb,UAAU,GAAA,CAAI,QAAA;AAAA,QACd,QAAQ,GAAA,CAAI,MAAA;AAAA,QACZ,WAAWA,MAAAA,CAAM,SAAA;AAAA,QACjB,YAAYA,MAAAA,CAAM,UAAA;AAAA,QAClB,QAAQA,MAAAA,CAAM,MAAA;AAAA,QACd,WAAWA,MAAAA,CAAM;AAAA,OAClB,CAAA;AAAA,IACH;AAAA,EAEF;AACF;AAWA,eAAsB,oBAAA,CACpB,KACA,MAAA,EACe;AACf,EAAA,MAAM,EAAE,SAAQ,GAAI,GAAA;AAGpB,EAAA,IAAI,CAAC,QAAQ,eAAA,EAAiB;AAC5B,IAAA;AAAA,EACF;AAEA,EAAA,MAAM,eAAA,GAAkB,mBAAmB,MAAM,CAAA;AACjD,EAAA,IAAI,eAAA,CAAgB,WAAW,CAAA,EAAG;AAChC,IAAA;AAAA,EACF;AAEA,EAAA,KAAA,MAAWA,UAAS,eAAA,EAAiB;AACnC,IAAA,MAAM,QAAQ,eAAA,CAAgB;AAAA,MAC5B,SAAS,GAAA,CAAI,OAAA;AAAA,MACb,UAAU,GAAA,CAAI,QAAA;AAAA,MACd,QAAQ,GAAA,CAAI,MAAA;AAAA,MACZ,WAAWA,MAAAA,CAAM,SAAA;AAAA,MACjB,YAAYA,MAAAA,CAAM,UAAA;AAAA,MAClB,QAAQA,MAAAA,CAAM,MAAA;AAAA,MACd,WAAWA,MAAAA,CAAM;AAAA,KAClB,CAAA;AAAA,EACH;AACF;AASA,SAAS,sBAAsB,KAAA,EAA4C;AACzE,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACzB,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,OAAO,KAAA,CAAM,KAAA,CAAM,CAAC,CAAA,KAAM,OAAO,MAAM,QAAA,IAAY,MAAA,CAAO,QAAA,CAAS,CAAC,CAAC,CAAA;AACvE;;;ACIA,SAAS,iBAAA,CACP,GAAA,EACA,QAAA,EACA,SAAA,EACoB;AACpB,EAAA,MAAM,QAAA,GAAW,GAAA,CAAI,QAAA,CAAS,WAAA,CAAY,QAAQ,CAAA;AAClD,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,MAAM,MAAA,GAAS,kBAAA,CAAmB,QAAA,CAAS,MAAM,CAAA;AACjD,IAAA,MAAMA,SAAQ,MAAA,CAAO,IAAA,CAAK,CAAC+B,MAAAA,KAAUA,MAAAA,CAAM,cAAc,SAAS,CAAA;AAClE,IAAA,IAAI/B,WAAU,MAAA,EAAW;AACvB,MAAA,OAAO;AAAA,QACL,YAAYA,MAAAA,CAAM,UAAA;AAAA,QAClB,QAAQA,MAAAA,CAAM,MAAA;AAAA,QACd,WAAWA,MAAAA,CAAM;AAAA,OACnB;AAAA,IACF;AAAA,EACF;AACA,EAAA,MAAM,IAAI,kBAAA;AAAA,IACR,CAAA,WAAA,EAAc,QAAQ,CAAA,0BAAA,EAA6B,SAAS,CAAA,4DAAA,CAAA;AAAA,IAE5D,EAAE,UAAA,EAAY,QAAA,EAAU,OAAA,EAAS,IAAI,OAAA;AAAQ,GAC/C;AACF;AAEA,eAAsB,qBAAA,CACpB,GAAA,EACA,QAAA,EACA,OAAA,EAC0C;AAC1C,EAAA,MAAM,EAAE,OAAA,EAAS,OAAA,EAAQ,GAAI,GAAA;AAC7B,EAAA,IAAI,CAAC,QAAQ,cAAA,EAAgB;AAC3B,IAAA,MAAM,IAAI,mBAAmB,0CAAA,EAA4C;AAAA,MACvE,SAAS,OAAA,CAAQ,OAAA;AAAA,MACjB,UAAA,EAAY;AAAA,KACb,CAAA;AAAA,EACH;AACA,EAAA,IAAI,CAAC,OAAO,SAAA,CAAU,OAAA,CAAQ,KAAK,CAAA,IAAK,OAAA,CAAQ,SAAS,CAAA,EAAG;AAC1D,IAAA,MAAM,IAAI,UAAA;AAAA,MACR,CAAA,sDAAA,EAAyD,QAAQ,KAAK,CAAA;AAAA,KACxE;AAAA,EACF;AACA,EAAA,2BAAA,CAA4B,OAAA,EAAS;AAAA,IACnC,MAAM,OAAA,CAAQ,IAAA;AAAA,IACd,iBAAiB,OAAA,CAAQ,eAAA;AAAA,IACzB,UAAU,OAAA,CAAQ;AAAA,GACnB,CAAA;AAED,EAAA,MAAM,MAAA,GAAqE;AAAA,IACzE,OAAA;AAAA,IACA,QAAA;AAAA,IACA,OAAO,OAAA,CAAQ,KAAA;AAAA,IACf,OAAO,OAAA,CAAQ,KAAA;AAAA,IACf,GAAI,QAAQ,IAAA,GAAO,EAAE,MAAM,OAAA,CAAQ,IAAA,KAAS,EAAC;AAAA,IAC7C,GAAI,QAAQ,QAAA,GAAW,EAAE,UAAU,OAAA,CAAQ,QAAA,KAAa,EAAC;AAAA,IACzD,GAAI,QAAQ,QAAA,KAAa,MAAA,GAAY,EAAC,GAAI,EAAE,QAAA,EAAU,OAAA,CAAQ,QAAA,EAAS;AAAA,IACvE,GAAI,QAAQ,eAAA,KAAoB,MAAA,GAC9B,EAAC,GACD,EAAE,eAAA,EAAiB,OAAA,CAAQ,eAAA;AAAgB,GAC/C;AAEA,EAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,cAAA,CAAe,MAAM,CAAA;AAChD,EAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAE/B,EAAA,MAAM,MAAM,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ,IAAI,MAAM,CAAA;AACxC,EAAA,MAAM,UAAU,MAAM,eAAA,CAAgB,OAAA,EAAS,OAAA,EAAS,UAAU,GAAG,CAAA;AAErE,EAAA,MAAM,OAA+B,EAAC;AACtC,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,IAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AACnC,IAAA,IAAI,CAAC,IAAA,EAAM;AACX,IAAA,IAAA,CAAK,IAAA,CAAK;AAAA,MACR,IAAA;AAAA,MACA,OAAO,GAAA,CAAI,KAAA;AAAA,MACX,IAAA;AAAA,MACA,GAAI,IAAI,OAAA,KAAY,MAAA,GAAY,EAAC,GAAI,EAAE,OAAA,EAAS,GAAA,CAAI,OAAA;AAAQ,KAC7D,CAAA;AACD,IAAA,IAAA,IAAQ,CAAA;AAAA,EACV;AACA,EAAA,OAAO,IAAA;AACT;AAEA,eAAsB,mBAAA,CACpB,GAAA,EACA,QAAA,EACA,OAAA,EACwC;AACxC,EAAA,MAAM,EAAE,OAAA,EAAS,OAAA,EAAQ,GAAI,GAAA;AAC7B,EAAA,IAAI,CAAC,QAAQ,YAAA,EAAc;AACzB,IAAA,MAAM,IAAI,mBAAmB,wCAAA,EAA0C;AAAA,MACrE,SAAS,OAAA,CAAQ,OAAA;AAAA,MACjB,UAAA,EAAY;AAAA,KACb,CAAA;AAAA,EACH;AACA,EAAA,IAAI,CAAC,OAAO,SAAA,CAAU,OAAA,CAAQ,KAAK,CAAA,IAAK,OAAA,CAAQ,SAAS,CAAA,EAAG;AAC1D,IAAA,MAAM,IAAI,UAAA;AAAA,MACR,CAAA,oDAAA,EAAuD,QAAQ,KAAK,CAAA;AAAA,KACtE;AAAA,EACF;AACA,EAAA,cAAA,CAAe,OAAA,CAAQ,UAAU,uBAAuB,CAAA;AAExD,EAAA,MAAM,IAAA,GAAO,iBAAA,CAAkB,GAAA,EAAK,QAAA,EAAU,QAAQ,SAAS,CAAA;AAC/D,EAAA,2BAAA;AAAA,IACE,OAAA;AAAA,IACA,IAAA;AAAA,IACA,EAAE,MAAA,EAAQ,OAAA,CAAQ,MAAA,EAAQ,cAAA,EAAgB,QAAQ,cAAA,EAAe;AAAA,IACjE;AAAA,GACF;AACA,EAAA,cAAA;AAAA,IACE,OAAA,CAAQ,QAAA;AAAA,IACR,OAAA,CAAQ,UAAU,IAAA,CAAK,MAAA;AAAA,IACvB;AAAA,GACF;AACA,EAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,YAAA,CAAa;AAAA,IACtC,OAAA;AAAA,IACA,QAAA;AAAA,IACA,WAAW,OAAA,CAAQ,SAAA;AAAA,IACnB,gBAAgB,OAAA,CAAQ,cAAA;AAAA;AAAA;AAAA;AAAA,IAIxB,MAAA,EAAQ,OAAA,CAAQ,MAAA,IAAU,IAAA,CAAK,MAAA;AAAA,IAC/B,YAAY,IAAA,CAAK,UAAA;AAAA,IACjB,WAAW,IAAA,CAAK,SAAA;AAAA,IAChB,OAAO,OAAA,CAAQ,KAAA;AAAA,IACf,GAAI,QAAQ,QAAA,KAAa,MAAA,GAAY,EAAC,GAAI,EAAE,QAAA,EAAU,OAAA,CAAQ,QAAA,EAAS;AAAA,IACvE,GAAI,QAAQ,QAAA,KAAa,MAAA,GAAY,EAAC,GAAI,EAAE,QAAA,EAAU,OAAA,CAAQ,QAAA;AAAS,GACxE,CAAA;AACD,EAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAE/B,EAAA,MAAM,MAAM,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ,IAAI,MAAM,CAAA;AACxC,EAAA,MAAM,UAAU,MAAM,eAAA,CAAgB,OAAA,EAAS,OAAA,EAAS,UAAU,GAAG,CAAA;AAErE,EAAA,MAAM,OAA6B,EAAC;AACpC,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,IAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AACnC,IAAA,IAAI,CAAC,IAAA,EAAM;AACX,IAAA,IAAA,CAAK,KAAK,EAAE,IAAA,EAAiB,OAAO,GAAA,CAAI,KAAA,EAAO,MAAM,CAAA;AACrD,IAAA,IAAA,IAAQ,CAAA;AAAA,EACV;AACA,EAAA,OAAO,IAAA;AACT;AAEA,eAAsB,mBAAA,CACpB,GAAA,EACA,QAAA,EACA,OAAA,EACwC;AACxC,EAAA,MAAM,EAAE,OAAA,EAAS,OAAA,EAAQ,GAAI,GAAA;AAC7B,EAAA,IAAI,CAAC,QAAQ,YAAA,EAAc;AACzB,IAAA,MAAM,IAAI,mBAAmB,wCAAA,EAA0C;AAAA,MACrE,SAAS,OAAA,CAAQ,OAAA;AAAA,MACjB,UAAA,EAAY;AAAA,KACb,CAAA;AAAA,EACH;AACA,EAAA,IAAI,CAAC,QAAQ,cAAA,EAAgB;AAC3B,IAAA,MAAM,IAAI,mBAAmB,0CAAA,EAA4C;AAAA,MACvE,SAAS,OAAA,CAAQ,OAAA;AAAA,MACjB,UAAA,EAAY;AAAA,KACb,CAAA;AAAA,EACH;AACA,EAAA,IAAI,CAAC,OAAO,SAAA,CAAU,OAAA,CAAQ,KAAK,CAAA,IAAK,OAAA,CAAQ,SAAS,CAAA,EAAG;AAC1D,IAAA,MAAM,IAAI,UAAA;AAAA,MACR,CAAA,oDAAA,EAAuD,QAAQ,KAAK,CAAA;AAAA,KACtE;AAAA,EACF;AAEA,EAAA,IAAI,OAAA,CAAQ,WAAW,MAAA,EAAW;AAChC,IAAA,2BAAA,CAA4B,QAAQ,MAAM,CAAA;AAAA,EAC5C;AACA,EAAA,cAAA,CAAe,OAAA,CAAQ,MAAA,CAAO,QAAA,EAAU,8BAA8B,CAAA;AAEtE,EAAA,2BAAA,CAA4B,OAAA,EAAS;AAAA,IACnC,IAAA,EAAM,QAAQ,QAAA,CAAS,IAAA;AAAA,IACvB,eAAA,EAAiB,QAAQ,QAAA,CAAS,eAAA;AAAA,IAClC,QAAA,EAAU,QAAQ,QAAA,CAAS;AAAA,GAC5B,CAAA;AAED,EAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,MAAA,EAAQ,CAAA,IAAK,aAAA;AACrC,EAAA,MAAM,YAAA,GAAe,OAAA,CAAQ,MAAA,EAAQ,OAAA,EAAS,MAAA,IAAU,kBAAA;AACxD,EAAA,MAAM,cAAA,GACJ,OAAA,CAAQ,MAAA,EAAQ,OAAA,EAAS,QAAA,IAAY,kBAAA;AACvC,EAAA,MAAM,mBAAA,GAAsB,CAAA;AAC5B,EAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,MAAA,CAAO,CAAA,IAAK,QAAQ,KAAA,GAAQ,mBAAA;AACpD,EAAA,MAAM,SAAA,GAAY,OAAA,CAAQ,QAAA,CAAS,CAAA,IAAK,QAAQ,KAAA,GAAQ,mBAAA;AAExD,EAAA,MAAM,aAAa,iBAAA,CAAkB,GAAA,EAAK,QAAA,EAAU,OAAA,CAAQ,OAAO,SAAS,CAAA;AAC5E,EAAA,2BAAA;AAAA,IACE,OAAA;AAAA,IACA,UAAA;AAAA,IACA;AAAA,MACE,MAAA,EAAQ,QAAQ,MAAA,CAAO,MAAA;AAAA,MACvB,cAAA,EAAgB,QAAQ,MAAA,CAAO;AAAA,KACjC;AAAA,IACA;AAAA,GACF;AACA,EAAA,cAAA;AAAA,IACE,QAAQ,MAAA,CAAO,QAAA;AAAA,IACf,OAAA,CAAQ,MAAA,CAAO,MAAA,IAAU,UAAA,CAAW,MAAA;AAAA,IACpC;AAAA,GACF;AACA,EAAA,MAAM,aAAA,GAAgB,QAAQ,YAAA,CAAa;AAAA,IACzC,OAAA;AAAA,IACA,QAAA;AAAA,IACA,SAAA,EAAW,QAAQ,MAAA,CAAO,SAAA;AAAA,IAC1B,cAAA,EAAgB,QAAQ,MAAA,CAAO,cAAA;AAAA;AAAA,IAE/B,MAAA,EAAQ,OAAA,CAAQ,MAAA,CAAO,MAAA,IAAU,UAAA,CAAW,MAAA;AAAA,IAC5C,YAAY,UAAA,CAAW,UAAA;AAAA,IACvB,WAAW,UAAA,CAAW,SAAA;AAAA,IACtB,KAAA,EAAO,OAAA;AAAA,IACP,GAAI,OAAA,CAAQ,MAAA,CAAO,QAAA,KAAa,MAAA,GAC9B,EAAC,GACD,EAAE,QAAA,EAAU,OAAA,CAAQ,MAAA,CAAO,QAAA,EAAS;AAAA,IACtC,GAAI,OAAA,CAAQ,MAAA,CAAO,QAAA,KAAa,MAAA,GAC9B,EAAC,GACD,EAAE,QAAA,EAAU,OAAA,CAAQ,MAAA,CAAO,QAAA;AAAS,GACvC,CAAA;AAED,EAAA,MAAM,eAAA,GAAkB,QAAQ,cAAA,CAAe;AAAA,IAC7C,OAAA;AAAA,IACA,QAAA;AAAA,IACA,KAAA,EAAO,QAAQ,QAAA,CAAS,KAAA;AAAA,IACxB,KAAA,EAAO,SAAA;AAAA,IACP,GAAI,OAAA,CAAQ,QAAA,CAAS,IAAA,GAAO,EAAE,MAAM,OAAA,CAAQ,QAAA,CAAS,IAAA,EAAK,GAAI,EAAC;AAAA,IAC/D,GAAI,OAAA,CAAQ,QAAA,CAAS,QAAA,GACnB,EAAE,UAAU,OAAA,CAAQ,QAAA,CAAS,QAAA,EAAS,GACtC,EAAC;AAAA,IACH,GAAI,OAAA,CAAQ,QAAA,CAAS,QAAA,KAAa,MAAA,GAChC,EAAC,GACD,EAAE,QAAA,EAAU,OAAA,CAAQ,QAAA,CAAS,QAAA,EAAS;AAAA,IACxC,GAAI,OAAA,CAAQ,QAAA,CAAS,eAAA,KAAoB,MAAA,GACvC,EAAC,GACD,EAAE,eAAA,EAAiB,OAAA,CAAQ,QAAA,CAAS,eAAA;AAAgB,GACvD,CAAA;AAED,EAAA,MAAM,CAAC,UAAA,EAAY,YAAY,CAAA,GAAI,MAAM,QAAQ,GAAA,CAAI;AAAA,IACnD,aAAA;AAAA,IACA;AAAA,GACD,CAAA;AAaD,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAwB;AAE1C,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,GAAG,CAAA,IAAK,UAAA,CAAW,SAAQ,EAAG;AAC/C,IAAA,MAAMgC,QAAO,KAAA,GAAQ,CAAA;AACrB,IAAA,MAAM,YAAA,GAAe,gBAAgB,OAAA,GAAUA,KAAAA,CAAAA;AAC/C,IAAA,MAAMD,MAAAA,GAAQ,KAAA,CAAM,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA,IAAK;AAAA,MACrC,QAAQ,GAAA,CAAI,MAAA;AAAA,MACZ,UAAA,EAAY;AAAA,KACd;AACA,IAAAA,OAAM,UAAA,IAAc,YAAA;AACpB,IAAAA,OAAM,UAAA,GAAaC,KAAAA;AACnB,IAAAD,MAAAA,CAAM,cAAc,GAAA,CAAI,KAAA;AACxB,IAAA,KAAA,CAAM,GAAA,CAAI,GAAA,CAAI,MAAA,EAAQA,MAAK,CAAA;AAAA,EAC7B;AAEA,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,GAAG,CAAA,IAAK,YAAA,CAAa,SAAQ,EAAG;AACjD,IAAA,MAAMC,QAAO,KAAA,GAAQ,CAAA;AACrB,IAAA,MAAM,YAAA,GAAe,kBAAkB,OAAA,GAAUA,KAAAA,CAAAA;AACjD,IAAA,MAAMD,MAAAA,GAAQ,KAAA,CAAM,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA,IAAK;AAAA,MACrC,QAAQ,GAAA,CAAI,MAAA;AAAA,MACZ,UAAA,EAAY;AAAA,KACd;AACA,IAAAA,OAAM,UAAA,IAAc,YAAA;AACpB,IAAAA,OAAM,YAAA,GAAeC,KAAAA;AACrB,IAAAD,MAAAA,CAAM,gBAAgB,GAAA,CAAI,KAAA;AAC1B,IAAA,IAAI,GAAA,CAAI,YAAY,MAAA,EAAW;AAC7B,MAAAA,MAAAA,CAAM,kBAAkB,GAAA,CAAI,OAAA;AAAA,IAC9B;AACA,IAAA,KAAA,CAAM,GAAA,CAAI,GAAA,CAAI,MAAA,EAAQA,MAAK,CAAA;AAAA,EAC7B;AAEA,EAAA,MAAM,SAAS,CAAC,GAAG,KAAA,CAAM,MAAA,EAAQ,CAAA,CAC9B,QAAA;AAAA,IACC,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,UAAA,GAAa,CAAA,CAAE,UAAA,IAAc,CAAA,CAAE,MAAA,CAAO,aAAA,CAAc,CAAA,CAAE,MAAM;AAAA,GAC1E,CACC,KAAA,CAAM,CAAA,EAAG,OAAA,CAAQ,KAAK,CAAA;AAEzB,EAAA,MAAM,MAAM,MAAA,CAAO,GAAA,CAAI,CAACA,MAAAA,KAAUA,OAAM,MAAM,CAAA;AAC9C,EAAA,MAAM,UAAU,MAAM,eAAA,CAAgB,OAAA,EAAS,OAAA,EAAS,UAAU,GAAG,CAAA;AAErE,EAAA,MAAM,OAA6B,EAAC;AACpC,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,KAAA,MAAWA,UAAS,MAAA,EAAQ;AAC1B,IAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,GAAA,CAAIA,MAAAA,CAAM,MAAM,CAAA;AACrC,IAAA,IAAI,CAAC,IAAA,EAAM;AACX,IAAA,MAAM,SAAA,GAAY,IAAA;AAClB,IAAA,MAAM,GAAA,GAA0B;AAAA,MAC9B,IAAA,EAAM,SAAA;AAAA,MACN,OAAOA,MAAAA,CAAM,UAAA;AAAA,MACb,IAAA;AAAA,MACA,GAAIA,MAAAA,CAAM,UAAA,KAAe,MAAA,IAAaA,MAAAA,CAAM,gBAAgB,MAAA,GAC1D;AAAA,QACE,MAAA,EAAQ;AAAA,UACN,IAAA,EAAM,SAAA;AAAA,UACN,OAAOA,MAAAA,CAAM,WAAA;AAAA,UACb,MAAMA,MAAAA,CAAM;AAAA;AACd,UAEF,EAAC;AAAA,MACH,GACEA,MAAAA,CAAM,YAAA,KAAiB,MAAA,IAAaA,MAAAA,CAAM,kBAAkB,MAAA,GAE5D;AAAA,QACE,QAAA,EAAU;AAAA,UACR,IAAA,EAAM,SAAA;AAAA,UACN,OAAOA,MAAAA,CAAM,aAAA;AAAA,UACb,MAAMA,MAAAA,CAAM,YAAA;AAAA,UACZ,GAAIA,OAAM,eAAA,KAAoB,MAAA,GAC5B,EAAC,GACD,EAAE,OAAA,EAASA,MAAAA,CAAM,eAAA;AAAgB;AACrC,UAEF;AAAC,KACL;AACA,IAAA,IAAA,CAAK,KAAK,GAAG,CAAA;AACb,IAAA,IAAA,IAAQ,CAAA;AAAA,EACV;AACA,EAAA,OAAO,IAAA;AACT;AASA,SAAS,cAAA,CAAe,UAA8B,KAAA,EAAqB;AACzE,EAAA,IAAI,aAAa,MAAA,EAAW;AAC5B,EAAA,IAAI,CAAC,MAAA,CAAO,SAAA,CAAU,QAAQ,CAAA,IAAK,YAAY,CAAA,EAAG;AAChD,IAAA,MAAM,IAAI,UAAA;AAAA,MACR,CAAA,EAAG,KAAK,CAAA,kCAAA,EAAqC,QAAQ,CAAA;AAAA,KACvD;AAAA,EACF;AACF;AASA,SAAS,cAAA,CACP,QAAA,EACA,MAAA,EACA,KAAA,EACM;AACN,EAAA,IAAI,aAAa,MAAA,EAAW;AAC5B,EAAA,oBAAA,CAAqB,QAAA,EAAU,QAAQ,KAAK,CAAA;AAC9C;AAUA,SAAS,2BAAA,CACP,OAAA,EACA,IAAA,EACA,OAAA,EAIA,KAAA,EACM;AACN,EAAA,IAAI,QAAQ,MAAA,KAAW,MAAA,IAAa,OAAA,CAAQ,MAAA,KAAW,KAAK,MAAA,EAAQ;AAClE,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,EAAG,KAAK,CAAA,UAAA,EAAa,OAAA,CAAQ,MAAM,iDAAiD,IAAA,CAAK,MAAM,CAAA,+EAAA,EAA6E,IAAA,CAAK,MAAM,CAAA,EAAA,CAAA;AAAA,MACvL,EAAE,OAAA,EAAS,OAAA,CAAQ,OAAA,EAAS,YAAY,QAAA;AAAS,KACnD;AAAA,EACF;AACA,EAAA,MAAM,SAAA,GAAY,OAAA,CAAQ,YAAA,CAAa,MAAA,EAAQ,OAAA;AAC/C,EAAA,IAAI,cAAc,MAAA,IAAa,CAAC,UAAU,QAAA,CAAS,IAAA,CAAK,MAAM,CAAA,EAAG;AAC/D,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,EAAG,KAAK,CAAA,WAAA,EAAc,OAAA,CAAQ,OAAO,CAAA,wBAAA,EAA2B,IAAA,CAAK,MAAM,CAAA,qBAAA,EAAwB,SAAA,CAAU,IAAA,CAAK,IAAI,CAAC,CAAA,EAAA,CAAA;AAAA,MACvH,EAAE,OAAA,EAAS,OAAA,CAAQ,OAAA,EAAS,YAAY,QAAA;AAAS,KACnD;AAAA,EACF;AACA,EAAA,IAAI,OAAA,CAAQ,cAAA,CAAe,MAAA,KAAW,IAAA,CAAK,UAAA,EAAY;AACrD,IAAA,MAAM,IAAI,UAAA;AAAA,MACR,CAAA,EAAG,KAAK,CAAA,qBAAA,EAAwB,OAAA,CAAQ,eAAe,MAAM,CAAA,kBAAA,EAAqB,KAAK,UAAU,CAAA,8BAAA;AAAA,KACnG;AAAA,EACF;AACF;AAoBA,SAAS,2BAAA,CACP,SACA,OAAA,EACM;AACN,EAAA,MAAM,WAAW,OAAA,CAAQ,gBAAA;AACzB,EAAA,MAAM,YAAA,GAAe,QAAQ,YAAA,CAAa,QAAA;AAE1C,EAAA,IAAI,OAAA,CAAQ,SAAS,MAAA,EAAW;AAC9B,IAAA,oBAAA,CAAqB,OAAA,EAAS,QAAA,EAAU,YAAA,EAAc,OAAA,CAAQ,IAAI,CAAA;AAAA,EACpE;AACA,EAAA,IAAI,OAAA,CAAQ,oBAAoB,IAAA,EAAM;AACpC,IAAA,wBAAA,CAAyB,OAAA,EAAS,UAAU,YAAY,CAAA;AAAA,EAC1D;AACA,EAAA,IAAI,OAAA,CAAQ,aAAa,MAAA,EAAW;AAClC,IAAA,8BAAA;AAAA,MACE,OAAA;AAAA,MACA,QAAA;AAAA,MACA,YAAA;AAAA,MACA,OAAA,CAAQ;AAAA,KACV;AAAA,EACF;AACF;AAEA,SAAS,oBAAA,CACP,OAAA,EACA,QAAA,EACA,YAAA,EACA,IAAA,EACM;AACN,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,IAAI,QAAA,CAAS,cAAA,CAAe,QAAA,CAAS,IAAI,CAAA,EAAG;AAC5C,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,SAAA,EAAY,OAAA,CAAQ,OAAO,CAAA,qBAAA,EAAwB,QAAA,CAAS,IAAI,CAAA,yBAAA,EACpC,IAAI,CAAA,oBAAA,EAAuB,QAAA,CAAS,cAAA,CAAe,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA;AAAA,MACzF;AAAA,QACE,SAAS,OAAA,CAAQ,OAAA;AAAA,QACjB,UAAU,QAAA,CAAS,IAAA;AAAA,QACnB,UAAA,EAAY,kBAAkB,IAAI,CAAA;AAAA;AACpC,KACF;AAAA,EACF;AACA,EAAA,IAAI,IAAA,KAAS,QAAA,IAAY,YAAA,IAAgB,CAAC,aAAa,aAAA,EAAe;AACpE,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,SAAA,EAAY,QAAQ,OAAO,CAAA,iCAAA,CAAA;AAAA,MAC3B,EAAE,OAAA,EAAS,OAAA,CAAQ,OAAA,EAAS,YAAY,wBAAA;AAAyB,KACnE;AAAA,EACF;AACF;AAEA,SAAS,wBAAA,CACP,OAAA,EACA,QAAA,EACA,YAAA,EACM;AACN,EAAA,MAAM,mBACJ,QAAA,KAAa,MAAA,GACX,YAAA,EAAc,YAAA,KAAiB,QAC/B,QAAA,CAAS,gBAAA;AACb,EAAA,IAAI,gBAAA,EAAkB;AACtB,EAAA,MAAM,IAAI,kBAAA;AAAA,IACR,CAAA,SAAA,EAAY,QAAQ,OAAO,CAAA,oHAAA,CAAA;AAAA,IAE3B,EAAE,OAAA,EAAS,OAAA,CAAQ,OAAA,EAAS,YAAY,uBAAA;AAAwB,GAClE;AACF;AAEA,SAAS,8BAAA,CACP,OAAA,EACA,QAAA,EACA,YAAA,EACA,QAAA,EACM;AACN,EAAA,IAAI,QAAA,KAAa,MAAA,IAAa,CAAC,QAAA,CAAS,wBAAA,EAA0B;AAChE,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,SAAA,EAAY,OAAA,CAAQ,OAAO,CAAA,qBAAA,EAAwB,SAAS,IAAI,CAAA,yLAAA,CAAA;AAAA,MAIhE;AAAA,QACE,SAAS,OAAA,CAAQ,OAAA;AAAA,QACjB,UAAU,QAAA,CAAS,IAAA;AAAA,QACnB,UAAA,EAAY;AAAA;AACd,KACF;AAAA,EACF;AACA,EAAA,IAAI,iBAAiB,MAAA,EAAW;AAC9B,IAAA,2BAAA,CAA4B,OAAA,CAAQ,OAAA,EAAS,YAAA,EAAc,QAAQ,CAAA;AAAA,EACrE;AACF;AAOA,SAAS,2BAAA,CACP,OAAA,EACA,YAAA,EACA,QAAA,EACM;AACN,EAAA,IAAI,YAAA,CAAa,SAAA,CAAU,MAAA,KAAW,CAAA,EAAG;AACzC,EAAA,IAAI,YAAA,CAAa,SAAA,CAAU,QAAA,CAAS,QAAQ,CAAA,EAAG;AAC/C,EAAA,IAAI,OAAO,OAAA,KAAY,WAAA,IAAe,OAAO,OAAA,CAAQ,SAAS,UAAA,EAAY;AACxE,IAAA;AAAA,EACF;AACA,EAAA,OAAA,CAAQ,IAAA;AAAA,IACN,CAAA,+BAAA,EAAkC,QAAQ,CAAA,6CAAA,EACxB,OAAO,MAAM,YAAA,CAAa,SAAA,CAAU,IAAA,CAAK,IAAI,CAAC,CAAA,8EAAA;AAAA,GAElE;AACF;AAEA,eAAe,eAAA,CACb,OAAA,EACA,OAAA,EACA,QAAA,EACA,GAAA,EAC4B;AAC5B,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,2BAAW,GAAA,EAAI;AACrC,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAkB;AAClC,EAAA,IAAI,QAAQ,QAAA,EAAU;AACpB,IAAA,MAAM,OAAO,MAAM,OAAA,CAAQ,QAAA,CAAS,OAAA,EAAS,UAAU,GAAG,CAAA;AAC1D,IAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AAItB,MAAA,IAAI,GAAA,CAAI,eAAe,MAAA,EAAW;AAClC,MAAA,GAAA,CAAI,GAAA,CAAI,GAAA,CAAI,EAAA,EAAI,SAAA,CAAU,GAAG,CAAC,CAAA;AAAA,IAChC;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AAGA,EAAA,KAAA,MAAW,MAAM,GAAA,EAAK;AACpB,IAAA,MAAM,MAAM,MAAM,OAAA,CAAQ,OAAA,CAAQ,OAAA,EAAS,UAAU,EAAE,CAAA;AACvD,IAAA,IAAI,GAAA,IAAO,GAAA,CAAI,UAAA,KAAe,MAAA,EAAW,GAAA,CAAI,IAAI,GAAA,CAAI,EAAA,EAAI,SAAA,CAAU,GAAG,CAAC,CAAA;AAAA,EACzE;AACA,EAAA,OAAO,GAAA;AACT;;;ACxoBO,IAAM,cAAN,MAAsC;AAAA,EAClC,QAAA;AAAA,EAET,YAAY,OAAA,EAA6B;AACvC,IAAA,IAAA,CAAK,QAAA,GAAW,OAAA;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,QAAA,CACJ,QAAA,EACA,OAAA,EAC0D;AAC1D,IAAA,IAAA,CAAK,sBAAsB,QAAQ,CAAA;AACnC,IAAA,OAAO,qBAAA;AAAA,MACL;AAAA,QACE,OAAA,EAAS,KAAK,QAAA,CAAS,OAAA;AAAA,QACvB,OAAA,EAAS,KAAK,QAAA,CAAS,OAAA;AAAA,QACvB,QAAA,EAAU,KAAK,QAAA,CAAS;AAAA,OAC1B;AAAA,MACA,QAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,MAAM,MAAA,CACJ,QAAA,EACA,OAAA,EACwD;AACxD,IAAA,IAAA,CAAK,sBAAsB,QAAQ,CAAA;AACnC,IAAA,OAAO,mBAAA;AAAA,MACL;AAAA,QACE,OAAA,EAAS,KAAK,QAAA,CAAS,OAAA;AAAA,QACvB,OAAA,EAAS,KAAK,QAAA,CAAS,OAAA;AAAA,QACvB,QAAA,EAAU,KAAK,QAAA,CAAS;AAAA,OAC1B;AAAA,MACA,QAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,MAAA,CACJ,QAAA,EACA,OAAA,EACwD;AACxD,IAAA,IAAA,CAAK,sBAAsB,QAAQ,CAAA;AACnC,IAAA,OAAO,mBAAA;AAAA,MACL;AAAA,QACE,OAAA,EAAS,KAAK,QAAA,CAAS,OAAA;AAAA,QACvB,OAAA,EAAS,KAAK,QAAA,CAAS,OAAA;AAAA,QACvB,QAAA,EAAU,KAAK,QAAA,CAAS;AAAA,OAC1B;AAAA,MACA,QAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAoBA,MAAM,eAAA,CACJ,QAAA,EACA,OAAA,GAAkC,EAAC,EACH;AAChC,IAAA,IAAI,QAAA,KAAa,MAAA,EAAW,IAAA,CAAK,qBAAA,CAAsB,QAAQ,CAAA;AAC/D,IAAA,OAAO,oBAAA;AAAA,MACL;AAAA,QACE,OAAA,EAAS,KAAK,QAAA,CAAS,OAAA;AAAA,QACvB,OAAA,EAAS,KAAK,QAAA,CAAS,OAAA;AAAA,QACvB,QAAA,EAAU,KAAK,QAAA,CAAS;AAAA,OAC1B;AAAA,MACA,QAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAAA,EAEA,sBAAsB,IAAA,EAAoB;AACxC,IAAA,IAAI,IAAA,CAAK,QAAA,CAAS,QAAA,CAAS,WAAA,CAAY,IAAI,CAAA,EAAG;AAC9C,IAAA,MAAM,IAAI,iBAAA,CAAkB,IAAA,EAAM,MAAA,EAAQ;AAAA,MACxC,OAAA,EAAS,KAAK,QAAA,CAAS,OAAA;AAAA,MACvB,UAAA,EACE;AAAA,KACH,CAAA;AAAA,EACH;AACF;;;ACpJO,SAAS,qBAAA,CACd,UACA,IAAA,EAC4B;AAC5B,EAAA,MAAM,eAAqC,EAAC;AAI5C,EAAA,MAAM,mBAAA,uBAA0B,GAAA,EAG9B;AAEF,EAAA,MAAM,kBAAA,GAAqB,CAACA,MAAAA,KAAoC;AAC9D,IAAA,YAAA,CAAa,KAAKA,MAAK,CAAA;AAAA,EACzB,CAAA;AACA,EAAA,MAAM,kBAAA,GAAqB,CACzB,MAAA,EACAA,MAAAA,KACS;AACT,IAAA,MAAM,GAAA,GAAM,CAAA,EAAG,MAAM,CAAA,CAAA,EAAIA,OAAM,IAAI,CAAA,CAAA;AACnC,IAAA,MAAM,aAAA,GAAgB,mBAAA,CAAoB,GAAA,CAAI,GAAG,CAAA;AACjD,IAAA,IAAI,kBAAkB,MAAA,EAAW;AAC/B,MAAA,mBAAA,CAAoB,IAAI,GAAA,EAAK;AAAA,QAC3B,MAAA;AAAA,QACA,UAAUA,MAAAA,CAAM,IAAA;AAAA,QAChB,OAAA,EAAS,CAACA,MAAK;AAAA,OAChB,CAAA;AAAA,IACH,CAAA,MAAO;AACL,MAAA,aAAA,CAAc,OAAA,CAAQ,KAAKA,MAAK,CAAA;AAAA,IAClC;AAAA,EACF,CAAA;AAEA,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,QAAQ,CAAA,IAAK,MAAA,CAAO,QAAQ,IAAA,CAAK,KAAA,IAAS,EAAE,CAAA,EAAG;AAC/D,IAAA,MAAM,YAAA,GAAe,QAAA,CAAS,KAAA,GAAQ,IAAI,CAAA;AAC1C,IAAA,IAAI,iBAAiB,MAAA,EAAW;AAChC,IAAA,YAAA,CAAa,IAAA,EAAM,cAAc,QAAA,EAAU;AAAA,MACzC,kBAAA;AAAA,MACA,kBAAA,EAAoB,CAACA,MAAAA,KAAU;AAC7B,QAAA,kBAAA,CAAmB,QAAQA,MAAK,CAAA;AAAA,MAClC;AAAA,KACD,CAAA;AAAA,EACH;AACA,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,QAAQ,CAAA,IAAK,MAAA,CAAO,QAAQ,IAAA,CAAK,KAAA,IAAS,EAAE,CAAA,EAAG;AAC/D,IAAA,MAAM,YAAA,GAAe,QAAA,CAAS,KAAA,GAAQ,IAAI,CAAA;AAC1C,IAAA,IAAI,iBAAiB,MAAA,EAAW;AAChC,IAAA,YAAA,CAAa,IAAA,EAAM,cAAc,QAAA,EAAU;AAAA,MACzC,kBAAA;AAAA,MACA,kBAAA,EAAoB,CAACA,MAAAA,KAAU;AAC7B,QAAA,kBAAA,CAAmB,QAAQA,MAAK,CAAA;AAAA,MAClC;AAAA,KACD,CAAA;AAAA,EACH;AAEA,EAAA,MAAM,eAAoC,EAAC;AAC3C,EAAA,KAAA,MAAW,KAAA,IAAS,mBAAA,CAAoB,MAAA,EAAO,EAAG;AAChD,IAAA,YAAA,CAAa,IAAA;AAAA,MACX,OAAO,MAAA,CAAO;AAAA,QACZ,QAAQ,KAAA,CAAM,MAAA;AAAA,QACd,UAAU,KAAA,CAAM,QAAA;AAAA,QAChB,SAAS,MAAA,CAAO,MAAA,CAAO,CAAC,GAAG,KAAA,CAAM,OAAO,CAAC;AAAA,OAC1C;AAAA,KACH;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,cAAc,YAAA,EAAa;AACtC;AASO,SAAS,4BAAA,CACd,cAAA,EACA,QAAA,EACA,OAAA,EACqC;AACrC,EAAA,MAAM,WAAiC,EAAC;AACxC,EAAA,KAAA,MAAWA,UAAS,QAAA,EAAU;AAC5B,IAAA,QAAA,CAAS,IAAA,CAAK,GAAGA,MAAAA,CAAM,OAAO,CAAA;AAAA,EAChC;AACA,EAAA,MAAM,MAAM,CAAC,GAAG,cAAA,CAAe,YAAA,EAAc,GAAG,QAAQ,CAAA;AACxD,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AAC7B,EAAA,OAAO,IAAI,uBAAA,CAAwB,GAAA,EAAK,OAAO,CAAA;AACjD;AAWA,SAAS,YAAA,CACP,IAAA,EACA,QAAA,EACA,IAAA,EACA,SAAA,EACM;AACN,EAAA,kBAAA,CAAmB,IAAA,EAAM,QAAA,CAAS,UAAA,EAAY,IAAA,CAAK,YAAY,SAAS,CAAA;AACxE,EAAA,cAAA,CAAe,IAAA,EAAM,SAAS,MAAA,IAAU,IAAI,IAAA,CAAK,MAAA,IAAU,EAAC,EAAG,SAAS,CAAA;AAE1E;AAEA,SAAS,YAAA,CACP,IAAA,EACA,QAAA,EACA,IAAA,EACA,SAAA,EACM;AACN,EAAA,kBAAA;AAAA,IACE,IAAA;AAAA,IACA,QAAA,CAAS,cAAc,EAAC;AAAA,IACxB,IAAA,CAAK,cAAc,EAAC;AAAA,IACpB;AAAA,GACF;AACA,EAAA,qBAAA,CAAsB,IAAA,EAAM,QAAA,EAAU,IAAA,EAAM,SAAS,CAAA;AACvD;AAEA,SAAS,qBAAA,CACP,IAAA,EACA,QAAA,EACA,IAAA,EACA,SAAA,EACM;AAMN,EAAA,MAAM,YAAA,GAAe,IAAI,GAAA,CAAI,QAAA,CAAS,IAAI,CAAA;AAC1C,EAAA,MAAM,UAAA,GAAa,IAAI,GAAA,CAAI,QAAA,CAAS,EAAE,CAAA;AACtC,EAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,IAAA,CAAK,IAAI,CAAA;AAClC,EAAA,MAAM,MAAA,GAAS,IAAI,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAE9B,EAAA,KAAA,MAAW,OAAA,IAAW,CAAC,GAAG,YAAY,CAAA,CAAE,MAAA;AAAA,IACtC,CAACA,MAAAA,KAAU,CAAC,QAAA,CAAS,IAAIA,MAAK;AAAA,GAChC,EAAG;AACD,IAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,MAC3B,IAAA;AAAA,MACA,IAAA,EAAM,wBAAA;AAAA,MACN,MAAA,EAAQ,YAAY,OAAO,CAAA,eAAA;AAAA,KAC5B,CAAA;AAAA,EACH;AACA,EAAA,KAAA,MAAW,OAAA,IAAW,CAAC,GAAG,UAAU,CAAA,CAAE,MAAA,CAAO,CAACA,MAAAA,KAAU,CAAC,MAAA,CAAO,GAAA,CAAIA,MAAK,CAAC,CAAA,EAAG;AAC3E,IAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,MAC3B,IAAA;AAAA,MACA,IAAA,EAAM,wBAAA;AAAA,MACN,MAAA,EAAQ,YAAY,OAAO,CAAA,aAAA;AAAA,KAC5B,CAAA;AAAA,EACH;AACF;AAMA,SAAS,kBAAA,CACP,IAAA,EACA,QAAA,EACA,IAAA,EACA,SAAA,EACM;AACN,EAAA,MAAM,gBAAgB,IAAI,GAAA,CAAI,MAAA,CAAO,IAAA,CAAK,QAAQ,CAAC,CAAA;AACnD,EAAA,MAAM,YAAY,IAAI,GAAA,CAAI,MAAA,CAAO,IAAA,CAAK,IAAI,CAAC,CAAA;AAG3C,EAAA,KAAA,MAAW,QAAQ,aAAA,EAAe;AAChC,IAAA,IAAI,CAAC,SAAA,CAAU,GAAA,CAAI,IAAI,CAAA,EAAG;AACxB,MAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,QAC3B,IAAA;AAAA,QACA,KAAA,EAAO,IAAA;AAAA,QACP,IAAA,EAAM;AAAA,OACP,CAAA;AAAA,IACH;AAAA,EACF;AAIA,EAAA,KAAA,MAAW,QAAQ,SAAA,EAAW;AAC5B,IAAA,IAAI,CAAC,aAAA,CAAc,GAAA,CAAI,IAAI,CAAA,EAAG;AAC5B,MAAA,MAAM,QAAA,GAAW,KAAK,IAAI,CAAA;AAC1B,MAAA,IAAI,QAAA,CAAS,aAAa,IAAA,EAAM;AAChC,MAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,QAC3B,IAAA;AAAA,QACA,KAAA,EAAO,IAAA;AAAA,QACP,IAAA,EAAM;AAAA,OACP,CAAA;AAAA,IACH;AAAA,EACF;AAGA,EAAA,KAAA,MAAW,QAAQ,aAAA,EAAe;AAChC,IAAA,IAAI,CAAC,SAAA,CAAU,GAAA,CAAI,IAAI,CAAA,EAAG;AAC1B,IAAA,gBAAA,CAAiB,IAAA,EAAM,MAAM,QAAA,CAAS,IAAI,GAAI,IAAA,CAAK,IAAI,GAAI,SAAS,CAAA;AAAA,EACtE;AACF;AAEA,SAAS,gBAAA,CACP,IAAA,EACA/B,MAAAA,EACA,QAAA,EACA,MACA,SAAA,EACM;AAEN,EAAA,IAAI,QAAA,CAAS,IAAA,KAAS,IAAA,CAAK,IAAA,EAAM;AAC/B,IAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,MAC3B,IAAA;AAAA,MACA,KAAA,EAAAA,MAAAA;AAAA,MACA,IAAA,EAAM,aAAA;AAAA,MACN,QAAQ,CAAA,EAAG,QAAA,CAAS,IAAI,CAAA,QAAA,EAAM,KAAK,IAAI,CAAA;AAAA,KACxC,CAAA;AACD,IAAA;AAAA,EACF;AAGA,EAAA,MAAM,WAAA,GAAc,SAAS,QAAA,KAAa,IAAA;AAC1C,EAAA,MAAM,UAAA,GAAa,KAAK,QAAA,KAAa,IAAA;AACrC,EAAA,IAAI,CAAC,eAAe,UAAA,EAAY,CAEhC,MAAA,IAAW,WAAA,IAAe,CAAC,UAAA,EAAY;AACrC,IAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,MAC3B,IAAA;AAAA,MACA,KAAA,EAAAA,MAAAA;AAAA,MACA,IAAA,EAAM,qBAAA;AAAA,MACN,MAAA,EAAQ;AAAA,KACT,CAAA;AAAA,EACH;AAOA,EAAA,QAAQ,SAAS,IAAA;AAAM,IACrB,KAAK,QAAA,EAAU;AACb,MAAA,cAAA;AAAA,QACE,IAAA;AAAA,QACAA,MAAAA;AAAA,QACA,QAAA;AAAA,QACA,IAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA;AAAA,IACF;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA,cAAA;AAAA,QACE,IAAA;AAAA,QACAA,MAAAA;AAAA,QACA,QAAA;AAAA,QACA,IAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA;AAAA,IACF;AAAA,IACA,KAAK,MAAA,EAAQ;AACX,MAAA,YAAA;AAAA,QACE,IAAA;AAAA,QACAA,MAAAA;AAAA,QACA,QAAA;AAAA,QACA,IAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA;AAAA,IACF;AAAA,IACA,KAAK,OAAA,EAAS;AACZ,MAAA,aAAA;AAAA,QACE,IAAA;AAAA,QACAA,MAAAA;AAAA,QACA,QAAA;AAAA,QACA,IAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA;AAAA,IACF;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA,cAAA;AAAA,QACE,IAAA;AAAA,QACAA,MAAAA;AAAA,QACA,QAAA;AAAA,QACA,IAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA;AAAA,IACF;AAIA;AAEJ;AAEA,SAAS,cAAA,CACP,IAAA,EACAA,MAAAA,EACA,QAAA,EACA,MACA,SAAA,EACM;AAEN,EAAA,IACE,QAAA,CAAS,SAAA,KAAc,IAAA,CAAK,SAAA,IAC5B,IAAA,CAAK,SAAA,KAAc,MAAA,KAClB,QAAA,CAAS,SAAA,KAAc,MAAA,IAAa,IAAA,CAAK,SAAA,GAAY,SAAS,SAAA,CAAA,EAC/D;AACA,IAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,MAC3B,IAAA;AAAA,MACA,KAAA,EAAAA,MAAAA;AAAA,MACA,IAAA,EAAM,oBAAA;AAAA,MACN,QAAQ,CAAA,WAAA,EAAc,QAAA,CAAS,aAAa,QAAQ,CAAA,QAAA,EAAM,KAAK,SAAS,CAAA;AAAA,KACzE,CAAA;AAAA,EACH;AACA,EAAA,IACE,QAAA,CAAS,SAAA,KAAc,IAAA,CAAK,SAAA,IAC5B,IAAA,CAAK,SAAA,KAAc,MAAA,KAClB,QAAA,CAAS,SAAA,KAAc,MAAA,IAAa,IAAA,CAAK,SAAA,GAAY,SAAS,SAAA,CAAA,EAC/D;AACA,IAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,MAC3B,IAAA;AAAA,MACA,KAAA,EAAAA,MAAAA;AAAA,MACA,IAAA,EAAM,oBAAA;AAAA,MACN,QAAQ,CAAA,WAAA,EAAc,QAAA,CAAS,aAAa,QAAQ,CAAA,QAAA,EAAM,KAAK,SAAS,CAAA;AAAA,KACzE,CAAA;AAAA,EACH;AAEA,EAAA,IAAI,QAAA,CAAS,OAAA,KAAY,IAAA,CAAK,OAAA,EAAS;AACrC,IAAA,IAAI,QAAA,CAAS,OAAA,KAAY,MAAA,IAAa,IAAA,CAAK,YAAY,MAAA,EAAW;AAChE,MAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,QAC3B,IAAA;AAAA,QACA,KAAA,EAAAA,MAAAA;AAAA,QACA,IAAA,EAAM,aAAA;AAAA,QACN,QAAQ,IAAA,CAAK;AAAA,OACd,CAAA;AAAA,IACH,WAAW,QAAA,CAAS,OAAA,KAAY,MAAA,IAAa,IAAA,CAAK,YAAY,MAAA,EAAW,CAEzE,MAAA,IACE,QAAA,CAAS,OAAA,KAAY,MAAA,IACrB,IAAA,CAAK,YAAY,MAAA,IACjB,QAAA,CAAS,OAAA,KAAY,IAAA,CAAK,OAAA,EAC1B;AACA,MAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,QAC3B,IAAA;AAAA,QACA,KAAA,EAAAA,MAAAA;AAAA,QACA,IAAA,EAAM,gBAAA;AAAA,QACN,QAAQ,CAAA,EAAG,QAAA,CAAS,OAAO,CAAA,QAAA,EAAM,KAAK,OAAO,CAAA;AAAA,OAC9C,CAAA;AAAA,IACH;AAAA,EACF;AAEA,EAAA,IAAI,QAAA,CAAS,MAAA,KAAW,IAAA,CAAK,MAAA,EAAQ;AACnC,IAAA,IAAI,QAAA,CAAS,MAAA,KAAW,MAAA,IAAa,IAAA,CAAK,WAAW,MAAA,EAAW;AAC9D,MAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,QAC3B,IAAA;AAAA,QACA,KAAA,EAAAA,MAAAA;AAAA,QACA,IAAA,EAAM,YAAA;AAAA,QACN,QAAQ,IAAA,CAAK;AAAA,OACd,CAAA;AAAA,IACH,WAAW,QAAA,CAAS,MAAA,KAAW,MAAA,IAAa,IAAA,CAAK,WAAW,MAAA,EAAW,CAEvE,MAAO;AACL,MAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,QAC3B,IAAA;AAAA,QACA,KAAA,EAAAA,MAAAA;AAAA,QACA,IAAA,EAAM,eAAA;AAAA,QACN,QAAQ,CAAA,EAAG,QAAA,CAAS,MAAM,CAAA,QAAA,EAAM,KAAK,MAAM,CAAA;AAAA,OAC5C,CAAA;AAAA,IACH;AAAA,EACF;AACF;AAEA,SAAS,cAAA,CACP,IAAA,EACAA,MAAAA,EACA,QAAA,EACA,MACA,SAAA,EACM;AACN,EAAA,IACE,IAAA,CAAK,QAAQ,MAAA,KACZ,QAAA,CAAS,QAAQ,MAAA,IAAa,IAAA,CAAK,GAAA,GAAM,QAAA,CAAS,GAAA,CAAA,EACnD;AACA,IAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,MAC3B,IAAA;AAAA,MACA,KAAA,EAAAA,MAAAA;AAAA,MACA,IAAA,EAAM,oBAAA;AAAA,MACN,QAAQ,CAAA,KAAA,EAAQ,QAAA,CAAS,OAAO,QAAQ,CAAA,QAAA,EAAM,KAAK,GAAG,CAAA;AAAA,KACvD,CAAA;AAAA,EACH;AACA,EAAA,IACE,IAAA,CAAK,QAAQ,MAAA,KACZ,QAAA,CAAS,QAAQ,MAAA,IAAa,IAAA,CAAK,GAAA,GAAM,QAAA,CAAS,GAAA,CAAA,EACnD;AACA,IAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,MAC3B,IAAA;AAAA,MACA,KAAA,EAAAA,MAAAA;AAAA,MACA,IAAA,EAAM,oBAAA;AAAA,MACN,QAAQ,CAAA,KAAA,EAAQ,QAAA,CAAS,OAAO,QAAQ,CAAA,QAAA,EAAM,KAAK,GAAG,CAAA;AAAA,KACvD,CAAA;AAAA,EACH;AACA,EAAA,IAAI,QAAA,CAAS,QAAQ,IAAA,CAAK,GAAA,IAAO,KAAK,GAAA,KAAQ,IAAA,IAAQ,QAAA,CAAS,GAAA,KAAQ,IAAA,EAAM;AAC3E,IAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,MAC3B,IAAA;AAAA,MACA,KAAA,EAAAA,MAAAA;AAAA,MACA,IAAA,EAAM,aAAA;AAAA,MACN,MAAA,EAAQ;AAAA,KACT,CAAA;AAAA,EACH;AAEF;AAEA,SAAS,YAAA,CACP,IAAA,EACAA,MAAAA,EACA,QAAA,EACA,MACA,SAAA,EACM;AACN,EAAA,MAAM,UAAA,GAAa,IAAI,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AACtC,EAAA,MAAM,OAAA,GAAU,QAAA,CAAS,MAAA,CAAO,MAAA,CAAO,CAAC,UAAU,CAAC,UAAA,CAAW,GAAA,CAAI,KAAK,CAAC,CAAA;AACxE,EAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtB,IAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,MAC3B,IAAA;AAAA,MACA,KAAA,EAAAA,MAAAA;AAAA,MACA,IAAA,EAAM,cAAA;AAAA,MACN,MAAA,EAAQ,CAAA,gBAAA,EAAmB,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,KAC9C,CAAA;AAAA,EACH;AAEF;AAEA,SAAS,aAAA,CACP,IAAA,EACAA,MAAAA,EACA,QAAA,EACA,MACA,SAAA,EACM;AAGN,EAAA,IAAI,QAAA,CAAS,KAAA,CAAM,IAAA,KAAS,IAAA,CAAK,MAAM,IAAA,EAAM;AAC3C,IAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,MAC3B,IAAA;AAAA,MACA,KAAA,EAAO,GAAGA,MAAK,CAAA,MAAA,CAAA;AAAA,MACf,IAAA,EAAM,aAAA;AAAA,MACN,MAAA,EAAQ,GAAG,QAAA,CAAS,KAAA,CAAM,IAAI,CAAA,QAAA,EAAM,IAAA,CAAK,MAAM,IAAI,CAAA;AAAA,KACpD,CAAA;AACD,IAAA;AAAA,EACF;AACA,EAAA,gBAAA;AAAA,IACE,IAAA;AAAA,IACA,GAAGA,MAAK,CAAA,MAAA,CAAA;AAAA,IACR,QAAA,CAAS,KAAA;AAAA,IACT,IAAA,CAAK,KAAA;AAAA,IACL;AAAA,GACF;AACF;AAEA,SAAS,cAAA,CACP,IAAA,EACAA,MAAAA,EACA,QAAA,EACA,MACA,SAAA,EACM;AAGN,EAAA,kBAAA,CAAmB,IAAA,EAAM,QAAA,CAAS,UAAA,EAAY,IAAA,CAAK,UAAA,EAAY;AAAA,IAC7D,kBAAA,EAAoB,CAAC+B,MAAAA,KAAU;AAC7B,MAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,QAC3B,GAAGA,MAAAA;AAAA,QACH,OAAO,CAAA,EAAG/B,MAAK,CAAA,CAAA,EAAI+B,MAAAA,CAAM,SAAS,EAAE,CAAA;AAAA,OACrC,CAAA;AAAA,IACH,CAAA;AAAA,IACA,kBAAA,EAAoB,CAACA,MAAAA,KAAU;AAC7B,MAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,QAC3B,GAAGA,MAAAA;AAAA,QACH,OAAO,CAAA,EAAG/B,MAAK,CAAA,CAAA,EAAI+B,MAAAA,CAAM,SAAS,EAAE,CAAA;AAAA,OACrC,CAAA;AAAA,IACH;AAAA,GACD,CAAA;AACH;AAMA,SAAS,cAAA,CACP,IAAA,EACA,QAAA,EACA,IAAA,EACA,SAAA,EACM;AACN,EAAA,MAAM,iBAAiB,IAAI,GAAA;AAAA,IACzB,QAAA,CAAS,IAAI,CAAC,UAAA,KAAe,CAAC,UAAA,CAAW,IAAA,EAAM,UAAU,CAAC;AAAA,GAC5D;AACA,EAAA,MAAM,aAAa,IAAI,GAAA;AAAA,IACrB,IAAA,CAAK,IAAI,CAAC,UAAA,KAAe,CAAC,UAAA,CAAW,IAAA,EAAM,UAAU,CAAC;AAAA,GACxD;AACA,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,UAAU,CAAA,IAAK,UAAA,EAAY;AAC3C,IAAA,IAAI,CAAC,cAAA,CAAe,GAAA,CAAI,IAAI,CAAA,EAAG;AAE7B,MAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,QAC3B,IAAA;AAAA,QACA,IAAA,EAAM,yBAAA;AAAA,QACN,MAAA,EAAQ,sBAAsB,IAAI,CAAA,MAAA,EAAS,WAAW,MAAA,CAAO,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA;AAAA,OACxE,CAAA;AAAA,IACH;AAAA,EACF;AAIA,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,UAAU,CAAA,IAAK,cAAA,EAAgB;AAC/C,IAAA,MAAM,MAAA,GAAS,UAAA,CAAW,GAAA,CAAI,IAAI,CAAA;AAClC,IAAA,IAAI,WAAW,MAAA,EAAW;AAM1B,IAAA,MAAM,EAAE,IAAA,EAAM,aAAA,EAAe,GAAG,eAAc,GAAI,UAAA;AAClD,IAAA,MAAM,EAAE,IAAA,EAAM,SAAA,EAAW,GAAG,WAAU,GAAI,MAAA;AAC1C,IAAA,IAAI,CAAC,cAAA,CAAe,aAAA,EAAe,SAAS,CAAA,EAAG;AAC7C,MAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,QAC3B,IAAA;AAAA,QACA,IAAA,EAAM,yBAAA;AAAA,QACN,MAAA,EAAQ,sBAAsB,IAAI,CAAA,UAAA;AAAA,OACnC,CAAA;AAAA,IACH;AAAA,EACF;AACF;;;ACzhBO,SAAS,YAAA,CACd,OACA,KAAA,EACa;AACb,EAAA,MAAM,WAAW,KAAA,CAAM,SAAA;AACvB,EAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,KAAK,CAAA;AAC9B,EAAA,IAAI,QAAA,CAAS,SAAS,CAAA,EAAG;AACvB,IAAA,OAAO,EAAE,QAAA,EAAU,gBAAA,EAAkB,EAAC,EAAG,gBAAA,EAAkB,EAAC,EAAE;AAAA,EAChE;AAEA,EAAA,MAAM,EAAE,KAAA,EAAO,gBAAA,EAAkB,OAAO,gBAAA,EAAiB,GACvD,mBAAmB,QAAQ,CAAA;AAC7B,EAAA,MAAM,uBAAuB,IAAI,GAAA;AAAA,IAC/B,MAAA,CAAO,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA,CAAE,MAAA,CAAO,CAAC,IAAA,KAAS,CAAC,gBAAA,CAAiB,GAAA,CAAI,IAAI,CAAC;AAAA,GACvE;AACA,EAAA,MAAM,uBAAuB,IAAI,GAAA;AAAA,IAC/B,MAAA,CAAO,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA,CAAE,MAAA,CAAO,CAAC,IAAA,KAAS,CAAC,gBAAA,CAAiB,GAAA,CAAI,IAAI,CAAC;AAAA,GACvE;AAIA,EAAA,KAAA,MAAW,QAAQ,QAAA,EAAU;AAC3B,IAAA,IAAI,oBAAA,CAAqB,GAAA,CAAI,IAAI,CAAA,EAAG;AAClC,MAAA,MAAM,IAAI,0BAAA,CAA2B,IAAA,EAAM,MAAA,EAAQ,MAAM,EAAE,CAAA;AAAA,IAC7D;AACA,IAAA,IAAI,oBAAA,CAAqB,GAAA,CAAI,IAAI,CAAA,EAAG;AAClC,MAAA,MAAM,IAAI,0BAAA,CAA2B,IAAA,EAAM,MAAA,EAAQ,MAAM,EAAE,CAAA;AAAA,IAC7D;AAAA,EACF;AAEA,EAAA,MAAM,gBAAA,GAAmB,CAAC,GAAG,QAAQ,CAAA,CAAE,MAAA;AAAA,IAAO,CAAC,IAAA,KAC7C,gBAAA,CAAiB,GAAA,CAAI,IAAI;AAAA,GAC3B;AACA,EAAA,MAAM,0BAAA,GAA6B,CAAC,GAAG,QAAQ,CAAA,CAAE,MAAA;AAAA,IAAO,CAAC,IAAA,KACvD,gBAAA,CAAiB,GAAA,CAAI,IAAI;AAAA,GAC3B;AAQA,EAAA,MAAM,eAAA,GAAkB,6BAAA;AAAA,IACtB,KAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,KAAA,MAAW,YAAY,gBAAA,EAAkB;AACvC,IAAA,MAAM,SAAA,GAAY,eAAA,CAAgB,GAAA,CAAI,QAAQ,CAAA;AAC9C,IAAA,IAAI,SAAA,KAAc,MAAA,IAAa,SAAA,CAAU,MAAA,GAAS,CAAA,EAAG;AACnD,MAAA,MAAM,IAAI,qBAAA,CAAsB,QAAA,EAAU,SAAA,EAAW,MAAM,EAAE,CAAA;AAAA,IAC/D;AAAA,EACF;AAEA,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,OAAO;AAAA,MACL,QAAA,EAAU,MAAA;AAAA,MACV,kBAAkB,EAAC;AAAA,MACnB,kBAAkB;AAAC,KACrB;AAAA,EACF;AAKA,EAAA,MAAM,mBAAA,GAAsB,IAAI,GAAA,CAAI,gBAAgB,CAAA;AACpD,EAAA,MAAM,6BAAA,GAAgC,IAAI,GAAA,CAAI,0BAA0B,CAAA;AACxE,EAAA,MAAM,YAAA,uBAAmB,GAAA,EAAY;AACrC,EAAA,MAAM,eAAiD,EAAC;AAExD,EAAA,KAAA,MAAW,CAAC,QAAA,EAAU,YAAY,CAAA,IAAK,MAAA,CAAO,QAAQ,QAAA,CAAS,KAAA,IAAS,EAAE,CAAA,EAAG;AAC3E,IAAA,IAAI,6BAAA,CAA8B,GAAA,CAAI,QAAQ,CAAA,EAAG;AAC/C,MAAA,YAAA,CAAa,IAAI,QAAQ,CAAA;AACzB,MAAA;AAAA,IACF;AACA,IAAA,MAAM,OAAA,GAAU,aAAa,IAAA,CAAK,MAAA;AAAA,MAChC,CAAC,IAAA,KAAS,CAAC,mBAAA,CAAoB,IAAI,IAAI;AAAA,KACzC;AACA,IAAA,MAAM,KAAA,GAAQ,aAAa,EAAA,CAAG,MAAA;AAAA,MAC5B,CAAC,IAAA,KAAS,CAAC,mBAAA,CAAoB,IAAI,IAAI;AAAA,KACzC;AACA,IAAA,IAAI,OAAA,CAAQ,MAAA,KAAW,CAAA,IAAK,KAAA,CAAM,WAAW,CAAA,EAAG;AAC9C,MAAA,YAAA,CAAa,IAAI,QAAQ,CAAA;AACzB,MAAA;AAAA,IACF;AACA,IAAA,YAAA,CAAa,QAAQ,CAAA,GAAI;AAAA,MACvB,GAAG,YAAA;AAAA,MACH,IAAA,EAAM,OAAA;AAAA,MACN,EAAA,EAAI;AAAA,KACN;AAAA,EACF;AAGA,EAAA,MAAM,eAAiD,EAAC;AACxD,EAAA,KAAA,MAAW,CAAC,QAAA,EAAU,YAAY,CAAA,IAAK,MAAA,CAAO,QAAQ,QAAA,CAAS,KAAA,IAAS,EAAE,CAAA,EAAG;AAC3E,IAAA,IAAI,mBAAA,CAAoB,GAAA,CAAI,QAAQ,CAAA,EAAG;AACvC,IAAA,YAAA,CAAa,QAAQ,CAAA,GAAI,YAAA;AAAA,EAC3B;AAMA,EAAA,MAAM,iBAAA,GAAA,CACJ,QAAA,CAAS,QAAA,IAAY,EAAC,EACtB,MAAA;AAAA,IACA,CAAC,QAAA,KACC,CAAC,mBAAA,CAAoB,GAAA,CAAI,QAAA,CAAS,IAAI,CAAA,IACtC,CAAC,mBAAA,CAAoB,GAAA,CAAI,QAAA,CAAS,EAAE;AAAA,GACxC;AAOA,EAAA,MAAM,eAAA,uBAAsB,GAAA,CAAI;AAAA,IAC9B,GAAG,mBAAA;AAAA,IACH,GAAG,YAAA;AAAA,IACH,GAAG;AAAA,GACJ,CAAA;AACD,EAAA,MAAM,gBAAA,GAAA,CAAsC,QAAA,CAAS,OAAA,IAAW,EAAC,EAAG,MAAA;AAAA,IAClE,CAAC,KAAA,KAAU,CAAC,eAAA,CAAgB,GAAA,CAAI,MAAM,IAAI;AAAA,GAC5C;AAEA,EAAA,MAAM,WAAA,GAA8B,OAAO,MAAA,CAAO;AAAA,IAChD,GAAI,SAAS,OAAA,KAAY,MAAA,GAAY,EAAC,GAAI,EAAE,OAAA,EAAS,QAAA,CAAS,OAAA,EAAQ;AAAA,IACtE,GAAI,MAAA,CAAO,IAAA,CAAK,YAAY,CAAA,CAAE,MAAA,KAAW,CAAA,GAAI,EAAC,GAAI,EAAE,KAAA,EAAO,YAAA,EAAa;AAAA,IACxE,GAAI,MAAA,CAAO,IAAA,CAAK,YAAY,CAAA,CAAE,MAAA,KAAW,CAAA,GAAI,EAAC,GAAI,EAAE,KAAA,EAAO,YAAA,EAAa;AAAA,IACxE,GAAI,kBAAkB,MAAA,KAAW,CAAA,GAAI,EAAC,GAAI,EAAE,UAAU,iBAAA,EAAkB;AAAA,IACxE,GAAI,iBAAiB,MAAA,KAAW,CAAA,GAAI,EAAC,GAAI,EAAE,SAAS,gBAAA;AAAiB,GACtE,CAAA;AAED,EAAA,OAAO;AAAA,IACL,QAAA,EAAU,WAAA;AAAA,IACV,gBAAA;AAAA,IACA,gBAAA,EAAkB;AAAA,MAChB,GAAG,0BAAA;AAAA,MACH,GAAG,CAAC,GAAG,YAAY,CAAA,CAAE,MAAA;AAAA,QACnB,CAAC,IAAA,KAAS,CAAC,6BAAA,CAA8B,IAAI,IAAI;AAAA;AACnD;AACF,GACF;AACF;AAYO,SAAS,oBAAwC,KAAA,EAAa;AACnE,EAAA,MAAM,WAAW,KAAA,CAAM,SAAA;AACvB,EAAA,IAAI,QAAA,KAAa,QAAW,OAAO,KAAA;AACnC,EAAA,MAAM,EAAE,KAAA,EAAO,gBAAA,EAAkB,OAAO,gBAAA,EAAiB,GACvD,mBAAmB,QAAQ,CAAA;AAC7B,EAAA,MAAM,mBAAA,GAAsB,kCAAkC,QAAQ,CAAA;AAEtE,EAAA,MAAM,eAA6D,EAAC;AACpE,EAAA,KAAA,MAAW,CAAC,MAAM,YAAY,CAAA,IAAK,OAAO,OAAA,CAAQ,KAAA,CAAM,KAAK,CAAA,EAAG;AAC9D,IAAA,IAAI,gBAAA,CAAiB,GAAA,CAAI,IAAI,CAAA,EAAG;AAChC,IAAA,YAAA,CAAa,IAAI,CAAA,GAAI,YAAA;AAAA,EACvB;AACA,EAAA,MAAM,eAA6D,EAAC;AACpE,EAAA,KAAA,MAAW,CAAC,MAAM,YAAY,CAAA,IAAK,OAAO,OAAA,CAAQ,KAAA,CAAM,KAAK,CAAA,EAAG;AAC9D,IAAA,IAAI,gBAAA,CAAiB,GAAA,CAAI,IAAI,CAAA,EAAG;AAChC,IAAA,YAAA,CAAa,IAAI,CAAA,GAAI,YAAA;AAAA,EACvB;AACA,EAAA,MAAM,eAAA,GAAkB,MAAM,QAAA,CAAS,MAAA;AAAA,IACrC,CAAC,QAAA,KAAa,CAAC,oBAAoB,GAAA,CAAI,sBAAA,CAAuB,QAAQ,CAAC;AAAA,GACzE;AAGA,EAAA,MAAM,cAAA,GAAA,CAAkB,KAAA,CAAM,OAAA,IAAW,EAAC,EAAG,MAAA;AAAA,IAC3C,CAAC,KAAA,KAAU,KAAA,CAAM,MAAA,KAAW;AAAA,GAC9B;AAEA,EAAA,OAAO,OAAO,MAAA,CAAO;AAAA,IACnB,GAAG,KAAA;AAAA,IACH,KAAA,EAAO,YAAA;AAAA,IACP,KAAA,EAAO,YAAA;AAAA,IACP,QAAA,EAAU,eAAA;AAAA,IACV,OAAA,EAAS,cAAA,CAAe,MAAA,KAAW,CAAA,GAAI,MAAA,GAAY,cAAA;AAAA,IACnD,SAAA,EAAW;AAAA,GACZ,CAAA;AACH;AAQA,SAAS,6BAAA,CACP,OACA,gBAAA,EAC8C;AAC9C,EAAA,MAAM,KAAA,uBAAY,GAAA,EAA4B;AAC9C,EAAA,MAAM,MAAA,GAAS,CAAC,QAAA,EAAkB,QAAA,KAAiC;AACjE,IAAA,MAAM,QAAA,GAAW,KAAA,CAAM,GAAA,CAAI,QAAQ,CAAA;AACnC,IAAA,IAAI,aAAa,MAAA,EAAW,KAAA,CAAM,IAAI,QAAA,EAAU,CAAC,QAAQ,CAAC,CAAA;AAAA,SACrD,QAAA,CAAS,KAAK,QAAQ,CAAA;AAAA,EAC7B,CAAA;AAEA,EAAA,KAAA,MAAW,CAAC,UAAU,YAAY,CAAA,IAAK,OAAO,OAAA,CAAQ,KAAA,CAAM,KAAK,CAAA,EAAG;AAClE,IAAA,IAAI,gBAAA,CAAiB,GAAA,CAAI,QAAQ,CAAA,EAAG;AACpC,IAAA,MAAM,GAAA,GAAM,YAAA;AAIZ,IAAA,MAAM,QAAA,GAAyB;AAAA,MAC7B,IAAA,EAAM,mBAAA;AAAA,MACN,IAAA,EAAM;AAAA,KACR;AACA,IAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,IAAA,KAAA,MAAW,QAAA,IAAY,GAAA,CAAI,IAAA,IAAQ,EAAC,EAAG;AACrC,MAAA,IAAI,IAAA,CAAK,GAAA,CAAI,QAAA,CAAS,IAAI,CAAA,EAAG;AAC7B,MAAA,IAAA,CAAK,GAAA,CAAI,SAAS,IAAI,CAAA;AACtB,MAAA,MAAA,CAAO,QAAA,CAAS,MAAM,QAAQ,CAAA;AAAA,IAChC;AACA,IAAA,KAAA,MAAW,QAAA,IAAY,GAAA,CAAI,EAAA,IAAM,EAAC,EAAG;AACnC,MAAA,IAAI,IAAA,CAAK,GAAA,CAAI,QAAA,CAAS,IAAI,CAAA,EAAG;AAC7B,MAAA,IAAA,CAAK,GAAA,CAAI,SAAS,IAAI,CAAA;AACtB,MAAA,MAAA,CAAO,QAAA,CAAS,MAAM,QAAQ,CAAA;AAAA,IAChC;AAAA,EACF;AAEA,EAAA,MAAM,mBAAA,GAAsB,iCAAA;AAAA,IAC1B,KAAA,CAAM;AAAA,GACR;AACA,EAAA,KAAA,MAAW,QAAA,IAAY,MAAM,QAAA,EAAU;AACrC,IAAA,IAAI,mBAAA,CAAoB,GAAA,CAAI,sBAAA,CAAuB,QAAQ,CAAC,CAAA,EAAG;AAC/D,IAAA,MAAM,QAAA,GAAW,WAAA,CAAY,QAAA,CAAS,IAAI,CAAA;AAC1C,IAAA,MAAM,MAAA,GAAS,WAAA,CAAY,QAAA,CAAS,EAAE,CAAA;AACtC,IAAA,MAAM,QAAA,GAAyB;AAAA,MAC7B,IAAA,EAAM,uBAAA;AAAA,MACN,IAAA,EAAM,GAAG,QAAA,CAAS,QAAA,CAAS,IAAI,CAAA,CAAA,EAAI,QAAQ,KAAK,MAAM,CAAA,CAAA;AAAA,KACxD;AACA,IAAA,MAAA,CAAO,UAAU,QAAQ,CAAA;AACzB,IAAA,IAAI,MAAA,KAAW,QAAA,EAAU,MAAA,CAAO,MAAA,EAAQ,QAAQ,CAAA;AAAA,EAClD;AAEA,EAAA,OAAO,KAAA;AACT;;;AClRO,SAAS,kBAAsC,KAAA,EAAwB;AAE5E,EAAA,MAAM,SAAA,GAAY,iBAAiB,KAAK,CAAA;AAGxC,EAAA,MAAM,SAAA,GAAY,iBAAiB,KAAK,CAAA;AAGxC,EAAA,MAAM,QAAA,GACJ,MAAM,QAAA,CAAS,MAAA,GAAS,IACtB,2BAAA,CAA4B,KAAA,CAAM,QAAQ,CAAA,GAC1C,mBAAA,EAAoB;AAExB,EAAA,OAAO,IAAI,YAAA,CAAa,SAAA,EAAW,SAAA,EAAW,QAAQ,CAAA;AACxD;AASA,SAAS,iBACP,KAAA,EAC+B;AAC/B,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAsB;AAEzC,EAAA,KAAA,MAAW,QAAA,IAAY,YAAA,CAAa,KAAK,CAAA,EAAG;AAC1C,IAAA,MAAM,YAAA,GAAe,KAAA,CAAM,KAAA,CAAM,QAAQ,CAAA;AACzC,IAAA,MAAA,CAAO,GAAA,CAAI,QAAA,EAAU,YAAA,CAAa,IAAI,CAAA;AAAA,EACxC;AAEA,EAAA,OAAO,MAAA;AACT;AASA,SAAS,iBACP,KAAA,EACkC;AAClC,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAyB;AAE5C,EAAA,KAAA,MAAW,QAAA,IAAY,YAAA,CAAa,KAAK,CAAA,EAAG;AAC1C,IAAA,MAAM,YAAA,GAAe,KAAA,CAAM,KAAA,CAAM,QAAQ,CAAA;AACzC,IAAA,MAAA,CAAO,GAAA,CAAI,QAAA,EAAU,YAAA,CAAa,IAAI,CAAA;AAAA,EACxC;AAEA,EAAA,OAAO,MAAA;AACT;;;ACnFO,IAAM,0BAAA,GAA6B,EAAA;AACnC,IAAM,sBAAA,GAAyB,CAAA;AA6B/B,SAAS,sBAAA,CACd,KACA,OAAA,EACyD;AACzD,EAAA,MAAM,EAAE,OAAM,GAAI,qBAAA;AAAA,IAChB,OAAA,CAAQ,gBAAgB,GAAA,CAAI,mBAAA;AAAA,IAC5B,OAAA,CAAQ;AAAA,GACV;AACA,EAAA,OAAO;AAAA,IACL,cAAc,KAAA,CAAM,IAAA;AAAA,IACpB,GAAI,KAAA,CAAM,IAAA,KAAS,UAAa,EAAE,IAAA,EAAM,MAAM,IAAA;AAAK,GACrD;AACF;AAQO,SAAS,qBAAA,CACd,GAAA,EACA,OAAA,EACA,UAAA,EAC0C;AAC1C,EAAA,MAAM,QAAA,GAAW,sBAAA,CAAuB,GAAA,EAAK,OAAO,CAAA;AACpD,EAAA,MAAM,aAAA,GAAuC;AAAA,IAC3C,MAAM,QAAA,CAAS,YAAA;AAAA,IACf,MAAM,QAAA,CAAS,IAAA;AAAA,IACf,UAAA;AAAA,IACA,gBAAA,EAAkB,GAAA,CAAI,OAAA,CAAQ,gBAAA;AAAiB,GACjD;AACA,EAAA,OAAO,sBAAsB,aAAa,CAAA;AAC5C;AAEO,SAAS,cAAA,CACd,UAAA,EACA,QAAA,EACA,UAAA,EACQ;AACR,EAAA,MAAM,QAAQ,UAAA,IAAc,QAAA;AAE5B,EAAA,IAAI,CAAC,OAAO,QAAA,CAAS,KAAK,KAAK,CAAC,MAAA,CAAO,SAAA,CAAU,KAAK,CAAA,EAAG;AACvD,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,gBAAA,EAAmB,UAAU,CAAA,+BAAA,EAAkC,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,MAC5E,EAAE,MAAA,EAAQ,UAAA,EAAY,KAAA;AAAM,KAC9B;AAAA,EACF;AAEA,EAAA,IAAI,QAAQ,CAAA,EAAG;AACb,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,gBAAA,EAAmB,UAAU,CAAA,yBAAA,EAA4B,KAAK,CAAA,CAAA,CAAA;AAAA,MAC9D,EAAE,MAAA,EAAQ,UAAA,EAAY,KAAA;AAAM,KAC9B;AAAA,EACF;AAEA,EAAA,IAAI,QAAQ,4BAAA,EAA8B;AACxC,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,gBAAA,EAAmB,UAAU,CAAA,EAAA,EAAK,KAAK,4BAA4B,4BAA4B,CAAA,CAAA,CAAA;AAAA,MAC/F,EAAE,MAAA,EAAQ,UAAA,EAAY,KAAA,EAAO,OAAO,4BAAA;AAA6B,KACnE;AAAA,EACF;AAEA,EAAA,OAAO,KAAA;AACT;AAEO,SAAS,gBAAgB,KAAA,EAAgC;AAC9D,EAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AACtB,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,2DAAA,CAAA;AAAA,MACA,EAAE,KAAA;AAAM,KACV;AAAA,EACF;AACF;;;ACpGA,eAAsB,aAAA,CACpB,GAAA,EACA,MAAA,EACA,OAAA,GAAiC,EAAC,EACjB;AACjB,EAAA,MAAM,SAAA,GAAY,QAAQ,SAAA,IAAa,MAAA;AAEvC,EAAA,MAAM,YAAA,GAAsB;AAAA,IAC1B5B,GAAAA,CAAAA,WAAAA,EAAiB,IAAI,OAAO,CAAA,CAAA;AAAA,IAC5B,qBAAA,CAAsB,KAAK,OAAO,CAAA;AAAA,IAClC,sBAAA,CAAuB,WAAW,MAAM;AAAA,GAC1C;AACA,EAAA,IAAI,OAAA,CAAQ,UAAU,MAAA,EAAW;AAC/B,IAAA,YAAA,CAAa,IAAA,CAAK,kBAAkBA,GAAAA,CAAI,GAAA,CAAI,MAAM,CAAA,EAAG,OAAA,CAAQ,KAAK,CAAC,CAAA;AAAA,EACrE;AAIA,EAAA,MAAM,SAAA,GACJ,SAAA,KAAc,MAAA,GAASA,GAAAA,CAAAA,kBAAAA,CAAAA,GAA0BA,GAAAA,CAAAA,QAAAA,CAAAA;AAEnD,EAAA,MAAM,KAAA,GAAQA,GAAAA,CAAAA,OAAAA,EAAa,SAAS,CAAA,eAAA,EAAkB,GAAA,CAAI,MAAA,CAAO,UAAU,CAAA,OAAA,EAAUA,GAAAA,CAAI,IAAA,CAAK,YAAA,EAAcA,GAAAA,CAAAA,KAAAA,CAAU,CAAC,CAAA,CAAA;AAEvH,EAAA,MAAM,IAAA,GACJ,MAAM,GAAA,CAAI,OAAA,CAAQ,QAA8C,KAAK,CAAA;AACvE,EAAA,OAAO,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,EAAG,SAAS,CAAC,CAAA;AACnC;AAEA,SAAS,sBAAA,CACP,WACA,MAAA,EACwB;AACxB,EAAA,QAAQ,SAAA;AAAW,IACjB,KAAK,KAAA,EAAO;AACV,MAAA,OAAOA,gBAAgB,MAAM,CAAA,CAAA;AAAA,IAC/B;AAAA,IACA,KAAK,IAAA,EAAM;AACT,MAAA,OAAOA,cAAc,MAAM,CAAA,CAAA;AAAA,IAC7B;AAAA,IACA,KAAK,MAAA,EAAQ;AACX,MAAA,OAAOA,GAAAA,CAAAA,WAAAA,EAAiB,MAAM,CAAA,YAAA,EAAe,MAAM,CAAA,CAAA,CAAA;AAAA,IACrD;AAAA;AAEJ;ACjCA,eAAsB,gBAAA,CACpB,GAAA,EACA,QAAA,EACA,OAAA,EACmC;AACnC,EAAA,eAAA,CAAgB,QAAQ,KAAK,CAAA;AAC7B,EAAA,MAAM,OAAA,GAAU,cAAA;AAAA,IACd,OAAA,CAAQ,OAAA;AAAA,IACR,0BAAA;AAAA,IACA;AAAA,GACF;AAEA,EAAA,MAAM,MAAM,iBAAA,CAAkB;AAAA,IAC5B,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,QAAA;AAAA,IACA,WAAW,OAAA,CAAQ,KAAA;AAAA,IACnB,OAAA;AAAA,IACA,SAAA,EAAW,QAAQ,SAAA,IAAa,KAAA;AAAA,IAChC,WAAA,EAAa,QAAQ,WAAA,IAAe,SAAA;AAAA,IACpC,WAAA,EAAa,KAAA;AAAA,IACb,GAAG,sBAAA,CAAuB,GAAA,EAAK,OAAO,CAAA;AAAA,IACtC,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,QAAQ,GAAA,CAAI;AAAA,GACb,CAAA;AAED,EAAA,MAAM,eACJ,OAAA,CAAQ,aAAA,KAAkB,IAAA,GAAOA,GAAAA,CAAAA,aAAAA,EAAmB,QAAQ,CAAA,CAAA,GAAKA,GAAAA,CAAAA,CAAAA;AAEnE,EAAA,MAAM,KAAA,GAAQA,GAAAA,CAAAA,EAAM,GAAG,CAAA,oDAAA,EAAuD,YAAY,CAAA,6CAAA,CAAA;AAE1F,EAAA,MAAM,IAAA,GAAO,MAAM,GAAA,CAAI,OAAA,CAAQ,QAAsB,KAAK,CAAA;AAC1D,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,MAAS;AAAA,IACxB,IAAI,GAAA,CAAI,EAAA;AAAA,IACR,MAAM,GAAA,CAAI,IAAA;AAAA,IACV,KAAA,EAAO,MAAA,CAAO,GAAA,CAAI,KAAK;AAAA,GACzB,CAAE,CAAA;AACJ;AAEA,eAAsB,eAAA,CACpB,GAAA,EACA,QAAA,EACA,QAAA,EACA,OAAA,EACkB;AAClB,EAAA,eAAA,CAAgB,QAAQ,KAAK,CAAA;AAE7B,EAAA,MAAM,OAAA,GAAU,cAAA;AAAA,IACd,OAAA,CAAQ,OAAA;AAAA,IACR,0BAAA;AAAA,IACA;AAAA,GACF;AAMA,EAAA,MAAM,MAAM,iBAAA,CAAkB;AAAA,IAC5B,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,QAAA;AAAA,IACA,WAAW,OAAA,CAAQ,KAAA;AAAA,IACnB,OAAA;AAAA,IACA,SAAA,EAAW,QAAQ,SAAA,IAAa,KAAA;AAAA,IAChC,WAAA,EAAa,QAAQ,WAAA,IAAe,SAAA;AAAA,IACpC,WAAA,EAAa,KAAA;AAAA,IACb,GAAG,sBAAA,CAAuB,GAAA,EAAK,OAAO,CAAA;AAAA,IACtC,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,QAAQ,GAAA,CAAI;AAAA,GACb,CAAA;AAED,EAAA,MAAM,KAAA,GAAQA,GAAAA,CAAAA,EAAM,GAAG,CAAA,2CAAA,EAA8C,QAAQ,CAAA,QAAA,CAAA;AAE7E,EAAA,MAAM,IAAA,GAAO,MAAM,GAAA,CAAI,OAAA,CAAQ,QAAmC,KAAK,CAAA;AACvE,EAAA,OAAO,KAAK,MAAA,GAAS,CAAA;AACvB;AAEA,eAAsB,gBAAA,CACpB,GAAA,EACA,QAAA,EACA,OAAA,EACmC;AACnC,EAAA,MAAM,KAAA,GAAQ,cAAA,CAAe,OAAA,CAAQ,KAAA,EAAO,wBAAwB,OAAO,CAAA;AAE3E,EAAA,OAAO,gBAAA,CAAiB,KAAK,QAAA,EAAU;AAAA,IACrC,OAAO,OAAA,CAAQ,KAAA;AAAA,IACf,OAAA,EAAS,KAAA;AAAA,IACT,SAAA,EAAW,QAAQ,SAAA,IAAa,KAAA;AAAA,IAChC,WAAA,EAAa,QAAQ,WAAA,IAAe,SAAA;AAAA,IACpC,GAAI,OAAA,CAAQ,YAAA,KAAiB,MAAA,IAAa;AAAA,MACxC,cAAc,OAAA,CAAQ;AAAA,KACxB;AAAA,IACA,GAAI,OAAA,CAAQ,IAAA,KAAS,UAAa,EAAE,IAAA,EAAM,QAAQ,IAAA,EAAK;AAAA,IACvD,aAAA,EAAe;AAAA,GAChB,CAAA;AACH;AC7FA,eAAsB,mBAAA,CACpB,GAAA,EACA,QAAA,EACA,QAAA,EACA,OAAA,EACyC;AACzC,EAAA,eAAA,CAAgB,QAAQ,KAAK,CAAA;AAC7B,EAAA,MAAM,OAAA,GAAU,cAAA;AAAA,IACd,OAAA,CAAQ,OAAA;AAAA,IACR,0BAAA;AAAA,IACA;AAAA,GACF;AAIA,EAAA,IAAI,aAAa,QAAA,EAAU;AACzB,IAAA,MAAM,MAAA,GAAS,MAAM,aAAA,CAAc,GAAA,EAAK,UAAU,OAAO,CAAA;AACzD,IAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AACjC,IAAA,OAAO,EAAE,KAAA,EAAO,CAAC,MAAM,CAAA,EAAG,OAAO,CAAA,EAAE;AAAA,EACrC;AAEA,EAAA,MAAM,MAAM,iBAAA,CAAkB;AAAA,IAC5B,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,QAAA;AAAA,IACA,WAAW,OAAA,CAAQ,KAAA;AAAA,IACnB,OAAA;AAAA,IACA,SAAA,EAAW,QAAQ,SAAA,IAAa,KAAA;AAAA,IAChC,WAAA,EAAa,QAAQ,WAAA,IAAe,SAAA;AAAA,IACpC,WAAA,EAAa,IAAA;AAAA,IACb,GAAG,sBAAA,CAAuB,GAAA,EAAK,OAAO,CAAA;AAAA,IACtC,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,QAAQ,GAAA,CAAI;AAAA,GACb,CAAA;AAYD,EAAA,MAAM,iBAAA,GAAoBA,GAAAA,CAAAA,KAAAA,EAAW,GAAA,CAAI,OAAA,CAAQ,UAAA,CAAWA,GAAAA,CAAI,GAAA,CAAI,MAAM,CAAA,EAAGA,GAAAA,CAAI,GAAA,CAAI,QAAQ,CAAC,CAAC,CAAA,CAAA,CAAA;AAE/F,EAAA,MAAM,QAAQA,GAAAA,CAAAA,EAAM,GAAG,CAAA,iEAAA,EAAoE,QAAQ,8LAA8L,iBAAiB,CAAA,CAAA;AAElT,EAAA,MAAM,IAAA,GAAO,MAAM,GAAA,CAAI,OAAA,CAAQ,QAAyB,KAAK,CAAA;AAC7D,EAAA,MAAM,KAAA,GAAQ,KAAK,CAAC,CAAA;AACpB,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,MAAA;AAEhC,EAAA,MAAM,OAAA,GAAU,aAAA,CAAc,KAAA,CAAM,QAAQ,CAAA;AAC5C,EAAA,MAAM,QAAA,GAAW,eAAe,IAAI,CAAA;AAEpC,EAAA,MAAM,SAAA,GAAwB,OAAA,CAAQ,GAAA,CAAI,CAAC,EAAA,MAAQ;AAAA,IACjD,EAAA;AAAA,IACA,IAAA,EAAM,QAAA,CAAS,GAAA,CAAI,EAAE,CAAA,IAAK;AAAA,GAC5B,CAAE,CAAA;AAEF,EAAA,OAAO,EAAE,KAAA,EAAO,SAAA,EAAW,OAAO,MAAA,CAAO,KAAA,CAAM,SAAS,CAAA,EAAE;AAC5D;AAEA,SAAS,eACP,IAAA,EAC6B;AAC7B,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAoB;AACpC,EAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,IAAA,IAAI,GAAA,CAAI,OAAA,KAAY,MAAA,IAAa,GAAA,CAAI,cAAc,MAAA,EAAW;AAC5D,MAAA,GAAA,CAAI,GAAA,CAAI,GAAA,CAAI,OAAA,EAAS,GAAA,CAAI,SAAS,CAAA;AAAA,IACpC;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAEA,eAAe,aAAA,CACb,GAAA,EACA,MAAA,EACA,OAAA,EAC+B;AAC/B,EAAA,MAAM,cAAA,GAAiB,qBAAA,CAAsB,GAAA,EAAK,OAAO,CAAA;AACzD,EAAA,MAAM,KAAA,GAAaA,GAAAA,CAAAA,qBAAAA,EAA2B,GAAA,CAAI,MAAA,CAAO,UAAU,CAAA,kBAAA,EAAqB,GAAA,CAAI,OAAO,CAAA,UAAA,EAAa,MAAM,CAAA,KAAA,EAAQ,cAAc,CAAA,QAAA,CAAA;AAC5I,EAAA,MAAM,IAAA,GAAO,MAAM,GAAA,CAAI,OAAA,CAAQ,QAAqB,KAAK,CAAA;AACzD,EAAA,MAAM,GAAA,GAAM,KAAK,CAAC,CAAA;AAClB,EAAA,IAAI,GAAA,KAAQ,QAAW,OAAO,MAAA;AAC9B,EAAA,OAAO,EAAE,EAAA,EAAI,GAAA,CAAI,EAAA,EAAI,IAAA,EAAM,IAAI,IAAA,EAAK;AACtC;;;AC1EA,SAAS,cAAc,KAAA,EAA+B;AACpD,EAAA,OAAO,OAAO,KAAA,KAAU,QAAA,GAAW,KAAA,GAAQ,KAAA,CAAM,EAAA;AACnD;AAoEO,SAAS,sBACd,MAAA,EACoB;AACpB,EAAA,MAAM,GAAA,GAAwB;AAAA,IAC5B,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,OAAA,EAAS,UAAA,CAAW,MAAA,CAAO,OAAA,CAAQ,OAAO,CAAA;AAAA,IAC1C,MAAA,EACE,MAAA,CAAO,MAAA,KACN,MAAA,CAAO,OAAA,CAAQ,UAAA,GACd,eAAA,CAAgB,MAAA,CAAO,OAAA,CAAQ,UAAU,CAAA,GACzC,eAAA,EAAgB,CAAA;AAAA,IACpB,qBAAqB,MAAA,CAAO;AAAA,GAC9B;AAEA,EAAA,OAAO;AAAA,IACL,YAAA,CAAa,IAAA,EAAM,EAAA,EAAI,OAAA,EAAS;AAC9B,MAAA,OAAO,mBAAA;AAAA,QACL,GAAA;AAAA,QACA,cAAc,IAAI,CAAA;AAAA,QAClB,cAAc,EAAE,CAAA;AAAA,QAChB;AAAA,OACF;AAAA,IACF,CAAA;AAAA,IACA,SAAA,CAAU,MAAM,OAAA,EAAS;AACvB,MAAA,OAAO,gBAAA,CAAiB,GAAA,EAAK,aAAA,CAAc,IAAI,GAAG,OAAO,CAAA;AAAA,IAC3D,CAAA;AAAA,IACA,QAAA,CAAS,IAAA,EAAM,EAAA,EAAI,OAAA,EAAS;AAC1B,MAAA,OAAO,eAAA;AAAA,QACL,GAAA;AAAA,QACA,cAAc,IAAI,CAAA;AAAA,QAClB,cAAc,EAAE,CAAA;AAAA,QAChB;AAAA,OACF;AAAA,IACF,CAAA;AAAA,IACA,SAAA,CAAU,MAAM,OAAA,EAAS;AACvB,MAAA,OAAO,gBAAA,CAAiB,GAAA,EAAK,aAAA,CAAc,IAAI,GAAG,OAAO,CAAA;AAAA,IAC3D,CAAA;AAAA,IACA,MAAA,CAAO,MAAM,OAAA,EAAS;AACpB,MAAA,OAAO,cAAc,GAAA,EAAK,aAAA,CAAc,IAAI,CAAA,EAAG,OAAA,IAAW,EAAE,CAAA;AAAA,IAC9D;AAAA,GACF;AACF;;;AC/GA,SAAS,WAAkC,IAAA,EAAqB;AAC9D,EAAA,OAAO,IAAA;AACT;AAKA,SAAS,YAAmC,KAAA,EAAmC;AAC7E,EAAA,OAAO,KAAA;AACT;AA+FA,SAAS,oBAAA,CACP,IAAA,EACA,IAAA,EACA,EAAA,EACA,OACA,OAAA,EACiB;AACjB,EAAA,MAAM,KAAA,GAUF;AAAA,IACF,IAAA;AAAA,IACA,UAAU,IAAA,CAAK,IAAA;AAAA,IACf,QAAQ,IAAA,CAAK,EAAA;AAAA,IACb,QAAQ,EAAA,CAAG,IAAA;AAAA,IACX,MAAM,EAAA,CAAG,EAAA;AAAA,IACT;AAAA,GACF;AACA,EAAA,IAAI,OAAA,EAAS,EAAA,KAAO,MAAA,EAAW,KAAA,CAAM,KAAK,OAAA,CAAQ,EAAA;AAClD,EAAA,IAAI,OAAA,EAAS,SAAA,KAAc,MAAA,EAAW,KAAA,CAAM,YAAY,OAAA,CAAQ,SAAA;AAChE,EAAA,IAAI,OAAA,EAAS,OAAA,KAAY,MAAA,EAAW,KAAA,CAAM,UAAU,OAAA,CAAQ,OAAA;AAC5D,EAAA,OAAO,KAAA;AACT;AAQA,SAAS,oBAAA,CACP,EAAA,EACA,KAAA,EACA,OAAA,EACiB;AACjB,EAAA,MAAM,KAAA,GAIF,EAAE,EAAA,EAAI,KAAA,EAAM;AAChB,EAAA,IAAI,OAAA,EAAS,OAAA,KAAY,MAAA,EAAW,KAAA,CAAM,UAAU,OAAA,CAAQ,OAAA;AAC5D,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,iBAAA,CACP,MACA,KAAA,EAQmB;AACnB,EAAA,OAAO,KAAA,CAAM,GAAA;AAAA,IAAI,CAAC,IAAA,KAChB,oBAAA,CAAqB,IAAA,EAAM,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,EAAA,EAAI,IAAA,CAAK,KAAA,IAAS,EAAC,EAAG,IAAI;AAAA,GACvE;AACF;AAKO,SAAS,qBAGd,MAAA,EAAqE;AAGrE,EAAA,MAAM;AAAA,IACJ,OAAA;AAAA,IACA,IAAA;AAAA,IACA,OAAA;AAAA,IACA,mBAAA;AAAA,IACA,SAAA,EAAA8B,UAAAA;AAAA,IACA,aAAA,EAAeC,kBAAAA;AAAA,IACf,0BAAA,EAA4BC,+BAAAA;AAAA,IAC5B,kBAAA,EAAoBC,uBAAAA;AAAA,IACpB,aAAA,EAAeC,kBAAAA;AAAA,IACf,mBAAA,EAAqBC,wBAAAA;AAAA,IACrB,aAAA,EAAeC,kBAAAA;AAAA,IACf,iBAAA,EAAmBC,sBAAAA;AAAA,IACnB;AAAA,GACF,GAAI,MAAA;AAEJ,EAAA,MAAM,OAAA,GAAU,CAAC,IAAA,KACf,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ,UAAA,CAAcP,UAAAA,CAAU,GAAG,CAAC,CAAC,CAAA;AASjD,EAAA,SAAS,uBAAA,CACP,UAGA,OAAA,EACuB;AACvB,IAAA,OAAO;AAAA,MACL,OAAA;AAAA,MACA,IAAA;AAAA,MACA,GAAG,QAAA;AAAA,MACH,GAAG,yBAAA,CAA0B,OAAA,EAAS,mBAAmB;AAAA,KAC3D;AAAA,EACF;AAEA,EAAA,eAAe,aAAA,CACb,IAAA,EACA,MAAA,EACA,OAAA,EACoB;AACpB,IAAA,MAAM,IAAA,GAAO,MAAM,MAAA,CAAO,eAAA;AAAA,MACxB,uBAAA;AAAA,QACE,EAAE,QAAA,EAAU,IAAA,CAAK,IAAA,EAAM,MAAA,EAAQ,KAAK,EAAA,EAAG;AAAA,QACvC;AAAA;AACF,KACF;AACA,IAAA,OAAO,QAAQ,IAAI,CAAA;AAAA,EACrB;AAEA,EAAA,eAAe,WAAA,CACb,EAAA,EACA,MAAA,EACA,OAAA,EACoB;AACpB,IAAA,MAAM,IAAA,GAAO,MAAM,MAAA,CAAO,eAAA;AAAA,MACxB,uBAAA,CAAwB,EAAE,MAAA,EAAQ,EAAA,CAAG,MAAM,IAAA,EAAM,EAAA,CAAG,EAAA,EAAG,EAAG,OAAO;AAAA,KACnE;AACA,IAAA,OAAO,QAAQ,IAAI,CAAA;AAAA,EACrB;AAEA,EAAA,SAAS,2BAAA,CACP,SACA,QAAA,EAOC;AACD,IAAA,MAAM,SAMF,EAAE,GAAG,yBAAA,CAA0B,QAAA,EAAU,mBAAmB,CAAA,EAAE;AAClE,IAAA,IAAI,SAAS,OAAA,KAAY,MAAA;AACvB,MAAA,MAAA,CAAO,UAAU,OAAA,CAAQ,OAAA;AAC3B,IAAA,IAAI,OAAA,EAAS,KAAA,KAAU,MAAA,EAAW,MAAA,CAAO,QAAQ,OAAA,CAAQ,KAAA;AACzD,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,OAAO;AAAA,IACL,MAAM,MAAA,CACJ,IAAA,EACA,EAAA,EACA,OACA,OAAA,EACkB;AAClB,MAAA,MAAM,SAAS,MAAMC,kBAAAA;AAAA,QACnB,qBAAqB,IAAA,EAAM,IAAA,EAAM,IAAI,KAAA,IAAS,IAAI,OAAO,CAAA;AAAA,QACzD;AAAA,OACF;AACA,MAAA,OAAO,WAAc,MAAM,CAAA;AAAA,IAC7B,CAAA;AAAA,IAEA,MAAM,OAAA,CACJ,EAAA,EACA,OAAA,EAC8B;AAC9B,MAAA,MAAM,GAAA,GAAM,MAAM,OAAA,CAAQ,OAAA,CAAQ,SAAS,EAAE,CAAA;AAC7C,MAAA,IAAI,CAAC,KAAK,OAAO,MAAA;AACjB,MAAA,IAAI,GAAA,CAAI,IAAA,KAAS,IAAA,EAAM,OAAO,MAAA;AAC9B,MAAA,IAAI,CAAC,kBAAA,CAAmB,OAAO,CAAA,CAAE,GAAG,GAAG,OAAO,MAAA;AAC9C,MAAA,OAAO,UAAA,CAAcD,UAAAA,CAAU,GAAG,CAAC,CAAA;AAAA,IACrC,CAAA;AAAA,IAEA,MAAM,QAAA,CACJ,GAAA,EACA,OAAA,EAC2C;AAC3C,MAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAG9B,MAAA,MAAM,OAAA,GAAU,mBAAmB,OAAO,CAAA;AAE1C,MAAA,IAAI,OAAA,CAAQ,aAAa,MAAA,EAAW;AAClC,QAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,QAAA,CAAS,SAAS,GAAG,CAAA;AAChD,QAAA,MAAM,MAAA,uBAAa,GAAA,EAAmC;AACtD,QAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,UAAA,MAAA,CAAO,GAAA,CAAI,GAAA,CAAI,EAAA,EAAI,GAAG,CAAA;AAAA,QACxB;AACA,QAAA,OAAO,GAAA,CAAI,GAAA,CAAI,CAAC,EAAA,KAAO;AACrB,UAAA,MAAM,GAAA,GAAM,MAAA,CAAO,GAAA,CAAI,EAAE,CAAA;AACzB,UAAA,IAAI,CAAC,GAAA,EAAK;AACV,UAAA,IAAI,GAAA,CAAI,SAAS,IAAA,EAAM;AACvB,UAAA,IAAI,CAAC,OAAA,CAAQ,GAAG,CAAA,EAAG;AACnB,UAAA,OAAO,UAAA,CAAcA,UAAAA,CAAU,GAAG,CAAC,CAAA;AAAA,QACrC,CAAC,CAAA;AAAA,MACH;AAEA,MAAA,OAAO,OAAA,CAAQ,GAAA;AAAA,QACb,GAAA,CAAI,GAAA,CAAI,OAAO,EAAA,KAAO;AACpB,UAAA,MAAM,GAAA,GAAM,MAAM,OAAA,CAAQ,OAAA,CAAQ,SAAS,EAAE,CAAA;AAC7C,UAAA,IAAI,CAAC,GAAA,EAAK;AACV,UAAA,IAAI,GAAA,CAAI,SAAS,IAAA,EAAM;AACvB,UAAA,IAAI,CAAC,OAAA,CAAQ,GAAG,CAAA,EAAG;AACnB,UAAA,OAAO,UAAA,CAAcA,UAAAA,CAAU,GAAG,CAAC,CAAA;AAAA,QACrC,CAAC;AAAA,OACH;AAAA,IACF,CAAA;AAAA,IAEA,MAAM,MAAA,CACJ,EAAA,EACA,KAAA,EACA,OAAA,EACkB;AAClB,MAAA,MAAM,SAAS,MAAMI,kBAAAA;AAAA,QACnB,oBAAA,CAAqB,EAAA,EAAI,KAAA,EAAO,OAAO,CAAA;AAAA,QACvC;AAAA,OACF;AACA,MAAA,OAAO,WAAc,MAAM,CAAA;AAAA,IAC7B,CAAA;AAAA,IAEA,MAAM,QAAA,CAAS,IAAA,EAAe,OAAA,EAA4C;AACxE,MAAA,OAAO,aAAA,CAAc,IAAA,EAAM,OAAA,EAAS,OAAO,CAAA;AAAA,IAC7C,CAAA;AAAA,IAEA,MAAM,MAAA,CAAO,EAAA,EAAa,OAAA,EAA4C;AACpE,MAAA,OAAO,WAAA,CAAY,EAAA,EAAI,OAAA,EAAS,OAAO,CAAA;AAAA,IACzC,CAAA;AAAA,IAEA,aAAA,CACE,MACA,OAAA,EACyB;AACzB,MAAA,OAAO,EAAE,WAAW,CAAC,MAAA,KAAW,cAAc,IAAA,EAAM,MAAA,EAAQ,OAAO,CAAA,EAAE;AAAA,IACvE,CAAA;AAAA,IAEA,WAAA,CAAY,IAAa,OAAA,EAAiD;AACxE,MAAA,OAAO,EAAE,WAAW,CAAC,MAAA,KAAW,YAAY,EAAA,EAAI,MAAA,EAAQ,OAAO,CAAA,EAAE;AAAA,IACnE,CAAA;AAAA,IAEA,oBAAA,CACE,IAAA,EACA,EAAA,EACA,OAAA,EACA,QAAA,EACyB;AACzB,MAAA,OAAO;AAAA,QACL,SAAA,EAAW,OAAO,MAAA,KAAW;AAC3B,UAAA,MAAM,MAAA,GAAS,MAAM,MAAA,CAAO,sBAAA;AAAA,YAC1B,IAAA;AAAA,YACA,IAAA,CAAK,IAAA;AAAA,YACL,IAAA,CAAK,EAAA;AAAA,YACL,EAAA,CAAG,IAAA;AAAA,YACH,EAAA,CAAG,EAAA;AAAA,YACH,MAAA;AAAA,YACA,2BAAA,CAA4B,SAAS,QAAQ;AAAA,WAC/C;AACA,UAAA,OAAO,WAAW,MAAA,GAAY,KAAK,CAAC,UAAA,CAAc,MAAM,CAAC,CAAA;AAAA,QAC3D;AAAA,OACF;AAAA,IACF,CAAA;AAAA,IAEA,MAAM,OAAO,EAAA,EAA2B;AACtC,MAAA,MAAME,kBAAAA,CAAkB,IAAI,OAAO,CAAA;AAAA,IACrC,CAAA;AAAA,IAEA,MAAM,WAAW,EAAA,EAA2B;AAC1C,MAAA,MAAMC,sBAAAA,CAAsB,IAAI,OAAO,CAAA;AAAA,IACzC,CAAA;AAAA,IAEA,MAAM,IAAA,CACJ,MAAA,EAMA,QAAA,EACoB;AACpB,MAAA,MAAM,aAAA,GAAgB,MAAA;AACtB,MAAA,IAAI,aAAA,EAAe,UAAU,MAAA,EAAW;AACtC,QAAA,MAAM,IAAI,yBAAA;AAAA,UACR,eAAe,IAAI,CAAA,4GAAA,CAAA;AAAA,UAEnB,EAAE,IAAA,EAAM,SAAA,EAAW,MAAA;AAAO,SAC5B;AAAA,MACF;AAEA,MAAA,MAAM,MAAA,GASmB;AAAA,QACvB,OAAA;AAAA,QACA,IAAA;AAAA,QACA,GAAG,yBAAA,CAA0B,QAAA,EAAU,mBAAmB;AAAA,OAC5D;AACA,MAAA,IAAI,QAAQ,IAAA,EAAM,IAAA,KAAS,QAAW,MAAA,CAAO,QAAA,GAAW,OAAO,IAAA,CAAK,IAAA;AACpE,MAAA,IAAI,QAAQ,IAAA,EAAM,EAAA,KAAO,QAAW,MAAA,CAAO,MAAA,GAAS,OAAO,IAAA,CAAK,EAAA;AAChE,MAAA,IAAI,QAAQ,EAAA,EAAI,IAAA,KAAS,QAAW,MAAA,CAAO,MAAA,GAAS,OAAO,EAAA,CAAG,IAAA;AAC9D,MAAA,IAAI,QAAQ,EAAA,EAAI,EAAA,KAAO,QAAW,MAAA,CAAO,IAAA,GAAO,OAAO,EAAA,CAAG,EAAA;AAC1D,MAAA,IAAI,MAAA,EAAQ,KAAA,KAAU,MAAA,EAAW,MAAA,CAAO,QAAQ,MAAA,CAAO,KAAA;AACvD,MAAA,IAAI,MAAA,EAAQ,MAAA,KAAW,MAAA,EAAW,MAAA,CAAO,SAAS,MAAA,CAAO,MAAA;AAEzD,MAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,eAAA,CAAgB,MAAM,CAAA;AACjD,MAAA,OAAO,QAAQ,IAAI,CAAA;AAAA,IACrB,CAAA;AAAA,IAEA,MAAM,KAAA,CACJ,MAAA,EAIA,QAAA,EACiB;AACjB,MAAA,MAAM,MAAA,GAOmB;AAAA,QACvB,OAAA;AAAA,QACA,IAAA;AAAA,QACA,GAAG,yBAAA,CAA0B,QAAA,EAAU,mBAAmB;AAAA,OAC5D;AACA,MAAA,IAAI,QAAQ,IAAA,EAAM,IAAA,KAAS,QAAW,MAAA,CAAO,QAAA,GAAW,OAAO,IAAA,CAAK,IAAA;AACpE,MAAA,IAAI,QAAQ,IAAA,EAAM,EAAA,KAAO,QAAW,MAAA,CAAO,MAAA,GAAS,OAAO,IAAA,CAAK,EAAA;AAChE,MAAA,IAAI,QAAQ,EAAA,EAAI,IAAA,KAAS,QAAW,MAAA,CAAO,MAAA,GAAS,OAAO,EAAA,CAAG,IAAA;AAC9D,MAAA,IAAI,QAAQ,EAAA,EAAI,EAAA,KAAO,QAAW,MAAA,CAAO,IAAA,GAAO,OAAO,EAAA,CAAG,EAAA;AAE1D,MAAA,OAAO,OAAA,CAAQ,iBAAiB,MAAM,CAAA;AAAA,IACxC,CAAA;AAAA,IAEA,MAAM,WACJ,KAAA,EAQoB;AACpB,MAAA,MAAM,WAAA,GAAc,iBAAA,CAAkB,IAAA,EAAM,KAAK,CAAA;AAEjD,MAAA,IAAI,OAAA,CAAQ,YAAA,CAAa,YAAA,IAAgB,aAAA,IAAiB,OAAA,EAAS;AACjE,QAAA,MAAMC,QAAAA,GAAU,MAAM,OAAA,CAAQ,WAAA;AAAA,UAAY,OAAO,SAAA,KAC/CL,uBAAAA,CAAuB,WAAA,EAAa,SAAS;AAAA,SAC/C;AACA,QAAA,OAAO,YAAeK,QAAO,CAAA;AAAA,MAC/B;AACA,MAAA,MAAM,OAAA,GAAU,MAAML,uBAAAA,CAAuB,WAAA,EAAa,OAAO,CAAA;AACjE,MAAA,OAAO,YAAe,OAAO,CAAA;AAAA,IAC/B,CAAA;AAAA,IAEA,MAAM,eACJ,KAAA,EAQoB;AACpB,MAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAEhC,MAAA,MAAM,SAAA,GAAY,OAChB,MAAA,KACuB;AACvB,QAAA,MAAM,MAAM,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,KAAK,EAAE,CAAA;AACvC,QAAA,MAAM,WAAA,uBAAkB,GAAA,EAGtB;AAEF,QAAA,IAAI,MAAA,CAAO,aAAa,MAAA,EAAW;AACjC,UAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,GAAA;AAAA,YACzB,GAAA,CAAI,IAAI,CAAC,EAAA,KAAO,OAAO,OAAA,CAAQ,OAAA,EAAS,EAAE,CAAC;AAAA,WAC7C;AACA,UAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,YAAA,IAAI,QAAQ,MAAA,EAAW,WAAA,CAAY,GAAA,CAAI,GAAA,CAAI,IAAI,GAAG,CAAA;AAAA,UACpD;AAAA,QACF,CAAA,MAAO;AACL,UAAA,MAAM,IAAA,GAAO,MAAM,MAAA,CAAO,QAAA,CAAS,SAAS,GAAG,CAAA;AAC/C,UAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,YAAA,WAAA,CAAY,GAAA,CAAI,GAAA,CAAI,EAAA,EAAI,GAAG,CAAA;AAAA,UAC7B;AAAA,QACF;AAGA,QAAA,MAAM,WAAwD,EAAC;AAC/D,QAAA,MAAM,WAIA,EAAC;AAEP,QAAA,IAAI,SAAA,GAAY,CAAA;AAChB,QAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,UAAA,MAAM,QAAA,GAAW,WAAA,CAAY,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAExC,UAAA,IAAI,QAAA,EAAU;AACZ,YAAA,QAAA,CAAS,IAAA,CAAK;AAAA,cACZ,KAAA,EAAO,SAAA;AAAA,cACP,KAAA,EAAO,qBAAqB,IAAA,CAAK,EAAA,EAAI,KAAK,KAAA,IAAS,IAAI,IAAI,CAAA;AAAA,cAC3D,YAAA,EAAc,SAAS,UAAA,KAAe;AAAA,aACvC,CAAA;AAAA,UACH,CAAA,MAAO;AACL,YAAA,QAAA,CAAS,IAAA,CAAK;AAAA,cACZ,KAAA,EAAO,SAAA;AAAA,cACP,KAAA,EAAO,oBAAA;AAAA,gBACL,IAAA;AAAA,gBACA,IAAA,CAAK,IAAA;AAAA,gBACL,IAAA,CAAK,EAAA;AAAA,gBACL,IAAA,CAAK,SAAS,EAAC;AAAA,gBACf;AAAA;AACF,aACD,CAAA;AAAA,UACH;AACA,UAAA,SAAA,EAAA;AAAA,QACF;AAGA,QAAA,MAAM,UAAqB,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,KAAA,CAAM,QAAQ,CAAA;AAE9D,QAAA,IAAI,QAAA,CAAS,SAAS,CAAA,EAAG;AACvB,UAAA,MAAM,eAAe,QAAA,CAAS,GAAA,CAAI,CAACL,MAAAA,KAAUA,OAAM,KAAK,CAAA;AACxD,UAAA,MAAM,OAAA,GAAU,MAAMK,uBAAAA,CAAuB,YAAA,EAAc,MAAM,CAAA;AACjE,UAAA,KAAA,MAAW,CAAC,KAAA,EAAOL,MAAK,CAAA,IAAK,QAAA,CAAS,SAAQ,EAAG;AAC/C,YAAA,OAAA,CAAQA,OAAM,KAAK,CAAA,GAAI,UAAA,CAAc,OAAA,CAAQ,KAAK,CAAE,CAAA;AAAA,UACtD;AAAA,QACF;AAGA,QAAA,KAAA,MAAWA,UAAS,QAAA,EAAU;AAC5B,UAAA,MAAM,MAAA,GAAS,MAAMO,wBAAAA,CAAwBP,MAAAA,CAAM,OAAO,MAAA,EAAQ;AAAA,YAChE,cAAcA,MAAAA,CAAM;AAAA,WACrB,CAAA;AACD,UAAA,OAAA,CAAQA,MAAAA,CAAM,KAAK,CAAA,GAAI,UAAA,CAAc,MAAM,CAAA;AAAA,QAC7C;AAEA,QAAA,OAAO,OAAA;AAAA,MACT,CAAA;AAEA,MAAA,IAAI,OAAA,CAAQ,YAAA,CAAa,YAAA,IAAgB,aAAA,IAAiB,OAAA,EAAS;AACjE,QAAA,OAAO,QAAQ,WAAA,CAAY,OAAO,SAAA,KAAc,SAAA,CAAU,SAAS,CAAC,CAAA;AAAA,MACtE;AACA,MAAA,OAAO,UAAU,OAAO,CAAA;AAAA,IAC1B,CAAA;AAAA,IAEA,MAAM,WACJ,KAAA,EAQe;AACf,MAAA,MAAM,WAAA,GAAc,iBAAA,CAAkB,IAAA,EAAM,KAAK,CAAA;AAEjD,MAAA,IAAI,OAAA,CAAQ,YAAA,CAAa,YAAA,IAAgB,aAAA,IAAiB,OAAA,EAAS;AACjE,QAAA,MAAM,OAAA,CAAQ,WAAA,CAAY,OAAO,SAAA,KAAc;AAC7C,UAAA,MAAMI,+BAAAA,CAA+B,aAAa,SAAS,CAAA;AAAA,QAC7D,CAAC,CAAA;AACD,QAAA;AAAA,MACF;AAEA,MAAA,MAAMA,+BAAAA,CAA+B,aAAa,OAAO,CAAA;AAAA,IAC3D,CAAA;AAAA,IAEA,MAAM,WAAW,GAAA,EAAuC;AACtD,MAAA,IAAI,GAAA,CAAI,WAAW,CAAA,EAAG;AACtB,MAAA,MAAM,SAAA,GAAY,OAChB,MAAA,KACkB;AAClB,QAAA,KAAA,MAAW,MAAM,GAAA,EAAK;AACpB,UAAA,MAAMI,kBAAAA,CAAkB,IAAI,MAAM,CAAA;AAAA,QACpC;AAAA,MACF,CAAA;AACA,MAAA,IAAI,OAAA,CAAQ,YAAA,CAAa,YAAA,IAAgB,aAAA,IAAiB,OAAA,EAAS;AACjE,QAAA,MAAM,QAAQ,WAAA,CAAY,OAAO,SAAA,KAAc,SAAA,CAAU,SAAS,CAAC,CAAA;AACnE,QAAA;AAAA,MACF;AACA,MAAA,MAAM,UAAU,OAAO,CAAA;AAAA,IACzB,CAAA;AAAA,IAEA,MAAM,eAAA,CACJ,IAAA,EACA,EAAA,EACA,SACA,QAAA,EAC8B;AAC9B,MAAA,MAAM,MAAA,GAAS,MAAM,MAAA,CAAO,sBAAA;AAAA,QAC1B,IAAA;AAAA,QACA,IAAA,CAAK,IAAA;AAAA,QACL,IAAA,CAAK,EAAA;AAAA,QACL,EAAA,CAAG,IAAA;AAAA,QACH,EAAA,CAAG,EAAA;AAAA,QACH,OAAA;AAAA,QACA,2BAAA,CAA4B,SAAS,QAAQ;AAAA,OAC/C;AACA,MAAA,OAAO,MAAA,KAAW,MAAA,GAAY,MAAA,GAAY,UAAA,CAAc,MAAM,CAAA;AAAA,IAChE,CAAA;AAAA,IAEA,MAAM,sBAAA,CACJ,IAAA,EACA,EAAA,EACA,OACA,OAAA,EAC8C;AAC9C,MAAA,MAAM,qBAGF,EAAC;AACL,MAAA,IAAI,SAAS,OAAA,KAAY,MAAA;AACvB,QAAA,kBAAA,CAAmB,UAAU,OAAA,CAAQ,OAAA;AACvC,MAAA,IAAI,SAAS,QAAA,KAAa,MAAA;AACxB,QAAA,kBAAA,CAAmB,WAAW,OAAA,CAAQ,QAAA;AAExC,MAAA,MAAM,MAAA,GAAS,MAAM,MAAA,CAAO,6BAAA;AAAA,QAC1B,IAAA;AAAA,QACA,IAAA,CAAK,IAAA;AAAA,QACL,IAAA,CAAK,EAAA;AAAA,QACL,EAAA,CAAG,IAAA;AAAA,QACH,EAAA,CAAG,EAAA;AAAA,QACH,KAAA;AAAA,QACA,OAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,OAAO,EAAE,MAAM,UAAA,CAAc,MAAA,CAAO,IAAI,CAAA,EAAG,MAAA,EAAQ,OAAO,MAAA,EAAO;AAAA,IACnE,CAAA;AAAA,IAEA,MAAM,0BAAA,CACJ,KAAA,EAKA,OAAA,EACgD;AAChD,MAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAEhC,MAAA,MAAM,WAAA,GAAc,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,MAAU;AAAA,QACvC,QAAA,EAAU,KAAK,IAAA,CAAK,IAAA;AAAA,QACpB,MAAA,EAAQ,KAAK,IAAA,CAAK,EAAA;AAAA,QAClB,MAAA,EAAQ,KAAK,EAAA,CAAG,IAAA;AAAA,QAChB,IAAA,EAAM,KAAK,EAAA,CAAG,EAAA;AAAA,QACd,OAAO,IAAA,CAAK;AAAA,OACd,CAAE,CAAA;AAEF,MAAA,MAAM,qBAGF,EAAC;AACL,MAAA,IAAI,SAAS,OAAA,KAAY,MAAA;AACvB,QAAA,kBAAA,CAAmB,UAAU,OAAA,CAAQ,OAAA;AACvC,MAAA,IAAI,SAAS,QAAA,KAAa,MAAA;AACxB,QAAA,kBAAA,CAAmB,WAAW,OAAA,CAAQ,QAAA;AAExC,MAAA,MAAM,cAAA,GAAiB,OACrB,MAAA,KACmD;AACnD,QAAA,MAAM,OAAA,GAAU,MAAM,MAAA,CAAO,iCAAA;AAAA,UAC3B,IAAA;AAAA,UACA,WAAA;AAAA,UACA,MAAA;AAAA,UACA;AAAA,SACF;AACA,QAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,MAAA,MAAY;AAAA,UAC9B,IAAA,EAAM,UAAA,CAAc,MAAA,CAAO,IAAI,CAAA;AAAA,UAC/B,QAAQ,MAAA,CAAO;AAAA,SACjB,CAAE,CAAA;AAAA,MACJ,CAAA;AAEA,MAAA,IAAI,OAAA,CAAQ,YAAA,CAAa,YAAA,IAAgB,aAAA,IAAiB,OAAA,EAAS;AACjE,QAAA,OAAO,OAAA,CAAQ,WAAA;AAAA,UAAY,OAAO,SAAA,KAChC,cAAA,CAAe,SAAS;AAAA,SAC1B;AAAA,MACF;AACA,MAAA,OAAO,eAAe,OAAO,CAAA;AAAA,IAC/B;AAAA,GACF;AACF;;;AC1tBA,eAAsB,gBAAA,CACpB,OAAA,EACA,OAAA,EACA,IAAA,EACA,GAAA,EACsC;AACtC,EAAA,MAAM,QAAA,uBAAe,GAAA,EAA4B;AACjD,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,QAAA;AAE7B,EAAA,IAAI,OAAA,CAAQ,aAAa,MAAA,EAAW;AAClC,IAAA,MAAMG,QAAO,MAAM,OAAA,CAAQ,QAAA,CAAS,OAAA,EAAS,MAAM,GAAG,CAAA;AACtD,IAAA,KAAA,MAAW,OAAOA,KAAAA,EAAM;AACtB,MAAA,QAAA,CAAS,GAAA,CAAI,GAAA,CAAI,EAAA,EAAI,GAAG,CAAA;AAAA,IAC1B;AACA,IAAA,OAAO,QAAA;AAAA,EACT;AAEA,EAAA,MAAM,YAAY,CAAC,GAAG,IAAI,GAAA,CAAI,GAAG,CAAC,CAAA;AAClC,EAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,GAAA;AAAA,IACzB,SAAA,CAAU,IAAI,CAAC,EAAA,KAAO,QAAQ,OAAA,CAAQ,OAAA,EAAS,IAAA,EAAM,EAAE,CAAC;AAAA,GAC1D;AACA,EAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,IAAA,IAAI,QAAQ,MAAA,EAAW,QAAA,CAAS,GAAA,CAAI,GAAA,CAAI,IAAI,GAAG,CAAA;AAAA,EACjD;AACA,EAAA,OAAO,QAAA;AACT;;;ACJA,SAAS,WAA+B,IAAA,EAAqB;AAC3D,EAAA,OAAO,IAAA;AACT;AAKA,SAAS,YAAgC,KAAA,EAAmC;AAC1E,EAAA,OAAO,KAAA;AACT;AAgFA,SAAS,gBAAA,CACP,IAAA,EACA,KAAA,EACA,OAAA,EACiB;AACjB,EAAA,MAAM,KAAA,GAMF,EAAE,IAAA,EAAM,KAAA,EAAM;AAClB,EAAA,IAAI,OAAA,EAAS,EAAA,KAAO,MAAA,EAAW,KAAA,CAAM,KAAK,OAAA,CAAQ,EAAA;AAClD,EAAA,IAAI,OAAA,EAAS,SAAA,KAAc,MAAA,EAAW,KAAA,CAAM,YAAY,OAAA,CAAQ,SAAA;AAChE,EAAA,IAAI,OAAA,EAAS,OAAA,KAAY,MAAA,EAAW,KAAA,CAAM,UAAU,OAAA,CAAQ,OAAA;AAC5D,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,gBAAA,CACP,IAAA,EACA,EAAA,EACA,KAAA,EACA,OAAA,EACiB;AACjB,EAAA,MAAM,KAAA,GAKF,EAAE,IAAA,EAAM,EAAA,EAAI,KAAA,EAAM;AACtB,EAAA,IAAI,OAAA,EAAS,OAAA,KAAY,MAAA,EAAW,KAAA,CAAM,UAAU,OAAA,CAAQ,OAAA;AAC5D,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,iBAAA,CACP,MACA,KAAA,EAMmB;AACnB,EAAA,OAAO,KAAA,CAAM,IAAI,CAAC,IAAA,KAAS,iBAAiB,IAAA,EAAM,IAAA,CAAK,KAAA,EAAO,IAAI,CAAC,CAAA;AACrE;AAKO,SAAS,qBAGd,MAAA,EAAqE;AAGrE,EAAA,MAAM;AAAA,IACJ,OAAA;AAAA,IACA,IAAA;AAAA,IACA,OAAA;AAAA,IACA,mBAAA;AAAA,IACA,SAAA,EAAAC,UAAAA;AAAA,IACA,aAAA,EAAeC,kBAAAA;AAAA,IACf,0BAAA,EAA4BC,+BAAAA;AAAA,IAC5B,kBAAA,EAAoBC,uBAAAA;AAAA,IACpB,aAAA,EAAeC,kBAAAA;AAAA,IACf,mBAAA,EAAqBC,wBAAAA;AAAA,IACrB,aAAA,EAAeC,kBAAAA;AAAA,IACf,iBAAA,EAAmBC,sBAAAA;AAAA,IACnB,kBAAA;AAAA,IACA,WAAA;AAAA,IACA,8BAAA;AAAA,IACA,kCAAA;AAAA,IACA,uBAAA;AAAA,IACA,2BAAA;AAAA,IACA;AAAA,GACF,GAAI,MAAA;AAEJ,EAAA,OAAO;AAAA,IACL,MAAM,MAAA,CACJ,KAAA,EACA,OAAA,EACkB;AAClB,MAAA,OAAO,IAAA,CAAK,gBAAA,CAAiB,KAAA,EAAO,OAAO,CAAA;AAAA,IAC7C,CAAA;AAAA,IAEA,MAAM,gBAAA,CACJ,IAAA,EACA,OAAA,EACkB;AAClB,MAAA,MAAM,SAAS,MAAMN,kBAAAA;AAAA,QACnB,gBAAA,CAAiB,IAAA,EAAM,IAAA,EAAM,OAAO,CAAA;AAAA,QACpC;AAAA,OACF;AACA,MAAA,OAAO,WAAc,MAAM,CAAA;AAAA,IAC7B,CAAA;AAAA,IAEA,MAAM,OAAA,CACJ,EAAA,EACA,OAAA,EAC8B;AAC9B,MAAA,MAAM,MAAM,MAAM,OAAA,CAAQ,OAAA,CAAQ,OAAA,EAAS,MAAM,EAAE,CAAA;AACnD,MAAA,IAAI,CAAC,KAAK,OAAO,MAAA;AACjB,MAAA,IAAI,CAAC,kBAAA,CAAmB,OAAO,CAAA,CAAE,GAAG,GAAG,OAAO,MAAA;AAC9C,MAAA,OAAO,UAAA,CAAcD,UAAAA,CAAU,GAAG,CAAC,CAAA;AAAA,IACrC,CAAA;AAAA,IAEA,MAAM,QAAA,CACJ,GAAA,EACA,OAAA,EAC2C;AAC3C,MAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAE9B,MAAA,MAAM,WAAW,MAAM,gBAAA,CAAiB,OAAA,EAAS,OAAA,EAAS,MAAM,GAAG,CAAA;AAEnE,MAAA,MAAM,OAAA,GAAU,mBAAmB,OAAO,CAAA;AAC1C,MAAA,OAAO,GAAA,CAAI,GAAA,CAAI,CAAC,EAAA,KAAO;AACrB,QAAA,MAAM,GAAA,GAAM,QAAA,CAAS,GAAA,CAAI,EAAE,CAAA;AAC3B,QAAA,IAAI,CAAC,GAAA,EAAK;AACV,QAAA,IAAI,CAAC,OAAA,CAAQ,GAAG,CAAA,EAAG;AACnB,QAAA,OAAO,UAAA,CAAcA,UAAAA,CAAU,GAAG,CAAC,CAAA;AAAA,MACrC,CAAC,CAAA;AAAA,IACH,CAAA;AAAA,IAEA,MAAM,MAAA,CACJ,EAAA,EACA,KAAA,EACA,OAAA,EACkB;AAClB,MAAA,MAAM,SAAS,MAAMI,kBAAAA;AAAA,QACnB,gBAAA,CAAiB,IAAA,EAAM,EAAA,EAAI,KAAA,EAAO,OAAO,CAAA;AAAA,QACzC;AAAA,OACF;AACA,MAAA,OAAO,WAAc,MAAM,CAAA;AAAA,IAC7B,CAAA;AAAA,IAEA,MAAM,OAAO,EAAA,EAA8B;AACzC,MAAA,MAAME,kBAAAA,CAAkB,IAAA,EAAM,EAAA,EAAI,OAAO,CAAA;AAAA,IAC3C,CAAA;AAAA,IAEA,MAAM,WAAW,EAAA,EAA8B;AAC7C,MAAA,MAAMC,sBAAAA,CAAsB,IAAA,EAAM,EAAA,EAAI,OAAO,CAAA;AAAA,IAC/C,CAAA;AAAA,IAEA,MAAM,IAAA,CACJ,MAAA,EAKA,QAAA,EACoB;AACpB,MAAA,IAAI,MAAA,EAAQ,KAAA,KAAU,MAAA,IAAa,WAAA,KAAgB,MAAA,EAAW;AAC5D,QAAA,MAAM,IAAI,kBAAA;AAAA,UACR,eAAe,IAAI,CAAA,+CAAA,CAAA;AAAA,UACnB,EAAE,IAAA,EAAM,SAAA,EAAW,MAAA;AAAO,SAC5B;AAAA,MACF;AACA,MAAA,IAAI,MAAA,EAAQ,KAAA,KAAU,MAAA,IAAa,WAAA,KAAgB,MAAA,EAAW;AAS5D,QAAA,MAAM,EAAE,YAAA,EAAc,IAAA,EAAK,GAAI,yBAAA;AAAA,UAC7B,QAAA;AAAA,UACA;AAAA,SACF;AACA,QAAA,IAAI,KAAA,GAAQ,aAAY,CACrB,IAAA,CAAK,MAAM,IAAI,CAAA,CACf,QAAA,CAAS,IAAA,KAAS,MAAA,GAAY,YAAA,GAAe,QAAQ,IAAI,CAAA,CACzD,SAAA,CAAU,IAAA,EAAM,MAAA,CAAO,KAAc,EACrC,MAAA,CAAO,CAAC,GAAA,KAAiC,GAAA,CAAI,EAAE,CAAA;AAClD,QAAA,IAAI,OAAO,KAAA,KAAU,MAAA,UAAmB,KAAA,CAAM,KAAA,CAAM,OAAO,KAAK,CAAA;AAChE,QAAA,IAAI,OAAO,MAAA,KAAW,MAAA,UAAmB,KAAA,CAAM,MAAA,CAAO,OAAO,MAAM,CAAA;AACnE,QAAA,MAAM,OAAA,GAAU,MAAM,KAAA,CAAM,OAAA,EAAQ;AACpC,QAAA,OAAO,OAAA;AAAA,MACT;AAEA,MAAA,MAAM,MAAA,GAKmB;AAAA,QACvB,OAAA;AAAA,QACA,IAAA;AAAA,QACA,GAAG,yBAAA,CAA0B,QAAA,EAAU,mBAAmB;AAAA,OAC5D;AACA,MAAA,IAAI,MAAA,EAAQ,KAAA,KAAU,MAAA,EAAW,MAAA,CAAO,QAAQ,MAAA,CAAO,KAAA;AACvD,MAAA,IAAI,MAAA,EAAQ,MAAA,KAAW,MAAA,EAAW,MAAA,CAAO,SAAS,MAAA,CAAO,MAAA;AAEzD,MAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,eAAA,CAAgB,MAAM,CAAA;AACjD,MAAA,OAAO,IAAA,CAAK,IAAI,CAAC,GAAA,KAAQ,WAAcP,UAAAA,CAAU,GAAG,CAAC,CAAC,CAAA;AAAA,IACxD,CAAA;AAAA,IAEA,MAAM,MAAM,QAAA,EAA0C;AACpD,MAAA,MAAM,MAAA,GAGmB;AAAA,QACvB,OAAA;AAAA,QACA,IAAA;AAAA,QACA,GAAG,yBAAA,CAA0B,QAAA,EAAU,mBAAmB;AAAA,OAC5D;AACA,MAAA,OAAO,OAAA,CAAQ,iBAAiB,MAAM,CAAA;AAAA,IACxC,CAAA;AAAA,IAEA,MAAM,UAAA,CACJ,EAAA,EACA,KAAA,EACA,OAAA,EACkB;AAClB,MAAA,OAAO,IAAA,CAAK,oBAAA,CAAqB,EAAA,EAAI,KAAA,EAAO,OAAO,CAAA;AAAA,IACrD,CAAA;AAAA,IAEA,MAAM,oBAAA,CACJ,EAAA,EACA,IAAA,EACA,OAAA,EACkB;AAClB,MAAA,MAAM,WAAW,MAAM,OAAA,CAAQ,OAAA,CAAQ,OAAA,EAAS,MAAM,EAAE,CAAA;AAExD,MAAA,IAAI,QAAA,EAAU;AACZ,QAAA,MAAM,YAAA,GAAe,SAAS,UAAA,KAAe,MAAA;AAC7C,QAAA,MAAMQ,UAAS,MAAMJ,kBAAAA;AAAA,UACnB,gBAAA,CAAiB,IAAA,EAAM,EAAA,EAAI,IAAA,EAAM,OAAO,CAAA;AAAA,UACxC,OAAA;AAAA,UACA,EAAE,YAAA;AAAa,SACjB;AACA,QAAA,OAAO,WAAcI,OAAM,CAAA;AAAA,MAC7B;AAEA,MAAA,MAAM,SAAS,MAAMP,kBAAAA;AAAA,QACnB,iBAAiB,IAAA,EAAM,IAAA,EAAM,EAAE,GAAG,OAAA,EAAS,IAAI,CAAA;AAAA,QAC/C;AAAA,OACF;AACA,MAAA,OAAO,WAAc,MAAM,CAAA;AAAA,IAC7B,CAAA;AAAA,IAEA,MAAM,WACJ,KAAA,EAMoB;AACpB,MAAA,MAAM,WAAA,GAAc,iBAAA,CAAkB,IAAA,EAAM,KAAK,CAAA;AAEjD,MAAA,IAAI,OAAA,CAAQ,YAAA,CAAa,YAAA,IAAgB,aAAA,IAAiB,OAAA,EAAS;AACjE,QAAA,MAAMH,QAAAA,GAAU,MAAM,OAAA,CAAQ,WAAA;AAAA,UAAY,OAAO,SAAA,KAC/CK,uBAAAA,CAAuB,WAAA,EAAa,SAAS;AAAA,SAC/C;AACA,QAAA,OAAO,YAAeL,QAAO,CAAA;AAAA,MAC/B;AACA,MAAA,MAAM,OAAA,GAAU,MAAMK,uBAAAA,CAAuB,WAAA,EAAa,OAAO,CAAA;AACjE,MAAA,OAAO,YAAe,OAAO,CAAA;AAAA,IAC/B,CAAA;AAAA,IAEA,MAAM,eACJ,KAAA,EAMoB;AACpB,MAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAEhC,MAAA,MAAM,SAAA,GAAY,OAChB,MAAA,KACuB;AACvB,QAAA,MAAM,MAAM,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,KAAK,EAAE,CAAA;AACvC,QAAA,MAAM,WAAA,uBAAkB,GAAA,EAKtB;AAEF,QAAA,IAAI,MAAA,CAAO,aAAa,MAAA,EAAW;AACjC,UAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,GAAA;AAAA,YACzB,GAAA,CAAI,IAAI,CAAC,EAAA,KAAO,OAAO,OAAA,CAAQ,OAAA,EAAS,IAAA,EAAM,EAAE,CAAC;AAAA,WACnD;AACA,UAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,YAAA,IAAI,QAAQ,MAAA,EAAW,WAAA,CAAY,GAAA,CAAI,GAAA,CAAI,IAAI,GAAG,CAAA;AAAA,UACpD;AAAA,QACF,CAAA,MAAO;AACL,UAAA,MAAM,OAAO,MAAM,MAAA,CAAO,QAAA,CAAS,OAAA,EAAS,MAAM,GAAG,CAAA;AACrD,UAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,YAAA,WAAA,CAAY,GAAA,CAAI,GAAA,CAAI,EAAA,EAAI,GAAG,CAAA;AAAA,UAC7B;AAAA,QACF;AAGA,QAAA,MAAM,WAAwD,EAAC;AAC/D,QAAA,MAAM,WAIA,EAAC;AAEP,QAAA,IAAI,SAAA,GAAY,CAAA;AAChB,QAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,UAAA,MAAM,QAAA,GAAW,WAAA,CAAY,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAExC,UAAA,IAAI,QAAA,EAAU;AACZ,YAAA,QAAA,CAAS,IAAA,CAAK;AAAA,cACZ,KAAA,EAAO,SAAA;AAAA,cACP,OAAO,gBAAA,CAAiB,IAAA,EAAM,KAAK,EAAA,EAAI,IAAA,CAAK,OAAO,IAAI,CAAA;AAAA,cACvD,YAAA,EAAc,SAAS,UAAA,KAAe;AAAA,aACvC,CAAA;AAAA,UACH,CAAA,MAAO;AACL,YAAA,QAAA,CAAS,IAAA,CAAK;AAAA,cACZ,KAAA,EAAO,SAAA;AAAA,cACP,KAAA,EAAO,gBAAA,CAAiB,IAAA,EAAM,IAAA,CAAK,OAAO,IAAI;AAAA,aAC/C,CAAA;AAAA,UACH;AACA,UAAA,SAAA,EAAA;AAAA,QACF;AAGA,QAAA,MAAM,UAAqB,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,KAAA,CAAM,QAAQ,CAAA;AAE9D,QAAA,IAAI,QAAA,CAAS,SAAS,CAAA,EAAG;AACvB,UAAA,MAAM,eAAe,QAAA,CAAS,GAAA,CAAI,CAACf,MAAAA,KAAUA,OAAM,KAAK,CAAA;AACxD,UAAA,MAAM,OAAA,GAAU,MAAMe,uBAAAA,CAAuB,YAAA,EAAc,MAAM,CAAA;AACjE,UAAA,KAAA,MAAW,CAAC,KAAA,EAAOf,MAAK,CAAA,IAAK,QAAA,CAAS,SAAQ,EAAG;AAC/C,YAAA,OAAA,CAAQA,OAAM,KAAK,CAAA,GAAI,UAAA,CAAc,OAAA,CAAQ,KAAK,CAAE,CAAA;AAAA,UACtD;AAAA,QACF;AAGA,QAAA,KAAA,MAAWA,UAAS,QAAA,EAAU;AAC5B,UAAA,MAAM,MAAA,GAAS,MAAMiB,wBAAAA,CAAwBjB,MAAAA,CAAM,OAAO,MAAA,EAAQ;AAAA,YAChE,cAAcA,MAAAA,CAAM;AAAA,WACrB,CAAA;AACD,UAAA,OAAA,CAAQA,MAAAA,CAAM,KAAK,CAAA,GAAI,UAAA,CAAc,MAAM,CAAA;AAAA,QAC7C;AAEA,QAAA,OAAO,OAAA;AAAA,MACT,CAAA;AAEA,MAAA,IAAI,OAAA,CAAQ,YAAA,CAAa,YAAA,IAAgB,aAAA,IAAiB,OAAA,EAAS;AACjE,QAAA,OAAO,QAAQ,WAAA,CAAY,OAAO,SAAA,KAAc,SAAA,CAAU,SAAS,CAAC,CAAA;AAAA,MACtE;AACA,MAAA,OAAO,UAAU,OAAO,CAAA;AAAA,IAC1B,CAAA;AAAA,IAEA,MAAM,WACJ,KAAA,EAMe;AACf,MAAA,MAAM,WAAA,GAAc,iBAAA,CAAkB,IAAA,EAAM,KAAK,CAAA;AAEjD,MAAA,IAAI,OAAA,CAAQ,YAAA,CAAa,YAAA,IAAgB,aAAA,IAAiB,OAAA,EAAS;AACjE,QAAA,MAAM,OAAA,CAAQ,WAAA,CAAY,OAAO,SAAA,KAAc;AAC7C,UAAA,MAAMc,+BAAAA,CAA+B,aAAa,SAAS,CAAA;AAAA,QAC7D,CAAC,CAAA;AACD,QAAA;AAAA,MACF;AAEA,MAAA,MAAMA,+BAAAA,CAA+B,aAAa,OAAO,CAAA;AAAA,IAC3D,CAAA;AAAA,IAEA,MAAM,WAAW,GAAA,EAA0C;AACzD,MAAA,IAAI,GAAA,CAAI,WAAW,CAAA,EAAG;AACtB,MAAA,MAAM,SAAA,GAAY,OAChB,MAAA,KACkB;AAClB,QAAA,KAAA,MAAW,MAAM,GAAA,EAAK;AACpB,UAAA,MAAMI,kBAAAA,CAAkB,IAAA,EAAM,EAAA,EAAI,MAAM,CAAA;AAAA,QAC1C;AAAA,MACF,CAAA;AACA,MAAA,IAAI,OAAA,CAAQ,YAAA,CAAa,YAAA,IAAgB,aAAA,IAAiB,OAAA,EAAS;AACjE,QAAA,MAAM,QAAQ,WAAA,CAAY,OAAO,SAAA,KAAc,SAAA,CAAU,SAAS,CAAC,CAAA;AACnE,QAAA;AAAA,MACF;AACA,MAAA,MAAM,UAAU,OAAO,CAAA;AAAA,IACzB,CAAA;AAAA,IAEA,MAAM,gBAAA,CACJ,cAAA,EACA,KAAA,EAC8B;AAC9B,MAAA,MAAM,SAAS,MAAM,uBAAA;AAAA,QACnB,IAAA;AAAA,QACA,cAAA;AAAA,QACA,KAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,OAAO,MAAA,KAAW,MAAA,GAAY,MAAA,GAAY,UAAA,CAAc,MAAM,CAAA;AAAA,IAChE,CAAA;AAAA,IAEA,MAAM,oBAAA,CACJ,cAAA,EACA,KAAA,EAGkC;AAClC,MAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAEhC,MAAA,MAAM,WAAA,GAAc,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,MAAU;AAAA,QACvC,OAAO,IAAA,CAAK;AAAA,OACd,CAAE,CAAA;AAEF,MAAA,MAAM,UAAU,MAAM,2BAAA;AAAA,QACpB,IAAA;AAAA,QACA,cAAA;AAAA,QACA,WAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,OAAO,OAAA,CAAQ,GAAA;AAAA,QAAI,CAAC,MAAA,KAClB,MAAA,KAAW,MAAA,GAAY,MAAA,GAAY,WAAc,MAAM;AAAA,OACzD;AAAA,IACF,CAAA;AAAA,IAEA,MAAM,eAAA,CACJ,SAAA,EACA,KAAA,EAGA,OAAA,EAC+B;AAC/B,MAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAEhC,MAAA,MAAM,WAAA,GAAc,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,MAAU;AAAA,QACvC,OAAO,IAAA,CAAK;AAAA,OACd,CAAE,CAAA;AAEF,MAAA,MAAM,UAAU,MAAM,sBAAA;AAAA,QACpB,IAAA;AAAA,QACA,SAAA;AAAA,QACA,WAAA;AAAA,QACA,OAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,OAAO,QAAQ,GAAA,CAAI,CAAC,MAAA,KAAW,WAAA,CAAe,MAAM,CAAC,CAAA;AAAA,IACvD,CAAA;AAAA,IAEA,MAAM,uBAAA,CACJ,cAAA,EACA,KAAA,EACA,OAAA,EAC+C;AAC/C,MAAA,MAAM,OAAA,GAAU,OACd,MAAA,KACkD;AAClD,QAAA,MAAM,SAAS,MAAM,8BAAA;AAAA,UACnB,IAAA;AAAA,UACA,cAAA;AAAA,UACA,KAAA;AAAA,UACA,MAAA;AAAA,UACA;AAAA,SACF;AACA,QAAA,OAAO,MAAA;AAAA,MACT,CAAA;AAEA,MAAA,IAAI,OAAA,CAAQ,YAAA,CAAa,YAAA,IAAgB,aAAA,IAAiB,OAAA,EAAS;AACjE,QAAA,OAAO,QAAQ,WAAA,CAAY,OAAO,SAAA,KAAc,OAAA,CAAQ,SAAS,CAAC,CAAA;AAAA,MACpE;AACA,MAAA,OAAO,QAAQ,OAAO,CAAA;AAAA,IACxB,CAAA;AAAA,IAEA,MAAM,2BAAA,CACJ,cAAA,EACA,KAAA,EAGA,OAAA,EACiD;AACjD,MAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAEhC,MAAA,MAAM,WAAA,GAAc,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,MAAU;AAAA,QACvC,OAAO,IAAA,CAAK;AAAA,OACd,CAAE,CAAA;AAEF,MAAA,MAAM,cAAA,GAAiB,OACrB,MAAA,KACoD;AACpD,QAAA,MAAM,UAAU,MAAM,kCAAA;AAAA,UACpB,IAAA;AAAA,UACA,cAAA;AAAA,UACA,WAAA;AAAA,UACA,MAAA;AAAA,UACA;AAAA,SACF;AACA,QAAA,OAAO,OAAA;AAAA,MACT,CAAA;AAEA,MAAA,IAAI,OAAA,CAAQ,YAAA,CAAa,YAAA,IAAgB,aAAA,IAAiB,OAAA,EAAS;AACjE,QAAA,OAAO,OAAA,CAAQ,WAAA;AAAA,UAAY,OAAO,SAAA,KAChC,cAAA,CAAe,SAAS;AAAA,SAC1B;AAAA,MACF;AACA,MAAA,OAAO,eAAe,OAAO,CAAA;AAAA,IAC/B;AAAA,GACF;AACF;;;ACzbO,SAAS,0BAAA,CACd,KAAA,EACA,OAAA,EACA,QAAA,EACA,SACA,UAAA,EACyB;AACzB,EAAA,MAAM,eAAA,uBAAsB,GAAA,EAAqB;AAKjD,EAAA,OAAO,IAAI,KAAA,CAAM,EAAC,EAAyC;AAAA,IACzD,GAAA,EAAK,CAAC,CAAA,EAAG,IAAA,KAAiB;AACxB,MAAA,IAAI,CAAC,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,KAAA,EAAO,IAAI,CAAA,EAAG;AACrC,QAAA,MAAM,IAAI,iBAAA,CAAkB,IAAA,EAAM,MAAM,CAAA;AAAA,MAC1C;AAEA,MAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,GAAA,CAAI,IAAI,CAAA;AACvC,MAAA,IAAI,WAAW,MAAA,EAAW;AACxB,QAAA,OAAO,MAAA;AAAA,MACT;AAEA,MAAA,MAAM,aAAa,oBAAA,CAAqB;AAAA,QACtC,OAAA;AAAA,QACA,IAAA;AAAA,QACA,OAAA;AAAA,QACA,GAAG;AAAA,OACJ,CAAA;AACD,MAAA,eAAA,CAAgB,GAAA,CAAI,MAAM,UAAU,CAAA;AACpC,MAAA,OAAO,UAAA;AAAA,IACT;AAAA,GACD,CAAA;AACH;AAQO,SAAS,0BAAA,CACd,KAAA,EACA,OAAA,EACA,QAAA,EACA,SACA,UAAA,EACyB;AACzB,EAAA,MAAM,eAAA,uBAAsB,GAAA,EAAqB;AAKjD,EAAA,OAAO,IAAI,KAAA,CAAM,EAAC,EAAyC;AAAA,IACzD,GAAA,EAAK,CAAC,CAAA,EAAG,IAAA,KAAiB;AACxB,MAAA,IAAI,CAAC,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,KAAA,EAAO,IAAI,CAAA,EAAG;AACrC,QAAA,MAAM,IAAI,iBAAA,CAAkB,IAAA,EAAM,MAAM,CAAA;AAAA,MAC1C;AAEA,MAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,GAAA,CAAI,IAAI,CAAA;AACvC,MAAA,IAAI,WAAW,MAAA,EAAW;AACxB,QAAA,OAAO,MAAA;AAAA,MACT;AAEA,MAAA,MAAM,aAAa,oBAAA,CAAqB;AAAA,QACtC,OAAA;AAAA,QACA,IAAA;AAAA,QACA,OAAA;AAAA,QACA,GAAG;AAAA,OACJ,CAAA;AACD,MAAA,eAAA,CAAgB,GAAA,CAAI,MAAM,UAAU,CAAA;AACpC,MAAA,OAAO,UAAA;AAAA,IACT;AAAA,GACD,CAAA;AACH;;;AC/JO,SAAS,gBAAA,CACd,OACA,OAAA,EACqB;AACrB,EAAA,MAAM,YAAY,KAAA,CAAM,SAAA;AACxB,EAAA,MAAM,EAAE,KAAA,EAAO,gBAAA,EAAkB,OAAO,gBAAA,EAAiB,GACvD,mBAAmB,SAAS,CAAA;AAC9B,EAAA,MAAM,aAAa,KAAA,CAAM,eAAA;AAEzB,EAAA,MAAM,QAA6B,EAAC;AACpC,EAAA,KAAA,MAAW,CAAC,MAAM,YAAY,CAAA,IAAK,OAAO,OAAA,CAAQ,KAAA,CAAM,KAAK,CAAA,EAAG;AAC9D,IAAA,MAAM,GAAA,GAAM,YAAA;AACZ,IAAA,KAAA,CAAM,IAAA,CAAK;AAAA,MACT,IAAA;AAAA,MACA,MAAA,EAAQ,gBAAA,CAAiB,GAAA,CAAI,IAAI,IAAI,SAAA,GAAY,cAAA;AAAA,MACjD,WAAA,EAAa,IAAI,IAAA,CAAK,WAAA;AAAA,MACtB,WAAA,EAAa,IAAI,IAAA,CAAK,WAAA;AAAA,MACtB,UAAA,EAAY,UAAA,CAAW,GAAA,CAAI,IAAI,CAAA;AAAA,MAC/B,UAAA,EAAY,yBAAA,CAA0B,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AAAA,MACrD,SAAS,GAAA,CAAI,MAAA,IAAU,EAAC,EAAG,GAAA,CAAI,CAAC,UAAA,MAAgB;AAAA,QAC9C,MAAM,UAAA,CAAW,IAAA;AAAA,QACjB,MAAA,EAAQ,CAAC,GAAG,UAAA,CAAW,MAAM,CAAA;AAAA,QAC7B,OAAO,UAAA,CAAW,KAAA;AAAA,QAClB,WAAW,UAAA,CAAW;AAAA,OACxB,CAAE;AAAA,KACH,CAAA;AAAA,EACH;AAEA,EAAA,MAAM,QAA6B,EAAC;AACpC,EAAA,KAAA,MAAW,CAAC,MAAM,YAAY,CAAA,IAAK,OAAO,OAAA,CAAQ,KAAA,CAAM,KAAK,CAAA,EAAG;AAC9D,IAAA,MAAM,GAAA,GAAM,YAAA;AACZ,IAAA,MAAM,WAAW,GAAA,CAAI,IAAA;AACrB,IAAA,KAAA,CAAM,IAAA,CAAK;AAAA,MACT,IAAA;AAAA,MACA,MAAA,EAAQ,gBAAA,CAAiB,GAAA,CAAI,IAAI,IAAI,SAAA,GAAY,cAAA;AAAA,MACjD,aAAa,QAAA,CAAS,WAAA;AAAA,MACtB,MAAM,GAAA,CAAI,IAAA,CAAK,IAAI,CAAClB,MAAAA,KAAWA,OAAqC,IAAI,CAAA;AAAA,MACxE,IAAI,GAAA,CAAI,EAAA,CAAG,IAAI,CAACA,MAAAA,KAAWA,OAAqC,IAAI,CAAA;AAAA,MACpE,WAAA,EAAa,IAAI,WAAA,IAAe,MAAA;AAAA,MAChC,iBAAA,EAAmB,IAAI,iBAAA,IAAqB,YAAA;AAAA,MAC5C,UAAA,EAAY,yBAAA,CAA0B,QAAA,CAAS,MAAM,CAAA;AAAA,MACrD,aAAa,QAAA,CAAS,WAAA;AAAA,MACtB,UAAA,EAAY,UAAA,CAAW,GAAA,CAAI,IAAI;AAAA,KAChC,CAAA;AAAA,EACH;AAEA,EAAA,MAAM,mBAAA,GAAsB,kCAAkC,SAAS,CAAA;AACvE,EAAA,MAAM,QAAA,GAAoC,KAAA,CAAM,QAAA,CAAS,GAAA,CAAI,CAAC,QAAA,MAAc;AAAA,IAC1E,QAAA,EAAU,SAAS,QAAA,CAAS,IAAA;AAAA,IAC5B,IAAA,EAAM,WAAA,CAAY,QAAA,CAAS,IAAI,CAAA;AAAA,IAC/B,EAAA,EAAI,WAAA,CAAY,QAAA,CAAS,EAAE,CAAA;AAAA,IAC3B,QACE,mBAAA,CAAoB,GAAA,CAAI,uBAAuB,QAAQ,CAAC,IAAI,SAAA,GAC1D;AAAA,GAEN,CAAE,CAAA;AAEF,EAAA,OAAO;AAAA,IACL,SAAS,OAAA,CAAQ,OAAA;AAAA,IACjB,eAAe,OAAA,CAAQ,aAAA;AAAA,IACvB,YAAY,OAAA,CAAQ,UAAA;AAAA,IACpB,KAAA;AAAA,IACA,KAAA;AAAA,IACA,QAAA;AAAA,IACA,eAAA,EAAiB,IAAI,GAAA,CAAI,UAAU,CAAA;AAAA,IACnC;AAAA,GACF;AACF;;;ACzJA,eAAsB,wBAAA,CACpB,SACA,aAAA,EACe;AACf,EAAA,IAAI,kBAAkB,MAAA,EAAW;AAC/B,IAAA,MAAM,aAAA,EAAc;AACpB,IAAA;AAAA,EACF;AACA,EAAA,MAAM,QAAQ,eAAA,IAAkB;AAClC;AAWA,eAAsB,kBAAA,CAIpB,KAAA,EACA,OAAA,EACA,MAAA,EAC4B;AAC5B,EAAA,IAAI,OAAA,CAAQ,gBAAgB,IAAA,EAAM;AAChC,IAAA,MAAM,UAAoB,EAAC;AAC3B,IAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,MAAA,MAAMA,MAAAA,GAAQ,MAAM,MAAA,CAAO,IAAI,CAAA;AAC/B,MAAA,OAAA,CAAQ,KAAKA,MAAK,CAAA;AAClB,MAAA,IAAIA,MAAAA,CAAM,WAAW,QAAA,EAAU;AAAA,IACjC;AACA,IAAA,OAAO,OAAA;AAAA,EACT;AACA,EAAA,OAAO,OAAA,CAAQ,IAAI,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,MAAA,CAAO,IAAI,CAAC,CAAC,CAAA;AACtD;;;ACkCA,eAAsB,kBAAA,CACpB,OAAA,EACA,OAAA,GAAqC,EAAC,EACH;AACnC,EAAA,MAAM,EAAE,KAAA,EAAO,OAAA,EAAS,OAAA,EAAS,eAAc,GAAI,OAAA;AAEnD,EAAA,IAAI,OAAA,CAAQ,eAAe,MAAA,EAAW;AACpC,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,2LAAA;AAAA,MAGA,EAAE,MAAM,iCAAA;AAAkC,KAC5C;AAAA,EACF;AACA,EAAA,IACE,OAAA,CAAQ,uBAAA,KAA4B,MAAA,IACpC,OAAA,CAAQ,+BAA+B,MAAA,EACvC;AACA,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,gPAAA;AAAA,MAIA,EAAE,MAAM,iCAAA;AAAkC,KAC5C;AAAA,EACF;AAEA,EAAA,MAAM,QAAA,GAAW,KAAA,CAAM,OAAA,IAAW,EAAC;AACnC,EAAA,MAAM,UAAA,GACJ,QAAQ,KAAA,KAAU,MAAA,GAAY,SAAY,IAAI,GAAA,CAAI,QAAQ,KAAK,CAAA;AAEjE,EAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,IAAA,KAAA,MAAW,QAAQ,UAAA,EAAY;AAC7B,MAAA,IAAI,CAAC,WAAA,CAAY,KAAA,EAAO,IAAI,CAAA,EAAG;AAC7B,QAAA,MAAM,IAAI,iBAAA;AAAA,UACR,IAAA;AAAA,UACA,OAAO,MAAA,CAAO,KAAA,CAAM,KAAA,EAAO,IAAI,IAAI,MAAA,GAAS,MAAA;AAAA,UAC5C;AAAA,YACE,OAAA;AAAA,YACA,UAAA,EACE;AAAA;AACJ,SACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,aAAa,QAAA,CAAS,MAAA;AAAA,IAAO,CAAC,UAClC,UAAA,KAAe,MAAA,GAAY,OAAO,UAAA,CAAW,GAAA,CAAI,MAAM,IAAI;AAAA,GAC7D;AAMA,EAAA,IAAI,UAAA,CAAW,WAAW,CAAA,EAAG;AAC3B,IAAA,OAAO,EAAE,OAAA,EAAS,EAAC,EAAE;AAAA,EACvB;AAEA,EAAA,MAAM,wBAAA;AAAA,IACJ,OAAA;AAAA,IACA,OAAA,CAAQ;AAAA,GACV;AAEA,EAAA,MAAM,UAAU,OAAA,CAAQ,OAAA;AACxB,EAAA,MAAM,aAAa,OAAA,CAAQ,UAAA;AAC3B,EAAA,MAAM,UAAA,GAAa;AAAA,IACjB,WAAA,EAAa,IAAA;AAAA,IACb,YAAY,OAAA,KAAY,UAAA;AAAA,IACxB,GAAI,YAAY,KAAA,KAAU,MAAA,GACxB,EAAC,GACD,EAAE,cAAA,EAAgB,UAAA,CAAW,KAAA,EAAM;AAAA,IACrC,GAAI,YAAY,KAAA,KAAU,MAAA,GACxB,EAAC,GACD,EAAE,cAAA,EAAgB,UAAA,CAAW,KAAA;AAAM,GACvC;AAMA,EAAA,MAAM,aAAa,UAAA,CAAW,GAAA;AAAA,IAAI,CAAC,WAAA,KACjC,YAAA,CAAa,WAAA,EAAa,OAAO;AAAA,GACnC;AACA,EAAA,MAAM,sBAAsB,MAAM,uBAAA;AAAA,IAChC,OAAA;AAAA,IACA;AAAA,GACF;AAEA,EAAA,MAAM,gBAAA,GAAmB,CACvB,WAAA,KAEA,WAAA,CAAY,WAAW,QAAA,GACrB,sBAAA;AAAA,IACE,WAAA;AAAA,IACA,OAAA;AAAA,IACA,OAAA;AAAA,IACA,aAAA;AAAA,IACA;AAAA,GACF,GACA,0BAAA;AAAA,IACE,WAAA;AAAA,IACA,OAAA;AAAA,IACA,OAAA;AAAA,IACA,UAAA;AAAA,IACA,OAAA;AAAA,IACA,aAAA;AAAA,IACA;AAAA,GACF;AAEJ,EAAA,IAAI,OAAA,CAAQ,gBAAgB,IAAA,EAAM;AAChC,IAAA,MAAM,UAAqC,EAAC;AAC5C,IAAA,KAAA,MAAW,eAAe,UAAA,EAAY;AACpC,MAAA,MAAMA,MAAAA,GAAQ,MAAM,gBAAA,CAAiB,WAAW,CAAA;AAChD,MAAA,OAAA,CAAQ,KAAKA,MAAK,CAAA;AAClB,MAAA,IAAIA,MAAAA,CAAM,WAAW,QAAA,EAAU;AAAA,IACjC;AACA,IAAA,OAAO,EAAE,OAAA,EAAQ;AAAA,EACnB;AAUA,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAqC;AACzD,EAAA,KAAA,MAAW,eAAe,UAAA,EAAY;AACpC,IAAA,MAAM,GAAA,GAAM,kBAAkB,WAAW,CAAA;AACzC,IAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AAC5B,IAAA,IAAI,SAAS,MAAA,EAAW,OAAA,CAAQ,IAAI,GAAA,EAAK,CAAC,WAAW,CAAC,CAAA;AAAA,SACjD,IAAA,CAAK,KAAK,WAAW,CAAA;AAAA,EAC5B;AAEA,EAAA,MAAM,aAAA,GAAgB,MAAM,OAAA,CAAQ,GAAA;AAAA,IAClC,CAAC,GAAG,OAAA,CAAQ,MAAA,EAAQ,CAAA,CAAE,GAAA,CAAI,OAAO,KAAA,KAAU;AACzC,MAAA,MAAM,MAAiC,EAAC;AACxC,MAAA,KAAA,MAAW,eAAe,KAAA,EAAO;AAC/B,QAAA,GAAA,CAAI,IAAA,CAAK,MAAM,gBAAA,CAAiB,WAAW,CAAC,CAAA;AAAA,MAC9C;AACA,MAAA,OAAO,GAAA;AAAA,IACT,CAAC;AAAA,GACH;AAIA,EAAA,MAAM,aAAA,uBAAoB,GAAA,EAA+C;AACzE,EAAA,IAAI,WAAA,GAAc,CAAA;AAClB,EAAA,KAAA,MAAW,KAAA,IAAS,OAAA,CAAQ,MAAA,EAAO,EAAG;AACpC,IAAA,MAAM,OAAA,GAAU,cAAc,WAAW,CAAA;AACzC,IAAA,KAAA,MAAW,CAAC,gBAAA,EAAkB,WAAW,CAAA,IAAK,KAAA,CAAM,SAAQ,EAAG;AAC7D,MAAA,aAAA,CAAc,GAAA,CAAI,WAAA,EAAa,OAAA,CAAQ,gBAAgB,CAAE,CAAA;AAAA,IAC3D;AACA,IAAA,WAAA,IAAe,CAAA;AAAA,EACjB;AACA,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,WAAW,GAAA,CAAI,CAAC,gBAAgB,aAAA,CAAc,GAAA,CAAI,WAAW,CAAE;AAAA,GAC1E;AACF;AAEA,SAAS,kBAAkB,WAAA,EAA4C;AAQrE,EAAA,OAAO,WAAA,CAAY,MAAA;AACrB;AAEA,eAAe,2BACb,WAAA,EACA,OAAA,EACA,SACA,UAAA,EAMA,OAAA,EACA,eACA,mBAAA,EACkC;AAClC,EAAA,MAAM,GAAA,GAAM,gBAAA,CAAiB,WAAA,EAAa,OAAA,EAAS,UAAU,CAAA;AAC7D,EAAA,MAAM,WAAA,GACJ,YAAY,MAAA,KAAW,MAAA,GACpB,WAAW,cAAA,IAAkB,iBAAA,GAC7B,WAAW,cAAA,IAAkB,iBAAA;AAClC,EAAA,MAAM,YAAY,MAAM,qBAAA;AAAA,IACtB,OAAA;AAAA,IACA,WAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,OAAO,cAAA,CAAe,WAAA,EAAa,OAAA,EAAS,OAAA,EAAS,aAAA,EAAe;AAAA,IAClE,WAAW,WAAA,CAAY,IAAA;AAAA,IACvB,SAAA;AAAA,IACA,UAAA,EAAY,OAAA;AAAA,IACZ,GAAA,EAAK,MAAM,OAAA,CAAQ,UAAA,CAAY,GAAG,CAAA;AAAA,IAClC;AAAA,GACD,CAAA;AACH;AAEA,eAAe,sBAAA,CACb,WAAA,EACA,OAAA,EACA,OAAA,EACA,eACA,mBAAA,EACkC;AAIlC,EAAA,IAAI,WAAA,CAAY,cAAc,MAAA,EAAQ;AACpC,IAAA,OAAO,YAAA;AAAA,MACL,WAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAQA,EAAA,MAAM,gBAAA,GAAmB,QAAQ,YAAA,CAAa,MAAA;AAC9C,EAAA,IACE,gBAAA,EAAkB,cAAc,IAAA,IAChC,OAAA,CAAQ,sBAAsB,MAAA,IAC9B,OAAA,CAAQ,mBAAmB,MAAA,EAC3B;AACA,IAAA,OAAO,YAAA;AAAA,MACL,WAAA;AAAA,MACA,CAAA,SAAA,EAAY,QAAQ,OAAO,CAAA,8DAAA;AAAA,KAC7B;AAAA,EACF;AAOA,EAAA,IAAI,CAAC,gBAAA,CAAiB,UAAA,CAAW,QAAA,CAAS,WAAA,CAAY,SAAS,CAAA,EAAG;AAChE,IAAA,OAAO,YAAA;AAAA,MACL,WAAA;AAAA,MACA,CAAA,SAAA,EAAY,OAAA,CAAQ,OAAO,CAAA,+BAAA,EAAkC,WAAA,CAAY,SAAS,CAAA,iCAAA,EAAoC,gBAAA,CAAiB,UAAA,CAAW,IAAA,CAAK,IAAI,CAAA,IAAK,QAAQ,CAAA;AAAA,KAC1K;AAAA,EACF;AAOA,EAAA,MAAM,eAAA,GAAkB,QAAQ,cAAA,CAAe,SAAA;AAAA,IAC7C,OAAA;AAAA,IACA,WAAA,CAAY,IAAA;AAAA,IACZ,WAAA,CAAY;AAAA,GACd;AACA,EAAA,MAAM,YAAY,MAAM,qBAAA;AAAA,IACtB,OAAA,CAAQ,OAAA;AAAA,IACR,eAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,MAAM,MAAA,GAAkC;AAAA,IACtC,OAAA;AAAA,IACA,UAAU,WAAA,CAAY,IAAA;AAAA,IACtB,WAAW,WAAA,CAAY,SAAA;AAAA,IACvB,YAAY,WAAA,CAAY,UAAA;AAAA,IACxB,QAAQ,WAAA,CAAY,MAAA;AAAA,IACpB,WAAW,WAAA,CAAY,SAAA;AAAA,IACvB,WAAA,EAAa;AAAA,MACX,CAAA,EAAG,YAAY,WAAA,CAAY,CAAA;AAAA,MAC3B,cAAA,EAAgB,YAAY,WAAA,CAAY,cAAA;AAAA,MACxC,GAAI,WAAA,CAAY,WAAA,CAAY,KAAA,KAAU,MAAA,GACpC,EAAC,GACD,EAAE,KAAA,EAAO,WAAA,CAAY,WAAA,CAAY,KAAA;AAAM,KAC3C;AAAA,IACA,UAAA,EAAY,QAAQ,OAAA,KAAY;AAAA,GAClC;AACA,EAAA,OAAO,cAAA,CAAe,WAAA,EAAa,OAAA,EAAS,OAAA,EAAS,aAAA,EAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMlE,SAAA,EAAW,eAAA,CAAgB,OAAA,EAAS,WAAA,CAAY,IAAI,CAAA;AAAA,IACpD,SAAA;AAAA,IACA,UAAA,EAAY,cAAA;AAAA,IACZ,GAAA,EAAK,MAAM,OAAA,CAAQ,iBAAA,CAAmB,MAAM,CAAA;AAAA,IAC5C;AAAA,GACD,CAAA;AACH;AAUA,eAAe,cAAA,CACb,WAAA,EACA,OAAA,EACA,OAAA,EACA,eACA,MAAA,EAOkC;AAGlC,EAAA,MAAM,6BAA6B,OAAA,CAAQ,0BAAA;AAE3C,EAAA,MAAM,EAAE,SAAA,EAAW,SAAA,EAAW,UAAA,EAAY,GAAA,EAAK,qBAAoB,GAAI,MAAA;AACvE,EAAA,MAAM,iBACJ,SAAA,KAAc,WAAA,CAAY,OAAO,MAAA,GAAY,EAAE,YAAY,SAAA,EAAU;AAEvE,EAAA,MAAM,QAAA,GAAW,mBAAA,CAAoB,GAAA,CAAI,SAAS,CAAA;AAClD,EAAA,IAAI,QAAA,EAAU,mBAAmB,MAAA,EAAW;AAC1C,IAAA,IAAI,QAAA,CAAS,cAAc,SAAA,EAAW;AACpC,MAAA,OAAO,KAAA,CAAM,aAAa,qBAAqB,CAAA;AAAA,IACjD;AACA,IAAA,MAAM,QAAQ,IAAI,KAAA;AAAA,MAChB,CAAA,EAAG,UAAU,CAAA,EAAA,EAAK,WAAA,CAAY,IAAI,yEAAyE,QAAA,CAAS,OAAO,CAAA,aAAA,EAAgB,QAAA,CAAS,aAAa,CAAA,oEAAA;AAAA,KACnK;AACA,IAAA,MAAM,0BAAA;AAAA,MACJ,YAAA,CAAa;AAAA,QACX,WAAA;AAAA,QACA,OAAA;AAAA,QACA,SAAA;AAAA,QACA,aAAA;AAAA,QACA,cAAA,EAAgB,MAAA;AAAA,QAChB,KAAA;AAAA,QACA,GAAG;AAAA,OACJ;AAAA,KACH;AACA,IAAA,OAAO,KAAA,CAAM,WAAA,EAAa,QAAA,EAAU,KAAK,CAAA;AAAA,EAC3C;AAEA,EAAA,IAAI;AACF,IAAA,MAAM,GAAA,EAAI;AACV,IAAA,MAAM,cAAc,MAAA,EAAO;AAC3B,IAAA,MAAM,0BAAA;AAAA,MACJ,YAAA,CAAa;AAAA,QACX,WAAA;AAAA,QACA,OAAA;AAAA,QACA,SAAA;AAAA,QACA,aAAA;AAAA,QACA,cAAA,EAAgB,WAAA;AAAA,QAChB,KAAA,EAAO,KAAA,CAAA;AAAA,QACP,WAAA;AAAA,QACA,GAAG;AAAA,OACJ;AAAA,KACH;AACA,IAAA,OAAO,KAAA,CAAM,aAAa,SAAS,CAAA;AAAA,EACrC,SAAS,MAAA,EAAQ;AACf,IAAA,MAAM,KAAA,GAAQ,kBAAkB,KAAA,GAAQ,MAAA,GAAS,IAAI,KAAA,CAAM,MAAA,CAAO,MAAM,CAAC,CAAA;AACzE,IAAA,MAAM,0BAAA;AAAA,MACJ,YAAA,CAAa;AAAA,QACX,WAAA;AAAA,QACA,OAAA;AAAA,QACA,SAAA;AAAA,QACA,aAAA;AAAA,QACA,cAAA,EAAgB,MAAA;AAAA,QAChB,KAAA;AAAA,QACA,GAAG;AAAA,OACJ;AAAA,KACH;AACA,IAAA,OAAO,KAAA,CAAM,WAAA,EAAa,QAAA,EAAU,KAAK,CAAA;AAAA,EAC3C;AACF;AAEA,SAAS,KAAA,CACP,WAAA,EACA,MAAA,EACA,KAAA,EACyB;AACzB,EAAA,OAAO;AAAA,IACL,WAAW,WAAA,CAAY,IAAA;AAAA,IACvB,QAAQ,WAAA,CAAY,MAAA;AAAA,IACpB,MAAM,WAAA,CAAY,IAAA;AAAA,IAClB,MAAA;AAAA,IACA,GAAI,KAAA,KAAU,MAAA,GAAY,EAAC,GAAI,EAAE,KAAA;AAAM,GACzC;AACF;AAEA,SAAS,YAAA,CACP,aACA,MAAA,EACyB;AACzB,EAAA,OAAO;AAAA,IACL,WAAW,WAAA,CAAY,IAAA;AAAA,IACvB,MAAA,EAAQ,QAAA;AAAA,IACR,MAAM,WAAA,CAAY,IAAA;AAAA,IAClB,MAAA,EAAQ,SAAA;AAAA,IACR;AAAA,GACF;AACF;AASO,SAAS,eAAA,CACd,SACA,eAAA,EACQ;AACR,EAAA,OAAO,CAAA,EAAG,OAAO,CAAA,EAAA,EAAK,eAAe,CAAA,CAAA;AACvC;AAEA,SAAS,YAAA,CAAa,aAA+B,OAAA,EAAyB;AAC5E,EAAA,OAAO,WAAA,CAAY,WAAW,QAAA,GAC1B,eAAA,CAAgB,SAAS,WAAA,CAAY,IAAI,IACzC,WAAA,CAAY,IAAA;AAClB;AASA,eAAe,uBAAA,CACb,SACA,UAAA,EACuD;AACvD,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAqC;AACrD,EAAA,IAAI,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG,OAAO,GAAA;AACpC,EAAA,IAAI,OAAA,CAAQ,6BAA6B,MAAA,EAAW;AAClD,IAAA,MAAMW,KAAAA,GAAO,MAAM,OAAA,CAAQ,wBAAA,CAAyB,UAAU,CAAA;AAC9D,IAAA,KAAA,MAAW,OAAOA,KAAAA,EAAM,GAAA,CAAI,GAAA,CAAI,GAAA,CAAI,WAAW,GAAG,CAAA;AAClD,IAAA,OAAO,GAAA;AAAA,EACT;AACA,EAAA,MAAM,SAAS,OAAA,CAAQ,uBAAA;AACvB,EAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,GAAA,CAAI,UAAA,CAAW,GAAA,CAAI,CAAC,GAAA,KAAQ,MAAA,CAAO,GAAG,CAAC,CAAC,CAAA;AACnE,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,GAAG,CAAA,IAAK,IAAA,CAAK,SAAQ,EAAG;AACzC,IAAA,IAAI,QAAQ,MAAA,EAAW,GAAA,CAAI,IAAI,UAAA,CAAW,KAAK,GAAI,GAAG,CAAA;AAAA,EACxD;AACA,EAAA,OAAO,GAAA;AACT;AAEA,SAAS,aACP,IAAA,EAgBkC;AAClC,EAAA,OAAO;AAAA,IACL,SAAA,EAAW,IAAA,CAAK,UAAA,IAAc,IAAA,CAAK,WAAA,CAAY,IAAA;AAAA,IAC/C,SAAS,IAAA,CAAK,OAAA;AAAA,IACd,MAAA,EAAQ,KAAK,WAAA,CAAY,MAAA;AAAA,IACzB,IAAA,EAAM,KAAK,WAAA,CAAY,IAAA;AAAA,IACvB,WAAW,IAAA,CAAK,SAAA;AAAA,IAChB,eAAe,IAAA,CAAK,aAAA;AAAA,IACpB,WAAA,EAAa,IAAA,CAAK,WAAA,IAAe,MAAA,EAAO;AAAA,IACxC,gBAAgB,IAAA,CAAK,cAAA;AAAA,IACrB,KAAA,EAAO,KAAK,KAAA,EAAO;AAAA,GACrB;AACF;AAWA,eAAsB,qBAAA,CACpB,OAAA,EACA,eAAA,EACA,WAAA,EACiB;AACjB,EAAA,MAAM,QAAA,GAAW,EAAE,OAAA,EAAS,eAAA,EAAiB,WAAA,EAAY;AACzD,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,SAAA,CAAU,QAAA,EAAU,cAAc,CAAA;AACpD,EAAA,OAAO,SAAA,CAAU,MAAM,EAAE,CAAA;AAC3B;;;ACzjBA,IAAM,YAAA,GAAsC,CAAC,MAAA,EAAQ,MAAM,CAAA;AAUpD,SAAS,wBACd,IAAA,EAOyB;AACzB,EAAA,OAAO,EAAE,GAAG,IAAA,EAAM,SAAA,EAAW,MAAA,EAAW,OAAO,MAAA,EAAU;AAC3D;AA+CA,eAAsB,mBAAA,CACpB,OAAA,EACA,OAAA,GAAsC,EAAC,EACH;AACpC,EAAA,MAAM,EAAE,OAAA,EAAS,OAAA,EAAQ,GAAI,OAAA;AAE7B,EAAA,IACE,OAAA,CAAQ,eAAe,MAAA,IACvB,OAAA,CAAQ,sBAAsB,MAAA,IAC9B,OAAA,CAAQ,2BAA2B,MAAA,EACnC;AACA,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,6LAAA;AAAA,MAGA,EAAE,MAAM,0CAAA;AAA2C,KACrD;AAAA,EACF;AAEA,EAAA,MAAM,wBAAA,CAAyB,OAAA,EAAS,OAAA,CAAQ,uBAAuB,CAAA;AAYvE,EAAA,MAAM,yBAAyB,OAAO,CAAA;AAQtC,EAAA,MAAM,qBAAA,GAAwB,MAAM,+BAAA,CAAgC,OAAO,CAAA;AAE3E,EAAA,MAAM,OAAA,GAAU,MAAM,OAAA,CAAQ,sBAAA,CAAuB,OAAO,CAAA;AAE5D,EAAA,MAAM,UAAA,GACJ,QAAQ,KAAA,KAAU,MAAA,GAAY,SAAY,IAAI,GAAA,CAAI,QAAQ,KAAK,CAAA;AACjE,EAAA,MAAM,aAAa,OAAA,CAAQ,MAAA;AAAA,IAAO,CAAC,QACjC,UAAA,KAAe,MAAA,GAAY,OAAO,UAAA,CAAW,GAAA,CAAI,IAAI,QAAQ;AAAA,GAC/D;AAEA,EAAA,IAAI,UAAA,CAAW,WAAW,CAAA,EAAG,OAAO,EAAE,OAAA,EAAS,IAAI,qBAAA,EAAsB;AAEzE,EAAA,MAAM,aAAa,OAAA,CAAQ,UAAA;AAC3B,EAAA,MAAM,UAAA,GAAa,YAAY,KAAA,IAAS,iBAAA;AACxC,EAAA,MAAM,UAAA,GAAa,YAAY,KAAA,IAAS,iBAAA;AACxC,EAAA,MAAM,aAAA,GAAgB,YAAY,QAAA,IAAY,yBAAA;AAC9C,EAAA,MAAM,YAAA,GAAe,YAAY,OAAA,IAAW,wBAAA;AAE5C,EAAA,MAAM,GAAA,GAAM;AAAA,IACV,OAAA;AAAA,IACA,OAAA;AAAA,IACA,UAAA;AAAA,IACA,UAAA;AAAA,IACA,aAAA;AAAA,IACA;AAAA,GACF;AAOA,EAAA,OAAO;AAAA,IACL,SAAS,MAAM,kBAAA;AAAA,MAAmB,UAAA;AAAA,MAAY,OAAA;AAAA,MAAS,CAAC,OAAA,KACtDU,eAAAA,CAAe,OAAA,EAAS,GAAG;AAAA,KAC7B;AAAA,IACA;AAAA,GACF;AACF;AAuBA,eAAe,yBACb,OAAA,EACe;AACf,EAAA,MAAM,EAAE,OAAA,EAAS,OAAA,EAAQ,GAAI,OAAA;AAC7B,EAAA,MAAM,oBAAoB,OAAA,CAAQ,iBAAA;AAClC,EAAA,IAAI,sBAAsB,MAAA,EAAW;AAErC,EAAA,MAAM,SAAA,GAAY,MAAM,OAAA,CAAQ,eAAA,CAAgB,OAAO,CAAA;AACvD,EAAA,IAAI,SAAA,KAAc,MAAA,IAAa,SAAA,CAAU,OAAA,IAAW,CAAA,EAAG;AAcvD,EAAA,IAAI,OAAA,CAAQ,qCAAqC,MAAA,EAAW;AAC1D,IAAA,MAAM,QAAQ,gCAAA,EAAiC;AAAA,EACjD;AACA,EAAA,MAAM,MAAA,GACJ,QAAQ,uBAAA,KAA4B,MAAA,GAClC,SACA,MAAM,OAAA,CAAQ,wBAAwB,OAAO,CAAA;AACjD,EAAA,IAAI,MAAA,KAAW,MAAA,IAAa,MAAA,IAAU,SAAA,CAAU,OAAA,EAAS;AAKzD,EAAA,MAAM,WAAA,GAAc,OAAO,OAAA,CAAQ,kBAAA,KAAuB,MAAA,GACxD,OAAA,CAAQ,sBAAA,CAAwB,OAAO,CAAA,GACvC,OAAA,CAAQ,kBAAA,CAAmB,OAAO,CAAA,CAAA;AACpC,EAAA,MAAM,WAAW,IAAI,GAAA;AAAA,IACnB,WAAA,CAAY,GAAA;AAAA,MAAI,CAAC,QACf,cAAA,CAAe,GAAA,CAAI,QAAQ,GAAA,CAAI,QAAA,EAAU,IAAI,aAAa;AAAA;AAC5D,GACF;AAEA,EAAA,MAAM,kBAIA,EAAC;AAQP,EAAA,MAAM,gBAAgB,MAAA,IAAU,CAAA;AAChC,EAAA,IAAI,UAAA,GAAa,SAAA;AACjB,EAAA,IAAI,aAAA,GAAgB,qBAAA,CAAsB,SAAA,CAAU,UAAU,CAAA;AAC9D,EAAA,OAAO,UAAA,CAAW,UAAU,aAAA,EAAe;AACzC,IAAA,MAAM,QAAA,GAAW,MAAM,OAAA,CAAQ,gBAAA;AAAA,MAC7B,OAAA;AAAA,MACA,WAAW,OAAA,GAAU;AAAA,KACvB;AACA,IAAA,IAAI,aAAa,MAAA,EAAW;AAC5B,IAAA,MAAM,WAAA,GAAc,qBAAA,CAAsB,QAAA,CAAS,UAAU,CAAA;AAE7D,IAAA,KAAA,MAAW,UAAU,YAAA,EAAc;AACjC,MAAA,MAAM,YAAA,GAAe,WAAA,CAAY,MAAA,KAAW,MAAA,GAAS,UAAU,OAAO,CAAA;AACtE,MAAA,MAAM,cAAA,GACJ,aAAA,CAAc,MAAA,KAAW,MAAA,GAAS,UAAU,OAAO,CAAA;AACrD,MAAA,KAAA,MAAW,QAAA,IAAY,MAAA,CAAO,IAAA,CAAK,YAAY,CAAA,EAAG;AAChD,QAAA,IAAI,YAAY,cAAA,EAAgB;AAChC,QAAA,IACE,QAAA,CAAS,IAAI,cAAA,CAAe,MAAA,EAAQ,UAAU,UAAA,CAAW,OAAO,CAAC,CAAA,EACjE;AACA,UAAA;AAAA,QACF;AACA,QAAA,eAAA,CAAgB,IAAA,CAAK;AAAA,UACnB,QAAA;AAAA,UACA,MAAA;AAAA,UACA,eAAe,UAAA,CAAW;AAAA,SAC3B,CAAA;AAAA,MACH;AAAA,IACF;AAEA,IAAA,UAAA,GAAa,QAAA;AACb,IAAA,aAAA,GAAgB,WAAA;AAAA,EAClB;AAEA,EAAA,IAAI,eAAA,CAAgB,SAAS,CAAA,EAAG;AAC9B,IAAA,MAAM,cAAc,MAAA,EAAO;AAC3B,IAAA,MAAM,OAAA,CAAQ,GAAA;AAAA,MACZ,eAAA,CAAgB,GAAA;AAAA,QAAI,CAACrB,MAAAA,KACnB,iBAAA;AAAA,UACE,uBAAA,CAAwB;AAAA,YACtB,OAAA;AAAA,YACA,UAAUA,MAAAA,CAAM,QAAA;AAAA,YAChB,QAAQA,MAAAA,CAAM,MAAA;AAAA,YACd,eAAeA,MAAAA,CAAM,aAAA;AAAA,YACrB;AAAA,WACD;AAAA;AACH;AACF,KACF;AAAA,EACF;AAOA,EAAA,IAAI,OAAA,CAAQ,4BAA4B,MAAA,EAAW;AACjD,IAAA,MAAM,OAAA,CAAQ,uBAAA,CAAwB,OAAA,EAAS,SAAA,CAAU,OAAO,CAAA;AAAA,EAClE;AACF;AAEA,SAAS,cAAA,CACP,MAAA,EACA,QAAA,EACA,OAAA,EACQ;AACR,EAAA,OAAO,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,QAAQ,IAAI,OAAO,CAAA,CAAA;AACzC;AAEA,eAAeqB,eAAAA,CACb,KACA,GAAA,EAQmC;AACnC,EAAA,MAAM,UAAA,GAAa,IAAI,OAAA,CAAQ,UAAA;AAC/B,EAAA,MAAM,iBAAA,GAAoB,IAAI,OAAA,CAAQ,iBAAA;AACtC,EAAA,IAAI;AAUF,IAAA,MAAM,UAA2B,EAAC;AAClC,IAAA,MAAM,QAAA,GAAW9C,QAAAA,CAAQ,GAAA,CAAI,OAAO,CAAA;AACpC,IAAA,MAAM,OAAA,GAAUA,QAAAA,CAAQ,GAAA,CAAI,QAAQ,CAAA;AACpC,IAAA,IAAI,GAAA,CAAI,WAAW,MAAA,EAAQ;AACzB,MAAA,OAAA,CAAQ,IAAA;AAAA,QACN,UAAA;AAAA,UACE,CAAA,YAAA,EAAe,MAAM,GAAA,CAAI,UAAU,CAAC,CAAA,kBAAA,EAAqB,QAAQ,eAAe,OAAO,CAAA;AAAA,SACzF;AAAA,QACA,UAAA;AAAA,UACE,CAAA,YAAA,EAAe,KAAA,CAAM,GAAA,CAAI,UAAU,CAAC,qBAAqB,QAAQ,CAAA,kBAAA,EAAqB,OAAO,CAAA,cAAA,EAAiB,OAAO,CAAA,CAAA;AAAA,SACvH;AAAA,QACA,UAAA;AAAA,UACE,CAAA,YAAA,EAAe,MAAM,GAAA,CAAI,aAAa,CAAC,CAAA,kBAAA,EAAqB,QAAQ,oBAAoB,OAAO,CAAA;AAAA,SACjG;AAAA,QACA,UAAA;AAAA,UACE,CAAA,YAAA,EAAe,MAAM,GAAA,CAAI,YAAY,CAAC,CAAA,kBAAA,EAAqB,QAAQ,oBAAoB,OAAO,CAAA;AAAA,SAChG;AAAA,QACA,GAAG,0BAAA,CAA2B,GAAA,EAAK,GAAG;AAAA,OACxC;AAAA,IACF,CAAA,MAAO;AACL,MAAA,OAAA,CAAQ,IAAA;AAAA,QACN,UAAA;AAAA,UACE,CAAA,YAAA,EAAe,MAAM,GAAA,CAAI,UAAU,CAAC,CAAA,kBAAA,EAAqB,QAAQ,eAAe,OAAO,CAAA;AAAA;AACzF,OACF;AAAA,IACF;AACA,IAAA,MAAM,OAAA,CAAQ,IAAI,OAAO,CAAA;AAEzB,IAAA,MAAM,YAAY,MAAA,EAAO;AACzB,IAAA,MAAM,iBAAA,CAAkB;AAAA,MACtB,SAAS,GAAA,CAAI,OAAA;AAAA,MACb,UAAU,GAAA,CAAI,QAAA;AAAA,MACd,QAAQ,GAAA,CAAI,MAAA;AAAA,MACZ,eAAe,GAAA,CAAI,aAAA;AAAA,MACnB,WAAA,EAAa,SAAA;AAAA,MACb,SAAA;AAAA,MACA,KAAA,EAAO,KAAA;AAAA,KACR,CAAA;AACD,IAAA,OAAO;AAAA,MACL,MAAM,GAAA,CAAI,QAAA;AAAA,MACV,QAAQ,GAAA,CAAI,MAAA;AAAA,MACZ,MAAA,EAAQ;AAAA,KACV;AAAA,EACF,SAAS,MAAA,EAAQ;AACf,IAAA,MAAM,KAAA,GAAQ,kBAAkB,KAAA,GAAQ,MAAA,GAAS,IAAI,KAAA,CAAM,MAAA,CAAO,MAAM,CAAC,CAAA;AACzE,IAAA,MAAM,iBAAA,CAAkB;AAAA,MACtB,SAAS,GAAA,CAAI,OAAA;AAAA,MACb,UAAU,GAAA,CAAI,QAAA;AAAA,MACd,QAAQ,GAAA,CAAI,MAAA;AAAA,MACZ,eAAe,GAAA,CAAI,aAAA;AAAA,MACnB,aAAa,MAAA,EAAO;AAAA,MACpB,SAAA,EAAW,MAAA;AAAA,MACX,OAAO,KAAA,CAAM;AAAA,KACd,CAAA;AACD,IAAA,OAAO;AAAA,MACL,MAAM,GAAA,CAAI,QAAA;AAAA,MACV,QAAQ,GAAA,CAAI,MAAA;AAAA,MACZ,MAAA,EAAQ,QAAA;AAAA,MACR;AAAA,KACF;AAAA,EACF;AACF;AAmBA,SAAS,0BAAA,CACP,KAIA,GAAA,EAC0B;AAC1B,EAAA,MAAM,cAAA,GAAiB,IAAI,OAAA,CAAQ,cAAA;AACnC,EAAA,IAAI,cAAA,KAAmB,MAAA,EAAW,OAAO,EAAC;AAE1C,EAAA,MAAM,UAAA,GAAa,IAAI,OAAA,CAAQ,UAAA;AAC/B,EAAA,MAAM,WAAW,YAAY;AAC3B,IAAA,MAAM,KAAA,GAAQ,MAAM,gCAAA,CAAiC,GAAA,CAAI,SAAS,GAAG,CAAA;AACrE,IAAA,MAAM,OAAA,CAAQ,GAAA;AAAA,MACZ,KAAA,CAAM,GAAA;AAAA,QAAI,CAAC,IAAA,KACT,qBAAA,CAAsB,cAAA,EAAgB,YAAY,IAAI;AAAA;AACxD,KACF;AAAA,EACF,CAAA,GAAG;AACH,EAAA,OAAO,CAAC,OAAO,CAAA;AACjB;AAUA,eAAe,qBAAA,CACb,QAAA,EACA,UAAA,EACA,IAAA,EACe;AACf,EAAA,IAAI;AACF,IAAA,KAAA,MAAW,GAAA,IAAO,QAAA,CAAS,gBAAA,CAAiB,IAAI,CAAA,EAAG;AACjD,MAAA,MAAM,WAAW,GAAG,CAAA;AAAA,IACtB;AAAA,EACF,SAAS,KAAA,EAAO;AACd,IAAA,IAAI,CAAC,mBAAA,CAAoB,KAAK,CAAA,EAAG,MAAM,KAAA;AAAA,EACzC;AACF;AASA,eAAe,gCAAA,CACb,SACA,GAAA,EACgC;AAChC,EAAA,MAAM,YAAA,GAAe,IAAI,aAAA,GAAgB,CAAA;AACzC,EAAA,IAAI,YAAA,GAAe,CAAA,EAAG,OAAO,EAAC;AAC9B,EAAA,MAAM,WAAW,MAAM,OAAA,CAAQ,gBAAA,CAAiB,GAAA,CAAI,SAAS,YAAY,CAAA;AACzE,EAAA,IAAI,QAAA,KAAa,MAAA,EAAW,OAAO,EAAC;AAEpC,EAAA,MAAM,WAAA,GAAc,qBAAA,CAAsB,QAAA,CAAS,UAAU,CAAA;AAC7D,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAwB;AAC1C,EAAA,KAAA,MAAW,WAAA,IAAe,WAAA,CAAY,OAAA,IAAW,EAAC,EAAG;AACnD,IAAA,IAAI,YAAY,MAAA,KAAW,QAAA,IAAY,WAAA,CAAY,IAAA,KAAS,IAAI,QAAA,EAAU;AACxE,MAAA,KAAA,CAAM,GAAA,CAAI,YAAY,SAAA,EAAW;AAAA,QAC/B,SAAS,GAAA,CAAI,OAAA;AAAA,QACb,UAAU,GAAA,CAAI,QAAA;AAAA,QACd,WAAW,WAAA,CAAY,SAAA;AAAA,QACvB,YAAY,WAAA,CAAY,UAAA;AAAA,QACxB,QAAQ,WAAA,CAAY,MAAA;AAAA,QACpB,WAAW,WAAA,CAAY;AAAA,OACxB,CAAA;AAAA,IACH;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,KAAA,CAAM,MAAA,EAAQ,CAAA;AAC3B;AAGA,SAAS,cAAA,CAAe,MAAc,SAAA,EAA2B;AAC/D,EAAA,OAAO,CAAA,EAAG,IAAI,CAAA,EAAA,EAAS,SAAS,CAAA,CAAA;AAClC;AAqCA,eAAe,gCACb,OAAA,EAC+C;AAC/C,EAAA,MAAM,EAAE,OAAA,EAAS,OAAA,EAAQ,GAAI,OAAA;AAC7B,EAAA,MAAM,iBAAiB,OAAA,CAAQ,cAAA;AAC/B,EAAA,MAAM,aAAa,OAAA,CAAQ,UAAA;AAC3B,EAAA,IAAI,cAAA,KAAmB,MAAA,IAAa,UAAA,KAAe,MAAA,SAAkB,EAAC;AAEtE,EAAA,MAAM,SAAA,GAAY,MAAM,OAAA,CAAQ,eAAA,CAAgB,OAAO,CAAA;AACvD,EAAA,IAAI,SAAA,KAAc,MAAA,EAAW,OAAO,EAAC;AAQrC,EAAA,MAAM,QAAA,GAAW,CAAA,EAAG,OAAO,CAAA,EAAA,EAAI,UAAU,OAAO,CAAA,CAAA;AAChD,EAAA,IAAI,UAAA,GAAa,YAAA,CAAa,GAAA,CAAI,OAAO,CAAA;AACzC,EAAA,MAAM,MAAA,GAAS,UAAA,EAAY,GAAA,CAAI,QAAQ,CAAA;AACvC,EAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AAEjC,EAAA,MAAM,YAAA,GAAe,qBAAA,CAAsB,SAAA,CAAU,UAAU,CAAA;AAE/D,EAAA,MAAM,kBAAA,uBAAyB,GAAA,EAAY;AAC3C,EAAA,KAAA,MAAW,WAAA,IAAe,YAAA,CAAa,OAAA,IAAW,EAAC,EAAG;AACpD,IAAA,IAAI,WAAA,CAAY,WAAW,QAAA,EAAU;AACnC,MAAA,kBAAA,CAAmB,GAAA;AAAA,QACjB,cAAA,CAAe,WAAA,CAAY,IAAA,EAAM,WAAA,CAAY,SAAS;AAAA,OACxD;AAAA,IACF;AAAA,EACF;AACA,EAAA,MAAM,iBAAiB,IAAI,GAAA,CAAI,OAAO,IAAA,CAAK,YAAA,CAAa,KAAK,CAAC,CAAA;AAK9D,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAmC;AAC1D,EAAA,KAAA,IAAS,UAAU,SAAA,CAAU,OAAA,GAAU,GAAG,OAAA,IAAW,CAAA,EAAG,WAAW,CAAA,EAAG;AACpE,IAAA,MAAM,QAAA,GAAW,MAAM,OAAA,CAAQ,gBAAA,CAAiB,SAAS,OAAO,CAAA;AAChE,IAAA,IAAI,aAAa,MAAA,EAAW;AAC5B,IAAA,MAAM,WAAA,GAAc,qBAAA,CAAsB,QAAA,CAAS,UAAU,CAAA;AAC7D,IAAA,KAAA,MAAW,WAAA,IAAe,WAAA,CAAY,OAAA,IAAW,EAAC,EAAG;AACnD,MAAA,IAAI,WAAA,CAAY,WAAW,QAAA,EAAU;AACrC,MAAA,MAAM,GAAA,GAAM,cAAA,CAAe,WAAA,CAAY,IAAA,EAAM,YAAY,SAAS,CAAA;AAClE,MAAA,IAAI,UAAA,CAAW,GAAA,CAAI,GAAG,CAAA,EAAG;AACzB,MAAA,UAAA,CAAW,IAAI,GAAA,EAAK;AAAA,QAClB,MAAM,WAAA,CAAY,IAAA;AAAA,QAClB,WAAW,WAAA,CAAY,SAAA;AAAA,QACvB,IAAA,EAAM;AAAA,UACJ,OAAA;AAAA,UACA,UAAU,WAAA,CAAY,IAAA;AAAA,UACtB,WAAW,WAAA,CAAY,SAAA;AAAA,UACvB,YAAY,WAAA,CAAY,UAAA;AAAA,UACxB,QAAQ,WAAA,CAAY,MAAA;AAAA,UACpB,WAAW,WAAA,CAAY;AAAA;AACzB,OACD,CAAA;AAAA,IACH;AAAA,EACF;AAEA,EAAA,MAAM,UAAU,CAAC,GAAG,UAAA,CAAW,MAAA,EAAQ,CAAA,CAAE,MAAA;AAAA,IACvC,CAACN,MAAAA,KACC,CAAC,kBAAA,CAAmB,IAAI,cAAA,CAAeA,MAAAA,CAAM,IAAA,EAAMA,MAAAA,CAAM,SAAS,CAAC,CAAA,IACnE,cAAA,CAAe,GAAA,CAAIA,OAAM,IAAI;AAAA,GACjC;AAEA,EAAA,MAAM,UAAuC,EAAC;AAC9C,EAAA,KAAA,MAAWA,UAAS,OAAA,EAAS;AAI3B,IAAA,IAAI;AACF,MAAA,MAAM,qBAAA,CAAsB,cAAA,EAAgB,UAAA,EAAYA,MAAAA,CAAM,IAAI,CAAA;AAClE,MAAA,OAAA,CAAQ,IAAA,CAAK;AAAA,QACX,MAAMA,MAAAA,CAAM,IAAA;AAAA,QACZ,WAAWA,MAAAA,CAAM,SAAA;AAAA,QACjB,MAAA,EAAQ;AAAA,OACT,CAAA;AAAA,IACH,SAAS,KAAA,EAAO;AACd,MAAA,OAAA,CAAQ,IAAA,CAAK;AAAA,QACX,MAAMA,MAAAA,CAAM,IAAA;AAAA,QACZ,WAAWA,MAAAA,CAAM,SAAA;AAAA,QACjB,MAAA,EAAQ,QAAA;AAAA,QACR,KAAA,EAAO,iBAAiB,KAAA,GAAQ,KAAA,GAAQ,IAAI,KAAA,CAAM,MAAA,CAAO,KAAK,CAAC;AAAA,OAChE,CAAA;AAAA,IACH;AAAA,EACF;AAGA,EAAA,IAAI,QAAQ,KAAA,CAAM,CAAC+B,WAAUA,MAAAA,CAAM,MAAA,KAAW,WAAW,CAAA,EAAG;AAC1D,IAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,MAAA,UAAA,uBAAiB,GAAA,EAAI;AACrB,MAAA,YAAA,CAAa,GAAA,CAAI,SAAS,UAAU,CAAA;AAAA,IACtC;AACA,IAAA,UAAA,CAAW,GAAA,CAAI,UAAU,OAAO,CAAA;AAAA,EAClC;AACA,EAAA,OAAO,OAAA;AACT;AAOA,IAAM,YAAA,uBAAmB,OAAA,EAGvB;AAQF,SAAS,MAAM,UAAA,EAA4B;AACzC,EAAA,OAAO,CAAA,CAAA,EAAI,UAAA,CAAW,UAAA,CAAW,GAAA,EAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAC7C;AAEA,SAASzB,SAAQ,KAAA,EAAuB;AACtC,EAAA,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,UAAA,CAAW,GAAA,EAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AACxC;;;ACvoBA,IAAM,oBAAA,GAAuB,GAAA;AAG7B,IAAM,sBAAA,GAAyB,GAAA;AA2BxB,SAAS,gBAAA,CACd,KAAA,EACA,MAAA,EACA,SAAA,EACQ;AACR,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,GAAA,CAAI,CAACN,MAAAA,KAAU;AACnC,IAAA,MAAM,KAAA,GAAQ,MAAMA,MAAK,CAAA;AACzB,IAAA,IAAI,KAAA,KAAU,MAAA,IAAa,KAAA,KAAU,IAAA,EAAM;AACzC,MAAA,OAAO,sBAAA;AAAA,IACT;AAEA,IAAA,MAAM,cACJ,OAAO,KAAA,KAAU,QAAA,GAAW,KAAA,GAC1B,OAAO,KAAA,KAAU,QAAA,IAAY,OAAO,KAAA,KAAU,YAC9C,KAAA,CAAM,QAAA,EAAS,GACf,IAAA,CAAK,UAAU,KAAK,CAAA;AACxB,IAAA,OAAO,SAAA,KAAc,iBAAA,GACjB,WAAA,CAAY,WAAA,EAAY,GACxB,WAAA;AAAA,EACN,CAAC,CAAA;AACD,EAAA,OAAO,MAAA,CAAO,KAAK,oBAAoB,CAAA;AACzC;AAKO,SAAS,mBAAA,CACd,YACA,KAAA,EACS;AACT,EAAA,IAAI,CAAC,WAAW,KAAA,EAAO;AACrB,IAAA,OAAO,IAAA;AAAA,EACT;AAGA,EAAA,MAAM,gBAAA,GAAmB,sBAAsB,KAAK,CAAA;AACpD,EAAA,MAAMW,UAAAA,GAAY,UAAA,CAAW,KAAA,CAAM,gBAAgB,CAAA;AAGnD,EAAA,OAAO,iBAAA,CAAkBA,YAAW,KAAK,CAAA;AAC3C;AAqBA,SAAS,sBACP,KAAA,EACkB;AAClB,EAAA,MAAM,UAGF,EAAC;AAEL,EAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,EAAG;AACpC,IAAA,OAAA,CAAQ,GAAG,CAAA,GAAI;AAAA,MACb,QAAQ,OAAO;AAAA,QACb,MAAA,EAAQ,kBAAA;AAAA,QACR,KAAA,EAAO,GAAA;AAAA,QACP,EAAA,EAAI;AAAA,OACN,CAAA;AAAA,MACA,WAAW,OAAO;AAAA,QAChB,MAAA,EAAQ,kBAAA;AAAA,QACR,KAAA,EAAO,GAAA;AAAA,QACP,EAAA,EAAI;AAAA,OACN;AAAA,KACF;AAAA,EACF;AAEA,EAAA,OAAO,OAAA;AACT;AAKA,SAAS,iBAAA,CACPA,YACA,KAAA,EACS;AACT,EAAA,IACE,OAAOA,UAAAA,KAAc,QAAA,IACrBA,eAAc,IAAA,IACd,EAAE,YAAYA,UAAAA,CAAAA,EACd;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,MAAM,IAAA,GAAOA,UAAAA;AAMb,EAAA,IAAI,IAAA,CAAK,WAAW,kBAAA,EAAoB;AACtC,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,IAAA,CAAK,KAAK,CAAA;AAC9B,EAAA,IAAI,IAAA,CAAK,OAAO,QAAA,EAAU;AACxB,IAAA,OAAO,KAAA,KAAU,QAAQ,KAAA,KAAU,MAAA;AAAA,EACrC;AACA,EAAA,OAAO,KAAA,KAAU,QAAQ,KAAA,KAAU,MAAA;AACrC;AAYO,SAAS,0BAAA,CACd,QAAA,EACA,KAAA,EACA,QAAA,EACmB;AACnB,EAAA,IAAI,UAAU,MAAA,EAAQ;AACpB,IAAA,OAAO,CAAC,QAAQ,CAAA;AAAA,EAClB;AAGA,EAAA,MAAM,IAAA,GAAO,gBAAA,CAAiB,QAAA,EAAU,QAAQ,CAAA;AAGhD,EAAA,OAAO,QAAA,CAAS,iBAAiB,IAAI,CAAA;AACvC;AAKA,SAAS,gBAAA,CAAiB,MAAc,QAAA,EAAgC;AACtE,EAAA,MAAM,SAAA,GAAY,QAAA,CAAS,YAAA,CAAa,IAAI,CAAA;AAE5C,EAAA,IAAI,SAAA,CAAU,SAAS,CAAA,EAAG;AACxB,IAAA,OAAO,IAAA;AAAA,EACT;AAGA,EAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,IAAA,IAAI,QAAA,CAAS,YAAA,CAAa,QAAQ,CAAA,CAAE,SAAS,CAAA,EAAG;AAC9C,MAAA,OAAO,QAAA;AAAA,IACT;AAAA,EACF;AAGA,EAAA,MAAM,aAAA,GAAgB,CAAC,GAAG,SAAS,EAAE,CAAC,CAAA;AACtC,EAAA,OAAO,aAAA,GAAgB,gBAAA,CAAiB,aAAA,EAAe,QAAQ,CAAA,GAAI,IAAA;AACrE;AAoCO,SAAS,iBACd,QAAA,EACA,QAAA,EACA,MAAA,EACA,WAAA,EACA,mBACA,aAAA,EAC8B;AAC9B,EAAA,QAAQ,WAAA;AAAa,IACnB,KAAK,MAAA,EAAQ;AAEX,MAAA,OAAO,MAAA;AAAA,IACT;AAAA,IACA,KAAK,KAAA,EAAO;AAEV,MAAA,IAAI,oBAAoB,CAAA,EAAG;AACzB,QAAA,OAAO,IAAI,gBAAA,CAAiB;AAAA,UAC1B,QAAA;AAAA,UACA,QAAA;AAAA,UACA,MAAA;AAAA,UACA,WAAA,EAAa,KAAA;AAAA,UACb,aAAA,EAAe;AAAA,SAChB,CAAA;AAAA,MACH;AACA,MAAA,OAAO,MAAA;AAAA,IACT;AAAA,IACA,KAAK,QAAA,EAAU;AAEb,MAAA,OAAO,MAAA;AAAA,IACT;AAAA,IACA,KAAK,WAAA,EAAa;AAEhB,MAAA,IAAI,aAAA,EAAe;AACjB,QAAA,OAAO,IAAI,gBAAA,CAAiB;AAAA,UAC1B,QAAA;AAAA,UACA,QAAA;AAAA,UACA,MAAA;AAAA,UACA,WAAA,EAAa,WAAA;AAAA,UACb,aAAA,EAAe;AAAA,SAChB,CAAA;AAAA,MACH;AACA,MAAA,OAAO,MAAA;AAAA,IACT;AAAA;AAEJ;AAKO,SAAS,gBACd,QAAA,EACA,QAAA,EACA,MAAA,EACA,OAAA,EACA,OACA,aAAA,EAC8B;AAC9B,EAAA,IAAI,gBAAgB,CAAA,EAAG;AACrB,IAAA,OAAO,IAAI,gBAAA,CAAiB;AAAA,MAC1B,QAAA;AAAA,MACA,QAAA;AAAA,MACA,MAAA;AAAA,MACA,WAAA,EAAa,QAAA;AAAA,MACb;AAAA,KACD,CAAA;AAAA,EACH;AACA,EAAA,OAAO,MAAA;AACT;AASO,SAAS,qBAAA,CACd,QAAA,EACA,QAAA,EACA,MAAA,EACA,cACA,QAAA,EAC2B;AAE3B,EAAA,MAAM,iBAAiB,YAAA,CAAa,IAAA,CAAK,IAAI,CAAC,IAAA,KAAS,KAAK,IAAI,CAAA;AAChE,EAAA,MAAM,YAAY,cAAA,CAAe,IAAA;AAAA,IAAK,CAAC,SAAA,KACrC,QAAA,CAAS,cAAA,CAAe,UAAU,SAAS;AAAA,GAC7C;AAEA,EAAA,IAAI,CAAC,SAAA,EAAW;AACd,IAAA,OAAO,IAAI,aAAA,CAAc;AAAA,MACvB,QAAA;AAAA,MACA,QAAA,EAAU,MAAA;AAAA,MACV,UAAA,EAAY,QAAA;AAAA,MACZ,aAAA,EAAe;AAAA,KAChB,CAAA;AAAA,EACH;AAGA,EAAA,MAAM,eAAe,YAAA,CAAa,EAAA,CAAG,IAAI,CAAC,IAAA,KAAS,KAAK,IAAI,CAAA;AAC5D,EAAA,MAAM,UAAU,YAAA,CAAa,IAAA;AAAA,IAAK,CAAC,SAAA,KACjC,QAAA,CAAS,cAAA,CAAe,QAAQ,SAAS;AAAA,GAC3C;AAEA,EAAA,IAAI,CAAC,OAAA,EAAS;AACZ,IAAA,OAAO,IAAI,aAAA,CAAc;AAAA,MACvB,QAAA;AAAA,MACA,QAAA,EAAU,IAAA;AAAA,MACV,UAAA,EAAY,MAAA;AAAA,MACZ,aAAA,EAAe;AAAA,KAChB,CAAA;AAAA,EACH;AAEA,EAAA,OAAO,MAAA;AACT;AAeO,SAAS,iBAAA,CACd,MAAA,EACA,QAAA,EACA,aAAA,EACA,QAAA,EAC2B;AAC3B,EAAA,KAAA,MAAW,gBAAgB,aAAA,EAAe;AACxC,IAAA,IAAI,QAAA,CAAS,WAAA,CAAY,QAAA,EAAU,YAAY,CAAA,EAAG;AAChD,MAAA,OAAO,IAAI,aAAA,CAAc;AAAA,QACvB,MAAA;AAAA,QACA,aAAA,EAAe,QAAA;AAAA,QACf,eAAA,EAAiB;AAAA,OAClB,CAAA;AAAA,IACH;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT;;;AC1WA,eAAsB,2BAAA,CACpB,GAAA,EACA,IAAA,EACA,EAAA,EACe;AAEf,EAAA,MAAM,aAAA,GAAgB,GAAA,CAAI,QAAA,CAAS,gBAAA,CAAiB,IAAI,CAAA;AAGxD,EAAA,KAAA,MAAW,gBAAgB,aAAA,EAAe;AACxC,IAAA,MAAM,QAAA,GAAW,MAAM,GAAA,CAAI,OAAA,CAAQ,QAAQ,GAAA,CAAI,OAAA,EAAS,cAAc,EAAE,CAAA;AACxE,IAAA,IAAI,QAAA,IAAY,CAAC,QAAA,CAAS,UAAA,EAAY;AACpC,MAAA,MAAM,KAAA,GAAQ,kBAAkB,EAAA,EAAI,IAAA,EAAM,CAAC,YAAY,CAAA,EAAG,IAAI,QAAQ,CAAA;AACtE,MAAA,IAAI,OAAO,MAAM,KAAA;AAAA,IACnB;AAAA,EACF;AACF;AAOA,eAAsB,0BAAA,CACpB,KACA,QAAA,EACA,WAAA,EACA,UACA,MAAA,EACA,MAAA,EACA,MACA,OAAA,EACe;AACf,EAAA,QAAQ,WAAA;AAAa,IACnB,KAAK,MAAA,EAAQ;AAEX,MAAA;AAAA,IACF;AAAA,IAEA,KAAK,KAAA,EAAO;AAEV,MAAA,MAAM0C,MAAAA,GAAQ,MAAM,GAAA,CAAI,OAAA,CAAQ,cAAA,CAAe;AAAA,QAC7C,SAAS,GAAA,CAAI,OAAA;AAAA,QACb,QAAA;AAAA,QACA,QAAA;AAAA,QACA;AAAA,OACD,CAAA;AACD,MAAA,MAAM,KAAA,GAAQ,gBAAA;AAAA,QACZ,QAAA;AAAA,QACA,QAAA;AAAA,QACA,MAAA;AAAA,QACA,KAAA;AAAA,QACAA,MAAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,IAAI,OAAO,MAAM,KAAA;AACjB,MAAA;AAAA,IACF;AAAA,IAEA,KAAK,QAAA,EAAU;AAEb,MAAA,MAAMC,OAAAA,GAAS,MAAM,GAAA,CAAI,OAAA,CAAQ,iBAAA,CAAkB;AAAA,QACjD,SAAS,GAAA,CAAI,OAAA;AAAA,QACb,QAAA;AAAA,QACA,QAAA;AAAA,QACA,MAAA;AAAA,QACA,MAAA;AAAA,QACA;AAAA,OACD,CAAA;AACD,MAAA,MAAM,KAAA,GAAQ,eAAA;AAAA,QACZ,QAAA;AAAA,QACA,QAAA;AAAA,QACA,MAAA;AAAA,QACA,MAAA;AAAA,QACA,IAAA;AAAA,QACAA,UAAS,CAAA,GAAI;AAAA,OACf;AACA,MAAA,IAAI,OAAO,MAAM,KAAA;AACjB,MAAA;AAAA,IACF;AAAA,IAEA,KAAK,WAAA,EAAa;AAGhB,MAAA,IAAI,YAAY,MAAA,EAAW;AAEzB,QAAA;AAAA,MACF;AACA,MAAA,MAAMD,MAAAA,GAAQ,MAAM,GAAA,CAAI,OAAA,CAAQ,cAAA,CAAe;AAAA,QAC7C,SAAS,GAAA,CAAI,OAAA;AAAA,QACb,QAAA;AAAA,QACA,QAAA;AAAA,QACA,MAAA;AAAA,QACA,UAAA,EAAY;AAAA,OACb,CAAA;AACD,MAAA,MAAM,KAAA,GAAQ,gBAAA;AAAA,QACZ,QAAA;AAAA,QACA,QAAA;AAAA,QACA,MAAA;AAAA,QACA,WAAA;AAAA,QACAA,MAAAA;AAAA,QACAA,MAAAA,GAAQ;AAAA,OACV;AACA,MAAA,IAAI,OAAO,MAAM,KAAA;AACjB,MAAA;AAAA,IACF;AAAA;AAEJ;;;ACnEA,SAAS,mBAAA,CAAwC,OAAU,IAAA,EAAc;AACvE,EAAA,MAAM,YAAA,GAAe,KAAA,CAAM,KAAA,CAAM,IAAI,CAAA;AACrC,EAAA,IAAI,iBAAiB,MAAA,EAAW,MAAM,IAAI,iBAAA,CAAkB,MAAM,MAAM,CAAA;AACxE,EAAA,OAAO,YAAA;AACT;AAOA,SAAS,yBAAA,CACP,OAAA,EACA,IAAA,EACA,EAAA,EACQ;AACR,EAAA,OAAO,CAAA,EAAG,OAAO,CAAA,EAAA,EAAS,IAAI,KAAS,EAAE,CAAA,CAAA;AAC3C;AAEA,SAAS,qBAAA,CACP,OAAA,EACA,QAAA,EACA,QAAA,EACA,MAAA,EACQ;AACR,EAAA,OAAO,GAAG,OAAO,CAAA,EAAA,EAAS,QAAQ,CAAA,EAAA,EAAS,QAAQ,KAAS,MAAM,CAAA,CAAA;AACpE;AAEA,SAAS,yBACP,OAAA,EACA,QAAA,EACA,QAAA,EACA,MAAA,EACA,QACA,IAAA,EACQ;AACR,EAAA,OAAO,CAAA,EAAG,OAAO,CAAA,EAAA,EAAS,QAAQ,CAAA,EAAA,EAAS,QAAQ,CAAA,EAAA,EAAS,MAAM,CAAA,EAAA,EAAS,MAAM,CAAA,EAAA,EAAS,IAAI,CAAA,CAAA;AAChG;AAEA,SAAS,4BACP,MAAA,EACQ;AACR,EAAA,MAAM,UAAA,GAAa,MAAA,CAAO,UAAA,KAAe,IAAA,GAAO,GAAA,GAAM,GAAA;AACtD,EAAA,OAAO,CAAA,EAAG,MAAA,CAAO,OAAO,CAAA,EAAA,EAAS,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAS,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAS,MAAA,CAAO,MAAM,KAAS,UAAU,CAAA,CAAA;AACnH;AAEA,SAAS,qBAAA,CACP,OAAA,EACA,EAAA,EACA,IAAA,EACA,QAAA,EACA,QACA,MAAA,EACA,IAAA,EACA,KAAA,EACA,SAAA,EACA,OAAA,EACkB;AAClB,EAAA,MAAM,YAAA,GAWF;AAAA,IACF,OAAA;AAAA,IACA,EAAA;AAAA,IACA,IAAA;AAAA,IACA,QAAA;AAAA,IACA,MAAA;AAAA,IACA,MAAA;AAAA,IACA,IAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,IAAI,SAAA,KAAc,MAAA,EAAW,YAAA,CAAa,SAAA,GAAY,SAAA;AACtD,EAAA,IAAI,OAAA,KAAY,MAAA,EAAW,YAAA,CAAa,OAAA,GAAU,OAAA;AAClD,EAAA,OAAO,YAAA;AACT;AAEA,SAAS,qBAAA,CAAsB,QAA6B,GAAA,EAAmB;AAC7E,EAAA,MAAM,QAAA,GAAW,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA,IAAK,CAAA;AACpC,EAAA,MAAA,CAAO,GAAA,CAAI,GAAA,EAAK,QAAA,GAAW,CAAC,CAAA;AAC9B;AAEA,SAAS,iCACP,OAAA,EAOC;AACD,EAAA,MAAM,aAAA,uBAAoB,GAAA,EAGxB;AACF,EAAA,MAAM,mBAAA,uBAA0B,GAAA,EAAoB;AACpD,EAAA,MAAM,eAAA,uBAAsB,GAAA,EAAqB;AACjD,EAAA,MAAM,gBAAA,uBAAuB,GAAA,EAAoB;AACjD,EAAA,MAAM,sBAAA,uBAA6B,GAAA,EAAoB;AACvD,EAAA,MAAM,kBAAA,uBAAyB,GAAA,EAAY;AAE3C,EAAA,eAAe,aAAA,CACb,OAAA,EACA,IAAA,EACA,EAAA,EACuD;AACvD,IAAA,MAAM,QAAA,GAAW,yBAAA,CAA0B,OAAA,EAAS,IAAA,EAAM,EAAE,CAAA;AAC5D,IAAA,IAAI,aAAA,CAAc,GAAA,CAAI,QAAQ,CAAA,EAAG;AAC/B,MAAA,OAAO,aAAA,CAAc,IAAI,QAAQ,CAAA;AAAA,IACnC;AACA,IAAA,MAAM,OAAO,MAAM,OAAA,CAAQ,OAAA,CAAQ,OAAA,EAAS,MAAM,EAAE,CAAA;AACpD,IAAA,aAAA,CAAc,GAAA,CAAI,UAAU,IAAI,CAAA;AAChC,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,eAAe,qBACb,MAAA,EACiB;AACjB,IAAA,MAAM,QAAA,GAAW,4BAA4B,MAAM,CAAA;AACnD,IAAA,IAAI,SAAA,GAAY,mBAAA,CAAoB,GAAA,CAAI,QAAQ,CAAA;AAChD,IAAA,IAAI,cAAc,MAAA,EAAW;AAC3B,MAAA,SAAA,GAAY,MAAM,OAAA,CAAQ,cAAA,CAAe,MAAM,CAAA;AAC/C,MAAA,mBAAA,CAAoB,GAAA,CAAI,UAAU,SAAS,CAAA;AAAA,IAC7C;AACA,IAAA,MAAM,UAAA,GAAa,qBAAA;AAAA,MACjB,MAAA,CAAO,OAAA;AAAA,MACP,MAAA,CAAO,QAAA;AAAA,MACP,MAAA,CAAO,QAAA;AAAA,MACP,MAAA,CAAO;AAAA,KACT;AACA,IAAA,MAAM,YAAA,GACJ,MAAA,CAAO,UAAA,KAAe,IAAA,GACnB,sBAAA,CAAuB,GAAA,CAAI,UAAU,CAAA,IAAK,CAAA,GAC1C,gBAAA,CAAiB,GAAA,CAAI,UAAU,CAAA,IAAK,CAAA;AACzC,IAAA,OAAO,SAAA,GAAY,YAAA;AAAA,EACrB;AAEA,EAAA,eAAe,wBACb,MAAA,EACkB;AAClB,IAAA,MAAM,QAAA,GAAW,wBAAA;AAAA,MACf,MAAA,CAAO,OAAA;AAAA,MACP,MAAA,CAAO,QAAA;AAAA,MACP,MAAA,CAAO,QAAA;AAAA,MACP,MAAA,CAAO,MAAA;AAAA,MACP,MAAA,CAAO,MAAA;AAAA,MACP,MAAA,CAAO;AAAA,KACT;AACA,IAAA,IAAI,kBAAA,CAAmB,GAAA,CAAI,QAAQ,CAAA,EAAG;AACpC,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,IAAI,eAAA,CAAgB,GAAA,CAAI,QAAQ,CAAA,EAAG;AACjC,MAAA,OAAO,eAAA,CAAgB,GAAA,CAAI,QAAQ,CAAA,IAAK,KAAA;AAAA,IAC1C;AACA,IAAA,MAAMC,OAAAA,GAAS,MAAM,OAAA,CAAQ,iBAAA,CAAkB,MAAM,CAAA;AACrD,IAAA,eAAA,CAAgB,GAAA,CAAI,UAAUA,OAAM,CAAA;AACpC,IAAA,OAAOA,OAAAA;AAAA,EACT;AAEA,EAAA,SAAS,iCAAA,CACP,cACA,WAAA,EACM;AACN,IAAA,MAAM,YAAA,GAAe,qBAAA;AAAA,MACnB,YAAA,CAAa,OAAA;AAAA,MACb,YAAA,CAAa,IAAA;AAAA,MACb,YAAA,CAAa,QAAA;AAAA,MACb,YAAA,CAAa;AAAA,KACf;AACA,IAAA,IAAI,gBAAgB,KAAA,EAAO;AACzB,MAAA,qBAAA,CAAsB,kBAAkB,YAAY,CAAA;AACpD,MAAA;AAAA,IACF;AACA,IAAA,IAAI,gBAAgB,WAAA,EAAa;AAC/B,MAAA,IAAI,YAAA,CAAa,YAAY,MAAA,EAAW;AACtC,QAAA,qBAAA,CAAsB,wBAAwB,YAAY,CAAA;AAAA,MAC5D;AACA,MAAA;AAAA,IACF;AACA,IAAA,IAAI,gBAAgB,QAAA,EAAU;AAC5B,MAAA,MAAM,cAAA,GAAiB,wBAAA;AAAA,QACrB,YAAA,CAAa,OAAA;AAAA,QACb,YAAA,CAAa,IAAA;AAAA,QACb,YAAA,CAAa,QAAA;AAAA,QACb,YAAA,CAAa,MAAA;AAAA,QACb,YAAA,CAAa,MAAA;AAAA,QACb,YAAA,CAAa;AAAA,OACf;AACA,MAAA,kBAAA,CAAmB,IAAI,cAAc,CAAA;AAAA,IACvC;AAAA,EACF;AAKA,EAAA,MAAM,iBAAA,GAAoB;AAAA,IACxB,GAAG,OAAA;AAAA,IACH,OAAA,EAAS,aAAA;AAAA,IACT,cAAA,EAAgB,oBAAA;AAAA,IAChB,iBAAA,EAAmB;AAAA,GACrB;AAEA,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,iBAAA;AAAA,IACT;AAAA,GACF;AACF;AAEA,eAAe,4BAAA,CACb,GAAA,EACA,KAAA,EACA,EAAA,EACA,OAAA,EAC6B;AAC7B,EAAA,MAAM,OAAO,KAAA,CAAM,IAAA;AACnB,EAAA,MAAM,WAAW,KAAA,CAAM,QAAA;AACvB,EAAA,MAAM,SAAS,KAAA,CAAM,MAAA;AAGrB,EAAA,MAAM,YAAA,GAAe,mBAAA,CAAoB,GAAA,CAAI,KAAA,EAAO,IAAI,CAAA;AACxD,EAAA,MAAM,WAAW,YAAA,CAAa,IAAA;AAG9B,EAAA,MAAM,aAAA,GAAgB,qBAAA;AAAA,IACpB,IAAA;AAAA,IACA,QAAA;AAAA,IACA,MAAA;AAAA,IACA,YAAA;AAAA,IACA,GAAA,CAAI;AAAA,GACN;AACA,EAAA,IAAI,eAAe,MAAM,aAAA;AAGzB,EAAA,MAAM,QAAA,GAAW,MAAM,OAAA,CAAQ,OAAA,CAAQ,IAAI,OAAA,EAAS,QAAA,EAAU,MAAM,MAAM,CAAA;AAC1E,EAAA,IAAI,CAAC,QAAA,IAAY,QAAA,CAAS,UAAA,EAAY;AACpC,IAAA,MAAM,IAAI,qBAAA,CAAsB;AAAA,MAC9B,QAAA,EAAU,IAAA;AAAA,MACV,QAAA,EAAU,MAAA;AAAA,MACV,QAAA,EAAU,QAAA;AAAA,MACV,QAAQ,KAAA,CAAM;AAAA,KACf,CAAA;AAAA,EACH;AAGA,EAAA,MAAM,MAAA,GAAS,MAAM,OAAA,CAAQ,OAAA,CAAQ,IAAI,OAAA,EAAS,MAAA,EAAQ,MAAM,IAAI,CAAA;AACpE,EAAA,IAAI,CAAC,MAAA,IAAU,MAAA,CAAO,UAAA,EAAY;AAChC,IAAA,MAAM,IAAI,qBAAA,CAAsB;AAAA,MAC9B,QAAA,EAAU,IAAA;AAAA,MACV,QAAA,EAAU,IAAA;AAAA,MACV,QAAA,EAAU,MAAA;AAAA,MACV,QAAQ,KAAA,CAAM;AAAA,KACf,CAAA;AAAA,EACH;AAGA,EAAA,MAAM,cAAA,GAAiB,iBAAA,CAAkB,QAAA,CAAS,MAAA,EAAQ,MAAM,KAAA,EAAO;AAAA,IACrE,IAAA;AAAA,IACA,SAAA,EAAW;AAAA,GACZ,CAAA;AAGD,EAAA,MAAM,SAAA,GAAY,gCAAA;AAAA,IAChB,KAAA,CAAM,SAAA;AAAA,IACN;AAAA,GACF;AACA,EAAA,MAAM,OAAA,GAAU,gCAAA,CAAiC,KAAA,CAAM,OAAA,EAAS,SAAS,CAAA;AAGzE,EAAA,MAAM,WAAA,GAAc,aAAa,WAAA,IAAe,MAAA;AAChD,EAAA,MAAM,iBAAA,GAAuC;AAAA,IAC3C,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,UAAU,GAAA,CAAI,QAAA;AAAA,IACd;AAAA,GACF;AACA,EAAA,MAAM,0BAAA;AAAA,IACJ,iBAAA;AAAA,IACA,IAAA;AAAA,IACA,WAAA;AAAA,IACA,QAAA;AAAA,IACA,KAAA,CAAM,MAAA;AAAA,IACN,MAAA;AAAA,IACA,KAAA,CAAM,IAAA;AAAA,IACN;AAAA,GACF;AAEA,EAAA,OAAO;AAAA,IACL,WAAA;AAAA,IACA,YAAA,EAAc,qBAAA;AAAA,MACZ,GAAA,CAAI,OAAA;AAAA,MACJ,EAAA;AAAA,MACA,IAAA;AAAA,MACA,QAAA;AAAA,MACA,KAAA,CAAM,MAAA;AAAA,MACN,MAAA;AAAA,MACA,KAAA,CAAM,IAAA;AAAA,MACN,cAAA;AAAA,MACA,SAAA;AAAA,MACA;AAAA;AACF,GACF;AACF;AASA,eAAe,yBAAA,CACb,GAAA,EACA,KAAA,EACA,OAAA,EACA,OAAA,EAC2B;AAC3B,EAAA,MAAM,OAAO,KAAA,CAAM,IAAA;AACnB,EAAA,MAAM,EAAA,GAAK,KAAA,CAAM,EAAA,IAAM,UAAA,EAAW;AAClC,EAAA,MAAM,YAAY,GAAA,CAAI,sBAAA,CAAuB,QAAA,EAAU,MAAA,EAAQ,MAAM,EAAE,CAAA;AAGvE,EAAA,OAAO,GAAA,CAAI,kBAAA,CAAmB,SAAA,EAAW,YAAY;AACnD,IAAA,MAAM,WAAW,MAAM,4BAAA;AAAA,MACrB,GAAA;AAAA,MACA,KAAA;AAAA,MACA,EAAA;AAAA,MACA;AAAA,KACF;AAEA,IAAA,IAAI,GAAA;AACJ,IAAqB;AACnB,MAAA,GAAA,GAAM,MAAM,OAAA,CAAQ,UAAA,CAAW,QAAA,CAAS,YAAY,CAAA;AAAA,IACtD;AAKA,IAAA,IAAI,QAAQ,MAAA,EAAW;AACvB,IAAA,OAAO,UAAU,GAAG,CAAA;AAAA,EACtB,CAAC,CAAA;AACH;AAKA,eAAsB,iBAAA,CACpB,GAAA,EACA,KAAA,EACA,OAAA,EACe;AACf,EAAA,MAAM,MAAA,GAAS,MAAM,yBAAA,CAA0B,GAAA,EAAK,OAAO,OAE1D,CAAA;AACD,EAAA,IAAI,CAAC,MAAA,EAAQ;AACX,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,+CAAA;AAAA,MACA,EAAE,SAAA,EAAW,QAAA,EAAU,MAAA,EAAQ,MAAA;AAAO,KACxC;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT;AAmBA,eAAsB,8BAAA,CACpB,GAAA,EACA,MAAA,EACA,OAAA,EACe;AACf,EAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AACvB,IAAA;AAAA,EACF;AAEA,EAAA,MAAM,EAAE,OAAA,EAAS,iBAAA,EAAmB,iCAAA,EAAkC,GACpE,iCAAiC,OAAO,CAAA;AAC1C,EAAA,MAAM,kBAAwC,EAAC;AAE/C,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,IAAA,MAAM,EAAA,GAAK,KAAA,CAAM,EAAA,IAAM,UAAA,EAAW;AAClC,IAAA,MAAM,WAAW,MAAM,4BAAA;AAAA,MACrB,GAAA;AAAA,MACA,KAAA;AAAA,MACA,EAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,eAAA,CAAgB,KAAK,QAAQ,CAAA;AAC7B,IAAA,iCAAA;AAAA,MACE,QAAA,CAAS,YAAA;AAAA,MACT,QAAA,CAAS;AAAA,KACX;AAAA,EACF;AAEA,EAAA,MAAM,oBAAoB,eAAA,CAAgB,GAAA;AAAA,IACxC,CAAC,aAAa,QAAA,CAAS;AAAA,GACzB;AACA,EAAA,IAAI,OAAA,CAAQ,qBAAqB,MAAA,EAAW;AAC1C,IAAA,KAAA,MAAW,gBAAgB,iBAAA,EAAmB;AAC5C,MAAA,OAAO,QAAQ,kBAAA,GAAqB,YAAY,CAAA,IAC9C,OAAA,CAAQ,WAAW,YAAY,CAAA,CAAA;AAAA,IACnC;AACA,IAAA;AAAA,EACF;AACA,EAAA,MAAM,OAAA,CAAQ,iBAAiB,iBAAiB,CAAA;AAClD;AAWA,eAAsB,sBAAA,CACpB,GAAA,EACA,MAAA,EACA,OAAA,EAC0B;AAC1B,EAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AACvB,IAAA,OAAO,EAAC;AAAA,EACV;AAEA,EAAA,MAAM,EAAE,OAAA,EAAS,iBAAA,EAAmB,iCAAA,EAAkC,GACpE,iCAAiC,OAAO,CAAA;AAC1C,EAAA,MAAM,kBAAwC,EAAC;AAE/C,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,IAAA,MAAM,EAAA,GAAK,KAAA,CAAM,EAAA,IAAM,UAAA,EAAW;AAClC,IAAA,MAAM,WAAW,MAAM,4BAAA;AAAA,MACrB,GAAA;AAAA,MACA,KAAA;AAAA,MACA,EAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,eAAA,CAAgB,KAAK,QAAQ,CAAA;AAC7B,IAAA,iCAAA;AAAA,MACE,QAAA,CAAS,YAAA;AAAA,MACT,QAAA,CAAS;AAAA,KACX;AAAA,EACF;AAEA,EAAA,MAAM,oBAAoB,eAAA,CAAgB,GAAA;AAAA,IACxC,CAAC,aAAa,QAAA,CAAS;AAAA,GACzB;AAEA,EAAA,IAAI,IAAA;AACJ,EAAA,IAAI,OAAA,CAAQ,8BAA8B,MAAA,EAAW;AACnD,IAAA,MAAM,iBAAmC,EAAC;AAC1C,IAAA,KAAA,MAAW,gBAAgB,iBAAA,EAAmB;AAC5C,MAAA,cAAA,CAAe,IAAA,CAAK,MAAM,OAAA,CAAQ,UAAA,CAAW,YAAY,CAAC,CAAA;AAAA,IAC5D;AACA,IAAA,IAAA,GAAO,cAAA;AAAA,EACT,CAAA,MAAO;AACL,IAAA,IAAA,GAAO,MAAM,OAAA,CAAQ,yBAAA,CAA0B,iBAAiB,CAAA;AAAA,EAClE;AAEA,EAAA,OAAO,KAAK,GAAA,CAAI,CAAC,GAAA,KAAQ,SAAA,CAAU,GAAG,CAAC,CAAA;AACzC;AAKA,eAAsB,iBAAA,CACpB,GAAA,EACA,KAAA,EAKA,OAAA,EACe;AACf,EAAA,MAAM,KAAK,KAAA,CAAM,EAAA;AAGjB,EAAA,MAAM,WAAW,MAAM,OAAA,CAAQ,OAAA,CAAQ,GAAA,CAAI,SAAS,EAAE,CAAA;AACtD,EAAA,IAAI,CAAC,QAAA,IAAY,QAAA,CAAS,UAAA,EAAY;AACpC,IAAA,MAAM,IAAI,iBAAA,CAAkB,SAAA,EAAW,EAAE,CAAA;AAAA,EAC3C;AAEA,EAAA,MAAM,YAAY,GAAA,CAAI,sBAAA;AAAA,IACpB,QAAA;AAAA,IACA,MAAA;AAAA,IACA,QAAA,CAAS,IAAA;AAAA,IACT;AAAA,GACF;AAEA,EAAA,OAAO,GAAA,CAAI,kBAAA,CAAmB,SAAA,EAAW,YAAY;AAEnD,IAAA,MAAM,YAAA,GAAe,mBAAA,CAAoB,GAAA,CAAI,KAAA,EAAO,SAAS,IAAI,CAAA;AACjE,IAAA,MAAM,WAAW,YAAA,CAAa,IAAA;AAG9B,IAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,KAAA,CAAM,QAAA,CAAS,KAAK,CAAA;AAC/C,IAAA,MAAM,cAAc,EAAE,GAAG,aAAA,EAAe,GAAG,MAAM,KAAA,EAAM;AAGvD,IAAA,MAAM,cAAA,GAAiB,iBAAA,CAAkB,QAAA,CAAS,MAAA,EAAQ,WAAA,EAAa;AAAA,MACrE,MAAM,QAAA,CAAS,IAAA;AAAA,MACf,SAAA,EAAW,QAAA;AAAA,MACX;AAAA,KACD,CAAA;AAGD,IAAA,MAAM,OAAA,GAAU,gCAAA,CAAiC,KAAA,CAAM,OAAA,EAAS,SAAS,CAAA;AAGzE,IAAA,MAAM,YAAA,GAKF;AAAA,MACF,SAAS,GAAA,CAAI,OAAA;AAAA,MACb,EAAA;AAAA,MACA,KAAA,EAAO;AAAA,KACT;AACA,IAAA,IAAI,OAAA,KAAY,MAAA,EAAW,YAAA,CAAa,OAAA,GAAU,OAAA;AAElD,IAAA,MAAM,GAAA,GAAM,MAAM,OAAA,CAAQ,UAAA,CAAW,YAAY,CAAA;AAEjD,IAAA,OAAO,UAAU,GAAG,CAAA;AAAA,EACtB,CAAC,CAAA;AACH;AAMA,eAAsB,uBAAA,CACpB,GAAA,EACA,KAAA,EAKA,OAAA,EACA,OAAA,EACe;AACf,EAAA,MAAM,KAAK,KAAA,CAAM,EAAA;AAEjB,EAAA,MAAM,WAAW,MAAM,OAAA,CAAQ,OAAA,CAAQ,GAAA,CAAI,SAAS,EAAE,CAAA;AACtD,EAAA,IAAI,CAAC,QAAA,EAAU;AACb,IAAA,MAAM,IAAI,iBAAA,CAAkB,SAAA,EAAW,EAAE,CAAA;AAAA,EAC3C;AAEA,EAAA,MAAM,YAAA,GAAe,mBAAA,CAAoB,GAAA,CAAI,KAAA,EAAO,SAAS,IAAI,CAAA;AACjE,EAAA,MAAM,WAAW,YAAA,CAAa,IAAA;AAE9B,EAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,KAAA,CAAM,QAAA,CAAS,KAAK,CAAA;AAC/C,EAAA,MAAM,cAAc,EAAE,GAAG,aAAA,EAAe,GAAG,MAAM,KAAA,EAAM;AAEvD,EAAA,MAAM,cAAA,GAAiB,iBAAA,CAAkB,QAAA,CAAS,MAAA,EAAQ,WAAA,EAAa;AAAA,IACrE,MAAM,QAAA,CAAS,IAAA;AAAA,IACf,SAAA,EAAW,QAAA;AAAA,IACX;AAAA,GACD,CAAA;AAED,EAAA,MAAM,OAAA,GAAU,gCAAA,CAAiC,KAAA,CAAM,OAAA,EAAS,SAAS,CAAA;AAEzE,EAAA,MAAM,YAAA,GAMF;AAAA,IACF,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,EAAA;AAAA,IACA,KAAA,EAAO;AAAA,GACT;AACA,EAAA,IAAI,OAAA,KAAY,MAAA,EAAW,YAAA,CAAa,OAAA,GAAU,OAAA;AAClD,EAAA,IAAI,OAAA,EAAS,YAAA,EAAc,YAAA,CAAa,YAAA,GAAe,IAAA;AAEvD,EAAA,MAAM,GAAA,GAAM,MAAM,OAAA,CAAQ,UAAA,CAAW,YAAY,CAAA;AAEjD,EAAA,OAAO,UAAU,GAAG,CAAA;AACtB;AAKA,eAAsB,iBAAA,CACpB,GAAA,EACA,EAAA,EACA,OAAA,EACe;AAEf,EAAA,MAAM,WAAW,MAAM,OAAA,CAAQ,OAAA,CAAQ,GAAA,CAAI,SAAS,EAAE,CAAA;AACtD,EAAA,IAAI,CAAC,QAAA,IAAY,QAAA,CAAS,UAAA,EAAY;AAEpC,IAAA;AAAA,EACF;AAEA,EAAA,MAAM,YAAY,GAAA,CAAI,sBAAA;AAAA,IACpB,QAAA;AAAA,IACA,MAAA;AAAA,IACA,QAAA,CAAS,IAAA;AAAA,IACT;AAAA,GACF;AAEA,EAAA,OAAO,GAAA,CAAI,kBAAA,CAAmB,SAAA,EAAW,YAAY;AACnD,IAAA,MAAM,QAAQ,UAAA,CAAW;AAAA,MACvB,SAAS,GAAA,CAAI,OAAA;AAAA,MACb;AAAA,KACD,CAAA;AAAA,EACH,CAAC,CAAA;AACH;AAOA,eAAsB,qBAAA,CACpB,GAAA,EACA,EAAA,EACA,OAAA,EACe;AAEf,EAAA,MAAM,WAAW,MAAM,OAAA,CAAQ,OAAA,CAAQ,GAAA,CAAI,SAAS,EAAE,CAAA;AACtD,EAAA,IAAI,CAAC,QAAA,EAAU;AAEb,IAAA;AAAA,EACF;AAEA,EAAA,MAAM,YAAY,GAAA,CAAI,sBAAA;AAAA,IACpB,QAAA;AAAA,IACA,MAAA;AAAA,IACA,QAAA,CAAS,IAAA;AAAA,IACT;AAAA,GACF;AAEA,EAAA,OAAO,GAAA,CAAI,kBAAA,CAAmB,SAAA,EAAW,YAAY;AACnD,IAAA,MAAM,QAAQ,cAAA,CAAe;AAAA,MAC3B,SAAS,GAAA,CAAI,OAAA;AAAA,MACb;AAAA,KACD,CAAA;AAAA,EACH,CAAC,CAAA;AACH;AAOA,IAAM,UAAA,GAAa,GAAA;AACnB,IAAM,QAAA,GAAW,GAAA;AACjB,IAAM,kBAAA,GAAqB,GAAA;AAM3B,SAAS,qBAAA,CACP,MAAA,EACA,OAAA,EACA,QAAA,EACM;AACN,EAAA,IAAI,OAAA,CAAQ,WAAW,CAAA,EAAG;AAC1B,EAAA,MAAM,QAAQ,MAAA,CAAO,KAAA;AACrB,EAAA,IAAI,UAAU,MAAA,EAAW;AACvB,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,cAAc,QAAQ,CAAA,wDAAA,CAAA;AAAA,MACtB;AAAA,QACE,IAAA,EAAM,QAAA;AAAA,QACN,SAAA,EAAW,QAAA;AAAA,QACX,MAAA,EAAQ,OAAA,CAAQ,GAAA,CAAI,CAACtD,MAAAA,MAAW;AAAA,UAC9B,IAAA,EAAMA,MAAAA;AAAA,UACN,OAAA,EAAS,UAAUA,MAAK,CAAA,+BAAA;AAAA,SAC1B,CAAE;AAAA;AACJ,KACF;AAAA,EACF;AAEA,EAAA,MAAM,gBAAgB,OAAA,CAAQ,MAAA,CAAO,CAACA,MAAAA,KAAU,EAAEA,UAAS,KAAA,CAAM,CAAA;AACjE,EAAA,IAAI,aAAA,CAAc,SAAS,CAAA,EAAG;AAC5B,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,yCAAyC,QAAQ,CAAA,GAAA,EAAM,aAAA,CAAc,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA;AAAA,MAC/E;AAAA,QACE,IAAA,EAAM,QAAA;AAAA,QACN,SAAA,EAAW,QAAA;AAAA,QACX,MAAA,EAAQ,aAAA,CAAc,GAAA,CAAI,CAACA,MAAAA,MAAW;AAAA,UACpC,IAAA,EAAMA,MAAAA;AAAA,UACN,OAAA,EAAS,UAAUA,MAAK,CAAA,+BAAA;AAAA,SAC1B,CAAE;AAAA;AACJ,KACF;AAAA,EACF;AACF;AAMA,SAAS,gBAAgB,KAAA,EAAwB;AAC/C,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,kBAAA;AAChC,EAAA,IAAI,KAAA,KAAU,QAAQ,OAAO,KAAA,KAAU,UAAU,OAAO,IAAA,CAAK,UAAU,KAAK,CAAA;AAC5E,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACxB,IAAA,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,eAAA,CAAgB,IAAI,CAAC,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,EACjE;AACA,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,IAAA,CAAK,KAAK,EAAE,QAAA,EAAS;AAC3C,EAAA,MAAM,UAAU,MAAA,CAAO,GAAA;AAAA,IACrB,CAAC,GAAA,KACC,CAAA,EAAG,IAAA,CAAK,SAAA,CAAU,GAAG,CAAC,CAAA,CAAA,EAAI,eAAA,CAAiB,KAAA,CAAkC,GAAG,CAAC,CAAC,CAAA;AAAA,GACtF;AACA,EAAA,OAAO,CAAA,CAAA,EAAI,OAAA,CAAQ,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAC9B;AAOA,SAAS,sBACP,QAAA,EACA,MAAA,EACA,MAAA,EACA,IAAA,EACA,OACA,OAAA,EACQ;AACR,EAAA,MAAM,YAAA,GAAe,CAAA,EAAG,QAAQ,CAAA,EAAG,UAAU,CAAA,EAAG,MAAM,CAAA,EAAG,UAAU,CAAA,EAAG,MAAM,CAAA,EAAG,UAAU,GAAG,IAAI,CAAA,CAAA;AAChG,EAAA,IAAI,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG,OAAO,YAAA;AAEjC,EAAA,MAAM,YAAA,GAAe,CAAC,GAAG,OAAO,EAAE,QAAA,EAAS;AAC3C,EAAA,MAAM,gBAAgB,YAAA,CAAa,GAAA;AAAA,IACjC,CAACA,MAAAA,KACC,CAAA,EAAG,UAAU,CAAA,EAAGA,MAAK,CAAA,EAAG,QAAQ,CAAA,EAAG,eAAA,CAAgB,KAAA,CAAMA,MAAK,CAAC,CAAC,CAAA;AAAA,GACpE;AACA,EAAA,OAAO,YAAA,GAAe,aAAA,CAAc,IAAA,CAAK,EAAE,CAAA;AAC7C;AAKA,SAAS,oBAAA,CACP,QAAA,EACA,MAAA,EACA,MAAA,EACA,IAAA,EACQ;AACR,EAAA,OAAO,CAAA,EAAG,QAAQ,CAAA,EAAG,UAAU,CAAA,EAAG,MAAM,CAAA,EAAG,UAAU,CAAA,EAAG,MAAM,CAAA,EAAG,UAAU,GAAG,IAAI,CAAA,CAAA;AACpF;AAWA,SAAS,gBAAA,CACP,IAAA,EACA,OAAA,EACA,UAAA,EACW;AACX,EAAA,IAAI,OAAA;AACJ,EAAA,IAAI,UAAA;AAEJ,EAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,IAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtB,MAAA,MAAM,QAAA,GAAW,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,KAAK,CAAA;AACrC,MAAA,MAAM,UAAU,OAAA,CAAQ,KAAA;AAAA,QACtB,CAACA,MAAAA,KACC,eAAA,CAAgB,QAAA,CAASA,MAAK,CAAC,CAAA,KAC/B,eAAA,CAAgB,UAAA,CAAWA,MAAK,CAAC;AAAA,OACrC;AACA,MAAA,IAAI,CAAC,OAAA,EAAS;AAAA,IAChB;AAEA,IAAA,IAAI,GAAA,CAAI,eAAe,MAAA,EAAW;AAChC,MAAA,OAAA,KAAY,GAAA;AAAA,IACd,CAAA,MAAO;AACL,MAAA,UAAA,KAAe,GAAA;AAAA,IACjB;AAEA,IAAA,IAAI,YAAY,MAAA,EAAW;AAAA,EAC7B;AAEA,EAAA,OAAO,EAAE,SAAS,UAAA,EAAW;AAC/B;AAWA,eAAsB,0BAAA,CACpB,KACA,IAAA,EACA,QAAA,EACA,QACA,MAAA,EACA,IAAA,EACA,SACA,OAAA,EAO2B;AAC3B,EAAA,MAAM,OAAA,GAAU,OAAA,EAAS,OAAA,IAAW,EAAC;AACrC,EAAA,MAAM,KAAA,GAAQ,OAAA,EAAS,KAAA,IAAS,EAAC;AAEjC,EAAA,MAAM,YAAA,GAAe,mBAAA,CAAoB,GAAA,CAAI,KAAA,EAAO,IAAI,CAAA;AACxD,EAAA,MAAM,WAAW,YAAA,CAAa,IAAA;AAE9B,EAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtB,IAAA,qBAAA,CAAsB,QAAA,CAAS,MAAA,EAAQ,OAAA,EAAS,IAAI,CAAA;AAAA,EACtD;AAEA,EAAA,MAAM,aAAA,GAAgB,MAAM,OAAA,CAAQ,eAAA,CAAgB;AAAA,IAClD,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,IAAA;AAAA,IACA,QAAA;AAAA,IACA,MAAA;AAAA,IACA,MAAA;AAAA,IACA,IAAA;AAAA,IACA,cAAA,EAAgB,SAAS,cAAA,IAAkB,IAAA;AAAA,IAC3C,GAAI,OAAA,EAAS,YAAA,KAAiB,MAAA,IAAa;AAAA,MACzC,cAAc,OAAA,CAAQ;AAAA,KACxB;AAAA,IACA,GAAI,OAAA,EAAS,IAAA,KAAS,UAAa,EAAE,IAAA,EAAM,QAAQ,IAAA;AAAK,GACzD,CAAA;AAED,EAAA,IAAI,aAAA,CAAc,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AAEvC,EAAA,IAAI,QAAQ,MAAA,KAAW,CAAA,SAAU,SAAA,CAAU,aAAA,CAAc,CAAC,CAAE,CAAA;AAE5D,EAAA,MAAM,EAAE,OAAA,EAAQ,GAAI,gBAAA,CAAiB,aAAA,EAAe,SAAS,KAAK,CAAA;AAClE,EAAA,OAAO,OAAA,KAAY,MAAA,GAAY,MAAA,GAAY,SAAA,CAAU,OAAO,CAAA;AAC9D;AAKA,eAAsB,iCAAA,CACpB,KACA,IAAA,EACA,QAAA,EACA,QACA,MAAA,EACA,IAAA,EACA,KAAA,EACA,OAAA,EACA,OAAA,EAI8D;AAC9D,EAAA,MAAM,QAAA,GAAW,SAAS,QAAA,IAAY,QAAA;AACtC,EAAA,MAAM,OAAA,GAAU,OAAA,EAAS,OAAA,IAAW,EAAC;AAErC,EAAA,MAAM,YAAA,GAAe,mBAAA,CAAoB,GAAA,CAAI,KAAA,EAAO,IAAI,CAAA;AACxD,EAAA,MAAM,WAAW,YAAA,CAAa,IAAA;AAG9B,EAAA,MAAM,cAAA,GAAiB,iBAAA,CAAkB,QAAA,CAAS,MAAA,EAAQ,KAAA,EAAO;AAAA,IAC/D,IAAA;AAAA,IACA,SAAA,EAAW;AAAA,GACZ,CAAA;AAGD,EAAA,qBAAA,CAAsB,QAAA,CAAS,MAAA,EAAQ,OAAA,EAAS,IAAI,CAAA;AAGpD,EAAA,MAAM,aAAA,GAAgB,MAAM,OAAA,CAAQ,eAAA,CAAgB;AAAA,IAClD,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,IAAA;AAAA,IACA,QAAA;AAAA,IACA,MAAA;AAAA,IACA,MAAA;AAAA,IACA,IAAA;AAAA,IACA,cAAA,EAAgB,KAAA;AAAA,IAChB,YAAA,EAAc;AAAA,GACf,CAAA;AAED,EAAA,MAAM,EAAE,OAAA,EAAS,UAAA,EAAW,GAAI,gBAAA;AAAA,IAC9B,aAAA;AAAA,IACA,OAAA;AAAA,IACA;AAAA,GACF;AAGA,EAAA,IAAI,OAAA,KAAY,MAAA,IAAa,UAAA,KAAe,MAAA,EAAW;AACrD,IAAA,MAAM,KAAA,GAAyB;AAAA,MAC7B,IAAA;AAAA,MACA,QAAA;AAAA,MACA,MAAA;AAAA,MACA,MAAA;AAAA,MACA,IAAA;AAAA,MACA,KAAA,EAAO;AAAA,KACT;AACA,IAAA,MAAMuD,KAAAA,GAAO,MAAM,iBAAA,CAAkB,GAAA,EAAK,OAAO,OAAO,CAAA;AACxD,IAAA,OAAO,EAAE,IAAA,EAAAA,KAAAA,EAAM,MAAA,EAAQ,SAAA,EAAU;AAAA,EACnC;AAGA,EAAA,IAAI,YAAY,MAAA,EAAW;AACzB,IAAA,IAAI,aAAa,QAAA,EAAU;AACzB,MAAA,OAAO,EAAE,IAAA,EAAM,SAAA,CAAU,OAAO,CAAA,EAAG,QAAQ,OAAA,EAAQ;AAAA,IACrD;AAEA,IAAA,MAAMA,QAAO,MAAM,uBAAA;AAAA,MACjB,GAAA;AAAA,MACA,EAAE,EAAA,EAAI,OAAA,CAAQ,EAAA,EAAI,OAAO,cAAA,EAAe;AAAA,MACxC;AAAA,KACF;AACA,IAAA,OAAO,EAAE,IAAA,EAAAA,KAAAA,EAAM,MAAA,EAAQ,SAAA,EAAU;AAAA,EACnC;AAGA,EAAA,MAAM,WAAA,GAAc,aAAa,WAAA,IAAe,MAAA;AAChD,EAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,IAAA,MAAM,IAAI,MAAM,mCAAmC,CAAA;AAAA,EACrD;AACA,EAAA,MAAM,iBAAA,GAAoB,UAAA;AAC1B,EAAA,MAAM,mBAAmB,iBAAA,CAAkB,QAAA;AAC3C,EAAA,MAAM,iBAAA,GAAuC;AAAA,IAC3C,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,UAAU,GAAA,CAAI,QAAA;AAAA,IACd;AAAA,GACF;AACA,EAAA,MAAM,0BAAA;AAAA,IACJ,iBAAA;AAAA,IACA,IAAA;AAAA,IACA,WAAA;AAAA,IACA,QAAA;AAAA,IACA,MAAA;AAAA,IACA,MAAA;AAAA,IACA,IAAA;AAAA,IACA;AAAA,GACF;AAEA,EAAA,MAAM,OAAO,MAAM,uBAAA;AAAA,IACjB,GAAA;AAAA,IACA,EAAE,EAAA,EAAI,iBAAA,CAAkB,EAAA,EAAI,OAAO,cAAA,EAAe;AAAA,IAClD,OAAA;AAAA,IACA,EAAE,cAAc,IAAA;AAAK,GACvB;AACA,EAAA,OAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,aAAA,EAAc;AACvC;AAKA,eAAsB,qCAAA,CACpB,GAAA,EACA,IAAA,EACA,KAAA,EAOA,SACA,OAAA,EAIgE;AAChE,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAEhC,EAAA,MAAM,QAAA,GAAW,SAAS,QAAA,IAAY,QAAA;AACtC,EAAA,MAAM,OAAA,GAAU,OAAA,EAAS,OAAA,IAAW,EAAC;AAErC,EAAA,MAAM,YAAA,GAAe,mBAAA,CAAoB,GAAA,CAAI,KAAA,EAAO,IAAI,CAAA;AACxD,EAAA,MAAM,WAAW,YAAA,CAAa,IAAA;AAC9B,EAAA,MAAM,WAAA,GAAc,aAAa,WAAA,IAAe,MAAA;AAGhD,EAAA,qBAAA,CAAsB,QAAA,CAAS,MAAA,EAAQ,OAAA,EAAS,IAAI,CAAA;AAGpD,EAAA,MAAM,YAQA,EAAC;AAEP,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,cAAA,GAAiB,iBAAA,CAAkB,QAAA,CAAS,MAAA,EAAQ,KAAK,KAAA,EAAO;AAAA,MACpE,IAAA;AAAA,MACA,SAAA,EAAW;AAAA,KACZ,CAAA;AAED,IAAA,MAAM,YAAA,GAAe,qBAAA;AAAA,MACnB,IAAA,CAAK,QAAA;AAAA,MACL,IAAA,CAAK,MAAA;AAAA,MACL,IAAA,CAAK,MAAA;AAAA,MACL,IAAA,CAAK,IAAA;AAAA,MACL,cAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,MAAM,WAAA,GAAc,oBAAA;AAAA,MAClB,IAAA,CAAK,QAAA;AAAA,MACL,IAAA,CAAK,MAAA;AAAA,MACL,IAAA,CAAK,MAAA;AAAA,MACL,IAAA,CAAK;AAAA,KACP;AAEA,IAAA,SAAA,CAAU,IAAA,CAAK;AAAA,MACb,UAAU,IAAA,CAAK,QAAA;AAAA,MACf,QAAQ,IAAA,CAAK,MAAA;AAAA,MACb,QAAQ,IAAA,CAAK,MAAA;AAAA,MACb,MAAM,IAAA,CAAK,IAAA;AAAA,MACX,cAAA;AAAA,MACA,YAAA;AAAA,MACA;AAAA,KACD,CAAA;AAAA,EACH;AAGA,EAAA,MAAM,eAAA,uBAAsB,GAAA,EAG1B;AACF,EAAA,KAAA,MAAWxB,UAAS,SAAA,EAAW;AAC7B,IAAA,IAAI,CAAC,eAAA,CAAgB,GAAA,CAAIA,MAAAA,CAAM,WAAW,CAAA,EAAG;AAC3C,MAAA,eAAA,CAAgB,GAAA,CAAIA,OAAM,WAAA,EAAa;AAAA,QACrC,UAAUA,MAAAA,CAAM,QAAA;AAAA,QAChB,QAAQA,MAAAA,CAAM,MAAA;AAAA,QACd,QAAQA,MAAAA,CAAM,MAAA;AAAA,QACd,MAAMA,MAAAA,CAAM;AAAA,OACb,CAAA;AAAA,IACH;AAAA,EACF;AAGA,EAAA,MAAM,cAAA,uBAAqB,GAAA,EAAuC;AAClE,EAAA,KAAA,MAAW,CAAC,WAAA,EAAa,QAAQ,CAAA,IAAK,eAAA,EAAiB;AACrD,IAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,eAAA,CAAgB;AAAA,MACzC,SAAS,GAAA,CAAI,OAAA;AAAA,MACb,IAAA;AAAA,MACA,UAAU,QAAA,CAAS,QAAA;AAAA,MACnB,QAAQ,QAAA,CAAS,MAAA;AAAA,MACjB,QAAQ,QAAA,CAAS,MAAA;AAAA,MACjB,MAAM,QAAA,CAAS,IAAA;AAAA,MACf,cAAA,EAAgB,KAAA;AAAA,MAChB,YAAA,EAAc;AAAA,KACf,CAAA;AACD,IAAA,cAAA,CAAe,GAAA,CAAI,aAAa,IAAI,CAAA;AAAA,EACtC;AAkBA,EAAA,MAAM,WAA0B,EAAC;AACjC,EAAA,MAAM,UAAwB,EAAC;AAC/B,EAAA,MAAM,cAAwD,EAAC;AAC/D,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AAEzC,EAAA,KAAA,MAAW,CAAC,KAAA,EAAOA,MAAK,CAAA,IAAK,SAAA,CAAU,SAAQ,EAAG;AAEhD,IAAA,MAAM,aAAA,GAAgB,QAAA,CAAS,GAAA,CAAIA,MAAAA,CAAM,YAAY,CAAA;AACrD,IAAA,IAAI,kBAAkB,MAAA,EAAW;AAC/B,MAAA,WAAA,CAAY,IAAA,CAAK,EAAE,KAAA,EAAO,WAAA,EAAa,eAAe,CAAA;AACtD,MAAA;AAAA,IACF;AACA,IAAA,QAAA,CAAS,GAAA,CAAIA,MAAAA,CAAM,YAAA,EAAc,KAAK,CAAA;AAEtC,IAAA,MAAM,gBAAgB,cAAA,CAAe,GAAA,CAAIA,MAAAA,CAAM,WAAW,KAAK,EAAC;AAChE,IAAA,MAAM,EAAE,OAAA,EAAS,UAAA,EAAW,GAAI,gBAAA;AAAA,MAC9B,aAAA;AAAA,MACA,OAAA;AAAA,MACAA,MAAAA,CAAM;AAAA,KACR;AAEA,IAAA,IAAI,OAAA,KAAY,MAAA,IAAa,UAAA,KAAe,MAAA,EAAW;AACrD,MAAA,QAAA,CAAS,IAAA,CAAK;AAAA,QACZ,KAAA;AAAA,QACA,KAAA,EAAO;AAAA,UACL,IAAA;AAAA,UACA,UAAUA,MAAAA,CAAM,QAAA;AAAA,UAChB,QAAQA,MAAAA,CAAM,MAAA;AAAA,UACd,QAAQA,MAAAA,CAAM,MAAA;AAAA,UACd,MAAMA,MAAAA,CAAM,IAAA;AAAA,UACZ,OAAOA,MAAAA,CAAM;AAAA;AACf,OACD,CAAA;AAAA,IACH,CAAA,MAAO;AAEL,MAAA,MAAM,UAAU,OAAA,IAAW,UAAA;AAC3B,MAAA,IAAI,YAAY,MAAA,EAAW;AACzB,QAAA,MAAM,IAAI,MAAM,gDAAgD,CAAA;AAAA,MAClE;AACA,MAAA,OAAA,CAAQ,IAAA,CAAK;AAAA,QACX,KAAA;AAAA,QACA,GAAA,EAAK,OAAA;AAAA,QACL,WAAW,OAAA,KAAY,MAAA;AAAA,QACvB,gBAAgBA,MAAAA,CAAM,cAAA;AAAA,QACtB,UAAUA,MAAAA,CAAM,QAAA;AAAA,QAChB,QAAQA,MAAAA,CAAM,MAAA;AAAA,QACd,QAAQA,MAAAA,CAAM,MAAA;AAAA,QACd,MAAMA,MAAAA,CAAM;AAAA,OACb,CAAA;AAAA,IACH;AAAA,EACF;AAMA,EAAA,MAAM,UAAoB,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,KAAA,CAAM,QAAQ,CAAA;AAG7D,EAAA,IAAI,QAAA,CAAS,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,eAAe,QAAA,CAAS,GAAA,CAAI,CAACA,MAAAA,KAAUA,OAAM,KAAK,CAAA;AACxD,IAAA,MAAM,eAAe,MAAM,sBAAA;AAAA,MACzB,GAAA;AAAA,MACA,YAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,KAAA,MAAW,CAAC,UAAA,EAAYA,MAAK,CAAA,IAAK,QAAA,CAAS,SAAQ,EAAG;AACpD,MAAA,OAAA,CAAQA,MAAAA,CAAM,KAAK,CAAA,GAAI;AAAA,QACrB,IAAA,EAAM,aAAa,UAAU,CAAA;AAAA,QAC7B,MAAA,EAAQ;AAAA,OACV;AAAA,IACF;AAAA,EACF;AAGA,EAAA,KAAA,MAAWA,UAAS,OAAA,EAAS;AAC3B,IAAA,IAAIA,OAAM,SAAA,EAAW;AAEnB,MAAA,MAAM,gBAAA,GAAmBA,OAAM,GAAA,CAAI,QAAA;AACnC,MAAA,MAAM,iBAAA,GAAuC;AAAA,QAC3C,SAAS,GAAA,CAAI,OAAA;AAAA,QACb,UAAU,GAAA,CAAI,QAAA;AAAA,QACd;AAAA,OACF;AACA,MAAA,MAAM,0BAAA;AAAA,QACJ,iBAAA;AAAA,QACA,IAAA;AAAA,QACA,WAAA;AAAA,QACAA,MAAAA,CAAM,QAAA;AAAA,QACNA,MAAAA,CAAM,MAAA;AAAA,QACNA,MAAAA,CAAM,MAAA;AAAA,QACNA,MAAAA,CAAM,IAAA;AAAA,QACN;AAAA,OACF;AAEA,MAAA,MAAM,OAAO,MAAM,uBAAA;AAAA,QACjB,GAAA;AAAA,QACA,EAAE,EAAA,EAAIA,MAAAA,CAAM,IAAI,EAAA,EAAI,KAAA,EAAOA,OAAM,cAAA,EAAe;AAAA,QAChD,OAAA;AAAA,QACA,EAAE,cAAc,IAAA;AAAK,OACvB;AACA,MAAA,OAAA,CAAQA,OAAM,KAAK,CAAA,GAAI,EAAE,IAAA,EAAM,QAAQ,aAAA,EAAc;AAAA,IACvD,CAAA,MAAA,IAAW,aAAa,QAAA,EAAU;AAChC,MAAA,MAAM,OAAO,MAAM,uBAAA;AAAA,QACjB,GAAA;AAAA,QACA,EAAE,EAAA,EAAIA,MAAAA,CAAM,IAAI,EAAA,EAAI,KAAA,EAAOA,OAAM,cAAA,EAAe;AAAA,QAChD;AAAA,OACF;AACA,MAAA,OAAA,CAAQA,OAAM,KAAK,CAAA,GAAI,EAAE,IAAA,EAAM,QAAQ,SAAA,EAAU;AAAA,IACnD,CAAA,MAAO;AACL,MAAA,OAAA,CAAQA,MAAAA,CAAM,KAAK,CAAA,GAAI,EAAE,IAAA,EAAM,UAAUA,MAAAA,CAAM,GAAG,CAAA,EAAG,MAAA,EAAQ,OAAA,EAAQ;AAAA,IACvE;AAAA,EACF;AAGA,EAAA,KAAA,MAAW,EAAE,KAAA,EAAO,WAAA,EAAY,IAAK,WAAA,EAAa;AAChD,IAAA,MAAM,YAAA,GAAe,QAAQ,WAAW,CAAA;AACxC,IAAA,OAAA,CAAQ,KAAK,CAAA,GAAI,EAAE,MAAM,YAAA,CAAa,IAAA,EAAM,QAAQ,OAAA,EAAQ;AAAA,EAC9D;AAEA,EAAA,OAAO,OAAA;AACT;;;ACxuCA,eAAsB,0BAAA,CACpB,GAAA,EACA,IAAA,EACA,EAAA,EACA,OACA,WAAA,EACe;AACf,EAAA,KAAA,MAAW,cAAc,WAAA,EAAa;AACpC,IAAA,IAAI,CAAC,mBAAA,CAAoB,UAAA,EAAY,KAAK,CAAA,EAAG;AAC3C,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,GAAA,GAAM,gBAAA;AAAA,MACV,KAAA;AAAA,MACA,UAAA,CAAW,MAAA;AAAA,MACX,UAAA,CAAW;AAAA,KACb;AAEA,IAAA,MAAM,YAAA,GAAe,0BAAA;AAAA,MACnB,IAAA;AAAA,MACA,UAAA,CAAW,KAAA;AAAA,MACX,GAAA,CAAI;AAAA,KACN;AAEA,IAAA,KAAA,MAAW,eAAe,YAAA,EAAc;AACtC,MAAA,MAAM,QAAA,GAAW,MAAM,GAAA,CAAI,OAAA,CAAQ,WAAA,CAAY;AAAA,QAC7C,SAAS,GAAA,CAAI,OAAA;AAAA,QACb,QAAA,EAAU,WAAA;AAAA,QACV,gBAAgB,UAAA,CAAW,IAAA;AAAA,QAC3B;AAAA,OACD,CAAA;AAED,MAAA,IAAI,QAAA,IAAY,QAAA,CAAS,OAAA,KAAY,EAAA,EAAI;AACvC,QAAA,MAAM,IAAI,eAAA,CAAgB;AAAA,UACxB,gBAAgB,UAAA,CAAW,IAAA;AAAA,UAC3B,IAAA,EAAM,WAAA;AAAA,UACN,YAAY,QAAA,CAAS,OAAA;AAAA,UACrB,KAAA,EAAO,EAAA;AAAA,UACP,QAAQ,UAAA,CAAW;AAAA,SACpB,CAAA;AAAA,MACH;AAAA,IACF;AAAA,EACF;AACF;AAKA,eAAsB,uBAAA,CACpB,GAAA,EACA,IAAA,EACA,EAAA,EACA,OACA,WAAA,EACe;AACf,EAAA,KAAA,MAAW,cAAc,WAAA,EAAa;AACpC,IAAA,IAAI,CAAC,mBAAA,CAAoB,UAAA,EAAY,KAAK,CAAA,EAAG;AAC3C,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,GAAA,GAAM,gBAAA;AAAA,MACV,KAAA;AAAA,MACA,UAAA,CAAW,MAAA;AAAA,MACX,UAAA,CAAW;AAAA,KACb;AAEA,IAAA,MAAM,GAAA,CAAI,QAAQ,YAAA,CAAa;AAAA,MAC7B,SAAS,GAAA,CAAI,OAAA;AAAA,MACb,QAAA,EAAU,IAAA;AAAA,MACV,gBAAgB,UAAA,CAAW,IAAA;AAAA,MAC3B,GAAA;AAAA,MACA,MAAA,EAAQ,EAAA;AAAA,MACR,YAAA,EAAc;AAAA,KACf,CAAA;AAAA,EACH;AACF;AAKA,eAAsB,uBAAA,CACpB,GAAA,EACA,IAAA,EACA,KAAA,EACA,WAAA,EACe;AACf,EAAA,KAAA,MAAW,cAAc,WAAA,EAAa;AACpC,IAAA,IAAI,CAAC,mBAAA,CAAoB,UAAA,EAAY,KAAK,CAAA,EAAG;AAC3C,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,GAAA,GAAM,gBAAA;AAAA,MACV,KAAA;AAAA,MACA,UAAA,CAAW,MAAA;AAAA,MACX,UAAA,CAAW;AAAA,KACb;AAEA,IAAA,MAAM,GAAA,CAAI,QAAQ,YAAA,CAAa;AAAA,MAC7B,SAAS,GAAA,CAAI,OAAA;AAAA,MACb,QAAA,EAAU,IAAA;AAAA,MACV,gBAAgB,UAAA,CAAW,IAAA;AAAA,MAC3B;AAAA,KACD,CAAA;AAAA,EACH;AACF;AAWA,eAAsB,wBACpB,GAAA,EACA,IAAA,EACA,EAAA,EACA,QAAA,EACA,UACA,WAAA,EACe;AACf,EAAA,KAAA,MAAW,cAAc,WAAA,EAAa;AACpC,IAAA,MAAM,UAAA,GAAa,mBAAA,CAAoB,UAAA,EAAY,QAAQ,CAAA;AAC3D,IAAA,MAAM,UAAA,GAAa,mBAAA,CAAoB,UAAA,EAAY,QAAQ,CAAA;AAE3D,IAAA,MAAM,MAAA,GACJ,aACE,gBAAA,CAAiB,QAAA,EAAU,WAAW,MAAA,EAAQ,UAAA,CAAW,SAAS,CAAA,GAClE,MAAA;AACJ,IAAA,MAAM,MAAA,GACJ,aACE,gBAAA,CAAiB,QAAA,EAAU,WAAW,MAAA,EAAQ,UAAA,CAAW,SAAS,CAAA,GAClE,MAAA;AAGJ,IAAA,IAAI,CAAC,UAAA,IAAc,CAAC,UAAA,EAAY;AAC9B,MAAA;AAAA,IACF;AAGA,IAAA,IAAI,UAAA,IAAc,UAAA,IAAc,MAAA,KAAW,MAAA,EAAQ;AACjD,MAAA;AAAA,IACF;AAGA,IAAA,IAAI,UAAA,IAAc,WAAW,MAAA,EAAW;AACtC,MAAA,MAAM,GAAA,CAAI,QAAQ,YAAA,CAAa;AAAA,QAC7B,SAAS,GAAA,CAAI,OAAA;AAAA,QACb,QAAA,EAAU,IAAA;AAAA,QACV,gBAAgB,UAAA,CAAW,IAAA;AAAA,QAC3B,GAAA,EAAK;AAAA,OACN,CAAA;AAAA,IACH;AAGA,IAAA,IAAI,UAAA,IAAc,WAAW,MAAA,EAAW;AACtC,MAAA,MAAM,YAAA,GAAe,0BAAA;AAAA,QACnB,IAAA;AAAA,QACA,UAAA,CAAW,KAAA;AAAA,QACX,GAAA,CAAI;AAAA,OACN;AAGA,MAAA,KAAA,MAAW,eAAe,YAAA,EAAc;AACtC,QAAA,MAAM,QAAA,GAAW,MAAM,GAAA,CAAI,OAAA,CAAQ,WAAA,CAAY;AAAA,UAC7C,SAAS,GAAA,CAAI,OAAA;AAAA,UACb,QAAA,EAAU,WAAA;AAAA,UACV,gBAAgB,UAAA,CAAW,IAAA;AAAA,UAC3B,GAAA,EAAK;AAAA,SACN,CAAA;AAED,QAAA,IAAI,QAAA,IAAY,QAAA,CAAS,OAAA,KAAY,EAAA,EAAI;AACvC,UAAA,MAAM,IAAI,eAAA,CAAgB;AAAA,YACxB,gBAAgB,UAAA,CAAW,IAAA;AAAA,YAC3B,IAAA,EAAM,WAAA;AAAA,YACN,YAAY,QAAA,CAAS,OAAA;AAAA,YACrB,KAAA,EAAO,EAAA;AAAA,YACP,QAAQ,UAAA,CAAW;AAAA,WACpB,CAAA;AAAA,QACH;AAAA,MACF;AAGA,MAAA,MAAM,GAAA,CAAI,QAAQ,YAAA,CAAa;AAAA,QAC7B,SAAS,GAAA,CAAI,OAAA;AAAA,QACb,QAAA,EAAU,IAAA;AAAA,QACV,gBAAgB,UAAA,CAAW,IAAA;AAAA,QAC3B,GAAA,EAAK,MAAA;AAAA,QACL,MAAA,EAAQ,EAAA;AAAA,QACR,YAAA,EAAc;AAAA,OACf,CAAA;AAAA,IACH;AAAA,EACF;AACF;;;ACpGA,SAAS,mBAAA,CAAwC,OAAU,IAAA,EAAc;AACvE,EAAA,MAAM,YAAA,GAAe,KAAA,CAAM,KAAA,CAAM,IAAI,CAAA;AACrC,EAAA,IAAI,iBAAiB,MAAA,EAAW,MAAM,IAAI,iBAAA,CAAkB,MAAM,MAAM,CAAA;AACxE,EAAA,OAAO,YAAA;AACT;AAEA,IAAM,mBAAA,GAAsB,IAAA;AAE5B,SAAS,iBAAA,CAAkB,OAAA,EAAiB,IAAA,EAAc,EAAA,EAAoB;AAC5E,EAAA,OAAO,CAAA,EAAG,OAAO,CAAA,EAAG,mBAAmB,GAAG,IAAI,CAAA,EAAG,mBAAmB,CAAA,EAAG,EAAE,CAAA,CAAA;AAC3E;AAEA,SAAS,mBAAA,CACP,OAAA,EACA,QAAA,EACA,cAAA,EACA,GAAA,EACQ;AACR,EAAA,OAAO,CAAA,EAAG,OAAO,CAAA,EAAG,mBAAmB,CAAA,EAAG,QAAQ,CAAA,EAAG,mBAAmB,CAAA,EAAG,cAAc,CAAA,EAAG,mBAAmB,GAAG,GAAG,CAAA,CAAA;AACvH;AAEA,SAAS,4BAAA,CACP,MACA,EAAA,EACiB;AACjB,EAAA,OAAO,IAAI,eAAA;AAAA,IACT,CAAA,qBAAA,EAAwB,IAAI,CAAA,CAAA,EAAI,EAAE,CAAA,CAAA;AAAA,IAClC;AAAA,MACE,UAAA,EAAY,MAAA;AAAA,MACZ,IAAA;AAAA,MACA,SAAA,EAAW,QAAA;AAAA,MACX,EAAA;AAAA,MACA,QAAQ,CAAC,EAAE,MAAM,IAAA,EAAM,OAAA,EAAS,sCAAsC;AAAA,KACxE;AAAA,IACA,EAAE,YAAY,CAAA,+CAAA,CAAA;AAAkD,GAClE;AACF;AAEA,SAAS,sBACP,OAAA,EACA,IAAA,EACA,EAAA,EACA,KAAA,EACA,WACA,OAAA,EACkB;AAClB,EAAA,MAAM,YAAA,GAOF;AAAA,IACF,OAAA;AAAA,IACA,IAAA;AAAA,IACA,EAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,IAAI,SAAA,KAAc,MAAA,EAAW,YAAA,CAAa,SAAA,GAAY,SAAA;AACtD,EAAA,IAAI,OAAA,KAAY,MAAA,EAAW,YAAA,CAAa,OAAA,GAAU,OAAA;AAClD,EAAA,OAAO,YAAA;AACT;AAEA,SAAS,sBAAA,CACP,OAAA,EACA,QAAA,EACA,cAAA,EACA,KACA,MAAA,EACW;AACX,EAAA,OAAO;AAAA,IACL,QAAA,EAAU,OAAA;AAAA,IACV,SAAA,EAAW,QAAA;AAAA,IACX,eAAA,EAAiB,cAAA;AAAA,IACjB,GAAA;AAAA,IACA,OAAA,EAAS,MAAA;AAAA,IACT,aAAA,EAAe,QAAA;AAAA,IACf,UAAA,EAAY;AAAA,GACd;AACF;AAEA,SAAS,iBAAA,CACP,KAAA,EACA,IAAA,EACA,cAAA,EACkB;AAClB,EAAA,MAAM,YAAA,GAAe,mBAAA,CAAoB,KAAA,EAAO,IAAI,CAAA;AACpD,EAAA,MAAM,WAAA,GAAc,YAAA,CAAa,MAAA,IAAU,EAAC;AAC5C,EAAA,MAAM,aAAa,WAAA,CAAY,IAAA;AAAA,IAC7B,CAAC,SAAA,KAAc,SAAA,CAAU,IAAA,KAAS;AAAA,GACpC;AACA,EAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,IAAA,MAAM,IAAI,2BAAA,CAA4B,cAAA,EAAgB,IAAI,CAAA;AAAA,EAC5D;AACA,EAAA,OAAO,UAAA;AACT;AAEA,SAAS,uBAAA,CACP,OAAA,EACA,QAAA,EACA,OAAA,EACmB;AACnB,EAAA,OAAO,EAAE,OAAA,EAAS,QAAA,EAAU,OAAA,EAAQ;AACtC;AAEA,SAAS,0BAAA,CACP,OAAA,EACA,QAAA,EACA,MAAA,EACA,OAAA,EACsB;AACtB,EAAA,OAAO,EAAE,OAAA,EAAS,QAAA,EAAU,MAAA,EAAQ,OAAA,EAAQ;AAC9C;AAEA,SAAS,yBAAA,CACP,OAAA,EACA,QAAA,EACA,MAAA,EACA,OAAA,EACqB;AACrB,EAAA,OAAO,EAAE,OAAA,EAAS,QAAA,EAAU,MAAA,EAAQ,OAAA,EAAQ;AAC9C;AAWA,SAAS,gCAAA,CACP,OAAA,EACA,QAAA,EACA,OAAA,EAUC;AACD,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAA2B;AACjD,EAAA,MAAM,YAAA,uBAAmB,GAAA,EAAwC;AACjE,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAA6B;AACrD,EAAA,MAAM,mBAAA,uBAA0B,GAAA,EAAoB;AAEpD,EAAA,eAAe,aAAA,CACb,aAAA,EACA,IAAA,EACA,EAAA,EACwB;AACxB,IAAA,MAAM,QAAA,GAAW,iBAAA,CAAkB,aAAA,EAAe,IAAA,EAAM,EAAE,CAAA;AAC1D,IAAA,MAAM,WAAA,GAAc,YAAA,CAAa,GAAA,CAAI,QAAQ,CAAA;AAC7C,IAAA,IAAI,WAAA,KAAgB,QAAW,OAAO,WAAA;AACtC,IAAA,IAAI,UAAU,GAAA,CAAI,QAAQ,GAAG,OAAO,SAAA,CAAU,IAAI,QAAQ,CAAA;AAC1D,IAAA,MAAM,WAAW,MAAM,OAAA,CAAQ,OAAA,CAAQ,aAAA,EAAe,MAAM,EAAE,CAAA;AAC9D,IAAA,SAAA,CAAU,GAAA,CAAI,UAAU,QAAQ,CAAA;AAChC,IAAA,OAAO,QAAA;AAAA,EACT;AAEA,EAAA,eAAe,kBACb,MAAA,EAC0B;AAC1B,IAAA,MAAM,QAAA,GAAW,mBAAA;AAAA,MACf,MAAA,CAAO,OAAA;AAAA,MACP,MAAA,CAAO,QAAA;AAAA,MACP,MAAA,CAAO,cAAA;AAAA,MACP,MAAA,CAAO;AAAA,KACT;AACA,IAAA,MAAM,YAAA,GAAe,mBAAA,CAAoB,GAAA,CAAI,QAAQ,CAAA;AACrD,IAAA,IAAI,iBAAiB,MAAA,EAAW;AAC9B,MAAA,OAAO,sBAAA;AAAA,QACL,MAAA,CAAO,OAAA;AAAA,QACP,MAAA,CAAO,QAAA;AAAA,QACP,MAAA,CAAO,cAAA;AAAA,QACP,MAAA,CAAO,GAAA;AAAA,QACP;AAAA,OACF;AAAA,IACF;AACA,IAAA,IAAI,YAAY,GAAA,CAAI,QAAQ,GAAG,OAAO,WAAA,CAAY,IAAI,QAAQ,CAAA;AAC9D,IAAA,MAAM,QAAA,GAAW,MAAM,OAAA,CAAQ,WAAA,CAAY,MAAM,CAAA;AACjD,IAAA,WAAA,CAAY,GAAA,CAAI,UAAU,QAAQ,CAAA;AAClC,IAAA,OAAO,QAAA;AAAA,EACT;AAEA,EAAA,SAAS,oBAAoB,MAAA,EAAgC;AAC3D,IAAA,MAAM,WAAW,iBAAA,CAAkB,MAAA,CAAO,SAAS,MAAA,CAAO,IAAA,EAAM,OAAO,EAAE,CAAA;AACzE,IAAA,YAAA,CAAa,IAAI,QAAA,EAAU;AAAA,MACzB,UAAU,MAAA,CAAO,OAAA;AAAA,MACjB,MAAM,MAAA,CAAO,IAAA;AAAA,MACb,IAAI,MAAA,CAAO,EAAA;AAAA,MACX,KAAA,EAAO,IAAA,CAAK,SAAA,CAAU,MAAA,CAAO,KAAK,CAAA;AAAA,MAClC,OAAA,EAAS,CAAA;AAAA,MACT,YAAY,MAAA,CAAO,SAAA;AAAA,MACnB,UAAU,MAAA,CAAO,OAAA;AAAA,MACjB,UAAA,EAAY,EAAA;AAAA,MACZ,UAAA,EAAY,EAAA;AAAA,MACZ,UAAA,EAAY;AAAA,KACb,CAAA;AAAA,EACH;AAEA,EAAA,SAAS,4BAAA,CACP,IAAA,EACA,EAAA,EACA,KAAA,EACA,WAAA,EACM;AACN,IAAA,KAAA,MAAW,cAAc,WAAA,EAAa;AACpC,MAAA,IAAI,CAAC,mBAAA,CAAoB,UAAA,EAAY,KAAK,CAAA,EAAG;AAE7C,MAAA,MAAM,GAAA,GAAM,gBAAA;AAAA,QACV,KAAA;AAAA,QACA,UAAA,CAAW,MAAA;AAAA,QACX,UAAA,CAAW;AAAA,OACb;AACA,MAAA,MAAM,gBAAA,GAAmB,mBAAA;AAAA,QACvB,OAAA;AAAA,QACA,IAAA;AAAA,QACA,UAAA,CAAW,IAAA;AAAA,QACX;AAAA,OACF;AACA,MAAA,mBAAA,CAAoB,GAAA,CAAI,kBAAkB,EAAE,CAAA;AAE5C,MAAA,IAAI,UAAA,CAAW,UAAU,MAAA,EAAQ;AAC/B,QAAA,MAAM,YAAA,GAAe,0BAAA;AAAA,UACnB,IAAA;AAAA,UACA,UAAA,CAAW,KAAA;AAAA,UACX;AAAA,SACF;AACA,QAAA,KAAA,MAAW,eAAe,YAAA,EAAc;AACtC,UAAA,MAAM,iBAAA,GAAoB,mBAAA;AAAA,YACxB,OAAA;AAAA,YACA,WAAA;AAAA,YACA,UAAA,CAAW,IAAA;AAAA,YACX;AAAA,WACF;AACA,UAAA,mBAAA,CAAoB,GAAA,CAAI,mBAAmB,EAAE,CAAA;AAAA,QAC/C;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAIA,EAAA,MAAM,iBAAA,GAAoB;AAAA,IACxB,GAAG,OAAA;AAAA,IACH,OAAA,EAAS,aAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAEA,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,iBAAA;AAAA,IACT,mBAAA;AAAA,IACA;AAAA,GACF;AACF;AAMA,eAAe,4BAAA,CACb,GAAA,EACA,KAAA,EACA,EAAA,EACA,OAAA,EAC6B;AAC7B,EAAA,MAAM,OAAO,KAAA,CAAM,IAAA;AACnB,EAAA,MAAM,YAAA,GAAe,mBAAA,CAAoB,GAAA,CAAI,KAAA,EAAO,IAAI,CAAA;AACxD,EAAA,MAAM,WAAW,YAAA,CAAa,IAAA;AAE9B,EAAA,MAAM,cAAA,GAAiB,iBAAA,CAAkB,QAAA,CAAS,MAAA,EAAQ,MAAM,KAAA,EAAO;AAAA,IACrE,IAAA;AAAA,IACA,SAAA,EAAW;AAAA,GACZ,CAAA;AAED,EAAA,MAAM,SAAA,GAAY,gCAAA;AAAA,IAChB,KAAA,CAAM,SAAA;AAAA,IACN;AAAA,GACF;AACA,EAAA,MAAM,OAAA,GAAU,gCAAA,CAAiC,KAAA,CAAM,OAAA,EAAS,SAAS,CAAA;AAEzE,EAAA,MAAM,eAAe,MAAM,OAAA,CAAQ,QAAQ,GAAA,CAAI,OAAA,EAAS,MAAM,EAAE,CAAA;AAChE,EAAA,IAAI,YAAA,IAAgB,CAAC,YAAA,CAAa,UAAA,EAAY;AAC5C,IAAA,MAAM,4BAAA,CAA6B,MAAM,EAAE,CAAA;AAAA,EAC7C;AAEA,EAAA,MAAM,iBAAA,GAAuC;AAAA,IAC3C,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,UAAU,GAAA,CAAI,QAAA;AAAA,IACd;AAAA,GACF;AACA,EAAA,MAAM,2BAAA,CAA4B,iBAAA,EAAmB,IAAA,EAAM,EAAE,CAAA;AAE7D,EAAA,MAAM,iBAAA,GAAoB,YAAA,CAAa,MAAA,IAAU,EAAC;AAClD,EAAA,MAAM,0BAAA;AAAA,IACJ,uBAAA,CAAwB,GAAA,CAAI,OAAA,EAAS,GAAA,CAAI,UAAU,OAAO,CAAA;AAAA,IAC1D,IAAA;AAAA,IACA,EAAA;AAAA,IACA,cAAA;AAAA,IACA;AAAA,GACF;AAEA,EAAA,OAAO;AAAA,IACL,IAAA;AAAA,IACA,EAAA;AAAA,IACA,QAAA;AAAA,IACA,cAAA;AAAA,IACA,iBAAA;AAAA,IACA,YAAA,EAAc,qBAAA;AAAA,MACZ,GAAA,CAAI,OAAA;AAAA,MACJ,IAAA;AAAA,MACA,EAAA;AAAA,MACA,cAAA;AAAA,MACA,SAAA;AAAA,MACA;AAAA;AACF,GACF;AACF;AAEA,eAAe,kBAAA,CACb,GAAA,EACA,QAAA,EACA,OAAA,EACe;AACf,EAAA,MAAM,uBAAA;AAAA,IACJ,uBAAA,CAAwB,GAAA,CAAI,OAAA,EAAS,GAAA,CAAI,UAAU,OAAO,CAAA;AAAA,IAC1D,QAAA,CAAS,IAAA;AAAA,IACT,QAAA,CAAS,EAAA;AAAA,IACT,QAAA,CAAS,cAAA;AAAA,IACT,QAAA,CAAS;AAAA,GACX;AAEA,EAAA,MAAM,cAAA;AAAA,IACJ,0BAAA;AAAA,MACE,GAAA,CAAI,OAAA;AAAA,MACJ,QAAA,CAAS,IAAA;AAAA,MACT,QAAA,CAAS,EAAA;AAAA,MACT;AAAA,KACF;AAAA,IACA,SAAS,QAAA,CAAS,MAAA;AAAA,IAClB,QAAA,CAAS;AAAA,GACX;AAEA,EAAA,MAAM,YAAA;AAAA,IACJ,0BAA0B,GAAA,CAAI,OAAA,EAAS,SAAS,IAAA,EAAM,QAAA,CAAS,IAAI,OAAO,CAAA;AAAA,IAC1E,SAAS,QAAA,CAAS,MAAA;AAAA,IAClB,QAAA,CAAS;AAAA,GACX;AACF;AAUA,eAAe,iBAAA,CACb,GAAA,EACA,KAAA,EACA,OAAA,EACA,OAAA,EACe;AACf,EAAA,MAAM,EAAE,IAAA,EAAM,EAAA,EAAG,GAAI,KAAA;AACrB,EAAA,MAAM,YAAA,GAAe,mBAAA,CAAoB,GAAA,CAAI,KAAA,EAAO,IAAI,CAAA;AAExD,EAAA,MAAM,WAAW,MAAM,OAAA,CAAQ,QAAQ,GAAA,CAAI,OAAA,EAAS,MAAM,EAAE,CAAA;AAC5D,EAAA,IAAI,CAAC,QAAA,IAAa,QAAA,CAAS,UAAA,IAAc,CAAC,SAAS,YAAA,EAAe;AAChE,IAAA,MAAM,IAAI,iBAAA,CAAkB,IAAA,EAAM,EAAE,CAAA;AAAA,EACtC;AAEA,EAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,KAAA,CAAM,QAAA,CAAS,KAAK,CAAA;AAC/C,EAAA,MAAM,cAAc,EAAE,GAAG,aAAA,EAAe,GAAG,MAAM,KAAA,EAAM;AAEvD,EAAA,MAAM,WAAW,YAAA,CAAa,IAAA;AAC9B,EAAA,MAAM,cAAA,GAAiB,iBAAA,CAAkB,QAAA,CAAS,MAAA,EAAQ,WAAA,EAAa;AAAA,IACrE,IAAA;AAAA,IACA,SAAA,EAAW,QAAA;AAAA,IACX;AAAA,GACD,CAAA;AAED,EAAA,MAAM,OAAA,GAAU,gCAAA,CAAiC,KAAA,CAAM,OAAA,EAAS,SAAS,CAAA;AAEzE,EAAA,MAAM,uBAAA;AAAA,IACJ,uBAAA,CAAwB,GAAA,CAAI,OAAA,EAAS,GAAA,CAAI,UAAU,OAAO,CAAA;AAAA,IAC1D,IAAA;AAAA,IACA,EAAA;AAAA,IACA,aAAA;AAAA,IACA,cAAA;AAAA,IACA,YAAA,CAAa,UAAU;AAAC,GAC1B;AAEA,EAAA,MAAM,YAAA,GAQF;AAAA,IACF,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,IAAA;AAAA,IACA,EAAA;AAAA,IACA,KAAA,EAAO,cAAA;AAAA,IACP,gBAAA,EAAkB;AAAA,GACpB;AACA,EAAA,IAAI,OAAA,KAAY,MAAA,EAAW,YAAA,CAAa,OAAA,GAAU,OAAA;AAClD,EAAA,IAAI,OAAA,EAAS,YAAA,EAAc,YAAA,CAAa,YAAA,GAAe,IAAA;AAEvD,EAAA,MAAM,GAAA,GAAM,MAAM,OAAA,CAAQ,UAAA,CAAW,YAAY,CAAA;AAEjD,EAAA,MAAM,cAAA;AAAA,IACJ,0BAAA,CAA2B,GAAA,CAAI,OAAA,EAAS,IAAA,EAAM,IAAI,OAAO,CAAA;AAAA,IACzD,QAAA,CAAS,MAAA;AAAA,IACT;AAAA,GACF;AAEA,EAAA,MAAM,YAAA;AAAA,IACJ,yBAAA,CAA0B,GAAA,CAAI,OAAA,EAAS,IAAA,EAAM,IAAI,OAAO,CAAA;AAAA,IACxD,QAAA,CAAS,MAAA;AAAA,IACT;AAAA,GACF;AAEA,EAAA,OAAO,UAAU,GAAG,CAAA;AACtB;AAWA,eAAe,sBACb,GAAA,EACA,IAAA,EACA,EAAA,EACA,IAAA,EACA,SACA,YAAA,EACe;AACf,EAAA,MAAM,cAAA,GAAiB,aAAa,QAAA,IAAY,UAAA;AAChD,EAAA,MAAM,cAAA,GAAiB,MAAM,OAAA,CAAQ,oBAAA,CAAqB;AAAA,IACxD,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,QAAA,EAAU,IAAA;AAAA,IACV,MAAA,EAAQ;AAAA,GACT,CAAA;AAED,EAAA,IAAI,cAAA,CAAe,WAAW,CAAA,EAAG;AAEjC,EAAA,QAAQ,cAAA;AAAgB,IACtB,KAAK,UAAA,EAAY;AACf,MAAA,MAAM,SAAA,GAAY,CAAC,GAAG,IAAI,GAAA,CAAI,cAAA,CAAe,GAAA,CAAI,CAAC,IAAA,KAAS,IAAA,CAAK,IAAI,CAAC,CAAC,CAAA;AACtE,MAAA,MAAM,IAAI,qBAAA,CAAsB;AAAA,QAC9B,QAAA,EAAU,IAAA;AAAA,QACV,MAAA,EAAQ,EAAA;AAAA,QACR,WAAW,cAAA,CAAe,MAAA;AAAA,QAC1B;AAAA,OACD,CAAA;AAAA,IACH;AAAA,IAEA,KAAK,SAAA;AAAA,IACL,KAAK,YAAA,EAAc;AAKjB,MAAA,KAAA,MAAW,QAAQ,cAAA,EAAgB;AACjC,QAAA,OAAO,IAAA,KAAS,MAAA,GACd,OAAA,CAAQ,cAAA,CAAe;AAAA,UACrB,SAAS,GAAA,CAAI,OAAA;AAAA,UACb,IAAI,IAAA,CAAK;AAAA,SACV,CAAA,GACD,OAAA,CAAQ,UAAA,CAAW;AAAA,UACjB,SAAS,GAAA,CAAI,OAAA;AAAA,UACb,IAAI,IAAA,CAAK;AAAA,SACV,CAAA,CAAA;AAAA,MACL;AACA,MAAA;AAAA,IACF;AAAA;AAEJ;AASA,eAAe,mBAAA,CACb,GAAA,EACA,MAAA,EACA,OAAA,EAIC;AACD,EAAA,MAAM;AAAA,IACJ,OAAA,EAAS,iBAAA;AAAA,IACT,mBAAA;AAAA,IACA;AAAA,MACE,gCAAA,CAAiC,GAAA,CAAI,OAAA,EAAS,GAAA,CAAI,UAAU,OAAO,CAAA;AAEvE,EAAA,MAAM,kBAAwC,EAAC;AAE/C,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,IAAA,MAAM,EAAA,GAAK,KAAA,CAAM,EAAA,IAAM,UAAA,EAAW;AAClC,IAAA,MAAM,WAAW,MAAM,4BAAA;AAAA,MACrB,GAAA;AAAA,MACA,KAAA;AAAA,MACA,EAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,eAAA,CAAgB,KAAK,QAAQ,CAAA;AAC7B,IAAA,mBAAA,CAAoB,SAAS,YAAY,CAAA;AACzC,IAAA,4BAAA;AAAA,MACE,QAAA,CAAS,IAAA;AAAA,MACT,QAAA,CAAS,EAAA;AAAA,MACT,QAAA,CAAS,cAAA;AAAA,MACT,QAAA,CAAS;AAAA,KACX;AAAA,EACF;AAEA,EAAA,MAAM,oBAAoB,eAAA,CAAgB,GAAA;AAAA,IACxC,CAAC,aAAa,QAAA,CAAS;AAAA,GACzB;AAEA,EAAA,OAAO,EAAE,iBAAiB,iBAAA,EAAkB;AAC9C;AASA,eAAe,yBACb,OAAA,EACA,OAAA,EACA,cAAA,EACA,GAAA,EACA,cACA,cAAA,EAIA;AACA,EAAA,KAAA,MAAW,eAAe,YAAA,EAAc;AACtC,IAAA,MAAM,GAAA,GAAM,MAAM,OAAA,CAAQ,WAAA,CAAY;AAAA,MACpC,OAAA;AAAA,MACA,QAAA,EAAU,WAAA;AAAA,MACV,cAAA;AAAA,MACA,GAAA;AAAA,MACA;AAAA,KACD,CAAA;AACD,IAAA,IAAI,GAAA,KAAQ,QAAW,OAAO,GAAA;AAAA,EAChC;AACA,EAAA,OAAO,MAAA;AACT;AAQA,eAAe,4BACb,OAAA,EACA,OAAA,EACA,cAAA,EACA,UAAA,EACA,cACA,cAAA,EACsC;AACtC,EAAA,MAAM,aAAA,uBAAoB,GAAA,EAA4B;AAEtD,EAAA,KAAA,MAAW,eAAe,YAAA,EAAc;AACtC,IAAA,IAAI,OAAA,CAAQ,qBAAqB,MAAA,EAAW;AAC1C,MAAA,KAAA,MAAW,OAAO,UAAA,EAAY;AAC5B,QAAA,IAAI,aAAA,CAAc,GAAA,CAAI,GAAG,CAAA,EAAG;AAC5B,QAAA,MAAM,GAAA,GAAM,MAAM,OAAA,CAAQ,WAAA,CAAY;AAAA,UACpC,OAAA;AAAA,UACA,QAAA,EAAU,WAAA;AAAA,UACV,cAAA;AAAA,UACA,GAAA;AAAA,UACA;AAAA,SACD,CAAA;AACD,QAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,UAAA,aAAA,CAAc,GAAA,CAAI,GAAA,CAAI,GAAA,EAAK,GAAG,CAAA;AAAA,QAChC;AAAA,MACF;AAAA,IACF,CAAA,MAAO;AACL,MAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,gBAAA,CAAiB;AAAA,QAC1C,OAAA;AAAA,QACA,QAAA,EAAU,WAAA;AAAA,QACV,cAAA;AAAA,QACA,IAAA,EAAM,UAAA;AAAA,QACN;AAAA,OACD,CAAA;AACD,MAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,QAAA,IAAI,CAAC,aAAA,CAAc,GAAA,CAAI,GAAA,CAAI,GAAG,CAAA,EAAG;AAC/B,UAAA,aAAA,CAAc,GAAA,CAAI,GAAA,CAAI,GAAA,EAAK,GAAG,CAAA;AAAA,QAChC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,aAAA;AACT;AAMA,eAAe,yBAAA,CACb,GAAA,EACA,KAAA,EACA,OAAA,EACA,OAAA,EAC2B;AAC3B,EAAA,MAAM,OAAO,KAAA,CAAM,IAAA;AACnB,EAAA,MAAM,EAAA,GAAK,KAAA,CAAM,EAAA,IAAM,UAAA,EAAW;AAClC,EAAA,MAAM,YAAY,GAAA,CAAI,sBAAA,CAAuB,QAAA,EAAU,MAAA,EAAQ,MAAM,EAAE,CAAA;AAGvE,EAAA,OAAO,GAAA,CAAI,kBAAA,CAAmB,SAAA,EAAW,YAAY;AACnD,IAAA,MAAM,WAAW,MAAM,4BAAA;AAAA,MACrB,GAAA;AAAA,MACA,KAAA;AAAA,MACA,EAAA;AAAA,MACA;AAAA,KACF;AAEA,IAAA,IAAI,GAAA;AACJ,IAAqB;AACnB,MAAA,GAAA,GAAM,MAAM,OAAA,CAAQ,UAAA,CAAW,QAAA,CAAS,YAAY,CAAA;AAAA,IACtD;AAKA,IAAA,MAAM,kBAAA,CAAmB,GAAA,EAAK,QAAA,EAAU,OAAO,CAAA;AAE/C,IAAA,IAAI,QAAQ,MAAA,EAAW;AACvB,IAAA,OAAO,UAAU,GAAG,CAAA;AAAA,EACtB,CAAC,CAAA;AACH;AAEA,eAAsB,iBAAA,CACpB,GAAA,EACA,KAAA,EACA,OAAA,EACe;AACf,EAAA,MAAM,MAAA,GAAS,MAAM,yBAAA,CAA0B,GAAA,EAAK,OAAO,OAE1D,CAAA;AACD,EAAA,IAAI,CAAC,MAAA,EAAQ;AACX,IAAA,MAAM,IAAI,sBAAA;AAAA,MACR,+CAAA;AAAA,MACA,EAAE,SAAA,EAAW,QAAA,EAAU,MAAA,EAAQ,MAAA;AAAO,KACxC;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT;AAgBA,eAAsB,8BAAA,CACpB,GAAA,EACA,MAAA,EACA,OAAA,EACe;AACf,EAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AAEzB,EAAA,MAAM,EAAE,eAAA,EAAiB,iBAAA,EAAkB,GAAI,MAAM,mBAAA;AAAA,IACnD,GAAA;AAAA,IACA,MAAA;AAAA,IACA;AAAA,GACF;AAEA,EAAA,IAAI,OAAA,CAAQ,qBAAqB,MAAA,EAAW;AAC1C,IAAA,KAAA,MAAW,gBAAgB,iBAAA,EAAmB;AAC5C,MAAA,OAAO,QAAQ,kBAAA,GAAqB,YAAY,CAAA,IAC9C,OAAA,CAAQ,WAAW,YAAY,CAAA,CAAA;AAAA,IACnC;AAAA,EACF,CAAA,MAAO;AACL,IAAA,MAAM,OAAA,CAAQ,iBAAiB,iBAAiB,CAAA;AAAA,EAClD;AAEA,EAAA,KAAA,MAAW,YAAY,eAAA,EAAiB;AACtC,IAAA,MAAM,kBAAA,CAAmB,GAAA,EAAK,QAAA,EAAU,OAAO,CAAA;AAAA,EACjD;AACF;AAWA,eAAsB,sBAAA,CACpB,GAAA,EACA,MAAA,EACA,OAAA,EAC0B;AAC1B,EAAA,IAAI,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAEjC,EAAA,MAAM,EAAE,eAAA,EAAiB,iBAAA,EAAkB,GAAI,MAAM,mBAAA;AAAA,IACnD,GAAA;AAAA,IACA,MAAA;AAAA,IACA;AAAA,GACF;AAEA,EAAA,IAAI,IAAA;AACJ,EAAA,IAAI,OAAA,CAAQ,8BAA8B,MAAA,EAAW;AACnD,IAAA,MAAM,iBAAmC,EAAC;AAC1C,IAAA,KAAA,MAAW,gBAAgB,iBAAA,EAAmB;AAC5C,MAAA,cAAA,CAAe,IAAA,CAAK,MAAM,OAAA,CAAQ,UAAA,CAAW,YAAY,CAAC,CAAA;AAAA,IAC5D;AACA,IAAA,IAAA,GAAO,cAAA;AAAA,EACT,CAAA,MAAO;AACL,IAAA,IAAA,GAAO,MAAM,OAAA,CAAQ,yBAAA,CAA0B,iBAAiB,CAAA;AAAA,EAClE;AAEA,EAAA,KAAA,MAAW,YAAY,eAAA,EAAiB;AACtC,IAAA,MAAM,kBAAA,CAAmB,GAAA,EAAK,QAAA,EAAU,OAAO,CAAA;AAAA,EACjD;AAEA,EAAA,OAAO,KAAK,GAAA,CAAI,CAAC,GAAA,KAAQ,SAAA,CAAU,GAAG,CAAC,CAAA;AACzC;AAMA,eAAsB,iBAAA,CACpB,GAAA,EACA,KAAA,EACA,OAAA,EACA,OAAA,EACe;AACf,EAAA,MAAM,YAAY,GAAA,CAAI,sBAAA;AAAA,IACpB,QAAA;AAAA,IACA,MAAA;AAAA,IACA,KAAA,CAAM,IAAA;AAAA,IACN,KAAA,CAAM;AAAA,GACR;AACA,EAAA,OAAO,GAAA,CAAI,kBAAA;AAAA,IAAmB,SAAA;AAAA,IAAW,MACvC,iBAAA,CAAkB,GAAA,EAAK,KAAA,EAAO,SAAS,OAAO;AAAA,GAChD;AACF;AAMA,eAAsB,uBAAA,CACpB,GAAA,EACA,KAAA,EACA,OAAA,EACA,OAAA,EACe;AACf,EAAA,OAAO,iBAAA,CAAkB,GAAA,EAAK,KAAA,EAAO,OAAA,EAAS,OAAO,CAAA;AACvD;AAMA,eAAsB,iBAAA,CACpB,GAAA,EACA,IAAA,EACA,EAAA,EACA,OAAA,EACe;AACf,EAAA,MAAM,YAAY,GAAA,CAAI,sBAAA,CAAuB,QAAA,EAAU,MAAA,EAAQ,MAAM,EAAE,CAAA;AAEvE,EAAA,OAAO,GAAA,CAAI,kBAAA,CAAmB,SAAA,EAAW,YAAY;AACnD,IAAA,MAAM,YAAA,GAAe,mBAAA,CAAoB,GAAA,CAAI,KAAA,EAAO,IAAI,CAAA;AAExD,IAAA,MAAM,WAAW,MAAM,OAAA,CAAQ,QAAQ,GAAA,CAAI,OAAA,EAAS,MAAM,EAAE,CAAA;AAC5D,IAAA,IAAI,CAAC,QAAA,IAAY,QAAA,CAAS,UAAA,EAAY;AAEtC,IAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,KAAA,CAAM,QAAA,CAAS,KAAK,CAAA;AAE/C,IAAA,MAAM,sBAAsB,GAAA,EAAK,IAAA,EAAM,EAAA,EAAI,MAAA,EAAQ,SAAS,YAAY,CAAA;AAExE,IAAA,MAAM,OAAA,CAAQ,WAAW,EAAE,OAAA,EAAS,IAAI,OAAA,EAAS,IAAA,EAAM,IAAI,CAAA;AAE3D,IAAA,MAAM,uBAAA;AAAA,MACJ,uBAAA,CAAwB,GAAA,CAAI,OAAA,EAAS,GAAA,CAAI,UAAU,OAAO,CAAA;AAAA,MAC1D,IAAA;AAAA,MACA,aAAA;AAAA,MACA,YAAA,CAAa,UAAU;AAAC,KAC1B;AAEA,IAAA,MAAM,WAAW,YAAA,CAAa,IAAA;AAC9B,IAAA,MAAM,oBAAA;AAAA,MACJ,0BAAA,CAA2B,GAAA,CAAI,OAAA,EAAS,IAAA,EAAM,IAAI,OAAO,CAAA;AAAA,MACzD,QAAA,CAAS;AAAA,KACX;AACA,IAAA,MAAM,kBAAA;AAAA,MACJ,yBAAA,CAA0B,GAAA,CAAI,OAAA,EAAS,IAAA,EAAM,IAAI,OAAO,CAAA;AAAA,MACxD,QAAA,CAAS;AAAA,KACX;AAAA,EACF,CAAC,CAAA;AACH;AAQA,eAAsB,qBAAA,CACpB,GAAA,EACA,IAAA,EACA,EAAA,EACA,OAAA,EACe;AACf,EAAA,MAAM,YAAY,GAAA,CAAI,sBAAA,CAAuB,QAAA,EAAU,MAAA,EAAQ,MAAM,EAAE,CAAA;AAEvE,EAAA,OAAO,GAAA,CAAI,kBAAA,CAAmB,SAAA,EAAW,YAAY;AACnD,IAAA,MAAM,YAAA,GAAe,mBAAA,CAAoB,GAAA,CAAI,KAAA,EAAO,IAAI,CAAA;AAExD,IAAA,MAAM,WAAW,MAAM,OAAA,CAAQ,QAAQ,GAAA,CAAI,OAAA,EAAS,MAAM,EAAE,CAAA;AAC5D,IAAA,IAAI,CAAC,QAAA,EAAU;AAEf,IAAA,MAAM,sBAAsB,GAAA,EAAK,IAAA,EAAM,EAAA,EAAI,MAAA,EAAQ,SAAS,YAAY,CAAA;AAOxE,IAAA,MAAM,UAAA,GAAa,OACjB,MAAA,KACkB;AAClB,MAAA,MAAM,MAAA,CAAO,eAAe,EAAE,OAAA,EAAS,IAAI,OAAA,EAAS,IAAA,EAAM,IAAI,CAAA;AAC9D,MAAA,MAAM,oBAAA;AAAA,QACJ,0BAAA,CAA2B,GAAA,CAAI,OAAA,EAAS,IAAA,EAAM,IAAI,MAAM,CAAA;AAAA,QACxD,aAAa,IAAA,CAAK;AAAA,OACpB;AAAA,IACF,CAAA;AAEA,IAAA,OAAO,aAAA,IAAiB,OAAA,IAAW,OAAA,CAAQ,YAAA,CAAa,eACtD,OAAA,CAAQ,WAAA,CAAY,OAAO,EAAA,KAAO,UAAA,CAAW,EAAE,CAAC,CAAA,GAChD,WAAW,OAAO,CAAA,CAAA;AAAA,EACtB,CAAC,CAAA;AACH;AAMA,eAAsB,mCACpB,GAAA,EACA,IAAA,EACA,cAAA,EACA,KAAA,EACA,SACA,OAAA,EAC8D;AAC9D,EAAA,MAAM,QAAA,GAAW,SAAS,QAAA,IAAY,QAAA;AAEtC,EAAA,MAAM,YAAA,GAAe,mBAAA,CAAoB,GAAA,CAAI,KAAA,EAAO,IAAI,CAAA;AACxD,EAAA,MAAM,WAAW,YAAA,CAAa,IAAA;AAC9B,EAAA,MAAM,cAAA,GAAiB,iBAAA,CAAkB,QAAA,CAAS,MAAA,EAAQ,KAAA,EAAO;AAAA,IAC/D,IAAA;AAAA,IACA,SAAA,EAAW;AAAA,GACZ,CAAA;AAED,EAAA,MAAM,UAAA,GAAa,iBAAA,CAAkB,GAAA,CAAI,KAAA,EAAO,MAAM,cAAc,CAAA;AAEpE,EAAA,IAAI,CAAC,mBAAA,CAAoB,UAAA,EAAY,cAAc,CAAA,EAAG;AACpD,IAAA,MAAM,OAAO,MAAM,iBAAA;AAAA,MACjB,GAAA;AAAA,MACA,EAAE,IAAA,EAAM,KAAA,EAAO,cAAA,EAAe;AAAA,MAC9B;AAAA,KACF;AACA,IAAA,OAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAA,EAAU;AAAA,EACnC;AAEA,EAAA,MAAM,GAAA,GAAM,gBAAA;AAAA,IACV,cAAA;AAAA,IACA,UAAA,CAAW,MAAA;AAAA,IACX,UAAA,CAAW;AAAA,GACb;AAEA,EAAA,MAAM,YAAA,GAAe,0BAAA;AAAA,IACnB,IAAA;AAAA,IACA,UAAA,CAAW,KAAA;AAAA,IACX,GAAA,CAAI;AAAA,GACN;AAEA,EAAA,MAAM,oBAAoB,MAAM,wBAAA;AAAA,IAC9B,OAAA;AAAA,IACA,GAAA,CAAI,OAAA;AAAA,IACJ,UAAA,CAAW,IAAA;AAAA,IACX,GAAA;AAAA,IACA,YAAA;AAAA,IACA;AAAA,GACF;AAEA,EAAA,IAAI,sBAAsB,MAAA,EAAW;AACnC,IAAA,MAAM,OAAO,MAAM,iBAAA;AAAA,MACjB,GAAA;AAAA,MACA,EAAE,IAAA,EAAM,KAAA,EAAO,cAAA,EAAe;AAAA,MAC9B;AAAA,KACF;AACA,IAAA,OAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAA,EAAU;AAAA,EACnC;AAIA,EAAA,MAAM,WAAA,GAAc,MAAM,OAAA,CAAQ,OAAA;AAAA,IAChC,GAAA,CAAI,OAAA;AAAA,IACJ,iBAAA,CAAkB,aAAA;AAAA,IAClB,iBAAA,CAAkB;AAAA,GACpB;AAEA,EAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,IAAA,MAAM,OAAO,MAAM,iBAAA;AAAA,MACjB,GAAA;AAAA,MACA,EAAE,IAAA,EAAM,KAAA,EAAO,cAAA,EAAe;AAAA,MAC9B;AAAA,KACF;AACA,IAAA,OAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAA,EAAU;AAAA,EACnC;AAEA,EAAA,MAAM,aAAA,GAAgB,YAAY,UAAA,KAAe,MAAA;AAEjD,EAAA,IAAI,aAAA,IAAiB,aAAa,QAAA,EAAU;AAC1C,IAAA,MAAM,eAAe,iBAAA,CAAkB,aAAA;AACvC,IAAA,MAAM,OAAO,MAAM,uBAAA;AAAA,MACjB,GAAA;AAAA,MACA;AAAA,QACE,IAAA,EAAM,YAAA;AAAA,QACN,IAAI,WAAA,CAAY,EAAA;AAAA,QAChB,KAAA,EAAO;AAAA,OACT;AAAA,MACA,OAAA;AAAA,MACA,EAAE,cAAc,aAAA;AAAc,KAChC;AACA,IAAA,OAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,aAAA,GAAgB,gBAAgB,SAAA,EAAU;AAAA,EACnE;AAEA,EAAA,OAAO,EAAE,IAAA,EAAM,SAAA,CAAU,WAAW,CAAA,EAAG,QAAQ,OAAA,EAAQ;AACzD;AAMA,eAAsB,2BAAA,CACpB,GAAA,EACA,IAAA,EACA,cAAA,EACA,OACA,OAAA,EAC2B;AAC3B,EAAA,MAAM,YAAA,GAAe,mBAAA,CAAoB,GAAA,CAAI,KAAA,EAAO,IAAI,CAAA;AACxD,EAAA,MAAM,WAAW,YAAA,CAAa,IAAA;AAC9B,EAAA,MAAM,cAAA,GAAiB,iBAAA,CAAkB,QAAA,CAAS,MAAA,EAAQ,KAAA,EAAO;AAAA,IAC/D,IAAA;AAAA,IACA,SAAA,EAAW;AAAA,GACZ,CAAA;AAED,EAAA,MAAM,UAAA,GAAa,iBAAA,CAAkB,GAAA,CAAI,KAAA,EAAO,MAAM,cAAc,CAAA;AACpE,EAAA,IAAI,CAAC,mBAAA,CAAoB,UAAA,EAAY,cAAc,GAAG,OAAO,MAAA;AAE7D,EAAA,MAAM,GAAA,GAAM,gBAAA;AAAA,IACV,cAAA;AAAA,IACA,UAAA,CAAW,MAAA;AAAA,IACX,UAAA,CAAW;AAAA,GACb;AAEA,EAAA,MAAM,YAAA,GAAe,0BAAA;AAAA,IACnB,IAAA;AAAA,IACA,UAAA,CAAW,KAAA;AAAA,IACX,GAAA,CAAI;AAAA,GACN;AAEA,EAAA,MAAM,oBAAoB,MAAM,wBAAA;AAAA,IAC9B,OAAA;AAAA,IACA,GAAA,CAAI,OAAA;AAAA,IACJ,UAAA,CAAW,IAAA;AAAA,IACX,GAAA;AAAA,IACA,YAAA;AAAA,IACA;AAAA,GACF;AAEA,EAAA,IAAI,iBAAA,KAAsB,QAAW,OAAO,MAAA;AAE5C,EAAA,MAAM,WAAA,GAAc,MAAM,OAAA,CAAQ,OAAA;AAAA,IAChC,GAAA,CAAI,OAAA;AAAA,IACJ,iBAAA,CAAkB,aAAA;AAAA,IAClB,iBAAA,CAAkB;AAAA,GACpB;AAEA,EAAA,IAAI,WAAA,KAAgB,MAAA,IAAa,WAAA,CAAY,UAAA,KAAe,MAAA;AAC1D,IAAA,OAAO,MAAA;AAET,EAAA,OAAO,UAAU,WAAW,CAAA;AAC9B;AAUA,SAAS,sBAAA,CACP,QAAA,EACA,IAAA,EACA,UAAA,EACA,KAAA,EACwE;AACxE,EAAA,MAAM,YAGA,EAAC;AAEP,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,cAAA,GAAiB,iBAAA,CAAkB,QAAA,CAAS,MAAA,EAAQ,KAAK,KAAA,EAAO;AAAA,MACpE,IAAA;AAAA,MACA,SAAA,EAAW;AAAA,KACZ,CAAA;AACD,IAAA,MAAM,OAAA,GAAU,mBAAA,CAAoB,UAAA,EAAY,cAAc,CAAA;AAC9D,IAAA,MAAM,MACJ,OAAA,GACE,gBAAA;AAAA,MACE,cAAA;AAAA,MACA,UAAA,CAAW,MAAA;AAAA,MACX,UAAA,CAAW;AAAA,KACb,GACA,MAAA;AACJ,IAAA,SAAA,CAAU,IAAA,CAAK,EAAE,cAAA,EAAgB,GAAA,EAAK,CAAA;AAAA,EACxC;AAEA,EAAA,OAAO,SAAA;AACT;AAEA,SAAS,kBACP,SAAA,EACU;AACV,EAAA,OAAO;AAAA,IACL,GAAG,IAAI,GAAA;AAAA,MACL,SAAA,CACG,GAAA,CAAI,CAACA,MAAAA,KAAUA,MAAAA,CAAM,GAAG,CAAA,CACxB,MAAA,CAAO,CAAC,GAAA,KAAuB,GAAA,KAAQ,MAAS;AAAA;AACrD,GACF;AACF;AAEA,eAAsB,+BAAA,CACpB,GAAA,EACA,IAAA,EACA,cAAA,EACA,OACA,OAAA,EAC+B;AAC/B,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAEhC,EAAA,MAAM,YAAA,GAAe,mBAAA,CAAoB,GAAA,CAAI,KAAA,EAAO,IAAI,CAAA;AACxD,EAAA,MAAM,WAAW,YAAA,CAAa,IAAA;AAC9B,EAAA,MAAM,UAAA,GAAa,iBAAA,CAAkB,GAAA,CAAI,KAAA,EAAO,MAAM,cAAc,CAAA;AAEpE,EAAA,MAAM,SAAA,GAAY,sBAAA,CAAuB,QAAA,EAAU,IAAA,EAAM,YAAY,KAAK,CAAA;AAC1E,EAAA,MAAM,UAAA,GAAa,kBAAkB,SAAS,CAAA;AAE9C,EAAA,MAAM,YAAA,GAAe,0BAAA;AAAA,IACnB,IAAA;AAAA,IACA,UAAA,CAAW,KAAA;AAAA,IACX,GAAA,CAAI;AAAA,GACN;AAEA,EAAA,MAAM,aAAA,GACJ,UAAA,CAAW,MAAA,GAAS,CAAA,GAClB,MAAM,2BAAA;AAAA,IACJ,OAAA;AAAA,IACA,GAAA,CAAI,OAAA;AAAA,IACJ,UAAA,CAAW,IAAA;AAAA,IACX,UAAA;AAAA,IACA,YAAA;AAAA,IACA;AAAA,GACF,uBACI,GAAA,EAAwD;AAGhE,EAAA,MAAM,UAAgC,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,KAAA,CAAM,QAAQ,CAAA;AACzE,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AAEzC,EAAA,KAAA,MAAW,CAAC,OAAO,EAAE,GAAA,EAAK,CAAA,IAAK,SAAA,CAAU,SAAQ,EAAG;AAClD,IAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,MAAA,OAAA,CAAQ,KAAK,CAAA,GAAI,MAAA;AACjB,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,aAAA,GAAgB,QAAA,CAAS,GAAA,CAAI,GAAG,CAAA;AACtC,IAAA,IAAI,kBAAkB,MAAA,EAAW;AAC/B,MAAA,OAAA,CAAQ,KAAK,CAAA,GAAI,OAAA,CAAQ,aAAa,CAAA;AACtC,MAAA;AAAA,IACF;AACA,IAAA,QAAA,CAAS,GAAA,CAAI,KAAK,KAAK,CAAA;AAEvB,IAAA,MAAM,QAAA,GAAW,aAAA,CAAc,GAAA,CAAI,GAAG,CAAA;AACtC,IAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,MAAA,OAAA,CAAQ,KAAK,CAAA,GAAI,MAAA;AACjB,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,WAAA,GAAc,MAAM,OAAA,CAAQ,OAAA;AAAA,MAChC,GAAA,CAAI,OAAA;AAAA,MACJ,QAAA,CAAS,aAAA;AAAA,MACT,QAAA,CAAS;AAAA,KACX;AAEA,IAAA,IAAI,WAAA,KAAgB,MAAA,IAAa,WAAA,CAAY,UAAA,KAAe,MAAA,EAAW;AACrE,MAAA,OAAA,CAAQ,KAAK,CAAA,GAAI,MAAA;AACjB,MAAA;AAAA,IACF;AAEA,IAAA,OAAA,CAAQ,KAAK,CAAA,GAAI,SAAA,CAAU,WAAW,CAAA;AAAA,EACxC;AAEA,EAAA,OAAO,OAAA;AACT;AAYA,SAAS,gBAAA,CACP,KAAA,EACA,IAAA,EACA,SAAA,EACsB;AACtB,EAAA,mBAAA,CAAoB,OAAO,IAAI,CAAA;AAE/B,EAAA,MAAM,WAAA,GAAc,MAAM,OAAA,EAAS,IAAA;AAAA,IACjC,CAAC,cACC,SAAA,CAAU,MAAA,KAAW,UACrB,SAAA,CAAU,IAAA,KAAS,IAAA,IACnB,SAAA,CAAU,IAAA,KAAS;AAAA,GACvB;AAEA,EAAA,IAAI,WAAA,EAAa,WAAW,MAAA,EAAQ;AAClC,IAAA,MAAM,IAAI,sBAAA,CAAuB,SAAA,EAAW,IAAI,CAAA;AAAA,EAClD;AAEA,EAAA,OAAO,WAAA;AACT;AAEA,IAAM,2BAAA,GAAkE;AAAA,EACtE,MAAA,EAAQ,QAAA;AAAA,EACR,MAAA,EAAQ,QAAA;AAAA,EACR,OAAA,EAAS;AACX,CAAA;AAOA,SAAS,uBAAA,CACP,KAAA,EACA,SAAA,EACA,OAAA,EACA,IAAA,EACM;AACN,EAAA,IAAI,KAAA,KAAU,MAAA,IAAa,KAAA,KAAU,IAAA,EAAM;AAI3C,EAAA,IACE,OAAO,KAAA,KAAU,QAAA,IACjB,OAAO,KAAA,KAAU,QAAA,IACjB,OAAO,KAAA,KAAU,SAAA,IACjB,EAAE,KAAA,YAAiB,IAAA,CAAA,EACnB;AACA,IAAA,MAAM,mBAAA;AAAA,MACJ,OAAA;AAAA,MACA,IAAA;AAAA,MACA,6CAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAEA,EAAA,IAAI,cAAc,MAAA,EAAQ;AACxB,IAAA,IAAI,KAAA,YAAiB,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA,EAAU;AACxD,IAAA,MAAM,mBAAA;AAAA,MACJ,OAAA;AAAA,MACA,IAAA;AAAA,MACA,2BAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAEA,EAAA,MAAM,QAAA,GAAW,2BAAA,CAA4B,SAAA,IAAa,SAAS,CAAA;AACnE,EAAA,IAAI,aAAa,MAAA,EAAW;AAC5B,EAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,IAAA,MAAM,mBAAA,CAAoB,OAAA,EAAS,IAAA,EAAM,QAAA,EAAU,KAAK,CAAA;AAAA,EAC1D;AACF;AAEA,SAAS,mBAAA,CACP,OAAA,EACA,IAAA,EACA,QAAA,EACA,KAAA,EACiB;AACjB,EAAA,OAAO,IAAI,eAAA;AAAA,IACT,CAAA,uBAAA,EAA0B,OAAO,CAAA,gBAAA,EAAmB,IAAI,CAAA,0BAAA,CAAA;AAAA,IACxD;AAAA,MACE,UAAA,EAAY,MAAA;AAAA,MACZ,IAAA;AAAA,MACA,MAAA,EAAQ;AAAA,QACN;AAAA,UACE,IAAA,EAAM,OAAA;AAAA,UACN,OAAA,EAAS,CAAA,SAAA,EAAY,QAAQ,CAAA,WAAA,EAAc,OAAO,KAAK,CAAA,CAAA;AAAA,UACvD,IAAA,EAAM;AAAA;AACR;AACF;AACF,GACF;AACF;AAGA,SAAS,oBAAA,CACP,OACA,OAAA,EACS;AACT,EAAA,OAAO,OAAA,CAAQ,SAAA,CAAU,oBAAA,CAAqB,KAAoB,CAAC,CAAA;AACrE;AASA,SAAS,qBAAqB,KAAA,EAA+C;AAC3E,EAAA,OAAO,KAAA,YAAiB,IAAA,GAAO,KAAA,CAAM,WAAA,EAAY,GAAI,KAAA;AACvD;AAEA,IAAM,cAAA,GAAiB,CAAA;AACvB,IAAM,eAAA,GAAkB,CAAA;AAOxB,SAAS,uBAAuB,KAAA,EAAmC;AACjE,EAAA,OAAO,IAAA,CAAK,SAAA;AAAA,IACV,KAAA,CAAM,GAAA;AAAA,MAAI,CAAC,KAAA,KACT,KAAA,KAAU,MAAA,IAAa,KAAA,KAAU,IAAA,GAC/B,CAAC,cAAc,CAAA,GACf,CAAC,eAAA,EAAiB,oBAAA,CAAqB,KAAoB,CAAC;AAAA;AAChE,GACF;AACF;AAYA,eAAsB,2BACpB,GAAA,EACA,IAAA,EACA,SAAA,EACA,KAAA,EACA,SACA,OAAA,EACmB;AACnB,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAEhC,EAAA,MAAM,KAAA,GAAQ,gBAAA,CAAiB,GAAA,CAAI,KAAA,EAAO,MAAM,SAAS,CAAA;AAMzD,EAAA,IAAI,KAAA,CAAM,eAAA,CAAgB,QAAA,CAAS,MAAM,CAAA,EAAG;AAC1C,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,iEAAA,EAAoE,SAAS,CAAA,cAAA,EAAiB,IAAI,CAAA,EAAA,CAAA;AAAA,MAClG,EAAE,WAAW,IAAA,EAAK;AAAA,MAClB;AAAA,QACE,UAAA,EACE;AAAA;AACJ,KACF;AAAA,EACF;AAEA,EAAA,MAAM,gBAAgB,OAAA,EAAS,aAAA;AAC/B,EAAA,IACE,aAAA,KAAkB,WACjB,CAAC,MAAA,CAAO,UAAU,aAAa,CAAA,IAAK,iBAAiB,CAAA,CAAA,EACtD;AACA,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,0DAAA;AAAA,MACA;AAAA,QACE,UAAA,EAAY,MAAA;AAAA,QACZ,IAAA;AAAA,QACA,MAAA,EAAQ;AAAA,UACN;AAAA,YACE,IAAA,EAAM,eAAA;AAAA,YACN,OAAA,EAAS,CAAA,sCAAA,EAAyC,MAAA,CAAO,aAAa,CAAC,CAAA,CAAA;AAAA,YACvE,IAAA,EAAM;AAAA;AACR;AACF;AACF,KACF;AAAA,EACF;AAEA,EAAA,MAAM,OAAA,GAAU,UAAA,CAAW,OAAA,CAAQ,OAAO,CAAA;AAG1C,EAAA,MAAM,SAAsB,KAAA,CAAM,GAAA;AAAA,IAAI,CAAC,IAAA,KACrC,KAAA,CAAM,OAAO,GAAA,CAAI,CAAC,SAAS,QAAA,KAAa;AACtC,MAAA,MAAM,KAAA,GAAQ,kBAAA,CAAmB,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA;AACpD,MAAA,uBAAA;AAAA,QACE,KAAA;AAAA,QACA,KAAA,CAAM,gBAAgB,QAAQ,CAAA;AAAA,QAC9B,OAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,OAAO,KAAA;AAAA,IACT,CAAC;AAAA,GACH;AAGA,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAoB;AAC3C,EAAA,MAAM,cAA2B,EAAC;AAClC,EAAA,MAAM,gBAA4B,EAAC;AACnC,EAAA,KAAA,MAAW,CAAC,UAAA,EAAY,KAAK,CAAA,IAAK,MAAA,CAAO,SAAQ,EAAG;AAClD,IAAA,MAAM,GAAA,GAAM,uBAAuB,KAAK,CAAA;AACxC,IAAA,MAAM,QAAA,GAAW,UAAA,CAAW,GAAA,CAAI,GAAG,CAAA;AACnC,IAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,MAAA,UAAA,CAAW,GAAA,CAAI,GAAA,EAAK,WAAA,CAAY,MAAM,CAAA;AACtC,MAAA,WAAA,CAAY,KAAK,KAAK,CAAA;AACtB,MAAA,aAAA,CAAc,IAAA,CAAK,CAAC,UAAU,CAAC,CAAA;AAC/B,MAAA;AAAA,IACF;AACA,IAAA,aAAA,CAAc,QAAQ,CAAA,EAAG,IAAA,CAAK,UAAU,CAAA;AAAA,EAC1C;AAGA,EAAA,MAAM,SACJ,OAAA,CAAQ,UAAA,GACN,eAAA,CAAgB,OAAA,CAAQ,UAAU,CAAA,GAClC,kBAAA;AACJ,EAAA,MAAM,cAAA,GAA0C;AAAA,IAC9C,SAAS,OAAA,CAAQ,OAAA;AAAA,IACjB,WAAA,EAAa5B,GAAAA,CAAI,GAAA,CAAI,CAAA,OAAA,CAAS,CAAA;AAAA,IAC9B,cAAc,CAAC,MAAA,KAAWA,IAAI,GAAA,CAAI,CAAA,CAAA,EAAI,MAAM,CAAA,CAAA,CAAG;AAAA,GACjD;AACA,EAAA,MAAM,SAAA,GAAY,yBAAA,CAA0B,KAAA,EAAO,cAAc,CAAA;AAEjE,EAAA,MAAM,kBAAkB,WAAA,CAAY,GAAA;AAAA,IAClC,CAAC,KAAA,KACCA,GAAAA,CAAAA,CAAAA,EAAOA,GAAAA,CAAI,IAAA;AAAA,MACT,SAAA,CAAU,GAAA,CAAI,CAAC,QAAA,EAAU,QAAA,KAAa;AACpC,QAAA,MAAM,KAAA,GAAQ,MAAM,QAAQ,CAAA;AAC5B,QAAA,IAAI,KAAA,KAAU,MAAA,IAAa,KAAA,KAAU,IAAA,EAAM;AACzC,UAAA,OAAOA,MAAM,QAAQ,CAAA,QAAA,CAAA;AAAA,QACvB;AACA,QAAA,OAAO,OAAA,CAAQ,cAAA;AAAA,UACb,QAAA;AAAA,UACAA,GAAAA,CAAAA,EAAM,oBAAA,CAAqB,KAAA,EAAO,OAAO,CAAC,CAAA;AAAA,SAC5C;AAAA,MACF,CAAC,CAAA;AAAA,MACDA,GAAAA,CAAAA,KAAAA;AAAA,KACD,CAAA,CAAA;AAAA,GACL;AAEA,EAAA,MAAM,eAAe,eAAA,CAAgB,GAAA;AAAA,IACnC,CAACQ,UAAAA,EAAW,KAAA,KAAUR,GAAAA,CAAAA,KAAAA,EAAWQ,UAAS,CAAA,MAAA,EAASR,GAAAA,CAAI,GAAA,CAAI,MAAA,CAAO,KAAK,CAAC,CAAC,CAAA;AAAA,GAC3E;AACA,EAAA,MAAM,iBAAiBA,GAAAA,CAAAA,KAAAA,EAAWA,GAAAA,CAAI,IAAA,CAAK,YAAA,EAAcA,MAAM,CAAC,CAAA,cAAA,CAAA;AAEhE,EAAA,MAAM,UAAA,GAAoB;AAAA,IACxBA,GAAAA,CAAAA,aAAAA,EAAmB,IAAI,OAAO,CAAA,CAAA;AAAA,IAC9BA,eAAe,IAAI,CAAA,CAAA;AAAA,IACnBA,GAAAA,CAAAA,oBAAAA;AAAA,GACF;AACA,EAAA,IAAI,KAAA,CAAM,UAAU,MAAA,EAAW;AAC7B,IAAA,UAAA,CAAW,IAAA,CAAK,iBAAA,CAAkB,cAAA,EAAgB,KAAA,CAAM,KAAK,CAAC,CAAA;AAAA,EAChE;AACA,EAAA,UAAA,CAAW,KAAKA,GAAAA,CAAAA,CAAAA,EAAOA,GAAAA,CAAI,KAAK,eAAA,EAAiBA,GAAAA,CAAAA,IAAAA,CAAS,CAAC,CAAA,CAAA,CAAG,CAAA;AAC9D,EAAA,MAAM,WAAA,GAAcA,GAAAA,CAAI,IAAA,CAAK,UAAA,EAAYA,GAAAA,CAAAA,KAAAA,CAAU,CAAA;AAMnD,EAAA,MAAM,eAAeA,GAAAA,CAAAA,aAAAA,EAAmB,cAAc,sBAAsB,MAAA,CAAO,UAAU,UAAU,WAAW,CAAA,CAAA;AAOlH,EAAA,MAAM,QAAA,GACJ,aAAA,KAAkB,MAAA,IAAa,OAAA,CAAQ,YAAA,CAAa,eAAA;AAEtD,EAAA,MAAM,KAAA,GACJ,WACEA,GAAAA,CAAAA,kIAAAA,EAAwI,YAAY,8CAA8C,aAAa,CAAA,yBAAA,CAAA,GAC/MA,MAAM,YAAY,CAAA,yBAAA,CAAA;AAGtB,EAAA,MAAM,UAAA,GAAa,MAAM,OAAA,CAAQ,OAAA,CAAoB,KAAK,CAAA;AAC1D,EAAA,MAAM,OAAA,GACJ,kBAAkB,MAAA,IAAa,CAAC,WAC9B,kBAAA,CAAmB,UAAA,EAAY,aAAa,CAAA,GAC5C,UAAA;AAEJ,EAAA,MAAM,YAAY,MAAM,gBAAA;AAAA,IACtB,OAAA;AAAA,IACA,GAAA,CAAI,OAAA;AAAA,IACJ,IAAA;AAAA,IACA,OAAA,CAAQ,GAAA,CAAI,CAAC,KAAA,KAAU,MAAM,EAAE;AAAA,GACjC;AAEA,EAAA,MAAM,OAAA,GAAoB,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,MAAM,MAAA,EAAO,EAAG,MAAM,EAAE,CAAA;AACvE,EAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,IAAA,MAAM,IAAA,GAAO,SAAA,CAAU,GAAA,CAAI,KAAA,CAAM,EAAE,CAAA;AACnC,IAAA,IAAI,SAAS,MAAA,EAAW;AACxB,IAAA,MAAM,MAAA,GAAS,aAAA,CAAc,KAAA,CAAM,SAAS,CAAA;AAC5C,IAAA,IAAI,WAAW,MAAA,EAAW;AAC1B,IAAA,KAAA,MAAW,cAAc,MAAA,EAAQ;AAC/B,MAAA,OAAA,CAAQ,UAAU,CAAA,EAAG,IAAA,CAAK,IAAI,CAAA;AAAA,IAChC;AAAA,EACF;AAEA,EAAA,OAAO,OAAA;AACT;AASA,SAAS,kBAAA,CACP,SACA,aAAA,EACc;AACd,EAAA,MAAM,aAAA,uBAAoB,GAAA,EAAoB;AAC9C,EAAA,MAAM,SAAuB,EAAC;AAC9B,EAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,IAAA,MAAMkD,MAAAA,GAAQ,aAAA,CAAc,GAAA,CAAI,KAAA,CAAM,SAAS,CAAA,IAAK,CAAA;AACpD,IAAA,IAAIA,UAAS,aAAA,EAAe;AAC5B,IAAA,aAAA,CAAc,GAAA,CAAI,KAAA,CAAM,SAAA,EAAWA,MAAAA,GAAQ,CAAC,CAAA;AAC5C,IAAA,MAAA,CAAO,KAAK,KAAK,CAAA;AAAA,EACnB;AACA,EAAA,OAAO,MAAA;AACT;AAGA,eAAe,gBAAA,CACb,OAAA,EACA,OAAA,EACA,IAAA,EACA,GAAA,EAC4B;AAC5B,EAAA,MAAM,WAAW,MAAM,gBAAA,CAAiB,OAAA,EAAS,OAAA,EAAS,MAAM,GAAG,CAAA;AACnE,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAkB;AACxC,EAAA,KAAA,MAAW,CAAC,EAAA,EAAI,GAAG,CAAA,IAAK,QAAA,EAAU;AAChC,IAAA,IAAI,GAAA,CAAI,eAAe,MAAA,EAAW;AAClC,IAAA,SAAA,CAAU,GAAA,CAAI,EAAA,EAAI,SAAA,CAAU,GAAG,CAAC,CAAA;AAAA,EAClC;AACA,EAAA,OAAO,SAAA;AACT;AAMA,eAAsB,uCAGpB,GAAA,EACA,IAAA,EACA,cAAA,EACA,KAAA,EACA,SACA,OAAA,EACgE;AAChE,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAEhC,EAAA,MAAM,QAAA,GAAW,SAAS,QAAA,IAAY,QAAA;AACtC,EAAA,MAAM,YAAA,GAAe,mBAAA,CAAoB,GAAA,CAAI,KAAA,EAAO,IAAI,CAAA;AACxD,EAAA,MAAM,WAAW,YAAA,CAAa,IAAA;AAC9B,EAAA,MAAM,UAAA,GAAa,iBAAA,CAAkB,GAAA,CAAI,KAAA,EAAO,MAAM,cAAc,CAAA;AAGpE,EAAA,MAAM,SAAA,GAAY,sBAAA,CAAuB,QAAA,EAAU,IAAA,EAAM,YAAY,KAAK,CAAA;AAC1E,EAAA,MAAM,UAAA,GAAa,kBAAkB,SAAS,CAAA;AAE9C,EAAA,MAAM,YAAA,GAAe,0BAAA;AAAA,IACnB,IAAA;AAAA,IACA,UAAA,CAAW,KAAA;AAAA,IACX,GAAA,CAAI;AAAA,GACN;AAGA,EAAA,MAAM,aAAA,GACJ,UAAA,CAAW,MAAA,GAAS,CAAA,GAClB,MAAM,2BAAA;AAAA,IACJ,OAAA;AAAA,IACA,GAAA,CAAI,OAAA;AAAA,IACJ,UAAA,CAAW,IAAA;AAAA,IACX,UAAA;AAAA,IACA,YAAA;AAAA,IACA;AAAA,GACF,uBACI,GAAA,EAOF;AAGN,EAAA,MAAM,WAAwD,EAAC;AAC/D,EAAA,MAAM,UAMA,EAAC;AACP,EAAA,MAAM,cAAwD,EAAC;AAC/D,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AAEzC,EAAA,KAAA,MAAW,CAAC,OAAO,EAAE,cAAA,EAAgB,KAAK,CAAA,IAAK,SAAA,CAAU,OAAA,EAAQ,EAAG;AAClE,IAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,MAAA,QAAA,CAAS,IAAA,CAAK,EAAE,KAAA,EAAO,KAAA,EAAO,EAAE,IAAA,EAAM,KAAA,EAAO,cAAA,EAAe,EAAG,CAAA;AAC/D,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,aAAA,GAAgB,QAAA,CAAS,GAAA,CAAI,GAAG,CAAA;AACtC,IAAA,IAAI,kBAAkB,MAAA,EAAW;AAC/B,MAAA,WAAA,CAAY,IAAA,CAAK,EAAE,KAAA,EAAO,WAAA,EAAa,eAAe,CAAA;AACtD,MAAA;AAAA,IACF;AAEA,IAAA,QAAA,CAAS,GAAA,CAAI,KAAK,KAAK,CAAA;AAEvB,IAAA,MAAM,QAAA,GAAW,aAAA,CAAc,GAAA,CAAI,GAAG,CAAA;AACtC,IAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,MAAA,QAAA,CAAS,IAAA,CAAK,EAAE,KAAA,EAAO,KAAA,EAAO,EAAE,IAAA,EAAM,KAAA,EAAO,cAAA,EAAe,EAAG,CAAA;AAAA,IACjE,CAAA,MAAO;AACL,MAAA,OAAA,CAAQ,IAAA,CAAK;AAAA,QACX,KAAA;AAAA,QACA,QAAQ,QAAA,CAAS,OAAA;AAAA,QACjB,cAAc,QAAA,CAAS,aAAA;AAAA,QACvB,cAAA;AAAA,QACA,aAAA,EAAe,SAAS,UAAA,KAAe;AAAA,OACxC,CAAA;AAAA,IACH;AAAA,EACF;AAGA,EAAA,MAAM,UAAoB,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,KAAA,CAAM,QAAQ,CAAA;AAG7D,EAAA,IAAI,QAAA,CAAS,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,eAAe,QAAA,CAAS,GAAA,CAAI,CAACtB,MAAAA,KAAUA,OAAM,KAAK,CAAA;AACxD,IAAA,MAAM,eAAe,MAAM,sBAAA;AAAA,MACzB,GAAA;AAAA,MACA,YAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,KAAA,MAAW,CAAC,UAAA,EAAYA,MAAK,CAAA,IAAK,QAAA,CAAS,SAAQ,EAAG;AACpD,MAAA,OAAA,CAAQA,MAAAA,CAAM,KAAK,CAAA,GAAI;AAAA,QACrB,IAAA,EAAM,aAAa,UAAU,CAAA;AAAA,QAC7B,MAAA,EAAQ;AAAA,OACV;AAAA,IACF;AAAA,EACF;AAGA,EAAA,KAAA,MAAWA,UAAS,OAAA,EAAS;AAC3B,IAAA,MAAM,EAAE,KAAA,EAAO,YAAA,EAAc,cAAA,EAAgB,aAAA,EAAe,QAAO,GACjEA,MAAAA;AAEF,IAAA,MAAM,WAAA,GAAc,MAAM,OAAA,CAAQ,OAAA;AAAA,MAChC,GAAA,CAAI,OAAA;AAAA,MACJ,YAAA;AAAA,MACA;AAAA,KACF;AAEA,IAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,MAAA,MAAM,OAAO,MAAM,iBAAA;AAAA,QACjB,GAAA;AAAA,QACA,EAAE,IAAA,EAAM,KAAA,EAAO,cAAA,EAAe;AAAA,QAC9B;AAAA,OACF;AACA,MAAA,OAAA,CAAQ,KAAK,CAAA,GAAI,EAAE,IAAA,EAAM,QAAQ,SAAA,EAAU;AAC3C,MAAA;AAAA,IACF;AAEA,IAAA,IAAI,aAAA,IAAiB,aAAa,QAAA,EAAU;AAC1C,MAAA,MAAM,OAAO,MAAM,uBAAA;AAAA,QACjB,GAAA;AAAA,QACA;AAAA,UACE,IAAA,EAAM,YAAA;AAAA,UACN,IAAI,WAAA,CAAY,EAAA;AAAA,UAChB,KAAA,EAAO;AAAA,SACT;AAAA,QACA,OAAA;AAAA,QACA,EAAE,cAAc,aAAA;AAAc,OAChC;AACA,MAAA,OAAA,CAAQ,KAAK,CAAA,GAAI;AAAA,QACf,IAAA;AAAA,QACA,MAAA,EAAQ,gBAAgB,aAAA,GAAgB;AAAA,OAC1C;AAAA,IACF,CAAA,MAAO;AACL,MAAA,OAAA,CAAQ,KAAK,IAAI,EAAE,IAAA,EAAM,UAAU,WAAW,CAAA,EAAG,QAAQ,OAAA,EAAQ;AAAA,IACnE;AAAA,EACF;AAGA,EAAA,KAAA,MAAW,EAAE,KAAA,EAAO,WAAA,EAAY,IAAK,WAAA,EAAa;AAChD,IAAA,MAAM,YAAA,GAAe,QAAQ,WAAW,CAAA;AACxC,IAAA,OAAA,CAAQ,KAAK,CAAA,GAAI,EAAE,MAAM,YAAA,CAAa,IAAA,EAAM,QAAQ,OAAA,EAAQ;AAAA,EAC9D;AAEA,EAAA,OAAO,OAAA;AACT;;;ACxnDA,IAAM,uBAAA,GAA+C,OAAO,MAAA,CAAO;AAAA,EACjE,aAAA,EAAe,MAAA;AAAA,EACf,UAAA,EAAY;AACd,CAAC,CAAA;AAWD,IAAM,0BAAA,GAA6B,GAAA;AAEnC,IAAM,sBAAA,GAEF;AAAA,EACF,MAAA,EAAQ,EAAE,MAAA,EAAQ,QAAA,EAAU,MAAM,0BAAA,EAA2B;AAAA,EAC7D,WAAA,EAAa;AAAA,IACX,MAAA,EAAQ,wBAAA;AAAA,IACR,IAAA,EAAM;AAAA,GACR;AAAA,EACA,MAAA,EAAQ,EAAE,MAAA,EAAQ,iBAAA,EAAmB,MAAM,0BAAA,EAA2B;AAAA,EACtE,SAAA,EAAW;AAAA,IACT,MAAA,EAAQ,oBAAA;AAAA,IACR,IAAA,EAAM;AAAA,GACR;AAAA,EACA,WAAA,EAAa;AAAA,IACX,MAAA,EAAQ,sBAAA;AAAA,IACR,IAAA,EAAM;AAAA,GACR;AAAA,EACA,OAAA,EAAS;AAAA,IACP,MAAA,EAAQ,4BAAA;AAAA,IACR,IAAA,EAAM;AAAA;AAEV,CAAA;AAyEO,IAAM,KAAA,GAAN,MAAM,MAAA,CAA0B;AAAA,EAC5B,MAAA;AAAA,EACA,QAAA;AAAA,EACA,SAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,eAAA;AAAA,EACA,0BAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,QAAA;AAAA,EACT,gBAAA;AAAA,EACA,gBAAA;AAAA,EACA,WAAA;AAAA,EACA,OAAA;AAAA,EAEA,WAAA,CACE,KAAA,EACA,OAAA,EACA,OAAA,EACA,cAAA,EACA;AACA,IAAA,IAAA,CAAK,MAAA,GAAS,KAAA;AACd,IAAA,IAAA,CAAK,QAAA,GAAW,OAAA;AAChB,IAAA,IAAA,CAAK,SAAA,GAAY,kBAAkB,KAAK,CAAA;AACxC,IAAA,IAAA,CAAK,MAAA,GAAS,OAAA,EAAS,KAAA,IAAS,EAAC;AACjC,IAAA,IAAA,CAAK,OAAA,GACH,SAAS,MAAA,KACR,OAAA,CAAQ,aAAa,eAAA,CAAgB,OAAA,CAAQ,UAAU,CAAA,GAAI,MAAA,CAAA;AAC9D,IAAA,IAAA,CAAK,0BAAA,GACH,OAAA,EAAS,aAAA,EAAe,kBAAA,IAAsB,SAAA;AAChD,IAAA,IAAA,CAAK,QAAA,GAAW,OAAA;AAChB,IAAA,IAAA,CAAK,kBAAkB,cAAA,IAAkB,uBAAA;AAAA,EAC3C;AAAA;AAAA;AAAA,EAKA,IAAI,KAAA,GAAW;AACb,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,OAAA,GAAkB;AACpB,IAAA,OAAO,KAAK,MAAA,CAAO,EAAA;AAAA,EACrB;AAAA;AAAA,EAGA,IAAI,QAAA,GAAyB;AAC3B,IAAA,OAAO,IAAA,CAAK,SAAA;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,OAAA,GAAwB;AAC1B,IAAA,OAAO,IAAA,CAAK,QAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBA,IAAI,KAAA,GAAiC;AACnC,IAAA,IAAI,IAAA,CAAK,qBAAqB,MAAA,EAAW;AACvC,MAAA,IAAA,CAAK,gBAAA,GAAmB,0BAAA;AAAA,QACtB,IAAA,CAAK,MAAA;AAAA,QACL,IAAA,CAAK,OAAA;AAAA,QACL,IAAA,CAAK,SAAA;AAAA,QACL,IAAA,CAAK,QAAA;AAAA,QACL,IAAA,CAAK;AAAA,OACP;AAAA,IACF;AAEA,IAAA,OAAO,IAAA,CAAK,gBAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBA,IAAI,KAAA,GAAiC;AACnC,IAAA,IAAI,IAAA,CAAK,qBAAqB,MAAA,EAAW;AACvC,MAAA,IAAA,CAAK,gBAAA,GAAmB,0BAAA;AAAA,QACtB,IAAA,CAAK,MAAA;AAAA,QACL,IAAA,CAAK,OAAA;AAAA,QACL,IAAA,CAAK,SAAA;AAAA,QACL,IAAA,CAAK,QAAA;AAAA,QACL,IAAA,CAAK;AAAA,OACP;AAAA,IACF;AAEA,IAAA,OAAO,IAAA,CAAK,gBAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAwBA,IAAI,UAAA,GAAiC;AACnC,IAAA,IAAI,IAAA,CAAK,gBAAgB,MAAA,EAAW;AAClC,MAAA,IAAA,CAAK,cAAc,qBAAA,CAAyB;AAAA,QAC1C,SAAS,IAAA,CAAK,OAAA;AAAA,QACd,SAAS,IAAA,CAAK,QAAA;AAAA,QACd,QAAQ,IAAA,CAAK,OAAA;AAAA,QACb,mBAAA,EAAqB,IAAA,CAAK,MAAA,CAAO,QAAA,CAAS;AAAA,OAC3C,CAAA;AAAA,IACH;AACA,IAAA,OAAO,IAAA,CAAK,WAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,kBAAkB,IAAA,EAAiD;AACjE,IAAA,IAAI,CAAC,OAAO,MAAA,CAAO,IAAA,CAAK,OAAO,KAAA,EAAO,IAAI,GAAG,OAAO,MAAA;AACpD,IAAA,OAAO,IAAA,CAAK,MACV,IACF,CAAA;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,yBAAyB,IAAA,EAAqC;AAC5D,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,iBAAA,CAAkB,IAAI,CAAA;AAC9C,IAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,MAAA,MAAM,IAAI,iBAAA,CAAkB,IAAA,EAAM,MAAA,EAAQ;AAAA,QACxC,SAAS,IAAA,CAAK;AAAA,OACf,CAAA;AAAA,IACH;AACA,IAAA,OAAO,UAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,kBAAkB,IAAA,EAAiD;AACjE,IAAA,IAAI,CAAC,OAAO,MAAA,CAAO,IAAA,CAAK,OAAO,KAAA,EAAO,IAAI,GAAG,OAAO,MAAA;AACpD,IAAA,OAAO,IAAA,CAAK,MACV,IACF,CAAA;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,yBAAyB,IAAA,EAAqC;AAC5D,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,iBAAA,CAAkB,IAAI,CAAA;AAC9C,IAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,MAAA,MAAM,IAAI,iBAAA,CAAkB,IAAA,EAAM,MAAA,EAAQ;AAAA,QACxC,SAAS,IAAA,CAAK;AAAA,OACf,CAAA;AAAA,IACH;AACA,IAAA,OAAO,UAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,mBAAmB,IAAA,EAAsD;AACvE,IAAA,IAAI,CAAC,OAAO,MAAA,CAAO,IAAA,CAAK,OAAO,KAAA,EAAO,IAAI,GAAG,OAAO,MAAA;AACpD,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,KAAA,CAAM,IAAI,EAAG,IAAA,CAAK,MAAA;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,0BAA0B,IAAA,EAA0C;AAClE,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,kBAAA,CAAmB,IAAI,CAAA;AAC3C,IAAA,IAAI,WAAW,MAAA,EAAW;AACxB,MAAA,MAAM,IAAI,iBAAA,CAAkB,IAAA,EAAM,MAAA,EAAQ;AAAA,QACxC,SAAS,IAAA,CAAK;AAAA,OACf,CAAA;AAAA,IACH;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,mBAAmB,IAAA,EAAsD;AACvE,IAAA,IAAI,CAAC,OAAO,MAAA,CAAO,IAAA,CAAK,OAAO,KAAA,EAAO,IAAI,GAAG,OAAO,MAAA;AACpD,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,KAAA,CAAM,IAAI,EAAG,IAAA,CAAK,MAAA;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,0BAA0B,IAAA,EAA0C;AAClE,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,kBAAA,CAAmB,IAAI,CAAA;AAC3C,IAAA,IAAI,WAAW,MAAA,EAAW;AACxB,MAAA,MAAM,IAAI,iBAAA,CAAkB,IAAA,EAAM,MAAA,EAAQ;AAAA,QACxC,SAAS,IAAA,CAAK;AAAA,OACf,CAAA;AAAA,IACH;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBA,UAAA,GAAkC;AAChC,IAAA,OAAO,gBAAA,CAAiB,KAAK,MAAA,EAAQ;AAAA,MACnC,SAAS,IAAA,CAAK,OAAA;AAAA,MACd,aAAA,EAAe,KAAK,eAAA,CAAgB,aAAA;AAAA,MACpC,UAAA,EAAY,KAAK,eAAA,CAAgB;AAAA,KAClC,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,eAAA,GAAkC;AACpC,IAAA,MAAM,GAAA,GAAM,KAAK,2BAAA,EAA4B;AAC7C,IAAA,OAAO;AAAA,MACL,mBAAA,EAAqB,IAAA,CAAK,MAAA,CAAO,QAAA,CAAS,YAAA;AAAA,MAC1C,SAAA,EAAW,CAAC,GAAA,KAAQ,SAAA,CAAU,GAAG,CAAA;AAAA,MACjC,eAAe,CAAC,KAAA,EAAO,YAAY,iBAAA,CAAkB,GAAA,EAAK,OAAO,OAAO,CAAA;AAAA,MACxE,oBAAoB,CAAC,MAAA,EAAQ,YAC3B,sBAAA,CAAuB,GAAA,EAAK,QAAQ,OAAO,CAAA;AAAA,MAC7C,4BAA4B,CAAC,MAAA,EAAQ,YACnC,8BAAA,CAA+B,GAAA,EAAK,QAAQ,OAAO,CAAA;AAAA,MACrD,aAAA,EAAe,CAAC,KAAA,EAAO,OAAA,EAAS,YAC9B,iBAAA,CAAkB,GAAA,EAAK,EAAE,GAAG,OAAO,EAAA,EAAI,KAAA,CAAM,EAAA,EAAG,EAAG,SAAS,OAAO,CAAA;AAAA,MACrE,mBAAA,EAAqB,CAAC,KAAA,EAAO,OAAA,EAAS,OAAA,KACpC,uBAAA;AAAA,QACE,GAAA;AAAA,QACA,EAAE,GAAG,KAAA,EAAO,EAAA,EAAI,MAAM,EAAA,EAAG;AAAA,QACzB,OAAA;AAAA,QACA;AAAA,OACF;AAAA,MACF,aAAA,EAAe,CAAC,IAAA,EAAM,EAAA,EAAI,YACxB,iBAAA,CAAkB,GAAA,EAAK,IAAA,EAAM,EAAA,EAAI,OAAO,CAAA;AAAA,MAC1C,iBAAA,EAAmB,CAAC,IAAA,EAAM,EAAA,EAAI,YAC5B,qBAAA,CAAsB,GAAA,EAAK,IAAA,EAAM,EAAA,EAAI,OAAO,CAAA;AAAA,MAC9C,kBAAA,EAAoB,CAAC,OAAA,KAAY,IAAA,CAAK,oBAAoB,OAAO,CAAA;AAAA,MACjE,WAAA,EAAa,MAAM,IAAA,CAAK,KAAA,EAAM;AAAA,MAC9B,gCAAgC,CAC9B,IAAA,EACA,cAAA,EACA,KAAA,EACA,SACA,OAAA,KAEA,kCAAA;AAAA,QACE,GAAA;AAAA,QACA,IAAA;AAAA,QACA,cAAA;AAAA,QACA,KAAA;AAAA,QACA,OAAA;AAAA,QACA;AAAA,OACF;AAAA,MACF,oCAAoC,CAClC,IAAA,EACA,cAAA,EACA,KAAA,EACA,SACA,OAAA,KAEA,sCAAA;AAAA,QACE,GAAA;AAAA,QACA,IAAA;AAAA,QACA,cAAA;AAAA,QACA,KAAA;AAAA,QACA,OAAA;AAAA,QACA;AAAA,OACF;AAAA,MACF,uBAAA,EAAyB,CAAC,IAAA,EAAM,cAAA,EAAgB,KAAA,EAAO,OAAA,KACrD,2BAAA,CAA4B,GAAA,EAAK,IAAA,EAAM,cAAA,EAAgB,KAAA,EAAO,OAAO,CAAA;AAAA,MACvE,2BAAA,EAA6B,CAAC,IAAA,EAAM,cAAA,EAAgB,OAAO,OAAA,KACzD,+BAAA;AAAA,QACE,GAAA;AAAA,QACA,IAAA;AAAA,QACA,cAAA;AAAA,QACA,KAAA;AAAA,QACA;AAAA,OACF;AAAA,MACF,wBAAwB,CAAC,IAAA,EAAM,SAAA,EAAW,KAAA,EAAO,SAAS,OAAA,KACxD,0BAAA;AAAA,QACE,GAAA;AAAA,QACA,IAAA;AAAA,QACA,SAAA;AAAA,QACA,KAAA;AAAA,QACA,OAAA;AAAA,QACA;AAAA;AACF,KACJ;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,eAAA,GAAkC;AACpC,IAAA,MAAM,GAAA,GAAM,KAAK,2BAAA,EAA4B;AAC7C,IAAA,OAAO;AAAA,MACL,mBAAA,EAAqB,IAAA,CAAK,MAAA,CAAO,QAAA,CAAS,YAAA;AAAA,MAC1C,SAAA,EAAW,CAAC,GAAA,KAAQ,SAAA,CAAU,GAAG,CAAA;AAAA,MACjC,eAAe,CAAC,KAAA,EAAO,YAAY,iBAAA,CAAkB,GAAA,EAAK,OAAO,OAAO,CAAA;AAAA,MACxE,oBAAoB,CAAC,MAAA,EAAQ,YAC3B,sBAAA,CAAuB,GAAA,EAAK,QAAQ,OAAO,CAAA;AAAA,MAC7C,4BAA4B,CAAC,MAAA,EAAQ,YACnC,8BAAA,CAA+B,GAAA,EAAK,QAAQ,OAAO,CAAA;AAAA,MACrD,eAAe,CAAC,KAAA,EAAO,YAAY,iBAAA,CAAkB,GAAA,EAAK,OAAO,OAAO,CAAA;AAAA,MACxE,mBAAA,EAAqB,CAAC,KAAA,EAAO,OAAA,EAAS,YACpC,uBAAA,CAAwB,GAAA,EAAK,KAAA,EAAO,OAAA,EAAS,OAAO,CAAA;AAAA,MACtD,eAAe,CAAC,EAAA,EAAI,YAAY,iBAAA,CAAkB,GAAA,EAAK,IAAI,OAAO,CAAA;AAAA,MAClE,mBAAmB,CAAC,EAAA,EAAI,YACtB,qBAAA,CAAsB,GAAA,EAAK,IAAI,OAAO,CAAA;AAAA,MACxC,kBAAA,EAAoB,CAAC,OAAA,KAAY,IAAA,CAAK,oBAAoB,OAAO,CAAA;AAAA,MACjE,WAAA,EAAa,MAAM,IAAA,CAAK,KAAA,EAAM;AAAA,MAC9B,6BAAA,EAA+B,CAC7B,IAAA,EACA,QAAA,EACA,QACA,MAAA,EACA,IAAA,EACA,KAAA,EACA,OAAA,EACA,OAAA,KAEA,iCAAA;AAAA,QACE,GAAA;AAAA,QACA,IAAA;AAAA,QACA,QAAA;AAAA,QACA,MAAA;AAAA,QACA,MAAA;AAAA,QACA,IAAA;AAAA,QACA,KAAA;AAAA,QACA,OAAA;AAAA,QACA;AAAA,OACF;AAAA,MACF,iCAAA,EAAmC,CAAC,IAAA,EAAM,KAAA,EAAO,SAAS,OAAA,KACxD,qCAAA;AAAA,QACE,GAAA;AAAA,QACA,IAAA;AAAA,QACA,KAAA;AAAA,QACA,OAAA;AAAA,QACA;AAAA,OACF;AAAA,MACF,sBAAA,EAAwB,CACtB,IAAA,EACA,QAAA,EACA,QACA,MAAA,EACA,IAAA,EACA,SACA,OAAA,KAEA,0BAAA;AAAA,QACE,GAAA;AAAA,QACA,IAAA;AAAA,QACA,QAAA;AAAA,QACA,MAAA;AAAA,QACA,MAAA;AAAA,QACA,IAAA;AAAA,QACA,OAAA;AAAA,QACA;AAAA;AACF,KACJ;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,KAAA,GAAyB;AACvB,IAAA,OAAO,IAAA,CAAK,sBAAA,CAAuB,IAAA,CAAK,QAAQ,CAAA;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,YAAY,UAAA,EAA6C;AACvD,IAAA,OAAO,IAAA,CAAK,sBAAA,CAAuB,IAAA,CAAK,QAAA,EAAU,UAAU,CAAA;AAAA,EAC9D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA0BA,KAAK,IAAA,EAA4B;AAC/B,IAAA,OAAO,IAAI,SAAA,CAAU,IAAA,EAAM,EAAE,IAAA,EAAM,MAAA,EAAQ,MAAM,CAAA;AAAA,EACnD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBA,KAAK,UAAA,EAA+C;AAClD,IAAA,OAAO,IAAI,SAAA,CAAU,IAAA,EAAM,UAAU,CAAA;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBA,QAAA,GAAyB;AACvB,IAAA,OAAO,IAAA,CAAK,IAAA,CAAK,MAAA,EAAQ,CAAA;AAAA,EAC3B;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,EA+BA,IAAI,MAAA,GAAyB;AAC3B,IAAA,IAAI,IAAA,CAAK,YAAY,MAAA,EAAW;AAC9B,MAAA,IAAA,CAAK,OAAA,GAAU,IAAI,WAAA,CAAe;AAAA,QAChC,SAAS,IAAA,CAAK,OAAA;AAAA,QACd,SAAS,IAAA,CAAK,QAAA;AAAA,QACd,UAAU,IAAA,CAAK;AAAA,OAChB,CAAA;AAAA,IACH;AACA,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;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;AAAA;AAAA;AAAA,EAwCA,MAAM,SAMD,OAAA,EAAkD;AACrD,IAAA,OAAO,0BAAA,CAA2B,IAAA,CAAK,QAAA,EAAU,OAAO,MAAA,KAAW;AACjE,MAAA,MAAM,UAAqB,EAAC;AAC5B,MAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,QAAA,MAAM,MAAA,GAAS,MAAM,KAAA,CAAM,SAAA,CAAU,MAAM,CAAA;AAC3C,QAAA,OAAA,CAAQ,KAAK,MAAM,CAAA;AAAA,MACrB;AACA,MAAA,OAAO,OAAA;AAAA,IACT,CAAC,CAAA;AAAA,EACH;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,EA8BA,MAAM,QAAA,CAKJ,MAAA,EACA,OAAA,EACuC;AACvC,IAAA,OAAO,eAAA,CAAgB;AAAA,MACrB,OAAO,IAAA,CAAK,MAAA;AAAA,MACZ,SAAS,IAAA,CAAK,OAAA;AAAA,MACd,MAAA;AAAA,MACA,SAAS,IAAA,CAAK,QAAA;AAAA,MACd,OAAA,EAAS,UAAA,CAAW,IAAA,CAAK,QAAA,CAAS,OAAO,CAAA;AAAA,MACzC,QAAQ,IAAA,CAAK,OAAA;AAAA,MACb;AAAA,KACD,CAAA;AAAA,EACH;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;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA6DA,MAAM,WAAA,CACJ,EAAA,EACA,OAAA,EACY;AAKZ,IAAA,IAAI,CAAC,IAAA,CAAK,QAAA,CAAS,YAAA,CAAa,YAAA,EAAc;AAC5C,MAAA,OAAO,EAAA,CAAG;AAAA,QACR,OAAO,IAAA,CAAK,KAAA;AAAA,QACZ,OAAO,IAAA,CAAK,KAAA;AAAA,QACZ,SAAS,IAAA,CAAK;AAAA,OACf,CAAA;AAAA,IACH;AAMA,IAAA,OAAO,KAAK,QAAA,CAAS,WAAA;AAAA,MACnB,OAAO,WAAW5B,KAAAA,KAChB,EAAA,CAAG,KAAK,wBAAA,CAAyB,SAAA,EAAWA,KAAG,CAAC,CAAA;AAAA,MAClD;AAAA,KACF;AAAA,EACF;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;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAyDA,gBAAgB,UAAA,EAAuD;AACrE,IAAA,MAAM,KAAA,GAAQ,KAAK,QAAA,CAAS,gBAAA;AAC5B,IAAA,IAAI,CAAC,KAAA,EAAO;AACV,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,qTAAA;AAAA,QAKA,EAAE,YAAY,kBAAA;AAAmB,OACnC;AAAA,IACF;AAIA,IAAA,OAAO,IAAA,CAAK,wBAAA,CAAyB,KAAA,CAAM,UAAU,GAAG,UAAU,CAAA;AAAA,EACpE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,wBAAA,CACE,WACAA,KAAAA,EACuB;AACvB,IAAA,MAAM,gBAAA,GAAmC;AAAA,MACvC,GAAG,IAAA,CAAK,eAAA;AAAA,MACR,WAAA,EAAa,MAAM,IAAA,CAAK,sBAAA,CAAuB,SAAS;AAAA,KAC1D;AACA,IAAA,MAAM,gBAAA,GAAmC;AAAA,MACvC,GAAG,IAAA,CAAK,eAAA;AAAA,MACR,WAAA,EAAa,MAAM,IAAA,CAAK,sBAAA,CAAuB,SAAS;AAAA,KAC1D;AAEA,IAAA,MAAM,KAAA,GAAQ,0BAAA;AAAA,MACZ,IAAA,CAAK,MAAA;AAAA,MACL,IAAA,CAAK,OAAA;AAAA,MACL,IAAA,CAAK,SAAA;AAAA,MACL,SAAA;AAAA,MACA;AAAA,KACF;AAEA,IAAA,MAAM,KAAA,GAAQ,0BAAA;AAAA,MACZ,IAAA,CAAK,MAAA;AAAA,MACL,IAAA,CAAK,OAAA;AAAA,MACL,IAAA,CAAK,SAAA;AAAA,MACL,SAAA;AAAA,MACA;AAAA,KACF;AAEA,IAAA,OAAOA,KAAAA,KAAQ,MAAA,GACX,EAAE,KAAA,EAAO,OAAO,OAAA,EAAS,SAAA,EAAU,GACnC,EAAE,KAAA,EAAO,KAAA,EAAO,GAAA,EAAAA,KAAAA,EAAK,SAAS,SAAA,EAAU;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,MAAM,KAAA,GAAuB;AAC3B,IAAA,MAAM,OAAA,GAAU,OACd,MAAA,KACkB;AAClB,MAAA,MAAM,MAAA,CAAO,UAAA,CAAW,IAAA,CAAK,OAAO,CAAA;AAAA,IACtC,CAAA;AAEA,IAAA,OAAO,IAAA,CAAK,QAAA,CAAS,YAAA,CAAa,YAAA,GAChC,KAAK,QAAA,CAAS,WAAA,CAAY,OAAO,EAAA,KAAO,QAAQ,EAAE,CAAC,CAAA,GACnD,OAAA,CAAQ,KAAK,QAAQ,CAAA,CAAA;AAKvB,IAAA,MAAM,KAAK,mBAAA,EAAoB;AAG/B,IAAA,IAAA,CAAK,gBAAA,GAAmB,MAAA;AACxB,IAAA,IAAA,CAAK,gBAAA,GAAmB,MAAA;AACxB,IAAA,IAAA,CAAK,WAAA,GAAc,MAAA;AACnB,IAAA,IAAA,CAAK,OAAA,GAAU,MAAA;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,mBAAA,GAAqC;AACzC,IAAA,MAAM,UAAU,IAAA,CAAK,QAAA;AACrB,IAAA,MAAM,WAAW,OAAA,CAAQ,cAAA;AACzB,IAAA,IAAI,QAAA,KAAa,MAAA,IAAa,OAAA,CAAQ,UAAA,KAAe,MAAA,EAAW;AAEhE,IAAA,KAAA,MAAW,CAAC,QAAA,EAAU,QAAQ,CAAA,IAAK,IAAA,CAAK,UAAU,SAAA,EAAW;AAC3D,MAAA,KAAA,MAAWH,MAAAA,IAAS,sBAAA,CAAuB,QAAA,CAAS,MAAM,CAAA,EAAG;AAC3D,QAAA,MAAM,IAAA,GAAmB;AAAA,UACvB,SAAS,IAAA,CAAK,OAAA;AAAA,UACd,QAAA;AAAA,UACA,WAAWA,MAAAA,CAAM,SAAA;AAAA,UACjB,YAAYA,MAAAA,CAAM,UAAA;AAAA,UAClB,QAAQA,MAAAA,CAAM,MAAA;AAAA,UACd,WAAWA,MAAAA,CAAM;AAAA,SACnB;AACA,QAAA,KAAA,MAAW,GAAA,IAAO,QAAA,CAAS,gBAAA,CAAiB,IAAI,CAAA,EAAG;AACjD,UAAA,MAAM,OAAA,CAAQ,WAAW,GAAG,CAAA;AAAA,QAC9B;AACA,QAAA,KAAA,MAAW,YAAA,IAAgB,QAAA,CAAS,WAAA,CAAY,IAAI,CAAA,EAAG;AACrD,UAAA,KAAA,MAAW,GAAA,IAAO,aAAa,SAAA,EAAW;AACxC,YAAA,MAAM,OAAA,CAAQ,WAAW,GAAG,CAAA;AAAA,UAC9B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;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,EA+BA,MAAM,iBAAA,GAAmC;AACvC,IAAA,MAAM,IAAA,CAAK,SAAS,iBAAA,EAAkB;AAAA,EACxC;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;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiDA,MAAM,MAAA,CACJ,SAAA,EACA,OAAA,EAiBmB;AAYnB,IAAA,MAAM,EAAE,SAAA,EAAW,QAAA,KAAa,MAAM,IAAA,CAAK,cAAc,QAAQ,CAAA;AAMjE,IAAA,MAAM,MAAA,GAAS,mBAAA,CAAoB,QAAA,EAAU,SAAS,CAAA;AAkBtD,IAAA,IAAI,WAAW,QAAA,EAAU;AACvB,MAAA,IAAI,QAAA,KAAa,KAAK,MAAA,EAAQ;AAC5B,QAAA,IAAI,OAAA,EAAS,GAAA,KAAQ,MAAA,EAAW,OAAA,CAAQ,IAAI,OAAA,GAAU,IAAA;AACtD,QAAA,IAAI,OAAA,EAAS,UAAU,MAAA,EAAW;AAChC,UAAA,MAAM,IAAA,CAAK,gBAAA,CAAiB,IAAA,EAAM,OAAA,CAAQ,KAAK,CAAA;AAAA,QACjD;AACA,QAAA,OAAO,IAAA;AAAA,MACT;AACA,MAAA,MAAM,WAAW,IAAA,CAAK,eAAA;AAAA,QACpB,QAAA;AAAA,QACA,OAAA,EAAS,GAAA;AAAA,QACT,sBAAsB,SAAS;AAAA,OACjC;AACA,MAAA,IAAI,OAAA,EAAS,UAAU,MAAA,EAAW;AAChC,QAAA,MAAM,IAAA,CAAK,gBAAA,CAAiB,QAAA,EAAU,OAAA,CAAQ,KAAK,CAAA;AAAA,MACrD;AACA,MAAA,OAAO,QAAA;AAAA,IACT;AASA,IAAA,MAAM,mBAAmB,QAAA,CAAS,SAAA,IAAa,MAAA,CAAO,MAAA,CAAO,EAAE,CAAA;AAC/D,IAAA,MAAM,cAAA,GAAiB,qBAAA,CAAsB,gBAAA,EAAkB,SAAS,CAAA;AACxE,IAAA,IAAI,cAAA,CAAe,YAAA,CAAa,MAAA,GAAS,CAAA,EAAG;AAC1C,MAAA,MAAM,IAAI,uBAAA;AAAA,QACR,cAAA,CAAe,YAAA;AAAA,QACf,IAAA,CAAK;AAAA,OACP;AAAA,IACF;AACA,IAAA,IAAI,cAAA,CAAe,YAAA,CAAa,MAAA,GAAS,CAAA,EAAG;AAC1C,MAAA,MAAM,QAAA,GAAW,MAAM,IAAA,CAAK,gBAAA,CAAiB,eAAe,YAAY,CAAA;AACxE,MAAA,MAAM,KAAA,GAAQ,4BAAA;AAAA,QACZ,cAAA;AAAA,QACA,QAAA;AAAA,QACA,IAAA,CAAK;AAAA,OACP;AACA,MAAA,IAAI,KAAA,KAAU,QAAW,MAAM,KAAA;AAAA,IACjC;AAQA,IAAA,MAAM,YAAY,MAAM,sBAAA;AAAA,MACtB,IAAA,CAAK,QAAA;AAAA,MACL,MAAA;AAAA,MACA,SAAA,CAAU;AAAA,KACZ;AACA,IAAA,MAAM,UAAU,IAAA,CAAK,eAAA;AAAA,MACnB,MAAA;AAAA,MACA,OAAA,EAAS,GAAA;AAAA,MACT,sBAAsB,SAAS;AAAA,KACjC;AACA,IAAA,IAAI,OAAA,EAAS,UAAU,MAAA,EAAW;AAChC,MAAA,MAAM,IAAA,CAAK,gBAAA,CAAiB,OAAA,EAAS,OAAA,CAAQ,KAAK,CAAA;AAAA,IACpD;AACA,IAAA,OAAO,OAAA;AAAA,EACT;AAAA,EAEA,MAAM,gBAAA,CACJ,KAAA,EACA,KAAA,EACe;AACf,IAAA,MAAM,MAAA,GAAS,MAAM,KAAA,CAAM,kBAAA,CAAmB,KAAK,CAAA;AACnD,IAAA,IAAI,MAAA,CAAO,QAAQ,IAAA,CAAK,CAAC+B,WAAUA,MAAAA,CAAM,MAAA,KAAW,QAAQ,CAAA,EAAG;AAC7D,MAAA,MAAM,IAAI,yBAAA,CAA0B,MAAA,EAAQ,IAAA,CAAK,OAAO,CAAA;AAAA,IAC1D;AAAA,EACF;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,EA0BA,MAAM,cAAA,CACJ,KAAA,EACA,OAAA,EACmB;AACnB,IAAA,OAAO,IAAA,CAAK,sBAAA,CAAuB,KAAA,EAAO,KAAA,EAAO,OAAO,CAAA;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBA,MAAM,gBAAA,CACJ,KAAA,EACA,OAAA,EACmB;AACnB,IAAA,OAAO,IAAA,CAAK,sBAAA,CAAuB,QAAA,EAAU,KAAA,EAAO,OAAO,CAAA;AAAA,EAC7D;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,EA8BA,MAAM,mBACJ,OAAA,EACmC;AACnC,IAAA,MAAM,EAAE,SAAA,EAAW,QAAA,KAAa,MAAM,IAAA,CAAK,cAAc,aAAa,CAAA;AACtE,IAAA,OAAO,kBAAA;AAAA,MACL;AAAA,QACE,KAAA,EAAO,QAAA;AAAA,QACP,SAAS,IAAA,CAAK,OAAA;AAAA,QACd,SAAS,IAAA,CAAK,QAAA;AAAA,QACd,eAAe,SAAA,CAAU;AAAA,OAC3B;AAAA,MACA,WAAW;AAAC,KACd;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBA,MAAM,kBAAA,CACJ,IAAA,EACA,SAAA,EACA,OAAA,EACmC;AAEnC,IAAA,IACE,OAAA,EAAS,SAAA,KAAc,MAAA,KACtB,CAAC,MAAA,CAAO,SAAA,CAAU,OAAA,CAAQ,SAAS,CAAA,IAAK,OAAA,CAAQ,SAAA,IAAa,CAAA,CAAA,EAC9D;AACA,MAAA,MAAM,IAAI,UAAA;AAAA,QACR,CAAA,8DAAA,EAAiE,QAAQ,SAAS,CAAA;AAAA,OACpF;AAAA,IACF;AACA,IAAA,MAAM,EAAE,SAAA,EAAW,QAAA,KAAa,MAAM,IAAA,CAAK,cAAc,SAAS,CAAA;AAClE,IAAA,MAAM,UAAU,IAAA,CAAK,QAAA;AACrB,IAAA,MAAM,WAAW,OAAA,CAAQ,cAAA;AACzB,IAAA,IAAI,QAAA,KAAa,MAAA,IAAa,OAAA,CAAQ,UAAA,KAAe,MAAA,EAAW;AAC9D,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,8EAAA;AAAA,QACA;AAAA,UACE,SAAS,OAAA,CAAQ,OAAA;AAAA,UACjB,UAAA,EAAY,QAAA;AAAA,UACZ,SAAA,EAAW;AAAA;AACb,OACF;AAAA,IACF;AACA,IAAA,MAAM,WAAA,GAAA,CAAe,QAAA,CAAS,OAAA,IAAW,EAAC,EAAG,IAAA;AAAA,MAC3C,CAAC,cACC,SAAA,CAAU,MAAA,KAAW,YACrB,SAAA,CAAU,IAAA,KAAS,IAAA,IACnB,SAAA,CAAU,SAAA,KAAc;AAAA,KAC5B;AACA,IAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,CAAA,oBAAA,EAAuB,IAAI,CAAA,CAAA,EAAI,SAAS,CAAA,mCAAA,CAAA;AAAA,QACxC,EAAE,IAAA,EAAM,SAAA,EAAW,SAAA,EAAW,SAAA;AAAU,OAC1C;AAAA,IACF;AAEA,IAAA,MAAM,IAAA,GAAmB;AAAA,MACvB,SAAS,IAAA,CAAK,OAAA;AAAA,MACd,QAAA,EAAU,IAAA;AAAA,MACV,SAAA;AAAA,MACA,YAAY,WAAA,CAAY,UAAA;AAAA,MACxB,QAAQ,WAAA,CAAY,MAAA;AAAA,MACpB,WAAW,WAAA,CAAY;AAAA,KACzB;AAOA,IAAA,KAAA,MAAW,GAAA,IAAO,QAAA,CAAS,gBAAA,CAAiB,IAAI,CAAA,EAAG;AACjD,MAAA,MAAM,OAAA,CAAQ,WAAW,GAAG,CAAA;AAAA,IAC9B;AACA,IAAA,KAAA,MAAW,YAAA,IAAgB,QAAA,CAAS,WAAA,CAAY,IAAI,CAAA,EAAG;AACrD,MAAA,KAAA,MAAW,GAAA,IAAO,aAAa,SAAA,EAAW;AACxC,QAAA,MAAM,OAAA,CAAQ,WAAW,GAAG,CAAA;AAAA,MAC9B;AAAA,IACF;AAMA,IAAA,MAAM,4BACJ,WAAA,CAAY,SAAA,KAAc,UAC1B,OAAA,CAAQ,YAAA,CAAa,QAAQ,UAAA,CAAW,QAAA;AAAA,MACtC,WAAA,CAAY;AAAA,KACd,KAAM,IAAA;AAKR,IAAA,IAAI,yBAAA,IAA6B,OAAA,CAAQ,iBAAA,KAAsB,MAAA,EAAW;AACxE,MAAA,MAAM,QAAQ,iBAAA,CAAkB;AAAA,QAC9B,SAAS,IAAA,CAAK,OAAA;AAAA,QACd,QAAA,EAAU,IAAA;AAAA,QACV,SAAA;AAAA,QACA,YAAY,WAAA,CAAY,UAAA;AAAA,QACxB,QAAQ,WAAA,CAAY,MAAA;AAAA,QACpB,WAAW,WAAA,CAAY,SAAA;AAAA,QACvB,WAAA,EAAa;AAAA,UACX,CAAA,EAAG,YAAY,WAAA,CAAY,CAAA;AAAA,UAC3B,cAAA,EAAgB,YAAY,WAAA,CAAY,cAAA;AAAA,UACxC,GAAI,WAAA,CAAY,WAAA,CAAY,KAAA,KAAU,MAAA,GACpC,EAAC,GACD,EAAE,KAAA,EAAO,WAAA,CAAY,WAAA,CAAY,KAAA;AAAM;AAC3C,OACD,CAAA;AAAA,IACH;AAIA,IAAA,IACE,yBAAA,IACA,OAAA,CAAQ,0BAAA,KAA+B,MAAA,EACvC;AACA,MAAA,MAAM,YAAY,QAAA,CAAS,SAAA,CAAU,IAAA,CAAK,OAAA,EAAS,MAAM,SAAS,CAAA;AAClE,MAAA,MAAM,YAAY,MAAM,qBAAA;AAAA,QACtB,OAAA,CAAQ,OAAA;AAAA,QACR,SAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,MAAM,MAAM,MAAA,EAAO;AACnB,MAAA,MAAM,QAAQ,0BAAA,CAA2B;AAAA,QACvC,SAAA,EAAW,eAAA,CAAgB,IAAA,CAAK,OAAA,EAAS,YAAY,IAAI,CAAA;AAAA,QACzD,SAAS,IAAA,CAAK,OAAA;AAAA,QACd,MAAA,EAAQ,QAAA;AAAA,QACR,IAAA;AAAA,QACA,SAAA;AAAA,QACA,eAAe,SAAA,CAAU,OAAA;AAAA,QACzB,WAAA,EAAa,GAAA;AAAA,QACb,cAAA,EAAgB,GAAA;AAAA,QAChB,KAAA,EAAO;AAAA,OACR,CAAA;AAAA,IACH;AAEA,IAAA,IAAI,OAAA,EAAS,UAAU,MAAA,EAAW;AAChC,MAAA,OAAO,EAAE,SAAA,EAAW,IAAA,EAAM,UAAA,EAAY,CAAA,EAAE;AAAA,IAC1C;AAEA,IAAA,IAAI,OAAA,CAAQ,oBAAoB,MAAA,EAAW;AACzC,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,+FAAA;AAAA,QACA;AAAA,UACE,SAAS,OAAA,CAAQ,OAAA;AAAA,UACjB,UAAA,EAAY,QAAA;AAAA,UACZ,SAAA,EAAW;AAAA;AACb,OACF;AAAA,IACF;AAIA,IAAA,MAAM,kBAAkB,OAAA,CAAQ,eAAA;AAChC,IAAA,MAAM,SAAA,GAAY,QAAQ,SAAA,IAAa,0BAAA;AACvC,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,wBAAA,CAAyB,IAAI,CAAA;AACrD,IAAA,IAAI,UAAA,GAAa,CAAA;AACjB,IAAA,IAAI,MAAA,GAAS,CAAA;AACb,IAAA,WAAS;AACP,MAAA,MAAM,KAAA,GAAS,MAAM,UAAA,CAAW,IAAA,CAAK;AAAA,QACnC,KAAA,EAAO,SAAA;AAAA,QACP;AAAA,OACD,CAAA;AACD,MAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AACxB,MAAA,MAAM,OAAA,GAAU,MAAM,OAAA,CAAQ,KAAA,CAAM,KAAK,CAAA;AACzC,MAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,QAAA,MAAM,SAAA,GAAY,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AACrC,QAAA,IAAI,cAAc,MAAA,EAAW;AAC7B,QAAA,MAAM,eAAA,CAAgB;AAAA,UACpB,SAAS,IAAA,CAAK,OAAA;AAAA,UACd,QAAA,EAAU,IAAA;AAAA,UACV,QAAQ,IAAA,CAAK,EAAA;AAAA,UACb,SAAA;AAAA,UACA,SAAA;AAAA,UACA,YAAY,WAAA,CAAY,UAAA;AAAA,UACxB,QAAQ,WAAA,CAAY,MAAA;AAAA,UACpB,WAAW,WAAA,CAAY;AAAA,SACxB,CAAA;AACD,QAAA,UAAA,IAAc,CAAA;AAAA,MAChB;AACA,MAAA,MAAA,IAAU,KAAA,CAAM,MAAA;AAChB,MAAA,IAAI,KAAA,CAAM,SAAS,SAAA,EAAW;AAAA,IAChC;AACA,IAAA,OAAO,EAAE,SAAA,EAAW,IAAA,EAAM,UAAA,EAAW;AAAA,EACvC;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,EAgCA,MAAM,WAAA,CACJ,KAAA,EACA,OAAA,EAImB;AACnB,IAAA,MAAM,EAAE,SAAA,EAAW,QAAA,KAAa,MAAM,IAAA,CAAK,cAAc,QAAQ,CAAA;AACjE,IAAA,MAAM,IAAA,GAAO,YAAA,CAAa,QAAA,EAAU,KAAK,CAAA;AAIzC,IAAA,IACE,KAAK,gBAAA,CAAiB,MAAA,KAAW,KACjC,IAAA,CAAK,gBAAA,CAAiB,WAAW,CAAA,EACjC;AACA,MAAA,IAAI,QAAA,KAAa,KAAK,MAAA,EAAQ;AAC5B,QAAA,IAAI,OAAA,EAAS,GAAA,KAAQ,MAAA,EAAW,OAAA,CAAQ,IAAI,OAAA,GAAU,IAAA;AACtD,QAAA,OAAO,IAAA;AAAA,MACT;AACA,MAAA,OAAO,IAAA,CAAK,eAAA;AAAA,QACV,QAAA;AAAA,QACA,OAAA,EAAS,GAAA;AAAA,QACT,sBAAsB,SAAS;AAAA,OACjC;AAAA,IACF;AAOA,IAAA,MAAM,gBAAA,GAAmB,mBAAA,CAAoB,IAAA,CAAK,MAAM,CAAA;AACxD,IAAA,MAAM,MAAA,GACJ,KAAK,QAAA,KAAa,MAAA,GAChB,mBACA,mBAAA,CAAoB,gBAAA,EAAkB,KAAK,QAAQ,CAAA;AACvD,IAAA,MAAM,UAAA,GAAa,oBAAA,CAAqB,MAAA,EAAQ,QAAA,CAAS,eAAe,CAAA;AAQxE,IAAA,MAAM,eAAe,MAAM,sBAAA;AAAA,MACzB,IAAA,CAAK,QAAA;AAAA,MACL,UAAA;AAAA,MACA,SAAA,CAAU;AAAA,KACZ;AAOA,IAAA,MAAM,iBAAA,GAAoB,KAAK,QAAA,CAAS,iBAAA;AACxC,IAAA,IAAI,sBAAsB,MAAA,EAAW;AACnC,MAAA,IAAI,IAAA,CAAK,QAAA,CAAS,uBAAA,KAA4B,MAAA,EAAW;AACvD,QAAA,MAAM,IAAA,CAAK,SAAS,uBAAA,EAAwB;AAAA,MAC9C;AACA,MAAA,MAAM,cAAc,MAAA,EAAO;AAC3B,MAAA,MAAM,mBAAmB,YAAA,CAAa,OAAA;AACtC,MAAA,MAAM,KAAA,GAAQ,CAAC,QAAA,EAAkB,MAAA,KAC/B,iBAAA;AAAA,QACE,uBAAA,CAAwB;AAAA,UACtB,SAAS,IAAA,CAAK,OAAA;AAAA,UACd,QAAA;AAAA,UACA,MAAA;AAAA,UACA,aAAA,EAAe,gBAAA;AAAA,UACf;AAAA,SACD;AAAA,OACH;AAIF,MAAA,MAAM,QAAQ,GAAA,CAAI;AAAA,QAChB,GAAG,KAAK,gBAAA,CAAiB,GAAA,CAAI,CAAC,IAAA,KAAS,KAAA,CAAM,IAAA,EAAM,MAAM,CAAC,CAAA;AAAA,QAC1D,GAAG,KAAK,gBAAA,CAAiB,GAAA,CAAI,CAAC,IAAA,KAAS,KAAA,CAAM,IAAA,EAAM,MAAM,CAAC;AAAA,OAC3D,CAAA;AAAA,IACH;AAEA,IAAA,MAAM,UAAU,IAAA,CAAK,eAAA;AAAA,MACnB,UAAA;AAAA,MACA,OAAA,EAAS,GAAA;AAAA,MACT,sBAAsB,YAAY;AAAA,KACpC;AACA,IAAA,IAAI,OAAA,EAAS,UAAU,MAAA,EAAW;AAGhC,MAAA,MAAM,QAAQ,CAAC,GAAG,KAAK,gBAAA,EAAkB,GAAG,KAAK,gBAAgB,CAAA;AACjE,MAAA,MAAM,QAAQ,mBAAA,CAAoB;AAAA,QAChC,GAAG,OAAA,CAAQ,KAAA;AAAA,QACX,KAAA,EAAO,OAAA,CAAQ,KAAA,CAAM,KAAA,IAAS;AAAA,OAC/B,CAAA;AAAA,IACH;AACA,IAAA,OAAO,OAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,oBACJ,OAAA,EACoC;AACpC,IAAA,OAAO,mBAAA;AAAA,MACL,EAAE,OAAA,EAAS,IAAA,CAAK,OAAA,EAAS,OAAA,EAAS,KAAK,QAAA,EAAS;AAAA,MAChD,WAAW;AAAC,KACd;AAAA,EACF;AAAA,EAEA,MAAM,sBAAA,CACJ,SAAA,EACA,KAAA,EACA,OAAA,EACmB;AACnB,IAAA,MAAM,IAAA,GAAO,SAAA,KAAc,KAAA,GAAQ,WAAA,GAAc,aAAA;AACjD,IAAA,MAAM,EAAE,WAAW,YAAA,EAAc,QAAA,KAC/B,MAAM,IAAA,CAAK,cAAc,IAAI,CAAA;AAC/B,IAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,QAAA,CAAS,eAAe,CAAA;AAEhD,IAAA,IAAI,cAAc,KAAA,EAAO;AACvB,MAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,QAAA,IAAI,CAAC,WAAA,CAAY,QAAA,EAAU,IAAI,CAAA,EAAG;AAKhC,UAAA,MAAM,IAAI,iBAAA;AAAA,YACR,IAAA;AAAA,YACA,eAAA,CAAgB,QAAA,EAAU,IAAI,CAAA,GAAI,MAAA,GAAS,MAAA;AAAA,YAC3C;AAAA,cACE,SAAS,IAAA,CAAK,OAAA;AAAA,cACd,UAAA,EACE;AAAA;AACJ,WACF;AAAA,QACF;AACA,QAAA,OAAA,CAAQ,IAAI,IAAI,CAAA;AAAA,MAClB;AAAA,IACF,CAAA,MAAO;AACL,MAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,EAAO,OAAA,CAAQ,MAAA,CAAO,IAAI,CAAA;AAAA,IAC/C;AAEA,IAAA,IAAI,SAAA,CAAU,OAAA,EAAS,QAAA,CAAS,eAAe,CAAA,EAAG;AAMhD,MAAA,IAAI,QAAA,KAAa,KAAK,MAAA,EAAQ;AAC5B,QAAA,IAAI,OAAA,EAAS,GAAA,KAAQ,MAAA,EAAW,OAAA,CAAQ,IAAI,OAAA,GAAU,IAAA;AACtD,QAAA,OAAO,IAAA;AAAA,MACT;AACA,MAAA,OAAO,IAAA,CAAK,eAAA;AAAA,QACV,QAAA;AAAA,QACA,OAAA,EAAS,GAAA;AAAA,QACT,sBAAsB,SAAS;AAAA,OACjC;AAAA,IACF;AAEA,IAAA,MAAM,MAAA,GAAS,oBAAA,CAAqB,QAAA,EAAU,OAAO,CAAA;AACrD,IAAA,MAAM,MAAA,GAAS,MAAM,YAAA,CAAiB,IAAA,CAAK,UAAU,MAAA,EAAQ;AAAA,MAC3D,SAAA,EAAW,EAAE,SAAA,EAAW,YAAA,EAAa;AAAA,MACrC,WAAA,EAAa;AAAA,KACd,CAAA;AAKD,IAAA,MAAM,QAAA,GACJ,MAAA,CAAO,MAAA,KAAW,UAAA,IAAc,MAAA,CAAO,MAAA,KAAW,aAAA,GAChD,qBAAA,CAAsB,MAAA,CAAO,YAAY,CAAA,GACzC,qBAAA,CAAsB,SAAS,CAAA;AACnC,IAAA,OAAO,IAAA,CAAK,eAAA,CAAgB,MAAA,EAAQ,OAAA,EAAS,KAAK,QAAQ,CAAA;AAAA,EAC5D;AAAA,EAEA,iBAAiB,YAAA,EAAmC;AAQlD,IAAA,MAAM,gBAAA,GAAmB,mBAAA,CAAoB,IAAA,CAAK,MAAM,CAAA;AACxD,IAAA,MAAM,kBAAA,GACJ,aAAa,SAAA,KAAc,MAAA,GACzB,mBACA,mBAAA,CAAoB,gBAAA,EAAkB,aAAa,SAAS,CAAA;AAChE,IAAA,OAAO,oBAAA;AAAA,MACL,kBAAA;AAAA,MACA,YAAA,CAAa;AAAA,KACf;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,MAAM,cAAc,IAAA,EAIjB;AACD,IAAA,MAAM,YAAY,MAAM,6BAAA;AAAA,MACtB,IAAA,CAAK,QAAA;AAAA,MACL,IAAA,CAAK;AAAA,KACP;AACA,IAAA,IAAI,cAAc,MAAA,EAAW;AAC3B,MAAA,MAAM,EAAE,MAAA,EAAQ,IAAA,EAAK,GAAI,uBAAuB,IAAI,CAAA;AACpD,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,CAAA,OAAA,EAAU,MAAM,CAAA,QAAA,EAAW,IAAA,CAAK,OAAO,CAAA,oEAAA,CAAA;AAAA,QACvC,EAAE,IAAA;AAAK,OACT;AAAA,IACF;AACA,IAAA,MAAM,YAAA,GAAe,qBAAA,CAAsB,SAAA,CAAU,UAAU,CAAA;AAC/D,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,gBAAA,CAAiB,YAAY,CAAA;AACnD,IAAA,OAAO,EAAE,SAAA,EAAW,YAAA,EAAc,QAAA,EAAS;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAoBA,MAAM,iBACJ,YAAA,EACiC;AACjC,IAAA,MAAM,SAAS,YAAA,CAAa,GAAA;AAAA,MAC1B,OAAOA,MAAAA,KAAyD;AAC9D,QAAA,MAAMsB,SACJtB,MAAAA,CAAM,MAAA,KAAW,SACf,MAAM,IAAA,CAAK,SAAS,gBAAA,CAAiB;AAAA,UACnC,SAAS,IAAA,CAAK,OAAA;AAAA,UACd,MAAMA,MAAAA,CAAM;AAAA,SACb,CAAA,GACD,MAAM,IAAA,CAAK,SAAS,gBAAA,CAAiB;AAAA,UACnC,SAAS,IAAA,CAAK,OAAA;AAAA,UACd,MAAMA,MAAAA,CAAM;AAAA,SACb,CAAA;AACL,QAAA,OAAO,CAACA,QAAOsB,MAAK,CAAA;AAAA,MACtB;AAAA,KACF;AACA,IAAA,MAAM,OAAA,GAAU,MAAM,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAA;AACxC,IAAA,MAAM,QAAA,uBAAe,GAAA,EAAuB;AAC5C,IAAA,KAAA,MAAW,CAACtB,MAAAA,EAAOsB,MAAK,CAAA,IAAK,OAAA,EAAS;AACpC,MAAA,IAAIA,MAAAA,GAAQ,CAAA,EAAG,QAAA,CAAS,GAAA,CAAItB,MAAK,CAAA;AAAA,IACnC;AACA,IAAA,OAAO,QAAA;AAAA,EACT;AAAA,EAEA,eAAA,CACE,KAAA,EACA,GAAA,EACA,cAAA,GAAsC,KAAK,eAAA,EACjC;AACV,IAAA,MAAM,IAAA,GAAO,IAAI,MAAA,CAAM,KAAA,EAAO,KAAK,QAAA,EAAU,IAAA,CAAK,UAAU,cAAc,CAAA;AAC1E,IAAA,IAAI,GAAA,KAAQ,MAAA,EAAW,GAAA,CAAI,OAAA,GAAU,IAAA;AACrC,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,KAAA,GAAuB;AAC3B,IAAA,MAAM,IAAA,CAAK,SAAS,KAAA,EAAM;AAAA,EAC5B;AAAA;AAAA,EAIA,2BAAA,GAAuD;AACrD,IAAA,OAAO;AAAA,MACL,OAAO,IAAA,CAAK,MAAA;AAAA,MACZ,SAAS,IAAA,CAAK,OAAA;AAAA,MACd,UAAU,IAAA,CAAK,SAAA;AAAA,MACf,sBAAA,EAAwB,CAAC,SAAA,EAAW,MAAA,EAAQ,IAAA,EAAM,EAAA,KAChD,IAAA,CAAK,uBAAA,CAAwB,SAAA,EAAW,MAAA,EAAQ,IAAA,EAAM,EAAE,CAAA;AAAA,MAC1D,oBAAoB,CAClB,GAAA,EACA,OACG,IAAA,CAAK,mBAAA,CAAoB,KAAK,EAAE;AAAA,KACvC;AAAA,EACF;AAAA,EAEA,2BAAA,GAAuD;AACrD,IAAA,OAAO;AAAA,MACL,OAAO,IAAA,CAAK,MAAA;AAAA,MACZ,SAAS,IAAA,CAAK,OAAA;AAAA,MACd,UAAU,IAAA,CAAK,SAAA;AAAA,MACf,sBAAA,EAAwB,CAAC,SAAA,EAAW,MAAA,EAAQ,IAAA,EAAM,EAAA,KAChD,IAAA,CAAK,uBAAA,CAAwB,SAAA,EAAW,MAAA,EAAQ,IAAA,EAAM,EAAE,CAAA;AAAA,MAC1D,oBAAoB,CAClB,GAAA,EACA,OACG,IAAA,CAAK,mBAAA,CAAoB,KAAK,EAAE;AAAA,KACvC;AAAA,EACF;AAAA;AAAA,EAIA,kBAAA,GAAkC;AAChC,IAAA,OAAO;AAAA,MACL,aAAa,UAAA,EAAW;AAAA,MACxB,SAAS,IAAA,CAAK,OAAA;AAAA,MACd,SAAA,sBAAe,IAAA;AAAK,KACtB;AAAA,EACF;AAAA,EAEA,uBAAA,CACE,SAAA,EACA,MAAA,EACA,IAAA,EACA,EAAA,EACsB;AACtB,IAAA,OAAO;AAAA,MACL,GAAG,KAAK,kBAAA,EAAmB;AAAA,MAC3B,SAAA;AAAA,MACA,MAAA;AAAA,MACA,IAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAAA,EAEA,MAAM,mBAAA,CACJ,GAAA,EACA,EAAA,EACY;AACZ,IAAA,IAAA,CAAK,MAAA,CAAO,mBAAmB,GAAG,CAAA;AAClC,IAAA,MAAM,SAAA,GAAY,KAAK,GAAA,EAAI;AAC3B,IAAA,IAAI;AACF,MAAA,MAAM,MAAA,GAAS,MAAM,EAAA,EAAG;AACxB,MAAA,IAAA,CAAK,MAAA,CAAO,iBAAiB,GAAA,EAAK;AAAA,QAChC,UAAA,EAAY,IAAA,CAAK,GAAA,EAAI,GAAI;AAAA,OAC1B,CAAA;AACD,MAAA,OAAO,MAAA;AAAA,IACT,SAAS,KAAA,EAAO;AACd,MAAA,IAAA,CAAK,MAAA,CAAO,OAAA;AAAA,QACV,GAAA;AAAA,QACA,iBAAiB,KAAA,GAAQ,KAAA,GAAQ,IAAI,KAAA,CAAM,MAAA,CAAO,KAAK,CAAC;AAAA,OAC1D;AACA,MAAA,MAAM,KAAA;AAAA,IACR;AAAA,EACF;AAAA;AAAA,EAIA,oBAAoB,OAAA,EAMP;AAMX,IAAA,MAAM,EAAE,YAAA,EAAc,IAAA,EAAK,GAAI,yBAAA;AAAA,MAC7B,OAAA;AAAA,MACA,IAAA,CAAK,OAAO,QAAA,CAAS;AAAA,KACvB;AAEA,IAAA,OAAO,CAAC,GAAA,KAAQ;AACd,MAAA,QAAQ,YAAA;AAAc,QACpB,KAAK,SAAA;AAAA,QACL,KAAK,MAAA,EAAQ;AAEX,UAAA,IAAI,GAAA,CAAI,YAAY,OAAO,KAAA;AAC3B,UAAA,IAAI,IAAA,KAAS,MAAA,IAAa,GAAA,CAAI,UAAA,IAAc,OAAO,GAAA,CAAI,UAAA;AACrD,YAAA,OAAO,KAAA;AACT,UAAA,IAAI,IAAA,KAAS,MAAA,IAAa,GAAA,CAAI,QAAA,IAAY,QAAQ,GAAA,CAAI,QAAA;AACpD,YAAA,OAAO,KAAA;AACT,UAAA,OAAO,IAAA;AAAA,QACT;AAAA,QACA,KAAK,cAAA,EAAgB;AACnB,UAAA,OAAO,CAAC,GAAA,CAAI,UAAA;AAAA,QACd;AAAA,QACA,KAAK,mBAAA,EAAqB;AACxB,UAAA,OAAO,IAAA;AAAA,QACT;AAAA;AACF,IACF,CAAA;AAAA,EACF;AAAA,EAEA,sBAAA,CACE,SACA,gBAAA,EACiB;AACjB,IAAA,OAAO,kBAAA,CAAsB,IAAA,CAAK,OAAA,EAAS,IAAA,CAAK,SAAA,EAAW;AAAA;AAAA;AAAA,MAGzD,OAAA;AAAA,MACA,SAAS,OAAA,CAAQ,OAAA;AAAA,MACjB,2BAA2B,IAAA,CAAK,0BAAA;AAAA,MAChC,GAAI,IAAA,CAAK,OAAA,KAAY,UAAa,EAAE,MAAA,EAAQ,KAAK,OAAA,EAAQ;AAAA,MACzD,GAAI,gBAAA,KAAqB,MAAA,IAAa,EAAE,gBAAA;AAAiB,KAC1D,CAAA;AAAA,EACH;AACF,CAAA;AAmCO,SAAS,WAAA,CACd,KAAA,EACA,OAAA,EACA,OAAA,EACU;AACV,EAAA,OAAO,IAAI,KAAA,CAAM,KAAA,EAAO,OAAA,EAAS,OAAO,CAAA;AAC1C;AAEA,SAAS,eAAA,CAAgB,OAAiB,IAAA,EAAuB;AAC/D,EAAA,OAAO,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,KAAA,EAAO,IAAI,CAAA;AACxC;AAEA,SAAS,SAAA,CAAU,GAAwB,CAAA,EAAiC;AAC1E,EAAA,IAAI,CAAA,CAAE,IAAA,KAAS,CAAA,CAAE,IAAA,EAAM,OAAO,KAAA;AAC9B,EAAA,KAAA,MAAW,KAAA,IAAS,GAAG,IAAI,CAAC,EAAE,GAAA,CAAI,KAAK,GAAG,OAAO,KAAA;AACjD,EAAA,OAAO,IAAA;AACT;AAEA,SAAS,sBACP,GAAA,EACqB;AACrB,EAAA,IAAI,GAAA,KAAQ,QAAW,OAAO,uBAAA;AAC9B,EAAA,OAAO,OAAO,MAAA,CAAO;AAAA,IACnB,eAAe,GAAA,CAAI,OAAA;AAAA,IACnB,YAAY,GAAA,CAAI;AAAA,GACjB,CAAA;AACH;AAEA,SAAS,uBAAA,CACP,WACA,MAAA,EACqB;AACrB,EAAA,IAAI,MAAA,CAAO,MAAA,KAAW,aAAA,IAAiB,MAAA,CAAO,WAAW,UAAA,EAAY;AACnE,IAAA,OAAO,qBAAA,CAAsB,OAAO,YAAY,CAAA;AAAA,EAClD;AACA,EAAA,OAAO,sBAAsB,SAAS,CAAA;AACxC;AAQA,eAAe,+BAAA,CACb,SACA,OAAA,EACe;AACf,EAAA,IAAI,QAAQ,0BAAA,EAA4B;AACtC,IAAA,MAAM,OAAA,CAAQ,2BAA2B,OAAO,CAAA;AAChD,IAAA;AAAA,EACF;AACA,EAAA,MAAM,OAAA,CAAQ,sBAAsB,OAAO,CAAA;AAC7C;AAwCA,eAAsB,qBAAA,CACpB,KAAA,EACA,OAAA,EACA,OAAA,EAC6C;AAO7C,EAAA,MAAM;AAAA,IACJ,KAAA,EAAO,MAAA;AAAA,IACP,SAAA;AAAA,IACA;AAAA,GACF,GAAI,MAAM,kCAAA,CAAmC,OAAA,EAAS,KAAK,CAAA;AAE3D,EAAA,MAAM,MAAA,GAAS,MAAM,YAAA,CAAiB,OAAA,EAAS,MAAA,EAAQ;AAAA,IACrD,GAAG,OAAA;AAAA,IACH,SAAA,EAAW,EAAE,SAAA,EAAW,YAAA;AAAa,GACtC,CAAA;AAMD,EAAA,MAAM,+BAAA,CAAgC,OAAA,EAAS,MAAA,CAAO,EAAE,CAAA;AAExD,EAAA,MAAM,QAAQ,IAAI,KAAA;AAAA,IAChB,MAAA;AAAA,IACA,OAAA;AAAA,IACA,OAAA;AAAA,IACA,uBAAA,CAAwB,WAAW,MAAM;AAAA,GAC3C;AACA,EAAA,OAAO,CAAC,OAAO,MAAM,CAAA;AACvB;AA2CA,eAAsB,mBAAA,CACpB,KAAA,EACA,OAAA,EACA,OAAA,EAC6C;AAC7C,EAAA,MAAM;AAAA,IACJ,KAAA,EAAO,MAAA;AAAA,IACP,SAAA;AAAA,IACA;AAAA,GACF,GAAI,MAAM,kBAAA,CAAmB,OAAA,EAAS,KAAK,CAAA;AAC3C,EAAA,MAAM,QAAQ,IAAI,KAAA;AAAA,IAChB,MAAA;AAAA,IACA,OAAA;AAAA,IACA,OAAA;AAAA,IACA,sBAAsB,SAAS;AAAA,GACjC;AACA,EAAA,OAAO,CAAC,OAAO,MAAM,CAAA;AACvB","file":"chunk-WNORITK6.js","sourcesContent":["/**\n * Shared temporal coordinate + validation.\n */\nimport { ValidationError } from \"../errors\";\nimport { validateCanonicalIsoDate } from \"../utils/date\";\nimport { type TemporalMode } from \"./types\";\n\n/**\n * The single opaque temporal coordinate every pinned read is resolved\n * against. Today it carries only the valid-time axis; Unit 2 adds a sibling\n * `recorded` axis here, and because every surface injects the coordinate\n * through one helper ({@link withCoordinate}), a new axis lands on all\n * surfaces at once instead of splitting by surface.\n */\nexport type ReadCoordinate = Readonly<{\n  /**\n   * The valid-time axis: a resolved temporal mode and (only for `\"asOf\"`) the\n   * instant it is pinned to.\n   */\n  valid: Readonly<{\n    mode: TemporalMode;\n    /** Defined only when `mode` is `\"asOf\"`. */\n    asOf?: string;\n  }>;\n  // Unit 2 (recorded / system time): recorded?: Readonly<{ asOf?: string }>;\n}>;\n\n/**\n * Resolves and validates a `(mode, asOf)` pair into a {@link ReadCoordinate}.\n * Rejects an `asOf` paired with any non-`\"asOf\"` mode rather than silently\n * dropping it — pinning an instant is only meaningful in `\"asOf\"` mode, so a\n * `view({ mode: \"current\", asOf })` is a caller mistake, not a coordinate to\n * quietly discard. Then validates via {@link assertValidAsOf}.\n *\n * @param mode - The temporal mode to pin.\n * @param asOf - The supplied timestamp. Required for `\"asOf\"`; rejected for\n *   every other mode.\n * @param suggestion - Caller-specific remediation hint for the\n *   missing/invalid-timestamp case.\n */\nexport function resolveReadCoordinate(\n  mode: TemporalMode,\n  asOf: string | undefined,\n  suggestion?: string,\n): ReadCoordinate {\n  if (mode !== \"asOf\" && asOf !== undefined) {\n    throw new ValidationError(\n      `Temporal mode \"${mode}\" does not take an asOf timestamp.`,\n      {\n        issues: [\n          {\n            path: \"asOf\",\n            message: `asOf is only valid with mode \"asOf\", not \"${mode}\"`,\n          },\n        ],\n      },\n      {\n        suggestion:\n          'Pin an instant with store.asOf(timestamp) or store.view({ mode: \"asOf\", asOf }); drop asOf for other modes.',\n      },\n    );\n  }\n  assertValidAsOf(\n    mode,\n    asOf,\n    suggestion === undefined ? undefined : { suggestion },\n  );\n  return { valid: asOf === undefined ? { mode } : { mode, asOf } };\n}\n\n/**\n * Validates the `asOf` coordinate of a temporal read: `\"asOf\"` mode\n * requires a timestamp, and any supplied timestamp must be a canonical\n * fixed-width UTC ISO-8601 string (`YYYY-MM-DDTHH:mm:ss.sssZ`). The latter\n * is load-bearing — temporal filters compare `asOf` against `valid_from` /\n * `valid_to` as text on SQLite, so a non-canonical value (date-only, an\n * offset, natural language, or variable-width / missing milliseconds like\n * `.1Z`) would sort and compare wrong rather than error. Reached only through\n * {@link resolveReadCoordinate}, which every temporal read entry point routes\n * through (direct reads, queries, subgraphs, algorithms, and StoreView), so\n * they all fail identically.\n *\n * @param mode - The resolved temporal mode.\n * @param asOf - The supplied timestamp (may be `undefined`).\n * @param options.suggestion - A caller-specific remediation hint for the\n *   missing-timestamp case.\n *\n * @throws {ValidationError} when `mode` is `\"asOf\"` and `asOf` is missing, or\n *   when any supplied `asOf` is not a canonical UTC ISO-8601 timestamp. The\n *   canonical check runs for *every* mode that consumes `asOf`, so a\n *   non-canonical value can never reach a text comparison.\n */\nfunction assertValidAsOf(\n  mode: TemporalMode,\n  asOf: string | undefined,\n  options?: Readonly<{ suggestion?: string }>,\n): void {\n  if (mode === \"asOf\" && asOf === undefined) {\n    throw new ValidationError(\n      'Temporal mode \"asOf\" requires a timestamp',\n      {\n        issues: [\n          { path: \"asOf\", message: \"Timestamp is required for asOf mode\" },\n        ],\n      },\n      {\n        suggestion:\n          options?.suggestion ??\n          'Provide an ISO-8601 timestamp for asOf mode, e.g. \"2026-01-01T00:00:00.000Z\".',\n      },\n    );\n  }\n  if (asOf !== undefined) {\n    validateCanonicalIsoDate(asOf, \"asOf\");\n  }\n}\n\n/**\n * A human-readable description of a coordinate for error messages, e.g.\n * `mode \"current\"` or `mode \"asOf\" asOf 2026-01-01T00:00:00.000Z`. Shared by\n * every refusal path (the `StoreView` read-only / current-only / search facades\n * and the sealed-query builder) so they describe a coordinate identically — and\n * a future axis (recorded time) is reflected everywhere from one place.\n */\nexport function describeCoordinate(coordinate: ReadCoordinate): string {\n  const { mode, asOf } = coordinate.valid;\n  return asOf === undefined ? `mode \"${mode}\"` : `mode \"${mode}\" asOf ${asOf}`;\n}\n\n/**\n * The structured error-context fields describing a coordinate, shared by the\n * same refusal paths as {@link describeCoordinate}.\n */\nexport function coordinateContext(\n  coordinate: ReadCoordinate,\n): Record<string, unknown> {\n  const { mode, asOf } = coordinate.valid;\n  return { temporalMode: mode, ...(asOf !== undefined && { asOf }) };\n}\n","/**\n * Shared temporal read-parameter resolution for collection reads.\n */\nimport {\n  type ReadCoordinate,\n  resolveReadCoordinate,\n} from \"../../core/temporal\";\nimport { type TemporalMode } from \"../../core/types\";\nimport { nowIso } from \"../../utils/date\";\nimport { type QueryOptions } from \"../types\";\n\n/**\n * Flattens a {@link ReadCoordinate} into the `QueryOptions` temporal argument\n * every pinned read accepts. The single point that knows the wire shape of the\n * temporal axis: a `StoreView` injects its coordinate by passing this as a\n * read's trailing temporal argument (or spreading it into an algorithm /\n * subgraph option object). When a new axis (recorded time) is added to\n * {@link ReadCoordinate}, only this function and the backend params change —\n * never the call sites.\n */\nexport function withCoordinate(coordinate: ReadCoordinate): QueryOptions {\n  const { mode, asOf } = coordinate.valid;\n  return asOf === undefined ?\n      { temporalMode: mode }\n    : { temporalMode: mode, asOf };\n}\n\n/**\n * The temporal slice of a `findNodesByKind` / `findEdgesByKind` /\n * `count*` parameter object.\n */\nexport type TemporalReadParams = Readonly<{\n  excludeDeleted: boolean;\n  temporalMode: TemporalMode;\n  asOf?: string;\n}>;\n\n/**\n * Resolves the temporal portion of a collection read's backend params:\n * the per-call `temporalMode` wins, falling back to the graph default;\n * soft-deletes are excluded except under `includeTombstones`. An `asOf` is\n * rejected unless the mode is `\"asOf\"` (via {@link resolveReadCoordinate}), so\n * a pinned `current + asOf` is a caller error here exactly as it is on the\n * query, subgraph, algorithm, and StoreView paths — never a silent pin. The\n * backend filter still needs a concrete instant for `current`, so this defaults\n * it to \"now\" once the coordinate is validated.\n *\n * Single source of truth for `find` / `count` / endpoint reads across the\n * node and edge collections, so the resolution rules cannot drift between\n * them.\n */\nexport function resolveTemporalReadParams(\n  options: Readonly<{ temporalMode?: TemporalMode; asOf?: string }> | undefined,\n  defaultTemporalMode: TemporalMode,\n): TemporalReadParams {\n  const { valid } = resolveReadCoordinate(\n    options?.temporalMode ?? defaultTemporalMode,\n    options?.asOf,\n  );\n  const { mode, asOf } = valid;\n  const base = {\n    excludeDeleted: mode !== \"includeTombstones\",\n    temporalMode: mode,\n  } as const;\n  if (mode === \"current\" || mode === \"asOf\") {\n    return { ...base, asOf: asOf ?? nowIso() };\n  }\n  return base;\n}\n","/**\n * Store types for TypeGraph operations.\n */\nimport { type z } from \"zod\";\n\nimport {\n  type AdoptedTransaction,\n  type EdgeRow,\n  type NodeRow,\n  type TransactionBackend,\n} from \"../backend/types\";\nimport { type GraphDef } from \"../core/define-graph\";\nimport {\n  type AnyEdgeType,\n  type EdgeId,\n  type EdgeRegistration,\n  type EdgeType,\n  type KindEntity,\n  type NodeId,\n  type NodeRegistration,\n  type NodeType,\n  type TemporalMode,\n} from \"../core/types\";\nimport type { TraversalExpansion } from \"../query/ast\";\nimport type { BatchableQuery, NodeAccessor } from \"../query/builder/types\";\nimport { type SqlSchema } from \"../query/compiler/schema\";\nimport type { Predicate } from \"../query/predicates\";\n\n// ============================================================\n// Row-to-Meta Field Mapping\n// ============================================================\n\n/**\n * Canonical mapping from snake_case row fields to camelCase meta fields.\n *\n * This is the single source of truth for which row columns become metadata.\n * Both the Meta types and the row-to-meta functions in row-mappers.ts must\n * stay in sync with this mapping. If you add a temporal/audit column to a\n * row type, add the mapping here — the compiler will then force you to\n * update the row mapper functions as well (since their return type is\n * NodeMeta/EdgeMeta, which is derived from this mapping).\n */\ntype TemporalMetaFieldMap = Readonly<{\n  valid_from: \"validFrom\";\n  valid_to: \"validTo\";\n  created_at: \"createdAt\";\n  updated_at: \"updatedAt\";\n  deleted_at: \"deletedAt\";\n}>;\n\n/**\n * Maps row fields to their camelCase meta counterparts, preserving types.\n */\ntype MapRowToMeta<\n  R extends Readonly<Record<string, unknown>>,\n  M extends Readonly<Record<string, string>>,\n> = Readonly<{\n  [SnakeKey in keyof M as M[SnakeKey] & string]: SnakeKey extends keyof R ?\n    R[SnakeKey]\n  : never;\n}>;\n\n// ============================================================\n// Node Instance Types\n// ============================================================\n\n/**\n * Metadata for a node instance.\n * Derived from NodeRow via TemporalMetaFieldMap + version.\n *\n * Adding a new metadata column requires:\n * 1. Add the column to NodeRow in backend/types.ts\n * 2. Add the mapping to TemporalMetaFieldMap above\n * 3. The compiler will error in rowToNodeMeta() until you add the field there\n */\nexport type NodeMeta = MapRowToMeta<NodeRow, TemporalMetaFieldMap> &\n  Readonly<{ version: NodeRow[\"version\"] }>;\n\n/**\n * A node instance in the graph.\n *\n * Properties from the schema are spread at the top level for ergonomic access:\n * - `node.name` instead of `node.props.name`\n * - System metadata is under `node.meta.*`\n */\nexport type Node<N extends NodeType = NodeType> = Readonly<{\n  kind: N[\"kind\"];\n  id: NodeId<N>;\n  meta: NodeMeta;\n}> &\n  Readonly<z.infer<N[\"schema\"]>>;\n\n/**\n * Input for creating a node.\n */\nexport type CreateNodeInput<N extends NodeType = NodeType> = Readonly<{\n  kind: N[\"kind\"];\n  id?: string; // Optional - will generate ULID if not provided\n  props: z.infer<N[\"schema\"]>;\n  validFrom?: string;\n  validTo?: string;\n}>;\n\n/**\n * Input for updating a node.\n */\nexport type UpdateNodeInput<N extends NodeType = NodeType> = Readonly<{\n  kind: N[\"kind\"];\n  id: NodeId<N>;\n  props: Partial<z.infer<N[\"schema\"]>>;\n  validTo?: string;\n}>;\n\n// ============================================================\n// Edge Instance Types\n// ============================================================\n\n/**\n * Metadata for an edge instance.\n * Derived from EdgeRow via TemporalMetaFieldMap (edges have no version).\n */\nexport type EdgeMeta = MapRowToMeta<EdgeRow, TemporalMetaFieldMap>;\n\n/**\n * An edge instance in the graph.\n *\n * Properties from the schema are spread at the top level for ergonomic access:\n * - `edge.role` instead of `edge.props.role`\n * - System metadata is under `edge.meta.*`\n */\nexport type Edge<\n  E extends AnyEdgeType = EdgeType,\n  From extends NodeType = NodeType,\n  To extends NodeType = NodeType,\n> = Readonly<{\n  id: EdgeId<E>;\n  kind: E[\"kind\"];\n  fromKind: From[\"kind\"];\n  fromId: NodeId<From>;\n  toKind: To[\"kind\"];\n  toId: NodeId<To>;\n  meta: EdgeMeta;\n}> &\n  Readonly<z.infer<E[\"schema\"]>>;\n\n/**\n * Input for creating an edge.\n */\nexport type CreateEdgeInput<E extends AnyEdgeType = EdgeType> = Readonly<{\n  kind: E[\"kind\"];\n  id?: string; // Optional - will generate ULID if not provided\n  fromKind: string;\n  fromId: string;\n  toKind: string;\n  toId: string;\n  props: z.infer<E[\"schema\"]>;\n  validFrom?: string;\n  validTo?: string;\n}>;\n\n/**\n * Input for updating an edge.\n */\nexport type UpdateEdgeInput<E extends AnyEdgeType = EdgeType> = Readonly<{\n  id: EdgeId<E>;\n  props: Partial<z.infer<E[\"schema\"]>>;\n  validTo?: string;\n}>;\n\n// ============================================================\n// Query Options\n// ============================================================\n\n/**\n * Options for node and edge queries.\n */\nexport type QueryOptions = Readonly<{\n  /** Temporal mode for the query */\n  temporalMode?: TemporalMode;\n  /** Specific timestamp for asOf queries */\n  asOf?: string;\n}>;\n\n// ============================================================\n// Observability Hooks\n// ============================================================\n\n/**\n * Context passed to observability hooks.\n */\nexport type HookContext = Readonly<{\n  /** Unique ID for this operation */\n  operationId: string;\n  /** Graph ID */\n  graphId: string;\n  /** Timestamp when operation started */\n  startedAt: Date;\n}>;\n\n/**\n * Query hook context with SQL information.\n */\nexport type QueryHookContext = HookContext &\n  Readonly<{\n    /** The SQL query being executed */\n    sql: string;\n    /** Query parameters */\n    params: readonly unknown[];\n  }>;\n\n/**\n * Operation hook context for CRUD operations.\n */\nexport type OperationHookContext = HookContext &\n  Readonly<{\n    /** Operation type */\n    operation: \"create\" | \"update\" | \"delete\";\n    /** Entity type */\n    entity: KindEntity;\n    /** Kind of node or edge */\n    kind: string;\n    /** Entity ID */\n    id: string;\n  }>;\n\n/**\n * Observability hooks for monitoring store operations.\n *\n * Note: Batch operations (`bulkCreate`, `bulkInsert`, `bulkUpsertById`) skip\n * per-item operation hooks for throughput. Query hooks still fire normally.\n *\n * @example\n * ```typescript\n * const hooks: StoreHooks = {\n *   onQueryStart: (ctx) => {\n *     console.log(`[${ctx.operationId}] Query: ${ctx.sql}`);\n *   },\n *   onQueryEnd: (ctx, result) => {\n *     const duration = Date.now() - ctx.startedAt.getTime();\n *     console.log(`[${ctx.operationId}] Completed in ${duration}ms`);\n *   },\n *   onError: (ctx, error) => {\n *     console.error(`[${ctx.operationId}] Error:`, error);\n *   },\n * };\n *\n * const store = createStore(graph, backend, { hooks });\n * ```\n */\nexport type StoreHooks = Readonly<{\n  /** Called before a query is executed */\n  onQueryStart?: (ctx: QueryHookContext) => void;\n  /** Called after a query completes successfully */\n  onQueryEnd?: (\n    ctx: QueryHookContext,\n    result: Readonly<{ rowCount: number; durationMs: number }>,\n  ) => void;\n  /** Called before a CRUD operation starts */\n  onOperationStart?: (ctx: OperationHookContext) => void;\n  /** Called after a CRUD operation completes */\n  onOperationEnd?: (\n    ctx: OperationHookContext,\n    result: Readonly<{ durationMs: number }>,\n  ) => void;\n  /** Called when an error occurs */\n  onError?: (ctx: HookContext, error: Error) => void;\n}>;\n\n// ============================================================\n// Store Configuration\n// ============================================================\n\n/**\n * Options for creating a store.\n */\nexport type StoreOptions = Readonly<{\n  /** Observability hooks for monitoring */\n  hooks?: StoreHooks;\n  /** SQL schema configuration for custom table names */\n  schema?: SqlSchema;\n  /** Query default behaviors. */\n  queryDefaults?: Readonly<{\n    /** Default traversal ontology expansion mode (default: \"inverse\"). */\n    traversalExpansion?: TraversalExpansion;\n  }>;\n}>;\n\n/**\n * A mutable handle to the current `Store`, used by `store.evolve(...)`\n * so long-lived consumers can dereference through the ref and pick up\n * the new store after each evolve call. `current` is overwritten by\n * `evolve()` atomically with the schema commit when the ref is passed\n * via `evolve(extension, { ref })`.\n *\n * **Mid-request semantics.** `ref.current` flips on the *next* call\n * after evolve, not mid-handler. Dereference once at request entry and\n * reuse the captured `Store` for the duration:\n *\n * ```ts\n * async function handleRequest(): Promise<void> {\n *   const store = ref.current; // capture once\n *   const tag = await store.nodes.Tag?.create({ label: \"...\" });\n *   // ...further work on the same `store`...\n * }\n * ```\n *\n * Pure dereferenceable handle — no event/subscription machinery. If\n * consumers need eventing, they wrap the ref themselves.\n *\n * Generic over the held value (typically `Store<G>`) so the store\n * module can refer to it without importing the `Store` class into\n * `types.ts`.\n */\nexport interface StoreRef<T> {\n  current: T;\n}\n\n// ============================================================\n// Get-Or-Create Types\n// ============================================================\n\n/**\n * Behavior when a get-or-create operation matches an existing record.\n */\nexport type IfExistsMode = \"return\" | \"update\";\n\n/**\n * Action taken by a get-or-create operation.\n */\nexport type GetOrCreateAction = \"created\" | \"found\" | \"updated\" | \"resurrected\";\n\n/**\n * Result of a node getOrCreateByConstraint operation.\n */\nexport type NodeGetOrCreateByConstraintResult<N extends NodeType> = Readonly<{\n  node: Node<N>;\n  action: GetOrCreateAction;\n}>;\n\n/**\n * Options for node getOrCreateByConstraint operations.\n */\nexport type NodeGetOrCreateByConstraintOptions = Readonly<{\n  /** Existing record behavior. Default: \"return\" */\n  ifExists?: IfExistsMode;\n}>;\n\n/**\n * Options for node bulkFindByIndex operations.\n */\nexport type NodeBulkFindByIndexOptions = Readonly<{\n  /**\n   * Maximum number of candidate nodes returned per input item. When omitted,\n   * each input's candidate set is unbounded. Must be a positive integer.\n   *\n   * Candidates are ordered deterministically by node id, so the cap is stable\n   * across calls. Use this to bound fan-out on low-selectivity index keys.\n   */\n  limitPerInput?: number;\n}>;\n\n/**\n * Result of an edge getOrCreateByEndpoints operation.\n */\nexport type EdgeGetOrCreateByEndpointsResult<\n  E extends AnyEdgeType,\n  From extends NodeType = NodeType,\n  To extends NodeType = NodeType,\n> = Readonly<{\n  edge: Edge<E, From, To>;\n  action: GetOrCreateAction;\n}>;\n\n/**\n * Options for edge findByEndpoints operations.\n */\nexport type EdgeFindByEndpointsOptions<E extends AnyEdgeType> = Readonly<{\n  /**\n   * Edge property fields to include in the match alongside the (from, to) endpoints.\n   * When omitted, matches on endpoints only (returns the first edge at the read coordinate).\n   */\n  matchOn?: readonly (keyof z.input<E[\"schema\"]>)[];\n  /** Property values to match against when matchOn is specified. */\n  props?: Partial<z.input<E[\"schema\"]>>;\n}>;\n\n/**\n * Options for edge getOrCreateByEndpoints operations.\n */\nexport type EdgeGetOrCreateByEndpointsOptions<E extends AnyEdgeType> =\n  Readonly<{\n    /**\n     * Edge property fields to include in the match key alongside the (from, to) endpoints.\n     * Default: `[]` — match on endpoints only.\n     */\n    matchOn?: readonly (keyof z.input<E[\"schema\"]>)[];\n    /** Existing record behavior. Default: \"return\" */\n    ifExists?: IfExistsMode;\n  }>;\n\n// ============================================================\n// Collection Interfaces\n// ============================================================\n\n/**\n * A collection of nodes of a specific type.\n *\n * Provides ergonomic CRUD operations for a single node type.\n */\nexport type NodeCollection<\n  N extends NodeType,\n  CN extends string = string,\n> = Readonly<{\n  /** Create a new node */\n  create: (\n    props: z.input<N[\"schema\"]>,\n    options?: Readonly<{ id?: string; validFrom?: string; validTo?: string }>,\n  ) => Promise<Node<N>>;\n\n  /** Get a node by ID */\n  getById: (\n    id: NodeId<N>,\n    options?: QueryOptions,\n  ) => Promise<Node<N> | undefined>;\n\n  /** Get multiple nodes by ID, preserving input order (undefined for missing) */\n  getByIds: (\n    ids: readonly NodeId<N>[],\n    options?: QueryOptions,\n  ) => Promise<readonly (Node<N> | undefined)[]>;\n\n  /** Update a node */\n  update: (\n    id: NodeId<N>,\n    props: Partial<z.input<N[\"schema\"]>>,\n    options?: Readonly<{ validTo?: string }>,\n  ) => Promise<Node<N>>;\n\n  /** Delete a node (soft delete - sets deletedAt timestamp) */\n  delete: (id: NodeId<N>) => Promise<void>;\n\n  /**\n   * Permanently delete a node from the database.\n   *\n   * Unlike `delete()` which performs a soft delete, this permanently\n   * removes the node and its associated data (uniqueness entries, embeddings).\n   *\n   * **Warning:** This operation is irreversible and should be used carefully.\n   * Consider using soft delete (`delete()`) for most use cases.\n   *\n   * @throws Error if edges are still connected to this node (delete edges first)\n   */\n  hardDelete: (id: NodeId<N>) => Promise<void>;\n\n  /**\n   * Find nodes matching criteria.\n   *\n   * Supports predicate filtering via the `where` option for SQL-level filtering.\n   * For simple queries. Use store.query() for complex traversals.\n   */\n  find: (\n    filter?: Readonly<{\n      where?: (accessor: NodeAccessor<N>) => Predicate;\n      limit?: number;\n      offset?: number;\n    }>,\n    temporal?: QueryOptions,\n  ) => Promise<Node<N>[]>;\n\n  /** Count nodes matching criteria */\n  count: (temporal?: QueryOptions) => Promise<number>;\n\n  /**\n   * Create a node from untyped data, relying on runtime Zod validation.\n   *\n   * Use this for dynamic dispatch (changesets, migrations, imports) where\n   * the data shape is determined at runtime, not compile time.\n   * The return type is fully typed — only the input gate is relaxed.\n   */\n  createFromRecord: (\n    data: Record<string, unknown>,\n    options?: Readonly<{ id?: string; validFrom?: string; validTo?: string }>,\n  ) => Promise<Node<N>>;\n\n  /**\n   * Create or update a node.\n   *\n   * If a node with the given ID exists, updates it with the provided props.\n   * Otherwise, creates a new node with that ID.\n   */\n  upsertById: (\n    id: string,\n    props: z.input<N[\"schema\"]>,\n    options?: Readonly<{ validFrom?: string; validTo?: string }>,\n  ) => Promise<Node<N>>;\n\n  /**\n   * Upsert a node from untyped data, relying on runtime Zod validation.\n   *\n   * Use this for dynamic dispatch (changesets, migrations, imports) where\n   * the data shape is determined at runtime, not compile time.\n   * The return type is fully typed — only the input gate is relaxed.\n   */\n  upsertByIdFromRecord: (\n    id: string,\n    data: Record<string, unknown>,\n    options?: Readonly<{ validFrom?: string; validTo?: string }>,\n  ) => Promise<Node<N>>;\n\n  /**\n   * Create multiple nodes in a batch.\n   *\n   * More efficient than calling create() multiple times.\n   * Use `bulkInsert` for the dedicated fast path that skips returning results.\n   */\n  bulkCreate: (\n    items: readonly Readonly<{\n      props: z.input<N[\"schema\"]>;\n      id?: string;\n      validFrom?: string;\n      validTo?: string;\n    }>[],\n  ) => Promise<Node<N>[]>;\n\n  /**\n   * Create or update multiple nodes in a batch.\n   *\n   * For each item, if a node with the given ID exists, updates it.\n   * Otherwise, creates a new node with that ID.\n   */\n  bulkUpsertById: (\n    items: readonly Readonly<{\n      id: string;\n      props: z.input<N[\"schema\"]>;\n      validFrom?: string;\n      validTo?: string;\n    }>[],\n  ) => Promise<Node<N>[]>;\n\n  /**\n   * Insert multiple nodes without returning results.\n   *\n   * This is the dedicated fast path for bulk inserts. Unlike `bulkCreate`\n   * with `returnResults: false`, the intent is unambiguous: no results\n   * are returned and the operation is wrapped in a transaction.\n   */\n  bulkInsert: (\n    items: readonly Readonly<{\n      props: z.input<N[\"schema\"]>;\n      id?: string;\n      validFrom?: string;\n      validTo?: string;\n    }>[],\n  ) => Promise<void>;\n\n  /**\n   * Delete multiple nodes by ID.\n   *\n   * Atomic when the backend supports transactions. Silently ignores IDs\n   * that don't exist.\n   */\n  bulkDelete: (ids: readonly NodeId<N>[]) => Promise<void>;\n\n  /**\n   * Find a node by uniqueness constraint.\n   *\n   * Looks up a live node by the named constraint key computed from `props`.\n   * Returns the node if found, or undefined. Soft-deleted nodes are excluded.\n   *\n   * @param constraintName - Name of the uniqueness constraint to match on\n   * @param props - Properties to compute the constraint key from\n   */\n  findByConstraint: (\n    constraintName: CN,\n    props: z.input<N[\"schema\"]>,\n  ) => Promise<Node<N> | undefined>;\n\n  /**\n   * Batch version of findByConstraint.\n   *\n   * Results are returned in the same order as the input items.\n   * Returns undefined for entries that don't match.\n   */\n  bulkFindByConstraint: (\n    constraintName: CN,\n    items: readonly Readonly<{\n      props: z.input<N[\"schema\"]>;\n    }>[],\n  ) => Promise<(Node<N> | undefined)[]>;\n\n  /**\n   * Batched candidate retrieval against a declared node index.\n   *\n   * For each input item, TypeGraph computes the index lookup key from\n   * `index.fields` (JSON-pointer extraction, partial-`where` applied to\n   * stored rows, null-safe matching) and returns the live, non-soft-deleted\n   * nodes that share that key. Unlike {@link bulkFindByConstraint}, the index\n   * may be non-unique, so each input yields a (possibly empty) array.\n   *\n   * Results preserve input order; each inner array is ordered by node id.\n   * Empty input returns `[]`. An unknown index name throws\n   * `NodeIndexNotFoundError`; a type-incompatible indexed field throws\n   * `ValidationError`. This is candidate retrieval, not a uniqueness or\n   * identity guarantee.\n   *\n   * @param indexName - Name of the declared node index to match on\n   * @param items - Records whose `props` supply the indexed-field values\n   * @param options - Optional `limitPerInput` to bound per-input fan-out\n   */\n  bulkFindByIndex: (\n    indexName: string,\n    items: readonly Readonly<{\n      props: Partial<z.input<N[\"schema\"]>>;\n    }>[],\n    options?: NodeBulkFindByIndexOptions,\n  ) => Promise<readonly Node<N>[][]>;\n\n  /**\n   * Get an existing node by uniqueness constraint, or create a new one.\n   *\n   * Looks up a node by the named constraint key computed from `props`.\n   * If found, returns it (optionally updating with `ifExists: \"update\"`).\n   * If not found, creates a new node. Soft-deleted matches are always resurrected.\n   *\n   * @param constraintName - Name of the uniqueness constraint to match on\n   * @param props - Full properties for create, or merge source for update\n   * @param options - Existing record behavior (default: \"return\")\n   */\n  getOrCreateByConstraint: (\n    constraintName: CN,\n    props: z.input<N[\"schema\"]>,\n    options?: NodeGetOrCreateByConstraintOptions,\n  ) => Promise<NodeGetOrCreateByConstraintResult<N>>;\n\n  /**\n   * Batch version of getOrCreateByConstraint.\n   *\n   * Results are returned in the same order as the input items.\n   * Atomic when the backend supports transactions.\n   */\n  bulkGetOrCreateByConstraint: (\n    constraintName: CN,\n    items: readonly Readonly<{\n      props: z.input<N[\"schema\"]>;\n    }>[],\n    options?: NodeGetOrCreateByConstraintOptions,\n  ) => Promise<NodeGetOrCreateByConstraintResult<N>[]>;\n}>;\n\n/**\n * Reference to a node of a specific kind.\n *\n * Accepts either:\n * - A Node instance of the correct kind\n * - An explicit { kind, id } object with the correct kind name\n *\n * This provides compile-time checking that edge endpoints match the\n * allowed node kinds defined in the edge registration.\n */\nexport type NodeRef<N extends NodeType = NodeType> =\n  | Node<N>\n  | Readonly<{ kind: N[\"kind\"]; id: string }>;\n\n/**\n * Options for creating an edge.\n */\ntype EdgeCreateOptions = Readonly<{\n  id?: string;\n  validFrom?: string;\n  validTo?: string;\n}>;\n\n/**\n * Arguments for edge creation, with props optional when schema allows empty object.\n *\n * Uses `{}` to check if an empty object literal satisfies the schema input type.\n */\n/* eslint-disable @typescript-eslint/no-empty-object-type -- {} is intentional: checking if empty object satisfies schema */\ntype EdgeCreateArguments<E extends AnyEdgeType> =\n  {} extends z.input<E[\"schema\"]> ?\n    [props?: z.input<E[\"schema\"]>, options?: EdgeCreateOptions]\n  : [props: z.input<E[\"schema\"]>, options?: EdgeCreateOptions];\n/* eslint-enable @typescript-eslint/no-empty-object-type */\n\n/**\n * A collection of edges of a specific type.\n *\n * Provides ergonomic CRUD operations for a single edge type.\n * The From and To type parameters enforce that edge endpoints\n * match the allowed node types at compile time.\n *\n * @example\n * ```typescript\n * // Create an edge - pass Node objects directly\n * const edge = await store.edges.worksAt.create(alice, acme, { role: \"Engineer\" });\n *\n * // TypeScript error: Company is not a valid 'from' type for worksAt\n * // store.edges.worksAt.create(acme, alice, { role: \"Engineer\" });\n *\n * // For edges with empty schemas, props is optional\n * await store.edges.wrote.create(author, book);\n *\n * // Find edges from a node\n * const edges = await store.edges.worksAt.findFrom(alice);\n * ```\n */\nexport type EdgeCollection<\n  E extends AnyEdgeType,\n  From extends NodeType = NodeType,\n  To extends NodeType = NodeType,\n> = Readonly<{\n  /**\n   * Create a new edge.\n   *\n   * @param from - Source node (must be one of the allowed 'from' types)\n   * @param to - Target node (must be one of the allowed 'to' types)\n   * @param args - Edge properties (optional if schema is empty) and creation options\n   */\n  create: (\n    from: NodeRef<From>,\n    to: NodeRef<To>,\n    ...args: EdgeCreateArguments<E>\n  ) => Promise<Edge<E, From, To>>;\n\n  /** Get an edge by ID */\n  getById: (\n    id: EdgeId<E>,\n    options?: QueryOptions,\n  ) => Promise<Edge<E, From, To> | undefined>;\n\n  /** Get multiple edges by ID, preserving input order (undefined for missing) */\n  getByIds: (\n    ids: readonly EdgeId<E>[],\n    options?: QueryOptions,\n  ) => Promise<readonly (Edge<E, From, To> | undefined)[]>;\n\n  /** Update an edge's properties */\n  update: (\n    id: EdgeId<E>,\n    props: Partial<z.input<E[\"schema\"]>>,\n    options?: Readonly<{ validTo?: string }>,\n  ) => Promise<Edge<E, From, To>>;\n\n  /**\n   * Find edges from a specific node.\n   *\n   * Honors the same temporal model as `getById` / `find`: with no\n   * `options`, the graph's default `temporalMode` applies (excluding\n   * soft-deleted edges and, in `current` / `asOf` modes, edges outside\n   * their validity window). Pass `temporalMode` / `asOf` to read the\n   * endpoint's edges at another temporal coordinate.\n   */\n  findFrom: (\n    from: NodeRef<From>,\n    options?: QueryOptions,\n  ) => Promise<Edge<E, From, To>[]>;\n\n  /**\n   * Find edges to a specific node.\n   *\n   * Temporal semantics mirror {@link EdgeCollection.findFrom}.\n   */\n  findTo: (\n    to: NodeRef<To>,\n    options?: QueryOptions,\n  ) => Promise<Edge<E, From, To>[]>;\n\n  /**\n   * Deferred variant of `findFrom` for use with `store.batch()`.\n   *\n   * Returns a `BatchableQuery` instead of executing immediately. Accepts\n   * the same temporal `options` as {@link EdgeCollection.findFrom}.\n   */\n  batchFindFrom: (\n    from: NodeRef<From>,\n    options?: QueryOptions,\n  ) => BatchableQuery<Edge<E, From, To>>;\n\n  /**\n   * Deferred variant of `findTo` for use with `store.batch()`.\n   *\n   * Returns a `BatchableQuery` instead of executing immediately. Accepts\n   * the same temporal `options` as {@link EdgeCollection.findTo}.\n   */\n  batchFindTo: (\n    to: NodeRef<To>,\n    options?: QueryOptions,\n  ) => BatchableQuery<Edge<E, From, To>>;\n\n  /**\n   * Deferred variant of `findByEndpoints` for use with `store.batch()`.\n   *\n   * Returns a `BatchableQuery` that yields a 0-or-1 element array\n   * (matching `findByEndpoints`' at-most-one semantics).\n   */\n  batchFindByEndpoints: (\n    from: NodeRef<From>,\n    to: NodeRef<To>,\n    options?: EdgeFindByEndpointsOptions<E>,\n    temporal?: QueryOptions,\n  ) => BatchableQuery<Edge<E, From, To>>;\n\n  /** Delete an edge (soft delete - sets deletedAt timestamp) */\n  delete: (id: EdgeId<E>) => Promise<void>;\n\n  /**\n   * Permanently delete an edge from the database.\n   *\n   * Unlike `delete()` which performs a soft delete, this permanently\n   * removes the edge record.\n   *\n   * **Warning:** This operation is irreversible and should be used carefully.\n   * Consider using soft delete (`delete()`) for most use cases.\n   */\n  hardDelete: (id: EdgeId<E>) => Promise<void>;\n\n  /** Find edges matching endpoint and pagination criteria */\n  find: (\n    filter?: Readonly<{\n      from?: NodeRef<From>;\n      to?: NodeRef<To>;\n      limit?: number;\n      offset?: number;\n    }>,\n    temporal?: QueryOptions,\n  ) => Promise<Edge<E, From, To>[]>;\n\n  /** Count edges matching criteria */\n  count: (\n    filter?: Readonly<{\n      from?: NodeRef<From>;\n      to?: NodeRef<To>;\n    }>,\n    temporal?: QueryOptions,\n  ) => Promise<number>;\n\n  /**\n   * Create multiple edges in a batch.\n   *\n   * More efficient than calling create() multiple times.\n   * Use `bulkInsert` for the dedicated fast path that skips returning results.\n   */\n  bulkCreate: (\n    items: readonly Readonly<{\n      from: NodeRef<From>;\n      to: NodeRef<To>;\n      props?: z.input<E[\"schema\"]>;\n      id?: string;\n      validFrom?: string;\n      validTo?: string;\n    }>[],\n  ) => Promise<Edge<E, From, To>[]>;\n\n  /**\n   * Create or update multiple edges in a batch.\n   *\n   * For each item, if an edge with the given ID exists, updates it.\n   * Otherwise, creates a new edge with that ID.\n   */\n  bulkUpsertById: (\n    items: readonly Readonly<{\n      id: EdgeId<E>;\n      from: NodeRef<From>;\n      to: NodeRef<To>;\n      props?: z.input<E[\"schema\"]>;\n      validFrom?: string;\n      validTo?: string;\n    }>[],\n  ) => Promise<Edge<E, From, To>[]>;\n\n  /**\n   * Insert multiple edges without returning results.\n   *\n   * This is the dedicated fast path for bulk inserts. Unlike `bulkCreate`\n   * with `returnResults: false`, the intent is unambiguous: no results\n   * are returned and the operation is wrapped in a transaction.\n   */\n  bulkInsert: (\n    items: readonly Readonly<{\n      from: NodeRef<From>;\n      to: NodeRef<To>;\n      props?: z.input<E[\"schema\"]>;\n      id?: string;\n      validFrom?: string;\n      validTo?: string;\n    }>[],\n  ) => Promise<void>;\n\n  /**\n   * Delete multiple edges by ID.\n   *\n   * Atomic when the backend supports transactions. Silently ignores IDs\n   * that don't exist.\n   */\n  bulkDelete: (ids: readonly EdgeId<E>[]) => Promise<void>;\n\n  /**\n   * Find an edge by endpoints and optional property fields.\n   *\n   * Returns the first matching edge at the read coordinate, or undefined.\n   * Honors the temporal model like `findFrom` / `findTo`: by default\n   * (`current` mode) soft-deleted and out-of-window edges are excluded; under\n   * `includeTombstones` a soft-deleted edge can be returned.\n   *\n   * @param from - Source node\n   * @param to - Target node\n   * @param options - Match criteria (matchOn fields and property values)\n   * @param temporal - Temporal coordinate. With no `temporal`, the graph's\n   *   default `temporalMode` applies (so under the default `\"current\"` mode,\n   *   edges outside their validity window are excluded). Pass\n   *   `temporalMode` / `asOf` to read the edge as of another coordinate.\n   */\n  findByEndpoints: (\n    from: NodeRef<From>,\n    to: NodeRef<To>,\n    options?: EdgeFindByEndpointsOptions<E>,\n    temporal?: QueryOptions,\n  ) => Promise<Edge<E, From, To> | undefined>;\n\n  /**\n   * Get an existing edge by endpoints and optional property fields, or create a new one.\n   *\n   * Matches edges of this kind between `(from, to)`. When `matchOn` specifies\n   * property fields, only edges whose properties match on those fields are considered.\n   * Soft-deleted matches are resurrected when cardinality allows.\n   *\n   * @param from - Source node\n   * @param to - Target node\n   * @param props - Full properties for create, or merge source for update\n   * @param options - Match criteria and conflict resolution\n   */\n  getOrCreateByEndpoints: (\n    from: NodeRef<From>,\n    to: NodeRef<To>,\n    props: z.input<E[\"schema\"]>,\n    options?: EdgeGetOrCreateByEndpointsOptions<E>,\n  ) => Promise<EdgeGetOrCreateByEndpointsResult<E, From, To>>;\n\n  /**\n   * Batch version of getOrCreateByEndpoints.\n   *\n   * Results are returned in the same order as the input items.\n   * Atomic when the backend supports transactions.\n   */\n  bulkGetOrCreateByEndpoints: (\n    items: readonly Readonly<{\n      from: NodeRef<From>;\n      to: NodeRef<To>;\n      props: z.input<E[\"schema\"]>;\n    }>[],\n    options?: EdgeGetOrCreateByEndpointsOptions<E>,\n  ) => Promise<EdgeGetOrCreateByEndpointsResult<E, From, To>[]>;\n}>;\n\n// ============================================================\n// Type Helpers\n// ============================================================\n\n/**\n * Extract uniqueness constraint names from a NodeRegistration.\n *\n * - Returns `never` when no uniqueness constraints are configured.\n * - Returns a literal union when names are inferred via `defineGraph` const params.\n * - Falls back to `string` when names are widened/dynamic.\n */\nexport type ConstraintNames<R extends NodeRegistration> =\n  \"unique\" extends keyof R ?\n    R[\"unique\"] extends readonly { readonly name: infer N }[] ?\n      N & string\n    : string\n  : never;\n\n/**\n * Extract the union of 'from' node types from an EdgeRegistration.\n */\ntype EdgeFromTypes<R extends EdgeRegistration> =\n  R[\"from\"] extends readonly (infer N)[] ? N : never;\n\n/**\n * Extract the union of 'to' node types from an EdgeRegistration.\n */\ntype EdgeToTypes<R extends EdgeRegistration> =\n  R[\"to\"] extends readonly (infer N)[] ? N : never;\n\n/**\n * Create a type-safe EdgeCollection from an EdgeRegistration.\n * Extracts the edge type and from/to node types automatically.\n */\nexport type TypedEdgeCollection<R extends EdgeRegistration> = EdgeCollection<\n  R[\"type\"],\n  EdgeFromTypes<R> extends NodeType ? EdgeFromTypes<R> : NodeType,\n  EdgeToTypes<R> extends NodeType ? EdgeToTypes<R> : NodeType\n>;\n\n// ============================================================\n// Transaction Types\n// ============================================================\n\n// ============================================================\n// Graph Collection Maps\n// ============================================================\n\n/** Mapped type of all node collections for a graph. */\nexport type GraphNodeCollections<G extends GraphDef> = {\n  [K in keyof G[\"nodes\"] & string]-?: NodeCollection<\n    G[\"nodes\"][K][\"type\"],\n    ConstraintNames<G[\"nodes\"][K]>\n  >;\n};\n\n/** Mapped type of all edge collections for a graph. */\nexport type GraphEdgeCollections<G extends GraphDef> = {\n  [K in keyof G[\"edges\"] & string]-?: TypedEdgeCollection<G[\"edges\"][K]>;\n};\n\n// ============================================================\n// StoreView read-only collection surfaces\n// ============================================================\n\n// ------------------------------------------------------------\n// Collection read / write split\n// ------------------------------------------------------------\n//\n// The live NodeCollection / EdgeCollection partition into buckets a\n// StoreView treats differently:\n//\n//   - temporal reads — honor the pinned coordinate (the view pins them, with\n//     the per-call temporal argument dropped);\n//   - current reads  — have no temporal axis, so the view delegates them on a\n//     `current` pin and refuses them on a temporal pin (they would otherwise\n//     silently return current data);\n//   - writes         — never available on a read-only view; and\n//   - batch reads    — deferred reads for `store.batch()`, absent from a view\n//     (no batch context).\n//\n// `Pick` validates every key against the live collection, and a `test-d`\n// conformance check asserts the buckets exactly partition it — so a new\n// method cannot be silently omitted from the view's surface decision, and a\n// new temporal read auto-appears (pinned) in the derived view type.\n\n/** Temporal-aware node reads — a {@link StoreView} pins these. */\nexport type NodeTemporalReads<\n  N extends NodeType,\n  CN extends string = string,\n> = Pick<NodeCollection<N, CN>, \"getById\" | \"getByIds\" | \"find\" | \"count\">;\n\n/**\n * The method names of the current-state-only node reads (constraint / index\n * lookups). Single source of truth: {@link NodeCurrentReads} (the type) and the\n * `StoreView`'s runtime routing Set are both derived from this array, so adding\n * a current-only read here updates both at once — a new read cannot pass the\n * type partition yet be misrouted at runtime (refused as a write).\n */\nexport const CURRENT_ONLY_READ_NAMES = [\n  \"findByConstraint\",\n  \"bulkFindByConstraint\",\n  \"bulkFindByIndex\",\n] as const;\n\n/**\n * Current-state-only node reads (constraint / index lookups). No temporal\n * axis, so a {@link StoreView} delegates them on a `current` pin and refuses\n * them on a temporal pin.\n */\nexport type NodeCurrentReads<\n  N extends NodeType,\n  CN extends string = string,\n> = Pick<NodeCollection<N, CN>, (typeof CURRENT_ONLY_READ_NAMES)[number]>;\n\n/** Node writes — never available on a read-only {@link StoreView}. */\nexport type NodeWrites<N extends NodeType, CN extends string = string> = Pick<\n  NodeCollection<N, CN>,\n  | \"create\"\n  | \"createFromRecord\"\n  | \"update\"\n  | \"delete\"\n  | \"hardDelete\"\n  | \"upsertById\"\n  | \"upsertByIdFromRecord\"\n  | \"bulkCreate\"\n  | \"bulkUpsertById\"\n  | \"bulkInsert\"\n  | \"bulkDelete\"\n  | \"getOrCreateByConstraint\"\n  | \"bulkGetOrCreateByConstraint\"\n>;\n\n/**\n * Temporal-aware edge reads — a {@link StoreView} pins these. Unlike the node\n * collection, edges have no current-state-only reads: `findByEndpoints` honors\n * the temporal coordinate like `findFrom` / `findTo`, so every edge read is\n * pinnable.\n */\nexport type EdgeTemporalReads<\n  E extends AnyEdgeType,\n  From extends NodeType = NodeType,\n  To extends NodeType = NodeType,\n> = Pick<\n  EdgeCollection<E, From, To>,\n  | \"getById\"\n  | \"getByIds\"\n  | \"find\"\n  | \"count\"\n  | \"findFrom\"\n  | \"findTo\"\n  | \"findByEndpoints\"\n>;\n\n/**\n * Deferred edge reads for `store.batch()` — absent from a {@link StoreView},\n * which has no batch context.\n */\nexport type EdgeBatchReads<\n  E extends AnyEdgeType,\n  From extends NodeType = NodeType,\n  To extends NodeType = NodeType,\n> = Pick<\n  EdgeCollection<E, From, To>,\n  \"batchFindFrom\" | \"batchFindTo\" | \"batchFindByEndpoints\"\n>;\n\n/** Edge writes — never available on a read-only {@link StoreView}. */\nexport type EdgeWrites<\n  E extends AnyEdgeType,\n  From extends NodeType = NodeType,\n  To extends NodeType = NodeType,\n> = Pick<\n  EdgeCollection<E, From, To>,\n  | \"create\"\n  | \"update\"\n  | \"delete\"\n  | \"hardDelete\"\n  | \"bulkCreate\"\n  | \"bulkUpsertById\"\n  | \"bulkInsert\"\n  | \"bulkDelete\"\n  | \"getOrCreateByEndpoints\"\n  | \"bulkGetOrCreateByEndpoints\"\n>;\n\n/**\n * The read-only node surface a {@link StoreView} exposes for one node kind.\n * The temporal reads drop the per-call temporal argument — the pin owns the\n * axis; the current reads ({@link NodeCurrentReads}) are exposed as-is\n * (delegated on a `current` view, refused on a temporal pin). Writes live on\n * the live `Store`. The conformance test asserts the temporal part equals the\n * pinned form of {@link NodeTemporalReads}.\n */\nexport type StoreViewNodeCollection<\n  N extends NodeType,\n  CN extends string = string,\n> = Readonly<{\n  /** Get a node by ID at the view's pinned coordinate. */\n  getById: (id: NodeId<N>) => Promise<Node<N> | undefined>;\n\n  /** Get multiple nodes by ID, preserving input order (undefined for missing). */\n  getByIds: (\n    ids: readonly NodeId<N>[],\n  ) => Promise<readonly (Node<N> | undefined)[]>;\n\n  /** Find nodes matching criteria at the view's pinned coordinate. */\n  find: (\n    filter?: Readonly<{\n      where?: (accessor: NodeAccessor<N>) => Predicate;\n      limit?: number;\n      offset?: number;\n    }>,\n  ) => Promise<Node<N>[]>;\n\n  /** Count nodes at the view's pinned coordinate. */\n  count: () => Promise<number>;\n}> &\n  NodeCurrentReads<N, CN>;\n\n/**\n * The read-only edge surface a {@link StoreView} exposes for one edge\n * kind, mirroring {@link StoreViewNodeCollection}. Every edge read —\n * including `findByEndpoints` — honors the pin via the same temporal model,\n * so (unlike nodes) there are no current-state-only edge reads.\n */\nexport type StoreViewEdgeCollection<\n  E extends AnyEdgeType,\n  From extends NodeType = NodeType,\n  To extends NodeType = NodeType,\n> = Readonly<{\n  /** Get an edge by ID at the view's pinned coordinate. */\n  getById: (id: EdgeId<E>) => Promise<Edge<E, From, To> | undefined>;\n\n  /** Get multiple edges by ID, preserving input order (undefined for missing). */\n  getByIds: (\n    ids: readonly EdgeId<E>[],\n  ) => Promise<readonly (Edge<E, From, To> | undefined)[]>;\n\n  /** Find edges matching endpoint and pagination criteria. */\n  find: (\n    filter?: Readonly<{\n      from?: NodeRef<From>;\n      to?: NodeRef<To>;\n      limit?: number;\n      offset?: number;\n    }>,\n  ) => Promise<Edge<E, From, To>[]>;\n\n  /** Count edges matching criteria at the view's pinned coordinate. */\n  count: (\n    filter?: Readonly<{ from?: NodeRef<From>; to?: NodeRef<To> }>,\n  ) => Promise<number>;\n\n  /** Find edges from a specific node at the view's pinned coordinate. */\n  findFrom: (from: NodeRef<From>) => Promise<Edge<E, From, To>[]>;\n\n  /** Find edges to a specific node at the view's pinned coordinate. */\n  findTo: (to: NodeRef<To>) => Promise<Edge<E, From, To>[]>;\n\n  /** Find the edge between two endpoints at the view's pinned coordinate. */\n  findByEndpoints: (\n    from: NodeRef<From>,\n    to: NodeRef<To>,\n    options?: EdgeFindByEndpointsOptions<E>,\n  ) => Promise<Edge<E, From, To> | undefined>;\n}>;\n\n/**\n * Read-only view edge collection derived from an `EdgeRegistration`,\n * extracting the edge type and from/to node types — the read-only\n * counterpart of {@link TypedEdgeCollection}.\n */\nexport type TypedStoreViewEdgeCollection<R extends EdgeRegistration> =\n  StoreViewEdgeCollection<\n    R[\"type\"],\n    EdgeFromTypes<R> extends NodeType ? EdgeFromTypes<R> : NodeType,\n    EdgeToTypes<R> extends NodeType ? EdgeToTypes<R> : NodeType\n  >;\n\n/** Mapped type of all read-only view node collections for a graph. */\nexport type StoreViewNodeCollections<G extends GraphDef> = {\n  [K in keyof G[\"nodes\"] & string]-?: StoreViewNodeCollection<\n    G[\"nodes\"][K][\"type\"]\n  >;\n};\n\n/** Mapped type of all read-only view edge collections for a graph. */\nexport type StoreViewEdgeCollections<G extends GraphDef> = {\n  [K in keyof G[\"edges\"] & string]-?: TypedStoreViewEdgeCollection<\n    G[\"edges\"][K]\n  >;\n};\n\n// ============================================================\n// Transaction Context\n// ============================================================\n\n/**\n * A typed transaction context with collection API.\n *\n * Provides the same `tx.nodes.*` and `tx.edges.*` API as the Store,\n * but operations are executed within the transaction scope.\n *\n * `tx.sql` is the raw Drizzle handle **bound to this same\n * transaction** — use it to write the caller's own relational tables\n * inside the graph-owned transaction so both layers commit or roll\n * back together (the graph-owned counterpart of\n * {@link Store.withTransaction}, where the caller owns the boundary):\n *\n * ```typescript\n * await store.transaction(async (tx) => {\n *   await tx.nodes.Document.update(documentId, props);\n *   // `tx.sql` is the `AdoptedTransaction` union — cast to your\n *   // concrete Drizzle database type at the call site.\n *   const sqlTx = tx.sql as NodePgDatabase;\n *   await sqlTx.insert(documentVersions).values(versionRow);\n *   await sqlTx.insert(changeEvents).values(eventRow);\n * });\n * ```\n *\n * Per-backend semantics:\n * - **Postgres / libsql** (async drivers): `tx.sql` is the Drizzle\n *   transaction handle. Using the outer `db` instead would write on a\n *   *different* connection and silently escape the transaction — so\n *   `tx.sql` is a correctness requirement there.\n * - **better-sqlite3**: the single connection, framed by TypeGraph's\n *   `BEGIN`/`COMMIT`/`ROLLBACK`.\n * - **Durable Objects (`do-sqlite`)**: the bound Drizzle handle; the\n *   storage transaction is ambient, so writing the outer `db` also\n *   enlists — `tx.sql` is the explicit, portable form.\n *\n * It is `undefined` only on the non-transactional fallback\n * (`backend.capabilities.transactions === false` — e.g. Cloudflare\n * D1, `drizzle-orm/neon-http`), where `store.transaction()` runs the\n * callback with no atomicity and there is no transaction to enlist.\n * Its type is the `AdoptedTransaction` union; cast to your concrete\n * Drizzle database type at the call site.\n *\n * @example\n * ```typescript\n * await store.transaction(async (tx) => {\n *   const person = await tx.nodes.Person.create({ name: \"Alice\" });\n *   const company = await tx.nodes.Company.create({ name: \"Acme\" });\n *   await tx.edges.worksAt.create(person, company, { role: \"Engineer\" });\n * });\n * ```\n */\nexport type TransactionContext<G extends GraphDef> = Readonly<{\n  nodes: GraphNodeCollections<G>;\n  edges: GraphEdgeCollections<G>;\n  sql?: AdoptedTransaction;\n  /**\n   * The transaction-scoped backend the collections are bound to, for advanced\n   * raw reads that must observe the transaction's snapshot (e.g. graph-merge's\n   * in-transaction base@V re-validation). On the non-transactional fallback it\n   * is the store's plain backend — reads work, but there is no snapshot.\n   */\n  backend: TransactionBackend;\n}>;\n\n// ============================================================\n// Dynamic Collection Types (widened for runtime dispatch)\n// ============================================================\n\n/**\n * Replace branded `NodeId` / `EdgeId` with plain `string` in each\n * method's parameter list. Return types are preserved unchanged.\n *\n * Handles three shapes:\n * 1. Direct branded ID parameter → `string`\n * 2. `readonly NodeId[]` / `readonly EdgeId[]` → `readonly string[]`\n * 3. Branded IDs nested one level inside bulk-item object arrays\n */\ntype WidenBrandedIds<T> = {\n  readonly [K in keyof T]: T[K] extends (...args: infer A) => infer R ?\n    (...args: { [P in keyof A]: UnbrandParam<A[P]> }) => R\n  : T[K];\n};\n\n/** Replace a branded ID with `string`, recursing one level into arrays. */\ntype UnbrandParam<T> =\n  T extends NodeId<NodeType> ? string\n  : T extends EdgeId<AnyEdgeType> ? string\n  : T extends readonly NodeId<NodeType>[] ? readonly string[]\n  : T extends readonly EdgeId<AnyEdgeType>[] ? readonly string[]\n  : T extends readonly (infer Item extends Record<string, unknown>)[] ?\n    readonly UnbrandRecord<Item>[]\n  : T;\n\n/** Replace branded ID values in object properties (does not recurse into nested structures). */\ntype UnbrandRecord<T extends Record<string, unknown>> = {\n  readonly [K in keyof T]: T[K] extends NodeId<NodeType> ? string\n  : T[K] extends EdgeId<AnyEdgeType> ? string\n  : T[K];\n};\n\n/**\n * A node collection with widened generics for runtime string-keyed access.\n *\n * This is the return type of `store.getNodeCollection(kind)`. It exposes\n * the full `NodeCollection` API but with `NodeType` and `string` constraint\n * names instead of the specific generic parameters, since the concrete type\n * is not known at compile time.\n *\n * ID parameters accept plain `string` instead of branded `NodeId<N>`, since\n * the dynamic path typically receives IDs from edge metadata, snapshots,\n * or external input where the brand is not available.\n */\nexport type DynamicNodeCollection = WidenBrandedIds<\n  NodeCollection<NodeType, string>\n>;\n\n/**\n * An edge collection with widened generics for runtime string-keyed access.\n *\n * This is the return type of `store.getEdgeCollection(kind)`. It exposes\n * the full `EdgeCollection` API but with `NodeType` endpoint types, since\n * the concrete from/to types are not known at compile time.\n *\n * ID parameters accept plain `string` instead of branded `EdgeId<E>`, since\n * the dynamic path typically receives IDs from edge metadata, snapshots,\n * or external input where the brand is not available.\n */\nexport type DynamicEdgeCollection = WidenBrandedIds<\n  EdgeCollection<AnyEdgeType, NodeType, NodeType>\n>;\n\n// ============================================================\n// Store Projection\n// ============================================================\n\n/**\n * A type-level projection of a store's surface onto a subset of its\n * node and edge collections.\n *\n * Node collections are projected with constraint names erased (`never`),\n * so constraint-based methods like `findByConstraint` become uncallable.\n * This is intentional: unique constraints are graph-registration-level\n * details that differ between graphs sharing the same node types.\n *\n * @example\n * ```typescript\n * type CoreStore = StoreProjection<\n *   typeof myGraph,\n *   \"Document\" | \"Chunk\",\n *   \"hasChunk\"\n * >;\n *\n * async function ingestChunk(\n *   store: CoreStore,\n *   document: Node<typeof Document>,\n *   text: string,\n * ) {\n *   const chunk = await store.nodes.Chunk.create({ text });\n *   await store.edges.hasChunk.create(document, chunk);\n *   return chunk;\n * }\n * ```\n *\n * Both `Store<G>` and `TransactionContext<G>` are structurally assignable\n * to a `StoreProjection` whose keys are a subset of `G`.\n */\nexport type StoreProjection<\n  G extends GraphDef,\n  N extends keyof G[\"nodes\"] & string = never,\n  E extends keyof G[\"edges\"] & string = never,\n> = Readonly<{\n  nodes: { [K in N]-?: NodeCollection<G[\"nodes\"][K][\"type\"], never> };\n  edges: Pick<GraphEdgeCollections<G>, E>;\n}>;\n","/**\n * StoreView — a read-only `(mode, asOf)` lens over a {@link Store}.\n *\n * A `StoreView` pins a temporal coordinate and routes every supported\n * read through it, mirroring Datomic's `(d/as-of db t)` database value\n * and SQL:2011 `FOR SYSTEM_TIME AS OF`. It is *read-only by\n * construction*: mutating \"the graph as of last Tuesday\" is incoherent,\n * so writes stay on the live `Store`.\n *\n * The view is an explicit read context, not a single default flip — the\n * temporal seam is not uniform across surfaces (the query builder\n * hardcodes `\"current\"`, `subgraph` reads `graph.defaults` directly,\n * collections apply a per-call default). The view therefore injects its\n * pinned {@link ReadCoordinate} into each surface it hands out through one\n * helper ({@link withCoordinate}), so a future temporal axis (recorded\n * time) lands on every surface at once instead of splitting by surface.\n *\n * Built on the public `Store` surface (plus one internal sealed-query\n * seam), so it composes the same reads `branch()` / `merge()` consume.\n */\nimport {\n  type AllNodeTypes,\n  type EdgeKinds,\n  type GraphDef,\n  type NodeKinds,\n} from \"../core/define-graph\";\nimport {\n  coordinateContext,\n  describeCoordinate,\n  type ReadCoordinate,\n  resolveReadCoordinate,\n} from \"../core/temporal\";\nimport {\n  type AnyEdgeType,\n  type NodeId,\n  type NodeType,\n  type TemporalMode,\n} from \"../core/types\";\nimport { ConfigurationError } from \"../errors\";\nimport { type QueryBuilder } from \"../query/builder\";\nimport {\n  type BaseTraversalOptions,\n  type DegreeOptions,\n  type NeighborsOptions,\n  type NodeIdentifier,\n  type ReachableNode,\n  type ReachableOptions,\n  type ShortestPathOptions,\n  type ShortestPathResult,\n  type TemporalAlgorithmOptions,\n} from \"./algorithms\";\nimport { withCoordinate } from \"./collections/temporal-read-params\";\nimport { type StoreSearch } from \"./search-facade\";\nimport { type Store } from \"./store\";\nimport {\n  type SubgraphOptions,\n  type SubgraphProject,\n  type SubgraphResult,\n} from \"./subgraph\";\nimport {\n  CURRENT_ONLY_READ_NAMES,\n  type EdgeCollection,\n  type NodeCollection,\n  type NodeCurrentReads,\n  type StoreViewEdgeCollection,\n  type StoreViewEdgeCollections,\n  type StoreViewNodeCollection,\n  type StoreViewNodeCollections,\n} from \"./types\";\n\n// ============================================================\n// Public coordinate + view-scoped option types\n// ============================================================\n\n/**\n * The temporal coordinate a {@link StoreView} pins. A discriminated union on\n * `mode`: `asOf` is *required* for `\"asOf\"` and *rejected* (`never`) for every\n * other mode, so the type mirrors the runtime contract. `view({ mode: \"asOf\" })`\n * (missing timestamp) and `view({ mode: \"current\", asOf })` (pinning an instant\n * outside `\"asOf\"`) are both compile errors, not merely runtime\n * `ValidationError`s.\n */\nexport type StoreViewCoordinate =\n  | Readonly<{ mode: \"asOf\"; asOf: string }>\n  | Readonly<{ mode: Exclude<TemporalMode, \"asOf\">; asOf?: never }>;\n\n/**\n * {@link Store.subgraph} options with the temporal axis removed — the\n * view's pinned coordinate supplies it.\n */\nexport type StoreViewSubgraphOptions<\n  G extends GraphDef,\n  EK extends EdgeKinds<G>,\n  NK extends NodeKinds<G>,\n  P extends SubgraphProject<G, NK, EK> | undefined = undefined,\n> = Omit<SubgraphOptions<G, EK, NK, P>, \"temporalMode\" | \"asOf\">;\n\n/** `reachable` options with the temporal axis removed (the pin supplies it). */\nexport type StoreViewReachableOptions<G extends GraphDef> = Omit<\n  ReachableOptions<G>,\n  keyof TemporalAlgorithmOptions\n>;\n\n/** `shortestPath` options with the temporal axis removed (the pin supplies it). */\nexport type StoreViewShortestPathOptions<G extends GraphDef> = Omit<\n  ShortestPathOptions<G>,\n  keyof TemporalAlgorithmOptions\n>;\n\n/** `canReach` options with the temporal axis removed (the pin supplies it). */\nexport type StoreViewCanReachOptions<G extends GraphDef> = Omit<\n  BaseTraversalOptions<G>,\n  keyof TemporalAlgorithmOptions\n>;\n\n/** `neighbors` options with the temporal axis removed (the pin supplies it). */\nexport type StoreViewNeighborsOptions<G extends GraphDef> = Omit<\n  NeighborsOptions<G>,\n  keyof TemporalAlgorithmOptions\n>;\n\n/** `degree` options with the temporal axis removed (the pin supplies it). */\nexport type StoreViewDegreeOptions<G extends GraphDef> = Omit<\n  DegreeOptions<G>,\n  keyof TemporalAlgorithmOptions\n>;\n\n// ============================================================\n// Read-only collection wrapping\n// ============================================================\n\n/**\n * Property keys that look like member access but are JS / Promise interop\n * probes, not graph kinds or collection methods. Resolving them to\n * `undefined` keeps `view.nodes` / `view.edges` (and the refusing search\n * facade) from being mistaken for a thenable when accidentally awaited,\n * and keeps inspection / serialization from tripping the unknown-kind\n * guard.\n */\nconst NON_KIND_KEYS: ReadonlySet<string> = new Set([\n  \"then\",\n  \"catch\",\n  \"finally\",\n  \"toJSON\",\n]);\n\n/**\n * Returns a function that refuses a write or unsupported-read method on a\n * read-only view with a descriptive error, rather than silently ignoring\n * the pin or failing with an opaque `undefined is not a function`.\n */\nfunction createReadOnlyRefusal(\n  entity: \"node\" | \"edge\",\n  method: string,\n  coordinate: ReadCoordinate,\n): () => never {\n  return () => {\n    throw new ConfigurationError(\n      `'${method}' is not available on a read-only StoreView (${describeCoordinate(coordinate)}). ` +\n        `A time-pinned view is a read perspective — perform writes on the live Store.`,\n      {\n        code: \"STORE_VIEW_READ_ONLY\",\n        entity,\n        method,\n        ...coordinateContext(coordinate),\n      },\n    );\n  };\n}\n\n/**\n * Returns a function that refuses a current-state-only read (constraint /\n * index / endpoint lookup) on a *temporal* view via Promise rejection. Such\n * reads have no temporal axis — they always reflect current state — so on a\n * non-`current` pin they would silently lie. On a `current` view they are\n * delegated straight to the live collection instead of refused.\n */\nfunction createCurrentOnlyRefusal(\n  entity: \"node\" | \"edge\",\n  method: string,\n  coordinate: ReadCoordinate,\n): () => Promise<never> {\n  return () =>\n    Promise.reject(\n      new ConfigurationError(\n        `'${method}' is not available on a StoreView (${describeCoordinate(coordinate)}). ` +\n          `Constraint / index / endpoint lookups read current state only and ` +\n          `cannot honor a temporal coordinate — use a current-mode view or the live Store.`,\n        {\n          code: \"STORE_VIEW_CURRENT_ONLY\",\n          entity,\n          method,\n          ...coordinateContext(coordinate),\n        },\n      ),\n    );\n}\n\n/**\n * Current-state-only collection reads: they take no temporal coordinate, so\n * the view delegates them on a `current` pin and refuses them on a temporal\n * pin rather than silently returning current data. Derived from the same\n * {@link CURRENT_ONLY_READ_NAMES} array that defines the `NodeCurrentReads`\n * type, so the runtime routing decision cannot drift from the type partition.\n */\nconst CURRENT_ONLY_READS: ReadonlySet<string> = new Set(\n  CURRENT_ONLY_READ_NAMES,\n);\n\n/**\n * Wraps a `reads` object so its supported reads pass through while any\n * other method that exists on the live collection refuses. Writes refuse\n * synchronously ({@link createReadOnlyRefusal}); current-state-only reads\n * refuse via Promise rejection on a temporal pin but are delegated to the\n * live collection on a `current` view ({@link CURRENT_ONLY_READS}).\n *\n * The supported set is exactly `reads`' own keys, so it can never drift\n * from the methods actually implemented. The target is frozen and the\n * `set` / `defineProperty` / `deleteProperty` traps reject, so the view is\n * read-only by construction at runtime, not only at the type level.\n * `Object.hasOwn` — not `in` — so inherited `Object.prototype` members\n * (`toString`, `valueOf`, …) pass straight through and coercion / logging\n * of a view collection still works.\n */\nfunction readOnlyCollectionProxy<T extends object>(\n  reads: T,\n  live: object,\n  coordinate: ReadCoordinate,\n  entity: \"node\" | \"edge\",\n): T {\n  const isCurrent = coordinate.valid.mode === \"current\";\n  const target = Object.freeze(reads) as T;\n  return new Proxy(target, {\n    get(target, property, receiver) {\n      if (\n        typeof property === \"string\" &&\n        !Object.hasOwn(target, property) &&\n        Object.hasOwn(live, property)\n      ) {\n        if (CURRENT_ONLY_READS.has(property)) {\n          return isCurrent ?\n              (live as Record<string, unknown>)[property]\n            : createCurrentOnlyRefusal(entity, property, coordinate);\n        }\n        return createReadOnlyRefusal(entity, property, coordinate);\n      }\n      return Reflect.get(target, property, receiver);\n    },\n    has(target, property) {\n      // Mirror `get`: a property is \"present\" if the proxy resolves a value for\n      // it — the pinned reads (own keys of target), any live-collection method\n      // (delegated or refused), or an inherited Object.prototype member. Keeps\n      // `\"method\" in view.collection` consistent with property access.\n      return (\n        (typeof property === \"string\" && Object.hasOwn(live, property)) ||\n        Reflect.has(target, property)\n      );\n    },\n    set() {\n      return false;\n    },\n    defineProperty() {\n      return false;\n    },\n    deleteProperty() {\n      return false;\n    },\n  });\n}\n\nfunction pinnedNodeCollection(\n  live: NodeCollection<NodeType, string>,\n  coordinate: ReadCoordinate,\n): StoreViewNodeCollection<NodeType> {\n  const temporal = withCoordinate(coordinate);\n  // Only the temporal reads live in the literal; the proxy serves the\n  // current-only reads (delegate on a `current` pin, refuse on a temporal pin).\n  const reads: Omit<\n    StoreViewNodeCollection<NodeType>,\n    keyof NodeCurrentReads<NodeType>\n  > = {\n    getById: (id) => live.getById(id, temporal),\n    getByIds: (ids) => live.getByIds(ids, temporal),\n    // `live.find` is the NodeCollection read, not Array#find — the\n    // (filter, temporal) shape trips the array-method heuristics.\n    // eslint-disable-next-line unicorn/no-array-callback-reference, unicorn/no-array-method-this-argument\n    find: (filter) => live.find(filter, temporal),\n    count: () => live.count(temporal),\n  };\n  return readOnlyCollectionProxy(\n    reads,\n    live,\n    coordinate,\n    \"node\",\n  ) as StoreViewNodeCollection<NodeType>;\n}\n\nfunction pinnedEdgeCollection(\n  live: EdgeCollection<AnyEdgeType, NodeType, NodeType>,\n  coordinate: ReadCoordinate,\n): StoreViewEdgeCollection<AnyEdgeType, NodeType, NodeType> {\n  const temporal = withCoordinate(coordinate);\n  const reads: StoreViewEdgeCollection<AnyEdgeType, NodeType, NodeType> = {\n    getById: (id) => live.getById(id, temporal),\n    getByIds: (ids) => live.getByIds(ids, temporal),\n    // `live.find` is the EdgeCollection read, not Array#find — the\n    // (filter, temporal) shape trips the array-method heuristics.\n    // eslint-disable-next-line unicorn/no-array-callback-reference, unicorn/no-array-method-this-argument\n    find: (filter) => live.find(filter, temporal),\n    count: (filter) => live.count(filter, temporal),\n    findFrom: (from) => live.findFrom(from, temporal),\n    findTo: (to) => live.findTo(to, temporal),\n    findByEndpoints: (from, to, options) =>\n      live.findByEndpoints(from, to, options, temporal),\n  };\n  return readOnlyCollectionProxy(reads, live, coordinate, \"edge\");\n}\n\n/**\n * Builds the lazy, per-kind caching proxy that fronts the pinned\n * collections. Shared by `nodes` and `edges`: indexing the live proxy\n * throws `KindNotFoundError` for an unknown kind, so the view refuses an\n * unknown kind the same way the live store does — while interop probes\n * ({@link NON_KIND_KEYS}) resolve to `undefined`.\n */\nfunction pinnedCollections<L, W>(\n  live: object,\n  coordinate: ReadCoordinate,\n  wrap: (liveCollection: L, coordinate: ReadCoordinate) => W,\n): Record<string, W> {\n  const cache = new Map<string, W>();\n  return new Proxy(\n    {},\n    {\n      get(_target, kind) {\n        if (typeof kind !== \"string\" || NON_KIND_KEYS.has(kind)) return;\n        const cached = cache.get(kind);\n        if (cached !== undefined) return cached;\n        const wrapped = wrap((live as Record<string, L>)[kind]!, coordinate);\n        cache.set(kind, wrapped);\n        return wrapped;\n      },\n    },\n  );\n}\n\n// ============================================================\n// Read-only search facade\n// ============================================================\n\n/**\n * The non-mutating read methods of {@link StoreSearch}. The `satisfies`\n * constraint binds each name to a real `StoreSearch` member, so a rename or\n * removal of one of these methods is a compile error here rather than a silent\n * routing gap. (Completeness for a *newly added* read method would need a\n * StoreSearch read/write type split, mirroring the node collection's — tracked\n * separately.)\n */\nconst READ_SEARCH_METHOD_NAMES = [\n  \"fulltext\",\n  \"vector\",\n  \"hybrid\",\n] as const satisfies readonly (keyof StoreSearch<GraphDef>)[];\nconst READ_SEARCH_METHODS: ReadonlySet<string> = new Set(\n  READ_SEARCH_METHOD_NAMES,\n);\n\n/**\n * Builds the error a refused search method rejects with. A `current` view\n * still refuses the mutating maintenance op (`rebuildFulltext`) because the\n * view is read-only; a non-`current` view refuses *all* search because the\n * fulltext / vector index reflects current state only and historical\n * relevance is out of scope.\n */\nfunction searchRefusal(\n  method: string,\n  coordinate: ReadCoordinate,\n  isCurrent: boolean,\n): ConfigurationError {\n  return isCurrent ?\n      new ConfigurationError(\n        `store.search.${method} is a maintenance write and is not available on a ` +\n          `read-only StoreView. Run it on the live Store.`,\n        {\n          code: \"STORE_VIEW_READ_ONLY\",\n          method,\n          ...coordinateContext(coordinate),\n        },\n      )\n    : new ConfigurationError(\n        `store.search.${method} is not available on a StoreView (${describeCoordinate(coordinate)}). ` +\n          `The fulltext / vector index reflects current state only; historical ` +\n          `relevance is out of scope for a temporal view. Use a current-mode ` +\n          `view or query the live Store.`,\n        {\n          code: \"STORE_VIEW_SEARCH_UNSUPPORTED\",\n          method,\n          ...coordinateContext(coordinate),\n        },\n      );\n}\n\n/**\n * The view's search facade. On a `current` view the read methods\n * (`fulltext` / `vector` / `hybrid`) delegate to the live `store.search`;\n * every other case refuses via Promise rejection — `rebuildFulltext` (a\n * maintenance write) on any view, and *all* search on a non-`current`\n * view. A Proxy (not a fixed literal) so a future `StoreSearch` method is\n * refused, not silently passed through, on a temporal view.\n */\nfunction pinnedSearch<G extends GraphDef>(\n  store: Store<G>,\n  coordinate: ReadCoordinate,\n): StoreSearch<G> {\n  const isCurrent = coordinate.valid.mode === \"current\";\n  const live =\n    isCurrent ?\n      (store.search as unknown as Record<\n        string,\n        (...args: readonly unknown[]) => unknown\n      >)\n    : undefined;\n  return new Proxy({} as StoreSearch<G>, {\n    get(target, method, receiver) {\n      // Interop probes must resolve to `undefined` so the facade is not\n      // mistaken for a thenable.\n      if (typeof method !== \"string\" || NON_KIND_KEYS.has(method)) {\n        return;\n      }\n      // Inherited Object.prototype members (toString / valueOf / …) pass\n      // through so coercion / logging of the facade stays safe.\n      if (Object.hasOwn(Object.prototype, method)) {\n        const inheritedValue: unknown = Reflect.get(target, method, receiver);\n        return inheritedValue;\n      }\n      if (live !== undefined && READ_SEARCH_METHODS.has(method)) {\n        return (...args: readonly unknown[]) => live[method]!(...args);\n      }\n      return () => Promise.reject(searchRefusal(method, coordinate, isCurrent));\n    },\n  });\n}\n\n// ============================================================\n// StoreView\n// ============================================================\n\n/**\n * A read-only `(mode, asOf)` lens over a {@link Store}. Construct one via\n * {@link Store.asOf} (valid-time) or {@link Store.view} (any public\n * mode), never directly.\n *\n * @example\n * ```typescript\n * const past = store.asOf(\"2026-01-01T00:00:00.000Z\");\n * const alice = await past.nodes.Person.getById(aliceId);\n * const jobs = await past.edges.worksAt.findFrom(alice!);\n * const reach = await past.reachable(alice!, { edges: [\"knows\"] });\n * ```\n */\nexport class StoreView<G extends GraphDef> {\n  readonly #store: Store<G>;\n  readonly #coordinate: ReadCoordinate;\n  #nodes: StoreViewNodeCollections<G> | undefined;\n  #edges: StoreViewEdgeCollections<G> | undefined;\n  #search: StoreSearch<G> | undefined;\n\n  constructor(store: Store<G>, coordinate: StoreViewCoordinate) {\n    this.#store = store;\n    this.#coordinate = resolveReadCoordinate(\n      coordinate.mode,\n      coordinate.asOf,\n      'Use store.asOf(\"2026-01-01T00:00:00.000Z\") or store.view({ mode: \"asOf\", asOf }).',\n    );\n  }\n\n  /** The temporal mode this view reads in. */\n  get mode(): TemporalMode {\n    return this.#coordinate.valid.mode;\n  }\n\n  /** The pinned `asOf` timestamp, or `undefined` for non-`asOf` modes. */\n  get asOf(): string | undefined {\n    return this.#coordinate.valid.asOf;\n  }\n\n  /** Read-only node collections pinned to this view's coordinate. */\n  get nodes(): StoreViewNodeCollections<G> {\n    this.#nodes ??= pinnedCollections(\n      this.#store.nodes,\n      this.#coordinate,\n      pinnedNodeCollection,\n    ) as unknown as StoreViewNodeCollections<G>;\n    return this.#nodes;\n  }\n\n  /** Read-only edge collections pinned to this view's coordinate. */\n  get edges(): StoreViewEdgeCollections<G> {\n    this.#edges ??= pinnedCollections(\n      this.#store.edges,\n      this.#coordinate,\n      pinnedEdgeCollection,\n    ) as unknown as StoreViewEdgeCollections<G>;\n    return this.#edges;\n  }\n\n  /**\n   * A query builder pinned to this view's coordinate. The temporal axis is\n   * sealed: calling `.temporal(...)` on the returned builder throws, so the\n   * view's coordinate cannot be overridden on a per-query basis.\n   */\n  query(): QueryBuilder<G> {\n    return this.#store.sealedQuery(this.#coordinate);\n  }\n\n  /** Extracts a subgraph at this view's pinned coordinate. */\n  subgraph<\n    const EK extends EdgeKinds<G>,\n    const NK extends NodeKinds<G> = NodeKinds<G>,\n    const P extends SubgraphProject<G, NK, EK> | undefined = undefined,\n  >(\n    rootId: NodeId<AllNodeTypes<G>>,\n    options: StoreViewSubgraphOptions<G, EK, NK, P>,\n  ): Promise<SubgraphResult<G, NK, EK, P>> {\n    return this.#store.subgraph(rootId, {\n      ...options,\n      ...withCoordinate(this.#coordinate),\n    });\n  }\n\n  /** Shortest path between two nodes at this view's pinned coordinate. */\n  shortestPath(\n    from: NodeIdentifier,\n    to: NodeIdentifier,\n    options: StoreViewShortestPathOptions<G>,\n  ): Promise<ShortestPathResult | undefined> {\n    return this.#store.algorithms.shortestPath(from, to, {\n      ...options,\n      ...withCoordinate(this.#coordinate),\n    });\n  }\n\n  /** Nodes reachable from `from` at this view's pinned coordinate. */\n  reachable(\n    from: NodeIdentifier,\n    options: StoreViewReachableOptions<G>,\n  ): Promise<readonly ReachableNode[]> {\n    return this.#store.algorithms.reachable(from, {\n      ...options,\n      ...withCoordinate(this.#coordinate),\n    });\n  }\n\n  /** Whether `to` is reachable from `from` at this view's pinned coordinate. */\n  canReach(\n    from: NodeIdentifier,\n    to: NodeIdentifier,\n    options: StoreViewCanReachOptions<G>,\n  ): Promise<boolean> {\n    return this.#store.algorithms.canReach(from, to, {\n      ...options,\n      ...withCoordinate(this.#coordinate),\n    });\n  }\n\n  /** The k-hop neighborhood of `node` at this view's pinned coordinate. */\n  neighbors(\n    node: NodeIdentifier,\n    options: StoreViewNeighborsOptions<G>,\n  ): Promise<readonly ReachableNode[]> {\n    return this.#store.algorithms.neighbors(node, {\n      ...options,\n      ...withCoordinate(this.#coordinate),\n    });\n  }\n\n  /** Counts active edges incident to `node` at this view's pinned coordinate. */\n  degree(\n    node: NodeIdentifier,\n    options?: StoreViewDegreeOptions<G>,\n  ): Promise<number> {\n    return this.#store.algorithms.degree(node, {\n      ...options,\n      ...withCoordinate(this.#coordinate),\n    });\n  }\n\n  /**\n   * Read-only search facade. On a `current` view the read methods\n   * (`fulltext` / `vector` / `hybrid`) delegate to the live `store.search`,\n   * while the mutating `rebuildFulltext` is refused — the view is read-only.\n   * On any non-`current` pin every search method refuses: the fulltext /\n   * vector index reflects current state only, so historical relevance is\n   * out of scope.\n   */\n  get search(): StoreSearch<G> {\n    this.#search ??= pinnedSearch<G>(this.#store, this.#coordinate);\n    return this.#search;\n  }\n}\n","/**\n * Shared utilities for subquery projection shape and type handling.\n */\nimport { type AggregateExpr, type QueryAst, type ValueType } from \"./ast\";\n\n/**\n * Normalizes a value type by treating \"unknown\" as undefined.\n */\nfunction normalizeValueType(valueType?: ValueType): ValueType | undefined {\n  if (valueType === undefined || valueType === \"unknown\") {\n    return undefined;\n  }\n  return valueType;\n}\n\n/**\n * Returns true when the type cannot be compared with IN/NOT IN.\n */\nexport function isUnsupportedInSubqueryValueType(\n  valueType?: ValueType,\n): boolean {\n  const normalized = normalizeValueType(valueType);\n  return (\n    normalized === \"array\" ||\n    normalized === \"object\" ||\n    normalized === \"embedding\"\n  );\n}\n\n/**\n * Returns true when two value types are compatible for IN/NOT IN.\n *\n * Unknown types are treated as compatible (deferred to runtime) to preserve\n * flexibility for untyped fields.\n */\nexport function isInSubqueryTypeCompatible(\n  left?: ValueType,\n  right?: ValueType,\n): boolean {\n  const normalizedLeft = normalizeValueType(left);\n  const normalizedRight = normalizeValueType(right);\n\n  if (normalizedLeft === undefined || normalizedRight === undefined) {\n    return true;\n  }\n\n  return normalizedLeft === normalizedRight;\n}\n\n/**\n * Resolves the value type produced by an aggregate projection.\n */\nfunction getAggregateValueType(\n  aggregate: AggregateExpr,\n): ValueType | undefined {\n  switch (aggregate.function) {\n    case \"count\":\n    case \"countDistinct\":\n    case \"sum\":\n    case \"avg\": {\n      return \"number\";\n    }\n    case \"min\":\n    case \"max\": {\n      return normalizeValueType(aggregate.field.valueType);\n    }\n  }\n}\n\n/**\n * Returns effective projected column value types for a subquery.\n *\n * If selective fields are present, they represent the effective projection.\n * Otherwise, falls back to the explicit projection fields.\n */\nfunction getProjectedValueTypes(\n  subquery: QueryAst,\n): readonly (ValueType | undefined)[] {\n  if (subquery.selectiveFields && subquery.selectiveFields.length > 0) {\n    return subquery.selectiveFields.map((field) =>\n      normalizeValueType(field.valueType),\n    );\n  }\n\n  return subquery.projection.fields.map((field) => {\n    if (field.source.__type === \"aggregate\") {\n      return getAggregateValueType(field.source);\n    }\n    return normalizeValueType(field.source.valueType);\n  });\n}\n\n/**\n * Returns the effective number of columns projected by a subquery.\n */\nexport function getSubqueryColumnCount(subquery: QueryAst): number {\n  return getProjectedValueTypes(subquery).length;\n}\n\n/**\n * Returns the value type when a subquery projects exactly one column.\n */\nexport function getSingleSubqueryColumnValueType(\n  subquery: QueryAst,\n): ValueType | undefined {\n  const valueTypes = getProjectedValueTypes(subquery);\n  if (valueTypes.length !== 1) {\n    return undefined;\n  }\n  return valueTypes[0];\n}\n","/**\n * Predicate builders for TypeGraph queries.\n *\n * Provides a fluent API for building type-safe predicates.\n */\nimport { type FulltextQueryMode } from \"../backend/types\";\nimport { type NullCheckOp } from \"../core/types\";\nimport { UnsupportedPredicateError } from \"../errors\";\nimport {\n  type ArrayOp,\n  type ArrayPredicate,\n  type BetweenPredicate,\n  type ComparisonOp,\n  type ComparisonPredicate,\n  type ExistsSubquery,\n  type FieldRef,\n  type FulltextMatchPredicate,\n  type InSubquery,\n  type LiteralValue,\n  type NullPredicate,\n  type ObjectOp,\n  type ObjectPredicate,\n  type ParameterRef,\n  type PredicateExpression,\n  type QueryAst,\n  type StringOp,\n  type StringPredicate,\n  type ValueType,\n  type VectorMetricType,\n  type VectorSimilarityPredicate,\n} from \"./ast\";\nimport { resolveFieldTypeInfoAtJsonPointer } from \"./field-type-info\";\nimport {\n  joinJsonPointers,\n  type JsonPointer,\n  jsonPointer,\n  type JsonPointerInput,\n  type JsonPointerSegment,\n  normalizeJsonPointer,\n  type ResolveJsonPointer,\n  type ResolveJsonPointerSegments,\n} from \"./json-pointer\";\nimport { type FieldTypeInfo } from \"./schema-introspector\";\nimport {\n  getSingleSubqueryColumnValueType,\n  getSubqueryColumnCount,\n  isInSubqueryTypeCompatible,\n  isUnsupportedInSubqueryValueType,\n} from \"./subquery-utils\";\n\n// ============================================================\n// Predicate Builder\n// ============================================================\n\n/**\n * A chainable predicate that can be combined with AND/OR.\n */\nexport type Predicate = Readonly<{\n  __expr: PredicateExpression;\n  and: (other: Predicate) => Predicate;\n  or: (other: Predicate) => Predicate;\n  not: () => Predicate;\n}>;\n\n/**\n * Creates a predicate wrapper with chainable methods.\n */\nfunction predicate(expr: PredicateExpression): Predicate {\n  return {\n    __expr: expr,\n    and: (other: Predicate): Predicate =>\n      predicate({\n        __type: \"and\",\n        predicates: [expr, other.__expr],\n      }),\n    or: (other: Predicate): Predicate =>\n      predicate({\n        __type: \"or\",\n        predicates: [expr, other.__expr],\n      }),\n    not: (): Predicate =>\n      predicate({\n        __type: \"not\",\n        predicate: expr,\n      }),\n  };\n}\n\n// ============================================================\n// Parameter References\n// ============================================================\n\n/**\n * Creates a named parameter reference for prepared queries.\n *\n * Use with `query.prepare()` to create reusable parameterized queries.\n * Only supported in scalar comparison positions (eq, neq, gt, etc.),\n * string operations, and between bounds. Not supported in `in()`/`notIn()`.\n *\n * @example\n * ```typescript\n * const prepared = store.query()\n *   .from(\"Person\", \"p\")\n *   .whereNode(\"p\", (p) => p.name.eq(param(\"name\")))\n *   .select((ctx) => ctx.p)\n *   .prepare();\n *\n * const results = await prepared.execute({ name: \"Alice\" });\n * ```\n */\n// eslint-disable-next-line unicorn/prevent-abbreviations -- concise public API\nexport function param(name: string): ParameterRef {\n  return { __type: \"parameter\", name };\n}\n\n/**\n * Type guard for ParameterRef values.\n */\nexport function isParameterRef(value: unknown): value is ParameterRef {\n  if (typeof value !== \"object\" || value === null) return false;\n  // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition -- runtime guard for untyped input\n  return (value as ParameterRef).__type === \"parameter\";\n}\n\n// ============================================================\n// Field Builder\n// ============================================================\n\n/**\n * A typed field builder for creating predicates.\n */\ntype FieldBuilder<T> =\n  [T] extends [string] ? StringFieldBuilder\n  : [T] extends [number] ? NumberFieldBuilder\n  : [T] extends [boolean] ? BooleanFieldBuilder\n  : [T] extends [Date] ? DateFieldBuilder\n  : [T] extends [readonly (infer U)[]] ? ArrayFieldBuilder<U>\n  : [T] extends [Record<string, unknown>] ? ObjectFieldBuilder<T>\n  : BaseFieldBuilder;\n\n/**\n * Base field operations available on all types.\n */\ntype BaseFieldBuilder = Readonly<{\n  eq: (value: unknown) => Predicate;\n  neq: (value: unknown) => Predicate;\n  isNull: () => Predicate;\n  isNotNull: () => Predicate;\n  in: (values: readonly unknown[]) => Predicate;\n  notIn: (values: readonly unknown[]) => Predicate;\n}>;\n\n/**\n * Options for the `$fulltext.matches()` predicate.\n *\n * Note the term glossary used throughout TypeGraph search:\n * - **`k`** (the positional argument on `.matches(query, k)`) is the\n *   per-predicate top-k cap applied inside the fulltext CTE.\n * - **`limit`** (on store-level `search.fulltext` / `search.hybrid` and\n *   on the query builder) is the final result count returned to the\n *   caller after any fusion.\n */\ntype MatchesOptions = Readonly<{\n  /**\n   * Parse mode for the query string. Default: \"websearch\".\n   *\n   * - \"websearch\": Google-style syntax (quoted phrases, `-excluded`, `OR`).\n   *   Postgres: `websearch_to_tsquery`. SQLite: translated to FTS5 MATCH.\n   * - \"phrase\": treats the whole query as a phrase.\n   * - \"plain\": splits on whitespace and ANDs terms.\n   * - \"raw\": dialect-native syntax passed through unchanged.\n   */\n  mode?: FulltextQueryMode;\n  /**\n   * Language override. Default: per-row language as stored at insert time.\n   */\n  language?: string;\n  /** Minimum relevance score to include. */\n  minScore?: number;\n}>;\n\n/**\n * String-specific field operations.\n *\n * Fulltext match is exposed on `n.$fulltext.matches(...)` at the node\n * level (gated by `searchable()` declarations in the schema), not on\n * individual string fields.\n */\ntype StringFieldBuilder = BaseFieldBuilder &\n  Readonly<{\n    gt: (value: string | ParameterRef) => Predicate;\n    gte: (value: string | ParameterRef) => Predicate;\n    lt: (value: string | ParameterRef) => Predicate;\n    lte: (value: string | ParameterRef) => Predicate;\n    contains: (pattern: string | ParameterRef) => Predicate;\n    startsWith: (pattern: string | ParameterRef) => Predicate;\n    endsWith: (pattern: string | ParameterRef) => Predicate;\n    like: (pattern: string | ParameterRef) => Predicate;\n    ilike: (pattern: string | ParameterRef) => Predicate;\n  }>;\n\n/**\n * Number-specific field operations.\n */\ntype NumberFieldBuilder = BaseFieldBuilder &\n  Readonly<{\n    gt: (value: number | ParameterRef) => Predicate;\n    gte: (value: number | ParameterRef) => Predicate;\n    lt: (value: number | ParameterRef) => Predicate;\n    lte: (value: number | ParameterRef) => Predicate;\n    between: (\n      lower: number | ParameterRef,\n      upper: number | ParameterRef,\n    ) => Predicate;\n  }>;\n\n/**\n * Boolean-specific field operations.\n */\ntype BooleanFieldBuilder = BaseFieldBuilder;\n\n/**\n * Date-specific field operations.\n */\ntype DateFieldBuilder = BaseFieldBuilder &\n  Readonly<{\n    gt: (value: Date | string | ParameterRef) => Predicate;\n    gte: (value: Date | string | ParameterRef) => Predicate;\n    lt: (value: Date | string | ParameterRef) => Predicate;\n    lte: (value: Date | string | ParameterRef) => Predicate;\n    between: (\n      lower: Date | string | ParameterRef,\n      upper: Date | string | ParameterRef,\n    ) => Predicate;\n  }>;\n\ntype ScalarValue = string | number | boolean | Date;\n\ntype ArrayPredicateOps<T> =\n  [T] extends [ScalarValue] ?\n    Readonly<{\n      /** Check if array contains a specific value */\n      contains: (value: T) => Predicate;\n      /** Check if array contains all specified values */\n      containsAll: (values: readonly T[]) => Predicate;\n      /** Check if array contains any of the specified values (overlaps) */\n      containsAny: (values: readonly T[]) => Predicate;\n    }>\n  : Readonly<Record<string, never>>;\n\n/**\n * Array-specific field operations.\n */\ntype ArrayFieldBuilder<T = unknown> = BaseFieldBuilder &\n  Readonly<{\n    /** Check if array is empty */\n    isEmpty: () => Predicate;\n    /** Check if array is not empty */\n    isNotEmpty: () => Predicate;\n    /** Check if array length equals a value */\n    lengthEq: (length: number) => Predicate;\n    /** Check if array length is greater than a value */\n    lengthGt: (length: number) => Predicate;\n    /** Check if array length is greater than or equal to a value */\n    lengthGte: (length: number) => Predicate;\n    /** Check if array length is less than a value */\n    lengthLt: (length: number) => Predicate;\n    /** Check if array length is less than or equal to a value */\n    lengthLte: (length: number) => Predicate;\n  }> &\n  ArrayPredicateOps<T>;\n\n/**\n * Object/JSON-specific field operations.\n */\ntype ResolvedPointerInput<T, Pointer> =\n  Pointer extends string ? ResolveJsonPointer<T, Pointer>\n  : Pointer extends readonly JsonPointerSegment[] ?\n    ResolveJsonPointerSegments<T, Pointer>\n  : unknown;\n\n/**\n * Resolves the type of a nested key access on an object type.\n * Returns ObjectFieldBuilder for nested objects, FieldBuilder for scalars.\n */\ntype NestedFieldBuilder<T, K extends keyof T> =\n  NonNullable<T[K]> extends Record<string, unknown> ?\n    ObjectFieldBuilder<NonNullable<T[K]>>\n  : FieldBuilder<T[K]>;\n\ntype ObjectFieldBuilder<\n  T extends Record<string, unknown> = Record<string, unknown>,\n> = BaseFieldBuilder &\n  Readonly<{\n    /** Access a nested field by key for fluent chaining */\n    get: <K extends keyof T & string>(key: K) => NestedFieldBuilder<T, K>;\n    /** Check if object has a specific key at root level */\n    hasKey: (key: string) => Predicate;\n    /** Check if object has a nested path (JSON Pointer) */\n    hasPath: <P extends JsonPointerInput<T>>(pointer: P) => Predicate;\n    /** Check if value at path equals a value */\n    pathEquals: <P extends JsonPointerInput<T>>(\n      pointer: P,\n      value: string | number | boolean | Date,\n    ) => Predicate;\n    /** Check if value at path (array) contains a value */\n    pathContains: <P extends JsonPointerInput<T>>(\n      pointer: P,\n      value: string | number | boolean | Date,\n    ) => Predicate;\n    /** Check if value at path is null */\n    pathIsNull: <P extends JsonPointerInput<T>>(pointer: P) => Predicate;\n    /** Check if value at path is not null */\n    pathIsNotNull: <P extends JsonPointerInput<T>>(pointer: P) => Predicate;\n    /** Access a nested field to get a typed field builder */\n    field: <P extends JsonPointerInput<T>>(\n      pointer: P,\n    ) => FieldBuilder<ResolvedPointerInput<T, P>>;\n  }>;\n\n/**\n * Options for the similarTo method.\n */\nexport type SimilarToOptions = Readonly<{\n  /** Similarity metric to use. Default: \"cosine\" */\n  metric?: VectorMetricType;\n  /**\n   * Minimum similarity score to include results.\n   * For cosine: 0-1 where 1 is identical.\n   * For L2: maximum distance to include.\n   * For inner_product: minimum inner product value.\n   */\n  minScore?: number;\n}>;\n\n/**\n * Embedding-specific field operations for vector similarity search.\n */\ntype EmbeddingFieldBuilder = BaseFieldBuilder &\n  Readonly<{\n    /**\n     * Find nodes with similar embeddings.\n     * Returns results ordered by similarity (most similar first).\n     *\n     * @param queryEmbedding - The embedding vector to compare against\n     * @param k - Maximum number of results to return (top-k)\n     * @param options - Optional configuration (metric, minScore)\n     *\n     * @example\n     * ```typescript\n     * store.query()\n     *   .from(\"Document\", \"d\")\n     *   .whereNode(\"d\", (d) =>\n     *     d.embedding.similarTo(queryVector, 10, { metric: \"cosine\" })\n     *   )\n     *   .select((ctx) => ({ doc: ctx.d }))\n     *   .execute()\n     * ```\n     */\n    similarTo: (\n      queryEmbedding: readonly number[],\n      k: number,\n      options?: SimilarToOptions,\n    ) => Predicate;\n  }>;\n\n// ============================================================\n// Field Builder Factory\n// ============================================================\n\n/**\n * Creates a field reference.\n */\ntype FieldRefOptions = Readonly<{\n  jsonPointer?: JsonPointer | undefined;\n  valueType?: ValueType | undefined;\n  elementType?: ValueType | undefined;\n}>;\n\nexport function fieldRef(\n  alias: string,\n  path: readonly string[],\n  options?: FieldRefOptions,\n): FieldRef {\n  return {\n    __type: \"field_ref\",\n    alias,\n    path,\n    ...(options?.jsonPointer !== undefined && {\n      jsonPointer: options.jsonPointer,\n    }),\n    ...(options?.valueType !== undefined && { valueType: options.valueType }),\n    ...(options?.elementType !== undefined && {\n      elementType: options.elementType,\n    }),\n  };\n}\n\nfunction coerceLiteralValue(value: unknown): string | number | boolean | Date {\n  if (value instanceof Date) {\n    return value;\n  }\n  if (\n    typeof value === \"string\" ||\n    typeof value === \"number\" ||\n    typeof value === \"boolean\"\n  ) {\n    return value;\n  }\n  throw new Error(`Unsupported literal value type: ${typeof value}`);\n}\n\nfunction inferLiteralValueType(value: string | number | boolean): ValueType {\n  if (typeof value === \"string\") {\n    return \"string\";\n  }\n  if (typeof value === \"number\") {\n    return \"number\";\n  }\n  return \"boolean\";\n}\n\n/**\n * Creates a literal value.\n */\nfunction literal(value: string | number | boolean | Date): LiteralValue {\n  if (value instanceof Date) {\n    return { __type: \"literal\", value: value.toISOString(), valueType: \"date\" };\n  }\n  const valueType = inferLiteralValueType(value);\n  return {\n    __type: \"literal\",\n    value,\n    valueType,\n  };\n}\n\n/**\n * Creates a comparison predicate.\n */\nfunction comparison(\n  op: ComparisonOp,\n  field: FieldRef,\n  value: unknown,\n): Predicate {\n  if (isParameterRef(value)) {\n    const expr: ComparisonPredicate = {\n      __type: \"comparison\",\n      op,\n      left: field,\n      right: value,\n    };\n    return predicate(expr);\n  }\n  const coercedValue = coerceLiteralValue(value);\n  const expr: ComparisonPredicate = {\n    __type: \"comparison\",\n    op,\n    left: field,\n    right: literal(coercedValue),\n  };\n  return predicate(expr);\n}\n\n/**\n * Creates an IN comparison predicate.\n */\nfunction inComparison(\n  op: \"in\" | \"notIn\",\n  field: FieldRef,\n  values: readonly unknown[],\n): Predicate {\n  const literals = values.map((value) => literal(coerceLiteralValue(value)));\n  const expr: ComparisonPredicate = {\n    __type: \"comparison\",\n    op,\n    left: field,\n    right: literals,\n  };\n  return predicate(expr);\n}\n\n/**\n * Creates a string operation predicate.\n */\nfunction stringOp(\n  op: StringOp,\n  field: FieldRef,\n  pattern: string | ParameterRef,\n): Predicate {\n  if (isParameterRef(pattern)) {\n    const expr: StringPredicate = {\n      __type: \"string_op\",\n      op,\n      field,\n      pattern,\n    };\n    return predicate(expr);\n  }\n  const expr: StringPredicate = {\n    __type: \"string_op\",\n    op,\n    field,\n    pattern,\n  };\n  return predicate(expr);\n}\n\n/**\n * Creates a null check predicate.\n */\nfunction nullCheck(op: NullCheckOp, field: FieldRef): Predicate {\n  const expr: NullPredicate = {\n    __type: \"null_check\",\n    op,\n    field,\n  };\n  return predicate(expr);\n}\n\n/**\n * Creates a between predicate.\n */\nfunction between(\n  field: FieldRef,\n  lower: string | number | boolean | Date | ParameterRef,\n  upper: string | number | boolean | Date | ParameterRef,\n): Predicate {\n  const expr: BetweenPredicate = {\n    __type: \"between\",\n    field,\n    lower: isParameterRef(lower) ? lower : literal(lower),\n    upper: isParameterRef(upper) ? upper : literal(upper),\n  };\n  return predicate(expr);\n}\n\n/**\n * Creates a base field builder with common operations.\n */\nfunction baseFieldBuilder(field: FieldRef): BaseFieldBuilder {\n  return {\n    eq: (value) => comparison(\"eq\", field, value),\n    neq: (value) => comparison(\"neq\", field, value),\n    isNull: () => nullCheck(\"isNull\", field),\n    isNotNull: () => nullCheck(\"isNotNull\", field),\n    in: (values) => inComparison(\"in\", field, values),\n    notIn: (values) => inComparison(\"notIn\", field, values),\n  };\n}\n\n/**\n * Creates a string field builder.\n *\n * Fulltext match is not a string-field operation — use\n * `n.$fulltext.matches(...)` at the node level. `searchable()`\n * declarations determine which node kinds expose `$fulltext`.\n */\nexport function stringField(field: FieldRef): StringFieldBuilder {\n  return {\n    ...baseFieldBuilder(field),\n    gt: (value) => comparison(\"gt\", field, value),\n    gte: (value) => comparison(\"gte\", field, value),\n    lt: (value) => comparison(\"lt\", field, value),\n    lte: (value) => comparison(\"lte\", field, value),\n    contains: (pattern) => stringOp(\"contains\", field, pattern),\n    startsWith: (pattern) => stringOp(\"startsWith\", field, pattern),\n    endsWith: (pattern) => stringOp(\"endsWith\", field, pattern),\n    like: (pattern) => stringOp(\"like\", field, pattern),\n    ilike: (pattern) => stringOp(\"ilike\", field, pattern),\n  };\n}\n\n/**\n * Default top-k for `$fulltext.matches()` when the caller does not pass\n * one. Large enough to leave headroom for downstream `.and()` filters,\n * small enough to keep latency reasonable on any dialect.\n */\nconst DEFAULT_FULLTEXT_MATCH_K = 50;\n\n/**\n * Node-level fulltext accessor. Always present on the `NodeAccessor`\n * type — a runtime check throws a clear error if the node kind has no\n * `searchable()` fields. `k` is the top-k cap applied inside the\n * fulltext CTE; defaults to `DEFAULT_FULLTEXT_MATCH_K`. Use a larger\n * value when feeding the result into RRF (`.fuseWith()` /\n * `store.search.hybrid()`).\n */\nexport type FulltextAccessor = Readonly<{\n  matches: (query: string, k?: number, options?: MatchesOptions) => Predicate;\n}>;\n\n/**\n * Creates a node-level fulltext accessor. The runtime check throws for\n * aliases whose node kind has no `searchable()` content, catching the\n * case where the field tag was dropped (e.g. by a schema refactor)\n * after the query was written.\n */\nexport function createFulltextAccessor(\n  alias: string,\n  hasSearchableField: () => boolean,\n): FulltextAccessor {\n  return {\n    matches: (query, k, options) => {\n      if (!hasSearchableField()) {\n        throw new UnsupportedPredicateError(\n          `Cannot call .$fulltext.matches() on alias \"${alias}\" — its ` +\n            `node kind has no fields declared with searchable(). Add at ` +\n            `least one: \\`title: searchable({ language: \"english\" })\\`.`,\n        );\n      }\n      return fulltextMatch(\n        fieldRef(alias, [\"$fulltext\"]),\n        query,\n        k ?? DEFAULT_FULLTEXT_MATCH_K,\n        options,\n      );\n    },\n  };\n}\n\n/**\n * Creates a fulltext match predicate.\n */\nfunction fulltextMatch(\n  field: FieldRef,\n  query: string,\n  limit: number,\n  options?: MatchesOptions,\n): Predicate {\n  if (!Number.isFinite(limit) || limit <= 0) {\n    throw new UnsupportedPredicateError(\n      `matches() limit must be a positive finite number, got ${String(limit)}`,\n    );\n  }\n  const expr: FulltextMatchPredicate = {\n    __type: \"fulltext_match\",\n    field,\n    query,\n    mode: options?.mode ?? \"websearch\",\n    limit,\n    ...(options?.language === undefined ? {} : { language: options.language }),\n    ...(options?.minScore === undefined ? {} : { minScore: options.minScore }),\n  };\n  return predicate(expr);\n}\n\n/**\n * Creates a number field builder.\n */\nexport function numberField(field: FieldRef): NumberFieldBuilder {\n  return {\n    ...baseFieldBuilder(field),\n    gt: (value) => comparison(\"gt\", field, value),\n    gte: (value) => comparison(\"gte\", field, value),\n    lt: (value) => comparison(\"lt\", field, value),\n    lte: (value) => comparison(\"lte\", field, value),\n    between: (lower, upper) => between(field, lower, upper),\n  };\n}\n\n/**\n * Creates a date field builder.\n */\nexport function dateField(field: FieldRef): DateFieldBuilder {\n  return {\n    ...baseFieldBuilder(field),\n    gt: (value) => comparison(\"gt\", field, value),\n    gte: (value) => comparison(\"gte\", field, value),\n    lt: (value) => comparison(\"lt\", field, value),\n    lte: (value) => comparison(\"lte\", field, value),\n    between: (lower, upper) => between(field, lower, upper),\n  };\n}\n\n/**\n * Creates a base field builder (for booleans, enums, and unknown types).\n * Only provides the fundamental operations: eq, neq, isNull, isNotNull, in, notIn.\n */\nexport function baseField(field: FieldRef): BaseFieldBuilder {\n  return baseFieldBuilder(field);\n}\n\n/**\n * Creates an array operation predicate.\n */\nfunction arrayOp(\n  op: ArrayOp,\n  field: FieldRef,\n  values?: readonly unknown[],\n  length?: number,\n): Predicate {\n  const expr: ArrayPredicate = {\n    __type: \"array_op\",\n    op,\n    field,\n    ...(values !== undefined && {\n      values: values.map((value) => literal(coerceLiteralValue(value))),\n    }),\n    ...(length !== undefined && { length }),\n  };\n  return predicate(expr);\n}\n\n/**\n * Creates an array field builder.\n */\nexport function arrayField<T = unknown>(field: FieldRef): ArrayFieldBuilder<T> {\n  // The type assertion is needed because ArrayFieldBuilder conditionally includes\n  // contains/containsAll/containsAny based on whether T extends ScalarValue.\n  // At runtime we always provide them - they just won't type-check if T isn't scalar.\n  return {\n    ...baseFieldBuilder(field),\n    contains: (value: T) => arrayOp(\"contains\", field, [value]),\n    containsAll: (values: readonly T[]) =>\n      arrayOp(\"containsAll\", field, values),\n    containsAny: (values: readonly T[]) =>\n      arrayOp(\"containsAny\", field, values),\n    isEmpty: () => arrayOp(\"isEmpty\", field),\n    isNotEmpty: () => arrayOp(\"isNotEmpty\", field),\n    lengthEq: (length: number) => arrayOp(\"lengthEq\", field, undefined, length),\n    lengthGt: (length: number) => arrayOp(\"lengthGt\", field, undefined, length),\n    lengthGte: (length: number) =>\n      arrayOp(\"lengthGte\", field, undefined, length),\n    lengthLt: (length: number) => arrayOp(\"lengthLt\", field, undefined, length),\n    lengthLte: (length: number) =>\n      arrayOp(\"lengthLte\", field, undefined, length),\n  } as unknown as ArrayFieldBuilder<T>;\n}\n\n/**\n * Creates a vector similarity predicate.\n */\nfunction vectorSimilarity(\n  field: FieldRef,\n  queryEmbedding: readonly number[],\n  limit: number,\n  options?: SimilarToOptions,\n): Predicate {\n  const expr: VectorSimilarityPredicate = {\n    __type: \"vector_similarity\",\n    field,\n    queryEmbedding,\n    // Leave metric unset when the caller didn't specify one, so the compiler\n    // resolves the field's declared metric per kind. Defaulting to \"cosine\"\n    // here would mis-rank l2/inner_product fields and bypass their ANN index.\n    ...(options?.metric !== undefined && { metric: options.metric }),\n    limit,\n    ...(options?.minScore !== undefined && { minScore: options.minScore }),\n  };\n  return predicate(expr);\n}\n\n/**\n * Creates an embedding field builder for vector similarity search.\n */\nexport function embeddingField(field: FieldRef): EmbeddingFieldBuilder {\n  return {\n    ...baseFieldBuilder(field),\n    similarTo: (queryEmbedding, k, options) =>\n      vectorSimilarity(field, queryEmbedding, k, options),\n  };\n}\n\nexport function buildFieldBuilderForTypeInfo(\n  field: FieldRef,\n  typeInfo: FieldTypeInfo | undefined,\n): BaseFieldBuilder {\n  if (!typeInfo) {\n    return baseField(field);\n  }\n\n  switch (typeInfo.valueType) {\n    case \"string\": {\n      return stringField(field);\n    }\n    case \"number\": {\n      return numberField(field);\n    }\n    case \"boolean\": {\n      return baseField(field);\n    }\n    case \"date\": {\n      return dateField(field);\n    }\n    case \"array\": {\n      return arrayField(field);\n    }\n    case \"object\": {\n      return objectField(field, { typeInfo });\n    }\n    case \"embedding\": {\n      return embeddingField(field);\n    }\n    case \"unknown\": {\n      return baseField(field);\n    }\n  }\n}\n\nfunction resolvePointerTypeInfo(\n  typeInfo: FieldTypeInfo | undefined,\n  pointer: JsonPointer,\n): FieldTypeInfo | undefined {\n  return resolveFieldTypeInfoAtJsonPointer(typeInfo, pointer);\n}\n\n/**\n * Creates an object operation predicate.\n */\ntype ObjectPredicateOptions = Readonly<{\n  valueType?: ValueType;\n  elementType?: ValueType;\n}>;\n\nfunction objectOp(\n  op: ObjectOp,\n  field: FieldRef,\n  pointer: JsonPointer,\n  value?: unknown,\n  options?: ObjectPredicateOptions,\n): Predicate {\n  const expr: ObjectPredicate = {\n    __type: \"object_op\",\n    op,\n    field,\n    pointer,\n    ...(value !== undefined && {\n      value: literal(coerceLiteralValue(value)),\n    }),\n    ...(options?.valueType !== undefined && { valueType: options.valueType }),\n    ...(options?.elementType !== undefined && {\n      elementType: options.elementType,\n    }),\n  };\n  return predicate(expr);\n}\n\n/**\n * Creates an object/JSON field builder.\n */\ntype ObjectFieldOptions = Readonly<{\n  typeInfo?: FieldTypeInfo;\n}>;\n\nexport function objectField<\n  T extends Record<string, unknown> = Record<string, unknown>,\n>(field: FieldRef, options?: ObjectFieldOptions): ObjectFieldBuilder<T> {\n  const basePointer = field.jsonPointer;\n\n  return {\n    ...baseFieldBuilder(field),\n    get: <K extends keyof T & string>(key: K) => {\n      const pointer = jsonPointer([key]);\n      const nestedPointer = joinJsonPointers(basePointer, pointer);\n      const resolved = resolvePointerTypeInfo(options?.typeInfo, pointer);\n      const nestedRef = fieldRef(field.alias, field.path, {\n        jsonPointer: nestedPointer,\n        ...(resolved?.valueType !== undefined && {\n          valueType: resolved.valueType,\n        }),\n        ...(resolved?.elementType !== undefined && {\n          elementType: resolved.elementType,\n        }),\n      });\n      return buildFieldBuilderForTypeInfo(nestedRef, resolved) as ReturnType<\n        ObjectFieldBuilder<T>[\"get\"]\n      >;\n    },\n    hasKey: (key) => {\n      const pointer = jsonPointer([key]);\n      resolvePointerTypeInfo(options?.typeInfo, pointer);\n      return objectOp(\"hasKey\", field, pointer);\n    },\n    hasPath: <P extends JsonPointerInput<T>>(pointer: P) => {\n      const normalized = normalizeJsonPointer(pointer as JsonPointerInput<T>);\n      resolvePointerTypeInfo(options?.typeInfo, normalized);\n      return objectOp(\"hasPath\", field, normalized);\n    },\n    pathEquals: <P extends JsonPointerInput<T>>(\n      pointer: P,\n      value: string | number | boolean | Date,\n    ) => {\n      const normalized = normalizeJsonPointer(pointer as JsonPointerInput<T>);\n      const resolved = resolvePointerTypeInfo(options?.typeInfo, normalized);\n      if (\n        resolved &&\n        (resolved.valueType === \"array\" || resolved.valueType === \"object\")\n      ) {\n        throw new Error(\"pathEquals is only supported for scalar JSON values\");\n      }\n      const predicateOptions: ObjectPredicateOptions | undefined =\n        resolved?.valueType === undefined ?\n          undefined\n        : { valueType: resolved.valueType };\n      return objectOp(\"pathEquals\", field, normalized, value, predicateOptions);\n    },\n    pathContains: <P extends JsonPointerInput<T>>(\n      pointer: P,\n      value: string | number | boolean | Date,\n    ) => {\n      const normalized = normalizeJsonPointer(pointer as JsonPointerInput<T>);\n      const resolved = resolvePointerTypeInfo(options?.typeInfo, normalized);\n      if (resolved && resolved.valueType !== \"array\") {\n        throw new Error(\"pathContains is only supported for JSON array values\");\n      }\n      const predicateOptions: ObjectPredicateOptions | undefined =\n        resolved?.elementType === undefined ?\n          undefined\n        : { elementType: resolved.elementType };\n      return objectOp(\n        \"pathContains\",\n        field,\n        normalized,\n        value,\n        predicateOptions,\n      );\n    },\n    pathIsNull: <P extends JsonPointerInput<T>>(pointer: P) => {\n      const normalized = normalizeJsonPointer(pointer as JsonPointerInput<T>);\n      const resolved = resolvePointerTypeInfo(options?.typeInfo, normalized);\n      const predicateOptions: ObjectPredicateOptions | undefined =\n        resolved?.valueType === undefined ?\n          undefined\n        : { valueType: resolved.valueType };\n      return objectOp(\n        \"pathIsNull\",\n        field,\n        normalized,\n        undefined,\n        predicateOptions,\n      );\n    },\n    pathIsNotNull: <P extends JsonPointerInput<T>>(pointer: P) => {\n      const normalized = normalizeJsonPointer(pointer as JsonPointerInput<T>);\n      const resolved = resolvePointerTypeInfo(options?.typeInfo, normalized);\n      const predicateOptions: ObjectPredicateOptions | undefined =\n        resolved?.valueType === undefined ?\n          undefined\n        : { valueType: resolved.valueType };\n      return objectOp(\n        \"pathIsNotNull\",\n        field,\n        normalized,\n        undefined,\n        predicateOptions,\n      );\n    },\n    field: <P extends JsonPointerInput<T>>(pointer: P) => {\n      const normalized = normalizeJsonPointer(pointer as JsonPointerInput<T>);\n      const nestedPointer = joinJsonPointers(basePointer, normalized);\n      const resolved = resolvePointerTypeInfo(options?.typeInfo, normalized);\n      const nestedRef = fieldRef(field.alias, field.path, {\n        jsonPointer: nestedPointer,\n        ...(resolved?.valueType !== undefined && {\n          valueType: resolved.valueType,\n        }),\n        ...(resolved?.elementType !== undefined && {\n          elementType: resolved.elementType,\n        }),\n      });\n      return buildFieldBuilderForTypeInfo(nestedRef, resolved) as FieldBuilder<\n        ResolvedPointerInput<T, P>\n      >;\n    },\n  };\n}\n\n// ============================================================\n// Subquery Predicates\n// ============================================================\n\n/**\n * Creates an EXISTS subquery predicate.\n * Returns true if the subquery returns at least one row.\n *\n * @param subquery - The subquery AST to check for existence\n *\n * @example\n * ```typescript\n * // Find persons who have at least one order\n * query\n *   .from(\"Person\", \"p\")\n *   .whereNode(\"p\", () =>\n *     exists(\n *       query.from(\"Order\", \"o\")\n *         .whereNode(\"o\", (o) => o.customerId.eq(field(\"p.id\")))\n *         .select((ctx) => ({ id: ctx.o.id }))\n *         .toAst()\n *     )\n *   )\n * ```\n */\nexport function exists(subquery: QueryAst): Predicate {\n  const expr: ExistsSubquery = {\n    __type: \"exists\",\n    subquery,\n    negated: false,\n  };\n  return predicate(expr);\n}\n\n/**\n * Creates a NOT EXISTS subquery predicate.\n * Returns true if the subquery returns no rows.\n *\n * @param subquery - The subquery AST to check for non-existence\n */\nexport function notExists(subquery: QueryAst): Predicate {\n  const expr: ExistsSubquery = {\n    __type: \"exists\",\n    subquery,\n    negated: true,\n  };\n  return predicate(expr);\n}\n\n/**\n * Creates an IN subquery predicate.\n * Returns true if the field value is in the subquery results.\n *\n * @param field - The field to check\n * @param subquery - The subquery AST that returns a single column\n *\n * @example\n * ```typescript\n * // Find persons whose ID is in the VIP list\n * query\n *   .from(\"Person\", \"p\")\n *   .where(() =>\n *     inSubquery(\n *       fieldRef(\"p\", [\"id\"]),\n *       query.from(\"VIPMember\", \"v\")\n *         .aggregate({\n *           id: fieldRef(\"v\", [\"props\", \"personId\"], { valueType: \"string\" }),\n *         })\n *         .toAst()\n *     )\n *   )\n * ```\n */\nexport function inSubquery(field: FieldRef, subquery: QueryAst): Predicate {\n  assertSingleColumnSubquery(subquery);\n  assertCompatibleSubqueryValueTypes(field, subquery);\n  const expr: InSubquery = {\n    __type: \"in_subquery\",\n    field,\n    subquery,\n    negated: false,\n  };\n  return predicate(expr);\n}\n\n/**\n * Creates a NOT IN subquery predicate.\n * Returns true if the field value is not in the subquery results.\n *\n * @param field - The field to check\n * @param subquery - The subquery AST that returns a single column\n */\nexport function notInSubquery(field: FieldRef, subquery: QueryAst): Predicate {\n  assertSingleColumnSubquery(subquery);\n  assertCompatibleSubqueryValueTypes(field, subquery);\n  const expr: InSubquery = {\n    __type: \"in_subquery\",\n    field,\n    subquery,\n    negated: true,\n  };\n  return predicate(expr);\n}\n\n/**\n * Ensures IN/NOT IN subqueries project exactly one column.\n */\nfunction assertSingleColumnSubquery(subquery: QueryAst): void {\n  const columnCount = getSubqueryColumnCount(subquery);\n  if (columnCount === 1) return;\n\n  throw new UnsupportedPredicateError(\n    `IN/NOT IN subquery must project exactly 1 column, but got ${columnCount}`,\n    { subqueryColumnCount: columnCount },\n    {\n      suggestion:\n        \"Use aggregate() with exactly one projected field for scalar IN/NOT IN subqueries.\",\n    },\n  );\n}\n\n/**\n * Ensures IN/NOT IN subquery and field value types are compatible when known.\n */\nfunction assertCompatibleSubqueryValueTypes(\n  field: FieldRef,\n  subquery: QueryAst,\n): void {\n  const fieldValueType = field.valueType;\n  const subqueryValueType = getSingleSubqueryColumnValueType(subquery);\n  const resolvedValueType = fieldValueType ?? subqueryValueType;\n\n  if (isUnsupportedInSubqueryValueType(resolvedValueType)) {\n    throw new UnsupportedPredicateError(\n      `IN/NOT IN subquery does not support ${String(resolvedValueType)} values`,\n      { valueType: resolvedValueType },\n      {\n        suggestion:\n          \"Use scalar fields (string/number/boolean/date) in IN/NOT IN predicates.\",\n      },\n    );\n  }\n\n  if (isInSubqueryTypeCompatible(fieldValueType, subqueryValueType)) {\n    return;\n  }\n\n  throw new UnsupportedPredicateError(\n    `IN/NOT IN type mismatch: field type \"${String(fieldValueType)}\" does not match subquery column type \"${String(subqueryValueType)}\"`,\n    {\n      fieldValueType,\n      subqueryValueType,\n    },\n  );\n}\n","/**\n * SQL Schema Configuration for Query Compilation\n *\n * Provides table and column identifiers that the query compiler uses.\n * This allows the compiler to work with custom table names instead of\n * hard-coded defaults.\n */\nimport { type SQL, sql } from \"drizzle-orm\";\n\nimport { type VectorIndexType, type VectorMetric } from \"../../backend/types\";\nimport { MAX_PG_IDENTIFIER_LENGTH } from \"../../constants\";\nimport { ConfigurationError } from \"../../errors\";\n\n/**\n * Table names for TypeGraph SQL schema.\n *\n * Carries every customizable physical-table name the backend exposes,\n * including the secondary tables (`uniques`) that the query compiler\n * itself doesn't reference but `materializeRemovals` and other\n * cleanup paths need to address by name. Backends without a\n * `uniques` table (custom embeddings-only stores) leave it as the\n * default — the cleanup path is a no-op for kinds with no unique\n * rows.\n */\nexport type SqlTableNames = Readonly<{\n  /** Nodes table name (default: \"typegraph_nodes\") */\n  nodes: string;\n  /** Edges table name (default: \"typegraph_edges\") */\n  edges: string;\n  /** Node fulltext table name (default: \"typegraph_node_fulltext\") */\n  fulltext: string;\n  /** Node uniques table name (default: \"typegraph_node_uniques\") */\n  uniques: string;\n}>;\n\n/**\n * SQL schema configuration for query compilation.\n * Contains table identifiers and utility methods for generating SQL references.\n */\nexport type SqlSchema = Readonly<{\n  /** Table names */\n  tables: SqlTableNames;\n  /** Get a SQL reference to the nodes table */\n  nodesTable: SQL;\n  /** Get a SQL reference to the edges table */\n  edgesTable: SQL;\n  /** Get a SQL reference to the fulltext table */\n  fulltextTable: SQL;\n}>;\n\n/**\n * Default table names matching the standard TypeGraph schema.\n */\nconst DEFAULT_TABLE_NAMES: SqlTableNames = {\n  nodes: \"typegraph_nodes\",\n  edges: \"typegraph_edges\",\n  fulltext: \"typegraph_node_fulltext\",\n  uniques: \"typegraph_node_uniques\",\n};\n\n/**\n * Regex for valid SQL identifiers.\n * Must start with a letter or underscore.\n * Can contain letters, digits, underscores, and dollar signs.\n * Dollar signs are a PostgreSQL extension but commonly supported.\n */\nconst VALID_IDENTIFIER_PATTERN = /^[a-z_][a-z0-9_$]*$/i;\n\n/**\n * Validates that a table name is a valid SQL identifier.\n *\n * @throws Error if the table name is invalid\n */\nfunction validateTableName(name: string, label: string): void {\n  if (!name || name.length === 0) {\n    throw new ConfigurationError(`${label} table name cannot be empty`);\n  }\n  if (name.length > MAX_PG_IDENTIFIER_LENGTH) {\n    throw new ConfigurationError(\n      `${label} table name exceeds maximum length of ${MAX_PG_IDENTIFIER_LENGTH} characters`,\n    );\n  }\n  if (!VALID_IDENTIFIER_PATTERN.test(name)) {\n    throw new ConfigurationError(\n      `${label} table name \"${name}\" is not a valid SQL identifier. ` +\n        `Table names must start with a letter or underscore and contain only letters, digits, underscores, or dollar signs.`,\n    );\n  }\n}\n\n/**\n * Quotes a SQL identifier using ANSI SQL standard double quotes.\n * Escapes any embedded double quotes by doubling them.\n *\n * This works for both SQLite and PostgreSQL.\n */\nfunction quoteIdentifier(name: string): string {\n  return `\"${name.replaceAll('\"', '\"\"')}\"`;\n}\n\n/**\n * Creates a SqlSchema configuration from table names.\n *\n * Table names are validated to ensure they are valid SQL identifiers.\n * This prevents SQL injection and ensures compatibility across databases.\n *\n * @param names - Optional custom table names (defaults to standard names)\n * @returns SqlSchema configuration for query compilation\n * @throws Error if any table name is invalid\n *\n * @example\n * ```typescript\n * // Use default table names\n * const schema = createSqlSchema();\n *\n * // Use custom table names\n * const schema = createSqlSchema({\n *   nodes: \"myapp_nodes\",\n *   edges: \"myapp_edges\",\n *   fulltext: \"myapp_fulltext\",\n * });\n * ```\n */\nexport function createSqlSchema(names: Partial<SqlTableNames> = {}): SqlSchema {\n  const tables: SqlTableNames = { ...DEFAULT_TABLE_NAMES, ...names };\n\n  // Validate all table names\n  validateTableName(tables.nodes, \"nodes\");\n  validateTableName(tables.edges, \"edges\");\n  validateTableName(tables.fulltext, \"fulltext\");\n  validateTableName(tables.uniques, \"uniques\");\n\n  return {\n    tables,\n    nodesTable: sql.raw(quoteIdentifier(tables.nodes)),\n    edgesTable: sql.raw(quoteIdentifier(tables.edges)),\n    fulltextTable: sql.raw(quoteIdentifier(tables.fulltext)),\n  };\n}\n\n/**\n * Default SqlSchema using standard TypeGraph table names.\n */\nexport const DEFAULT_SQL_SCHEMA: SqlSchema = createSqlSchema();\n\n/**\n * The compiler's resolved view of one declared embedding field — the\n * `(dimensions, metric, indexType)` a {@link VectorStrategy} needs to\n * name and scan the field's typed per-`(kind, field)` storage. Sourced\n * from the registered node schema's `embedding()` declaration when the\n * store builds its compile options.\n */\nexport type VectorSlotDescriptor = Readonly<{\n  dimensions: number;\n  metric: VectorMetric;\n  indexType: VectorIndexType;\n}>;\n\n/**\n * Map of declared embedding slots keyed by {@link vectorSlotKey} -\n * `\"<nodeKind>\\0<fieldPath>\"` (NUL-separated). Carries every `(concrete kind,\n * fieldPath)` that declares an embedding field, so the compiler's\n * `field.similarTo(...)` CTE can UNION ALL the per-field tables for the\n * kinds in an alias that actually declare the field (only\n * `includeSubClasses` yields more than one).\n */\nexport type VectorSlotMap = ReadonlyMap<string, VectorSlotDescriptor>;\n\n/** NUL-delimited composite key for {@link VectorSlotMap}. */\nexport function vectorSlotKey(nodeKind: string, fieldPath: string): string {\n  return `${nodeKind}\\u0000${fieldPath}`;\n}\n\n/**\n * CTE aliases used by the standard query emitter. Joining on these names\n * across multiple builder files is fragile when typed as raw strings —\n * import these constants instead.\n */\nexport const ALIAS_CTE_PREFIX = \"cte_\" as const;\nexport const EMBEDDINGS_CTE_ALIAS = \"cte_embeddings\" as const;\nexport const FULLTEXT_CTE_ALIAS = \"cte_fulltext\" as const;\nexport const HYBRID_CANDIDATES_CTE_ALIAS = \"cte_relevance_candidates\" as const;\n","import { CompilerInvariantError } from \"../../../errors\";\nimport {\n  type LimitOffsetPlanNode,\n  type LogicalPlan,\n  type LogicalPlanNode,\n  type ProjectPlanNode,\n  type SortPlanNode,\n} from \"../plan\";\n\nexport type ProjectPlanShape = Readonly<{\n  hasAggregate: boolean;\n  hasFulltextMatch: boolean;\n  hasLimitOffset: boolean;\n  hasRecursiveExpand: boolean;\n  hasSetOperation: boolean;\n  hasSort: boolean;\n  hasVectorKnn: boolean;\n  limitOffsetNode: LimitOffsetPlanNode | undefined;\n  rootProjectNode: ProjectPlanNode;\n  sortNode: SortPlanNode | undefined;\n}>;\n\nexport type SetOperationPlanShape = Readonly<{\n  hasLimitOffset: boolean;\n  hasSetOperation: boolean;\n  hasSort: boolean;\n  limitOffsetNode: LimitOffsetPlanNode | undefined;\n  sortNode: SortPlanNode | undefined;\n}>;\n\nfunction collectPlanOperations(node: LogicalPlanNode, ops: Set<string>): void {\n  ops.add(node.op);\n\n  switch (node.op) {\n    case \"aggregate\":\n    case \"filter\":\n    case \"fulltext_match\":\n    case \"join\":\n    case \"limit_offset\":\n    case \"project\":\n    case \"recursive_expand\":\n    case \"sort\":\n    case \"vector_knn\": {\n      collectPlanOperations(node.input, ops);\n      return;\n    }\n    case \"set_op\": {\n      collectPlanOperations(node.left, ops);\n      collectPlanOperations(node.right, ops);\n      return;\n    }\n    case \"scan\": {\n      return;\n    }\n  }\n}\n\nfunction findUnaryNodeInProjectChain<TNode extends LogicalPlanNode>(\n  rootNode: ProjectPlanNode,\n  op: TNode[\"op\"],\n): TNode | undefined {\n  let currentNode: LogicalPlanNode = rootNode.input;\n\n  for (;;) {\n    if (currentNode.op === op) {\n      return currentNode as TNode;\n    }\n\n    switch (currentNode.op) {\n      case \"aggregate\":\n      case \"filter\":\n      case \"fulltext_match\":\n      case \"join\":\n      case \"limit_offset\":\n      case \"recursive_expand\":\n      case \"sort\":\n      case \"vector_knn\": {\n        currentNode = currentNode.input;\n        continue;\n      }\n      case \"project\":\n      case \"scan\":\n      case \"set_op\": {\n        return undefined;\n      }\n    }\n  }\n}\n\nfunction inspectProjectPlan(logicalPlan: LogicalPlan): ProjectPlanShape {\n  if (logicalPlan.root.op !== \"project\") {\n    throw new CompilerInvariantError(\n      `SQL emitter expected logical plan root to be \"project\", got \"${logicalPlan.root.op}\"`,\n      { component: \"plan-inspector\" },\n    );\n  }\n\n  const operations = new Set<string>();\n  collectPlanOperations(logicalPlan.root, operations);\n\n  const limitOffsetNode = findUnaryNodeInProjectChain<LimitOffsetPlanNode>(\n    logicalPlan.root,\n    \"limit_offset\",\n  );\n  const sortNode = findUnaryNodeInProjectChain<SortPlanNode>(\n    logicalPlan.root,\n    \"sort\",\n  );\n\n  return {\n    hasAggregate: operations.has(\"aggregate\"),\n    hasFulltextMatch: operations.has(\"fulltext_match\"),\n    hasLimitOffset: operations.has(\"limit_offset\"),\n    hasRecursiveExpand: operations.has(\"recursive_expand\"),\n    hasSetOperation: operations.has(\"set_op\"),\n    hasSort: operations.has(\"sort\"),\n    hasVectorKnn: operations.has(\"vector_knn\"),\n    limitOffsetNode,\n    rootProjectNode: logicalPlan.root,\n    sortNode,\n  };\n}\n\nexport function inspectStandardProjectPlan(\n  logicalPlan: LogicalPlan,\n): ProjectPlanShape {\n  const shape = inspectProjectPlan(logicalPlan);\n  if (shape.hasSetOperation) {\n    throw new CompilerInvariantError(\n      'Standard SQL emitter does not support plans containing \"set_op\" nodes',\n      { component: \"plan-inspector\" },\n    );\n  }\n  if (shape.hasRecursiveExpand) {\n    throw new CompilerInvariantError(\n      'Standard SQL emitter does not support plans containing \"recursive_expand\" nodes',\n      { component: \"plan-inspector\" },\n    );\n  }\n  return shape;\n}\n\nexport function inspectRecursiveProjectPlan(\n  logicalPlan: LogicalPlan,\n): ProjectPlanShape {\n  const shape = inspectProjectPlan(logicalPlan);\n  if (!shape.hasRecursiveExpand) {\n    throw new CompilerInvariantError(\n      'Recursive SQL emitter expected logical plan to contain a \"recursive_expand\" node',\n      { component: \"plan-inspector\" },\n    );\n  }\n  if (shape.hasSetOperation) {\n    throw new CompilerInvariantError(\n      'Recursive SQL emitter does not support plans containing \"set_op\" nodes',\n      { component: \"plan-inspector\" },\n    );\n  }\n  return shape;\n}\n\nfunction findTopLevelLimitOffsetNode(\n  rootNode: LogicalPlanNode,\n): LimitOffsetPlanNode | undefined {\n  let currentNode: LogicalPlanNode = rootNode;\n\n  for (;;) {\n    if (currentNode.op === \"limit_offset\") {\n      return currentNode;\n    }\n\n    switch (currentNode.op) {\n      case \"aggregate\":\n      case \"filter\":\n      case \"fulltext_match\":\n      case \"join\":\n      case \"project\":\n      case \"recursive_expand\":\n      case \"sort\":\n      case \"vector_knn\": {\n        currentNode = currentNode.input;\n        continue;\n      }\n      case \"scan\":\n      case \"set_op\": {\n        return undefined;\n      }\n    }\n  }\n}\n\nfunction findTopLevelSortNode(\n  rootNode: LogicalPlanNode,\n): SortPlanNode | undefined {\n  let currentNode: LogicalPlanNode = rootNode;\n\n  for (;;) {\n    if (currentNode.op === \"sort\") {\n      return currentNode;\n    }\n\n    switch (currentNode.op) {\n      case \"aggregate\":\n      case \"filter\":\n      case \"fulltext_match\":\n      case \"join\":\n      case \"limit_offset\":\n      case \"project\":\n      case \"recursive_expand\":\n      case \"vector_knn\": {\n        currentNode = currentNode.input;\n        continue;\n      }\n      case \"scan\":\n      case \"set_op\": {\n        return undefined;\n      }\n    }\n  }\n}\n\nexport function inspectSetOperationPlan(\n  logicalPlan: LogicalPlan,\n): SetOperationPlanShape {\n  const operations = new Set<string>();\n  collectPlanOperations(logicalPlan.root, operations);\n\n  if (!operations.has(\"set_op\")) {\n    throw new CompilerInvariantError(\n      'Set-operation SQL emitter expected logical plan to contain a \"set_op\" node',\n      { component: \"plan-inspector\" },\n    );\n  }\n\n  const limitOffsetNode = findTopLevelLimitOffsetNode(logicalPlan.root);\n  const sortNode = findTopLevelSortNode(logicalPlan.root);\n\n  return {\n    hasLimitOffset: limitOffsetNode !== undefined,\n    hasSetOperation: true,\n    hasSort: sortNode !== undefined,\n    limitOffsetNode,\n    sortNode,\n  };\n}\n","import { type SQL, sql } from \"drizzle-orm\";\n\nimport { CompilerInvariantError } from \"../../../errors\";\nimport { type LogicalPlan } from \"../plan\";\nimport { inspectRecursiveProjectPlan } from \"./plan-inspector\";\n\nexport type RecursiveQueryEmitterInput = Readonly<{\n  depthFilter: SQL;\n  limitOffset?: SQL;\n  logicalPlan: LogicalPlan;\n  orderBy?: SQL;\n  projection: SQL;\n  recursiveCte: SQL;\n}>;\n\nfunction assertRecursiveEmitterClauseAlignment(\n  logicalPlan: LogicalPlan,\n  input: RecursiveQueryEmitterInput,\n): void {\n  const planShape = inspectRecursiveProjectPlan(logicalPlan);\n  if (planShape.hasSort && input.orderBy === undefined) {\n    throw new CompilerInvariantError(\n      \"Recursive SQL emitter expected ORDER BY clause for plan containing a sort node\",\n      { component: \"recursive-emitter\" },\n    );\n  }\n  if (!planShape.hasSort && input.orderBy !== undefined) {\n    throw new CompilerInvariantError(\n      \"Recursive SQL emitter received ORDER BY clause for a plan without sort nodes\",\n      { component: \"recursive-emitter\" },\n    );\n  }\n  if (planShape.hasLimitOffset && input.limitOffset === undefined) {\n    throw new CompilerInvariantError(\n      \"Recursive SQL emitter expected LIMIT/OFFSET clause for plan containing a limit_offset node\",\n      { component: \"recursive-emitter\" },\n    );\n  }\n  if (!planShape.hasLimitOffset && input.limitOffset !== undefined) {\n    throw new CompilerInvariantError(\n      \"Recursive SQL emitter received LIMIT/OFFSET clause for a plan without limit_offset nodes\",\n      { component: \"recursive-emitter\" },\n    );\n  }\n}\n\nexport function emitRecursiveQuerySql(input: RecursiveQueryEmitterInput): SQL {\n  assertRecursiveEmitterClauseAlignment(input.logicalPlan, input);\n\n  const parts: SQL[] = [\n    sql`WITH RECURSIVE`,\n    input.recursiveCte,\n    sql`SELECT ${input.projection}`,\n    sql`FROM recursive_cte`,\n    input.depthFilter,\n  ];\n\n  if (input.orderBy !== undefined) {\n    parts.push(input.orderBy);\n  }\n  if (input.limitOffset !== undefined) {\n    parts.push(input.limitOffset);\n  }\n\n  return sql.join(parts, sql` `);\n}\n","import { type SQL, sql } from \"drizzle-orm\";\n\nimport { CompilerInvariantError } from \"../../../errors\";\nimport { type LogicalPlan } from \"../plan\";\nimport { inspectSetOperationPlan } from \"./plan-inspector\";\n\nexport type SetOperationQueryEmitterInput = Readonly<{\n  baseQuery: SQL;\n  ctes?: readonly SQL[];\n  logicalPlan: LogicalPlan;\n  suffixClauses?: readonly SQL[];\n}>;\n\nfunction assertSetOperationEmitterClauseAlignment(\n  logicalPlan: LogicalPlan,\n  suffixClauses: readonly SQL[] | undefined,\n): void {\n  const shape = inspectSetOperationPlan(logicalPlan);\n  const hasSuffixClauses =\n    suffixClauses !== undefined && suffixClauses.length > 0;\n\n  if (!shape.hasSort && !shape.hasLimitOffset && hasSuffixClauses) {\n    throw new CompilerInvariantError(\n      \"Set-operation SQL emitter received suffix clauses for a plan without top-level sort or limit_offset nodes\",\n      { component: \"set-operation-emitter\" },\n    );\n  }\n\n  if (!hasSuffixClauses) {\n    if (shape.hasSort || shape.hasLimitOffset) {\n      throw new CompilerInvariantError(\n        \"Set-operation SQL emitter expected suffix clauses for plan containing top-level sort or limit_offset nodes\",\n        { component: \"set-operation-emitter\" },\n      );\n    }\n    return;\n  }\n\n  const limitOffsetClauseCount =\n    shape.limitOffsetNode === undefined ?\n      0\n    : (shape.limitOffsetNode.limit === undefined ? 0 : 1) +\n      (shape.limitOffsetNode.offset === undefined ? 0 : 1);\n  const expectedClauseCount =\n    (shape.sortNode === undefined ? 0 : 1) + limitOffsetClauseCount;\n\n  if (suffixClauses.length !== expectedClauseCount) {\n    throw new CompilerInvariantError(\n      `Set-operation SQL emitter expected ${String(expectedClauseCount)} top-level suffix clause(s) from logical plan, got ${String(suffixClauses.length)}`,\n      { component: \"set-operation-emitter\" },\n    );\n  }\n}\n\nexport function emitSetOperationQuerySql(\n  input: SetOperationQueryEmitterInput,\n): SQL {\n  assertSetOperationEmitterClauseAlignment(\n    input.logicalPlan,\n    input.suffixClauses,\n  );\n\n  const parts: SQL[] = [];\n  if (input.ctes !== undefined && input.ctes.length > 0) {\n    parts.push(sql`WITH ${sql.join([...input.ctes], sql`, `)}`);\n  }\n\n  parts.push(input.baseQuery);\n\n  if (input.suffixClauses !== undefined && input.suffixClauses.length > 0) {\n    parts.push(...input.suffixClauses);\n  }\n\n  return sql.join(parts, sql` `);\n}\n","import { type SQL, sql } from \"drizzle-orm\";\n\nimport { CompilerInvariantError } from \"../../../errors\";\nimport { type LogicalPlan } from \"../plan\";\nimport { inspectStandardProjectPlan } from \"./plan-inspector\";\n\nexport type StandardQueryEmitterInput = Readonly<{\n  ctes: readonly SQL[];\n  fromClause: SQL;\n  groupBy?: SQL;\n  having?: SQL;\n  limitOffset?: SQL;\n  logicalPlan: LogicalPlan;\n  orderBy?: SQL;\n  projection: SQL;\n}>;\n\nfunction assertStandardEmitterClauseAlignment(\n  logicalPlan: LogicalPlan,\n  input: StandardQueryEmitterInput,\n): void {\n  const planShape = inspectStandardProjectPlan(logicalPlan);\n  if (input.groupBy !== undefined && !planShape.hasAggregate) {\n    throw new CompilerInvariantError(\n      \"Standard SQL emitter received GROUP BY clause for a plan without aggregate nodes\",\n      { component: \"standard-emitter\" },\n    );\n  }\n  if (input.having !== undefined && !planShape.hasAggregate) {\n    throw new CompilerInvariantError(\n      \"Standard SQL emitter received HAVING clause for a plan without aggregate nodes\",\n      { component: \"standard-emitter\" },\n    );\n  }\n  const expectsOrderBy =\n    planShape.hasSort || planShape.hasVectorKnn || planShape.hasFulltextMatch;\n  if (expectsOrderBy && input.orderBy === undefined) {\n    throw new CompilerInvariantError(\n      \"Standard SQL emitter expected ORDER BY clause for plan containing a sort, vector_knn, or fulltext_match node\",\n      { component: \"standard-emitter\" },\n    );\n  }\n  if (!expectsOrderBy && input.orderBy !== undefined) {\n    throw new CompilerInvariantError(\n      \"Standard SQL emitter received ORDER BY clause for a plan without sort, vector_knn, or fulltext_match nodes\",\n      { component: \"standard-emitter\" },\n    );\n  }\n  if (planShape.hasLimitOffset && input.limitOffset === undefined) {\n    throw new CompilerInvariantError(\n      \"Standard SQL emitter expected LIMIT/OFFSET clause for plan containing a limit_offset node\",\n      { component: \"standard-emitter\" },\n    );\n  }\n  if (!planShape.hasLimitOffset && input.limitOffset !== undefined) {\n    throw new CompilerInvariantError(\n      \"Standard SQL emitter received LIMIT/OFFSET clause for a plan without limit_offset nodes\",\n      { component: \"standard-emitter\" },\n    );\n  }\n}\n\nexport function emitStandardQuerySql(input: StandardQueryEmitterInput): SQL {\n  assertStandardEmitterClauseAlignment(input.logicalPlan, input);\n\n  const parts: SQL[] = [];\n  if (input.ctes.length > 0) {\n    parts.push(sql`WITH ${sql.join([...input.ctes], sql`, `)}`);\n  }\n\n  parts.push(sql`SELECT ${input.projection}`, input.fromClause);\n\n  if (input.groupBy !== undefined) {\n    parts.push(input.groupBy);\n  }\n  if (input.having !== undefined) {\n    parts.push(input.having);\n  }\n  if (input.orderBy !== undefined) {\n    parts.push(input.orderBy);\n  }\n  if (input.limitOffset !== undefined) {\n    parts.push(input.limitOffset);\n  }\n\n  return sql.join(parts, sql` `);\n}\n","/**\n * Query AST types.\n *\n * Defines the abstract syntax tree for TypeGraph queries.\n * This portable representation can be compiled to SQL (today)\n * or other query languages (Cypher, SPARQL) in the future.\n */\nimport {\n  type KindEntity,\n  type NullCheckOp,\n  type TemporalMode,\n} from \"../core/types\";\nimport { type JsonPointer } from \"./json-pointer\";\n\n// ============================================================\n// Predicate Expressions\n// ============================================================\n\n/**\n * A field reference in a predicate.\n */\nexport type FieldRef = Readonly<{\n  __type: \"field_ref\";\n  alias: string;\n  path: readonly string[]; // [\"props\", \"name\"] or [\"id\"]\n  jsonPointer?: JsonPointer | undefined; // JSON Pointer into props\n  valueType?: ValueType | undefined;\n  elementType?: ValueType | undefined;\n}>;\n\n/**\n * A literal value in a predicate.\n */\nexport type LiteralValue = Readonly<{\n  __type: \"literal\";\n  value: string | number | boolean;\n  valueType?: ValueType | undefined;\n}>;\n\n/**\n * A parameter reference for prepared queries.\n *\n * Used in place of a literal value to create parameterized queries\n * that can be executed multiple times with different bindings.\n */\nexport type ParameterRef = Readonly<{\n  __type: \"parameter\";\n  name: string;\n  valueType?: ValueType | undefined;\n}>;\n\n/**\n * Supported value types for predicates.\n */\nexport type ValueType =\n  | \"string\"\n  | \"number\"\n  | \"boolean\"\n  | \"date\"\n  | \"array\"\n  | \"object\"\n  | \"embedding\"\n  | \"unknown\";\n\n/**\n * Comparison operators.\n */\nexport type ComparisonOp =\n  | \"eq\"\n  | \"neq\"\n  | \"gt\"\n  | \"gte\"\n  | \"lt\"\n  | \"lte\"\n  | \"in\"\n  | \"notIn\";\n\n/**\n * String operators.\n */\nexport type StringOp =\n  | \"contains\"\n  | \"startsWith\"\n  | \"endsWith\"\n  | \"like\"\n  | \"ilike\";\n\n/**\n * A comparison predicate.\n */\nexport type ComparisonPredicate = Readonly<{\n  __type: \"comparison\";\n  op: ComparisonOp;\n  left: FieldRef;\n  right: LiteralValue | LiteralValue[] | ParameterRef;\n}>;\n\n/**\n * A string predicate.\n */\nexport type StringPredicate = Readonly<{\n  __type: \"string_op\";\n  op: StringOp;\n  field: FieldRef;\n  pattern: string | ParameterRef;\n}>;\n\n/**\n * A null check predicate.\n */\nexport type NullPredicate = Readonly<{\n  __type: \"null_check\";\n  op: NullCheckOp;\n  field: FieldRef;\n}>;\n\n/**\n * A between predicate.\n */\nexport type BetweenPredicate = Readonly<{\n  __type: \"between\";\n  field: FieldRef;\n  lower: LiteralValue | ParameterRef;\n  upper: LiteralValue | ParameterRef;\n}>;\n\n// ============================================================\n// Array Predicates\n// ============================================================\n\n/**\n * Array operators.\n */\nexport type ArrayOp =\n  | \"contains\" // Array contains a single value\n  | \"containsAll\" // Array contains all specified values\n  | \"containsAny\" // Array contains any of the specified values (overlaps)\n  | \"isEmpty\" // Array is empty\n  | \"isNotEmpty\" // Array is not empty\n  | \"lengthEq\" // Array length equals\n  | \"lengthGt\" // Array length greater than\n  | \"lengthGte\" // Array length greater than or equal\n  | \"lengthLt\" // Array length less than\n  | \"lengthLte\"; // Array length less than or equal\n\n/**\n * An array predicate.\n */\nexport type ArrayPredicate = Readonly<{\n  __type: \"array_op\";\n  op: ArrayOp;\n  field: FieldRef;\n  values?: readonly LiteralValue[]; // For contains/containsAll/containsAny\n  length?: number; // For length comparisons\n}>;\n\n// ============================================================\n// Object/JSON Predicates\n// ============================================================\n\n/**\n * Object operators.\n */\nexport type ObjectOp =\n  | \"hasKey\" // Object has a specific key at root level\n  | \"hasPath\" // Object has a nested path\n  | \"pathEquals\" // Value at path equals\n  | \"pathContains\" // Value at path contains (for nested arrays)\n  | \"pathIsNull\" // Value at path is null\n  | \"pathIsNotNull\"; // Value at path is not null\n\n/**\n * An object/JSON predicate.\n */\nexport type ObjectPredicate = Readonly<{\n  __type: \"object_op\";\n  op: ObjectOp;\n  field: FieldRef;\n  pointer: JsonPointer; // Relative JSON Pointer\n  value?: LiteralValue; // For pathEquals, pathContains\n  valueType?: ValueType;\n  elementType?: ValueType;\n}>;\n\n/**\n * Logical AND predicate.\n */\ntype AndPredicate = Readonly<{\n  __type: \"and\";\n  predicates: readonly PredicateExpression[];\n}>;\n\n/**\n * Logical OR predicate.\n */\ntype OrPredicate = Readonly<{\n  __type: \"or\";\n  predicates: readonly PredicateExpression[];\n}>;\n\n/**\n * Logical NOT predicate.\n */\ntype NotPredicate = Readonly<{\n  __type: \"not\";\n  predicate: PredicateExpression;\n}>;\n\n/**\n * An aggregate comparison predicate (for HAVING clauses).\n */\nexport type AggregateComparisonPredicate = Readonly<{\n  __type: \"aggregate_comparison\";\n  op: ComparisonOp;\n  aggregate: AggregateExpr;\n  value: LiteralValue;\n}>;\n\n// ============================================================\n// Subquery Predicates\n// ============================================================\n\n/**\n * An EXISTS subquery predicate.\n * Tests whether the subquery returns any rows.\n */\nexport type ExistsSubquery = Readonly<{\n  __type: \"exists\";\n  subquery: QueryAst;\n  negated: boolean; // for NOT EXISTS\n}>;\n\n/**\n * An IN subquery predicate.\n * Tests whether a field value is in the subquery results.\n */\nexport type InSubquery = Readonly<{\n  __type: \"in_subquery\";\n  field: FieldRef;\n  subquery: QueryAst;\n  negated: boolean; // for NOT IN\n}>;\n\n// ============================================================\n// Vector Predicates\n// ============================================================\n\n/**\n * Vector similarity metric types.\n */\nexport type VectorMetricType = \"cosine\" | \"l2\" | \"inner_product\";\n\n/**\n * A vector similarity predicate.\n * Finds nodes with embeddings similar to the query embedding.\n *\n * This predicate affects query execution by:\n * - Joining with the embeddings table\n * - Adding ORDER BY distance (ascending)\n * - Applying LIMIT (top k results)\n * - Optionally filtering by minimum score\n */\nexport type VectorSimilarityPredicate = Readonly<{\n  __type: \"vector_similarity\";\n  /** The embedding field reference */\n  field: FieldRef;\n  /** The query embedding to compare against */\n  queryEmbedding: readonly number[];\n  /**\n   * Similarity metric. Omitted when the caller didn't pass one — the compiler\n   * then uses the field's DECLARED `embedding()` metric (resolved per kind),\n   * falling back to \"cosine\" only when no declaration is available.\n   */\n  metric?: VectorMetricType;\n  /** Maximum number of results to return */\n  limit: number;\n  /** Optional minimum similarity score (0-1 for cosine) */\n  minScore?: number;\n}>;\n\n// ============================================================\n// Fulltext Predicates\n// ============================================================\n\nimport type { FulltextQueryMode } from \"../backend/types\";\n\n/**\n * A fulltext MATCH predicate.\n *\n * Finds nodes whose combined searchable content matches the query. Affects\n * query execution by joining with the fulltext table, adding an ORDER BY\n * on relevance rank (descending), and applying a LIMIT (top k).\n */\nexport type FulltextMatchPredicate = Readonly<{\n  __type: \"fulltext_match\";\n  /**\n   * Reserved for forward compatibility with per-field fulltext dispatch.\n   * Today only `field.alias` is consumed: the MATCH always targets the\n   * combined `content` column, so `field.path` is a synthetic\n   * `[\"$fulltext\"]` marker rather than a real props path. Future\n   * strategies (per-field indexes, `setweight()`-style boosts) can use\n   * the full `FieldRef` without breaking the AST shape.\n   */\n  field: FieldRef;\n  /** The user-supplied query string. */\n  query: string;\n  /** Parse mode for the query string. Default: \"websearch\". */\n  mode: FulltextQueryMode;\n  /** Language override for query parsing. */\n  language?: string;\n  /** Maximum number of results to return. */\n  limit: number;\n  /** Minimum relevance to include (backend-native units). */\n  minScore?: number;\n}>;\n\n/**\n * Fusion options for hybrid (vector + fulltext) queries.\n *\n * Shared between:\n * - Query-builder path: `QueryBuilder.fuseWith()` stores this on `QueryAst`.\n * - Store path: `store.search.hybrid(kind, { fusion })` accepts the same shape.\n *\n * Only applied when the query contains both a vector and a fulltext\n * predicate. Defaults (when omitted): RRF with k=60 and equal weights.\n */\nexport type HybridFusionOptions = Readonly<{\n  /** RRF is the only currently supported fusion method. */\n  method?: \"rrf\";\n  /** RRF constant. The classic value is 60. */\n  k?: number;\n  /** Per-source weights. Default: { vector: 1, fulltext: 1 }. */\n  weights?: Readonly<{\n    vector?: number;\n    fulltext?: number;\n  }>;\n}>;\n\n/**\n * Classic RRF constant. Shared by the store-level JS fusion in\n * `store.search.hybrid` and the SQL emitter — keep both paths reading\n * the same number so their top-k never drifts on ties.\n */\nexport const DEFAULT_RRF_K = 60;\n\n/** Default per-source RRF weight when none is supplied. */\nexport const DEFAULT_RRF_WEIGHT = 1;\n\n/**\n * All predicate expression types.\n */\nexport type PredicateExpression =\n  | ComparisonPredicate\n  | StringPredicate\n  | NullPredicate\n  | BetweenPredicate\n  | ArrayPredicate\n  | ObjectPredicate\n  | AndPredicate\n  | OrPredicate\n  | NotPredicate\n  | AggregateComparisonPredicate\n  | ExistsSubquery\n  | InSubquery\n  | VectorSimilarityPredicate\n  | FulltextMatchPredicate;\n\n// ============================================================\n// Query Start\n// ============================================================\n\n/**\n * The starting point of a query (the FROM clause).\n */\ntype QueryStart = Readonly<{\n  alias: string;\n  kinds: readonly string[]; // Expanded via ontology if includeSubClasses\n  includeSubClasses: boolean;\n}>;\n\n// ============================================================\n// Traversals\n// ============================================================\n\n/**\n * Direction of edge traversal.\n */\nexport type TraversalDirection = \"out\" | \"in\";\n\n/**\n * Traversal ontology expansion behavior.\n *\n * - `\"none\"` — follow only the exact edge kind specified\n * - `\"implying\"` — also follow edge kinds that imply the specified kind (subClassOf)\n * - `\"inverse\"` — also follow the ontological inverse edge kind (inverseOf)\n * - `\"all\"` — follow both implying and inverse expansions\n */\nexport type TraversalExpansion = \"none\" | \"implying\" | \"inverse\" | \"all\";\n\n/**\n * Cycle handling policy for recursive traversals.\n */\nexport type RecursiveCyclePolicy = \"prevent\" | \"allow\";\n\n/**\n * Variable-length traversal specification for recursive graph traversals.\n */\nexport type VariableLengthSpec = Readonly<{\n  /** Minimum number of hops before including results (default: 1) */\n  minDepth: number;\n  /** Maximum number of hops (-1 = unlimited, default: -1) */\n  maxDepth: number;\n  /**\n   * Cycle handling mode.\n   *\n   * - \"prevent\": Track visited nodes per path and reject revisits\n   * - \"allow\": Skip cycle checks (faster, may revisit nodes)\n   */\n  cyclePolicy: RecursiveCyclePolicy;\n  /** Optional column alias for projected traversal path array */\n  pathAlias?: string;\n  /** Optional column alias for projected traversal depth */\n  depthAlias?: string;\n}>;\n\n/**\n * A traversal step in the query.\n */\nexport type Traversal = Readonly<{\n  edgeAlias: string;\n  edgeKinds: readonly string[]; // Expanded via ontology based on traversal expand mode\n  /**\n   * Edge kinds traversed in the opposite direction.\n   *\n   * Populated when query options request inverse/symmetric expansion.\n   */\n  inverseEdgeKinds?: readonly string[];\n  direction: TraversalDirection;\n  nodeAlias: string;\n  nodeKinds: readonly string[];\n  joinFromAlias: string;\n  joinEdgeField: \"from_id\" | \"to_id\";\n  /** If true, use LEFT JOIN instead of INNER JOIN (optional match) */\n  optional: boolean;\n  /** Variable-length traversal configuration (for recursive CTEs) */\n  variableLength?: VariableLengthSpec;\n}>;\n\n/**\n * Returns the full set of edge kind names for a traversal, merging\n * forward and inverse kinds with deduplication.\n */\nexport function mergeEdgeKinds(traversal: Traversal): readonly string[] {\n  const inverse = traversal.inverseEdgeKinds;\n  if (inverse === undefined || inverse.length === 0) return traversal.edgeKinds;\n\n  return [\n    ...traversal.edgeKinds,\n    ...inverse.filter((kind) => !traversal.edgeKinds.includes(kind)),\n  ];\n}\n\n// ============================================================\n// Aggregations\n// ============================================================\n\n/**\n * Supported aggregate functions.\n */\ntype AggregateFunction =\n  | \"count\"\n  | \"countDistinct\"\n  | \"sum\"\n  | \"avg\"\n  | \"min\"\n  | \"max\";\n\n/**\n * An aggregate expression.\n */\nexport type AggregateExpr = Readonly<{\n  __type: \"aggregate\";\n  function: AggregateFunction;\n  field: FieldRef;\n}>;\n\n/**\n * A GROUP BY specification.\n */\nexport type GroupBySpec = Readonly<{\n  fields: readonly FieldRef[];\n}>;\n\n// ============================================================\n// Projections\n// ============================================================\n\n/**\n * A projected field in the SELECT clause.\n * Can be either a direct field reference or an aggregate expression.\n */\nexport type ProjectedField = Readonly<{\n  outputName: string;\n  source: FieldRef | AggregateExpr;\n  /** Override the CTE alias for this field (used for edge fields in node CTEs) */\n  cteAlias?: string;\n}>;\n\n/**\n * The projection (SELECT) clause.\n */\nexport type Projection = Readonly<{\n  fields: readonly ProjectedField[];\n}>;\n\n/**\n * A selectively projected field for optimized queries.\n *\n * Used when the select callback only accesses specific fields,\n * allowing the compiler to generate optimized SQL that fetches\n * only those fields instead of the full props blob.\n */\nexport type SelectiveField = Readonly<{\n  /** The alias (node or edge) this field belongs to */\n  alias: string;\n  /** The field name (e.g., \"email\", \"name\", \"id\") */\n  field: string;\n  /** The output column name in the result (e.g., \"p_email\") */\n  outputName: string;\n  /** True if this is a system field (id, kind, etc.), false for props */\n  isSystemField: boolean;\n  /**\n   * Optional value type for props fields.\n   *\n   * When present, the compiler can use type-aware JSON extraction\n   * (e.g. numeric/date casts) to better match predicate compilation\n   * and enable expression index coverage.\n   */\n  valueType?: ValueType | undefined;\n}>;\n\n// ============================================================\n// Ordering\n// ============================================================\n\n/**\n * Null ordering preference.\n */\ntype NullOrdering = \"first\" | \"last\";\n\n/**\n * Sort direction.\n */\nexport type SortDirection = \"asc\" | \"desc\";\n\n/**\n * An ordering specification.\n */\nexport type OrderSpec = Readonly<{\n  field: FieldRef;\n  direction: SortDirection;\n  nulls?: NullOrdering;\n}>;\n\n// ============================================================\n// Node Predicate\n// ============================================================\n\n/**\n * A predicate applied to a specific node or edge alias.\n */\nexport type NodePredicate = Readonly<{\n  targetAlias: string;\n  /** Whether this predicate targets a node or edge. Defaults to \"node\". */\n  targetType?: KindEntity;\n  expression: PredicateExpression;\n}>;\n\n// ============================================================\n// Temporal Options\n// ============================================================\n\n/**\n * Temporal query options.\n */\ntype TemporalOptions = Readonly<{\n  mode: TemporalMode;\n  asOf?: string;\n}>;\n\n// ============================================================\n// Query AST\n// ============================================================\n\n/**\n * The complete query AST.\n */\nexport type QueryAst = Readonly<{\n  /** The graph ID this query is for (used for subqueries) */\n  graphId?: string;\n  start: QueryStart;\n  traversals: readonly Traversal[];\n  predicates: readonly NodePredicate[];\n  projection: Projection;\n  temporalMode: TemporalOptions;\n  orderBy?: readonly OrderSpec[];\n  limit?: number;\n  offset?: number;\n  /** GROUP BY specification for aggregate queries */\n  groupBy?: GroupBySpec;\n  /** HAVING clause - predicates applied after GROUP BY */\n  having?: PredicateExpression;\n  /**\n   * Selective fields for optimized queries.\n   * When present, the compiler generates SQL that only fetches these specific\n   * fields instead of the full props blob, enabling covered index usage.\n   */\n  selectiveFields?: readonly SelectiveField[];\n  /** Fusion options for hybrid queries. Ignored unless both predicates present. */\n  fusion?: HybridFusionOptions;\n}>;\n\n// ============================================================\n// Set Operations\n// ============================================================\n\n/**\n * Set operation types for combining queries.\n */\nexport type SetOperationType = \"union\" | \"unionAll\" | \"intersect\" | \"except\";\n\n/**\n * A set operation combining two queries.\n */\nexport type SetOperation = Readonly<{\n  __type: \"set_operation\";\n  operator: SetOperationType;\n  left: ComposableQuery;\n  right: ComposableQuery;\n  orderBy?: readonly OrderSpec[];\n  limit?: number;\n  offset?: number;\n}>;\n\n/**\n * A composable query - either a base query or a set operation.\n */\nexport type ComposableQuery = QueryAst | SetOperation;\n","/**\n * Predicate Expression Compilation\n *\n * Compiles predicate AST nodes to SQL using dialect adapters.\n * Handles comparisons, string operations, null checks, array/object predicates,\n * and subqueries.\n */\nimport { type SQL, sql } from \"drizzle-orm\";\n\nimport { UnsupportedPredicateError } from \"../../errors\";\nimport {\n  type ArrayPredicate,\n  type ExistsSubquery,\n  type FieldRef,\n  type FulltextMatchPredicate,\n  type InSubquery,\n  type LiteralValue,\n  type ObjectPredicate,\n  type ParameterRef,\n  type PredicateExpression,\n  type QueryAst,\n  type ValueType,\n  type VectorSimilarityPredicate,\n} from \"../ast\";\nimport { type DialectAdapter } from \"../dialect/types\";\nimport { type VectorStrategy } from \"../dialect/vector-strategy\";\nimport {\n  joinJsonPointers,\n  type JsonPointer,\n  jsonPointer,\n} from \"../json-pointer\";\nimport { isParameterRef } from \"../predicates\";\nimport {\n  getSingleSubqueryColumnValueType,\n  getSubqueryColumnCount,\n  isInSubqueryTypeCompatible,\n  isUnsupportedInSubqueryValueType,\n} from \"../subquery-utils\";\nimport { type SqlSchema, type VectorSlotMap } from \"./schema\";\n\nconst COMPARISON_OP_SQL: Record<string, string> = {\n  eq: \"=\",\n  neq: \"!=\",\n  gt: \">\",\n  gte: \">=\",\n  lt: \"<\",\n  lte: \"<=\",\n};\n\n// ============================================================\n// Field Reference Compilation\n// ============================================================\n\n/**\n * Compiles a field reference to a base column name.\n *\n * @param field - The field reference to compile\n * @param cteAlias - Optional CTE alias for main query context (e.g., \"cte_p\")\n * @param cteColumnPrefix - Optional prefix for CTE WHERE context:\n *   - undefined: Use aliased column names (e.g., \"p_props\")\n *   - \"\": Use raw column names (e.g., \"props\") for start CTE\n *   - \"n\": Use table-qualified names (e.g., \"n.props\") for traversal CTE\n */\nexport function compileFieldColumn(\n  field: FieldRef,\n  cteAlias?: string,\n  cteColumnPrefix?: string,\n): SQL {\n  // When cteColumnPrefix is defined (including empty string), use raw column names\n  // This is for CTE WHERE clauses which operate on raw table columns\n  if (cteColumnPrefix !== undefined) {\n    const qualifier = cteColumnPrefix === \"\" ? \"\" : `${cteColumnPrefix}.`;\n\n    if (field.path.length === 1 && field.path[0] === \"id\") {\n      return sql.raw(`${qualifier}id`);\n    }\n    if (field.path.length === 1 && field.path[0] === \"kind\") {\n      return sql.raw(`${qualifier}kind`);\n    }\n    if (field.path.length > 0 && field.path[0] === \"props\") {\n      return sql.raw(`${qualifier}props`);\n    }\n\n    return sql.raw(`${qualifier}${field.path.join(\"_\")}`);\n  }\n\n  // Default behavior: use aliased column names (e.g., \"p_props\")\n  const prefix = field.alias;\n  const qualifier = cteAlias ? `${cteAlias}.` : \"\";\n\n  if (field.path.length === 1 && field.path[0] === \"id\") {\n    return sql.raw(`${qualifier}${prefix}_id`);\n  }\n  if (field.path.length === 1 && field.path[0] === \"kind\") {\n    return sql.raw(`${qualifier}${prefix}_kind`);\n  }\n  if (field.path.length > 0 && field.path[0] === \"props\") {\n    return sql.raw(`${qualifier}${prefix}_props`);\n  }\n\n  return sql.raw(`${qualifier}${prefix}_${field.path.join(\"_\")}`);\n}\n\n/**\n * Gets the JSON pointer for a field reference.\n */\nfunction getFieldPointer(field: FieldRef): JsonPointer | undefined {\n  if (field.jsonPointer !== undefined) {\n    return field.jsonPointer;\n  }\n\n  if (field.path.length > 1 && field.path[0] === \"props\") {\n    return jsonPointer(field.path.slice(1));\n  }\n\n  return undefined;\n}\n\n/**\n * Checks if a field reference points to a JSON props column.\n */\nfunction isJsonField(field: FieldRef): boolean {\n  return field.path.length > 0 && field.path[0] === \"props\";\n}\n\n/**\n * Normalizes a value type, treating \"unknown\" as undefined.\n */\nfunction normalizeValueType(\n  valueType: ValueType | undefined,\n): ValueType | undefined {\n  if (!valueType || valueType === \"unknown\") {\n    return undefined;\n  }\n  return valueType;\n}\n\n/**\n * Compiles a field reference to SQL with appropriate type extraction.\n */\nexport function compileFieldValue(\n  field: FieldRef,\n  dialect: DialectAdapter,\n  valueType?: ValueType,\n  cteAlias?: string,\n  pointerOverride?: JsonPointer,\n  cteColumnPrefix?: string,\n): SQL {\n  const resolved = normalizeValueType(valueType);\n  const column = compileFieldColumn(field, cteAlias, cteColumnPrefix);\n\n  if (!isJsonField(field)) {\n    return column;\n  }\n\n  const pointer = pointerOverride ?? getFieldPointer(field);\n  if (!pointer || pointer === \"\") {\n    return column;\n  }\n\n  switch (resolved) {\n    case \"number\": {\n      return dialect.jsonExtractNumber(column, pointer);\n    }\n    case \"boolean\": {\n      return dialect.jsonExtractBoolean(column, pointer);\n    }\n    case \"date\": {\n      return dialect.jsonExtractDate(column, pointer);\n    }\n    case \"array\":\n    case \"object\":\n    case \"embedding\": {\n      // Embeddings are stored in a separate table, but if we need to\n      // extract from JSON, treat like a regular JSON value\n      return dialect.jsonExtract(column, pointer);\n    }\n    case \"string\":\n    case \"unknown\":\n    case undefined: {\n      return dialect.jsonExtractText(column, pointer);\n    }\n  }\n}\n\n/**\n * Compiles a field reference for text comparison.\n */\nfunction compileFieldTextValue(\n  field: FieldRef,\n  dialect: DialectAdapter,\n  cteAlias?: string,\n  pointerOverride?: JsonPointer,\n  cteColumnPrefix?: string,\n): SQL {\n  const column = compileFieldColumn(field, cteAlias, cteColumnPrefix);\n  if (!isJsonField(field)) {\n    return column;\n  }\n\n  const pointer = pointerOverride ?? getFieldPointer(field);\n  if (!pointer || pointer === \"\") {\n    return column;\n  }\n\n  return dialect.jsonExtractText(column, pointer);\n}\n\n/**\n * Compiles a field reference for JSON value extraction.\n */\nfunction compileFieldJsonValue(\n  field: FieldRef,\n  dialect: DialectAdapter,\n  cteAlias?: string,\n  pointerOverride?: JsonPointer,\n  cteColumnPrefix?: string,\n): SQL {\n  const column = compileFieldColumn(field, cteAlias, cteColumnPrefix);\n  if (!isJsonField(field)) {\n    return column;\n  }\n\n  const pointer = pointerOverride ?? getFieldPointer(field);\n  if (!pointer || pointer === \"\") {\n    return column;\n  }\n\n  return dialect.jsonExtract(column, pointer);\n}\n\n// ============================================================\n// Value Type Resolution\n// ============================================================\n\n/**\n * Resolves literal value types from an array of literals.\n */\nfunction resolveLiteralValueTypes(\n  literals: readonly LiteralValue[],\n): ValueType | undefined {\n  const resolved = new Set<ValueType>();\n\n  for (const literal of literals) {\n    const valueType = normalizeValueType(literal.valueType);\n    if (valueType) {\n      resolved.add(valueType);\n    }\n  }\n\n  if (resolved.size > 1) {\n    throw new UnsupportedPredicateError(\n      \"Mixed literal value types are not supported in predicates\",\n      { valueTypes: [...resolved] },\n    );\n  }\n\n  return resolved.values().next().value;\n}\n\n/**\n * Resolves the value type for a comparison predicate.\n */\nfunction resolveComparisonValueType(\n  field: FieldRef,\n  right: LiteralValue | readonly LiteralValue[] | ParameterRef,\n): ValueType | undefined {\n  if (isParameterRef(right)) {\n    return (\n      normalizeValueType(right.valueType) ?? normalizeValueType(field.valueType)\n    );\n  }\n  const literals = Array.isArray(right) ? right : [right];\n  const literalType = resolveLiteralValueTypes(literals);\n  const fieldType = normalizeValueType(field.valueType);\n\n  // Date fields compared with string literals should use date type\n  if (fieldType === \"date\" && literalType === \"string\") {\n    return fieldType;\n  }\n\n  if (literalType) {\n    return literalType;\n  }\n\n  return fieldType;\n}\n\n/**\n * Resolves value type with preference for explicit type.\n */\nfunction resolvePredicateValueType(\n  preferred: ValueType | undefined,\n  literal: LiteralValue | undefined,\n): ValueType | undefined {\n  const normalizedPreferred = normalizeValueType(preferred);\n  if (normalizedPreferred) {\n    return normalizedPreferred;\n  }\n\n  return literal ? normalizeValueType(literal.valueType) : undefined;\n}\n\n// ============================================================\n// Value Conversion\n// ============================================================\n\n/**\n * Converts a literal value for SQL binding.\n * Delegates to dialect adapter for proper type conversion (e.g., boolean → 0/1 for SQLite).\n */\nfunction convertValueForSql(value: unknown, dialect: DialectAdapter): unknown {\n  return dialect.bindValue(value);\n}\n\n// ============================================================\n// String Pattern Compilation\n// ============================================================\n\n/**\n * Compiles a string pattern for LIKE operations.\n */\nfunction compileStringPattern(op: string, pattern: string): string {\n  const escaped = pattern\n    .replaceAll(\"%\", String.raw`\\%`)\n    .replaceAll(\"_\", String.raw`\\_`);\n\n  switch (op) {\n    case \"contains\": {\n      return `%${escaped}%`;\n    }\n    case \"startsWith\": {\n      return `${escaped}%`;\n    }\n    case \"endsWith\": {\n      return `%${escaped}`;\n    }\n    case \"like\":\n    case \"ilike\": {\n      return pattern;\n    }\n    default: {\n      return escaped;\n    }\n  }\n}\n\n/**\n * Escapes wildcard characters in a SQL pattern parameter.\n */\nfunction escapeLikePatternParameter(parameter: SQL): SQL {\n  return sql`REPLACE(REPLACE(REPLACE(${parameter}, '\\\\', '\\\\\\\\'), '%', '\\\\%'), '_', '\\\\_')`;\n}\n\n/**\n * Builds a SQL pattern expression for parameterized string operations.\n */\nfunction compileParameterizedStringPattern(op: string, parameter: SQL): SQL {\n  switch (op) {\n    case \"contains\": {\n      const escaped = escapeLikePatternParameter(parameter);\n      return sql`'%' || ${escaped} || '%'`;\n    }\n    case \"startsWith\": {\n      const escaped = escapeLikePatternParameter(parameter);\n      return sql`${escaped} || '%'`;\n    }\n    case \"endsWith\": {\n      const escaped = escapeLikePatternParameter(parameter);\n      return sql`'%' || ${escaped}`;\n    }\n    case \"like\":\n    case \"ilike\": {\n      return parameter;\n    }\n    default: {\n      return escapeLikePatternParameter(parameter);\n    }\n  }\n}\n\n// ============================================================\n// Predicate Compilation\n// ============================================================\n\n/**\n * Compiler context passed to recursive compilation functions.\n *\n * When compiling predicates inside CTE WHERE clauses, `cteColumnPrefix` specifies\n * how to reference columns:\n * - undefined: Use aliased column names (e.g., \"p_props\") - for main query context\n * - \"\": Use raw column names (e.g., \"props\") - for start CTE WHERE clause\n * - \"n\": Use table-qualified names (e.g., \"n.props\") - for traversal CTE WHERE clause\n */\nexport type PredicateCompilerContext = Readonly<{\n  dialect: DialectAdapter;\n  schema: SqlSchema;\n  compileQuery: (ast: QueryAst, graphId: string) => SQL;\n  cteColumnPrefix?: string;\n  /**\n   * Active vector strategy for `field.similarTo(...)` compilation. When\n   * present, the embeddings CTE scans the strategy's per-`(kind, field)`\n   * tables and uses its `distanceExpression`; absent on backends without\n   * vector support (the vector pass rejects the predicate before the CTE\n   * builder runs).\n   */\n  vectorStrategy?: VectorStrategy;\n  /**\n   * Whether the active backend supports SQL window functions such as\n   * `ROW_NUMBER()`.\n   */\n  windowFunctions: boolean;\n  /**\n   * Declared embedding slots `(kind, fieldPath) -> {dimensions, metric,\n   * indexType}`. The embeddings CTE consults it to know which kinds in\n   * an alias actually declare the field — only those get a per-field\n   * table scan in the UNION ALL.\n   */\n  vectorSlots?: VectorSlotMap;\n}>;\n\n/**\n * Compiles a predicate expression to SQL.\n */\nexport function compilePredicateExpression(\n  expr: PredicateExpression,\n  ctx: PredicateCompilerContext,\n): SQL {\n  const { dialect } = ctx;\n\n  const cteColumnPrefix = ctx.cteColumnPrefix;\n\n  switch (expr.__type) {\n    case \"comparison\": {\n      return compileComparisonPredicate(expr, dialect, cteColumnPrefix);\n    }\n\n    case \"string_op\": {\n      const field = compileFieldTextValue(\n        expr.field,\n        dialect,\n        undefined,\n        undefined,\n        cteColumnPrefix,\n      );\n\n      if (isParameterRef(expr.pattern)) {\n        const placeholder = sql`${sql.placeholder(expr.pattern.name)}`;\n        const pattern = compileParameterizedStringPattern(expr.op, placeholder);\n        if (\n          expr.op === \"ilike\" ||\n          expr.op === \"contains\" ||\n          expr.op === \"startsWith\" ||\n          expr.op === \"endsWith\"\n        ) {\n          return dialect.ilike(field, pattern);\n        }\n        return sql`${field} LIKE ${pattern}`;\n      }\n\n      const pattern = compileStringPattern(expr.op, expr.pattern);\n      // Use case-insensitive matching for contains, startsWith, endsWith, and ilike\n      // This ensures consistent behavior across PostgreSQL (case-sensitive LIKE)\n      // and SQLite (case-insensitive LIKE for ASCII)\n      if (\n        expr.op === \"ilike\" ||\n        expr.op === \"contains\" ||\n        expr.op === \"startsWith\" ||\n        expr.op === \"endsWith\"\n      ) {\n        return dialect.ilike(field, pattern);\n      }\n      // Use case-sensitive LIKE only for explicit 'like' operator\n      return sql`${field} LIKE ${pattern}`;\n    }\n\n    case \"null_check\": {\n      const field = compileFieldTextValue(\n        expr.field,\n        dialect,\n        undefined,\n        undefined,\n        cteColumnPrefix,\n      );\n      return expr.op === \"isNull\" ?\n          sql`${field} IS NULL`\n        : sql`${field} IS NOT NULL`;\n    }\n\n    case \"between\": {\n      const lowerIsParam = isParameterRef(expr.lower);\n      const upperIsParam = isParameterRef(expr.upper);\n\n      // Resolve value type from non-param bounds\n      const boundsForType: LiteralValue[] = [];\n      if (!lowerIsParam) boundsForType.push(expr.lower);\n      if (!upperIsParam) boundsForType.push(expr.upper);\n\n      const valueType =\n        boundsForType.length > 0 ?\n          resolveComparisonValueType(expr.field, boundsForType)\n        : normalizeValueType(expr.field.valueType);\n\n      if (valueType === \"array\" || valueType === \"object\") {\n        throw new UnsupportedPredicateError(\n          \"Between comparisons are not supported for JSON arrays or objects\",\n        );\n      }\n      const field = compileFieldValue(\n        expr.field,\n        dialect,\n        valueType,\n        undefined,\n        undefined,\n        cteColumnPrefix,\n      );\n      const lower =\n        lowerIsParam ?\n          sql.placeholder(expr.lower.name)\n        : convertValueForSql(expr.lower.value, dialect);\n      const upper =\n        upperIsParam ?\n          sql.placeholder(expr.upper.name)\n        : convertValueForSql(expr.upper.value, dialect);\n      return sql`${field} BETWEEN ${lower} AND ${upper}`;\n    }\n\n    case \"and\": {\n      const parts = expr.predicates.map((p) =>\n        compilePredicateExpression(p, ctx),\n      );\n      return sql`(${sql.join(parts, sql` AND `)})`;\n    }\n\n    case \"or\": {\n      const parts = expr.predicates.map((p) =>\n        compilePredicateExpression(p, ctx),\n      );\n      return sql`(${sql.join(parts, sql` OR `)})`;\n    }\n\n    case \"not\": {\n      const inner = compilePredicateExpression(expr.predicate, ctx);\n      return sql`NOT (${inner})`;\n    }\n\n    case \"array_op\": {\n      return compileArrayPredicate(expr, dialect, cteColumnPrefix);\n    }\n\n    case \"object_op\": {\n      return compileObjectPredicate(expr, dialect, cteColumnPrefix);\n    }\n\n    case \"aggregate_comparison\": {\n      return compileAggregatePredicate(expr, dialect);\n    }\n\n    case \"exists\": {\n      return compileExistsSubquery(expr, ctx);\n    }\n\n    case \"in_subquery\": {\n      return compileInSubquery(expr, ctx);\n    }\n\n    case \"vector_similarity\":\n    case \"fulltext_match\": {\n      // Structural predicates — handled by the main compiler via JOINs,\n      // ORDER BY, and LIMIT. Compile to 1=1 so they compose safely with\n      // surrounding AND branches.\n      return STRUCTURAL_PREDICATE_NOOP;\n    }\n  }\n}\n\nconst STRUCTURAL_PREDICATE_NOOP = sql.raw(\"1=1\");\n\n/**\n * Compiles a comparison predicate.\n */\nfunction compileComparisonPredicate(\n  expr: {\n    __type: \"comparison\";\n    op: string;\n    left: FieldRef;\n    right: LiteralValue | readonly LiteralValue[] | ParameterRef;\n  },\n  dialect: DialectAdapter,\n  cteColumnPrefix?: string,\n): SQL {\n  // Handle ParameterRef on the right side\n  if (isParameterRef(expr.right)) {\n    const parameterValueType =\n      normalizeValueType(expr.right.valueType) ??\n      normalizeValueType(expr.left.valueType);\n    const left = compileFieldValue(\n      expr.left,\n      dialect,\n      parameterValueType,\n      undefined,\n      undefined,\n      cteColumnPrefix,\n    );\n    const opSql = COMPARISON_OP_SQL[expr.op];\n    if (!opSql) {\n      throw new UnsupportedPredicateError(\n        `Comparison operation \"${expr.op}\" is not supported for parameterized predicates`,\n      );\n    }\n    return sql`${left} ${sql.raw(opSql)} ${sql.placeholder(expr.right.name)}`;\n  }\n\n  const valueType = resolveComparisonValueType(expr.left, expr.right);\n\n  if (valueType === \"array\" || valueType === \"object\") {\n    throw new UnsupportedPredicateError(\n      `Comparison operation \"${expr.op}\" is not supported for ${valueType} values`,\n    );\n  }\n\n  const left = compileFieldValue(\n    expr.left,\n    dialect,\n    valueType,\n    undefined,\n    undefined,\n    cteColumnPrefix,\n  );\n\n  if (expr.op === \"in\" || expr.op === \"notIn\") {\n    const values: readonly LiteralValue[] =\n      Array.isArray(expr.right) ? expr.right : [expr.right as LiteralValue];\n    if (values.length === 0) {\n      return expr.op === \"in\" ? sql.raw(\"1=0\") : sql.raw(\"1=1\");\n    }\n    const placeholders = values.map(\n      (v) => sql`${convertValueForSql(v.value, dialect)}`,\n    );\n    const op = expr.op === \"in\" ? sql.raw(\"IN\") : sql.raw(\"NOT IN\");\n    return sql`${left} ${op} (${sql.join(placeholders, sql`, `)})`;\n  }\n\n  // For single-value comparisons, extract the literal value\n  const right = expr.right;\n  // eslint-disable-next-line @typescript-eslint/no-unsafe-assignment -- Type narrowing with Array.isArray\n  const rightValue: LiteralValue = Array.isArray(right) ? right[0]! : right;\n\n  const convertedRight = convertValueForSql(rightValue.value, dialect);\n  const opSql = COMPARISON_OP_SQL[expr.op];\n  if (!opSql) {\n    throw new UnsupportedPredicateError(\n      `Comparison operation \"${expr.op}\" is not supported`,\n    );\n  }\n  return sql`${left} ${sql.raw(opSql)} ${convertedRight}`;\n}\n\n/**\n * Compiles an array predicate.\n */\nfunction compileArrayPredicate(\n  expr: ArrayPredicate,\n  dialect: DialectAdapter,\n  cteColumnPrefix?: string,\n): SQL {\n  const field = compileFieldJsonValue(\n    expr.field,\n    dialect,\n    undefined,\n    undefined,\n    cteColumnPrefix,\n  );\n  const values =\n    expr.values?.map((v) => convertValueForSql(v.value, dialect)) ?? [];\n\n  switch (expr.op) {\n    case \"isEmpty\": {\n      return sql`(${field} IS NULL OR ${dialect.jsonArrayLength(field)} = 0)`;\n    }\n    case \"isNotEmpty\": {\n      return sql`(${field} IS NOT NULL AND ${dialect.jsonArrayLength(field)} > 0)`;\n    }\n    case \"lengthEq\": {\n      return sql`${dialect.jsonArrayLength(field)} = ${expr.length}`;\n    }\n    case \"lengthGt\": {\n      return sql`${dialect.jsonArrayLength(field)} > ${expr.length}`;\n    }\n    case \"lengthGte\": {\n      return sql`${dialect.jsonArrayLength(field)} >= ${expr.length}`;\n    }\n    case \"lengthLt\": {\n      return sql`${dialect.jsonArrayLength(field)} < ${expr.length}`;\n    }\n    case \"lengthLte\": {\n      return sql`${dialect.jsonArrayLength(field)} <= ${expr.length}`;\n    }\n    case \"contains\": {\n      const value = values[0];\n      if (value === undefined) {\n        return sql.raw(\"1=0\");\n      }\n      return dialect.jsonArrayContains(field, value);\n    }\n    case \"containsAll\": {\n      return dialect.jsonArrayContainsAll(field, values);\n    }\n    case \"containsAny\": {\n      return dialect.jsonArrayContainsAny(field, values);\n    }\n  }\n}\n\n/**\n * Compiles an object/JSON predicate.\n */\nfunction compileObjectPredicate(\n  expr: ObjectPredicate,\n  dialect: DialectAdapter,\n  cteColumnPrefix?: string,\n): SQL {\n  const basePointer = getFieldPointer(expr.field);\n  const pointer = joinJsonPointers(basePointer, expr.pointer);\n  const column = compileFieldColumn(expr.field, undefined, cteColumnPrefix);\n\n  switch (expr.op) {\n    case \"hasKey\":\n    case \"hasPath\": {\n      return dialect.jsonHasPath(column, pointer);\n    }\n\n    case \"pathEquals\": {\n      if (!expr.value) {\n        throw new UnsupportedPredicateError(\n          \"pathEquals requires a comparison value\",\n        );\n      }\n      const valueType = resolvePredicateValueType(expr.valueType, expr.value);\n      if (valueType === \"array\" || valueType === \"object\") {\n        throw new UnsupportedPredicateError(\n          \"pathEquals is not supported for JSON arrays or objects\",\n        );\n      }\n      const left = compileFieldValue(\n        expr.field,\n        dialect,\n        valueType,\n        undefined,\n        pointer,\n        cteColumnPrefix,\n      );\n      return sql`${left} = ${convertValueForSql(expr.value.value, dialect)}`;\n    }\n\n    case \"pathContains\": {\n      if (!expr.value) {\n        throw new UnsupportedPredicateError(\n          \"pathContains requires a comparison value\",\n        );\n      }\n      const arrayField = compileFieldJsonValue(\n        expr.field,\n        dialect,\n        undefined,\n        pointer,\n        cteColumnPrefix,\n      );\n      return dialect.jsonArrayContains(\n        arrayField,\n        convertValueForSql(expr.value.value, dialect),\n      );\n    }\n\n    case \"pathIsNull\": {\n      return dialect.jsonPathIsNull(column, pointer);\n    }\n\n    case \"pathIsNotNull\": {\n      return dialect.jsonPathIsNotNull(column, pointer);\n    }\n  }\n}\n\n/**\n * AggregateExpr structure from AST.\n */\ntype AggregateExprInput = Readonly<{\n  __type: \"aggregate\";\n  function: string;\n  field: FieldRef;\n}>;\n\n/**\n * Compiles an aggregate comparison predicate.\n */\nfunction compileAggregatePredicate(\n  expr: {\n    __type: \"aggregate_comparison\";\n    op: string;\n    aggregate: AggregateExprInput;\n    value: LiteralValue;\n  },\n  dialect: DialectAdapter,\n): SQL {\n  const aggregate = compileAggregateExpr(expr.aggregate, dialect);\n\n  const op = COMPARISON_OP_SQL[expr.op];\n  if (!op) {\n    throw new UnsupportedPredicateError(\n      `Comparison operation \"${expr.op}\" is not supported for aggregate predicates`,\n    );\n  }\n\n  const convertedValue = convertValueForSql(expr.value.value, dialect);\n  return sql`${aggregate} ${sql.raw(op)} ${convertedValue}`;\n}\n\n/**\n * Compiles an aggregate expression.\n */\nfunction compileAggregateExpr(\n  expr: AggregateExprInput,\n  dialect: DialectAdapter,\n): SQL {\n  const cteAlias = `cte_${expr.field.alias}`;\n  const field = compileFieldValue(\n    expr.field,\n    dialect,\n    expr.field.valueType,\n    cteAlias,\n  );\n\n  switch (expr.function) {\n    case \"count\": {\n      return sql`COUNT(${field})`;\n    }\n    case \"countDistinct\": {\n      return sql`COUNT(DISTINCT ${field})`;\n    }\n    case \"sum\": {\n      return sql`SUM(${field})`;\n    }\n    case \"avg\": {\n      return sql`AVG(${field})`;\n    }\n    case \"min\": {\n      return sql`MIN(${field})`;\n    }\n    case \"max\": {\n      return sql`MAX(${field})`;\n    }\n    default: {\n      throw new UnsupportedPredicateError(\n        `Unknown aggregate function: ${expr.function}`,\n      );\n    }\n  }\n}\n\n/**\n * Compiles an EXISTS subquery predicate.\n */\nfunction compileExistsSubquery(\n  expr: ExistsSubquery,\n  ctx: PredicateCompilerContext,\n): SQL {\n  if (expr.subquery.graphId === undefined) {\n    throw new UnsupportedPredicateError(\"EXISTS subquery must have a graphId\");\n  }\n  const subSql = ctx.compileQuery(expr.subquery, expr.subquery.graphId);\n  return expr.negated ? sql`NOT EXISTS (${subSql})` : sql`EXISTS (${subSql})`;\n}\n\n/**\n * Compiles an IN subquery predicate.\n */\nfunction compileInSubquery(\n  expr: InSubquery,\n  ctx: PredicateCompilerContext,\n): SQL {\n  const subqueryColumnCount = getSubqueryColumnCount(expr.subquery);\n  if (subqueryColumnCount !== 1) {\n    throw new UnsupportedPredicateError(\n      `IN/NOT IN subquery must project exactly 1 column, but got ${subqueryColumnCount}`,\n      { subqueryColumnCount },\n    );\n  }\n\n  const fieldValueType = normalizeValueType(expr.field.valueType);\n  const subqueryValueType = getSingleSubqueryColumnValueType(expr.subquery);\n  const resolvedValueType = fieldValueType ?? subqueryValueType;\n\n  if (isUnsupportedInSubqueryValueType(resolvedValueType)) {\n    throw new UnsupportedPredicateError(\n      `IN/NOT IN subquery does not support ${String(resolvedValueType)} values`,\n      { valueType: resolvedValueType },\n    );\n  }\n\n  if (!isInSubqueryTypeCompatible(fieldValueType, subqueryValueType)) {\n    throw new UnsupportedPredicateError(\n      `IN/NOT IN type mismatch: field type \"${String(fieldValueType)}\" does not match subquery column type \"${String(subqueryValueType)}\"`,\n      {\n        fieldValueType,\n        subqueryValueType,\n      },\n    );\n  }\n\n  const valueType = fieldValueType ?? subqueryValueType;\n  if (expr.subquery.graphId === undefined) {\n    throw new UnsupportedPredicateError(\n      \"IN/NOT IN subquery must have a graphId\",\n    );\n  }\n  const fieldSql = compileFieldValue(\n    expr.field,\n    ctx.dialect,\n    valueType,\n    undefined,\n    undefined,\n    ctx.cteColumnPrefix,\n  );\n  const subSql = ctx.compileQuery(expr.subquery, expr.subquery.graphId);\n  return expr.negated ?\n      sql`${fieldSql} NOT IN (${subSql})`\n    : sql`${fieldSql} IN (${subSql})`;\n}\n\n/**\n * Compiles a vector similarity predicate.\n *\n * Vector similarity predicates require special handling at the query compilation\n * level to handle:\n * - JOIN to embeddings table\n * - ORDER BY distance ASC\n * - LIMIT k\n *\n * This function handles the minScore filter if present. The main query compiler\n * must detect vector_similarity predicates and set up the appropriate JOINs\n * and ordering.\n */\n\n// ============================================================\n// Structural Predicate Extraction\n// ============================================================\n\n/**\n * Extracts all instances of a \"structural\" predicate (one that rewrites\n * the query into JOIN + ORDER BY + LIMIT, rather than acting as a\n * boolean WHERE clause). Both `vector_similarity` and `fulltext_match`\n * have the same placement rules: top-level or under AND only — nesting\n * under OR/NOT is rejected because the rewrite is incompatible with\n * disjunction and negation.\n */\nfunction extractStructuralPredicates<T extends PredicateExpression>(\n  predicates: readonly { expression: PredicateExpression }[],\n  isMatch: (expr: PredicateExpression) => expr is T,\n  rejectionMessage: string,\n): T[] {\n  const results: T[] = [];\n\n  function visit(expr: PredicateExpression, inDisallowedBranch: boolean): void {\n    if (isMatch(expr)) {\n      if (inDisallowedBranch) {\n        throw new UnsupportedPredicateError(rejectionMessage);\n      }\n      results.push(expr);\n      return;\n    }\n    switch (expr.__type) {\n      case \"and\": {\n        for (const child of expr.predicates) visit(child, inDisallowedBranch);\n        return;\n      }\n      case \"or\": {\n        for (const child of expr.predicates) visit(child, true);\n        return;\n      }\n      case \"not\": {\n        visit(expr.predicate, true);\n        return;\n      }\n      case \"comparison\":\n      case \"string_op\":\n      case \"null_check\":\n      case \"between\":\n      case \"array_op\":\n      case \"object_op\":\n      case \"aggregate_comparison\":\n      case \"exists\":\n      case \"in_subquery\":\n      case \"vector_similarity\":\n      case \"fulltext_match\": {\n        return;\n      }\n    }\n  }\n\n  for (const pred of predicates) visit(pred.expression, false);\n  return results;\n}\n\nexport function extractVectorSimilarityPredicates(\n  predicates: readonly { expression: PredicateExpression }[],\n): VectorSimilarityPredicate[] {\n  return extractStructuralPredicates(\n    predicates,\n    (expr): expr is VectorSimilarityPredicate =>\n      expr.__type === \"vector_similarity\",\n    \"Vector similarity predicates cannot be nested under OR or NOT. \" +\n      \"Use top-level AND combinations instead.\",\n  );\n}\n\nexport function extractFulltextMatchPredicates(\n  predicates: readonly { expression: PredicateExpression }[],\n): FulltextMatchPredicate[] {\n  return extractStructuralPredicates(\n    predicates,\n    (expr): expr is FulltextMatchPredicate => expr.__type === \"fulltext_match\",\n    \"Fulltext match predicates cannot be nested under OR or NOT. \" +\n      \"Use top-level AND combinations instead.\",\n  );\n}\n\n// ============================================================\n// Exports for aggregate compilation\n// ============================================================\n\nexport { compileAggregateExpr };\n","import { type SQL, sql } from \"drizzle-orm\";\n\nimport type { KindEntity } from \"../../core/types\";\nimport { CompilerInvariantError } from \"../../errors\";\nimport {\n  type FulltextMatchPredicate,\n  type NodePredicate,\n  type QueryAst,\n  type VectorSimilarityPredicate,\n} from \"../ast\";\nimport {\n  compilePredicateExpression,\n  type PredicateCompilerContext,\n} from \"./predicates\";\n\nconst EMPTY_PREDICATES: readonly NodePredicate[] = [];\n\nexport type PredicateIndex = Readonly<{\n  byAliasAndType: ReadonlyMap<string, readonly NodePredicate[]>;\n}>;\n\nfunction buildPredicateIndexKey(alias: string, targetType: KindEntity): string {\n  return `${alias}\\u0000${targetType}`;\n}\n\nfunction resolvePredicateTargetType(predicate: NodePredicate): KindEntity {\n  return predicate.targetType === \"edge\" ? \"edge\" : \"node\";\n}\n\nexport function buildPredicateIndex(ast: QueryAst): PredicateIndex {\n  const byAliasAndType = new Map<string, NodePredicate[]>();\n  for (const predicate of ast.predicates) {\n    const key = buildPredicateIndexKey(\n      predicate.targetAlias,\n      resolvePredicateTargetType(predicate),\n    );\n    const existing = byAliasAndType.get(key);\n    if (existing === undefined) {\n      byAliasAndType.set(key, [predicate]);\n    } else {\n      existing.push(predicate);\n    }\n  }\n  return { byAliasAndType };\n}\n\nexport function getPredicatesForAlias(\n  predicateIndex: PredicateIndex,\n  alias: string,\n  targetType: KindEntity,\n): readonly NodePredicate[] {\n  return (\n    predicateIndex.byAliasAndType.get(\n      buildPredicateIndexKey(alias, targetType),\n    ) ?? EMPTY_PREDICATES\n  );\n}\n\nexport function compilePredicateClauses(\n  predicates: readonly NodePredicate[],\n  predicateContext: PredicateCompilerContext,\n): SQL[] {\n  return predicates.map((predicate) =>\n    compilePredicateExpression(predicate.expression, predicateContext),\n  );\n}\n\nexport function compileKindFilter(column: SQL, kinds: readonly string[]): SQL {\n  if (kinds.length === 0) {\n    return sql`1 = 0`;\n  }\n  if (kinds.length === 1) {\n    return sql`${column} = ${kinds[0]}`;\n  }\n  return sql`${column} IN (${sql.join(\n    kinds.map((kind) => sql`${kind}`),\n    sql`, `,\n  )})`;\n}\n\nexport function getNodeKindsForAlias(\n  ast: QueryAst,\n  alias: string,\n): readonly string[] {\n  if (alias === ast.start.alias) {\n    return ast.start.kinds;\n  }\n\n  for (const traversal of ast.traversals) {\n    if (traversal.nodeAlias === alias) {\n      return traversal.nodeKinds;\n    }\n  }\n\n  throw new CompilerInvariantError(`Unknown traversal source alias: ${alias}`);\n}\n\n/**\n * Returns the shared alias when a hybrid (vector + fulltext) query has\n * both predicates targeting the same alias — that's the case where the\n * emitter can fuse ranks via `HYBRID_CANDIDATES_CTE_ALIAS` / RRF.\n * Returns `undefined` when either predicate is missing or the two\n * predicates target different aliases.\n */\nexport function getHybridTargetAlias(\n  vectorPredicate: VectorSimilarityPredicate | undefined,\n  fulltextPredicate: FulltextMatchPredicate | undefined,\n): string | undefined {\n  if (!vectorPredicate || !fulltextPredicate) return undefined;\n  return vectorPredicate.field.alias === fulltextPredicate.field.alias ?\n      vectorPredicate.field.alias\n    : undefined;\n}\n","import { type SQL } from \"drizzle-orm\";\n\nimport { type DialectAdapter } from \"../dialect/types\";\nimport { type JsonPointer } from \"../json-pointer\";\n\ntype JsonExtractFallback = \"json\" | \"text\";\n\ntype TypedJsonExtractInput = Readonly<{\n  column: SQL;\n  dialect: DialectAdapter;\n  fallback?: JsonExtractFallback;\n  pointer: JsonPointer;\n  valueType: string | undefined;\n}>;\n\nexport function compileTypedJsonExtract(input: TypedJsonExtractInput): SQL {\n  const { column, dialect, pointer, valueType } = input;\n  const fallback = input.fallback ?? \"json\";\n\n  switch (valueType) {\n    case \"string\": {\n      return dialect.jsonExtractText(column, pointer);\n    }\n    case \"number\": {\n      return dialect.jsonExtractNumber(column, pointer);\n    }\n    case \"boolean\": {\n      return dialect.jsonExtractBoolean(column, pointer);\n    }\n    case \"date\": {\n      return dialect.jsonExtractDate(column, pointer);\n    }\n    case \"array\":\n    case \"object\":\n    case \"embedding\":\n    case \"unknown\":\n    case undefined: {\n      return fallback === \"text\" ?\n          dialect.jsonExtractText(column, pointer)\n        : dialect.jsonExtract(column, pointer);\n    }\n    default: {\n      return fallback === \"text\" ?\n          dialect.jsonExtractText(column, pointer)\n        : dialect.jsonExtract(column, pointer);\n    }\n  }\n}\n","import { type SQL, sql } from \"drizzle-orm\";\n\nimport { UnsupportedPredicateError } from \"../../../errors\";\nimport {\n  type AggregateExpr,\n  DEFAULT_RRF_K,\n  DEFAULT_RRF_WEIGHT,\n  type FieldRef,\n  type FulltextMatchPredicate,\n  type HybridFusionOptions,\n  type QueryAst,\n  type SelectiveField,\n  type VectorSimilarityPredicate,\n} from \"../../ast\";\nimport { type DialectAdapter } from \"../../dialect/types\";\nimport {\n  vectorMinScoreCondition,\n  vectorScoreExpression,\n} from \"../../dialect/vector-strategy\";\nimport { jsonPointer } from \"../../json-pointer\";\nimport { type TemporalFilterPass } from \"../passes\";\nimport {\n  compileKindFilter,\n  compilePredicateClauses,\n  getHybridTargetAlias,\n  getNodeKindsForAlias,\n  getPredicatesForAlias,\n  type PredicateIndex,\n} from \"../predicate-utils\";\nimport {\n  compileFieldValue,\n  compilePredicateExpression,\n  type PredicateCompilerContext,\n} from \"../predicates\";\nimport {\n  ALIAS_CTE_PREFIX,\n  EMBEDDINGS_CTE_ALIAS,\n  FULLTEXT_CTE_ALIAS,\n  HYBRID_CANDIDATES_CTE_ALIAS,\n  vectorSlotKey,\n} from \"../schema\";\nimport { compileTypedJsonExtract } from \"../typed-json-extract\";\nimport {\n  EDGE_COLUMNS,\n  EMPTY_REQUIRED_COLUMNS,\n  isAggregateExpr,\n  mapSelectiveSystemFieldToColumn,\n  NODE_COLUMNS,\n  quoteIdentifier,\n  type RequiredColumnsByAlias,\n  shouldProjectColumn,\n} from \"../utils\";\n\nexport type StandardEmitterPredicateIndex = PredicateIndex;\n\nfunction compileColumnReference(\n  tableAlias: string | undefined,\n  column: string,\n): SQL {\n  if (tableAlias === undefined) {\n    return sql.raw(column);\n  }\n  return sql`${sql.raw(tableAlias)}.${sql.raw(column)}`;\n}\n\nfunction qualifyColumn(owner: string, name: string): SQL {\n  return sql`${quoteIdentifier(owner)}.${quoteIdentifier(name)}`;\n}\n\nconst SCOPED_RELEVANCE_NODES_ALIAS = \"scoped_relevance_nodes\";\n\nfunction buildScopedNodeIdsSubquery(nodeAlias: string): SQL {\n  const cteAlias = `${ALIAS_CTE_PREFIX}${nodeAlias}`;\n  return sql`\n    (\n        SELECT DISTINCT\n          ${qualifyColumn(cteAlias, `${nodeAlias}_id`)} AS node_id,\n          ${qualifyColumn(cteAlias, `${nodeAlias}_kind`)} AS node_kind\n        FROM ${quoteIdentifier(cteAlias)}\n      ) AS ${sql.raw(SCOPED_RELEVANCE_NODES_ALIAS)}\n  `;\n}\n\nfunction compileNodeSelectColumns(\n  tableAlias: string | undefined,\n  alias: string,\n  requiredColumns: ReadonlySet<string> | undefined,\n): SQL[] {\n  return NODE_COLUMNS.filter(\n    (column) =>\n      column === \"id\" ||\n      column === \"kind\" ||\n      shouldProjectColumn(requiredColumns, column),\n  ).map(\n    (column) =>\n      sql`${compileColumnReference(tableAlias, column)} AS ${sql.raw(`${alias}_${column}`)}`,\n  );\n}\n\nfunction compileEdgeSelectColumns(\n  tableAlias: string | undefined,\n  alias: string,\n  requiredColumns: ReadonlySet<string> | undefined,\n): SQL[] {\n  return EDGE_COLUMNS.filter((column) =>\n    shouldProjectColumn(requiredColumns, column),\n  ).map(\n    (column) =>\n      sql`${compileColumnReference(tableAlias, column)} AS ${sql.raw(`${alias}_${column}`)}`,\n  );\n}\n\ntype BuildStandardStartCteInput = Readonly<{\n  ast: QueryAst;\n  ctx: PredicateCompilerContext;\n  graphId: string;\n  predicateIndex: StandardEmitterPredicateIndex;\n  requiredColumnsByAlias: RequiredColumnsByAlias | undefined;\n  temporalFilterPass: TemporalFilterPass;\n  /**\n   * Optional LIMIT/OFFSET to apply inside the start CTE. Used by the count\n   * aggregate fast path to push limits past the GROUP BY when it's safe.\n   */\n  limitOffset?: Readonly<{ limit: number; offset?: number | undefined }>;\n}>;\n\nexport function buildStandardStartCte(input: BuildStandardStartCteInput): SQL {\n  const { ast, ctx, graphId, predicateIndex, requiredColumnsByAlias } = input;\n  const alias = ast.start.alias;\n  const kinds = ast.start.kinds;\n  const cteMaterialization =\n    ctx.dialect.capabilities.emitNotMaterializedHint ?\n      sql`NOT MATERIALIZED `\n    : sql``;\n\n  const kindFilter = compileKindFilter(sql.raw(\"kind\"), kinds);\n  const temporalFilter = input.temporalFilterPass.forAlias();\n  const cteContext: PredicateCompilerContext = { ...ctx, cteColumnPrefix: \"\" };\n  const predicateClauses = compilePredicateClauses(\n    getPredicatesForAlias(predicateIndex, alias, \"node\"),\n    cteContext,\n  );\n\n  const whereClauses = [\n    sql`graph_id = ${graphId}`,\n    kindFilter,\n    temporalFilter,\n    ...predicateClauses,\n  ];\n\n  const effectiveRequiredColumns =\n    requiredColumnsByAlias ?\n      (requiredColumnsByAlias.get(alias) ?? EMPTY_REQUIRED_COLUMNS)\n    : undefined;\n\n  const limitClause =\n    input.limitOffset === undefined ? sql``\n    : input.limitOffset.offset === undefined ?\n      sql`\n        LIMIT ${input.limitOffset.limit}\n      `\n    : sql`\n      LIMIT ${input.limitOffset.limit} OFFSET ${input.limitOffset.offset}\n    `;\n\n  return sql`\n    cte_${sql.raw(alias)} AS ${cteMaterialization}(\n      SELECT ${sql.join(\n        compileNodeSelectColumns(undefined, alias, effectiveRequiredColumns),\n        sql`, `,\n      )}\n      FROM ${ctx.schema.nodesTable}\n      WHERE ${sql.join(whereClauses, sql` AND `)}${limitClause}\n    )\n  `;\n}\n\ntype BuildStandardTraversalCteInput = Readonly<{\n  ast: QueryAst;\n  carryForwardPreviousColumns: boolean;\n  ctx: PredicateCompilerContext;\n  graphId: string;\n  materializeCte: boolean;\n  predicateIndex: StandardEmitterPredicateIndex;\n  requiredColumnsByAlias: RequiredColumnsByAlias | undefined;\n  temporalFilterPass: TemporalFilterPass;\n  traversalIndex: number;\n  traversalLimit: number | undefined;\n}>;\n\nexport function buildStandardTraversalCte(\n  input: BuildStandardTraversalCteInput,\n): SQL {\n  const {\n    ast,\n    carryForwardPreviousColumns,\n    ctx,\n    graphId,\n    materializeCte,\n    predicateIndex,\n    requiredColumnsByAlias,\n    temporalFilterPass,\n    traversalIndex,\n    traversalLimit,\n  } = input;\n  const traversal = ast.traversals[traversalIndex]!;\n  const traversalLimitValue =\n    traversalIndex === ast.traversals.length - 1 ? traversalLimit : undefined;\n\n  const previousNodeKinds = getNodeKindsForAlias(ast, traversal.joinFromAlias);\n  const directEdgeKinds = [...new Set(traversal.edgeKinds)];\n  const inverseEdgeKinds =\n    traversal.inverseEdgeKinds === undefined ?\n      []\n    : [...new Set(traversal.inverseEdgeKinds)];\n\n  const nodeKinds = traversal.nodeKinds;\n  const nodeKindFilter = compileKindFilter(sql.raw(\"n.kind\"), nodeKinds);\n\n  const edgeTemporalFilter = temporalFilterPass.forAlias(\"e\");\n  const nodeTemporalFilter = temporalFilterPass.forAlias(\"n\");\n\n  const nodeCteContext: PredicateCompilerContext = {\n    ...ctx,\n    cteColumnPrefix: \"n\",\n  };\n  const nodePredicateClauses = compilePredicateClauses(\n    getPredicatesForAlias(predicateIndex, traversal.nodeAlias, \"node\"),\n    nodeCteContext,\n  );\n\n  const edgeCteContext: PredicateCompilerContext = {\n    ...ctx,\n    cteColumnPrefix: \"e\",\n  };\n  const edgePredicateClauses = compilePredicateClauses(\n    getPredicatesForAlias(predicateIndex, traversal.edgeAlias, \"edge\"),\n    edgeCteContext,\n  );\n\n  const baseWhereClauses = [\n    sql`e.graph_id = ${graphId}`,\n    nodeKindFilter,\n    edgeTemporalFilter,\n    nodeTemporalFilter,\n    ...nodePredicateClauses,\n    ...edgePredicateClauses,\n  ];\n\n  const previousAlias = traversal.joinFromAlias;\n  const edgeAlias = traversal.edgeAlias;\n  const nodeAlias = traversal.nodeAlias;\n  const requiredNodeColumns =\n    requiredColumnsByAlias ?\n      (requiredColumnsByAlias.get(nodeAlias) ?? EMPTY_REQUIRED_COLUMNS)\n    : undefined;\n  const requiredEdgeColumns =\n    requiredColumnsByAlias ?\n      (requiredColumnsByAlias.get(edgeAlias) ?? EMPTY_REQUIRED_COLUMNS)\n    : undefined;\n  const previousRowColumns =\n    carryForwardPreviousColumns ?\n      [sql`cte_${sql.raw(previousAlias)}.*`]\n    : [\n        sql`cte_${sql.raw(previousAlias)}.${sql.raw(previousAlias)}_id AS ${sql.raw(previousAlias)}_id`,\n        sql`cte_${sql.raw(previousAlias)}.${sql.raw(previousAlias)}_kind AS ${sql.raw(previousAlias)}_kind`,\n      ];\n  const selectColumns = [\n    ...previousRowColumns,\n    ...compileEdgeSelectColumns(\"e\", edgeAlias, requiredEdgeColumns),\n    ...compileNodeSelectColumns(\"n\", nodeAlias, requiredNodeColumns),\n  ];\n  const cteMaterialization =\n    materializeCte ? sql`MATERIALIZED `\n    : ctx.dialect.capabilities.emitNotMaterializedHint ? sql`NOT MATERIALIZED `\n    : sql``;\n\n  function compileTraversalBranch(\n    branch: Readonly<{\n      duplicateGuard?: SQL | undefined;\n      edgeKinds: readonly string[];\n      joinField: \"from_id\" | \"to_id\";\n      joinKindField: \"from_kind\" | \"to_kind\";\n      targetField: \"from_id\" | \"to_id\";\n      targetKindField: \"from_kind\" | \"to_kind\";\n    }>,\n  ): SQL {\n    const whereClauses = [\n      ...baseWhereClauses,\n      compileKindFilter(sql.raw(\"e.kind\"), branch.edgeKinds),\n      compileKindFilter(\n        sql.raw(`e.${branch.joinKindField}`),\n        previousNodeKinds,\n      ),\n      compileKindFilter(sql.raw(`e.${branch.targetKindField}`), nodeKinds),\n    ];\n\n    if (branch.duplicateGuard !== undefined) {\n      whereClauses.push(branch.duplicateGuard);\n    }\n\n    return sql`\n      SELECT ${sql.join(selectColumns, sql`, `)}\n      FROM cte_${sql.raw(previousAlias)}\n      JOIN ${ctx.schema.edgesTable} e ON cte_${sql.raw(previousAlias)}.${sql.raw(previousAlias)}_id = e.${sql.raw(branch.joinField)}\n        AND cte_${sql.raw(previousAlias)}.${sql.raw(previousAlias)}_kind = e.${sql.raw(branch.joinKindField)}\n      JOIN ${ctx.schema.nodesTable} n ON n.graph_id = e.graph_id\n        AND n.id = e.${sql.raw(branch.targetField)}\n        AND n.kind = e.${sql.raw(branch.targetKindField)}\n      WHERE ${sql.join(whereClauses, sql` AND `)}\n    `;\n  }\n\n  const directJoinField = traversal.direction === \"out\" ? \"from_id\" : \"to_id\";\n  const directTargetField = traversal.direction === \"out\" ? \"to_id\" : \"from_id\";\n  const directJoinKindField =\n    traversal.direction === \"out\" ? \"from_kind\" : \"to_kind\";\n  const directTargetKindField =\n    traversal.direction === \"out\" ? \"to_kind\" : \"from_kind\";\n\n  const directBranch = compileTraversalBranch({\n    edgeKinds: directEdgeKinds,\n    joinField: directJoinField,\n    joinKindField: directJoinKindField,\n    targetField: directTargetField,\n    targetKindField: directTargetKindField,\n  });\n\n  if (inverseEdgeKinds.length === 0) {\n    if (traversalLimitValue !== undefined) {\n      return sql`\n        cte_${sql.raw(nodeAlias)} AS ${cteMaterialization}(\n          SELECT * FROM (\n            ${directBranch}\n          ) AS traversal_rows\n          LIMIT ${traversalLimitValue}\n        )\n      `;\n    }\n\n    return sql`\n      cte_${sql.raw(nodeAlias)} AS ${cteMaterialization}(\n        ${directBranch}\n      )\n    `;\n  }\n\n  const inverseJoinField = traversal.direction === \"out\" ? \"to_id\" : \"from_id\";\n  const inverseTargetField =\n    traversal.direction === \"out\" ? \"from_id\" : \"to_id\";\n  const inverseJoinKindField =\n    traversal.direction === \"out\" ? \"to_kind\" : \"from_kind\";\n  const inverseTargetKindField =\n    traversal.direction === \"out\" ? \"from_kind\" : \"to_kind\";\n\n  const overlappingKinds = inverseEdgeKinds.filter((kind) =>\n    directEdgeKinds.includes(kind),\n  );\n\n  const duplicateGuard =\n    overlappingKinds.length > 0 ?\n      sql`NOT (e.from_id = e.to_id AND ${compileKindFilter(\n        sql.raw(\"e.kind\"),\n        overlappingKinds,\n      )})`\n    : undefined;\n\n  const inverseBranch = compileTraversalBranch({\n    duplicateGuard,\n    edgeKinds: inverseEdgeKinds,\n    joinField: inverseJoinField,\n    joinKindField: inverseJoinKindField,\n    targetField: inverseTargetField,\n    targetKindField: inverseTargetKindField,\n  });\n\n  if (traversalLimitValue !== undefined) {\n    return sql`\n      cte_${sql.raw(nodeAlias)} AS ${cteMaterialization}(\n        SELECT * FROM (\n          ${directBranch}\n          UNION ALL\n          ${inverseBranch}\n        ) AS traversal_rows\n        LIMIT ${traversalLimitValue}\n      )\n    `;\n  }\n\n  return sql`\n    cte_${sql.raw(nodeAlias)} AS ${cteMaterialization}(\n      ${directBranch}\n      UNION ALL\n      ${inverseBranch}\n    )\n  `;\n}\n\nfunction compileAggregateExprFromSource(\n  expr: AggregateExpr,\n  dialect: DialectAdapter,\n): SQL {\n  const { field } = expr;\n  const fn = expr.function;\n\n  switch (fn) {\n    case \"count\":\n    case \"countDistinct\":\n    case \"sum\":\n    case \"avg\":\n    case \"min\":\n    case \"max\": {\n      const cteAlias = `cte_${field.alias}`;\n      const column = compileFieldValue(\n        field,\n        dialect,\n        field.valueType,\n        cteAlias,\n      );\n      if (fn === \"countDistinct\") {\n        return sql`COUNT(DISTINCT ${column})`;\n      }\n      return sql`${sql.raw(fn.toUpperCase())}(${column})`;\n    }\n    default: {\n      throw new UnsupportedPredicateError(\n        `Unknown aggregate function: ${String(fn)}`,\n      );\n    }\n  }\n}\n\nfunction compileProjectedSource(\n  field: {\n    cteAlias?: string;\n    source: FieldRef | AggregateExpr;\n  },\n  dialect: DialectAdapter,\n): SQL {\n  if (isAggregateExpr(field.source)) {\n    return compileAggregateExprFromSource(field.source, dialect);\n  }\n  const cteAlias = field.cteAlias ?? `cte_${field.source.alias}`;\n  return compileFieldValue(\n    field.source,\n    dialect,\n    field.source.valueType,\n    cteAlias,\n  );\n}\n\ntype BuildStandardProjectionInput = Readonly<{\n  ast: QueryAst;\n  collapsedTraversalCteAlias?: string;\n  dialect: DialectAdapter;\n}>;\n\nexport function buildStandardProjection(\n  input: BuildStandardProjectionInput,\n): SQL {\n  const { ast, collapsedTraversalCteAlias, dialect } = input;\n  if (ast.selectiveFields && ast.selectiveFields.length > 0) {\n    return compileSelectiveProjection(\n      ast.selectiveFields,\n      dialect,\n      ast,\n      collapsedTraversalCteAlias,\n    );\n  }\n\n  const fields = ast.projection.fields;\n  if (fields.length === 0) {\n    return sql.raw(\"*\");\n  }\n\n  const projectedFields = fields.map((field) => {\n    const source = compileProjectedSource(field, dialect);\n    return sql`${source} AS ${quoteIdentifier(field.outputName)}`;\n  });\n  return sql.join(projectedFields, sql`, `);\n}\n\n/**\n * Builds a map from query aliases (node and edge) to their CTE table names.\n * Edge aliases map to the CTE of the traversal node they are co-projected with.\n */\nfunction buildAliasToCteMap(ast: QueryAst): Map<string, string> {\n  const map = new Map<string, string>([\n    [ast.start.alias, `cte_${ast.start.alias}`],\n  ]);\n  for (const traversal of ast.traversals) {\n    map.set(traversal.nodeAlias, `cte_${traversal.nodeAlias}`);\n    map.set(traversal.edgeAlias, `cte_${traversal.nodeAlias}`);\n  }\n  return map;\n}\n\nfunction compileSelectiveProjection(\n  fields: readonly SelectiveField[],\n  dialect: DialectAdapter,\n  ast: QueryAst,\n  collapsedTraversalCteAlias?: string,\n): SQL {\n  const aliasToCte = buildAliasToCteMap(ast);\n\n  const columns = fields.map((field) => {\n    const cteAlias =\n      collapsedTraversalCteAlias ??\n      aliasToCte.get(field.alias) ??\n      `cte_${field.alias}`;\n\n    if (field.isSystemField) {\n      const dbColumn = mapSelectiveSystemFieldToColumn(field.field);\n\n      return sql`${sql.raw(cteAlias)}.${sql.raw(`${field.alias}_${dbColumn}`)} AS ${quoteIdentifier(field.outputName)}`;\n    }\n\n    const propsColumn = `${field.alias}_props`;\n    const column = sql`${sql.raw(cteAlias)}.${sql.raw(propsColumn)}`;\n    const pointer = jsonPointer([field.field]);\n    const extracted = compileTypedJsonExtract({\n      column,\n      dialect,\n      pointer,\n      valueType: field.valueType,\n    });\n    return sql`${extracted} AS ${quoteIdentifier(field.outputName)}`;\n  });\n\n  return sql.join(columns, sql`, `);\n}\n\nfunction buildRelevanceJoins(\n  vectorPredicate: VectorSimilarityPredicate | undefined,\n  fulltextPredicate: FulltextMatchPredicate | undefined,\n): SQL[] {\n  const hybridTargetAlias = getHybridTargetAlias(\n    vectorPredicate,\n    fulltextPredicate,\n  );\n  if (hybridTargetAlias !== undefined) {\n    return [\n      buildHybridCandidateJoin(hybridTargetAlias),\n      buildRelevanceJoin(EMBEDDINGS_CTE_ALIAS, hybridTargetAlias, \"LEFT JOIN\"),\n      buildRelevanceJoin(FULLTEXT_CTE_ALIAS, hybridTargetAlias, \"LEFT JOIN\"),\n    ];\n  }\n\n  const joins: SQL[] = [];\n  if (vectorPredicate) {\n    joins.push(\n      buildRelevanceJoin(EMBEDDINGS_CTE_ALIAS, vectorPredicate.field.alias),\n    );\n  }\n  if (fulltextPredicate) {\n    joins.push(\n      buildRelevanceJoin(FULLTEXT_CTE_ALIAS, fulltextPredicate.field.alias),\n    );\n  }\n  return joins;\n}\n\nfunction buildHybridCandidateJoin(nodeAlias: string): SQL {\n  const candidateCte = sql.raw(HYBRID_CANDIDATES_CTE_ALIAS);\n  const node = sql.raw(`${ALIAS_CTE_PREFIX}${nodeAlias}`);\n  const idColumn = sql.raw(`${nodeAlias}_id`);\n  const kindColumn = sql.raw(`${nodeAlias}_kind`);\n  return sql`INNER JOIN ${candidateCte} ON ${candidateCte}.node_id = ${node}.${idColumn} AND ${candidateCte}.node_kind = ${node}.${kindColumn}`;\n}\n\nfunction buildRelevanceJoin(\n  cteAlias: string,\n  nodeAlias: string,\n  joinType = \"INNER JOIN\",\n): SQL {\n  const cte = sql.raw(cteAlias);\n  const node = sql.raw(`${ALIAS_CTE_PREFIX}${nodeAlias}`);\n  const idColumn = sql.raw(`${nodeAlias}_id`);\n  const kindColumn = sql.raw(`${nodeAlias}_kind`);\n  return sql`${sql.raw(joinType)} ${cte} ON ${cte}.node_id = ${node}.${idColumn} AND ${cte}.node_kind = ${node}.${kindColumn}`;\n}\n\ntype BuildStandardFromClauseInput = Readonly<{\n  ast: QueryAst;\n  collapsedTraversalCteAlias?: string;\n  fulltextPredicate?: FulltextMatchPredicate;\n  vectorPredicate?: VectorSimilarityPredicate;\n}>;\n\nexport function buildStandardFromClause(\n  input: BuildStandardFromClauseInput,\n): SQL {\n  const {\n    ast,\n    collapsedTraversalCteAlias,\n    fulltextPredicate,\n    vectorPredicate,\n  } = input;\n  if (collapsedTraversalCteAlias !== undefined) {\n    return sql`FROM ${sql.raw(collapsedTraversalCteAlias)}`;\n  }\n\n  const startAlias = ast.start.alias;\n  const fromClause = sql`FROM cte_${sql.raw(startAlias)}`;\n\n  const joins: SQL[] = [];\n  for (const traversal of ast.traversals) {\n    const cteAlias = `cte_${traversal.nodeAlias}`;\n    const previousAlias = traversal.joinFromAlias;\n    const joinType = traversal.optional ? \"LEFT JOIN\" : \"INNER JOIN\";\n    joins.push(\n      sql`${sql.raw(joinType)} ${sql.raw(cteAlias)} ON ${sql.raw(cteAlias)}.${sql.raw(previousAlias)}_id = cte_${sql.raw(previousAlias)}.${sql.raw(previousAlias)}_id AND ${sql.raw(cteAlias)}.${sql.raw(previousAlias)}_kind = cte_${sql.raw(previousAlias)}.${sql.raw(previousAlias)}_kind`,\n    );\n  }\n\n  // Node IDs are unique only within a kind (PK is graph_id, kind, id),\n  // so the relevance-CTE joins must include node_kind. Without it,\n  // polymorphic queries would cross-join on user-supplied ids shared\n  // across kinds.\n  for (const join of buildRelevanceJoins(vectorPredicate, fulltextPredicate)) {\n    joins.push(join);\n  }\n\n  return joins.length === 0 ?\n      fromClause\n    : sql`${fromClause} ${sql.join(joins, sql` `)}`;\n}\n\ntype BuildStandardOrderByInput = Readonly<{\n  ast: QueryAst;\n  collapsedTraversalCteAlias?: string;\n  dialect: DialectAdapter;\n}>;\n\nexport function buildStandardOrderBy(\n  input: BuildStandardOrderByInput,\n): SQL | undefined {\n  const { ast, collapsedTraversalCteAlias, dialect } = input;\n  if (!ast.orderBy || ast.orderBy.length === 0) {\n    return undefined;\n  }\n\n  const aliasToCte = buildAliasToCteMap(ast);\n  const parts: SQL[] = [];\n  for (const orderSpec of ast.orderBy) {\n    const valueType = orderSpec.field.valueType;\n    if (valueType === \"array\" || valueType === \"object\") {\n      throw new UnsupportedPredicateError(\n        \"Ordering by JSON arrays or objects is not supported\",\n      );\n    }\n    const cteAlias =\n      collapsedTraversalCteAlias ??\n      aliasToCte.get(orderSpec.field.alias) ??\n      `cte_${orderSpec.field.alias}`;\n    const field = compileFieldValue(\n      orderSpec.field,\n      dialect,\n      valueType,\n      cteAlias,\n    );\n    const direction = sql.raw(orderSpec.direction.toUpperCase());\n    const nulls =\n      orderSpec.nulls ?? (orderSpec.direction === \"asc\" ? \"last\" : \"first\");\n    const nullsDirection = sql.raw(nulls === \"first\" ? \"DESC\" : \"ASC\");\n    parts.push(\n      sql`(${field} IS NULL) ${nullsDirection}`,\n      sql`${field} ${direction}`,\n    );\n  }\n\n  return sql`ORDER BY ${sql.join(parts, sql`, `)}`;\n}\n\nfunction fieldRefKey(field: FieldRef): string {\n  const pointer = field.jsonPointer ?? \"\";\n  return `${field.alias}:${field.path.join(\".\")}:${pointer}`;\n}\n\nfunction resolveEmbeddingFieldPath(field: FieldRef): string {\n  if (\n    field.jsonPointer !== undefined &&\n    field.jsonPointer !== \"\" &&\n    field.jsonPointer !== \"/\"\n  ) {\n    return field.jsonPointer.replace(/^\\//u, \"\").replaceAll(\"/\", \".\");\n  }\n\n  if (field.path[0] === \"props\") {\n    return field.path.slice(1).join(\".\");\n  }\n\n  return field.path.join(\".\");\n}\n\ntype BuildStandardGroupByInput = Readonly<{\n  ast: QueryAst;\n  dialect: DialectAdapter;\n}>;\n\nexport function buildStandardGroupBy(\n  input: BuildStandardGroupByInput,\n): SQL | undefined {\n  const { ast, dialect } = input;\n  if (!ast.groupBy || ast.groupBy.fields.length === 0) {\n    return undefined;\n  }\n\n  const seenKeys = new Set<string>();\n  const allFields: FieldRef[] = [];\n\n  for (const projectedField of ast.projection.fields) {\n    if (projectedField.source.__type === \"field_ref\") {\n      const key = fieldRefKey(projectedField.source);\n      if (!seenKeys.has(key)) {\n        seenKeys.add(key);\n        allFields.push(projectedField.source);\n      }\n    }\n  }\n\n  for (const field of ast.groupBy.fields) {\n    const key = fieldRefKey(field);\n    if (!seenKeys.has(key)) {\n      seenKeys.add(key);\n      allFields.push(field);\n    }\n  }\n\n  if (allFields.length === 0) {\n    return undefined;\n  }\n\n  const aliasToCte = buildAliasToCteMap(ast);\n  const parts = allFields.map((field) =>\n    compileFieldValue(\n      field,\n      dialect,\n      field.valueType,\n      aliasToCte.get(field.alias) ?? `cte_${field.alias}`,\n    ),\n  );\n\n  return sql`GROUP BY ${sql.join(parts, sql`, `)}`;\n}\n\ntype BuildStandardHavingInput = Readonly<{\n  ast: QueryAst;\n  ctx: PredicateCompilerContext;\n}>;\n\nexport function buildStandardHaving(\n  input: BuildStandardHavingInput,\n): SQL | undefined {\n  const { ast, ctx } = input;\n  if (!ast.having) {\n    return undefined;\n  }\n\n  const condition = compilePredicateExpression(ast.having, ctx);\n  return sql`HAVING ${condition}`;\n}\n\ntype BuildStandardEmbeddingsCteInput = Readonly<{\n  ctx: PredicateCompilerContext;\n  graphId: string;\n  nodeKinds: readonly string[];\n  vectorPredicate: VectorSimilarityPredicate;\n}>;\n\n/**\n * Builds the relevance CTE for a `field.similarTo(...)` predicate in the query\n * builder. NOTE: this path is exact-but-brute-force — it splices the strategy's\n * `distanceExpression` and full-scans each declaring kind's per-field table\n * (`ORDER BY distance LIMIT k`); it does NOT use a strategy's engine-native ANN\n * (vec0 `MATCH … k=`, libSQL `vector_top_k`, pgvector's HNSW scan), which is\n * only reachable through the `store.search.vector` / `store.search.hybrid`\n * facade. For ANN-accelerated retrieval at scale use the facade; use\n * `.where(similarTo())` when you need to compose vector similarity with\n * arbitrary predicates / traversals in one query and exact ranking is fine.\n */\nexport function buildStandardEmbeddingsCte(\n  input: BuildStandardEmbeddingsCteInput,\n): SQL {\n  const { ctx, graphId, nodeKinds, vectorPredicate } = input;\n  const { field, metric, minScore, queryEmbedding } = vectorPredicate;\n\n  if (nodeKinds.length === 0) {\n    throw new UnsupportedPredicateError(\n      \"Vector predicate must resolve to at least one node kind\",\n    );\n  }\n\n  const { vectorStrategy } = ctx;\n  if (vectorStrategy === undefined) {\n    throw new UnsupportedPredicateError(\n      \"Vector similarity predicate requires a backend with a vector strategy\",\n    );\n  }\n\n  const fieldPath = resolveEmbeddingFieldPath(field);\n  const vectorSlots = ctx.vectorSlots;\n  const scopedNodes = buildScopedNodeIdsSubquery(field.alias);\n\n  // Only the kinds in this alias that actually DECLARE the embedding\n  // field back a per-field table. Skipping kinds without a slot keeps\n  // similarTo() from referencing a table that was never created and\n  // stops rank weight leaking from kinds that happen to share a\n  // field_path but don't embed it.\n  const declaringKinds = nodeKinds.filter((kind) =>\n    vectorSlots?.has(vectorSlotKey(kind, fieldPath)),\n  );\n\n  // Per-kind relevance scan against the strategy's typed per-field\n  // table. The strategy owns the engine-specific distance fragment\n  // (`<=>` / `vec_distance_cosine` / `vector_distance_cos`); the score\n  // and minScore math around it stays shared so the OUTPUT columns\n  // (node_id, node_kind, distance, score, ord) are identical across\n  // engines and the hybrid RRF / vector ORDER BY paths are untouched.\n  const branches = declaringKinds.map((kind) => {\n    const tableName = vectorStrategy.tableName(graphId, kind, fieldPath);\n    // Use the predicate's explicit metric if given, else this kind's DECLARED\n    // metric (the one its ANN index was built for). Resolving per kind keeps an\n    // includeSubClasses union correct when subkinds declare different metrics.\n    const branchMetric =\n      metric ??\n      vectorSlots?.get(vectorSlotKey(kind, fieldPath))?.metric ??\n      \"cosine\";\n    const distanceExpr = vectorStrategy.distanceExpression(\n      qualifyColumn(tableName, \"embedding\"),\n      queryEmbedding,\n      branchMetric,\n    );\n    const scoreExpr = vectorScoreExpression(distanceExpr, branchMetric);\n\n    const conditions: SQL[] = [\n      sql`${qualifyColumn(tableName, \"graph_id\")} = ${graphId}`,\n    ];\n    if (minScore !== undefined) {\n      // minScore validation (finiteness, cosine range) is handled by the\n      // vector predicate pass in passes/vector.ts — no redundant check.\n      conditions.push(\n        vectorMinScoreCondition(distanceExpr, branchMetric, minScore),\n      );\n    }\n\n    return sql`\n      SELECT\n        ${qualifyColumn(tableName, \"node_id\")} AS node_id,\n        ${kind} AS node_kind,\n        ${distanceExpr} AS distance,\n        ${scoreExpr} AS score\n      FROM ${quoteIdentifier(tableName)}\n      INNER JOIN ${scopedNodes}\n        ON ${sql.raw(`${SCOPED_RELEVANCE_NODES_ALIAS}.node_id`)} =\n           ${qualifyColumn(tableName, \"node_id\")}\n       AND ${sql.raw(`${SCOPED_RELEVANCE_NODES_ALIAS}.node_kind`)} = ${kind}\n      WHERE ${sql.join(conditions, sql` AND `)}\n    `;\n  });\n\n  // No declaring kind → emit a CTE with the right column shape that\n  // yields no rows, so the rest of the emitter (which always references\n  // cte_embeddings) compiles and simply matches nothing.\n  const unionBody =\n    branches.length === 0 ?\n      emptyEmbeddingsBody()\n    : sql.join(\n        branches,\n        sql`\n          UNION ALL\n        `,\n      );\n\n  // Inner SELECT applies the predicate's k-cutoff, then ROW_NUMBER ranks\n  // over that bounded set. Without the inner LIMIT, a hybrid query would\n  // assign vector ordinals to every candidate, letting documents far\n  // outside the requested top-k contribute to the RRF fused score and\n  // reorder final results.\n  return sql`\n    ${sql.raw(EMBEDDINGS_CTE_ALIAS)} AS (\n      SELECT\n        node_id,\n        node_kind,\n        distance,\n        score,\n        ROW_NUMBER() OVER (ORDER BY distance ASC) AS ord\n      FROM (\n        ${unionBody}\n        ORDER BY distance ASC\n        LIMIT ${vectorPredicate.limit}\n      ) AS vec_inner\n    )\n  `;\n}\n\n/**\n * A no-row inner body carrying the exact `(node_id, node_kind, distance,\n * score)` column contract, used when no kind in the alias declares the\n * embedding field. `WHERE 1 = 0` keeps the planner from scanning.\n */\nfunction emptyEmbeddingsBody(): SQL {\n  return sql`\n    SELECT\n      CAST(NULL AS TEXT) AS node_id,\n      CAST(NULL AS TEXT) AS node_kind,\n      CAST(NULL AS REAL) AS distance,\n      CAST(NULL AS REAL) AS score\n    WHERE 1 = 0\n  `;\n}\n\n// ============================================================\n// Fulltext Search CTE\n// ============================================================\n\ntype BuildStandardFulltextCteInput = Readonly<{\n  ctx: PredicateCompilerContext;\n  fulltextPredicate: FulltextMatchPredicate;\n  graphId: string;\n  nodeKinds: readonly string[];\n}>;\n\nexport function buildStandardFulltextCte(\n  input: BuildStandardFulltextCteInput,\n): SQL {\n  const { ctx, fulltextPredicate, graphId, nodeKinds } = input;\n  const { dialect, schema } = ctx;\n  const { query, mode, language, limit, minScore } = fulltextPredicate;\n\n  if (nodeKinds.length === 0) {\n    throw new UnsupportedPredicateError(\n      \"Fulltext predicate must resolve to at least one node kind\",\n    );\n  }\n\n  const tableName = schema.tables.fulltext;\n  const scopedNodes = buildScopedNodeIdsSubquery(fulltextPredicate.field.alias);\n  const fulltextStrategy = dialect.fulltext;\n  if (fulltextStrategy === undefined) {\n    throw new UnsupportedPredicateError(\n      `Fulltext match predicates are not supported for dialect \"${dialect.name}\"`,\n    );\n  }\n  const matchCondition = fulltextStrategy.matchCondition(\n    tableName,\n    query,\n    mode,\n    language,\n  );\n  const rankExpression = fulltextStrategy.rankExpression(\n    tableName,\n    query,\n    mode,\n    language,\n  );\n\n  const conditions: SQL[] = [\n    sql`${qualifyColumn(tableName, \"graph_id\")} = ${graphId}`,\n    compileKindFilter(qualifyColumn(tableName, \"node_kind\"), nodeKinds),\n    matchCondition,\n  ];\n  if (minScore !== undefined) {\n    conditions.push(sql`${rankExpression} >= ${minScore}`);\n  }\n\n  // Inner SELECT computes the rank once into an alias, outer SELECT\n  // adds the ordinal via ROW_NUMBER. Two reasons to nest:\n  // (1) Postgres re-evaluates `ts_rank_cd(...)` if it's repeated across\n  // SELECT/ORDER BY, so referencing the alias avoids duplicate work.\n  // (2) SQLite FTS5's bm25() cannot appear inside a window function's\n  // OVER clause — the auxiliary-function context is restricted.\n  return sql`\n    ${sql.raw(FULLTEXT_CTE_ALIAS)} AS (\n      SELECT\n        node_id,\n        node_kind,\n        rank,\n        ROW_NUMBER() OVER (ORDER BY rank DESC, node_id ASC) AS ord\n      FROM (\n        SELECT\n          ${qualifyColumn(tableName, \"node_id\")} AS node_id,\n          ${qualifyColumn(tableName, \"node_kind\")} AS node_kind,\n          ${rankExpression} AS rank\n        FROM ${schema.fulltextTable}\n        INNER JOIN ${scopedNodes}\n          ON ${sql.raw(`${SCOPED_RELEVANCE_NODES_ALIAS}.node_id`)} =\n             ${qualifyColumn(tableName, \"node_id\")}\n         AND ${sql.raw(`${SCOPED_RELEVANCE_NODES_ALIAS}.node_kind`)} =\n             ${qualifyColumn(tableName, \"node_kind\")}\n        WHERE ${sql.join(conditions, sql` AND `)}\n        ORDER BY rank DESC, ${qualifyColumn(tableName, \"node_id\")} ASC\n        LIMIT ${limit}\n      ) AS fts_inner\n    )\n  `;\n}\n\nexport function buildStandardHybridCandidateCte(): SQL {\n  return sql`\n    ${sql.raw(HYBRID_CANDIDATES_CTE_ALIAS)} AS (\n      SELECT node_id, node_kind FROM ${sql.raw(EMBEDDINGS_CTE_ALIAS)}\n      UNION\n      SELECT node_id, node_kind FROM ${sql.raw(FULLTEXT_CTE_ALIAS)}\n    )\n  `;\n}\n\n/**\n * Compiles user-supplied `orderBy` clauses into SQL fragments suitable\n * for appending after a relevance-driven primary ORDER BY (vector,\n * fulltext, or hybrid RRF).\n */\nfunction compileUserOrderBy(\n  ast: QueryAst,\n  dialect: DialectAdapter,\n): readonly SQL[] {\n  if (!ast.orderBy || ast.orderBy.length === 0) return [];\n\n  const aliasToCte = buildAliasToCteMap(ast);\n  const fragments: SQL[] = [];\n  for (const orderSpec of ast.orderBy) {\n    const valueType = orderSpec.field.valueType;\n    if (valueType === \"array\" || valueType === \"object\") {\n      throw new UnsupportedPredicateError(\n        \"Ordering by JSON arrays or objects is not supported\",\n      );\n    }\n    const cteAlias =\n      aliasToCte.get(orderSpec.field.alias) ??\n      `${ALIAS_CTE_PREFIX}${orderSpec.field.alias}`;\n    const field = compileFieldValue(\n      orderSpec.field,\n      dialect,\n      valueType,\n      cteAlias,\n    );\n    const direction = sql.raw(orderSpec.direction.toUpperCase());\n    const nulls =\n      orderSpec.nulls ?? (orderSpec.direction === \"asc\" ? \"last\" : \"first\");\n    const nullsDirection = sql.raw(nulls === \"first\" ? \"DESC\" : \"ASC\");\n    fragments.push(\n      sql`(${field} IS NULL) ${nullsDirection}`,\n      sql`${field} ${direction}`,\n    );\n  }\n  return fragments;\n}\n\ntype BuildStandardFulltextOrderByInput = Readonly<{\n  ast: QueryAst;\n  dialect: DialectAdapter;\n}>;\n\n/**\n * ORDER BY clause when only a fulltext predicate is present.\n * Orders by rank DESC then any user-supplied ORDER BY as tiebreakers.\n */\nexport function buildStandardFulltextOrderBy(\n  input: BuildStandardFulltextOrderByInput,\n): SQL {\n  const { ast, dialect } = input;\n  const rankOrder = sql.raw(`${FULLTEXT_CTE_ALIAS}.rank DESC`);\n  const userOrders = compileUserOrderBy(ast, dialect);\n  return sql`ORDER BY ${sql.join([rankOrder, ...userOrders], sql`, `)}`;\n}\n\n/**\n * ORDER BY clause when BOTH vector and fulltext predicates are present.\n *\n * Reciprocal Rank Fusion at SQL level. Each CTE emits an `ord` ordinal\n * via ROW_NUMBER; the outer ORDER BY blends them as\n * `w_vec / (k + ord_vec) + w_ft / (k + ord_ft)`. NULL `ord` (a node\n * matched by only one source) makes that source's term NULL → COALESCE-to-0\n * absorbs it. User-supplied `orderBy` clauses follow as tiebreakers,\n * matching the single-source paths so pagination stays stable across\n * RRF score ties.\n *\n * Defaults: k=60, vector weight = fulltext weight = 1. Override via\n * `.fuseWith({ k, weights })` on the query builder.\n */\n\ntype BuildStandardHybridRrfOrderByInput = Readonly<{\n  ast: QueryAst;\n  dialect: DialectAdapter;\n  fusion: HybridFusionOptions | undefined;\n}>;\n\nexport function buildStandardHybridRrfOrderBy(\n  input: BuildStandardHybridRrfOrderByInput,\n): SQL {\n  const { ast, dialect, fusion } = input;\n  const k = fusion?.k ?? DEFAULT_RRF_K;\n  const vectorWeight = fusion?.weights?.vector ?? DEFAULT_RRF_WEIGHT;\n  const fulltextWeight = fusion?.weights?.fulltext ?? DEFAULT_RRF_WEIGHT;\n\n  // Invariant: validateHybridFusionOptions has already rejected\n  // non-finite / negative values before we reach here. sql.raw on these\n  // numeric constants is deliberate — they're schema-level config, not\n  // user-bindable.\n  const rrfOrder = sql.raw(\n    `(COALESCE(${vectorWeight} / (${k} + ${EMBEDDINGS_CTE_ALIAS}.ord), 0) + ` +\n      `COALESCE(${fulltextWeight} / (${k} + ${FULLTEXT_CTE_ALIAS}.ord), 0)) DESC`,\n  );\n  // Deterministic tiebreak on the CTE-projected node_id. At least one of\n  // the two CTEs always has a non-NULL node_id for any row returned by\n  // the LEFT JOIN-union shape, so COALESCE always resolves. This matches\n  // `store.search.hybrid`'s JS-side `localeCompare(nodeId)` tiebreak so\n  // the two paths produce identical top-k under ties.\n  const idTiebreak = sql.raw(\n    `COALESCE(${FULLTEXT_CTE_ALIAS}.node_id, ${EMBEDDINGS_CTE_ALIAS}.node_id) ASC`,\n  );\n  const userOrders = compileUserOrderBy(ast, dialect);\n  return sql`ORDER BY ${sql.join([rrfOrder, ...userOrders, idTiebreak], sql`, `)}`;\n}\n\ntype BuildStandardVectorOrderByInput = Readonly<{\n  ast: QueryAst;\n  dialect: DialectAdapter;\n}>;\n\nexport function buildStandardVectorOrderBy(\n  input: BuildStandardVectorOrderByInput,\n): SQL {\n  const { ast, dialect } = input;\n  const distanceOrder = sql.raw(`${EMBEDDINGS_CTE_ALIAS}.distance ASC`);\n  const userOrders = compileUserOrderBy(ast, dialect);\n  return sql`ORDER BY ${sql.join([distanceOrder, ...userOrders], sql`, `)}`;\n}\n\ntype BuildLimitOffsetClauseInput = Readonly<{\n  limit: number | undefined;\n  offset: number | undefined;\n}>;\n\nexport function buildLimitOffsetClause(\n  input: BuildLimitOffsetClauseInput,\n): SQL | undefined {\n  const { limit, offset } = input;\n  const parts: SQL[] = [];\n\n  if (limit !== undefined) {\n    parts.push(sql`LIMIT ${limit}`);\n  }\n  if (offset !== undefined) {\n    parts.push(sql`OFFSET ${offset}`);\n  }\n\n  return parts.length > 0 ? sql.join(parts, sql` `) : undefined;\n}\n","import { UnsupportedPredicateError } from \"../../../errors\";\nimport type { FulltextMatchPredicate, QueryAst } from \"../../ast\";\nimport type { DialectAdapter } from \"../../dialect\";\nimport { extractFulltextMatchPredicates } from \"../predicates\";\n\nexport type FulltextPredicatePassResult = Readonly<{\n  fulltextPredicate: FulltextMatchPredicate | undefined;\n}>;\n\n/**\n * Validates fulltext predicate placement and cardinality.\n *\n * Invariants mirror the vector predicate pass:\n * - Fulltext predicates must not appear under OR/NOT branches.\n * - At most one fulltext predicate is allowed per query.\n * - The dialect must declare fulltext support.\n */\nexport function runFulltextPredicatePass(\n  ast: QueryAst,\n  dialect: DialectAdapter,\n): FulltextPredicatePassResult {\n  const fulltextPredicates = extractFulltextMatchPredicates(ast.predicates);\n  if (fulltextPredicates.length > 1) {\n    throw new UnsupportedPredicateError(\n      \"Multiple fulltext match predicates in a single query are not supported\",\n    );\n  }\n\n  const fulltextPredicate = fulltextPredicates[0];\n  if (fulltextPredicate === undefined) {\n    return { fulltextPredicate: undefined };\n  }\n\n  if (!dialect.capabilities.supportsFulltext) {\n    throw new UnsupportedPredicateError(\n      `Fulltext match predicates are not supported for dialect \"${dialect.name}\"`,\n    );\n  }\n\n  const strategy = dialect.fulltext;\n  if (strategy === undefined) {\n    throw new UnsupportedPredicateError(\n      `Dialect \"${dialect.name}\" advertises fulltext support but has no strategy configured`,\n    );\n  }\n\n  if (!strategy.supportedModes.includes(fulltextPredicate.mode)) {\n    throw new UnsupportedPredicateError(\n      `Fulltext query mode \"${fulltextPredicate.mode}\" is not supported by the \"${strategy.name}\" strategy. Supported modes: ${strategy.supportedModes.join(\", \")}.`,\n    );\n  }\n\n  if (\n    fulltextPredicate.language !== undefined &&\n    !strategy.supportsLanguageOverride\n  ) {\n    throw new UnsupportedPredicateError(\n      `Fulltext strategy \"${strategy.name}\" does not honor a per-query \\`language\\` override ` +\n        `(its tokenizer is fixed at table-create time). Drop the option, or use a strategy ` +\n        `that advertises \\`supportsLanguageOverride: true\\`.`,\n    );\n  }\n\n  if (\n    !Number.isFinite(fulltextPredicate.limit) ||\n    fulltextPredicate.limit <= 0\n  ) {\n    throw new UnsupportedPredicateError(\n      `Fulltext match limit must be a positive finite number, got ${String(fulltextPredicate.limit)}`,\n    );\n  }\n\n  const { minScore } = fulltextPredicate;\n  if (minScore !== undefined && !Number.isFinite(minScore)) {\n    throw new UnsupportedPredicateError(\n      `Fulltext minScore must be a finite number, got ${String(minScore)}`,\n    );\n  }\n\n  return { fulltextPredicate };\n}\n\n/**\n * Resolves query LIMIT in the presence of a fulltext predicate.\n *\n * Mirrors resolveVectorAwareLimit. When a fulltext predicate is present\n * without an explicit AST limit, the predicate's own limit bounds the\n * result set; when both are present the tighter wins.\n */\nexport function resolveFulltextAwareLimit(\n  astLimit?: number,\n  fulltextPredicate?: FulltextMatchPredicate,\n): number | undefined {\n  if (fulltextPredicate === undefined) {\n    return astLimit;\n  }\n  if (astLimit === undefined) {\n    return fulltextPredicate.limit;\n  }\n  return Math.min(astLimit, fulltextPredicate.limit);\n}\n","import { UnsupportedPredicateError } from \"../../../errors\";\nimport type {\n  FulltextMatchPredicate,\n  HybridFusionOptions,\n  QueryAst,\n  VectorSimilarityPredicate,\n} from \"../../ast\";\n\nexport type FusionConfigPassResult = Readonly<{\n  fusion: HybridFusionOptions | undefined;\n}>;\n\n/**\n * Validates that `.fuseWith()` configuration is coherent with the query\n * shape. Runs after the vector and fulltext predicate passes.\n *\n * - When no `fusion` is configured, returns `{ fusion: undefined }`.\n * - When `fusion` is configured but either predicate is missing, throws.\n * - When the predicates target different aliases, throws.\n */\nexport function runFusionConfigPass(\n  ast: QueryAst,\n  vectorPredicate: VectorSimilarityPredicate | undefined,\n  fulltextPredicate: FulltextMatchPredicate | undefined,\n): FusionConfigPassResult {\n  const fusion = ast.fusion;\n  if (fusion === undefined) return { fusion: undefined };\n\n  if (vectorPredicate === undefined || fulltextPredicate === undefined) {\n    throw new UnsupportedPredicateError(\n      `.fuseWith() requires both a .similarTo() and a .$fulltext.matches() ` +\n        `predicate in the same query. Remove .fuseWith(), or add the missing ` +\n        `predicate.`,\n    );\n  }\n  if (vectorPredicate.field.alias !== fulltextPredicate.field.alias) {\n    throw new UnsupportedPredicateError(\n      `.fuseWith() requires .similarTo() and .$fulltext.matches() to target ` +\n        `the same node alias. Got vector=${vectorPredicate.field.alias}, ` +\n        `fulltext=${fulltextPredicate.field.alias}.`,\n    );\n  }\n  return { fusion };\n}\n","import {\n  CompilerInvariantError,\n  UnsupportedPredicateError,\n} from \"../../../errors\";\nimport type { QueryAst, Traversal, VariableLengthSpec } from \"../../ast\";\n\n/**\n * Traversal with required variable-length spec.\n */\nexport type VariableLengthTraversal = Traversal & {\n  variableLength: VariableLengthSpec;\n};\n\n/**\n * Selects and validates the variable-length traversal target for recursive compilation.\n *\n * Invariants:\n * - Query must contain exactly one variable-length traversal.\n * - Recursive mode currently supports only a single traversal in the query.\n */\nexport function runRecursiveTraversalSelectionPass(\n  ast: QueryAst,\n): VariableLengthTraversal {\n  const variableLengthTraversal = ast.traversals.find(\n    (traversal): traversal is VariableLengthTraversal =>\n      traversal.variableLength !== undefined,\n  );\n\n  if (variableLengthTraversal === undefined) {\n    throw new CompilerInvariantError(\"No variable-length traversal found\");\n  }\n\n  if (ast.traversals.length > 1) {\n    throw new UnsupportedPredicateError(\n      \"Variable-length traversals with multiple traversals are not yet supported. \" +\n        \"Please use a single variable-length traversal.\",\n    );\n  }\n\n  return variableLengthTraversal;\n}\n","export type CompilerPass<TState, TPassName extends string, TOutput> = Readonly<{\n  name: TPassName;\n  execute: (state: TState) => TOutput;\n  update: (state: TState, output: TOutput) => TState;\n}>;\n\nexport type CompilerPassResult<TState> = Readonly<{\n  state: TState;\n}>;\n\nexport function runCompilerPass<TState, TPassName extends string, TOutput>(\n  state: TState,\n  pass: CompilerPass<TState, TPassName, TOutput>,\n): CompilerPassResult<TState> {\n  const output = pass.execute(state);\n  return {\n    state: pass.update(state, output),\n  };\n}\n","/**\n * Temporal Filter Compilation\n *\n * Generates SQL clauses for temporal filtering based on valid_from/valid_to\n * and deleted_at timestamps. Consolidates the previously duplicated temporal\n * filter functions into a single, parameterized implementation.\n */\nimport { type SQL, sql } from \"drizzle-orm\";\n\nimport { type TemporalMode } from \"../../core/types\";\n\n/**\n * Temporal filter options.\n */\nexport type TemporalFilterOptions = Readonly<{\n  /** The temporal mode to apply */\n  mode: TemporalMode;\n  /** Timestamp for asOf queries (required when mode is \"asOf\") */\n  asOf?: string | undefined;\n  /** Optional table alias prefix for column references */\n  tableAlias?: string | undefined;\n  /** Optional execution-time current timestamp SQL expression */\n  currentTimestamp?: SQL | undefined;\n}>;\n\n/**\n * Compiles a temporal filter to SQL.\n *\n * This is the unified temporal filter function that handles all temporal modes\n * and optional table alias prefixes. It replaces the previous three separate\n * functions (compileTemporalFilter, compileEdgeTemporalFilter, compileNodeTemporalFilter).\n *\n * @param options - Temporal filter configuration\n * @returns SQL clause for the temporal filter\n *\n * @example\n * ```typescript\n * // Without table alias (for CTEs)\n * compileTemporalFilter({ mode: \"current\" })\n * // → deleted_at IS NULL AND (valid_from IS NULL OR ...) AND ...\n *\n * // With table alias (for JOINs)\n * compileTemporalFilter({ mode: \"current\", tableAlias: \"e\" })\n * // → e.deleted_at IS NULL AND (e.valid_from IS NULL OR ...) AND ...\n *\n * // AsOf mode\n * compileTemporalFilter({ mode: \"asOf\", asOf: \"2024-01-01T00:00:00.000Z\" })\n * // → deleted_at IS NULL AND (valid_from IS NULL OR valid_from <= '2024-01-01...') AND ...\n * ```\n */\nexport function compileTemporalFilter(options: TemporalFilterOptions): SQL {\n  const { mode, asOf, tableAlias, currentTimestamp } = options;\n\n  // Build column references with optional prefix\n  const prefix = tableAlias ? sql.raw(`${tableAlias}.`) : sql.raw(\"\");\n  const deletedAt = sql`${prefix}deleted_at`;\n  const validFrom = sql`${prefix}valid_from`;\n  const validTo = sql`${prefix}valid_to`;\n\n  switch (mode) {\n    case \"current\": {\n      const now = currentTimestamp ?? sql`CURRENT_TIMESTAMP`;\n      return sql`${deletedAt} IS NULL AND (${validFrom} IS NULL OR ${validFrom} <= ${now}) AND (${validTo} IS NULL OR ${validTo} > ${now})`;\n    }\n\n    case \"asOf\": {\n      if (asOf === undefined) {\n        throw new Error(`asOf timestamp is required for temporal mode \"asOf\"`);\n      }\n      const timestamp = asOf;\n      return sql`${deletedAt} IS NULL AND (${validFrom} IS NULL OR ${validFrom} <= ${timestamp}) AND (${validTo} IS NULL OR ${validTo} > ${timestamp})`;\n    }\n\n    case \"includeEnded\": {\n      // Include records that have ended but not been deleted\n      return sql`${deletedAt} IS NULL`;\n    }\n\n    case \"includeTombstones\": {\n      // Include everything, no filter\n      return sql.raw(\"1=1\");\n    }\n  }\n}\n\n/**\n * Extracts temporal options from a query AST.\n *\n * @param ast - Query AST with temporalMode\n * @param tableAlias - Optional table alias for column references\n * @returns TemporalFilterOptions for use with compileTemporalFilter\n */\nexport function extractTemporalOptions(\n  ast: { temporalMode: { mode: TemporalMode; asOf?: string } },\n  tableAlias?: string,\n): TemporalFilterOptions {\n  return {\n    mode: ast.temporalMode.mode,\n    asOf: ast.temporalMode.asOf,\n    tableAlias,\n  };\n}\n","import { type SQL } from \"drizzle-orm\";\n\nimport type { QueryAst } from \"../../ast\";\nimport { compileTemporalFilter, extractTemporalOptions } from \"../temporal\";\n\nexport type TemporalFilterPass = Readonly<{\n  forAlias: (tableAlias?: string) => SQL;\n}>;\n\n/**\n * Creates a temporal filter pass bound to a query AST and timestamp source.\n *\n * Invariant:\n * - All temporal clauses for a query use the same timestamp expression.\n */\nexport function createTemporalFilterPass(\n  ast: QueryAst,\n  currentTimestamp: SQL,\n): TemporalFilterPass {\n  return {\n    forAlias(tableAlias?: string): SQL {\n      return compileTemporalFilter({\n        ...extractTemporalOptions(ast, tableAlias),\n        currentTimestamp,\n      });\n    },\n  };\n}\n","import { type VectorMetric } from \"../../../backend/types\";\nimport { UnsupportedPredicateError } from \"../../../errors\";\nimport type { QueryAst, VectorSimilarityPredicate } from \"../../ast\";\nimport type { DialectAdapter } from \"../../dialect\";\nimport { type VectorStrategy } from \"../../dialect/vector-strategy\";\nimport { extractVectorSimilarityPredicates } from \"../predicates\";\n\nexport type VectorPredicatePassResult = Readonly<{\n  vectorPredicate: VectorSimilarityPredicate | undefined;\n}>;\n\n/**\n * Validates vector predicate placement, cardinality, and metric support.\n *\n * Invariants:\n * - Vector predicates must not appear under OR/NOT branches.\n * - At most one vector predicate is allowed per query.\n * - The requested metric must be supported by the active vector strategy.\n *\n * `vectorStrategy` is the backend-declared strategy that will generate the\n * relevance SQL (passed by the standard compile path). When present it is the\n * authoritative source for supported metrics — a custom strategy override may\n * advertise a different metric set than the dialect's built-in default. It is\n * omitted only by the plan-lowering path (recursive / set-operation queries),\n * which has no strategy plumbed and falls back to the dialect's metric list.\n */\nexport function runVectorPredicatePass(\n  ast: QueryAst,\n  dialect: DialectAdapter,\n  vectorStrategy?: VectorStrategy,\n): VectorPredicatePassResult {\n  const vectorPredicates = extractVectorSimilarityPredicates(ast.predicates);\n  if (vectorPredicates.length > 1) {\n    throw new UnsupportedPredicateError(\n      \"Multiple vector similarity predicates in a single query are not supported\",\n    );\n  }\n\n  const vectorPredicate = vectorPredicates[0];\n  if (vectorPredicate === undefined) {\n    return { vectorPredicate: undefined };\n  }\n\n  const predicateStrategy = dialect.capabilities.vectorPredicateStrategy;\n  if (predicateStrategy === \"unsupported\" || !dialect.supportsVectors) {\n    throw new UnsupportedPredicateError(\n      `Vector similarity predicates are not supported for dialect \"${dialect.name}\"`,\n    );\n  }\n\n  // Only an EXPLICIT metric is validated here. When omitted, the compiler\n  // resolves the field's declared `embedding()` metric per kind (validated\n  // when the field's index was materialized), so there is nothing to check yet.\n  if (vectorPredicate.metric !== undefined) {\n    const supportedMetrics: readonly VectorMetric[] =\n      vectorStrategy?.capabilities.metrics ??\n      dialect.capabilities.vectorMetrics;\n    if (!supportedMetrics.includes(vectorPredicate.metric)) {\n      throw new UnsupportedPredicateError(\n        vectorStrategy === undefined ?\n          `Vector metric \"${vectorPredicate.metric}\" is not supported for dialect \"${dialect.name}\"`\n        : `Vector metric \"${vectorPredicate.metric}\" is not supported by vector strategy \"${vectorStrategy.name}\" (supported: ${supportedMetrics.join(\", \")})`,\n      );\n    }\n  }\n\n  if (!Number.isFinite(vectorPredicate.limit) || vectorPredicate.limit <= 0) {\n    throw new UnsupportedPredicateError(\n      `Vector predicate limit must be a positive finite number, got ${String(vectorPredicate.limit)}`,\n    );\n  }\n\n  const { minScore } = vectorPredicate;\n  if (minScore !== undefined) {\n    if (!Number.isFinite(minScore)) {\n      throw new UnsupportedPredicateError(\n        `Vector minScore must be a finite number, got ${String(minScore)}`,\n      );\n    }\n    if (vectorPredicate.metric === \"cosine\" && Math.abs(minScore) > 1) {\n      throw new UnsupportedPredicateError(\n        `Cosine minScore must be between -1 and 1, got ${String(minScore)}`,\n      );\n    }\n  }\n\n  return { vectorPredicate };\n}\n\n/**\n * Resolves the query LIMIT in the presence of vector similarity.\n *\n * If a vector predicate is present and AST limit is omitted, use the\n * predicate's built-in limit to bound nearest-neighbor search.\n */\nexport function resolveVectorAwareLimit(\n  astLimit?: number,\n  vectorPredicate?: VectorSimilarityPredicate,\n): number | undefined {\n  if (vectorPredicate === undefined) {\n    return astLimit;\n  }\n  if (astLimit === undefined) {\n    return vectorPredicate.limit;\n  }\n  return Math.min(astLimit, vectorPredicate.limit);\n}\n","import { CompilerInvariantError } from \"../../../errors\";\nimport type {\n  AggregateExpr,\n  ComposableQuery,\n  FulltextMatchPredicate,\n  NodePredicate,\n  QueryAst,\n  SetOperation,\n  VectorSimilarityPredicate,\n} from \"../../ast\";\nimport {\n  getDialect,\n  type SqlDialect,\n  type VectorStrategy,\n} from \"../../dialect\";\nimport {\n  resolveFulltextAwareLimit,\n  resolveVectorAwareLimit,\n  runFulltextPredicatePass,\n  runRecursiveTraversalSelectionPass,\n  runVectorPredicatePass,\n  type VariableLengthTraversal,\n} from \"../passes\";\nimport type {\n  AggregatePlanNode,\n  LimitOffsetPlanNode,\n  LogicalPlan,\n  LogicalPlanNode,\n  ProjectPlanNode,\n} from \"./types\";\n\nexport type LowerStandardQueryToLogicalPlanInput = Readonly<{\n  ast: QueryAst;\n  collapsedTraversalCteAlias?: string;\n  dialect: SqlDialect;\n  effectiveLimit?: number;\n  fulltextPredicate?: FulltextMatchPredicate;\n  graphId: string;\n  vectorPredicate?: VectorSimilarityPredicate;\n}>;\n\nexport type LowerRecursiveQueryToLogicalPlanInput = Readonly<{\n  ast: QueryAst;\n  dialect: SqlDialect;\n  graphId: string;\n  traversal?: VariableLengthTraversal;\n}>;\n\nexport type LowerSetOperationToLogicalPlanInput = Readonly<{\n  dialect: SqlDialect;\n  graphId: string;\n  op: SetOperation;\n  /**\n   * The backend-configured vector strategy, threaded so a set-operation leaf's\n   * vector predicate validates against the same metric set as standalone leaf\n   * compilation (rather than only the dialect's fallback metric list).\n   */\n  vectorStrategy?: VectorStrategy;\n}>;\n\n/**\n * Creates a sequential plan node ID generator scoped to a single compilation invocation.\n * IDs are NOT stable across compilations — different compilations of the same query\n * may produce different IDs depending on pass execution order.\n */\nfunction createPlanNodeIdFactory(): () => string {\n  let current = 0;\n  return function nextPlanNodeId(): string {\n    current += 1;\n    return `plan_${current.toString(36)}`;\n  };\n}\n\nfunction extractAggregateExpressions(ast: QueryAst): readonly AggregateExpr[] {\n  const aggregates: AggregateExpr[] = [];\n\n  for (const field of ast.projection.fields) {\n    if (\"__type\" in field.source && field.source.__type === \"aggregate\") {\n      aggregates.push(field.source);\n    }\n  }\n\n  return aggregates;\n}\n\nfunction getAliasPredicates(\n  ast: QueryAst,\n  alias: string,\n  predicateTargetType: \"edge\" | \"node\",\n): readonly NodePredicate[] {\n  return ast.predicates.filter((predicate) => {\n    const targetType = predicate.targetType ?? \"node\";\n    return (\n      predicate.targetAlias === alias && targetType === predicateTargetType\n    );\n  });\n}\n\nfunction wrapWithAliasFilterNode(\n  currentNode: LogicalPlanNode,\n  ast: QueryAst,\n  alias: string,\n  predicateTargetType: \"edge\" | \"node\",\n  nextPlanNodeId: () => string,\n): LogicalPlanNode {\n  const aliasPredicates = getAliasPredicates(ast, alias, predicateTargetType);\n  if (aliasPredicates.length === 0) {\n    return currentNode;\n  }\n\n  return {\n    alias,\n    id: nextPlanNodeId(),\n    input: currentNode,\n    op: \"filter\",\n    predicateTargetType,\n    predicates: aliasPredicates.map((predicate) => predicate.expression),\n  };\n}\n\nfunction appendAggregateSortLimitAndProjectNodes(\n  currentNode: LogicalPlanNode,\n  ast: QueryAst,\n  nextPlanNodeId: () => string,\n  limit: number | undefined,\n  collapsedTraversalCteAlias?: string,\n): LogicalPlanNode {\n  let node = currentNode;\n\n  const aggregateExpressions = extractAggregateExpressions(ast);\n  if (\n    aggregateExpressions.length > 0 ||\n    ast.groupBy !== undefined ||\n    ast.having !== undefined\n  ) {\n    const aggregateNode: AggregatePlanNode = {\n      aggregates: aggregateExpressions,\n      groupBy: ast.groupBy?.fields ?? [],\n      id: nextPlanNodeId(),\n      input: node,\n      op: \"aggregate\",\n    };\n    node =\n      ast.having === undefined ?\n        aggregateNode\n      : { ...aggregateNode, having: ast.having };\n  }\n\n  if (ast.orderBy !== undefined && ast.orderBy.length > 0) {\n    node = {\n      id: nextPlanNodeId(),\n      input: node,\n      op: \"sort\",\n      orderBy: ast.orderBy,\n    };\n  }\n\n  if (limit !== undefined || ast.offset !== undefined) {\n    const limitOffsetNodeBase: Omit<LimitOffsetPlanNode, \"limit\" | \"offset\"> = {\n      id: nextPlanNodeId(),\n      input: node,\n      op: \"limit_offset\",\n    };\n    const hasLimit = limit !== undefined;\n    const hasOffset = ast.offset !== undefined;\n\n    if (hasLimit && hasOffset) {\n      node = {\n        ...limitOffsetNodeBase,\n        limit,\n        offset: ast.offset,\n      };\n    } else if (hasLimit) {\n      node = { ...limitOffsetNodeBase, limit };\n    } else if (hasOffset) {\n      node = { ...limitOffsetNodeBase, offset: ast.offset };\n    } else {\n      throw new CompilerInvariantError(\n        \"limit_offset node requires limit or offset to be present\",\n      );\n    }\n  }\n\n  const projectNodeBase: Omit<ProjectPlanNode, \"collapsedTraversalAlias\"> = {\n    fields: ast.projection.fields,\n    id: nextPlanNodeId(),\n    input: node,\n    op: \"project\",\n  };\n  return collapsedTraversalCteAlias === undefined ? projectNodeBase : (\n      {\n        ...projectNodeBase,\n        collapsedTraversalAlias: collapsedTraversalCteAlias,\n      }\n    );\n}\n\ntype LowerStandardQueryToLogicalPlanNodeInput =\n  LowerStandardQueryToLogicalPlanInput &\n    Readonly<{\n      nextPlanNodeId: () => string;\n    }>;\n\nfunction lowerStandardQueryToLogicalPlanNode(\n  input: LowerStandardQueryToLogicalPlanNodeInput,\n): LogicalPlanNode {\n  const { ast, nextPlanNodeId } = input;\n\n  let currentNode: LogicalPlanNode = {\n    alias: ast.start.alias,\n    graphId: input.graphId,\n    id: nextPlanNodeId(),\n    kinds: ast.start.kinds,\n    op: \"scan\",\n    source: \"nodes\",\n  };\n\n  currentNode = wrapWithAliasFilterNode(\n    currentNode,\n    ast,\n    ast.start.alias,\n    \"node\",\n    nextPlanNodeId,\n  );\n\n  for (const traversal of ast.traversals) {\n    currentNode = {\n      direction: traversal.direction,\n      edgeAlias: traversal.edgeAlias,\n      edgeKinds: traversal.edgeKinds,\n      id: nextPlanNodeId(),\n      input: currentNode,\n      inverseEdgeKinds: traversal.inverseEdgeKinds ?? [],\n      joinFromAlias: traversal.joinFromAlias,\n      joinType: traversal.optional ? \"left\" : \"inner\",\n      nodeAlias: traversal.nodeAlias,\n      nodeKinds: traversal.nodeKinds,\n      op: \"join\",\n    };\n\n    currentNode = wrapWithAliasFilterNode(\n      currentNode,\n      ast,\n      traversal.edgeAlias,\n      \"edge\",\n      nextPlanNodeId,\n    );\n    currentNode = wrapWithAliasFilterNode(\n      currentNode,\n      ast,\n      traversal.nodeAlias,\n      \"node\",\n      nextPlanNodeId,\n    );\n  }\n\n  if (input.vectorPredicate !== undefined) {\n    currentNode = {\n      id: nextPlanNodeId(),\n      input: currentNode,\n      op: \"vector_knn\",\n      predicate: input.vectorPredicate,\n    };\n  }\n\n  if (input.fulltextPredicate !== undefined) {\n    currentNode = {\n      id: nextPlanNodeId(),\n      input: currentNode,\n      op: \"fulltext_match\",\n      predicate: input.fulltextPredicate,\n    };\n  }\n\n  return appendAggregateSortLimitAndProjectNodes(\n    currentNode,\n    ast,\n    nextPlanNodeId,\n    input.effectiveLimit,\n    input.collapsedTraversalCteAlias,\n  );\n}\n\ntype LowerRecursiveQueryToLogicalPlanNodeInput =\n  LowerRecursiveQueryToLogicalPlanInput &\n    Readonly<{\n      nextPlanNodeId: () => string;\n    }>;\n\nfunction lowerRecursiveQueryToLogicalPlanNode(\n  input: LowerRecursiveQueryToLogicalPlanNodeInput,\n): LogicalPlanNode {\n  const { ast, nextPlanNodeId } = input;\n  const traversal =\n    input.traversal ?? runRecursiveTraversalSelectionPass(input.ast);\n\n  let currentNode: LogicalPlanNode = {\n    alias: ast.start.alias,\n    graphId: input.graphId,\n    id: nextPlanNodeId(),\n    kinds: ast.start.kinds,\n    op: \"scan\",\n    source: \"nodes\",\n  };\n\n  currentNode = wrapWithAliasFilterNode(\n    currentNode,\n    ast,\n    ast.start.alias,\n    \"node\",\n    nextPlanNodeId,\n  );\n\n  currentNode = {\n    edgeAlias: traversal.edgeAlias,\n    edgeKinds: traversal.edgeKinds,\n    id: nextPlanNodeId(),\n    input: currentNode,\n    inverseEdgeKinds: traversal.inverseEdgeKinds ?? [],\n    nodeAlias: traversal.nodeAlias,\n    nodeKinds: traversal.nodeKinds,\n    op: \"recursive_expand\",\n    traversal: traversal.variableLength,\n  };\n\n  currentNode = wrapWithAliasFilterNode(\n    currentNode,\n    ast,\n    traversal.edgeAlias,\n    \"edge\",\n    nextPlanNodeId,\n  );\n  currentNode = wrapWithAliasFilterNode(\n    currentNode,\n    ast,\n    traversal.nodeAlias,\n    \"node\",\n    nextPlanNodeId,\n  );\n\n  return appendAggregateSortLimitAndProjectNodes(\n    currentNode,\n    ast,\n    nextPlanNodeId,\n    ast.limit,\n  );\n}\n\nfunction lowerComposableQueryToLogicalPlanNode(\n  query: ComposableQuery,\n  dialect: SqlDialect,\n  graphId: string,\n  nextPlanNodeId: () => string,\n  vectorStrategy: VectorStrategy | undefined,\n): LogicalPlanNode {\n  if (\"__type\" in query) {\n    return lowerSetOperationToLogicalPlanNode(\n      query,\n      graphId,\n      dialect,\n      nextPlanNodeId,\n      vectorStrategy,\n    );\n  }\n\n  const hasVariableLengthTraversal = query.traversals.some(\n    (traversal) => traversal.variableLength !== undefined,\n  );\n  if (hasVariableLengthTraversal) {\n    return lowerRecursiveQueryToLogicalPlanNode({\n      ast: query,\n      dialect,\n      graphId,\n      nextPlanNodeId,\n    });\n  }\n\n  const dialectAdapter = getDialect(dialect);\n  const vectorPredicate = runVectorPredicatePass(\n    query,\n    dialectAdapter,\n    vectorStrategy,\n  ).vectorPredicate;\n  const fulltextPredicate = runFulltextPredicatePass(\n    query,\n    dialectAdapter,\n  ).fulltextPredicate;\n  const limitAfterVector = resolveVectorAwareLimit(\n    query.limit,\n    vectorPredicate,\n  );\n  const effectiveLimit = resolveFulltextAwareLimit(\n    limitAfterVector,\n    fulltextPredicate,\n  );\n  const loweringInput = {\n    ast: query,\n    dialect,\n    graphId,\n    nextPlanNodeId,\n    ...(effectiveLimit === undefined ? {} : { effectiveLimit }),\n    ...(vectorPredicate === undefined ? {} : { vectorPredicate }),\n    ...(fulltextPredicate === undefined ? {} : { fulltextPredicate }),\n  };\n  return lowerStandardQueryToLogicalPlanNode(loweringInput);\n}\n\nfunction lowerSetOperationToLogicalPlanNode(\n  op: SetOperation,\n  graphId: string,\n  dialect: SqlDialect,\n  nextPlanNodeId: () => string,\n  vectorStrategy: VectorStrategy | undefined,\n): LogicalPlanNode {\n  let currentNode: LogicalPlanNode = {\n    id: nextPlanNodeId(),\n    left: lowerComposableQueryToLogicalPlanNode(\n      op.left,\n      dialect,\n      graphId,\n      nextPlanNodeId,\n      vectorStrategy,\n    ),\n    op: \"set_op\",\n    operator: op.operator,\n    right: lowerComposableQueryToLogicalPlanNode(\n      op.right,\n      dialect,\n      graphId,\n      nextPlanNodeId,\n      vectorStrategy,\n    ),\n  };\n\n  if (op.orderBy !== undefined && op.orderBy.length > 0) {\n    currentNode = {\n      id: nextPlanNodeId(),\n      input: currentNode,\n      op: \"sort\",\n      orderBy: op.orderBy,\n    };\n  }\n\n  if (op.limit !== undefined || op.offset !== undefined) {\n    const limitOffsetBase = {\n      id: nextPlanNodeId(),\n      input: currentNode,\n      op: \"limit_offset\" as const,\n    };\n    if (op.limit !== undefined && op.offset !== undefined) {\n      currentNode = { ...limitOffsetBase, limit: op.limit, offset: op.offset };\n    } else if (op.limit === undefined) {\n      currentNode = { ...limitOffsetBase, offset: op.offset! };\n    } else {\n      currentNode = { ...limitOffsetBase, limit: op.limit };\n    }\n  }\n\n  return currentNode;\n}\n\nexport function lowerStandardQueryToLogicalPlan(\n  input: LowerStandardQueryToLogicalPlanInput,\n): LogicalPlan {\n  const nextPlanNodeId = createPlanNodeIdFactory();\n  return {\n    metadata: {\n      dialect: input.dialect,\n      graphId: input.graphId,\n    },\n    root: lowerStandardQueryToLogicalPlanNode({\n      ...input,\n      nextPlanNodeId,\n    }),\n  };\n}\n\nexport function lowerRecursiveQueryToLogicalPlan(\n  input: LowerRecursiveQueryToLogicalPlanInput,\n): LogicalPlan {\n  const nextPlanNodeId = createPlanNodeIdFactory();\n  return {\n    metadata: {\n      dialect: input.dialect,\n      graphId: input.graphId,\n    },\n    root: lowerRecursiveQueryToLogicalPlanNode({\n      ...input,\n      nextPlanNodeId,\n    }),\n  };\n}\n\nexport function lowerSetOperationToLogicalPlan(\n  input: LowerSetOperationToLogicalPlanInput,\n): LogicalPlan {\n  const nextPlanNodeId = createPlanNodeIdFactory();\n  return {\n    metadata: {\n      dialect: input.dialect,\n      graphId: input.graphId,\n    },\n    root: lowerSetOperationToLogicalPlanNode(\n      input.op,\n      input.graphId,\n      input.dialect,\n      nextPlanNodeId,\n      input.vectorStrategy,\n    ),\n  };\n}\n","/**\n * Recursive CTE Compilation\n *\n * Compiles variable-length path traversals using WITH RECURSIVE.\n * Handles cycle detection and depth limiting using dialect-specific operations.\n */\nimport { type SQL, sql } from \"drizzle-orm\";\n\nimport {\n  CompilerInvariantError,\n  UnsupportedPredicateError,\n} from \"../../errors\";\nimport { type QueryAst, type SelectiveField } from \"../ast\";\nimport {\n  type DialectAdapter,\n  type DialectRecursiveQueryStrategy,\n} from \"../dialect\";\nimport { jsonPointer } from \"../json-pointer\";\nimport { emitRecursiveQuerySql } from \"./emitter\";\nimport {\n  createTemporalFilterPass,\n  runCompilerPass,\n  runRecursiveTraversalSelectionPass,\n  type TemporalFilterPass,\n  type VariableLengthTraversal,\n} from \"./passes\";\nimport { type LogicalPlan, lowerRecursiveQueryToLogicalPlan } from \"./plan\";\nimport { compileKindFilter as sharedCompileKindFilter } from \"./predicate-utils\";\nimport {\n  compileFieldValue,\n  compilePredicateExpression,\n  type PredicateCompilerContext,\n} from \"./predicates\";\nimport { compileTypedJsonExtract } from \"./typed-json-extract\";\nimport {\n  addRequiredColumn,\n  EMPTY_REQUIRED_COLUMNS,\n  mapSelectiveSystemFieldToColumn,\n  markFieldRefAsRequired,\n  markSelectiveFieldAsRequired,\n  NODE_COLUMNS,\n  quoteIdentifier,\n  type RequiredColumnsByAlias,\n  shouldProjectColumn,\n} from \"./utils\";\n\n// ============================================================\n// Constants\n// ============================================================\n\n/**\n * Maximum depth for recursive CTE queries when maxDepth is unlimited (-1).\n *\n * Graphs with branching factor B produce O(B^depth) rows before cycle\n * detection can prune them. A default of 10 covers typical neighborhood,\n * shortest-path, and hierarchy use-cases without risking exponential blowup\n * on dense graphs. Users who need deeper traversals should call .maxHops(N)\n * explicitly (up to MAX_EXPLICIT_RECURSIVE_DEPTH).\n */\nexport const MAX_RECURSIVE_DEPTH = 10;\n\n/**\n * Maximum depth for explicit maxDepth traversals.\n *\n * Explicit traversal bounds are opt-in and safe to allow at a higher ceiling\n * for stress testing and long-path workloads.\n */\nexport const MAX_EXPLICIT_RECURSIVE_DEPTH = 1000;\n\nconst NO_ALWAYS_REQUIRED_COLUMNS = new Set<string>();\n\ntype RecursiveQueryPassState = Readonly<{\n  ast: QueryAst;\n  ctx: PredicateCompilerContext;\n  graphId: string;\n  logicalPlan: LogicalPlan | undefined;\n  requiredColumnsByAlias: RequiredColumnsByAlias | undefined;\n  temporalFilterPass: TemporalFilterPass | undefined;\n  traversal: VariableLengthTraversal | undefined;\n}>;\n\nfunction runRecursiveQueryPassPipeline(\n  ast: QueryAst,\n  graphId: string,\n  ctx: PredicateCompilerContext,\n): RecursiveQueryPassState {\n  let state: RecursiveQueryPassState = {\n    ast,\n    ctx,\n    graphId,\n    logicalPlan: undefined,\n    requiredColumnsByAlias: undefined,\n    temporalFilterPass: undefined,\n    traversal: undefined,\n  };\n\n  const recursiveTraversalPass = runCompilerPass(state, {\n    name: \"recursive_traversal\",\n    execute(currentState): VariableLengthTraversal {\n      return runRecursiveTraversalSelectionPass(currentState.ast);\n    },\n    update(currentState, traversal): RecursiveQueryPassState {\n      return {\n        ...currentState,\n        traversal,\n      };\n    },\n  });\n  state = recursiveTraversalPass.state;\n\n  const temporalPass = runCompilerPass(state, {\n    name: \"temporal_filters\",\n    execute(currentState): TemporalFilterPass {\n      return createTemporalFilterPass(\n        currentState.ast,\n        currentState.ctx.dialect.currentTimestamp(),\n      );\n    },\n    update(currentState, temporalFilterPass): RecursiveQueryPassState {\n      return {\n        ...currentState,\n        temporalFilterPass,\n      };\n    },\n  });\n  state = temporalPass.state;\n\n  const columnPruningPass = runCompilerPass(state, {\n    name: \"column_pruning\",\n    execute(currentState): RequiredColumnsByAlias | undefined {\n      const traversal = currentState.traversal;\n      if (traversal === undefined) {\n        throw new CompilerInvariantError(\n          \"Recursive traversal pass did not select traversal\",\n        );\n      }\n      return collectRequiredColumnsByAlias(currentState.ast, traversal);\n    },\n    update(currentState, requiredColumnsByAlias): RecursiveQueryPassState {\n      return {\n        ...currentState,\n        requiredColumnsByAlias,\n      };\n    },\n  });\n  state = columnPruningPass.state;\n\n  const logicalPlanPass = runCompilerPass(state, {\n    name: \"logical_plan\",\n    execute(currentState): LogicalPlan {\n      const loweringInput = {\n        ast: currentState.ast,\n        dialect: currentState.ctx.dialect.name,\n        graphId: currentState.graphId,\n        ...(currentState.traversal === undefined ?\n          {}\n        : { traversal: currentState.traversal }),\n      };\n      return lowerRecursiveQueryToLogicalPlan(loweringInput);\n    },\n    update(currentState, logicalPlan): RecursiveQueryPassState {\n      return {\n        ...currentState,\n        logicalPlan,\n      };\n    },\n  });\n  state = logicalPlanPass.state;\n\n  return state;\n}\n\n// ============================================================\n// Main Compiler\n// ============================================================\n\n/**\n * Compiles a variable-length query using recursive CTEs.\n *\n * @param ast - The query AST\n * @param graphId - The graph ID\n * @param ctx - Predicate compiler context\n * @returns SQL for the recursive query\n */\nexport function compileVariableLengthQuery(\n  ast: QueryAst,\n  graphId: string,\n  ctx: PredicateCompilerContext,\n): SQL {\n  const strategy = ctx.dialect.capabilities.recursiveQueryStrategy;\n  const handler = RECURSIVE_QUERY_STRATEGY_HANDLERS[strategy];\n  return handler(ast, graphId, ctx);\n}\n\ntype RecursiveQueryStrategyHandler = (\n  ast: QueryAst,\n  graphId: string,\n  ctx: PredicateCompilerContext,\n) => SQL;\n\nconst RECURSIVE_QUERY_STRATEGY_HANDLERS: Record<\n  DialectRecursiveQueryStrategy,\n  RecursiveQueryStrategyHandler\n> = {\n  recursive_cte: compileVariableLengthQueryWithRecursiveCteStrategy,\n};\n\nfunction compileVariableLengthQueryWithRecursiveCteStrategy(\n  ast: QueryAst,\n  graphId: string,\n  ctx: PredicateCompilerContext,\n): SQL {\n  const passState = runRecursiveQueryPassPipeline(ast, graphId, ctx);\n\n  const { dialect } = ctx;\n  const {\n    logicalPlan,\n    requiredColumnsByAlias,\n    temporalFilterPass,\n    traversal: vlTraversal,\n  } = passState;\n\n  if (temporalFilterPass === undefined) {\n    throw new CompilerInvariantError(\n      \"Temporal filter pass did not initialize temporal state\",\n    );\n  }\n  if (logicalPlan === undefined) {\n    throw new CompilerInvariantError(\n      \"Logical plan pass did not initialize plan state\",\n    );\n  }\n  if (vlTraversal === undefined) {\n    throw new CompilerInvariantError(\n      \"Recursive traversal pass did not select traversal\",\n    );\n  }\n\n  // Build the recursive CTE\n  const recursiveCte = compileRecursiveCte(\n    ast,\n    vlTraversal,\n    graphId,\n    ctx,\n    requiredColumnsByAlias,\n    temporalFilterPass,\n  );\n\n  // Build projection\n  const projection = compileRecursiveProjection(ast, vlTraversal, dialect);\n\n  // Build final SELECT\n  const minDepth = vlTraversal.variableLength.minDepth;\n  const depthFilter =\n    minDepth > 0 ? sql`WHERE depth >= ${minDepth}` : sql.raw(\"\");\n\n  // Order by and limit/offset\n  const orderBy = compileRecursiveOrderBy(ast, dialect);\n  const limitOffset = compileLimitOffset(ast);\n\n  return emitRecursiveQuerySql({\n    depthFilter,\n    ...(limitOffset === undefined ? {} : { limitOffset }),\n    logicalPlan,\n    ...(orderBy === undefined ? {} : { orderBy }),\n    projection,\n    recursiveCte,\n  });\n}\n\n/**\n * Checks if a query contains variable-length traversals.\n */\nexport function hasVariableLengthTraversal(ast: QueryAst): boolean {\n  return ast.traversals.some((t) => t.variableLength !== undefined);\n}\n\n// ============================================================\n// Recursive CTE Generation\n// ============================================================\n\n/**\n * Compiles the recursive CTE for variable-length traversal.\n */\nfunction compileRecursiveCte(\n  ast: QueryAst,\n  traversal: VariableLengthTraversal,\n  graphId: string,\n  ctx: PredicateCompilerContext,\n  requiredColumnsByAlias: RequiredColumnsByAlias | undefined,\n  temporalFilterPass: TemporalFilterPass,\n): SQL {\n  const { dialect } = ctx;\n  const startAlias = ast.start.alias;\n  const startKinds = ast.start.kinds;\n  const nodeAlias = traversal.nodeAlias;\n  const directEdgeKinds = [...new Set(traversal.edgeKinds)];\n  const inverseEdgeKinds =\n    traversal.inverseEdgeKinds === undefined ?\n      []\n    : [...new Set(traversal.inverseEdgeKinds)];\n  const forceWorktableOuterJoinOrder =\n    dialect.capabilities.forceRecursiveWorktableOuterJoinOrder;\n  const nodeKinds = traversal.nodeKinds;\n  const previousNodeKinds = [...new Set([...startKinds, ...nodeKinds])];\n  const direction = traversal.direction;\n  const vl = traversal.variableLength;\n  const shouldEnforceCycleCheck = vl.cyclePolicy !== \"allow\";\n  const shouldTrackPath = shouldEnforceCycleCheck || vl.pathAlias !== undefined;\n  const recursiveJoinRequiredColumns = new Set<string>([\"id\"]);\n  if (previousNodeKinds.length > 1) {\n    recursiveJoinRequiredColumns.add(\"kind\");\n  }\n  const requiredStartColumns =\n    requiredColumnsByAlias ?\n      (requiredColumnsByAlias.get(startAlias) ?? EMPTY_REQUIRED_COLUMNS)\n    : undefined;\n  const requiredNodeColumns =\n    requiredColumnsByAlias ?\n      (requiredColumnsByAlias.get(nodeAlias) ?? EMPTY_REQUIRED_COLUMNS)\n    : undefined;\n  const startColumnsFromBase = compileNodeSelectColumnsFromTable(\n    \"n0\",\n    startAlias,\n    requiredStartColumns,\n    NO_ALWAYS_REQUIRED_COLUMNS,\n  );\n  const startColumnsFromRecursive = compileNodeSelectColumnsFromRecursiveRow(\n    startAlias,\n    requiredStartColumns,\n    NO_ALWAYS_REQUIRED_COLUMNS,\n  );\n  const nodeColumnsFromBase = compileNodeSelectColumnsFromTable(\n    \"n0\",\n    nodeAlias,\n    requiredNodeColumns,\n    recursiveJoinRequiredColumns,\n  );\n  const nodeColumnsFromRecursive = compileNodeSelectColumnsFromTable(\n    \"n\",\n    nodeAlias,\n    requiredNodeColumns,\n    recursiveJoinRequiredColumns,\n  );\n\n  const startKindFilter = compileKindFilter(startKinds, \"n0.kind\");\n  const nodeKindFilter = compileKindFilter(nodeKinds, \"n.kind\");\n\n  const startTemporalFilter = temporalFilterPass.forAlias(\"n0\");\n  const edgeTemporalFilter = temporalFilterPass.forAlias(\"e\");\n  const nodeTemporalFilter = temporalFilterPass.forAlias(\"n\");\n\n  // Start predicates (with cteColumnPrefix \"\" for raw n0 columns)\n  const startContext = { ...ctx, cteColumnPrefix: \"\" };\n  const startPredicates = compileNodePredicates(ast, startAlias, startContext);\n\n  // Edge predicates (with cteColumnPrefix \"e\" for e.props)\n  const edgeContext = { ...ctx, cteColumnPrefix: \"e\" };\n  const edgePredicates = compileEdgePredicates(\n    ast,\n    traversal.edgeAlias,\n    edgeContext,\n  );\n\n  // Target node predicates (with cteColumnPrefix \"n\" for n.props)\n  const targetContext = { ...ctx, cteColumnPrefix: \"n\" };\n  const targetNodePredicates = compileNodePredicates(\n    ast,\n    nodeAlias,\n    targetContext,\n  );\n\n  // Max depth condition:\n  // - unlimited traversals are capped at MAX_RECURSIVE_DEPTH\n  // - explicit maxDepth traversals must not exceed MAX_EXPLICIT_RECURSIVE_DEPTH\n  if (vl.maxDepth > MAX_EXPLICIT_RECURSIVE_DEPTH) {\n    throw new UnsupportedPredicateError(\n      `Recursive traversal maxHops(${vl.maxDepth}) exceeds maximum explicit depth of ${MAX_EXPLICIT_RECURSIVE_DEPTH}`,\n    );\n  }\n  const effectiveMaxDepth = vl.maxDepth > 0 ? vl.maxDepth : MAX_RECURSIVE_DEPTH;\n  const maxDepthCondition = sql`r.depth < ${effectiveMaxDepth}`;\n\n  const cycleCheck =\n    shouldEnforceCycleCheck ?\n      dialect.cycleCheck(sql.raw(\"n.id\"), sql.raw(\"r.path\"))\n    : undefined;\n  const initialPath =\n    shouldTrackPath ? dialect.initializePath(sql.raw(\"n0.id\")) : undefined;\n  const pathExtension =\n    shouldTrackPath ?\n      dialect.extendPath(sql.raw(\"r.path\"), sql.raw(\"n.id\"))\n    : undefined;\n\n  // Base case WHERE clauses\n  const baseWhereClauses = [\n    sql`n0.graph_id = ${graphId}`,\n    startKindFilter,\n    startTemporalFilter,\n    ...startPredicates,\n  ];\n\n  const recursiveBaseWhereClauses: SQL[] = [\n    sql`e.graph_id = ${graphId}`,\n    nodeKindFilter,\n    edgeTemporalFilter,\n    nodeTemporalFilter,\n    maxDepthCondition,\n  ];\n  if (cycleCheck !== undefined) {\n    recursiveBaseWhereClauses.push(cycleCheck);\n  }\n  recursiveBaseWhereClauses.push(...edgePredicates, ...targetNodePredicates);\n\n  function compileRecursiveBranch(\n    branch: Readonly<{\n      joinField: \"from_id\" | \"to_id\";\n      targetField: \"from_id\" | \"to_id\";\n      joinKindField: \"from_kind\" | \"to_kind\";\n      targetKindField: \"from_kind\" | \"to_kind\";\n      edgeKinds: readonly string[];\n      duplicateGuard?: SQL | undefined;\n    }>,\n  ): SQL {\n    const recursiveFilterClauses = [\n      ...recursiveBaseWhereClauses,\n      compileKindFilter(branch.edgeKinds, \"e.kind\"),\n      compileKindFilter(previousNodeKinds, `e.${branch.joinKindField}`),\n      compileKindFilter(nodeKinds, `e.${branch.targetKindField}`),\n    ];\n\n    if (branch.duplicateGuard !== undefined) {\n      recursiveFilterClauses.push(branch.duplicateGuard);\n    }\n\n    const recursiveSelectColumns = [\n      ...startColumnsFromRecursive,\n      ...nodeColumnsFromRecursive,\n      sql`r.depth + 1 AS depth`,\n    ];\n    if (pathExtension !== undefined) {\n      recursiveSelectColumns.push(sql`${pathExtension} AS path`);\n    }\n    const recursiveJoinClauses: SQL[] = [\n      sql`e.${sql.raw(branch.joinField)} = r.${sql.raw(nodeAlias)}_id`,\n    ];\n    if (previousNodeKinds.length > 1) {\n      recursiveJoinClauses.push(\n        sql`e.${sql.raw(branch.joinKindField)} = r.${sql.raw(nodeAlias)}_kind`,\n      );\n    }\n\n    if (forceWorktableOuterJoinOrder) {\n      const recursiveWhereClauses = [\n        ...recursiveJoinClauses,\n        ...recursiveFilterClauses,\n      ];\n\n      return sql`\n        SELECT ${sql.join(recursiveSelectColumns, sql`, `)}\n        FROM recursive_cte r\n        CROSS JOIN ${ctx.schema.edgesTable} e\n        JOIN ${ctx.schema.nodesTable} n ON n.graph_id = e.graph_id\n          AND n.id = e.${sql.raw(branch.targetField)}\n          AND n.kind = e.${sql.raw(branch.targetKindField)}\n        WHERE ${sql.join(recursiveWhereClauses, sql` AND `)}\n      `;\n    }\n\n    return sql`\n      SELECT ${sql.join(recursiveSelectColumns, sql`, `)}\n      FROM recursive_cte r\n      JOIN ${ctx.schema.edgesTable} e ON ${sql.join(recursiveJoinClauses, sql` AND `)}\n      JOIN ${ctx.schema.nodesTable} n ON n.graph_id = e.graph_id\n        AND n.id = e.${sql.raw(branch.targetField)}\n        AND n.kind = e.${sql.raw(branch.targetKindField)}\n      WHERE ${sql.join(recursiveFilterClauses, sql` AND `)}\n    `;\n  }\n\n  const directJoinField = direction === \"out\" ? \"from_id\" : \"to_id\";\n  const directTargetField = direction === \"out\" ? \"to_id\" : \"from_id\";\n  const directJoinKindField = direction === \"out\" ? \"from_kind\" : \"to_kind\";\n  const directTargetKindField = direction === \"out\" ? \"to_kind\" : \"from_kind\";\n\n  const directBranch = compileRecursiveBranch({\n    joinField: directJoinField,\n    targetField: directTargetField,\n    joinKindField: directJoinKindField,\n    targetKindField: directTargetKindField,\n    edgeKinds: directEdgeKinds,\n  });\n\n  function compileInverseRecursiveBranch(): SQL {\n    const inverseJoinField = direction === \"out\" ? \"to_id\" : \"from_id\";\n    const inverseTargetField = direction === \"out\" ? \"from_id\" : \"to_id\";\n    const inverseJoinKindField = direction === \"out\" ? \"to_kind\" : \"from_kind\";\n    const inverseTargetKindField =\n      direction === \"out\" ? \"from_kind\" : \"to_kind\";\n    const overlappingKinds = inverseEdgeKinds.filter((kind) =>\n      directEdgeKinds.includes(kind),\n    );\n\n    const duplicateGuard =\n      overlappingKinds.length > 0 ?\n        sql`NOT (e.from_id = e.to_id AND ${compileKindFilter(overlappingKinds, \"e.kind\")})`\n      : undefined;\n\n    const inverseBranch = compileRecursiveBranch({\n      joinField: inverseJoinField,\n      targetField: inverseTargetField,\n      joinKindField: inverseJoinKindField,\n      targetKindField: inverseTargetKindField,\n      edgeKinds: inverseEdgeKinds,\n      duplicateGuard,\n    });\n\n    return sql`\n      ${directBranch}\n      UNION ALL\n      ${inverseBranch}\n    `;\n  }\n\n  const recursiveBranchSql =\n    inverseEdgeKinds.length === 0 ?\n      directBranch\n    : compileInverseRecursiveBranch();\n  const baseSelectColumns = [\n    ...startColumnsFromBase,\n    ...nodeColumnsFromBase,\n    sql`0 AS depth`,\n  ];\n  if (initialPath !== undefined) {\n    baseSelectColumns.push(sql`${initialPath} AS path`);\n  }\n\n  return sql`\n    recursive_cte AS (\n      -- Base case: starting nodes\n      SELECT ${sql.join(baseSelectColumns, sql`, `)}\n      FROM ${ctx.schema.nodesTable} n0\n      WHERE ${sql.join(baseWhereClauses, sql` AND `)}\n\n      UNION ALL\n\n      -- Recursive case: follow edges\n      ${recursiveBranchSql}\n    )\n  `;\n}\n\n// ============================================================\n// Helper Functions\n// ============================================================\n\n/**\n * Compiles a kind filter for IN clause.\n * Delegates to the shared compileKindFilter from predicate-utils\n * with a raw SQL column expression.\n */\nfunction compileKindFilter(kinds: readonly string[], columnExpr: string): SQL {\n  return sharedCompileKindFilter(sql.raw(columnExpr), kinds);\n}\n\n/**\n * Compiles node predicates for a specific alias.\n * Filters by alias and excludes edge predicates (targetType !== \"edge\").\n */\nfunction compileNodePredicates(\n  ast: QueryAst,\n  alias: string,\n  ctx: PredicateCompilerContext,\n): SQL[] {\n  return ast.predicates\n    .filter((p) => p.targetAlias === alias && p.targetType !== \"edge\")\n    .map((p) => compilePredicateExpression(p.expression, ctx));\n}\n\n/**\n * Compiles edge predicates for a specific edge alias.\n * Filters by alias and only includes edge predicates (targetType === \"edge\").\n */\nfunction compileEdgePredicates(\n  ast: QueryAst,\n  edgeAlias: string,\n  ctx: PredicateCompilerContext,\n): SQL[] {\n  return ast.predicates\n    .filter((p) => p.targetAlias === edgeAlias && p.targetType === \"edge\")\n    .map((p) => compilePredicateExpression(p.expression, ctx));\n}\n\nfunction collectRequiredColumnsByAlias(\n  ast: QueryAst,\n  traversal: VariableLengthTraversal,\n): RequiredColumnsByAlias | undefined {\n  const selectiveFields = ast.selectiveFields;\n  if (selectiveFields === undefined || selectiveFields.length === 0) {\n    return undefined;\n  }\n\n  const requiredColumnsByAlias = new Map<string, Set<string>>();\n  const previousNodeKinds = [\n    ...new Set([...ast.start.kinds, ...traversal.nodeKinds]),\n  ];\n\n  // Recursive expansion always needs node alias id for joins/cycle checks.\n  addRequiredColumn(requiredColumnsByAlias, traversal.nodeAlias, \"id\");\n  if (previousNodeKinds.length > 1) {\n    addRequiredColumn(requiredColumnsByAlias, traversal.nodeAlias, \"kind\");\n  }\n\n  for (const field of selectiveFields) {\n    markSelectiveFieldAsRequired(requiredColumnsByAlias, field);\n  }\n\n  if (ast.orderBy) {\n    for (const orderSpec of ast.orderBy) {\n      markFieldRefAsRequired(requiredColumnsByAlias, orderSpec.field);\n    }\n  }\n\n  return requiredColumnsByAlias;\n}\n\nfunction compileNodeSelectColumnsFromTable(\n  tableAlias: string,\n  alias: string,\n  requiredColumns: ReadonlySet<string> | undefined,\n  alwaysRequiredColumns: ReadonlySet<string>,\n): SQL[] {\n  return NODE_COLUMNS.filter((column) =>\n    shouldProjectColumn(requiredColumns, column, alwaysRequiredColumns),\n  ).map(\n    (column) =>\n      sql`${sql.raw(tableAlias)}.${sql.raw(column)} AS ${sql.raw(`${alias}_${column}`)}`,\n  );\n}\n\nfunction compileNodeSelectColumnsFromRecursiveRow(\n  alias: string,\n  requiredColumns: ReadonlySet<string> | undefined,\n  alwaysRequiredColumns: ReadonlySet<string>,\n): SQL[] {\n  return NODE_COLUMNS.filter((column) =>\n    shouldProjectColumn(requiredColumns, column, alwaysRequiredColumns),\n  ).map((column) => {\n    const projected = `${alias}_${column}`;\n    return sql`r.${sql.raw(projected)} AS ${sql.raw(projected)}`;\n  });\n}\n\n/**\n * Compiles projection for recursive query results.\n */\nfunction compileRecursiveProjection(\n  ast: QueryAst,\n  traversal: VariableLengthTraversal,\n  dialect: DialectAdapter,\n): SQL {\n  if (ast.selectiveFields && ast.selectiveFields.length > 0) {\n    return compileRecursiveSelectiveProjection(\n      ast.selectiveFields,\n      ast,\n      traversal,\n      dialect,\n    );\n  }\n\n  const startAlias = ast.start.alias;\n  const nodeAlias = traversal.nodeAlias;\n  const vl = traversal.variableLength;\n\n  const fields: SQL[] = [\n    // Start alias fields with metadata\n    sql`${sql.raw(startAlias)}_id`,\n    sql`${sql.raw(startAlias)}_kind`,\n    sql`${sql.raw(startAlias)}_props`,\n    sql`${sql.raw(startAlias)}_version`,\n    sql`${sql.raw(startAlias)}_valid_from`,\n    sql`${sql.raw(startAlias)}_valid_to`,\n    sql`${sql.raw(startAlias)}_created_at`,\n    sql`${sql.raw(startAlias)}_updated_at`,\n    sql`${sql.raw(startAlias)}_deleted_at`,\n    // Node alias fields with metadata\n    sql`${sql.raw(nodeAlias)}_id`,\n    sql`${sql.raw(nodeAlias)}_kind`,\n    sql`${sql.raw(nodeAlias)}_props`,\n    sql`${sql.raw(nodeAlias)}_version`,\n    sql`${sql.raw(nodeAlias)}_valid_from`,\n    sql`${sql.raw(nodeAlias)}_valid_to`,\n    sql`${sql.raw(nodeAlias)}_created_at`,\n    sql`${sql.raw(nodeAlias)}_updated_at`,\n    sql`${sql.raw(nodeAlias)}_deleted_at`,\n  ];\n\n  if (vl.depthAlias !== undefined) {\n    fields.push(sql`depth AS ${quoteIdentifier(vl.depthAlias)}`);\n  }\n\n  if (vl.pathAlias !== undefined) {\n    fields.push(sql`path AS ${quoteIdentifier(vl.pathAlias)}`);\n  }\n\n  return sql.join(fields, sql`, `);\n}\n\nfunction compileRecursiveSelectiveProjection(\n  fields: readonly SelectiveField[],\n  ast: QueryAst,\n  traversal: VariableLengthTraversal,\n  dialect: DialectAdapter,\n): SQL {\n  const allowedAliases = new Set([ast.start.alias, traversal.nodeAlias]);\n\n  const columns: SQL[] = fields.map((field) => {\n    if (!allowedAliases.has(field.alias)) {\n      throw new UnsupportedPredicateError(\n        `Selective projection for recursive traversals does not support alias \"${field.alias}\"`,\n      );\n    }\n\n    if (field.isSystemField) {\n      const dbColumn = mapSelectiveSystemFieldToColumn(field.field);\n      return sql`${sql.raw(`${field.alias}_${dbColumn}`)} AS ${quoteIdentifier(field.outputName)}`;\n    }\n\n    const column = sql.raw(`${field.alias}_props`);\n    const extracted = compileTypedJsonExtract({\n      column,\n      dialect,\n      pointer: jsonPointer([field.field]),\n      valueType: field.valueType,\n    });\n    return sql`${extracted} AS ${quoteIdentifier(field.outputName)}`;\n  });\n\n  // Include recursive depth/path columns when present\n  const vl = traversal.variableLength;\n  if (vl.depthAlias !== undefined) {\n    columns.push(sql`depth AS ${quoteIdentifier(vl.depthAlias)}`);\n  }\n  if (vl.pathAlias !== undefined) {\n    columns.push(sql`path AS ${quoteIdentifier(vl.pathAlias)}`);\n  }\n\n  return sql.join(columns, sql`, `);\n}\n\n/**\n * Compiles ORDER BY for recursive query.\n */\nfunction compileRecursiveOrderBy(\n  ast: QueryAst,\n  dialect: DialectAdapter,\n): SQL | undefined {\n  if (!ast.orderBy || ast.orderBy.length === 0) {\n    return undefined;\n  }\n\n  const parts: SQL[] = [];\n\n  for (const orderSpec of ast.orderBy) {\n    const valueType = orderSpec.field.valueType;\n    if (valueType === \"array\" || valueType === \"object\") {\n      throw new UnsupportedPredicateError(\n        \"Ordering by JSON arrays or objects is not supported\",\n      );\n    }\n    const field = compileFieldValue(orderSpec.field, dialect, valueType);\n    const direction = sql.raw(orderSpec.direction.toUpperCase());\n    const nulls =\n      orderSpec.nulls ?? (orderSpec.direction === \"asc\" ? \"last\" : \"first\");\n    const nullsDirection = sql.raw(nulls === \"first\" ? \"DESC\" : \"ASC\");\n\n    parts.push(\n      sql`(${field} IS NULL) ${nullsDirection}`,\n      sql`${field} ${direction}`,\n    );\n  }\n\n  return sql`ORDER BY ${sql.join(parts, sql`, `)}`;\n}\n\n/**\n * Compiles LIMIT and OFFSET clauses.\n */\nfunction compileLimitOffset(ast: QueryAst): SQL | undefined {\n  const parts: SQL[] = [];\n\n  if (ast.limit !== undefined) {\n    parts.push(sql`LIMIT ${ast.limit}`);\n  }\n  if (ast.offset !== undefined) {\n    parts.push(sql`OFFSET ${ast.offset}`);\n  }\n\n  return parts.length > 0 ? sql.join(parts, sql` `) : undefined;\n}\n","/**\n * Value decoding utilities for query execution.\n *\n * Selective projection queries return values extracted directly from JSON\n * columns. Some dialects return booleans/numbers as different JS types, and\n * arrays/objects may be returned as JSON text. This module normalizes those\n * values based on schema type information.\n */\n\nimport { type ValueType } from \"../ast\";\nimport { type FieldTypeInfo } from \"../schema-introspector\";\n\nexport function nullToUndefined(value: unknown): unknown {\n  return value === null ? undefined : value;\n}\n\nexport function decodeSelectedValue(\n  value: unknown,\n  typeInfo: FieldTypeInfo | undefined,\n): unknown {\n  const normalized = nullToUndefined(value);\n  if (normalized === undefined) return undefined;\n\n  if (typeInfo === undefined) {\n    return normalized;\n  }\n\n  return decodeByValueType(normalized, typeInfo.valueType);\n}\n\nfunction decodeByValueType(value: unknown, valueType: ValueType): unknown {\n  switch (valueType) {\n    case \"boolean\": {\n      if (typeof value === \"boolean\") return value;\n      if (typeof value === \"number\") return value !== 0;\n      if (typeof value === \"string\") {\n        if (value === \"0\") return false;\n        if (value === \"1\") return true;\n        if (value.toLowerCase() === \"true\") return true;\n        if (value.toLowerCase() === \"false\") return false;\n      }\n      return Boolean(value);\n    }\n    case \"number\": {\n      if (typeof value === \"number\") return value;\n      if (typeof value === \"string\") {\n        const parsed = Number(value);\n        return Number.isNaN(parsed) ? value : parsed;\n      }\n      return value;\n    }\n    case \"array\":\n    case \"object\":\n    case \"embedding\": {\n      if (typeof value !== \"string\") return value;\n      const trimmed = value.trim();\n      const looksJson = trimmed.startsWith(\"[\") || trimmed.startsWith(\"{\");\n      if (!looksJson) return value;\n      try {\n        return JSON.parse(trimmed) as unknown;\n      } catch {\n        return value;\n      }\n    }\n    case \"string\":\n    case \"date\":\n    case \"unknown\": {\n      return value;\n    }\n    default: {\n      const _exhaustive: never = valueType;\n      void _exhaustive;\n      return value;\n    }\n  }\n}\n","import { type SQL, sql } from \"drizzle-orm\";\n\nimport { type TemporalMode } from \"../core/types\";\nimport { type RecursiveCyclePolicy } from \"../query/ast\";\nimport { compileKindFilter } from \"../query/compiler/predicate-utils\";\nimport { type SqlSchema } from \"../query/compiler/schema\";\nimport { compileTemporalFilter } from \"../query/compiler/temporal\";\nimport { type DialectAdapter } from \"../query/dialect/types\";\nimport { type TraversalDirection } from \"./algorithms/types\";\n\ntype BuildReachableCteOptions = Readonly<{\n  graphId: string;\n  sourceId: string;\n  edgeKinds: readonly string[];\n  maxHops: number;\n  direction: TraversalDirection;\n  cyclePolicy: RecursiveCyclePolicy;\n  includePath: boolean;\n  /**\n   * Temporal mode applied to both nodes and edges along the traversal.\n   * Callers that want the pre-temporal behavior (soft-delete only) should\n   * pass `\"includeEnded\"`.\n   */\n  temporalMode: TemporalMode;\n  /** ISO-8601 timestamp used when `temporalMode === \"asOf\"`. */\n  asOf?: string;\n  dialect: DialectAdapter;\n  schema: SqlSchema;\n}>;\n\nexport function buildReachableCte(options: BuildReachableCteOptions): SQL {\n  const trackPath = options.cyclePolicy === \"prevent\" || options.includePath;\n  const edgeKindFilter = compileKindFilter(\n    sql.raw(\"e.kind\"),\n    options.edgeKinds,\n  );\n  const currentTimestamp = options.dialect.currentTimestamp();\n  const nodeTemporalFilter = compileTemporalFilter({\n    mode: options.temporalMode,\n    asOf: options.asOf,\n    tableAlias: \"n\",\n    currentTimestamp,\n  });\n  const edgeTemporalFilter = compileTemporalFilter({\n    mode: options.temporalMode,\n    asOf: options.asOf,\n    tableAlias: \"e\",\n    currentTimestamp,\n  });\n\n  const initialPath =\n    trackPath ? options.dialect.initializePath(sql.raw(\"n.id\")) : undefined;\n  const pathExtension =\n    trackPath ?\n      options.dialect.extendPath(sql.raw(\"r.path\"), sql.raw(\"n.id\"))\n    : undefined;\n  const cycleCheck =\n    options.cyclePolicy === \"prevent\" ?\n      options.dialect.cycleCheck(sql.raw(\"n.id\"), sql.raw(\"r.path\"))\n    : undefined;\n\n  const baseColumns: SQL[] = [sql`n.id`, sql`n.kind`, sql`0 AS depth`];\n  if (initialPath !== undefined) {\n    baseColumns.push(sql`${initialPath} AS path`);\n  }\n\n  const baseCase = sql`SELECT ${sql.join(baseColumns, sql`, `)} FROM ${options.schema.nodesTable} n WHERE n.graph_id = ${options.graphId} AND n.id = ${options.sourceId} AND ${nodeTemporalFilter}`;\n\n  const recursiveColumns: SQL[] = [\n    sql`n.id`,\n    sql`n.kind`,\n    sql`r.depth + 1 AS depth`,\n  ];\n  if (pathExtension !== undefined) {\n    recursiveColumns.push(sql`${pathExtension} AS path`);\n  }\n\n  const recursiveWhere: SQL[] = [\n    sql`e.graph_id = ${options.graphId}`,\n    edgeKindFilter,\n    edgeTemporalFilter,\n    nodeTemporalFilter,\n    sql`r.depth < ${options.maxHops}`,\n  ];\n  if (cycleCheck !== undefined) recursiveWhere.push(cycleCheck);\n\n  const forceWorktableOuterJoinOrder =\n    options.dialect.capabilities.forceRecursiveWorktableOuterJoinOrder;\n\n  const recursiveCase = compileRecursiveBranch({\n    recursiveColumns,\n    whereClauses: recursiveWhere,\n    direction: options.direction,\n    forceWorktableOuterJoinOrder,\n    schema: options.schema,\n  });\n\n  return sql`WITH RECURSIVE reachable AS (${baseCase} UNION ALL ${recursiveCase})`;\n}\n\ntype CompileRecursiveBranchOptions = Readonly<{\n  recursiveColumns: readonly SQL[];\n  whereClauses: readonly SQL[];\n  direction: TraversalDirection;\n  forceWorktableOuterJoinOrder: boolean;\n  schema: SqlSchema;\n}>;\n\nfunction compileRecursiveBranch(options: CompileRecursiveBranchOptions): SQL {\n  const selectClause = sql`SELECT ${sql.join([...options.recursiveColumns], sql`, `)}`;\n\n  switch (options.direction) {\n    case \"out\": {\n      return buildDirectionalBranch({\n        selectClause,\n        whereClauses: options.whereClauses,\n        joinField: \"from_id\",\n        targetField: \"to_id\",\n        targetKindField: \"to_kind\",\n        forceWorktableOuterJoinOrder: options.forceWorktableOuterJoinOrder,\n        schema: options.schema,\n      });\n    }\n    case \"in\": {\n      return buildDirectionalBranch({\n        selectClause,\n        whereClauses: options.whereClauses,\n        joinField: \"to_id\",\n        targetField: \"from_id\",\n        targetKindField: \"from_kind\",\n        forceWorktableOuterJoinOrder: options.forceWorktableOuterJoinOrder,\n        schema: options.schema,\n      });\n    }\n    case \"both\": {\n      return buildBidirectionalBranch({\n        selectClause,\n        whereClauses: options.whereClauses,\n        forceWorktableOuterJoinOrder: options.forceWorktableOuterJoinOrder,\n        schema: options.schema,\n      });\n    }\n  }\n}\n\ntype DirectionalBranchOptions = Readonly<{\n  selectClause: SQL;\n  whereClauses: readonly SQL[];\n  joinField: \"from_id\" | \"to_id\";\n  targetField: \"from_id\" | \"to_id\";\n  targetKindField: \"from_kind\" | \"to_kind\";\n  forceWorktableOuterJoinOrder: boolean;\n  schema: SqlSchema;\n}>;\n\nfunction buildDirectionalBranch(options: DirectionalBranchOptions): SQL {\n  const nodeJoin = sql`JOIN ${options.schema.nodesTable} n ON n.graph_id = e.graph_id AND n.id = e.${sql.raw(options.targetField)} AND n.kind = e.${sql.raw(options.targetKindField)}`;\n\n  if (options.forceWorktableOuterJoinOrder) {\n    const allWhere = [\n      ...options.whereClauses,\n      sql`e.${sql.raw(options.joinField)} = r.id`,\n    ];\n    return sql`${options.selectClause} FROM reachable r CROSS JOIN ${options.schema.edgesTable} e ${nodeJoin} WHERE ${sql.join(allWhere, sql` AND `)}`;\n  }\n\n  return sql`${options.selectClause} FROM reachable r JOIN ${options.schema.edgesTable} e ON e.${sql.raw(options.joinField)} = r.id ${nodeJoin} WHERE ${sql.join([...options.whereClauses], sql` AND `)}`;\n}\n\ntype BidirectionalBranchOptions = Readonly<{\n  selectClause: SQL;\n  whereClauses: readonly SQL[];\n  forceWorktableOuterJoinOrder: boolean;\n  schema: SqlSchema;\n}>;\n\nfunction buildBidirectionalBranch(options: BidirectionalBranchOptions): SQL {\n  // PostgreSQL rejects multiple non-recursive terms, so both directions are\n  // folded into a single UNION ALL branch via an OR on the join condition.\n  const nodeJoin = sql`JOIN ${options.schema.nodesTable} n ON n.graph_id = e.graph_id AND ((e.to_id = r.id AND n.id = e.from_id AND n.kind = e.from_kind) OR (e.from_id = r.id AND n.id = e.to_id AND n.kind = e.to_kind))`;\n\n  if (options.forceWorktableOuterJoinOrder) {\n    const allWhere = [\n      ...options.whereClauses,\n      sql`(e.from_id = r.id OR e.to_id = r.id)`,\n    ];\n    return sql`${options.selectClause} FROM reachable r CROSS JOIN ${options.schema.edgesTable} e ${nodeJoin} WHERE ${sql.join(allWhere, sql` AND `)}`;\n  }\n\n  return sql`${options.selectClause} FROM reachable r JOIN ${options.schema.edgesTable} e ON (e.from_id = r.id OR e.to_id = r.id) ${nodeJoin} WHERE ${sql.join([...options.whereClauses], sql` AND `)}`;\n}\n","/**\n * Row Mappers for Store\n *\n * Transforms database rows into typed Node and Edge objects.\n */\nimport {\n  type EdgeRow as BackendEdgeRow,\n  type NodeRow as BackendNodeRow,\n} from \"../backend/types\";\nimport {\n  filterReservedKeys,\n  RESERVED_EDGE_KEYS,\n  RESERVED_NODE_KEYS,\n} from \"./reserved-keys\";\nimport { type Edge, type EdgeMeta, type Node, type NodeMeta } from \"./types\";\n\n/**\n * Raw node row from database (without graph_id).\n * Derived from BackendNodeRow so BackendNodeRow is assignable without casts.\n */\nexport type NodeRow = Omit<BackendNodeRow, \"graph_id\">;\n\n/**\n * Raw edge row from database (without graph_id).\n * Derived from BackendEdgeRow so BackendEdgeRow is assignable without casts.\n */\nexport type EdgeRow = Omit<BackendEdgeRow, \"graph_id\">;\n\n/**\n * Converts null to undefined for consistent typing.\n * Database backends return null for missing values, but our types use undefined.\n */\nfunction nullToUndefined<T>(value: T | null | undefined): T | undefined {\n  return value === null ? undefined : value;\n}\n\n/**\n * Transforms a database row into a typed Node object.\n *\n * Props are spread at top level, metadata goes under `meta`.\n * Reserved keys (id, kind, meta) in props are filtered out to prevent collisions.\n * Null values from database are normalized to undefined.\n */\nexport function rowToNode(row: NodeRow): Node {\n  const rawProps = JSON.parse(row.props) as Record<string, unknown>;\n  const props = filterReservedKeys(rawProps, RESERVED_NODE_KEYS);\n  return {\n    kind: row.kind,\n    id: row.id as Node[\"id\"],\n    meta: rowToNodeMeta(row),\n    ...props,\n  };\n}\n\nexport function rowToNodeMeta(\n  row: Pick<\n    NodeRow,\n    | \"version\"\n    | \"valid_from\"\n    | \"valid_to\"\n    | \"created_at\"\n    | \"updated_at\"\n    | \"deleted_at\"\n  >,\n): NodeMeta {\n  return {\n    version: row.version,\n    validFrom: nullToUndefined(row.valid_from),\n    validTo: nullToUndefined(row.valid_to),\n    createdAt: row.created_at,\n    updatedAt: row.updated_at,\n    deletedAt: nullToUndefined(row.deleted_at),\n  };\n}\n\n/**\n * Transforms a database row into a typed Edge object.\n *\n * Props are spread at top level, metadata goes under `meta`.\n * Reserved keys in props are filtered out to prevent collisions.\n * Null values from database are normalized to undefined.\n */\nexport function rowToEdge(row: EdgeRow): Edge {\n  const rawProps = JSON.parse(row.props) as Record<string, unknown>;\n  const props = filterReservedKeys(rawProps, RESERVED_EDGE_KEYS);\n  return {\n    id: row.id,\n    kind: row.kind,\n    fromKind: row.from_kind,\n    fromId: row.from_id,\n    toKind: row.to_kind,\n    toId: row.to_id,\n    meta: rowToEdgeMeta(row),\n    ...props,\n  } as Edge;\n}\n\nexport function rowToEdgeMeta(\n  row: Pick<\n    EdgeRow,\n    \"valid_from\" | \"valid_to\" | \"created_at\" | \"updated_at\" | \"deleted_at\"\n  >,\n): EdgeMeta {\n  return {\n    validFrom: nullToUndefined(row.valid_from),\n    validTo: nullToUndefined(row.valid_to),\n    createdAt: row.created_at,\n    updatedAt: row.updated_at,\n    deletedAt: nullToUndefined(row.deleted_at),\n  };\n}\n","/**\n * Subgraph Extraction\n *\n * Extracts a typed subgraph from a root node by traversing a set of edge kinds.\n * Uses a recursive CTE for BFS traversal with cycle detection, then hydrates\n * the reachable nodes and connecting edges in two parallel queries.\n */\nimport { type SQL, sql } from \"drizzle-orm\";\n\nimport type { GraphBackend } from \"../backend/types\";\nimport { MAX_PG_IDENTIFIER_LENGTH } from \"../constants\";\nimport type {\n  AllNodeTypes,\n  EdgeKinds,\n  GraphDef,\n  NodeKinds,\n} from \"../core/define-graph\";\nimport { resolveReadCoordinate } from \"../core/temporal\";\nimport type { KindEntity } from \"../core/types\";\nimport type {\n  AnyEdgeType,\n  NodeId,\n  NodeType,\n  TemporalMode,\n} from \"../core/types\";\nimport type { RecursiveCyclePolicy } from \"../query/ast\";\nimport { compileKindFilter } from \"../query/compiler/predicate-utils\";\nimport { MAX_EXPLICIT_RECURSIVE_DEPTH } from \"../query/compiler/recursive\";\nimport { DEFAULT_SQL_SCHEMA, type SqlSchema } from \"../query/compiler/schema\";\nimport { compileTemporalFilter } from \"../query/compiler/temporal\";\nimport { compileTypedJsonExtract } from \"../query/compiler/typed-json-extract\";\nimport { quoteIdentifier } from \"../query/compiler/utils\";\nimport type { DialectAdapter } from \"../query/dialect/types\";\nimport { decodeSelectedValue } from \"../query/execution/value-decoder\";\nimport { jsonPointer } from \"../query/json-pointer\";\nimport {\n  createSchemaIntrospector,\n  type FieldTypeInfo,\n  type SchemaIntrospector,\n} from \"../query/schema-introspector\";\nimport { fnv1aBase36 } from \"../utils/hash\";\nimport { buildReachableCte } from \"./recursive-cte\";\nimport { validateProjectionField } from \"./reserved-keys\";\nimport {\n  type EdgeRow,\n  type NodeRow,\n  rowToEdge,\n  rowToEdgeMeta,\n  rowToNode,\n  rowToNodeMeta,\n} from \"./row-mappers\";\nimport type { Edge, EdgeMeta, Node, NodeMeta } from \"./types\";\n\n// ============================================================\n// Constants\n// ============================================================\n\nconst DEFAULT_SUBGRAPH_MAX_DEPTH = 10;\n\nconst TEXT_ENCODER = new TextEncoder();\n\n/**\n * Truncates a string so its UTF-8 byte length does not exceed maxBytes.\n * Avoids splitting in the middle of a multi-byte character.\n */\nfunction truncateToBytes(value: string, maxBytes: number): string {\n  const encoded = TEXT_ENCODER.encode(value);\n  if (encoded.byteLength <= maxBytes) return value;\n\n  // Walk backwards from the limit to find a clean character boundary.\n  // UTF-8 continuation bytes have the form 10xxxxxx (0x80..0xBF).\n  let end = maxBytes;\n  while (end > 0 && encoded[end]! >= 0x80 && encoded[end]! < 0xc0) {\n    end--;\n  }\n\n  return new TextDecoder().decode(encoded.slice(0, end));\n}\n\n/**\n * Generates a short, deterministic column alias safe for PostgreSQL.\n *\n * Format: `sg_{n|e}_{truncatedKind}_{hash}`\n * The hash is computed from the full `kind + field` to prevent collisions\n * when truncation would make two different identifiers identical.\n *\n * PostgreSQL truncates identifiers at 63 *bytes*, not characters.\n * The kind portion is truncated by byte length to stay under the limit\n * even with multibyte characters.\n */\nfunction projectionAlias(\n  entityPrefix: KindEntity,\n  kind: string,\n  field: string,\n): string {\n  const prefix = entityPrefix === \"node\" ? \"sg_n\" : \"sg_e\";\n  const hash = fnv1aBase36(`${kind}\\0${field}`);\n  // prefix + \"_\" + kind_trunc + \"_\" + hash must fit in 63 bytes.\n  // prefix and hash are ASCII, so byte length === string length.\n  const fixedBytes = prefix.length + 1 + 1 + hash.length;\n  const maxKindBytes = MAX_PG_IDENTIFIER_LENGTH - fixedBytes;\n  const truncatedKind = truncateToBytes(kind, maxKindBytes);\n  return `${prefix}_${truncatedKind}_${hash}`;\n}\n\n/**\n * Normalizes a JSON column value to a string.\n * PostgreSQL JSONB columns return parsed objects; SQLite returns strings.\n */\nfunction normalizeProps(value: unknown): string {\n  return typeof value === \"string\" ? value : JSON.stringify(value ?? {});\n}\n\n// ============================================================\n// Type Utilities\n// ============================================================\n\n/**\n * Discriminated union of all Node runtime types in a graph.\n *\n * Unlike `AllNodeTypes<G>` which gives the union of *type definitions*,\n * `AnyNode<G>` gives the union of *runtime node instances*.\n */\nexport type AnyNode<G extends GraphDef> = {\n  [K in NodeKinds<G>]: Node<G[\"nodes\"][K][\"type\"]>;\n}[NodeKinds<G>];\n\n/**\n * Discriminated union of all Edge runtime types in a graph.\n */\nexport type AnyEdge<G extends GraphDef> = {\n  [K in EdgeKinds<G>]: Edge<G[\"edges\"][K][\"type\"]>;\n}[EdgeKinds<G>];\n\n/**\n * Discriminated union of Node runtime types narrowed to a subset of kinds.\n */\nexport type SubsetNode<G extends GraphDef, K extends NodeKinds<G>> = {\n  [Kind in K]: Node<G[\"nodes\"][Kind][\"type\"]>;\n}[K];\n\n/**\n * Discriminated union of Edge runtime types narrowed to a subset of kinds.\n */\nexport type SubsetEdge<G extends GraphDef, K extends EdgeKinds<G>> = {\n  [Kind in K]: Edge<G[\"edges\"][Kind][\"type\"]>;\n}[K];\n\ntype EmptyShape = Readonly<Record<never, never>>;\n\ntype NodeProjectionPropertyKey<N extends NodeType> = Exclude<\n  keyof Node<N>,\n  \"id\" | \"kind\" | \"meta\"\n> &\n  string;\n\ntype EdgeProjectionPropertyKey<E extends AnyEdgeType> = Exclude<\n  keyof Edge<E>,\n  \"id\" | \"kind\" | \"fromKind\" | \"fromId\" | \"toKind\" | \"toId\" | \"meta\"\n> &\n  string;\n\ntype SubgraphNodeProjectionField<N extends NodeType = NodeType> =\n  | NodeProjectionPropertyKey<N>\n  | \"meta\";\n\ntype SubgraphEdgeProjectionField<E extends AnyEdgeType = AnyEdgeType> =\n  | EdgeProjectionPropertyKey<E>\n  | \"meta\";\n\ntype SubgraphNodeProjectionMap<\n  G extends GraphDef,\n  NK extends NodeKinds<G> = NodeKinds<G>,\n> = Readonly<{\n  [K in NodeKinds<G>]?: K extends NK ?\n    readonly SubgraphNodeProjectionField<G[\"nodes\"][K][\"type\"]>[]\n  : never;\n}>;\n\ntype SubgraphEdgeProjectionMap<\n  G extends GraphDef,\n  EK extends EdgeKinds<G> = EdgeKinds<G>,\n> = Readonly<{\n  [K in EdgeKinds<G>]?: K extends EK ?\n    readonly SubgraphEdgeProjectionField<G[\"edges\"][K][\"type\"]>[]\n  : never;\n}>;\n\nexport type SubgraphProject<\n  G extends GraphDef,\n  NK extends NodeKinds<G> = NodeKinds<G>,\n  EK extends EdgeKinds<G> = EdgeKinds<G>,\n> = Readonly<{\n  /**\n   * Node fields to keep per kind.\n   *\n   * Projected nodes always retain `kind` and `id`.\n   * Use `\"meta\"` to include the full metadata object; omit it to exclude metadata entirely.\n   * Only kinds present in `includeKinds` (or all node kinds when omitted) are valid keys.\n   */\n  nodes?: SubgraphNodeProjectionMap<G, NK>;\n  /**\n   * Edge fields to keep per kind.\n   *\n   * Projected edges always retain `id`, `kind`, `fromKind`, `fromId`,\n   * `toKind`, and `toId`.\n   * Use `\"meta\"` to include the full metadata object; omit it to exclude metadata entirely.\n   * Only edge kinds listed in `edges` are valid keys.\n   */\n  edges?: SubgraphEdgeProjectionMap<G, EK>;\n}>;\n\n/**\n * Identity function that preserves literal types for reusable projection configs.\n *\n * Without this helper, storing a projection in a typed variable widens the\n * field arrays to `string[]`, defeating compile-time narrowing on results.\n *\n * @example\n * ```ts\n * const project = defineSubgraphProject(graph)({\n *   nodes: { Task: [\"title\", \"meta\"] },\n *   edges: { uses_skill: [] },\n * });\n * const result = await store.subgraph(rootId, { edges: [\"uses_skill\"], project });\n * // result.nodes narrowed correctly — task.status is a type error\n * ```\n */\nexport function defineSubgraphProject<G extends GraphDef>(\n  _graph: G,\n): <const P extends SubgraphProject<G>>(project: P) => P {\n  return <const P extends SubgraphProject<G>>(project: P): P => project;\n}\n\ntype HasMeta<Selection extends readonly string[] | undefined> =\n  Selection extends readonly string[] ?\n    \"meta\" extends Selection[number] ?\n      true\n    : false\n  : false;\n\ntype SelectedNodeProps<\n  N extends NodeType,\n  Selection extends readonly string[] | undefined,\n> =\n  Selection extends readonly string[] ?\n    Pick<Node<N>, Extract<Selection[number], NodeProjectionPropertyKey<N>>>\n  : EmptyShape;\n\ntype SelectedEdgeProps<\n  E extends AnyEdgeType,\n  Selection extends readonly string[] | undefined,\n> =\n  Selection extends readonly string[] ?\n    Pick<Edge<E>, Extract<Selection[number], EdgeProjectionPropertyKey<E>>>\n  : EmptyShape;\n\ntype ProjectedNodeResult<\n  N extends NodeType,\n  Selection extends readonly string[] | undefined,\n> = Readonly<Pick<Node<N>, \"id\" | \"kind\">> &\n  Readonly<SelectedNodeProps<N, Selection>> &\n  (HasMeta<Selection> extends true ? Readonly<{ meta: NodeMeta }> : EmptyShape);\n\ntype ProjectedEdgeResult<\n  E extends AnyEdgeType,\n  Selection extends readonly string[] | undefined,\n> = Readonly<\n  Pick<Edge<E>, \"id\" | \"kind\" | \"fromKind\" | \"fromId\" | \"toKind\" | \"toId\">\n> &\n  Readonly<SelectedEdgeProps<E, Selection>> &\n  (HasMeta<Selection> extends true ? Readonly<{ meta: EdgeMeta }> : EmptyShape);\n\ntype ProjectionSelection<\n  P,\n  Key extends \"nodes\" | \"edges\",\n  Kind extends string,\n> =\n  // eslint-disable-next-line @typescript-eslint/consistent-indexed-object-style -- mapped type needed for conditional inference on Key\n  P extends Readonly<{ [K in Key]?: infer Map }> ?\n    Map extends Readonly<Record<string, readonly string[] | undefined>> ?\n      Kind extends keyof Map ?\n        Map[Kind]\n      : undefined\n    : undefined\n  : undefined;\n\ntype SubgraphNodeResultForKind<\n  G extends GraphDef,\n  Kind extends NodeKinds<G>,\n  P,\n> =\n  ProjectionSelection<P, \"nodes\", Kind> extends readonly string[] ?\n    ProjectedNodeResult<\n      G[\"nodes\"][Kind][\"type\"],\n      ProjectionSelection<P, \"nodes\", Kind>\n    >\n  : Node<G[\"nodes\"][Kind][\"type\"]>;\n\ntype SubgraphEdgeResultForKind<\n  G extends GraphDef,\n  Kind extends EdgeKinds<G>,\n  P,\n> =\n  ProjectionSelection<P, \"edges\", Kind> extends readonly string[] ?\n    ProjectedEdgeResult<\n      G[\"edges\"][Kind][\"type\"],\n      ProjectionSelection<P, \"edges\", Kind>\n    >\n  : Edge<G[\"edges\"][Kind][\"type\"]>;\n\n// ============================================================\n// Options & Result Types\n// ============================================================\n\nexport type SubgraphOptions<\n  G extends GraphDef,\n  EK extends EdgeKinds<G>,\n  NK extends NodeKinds<G>,\n  P extends SubgraphProject<G, NK, EK> | undefined = undefined,\n> = Readonly<{\n  /** Edge kinds to follow during traversal. Edges not listed are not traversed. */\n  edges: readonly EK[];\n  /** Maximum traversal depth from root (default: 10). */\n  maxDepth?: number;\n  /**\n   * Node kinds to include in the result. Nodes of other kinds are still\n   * traversed through but omitted from the output. When omitted, all\n   * reachable node kinds are included.\n   */\n  includeKinds?: readonly NK[];\n  /** Exclude the root node from the result (default: false). */\n  excludeRoot?: boolean;\n  /**\n   * Edge direction policy (default: \"out\").\n   * - \"out\": follow edges in their defined direction only\n   * - \"both\": follow edges in both directions (undirected traversal)\n   */\n  direction?: \"out\" | \"both\";\n  /** Cycle policy — reuse RecursiveCyclePolicy (default: \"prevent\"). */\n  cyclePolicy?: RecursiveCyclePolicy;\n  /**\n   * Temporal mode applied to both nodes and edges along the traversal and in\n   * the hydrated result. Defaults to `graph.defaults.temporalMode`.\n   */\n  temporalMode?: TemporalMode;\n  /** ISO-8601 timestamp used when `temporalMode === \"asOf\"`. */\n  asOf?: string;\n  /**\n   * Optional field-level projection per node/edge kind.\n   *\n   * Projected nodes keep `kind` and `id`; projected edges keep their structural\n   * endpoint fields. Kinds omitted from `project` remain fully hydrated.\n   * Projection applies to every returned entity, including the root node.\n   *\n   * Only kinds present in `includeKinds` (nodes) or `edges` (edges) are valid\n   * projection keys. Specifying a kind outside those sets is a compile-time error.\n   */\n  project?: P;\n}>;\n\n/**\n * Union of all node result types in a subgraph, respecting projection.\n */\nexport type SubgraphNodeResult<\n  G extends GraphDef,\n  NK extends NodeKinds<G> = NodeKinds<G>,\n  P = undefined,\n> = {\n  [Kind in NK]: SubgraphNodeResultForKind<G, Kind, P>;\n}[NK];\n\n/**\n * Union of all edge result types in a subgraph, respecting projection.\n */\nexport type SubgraphEdgeResult<\n  G extends GraphDef,\n  EK extends EdgeKinds<G> = EdgeKinds<G>,\n  P = undefined,\n> = {\n  [Kind in EK]: SubgraphEdgeResultForKind<G, Kind, P>;\n}[EK];\n\nexport type SubgraphResult<\n  G extends GraphDef,\n  NK extends NodeKinds<G> = NodeKinds<G>,\n  EK extends EdgeKinds<G> = EdgeKinds<G>,\n  P extends SubgraphProject<G, NK, EK> | undefined = undefined,\n> = Readonly<{\n  /** The root node, or undefined if the root was not found or excluded. */\n  root: SubgraphNodeResult<G, NK, P> | undefined;\n  nodes: ReadonlyMap<string, SubgraphNodeResult<G, NK, P>>;\n  /** Forward adjacency: fromId → edgeKind → edges to targets. */\n  adjacency: ReadonlyMap<\n    string,\n    ReadonlyMap<EK, readonly SubgraphEdgeResult<G, EK, P>[]>\n  >;\n  /** Reverse adjacency: toId → edgeKind → edges from sources. */\n  reverseAdjacency: ReadonlyMap<\n    string,\n    ReadonlyMap<EK, readonly SubgraphEdgeResult<G, EK, P>[]>\n  >;\n}>;\n\n// ============================================================\n// Execution Context\n// ============================================================\n\ntype SubgraphContext = Readonly<{\n  graphId: string;\n  rootId: string;\n  edgeKinds: readonly string[];\n  maxDepth: number;\n  includeKinds: readonly string[] | undefined;\n  excludeRoot: boolean;\n  direction: \"out\" | \"both\";\n  cyclePolicy: RecursiveCyclePolicy;\n  temporalMode: TemporalMode;\n  asOf: string | undefined;\n  dialect: DialectAdapter;\n  schema: SqlSchema;\n  backend: GraphBackend;\n}>;\n\ntype SubgraphNodeFetchRow = Readonly<\n  Omit<NodeRow, \"props\"> & { props: unknown } & Record<string, unknown>\n>;\n\ntype SubgraphEdgeFetchRow = Readonly<\n  Omit<EdgeRow, \"props\"> & { props: unknown } & Record<string, unknown>\n>;\n\ntype ProjectionPropertyFieldPlan = Readonly<{\n  field: string;\n  outputName: string;\n  typeInfo: FieldTypeInfo | undefined;\n}>;\n\ntype KindProjectionPlan = Readonly<{\n  includeMeta: boolean;\n  propertyFields: readonly ProjectionPropertyFieldPlan[];\n}>;\n\ntype ProjectionPlan = Readonly<{\n  fullKinds: readonly string[];\n  projectedKinds: ReadonlyMap<string, KindProjectionPlan>;\n}>;\n\n// ============================================================\n// Public API\n// ============================================================\n\nexport async function executeSubgraph<\n  G extends GraphDef,\n  EK extends EdgeKinds<G>,\n  NK extends NodeKinds<G>,\n  P extends SubgraphProject<G, NK, EK> | undefined = undefined,\n>(params: {\n  graph: G;\n  graphId: string;\n  rootId: NodeId<AllNodeTypes<G>>;\n  backend: GraphBackend;\n  dialect: DialectAdapter;\n  schema: SqlSchema | undefined;\n  options: SubgraphOptions<G, EK, NK, P>;\n}): Promise<SubgraphResult<G, NK, EK, P>> {\n  const { options } = params;\n  const { valid: coordinate } = resolveReadCoordinate(\n    options.temporalMode ?? params.graph.defaults.temporalMode,\n    options.asOf,\n  );\n  const temporalMode = coordinate.mode;\n\n  const maxDepth = Math.min(\n    options.maxDepth ?? DEFAULT_SUBGRAPH_MAX_DEPTH,\n    MAX_EXPLICIT_RECURSIVE_DEPTH,\n  );\n\n  const ctx: SubgraphContext = {\n    graphId: params.graphId,\n    rootId: params.rootId,\n    edgeKinds: options.edges,\n    maxDepth,\n    includeKinds: options.includeKinds,\n    excludeRoot: options.excludeRoot ?? false,\n    direction: options.direction ?? \"out\",\n    cyclePolicy: options.cyclePolicy ?? \"prevent\",\n    temporalMode,\n    asOf: coordinate.asOf,\n    dialect: params.dialect,\n    schema: params.schema ?? DEFAULT_SQL_SCHEMA,\n    backend: params.backend,\n  };\n\n  const schemaIntrospector = getSubgraphSchemaIntrospector(params.graph);\n  const nodeProjectionPlan = buildProjectionPlan(\n    getIncludedNodeKinds(params.graph, options.includeKinds),\n    options.project?.nodes,\n    (kind, field) => schemaIntrospector.getFieldTypeInfo(kind, field),\n    \"node\",\n  );\n  const edgeProjectionPlan = buildProjectionPlan(\n    dedupeStrings(options.edges),\n    options.project?.edges,\n    (kind, field) => schemaIntrospector.getEdgeFieldTypeInfo(kind, field),\n    \"edge\",\n  );\n\n  const reachableCte = buildReachableCte({\n    graphId: ctx.graphId,\n    sourceId: ctx.rootId,\n    edgeKinds: ctx.edgeKinds,\n    maxHops: ctx.maxDepth,\n    direction: ctx.direction,\n    cyclePolicy: ctx.cyclePolicy,\n    includePath: false,\n    temporalMode: ctx.temporalMode,\n    ...(ctx.asOf !== undefined && { asOf: ctx.asOf }),\n    dialect: ctx.dialect,\n    schema: ctx.schema,\n  });\n  const includedIdsCte = buildIncludedIdsCte(ctx);\n\n  const [nodeRows, edgeRows] = await Promise.all([\n    fetchSubgraphNodes(ctx, reachableCte, includedIdsCte, nodeProjectionPlan),\n    fetchSubgraphEdges(ctx, reachableCte, includedIdsCte, edgeProjectionPlan),\n  ]);\n\n  const nodesMap = new Map<string, Node>();\n  for (const row of nodeRows) {\n    const node = mapSubgraphNodeRow(row, nodeProjectionPlan);\n    nodesMap.set(node.id, node);\n  }\n\n  const adjacency = new Map<string, Map<string, Edge[]>>();\n  const reverseAdjacency = new Map<string, Map<string, Edge[]>>();\n  for (const row of edgeRows) {\n    const edge = mapSubgraphEdgeRow(row, edgeProjectionPlan);\n    insertAdjacencyEntry(adjacency, edge.fromId, edge.kind, edge);\n    insertAdjacencyEntry(reverseAdjacency, edge.toId, edge.kind, edge);\n  }\n\n  const root = nodesMap.get(ctx.rootId);\n\n  return {\n    root,\n    nodes: nodesMap,\n    adjacency,\n    reverseAdjacency,\n  } as unknown as SubgraphResult<G, NK, EK, P>;\n}\n\n// ============================================================\n// Projection Planning\n// ============================================================\n\ntype FieldTypeResolver = (\n  kind: string,\n  field: string,\n) => FieldTypeInfo | undefined;\n\nconst introspectorCache = new WeakMap<GraphDef, SchemaIntrospector>();\n\nfunction getSubgraphSchemaIntrospector<G extends GraphDef>(\n  graph: G,\n): SchemaIntrospector {\n  const cached = introspectorCache.get(graph);\n  if (cached !== undefined) return cached;\n\n  const nodeKinds = new Map(\n    Object.entries(graph.nodes).map(([kind, definition]) => [\n      kind,\n      { schema: definition.type.schema },\n    ]),\n  );\n  const edgeKinds = new Map(\n    Object.entries(graph.edges).map(([kind, definition]) => [\n      kind,\n      { schema: definition.type.schema },\n    ]),\n  );\n\n  const introspector = createSchemaIntrospector(nodeKinds, edgeKinds);\n  introspectorCache.set(graph, introspector);\n  return introspector;\n}\n\nfunction buildProjectionPlan(\n  kinds: readonly string[],\n  projectionMap:\n    | Readonly<Record<string, readonly string[] | undefined>>\n    | undefined,\n  resolveFieldType: FieldTypeResolver,\n  entityPrefix: KindEntity,\n): ProjectionPlan {\n  const projectedKinds = new Map<string, KindProjectionPlan>();\n  const fullKinds: string[] = [];\n\n  for (const kind of kinds) {\n    const selection = projectionMap?.[kind];\n    if (selection === undefined) {\n      fullKinds.push(kind);\n      continue;\n    }\n\n    projectedKinds.set(\n      kind,\n      buildKindProjectionPlan(kind, selection, resolveFieldType, entityPrefix),\n    );\n  }\n\n  return { fullKinds, projectedKinds };\n}\n\nfunction buildKindProjectionPlan(\n  kind: string,\n  selection: readonly string[],\n  resolveFieldType: FieldTypeResolver,\n  entityPrefix: KindEntity,\n): KindProjectionPlan {\n  const propertyFields = new Map<string, ProjectionPropertyFieldPlan>();\n  let includeMeta = false;\n\n  for (const field of selection) {\n    if (field === \"meta\") {\n      includeMeta = true;\n      continue;\n    }\n\n    validateProjectionField(field, entityPrefix, kind);\n\n    if (!propertyFields.has(field)) {\n      propertyFields.set(field, {\n        field,\n        outputName: projectionAlias(entityPrefix, kind, field),\n        typeInfo: resolveFieldType(kind, field),\n      });\n    }\n  }\n\n  return {\n    includeMeta,\n    propertyFields: [...propertyFields.values()],\n  };\n}\n\nfunction getIncludedNodeKinds<G extends GraphDef>(\n  graph: G,\n  includeKinds: readonly NodeKinds<G>[] | undefined,\n): readonly string[] {\n  if (includeKinds === undefined || includeKinds.length === 0) {\n    return Object.keys(graph.nodes);\n  }\n\n  return dedupeStrings(includeKinds);\n}\n\nfunction dedupeStrings(values: readonly string[]): readonly string[] {\n  return [...new Set(values)];\n}\n\n// ============================================================\n// SQL Generation\n// ============================================================\n\nfunction buildIncludedIdsCte(ctx: SubgraphContext): SQL {\n  const filters: SQL[] = [];\n\n  if (ctx.includeKinds !== undefined && ctx.includeKinds.length > 0) {\n    filters.push(compileKindFilter(sql.raw(\"kind\"), ctx.includeKinds));\n  }\n\n  if (ctx.excludeRoot) {\n    filters.push(sql`id != ${ctx.rootId}`);\n  }\n\n  const whereClause =\n    filters.length > 0 ? sql` WHERE ${sql.join(filters, sql` AND `)}` : sql``;\n\n  return sql`, included_ids AS (SELECT DISTINCT id FROM reachable${whereClause})`;\n}\n\nasync function fetchSubgraphNodes(\n  ctx: SubgraphContext,\n  reachableCte: SQL,\n  includedIdsCte: SQL,\n  projectionPlan: ProjectionPlan,\n): Promise<SubgraphNodeFetchRow[]> {\n  const columns: SQL[] = [\n    sql`n.kind`,\n    sql`n.id`,\n    buildFullPropsColumn(\"n\", projectionPlan),\n    ...buildMetadataColumns(\"n\", projectionPlan, [\n      \"version\",\n      \"valid_from\",\n      \"valid_to\",\n      \"created_at\",\n      \"updated_at\",\n      \"deleted_at\",\n    ]),\n    ...buildProjectedPropertyColumns(\"n\", projectionPlan, ctx.dialect),\n  ];\n\n  const query = sql`${reachableCte}${includedIdsCte} SELECT ${sql.join(columns, sql`, `)} FROM ${ctx.schema.nodesTable} n WHERE n.graph_id = ${ctx.graphId} AND n.id IN (SELECT id FROM included_ids)`;\n\n  return ctx.backend.execute<SubgraphNodeFetchRow>(query) as Promise<\n    SubgraphNodeFetchRow[]\n  >;\n}\n\nasync function fetchSubgraphEdges(\n  ctx: SubgraphContext,\n  reachableCte: SQL,\n  includedIdsCte: SQL,\n  projectionPlan: ProjectionPlan,\n): Promise<SubgraphEdgeFetchRow[]> {\n  const edgeKindFilter = compileKindFilter(sql.raw(\"e.kind\"), ctx.edgeKinds);\n  const edgeTemporalFilter = compileTemporalFilter({\n    mode: ctx.temporalMode,\n    asOf: ctx.asOf,\n    tableAlias: \"e\",\n    currentTimestamp: ctx.dialect.currentTimestamp(),\n  });\n  const columns: SQL[] = [\n    sql`e.id`,\n    sql`e.kind`,\n    sql`e.from_kind`,\n    sql`e.from_id`,\n    sql`e.to_kind`,\n    sql`e.to_id`,\n    buildFullPropsColumn(\"e\", projectionPlan),\n    ...buildMetadataColumns(\"e\", projectionPlan, [\n      \"valid_from\",\n      \"valid_to\",\n      \"created_at\",\n      \"updated_at\",\n      \"deleted_at\",\n    ]),\n    ...buildProjectedPropertyColumns(\"e\", projectionPlan, ctx.dialect),\n  ];\n\n  const query = sql`${reachableCte}${includedIdsCte} SELECT ${sql.join(columns, sql`, `)} FROM ${ctx.schema.edgesTable} e WHERE e.graph_id = ${ctx.graphId} AND ${edgeKindFilter} AND ${edgeTemporalFilter} AND e.from_id IN (SELECT id FROM included_ids) AND e.to_id IN (SELECT id FROM included_ids)`;\n\n  return ctx.backend.execute<SubgraphEdgeFetchRow>(query) as Promise<\n    SubgraphEdgeFetchRow[]\n  >;\n}\n\nfunction buildMetadataColumns(\n  alias: \"n\" | \"e\",\n  plan: ProjectionPlan,\n  columns: readonly string[],\n): readonly SQL[] {\n  if (plan.projectedKinds.size === 0) {\n    return columns.map((col) => sql`${sql.raw(`${alias}.${col}`)}`);\n  }\n\n  const metaKinds: string[] = [...plan.fullKinds];\n  for (const [kind, kindPlan] of plan.projectedKinds) {\n    if (kindPlan.includeMeta) metaKinds.push(kind);\n  }\n\n  if (metaKinds.length === 0) {\n    return columns.map((col) => sql`NULL AS ${sql.raw(col)}`);\n  }\n\n  // All kinds need meta — no CASE needed\n  if (metaKinds.length === plan.fullKinds.length + plan.projectedKinds.size) {\n    return columns.map((col) => sql`${sql.raw(`${alias}.${col}`)}`);\n  }\n\n  const filter = compileKindFilter(sql.raw(`${alias}.kind`), metaKinds);\n  return columns.map(\n    (col) =>\n      sql`CASE WHEN ${filter} THEN ${sql.raw(`${alias}.${col}`)} ELSE NULL END AS ${sql.raw(col)}`,\n  );\n}\n\nfunction buildFullPropsColumn(alias: \"n\" | \"e\", plan: ProjectionPlan): SQL {\n  if (plan.projectedKinds.size === 0) {\n    return sql`${sql.raw(`${alias}.props`)} AS props`;\n  }\n\n  if (plan.fullKinds.length === 0) {\n    return sql`NULL AS props`;\n  }\n\n  const filter = compileKindFilter(sql.raw(`${alias}.kind`), plan.fullKinds);\n  return sql`CASE WHEN ${filter} THEN ${sql.raw(`${alias}.props`)} ELSE NULL END AS props`;\n}\n\nfunction buildProjectedPropertyColumns(\n  alias: \"n\" | \"e\",\n  plan: ProjectionPlan,\n  dialect: DialectAdapter,\n): readonly SQL[] {\n  const columns: SQL[] = [];\n\n  for (const [kind, kindPlan] of plan.projectedKinds.entries()) {\n    for (const fieldPlan of kindPlan.propertyFields) {\n      const extracted = compileTypedJsonExtract({\n        column: sql.raw(`${alias}.props`),\n        dialect,\n        pointer: jsonPointer([fieldPlan.field]),\n        valueType: fieldPlan.typeInfo?.valueType,\n      });\n\n      columns.push(\n        sql`CASE WHEN ${sql.raw(alias)}.kind = ${kind} THEN ${extracted} ELSE NULL END AS ${quoteIdentifier(fieldPlan.outputName)}`,\n      );\n    }\n  }\n\n  return columns;\n}\n\n// ============================================================\n// Adjacency Index Builder\n// ============================================================\n\nfunction insertAdjacencyEntry(\n  index: Map<string, Map<string, Edge[]>>,\n  nodeId: string,\n  edgeKind: string,\n  edge: Edge,\n): void {\n  let kindMap = index.get(nodeId);\n  if (kindMap === undefined) {\n    kindMap = new Map();\n    index.set(nodeId, kindMap);\n  }\n  const edges = kindMap.get(edgeKind);\n  if (edges === undefined) {\n    kindMap.set(edgeKind, [edge]);\n  } else {\n    edges.push(edge);\n  }\n}\n\n// ============================================================\n// Result Mapping\n// ============================================================\n\nfunction applyProjectedFields(\n  target: Record<string, unknown>,\n  row: Readonly<Record<string, unknown>>,\n  kindPlan: KindProjectionPlan,\n): void {\n  for (const fieldPlan of kindPlan.propertyFields) {\n    target[fieldPlan.field] = decodeSelectedValue(\n      row[fieldPlan.outputName],\n      fieldPlan.typeInfo,\n    );\n  }\n}\n\nfunction mapSubgraphNodeRow(\n  row: SubgraphNodeFetchRow,\n  projectionPlan: ProjectionPlan,\n): Node {\n  const kindPlan = projectionPlan.projectedKinds.get(row.kind);\n  if (kindPlan === undefined) {\n    return rowToNode({\n      ...row,\n      props: normalizeProps(row.props),\n    });\n  }\n\n  const projectedNode: Record<string, unknown> = {\n    kind: row.kind,\n    id: row.id,\n  };\n\n  if (kindPlan.includeMeta) {\n    projectedNode.meta = rowToNodeMeta(row);\n  }\n\n  applyProjectedFields(projectedNode, row, kindPlan);\n  return projectedNode as Node;\n}\n\nfunction mapSubgraphEdgeRow(\n  row: SubgraphEdgeFetchRow,\n  projectionPlan: ProjectionPlan,\n): Edge {\n  const kindPlan = projectionPlan.projectedKinds.get(row.kind);\n  if (kindPlan === undefined) {\n    return rowToEdge({\n      ...row,\n      props: normalizeProps(row.props),\n    });\n  }\n\n  const projectedEdge: Record<string, unknown> = {\n    id: row.id,\n    kind: row.kind,\n    fromKind: row.from_kind,\n    fromId: row.from_id,\n    toKind: row.to_kind,\n    toId: row.to_id,\n  };\n\n  if (kindPlan.includeMeta) {\n    projectedEdge.meta = rowToEdgeMeta(row);\n  }\n\n  applyProjectedFields(projectedEdge, row, kindPlan);\n  return projectedEdge as Edge;\n}\n","/**\n * Set Operation Compilation\n *\n * Compiles UNION, INTERSECT, and EXCEPT operations to SQL.\n *\n * Both dialects compile each leaf with the full query compiler and combine\n * the results with the requested operator. The only dialect-specific concern\n * is how each operand is wrapped so the compound statement stays valid:\n *\n * - PostgreSQL allows a complete SELECT (including its own WITH clause) to be\n *   parenthesized as a compound operand: `(SELECT ...) UNION (SELECT ...)`.\n * - SQLite forbids parentheses around compound operands, but it does allow a\n *   `WITH` clause inside a FROM-subquery, so each operand is wrapped as\n *   `SELECT * FROM (SELECT ...)`. This keeps every leaf's CTEs (traversals,\n *   vector/fulltext joins, recursive expansions) scoped to its own subquery\n *   and lets per-leaf ORDER BY/LIMIT/OFFSET live inside the wrap.\n *\n * Nested set operations are wrapped the same way, which preserves the AST's\n * grouping regardless of the dialect's native compound-operator associativity.\n */\nimport { type SQL, sql } from \"drizzle-orm\";\n\nimport {\n  CompilerInvariantError,\n  UnsupportedPredicateError,\n} from \"../../errors\";\nimport type { SetOperationType } from \"../ast\";\nimport {\n  type ComposableQuery,\n  type FieldRef,\n  type ProjectedField,\n  type Projection,\n  type QueryAst,\n  type SetOperation,\n} from \"../ast\";\nimport { type DialectAdapter } from \"../dialect/types\";\nimport { type VectorStrategy } from \"../dialect/vector-strategy\";\nimport { type JsonPointer, jsonPointer } from \"../json-pointer\";\nimport { emitSetOperationQuerySql } from \"./emitter\";\nimport { runCompilerPass } from \"./passes\";\nimport { type LogicalPlan, lowerSetOperationToLogicalPlan } from \"./plan\";\n\n/**\n * Type for the query compiler function.\n */\nexport type QueryCompilerFunction = (ast: QueryAst, graphId: string) => SQL;\n\n/**\n * Operator mapping for set operations.\n */\nconst OPERATOR_MAP: Record<SetOperationType, string> = {\n  union: \"UNION\",\n  unionAll: \"UNION ALL\",\n  intersect: \"INTERSECT\",\n  except: \"EXCEPT\",\n};\n\ntype SetOperationPassState = Readonly<{\n  dialect: DialectAdapter;\n  graphId: string;\n  logicalPlan: LogicalPlan | undefined;\n  op: SetOperation;\n}>;\n\nfunction runSetOperationPassPipeline(\n  op: SetOperation,\n  graphId: string,\n  dialect: DialectAdapter,\n  vectorStrategy: VectorStrategy | undefined,\n): SetOperationPassState {\n  let state: SetOperationPassState = {\n    dialect,\n    graphId,\n    logicalPlan: undefined,\n    op,\n  };\n\n  const logicalPlanPass = runCompilerPass(state, {\n    name: \"logical_plan\",\n    execute(currentState): LogicalPlan {\n      return lowerSetOperationToLogicalPlan({\n        dialect: currentState.dialect.name,\n        graphId: currentState.graphId,\n        op: currentState.op,\n        ...(vectorStrategy === undefined ? {} : { vectorStrategy }),\n      });\n    },\n    update(currentState, logicalPlan): SetOperationPassState {\n      return {\n        ...currentState,\n        logicalPlan,\n      };\n    },\n  });\n  state = logicalPlanPass.state;\n\n  return state;\n}\n\n// ============================================================\n// Main Entry Point\n// ============================================================\n\n/**\n * Compiles a set operation to SQL.\n *\n * Each leaf is compiled by the full query compiler, so set operations support\n * exactly the same query features as standalone queries (traversals, EXISTS/IN\n * subqueries, vector/fulltext predicates, GROUP BY/HAVING, and per-leaf\n * ORDER BY/LIMIT/OFFSET) on every dialect.\n *\n * @param op - The set operation AST\n * @param graphId - The graph ID\n * @param dialect - The dialect adapter\n * @param compileQuery - Function to compile regular (leaf) queries\n * @param vectorStrategy - The backend-configured vector strategy, if any, used\n *   to validate leaf vector predicates against the strategy's metric set\n * @returns SQL for the set operation\n */\nexport function compileSetOperation(\n  op: SetOperation,\n  graphId: string,\n  dialect: DialectAdapter,\n  compileQuery: QueryCompilerFunction,\n  vectorStrategy?: VectorStrategy,\n): SQL {\n  const passState = runSetOperationPassPipeline(\n    op,\n    graphId,\n    dialect,\n    vectorStrategy,\n  );\n  const { logicalPlan } = passState;\n  if (logicalPlan === undefined) {\n    throw new CompilerInvariantError(\n      \"Logical plan pass did not initialize plan state\",\n    );\n  }\n\n  const coreSql = compileSetOperationCore(op, graphId, compileQuery, dialect);\n\n  const suffixClauses = buildSetOperationSuffixClauses(op, dialect);\n  return emitSetOperationQuerySql({\n    baseQuery: coreSql,\n    logicalPlan,\n    ...(suffixClauses.length === 0 ? {} : { suffixClauses }),\n  });\n}\n\n/**\n * Compiles a set operation node into a compound SELECT by wrapping each side\n * with the dialect's operand wrapper and joining them with the operator.\n */\nfunction compileSetOperationCore(\n  op: SetOperation,\n  graphId: string,\n  compileQuery: QueryCompilerFunction,\n  dialect: DialectAdapter,\n): SQL {\n  const left = compileComposableQuery(op.left, graphId, compileQuery, dialect);\n  const right = compileComposableQuery(\n    op.right,\n    graphId,\n    compileQuery,\n    dialect,\n  );\n\n  const opSql = sql.raw(OPERATOR_MAP[op.operator]);\n\n  return sql`${dialect.wrapSetOperationOperand(left)} ${opSql} ${dialect.wrapSetOperationOperand(right)}`;\n}\n\n/**\n * Compiles a composable query operand. Leaves are compiled by the full query\n * compiler; nested set operations recurse into a complete compound SELECT\n * (including their own ORDER BY/LIMIT/OFFSET) before the parent wraps them.\n */\nfunction compileComposableQuery(\n  query: ComposableQuery,\n  graphId: string,\n  compileQuery: QueryCompilerFunction,\n  dialect: DialectAdapter,\n): SQL {\n  if (\"__type\" in query) {\n    return compileSetOperationCompound(query, graphId, compileQuery, dialect);\n  }\n  return compileQuery(query, graphId);\n}\n\n/**\n * Compiles a set operation into a complete compound SELECT, including its own\n * ORDER BY/LIMIT/OFFSET suffix clauses. Used for nested operands: a nested\n * compound carries suffix clauses that belong inside the operand, not on the\n * outer statement. The top-level entry (compileSetOperation) layers the\n * logical-plan emitter invariant on top of these same core + suffix clauses.\n */\nfunction compileSetOperationCompound(\n  op: SetOperation,\n  graphId: string,\n  compileQuery: QueryCompilerFunction,\n  dialect: DialectAdapter,\n): SQL {\n  const core = compileSetOperationCore(op, graphId, compileQuery, dialect);\n  const suffixClauses = buildSetOperationSuffixClauses(op, dialect);\n  if (suffixClauses.length === 0) return core;\n  return sql.join([core, ...suffixClauses], sql` `);\n}\n\n// ============================================================\n// Suffix Clauses (ORDER BY / LIMIT / OFFSET)\n// ============================================================\n\n/**\n * Gets the leftmost leaf's projection from a set operation.\n * The leftmost leaf defines the output column names for the compound query.\n */\nfunction getLeftmostProjection(op: SetOperation): Projection {\n  let current: ComposableQuery = op.left;\n  while (\"__type\" in current) {\n    // current is a SetOperation, traverse left\n    current = current.left;\n  }\n  // current is now a QueryAst (the leftmost leaf)\n  return current.projection;\n}\n\n/**\n * Normalizes a FieldRef to a canonical key for comparison.\n *\n * Handles equivalent representations:\n * - path: [\"props\", \"name\"] (no jsonPointer) → \"alias:props:/name\"\n * - path: [\"props\"], jsonPointer: \"/name\" → \"alias:props:/name\"\n *\n * This matches the normalization logic in compileFieldValue/getFieldPointer.\n */\nfunction normalizeFieldRefKey(field: FieldRef): string {\n  // Derive JSON pointer from path if not explicitly set (same logic as predicates.ts getFieldPointer)\n  let pointer: JsonPointer | undefined = field.jsonPointer;\n  if (\n    pointer === undefined &&\n    field.path.length > 1 &&\n    field.path[0] === \"props\"\n  ) {\n    pointer = jsonPointer(field.path.slice(1));\n  }\n\n  // Normalize base path: for JSON fields, always use [\"props\"]\n  const basePath =\n    field.path.length > 0 && field.path[0] === \"props\" ?\n      \"props\"\n    : field.path.join(\".\");\n\n  return `${field.alias}:${basePath}:${pointer ?? \"\"}`;\n}\n\n/**\n * Matches a FieldRef from ORDER BY to a ProjectedField in the projection.\n * Returns the matching ProjectedField or undefined if no match.\n *\n * Uses normalized keys to handle equivalent field representations.\n */\nfunction matchFieldToProjection(\n  field: FieldRef,\n  projection: Projection,\n): ProjectedField | undefined {\n  const targetKey = normalizeFieldRefKey(field);\n\n  for (const projected of projection.fields) {\n    const source = projected.source;\n\n    // Only match against FieldRef sources (not aggregates)\n    if (!(\"__type\" in source) || source.__type !== \"field_ref\") continue;\n\n    // Compare normalized keys\n    if (normalizeFieldRefKey(source) === targetKey) {\n      return projected;\n    }\n  }\n  return undefined;\n}\n\n/**\n * Builds ORDER BY, LIMIT, OFFSET clauses for set operations.\n *\n * For set operations, ORDER BY must reference output column names from\n * the compound result, not internal CTE columns. This function:\n * 1. Maps each ORDER BY field to its output name from the leftmost projection\n * 2. Uses IS NULL emulation for consistent NULLS FIRST/LAST across dialects\n * 3. Throws a descriptive error if an ORDER BY field isn't in the projection\n */\nfunction buildSetOperationSuffixClauses(\n  op: SetOperation,\n  dialect: DialectAdapter,\n): SQL[] {\n  const clauses: SQL[] = [];\n\n  // Handle ORDER BY if present\n  if (op.orderBy && op.orderBy.length > 0) {\n    const projection = getLeftmostProjection(op);\n\n    // Check for SELECT * (empty projection) - can't order by named columns\n    if (projection.fields.length === 0) {\n      throw new UnsupportedPredicateError(\n        \"Set operation ORDER BY requires explicit field projection. \" +\n          \"SELECT * does not provide stable output column names for ordering. \" +\n          \"Use .select() to specify which fields to project.\",\n      );\n    }\n\n    const orderParts: SQL[] = [];\n\n    for (const orderSpec of op.orderBy) {\n      const projected = matchFieldToProjection(orderSpec.field, projection);\n\n      if (!projected) {\n        // Build a descriptive error message\n        const fieldDesc =\n          orderSpec.field.jsonPointer ?\n            `${orderSpec.field.alias}.props${orderSpec.field.jsonPointer}`\n          : `${orderSpec.field.alias}.${orderSpec.field.path.join(\".\")}`;\n        const availableFields = projection.fields\n          .map((f) => f.outputName)\n          .join(\", \");\n        throw new UnsupportedPredicateError(\n          `Set operation ORDER BY field \"${fieldDesc}\" is not in the projection. ` +\n            `ORDER BY for UNION/INTERSECT/EXCEPT must reference projected columns. ` +\n            `Available columns: ${availableFields}`,\n        );\n      }\n\n      // Use output column name with proper quoting\n      const columnRef = sql.raw(dialect.quoteIdentifier(projected.outputName));\n      const dir = sql.raw(orderSpec.direction.toUpperCase());\n\n      // Handle nulls with IS NULL emulation for cross-dialect consistency\n      // Default: ASC → NULLS LAST, DESC → NULLS FIRST\n      const nulls =\n        orderSpec.nulls ?? (orderSpec.direction === \"asc\" ? \"last\" : \"first\");\n      const nullsDir = sql.raw(nulls === \"first\" ? \"DESC\" : \"ASC\");\n\n      // Emulate NULLS FIRST/LAST: (col IS NULL) ASC/DESC, col DIR\n      orderParts.push(\n        sql`(${columnRef} IS NULL) ${nullsDir}`,\n        sql`${columnRef} ${dir}`,\n      );\n    }\n\n    clauses.push(sql`ORDER BY ${sql.join(orderParts, sql`, `)}`);\n  }\n\n  // Handle LIMIT\n  if (op.limit !== undefined) {\n    clauses.push(sql`LIMIT ${op.limit}`);\n  }\n\n  // Handle OFFSET\n  if (op.offset !== undefined) {\n    clauses.push(sql`OFFSET ${op.offset}`);\n  }\n\n  return clauses;\n}\n","import type {\n  FulltextMatchPredicate,\n  HybridFusionOptions,\n  PredicateExpression,\n  QueryAst,\n  VectorSimilarityPredicate,\n} from \"../ast\";\nimport { type DialectAdapter } from \"../dialect/types\";\nimport {\n  createTemporalFilterPass,\n  resolveFulltextAwareLimit,\n  resolveVectorAwareLimit,\n  runCompilerPass,\n  runFulltextPredicatePass,\n  runFusionConfigPass,\n  runVectorPredicatePass,\n  type TemporalFilterPass,\n} from \"./passes\";\nimport { type LogicalPlan, lowerStandardQueryToLogicalPlan } from \"./plan\";\nimport {\n  buildPredicateIndex,\n  getPredicatesForAlias,\n  type PredicateIndex,\n} from \"./predicate-utils\";\nimport { type PredicateCompilerContext } from \"./predicates\";\nimport {\n  addRequiredColumn,\n  isIdFieldRef,\n  markFieldRefAsRequired,\n  markSelectiveFieldAsRequired,\n  type RequiredColumnsByAlias,\n} from \"./utils\";\n\n/**\n * Heuristics for pushing LIMIT into traversal CTEs to cap intermediate row counts.\n * - 8x multiplier accounts for edge fan-out (each node may connect to multiple edges).\n * - 10K cap prevents runaway memory allocation for large intermediate result sets.\n */\nconst TRAVERSAL_LIMIT_PUSHDOWN_MULTIPLIER = 8;\nconst TRAVERSAL_LIMIT_PUSHDOWN_MAX = 10_000;\n\nfunction isColumnPruningEnabled(ast: QueryAst): boolean {\n  if (ast.selectiveFields && ast.selectiveFields.length > 0) {\n    return true;\n  }\n  if (ast.groupBy || ast.having) {\n    return true;\n  }\n  return ast.projection.fields.some(\n    (field) => field.source.__type === \"aggregate\",\n  );\n}\n\nfunction markPredicateFieldsAsRequired(\n  requiredColumnsByAlias: Map<string, Set<string>>,\n  expression: PredicateExpression,\n): void {\n  switch (expression.__type) {\n    case \"comparison\": {\n      markFieldRefAsRequired(requiredColumnsByAlias, expression.left);\n      return;\n    }\n    case \"string_op\":\n    case \"null_check\":\n    case \"between\":\n    case \"array_op\":\n    case \"object_op\": {\n      markFieldRefAsRequired(requiredColumnsByAlias, expression.field);\n      return;\n    }\n    case \"and\":\n    case \"or\": {\n      for (const predicate of expression.predicates) {\n        markPredicateFieldsAsRequired(requiredColumnsByAlias, predicate);\n      }\n      return;\n    }\n    case \"not\": {\n      markPredicateFieldsAsRequired(\n        requiredColumnsByAlias,\n        expression.predicate,\n      );\n      return;\n    }\n    case \"aggregate_comparison\": {\n      markFieldRefAsRequired(\n        requiredColumnsByAlias,\n        expression.aggregate.field,\n      );\n      return;\n    }\n    case \"in_subquery\": {\n      markFieldRefAsRequired(requiredColumnsByAlias, expression.field);\n      return;\n    }\n    case \"vector_similarity\": {\n      markFieldRefAsRequired(requiredColumnsByAlias, expression.field);\n      return;\n    }\n    case \"fulltext_match\": {\n      markFieldRefAsRequired(requiredColumnsByAlias, expression.field);\n      return;\n    }\n    case \"exists\": {\n      return;\n    }\n  }\n}\n\nfunction collectRequiredColumnsByAlias(ast: QueryAst): RequiredColumnsByAlias {\n  const requiredColumnsByAlias = new Map<string, Set<string>>();\n\n  addRequiredColumn(requiredColumnsByAlias, ast.start.alias, \"id\");\n  for (const traversal of ast.traversals) {\n    addRequiredColumn(requiredColumnsByAlias, traversal.nodeAlias, \"id\");\n  }\n\n  if (ast.selectiveFields && ast.selectiveFields.length > 0) {\n    for (const field of ast.selectiveFields) {\n      markSelectiveFieldAsRequired(requiredColumnsByAlias, field);\n    }\n  } else {\n    for (const projectedField of ast.projection.fields) {\n      const source = projectedField.source;\n      if (source.__type === \"field_ref\") {\n        markFieldRefAsRequired(requiredColumnsByAlias, source);\n      } else {\n        addRequiredColumn(requiredColumnsByAlias, source.field.alias, \"id\");\n        markFieldRefAsRequired(requiredColumnsByAlias, source.field);\n      }\n    }\n  }\n\n  if (ast.groupBy) {\n    for (const field of ast.groupBy.fields) {\n      markFieldRefAsRequired(requiredColumnsByAlias, field);\n    }\n  }\n\n  if (ast.orderBy) {\n    for (const orderSpec of ast.orderBy) {\n      markFieldRefAsRequired(requiredColumnsByAlias, orderSpec.field);\n    }\n  }\n\n  if (ast.having) {\n    markPredicateFieldsAsRequired(requiredColumnsByAlias, ast.having);\n  }\n\n  for (const predicate of ast.predicates) {\n    markPredicateFieldsAsRequired(requiredColumnsByAlias, predicate.expression);\n  }\n\n  return requiredColumnsByAlias;\n}\n\nfunction hasIdEqualityPredicate(\n  expression: PredicateExpression,\n  alias: string,\n): boolean {\n  switch (expression.__type) {\n    case \"comparison\": {\n      return (\n        expression.op === \"eq\" &&\n        expression.left.alias === alias &&\n        isIdFieldRef(expression.left)\n      );\n    }\n    case \"and\": {\n      return expression.predicates.some((predicate) =>\n        hasIdEqualityPredicate(predicate, alias),\n      );\n    }\n    case \"or\":\n    case \"not\":\n    case \"string_op\":\n    case \"null_check\":\n    case \"between\":\n    case \"array_op\":\n    case \"object_op\":\n    case \"aggregate_comparison\":\n    case \"exists\":\n    case \"in_subquery\":\n    case \"vector_similarity\":\n    case \"fulltext_match\": {\n      return false;\n    }\n  }\n}\n\nfunction isStartAliasBoundToSingleId(\n  ast: QueryAst,\n  predicateIndex: PredicateIndex,\n): boolean {\n  return getPredicatesForAlias(predicateIndex, ast.start.alias, \"node\").some(\n    (predicate) =>\n      hasIdEqualityPredicate(predicate.expression, ast.start.alias),\n  );\n}\n\nfunction resolveTraversalCteLimit(\n  ast: QueryAst,\n  predicateIndex: PredicateIndex,\n): number | undefined {\n  if (ast.limit === undefined) {\n    return undefined;\n  }\n\n  if (ast.offset !== undefined) {\n    return undefined;\n  }\n\n  if (ast.limit <= 0) {\n    return 0;\n  }\n\n  if (ast.groupBy || ast.having) {\n    return undefined;\n  }\n\n  if (ast.orderBy && ast.orderBy.length > 0) {\n    return undefined;\n  }\n\n  if (ast.traversals.length < 2) {\n    return undefined;\n  }\n\n  if (ast.traversals.some((traversal) => traversal.optional)) {\n    return undefined;\n  }\n\n  if (!isStartAliasBoundToSingleId(ast, predicateIndex)) {\n    return undefined;\n  }\n\n  const pushdownLimit = Math.min(\n    ast.limit * TRAVERSAL_LIMIT_PUSHDOWN_MULTIPLIER,\n    TRAVERSAL_LIMIT_PUSHDOWN_MAX,\n  );\n\n  return Math.max(ast.limit, pushdownLimit);\n}\n\nfunction canCollapseSelectiveTraversalRowset(\n  ast: QueryAst,\n  vectorPredicate: VectorSimilarityPredicate | undefined,\n  fulltextPredicate: FulltextMatchPredicate | undefined,\n): boolean {\n  if (vectorPredicate !== undefined) {\n    return false;\n  }\n\n  if (fulltextPredicate !== undefined) {\n    return false;\n  }\n\n  if (ast.traversals.length === 0) {\n    return false;\n  }\n\n  if (ast.traversals.some((traversal) => traversal.optional)) {\n    return false;\n  }\n\n  let expectedJoinFromAlias = ast.start.alias;\n  for (const traversal of ast.traversals) {\n    if (traversal.joinFromAlias !== expectedJoinFromAlias) {\n      return false;\n    }\n    expectedJoinFromAlias = traversal.nodeAlias;\n  }\n\n  if (!ast.selectiveFields || ast.selectiveFields.length === 0) {\n    return false;\n  }\n\n  if (ast.groupBy || ast.having) {\n    return false;\n  }\n\n  if (\n    ast.projection.fields.some((field) => field.source.__type === \"aggregate\")\n  ) {\n    return false;\n  }\n\n  return true;\n}\n\nexport function shouldMaterializeTraversalCte(\n  dialect: DialectAdapter,\n  traversalCount: number,\n  traversalIndex: number,\n): boolean {\n  if (!dialect.capabilities.materializeIntermediateTraversalCtes) {\n    return false;\n  }\n\n  if (traversalCount <= 1) {\n    return false;\n  }\n\n  return traversalIndex < traversalCount - 1;\n}\n\ntype StandardQueryPassState = Readonly<{\n  ast: QueryAst;\n  collapsedTraversalCteAlias: string | undefined;\n  ctx: PredicateCompilerContext;\n  effectiveLimit: number | undefined;\n  fulltextPredicate: FulltextMatchPredicate | undefined;\n  fusion: HybridFusionOptions | undefined;\n  logicalPlan: LogicalPlan | undefined;\n  predicateIndex: PredicateIndex;\n  requiredColumnsByAlias: RequiredColumnsByAlias | undefined;\n  shouldCollapseSelectiveTraversalRowset: boolean;\n  temporalFilterPass: TemporalFilterPass | undefined;\n  traversalCteLimit: number | undefined;\n  vectorPredicate: VectorSimilarityPredicate | undefined;\n}>;\n\nexport function runStandardQueryPassPipeline(\n  ast: QueryAst,\n  graphId: string,\n  ctx: PredicateCompilerContext,\n): StandardQueryPassState {\n  let state: StandardQueryPassState = {\n    ast,\n    collapsedTraversalCteAlias: undefined,\n    ctx,\n    effectiveLimit: undefined,\n    fulltextPredicate: undefined,\n    fusion: undefined,\n    logicalPlan: undefined,\n    predicateIndex: buildPredicateIndex(ast),\n    requiredColumnsByAlias: undefined,\n    shouldCollapseSelectiveTraversalRowset: false,\n    temporalFilterPass: undefined,\n    traversalCteLimit: undefined,\n    vectorPredicate: undefined,\n  };\n\n  const vectorPass = runCompilerPass(state, {\n    name: \"vector_predicate\",\n    execute(currentState): VectorSimilarityPredicate | undefined {\n      return runVectorPredicatePass(\n        currentState.ast,\n        currentState.ctx.dialect,\n        currentState.ctx.vectorStrategy,\n      ).vectorPredicate;\n    },\n    update(currentState, vectorPredicate): StandardQueryPassState {\n      return {\n        ...currentState,\n        vectorPredicate,\n      };\n    },\n  });\n  state = vectorPass.state;\n\n  const fulltextPass = runCompilerPass(state, {\n    name: \"fulltext_predicate\",\n    execute(currentState): FulltextMatchPredicate | undefined {\n      return runFulltextPredicatePass(\n        currentState.ast,\n        currentState.ctx.dialect,\n      ).fulltextPredicate;\n    },\n    update(currentState, fulltextPredicate): StandardQueryPassState {\n      return {\n        ...currentState,\n        fulltextPredicate,\n      };\n    },\n  });\n  state = fulltextPass.state;\n\n  const fusionPass = runCompilerPass(state, {\n    name: \"fusion_config\",\n    execute(currentState): HybridFusionOptions | undefined {\n      return runFusionConfigPass(\n        currentState.ast,\n        currentState.vectorPredicate,\n        currentState.fulltextPredicate,\n      ).fusion;\n    },\n    update(currentState, fusion): StandardQueryPassState {\n      return {\n        ...currentState,\n        fusion,\n      };\n    },\n  });\n  state = fusionPass.state;\n\n  const temporalPass = runCompilerPass(state, {\n    name: \"temporal_filters\",\n    execute(currentState): TemporalFilterPass {\n      return createTemporalFilterPass(\n        currentState.ast,\n        currentState.ctx.dialect.currentTimestamp(),\n      );\n    },\n    update(currentState, temporalFilterPass): StandardQueryPassState {\n      return {\n        ...currentState,\n        temporalFilterPass,\n      };\n    },\n  });\n  state = temporalPass.state;\n\n  const columnPruningPass = runCompilerPass(state, {\n    name: \"column_pruning\",\n    execute(currentState): RequiredColumnsByAlias | undefined {\n      return isColumnPruningEnabled(currentState.ast) ?\n          collectRequiredColumnsByAlias(currentState.ast)\n        : undefined;\n    },\n    update(currentState, requiredColumnsByAlias): StandardQueryPassState {\n      return {\n        ...currentState,\n        requiredColumnsByAlias,\n      };\n    },\n  });\n  state = columnPruningPass.state;\n\n  const selectiveTraversalRowsetPass = runCompilerPass(state, {\n    name: \"selective_traversal_rowset\",\n    execute(currentState): Readonly<{\n      collapsedTraversalCteAlias: string | undefined;\n      shouldCollapseSelectiveTraversalRowset: boolean;\n    }> {\n      const shouldCollapseSelectiveTraversalRowset =\n        canCollapseSelectiveTraversalRowset(\n          currentState.ast,\n          currentState.vectorPredicate,\n          currentState.fulltextPredicate,\n        );\n      const lastTraversal = currentState.ast.traversals.at(-1);\n      const collapsedTraversalCteAlias =\n        shouldCollapseSelectiveTraversalRowset && lastTraversal !== undefined ?\n          `cte_${lastTraversal.nodeAlias}`\n        : undefined;\n\n      return {\n        collapsedTraversalCteAlias,\n        shouldCollapseSelectiveTraversalRowset,\n      };\n    },\n    update(\n      currentState,\n      { collapsedTraversalCteAlias, shouldCollapseSelectiveTraversalRowset },\n    ): StandardQueryPassState {\n      return {\n        ...currentState,\n        collapsedTraversalCteAlias,\n        shouldCollapseSelectiveTraversalRowset,\n      };\n    },\n  });\n  state = selectiveTraversalRowsetPass.state;\n\n  const traversalLimitPass = runCompilerPass(state, {\n    name: \"traversal_limit\",\n    execute(currentState): number | undefined {\n      return resolveTraversalCteLimit(\n        currentState.ast,\n        currentState.predicateIndex,\n      );\n    },\n    update(currentState, traversalCteLimit): StandardQueryPassState {\n      return {\n        ...currentState,\n        traversalCteLimit,\n      };\n    },\n  });\n  state = traversalLimitPass.state;\n\n  // Compute effectiveLimit once — used by both logical plan lowering and SQL LIMIT/OFFSET.\n  // Both vector and fulltext predicates carry their own LIMITs; the tightest wins.\n  state = {\n    ...state,\n    effectiveLimit: resolveFulltextAwareLimit(\n      resolveVectorAwareLimit(state.ast.limit, state.vectorPredicate),\n      state.fulltextPredicate,\n    ),\n  };\n\n  const logicalPlanPass = runCompilerPass(state, {\n    name: \"logical_plan\",\n    execute(currentState): LogicalPlan {\n      const loweringInput = {\n        ast: currentState.ast,\n        dialect: currentState.ctx.dialect.name,\n        graphId,\n      };\n\n      return lowerStandardQueryToLogicalPlan({\n        ...loweringInput,\n        ...(currentState.collapsedTraversalCteAlias === undefined ?\n          {}\n        : {\n            collapsedTraversalCteAlias: currentState.collapsedTraversalCteAlias,\n          }),\n        ...(currentState.effectiveLimit === undefined ?\n          {}\n        : { effectiveLimit: currentState.effectiveLimit }),\n        ...(currentState.vectorPredicate === undefined ?\n          {}\n        : { vectorPredicate: currentState.vectorPredicate }),\n        ...(currentState.fulltextPredicate === undefined ?\n          {}\n        : { fulltextPredicate: currentState.fulltextPredicate }),\n      });\n    },\n    update(currentState, logicalPlan): StandardQueryPassState {\n      return {\n        ...currentState,\n        logicalPlan,\n      };\n    },\n  });\n  state = logicalPlanPass.state;\n\n  return state;\n}\n","/**\n * Query Compiler Module\n *\n * Main entry point for compiling query ASTs to SQL.\n * Re-exports individual compiler modules and provides the main compile functions.\n */\n\n// Re-export sub-modules\nexport {\n  type LogicalPlan,\n  type LogicalPlanNode,\n  lowerRecursiveQueryToLogicalPlan,\n  lowerSetOperationToLogicalPlan,\n  lowerStandardQueryToLogicalPlan,\n} from \"./plan\";\nexport {\n  compileAggregateExpr,\n  compileFieldColumn,\n  compileFieldValue,\n  compilePredicateExpression,\n  type PredicateCompilerContext,\n} from \"./predicates\";\nexport {\n  compileVariableLengthQuery,\n  hasVariableLengthTraversal,\n  MAX_EXPLICIT_RECURSIVE_DEPTH,\n  MAX_RECURSIVE_DEPTH,\n} from \"./recursive\";\nexport {\n  createSqlSchema,\n  DEFAULT_SQL_SCHEMA,\n  type SqlSchema,\n  type SqlTableNames,\n} from \"./schema\";\nexport {\n  compileTemporalFilter,\n  extractTemporalOptions,\n  type TemporalFilterOptions,\n} from \"./temporal\";\n\n// Re-export dialect helpers and types\nexport { getDialect } from \"../dialect\";\nexport { type DialectAdapter, type SqlDialect } from \"../dialect/types\";\n\nimport { type SQL, sql } from \"drizzle-orm\";\n\nimport { CompilerInvariantError, ConfigurationError } from \"../../errors\";\nimport {\n  type AggregateExpr,\n  type FulltextMatchPredicate,\n  type HybridFusionOptions,\n  type QueryAst,\n  type SetOperation,\n  type VectorSimilarityPredicate,\n} from \"../ast\";\nimport { getDialect } from \"../dialect\";\nimport { type FulltextStrategy } from \"../dialect/fulltext-strategy\";\nimport {\n  type DialectAdapter,\n  type DialectStandardQueryStrategy,\n  type SqlDialect,\n} from \"../dialect/types\";\nimport { type VectorStrategy } from \"../dialect/vector-strategy\";\nimport { emitStandardQuerySql } from \"./emitter\";\nimport {\n  buildLimitOffsetClause,\n  buildStandardEmbeddingsCte,\n  buildStandardFromClause,\n  buildStandardFulltextCte,\n  buildStandardFulltextOrderBy,\n  buildStandardGroupBy,\n  buildStandardHaving,\n  buildStandardHybridCandidateCte,\n  buildStandardHybridRrfOrderBy,\n  buildStandardOrderBy,\n  buildStandardProjection,\n  buildStandardStartCte,\n  buildStandardTraversalCte,\n  buildStandardVectorOrderBy,\n} from \"./emitter\";\nimport { type TemporalFilterPass } from \"./passes\";\nimport { type LogicalPlan, type LogicalPlanNode } from \"./plan\";\nimport {\n  compileKindFilter,\n  compilePredicateClauses,\n  getHybridTargetAlias,\n  getNodeKindsForAlias,\n  getPredicatesForAlias,\n  type PredicateIndex,\n} from \"./predicate-utils\";\nimport { compileFieldValue, type PredicateCompilerContext } from \"./predicates\";\nimport {\n  compileVariableLengthQuery,\n  hasVariableLengthTraversal,\n} from \"./recursive\";\nimport {\n  DEFAULT_SQL_SCHEMA,\n  type SqlSchema,\n  type VectorSlotMap,\n} from \"./schema\";\nimport { compileSetOperation as compileSetOp } from \"./set-operations\";\nimport {\n  runStandardQueryPassPipeline,\n  shouldMaterializeTraversalCte,\n} from \"./standard-pass-pipeline\";\nimport {\n  isAggregateExpr,\n  isIdFieldRef,\n  quoteIdentifier,\n  type RequiredColumnsByAlias,\n} from \"./utils\";\n\n// ============================================================\n// Main Query Compiler\n// ============================================================\n\n/**\n * Options for query compilation.\n */\nexport type CompileQueryOptions = Readonly<{\n  /** SQL dialect (\"sqlite\" or \"postgres\"). Defaults to \"sqlite\". */\n  dialect?: SqlDialect | undefined;\n  /** SQL schema configuration for table names. Defaults to standard names. */\n  schema?: SqlSchema | undefined;\n  /**\n   * Fulltext strategy override. When set, overrides the dialect's\n   * default fulltext strategy for `$fulltext.matches()` compilation.\n   * Callers typically read this from `backend.fulltextStrategy` so a\n   * backend-declared strategy (e.g. ParadeDB) wins over the dialect\n   * default (tsvector).\n   */\n  fulltextStrategy?: FulltextStrategy | undefined;\n  /**\n   * Vector strategy override. When set, `field.similarTo(...)`\n   * predicates compile against the strategy's per-`(kind, field)`\n   * tables and distance expression. Callers read it from\n   * `backend.vectorStrategy` so a backend-declared strategy (pgvector,\n   * libsql-native, sqlite-vec) drives the per-field relevance scan.\n   */\n  vectorStrategy?: VectorStrategy | undefined;\n  /**\n   * Whether the active backend supports SQL window functions such as\n   * `ROW_NUMBER()`. Defaults to true for direct compiler callers.\n   */\n  windowFunctions?: boolean | undefined;\n  /**\n   * Declared embedding slots `(kind, fieldPath) -> descriptor` used by\n   * the `field.similarTo(...)` CTE to know which kinds in an alias\n   * declare the field. Callers build it from the graph's node schemas.\n   */\n  vectorSlots?: VectorSlotMap | undefined;\n}>;\n\n/**\n * Compiles a query AST to SQL.\n *\n * This is the main entry point for query compilation. It dispatches to\n * the appropriate compiler based on the query type (standard, recursive,\n * or set operation).\n *\n * @param ast - The query AST to compile\n * @param graphId - The graph ID for filtering\n * @param options - Compilation options (dialect, schema)\n * @returns Drizzle SQL object ready for execution\n *\n * @example\n * ```typescript\n * const ast = query.toAst();\n * const sql = compileQuery(ast, \"my_graph\", { dialect: \"postgres\" });\n * const results = await db.execute(sql);\n * ```\n *\n * @example\n * ```typescript\n * // With custom table names\n * const schema = createSqlSchema({ nodes: \"myapp_nodes\", edges: \"myapp_edges\" });\n * const sql = compileQuery(ast, \"my_graph\", { dialect: \"postgres\", schema });\n * ```\n */\nexport function compileQuery(\n  ast: QueryAst,\n  graphId: string,\n  options: CompileQueryOptions | SqlDialect = \"sqlite\",\n): SQL {\n  // Support legacy signature: compileQuery(ast, graphId, dialect)\n  const options_: CompileQueryOptions =\n    typeof options === \"string\" ? { dialect: options } : options;\n  const dialect = options_.dialect ?? \"sqlite\";\n  const schema = options_.schema ?? DEFAULT_SQL_SCHEMA;\n\n  const adapter = resolveDialectAdapter(dialect, options_.fulltextStrategy);\n  const ctx: PredicateCompilerContext = {\n    dialect: adapter,\n    schema,\n    compileQuery: (subAst, subGraphId) =>\n      compileQuery(subAst, subGraphId, propagateOptions(options_)),\n    ...(options_.vectorStrategy === undefined ?\n      {}\n    : { vectorStrategy: options_.vectorStrategy }),\n    windowFunctions: options_.windowFunctions ?? true,\n    ...(options_.vectorSlots === undefined ?\n      {}\n    : { vectorSlots: options_.vectorSlots }),\n  };\n\n  // Check for variable-length traversals\n  if (hasVariableLengthTraversal(ast)) {\n    const lowered = tryLowerSingleHopRecursiveTraversal(ast);\n    if (lowered !== undefined) {\n      return compileStandardQuery(lowered, graphId, ctx);\n    }\n    return compileVariableLengthQuery(ast, graphId, ctx);\n  }\n\n  // Standard query compilation\n  return compileStandardQuery(ast, graphId, ctx);\n}\n\nfunction tryLowerSingleHopRecursiveTraversal(\n  ast: QueryAst,\n): QueryAst | undefined {\n  if (ast.traversals.length !== 1) {\n    return undefined;\n  }\n\n  const traversal = ast.traversals[0]!;\n  const variableLength = traversal.variableLength;\n  if (!variableLength) {\n    return undefined;\n  }\n\n  if (variableLength.minDepth !== 1 || variableLength.maxDepth !== 1) {\n    return undefined;\n  }\n  if (\n    variableLength.pathAlias !== undefined ||\n    variableLength.depthAlias !== undefined\n  ) {\n    return undefined;\n  }\n\n  const { variableLength: _vl, ...nonRecursiveTraversal } = traversal;\n\n  return {\n    ...ast,\n    traversals: [nonRecursiveTraversal],\n  };\n}\n\n/**\n * Compiles a set operation (UNION/INTERSECT/EXCEPT) to SQL.\n *\n * @param op - The set operation AST\n * @param graphId - The graph ID for filtering\n * @param options - Compilation options (dialect, schema)\n * @returns Drizzle SQL object\n */\nexport function compileSetOperation(\n  op: SetOperation,\n  graphId: string,\n  options: CompileQueryOptions | SqlDialect = \"sqlite\",\n): SQL {\n  // Support legacy signature: compileSetOperation(op, graphId, dialect)\n  const options_: CompileQueryOptions =\n    typeof options === \"string\" ? { dialect: options } : options;\n  const dialect = options_.dialect ?? \"sqlite\";\n\n  const adapter = resolveDialectAdapter(dialect, options_.fulltextStrategy);\n  return compileSetOp(\n    op,\n    graphId,\n    adapter,\n    (ast, gid) => compileQuery(ast, gid, propagateOptions(options_)),\n    options_.vectorStrategy,\n  );\n}\n\n/**\n * Builds the dialect adapter the compiler actually runs against,\n * applying a caller-supplied fulltext strategy override on top of the\n * dialect default. Returns the unmodified adapter when the override is\n * absent or identical to the dialect default — shipped backends always\n * set `fulltextStrategy`, so this short-circuit keeps the common path\n * from allocating a fresh adapter on every compile.\n */\nfunction resolveDialectAdapter(\n  dialect: SqlDialect,\n  fulltextStrategy: FulltextStrategy | undefined,\n): DialectAdapter {\n  const baseAdapter = getDialect(dialect);\n  if (\n    fulltextStrategy === undefined ||\n    fulltextStrategy === baseAdapter.fulltext\n  ) {\n    return baseAdapter;\n  }\n  return { ...baseAdapter, fulltext: fulltextStrategy };\n}\n\n/** Forwards compile options into recursive sub-compile calls. */\nfunction propagateOptions(options_: CompileQueryOptions): CompileQueryOptions {\n  return {\n    dialect: options_.dialect ?? \"sqlite\",\n    ...(options_.schema === undefined ? {} : { schema: options_.schema }),\n    ...(options_.fulltextStrategy === undefined ?\n      {}\n    : { fulltextStrategy: options_.fulltextStrategy }),\n    ...(options_.vectorStrategy === undefined ?\n      {}\n    : { vectorStrategy: options_.vectorStrategy }),\n    windowFunctions: options_.windowFunctions ?? true,\n    ...(options_.vectorSlots === undefined ?\n      {}\n    : { vectorSlots: options_.vectorSlots }),\n  };\n}\n\n// ============================================================\n// Standard Query Compilation\n// ============================================================\n\ntype CountAggregateFastPathPlan = Readonly<{\n  traversal: QueryAst[\"traversals\"][number];\n  /** Aggregate references `traversal.nodeAlias` (count of live target nodes). */\n  requiresNodeCount: boolean;\n  /** countDistinct over `traversal.nodeAlias`. */\n  requiresNodeCountDistinct: boolean;\n  /** Aggregate references `traversal.edgeAlias` (count of live edges). */\n  requiresEdgeCount: boolean;\n  /** countDistinct over `traversal.edgeAlias`. */\n  requiresEdgeCountDistinct: boolean;\n}>;\n\nfunction resolveCountAggregateFastPath(\n  ast: QueryAst,\n): CountAggregateFastPathPlan | undefined {\n  if (ast.traversals.length !== 1) {\n    return undefined;\n  }\n\n  if (ast.groupBy?.fields.length !== 1) {\n    return undefined;\n  }\n\n  if (ast.having !== undefined) {\n    return undefined;\n  }\n\n  if (\n    ast.orderBy?.some((orderSpec) => orderSpec.field.alias !== ast.start.alias)\n  ) {\n    return undefined;\n  }\n\n  const traversal = ast.traversals[0]!;\n  if ((traversal.inverseEdgeKinds?.length ?? 0) > 0) {\n    return undefined;\n  }\n\n  const groupField = ast.groupBy.fields[0]!;\n  if (groupField.alias !== ast.start.alias || !isIdFieldRef(groupField)) {\n    return undefined;\n  }\n\n  let requiresNodeCount = false;\n  let requiresNodeCountDistinct = false;\n  let requiresEdgeCount = false;\n  let requiresEdgeCountDistinct = false;\n\n  for (const projectedField of ast.projection.fields) {\n    const source = projectedField.source;\n\n    if (!isAggregateExpr(source)) {\n      if (source.alias !== ast.start.alias) {\n        return undefined;\n      }\n      continue;\n    }\n\n    if (!isIdFieldRef(source.field)) {\n      return undefined;\n    }\n\n    const isNodeTarget = source.field.alias === traversal.nodeAlias;\n    const isEdgeTarget = source.field.alias === traversal.edgeAlias;\n    if (!isNodeTarget && !isEdgeTarget) {\n      return undefined;\n    }\n\n    if (source.function === \"count\") {\n      if (isNodeTarget) requiresNodeCount = true;\n      else requiresEdgeCount = true;\n      continue;\n    }\n\n    if (source.function === \"countDistinct\") {\n      if (isNodeTarget) requiresNodeCountDistinct = true;\n      else requiresEdgeCountDistinct = true;\n      continue;\n    }\n\n    return undefined;\n  }\n\n  if (\n    !requiresNodeCount &&\n    !requiresNodeCountDistinct &&\n    !requiresEdgeCount &&\n    !requiresEdgeCountDistinct\n  ) {\n    return undefined;\n  }\n\n  return {\n    traversal,\n    requiresNodeCount,\n    requiresNodeCountDistinct,\n    requiresEdgeCount,\n    requiresEdgeCountDistinct,\n  };\n}\n\nfunction compileCountAggregateFastPath(\n  ast: QueryAst,\n  graphId: string,\n  ctx: PredicateCompilerContext,\n  logicalPlan: LogicalPlan,\n  requiredColumnsByAlias: RequiredColumnsByAlias | undefined,\n  predicateIndex: PredicateIndex,\n  temporalFilterPass: TemporalFilterPass,\n): SQL | undefined {\n  const plan = resolveCountAggregateFastPath(ast);\n  if (!plan) {\n    return undefined;\n  }\n\n  const {\n    traversal,\n    requiresNodeCount,\n    requiresNodeCountDistinct,\n    requiresEdgeCount,\n    requiresEdgeCountDistinct,\n  } = plan;\n  const { dialect } = ctx;\n  const startAlias = ast.start.alias;\n  const previousAlias = traversal.joinFromAlias;\n  const previousAliasIdColumn = `${previousAlias}_id`;\n  const previousAliasKindColumn = `${previousAlias}_kind`;\n  const countCteAlias = `cte_${traversal.nodeAlias}_counts`;\n  const nodeCountColumn = `${traversal.nodeAlias}_count`;\n  const nodeCountDistinctColumn = `${traversal.nodeAlias}_count_distinct`;\n  const edgeCountColumn = `${traversal.edgeAlias}_count`;\n  const edgeCountDistinctColumn = `${traversal.edgeAlias}_count_distinct`;\n\n  const previousNodeKinds = getNodeKindsForAlias(ast, traversal.joinFromAlias);\n  const edgeKinds = [...new Set(traversal.edgeKinds)];\n  const nodeKinds = traversal.nodeKinds;\n\n  const edgeTemporalFilter = temporalFilterPass.forAlias(\"e\");\n  const nodeTemporalFilter = temporalFilterPass.forAlias(\"n\");\n\n  const nodePredicateContext: PredicateCompilerContext = {\n    ...ctx,\n    cteColumnPrefix: \"n\",\n  };\n  const nodePredicateClauses = compilePredicateClauses(\n    getPredicatesForAlias(predicateIndex, traversal.nodeAlias, \"node\"),\n    nodePredicateContext,\n  );\n\n  const edgePredicateContext: PredicateCompilerContext = {\n    ...ctx,\n    cteColumnPrefix: \"e\",\n  };\n  const edgePredicateClauses = compilePredicateClauses(\n    getPredicatesForAlias(predicateIndex, traversal.edgeAlias, \"edge\"),\n    edgePredicateContext,\n  );\n\n  const joinField = traversal.direction === \"out\" ? \"from_id\" : \"to_id\";\n  const targetField = traversal.direction === \"out\" ? \"to_id\" : \"from_id\";\n  const joinKindField = traversal.direction === \"out\" ? \"from_kind\" : \"to_kind\";\n  const targetKindField =\n    traversal.direction === \"out\" ? \"to_kind\" : \"from_kind\";\n\n  // The target-node join is only needed when an aggregate actually counts\n  // live target nodes. For edge-only counts (countEdges / countDistinctEdges)\n  // the edge row alone is sufficient: the edge's own deleted_at and valid_*\n  // columns already constrain \"live edge,\" and target-kind validation is\n  // enforced via the edge's to_kind filter (which the store's write path\n  // keeps consistent with the target node's kind at insert time).\n  const hasNodePredicates = nodePredicateClauses.length > 0;\n  const requiresNodeJoin =\n    requiresNodeCount || requiresNodeCountDistinct || hasNodePredicates;\n\n  // Join style depends on how the target-node join interacts with the\n  // aggregates:\n  //\n  // - INNER JOIN when the user applied a predicate to the target alias\n  //   (whereNode on the target). Predicates should constrain every\n  //   aggregate in the query — including countEdges — so they live in\n  //   WHERE and the JOIN filters edges whose targets fail to match.\n  //   With INNER JOIN, a group where every edge's target fails the\n  //   predicate produces no rows; GROUP BY omits it, and required\n  //   traversals correctly drop that start row.\n  //\n  // - LEFT JOIN when only temporal/deleted filters apply (no caller\n  //   predicates). This lets mixed aggregates differ: countEdges\n  //   counts all live edges (including edges to expired targets)\n  //   while count(target) only counts edges to live targets.\n  const useInnerJoin = hasNodePredicates;\n\n  const whereClauses = [\n    sql`e.graph_id = ${graphId}`,\n    compileKindFilter(sql.raw(\"e.kind\"), edgeKinds),\n    compileKindFilter(sql.raw(`e.${joinKindField}`), previousNodeKinds),\n    compileKindFilter(sql.raw(`e.${targetKindField}`), nodeKinds),\n    edgeTemporalFilter,\n    ...edgePredicateClauses,\n    // INNER JOIN mode: node-side filters in WHERE constrain every aggregate.\n    ...(requiresNodeJoin && useInnerJoin ?\n      [\n        compileKindFilter(sql.raw(\"n.kind\"), nodeKinds),\n        nodeTemporalFilter,\n        ...nodePredicateClauses,\n      ]\n    : []),\n  ];\n\n  const nodeJoinOnClauses =\n    requiresNodeJoin ?\n      useInnerJoin ?\n        // INNER JOIN: only the key conditions; filters live in WHERE.\n        [\n          sql`n.graph_id = e.graph_id`,\n          sql`n.id = e.${sql.raw(targetField)}`,\n          sql`n.kind = e.${sql.raw(targetKindField)}`,\n        ]\n        // LEFT JOIN: temporal/kind filters gate the join, so countEdges\n        // still sees the full edge set while count(target) excludes edges\n        // to expired targets (via COUNT ignoring NULLs).\n      : [\n          sql`n.graph_id = e.graph_id`,\n          sql`n.id = e.${sql.raw(targetField)}`,\n          sql`n.kind = e.${sql.raw(targetKindField)}`,\n          compileKindFilter(sql.raw(\"n.kind\"), nodeKinds),\n          nodeTemporalFilter,\n        ]\n    : [];\n\n  const aggregateColumns: SQL[] = [];\n  if (requiresNodeCount) {\n    aggregateColumns.push(sql`COUNT(n.id) AS ${sql.raw(nodeCountColumn)}`);\n  }\n  if (requiresNodeCountDistinct) {\n    aggregateColumns.push(\n      sql`COUNT(DISTINCT n.id) AS ${sql.raw(nodeCountDistinctColumn)}`,\n    );\n  }\n  if (requiresEdgeCount) {\n    aggregateColumns.push(sql`COUNT(e.id) AS ${sql.raw(edgeCountColumn)}`);\n  }\n  if (requiresEdgeCountDistinct) {\n    aggregateColumns.push(\n      sql`COUNT(DISTINCT e.id) AS ${sql.raw(edgeCountDistinctColumn)}`,\n    );\n  }\n\n  // LIMIT push-down: when the outer SELECT applies LIMIT/OFFSET that do not\n  // depend on aggregate results, we can reduce the start CTE to just the\n  // required rows before aggregation. This turns an O(|start|) GROUP BY\n  // into an O(limit) GROUP BY.\n  //\n  // Safe when:\n  //   - The traversal is optional (LEFT JOIN outer). For INNER JOIN we can't\n  //     push down without potentially dropping rows the original query would\n  //     have kept.\n  //   - No ORDER BY. ORDER BY over the full result requires the full result.\n  //     (The fast path already restricts ORDER BY to the start alias, but we\n  //     still need every row to sort correctly.)\n  //   - LIMIT is defined. OFFSET is carried with it.\n  const startCteLimit =\n    traversal.optional && ast.orderBy === undefined && ast.limit !== undefined ?\n      { limit: ast.limit, offset: ast.offset }\n    : undefined;\n\n  const startCte = buildStandardStartCte({\n    ast,\n    ctx,\n    graphId,\n    predicateIndex,\n    requiredColumnsByAlias,\n    temporalFilterPass,\n    ...(startCteLimit === undefined ? {} : { limitOffset: startCteLimit }),\n  });\n\n  const targetNodeJoinKeyword = useInnerJoin ? \"JOIN\" : \"LEFT JOIN\";\n  const targetNodeJoin =\n    requiresNodeJoin ?\n      sql`\n        ${sql.raw(targetNodeJoinKeyword)} ${ctx.schema.nodesTable} n ON ${sql.join(nodeJoinOnClauses, sql` AND `)}\n      `\n    : sql``;\n\n  const countCte = sql`\n    ${sql.raw(countCteAlias)} AS (\n      SELECT\n        cte_${sql.raw(previousAlias)}.${sql.raw(previousAliasIdColumn)} AS ${sql.raw(previousAliasIdColumn)},\n        cte_${sql.raw(previousAlias)}.${sql.raw(previousAliasKindColumn)} AS ${sql.raw(previousAliasKindColumn)},\n        ${sql.join(aggregateColumns, sql`, `)}\n      FROM cte_${sql.raw(previousAlias)}\n      JOIN ${ctx.schema.edgesTable} e ON cte_${sql.raw(previousAlias)}.${sql.raw(previousAliasIdColumn)} = e.${sql.raw(joinField)}\n        AND cte_${sql.raw(previousAlias)}.${sql.raw(previousAliasKindColumn)} = e.${sql.raw(joinKindField)}${targetNodeJoin}\n      WHERE ${sql.join(whereClauses, sql` AND `)}\n      GROUP BY\n        cte_${sql.raw(previousAlias)}.${sql.raw(previousAliasIdColumn)},\n        cte_${sql.raw(previousAlias)}.${sql.raw(previousAliasKindColumn)}\n    )\n  `;\n\n  function resolveCountColumn(source: AggregateExpr): string {\n    const isEdge = source.field.alias === traversal.edgeAlias;\n    if (source.function === \"countDistinct\") {\n      return isEdge ? edgeCountDistinctColumn : nodeCountDistinctColumn;\n    }\n    return isEdge ? edgeCountColumn : nodeCountColumn;\n  }\n\n  const projection = sql.join(\n    ast.projection.fields.map((projectedField) => {\n      const source = projectedField.source;\n\n      if (!isAggregateExpr(source)) {\n        const value = compileFieldValue(\n          source,\n          dialect,\n          source.valueType,\n          `cte_${source.alias}`,\n        );\n        return sql`${value} AS ${quoteIdentifier(projectedField.outputName)}`;\n      }\n\n      const projectedCountColumn = resolveCountColumn(source);\n      const countValue = sql`${sql.raw(countCteAlias)}.${sql.raw(projectedCountColumn)}`;\n      const aggregateValue =\n        traversal.optional ? sql`COALESCE(${countValue}, 0)` : countValue;\n\n      return sql`${aggregateValue} AS ${quoteIdentifier(projectedField.outputName)}`;\n    }),\n    sql`, `,\n  );\n\n  const joinType = traversal.optional ? \"LEFT JOIN\" : \"INNER JOIN\";\n  const fromClause = sql`\n    FROM cte_${sql.raw(startAlias)}\n    ${sql.raw(joinType)} ${sql.raw(countCteAlias)}\n      ON ${sql.raw(countCteAlias)}.${sql.raw(previousAliasIdColumn)} = cte_${sql.raw(previousAlias)}.${sql.raw(previousAliasIdColumn)}\n      AND ${sql.raw(countCteAlias)}.${sql.raw(previousAliasKindColumn)} = cte_${sql.raw(previousAlias)}.${sql.raw(previousAliasKindColumn)}\n  `;\n\n  const orderBy = buildStandardOrderBy({ ast, dialect });\n  // When the LIMIT/OFFSET was pushed into the start CTE, the outer SELECT\n  // must not re-apply it — the start CTE already produced exactly the\n  // requested page, and the outer LEFT JOIN preserves its cardinality.\n  // Re-applying would double-offset and produce an empty page. Rewrite\n  // the logical plan to match: the emitter asserts plan shape aligns\n  // with emitted SQL, so dropping the clause and leaving the plan's\n  // `limit_offset` node behind would trip an invariant.\n  const emittedLogicalPlan =\n    startCteLimit === undefined ? logicalPlan : (\n      stripLimitOffsetFromPlan(logicalPlan)\n    );\n  const limitOffset =\n    startCteLimit === undefined ?\n      buildLimitOffsetClause({ limit: ast.limit, offset: ast.offset })\n    : undefined;\n\n  return emitStandardQuerySql({\n    ctes: [startCte, countCte],\n    fromClause,\n    ...(orderBy === undefined ? {} : { orderBy }),\n    ...(limitOffset === undefined ? {} : { limitOffset }),\n    logicalPlan: emittedLogicalPlan,\n    projection,\n  });\n}\n\n/**\n * Returns a copy of the logical plan with every `limit_offset` node\n * elided. Used when the count aggregate fast path pushes LIMIT/OFFSET\n * into the start CTE — the outer SELECT then carries no LIMIT/OFFSET,\n * so the logical plan must not either or the emitter invariant check\n * will disagree with the emitted SQL.\n */\nfunction stripLimitOffsetFromPlan(plan: LogicalPlan): LogicalPlan {\n  return { ...plan, root: stripLimitOffsetFromPlanNode(plan.root) };\n}\n\nfunction stripLimitOffsetFromPlanNode(node: LogicalPlanNode): LogicalPlanNode {\n  if (node.op === \"limit_offset\") {\n    return stripLimitOffsetFromPlanNode(node.input);\n  }\n  if (\"input\" in node) {\n    return { ...node, input: stripLimitOffsetFromPlanNode(node.input) };\n  }\n  return node;\n}\n\n/**\n * Compiles a standard (non-recursive) query to SQL using CTEs.\n */\ntype StandardQueryStrategyHandler = (\n  ast: QueryAst,\n  graphId: string,\n  ctx: PredicateCompilerContext,\n) => SQL;\n\nconst STANDARD_QUERY_STRATEGY_HANDLERS: Record<\n  DialectStandardQueryStrategy,\n  StandardQueryStrategyHandler\n> = {\n  cte_project: compileStandardQueryWithCteStrategy,\n};\n\nfunction compileStandardQuery(\n  ast: QueryAst,\n  graphId: string,\n  ctx: PredicateCompilerContext,\n): SQL {\n  const strategy = ctx.dialect.capabilities.standardQueryStrategy;\n  const handler = STANDARD_QUERY_STRATEGY_HANDLERS[strategy];\n  return handler(ast, graphId, ctx);\n}\n\ntype SelectStandardOrderByInput = Readonly<{\n  ast: QueryAst;\n  collapsedTraversalCteAlias: string | undefined;\n  dialect: DialectAdapter;\n  fulltextPredicate: FulltextMatchPredicate | undefined;\n  fusion: HybridFusionOptions | undefined;\n  vectorPredicate: VectorSimilarityPredicate | undefined;\n}>;\n\nfunction selectStandardOrderBy(\n  input: SelectStandardOrderByInput,\n): SQL | undefined {\n  const {\n    ast,\n    collapsedTraversalCteAlias,\n    dialect,\n    fulltextPredicate,\n    fusion,\n    vectorPredicate,\n  } = input;\n  if (vectorPredicate && fulltextPredicate) {\n    return buildStandardHybridRrfOrderBy({ ast, dialect, fusion });\n  }\n  if (vectorPredicate) {\n    return buildStandardVectorOrderBy({ ast, dialect });\n  }\n  if (fulltextPredicate) {\n    return buildStandardFulltextOrderBy({ ast, dialect });\n  }\n  return buildStandardOrderBy({\n    ast,\n    ...(collapsedTraversalCteAlias === undefined ?\n      {}\n    : { collapsedTraversalCteAlias }),\n    dialect,\n  });\n}\n\nfunction selectWindowFunctionOperation(\n  vectorPredicate: VectorSimilarityPredicate | undefined,\n  fulltextPredicate: FulltextMatchPredicate | undefined,\n): string {\n  if (vectorPredicate !== undefined && fulltextPredicate !== undefined) {\n    return \"hybrid relevance ranking\";\n  }\n  if (vectorPredicate !== undefined) return \"vector relevance ranking\";\n  return \"fulltext relevance ranking\";\n}\n\nfunction assertWindowFunctionsSupported(\n  ctx: PredicateCompilerContext,\n  operation: string,\n): void {\n  if (ctx.windowFunctions) return;\n\n  throw new ConfigurationError(\n    `${operation} requires SQL window functions, but this backend profile declares windowFunctions: false.`,\n    {\n      capability: \"windowFunctions\",\n      operation,\n      windowFunctions: false,\n    },\n    {\n      suggestion:\n        \"Use a backend profile that supports SQL window functions, or avoid this query shape.\",\n    },\n  );\n}\n\nfunction compileStandardQueryWithCteStrategy(\n  ast: QueryAst,\n  graphId: string,\n  ctx: PredicateCompilerContext,\n): SQL {\n  const { dialect } = ctx;\n  const {\n    collapsedTraversalCteAlias,\n    effectiveLimit,\n    fulltextPredicate,\n    fusion,\n    logicalPlan,\n    predicateIndex,\n    requiredColumnsByAlias,\n    shouldCollapseSelectiveTraversalRowset,\n    temporalFilterPass,\n    traversalCteLimit,\n    vectorPredicate,\n  } = runStandardQueryPassPipeline(ast, graphId, ctx);\n\n  if (temporalFilterPass === undefined) {\n    throw new CompilerInvariantError(\n      \"Temporal filter pass did not initialize temporal state\",\n      { phase: \"standard-pass-pipeline\" },\n    );\n  }\n  if (logicalPlan === undefined) {\n    throw new CompilerInvariantError(\n      \"Logical plan pass did not initialize plan state\",\n      { phase: \"standard-pass-pipeline\" },\n    );\n  }\n\n  if (vectorPredicate !== undefined || fulltextPredicate !== undefined) {\n    assertWindowFunctionsSupported(\n      ctx,\n      selectWindowFunctionOperation(vectorPredicate, fulltextPredicate),\n    );\n  }\n\n  if (!vectorPredicate && !fulltextPredicate) {\n    const fastPathSql = compileCountAggregateFastPath(\n      ast,\n      graphId,\n      ctx,\n      logicalPlan,\n      requiredColumnsByAlias,\n      predicateIndex,\n      temporalFilterPass,\n    );\n    if (fastPathSql) {\n      return fastPathSql;\n    }\n  }\n\n  // Build CTEs\n  const ctes: SQL[] = [\n    buildStandardStartCte({\n      ast,\n      ctx,\n      graphId,\n      predicateIndex,\n      requiredColumnsByAlias,\n      temporalFilterPass,\n    }),\n  ];\n\n  // Traversal CTEs\n  for (let index = 0; index < ast.traversals.length; index++) {\n    const materializeTraversalCte = shouldMaterializeTraversalCte(\n      dialect,\n      ast.traversals.length,\n      index,\n    );\n    ctes.push(\n      buildStandardTraversalCte({\n        ast,\n        carryForwardPreviousColumns: shouldCollapseSelectiveTraversalRowset,\n        ctx,\n        graphId,\n        materializeCte: materializeTraversalCte,\n        predicateIndex,\n        requiredColumnsByAlias,\n        temporalFilterPass,\n        traversalIndex: index,\n        traversalLimit: traversalCteLimit,\n      }),\n    );\n  }\n\n  // Add embeddings CTE if vector similarity is used\n  if (vectorPredicate) {\n    const nodeKinds = getNodeKindsForAlias(ast, vectorPredicate.field.alias);\n    ctes.push(\n      buildStandardEmbeddingsCte({\n        ctx,\n        graphId,\n        nodeKinds,\n        vectorPredicate,\n      }),\n    );\n  }\n\n  // Add fulltext CTE if a matches() predicate is used\n  if (fulltextPredicate) {\n    const nodeKinds = getNodeKindsForAlias(ast, fulltextPredicate.field.alias);\n    ctes.push(\n      buildStandardFulltextCte({\n        ctx,\n        fulltextPredicate,\n        graphId,\n        nodeKinds,\n      }),\n    );\n  }\n\n  if (getHybridTargetAlias(vectorPredicate, fulltextPredicate) !== undefined) {\n    ctes.push(buildStandardHybridCandidateCte());\n  }\n\n  // Build main SELECT\n  const projection = buildStandardProjection({\n    ast,\n    ...(collapsedTraversalCteAlias === undefined ?\n      {}\n    : { collapsedTraversalCteAlias }),\n    dialect,\n  });\n  const fromClause = buildStandardFromClause({\n    ast,\n    ...(collapsedTraversalCteAlias === undefined ?\n      {}\n    : { collapsedTraversalCteAlias }),\n    ...(vectorPredicate === undefined ? {} : { vectorPredicate }),\n    ...(fulltextPredicate === undefined ? {} : { fulltextPredicate }),\n  });\n  const groupBy = buildStandardGroupBy({ ast, dialect });\n  const having = buildStandardHaving({ ast, ctx });\n\n  const orderBy = selectStandardOrderBy({\n    ast,\n    collapsedTraversalCteAlias,\n    dialect,\n    fulltextPredicate,\n    fusion,\n    vectorPredicate,\n  });\n\n  const limitOffset = buildLimitOffsetClause({\n    limit: effectiveLimit,\n    offset: ast.offset,\n  });\n\n  return emitStandardQuerySql({\n    ctes,\n    fromClause,\n    ...(groupBy === undefined ? {} : { groupBy }),\n    ...(having === undefined ? {} : { having }),\n    ...(orderBy === undefined ? {} : { orderBy }),\n    ...(limitOffset === undefined ? {} : { limitOffset }),\n    logicalPlan,\n    projection,\n  });\n}\n","import { nanoid } from \"nanoid\";\n\n/**\n * ID generation utilities.\n *\n * Default implementation uses nanoid.\n * Benefits:\n * - URL-safe\n * - Compact (21 characters by default)\n * - Secure random generation\n */\n\n/**\n * Generates a new unique ID.\n */\nexport function generateId(): string {\n  return nanoid();\n}\n\n/**\n * ID generator function type.\n */\nexport type IdGenerator = () => string;\n\n/**\n * Default ID generator configuration.\n */\nexport type IdConfig = Readonly<{\n  /** Generator for node IDs */\n  nodeIdGenerator: IdGenerator;\n  /** Generator for edge IDs */\n  edgeIdGenerator: IdGenerator;\n}>;\n","/**\n * Path utilities for variable-length traversal results.\n *\n * SQLite doesn't support native arrays, so paths are stored as pipe-delimited\n * strings: \"|id1|id2|id3|\". PostgreSQL returns native arrays.\n */\nimport {\n  PG_ARRAY_END,\n  PG_ARRAY_START,\n  PG_PATH_ELEMENT_SEPARATOR,\n  SQLITE_PATH_DELIMITER,\n} from \"../constants\";\n\n/**\n * Parses a SQLite path string into an array of node IDs.\n *\n * @param path - Pipe-delimited path string like \"|id1|id2|id3|\"\n * @returns Array of node IDs like [\"id1\", \"id2\", \"id3\"]\n *\n * @example\n * parseSqlitePath(\"|abc|def|ghi|\") // [\"abc\", \"def\", \"ghi\"]\n * parseSqlitePath(\"|single|\") // [\"single\"]\n * parseSqlitePath(\"||\") // []\n */\nexport function parseSqlitePath(path: string): readonly string[] {\n  const emptyPath = `${SQLITE_PATH_DELIMITER}${SQLITE_PATH_DELIMITER}`;\n  if (!path || path === emptyPath) return [];\n\n  // Remove leading and trailing pipes, then split\n  const trimmed = path.slice(1, -1);\n  if (trimmed === \"\") return [];\n\n  return trimmed.split(SQLITE_PATH_DELIMITER);\n}\n\n/**\n * Type guard to check if a value is a SQLite path string.\n * SQLite paths start and end with \"|\".\n */\nexport function isSqlitePath(value: unknown): value is string {\n  return (\n    typeof value === \"string\" &&\n    value.startsWith(SQLITE_PATH_DELIMITER) &&\n    value.endsWith(SQLITE_PATH_DELIMITER)\n  );\n}\n\n/**\n * Normalizes a path value to an array.\n * - If already an array (PostgreSQL native), returns as-is\n * - If a SQLite path string (|id1|id2|), parses it\n * - If a PostgreSQL text array ({id1,id2}), parses it\n * - Otherwise returns empty array\n */\nexport function normalizePath(value: unknown): readonly string[] {\n  if (Array.isArray(value)) {\n    return value as string[];\n  }\n  if (isSqlitePath(value)) {\n    return parseSqlitePath(value);\n  }\n  if (isPostgresTextArray(value)) {\n    return parsePostgresTextArray(value);\n  }\n  return [];\n}\n\n/**\n * Type guard for PostgreSQL text array format: {id1,id2,id3}\n */\nfunction isPostgresTextArray(value: unknown): value is string {\n  return (\n    typeof value === \"string\" &&\n    value.startsWith(PG_ARRAY_START) &&\n    value.endsWith(PG_ARRAY_END)\n  );\n}\n\n/**\n * Parses a PostgreSQL text array string into an array of strings.\n * Input format: {id1,id2,id3} or {} for empty.\n */\nfunction parsePostgresTextArray(value: string): readonly string[] {\n  const inner = value.slice(1, -1);\n  if (inner === \"\") return [];\n  return inner.split(PG_PATH_ELEMENT_SEPARATOR);\n}\n","/**\n * Result mapping utilities for query execution.\n *\n * Transforms raw database rows into typed SelectContext and result objects.\n */\nimport { type NodeType } from \"../../core/types\";\nimport { normalizePath } from \"../../utils\";\nimport { type Traversal } from \"../ast\";\nimport type {\n  AliasMap,\n  EdgeAliasMap,\n  QueryBuilderState,\n  RecursiveAliasMap,\n  SelectableEdge,\n  SelectableNode,\n  SelectContext,\n} from \"../builder/types\";\nimport { type SqlDialect } from \"../dialect/types\";\n\n/**\n * Transforms SQLite path columns from pipe-delimited strings to arrays.\n * PostgreSQL returns native arrays, so no transformation needed.\n */\nexport function transformPathColumns(\n  rows: readonly Record<string, unknown>[],\n  state: QueryBuilderState,\n  _dialect: SqlDialect,\n): readonly Record<string, unknown>[] {\n  // Find path columns from variable-length traversals\n  const pathAliases: string[] = [];\n  for (const traversal of state.traversals) {\n    if (traversal.variableLength?.pathAlias !== undefined) {\n      pathAliases.push(traversal.variableLength.pathAlias);\n    }\n  }\n\n  if (pathAliases.length === 0) return rows;\n\n  const result: Record<string, unknown>[] = [];\n  let changed = false;\n  for (const row of rows) {\n    let transformed: Record<string, unknown> | undefined;\n    for (const alias of pathAliases) {\n      const value = row[alias];\n      if (value !== undefined && !Array.isArray(value)) {\n        transformed ??= { ...row };\n        transformed[alias] = normalizePath(value);\n      }\n    }\n    if (transformed === undefined) {\n      result.push(row);\n    } else {\n      changed = true;\n      result.push(transformed);\n    }\n  }\n  // Preserve reference identity when no rows were transformed\n  return changed ? result : rows;\n}\n\n// Reserved keys that cannot be overwritten by user props\nconst RESERVED_NODE_KEYS = new Set([\"id\", \"kind\", \"meta\"]);\nconst RESERVED_EDGE_KEYS = new Set([\"id\", \"kind\", \"fromId\", \"toId\", \"meta\"]);\n\n/**\n * Converts null to undefined for consistent typing.\n * Database backends return null for missing values, but our types use undefined.\n */\nfunction nullToUndefined<T>(value: T | null | undefined): T | undefined {\n  return value === null ? undefined : value;\n}\n\n/**\n * Assigns props to a target object, excluding reserved keys to prevent runtime\n * collisions with system fields (id, kind, meta, etc).\n */\nfunction assignPropsExcludingReserved(\n  target: Record<string, unknown>,\n  props: Record<string, unknown>,\n  reservedKeys: Set<string>,\n): void {\n  for (const [key, value] of Object.entries(props)) {\n    if (!reservedKeys.has(key)) {\n      target[key] = value;\n    }\n  }\n}\n\n/**\n * Builds a SelectableNode from row data for a given alias.\n *\n * Props are spread at top level, metadata goes under `meta`.\n * Reserved keys (id, kind, meta) in props are filtered out to prevent collisions.\n * Null values from database are normalized to undefined.\n */\nexport function buildSelectableNode(\n  row: Record<string, unknown>,\n  alias: string,\n): SelectableNode<NodeType> {\n  const id = row[`${alias}_id`] as string;\n  const kind = row[`${alias}_kind`] as string;\n  const propsRaw: unknown = row[`${alias}_props`];\n  const rawProps: Record<string, unknown> =\n    typeof propsRaw === \"string\" ?\n      (JSON.parse(propsRaw) as Record<string, unknown>)\n    : ((propsRaw as Record<string, unknown> | undefined) ?? {});\n\n  // Metadata columns - these are now always projected in CTEs\n  // Normalize null → undefined for optional fields\n  const version = row[`${alias}_version`] as number;\n  const validFrom = nullToUndefined(\n    row[`${alias}_valid_from`] as string | null,\n  );\n  const validTo = nullToUndefined(row[`${alias}_valid_to`] as string | null);\n  const createdAt = row[`${alias}_created_at`] as string;\n  const updatedAt = row[`${alias}_updated_at`] as string;\n  const deletedAt = nullToUndefined(\n    row[`${alias}_deleted_at`] as string | null,\n  );\n\n  const result: Record<string, unknown> = {\n    id,\n    kind,\n    meta: {\n      version,\n      validFrom,\n      validTo,\n      createdAt,\n      updatedAt,\n      deletedAt,\n    },\n  };\n\n  assignPropsExcludingReserved(result, rawProps, RESERVED_NODE_KEYS);\n  return result as SelectableNode<NodeType>;\n}\n\n/**\n * Builds a SelectableNode from row data, returning undefined when the node\n * doesn't exist (for optional traversals with LEFT JOIN).\n */\nfunction buildSelectableNodeOrUndefined(\n  row: Record<string, unknown>,\n  alias: string,\n): SelectableNode<NodeType> | undefined {\n  const id = row[`${alias}_id`] as string | null | undefined;\n  if (id === null || id === undefined) {\n    return undefined;\n  }\n  return buildSelectableNode(row, alias);\n}\n\n/**\n * Builds a SelectableEdge from row data for a given edge alias.\n *\n * Props are spread at top level, metadata goes under `meta`.\n * Reserved keys (id, kind, fromId, toId, meta) in props are filtered out to prevent collisions.\n * Null values from database are normalized to undefined.\n * Returns undefined if the edge doesn't exist (for optional traversals with LEFT JOIN).\n */\nfunction buildSelectableEdge(\n  row: Record<string, unknown>,\n  alias: string,\n): SelectableEdge | undefined {\n  const id = row[`${alias}_id`] as string | null | undefined;\n\n  // For optional traversals, edge may be null (LEFT JOIN)\n  if (id === null || id === undefined) {\n    return undefined;\n  }\n\n  const kind = row[`${alias}_kind`] as string;\n  const fromId = row[`${alias}_from_id`] as string;\n  const toId = row[`${alias}_to_id`] as string;\n\n  const propsRaw: unknown = row[`${alias}_props`];\n  const rawProps: Record<string, unknown> =\n    typeof propsRaw === \"string\" ?\n      (JSON.parse(propsRaw) as Record<string, unknown>)\n    : ((propsRaw as Record<string, unknown> | undefined) ?? {});\n\n  // Metadata columns - these are always projected in traversal CTEs\n  // Normalize null → undefined for optional fields\n  const validFrom = nullToUndefined(\n    row[`${alias}_valid_from`] as string | null,\n  );\n  const validTo = nullToUndefined(row[`${alias}_valid_to`] as string | null);\n  const createdAt = row[`${alias}_created_at`] as string;\n  const updatedAt = row[`${alias}_updated_at`] as string;\n  const deletedAt = nullToUndefined(\n    row[`${alias}_deleted_at`] as string | null,\n  );\n\n  const result: Record<string, unknown> = {\n    id,\n    kind,\n    fromId,\n    toId,\n    meta: {\n      validFrom,\n      validTo,\n      createdAt,\n      updatedAt,\n      deletedAt,\n    },\n  };\n\n  assignPropsExcludingReserved(result, rawProps, RESERVED_EDGE_KEYS);\n  return result as SelectableEdge;\n}\n\n/**\n * Builds a SelectContext from a raw database row.\n * Includes node aliases, edge aliases, and recursive metadata (depth/path).\n */\nexport function buildSelectContext<\n  Aliases extends AliasMap,\n  EdgeAliases extends EdgeAliasMap,\n  // eslint-disable-next-line @typescript-eslint/no-empty-object-type -- Empty when no recursive aliases\n  RecursiveAliases extends RecursiveAliasMap = {},\n>(\n  row: Record<string, unknown>,\n  startAlias: string,\n  traversals: readonly Traversal[],\n): SelectContext<Aliases, EdgeAliases, RecursiveAliases> {\n  // Build the start node as initial context entry\n  const context: Record<\n    string,\n    | SelectableNode<NodeType>\n    | SelectableEdge\n    | number\n    | readonly string[]\n    | undefined\n  > = {\n    [startAlias]: buildSelectableNode(row, startAlias),\n  };\n\n  // Build traversal nodes and edges\n  for (const traversal of traversals) {\n    const nodeAlias = traversal.nodeAlias;\n    const edgeAlias = traversal.edgeAlias;\n\n    // Add node\n    context[nodeAlias] =\n      traversal.optional ?\n        buildSelectableNodeOrUndefined(row, nodeAlias)\n      : buildSelectableNode(row, nodeAlias);\n\n    // Add edge (may be undefined for optional traversals)\n    context[edgeAlias] = buildSelectableEdge(row, edgeAlias);\n\n    // Add recursive depth/path values\n    const vl = traversal.variableLength;\n    if (vl !== undefined) {\n      if (vl.depthAlias !== undefined) {\n        context[vl.depthAlias] = row[vl.depthAlias] as number;\n      }\n      if (vl.pathAlias !== undefined) {\n        context[vl.pathAlias] = row[vl.pathAlias] as readonly string[];\n      }\n    }\n  }\n\n  return context as SelectContext<Aliases, EdgeAliases, RecursiveAliases>;\n}\n\n/**\n * Maps raw database rows to typed results using a select function.\n */\nexport function mapResults<\n  Aliases extends AliasMap,\n  EdgeAliases extends EdgeAliasMap,\n  R,\n  // eslint-disable-next-line @typescript-eslint/no-empty-object-type -- Empty when no recursive aliases\n  RA extends RecursiveAliasMap = {},\n>(\n  rows: readonly Record<string, unknown>[],\n  startAlias: string,\n  traversals: readonly Traversal[],\n  selectFunction: (context: SelectContext<Aliases, EdgeAliases, RA>) => R,\n): readonly R[] {\n  return rows.map((row) => {\n    const context = buildSelectContext<Aliases, EdgeAliases, RA>(\n      row,\n      startAlias,\n      traversals,\n    );\n    return selectFunction(context);\n  });\n}\n","/**\n * Cursor encoding/decoding for keyset pagination.\n *\n * Cursors are opaque URL-safe base64-encoded JSON containing:\n * - Column values at cursor position\n * - Direction indicator\n * - Version for forward compatibility\n */\n\nimport { ValidationError } from \"../errors\";\nimport { type OrderSpec } from \"./ast\";\nimport { resolveJsonPointer } from \"./json-pointer\";\n\n// ============================================================\n// Types\n// ============================================================\n\nconst CURSOR_VERSION = 1;\n\n/**\n * Internal cursor data structure.\n */\nexport type CursorData = Readonly<{\n  /** Version for forward compatibility */\n  v: number;\n  /** Direction: 'f' = forward, 'b' = backward */\n  d: \"f\" | \"b\";\n  /** ORDER BY column values at cursor position */\n  vals: readonly unknown[];\n  /** Column identifiers for validation */\n  cols: readonly string[];\n}>;\n\n// ============================================================\n// Encoding / Decoding\n// ============================================================\n\n/**\n * Encodes cursor data to a URL-safe base64 string.\n */\nexport function encodeCursor(data: CursorData): string {\n  const json = JSON.stringify(data);\n  // Use URL-safe base64: replace + with -, / with _, remove padding\n  return btoa(json)\n    .replaceAll(\"+\", \"-\")\n    .replaceAll(\"/\", \"_\")\n    .replace(/=+$/, \"\");\n}\n\n/**\n * Decodes a cursor string to cursor data.\n *\n * @throws ValidationError if cursor is invalid or incompatible\n */\nexport function decodeCursor(cursor: string): CursorData {\n  try {\n    // Restore standard base64\n    let base64 = cursor.replaceAll(\"-\", \"+\").replaceAll(\"_\", \"/\");\n    // Add padding if needed\n    while (base64.length % 4) {\n      base64 += \"=\";\n    }\n    const json = atob(base64);\n    const raw = JSON.parse(json) as Record<string, unknown>;\n\n    if (typeof raw.v !== \"number\" || raw.v > CURSOR_VERSION) {\n      throw new ValidationError(\n        `Unsupported cursor version: ${String(raw.v)}. Maximum supported: ${CURSOR_VERSION}`,\n        {\n          issues: [\n            {\n              path: \"cursor\",\n              message: `Cursor version ${String(raw.v)} is not supported`,\n            },\n          ],\n        },\n        {\n          suggestion: `This cursor was created with a newer version. Re-fetch the data to get a compatible cursor.`,\n        },\n      );\n    }\n\n    if (raw.d !== \"f\" && raw.d !== \"b\") {\n      throw new ValidationError(`Invalid cursor direction: ${String(raw.d)}`, {\n        issues: [\n          {\n            path: \"cursor\",\n            message: `Direction must be \"f\" (forward) or \"b\" (backward)`,\n          },\n        ],\n      });\n    }\n\n    if (!Array.isArray(raw.vals) || !Array.isArray(raw.cols)) {\n      throw new ValidationError(\"Invalid cursor structure\", {\n        issues: [\n          {\n            path: \"cursor\",\n            message: \"Cursor must contain vals and cols arrays\",\n          },\n        ],\n      });\n    }\n\n    if (raw.vals.length !== raw.cols.length) {\n      throw new ValidationError(\"Cursor column count mismatch\", {\n        issues: [\n          {\n            path: \"cursor\",\n            message: `vals (${raw.vals.length}) and cols (${raw.cols.length}) must have same length`,\n          },\n        ],\n      });\n    }\n\n    return {\n      v: raw.v,\n      d: raw.d,\n      vals: raw.vals as readonly unknown[],\n      cols: raw.cols as readonly string[],\n    };\n  } catch (error) {\n    if (error instanceof ValidationError) {\n      throw error;\n    }\n    throw new ValidationError(\n      \"Invalid cursor format\",\n      {\n        issues: [{ path: \"cursor\", message: \"Failed to decode cursor\" }],\n      },\n      { cause: error },\n    );\n  }\n}\n\n// ============================================================\n// Cursor Building\n// ============================================================\n\n/**\n * Builds a column identifier from an order spec.\n *\n * Format: \"alias.fieldName\" for property fields, \"alias.path[0]...\" for system fields.\n * Handles two field ref formats:\n * 1. New format: path=[\"props\"], jsonPointer=\"/name\"\n * 2. Legacy format: path=[\"props\", \"name\"]\n *\n * In both cases, outputs flattened format \"p.name\" to match the flattened API.\n */\nexport function buildColumnId(spec: OrderSpec): string {\n  const { alias, path, jsonPointer } = spec.field;\n\n  // New format: path=[\"props\"] with jsonPointer=\"/fieldName\"\n  // jsonPointer is a branded string like \"/name\" or \"/nested/field\"\n  if (path.length === 1 && path[0] === \"props\" && jsonPointer) {\n    const parts = (jsonPointer as string).split(\"/\").filter(Boolean);\n    return `${alias}.${parts.join(\".\")}`;\n  }\n\n  // Legacy format: path=[\"props\", \"fieldName\", ...] without jsonPointer\n  if (path.length >= 2 && path[0] === \"props\") {\n    return `${alias}.${path.slice(1).join(\".\")}`;\n  }\n\n  // System fields (id, kind) or other paths\n  return `${alias}.${path.join(\".\")}`;\n}\n\n/**\n * Extracts the value for a cursor column from a result row.\n *\n * The row can be in two formats:\n * 1. Raw database row with flat column names\n * 2. Mapped result with alias-keyed nested data\n *\n * For mapped results, we navigate through the path and then jsonPointer.\n */\nexport function extractCursorValue(\n  row: Record<string, unknown>,\n  spec: OrderSpec,\n): unknown {\n  const { alias, path, jsonPointer } = spec.field;\n\n  // Try alias-keyed format first (mapped results)\n  let current: unknown = row[alias];\n  if (current !== undefined) {\n    // Follow path first (e.g., [\"props\"])\n    for (const segment of path) {\n      if (current === null || current === undefined) return undefined;\n      if (typeof current !== \"object\") return undefined;\n\n      const record = current as Record<string, unknown>;\n      if (segment === \"props\" && !Object.hasOwn(record, segment)) {\n        continue;\n      }\n\n      current = record[segment];\n    }\n\n    // Then follow jsonPointer if present (e.g., \"/name\")\n    if (jsonPointer) {\n      return resolveJsonPointer(current, jsonPointer);\n    }\n\n    return current;\n  }\n\n  // Fallback: try direct path lookup for raw rows\n  current = row;\n  for (const segment of path) {\n    if (current === null || current === undefined) return undefined;\n    if (typeof current !== \"object\") return undefined;\n    current = (current as Record<string, unknown>)[segment];\n  }\n  return current;\n}\n\n/**\n * Builds a cursor from a result row and order specifications.\n *\n * @param row - The result row (mapped with alias-keyed data)\n * @param orderSpecs - The ORDER BY specifications\n * @param direction - Pagination direction\n * @returns Encoded cursor string\n */\nexport function buildCursorFromRow(\n  row: Record<string, unknown>,\n  orderSpecs: readonly OrderSpec[],\n  direction: \"f\" | \"b\",\n): string {\n  const vals = orderSpecs.map((spec) => extractCursorValue(row, spec));\n  const cols = orderSpecs.map((spec) => buildColumnId(spec));\n\n  return encodeCursor({\n    v: CURSOR_VERSION,\n    d: direction,\n    vals,\n    cols,\n  });\n}\n\n/**\n * Validates that cursor columns match the query's ORDER BY columns.\n *\n * @throws ValidationError if columns don't match\n */\nexport function validateCursorColumns(\n  cursorData: CursorData,\n  orderSpecs: readonly OrderSpec[],\n): void {\n  const expectedCols = orderSpecs.map((spec) => buildColumnId(spec));\n\n  if (cursorData.cols.length !== expectedCols.length) {\n    throw new ValidationError(\n      `Cursor has ${cursorData.cols.length} columns but query has ${expectedCols.length} ORDER BY columns`,\n      {\n        issues: [\n          {\n            path: \"cursor\",\n            message: `Column count mismatch: cursor has ${cursorData.cols.length}, query has ${expectedCols.length}`,\n          },\n        ],\n      },\n      {\n        suggestion: `The cursor was created with a different ORDER BY. Re-fetch with consistent ordering.`,\n      },\n    );\n  }\n\n  for (const [index, expectedCol] of expectedCols.entries()) {\n    if (cursorData.cols[index] !== expectedCol) {\n      throw new ValidationError(\n        `Cursor column mismatch at position ${index}: expected \"${expectedCol}\", got \"${cursorData.cols[index]}\"`,\n        {\n          issues: [\n            {\n              path: \"cursor\",\n              message: `Column ${index}: expected \"${expectedCol}\", got \"${cursorData.cols[index]}\"`,\n            },\n          ],\n        },\n        {\n          suggestion: `The cursor was created with a different ORDER BY. Re-fetch with consistent ordering.`,\n        },\n      );\n    }\n  }\n}\n","/**\n * Cursor-based pagination utilities.\n *\n * Provides pagination logic for ExecutableQuery including cursor predicate\n * building and result page construction.\n */\nimport {\n  DEFAULT_PAGINATION_LIMIT,\n  DEFAULT_STREAM_BATCH_SIZE,\n} from \"../../constants\";\nimport {\n  type FieldRef,\n  type NodePredicate,\n  type OrderSpec,\n  type PredicateExpression,\n} from \"../ast\";\nimport type {\n  AliasMap,\n  EdgeAliasMap,\n  PaginatedResult,\n  PaginateOptions,\n  SelectContext,\n  StreamOptions,\n} from \"../builder/types\";\nimport {\n  buildCursorFromRow,\n  type CursorData,\n  decodeCursor,\n  validateCursorColumns,\n} from \"../cursor\";\n\n/**\n * Parses pagination options into internal format.\n */\nexport function parsePaginateOptions(options: PaginateOptions): {\n  isBackward: boolean;\n  limit: number;\n  cursor: string | undefined;\n  cursorData: CursorData | undefined;\n  orderBy: readonly OrderSpec[];\n} {\n  const isBackward = options.last !== undefined || options.before !== undefined;\n  const limit = options.first ?? options.last ?? DEFAULT_PAGINATION_LIMIT;\n  const cursor = options.after ?? options.before;\n\n  let cursorData: CursorData | undefined;\n  if (cursor) {\n    cursorData = decodeCursor(cursor);\n  }\n\n  return { isBackward, limit, cursor, cursorData, orderBy: [] };\n}\n\n/**\n * Validates cursor data against ORDER BY columns.\n */\nexport function validateCursor(\n  cursorData: CursorData | undefined,\n  orderBy: readonly OrderSpec[],\n): void {\n  if (cursorData) {\n    validateCursorColumns(cursorData, orderBy);\n  }\n}\n\n/**\n * Adjusts ORDER BY for backward pagination (reverses directions).\n */\nexport function adjustOrderByForDirection(\n  orderBy: readonly OrderSpec[],\n  direction: \"forward\" | \"backward\",\n): readonly OrderSpec[] {\n  if (direction === \"forward\") {\n    return orderBy;\n  }\n  return orderBy.map((spec) => ({\n    ...spec,\n    direction: spec.direction === \"asc\" ? (\"desc\" as const) : (\"asc\" as const),\n  }));\n}\n\n/**\n * Builds a cursor predicate for keyset pagination.\n * Generates (col1 > val1) OR (col1 = val1 AND col2 > val2) OR ... pattern.\n */\nexport function buildCursorPredicate(\n  cursorData: CursorData,\n  orderBy: readonly OrderSpec[],\n  direction: \"forward\" | \"backward\",\n  targetAlias: string,\n): NodePredicate {\n  const values = cursorData.vals;\n\n  // Build OR of progressively longer AND conditions\n  const orConditions: PredicateExpression[] = [];\n\n  for (let index = 0; index < orderBy.length; index++) {\n    const andConditions: PredicateExpression[] = [];\n\n    // All preceding columns must be equal\n    for (let index_ = 0; index_ < index; index_++) {\n      const spec = orderBy[index_]!;\n      const value = values[index_];\n      andConditions.push(buildEqualityPredicate(spec.field, value));\n    }\n\n    // Current column uses comparison\n    const currentSpec = orderBy[index]!;\n    const currentValue = values[index];\n    const isAsc = currentSpec.direction === \"asc\";\n    const isForward = direction === \"forward\";\n    // ASC + forward = gt | ASC + backward = lt\n    // DESC + forward = lt | DESC + backward = gt\n    const op = isAsc === isForward ? \"gt\" : \"lt\";\n\n    andConditions.push(\n      buildComparisonPredicate(currentSpec.field, op, currentValue),\n    );\n\n    // Combine with AND\n    if (andConditions.length === 1) {\n      orConditions.push(andConditions[0]!);\n    } else {\n      orConditions.push({ __type: \"and\", predicates: andConditions });\n    }\n  }\n\n  // Combine with OR\n  const expression: PredicateExpression =\n    orConditions.length === 1 ?\n      orConditions[0]!\n    : { __type: \"or\", predicates: orConditions };\n\n  return {\n    targetAlias,\n    expression,\n  };\n}\n\n/**\n * Builds an equality predicate for cursor pagination.\n */\nfunction buildEqualityPredicate(\n  field: FieldRef,\n  value: unknown,\n): PredicateExpression {\n  if (value === null || value === undefined) {\n    return { __type: \"null_check\", op: \"isNull\", field };\n  }\n  return {\n    __type: \"comparison\",\n    op: \"eq\",\n    left: field,\n    right: { __type: \"literal\", value: value as string | number | boolean },\n  };\n}\n\n/**\n * Builds a comparison predicate for cursor pagination.\n */\nfunction buildComparisonPredicate(\n  field: FieldRef,\n  op: \"gt\" | \"lt\",\n  value: unknown,\n): PredicateExpression {\n  if (value === null || value === undefined) {\n    // For null, the comparison depends on NULLS FIRST/LAST behavior\n    // For simplicity, treat as IS NOT NULL for forward, fail for backward\n    return { __type: \"null_check\", op: \"isNotNull\", field };\n  }\n  return {\n    __type: \"comparison\",\n    op,\n    left: field,\n    right: { __type: \"literal\", value: value as string | number | boolean },\n  };\n}\n\n/**\n * Builds cursor string from a context row.\n */\nexport function buildCursorFromContext<\n  Aliases extends AliasMap,\n  EdgeAliases extends EdgeAliasMap,\n>(\n  context: SelectContext<Aliases, EdgeAliases>,\n  orderBy: readonly OrderSpec[],\n  direction: \"f\" | \"b\",\n): string {\n  return buildCursorFromRow(context, orderBy, direction);\n}\n\n/**\n * Constructs a PaginatedResult from query results.\n */\nexport function buildPaginatedResult<\n  Aliases extends AliasMap,\n  EdgeAliases extends EdgeAliasMap,\n  R,\n>(\n  data: readonly R[],\n  orderedRows: readonly Record<string, unknown>[],\n  orderBy: readonly OrderSpec[],\n  limit: number,\n  hasMore: boolean,\n  isBackward: boolean,\n  cursor: string | undefined,\n  buildContext: (\n    row: Record<string, unknown>,\n  ) => SelectContext<Aliases, EdgeAliases>,\n): PaginatedResult<R> {\n  let nextCursor: string | undefined;\n  let previousCursor: string | undefined;\n\n  if (orderedRows.length > 0) {\n    const firstRow = orderedRows[0]!;\n    const lastRow = orderedRows.at(-1)!;\n\n    // Build cursors using mapped result context\n    const firstContext = buildContext(firstRow);\n    const lastContext = buildContext(lastRow);\n\n    // Extract values for ORDER BY columns from the context\n    previousCursor = buildCursorFromContext(firstContext, orderBy, \"b\");\n    nextCursor = buildCursorFromContext(lastContext, orderBy, \"f\");\n  }\n\n  return {\n    data,\n    nextCursor: hasMore || isBackward ? nextCursor : undefined,\n    prevCursor:\n      cursor !== undefined || (isBackward && hasMore) ?\n        previousCursor\n      : undefined,\n    hasNextPage: isBackward ? cursor !== undefined : hasMore,\n    hasPrevPage: isBackward ? hasMore : cursor !== undefined,\n  };\n}\n\n/**\n * Creates an async iterable that streams results using cursor pagination.\n */\nexport async function* createStreamIterable<R>(\n  batchSize: number,\n  paginate: (options: PaginateOptions) => Promise<PaginatedResult<R>>,\n): AsyncGenerator<R> {\n  let cursor: string | undefined;\n  let hasMore = true;\n\n  while (hasMore) {\n    const options: PaginateOptions =\n      cursor ? { first: batchSize, after: cursor } : { first: batchSize };\n    const page = await paginate(options);\n\n    for (const item of page.data) {\n      yield item;\n    }\n\n    cursor = page.nextCursor;\n    hasMore = page.hasNextPage;\n  }\n}\n\n/**\n * Gets default stream options.\n */\nexport function getStreamBatchSize(options?: StreamOptions): number {\n  return options?.batchSize ?? DEFAULT_STREAM_BATCH_SIZE;\n}\n","/**\n * Field Tracking for Smart Select Optimization.\n *\n * Provides infrastructure for tracking which fields are accessed during\n * a select callback, enabling the query compiler to selectively project\n * only those fields instead of fetching the full props blob.\n */\n\nimport type { KindEntity } from \"../../core/types\";\nimport { EDGE_META_KEYS, NODE_META_KEYS } from \"../../system-fields\";\nimport { mergeEdgeKinds, type SelectiveField, type ValueType } from \"../ast\";\nimport { type QueryBuilderState } from \"../builder/types\";\nimport {\n  type FieldTypeInfo,\n  type SchemaIntrospector,\n} from \"../schema-introspector\";\n\n// ============================================================\n// Types\n// ============================================================\n\ntype TrackingValueMode = \"falsy\" | \"truthy\" | \"max\";\n\ntype AccessedField = Readonly<{\n  alias: string;\n  field: string;\n  isSystemField: boolean;\n}>;\n\nexport type TrackingContextOptions = Readonly<{\n  schemaIntrospector: SchemaIntrospector;\n  mode: TrackingValueMode;\n  /**\n   * When \"absent\", optional traversal aliases are set to undefined to\n   * encourage exploring fallback branches (e.g., `ctx.friend ? ... : ...`).\n   */\n  optionalTraversalAliases: \"present\" | \"absent\";\n}>;\n\n// ============================================================\n// Constants\n// ============================================================\n\nconst OBJECT_PROTOTYPE_PROPERTIES = new Set<string>([\n  \"__proto__\",\n  \"constructor\",\n  \"hasOwnProperty\",\n  \"isPrototypeOf\",\n  \"propertyIsEnumerable\",\n  \"toLocaleString\",\n  \"toString\",\n  \"valueOf\",\n]);\n\n// ============================================================\n// FieldAccessTracker\n// ============================================================\n\nexport class FieldAccessTracker {\n  readonly #fields = new Map<string, AccessedField>();\n\n  record(alias: string, field: string, isSystemField: boolean): void {\n    const key = `${alias}\\u0000${field}`;\n    const existing = this.#fields.get(key);\n    // System fields (id, kind) are dedicated columns — not in the props JSON.\n    // Never downgrade a system field to a props field, as that would cause the\n    // compiler to emit props->>'id' (nonexistent) instead of the id column.\n    if (existing !== undefined && existing.isSystemField && !isSystemField) {\n      return;\n    }\n    this.#fields.set(key, { alias, field, isSystemField });\n  }\n\n  getAccessedFields(): readonly AccessedField[] {\n    return [...this.#fields.values()];\n  }\n}\n\n// ============================================================\n// Tracking Context Creation\n// ============================================================\n\nexport function createTrackingContext(\n  state: QueryBuilderState,\n  tracker: FieldAccessTracker,\n  options: TrackingContextOptions,\n): Record<string, unknown> {\n  const context: Record<string, unknown> = {\n    [state.startAlias]: createNodeTrackingProxy(\n      state.startAlias,\n      state.startKinds,\n      tracker,\n      options,\n    ),\n  };\n\n  for (const traversal of state.traversals) {\n    const edgeKindNames = mergeEdgeKinds(traversal);\n\n    const optionalAbsent =\n      options.optionalTraversalAliases === \"absent\" && traversal.optional;\n\n    context[traversal.nodeAlias] =\n      optionalAbsent ? undefined : (\n        createNodeTrackingProxy(\n          traversal.nodeAlias,\n          traversal.nodeKinds,\n          tracker,\n          options,\n        )\n      );\n\n    context[traversal.edgeAlias] =\n      optionalAbsent ? undefined : (\n        createEdgeTrackingProxy(\n          traversal.edgeAlias,\n          edgeKindNames,\n          tracker,\n          options,\n        )\n      );\n\n    // Provide placeholder values for recursive depth/path so the\n    // select callback can access them without crashing during tracking.\n    const vl = traversal.variableLength;\n    if (vl !== undefined) {\n      if (vl.depthAlias !== undefined) {\n        context[vl.depthAlias] = options.mode === \"falsy\" ? 0 : 1;\n      }\n      if (vl.pathAlias !== undefined) {\n        context[vl.pathAlias] = options.mode === \"falsy\" ? [] : [\"placeholder\"];\n      }\n    }\n  }\n\n  return context;\n}\n\nfunction createNodeTrackingProxy(\n  alias: string,\n  kindNames: readonly string[],\n  tracker: FieldAccessTracker,\n  options: TrackingContextOptions,\n): unknown {\n  return new Proxy(\n    {},\n    {\n      get: (_, property: string | symbol) => {\n        if (typeof property === \"symbol\") return;\n        if (property === \"then\") return;\n        if (property === \"toJSON\") return;\n\n        if (OBJECT_PROTOTYPE_PROPERTIES.has(property)) {\n          if (property === \"constructor\") return Object;\n          if (property === \"__proto__\") return Object.prototype;\n          return Reflect.get(Object.prototype, property) as unknown;\n        }\n\n        if (property === \"id\" || property === \"kind\") {\n          tracker.record(alias, property, true);\n          return getPlaceholderForSystemField(property, options.mode);\n        }\n\n        if (property === \"meta\") {\n          for (const key of NODE_META_KEYS) {\n            tracker.record(alias, `meta.${key}`, true);\n          }\n          return buildNodeMetaPlaceholder(options.mode);\n        }\n\n        tracker.record(alias, property, false);\n        const typeInfo = options.schemaIntrospector.getSharedFieldTypeInfo(\n          kindNames,\n          property,\n        );\n        return getPlaceholderForTypeInfo(typeInfo, options.mode);\n      },\n    },\n  );\n}\n\nfunction createEdgeTrackingProxy(\n  alias: string,\n  edgeKindNames: readonly string[],\n  tracker: FieldAccessTracker,\n  options: TrackingContextOptions,\n): unknown {\n  return new Proxy(\n    {},\n    {\n      get: (_, property: string | symbol) => {\n        if (typeof property === \"symbol\") return;\n        if (property === \"then\") return;\n        if (property === \"toJSON\") return;\n\n        if (OBJECT_PROTOTYPE_PROPERTIES.has(property)) {\n          if (property === \"constructor\") return Object;\n          if (property === \"__proto__\") return Object.prototype;\n          return Reflect.get(Object.prototype, property) as unknown;\n        }\n\n        if (\n          property === \"id\" ||\n          property === \"kind\" ||\n          property === \"fromId\" ||\n          property === \"toId\"\n        ) {\n          tracker.record(alias, property, true);\n          return getPlaceholderForSystemField(property, options.mode);\n        }\n\n        if (property === \"meta\") {\n          for (const key of EDGE_META_KEYS) {\n            tracker.record(alias, `meta.${key}`, true);\n          }\n          return buildEdgeMetaPlaceholder(options.mode);\n        }\n\n        tracker.record(alias, property, false);\n        const typeInfo = options.schemaIntrospector.getSharedEdgeFieldTypeInfo(\n          edgeKindNames,\n          property,\n        );\n        return getPlaceholderForTypeInfo(typeInfo, options.mode);\n      },\n    },\n  );\n}\n\n// ============================================================\n// Selective Field Construction\n// ============================================================\n\ntype BuildSelectiveFieldsOptions = Readonly<{\n  state: QueryBuilderState;\n  schemaIntrospector: SchemaIntrospector;\n}>;\n\nexport function buildSelectiveFields(\n  accessedFields: readonly AccessedField[],\n  options?: BuildSelectiveFieldsOptions,\n): readonly SelectiveField[] {\n  const aliasInfo = options ? buildAliasKindMap(options.state) : undefined;\n\n  return accessedFields\n    .map((access) => {\n      const base: SelectiveField = {\n        alias: access.alias,\n        field: access.field,\n        outputName: `${access.alias}_${access.field}`,\n        isSystemField: access.isSystemField,\n      };\n\n      if (!options || access.isSystemField) {\n        return base;\n      }\n\n      const info = aliasInfo?.get(access.alias);\n      if (!info) {\n        return base;\n      }\n\n      const typeInfo =\n        info.kind === \"node\" ?\n          options.schemaIntrospector.getSharedFieldTypeInfo(\n            info.kindNames,\n            access.field,\n          )\n        : options.schemaIntrospector.getSharedEdgeFieldTypeInfo(\n            info.kindNames,\n            access.field,\n          );\n\n      return {\n        ...base,\n        valueType: typeInfo?.valueType,\n      };\n    })\n    .toSorted((a, b) => {\n      const aliasCompare = a.alias.localeCompare(b.alias);\n      if (aliasCompare !== 0) return aliasCompare;\n      return a.field.localeCompare(b.field);\n    });\n}\n\ntype AliasKind = KindEntity;\n\ntype AliasKindInfo = Readonly<{\n  kind: AliasKind;\n  kindNames: readonly string[];\n}>;\n\nfunction buildAliasKindMap(\n  state: QueryBuilderState,\n): ReadonlyMap<string, AliasKindInfo> {\n  const map = new Map<string, AliasKindInfo>([\n    [\n      state.startAlias,\n      {\n        kind: \"node\",\n        kindNames: state.startKinds,\n      },\n    ],\n  ]);\n\n  for (const traversal of state.traversals) {\n    const edgeKindNames = mergeEdgeKinds(traversal);\n\n    map.set(traversal.nodeAlias, {\n      kind: \"node\",\n      kindNames: traversal.nodeKinds,\n    });\n    map.set(traversal.edgeAlias, {\n      kind: \"edge\",\n      kindNames: edgeKindNames,\n    });\n  }\n\n  return map;\n}\n\n// ============================================================\n// Placeholder Values\n// ============================================================\n\nfunction getPlaceholderForSystemField(\n  field: string,\n  mode: TrackingValueMode,\n): unknown {\n  if (\n    field === \"id\" ||\n    field === \"kind\" ||\n    field === \"fromId\" ||\n    field === \"toId\"\n  ) {\n    return mode === \"falsy\" ? \"\" : \"x\";\n  }\n  return undefined;\n}\n\nfunction buildNodeMetaPlaceholder(mode: TrackingValueMode): Readonly<{\n  version: number;\n  validFrom: string | undefined;\n  validTo: string | undefined;\n  createdAt: string;\n  updatedAt: string;\n  deletedAt: string | undefined;\n}> {\n  const empty = mode === \"falsy\";\n  return {\n    version: empty ? 0 : 1,\n    validFrom: empty ? undefined : \"2020-01-01T00:00:00.000Z\",\n    validTo: undefined,\n    createdAt: \"2020-01-01T00:00:00.000Z\",\n    updatedAt: \"2020-01-01T00:00:00.000Z\",\n    deletedAt: undefined,\n  };\n}\n\nfunction buildEdgeMetaPlaceholder(mode: TrackingValueMode): Readonly<{\n  validFrom: string | undefined;\n  validTo: string | undefined;\n  createdAt: string;\n  updatedAt: string;\n  deletedAt: string | undefined;\n}> {\n  const empty = mode === \"falsy\";\n  return {\n    validFrom: empty ? undefined : \"2020-01-01T00:00:00.000Z\",\n    validTo: undefined,\n    createdAt: \"2020-01-01T00:00:00.000Z\",\n    updatedAt: \"2020-01-01T00:00:00.000Z\",\n    deletedAt: undefined,\n  };\n}\n\nfunction getPlaceholderForTypeInfo(\n  typeInfo: FieldTypeInfo | undefined,\n  mode: TrackingValueMode,\n): unknown {\n  if (!typeInfo) {\n    return undefined;\n  }\n\n  return getPlaceholderForValueType(typeInfo.valueType, mode);\n}\n\nfunction getPlaceholderForValueType(\n  valueType: ValueType,\n  mode: TrackingValueMode,\n): unknown {\n  switch (valueType) {\n    case \"string\":\n    case \"date\": {\n      if (mode === \"falsy\") return \"\";\n      if (mode === \"max\") return \"active\";\n      return \"x\";\n    }\n    case \"number\": {\n      if (mode === \"falsy\") return 0;\n      if (mode === \"max\") return 100;\n      return 1;\n    }\n    case \"boolean\": {\n      return mode !== \"falsy\";\n    }\n    case \"array\":\n    case \"embedding\": {\n      return [];\n    }\n    case \"object\": {\n      return {};\n    }\n    case \"unknown\": {\n      return undefined;\n    }\n  }\n}\n","/**\n * Selective Result Mapping for Smart Select Optimization.\n *\n * Converts rows returned from a selective projection query into the\n * SelectContext expected by the select callback, while guarding against\n * missing fields and unsupported \"return whole node/edge\" selections.\n */\n\nimport type { KindEntity } from \"../../core/types\";\nimport { normalizePath } from \"../../utils\";\nimport { mergeEdgeKinds, type SelectiveField, type Traversal } from \"../ast\";\nimport type {\n  AliasMap,\n  EdgeAliasMap,\n  QueryBuilderState,\n  SelectContext,\n} from \"../builder/types\";\nimport {\n  type FieldTypeInfo,\n  type SchemaIntrospector,\n} from \"../schema-introspector\";\nimport { decodeSelectedValue, nullToUndefined } from \"./value-decoder\";\n\n// ============================================================\n// Errors\n// ============================================================\n\nexport class MissingSelectiveFieldError extends Error {\n  readonly alias: string;\n  readonly field: string;\n\n  constructor(alias: string, field: string) {\n    super(`Smart select missing field: ${alias}.${field}`);\n    this.alias = alias;\n    this.field = field;\n  }\n}\n\n// ============================================================\n// Internal Types\n// ============================================================\n\ntype AliasKind = KindEntity;\n\ntype SystemFieldPlan = Readonly<{\n  field: string;\n  outputName: string;\n}>;\n\ntype MetaFieldPlan = Readonly<{\n  metaKey: string;\n  outputName: string;\n}>;\n\ntype PropsFieldPlan = Readonly<{\n  field: string;\n  outputName: string;\n  typeInfo: FieldTypeInfo | undefined;\n}>;\n\ntype AliasPlan = Readonly<{\n  alias: string;\n  kind: AliasKind;\n  optional: boolean;\n  systemFields: readonly SystemFieldPlan[];\n  metaFields: readonly MetaFieldPlan[];\n  propsFields: readonly PropsFieldPlan[];\n  idOutputName: string | undefined;\n  metaOutputNames: ReadonlySet<string>;\n  propsOutputNames: ReadonlySet<string>;\n  systemOutputNames: ReadonlySet<string>;\n}>;\n\n// ============================================================\n// Marker for \"whole alias object\" detection\n// ============================================================\n\nconst SELECTABLE_ALIAS_MARKER = Symbol(\"selectable_alias_marker\");\n\ntype SelectableAliasMarker = Readonly<{\n  alias: string;\n  kind: AliasKind;\n}>;\n\nfunction isSelectableAliasObject(\n  value: unknown,\n): value is SelectableAliasMarker {\n  return (\n    typeof value === \"object\" &&\n    value !== null &&\n    SELECTABLE_ALIAS_MARKER in value\n  );\n}\n\nfunction containsSelectableAliasObject(value: unknown): boolean {\n  const visited = new WeakSet<object>();\n\n  function walk(current: unknown): boolean {\n    if (isSelectableAliasObject(current)) return true;\n\n    if (Array.isArray(current)) {\n      for (const item of current) {\n        if (walk(item)) return true;\n      }\n      return false;\n    }\n\n    if (typeof current !== \"object\" || current === null) {\n      return false;\n    }\n\n    if (visited.has(current)) return false;\n    visited.add(current);\n\n    for (const value of Object.values(current)) {\n      if (walk(value)) return true;\n    }\n    return false;\n  }\n\n  return walk(value);\n}\n\n// ============================================================\n// Public API\n// ============================================================\n\nexport function mapSelectiveResults<\n  Aliases extends AliasMap,\n  EdgeAliases extends EdgeAliasMap,\n  R,\n>(\n  rows: readonly Record<string, unknown>[],\n  state: QueryBuilderState,\n  selectiveFields: readonly SelectiveField[],\n  schemaIntrospector: SchemaIntrospector,\n  selectFunction: (context: SelectContext<Aliases, EdgeAliases>) => R,\n): readonly R[] {\n  const plans = buildAliasPlans(state, selectiveFields, schemaIntrospector);\n\n  return rows.map((row) => {\n    const context = buildSelectiveContext<Aliases, EdgeAliases>(\n      row,\n      plans,\n      state.traversals,\n    );\n    const result = selectFunction(context);\n\n    // Returning whole alias objects is not supported by selective projection.\n    // If it happens, fall back to the full fetch path.\n    if (containsSelectableAliasObject(result)) {\n      throw new MissingSelectiveFieldError(\n        state.startAlias,\n        \"whole node/edge selection\",\n      );\n    }\n\n    return result;\n  });\n}\n\n// ============================================================\n// Plan Construction\n// ============================================================\n\nfunction buildAliasPlans(\n  state: QueryBuilderState,\n  selectiveFields: readonly SelectiveField[],\n  schemaIntrospector: SchemaIntrospector,\n): readonly AliasPlan[] {\n  const aliasInfo = new Map<\n    string,\n    Readonly<{\n      kind: AliasKind;\n      optional: boolean;\n      kindNames: readonly string[];\n    }>\n  >([\n    [\n      state.startAlias,\n      {\n        kind: \"node\",\n        optional: false,\n        kindNames: state.startKinds,\n      },\n    ],\n  ]);\n\n  for (const traversal of state.traversals) {\n    const edgeKindNames = mergeEdgeKinds(traversal);\n\n    aliasInfo.set(traversal.nodeAlias, {\n      kind: \"node\",\n      optional: traversal.optional,\n      kindNames: traversal.nodeKinds,\n    });\n    aliasInfo.set(traversal.edgeAlias, {\n      kind: \"edge\",\n      optional: traversal.optional,\n      kindNames: edgeKindNames,\n    });\n  }\n\n  const fieldsByAlias = new Map<string, SelectiveField[]>();\n  for (const field of selectiveFields) {\n    const existing = fieldsByAlias.get(field.alias) ?? [];\n    existing.push(field);\n    fieldsByAlias.set(field.alias, existing);\n  }\n\n  const plans: AliasPlan[] = [];\n\n  for (const [alias, info] of aliasInfo.entries()) {\n    const fields = fieldsByAlias.get(alias) ?? [];\n\n    const systemFields: SystemFieldPlan[] = [];\n    const metaFields: MetaFieldPlan[] = [];\n    const propsFields: PropsFieldPlan[] = [];\n\n    for (const field of fields) {\n      if (field.isSystemField) {\n        if (field.field.startsWith(\"meta.\")) {\n          metaFields.push({\n            metaKey: field.field.slice(5),\n            outputName: field.outputName,\n          });\n        } else {\n          systemFields.push({\n            field: field.field,\n            outputName: field.outputName,\n          });\n        }\n      } else {\n        const typeInfo =\n          info.kind === \"node\" ?\n            schemaIntrospector.getSharedFieldTypeInfo(\n              info.kindNames,\n              field.field,\n            )\n          : schemaIntrospector.getSharedEdgeFieldTypeInfo(\n              info.kindNames,\n              field.field,\n            );\n\n        propsFields.push({\n          field: field.field,\n          outputName: field.outputName,\n          typeInfo,\n        });\n      }\n    }\n\n    const idOutputName =\n      systemFields.find((f) => f.field === \"id\")?.outputName ?? undefined;\n\n    plans.push({\n      alias,\n      kind: info.kind,\n      optional: info.optional,\n      systemFields,\n      metaFields,\n      propsFields,\n      idOutputName,\n      metaOutputNames: new Set(metaFields.map((f) => f.outputName)),\n      propsOutputNames: new Set(propsFields.map((f) => f.outputName)),\n      systemOutputNames: new Set(systemFields.map((f) => f.outputName)),\n    });\n  }\n\n  // Keep plan iteration stable.\n  return plans.toSorted((a, b) => a.alias.localeCompare(b.alias));\n}\n\n// ============================================================\n// Context Building\n// ============================================================\n\nfunction buildSelectiveContext<\n  Aliases extends AliasMap,\n  EdgeAliases extends EdgeAliasMap,\n>(\n  row: Record<string, unknown>,\n  plans: readonly AliasPlan[],\n  traversals: readonly Traversal[],\n): SelectContext<Aliases, EdgeAliases> {\n  const context: Record<string, unknown> = {};\n\n  for (const plan of plans) {\n    const value =\n      plan.optional && plan.idOutputName !== undefined ?\n        buildOptionalAliasValue(row, plan)\n      : buildRequiredAliasValue(row, plan);\n    context[plan.alias] = value;\n  }\n\n  // Extract recursive depth/path values from the row\n  for (const traversal of traversals) {\n    const vl = traversal.variableLength;\n    if (vl !== undefined) {\n      if (vl.depthAlias !== undefined) {\n        context[vl.depthAlias] = row[vl.depthAlias];\n      }\n      if (vl.pathAlias !== undefined) {\n        context[vl.pathAlias] = normalizePath(row[vl.pathAlias]);\n      }\n    }\n  }\n\n  return context as SelectContext<Aliases, EdgeAliases>;\n}\n\nfunction buildOptionalAliasValue(\n  row: Record<string, unknown>,\n  plan: AliasPlan,\n): unknown {\n  if (plan.idOutputName === undefined) {\n    return undefined;\n  }\n  const idValue = row[plan.idOutputName];\n\n  if (idValue === null || idValue === undefined) {\n    return undefined;\n  }\n  return buildRequiredAliasValue(row, plan);\n}\n\nfunction buildRequiredAliasValue(\n  row: Record<string, unknown>,\n  plan: AliasPlan,\n): unknown {\n  const base: Record<string, unknown> = {\n    [SELECTABLE_ALIAS_MARKER]: {\n      alias: plan.alias,\n      kind: plan.kind,\n    } satisfies SelectableAliasMarker,\n  };\n\n  for (const field of plan.systemFields) {\n    base[field.field] = nullToUndefined(row[field.outputName]);\n  }\n\n  if (plan.metaFields.length > 0) {\n    const meta: Record<string, unknown> = {};\n    for (const field of plan.metaFields) {\n      meta[field.metaKey] = nullToUndefined(row[field.outputName]);\n    }\n    base.meta = createGuardedProxy(meta, `${plan.alias}.meta`);\n  }\n\n  for (const field of plan.propsFields) {\n    const decoded = decodeSelectedValue(row[field.outputName], field.typeInfo);\n    base[field.field] = decoded;\n  }\n\n  return createGuardedProxy(base, plan.alias);\n}\n\nfunction createGuardedProxy(\n  target: Record<string, unknown>,\n  debugPath: string,\n): unknown {\n  return new Proxy(target, {\n    get: (object, property: string | symbol, receiver) => {\n      if (typeof property === \"symbol\") {\n        return Reflect.get(object, property, receiver) as unknown;\n      }\n\n      if (property === \"then\" || property === \"toJSON\") {\n        return;\n      }\n\n      if (property in object) {\n        return Reflect.get(object, property, receiver);\n      }\n\n      if (property in Object.prototype) {\n        return Reflect.get(Object.prototype, property, receiver) as unknown;\n      }\n\n      throw new MissingSelectiveFieldError(debugPath, property);\n    },\n  });\n}\n","/**\n * PreparedQuery — a pre-compiled, parameterized query.\n *\n * Created via `ExecutableQuery.prepare()`. Compiles the query AST to SQL once\n * at prepare time, then executes with different parameter bindings on each call.\n *\n * Fast path: when `backend.executeRaw` is available, executes pre-compiled SQL\n * text directly with substituted parameter values.\n *\n * Fallback: substitutes parameter refs in the AST, recompiles to SQL, and\n * executes via the standard `backend.execute` path.\n */\nimport { Placeholder } from \"drizzle-orm\";\n\nimport { type GraphBackend } from \"../../backend/types\";\nimport { ConfigurationError, UnsupportedPredicateError } from \"../../errors\";\nimport {\n  type BetweenPredicate,\n  type ComparisonPredicate,\n  type ComposableQuery,\n  type LiteralValue,\n  type PredicateExpression,\n  type QueryAst,\n  type SelectiveField,\n  type StringPredicate,\n} from \"../ast\";\nimport { compileQuery, type CompileQueryOptions } from \"../compiler/index\";\nimport { getDialect } from \"../dialect\";\nimport { type SqlDialect } from \"../dialect/types\";\nimport {\n  mapResults,\n  mapSelectiveResults,\n  MissingSelectiveFieldError,\n  transformPathColumns,\n} from \"../execution\";\nimport { isParameterRef } from \"../predicates\";\nimport { type SchemaIntrospector } from \"../schema-introspector\";\nimport {\n  type AliasMap,\n  type EdgeAliasMap,\n  type QueryBuilderState,\n  type SelectContext,\n} from \"./types\";\n\n// ============================================================\n// Parameter Substitution\n// ============================================================\n\nfunction toLiteral(value: unknown): LiteralValue {\n  if (value === null) {\n    throw new ConfigurationError(\n      \"Parameter value must not be null (use undefined-based patterns instead)\",\n      { parameterName: \"value\", valueType: \"null\" },\n    );\n  }\n  if (value instanceof Date) {\n    return { __type: \"literal\", value: value.toISOString(), valueType: \"date\" };\n  }\n  if (typeof value === \"string\") {\n    return { __type: \"literal\", value, valueType: \"string\" };\n  }\n  if (typeof value === \"number\") {\n    return { __type: \"literal\", value, valueType: \"number\" };\n  }\n  if (typeof value === \"boolean\") {\n    return { __type: \"literal\", value, valueType: \"boolean\" };\n  }\n  throw new ConfigurationError(\n    `Unsupported parameter value type: ${typeof value}`,\n    { parameterName: \"value\", actualType: typeof value },\n  );\n}\n\n/**\n * Walks a predicate expression tree and replaces ParameterRef nodes\n * with LiteralValue nodes using the provided bindings.\n */\nfunction substitutePredicateExpression(\n  expr: PredicateExpression,\n  bindings: Readonly<Record<string, unknown>>,\n): PredicateExpression {\n  switch (expr.__type) {\n    case \"comparison\": {\n      if (isParameterRef(expr.right)) {\n        const value = bindings[expr.right.name];\n        if (value === undefined) {\n          throw new ConfigurationError(\n            `Missing binding for parameter \"${expr.right.name}\"`,\n            { parameterName: expr.right.name },\n          );\n        }\n        return {\n          ...expr,\n          right: toLiteral(value),\n        } satisfies ComparisonPredicate;\n      }\n      return expr;\n    }\n\n    case \"string_op\": {\n      if (isParameterRef(expr.pattern)) {\n        const value = bindings[expr.pattern.name];\n        if (value === undefined) {\n          throw new ConfigurationError(\n            `Missing binding for parameter \"${expr.pattern.name}\"`,\n            { parameterName: expr.pattern.name },\n          );\n        }\n        if (typeof value !== \"string\") {\n          throw new ConfigurationError(\n            `Parameter \"${expr.pattern.name}\" must be a string for string operations`,\n            { parameterName: expr.pattern.name, actualType: typeof value },\n          );\n        }\n        return {\n          ...expr,\n          pattern: value,\n        } satisfies StringPredicate;\n      }\n      return expr;\n    }\n\n    case \"between\": {\n      const lowerIsParam = isParameterRef(expr.lower);\n      const upperIsParam = isParameterRef(expr.upper);\n      if (!lowerIsParam && !upperIsParam) return expr;\n\n      const lower =\n        lowerIsParam ?\n          toLiteral(resolveBinding(bindings, expr.lower.name))\n        : expr.lower;\n      const upper =\n        upperIsParam ?\n          toLiteral(resolveBinding(bindings, expr.upper.name))\n        : expr.upper;\n      return { ...expr, lower, upper } satisfies BetweenPredicate;\n    }\n\n    case \"and\": {\n      return {\n        ...expr,\n        predicates: expr.predicates.map((p) =>\n          substitutePredicateExpression(p, bindings),\n        ),\n      };\n    }\n\n    case \"or\": {\n      return {\n        ...expr,\n        predicates: expr.predicates.map((p) =>\n          substitutePredicateExpression(p, bindings),\n        ),\n      };\n    }\n\n    case \"not\": {\n      return {\n        ...expr,\n        predicate: substitutePredicateExpression(expr.predicate, bindings),\n      };\n    }\n\n    // These predicate types don't contain ParameterRef nodes\n    case \"null_check\":\n    case \"array_op\":\n    case \"object_op\":\n    case \"aggregate_comparison\":\n    case \"vector_similarity\":\n    case \"fulltext_match\": {\n      return expr;\n    }\n\n    case \"exists\": {\n      return {\n        ...expr,\n        subquery: substituteParameters(expr.subquery, bindings),\n      };\n    }\n\n    case \"in_subquery\": {\n      return {\n        ...expr,\n        subquery: substituteParameters(expr.subquery, bindings),\n      };\n    }\n  }\n}\n\nfunction resolveBinding(\n  bindings: Readonly<Record<string, unknown>>,\n  name: string,\n): unknown {\n  const value = bindings[name];\n  if (value === undefined) {\n    throw new ConfigurationError(`Missing binding for parameter \"${name}\"`, {\n      parameterName: name,\n    });\n  }\n  return value;\n}\n\n/**\n * Substitutes all ParameterRef nodes in a QueryAst with concrete values.\n */\nfunction substituteParameters(\n  ast: QueryAst,\n  bindings: Readonly<Record<string, unknown>>,\n): QueryAst {\n  return {\n    ...ast,\n    predicates: ast.predicates.map((pred) => ({\n      ...pred,\n      expression: substitutePredicateExpression(pred.expression, bindings),\n    })),\n    ...(ast.having !== undefined && {\n      having: substitutePredicateExpression(ast.having, bindings),\n    }),\n  };\n}\n\n// ============================================================\n// Placeholder Substitution for executeRaw Fast Path\n// ============================================================\n\n/**\n * Fills placeholder values in a parameter array.\n *\n * Drizzle's `sql.placeholder()` produces `Placeholder` objects in the params\n * array. This function replaces them with the actual bound values.\n */\nfunction fillPlaceholders(\n  params: readonly unknown[],\n  bindings: Readonly<Record<string, unknown>>,\n  dialect: SqlDialect,\n): unknown[] {\n  const adapter = getDialect(dialect);\n  return params.map((parameter) => {\n    if (parameter instanceof Placeholder) {\n      const name = parameter.name as string;\n      const value = bindings[name];\n      if (value === undefined) {\n        throw new ConfigurationError(\n          `Missing binding for parameter \"${name}\"`,\n          { parameterName: name },\n        );\n      }\n      if (value instanceof Date) return value.toISOString();\n      return adapter.bindValue(value);\n    }\n    return parameter;\n  });\n}\n\n// ============================================================\n// PreparedQuery\n// ============================================================\n\ntype PreparedQueryConfig<R> = Readonly<{\n  ast: QueryAst;\n  unoptimizedAst: QueryAst;\n  sqlText: string | undefined;\n  sqlParams: readonly unknown[] | undefined;\n  unoptimizedSqlText: string | undefined;\n  unoptimizedSqlParams: readonly unknown[] | undefined;\n  backend: GraphBackend;\n  dialect: SqlDialect;\n  graphId: string;\n  compileOptions: CompileQueryOptions;\n  state: QueryBuilderState;\n  selectiveFields: readonly SelectiveField[] | undefined;\n  selectFn: (context: SelectContext<AliasMap, EdgeAliasMap>) => R;\n  schemaIntrospector: SchemaIntrospector;\n}>;\n\n/**\n * A pre-compiled, parameterized query.\n *\n * @example\n * ```typescript\n * const prepared = store.query()\n *   .from(\"Person\", \"p\")\n *   .whereNode(\"p\", (p) => p.name.eq(param(\"name\")))\n *   .select((ctx) => ctx.p)\n *   .prepare();\n *\n * // Execute with different bindings\n * const alice = await prepared.execute({ name: \"Alice\" });\n * const bob = await prepared.execute({ name: \"Bob\" });\n * ```\n */\nexport class PreparedQuery<R> {\n  readonly #ast: QueryAst;\n  readonly #unoptimizedAst: QueryAst;\n  readonly #sqlText: string | undefined;\n  readonly #sqlParams: readonly unknown[] | undefined;\n  readonly #unoptimizedSqlText: string | undefined;\n  readonly #unoptimizedSqlParams: readonly unknown[] | undefined;\n  readonly #backend: GraphBackend;\n  readonly #dialect: SqlDialect;\n  readonly #graphId: string;\n  readonly #compileOptions: CompileQueryOptions;\n  readonly #state: QueryBuilderState;\n  readonly #selectiveFields: readonly SelectiveField[] | undefined;\n  readonly #selectFn: (context: SelectContext<AliasMap, EdgeAliasMap>) => R;\n  readonly #schemaIntrospector: SchemaIntrospector;\n  readonly #parameterMetadata: ParameterMetadata;\n\n  constructor(config: PreparedQueryConfig<R>) {\n    this.#ast = config.ast;\n    this.#unoptimizedAst = config.unoptimizedAst;\n    this.#sqlText = config.sqlText;\n    this.#sqlParams = config.sqlParams;\n    this.#unoptimizedSqlText = config.unoptimizedSqlText;\n    this.#unoptimizedSqlParams = config.unoptimizedSqlParams;\n    this.#backend = config.backend;\n    this.#dialect = config.dialect;\n    this.#graphId = config.graphId;\n    this.#compileOptions = config.compileOptions;\n    this.#state = config.state;\n    this.#selectiveFields = config.selectiveFields;\n    this.#selectFn = config.selectFn;\n    this.#schemaIntrospector = config.schemaIntrospector;\n    this.#parameterMetadata = collectParameterMetadata(this.#ast);\n  }\n\n  /** The set of parameter names required by this prepared query. */\n  get parameterNames(): ReadonlySet<string> {\n    return this.#parameterMetadata.names;\n  }\n\n  /**\n   * Executes the prepared query with the given parameter bindings.\n   *\n   * @param bindings - A record mapping parameter names to their values\n   * @returns The query results\n   */\n  async execute(\n    bindings: Readonly<Record<string, unknown>> = {},\n  ): Promise<readonly R[]> {\n    validateBindings(bindings, this.#parameterMetadata);\n\n    if (this.#selectiveFields !== undefined) {\n      try {\n        const rows = await this.#executeSelectiveRows(bindings);\n        return mapSelectiveResults<AliasMap, EdgeAliasMap, R>(\n          rows,\n          this.#state,\n          this.#selectiveFields,\n          this.#schemaIntrospector,\n          this.#selectFn,\n        );\n      } catch (error) {\n        if (\n          error instanceof MissingSelectiveFieldError ||\n          error instanceof UnsupportedPredicateError\n        ) {\n          // Fall back per-call without permanently disabling the optimized path,\n          // since different bindings may succeed on the optimized path.\n          // Note: this fallback is observable via query profiler hooks (onQueryStart\n          // fires twice — once for the optimized attempt, once for the fallback).\n          return this.#executeUnoptimized(bindings);\n        }\n        throw error;\n      }\n    }\n\n    return this.#executeUnoptimized(bindings);\n  }\n\n  async #executeSelectiveRows(\n    bindings: Readonly<Record<string, unknown>>,\n  ): Promise<readonly Record<string, unknown>[]> {\n    if (\n      this.#sqlText !== undefined &&\n      this.#sqlParams !== undefined &&\n      this.#backend.executeRaw !== undefined\n    ) {\n      const filledParams = fillPlaceholders(\n        this.#sqlParams,\n        bindings,\n        this.#dialect,\n      );\n      const rawRows = await this.#backend.executeRaw<Record<string, unknown>>(\n        this.#sqlText,\n        filledParams,\n      );\n      return transformPathColumns(rawRows, this.#state, this.#dialect);\n    }\n\n    const concreteAst = substituteParameters(this.#ast, bindings);\n    const compiled = compileQuery(\n      concreteAst,\n      this.#graphId,\n      this.#compileOptions,\n    );\n    const rawRows =\n      await this.#backend.execute<Record<string, unknown>>(compiled);\n    return transformPathColumns(rawRows, this.#state, this.#dialect);\n  }\n\n  async #executeUnoptimized(\n    bindings: Readonly<Record<string, unknown>>,\n  ): Promise<readonly R[]> {\n    const rows = await this.#executeUnoptimizedRows(bindings);\n    return mapResults<AliasMap, EdgeAliasMap, R>(\n      rows,\n      this.#state.startAlias,\n      this.#state.traversals,\n      this.#selectFn,\n    );\n  }\n\n  async #executeUnoptimizedRows(\n    bindings: Readonly<Record<string, unknown>>,\n  ): Promise<readonly Record<string, unknown>[]> {\n    if (\n      this.#unoptimizedSqlText !== undefined &&\n      this.#unoptimizedSqlParams !== undefined &&\n      this.#backend.executeRaw !== undefined\n    ) {\n      const filledParams = fillPlaceholders(\n        this.#unoptimizedSqlParams,\n        bindings,\n        this.#dialect,\n      );\n      const rawRows = await this.#backend.executeRaw<Record<string, unknown>>(\n        this.#unoptimizedSqlText,\n        filledParams,\n      );\n      return transformPathColumns(rawRows, this.#state, this.#dialect);\n    }\n\n    const concreteAst = substituteParameters(this.#unoptimizedAst, bindings);\n    const compiled = compileQuery(\n      concreteAst,\n      this.#graphId,\n      this.#compileOptions,\n    );\n    const rawRows =\n      await this.#backend.execute<Record<string, unknown>>(compiled);\n    return transformPathColumns(rawRows, this.#state, this.#dialect);\n  }\n}\n\ntype ParameterMetadata = Readonly<{\n  names: ReadonlySet<string>;\n  /** Parameters used in string_op predicates (must receive string values). */\n  stringOpParameters: ReadonlySet<string>;\n}>;\n\nfunction collectParameterMetadata(ast: QueryAst): ParameterMetadata {\n  const names = new Set<string>();\n  const stringOpParameters = new Set<string>();\n\n  collectParameterMetadataFromAst(ast, names, stringOpParameters);\n\n  return { names, stringOpParameters };\n}\n\nexport function hasParameterReferences(ast: QueryAst): boolean {\n  return collectParameterMetadata(ast).names.size > 0;\n}\n\nexport function composableQueryHasParameterReferences(\n  query: ComposableQuery,\n): boolean {\n  if (\"__type\" in query) {\n    return (\n      composableQueryHasParameterReferences(query.left) ||\n      composableQueryHasParameterReferences(query.right)\n    );\n  }\n  return hasParameterReferences(query);\n}\n\nfunction collectParameterMetadataFromAst(\n  ast: QueryAst,\n  names: Set<string>,\n  stringOpParameters: Set<string>,\n): void {\n  for (const predicate of ast.predicates) {\n    collectParameterMetadataFromExpression(\n      predicate.expression,\n      names,\n      stringOpParameters,\n    );\n  }\n  if (ast.having !== undefined) {\n    collectParameterMetadataFromExpression(\n      ast.having,\n      names,\n      stringOpParameters,\n    );\n  }\n}\n\nfunction collectParameterMetadataFromExpression(\n  expression: PredicateExpression,\n  names: Set<string>,\n  stringOpParameters: Set<string>,\n): void {\n  switch (expression.__type) {\n    case \"comparison\": {\n      if (isParameterRef(expression.right)) {\n        names.add(expression.right.name);\n      }\n      return;\n    }\n    case \"string_op\": {\n      if (isParameterRef(expression.pattern)) {\n        names.add(expression.pattern.name);\n        stringOpParameters.add(expression.pattern.name);\n      }\n      return;\n    }\n    case \"between\": {\n      if (isParameterRef(expression.lower)) {\n        names.add(expression.lower.name);\n      }\n      if (isParameterRef(expression.upper)) {\n        names.add(expression.upper.name);\n      }\n      return;\n    }\n    case \"and\":\n    case \"or\": {\n      for (const predicate of expression.predicates) {\n        collectParameterMetadataFromExpression(\n          predicate,\n          names,\n          stringOpParameters,\n        );\n      }\n      return;\n    }\n    case \"not\": {\n      collectParameterMetadataFromExpression(\n        expression.predicate,\n        names,\n        stringOpParameters,\n      );\n      return;\n    }\n    case \"null_check\":\n    case \"array_op\":\n    case \"object_op\":\n    case \"aggregate_comparison\":\n    case \"vector_similarity\":\n    case \"fulltext_match\": {\n      return;\n    }\n    case \"exists\": {\n      collectParameterMetadataFromAst(\n        expression.subquery,\n        names,\n        stringOpParameters,\n      );\n      return;\n    }\n    case \"in_subquery\": {\n      collectParameterMetadataFromAst(\n        expression.subquery,\n        names,\n        stringOpParameters,\n      );\n      return;\n    }\n  }\n}\n\nfunction validateBindings(\n  bindings: Readonly<Record<string, unknown>>,\n  metadata: ParameterMetadata,\n): void {\n  const { names: expectedNames, stringOpParameters } = metadata;\n\n  const missing: string[] = [];\n  for (const name of expectedNames) {\n    if (bindings[name] === undefined) {\n      missing.push(name);\n    }\n  }\n\n  if (missing.length > 0) {\n    throw new ConfigurationError(\n      `Missing bindings for parameter${missing.length === 1 ? \"\" : \"s\"}: ${missing.map((name) => `\"${name}\"`).join(\", \")}`,\n      { missingParameters: missing },\n    );\n  }\n\n  const unexpected = Object.keys(bindings).filter(\n    (name) => !expectedNames.has(name),\n  );\n  if (unexpected.length > 0) {\n    throw new ConfigurationError(\n      `Unexpected bindings provided: ${unexpected.map((name) => `\"${name}\"`).join(\", \")}`,\n      { unexpectedParameters: unexpected },\n    );\n  }\n\n  // Validate value types upfront so both the fast path (executeRaw) and the\n  // fallback path (AST substitution) reject the same invalid inputs.\n  for (const name of expectedNames) {\n    const value = bindings[name];\n    validateBindingValue(name, value, stringOpParameters.has(name));\n  }\n}\n\nfunction validateBindingValue(\n  name: string,\n  value: unknown,\n  isStringOp: boolean,\n): void {\n  if (value === null) {\n    throw new ConfigurationError(\n      \"Parameter value must not be null (use undefined-based patterns instead)\",\n      { parameterName: name, valueType: \"null\" },\n    );\n  }\n  if (isStringOp) {\n    if (typeof value !== \"string\") {\n      throw new ConfigurationError(\n        `Parameter \"${name}\" must be a string for string operations`,\n        { parameterName: name, actualType: typeof value },\n      );\n    }\n    return;\n  }\n  if (\n    value instanceof Date ||\n    typeof value === \"string\" ||\n    typeof value === \"number\" ||\n    typeof value === \"boolean\"\n  ) {\n    return;\n  }\n  throw new ConfigurationError(\n    `Unsupported parameter value type: ${typeof value}`,\n    { parameterName: name, actualType: typeof value },\n  );\n}\n","/**\n * SQL Identifier Validation\n *\n * Validates aliases and identifiers to prevent SQL injection.\n */\nimport { ValidationError } from \"../../errors\";\nimport { type HybridFusionOptions, type PredicateExpression } from \"../ast\";\n\n/**\n * Pattern for valid SQL identifiers (aliases).\n * Must start with a letter or underscore, followed by letters, digits, or underscores.\n * Maximum length of 63 characters (PostgreSQL limit).\n */\nconst SQL_IDENTIFIER_PATTERN = /^[a-zA-Z_][a-zA-Z0-9_]{0,62}$/;\n\n/**\n * Reserved SQL keywords that cannot be used as aliases.\n */\nconst SQL_RESERVED_KEYWORDS = new Set([\n  \"select\",\n  \"from\",\n  \"where\",\n  \"and\",\n  \"or\",\n  \"not\",\n  \"in\",\n  \"is\",\n  \"null\",\n  \"true\",\n  \"false\",\n  \"as\",\n  \"on\",\n  \"join\",\n  \"left\",\n  \"right\",\n  \"inner\",\n  \"outer\",\n  \"cross\",\n  \"full\",\n  \"group\",\n  \"by\",\n  \"having\",\n  \"order\",\n  \"asc\",\n  \"desc\",\n  \"limit\",\n  \"offset\",\n  \"union\",\n  \"intersect\",\n  \"except\",\n  \"all\",\n  \"distinct\",\n  \"case\",\n  \"when\",\n  \"then\",\n  \"else\",\n  \"end\",\n  \"exists\",\n  \"between\",\n  \"like\",\n  \"ilike\",\n  \"insert\",\n  \"update\",\n  \"delete\",\n  \"create\",\n  \"drop\",\n  \"alter\",\n  \"table\",\n  \"index\",\n  \"view\",\n  \"with\",\n  \"recursive\",\n]);\n\n/**\n * Validates that an alias is a safe SQL identifier.\n *\n * @param alias - The alias to validate\n * @throws ValidationError if the alias is not a valid SQL identifier\n */\nexport function validateSqlIdentifier(alias: string): void {\n  if (!SQL_IDENTIFIER_PATTERN.test(alias)) {\n    throw new ValidationError(\n      `Invalid alias \"${alias}\": must start with a letter or underscore, ` +\n        `contain only letters, digits, and underscores, and be at most 63 characters`,\n      {\n        issues: [\n          {\n            path: \"alias\",\n            message: `\"${alias}\" is not a valid SQL identifier`,\n          },\n        ],\n      },\n      {\n        suggestion: `Use a simple identifier like \"p\", \"e\", \"node1\", or \"my_alias\".`,\n      },\n    );\n  }\n\n  if (alias.toLowerCase().startsWith(\"cte_\")) {\n    throw new ValidationError(\n      `Invalid alias \"${alias}\": aliases starting with \"cte_\" are reserved for internal use`,\n      {\n        issues: [\n          {\n            path: \"alias\",\n            message: `\"${alias}\" conflicts with internal CTE naming`,\n          },\n        ],\n      },\n      {\n        suggestion: `Choose an alias that does not start with \"cte_\".`,\n      },\n    );\n  }\n\n  if (SQL_RESERVED_KEYWORDS.has(alias.toLowerCase())) {\n    throw new ValidationError(\n      `Invalid alias \"${alias}\": \"${alias}\" is a reserved SQL keyword`,\n      {\n        issues: [\n          { path: \"alias\", message: `\"${alias}\" is a reserved SQL keyword` },\n        ],\n      },\n      {\n        suggestion: `Choose a different alias. Reserved words like SELECT, FROM, WHERE cannot be used.`,\n      },\n    );\n  }\n}\n\n/**\n * Walks a predicate expression and rejects placement under OR/NOT for\n * structural predicates (vector / fulltext) — those rewrite the query\n * shape and are incompatible with disjunction or negation. Both\n * predicate kinds use this same machinery; the `match` callback selects\n * which one is being validated.\n */\nfunction validateStructuralPredicatePlacement(\n  expression: PredicateExpression,\n  matchType: \"vector_similarity\" | \"fulltext_match\",\n  buildError: (path: string) => never,\n  inDisallowedBranch: boolean,\n  path: string,\n): void {\n  if (expression.__type === matchType) {\n    if (inDisallowedBranch) buildError(path);\n    return;\n  }\n  switch (expression.__type) {\n    case \"and\": {\n      for (const [index, child] of expression.predicates.entries()) {\n        validateStructuralPredicatePlacement(\n          child,\n          matchType,\n          buildError,\n          inDisallowedBranch,\n          `${path}.predicates[${index}]`,\n        );\n      }\n      return;\n    }\n    case \"or\": {\n      for (const [index, child] of expression.predicates.entries()) {\n        validateStructuralPredicatePlacement(\n          child,\n          matchType,\n          buildError,\n          true,\n          `${path}.predicates[${index}]`,\n        );\n      }\n      return;\n    }\n    case \"not\": {\n      validateStructuralPredicatePlacement(\n        expression.predicate,\n        matchType,\n        buildError,\n        true,\n        `${path}.predicate`,\n      );\n      return;\n    }\n    case \"comparison\":\n    case \"string_op\":\n    case \"null_check\":\n    case \"between\":\n    case \"array_op\":\n    case \"object_op\":\n    case \"aggregate_comparison\":\n    case \"exists\":\n    case \"in_subquery\":\n    case \"vector_similarity\":\n    case \"fulltext_match\": {\n      return;\n    }\n  }\n}\n\nfunction throwInvalidVectorPredicatePlacement(path: string): never {\n  throw new ValidationError(\n    \"Vector similarity predicates cannot be nested under OR or NOT. \" +\n      \"Use top-level AND combinations instead.\",\n    {\n      issues: [\n        {\n          path,\n          message:\n            \"Vector similarity predicates are only supported at top-level \" +\n            \"or inside AND groups.\",\n        },\n      ],\n    },\n    {\n      suggestion:\n        \"Rewrite the predicate to keep vector similarity at top-level \" +\n        \"or combine with additional filters using AND.\",\n    },\n  );\n}\n\nfunction throwInvalidFulltextPredicatePlacement(path: string): never {\n  throw new ValidationError(\n    \"Fulltext match predicates (.matches()) cannot be nested under OR or NOT. \" +\n      \"Use top-level AND combinations instead.\",\n    {\n      issues: [\n        {\n          path,\n          message:\n            \"Fulltext match predicates are only supported at top-level \" +\n            \"or inside AND groups.\",\n        },\n      ],\n    },\n    {\n      suggestion:\n        \"Restructure your query so the fulltext match appears at the top level \" +\n        \"of a whereNode() or inside an .and() combination.\",\n    },\n  );\n}\n\nexport function validateVectorPredicatePlacement(\n  predicates: readonly { expression: PredicateExpression }[],\n): void {\n  for (const [index, predicate] of predicates.entries()) {\n    validateStructuralPredicatePlacement(\n      predicate.expression,\n      \"vector_similarity\",\n      throwInvalidVectorPredicatePlacement,\n      false,\n      `predicates[${index}].expression`,\n    );\n  }\n}\n\nexport function validateFulltextPredicatePlacement(\n  predicates: readonly { expression: PredicateExpression }[],\n): void {\n  for (const [index, predicate] of predicates.entries()) {\n    validateStructuralPredicatePlacement(\n      predicate.expression,\n      \"fulltext_match\",\n      throwInvalidFulltextPredicatePlacement,\n      false,\n      `predicates[${index}].expression`,\n    );\n  }\n}\n\n/**\n * Validates fusion options shared by `QueryBuilder.fuseWith()` and\n * `store.search.hybrid({ fusion })`. Rejects unsupported methods, and\n * non-finite / non-positive k, and negative / non-finite weights.\n */\nexport function validateHybridFusionOptions(\n  options: HybridFusionOptions,\n): void {\n  // Cast through string to survive callers that bypass the TS type\n  // (e.g. user-supplied JSON on the store.search.hybrid path).\n  const method = options.method as string | undefined;\n  if (method !== undefined && method !== \"rrf\") {\n    throw new ValidationError(`Unsupported fusion method: ${method}`, {\n      issues: [{ path: \"fusion.method\", message: `Only \"rrf\" is supported.` }],\n    });\n  }\n  const { k } = options;\n  if (k !== undefined && (!Number.isFinite(k) || k <= 0)) {\n    throw new ValidationError(\n      `Fusion k must be a positive finite number, got: ${String(k)}`,\n      {\n        issues: [{ path: \"fusion.k\", message: \"Must be a positive number.\" }],\n      },\n    );\n  }\n  const weights = options.weights;\n  if (weights !== undefined) {\n    for (const key of [\"vector\", \"fulltext\"] as const) {\n      const weight = weights[key];\n      if (weight !== undefined && (!Number.isFinite(weight) || weight < 0)) {\n        throw new ValidationError(\n          `Fusion weight for \"${key}\" must be a non-negative finite number, got: ${String(weight)}`,\n          {\n            issues: [\n              {\n                path: `fusion.weights.${key}`,\n                message: \"Must be a non-negative number.\",\n              },\n            ],\n          },\n        );\n      }\n    }\n  }\n}\n","/**\n * AST Builder utilities for query construction.\n *\n * Provides shared functions for building QueryAst objects from builder state.\n */\nimport { type QueryAst } from \"../ast\";\nimport type { QueryBuilderConfig, QueryBuilderState } from \"./types\";\nimport {\n  validateFulltextPredicatePlacement,\n  validateVectorPredicatePlacement,\n} from \"./validation\";\n\n/**\n * Builds a QueryAst from builder config and state.\n *\n * This is shared by ExecutableQuery and ExecutableAggregateQuery to avoid\n * duplicating the AST construction logic.\n */\nexport function buildQueryAst(\n  config: QueryBuilderConfig,\n  state: QueryBuilderState,\n): QueryAst {\n  validateVectorPredicatePlacement(state.predicates);\n  validateFulltextPredicatePlacement(state.predicates);\n\n  const temporalMode: { mode: typeof state.temporalMode; asOf?: string } = {\n    mode: state.temporalMode,\n  };\n  if (state.asOf !== undefined) {\n    temporalMode.asOf = state.asOf;\n  }\n\n  return {\n    graphId: config.graphId,\n    start: {\n      alias: state.startAlias,\n      kinds: state.startKinds,\n      includeSubClasses: state.includeSubClasses,\n    },\n    traversals: state.traversals,\n    predicates: state.predicates,\n    projection: {\n      fields: state.projection,\n    },\n    temporalMode,\n    ...(state.orderBy.length > 0 && { orderBy: state.orderBy }),\n    ...(state.limit !== undefined && { limit: state.limit }),\n    ...(state.offset !== undefined && { offset: state.offset }),\n    ...(state.groupBy !== undefined && { groupBy: state.groupBy }),\n    ...(state.having !== undefined && { having: state.having }),\n    ...(state.fusion !== undefined && { fusion: state.fusion }),\n  };\n}\n","/**\n * Shared `CompileQueryOptions` construction for the executable query,\n * aggregate query, and unionable query builders. Keeps one source of\n * truth for which config fields are propagated to the compiler.\n */\nimport { resolveEmbeddingFields } from \"../../core/embedding\";\nimport { type KindRegistry } from \"../../registry/kind-registry\";\nimport { type CompileQueryOptions } from \"../compiler/index\";\nimport {\n  type VectorSlotDescriptor,\n  vectorSlotKey,\n  type VectorSlotMap,\n} from \"../compiler/schema\";\nimport { type QueryBuilderConfig } from \"./types\";\n\nexport function buildCompileOptions(\n  config: QueryBuilderConfig,\n): CompileQueryOptions {\n  const fulltextStrategy = config.backend?.fulltextStrategy;\n  const vectorStrategy = config.backend?.vectorStrategy;\n  return {\n    dialect: config.dialect ?? \"sqlite\",\n    schema: config.schema,\n    windowFunctions: config.backend?.capabilities.windowFunctions ?? true,\n    ...(fulltextStrategy === undefined ? {} : { fulltextStrategy }),\n    ...(vectorStrategy === undefined ?\n      {}\n    : { vectorStrategy, vectorSlots: buildVectorSlots(config.registry) }),\n  };\n}\n\n/**\n * Memoizes the {@link VectorSlotMap} per registry. A registry is immutable\n * for its lifetime, and `buildCompileOptions` runs on every query compile, so\n * caching avoids re-walking every node kind's schema (and re-allocating the\n * map) on each query — including the majority that contain no `similarTo()`.\n */\nconst vectorSlotsCache = new WeakMap<KindRegistry, VectorSlotMap>();\n\n/**\n * Builds the compiler's {@link VectorSlotMap} from every registered node\n * kind's embedding fields. Used only when a vector strategy is present —\n * it tells the `field.similarTo(...)` CTE which `(kind, fieldPath)` pairs\n * back a per-field table, so the UNION ALL only scans kinds that declare\n * the field. Memoized per (immutable) registry.\n */\nfunction buildVectorSlots(registry: KindRegistry): VectorSlotMap {\n  const cached = vectorSlotsCache.get(registry);\n  if (cached !== undefined) return cached;\n\n  const slots = new Map<string, VectorSlotDescriptor>();\n  for (const [nodeKind, nodeType] of registry.nodeKinds) {\n    for (const field of resolveEmbeddingFields(nodeType.schema)) {\n      slots.set(vectorSlotKey(nodeKind, field.fieldPath), {\n        dimensions: field.dimensions,\n        metric: field.metric,\n        indexType: field.indexType,\n      });\n    }\n  }\n  vectorSlotsCache.set(registry, slots);\n  return slots;\n}\n","/**\n * ExecutableQuery - A query that can be executed, paginated, or streamed.\n */\nimport { type SQL } from \"drizzle-orm\";\n\nimport {\n  type GraphBackend,\n  type TransactionBackend,\n} from \"../../backend/types\";\nimport { DEFAULT_PAGINATION_LIMIT } from \"../../constants\";\nimport { type GraphDef } from \"../../core/define-graph\";\nimport { UnsupportedPredicateError, ValidationError } from \"../../errors\";\nimport {\n  mergeEdgeKinds,\n  type OrderSpec,\n  type QueryAst,\n  type SelectiveField,\n  type SortDirection,\n} from \"../ast\";\nimport { compileQuery, type CompileQueryOptions } from \"../compiler/index\";\nimport {\n  buildCursorFromRow,\n  type CursorData,\n  decodeCursor,\n  validateCursorColumns,\n} from \"../cursor\";\nimport {\n  buildCursorPredicate,\n  buildPaginatedResult,\n  buildSelectContext,\n  buildSelectiveFields,\n  createStreamIterable,\n  createTrackingContext,\n  decodeSelectedValue,\n  FieldAccessTracker,\n  getStreamBatchSize,\n  mapResults,\n  mapSelectiveResults,\n  MissingSelectiveFieldError,\n  nullToUndefined,\n  transformPathColumns,\n} from \"../execution\";\nimport { jsonPointer, parseJsonPointer } from \"../json-pointer\";\nimport { fieldRef } from \"../predicates\";\nimport { type FieldTypeInfo } from \"../schema-introspector\";\nimport { buildQueryAst } from \"./ast-builder\";\nimport { buildCompileOptions } from \"./compile-options\";\nimport { hasParameterReferences, PreparedQuery } from \"./prepared-query\";\nimport {\n  type AliasMap,\n  type EdgeAliasMap,\n  type PaginatedResult,\n  type PaginateOptions,\n  type QueryBuilderConfig,\n  type QueryBuilderState,\n  type RecursiveAliasMap,\n  type SelectContext,\n  type StreamOptions,\n} from \"./types\";\nimport { type UnionableQuery } from \"./unionable-query\";\n\nconst NOT_COMPUTED = Symbol(\"NOT_COMPUTED\");\n\n// Forward declaration for UnionableQuery to avoid circular imports\ntype UnionableQueryConstructor = new (\n  config: QueryBuilderConfig,\n  state: {\n    left: QueryAst;\n    operator: \"union\" | \"unionAll\" | \"intersect\" | \"except\";\n    right: QueryAst;\n    // Additional state for result transformation\n    startAlias: string;\n    traversals: QueryBuilderState[\"traversals\"];\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Allow any select function type for set operations\n    selectFn: (context: SelectContext<any, any>) => unknown;\n  },\n) => unknown;\n\nlet UnionableQueryClass: UnionableQueryConstructor;\n\n/**\n * Sets the UnionableQuery class reference.\n * Called during module initialization to break circular dependency.\n */\nexport function setUnionableQueryClass(cls: UnionableQueryConstructor): void {\n  UnionableQueryClass = cls;\n}\n\n/**\n * A query that can be executed.\n */\nexport class ExecutableQuery<\n  G extends GraphDef,\n  Aliases extends AliasMap,\n  // eslint-disable-next-line @typescript-eslint/no-empty-object-type -- Empty object for initial empty edge alias map\n  EdgeAliases extends EdgeAliasMap = {},\n  // eslint-disable-next-line @typescript-eslint/no-empty-object-type -- Empty when no recursive aliases\n  RecursiveAliases extends RecursiveAliasMap = {},\n  R = unknown,\n> {\n  readonly #config: QueryBuilderConfig;\n  readonly #state: QueryBuilderState;\n  readonly #selectFn: (\n    context: SelectContext<Aliases, EdgeAliases, RecursiveAliases>,\n  ) => R;\n  #cachedCompiled: SQL | typeof NOT_COMPUTED = NOT_COMPUTED;\n  #cachedOptimizedCompiled: SQL | typeof NOT_COMPUTED = NOT_COMPUTED;\n  #cachedSelectiveFieldsForExecute:\n    | readonly SelectiveField[]\n    | typeof NOT_COMPUTED\n    | undefined = NOT_COMPUTED;\n  #cachedSelectiveFieldsForPagination:\n    | readonly SelectiveField[]\n    | typeof NOT_COMPUTED\n    | undefined = NOT_COMPUTED;\n\n  constructor(\n    config: QueryBuilderConfig,\n    state: QueryBuilderState,\n    selectFunction: (\n      context: SelectContext<Aliases, EdgeAliases, RecursiveAliases>,\n    ) => R,\n  ) {\n    this.#config = config;\n    this.#state = state;\n    this.#selectFn = selectFunction;\n  }\n\n  /**\n   * Builds the query AST.\n   */\n  toAst(): QueryAst {\n    return buildQueryAst(this.#config, this.#state);\n  }\n\n  /**\n   * Orders results.\n   */\n  orderBy<A extends (keyof Aliases | keyof EdgeAliases) & string>(\n    alias: A,\n    field: string,\n    direction: SortDirection = \"asc\",\n  ): ExecutableQuery<G, Aliases, EdgeAliases, RecursiveAliases, R> {\n    const edgeTraversal = this.#state.traversals.find(\n      (traversal) => traversal.edgeAlias === alias,\n    );\n    const isEdge = edgeTraversal !== undefined;\n    const isSystem =\n      field === \"id\" ||\n      field === \"kind\" ||\n      (isEdge && (field === \"from_id\" || field === \"to_id\"));\n\n    let typeInfo: FieldTypeInfo | undefined;\n    if (!isSystem) {\n      if (isEdge) {\n        const edgeKindNames = mergeEdgeKinds(edgeTraversal);\n        typeInfo = this.#config.schemaIntrospector.getSharedEdgeFieldTypeInfo(\n          edgeKindNames,\n          field,\n        );\n      } else {\n        const kindNames =\n          alias === this.#state.startAlias ?\n            this.#state.startKinds\n          : this.#state.traversals.find(\n              (traversal) => traversal.nodeAlias === alias,\n            )?.nodeKinds;\n        typeInfo =\n          kindNames ?\n            this.#config.schemaIntrospector.getSharedFieldTypeInfo(\n              kindNames,\n              field,\n            )\n          : undefined;\n      }\n    }\n\n    const orderSpec: OrderSpec =\n      isSystem ?\n        {\n          field: fieldRef(alias, [field], { valueType: \"string\" }),\n          direction,\n        }\n      : {\n          field: fieldRef(alias, [\"props\"], {\n            jsonPointer: jsonPointer([field]),\n            valueType: typeInfo?.valueType,\n            elementType: typeInfo?.elementType,\n          }),\n          direction,\n        };\n\n    const newState: QueryBuilderState = {\n      ...this.#state,\n      orderBy: [...this.#state.orderBy, orderSpec],\n    };\n\n    return new ExecutableQuery(this.#config, newState, this.#selectFn);\n  }\n\n  /**\n   * Limits the number of results.\n   */\n  limit(\n    n: number,\n  ): ExecutableQuery<G, Aliases, EdgeAliases, RecursiveAliases, R> {\n    return new ExecutableQuery(\n      this.#config,\n      { ...this.#state, limit: n },\n      this.#selectFn,\n    );\n  }\n\n  /**\n   * Offsets the results.\n   */\n  offset(\n    n: number,\n  ): ExecutableQuery<G, Aliases, EdgeAliases, RecursiveAliases, R> {\n    return new ExecutableQuery(\n      this.#config,\n      { ...this.#state, offset: n },\n      this.#selectFn,\n    );\n  }\n\n  /**\n   * Applies a query fragment to transform this executable query.\n   *\n   * Useful for applying post-select transformations like ordering,\n   * limits, and offsets from reusable fragments.\n   *\n   * @example\n   * ```typescript\n   * const paginated = (q) => q.orderBy(\"u\", \"createdAt\", \"desc\").limit(10);\n   *\n   * const results = await query()\n   *   .from(\"User\", \"u\")\n   *   .select((ctx) => ctx.u)\n   *   .pipe(paginated)\n   *   .execute();\n   * ```\n   *\n   * @param fragment - A function that transforms the executable query\n   * @returns The transformed executable query\n   */\n  pipe<NewR = R>(\n    fragment: (\n      query: ExecutableQuery<G, Aliases, EdgeAliases, RecursiveAliases, R>,\n    ) => ExecutableQuery<G, Aliases, EdgeAliases, RecursiveAliases, NewR>,\n  ): ExecutableQuery<G, Aliases, EdgeAliases, RecursiveAliases, NewR> {\n    return fragment(this);\n  }\n\n  /**\n   * Combines this query with another using UNION (removes duplicates).\n   */\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Allow any alias map for set operations\n  union(other: ExecutableQuery<G, any, any, any, R>): UnionableQuery<G, R> {\n    return new UnionableQueryClass(this.#config, {\n      left: this.toAst(),\n      operator: \"union\",\n      right: other.toAst(),\n      // Pass state for result transformation\n      startAlias: this.#state.startAlias,\n      traversals: this.#state.traversals,\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Type erasure for set operations\n      selectFn: this.#selectFn as (context: SelectContext<any, any>) => unknown,\n    }) as UnionableQuery<G, R>;\n  }\n\n  /**\n   * Combines this query with another using UNION ALL (keeps duplicates).\n   */\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Allow any alias map for set operations\n  unionAll(other: ExecutableQuery<G, any, any, any, R>): UnionableQuery<G, R> {\n    return new UnionableQueryClass(this.#config, {\n      left: this.toAst(),\n      operator: \"unionAll\",\n      right: other.toAst(),\n      // Pass state for result transformation\n      startAlias: this.#state.startAlias,\n      traversals: this.#state.traversals,\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Type erasure for set operations\n      selectFn: this.#selectFn as (context: SelectContext<any, any>) => unknown,\n    }) as UnionableQuery<G, R>;\n  }\n\n  /**\n   * Combines this query with another using INTERSECT.\n   */\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Allow any alias map for set operations\n  intersect(other: ExecutableQuery<G, any, any, any, R>): UnionableQuery<G, R> {\n    return new UnionableQueryClass(this.#config, {\n      left: this.toAst(),\n      operator: \"intersect\",\n      right: other.toAst(),\n      // Pass state for result transformation\n      startAlias: this.#state.startAlias,\n      traversals: this.#state.traversals,\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Type erasure for set operations\n      selectFn: this.#selectFn as (context: SelectContext<any, any>) => unknown,\n    }) as UnionableQuery<G, R>;\n  }\n\n  /**\n   * Combines this query with another using EXCEPT.\n   */\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Allow any alias map for set operations\n  except(other: ExecutableQuery<G, any, any, any, R>): UnionableQuery<G, R> {\n    return new UnionableQueryClass(this.#config, {\n      left: this.toAst(),\n      operator: \"except\",\n      right: other.toAst(),\n      // Pass state for result transformation\n      startAlias: this.#state.startAlias,\n      traversals: this.#state.traversals,\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Type erasure for set operations\n      selectFn: this.#selectFn as (context: SelectContext<any, any>) => unknown,\n    }) as UnionableQuery<G, R>;\n  }\n\n  /**\n   * Compiles the query and returns the SQL text and parameters.\n   *\n   * Requires a backend to be configured (the backend determines the SQL dialect).\n   * Use this for debugging, logging, or running the query with a custom executor.\n   */\n  toSQL(): Readonly<{ sql: string; params: readonly unknown[] }> {\n    if (!this.#config.backend?.compileSql) {\n      throw new Error(\n        \"Cannot convert to SQL: no backend configured or backend does not support compileSql. \" +\n          \"Use store.query() to get a backend-aware query builder.\",\n      );\n    }\n    return this.#config.backend.compileSql(this.compile());\n  }\n\n  /**\n   * Compiles the query to a Drizzle SQL object.\n   *\n   * Returns a Drizzle SQL object that can be executed directly\n   * with db.all(), db.get(), etc.\n   */\n  compile(): SQL {\n    if (this.#cachedCompiled !== NOT_COMPUTED) return this.#cachedCompiled;\n    const ast = this.toAst();\n    const compiled = compileQuery(\n      ast,\n      this.#config.graphId,\n      this.#compileOptions(),\n    );\n    this.#cachedCompiled = compiled;\n    return compiled;\n  }\n\n  /**\n   * Creates a prepared (pre-compiled) query that can be executed\n   * multiple times with different parameter bindings.\n   *\n   * Use `param(\"name\")` in predicates to create parameterized slots,\n   * then pass values via `prepared.execute({ name: \"value\" })`.\n   *\n   * @example\n   * ```typescript\n   * import { param } from \"@nicia-ai/typegraph\";\n   *\n   * const prepared = store.query()\n   *   .from(\"Person\", \"p\")\n   *   .whereNode(\"p\", (p) => p.name.eq(param(\"name\")))\n   *   .select((ctx) => ctx.p)\n   *   .prepare();\n   *\n   * const alice = await prepared.execute({ name: \"Alice\" });\n   * const bob = await prepared.execute({ name: \"Bob\" });\n   * ```\n   *\n   * @throws Error if no backend is configured\n   */\n  prepare(): PreparedQuery<R> {\n    if (!this.#config.backend) {\n      throw new Error(\n        \"Cannot prepare query: no backend configured. \" +\n          \"Use store.query() or pass a backend to createQueryBuilder().\",\n      );\n    }\n\n    // Build AST once\n    const baseAst = buildQueryAst(this.#config, this.#state);\n\n    // Attempt selective field optimization\n    const selectiveFields = this.#getSelectiveFieldsForExecute();\n    const ast =\n      selectiveFields === undefined ? baseAst : { ...baseAst, selectiveFields };\n    const unoptimizedAst = baseAst;\n\n    // Compile once\n    const compileOptions = this.#compileOptions();\n    const compiled = compileQuery(ast, this.#config.graphId, compileOptions);\n\n    // Pre-compile to SQL text if the backend supports it\n    let sqlText: string | undefined;\n    let sqlParams: readonly unknown[] | undefined;\n    let unoptimizedSqlText: string | undefined;\n    let unoptimizedSqlParams: readonly unknown[] | undefined;\n    if (this.#config.backend.compileSql !== undefined) {\n      const result = this.#config.backend.compileSql(compiled);\n      sqlText = result.sql;\n      sqlParams = result.params;\n\n      const unoptimizedCompiled = compileQuery(\n        unoptimizedAst,\n        this.#config.graphId,\n        compileOptions,\n      );\n      const unoptimizedResult =\n        this.#config.backend.compileSql(unoptimizedCompiled);\n      unoptimizedSqlText = unoptimizedResult.sql;\n      unoptimizedSqlParams = unoptimizedResult.params;\n    }\n\n    return new PreparedQuery({\n      ast,\n      unoptimizedAst,\n      sqlText,\n      sqlParams,\n      unoptimizedSqlText,\n      unoptimizedSqlParams,\n      backend: this.#config.backend,\n      dialect: this.#config.dialect ?? \"sqlite\",\n      graphId: this.#config.graphId,\n      compileOptions: compileOptions,\n      state: this.#state,\n      selectiveFields,\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Type erasure needed for PreparedQuery which uses AliasMap\n      selectFn: this.#selectFn as (context: SelectContext<any, any>) => R,\n      schemaIntrospector: this.#config.schemaIntrospector,\n    });\n  }\n\n  /**\n   * Builds compile options from the config.\n   */\n  #compileOptions(): CompileQueryOptions {\n    return buildCompileOptions(this.#config);\n  }\n\n  #requireBackend(): GraphBackend {\n    const { backend } = this.#config;\n    if (backend === undefined) {\n      throw new Error(\n        \"Cannot execute query: no backend configured. \" +\n          \"Provide a backend when creating the QueryBuilder.\",\n      );\n    }\n    return backend;\n  }\n\n  /**\n   * Executes the query and returns typed results.\n   *\n   * Uses smart optimization to detect when only specific fields are accessed\n   * in the select callback. If the callback only accesses simple field\n   * references (no method calls or computations), generates optimized SQL\n   * that only extracts those fields instead of the full props blob.\n   *\n   * @throws Error if no backend is configured\n   */\n  async execute(): Promise<readonly R[]> {\n    if (!this.#config.backend) {\n      throw new Error(\n        \"Cannot execute query: no backend configured. \" +\n          \"Use store.query() or pass a backend to createQueryBuilder().\",\n      );\n    }\n\n    // Guard: reject queries with param() refs — must use .prepare().execute({...})\n    if (hasParameterReferences(this.toAst())) {\n      throw new Error(\n        \"Query contains param() references. Use .prepare().execute({...}) instead of .execute().\",\n      );\n    }\n\n    // Phase 1: Try optimized execution\n    const optimizedResult = await this.#tryOptimizedExecution();\n    if (optimizedResult !== undefined) {\n      return optimizedResult;\n    }\n\n    // Phase 2: Fall back to full fetch (existing behavior)\n    const compiled = this.compile();\n    const rawRows =\n      await this.#config.backend.execute<Record<string, unknown>>(compiled);\n\n    // Transform path columns for SQLite (converts \"|id1|id2|\" to [\"id1\", \"id2\"])\n    const dialect = this.#config.dialect ?? \"sqlite\";\n    const rows = transformPathColumns(rawRows, this.#state, dialect);\n\n    // Cast: runtime context includes recursive aliases; type erasure in mapResults is safe\n    return mapResults<Aliases, EdgeAliases, R, RecursiveAliases>(\n      rows,\n      this.#state.startAlias,\n      this.#state.traversals,\n      this.#selectFn,\n    );\n  }\n\n  /**\n   * Executes the query against a provided backend.\n   *\n   * Used by `store.batch()` to run multiple queries over a single connection\n   * (e.g., within a transaction). The full compile → execute → transform\n   * pipeline runs identically to `execute()`, but against the given backend.\n   */\n  async executeOn(\n    backend: GraphBackend | TransactionBackend,\n  ): Promise<readonly R[]> {\n    // Guard: reject queries with param() refs — must use .prepare().execute({...})\n    if (hasParameterReferences(this.toAst())) {\n      throw new Error(\n        \"Query contains param() references. Use .prepare().execute({...}) instead of .execute().\",\n      );\n    }\n\n    // Try optimized execution with the provided backend\n    const optimizedResult = await this.#tryOptimizedExecutionOn(backend);\n    if (optimizedResult !== undefined) {\n      return optimizedResult;\n    }\n\n    // Fall back to full fetch\n    const compiled = this.compile();\n    const rawRows = await backend.execute<Record<string, unknown>>(compiled);\n    const dialect = this.#config.dialect ?? \"sqlite\";\n    const rows = transformPathColumns(rawRows, this.#state, dialect);\n\n    return mapResults<Aliases, EdgeAliases, R, RecursiveAliases>(\n      rows,\n      this.#state.startAlias,\n      this.#state.traversals,\n      this.#selectFn,\n    );\n  }\n\n  /**\n   * Attempts optimized execution by tracking which fields the select callback accesses.\n   *\n   * Returns undefined if optimization is not possible (callback uses method calls,\n   * computations, or returns whole nodes).\n   */\n  async #tryOptimizedExecution(): Promise<readonly R[] | undefined> {\n    const selectiveFields = this.#getSelectiveFieldsForExecute();\n    if (selectiveFields === undefined) {\n      return undefined;\n    }\n\n    // Build and compile optimized query (cached per instance)\n    let compiled: SQL;\n    if (this.#cachedOptimizedCompiled === NOT_COMPUTED) {\n      const baseAst = buildQueryAst(this.#config, this.#state);\n      const selectiveAst = {\n        ...baseAst,\n        selectiveFields,\n      };\n      compiled = compileQuery(\n        selectiveAst,\n        this.#config.graphId,\n        this.#compileOptions(),\n      );\n      this.#cachedOptimizedCompiled = compiled;\n    } else {\n      compiled = this.#cachedOptimizedCompiled;\n    }\n\n    const rawSelectiveRows =\n      await this.#requireBackend().execute<Record<string, unknown>>(compiled);\n    const dialect = this.#config.dialect ?? \"sqlite\";\n    const rows = transformPathColumns(rawSelectiveRows, this.#state, dialect);\n\n    try {\n      // RecursiveAliases are populated at runtime but erased in mapSelectiveResults' signature\n      return mapSelectiveResults<Aliases, EdgeAliases, R>(\n        rows,\n        this.#state,\n        selectiveFields,\n        this.#config.schemaIntrospector,\n        this.#selectFn as (context: SelectContext<Aliases, EdgeAliases>) => R,\n      );\n    } catch (error) {\n      if (error instanceof MissingSelectiveFieldError) {\n        this.#cachedSelectiveFieldsForExecute = undefined;\n        this.#cachedOptimizedCompiled = NOT_COMPUTED;\n        return undefined;\n      }\n      if (error instanceof UnsupportedPredicateError) {\n        this.#cachedSelectiveFieldsForExecute = undefined;\n        this.#cachedOptimizedCompiled = NOT_COMPUTED;\n        return undefined;\n      }\n      throw error;\n    }\n  }\n\n  /**\n   * Attempts optimized execution against a provided backend.\n   * Mirror of #tryOptimizedExecution but delegates to the given backend.\n   */\n  async #tryOptimizedExecutionOn(\n    backend: GraphBackend | TransactionBackend,\n  ): Promise<readonly R[] | undefined> {\n    const selectiveFields = this.#getSelectiveFieldsForExecute();\n    if (selectiveFields === undefined) {\n      return undefined;\n    }\n\n    let compiled: SQL;\n    if (this.#cachedOptimizedCompiled === NOT_COMPUTED) {\n      const baseAst = buildQueryAst(this.#config, this.#state);\n      const selectiveAst = {\n        ...baseAst,\n        selectiveFields,\n      };\n      compiled = compileQuery(\n        selectiveAst,\n        this.#config.graphId,\n        this.#compileOptions(),\n      );\n      this.#cachedOptimizedCompiled = compiled;\n    } else {\n      compiled = this.#cachedOptimizedCompiled;\n    }\n\n    const rawSelectiveRows =\n      await backend.execute<Record<string, unknown>>(compiled);\n    const dialect = this.#config.dialect ?? \"sqlite\";\n    const rows = transformPathColumns(rawSelectiveRows, this.#state, dialect);\n\n    try {\n      return mapSelectiveResults<Aliases, EdgeAliases, R>(\n        rows,\n        this.#state,\n        selectiveFields,\n        this.#config.schemaIntrospector,\n        this.#selectFn as (context: SelectContext<Aliases, EdgeAliases>) => R,\n      );\n    } catch (error) {\n      if (error instanceof MissingSelectiveFieldError) {\n        this.#cachedSelectiveFieldsForExecute = undefined;\n        this.#cachedOptimizedCompiled = NOT_COMPUTED;\n        return undefined;\n      }\n      if (error instanceof UnsupportedPredicateError) {\n        this.#cachedSelectiveFieldsForExecute = undefined;\n        this.#cachedOptimizedCompiled = NOT_COMPUTED;\n        return undefined;\n      }\n      throw error;\n    }\n  }\n\n  #trackSelectFunctionAccesses(tracker: FieldAccessTracker): void {\n    const hasOptionalTraversal = this.#state.traversals.some(\n      (traversal) => traversal.optional,\n    );\n\n    const trackingRuns =\n      hasOptionalTraversal ?\n        ([\n          {\n            mode: \"truthy\" as const,\n            optionalTraversalAliases: \"present\" as const,\n          },\n          {\n            mode: \"falsy\" as const,\n            optionalTraversalAliases: \"present\" as const,\n          },\n          {\n            mode: \"falsy\" as const,\n            optionalTraversalAliases: \"absent\" as const,\n          },\n        ] as const)\n      : ([\n          {\n            mode: \"truthy\" as const,\n            optionalTraversalAliases: \"present\" as const,\n          },\n          {\n            mode: \"falsy\" as const,\n            optionalTraversalAliases: \"present\" as const,\n          },\n        ] as const);\n\n    for (const run of trackingRuns) {\n      const trackingContext = createTrackingContext(this.#state, tracker, {\n        schemaIntrospector: this.#config.schemaIntrospector,\n        mode: run.mode,\n        optionalTraversalAliases: run.optionalTraversalAliases,\n      });\n\n      try {\n        // Execute the select callback against a lightweight tracking context.\n        // We intentionally ignore the return value: we only need accessed fields.\n        void this.#selectFn(\n          trackingContext as SelectContext<\n            Aliases,\n            EdgeAliases,\n            RecursiveAliases\n          >,\n        );\n      } catch {\n        // Best-effort tracking: any runtime errors in the callback (e.g. calling\n        // a method on an undefined optional field) should simply disable or\n        // reduce optimization, never change correctness.\n      }\n    }\n  }\n\n  #getSelectiveFieldsForExecute(): readonly SelectiveField[] | undefined {\n    if (this.#cachedSelectiveFieldsForExecute === undefined) {\n      return undefined;\n    }\n\n    if (this.#cachedSelectiveFieldsForExecute !== NOT_COMPUTED) {\n      return this.#cachedSelectiveFieldsForExecute;\n    }\n\n    const tracker = new FieldAccessTracker();\n    this.#trackSelectFunctionAccesses(tracker);\n\n    const accessed = tracker.getAccessedFields();\n    if (accessed.length === 0) {\n      this.#cachedSelectiveFieldsForExecute = undefined;\n      return undefined;\n    }\n\n    const selectiveFields = this.#ensureOptionalTraversalIdsSelected(\n      buildSelectiveFields(accessed, {\n        state: this.#state,\n        schemaIntrospector: this.#config.schemaIntrospector,\n      }),\n    );\n    this.#cachedSelectiveFieldsForExecute = selectiveFields;\n    return selectiveFields;\n  }\n\n  #getSelectiveFieldsForPagination(): readonly SelectiveField[] | undefined {\n    if (this.#cachedSelectiveFieldsForPagination === undefined) {\n      return undefined;\n    }\n\n    if (this.#cachedSelectiveFieldsForPagination !== NOT_COMPUTED) {\n      return this.#cachedSelectiveFieldsForPagination;\n    }\n\n    const tracker = new FieldAccessTracker();\n    this.#trackSelectFunctionAccesses(tracker);\n    if (!this.#recordOrderByFieldsForPagination(tracker)) {\n      this.#cachedSelectiveFieldsForPagination = undefined;\n      return undefined;\n    }\n\n    const selectiveFields = this.#ensureOptionalTraversalIdsSelected(\n      buildSelectiveFields(tracker.getAccessedFields(), {\n        state: this.#state,\n        schemaIntrospector: this.#config.schemaIntrospector,\n      }),\n    );\n    this.#cachedSelectiveFieldsForPagination = selectiveFields;\n    return selectiveFields;\n  }\n\n  #ensureOptionalTraversalIdsSelected(\n    selectiveFields: readonly SelectiveField[],\n  ): readonly SelectiveField[] {\n    const result = [...selectiveFields];\n    const keys = new Set(\n      result.map(\n        (field) =>\n          `${field.alias}\\u0000${field.field}\\u0000${String(field.isSystemField)}`,\n      ),\n    );\n\n    function add(alias: string): void {\n      const key = `${alias}\\u0000id\\u0000true`;\n      if (keys.has(key)) return;\n      keys.add(key);\n      result.push({\n        alias,\n        field: \"id\",\n        outputName: `${alias}_id`,\n        isSystemField: true,\n      });\n    }\n\n    for (const traversal of this.#state.traversals) {\n      if (!traversal.optional) continue;\n      add(traversal.nodeAlias);\n      add(traversal.edgeAlias);\n    }\n\n    return result.toSorted((a, b) => {\n      const aliasCompare = a.alias.localeCompare(b.alias);\n      if (aliasCompare !== 0) return aliasCompare;\n      return a.field.localeCompare(b.field);\n    });\n  }\n\n  async #tryOptimizedPaginate(\n    cursorData: CursorData | undefined,\n    direction: \"forward\" | \"backward\",\n    pageLimit: number,\n    fetchLimit: number,\n    cursor: string | undefined,\n    isBackward: boolean,\n  ): Promise<PaginatedResult<R> | undefined> {\n    const selectiveFields = this.#getSelectiveFieldsForPagination();\n    if (selectiveFields === undefined) {\n      return undefined;\n    }\n\n    let rows: readonly Record<string, unknown>[];\n    try {\n      rows = await this.#executeWithCursor(cursorData, direction, fetchLimit, {\n        selectiveFields,\n      });\n    } catch (error) {\n      if (error instanceof UnsupportedPredicateError) {\n        this.#cachedSelectiveFieldsForPagination = undefined;\n        return undefined;\n      }\n      throw error;\n    }\n\n    const hasMore = rows.length > pageLimit;\n    const resultRows = hasMore ? rows.slice(0, pageLimit) : rows;\n    const paginationDialect = this.#config.dialect ?? \"sqlite\";\n    const orderedRows = transformPathColumns(\n      isBackward ? resultRows.toReversed() : resultRows,\n      this.#state,\n      paginationDialect,\n    );\n\n    let data: readonly R[];\n    try {\n      // RecursiveAliases are populated at runtime but erased in mapSelectiveResults' signature\n      data = mapSelectiveResults<Aliases, EdgeAliases, R>(\n        orderedRows,\n        this.#state,\n        selectiveFields,\n        this.#config.schemaIntrospector,\n        this.#selectFn as (context: SelectContext<Aliases, EdgeAliases>) => R,\n      );\n    } catch (error) {\n      if (error instanceof MissingSelectiveFieldError) {\n        this.#cachedSelectiveFieldsForPagination = undefined;\n        return undefined;\n      }\n      if (error instanceof UnsupportedPredicateError) {\n        this.#cachedSelectiveFieldsForPagination = undefined;\n        return undefined;\n      }\n      throw error;\n    }\n\n    let nextCursor: string | undefined;\n    let previousCursor: string | undefined;\n\n    if (orderedRows.length > 0) {\n      try {\n        previousCursor = this.#buildCursorFromSelectiveRow(\n          orderedRows[0]!,\n          selectiveFields,\n          \"b\",\n        );\n        nextCursor = this.#buildCursorFromSelectiveRow(\n          orderedRows.at(-1)!,\n          selectiveFields,\n          \"f\",\n        );\n      } catch (error) {\n        if (error instanceof MissingSelectiveFieldError) {\n          this.#cachedSelectiveFieldsForPagination = undefined;\n          return undefined;\n        }\n        if (error instanceof UnsupportedPredicateError) {\n          this.#cachedSelectiveFieldsForPagination = undefined;\n          return undefined;\n        }\n        throw error;\n      }\n    }\n\n    return {\n      data,\n      nextCursor: hasMore || isBackward ? nextCursor : undefined,\n      prevCursor:\n        cursor !== undefined || (isBackward && hasMore) ?\n          previousCursor\n        : undefined,\n      hasNextPage: isBackward ? cursor !== undefined : hasMore,\n      hasPrevPage: isBackward ? hasMore : cursor !== undefined,\n    };\n  }\n\n  #recordOrderByFieldsForPagination(tracker: FieldAccessTracker): boolean {\n    for (const spec of this.#state.orderBy) {\n      const field = spec.field;\n\n      // System field (e.g., id, kind) — path is [\"id\"] or [\"kind\"]\n      if (\n        field.path.length === 1 &&\n        field.path[0] !== \"props\" &&\n        field.jsonPointer === undefined\n      ) {\n        tracker.record(field.alias, field.path[0]!, true);\n        continue;\n      }\n\n      // Props field — path is [\"props\"] with a JSON pointer\n      if (field.path.length !== 1 || field.path[0] !== \"props\") {\n        return false;\n      }\n\n      if (field.jsonPointer === undefined) {\n        return false;\n      }\n\n      const segments = parseJsonPointer(field.jsonPointer);\n      if (segments.length !== 1) {\n        return false;\n      }\n\n      tracker.record(field.alias, segments[0]!, false);\n    }\n\n    return true;\n  }\n\n  #buildCursorFromSelectiveRow(\n    row: Record<string, unknown>,\n    selectiveFields: readonly SelectiveField[],\n    direction: \"f\" | \"b\",\n  ): string {\n    const contextRow = this.#buildCursorContextFromSelectiveRow(\n      row,\n      selectiveFields,\n    );\n    return buildCursorFromRow(contextRow, this.#state.orderBy, direction);\n  }\n\n  #buildCursorContextFromSelectiveRow(\n    row: Record<string, unknown>,\n    selectiveFields: readonly SelectiveField[],\n  ): Record<string, unknown> {\n    const outputNameByAliasField = new Map<string, string>();\n    for (const field of selectiveFields) {\n      outputNameByAliasField.set(\n        `${field.alias}\\u0000${field.field}`,\n        field.outputName,\n      );\n    }\n\n    const optionalNodeAliases = new Set<string>();\n    for (const traversal of this.#state.traversals) {\n      if (traversal.optional) {\n        optionalNodeAliases.add(traversal.nodeAlias);\n      }\n    }\n\n    const cursorContext: Record<string, unknown> = {};\n\n    for (const spec of this.#state.orderBy) {\n      const alias = spec.field.alias;\n      const jsonPointer = spec.field.jsonPointer;\n\n      // System field order spec (e.g., path=[\"id\"], no jsonPointer)\n      if (jsonPointer === undefined) {\n        if (spec.field.path.length !== 1) {\n          throw new MissingSelectiveFieldError(alias, \"orderBy\");\n        }\n        const fieldName = spec.field.path[0]!;\n        const outputName = outputNameByAliasField.get(\n          `${alias}\\u0000${fieldName}`,\n        );\n        if (outputName === undefined) {\n          throw new MissingSelectiveFieldError(alias, fieldName);\n        }\n\n        const aliasObject = this.#getOrCreateAliasObject(cursorContext, alias);\n        aliasObject[fieldName] = nullToUndefined(row[outputName]);\n        continue;\n      }\n\n      const segments = parseJsonPointer(jsonPointer);\n      if (segments.length === 0) {\n        throw new MissingSelectiveFieldError(alias, \"orderBy\");\n      }\n\n      const topField = segments[0]!;\n      const outputName = outputNameByAliasField.get(\n        `${alias}\\u0000${topField}`,\n      );\n      if (outputName === undefined) {\n        throw new MissingSelectiveFieldError(alias, topField);\n      }\n\n      if (optionalNodeAliases.has(alias)) {\n        const idOutputName = outputNameByAliasField.get(`${alias}\\u0000id`);\n        if (idOutputName === undefined) {\n          throw new MissingSelectiveFieldError(alias, \"id\");\n        }\n        const idValue = row[idOutputName];\n        if (idValue === null || idValue === undefined) {\n          continue;\n        }\n      }\n\n      const aliasObject = this.#getOrCreateAliasObject(cursorContext, alias);\n\n      const kindNames = this.#getNodeKindNamesForAlias(alias);\n      const typeInfo =\n        kindNames ?\n          this.#config.schemaIntrospector.getSharedFieldTypeInfo(\n            kindNames,\n            topField,\n          )\n        : undefined;\n\n      const decoded = decodeSelectedValue(row[outputName], typeInfo);\n\n      if (segments.length === 1) {\n        aliasObject[topField] = decoded;\n        continue;\n      }\n\n      let current = aliasObject;\n      for (let index = 0; index < segments.length - 1; index++) {\n        const segment = segments[index]!;\n        const existing_ = current[segment];\n        if (typeof existing_ === \"object\" && existing_ !== null) {\n          current = existing_ as Record<string, unknown>;\n        } else {\n          const created: Record<string, unknown> = {};\n          current[segment] = created;\n          current = created;\n        }\n      }\n      current[segments.at(-1)!] = decoded;\n    }\n\n    return cursorContext;\n  }\n\n  #getOrCreateAliasObject(\n    cursorContext: Record<string, unknown>,\n    alias: string,\n  ): Record<string, unknown> {\n    const existing = cursorContext[alias];\n    if (typeof existing === \"object\" && existing !== null) {\n      return existing as Record<string, unknown>;\n    }\n    const created: Record<string, unknown> = {};\n    cursorContext[alias] = created;\n    return created;\n  }\n\n  #getNodeKindNamesForAlias(alias: string): readonly string[] | undefined {\n    if (alias === this.#state.startAlias) {\n      return this.#state.startKinds;\n    }\n    return this.#state.traversals.find((t) => t.nodeAlias === alias)?.nodeKinds;\n  }\n\n  /**\n   * Executes a paginated query using cursor-based keyset pagination.\n   *\n   * Cursor pagination is efficient for large datasets as it avoids OFFSET.\n   * Requires ORDER BY to be specified for deterministic results.\n   *\n   * @param options - Pagination options (first/after for forward, last/before for backward)\n   * @throws ValidationError if ORDER BY is not specified\n   * @throws ValidationError if cursor columns don't match query ORDER BY columns\n   */\n  async paginate(options: PaginateOptions): Promise<PaginatedResult<R>> {\n    if (!this.#config.backend) {\n      throw new Error(\n        \"Cannot execute query: no backend configured. \" +\n          \"Use store.query() or pass a backend to createQueryBuilder().\",\n      );\n    }\n\n    // Validate ORDER BY is present\n    if (this.#state.orderBy.length === 0) {\n      throw new ValidationError(\n        \"Cursor pagination requires ORDER BY. Add .orderBy() before .paginate()\",\n        {\n          issues: [\n            {\n              path: \"orderBy\",\n              message: \"ORDER BY is required for cursor pagination\",\n            },\n          ],\n        },\n        {\n          suggestion: `Add .orderBy(alias, field) before .paginate() to specify sort order.`,\n        },\n      );\n    }\n\n    // Determine pagination direction and parameters\n    const isBackward =\n      options.last !== undefined || options.before !== undefined;\n    const limit = options.first ?? options.last ?? DEFAULT_PAGINATION_LIMIT;\n    const cursor = options.after ?? options.before;\n\n    // Decode and validate cursor if provided\n    let cursorData: CursorData | undefined;\n    if (cursor) {\n      cursorData = decodeCursor(cursor);\n      validateCursorColumns(cursorData, this.#state.orderBy);\n    }\n\n    // Fetch limit + 1 to detect if there are more pages\n    const fetchLimit = limit + 1;\n\n    const direction = isBackward ? \"backward\" : \"forward\";\n    const optimized = await this.#tryOptimizedPaginate(\n      cursorData,\n      direction,\n      limit,\n      fetchLimit,\n      cursor,\n      isBackward,\n    );\n    if (optimized !== undefined) {\n      return optimized;\n    }\n\n    // Build and execute query with cursor condition\n    const rows = await this.#executeWithCursor(\n      cursorData,\n      direction,\n      fetchLimit,\n    );\n\n    // Detect if there are more items\n    const hasMore = rows.length > limit;\n    const resultRows = hasMore ? rows.slice(0, limit) : rows;\n\n    // For backward pagination, reverse the results to maintain natural order\n    const orderedRows = isBackward ? resultRows.toReversed() : resultRows;\n\n    // Map to typed results\n    const data = mapResults<Aliases, EdgeAliases, R, RecursiveAliases>(\n      orderedRows,\n      this.#state.startAlias,\n      this.#state.traversals,\n      this.#selectFn,\n    );\n\n    // Build paginated result with cursors\n    return buildPaginatedResult(\n      data,\n      orderedRows,\n      this.#state.orderBy,\n      limit,\n      hasMore,\n      isBackward,\n      cursor,\n      (row) =>\n        buildSelectContext<Aliases, EdgeAliases, RecursiveAliases>(\n          row,\n          this.#state.startAlias,\n          this.#state.traversals,\n        ),\n    );\n  }\n\n  /**\n   * Returns an async iterator that streams results in batches.\n   *\n   * Uses cursor pagination internally for efficient memory usage.\n   * Requires ORDER BY to be specified for deterministic results.\n   *\n   * @param options - Stream options (batchSize defaults to 1000)\n   * @throws ValidationError if ORDER BY is not specified\n   */\n  stream(options?: StreamOptions): AsyncIterable<R> {\n    // Validate ORDER BY is present\n    if (this.#state.orderBy.length === 0) {\n      throw new ValidationError(\n        \"Streaming requires ORDER BY. Add .orderBy() before .stream()\",\n        {\n          issues: [\n            { path: \"orderBy\", message: \"ORDER BY is required for streaming\" },\n          ],\n        },\n        {\n          suggestion: `Add .orderBy(alias, field) before .stream() to specify sort order.`,\n        },\n      );\n    }\n\n    const batchSize = getStreamBatchSize(options);\n    return createStreamIterable(batchSize, (paginateOptions) =>\n      this.paginate(paginateOptions),\n    );\n  }\n\n  /**\n   * Executes a query with cursor conditions applied.\n   */\n  async #executeWithCursor(\n    cursorData: CursorData | undefined,\n    direction: \"forward\" | \"backward\",\n    limit: number,\n    options?: Readonly<{ selectiveFields?: readonly SelectiveField[] }>,\n  ): Promise<readonly Record<string, unknown>[]> {\n    const ast = this.toAst();\n\n    // Adjust ORDER BY for backward pagination (reverse all directions)\n    let orderBy = this.#state.orderBy;\n    if (direction === \"backward\") {\n      orderBy = orderBy.map((spec) => ({\n        ...spec,\n        direction:\n          spec.direction === \"asc\" ? (\"desc\" as const) : (\"asc\" as const),\n      }));\n    }\n\n    // Build cursor predicates if we have cursor data\n    let predicates = [...this.#state.predicates];\n    if (cursorData) {\n      const cursorPredicate = buildCursorPredicate(\n        cursorData,\n        this.#state.orderBy,\n        direction,\n        this.#state.startAlias,\n      );\n      predicates = [...predicates, cursorPredicate];\n    }\n\n    // Apply modified ORDER BY, predicates, and limit to AST (discard offset)\n    const { offset: _discarded, ...astWithoutOffset } = ast;\n    const modifiedAst = {\n      ...astWithoutOffset,\n      predicates,\n      orderBy,\n      limit,\n      ...(options?.selectiveFields !== undefined && {\n        selectiveFields: options.selectiveFields,\n      }),\n    };\n\n    // Compile and execute\n    const compiled = compileQuery(\n      modifiedAst,\n      this.#config.graphId,\n      this.#compileOptions(),\n    );\n    const rawRows =\n      await this.#requireBackend().execute<Record<string, unknown>>(compiled);\n    const dialect = this.#config.dialect ?? \"sqlite\";\n    return transformPathColumns(rawRows, this.#state, dialect);\n  }\n}\n","/**\n * ExecutableAggregateQuery - A query with aggregate functions that can be executed.\n */\nimport { type SQL } from \"drizzle-orm\";\n\nimport { type GraphDef } from \"../../core/define-graph\";\nimport { type AggregateExpr, type FieldRef, type QueryAst } from \"../ast\";\nimport { compileQuery, type CompileQueryOptions } from \"../compiler/index\";\nimport { buildQueryAst } from \"./ast-builder\";\nimport { buildCompileOptions } from \"./compile-options\";\nimport {\n  type AliasMap,\n  type QueryBuilderConfig,\n  type QueryBuilderState,\n} from \"./types\";\n\nconst NOT_COMPUTED = Symbol(\"NOT_COMPUTED\");\n\n/**\n * Result type for aggregate queries.\n * Maps field refs to their value types and aggregates to numbers.\n */\nexport type AggregateResult<\n  R extends Record<string, FieldRef | AggregateExpr>,\n> = {\n  [K in keyof R]: R[K] extends AggregateExpr ? number\n  : R[K] extends FieldRef ? unknown\n  : never;\n};\n\n/**\n * An aggregate query that can be executed.\n */\nexport class ExecutableAggregateQuery<\n  G extends GraphDef,\n  Aliases extends AliasMap,\n  R extends Record<string, FieldRef | AggregateExpr>,\n> {\n  readonly #config: QueryBuilderConfig;\n  readonly #state: QueryBuilderState;\n  readonly #fields: R;\n  #cachedCompiled: SQL | typeof NOT_COMPUTED = NOT_COMPUTED;\n\n  constructor(config: QueryBuilderConfig, state: QueryBuilderState, fields: R) {\n    this.#config = config;\n    this.#state = state;\n    this.#fields = fields;\n  }\n\n  /**\n   * Builds the query AST.\n   */\n  toAst(): QueryAst {\n    return buildQueryAst(this.#config, this.#state);\n  }\n\n  /**\n   * Limits the number of results.\n   */\n  limit(n: number): ExecutableAggregateQuery<G, Aliases, R> {\n    return new ExecutableAggregateQuery(\n      this.#config,\n      { ...this.#state, limit: n },\n      this.#fields,\n    );\n  }\n\n  /**\n   * Offsets the results.\n   */\n  offset(n: number): ExecutableAggregateQuery<G, Aliases, R> {\n    return new ExecutableAggregateQuery(\n      this.#config,\n      { ...this.#state, offset: n },\n      this.#fields,\n    );\n  }\n\n  /**\n   * Compiles the query and returns the SQL text and parameters.\n   *\n   * Requires a backend to be configured (the backend determines the SQL dialect).\n   * Use this for debugging, logging, or running the query with a custom executor.\n   */\n  toSQL(): Readonly<{ sql: string; params: readonly unknown[] }> {\n    if (!this.#config.backend?.compileSql) {\n      throw new Error(\n        \"Cannot convert to SQL: no backend configured or backend does not support compileSql. \" +\n          \"Use store.query() to get a backend-aware query builder.\",\n      );\n    }\n    return this.#config.backend.compileSql(this.compile());\n  }\n\n  /**\n   * Compiles the query to a Drizzle SQL object.\n   */\n  compile(): SQL {\n    if (this.#cachedCompiled !== NOT_COMPUTED) {\n      return this.#cachedCompiled;\n    }\n    const ast = this.toAst();\n    const compiled = compileQuery(\n      ast,\n      this.#config.graphId,\n      this.#compileOptions(),\n    );\n    this.#cachedCompiled = compiled;\n    return compiled;\n  }\n\n  #compileOptions(): CompileQueryOptions {\n    return buildCompileOptions(this.#config);\n  }\n\n  /**\n   * Executes the query and returns typed results.\n   *\n   * @throws Error if no backend is configured\n   */\n  async execute(): Promise<readonly AggregateResult<R>[]> {\n    if (!this.#config.backend) {\n      throw new Error(\n        \"Cannot execute query: no backend configured. \" +\n          \"Use store.query() or pass a backend to createQueryBuilder().\",\n      );\n    }\n\n    const compiled = this.compile();\n    const rows =\n      await this.#config.backend.execute<Record<string, unknown>>(compiled);\n\n    return this.#mapResults(rows);\n  }\n\n  /**\n   * Maps raw database rows to typed results.\n   * Handles database-specific value conversions:\n   * - PostgreSQL returns bigint/numeric as strings → convert to numbers\n   * - SQLite returns JSON booleans as 0/1 numbers → convert to booleans\n   * - PostgreSQL returns JSON booleans as \"true\"/\"false\" strings → convert to booleans\n   */\n  #mapResults(\n    rows: readonly Record<string, unknown>[],\n  ): readonly AggregateResult<R>[] {\n    return rows.map((row) => {\n      const result: Record<string, unknown> = {};\n      for (const key of Object.keys(this.#fields)) {\n        const field = this.#fields[key];\n        if (!field) continue;\n        const value = row[key];\n\n        if (field.__type === \"aggregate\") {\n          // PostgreSQL returns aggregate bigint/numeric as strings.\n          result[key] = typeof value === \"string\" ? Number(value) : value;\n          continue;\n        }\n\n        result[key] = normalizeFieldValue(field, value);\n      }\n      return result as AggregateResult<R>;\n    });\n  }\n}\n\n/**\n * Converts database-specific boolean encodings to JS booleans.\n *\n * - SQLite json_extract() returns 0/1 for JSON booleans\n * - PostgreSQL #>> returns \"true\"/\"false\" for JSON booleans\n */\nfunction normalizeBooleanValue(value: unknown): unknown {\n  if (value === null) return undefined;\n  if (value === true || value === false) return value;\n  if (value === 1) return true;\n  if (value === 0) return false;\n  if (value === \"true\") return true;\n  if (value === \"false\") return false;\n  if (value === \"1\") return true;\n  if (value === \"0\") return false;\n  return value;\n}\n\nfunction normalizeFieldValue(field: FieldRef, value: unknown): unknown {\n  if (field.valueType === \"boolean\") {\n    return normalizeBooleanValue(value);\n  }\n\n  return value === null ? undefined : value;\n}\n","/**\n * Dynamic query builder types.\n *\n * Backs `fromDynamic` / `traverseDynamic` / `optionalTraverseDynamic`\n * / `toDynamic` — the string-keyed sibling methods on `QueryBuilder`\n * and `TraversalBuilder` that admit runtime-declared kinds. Same SQL\n * compiler under the hood; only the alias-level surface types differ.\n *\n * Aliases declared via the dynamic methods carry `DynamicNodeType` /\n * `DynamicEdgeType` brands. `NodeAccessor<N>` / `EdgeAccessor<E>` /\n * `SelectableNode<N>` / `SelectableEdge<E>` branch on those brands so a\n * single query can mix typed and dynamic aliases — a typed alias keeps\n * `StringFieldAccessor`, etc., while a dynamic alias gets\n * `DynamicNodeAccessor` with a `.field(name)` discriminator.\n */\nimport {\n  type AnyEdgeType,\n  type KindEntity,\n  type NodeType,\n} from \"../../core/types\";\nimport { jsonPointer } from \"../json-pointer\";\nimport {\n  buildFieldBuilderForTypeInfo,\n  fieldRef,\n  type FulltextAccessor,\n} from \"../predicates\";\nimport {\n  type FieldTypeInfo,\n  type SchemaIntrospector,\n} from \"../schema-introspector\";\nimport {\n  type ArrayFieldAccessor,\n  type BaseFieldAccessor,\n  type DateFieldAccessor,\n  type EmbeddingFieldAccessor,\n  type NumberFieldAccessor,\n  type ObjectFieldAccessor,\n  type SelectableEdgeMeta,\n  type SelectableNodeMeta,\n  type StringFieldAccessor,\n} from \"./types\";\n\ndeclare const DYNAMIC_NODE_BRAND: unique symbol;\ndeclare const DYNAMIC_EDGE_BRAND: unique symbol;\n\nexport type DynamicNodeType = NodeType &\n  Readonly<{ [DYNAMIC_NODE_BRAND]: true }>;\n\nexport type DynamicEdgeType = AnyEdgeType &\n  Readonly<{ [DYNAMIC_EDGE_BRAND]: true }>;\n\nexport type IsDynamicNodeType<N> =\n  N extends Readonly<{ [DYNAMIC_NODE_BRAND]: true }> ? true : false;\n\nexport type IsDynamicEdgeType<E> =\n  E extends Readonly<{ [DYNAMIC_EDGE_BRAND]: true }> ? true : false;\n\n/**\n * Type-discriminated field builder for runtime-typed properties.\n *\n * `BaseFieldAccessor` methods (`eq`, `isNull`, etc.) are available\n * directly. Type-specific methods (`gte`, `contains`, `similarTo`, …)\n * sit behind a discriminator method that asserts the field's type:\n *\n * ```ts\n * (n) => n.field(\"year\").number().gte(2020)\n * ```\n *\n * The discriminator validates against the registered Zod schema at\n * query-build time and throws `TypeError` on mismatch — the user can't\n * accidentally call `.between(...)` on a string field. The discriminator\n * is a type assertion *and* a runtime check.\n */\nexport type DynamicFieldBuilder = BaseFieldAccessor &\n  Readonly<{\n    string: () => StringFieldAccessor;\n    number: () => NumberFieldAccessor;\n    date: () => DateFieldAccessor;\n    array: () => ArrayFieldAccessor<unknown>;\n    object: () => ObjectFieldAccessor<Readonly<Record<string, unknown>>>;\n    embedding: () => EmbeddingFieldAccessor;\n  }>;\n\n/**\n * Predicate accessor for a runtime-kind alias.\n *\n * System fields keep their narrow types. Schema properties are reached\n * through `.field(name)` — `.field()` validates the property exists on\n * the registered Zod schema and throws if it doesn't.\n */\nexport type DynamicNodeAccessor = Readonly<{\n  id: StringFieldAccessor;\n  kind: StringFieldAccessor;\n  $fulltext: FulltextAccessor;\n  field: (name: string) => DynamicFieldBuilder;\n}>;\n\nexport type DynamicEdgeAccessor = Readonly<{\n  id: StringFieldAccessor;\n  kind: StringFieldAccessor;\n  fromId: StringFieldAccessor;\n  toId: StringFieldAccessor;\n  field: (name: string) => DynamicFieldBuilder;\n}>;\n\nexport type DynamicSelectableNode = Readonly<{\n  id: string;\n  kind: string;\n  meta: SelectableNodeMeta;\n}> &\n  Readonly<Record<string, unknown>>;\n\nexport type DynamicSelectableEdge = Readonly<{\n  id: string;\n  kind: string;\n  fromId: string;\n  toId: string;\n  meta: SelectableEdgeMeta;\n}> &\n  Readonly<Record<string, unknown>>;\n\n/**\n * Renders a kind-context string for error messages — `node kind \"Paper\"`\n * or `edge kinds \"knows\" | \"follows\"`.\n */\nfunction describeKindContext(\n  entity: KindEntity,\n  kindNames: readonly string[] | undefined,\n): string {\n  if (kindNames === undefined || kindNames.length === 0) {\n    return `${entity} (kind unresolved)`;\n  }\n  const list = kindNames.map((k) => `\"${k}\"`).join(\" | \");\n  return `${entity} kind${kindNames.length > 1 ? \"s\" : \"\"} ${list}`;\n}\n\n/**\n * Shared dynamic-field-builder factory. Returns a `DynamicFieldBuilder`\n * (typed as `BaseFieldAccessor` at the runtime boundary): the property\n * is validated against the registered Zod schema, and each\n * `.string()` / `.number()` / … discriminator throws `TypeError` on\n * type mismatch.\n *\n * Used by `QueryBuilder.#createNodeAccessor` for node aliases and by\n * `TraversalBuilder.#createEdgeAccessor` for edge aliases — they only\n * differ in which introspector method to call.\n */\nexport function createDynamicFieldBuilder(\n  introspector: SchemaIntrospector,\n  alias: string,\n  name: string,\n  kindNames: readonly string[] | undefined,\n  entity: KindEntity,\n): BaseFieldAccessor {\n  const typeInfo =\n    kindNames === undefined ? undefined\n    : entity === \"node\" ? introspector.getSharedFieldTypeInfo(kindNames, name)\n    : introspector.getSharedEdgeFieldTypeInfo(kindNames, name);\n\n  const where = describeKindContext(entity, kindNames);\n  if (typeInfo === undefined) {\n    throw new Error(`Property \"${name}\" is not declared on ${where}.`);\n  }\n\n  const ref = fieldRef(alias, [\"props\"], {\n    jsonPointer: jsonPointer([name]),\n    valueType: typeInfo.valueType,\n    elementType: typeInfo.elementType,\n  });\n  const base = buildFieldBuilderForTypeInfo(ref, typeInfo);\n\n  const expect = (asserted: FieldTypeInfo[\"valueType\"]): BaseFieldAccessor => {\n    if (typeInfo.valueType !== asserted) {\n      throw new TypeError(\n        `Property \"${name}\" on ${where} is ${typeInfo.valueType}, not ${asserted}.`,\n      );\n    }\n    return base;\n  };\n\n  return {\n    ...base,\n    string: () => expect(\"string\"),\n    number: () => expect(\"number\"),\n    date: () => expect(\"date\"),\n    array: () => expect(\"array\"),\n    object: () => expect(\"object\"),\n    embedding: () => expect(\"embedding\"),\n  } as BaseFieldAccessor;\n}\n","/**\n * TraversalBuilder - Intermediate builder for edge traversals.\n */\nimport { type GraphDef } from \"../../core/define-graph\";\nimport { type AnyEdgeType, type NodeType } from \"../../core/types\";\nimport { EndpointError, KindNotFoundError } from \"../../errors\";\nimport {\n  type NodePredicate,\n  type RecursiveCyclePolicy,\n  type Traversal,\n  type TraversalDirection,\n} from \"../ast\";\nimport { MAX_EXPLICIT_RECURSIVE_DEPTH } from \"../compiler\";\nimport { jsonPointer } from \"../json-pointer\";\nimport {\n  arrayField,\n  baseField,\n  dateField,\n  fieldRef,\n  numberField,\n  objectField,\n  type Predicate,\n  stringField,\n} from \"../predicates\";\n// Type-only import to get the QueryBuilder type without runtime circular dependency\nimport {\n  createDynamicFieldBuilder,\n  type DynamicEdgeType,\n  type DynamicNodeType,\n} from \"./dynamic\";\nimport { type QueryBuilder } from \"./query-builder\";\nimport {\n  type AliasMap,\n  type BaseFieldAccessor,\n  type BuildRecursiveAliases,\n  type EdgeAccessor,\n  type EdgeAlias,\n  type EdgeAliasMap,\n  type NodeAlias,\n  type QueryBuilderConfig,\n  type QueryBuilderState,\n  type RecursiveAliasMap,\n  type RecursiveTraversalOptions,\n  type UniqueAlias,\n  type ValidEdgeTargets,\n} from \"./types\";\nimport { validateSqlIdentifier } from \"./validation\";\n\n/**\n * Resolves the edge type for an edge alias based on its kind type parameter.\n *\n * For `traverse(...)`, `EK` is a literal like `\"authoredBy\"` and the\n * type comes from the typed graph. For `traverseDynamic(...)`, `EK` is\n * widened to `string` — `string extends EK` distinguishes that case and\n * resolves to `DynamicEdgeType`, so the conditional accessor types fire.\n */\ntype EdgeTypeForKey<G extends GraphDef, EK> =\n  string extends EK ? DynamicEdgeType\n  : EK extends keyof G[\"edges\"] & string ? G[\"edges\"][EK][\"type\"]\n  : DynamicEdgeType;\n\n// Forward declaration - actual import would cause circular dependency\ntype QueryBuilderConstructor = new (\n  config: QueryBuilderConfig,\n  state: QueryBuilderState,\n) => unknown;\n\n// This will be set by the main builder module to avoid circular imports\nlet QueryBuilderClass: QueryBuilderConstructor;\n\n/**\n * Sets the QueryBuilder class reference for use by TraversalBuilder.\n * Called during module initialization to break circular dependency.\n */\nexport function setQueryBuilderClass(cls: QueryBuilderConstructor): void {\n  QueryBuilderClass = cls;\n}\n\n/**\n * State for variable-length traversal configuration.\n */\ninterface VariableLengthState {\n  enabled: boolean;\n  minDepth: number;\n  maxDepth: number;\n  cyclePolicy: RecursiveCyclePolicy;\n  pathEnabled: boolean;\n  pathAlias?: string;\n  depthEnabled: boolean;\n  depthAlias?: string;\n}\n\n/**\n * Default variable-length state (disabled).\n */\nconst DEFAULT_VARIABLE_LENGTH_STATE: VariableLengthState = {\n  enabled: false,\n  minDepth: 1,\n  maxDepth: -1,\n  cyclePolicy: \"prevent\",\n  pathEnabled: false,\n  depthEnabled: false,\n};\n\nfunction validateMaxHops(max: number): void {\n  if (!Number.isFinite(max) || !Number.isInteger(max)) {\n    throw new TypeError(\"maxHops must be a finite integer\");\n  }\n  if (max < 1) {\n    throw new Error(\"maxHops must be >= 1\");\n  }\n  if (max > MAX_EXPLICIT_RECURSIVE_DEPTH) {\n    throw new Error(\n      `maxHops must be <= ${MAX_EXPLICIT_RECURSIVE_DEPTH}. ` +\n        `Use a smaller bound to prevent runaway recursive queries.`,\n    );\n  }\n}\n\nfunction validateMinHops(min: number): void {\n  if (!Number.isFinite(min) || !Number.isInteger(min)) {\n    throw new TypeError(\"minHops must be a finite integer\");\n  }\n  if (min < 0) {\n    throw new Error(\"minHops must be >= 0\");\n  }\n}\n\nfunction resolveAliasOption(\n  option: boolean | string | undefined,\n): string | undefined {\n  if (option === undefined || option === false) {\n    return;\n  }\n\n  if (option === true) {\n    return;\n  }\n\n  return option;\n}\n\n/**\n * Intermediate builder for traversal operations.\n *\n * Type parameters track the edge kind and direction to constrain\n * which node kinds are valid targets in the `to()` method.\n */\nexport class TraversalBuilder<\n  G extends GraphDef,\n  Aliases extends AliasMap,\n  // eslint-disable-next-line @typescript-eslint/no-empty-object-type -- Empty object for initial empty edge alias map\n  EdgeAliases extends EdgeAliasMap = {},\n  EK extends keyof G[\"edges\"] & string = keyof G[\"edges\"] & string,\n  EA extends string = string,\n  Dir extends TraversalDirection = \"out\",\n  Optional extends boolean = false,\n  DC extends boolean | string = false,\n  PC extends boolean | string = false,\n  // eslint-disable-next-line @typescript-eslint/no-empty-object-type -- Empty when no recursive aliases accumulated\n  RecAliases extends RecursiveAliasMap = {},\n> {\n  readonly #config: QueryBuilderConfig;\n  readonly #state: QueryBuilderState;\n  readonly #edgeKinds: readonly string[];\n  readonly #inverseEdgeKinds: readonly string[];\n  readonly #edgeAlias: EA;\n  readonly #direction: Dir;\n  readonly #fromAlias: string;\n  readonly #optional: Optional;\n  readonly #variableLength: VariableLengthState;\n  readonly #pendingEdgePredicates: readonly NodePredicate[];\n\n  constructor(\n    config: QueryBuilderConfig,\n    state: QueryBuilderState,\n    edgeKinds: readonly string[],\n    edgeAlias: EA,\n    direction: Dir,\n    fromAlias: string,\n    inverseEdgeKinds: readonly string[] = [],\n    optional: Optional = false as Optional,\n    variableLength: VariableLengthState = DEFAULT_VARIABLE_LENGTH_STATE,\n    pendingEdgePredicates: readonly NodePredicate[] = [],\n  ) {\n    this.#config = config;\n    this.#state = state;\n    this.#edgeKinds = edgeKinds;\n    this.#inverseEdgeKinds = inverseEdgeKinds;\n    this.#edgeAlias = edgeAlias;\n    this.#direction = direction;\n    this.#fromAlias = fromAlias;\n    this.#optional = optional;\n    this.#variableLength = variableLength;\n    this.#pendingEdgePredicates = pendingEdgePredicates;\n  }\n\n  /**\n   * Enables variable-length (recursive) traversal.\n   * Defaults to MAX_RECURSIVE_DEPTH (10) hops with cycle prevention.\n   * Use `maxHops` to override (up to MAX_EXPLICIT_RECURSIVE_DEPTH).\n   */\n  recursive<const O extends RecursiveTraversalOptions = Record<string, never>>(\n    options?: O,\n  ): TraversalBuilder<\n    G,\n    Aliases,\n    EdgeAliases,\n    EK,\n    EA,\n    Dir,\n    Optional,\n    O extends { depth: infer D extends boolean | string } ? D : DC,\n    O extends { path: infer P extends boolean | string } ? P : PC,\n    RecAliases\n  > {\n    const minDepth = options?.minHops ?? this.#variableLength.minDepth;\n    const maxDepth = options?.maxHops ?? this.#variableLength.maxDepth;\n    validateMinHops(minDepth);\n    if (options?.maxHops !== undefined) {\n      validateMaxHops(maxDepth);\n    }\n    if (maxDepth > 0 && minDepth > maxDepth) {\n      throw new Error(\"minHops must be <= maxHops\");\n    }\n\n    const pathAlias = resolveAliasOption(options?.path);\n    const depthAlias = resolveAliasOption(options?.depth);\n    if (pathAlias !== undefined) validateSqlIdentifier(pathAlias);\n    if (depthAlias !== undefined) validateSqlIdentifier(depthAlias);\n    const cyclePolicy =\n      options?.cyclePolicy ?? this.#variableLength.cyclePolicy;\n\n    return new TraversalBuilder(\n      this.#config,\n      this.#state,\n      this.#edgeKinds,\n      this.#edgeAlias,\n      this.#direction,\n      this.#fromAlias,\n      this.#inverseEdgeKinds,\n      this.#optional,\n      {\n        ...this.#variableLength,\n        enabled: true,\n        minDepth,\n        maxDepth,\n        cyclePolicy,\n        ...(options?.path !== undefined && {\n          pathEnabled: options.path !== false,\n          ...(pathAlias !== undefined && { pathAlias }),\n        }),\n        ...(options?.depth !== undefined && {\n          depthEnabled: options.depth !== false,\n          ...(depthAlias !== undefined && { depthAlias }),\n        }),\n      },\n      this.#pendingEdgePredicates,\n    );\n  }\n\n  /**\n   * Adds a WHERE clause for the edge being traversed.\n   *\n   * @param alias - The edge alias to filter on (must be the current edge alias)\n   * @param predicateFunction - A function that builds predicates using the edge accessor\n   */\n  whereEdge(\n    alias: EA,\n    predicateFunction: (edge: EdgeAccessor<EdgeTypeForKey<G, EK>>) => Predicate,\n  ): TraversalBuilder<\n    G,\n    Aliases,\n    EdgeAliases,\n    EK,\n    EA,\n    Dir,\n    Optional,\n    DC,\n    PC,\n    RecAliases\n  > {\n    const accessor = this.#createEdgeAccessor(alias);\n    const predicate = predicateFunction(\n      accessor as EdgeAccessor<EdgeTypeForKey<G, EK>>,\n    );\n\n    const newPredicate: NodePredicate = {\n      targetAlias: alias,\n      targetType: \"edge\",\n      expression: predicate.__expr,\n    };\n\n    return new TraversalBuilder(\n      this.#config,\n      this.#state,\n      this.#edgeKinds,\n      this.#edgeAlias,\n      this.#direction,\n      this.#fromAlias,\n      this.#inverseEdgeKinds,\n      this.#optional,\n      this.#variableLength,\n      [...this.#pendingEdgePredicates, newPredicate],\n    );\n  }\n\n  /**\n   * Creates a type-safe accessor for edge properties.\n   */\n  #createEdgeAccessor(alias: string): EdgeAccessor<AnyEdgeType> {\n    const allEdgeKinds = [\n      ...this.#edgeKinds,\n      ...this.#inverseEdgeKinds.filter(\n        (kind) => !this.#edgeKinds.includes(kind),\n      ),\n    ];\n\n    // Pre-compute system field accessors\n    const idAccessor = stringField(\n      fieldRef(alias, [\"id\"], { valueType: \"string\" }),\n    );\n    const kindAccessor = stringField(\n      fieldRef(alias, [\"kind\"], { valueType: \"string\" }),\n    );\n    const fromIdAccessor = stringField(\n      fieldRef(alias, [\"from_id\"], { valueType: \"string\" }),\n    );\n    const toIdAccessor = stringField(\n      fieldRef(alias, [\"to_id\"], { valueType: \"string\" }),\n    );\n\n    // Build field accessor for a schema property\n    const buildFieldAccessor = (propertyName: string): BaseFieldAccessor => {\n      const typeInfo =\n        this.#config.schemaIntrospector.getSharedEdgeFieldTypeInfo(\n          allEdgeKinds,\n          propertyName,\n        );\n\n      const valueType = typeInfo?.valueType;\n      const elementType = typeInfo?.elementType;\n\n      const ref = fieldRef(alias, [\"props\"], {\n        jsonPointer: jsonPointer([propertyName]),\n        valueType,\n        elementType,\n      });\n\n      switch (valueType) {\n        case \"string\": {\n          return stringField(ref);\n        }\n        case \"number\": {\n          return numberField(ref);\n        }\n        case \"boolean\": {\n          return baseField(ref);\n        }\n        case \"date\": {\n          return dateField(ref);\n        }\n        case \"array\": {\n          return arrayField(ref);\n        }\n        case \"object\": {\n          return objectField(ref);\n        }\n        case \"embedding\":\n        case \"unknown\":\n        case undefined: {\n          // Embedding, unknown, or unresolved type - return base field\n          return baseField(ref);\n        }\n      }\n    };\n\n    if (this.#state.dynamicEdgeAliases.has(alias)) {\n      return {\n        id: idAccessor,\n        kind: kindAccessor,\n        fromId: fromIdAccessor,\n        toId: toIdAccessor,\n        field: (name: string) =>\n          createDynamicFieldBuilder(\n            this.#config.schemaIntrospector,\n            alias,\n            name,\n            allEdgeKinds,\n            \"edge\",\n          ),\n      } as unknown as EdgeAccessor<AnyEdgeType>;\n    }\n\n    // Use a Proxy to provide flattened property access\n    return new Proxy({} as EdgeAccessor<AnyEdgeType>, {\n      get: (_, property: string | symbol) => {\n        // Handle symbols and special properties to avoid infinite loops\n        if (typeof property === \"symbol\") return;\n        if (property === \"then\") return;\n        if (property === \"toJSON\") return;\n\n        // System fields\n        if (property === \"id\") return idAccessor;\n        if (property === \"kind\") return kindAccessor;\n        if (property === \"fromId\") return fromIdAccessor;\n        if (property === \"toId\") return toIdAccessor;\n\n        // Schema properties\n        return buildFieldAccessor(property);\n      },\n    });\n  }\n\n  /**\n   * Specifies the target node kind.\n   *\n   * The kind must be a valid target for this edge based on the traversal direction:\n   * - \"out\" direction: kind must be in the edge's \"to\" array\n   * - \"in\" direction: kind must be in the edge's \"from\" array\n   *\n   * @param kind - The target node kind\n   * @param alias - A unique alias for this node (compile-time error if duplicate)\n   */\n  to<K extends ValidEdgeTargets<G, EK, Dir>, A extends string>(\n    kind: K,\n    alias: UniqueAlias<A, Aliases>,\n    options?: { includeSubClasses?: false },\n  ): QueryBuilder<\n    G,\n    Aliases & Record<A, NodeAlias<G[\"nodes\"][K][\"type\"], Optional>>,\n    EdgeAliases & Record<EA, EdgeAlias<G[\"edges\"][EK][\"type\"], Optional>>,\n    RecAliases & BuildRecursiveAliases<DC, PC, A>\n  >;\n\n  to<K extends ValidEdgeTargets<G, EK, Dir>, A extends string>(\n    kind: K,\n    alias: UniqueAlias<A, Aliases>,\n    options: { includeSubClasses: true },\n  ): QueryBuilder<\n    G,\n    Aliases & Record<A, NodeAlias<NodeType, Optional>>,\n    EdgeAliases & Record<EA, EdgeAlias<G[\"edges\"][EK][\"type\"], Optional>>,\n    RecAliases & BuildRecursiveAliases<DC, PC, A>\n  >;\n\n  to<K extends ValidEdgeTargets<G, EK, Dir>, A extends string>(\n    kind: K,\n    alias: UniqueAlias<A, Aliases>,\n    options?: { includeSubClasses?: boolean },\n  ): QueryBuilder<\n    G,\n    Aliases & Record<A, NodeAlias<NodeType, Optional>>,\n    EdgeAliases & Record<EA, EdgeAlias<G[\"edges\"][EK][\"type\"], Optional>>,\n    RecAliases & BuildRecursiveAliases<DC, PC, A>\n  > {\n    validateSqlIdentifier(alias);\n\n    const includeSubClasses = options?.includeSubClasses ?? false;\n    const kinds =\n      includeSubClasses ? this.#config.registry.expandSubClasses(kind) : [kind];\n\n    const newState = this.#stateWithTraversal(alias, kinds);\n\n    // Cast is safe because the overloads provide compile-time type safety\n    // The runtime QueryBuilderClass is the correct implementation\n    return new QueryBuilderClass(this.#config, newState) as QueryBuilder<\n      G,\n      Aliases & Record<A, NodeAlias<NodeType, Optional>>,\n      EdgeAliases & Record<EA, EdgeAlias<G[\"edges\"][EK][\"type\"], Optional>>,\n      RecAliases & BuildRecursiveAliases<DC, PC, A>\n    >;\n  }\n\n  /**\n   * String-keyed sibling of `to` for runtime-declared target kinds.\n   * Throws `KindNotFoundError` if the kind is not registered.\n   */\n  toDynamic<A extends string>(\n    kind: string,\n    alias: UniqueAlias<A, Aliases>,\n    options?: { includeSubClasses?: boolean },\n  ): QueryBuilder<\n    G,\n    Aliases & Record<A, NodeAlias<DynamicNodeType, Optional>>,\n    EdgeAliases & Record<EA, EdgeAlias<EdgeTypeForKey<G, EK>, Optional>>,\n    RecAliases & BuildRecursiveAliases<DC, PC, A>\n  > {\n    validateSqlIdentifier(alias);\n    if (!this.#config.registry.hasNodeType(kind)) {\n      throw new KindNotFoundError(kind, \"node\", {\n        graphId: this.#config.graphId,\n      });\n    }\n    this.#assertValidEndpoint(kind);\n\n    const includeSubClasses = options?.includeSubClasses ?? false;\n    const kinds =\n      includeSubClasses ? this.#config.registry.expandSubClasses(kind) : [kind];\n\n    const baseState = this.#stateWithTraversal(alias, kinds);\n    const newState: QueryBuilderState = {\n      ...baseState,\n      dynamicNodeAliases: new Set([...baseState.dynamicNodeAliases, alias]),\n    };\n\n    return new QueryBuilderClass(this.#config, newState) as QueryBuilder<\n      G,\n      Aliases & Record<A, NodeAlias<DynamicNodeType, Optional>>,\n      EdgeAliases & Record<EA, EdgeAlias<EdgeTypeForKey<G, EK>, Optional>>,\n      RecAliases & BuildRecursiveAliases<DC, PC, A>\n    >;\n  }\n\n  /**\n   * Builds the next `QueryBuilderState` after appending a traversal\n   * targeting `alias` with `kinds`. Shared by `to` and `toDynamic`.\n   */\n  #stateWithTraversal(\n    alias: string,\n    kinds: readonly string[],\n  ): QueryBuilderState {\n    const traversalBase: Traversal = {\n      edgeAlias: this.#edgeAlias,\n      edgeKinds: this.#edgeKinds,\n      direction: this.#direction,\n      nodeAlias: alias,\n      nodeKinds: kinds,\n      joinFromAlias: this.#fromAlias,\n      joinEdgeField: this.#direction === \"out\" ? \"from_id\" : \"to_id\",\n      optional: this.#optional,\n    };\n\n    const baseTraversal: Traversal =\n      this.#inverseEdgeKinds.length > 0 ?\n        { ...traversalBase, inverseEdgeKinds: this.#inverseEdgeKinds }\n      : traversalBase;\n\n    const traversal: Traversal =\n      this.#variableLength.enabled ?\n        {\n          ...baseTraversal,\n          variableLength: {\n            minDepth: this.#variableLength.minDepth,\n            maxDepth: this.#variableLength.maxDepth,\n            cyclePolicy: this.#variableLength.cyclePolicy,\n            ...(this.#variableLength.pathEnabled && {\n              pathAlias: this.#variableLength.pathAlias ?? `${alias}_path`,\n            }),\n            ...(this.#variableLength.depthEnabled && {\n              depthAlias: this.#variableLength.depthAlias ?? `${alias}_depth`,\n            }),\n          },\n        }\n      : baseTraversal;\n\n    return {\n      ...this.#state,\n      traversals: [...this.#state.traversals, traversal],\n      predicates: [...this.#state.predicates, ...this.#pendingEdgePredicates],\n      currentAlias: alias,\n    };\n  }\n\n  /**\n   * Asserts a runtime-declared target kind is a valid endpoint for the\n   * current traversal. Mirrors the compile-time `ValidEdgeTargets`\n   * constraint enforced by `to(...)` — without this check `toDynamic`\n   * would silently accept e.g. `traverseDynamic(\"authoredBy\") +\n   * toDynamic(\"Document\")` where authoredBy.to=[Author] and produce an\n   * empty result set.\n   *\n   * Permissive on unions: if the target is assignable to any valid\n   * endpoint across the edges being traversed, accept. Subclass\n   * relationships are honored via `registry.isAssignableTo`.\n   */\n  #assertValidEndpoint(targetKind: string): void {\n    const expectedKinds = new Set<string>();\n    const collectFromEdge = (edgeName: string, side: \"to\" | \"from\"): void => {\n      const edgeType = this.#config.registry.getEdgeType(edgeName);\n      const endpoints = edgeType?.[side];\n      if (!endpoints) return;\n      for (const endpoint of endpoints) {\n        expectedKinds.add(endpoint.kind);\n      }\n    };\n    const forwardSide = this.#direction === \"out\" ? \"to\" : \"from\";\n    const inverseSide = this.#direction === \"out\" ? \"from\" : \"to\";\n    for (const edgeName of this.#edgeKinds) {\n      collectFromEdge(edgeName, forwardSide);\n    }\n    for (const edgeName of this.#inverseEdgeKinds) {\n      collectFromEdge(edgeName, inverseSide);\n    }\n\n    // No declared endpoints anywhere — edge kinds in the registry can\n    // legally have undefined `to` / `from`; nothing to validate against.\n    if (expectedKinds.size === 0) return;\n\n    for (const expected of expectedKinds) {\n      if (this.#config.registry.isAssignableTo(targetKind, expected)) return;\n    }\n\n    throw new EndpointError({\n      edgeKind: this.#edgeKinds[0] ?? \"(unknown)\",\n      endpoint: forwardSide,\n      actualKind: targetKind,\n      expectedKinds: [...expectedKinds],\n    });\n  }\n}\n","/**\n * QueryBuilder - The fluent query builder.\n */\nimport { type GraphDef } from \"../../core/define-graph\";\nimport {\n  coordinateContext,\n  describeCoordinate,\n  resolveReadCoordinate,\n} from \"../../core/temporal\";\nimport {\n  type EdgeType,\n  type NodeType,\n  type TemporalMode,\n} from \"../../core/types\";\nimport { ConfigurationError, KindNotFoundError } from \"../../errors\";\nimport {\n  type AggregateExpr,\n  type FieldRef,\n  type GroupBySpec,\n  type HybridFusionOptions,\n  mergeEdgeKinds,\n  type OrderSpec,\n  type PredicateExpression,\n  type ProjectedField,\n  type SortDirection,\n  type TraversalDirection,\n  type TraversalExpansion,\n} from \"../ast\";\nimport { jsonPointer, parseJsonPointer } from \"../json-pointer\";\nimport {\n  buildFieldBuilderForTypeInfo,\n  createFulltextAccessor,\n  fieldRef,\n  type Predicate,\n  stringField,\n} from \"../predicates\";\nimport { type FieldTypeInfo } from \"../schema-introspector\";\nimport {\n  createDynamicFieldBuilder,\n  type DynamicEdgeType,\n  type DynamicNodeType,\n} from \"./dynamic\";\nimport { ExecutableAggregateQuery } from \"./executable-aggregate-query\";\nimport { ExecutableQuery } from \"./executable-query\";\nimport { TraversalBuilder } from \"./traversal-builder\";\nimport {\n  type AliasMap,\n  type BaseFieldAccessor,\n  type EdgeAccessor,\n  type EdgeAlias,\n  type EdgeAliasMap,\n  type NodeAccessor,\n  type NodeAlias,\n  type QueryBuilderConfig,\n  type QueryBuilderState,\n  type RecursiveAliasMap,\n  type SelectContext,\n  type UniqueAlias,\n} from \"./types\";\nimport {\n  validateHybridFusionOptions,\n  validateSqlIdentifier,\n} from \"./validation\";\n\n/**\n * Builds projected fields for a node alias (including all metadata columns).\n */\nfunction buildNodeFields(alias: string): ProjectedField[] {\n  return [\n    {\n      outputName: `${alias}_id`,\n      source: fieldRef(alias, [\"id\"]),\n    },\n    {\n      outputName: `${alias}_kind`,\n      source: fieldRef(alias, [\"kind\"]),\n    },\n    {\n      outputName: `${alias}_props`,\n      source: fieldRef(alias, [\"props\"]),\n    },\n    {\n      outputName: `${alias}_version`,\n      source: fieldRef(alias, [\"version\"]),\n    },\n    {\n      outputName: `${alias}_valid_from`,\n      source: fieldRef(alias, [\"valid_from\"]),\n    },\n    {\n      outputName: `${alias}_valid_to`,\n      source: fieldRef(alias, [\"valid_to\"]),\n    },\n    {\n      outputName: `${alias}_created_at`,\n      source: fieldRef(alias, [\"created_at\"]),\n    },\n    {\n      outputName: `${alias}_updated_at`,\n      source: fieldRef(alias, [\"updated_at\"]),\n    },\n    {\n      outputName: `${alias}_deleted_at`,\n      source: fieldRef(alias, [\"deleted_at\"]),\n    },\n  ];\n}\n\n/**\n * Builds projected fields for an edge alias (including all metadata columns).\n *\n * Edge columns are stored in the traversal's node CTE (e.g., cte_c contains e_id, e_kind, etc.).\n * The nodeCteAlias parameter specifies which CTE contains these columns.\n */\nfunction buildEdgeFields(\n  edgeAlias: string,\n  nodeCteAlias: string,\n): ProjectedField[] {\n  const cteAlias = `cte_${nodeCteAlias}`;\n  return [\n    {\n      outputName: `${edgeAlias}_id`,\n      source: fieldRef(edgeAlias, [\"id\"]),\n      cteAlias,\n    },\n    {\n      outputName: `${edgeAlias}_kind`,\n      source: fieldRef(edgeAlias, [\"kind\"]),\n      cteAlias,\n    },\n    {\n      outputName: `${edgeAlias}_from_id`,\n      source: fieldRef(edgeAlias, [\"from_id\"]),\n      cteAlias,\n    },\n    {\n      outputName: `${edgeAlias}_to_id`,\n      source: fieldRef(edgeAlias, [\"to_id\"]),\n      cteAlias,\n    },\n    {\n      outputName: `${edgeAlias}_props`,\n      source: fieldRef(edgeAlias, [\"props\"]),\n      cteAlias,\n    },\n    {\n      outputName: `${edgeAlias}_valid_from`,\n      source: fieldRef(edgeAlias, [\"valid_from\"]),\n      cteAlias,\n    },\n    {\n      outputName: `${edgeAlias}_valid_to`,\n      source: fieldRef(edgeAlias, [\"valid_to\"]),\n      cteAlias,\n    },\n    {\n      outputName: `${edgeAlias}_created_at`,\n      source: fieldRef(edgeAlias, [\"created_at\"]),\n      cteAlias,\n    },\n    {\n      outputName: `${edgeAlias}_updated_at`,\n      source: fieldRef(edgeAlias, [\"updated_at\"]),\n      cteAlias,\n    },\n    {\n      outputName: `${edgeAlias}_deleted_at`,\n      source: fieldRef(edgeAlias, [\"deleted_at\"]),\n      cteAlias,\n    },\n  ];\n}\n\n/**\n * The fluent query builder.\n *\n * Type parameters accumulate as methods are chained:\n * - G: The graph definition\n * - Aliases: Map of alias names to their node kinds\n * - EdgeAliases: Map of alias names to their edge kinds (accumulated during traversals)\n */\nexport class QueryBuilder<\n  G extends GraphDef,\n  // eslint-disable-next-line @typescript-eslint/no-empty-object-type -- Empty object for initial empty alias map\n  Aliases extends AliasMap = {},\n  // eslint-disable-next-line @typescript-eslint/no-empty-object-type -- Empty object for initial empty edge alias map\n  EdgeAliases extends EdgeAliasMap = {},\n  // eslint-disable-next-line @typescript-eslint/no-empty-object-type -- Empty when no recursive aliases\n  RecursiveAliases extends RecursiveAliasMap = {},\n> {\n  readonly #config: QueryBuilderConfig;\n  readonly #state: QueryBuilderState;\n\n  constructor(config: QueryBuilderConfig, state: QueryBuilderState) {\n    this.#config = config;\n    this.#state = state;\n  }\n\n  /**\n   * Starts a query from a node kind.\n   *\n   * @param kind - The node kind to start from\n   * @param alias - A unique alias for this node (compile-time error if duplicate)\n   */\n  from<K extends keyof G[\"nodes\"] & string, A extends string>(\n    kind: K,\n    alias: UniqueAlias<A, Aliases>,\n    options?: { includeSubClasses?: false },\n  ): QueryBuilder<\n    G,\n    Aliases & Record<A, NodeAlias<G[\"nodes\"][K][\"type\"]>>,\n    EdgeAliases,\n    RecursiveAliases\n  >;\n\n  from<K extends keyof G[\"nodes\"] & string, A extends string>(\n    kind: K,\n    alias: UniqueAlias<A, Aliases>,\n    options: { includeSubClasses: true },\n  ): QueryBuilder<\n    G,\n    Aliases & Record<A, NodeAlias>,\n    EdgeAliases,\n    RecursiveAliases\n  >;\n\n  from<K extends keyof G[\"nodes\"] & string, A extends string>(\n    kind: K,\n    alias: UniqueAlias<A, Aliases>,\n    options?: { includeSubClasses?: boolean },\n  ): QueryBuilder<\n    G,\n    Aliases & Record<A, NodeAlias>,\n    EdgeAliases,\n    RecursiveAliases\n  > {\n    // Validate alias to prevent SQL injection\n    validateSqlIdentifier(alias);\n\n    const includeSubClasses = options?.includeSubClasses ?? false;\n\n    // Expand kinds if including subclasses\n    const kinds =\n      includeSubClasses ? this.#config.registry.expandSubClasses(kind) : [kind];\n\n    const newState: QueryBuilderState = {\n      ...this.#state,\n      startAlias: alias,\n      currentAlias: alias,\n      startKinds: kinds,\n      includeSubClasses,\n    };\n\n    return new QueryBuilder(this.#config, newState);\n  }\n\n  /**\n   * String-keyed sibling of `from` for runtime-declared kinds. Throws\n   * `KindNotFoundError` if the kind is not registered. Predicates use\n   * the `n.field(\"name\").number().gte(...)` discriminator.\n   */\n  fromDynamic<A extends string>(\n    kind: string,\n    alias: UniqueAlias<A, Aliases>,\n    options?: { includeSubClasses?: boolean },\n  ): QueryBuilder<\n    G,\n    Aliases & Record<A, NodeAlias<DynamicNodeType>>,\n    EdgeAliases,\n    RecursiveAliases\n  > {\n    validateSqlIdentifier(alias);\n    if (!this.#config.registry.hasNodeType(kind)) {\n      throw new KindNotFoundError(kind, \"node\", {\n        graphId: this.#config.graphId,\n      });\n    }\n\n    const includeSubClasses = options?.includeSubClasses ?? false;\n    const kinds =\n      includeSubClasses ? this.#config.registry.expandSubClasses(kind) : [kind];\n\n    const newState: QueryBuilderState = {\n      ...this.#state,\n      startAlias: alias,\n      currentAlias: alias,\n      startKinds: kinds,\n      includeSubClasses,\n      dynamicNodeAliases: new Set([...this.#state.dynamicNodeAliases, alias]),\n    };\n\n    return new QueryBuilder(this.#config, newState);\n  }\n\n  /**\n   * Adds a WHERE clause for a node.\n   */\n  whereNode<A extends keyof Aliases & string>(\n    alias: A,\n    predicateFunction: (n: NodeAccessor<Aliases[A][\"type\"]>) => Predicate,\n  ): QueryBuilder<G, Aliases, EdgeAliases, RecursiveAliases> {\n    const accessor = this.#createNodeAccessor(alias);\n    const predicate = predicateFunction(\n      accessor as NodeAccessor<Aliases[A][\"type\"]>,\n    );\n\n    const newState: QueryBuilderState = {\n      ...this.#state,\n      predicates: [\n        ...this.#state.predicates,\n        {\n          targetAlias: alias,\n          expression: predicate.__expr,\n        },\n      ],\n    };\n\n    return new QueryBuilder(this.#config, newState);\n  }\n\n  /**\n   * Adds a WHERE clause for an edge.\n   *\n   * @param alias - The edge alias to filter on\n   * @param predicateFunction - A function that builds predicates using the edge accessor\n   */\n  whereEdge<EA extends keyof EdgeAliases & string>(\n    alias: EA,\n    predicateFunction: (\n      edge: EdgeAccessor<EdgeAliases[EA][\"type\"]>,\n    ) => Predicate,\n  ): QueryBuilder<G, Aliases, EdgeAliases, RecursiveAliases> {\n    const accessor = this.#createEdgeAccessor(alias);\n    const predicate = predicateFunction(\n      accessor as EdgeAccessor<EdgeAliases[EA][\"type\"]>,\n    );\n\n    const newState: QueryBuilderState = {\n      ...this.#state,\n      predicates: [\n        ...this.#state.predicates,\n        {\n          targetAlias: alias,\n          targetType: \"edge\",\n          expression: predicate.__expr,\n        },\n      ],\n    };\n\n    return new QueryBuilder(this.#config, newState);\n  }\n\n  /**\n   * Traverses an edge to another node (outgoing direction).\n   *\n   * By default, traverses from the current node (last traversal target, or start node).\n   * Use the `from` option to traverse from a different alias (fan-out pattern).\n   *\n   * @param options.expand - Ontology expansion mode for implying/inverse edges\n   * @param options.from - Alias to traverse from (defaults to current/last traversal target)\n   */\n  traverse<EK extends keyof G[\"edges\"] & string, EA extends string>(\n    edgeKind: EK,\n    edgeAlias: EA,\n    options?: {\n      direction?: \"out\";\n      expand?: TraversalExpansion;\n      from?: keyof Aliases & string;\n    },\n  ): TraversalBuilder<\n    G,\n    Aliases,\n    EdgeAliases,\n    EK,\n    EA,\n    \"out\",\n    false,\n    false,\n    false,\n    RecursiveAliases\n  >;\n\n  /**\n   * Traverses an edge to another node (incoming direction).\n   *\n   * By default, traverses from the current node (last traversal target, or start node).\n   * Use the `from` option to traverse from a different alias (fan-out pattern).\n   *\n   * @param options.direction - Set to \"in\" for incoming edge traversal\n   * @param options.expand - Ontology expansion mode for implying/inverse edges\n   * @param options.from - Alias to traverse from (defaults to current/last traversal target)\n   */\n  traverse<EK extends keyof G[\"edges\"] & string, EA extends string>(\n    edgeKind: EK,\n    edgeAlias: EA,\n    options: {\n      direction: \"in\";\n      expand?: TraversalExpansion;\n      from?: keyof Aliases & string;\n    },\n  ): TraversalBuilder<\n    G,\n    Aliases,\n    EdgeAliases,\n    EK,\n    EA,\n    \"in\",\n    false,\n    false,\n    false,\n    RecursiveAliases\n  >;\n\n  traverse<EK extends keyof G[\"edges\"] & string, EA extends string>(\n    edgeKind: EK,\n    edgeAlias: EA,\n    options?: {\n      direction?: TraversalDirection;\n      expand?: TraversalExpansion;\n      from?: keyof Aliases & string;\n    },\n  ): TraversalBuilder<\n    G,\n    Aliases,\n    EdgeAliases,\n    EK,\n    EA,\n    TraversalDirection,\n    false,\n    false,\n    false,\n    RecursiveAliases\n  > {\n    // Validate edge alias to prevent SQL injection\n    validateSqlIdentifier(edgeAlias);\n\n    const direction = options?.direction ?? \"out\";\n    const expansion = options?.expand ?? this.#config.defaultTraversalExpansion;\n    const includeImplyingEdges =\n      expansion === \"implying\" || expansion === \"all\";\n    const includeInverseEdges = expansion === \"inverse\" || expansion === \"all\";\n    // Use explicit `from` if provided, otherwise chain from currentAlias\n    const fromAlias = options?.from ?? this.#state.currentAlias;\n\n    // Expand edge kinds if including implying edges\n    const edgeKinds = this.#expandTraversalEdgeKinds(\n      edgeKind,\n      includeImplyingEdges,\n    );\n    const inverseEdgeKinds =\n      includeInverseEdges ?\n        this.#expandInverseTraversalEdgeKinds(edgeKinds, includeImplyingEdges)\n      : [];\n\n    return new TraversalBuilder(\n      this.#config,\n      this.#state,\n      edgeKinds,\n      edgeAlias,\n      direction,\n      fromAlias,\n      inverseEdgeKinds,\n      false,\n    );\n  }\n\n  /**\n   * String-keyed sibling of `traverse` for runtime-declared edge kinds.\n   * Throws `KindNotFoundError` if the edge kind is not registered.\n   */\n  traverseDynamic<EA extends string>(\n    edgeKind: string,\n    edgeAlias: EA,\n    options?: {\n      direction?: TraversalDirection;\n      expand?: TraversalExpansion;\n      from?: keyof Aliases & string;\n    },\n  ): TraversalBuilder<\n    G,\n    Aliases,\n    EdgeAliases & Record<EA, EdgeAlias<DynamicEdgeType>>,\n    string,\n    EA,\n    TraversalDirection,\n    false,\n    false,\n    false,\n    RecursiveAliases\n  > {\n    return this.#beginDynamicTraversal(edgeKind, edgeAlias, false, options);\n  }\n\n  /**\n   * Optionally traverses an edge to another node (LEFT JOIN semantics).\n   * If no matching edge/node exists, the result will include null values.\n   *\n   * By default, traverses from the current node (last traversal target, or start node).\n   * Use the `from` option to traverse from a different alias (fan-out pattern).\n   *\n   * @param options.direction - Direction of traversal: \"out\" (default) or \"in\"\n   * @param options.expand - Ontology expansion mode for implying/inverse edges\n   * @param options.from - Alias to traverse from (defaults to current/last traversal target)\n   */\n  optionalTraverse<EK extends keyof G[\"edges\"] & string, EA extends string>(\n    edgeKind: EK,\n    edgeAlias: EA,\n    options?: {\n      direction?: \"out\";\n      expand?: TraversalExpansion;\n      from?: keyof Aliases & string;\n    },\n  ): TraversalBuilder<\n    G,\n    Aliases,\n    EdgeAliases,\n    EK,\n    EA,\n    \"out\",\n    true,\n    false,\n    false,\n    RecursiveAliases\n  >;\n\n  optionalTraverse<EK extends keyof G[\"edges\"] & string, EA extends string>(\n    edgeKind: EK,\n    edgeAlias: EA,\n    options: {\n      direction: \"in\";\n      expand?: TraversalExpansion;\n      from?: keyof Aliases & string;\n    },\n  ): TraversalBuilder<\n    G,\n    Aliases,\n    EdgeAliases,\n    EK,\n    EA,\n    \"in\",\n    true,\n    false,\n    false,\n    RecursiveAliases\n  >;\n\n  optionalTraverse<EK extends keyof G[\"edges\"] & string, EA extends string>(\n    edgeKind: EK,\n    edgeAlias: EA,\n    options?: {\n      direction?: TraversalDirection;\n      expand?: TraversalExpansion;\n      from?: keyof Aliases & string;\n    },\n  ): TraversalBuilder<\n    G,\n    Aliases,\n    EdgeAliases,\n    EK,\n    EA,\n    TraversalDirection,\n    true,\n    false,\n    false,\n    RecursiveAliases\n  > {\n    // Validate edge alias to prevent SQL injection\n    validateSqlIdentifier(edgeAlias);\n\n    const direction = options?.direction ?? \"out\";\n    const expansion = options?.expand ?? this.#config.defaultTraversalExpansion;\n    const includeImplyingEdges =\n      expansion === \"implying\" || expansion === \"all\";\n    const includeInverseEdges = expansion === \"inverse\" || expansion === \"all\";\n    // Use explicit `from` if provided, otherwise chain from currentAlias\n    const fromAlias = options?.from ?? this.#state.currentAlias;\n\n    // Expand edge kinds if including implying edges\n    const edgeKinds = this.#expandTraversalEdgeKinds(\n      edgeKind,\n      includeImplyingEdges,\n    );\n    const inverseEdgeKinds =\n      includeInverseEdges ?\n        this.#expandInverseTraversalEdgeKinds(edgeKinds, includeImplyingEdges)\n      : [];\n\n    return new TraversalBuilder(\n      this.#config,\n      this.#state,\n      edgeKinds,\n      edgeAlias,\n      direction,\n      fromAlias,\n      inverseEdgeKinds,\n      true,\n    );\n  }\n\n  /**\n   * String-keyed sibling of `optionalTraverse` for runtime-declared edge\n   * kinds. LEFT JOIN semantics — non-matching rows produce a null edge\n   * alias instead of dropping. Throws `KindNotFoundError` if the edge\n   * kind is not registered.\n   */\n  optionalTraverseDynamic<EA extends string>(\n    edgeKind: string,\n    edgeAlias: EA,\n    options?: {\n      direction?: TraversalDirection;\n      expand?: TraversalExpansion;\n      from?: keyof Aliases & string;\n    },\n  ): TraversalBuilder<\n    G,\n    Aliases,\n    EdgeAliases & Record<EA, EdgeAlias<DynamicEdgeType, true>>,\n    string,\n    EA,\n    TraversalDirection,\n    true,\n    false,\n    false,\n    RecursiveAliases\n  > {\n    return this.#beginDynamicTraversal(edgeKind, edgeAlias, true, options);\n  }\n\n  /**\n   * Shared body for `traverseDynamic` and `optionalTraverseDynamic`.\n   * The only difference is the `optional` flag passed to the\n   * `TraversalBuilder` constructor.\n   */\n  #beginDynamicTraversal<EA extends string, Optional extends boolean>(\n    edgeKind: string,\n    edgeAlias: EA,\n    optional: Optional,\n    options:\n      | {\n          direction?: TraversalDirection;\n          expand?: TraversalExpansion;\n          from?: keyof Aliases & string;\n        }\n      | undefined,\n  ): TraversalBuilder<\n    G,\n    Aliases,\n    EdgeAliases & Record<EA, EdgeAlias<DynamicEdgeType, Optional>>,\n    string,\n    EA,\n    TraversalDirection,\n    Optional,\n    false,\n    false,\n    RecursiveAliases\n  > {\n    validateSqlIdentifier(edgeAlias);\n    if (!this.#config.registry.hasEdgeType(edgeKind)) {\n      throw new KindNotFoundError(edgeKind, \"edge\", {\n        graphId: this.#config.graphId,\n      });\n    }\n\n    const direction = options?.direction ?? \"out\";\n    const expansion = options?.expand ?? this.#config.defaultTraversalExpansion;\n    const includeImplyingEdges =\n      expansion === \"implying\" || expansion === \"all\";\n    const includeInverseEdges = expansion === \"inverse\" || expansion === \"all\";\n    const fromAlias = options?.from ?? this.#state.currentAlias;\n\n    const edgeKinds = this.#expandTraversalEdgeKinds(\n      edgeKind,\n      includeImplyingEdges,\n    );\n    const inverseEdgeKinds =\n      includeInverseEdges ?\n        this.#expandInverseTraversalEdgeKinds(edgeKinds, includeImplyingEdges)\n      : [];\n\n    const newState: QueryBuilderState = {\n      ...this.#state,\n      dynamicEdgeAliases: new Set([\n        ...this.#state.dynamicEdgeAliases,\n        edgeAlias,\n      ]),\n    };\n\n    return new TraversalBuilder(\n      this.#config,\n      newState,\n      edgeKinds,\n      edgeAlias,\n      direction,\n      fromAlias,\n      inverseEdgeKinds,\n      optional,\n    );\n  }\n\n  /**\n   * Selects fields to return.\n   */\n  select<R>(\n    selectFunction: (\n      context: SelectContext<Aliases, EdgeAliases, RecursiveAliases>,\n    ) => R,\n  ): ExecutableQuery<G, Aliases, EdgeAliases, RecursiveAliases, R> {\n    // For now, project all fields from all aliases\n    // A more sophisticated implementation would parse the selectFn\n\n    // Start node fields (including metadata)\n    const startFields = buildNodeFields(this.#state.startAlias);\n\n    // Traversal node and edge fields (including metadata)\n    // Edge fields are in the node's CTE, so we pass the node alias for CTE reference\n    const traversalFields = this.#state.traversals.flatMap((traversal) => [\n      ...buildEdgeFields(traversal.edgeAlias, traversal.nodeAlias),\n      ...buildNodeFields(traversal.nodeAlias),\n    ]);\n\n    const projection = [...startFields, ...traversalFields];\n\n    const newState: QueryBuilderState = {\n      ...this.#state,\n      projection,\n    };\n\n    return new ExecutableQuery(this.#config, newState, selectFunction);\n  }\n\n  /**\n   * Selects fields including aggregates.\n   * Use with groupBy() for aggregate queries.\n   *\n   * @param fields - Object mapping output names to field refs or aggregate expressions\n   */\n  aggregate<R extends Record<string, FieldRef | AggregateExpr>>(\n    fields: R,\n  ): ExecutableAggregateQuery<G, Aliases, R> {\n    const resolvedFields = Object.fromEntries(\n      Object.entries(fields).map(([outputName, source]) => {\n        if (source.__type !== \"field_ref\") {\n          return [outputName, source];\n        }\n\n        if (\n          source.valueType !== undefined ||\n          source.path.length !== 1 ||\n          source.path[0] !== \"props\" ||\n          source.jsonPointer === undefined\n        ) {\n          return [outputName, source];\n        }\n\n        const segments = parseJsonPointer(source.jsonPointer);\n        if (segments.length !== 1) {\n          return [outputName, source];\n        }\n\n        const propertyName = segments[0];\n        if (propertyName === undefined) {\n          return [outputName, source];\n        }\n\n        const kindNames = this.#getKindNamesForAlias(source.alias);\n        const typeInfo =\n          kindNames ?\n            this.#config.schemaIntrospector.getSharedFieldTypeInfo(\n              kindNames,\n              propertyName,\n            )\n          : undefined;\n\n        if (!typeInfo) {\n          return [outputName, source];\n        }\n\n        return [\n          outputName,\n          {\n            ...source,\n            valueType: typeInfo.valueType,\n            elementType: typeInfo.elementType,\n          } satisfies FieldRef,\n        ];\n      }),\n    ) as R;\n\n    const projection: ProjectedField[] = Object.entries(resolvedFields).map(\n      ([outputName, source]) => ({\n        outputName,\n        source,\n      }),\n    );\n\n    const newState: QueryBuilderState = {\n      ...this.#state,\n      projection,\n    };\n\n    return new ExecutableAggregateQuery(this.#config, newState, resolvedFields);\n  }\n\n  /**\n   * Orders results.\n   */\n  orderBy<A extends (keyof Aliases | keyof EdgeAliases) & string>(\n    alias: A,\n    field: string,\n    direction: SortDirection = \"asc\",\n  ): QueryBuilder<G, Aliases, EdgeAliases, RecursiveAliases> {\n    const edgeKindNames = this.#getEdgeKindNamesForAlias(alias);\n    const isEdge = edgeKindNames !== undefined;\n    const isSystem =\n      field === \"id\" ||\n      field === \"kind\" ||\n      (isEdge && (field === \"from_id\" || field === \"to_id\"));\n    const typeInfo =\n      isSystem ? undefined\n      : isEdge ?\n        this.#config.schemaIntrospector.getSharedEdgeFieldTypeInfo(\n          edgeKindNames,\n          field,\n        )\n      : this.#getOrderByTypeInfo(alias, field);\n    const orderSpec: OrderSpec =\n      isSystem ?\n        {\n          field: fieldRef(alias, [field], { valueType: \"string\" }),\n          direction,\n        }\n      : {\n          field: fieldRef(alias, [\"props\"], {\n            jsonPointer: jsonPointer([field]),\n            valueType: typeInfo?.valueType,\n            elementType: typeInfo?.elementType,\n          }),\n          direction,\n        };\n\n    const newState: QueryBuilderState = {\n      ...this.#state,\n      orderBy: [...this.#state.orderBy, orderSpec],\n    };\n\n    return new QueryBuilder(this.#config, newState);\n  }\n\n  #getOrderByTypeInfo(alias: string, field: string): FieldTypeInfo | undefined {\n    const kindNames = this.#getKindNamesForAlias(alias);\n    return kindNames ?\n        this.#config.schemaIntrospector.getSharedFieldTypeInfo(kindNames, field)\n      : undefined;\n  }\n\n  /**\n   * Limits the number of results.\n   */\n  limit(n: number): QueryBuilder<G, Aliases, EdgeAliases, RecursiveAliases> {\n    return new QueryBuilder(this.#config, {\n      ...this.#state,\n      limit: n,\n    });\n  }\n\n  /**\n   * Offsets the results.\n   */\n  offset(n: number): QueryBuilder<G, Aliases, EdgeAliases, RecursiveAliases> {\n    return new QueryBuilder(this.#config, {\n      ...this.#state,\n      offset: n,\n    });\n  }\n\n  /**\n   * Sets temporal mode.\n   *\n   * @param mode - The temporal mode to use\n   * @param asOf - Required timestamp for \"asOf\" mode (ISO 8601 string).\n   *   Rejected for every other mode — pinning an instant is only meaningful\n   *   in \"asOf\" mode, so `temporal(\"current\", t)` is a caller error, not a\n   *   silently-dropped argument.\n   * @throws ValidationError if mode is \"asOf\" but no timestamp is provided, or\n   *   if an asOf is supplied with a non-\"asOf\" mode.\n   */\n  temporal(\n    mode: TemporalMode,\n    asOf?: string,\n  ): QueryBuilder<G, Aliases, EdgeAliases, RecursiveAliases> {\n    if (this.#config.sealedCoordinate !== undefined) {\n      const coordinate = this.#config.sealedCoordinate;\n      throw new ConfigurationError(\n        `.temporal() is not available on a StoreView query — the view's ` +\n          `temporal coordinate (${describeCoordinate(coordinate)}) is sealed. ` +\n          `Re-coordinate on the live Store via store.query() or store.view(...).`,\n        {\n          code: \"STORE_VIEW_SEALED_QUERY\",\n          ...coordinateContext(coordinate),\n          requestedMode: mode,\n        },\n      );\n    }\n    const coordinate = resolveReadCoordinate(\n      mode,\n      asOf,\n      `Use .temporal(\"asOf\", \"2024-01-15T10:00:00.000Z\") or .temporal(\"current\") for current time.`,\n    );\n    return new QueryBuilder(this.#config, {\n      ...this.#state,\n      temporalMode: coordinate.valid.mode,\n      asOf: coordinate.valid.asOf,\n    });\n  }\n\n  /**\n   * Groups results by the specified field.\n   * Use with aggregate functions like COUNT, SUM, AVG in select().\n   *\n   * @param alias - The node alias to group by\n   * @param field - The field name to group by\n   */\n  groupBy<A extends keyof Aliases & string>(\n    alias: A,\n    field: string,\n  ): QueryBuilder<G, Aliases, EdgeAliases, RecursiveAliases> {\n    const kindNames = this.#getKindNamesForAlias(alias);\n    const typeInfo =\n      kindNames ?\n        this.#config.schemaIntrospector.getSharedFieldTypeInfo(kindNames, field)\n      : undefined;\n\n    const fieldRefValue: FieldRef = {\n      __type: \"field_ref\",\n      alias,\n      path: [\"props\"],\n      jsonPointer: jsonPointer([field]),\n      valueType: typeInfo?.valueType,\n      elementType: typeInfo?.elementType,\n    };\n\n    const existingFields = this.#state.groupBy?.fields ?? [];\n    const newGroupBy: GroupBySpec = {\n      fields: [...existingFields, fieldRefValue],\n    };\n\n    return new QueryBuilder(this.#config, {\n      ...this.#state,\n      groupBy: newGroupBy,\n    });\n  }\n\n  /**\n   * Groups results by the node ID.\n   * Use when you want to group by a complete node rather than a specific field.\n   *\n   * @param alias - The node alias to group by (uses the node's ID)\n   */\n  groupByNode<A extends keyof Aliases & string>(\n    alias: A,\n  ): QueryBuilder<G, Aliases, EdgeAliases, RecursiveAliases> {\n    const fieldRefValue: FieldRef = {\n      __type: \"field_ref\",\n      alias,\n      path: [\"id\"],\n      valueType: \"string\",\n    };\n\n    const existingFields = this.#state.groupBy?.fields ?? [];\n    const newGroupBy: GroupBySpec = {\n      fields: [...existingFields, fieldRefValue],\n    };\n\n    return new QueryBuilder(this.#config, {\n      ...this.#state,\n      groupBy: newGroupBy,\n    });\n  }\n\n  /**\n   * Filters grouped results using aggregate conditions (HAVING clause).\n   * Use after groupBy() to filter based on aggregate values.\n   *\n   * @param predicate - A predicate expression to filter groups\n   */\n  having(\n    predicate: PredicateExpression,\n  ): QueryBuilder<G, Aliases, EdgeAliases, RecursiveAliases> {\n    return new QueryBuilder(this.#config, {\n      ...this.#state,\n      having: predicate,\n    });\n  }\n\n  /**\n   * Sets fusion parameters for hybrid (vector + fulltext) queries.\n   *\n   * Applies only when the query contains both a `.similarTo()` and a\n   * `.$fulltext.matches()` predicate. Without this call, the default is\n   * RRF with k=60 and equal weights. A mismatch between `.fuseWith()`\n   * configuration and the predicates on the query is caught during\n   * compilation, not here.\n   *\n   * @example\n   * ```typescript\n   * store.query()\n   *   .from(\"Document\", \"d\")\n   *   .whereNode(\"d\", d =>\n   *     d.$fulltext.matches(\"renewable energy\", 50)\n   *       .and(d.embedding.similarTo(vec, 50))\n   *       .and(d.tenantId.eq(tenant))\n   *   )\n   *   .fuseWith({ k: 60, weights: { fulltext: 1.5 } })\n   *   .limit(10)\n   *   .execute();\n   * ```\n   */\n  fuseWith(\n    options: HybridFusionOptions,\n  ): QueryBuilder<G, Aliases, EdgeAliases, RecursiveAliases> {\n    validateHybridFusionOptions(options);\n    return new QueryBuilder(this.#config, {\n      ...this.#state,\n      fusion: options,\n    });\n  }\n\n  /**\n   * Applies a query fragment to transform this builder.\n   *\n   * Fragments are reusable query transformations that can add predicates,\n   * traversals, ordering, and other query operations. Use this for\n   * composing complex queries from simpler, reusable parts.\n   *\n   * @example\n   * ```typescript\n   * // Define a reusable fragment\n   * const activeUsers = createFragment<MyGraph>()((q) =>\n   *   q.whereNode(\"u\", ({ status }) => status.eq(\"active\"))\n   * );\n   *\n   * // Apply the fragment\n   * const results = await query()\n   *   .from(\"User\", \"u\")\n   *   .pipe(activeUsers)\n   *   .select((ctx) => ctx.u)\n   *   .execute();\n   * ```\n   *\n   * @param fragment - A function that transforms the builder\n   * @returns The transformed builder\n   */\n  pipe<\n    OutAliases extends AliasMap,\n    OutEdgeAliases extends EdgeAliasMap = EdgeAliases,\n    OutRecAliases extends RecursiveAliasMap = RecursiveAliases,\n  >(\n    fragment: (\n      builder: QueryBuilder<G, Aliases, EdgeAliases, RecursiveAliases>,\n    ) => QueryBuilder<G, OutAliases, OutEdgeAliases, OutRecAliases>,\n  ): QueryBuilder<G, OutAliases, OutEdgeAliases, OutRecAliases> {\n    return fragment(this);\n  }\n\n  /**\n   * Gets all kind names for an alias.\n   */\n  #getKindNamesForAlias(alias: string): readonly string[] | undefined {\n    if (alias === this.#state.startAlias) {\n      return this.#state.startKinds;\n    }\n    for (const traversal of this.#state.traversals) {\n      if (traversal.nodeAlias === alias) {\n        return traversal.nodeKinds;\n      }\n    }\n    return undefined;\n  }\n\n  /**\n   * Determines the appropriate field builder based on Zod schema type.\n   */\n  #getFieldBuilderForProperty(\n    kindNames: readonly string[] | undefined,\n    property: string,\n    alias: string,\n  ): BaseFieldAccessor {\n    const typeInfo =\n      kindNames ?\n        this.#config.schemaIntrospector.getSharedFieldTypeInfo(\n          kindNames,\n          property,\n        )\n      : undefined;\n\n    const ref = fieldRef(alias, [\"props\"], {\n      jsonPointer: jsonPointer([property]),\n      valueType: typeInfo?.valueType,\n      elementType: typeInfo?.elementType,\n    });\n\n    return this.#buildFieldBuilderForTypeInfo(ref, typeInfo);\n  }\n\n  #buildFieldBuilderForTypeInfo(\n    ref: ReturnType<typeof fieldRef>,\n    typeInfo: FieldTypeInfo | undefined,\n  ): BaseFieldAccessor {\n    return buildFieldBuilderForTypeInfo(ref, typeInfo);\n  }\n\n  #createNodeAccessor(alias: string): NodeAccessor<NodeType> {\n    const kindNames = this.#getKindNamesForAlias(alias);\n    const idAccessor = stringField(\n      fieldRef(alias, [\"id\"], { valueType: \"string\" }),\n    );\n    const kindAccessor = stringField(\n      fieldRef(alias, [\"kind\"], { valueType: \"string\" }),\n    );\n    const fulltextAccessor = createFulltextAccessor(alias, () =>\n      this.#hasSearchableField(kindNames),\n    );\n\n    if (this.#state.dynamicNodeAliases.has(alias)) {\n      return {\n        id: idAccessor,\n        kind: kindAccessor,\n        $fulltext: fulltextAccessor,\n        field: (name: string) =>\n          createDynamicFieldBuilder(\n            this.#config.schemaIntrospector,\n            alias,\n            name,\n            kindNames,\n            \"node\",\n          ),\n      } as unknown as NodeAccessor<NodeType>;\n    }\n\n    // Use a Proxy to provide flattened property access\n    return new Proxy({} as NodeAccessor<NodeType>, {\n      get: (_, property: string | symbol) => {\n        // Handle symbols and special properties to avoid infinite loops\n        if (typeof property === \"symbol\") return;\n        if (property === \"then\") return;\n        if (property === \"toJSON\") return;\n\n        // System fields\n        if (property === \"id\") return idAccessor;\n        if (property === \"kind\") return kindAccessor;\n        if (property === \"$fulltext\") return fulltextAccessor;\n\n        // Schema properties\n        return this.#getFieldBuilderForProperty(kindNames, property, alias);\n      },\n    });\n  }\n\n  #hasSearchableField(kindNames: readonly string[] | undefined): boolean {\n    if (!kindNames) return false;\n    return this.#config.schemaIntrospector.hasSearchableField(kindNames);\n  }\n\n  #expandTraversalEdgeKinds(\n    edgeKind: string,\n    includeImplyingEdges: boolean,\n  ): readonly string[] {\n    return includeImplyingEdges ?\n        this.#config.registry.expandImplyingEdges(edgeKind)\n      : [edgeKind];\n  }\n\n  #expandInverseTraversalEdgeKinds(\n    edgeKinds: readonly string[],\n    includeImplyingEdges: boolean,\n  ): readonly string[] {\n    const inverseKinds = new Set<string>();\n\n    for (const kind of edgeKinds) {\n      const inverseKind = this.#config.registry.getInverseEdge(kind);\n      if (inverseKind === undefined) {\n        continue;\n      }\n\n      inverseKinds.add(inverseKind);\n\n      if (!includeImplyingEdges) {\n        continue;\n      }\n\n      for (const implyingKind of this.#config.registry.expandImplyingEdges(\n        inverseKind,\n      )) {\n        inverseKinds.add(implyingKind);\n      }\n    }\n\n    return [...inverseKinds];\n  }\n\n  /**\n   * Gets edge kind names for an edge alias.\n   */\n  #getEdgeKindNamesForAlias(alias: string): readonly string[] | undefined {\n    for (const traversal of this.#state.traversals) {\n      if (traversal.edgeAlias === alias) {\n        return mergeEdgeKinds(traversal);\n      }\n    }\n    return undefined;\n  }\n\n  /**\n   * Determines the appropriate field builder for an edge property based on Zod schema type.\n   */\n  #getFieldBuilderForEdgeProperty(\n    edgeKindNames: readonly string[] | undefined,\n    property: string,\n    alias: string,\n  ): BaseFieldAccessor {\n    const typeInfo =\n      edgeKindNames ?\n        this.#config.schemaIntrospector.getSharedEdgeFieldTypeInfo(\n          edgeKindNames,\n          property,\n        )\n      : undefined;\n\n    const ref = fieldRef(alias, [\"props\"], {\n      jsonPointer: jsonPointer([property]),\n      valueType: typeInfo?.valueType,\n      elementType: typeInfo?.elementType,\n    });\n\n    return this.#buildFieldBuilderForTypeInfo(ref, typeInfo);\n  }\n\n  #createEdgeAccessor(alias: string): EdgeAccessor<EdgeType> {\n    const edgeKindNames = this.#getEdgeKindNamesForAlias(alias);\n    const idAccessor = stringField(\n      fieldRef(alias, [\"id\"], { valueType: \"string\" }),\n    );\n    const kindAccessor = stringField(\n      fieldRef(alias, [\"kind\"], { valueType: \"string\" }),\n    );\n    const fromIdAccessor = stringField(\n      fieldRef(alias, [\"from_id\"], { valueType: \"string\" }),\n    );\n    const toIdAccessor = stringField(\n      fieldRef(alias, [\"to_id\"], { valueType: \"string\" }),\n    );\n\n    if (this.#state.dynamicEdgeAliases.has(alias)) {\n      return {\n        id: idAccessor,\n        kind: kindAccessor,\n        fromId: fromIdAccessor,\n        toId: toIdAccessor,\n        field: (name: string) =>\n          createDynamicFieldBuilder(\n            this.#config.schemaIntrospector,\n            alias,\n            name,\n            edgeKindNames,\n            \"edge\",\n          ),\n      } as unknown as EdgeAccessor<EdgeType>;\n    }\n\n    // Use a Proxy to provide flattened property access\n    return new Proxy({} as EdgeAccessor<EdgeType>, {\n      get: (_, property: string | symbol) => {\n        // Handle symbols and special properties to avoid infinite loops\n        if (typeof property === \"symbol\") return;\n        if (property === \"then\") return;\n        if (property === \"toJSON\") return;\n\n        // System fields\n        if (property === \"id\") return idAccessor;\n        if (property === \"kind\") return kindAccessor;\n        if (property === \"fromId\") return fromIdAccessor;\n        if (property === \"toId\") return toIdAccessor;\n\n        // Schema properties\n        return this.#getFieldBuilderForEdgeProperty(\n          edgeKindNames,\n          property,\n          alias,\n        );\n      },\n    });\n  }\n}\n","/**\n * UnionableQuery - A query formed by combining multiple queries with set operations.\n */\nimport { type SQL } from \"drizzle-orm\";\n\nimport {\n  type GraphBackend,\n  type TransactionBackend,\n} from \"../../backend/types\";\nimport { type GraphDef } from \"../../core/define-graph\";\nimport {\n  type ComposableQuery,\n  type QueryAst,\n  type SetOperation,\n  type SetOperationType,\n  type Traversal,\n} from \"../ast\";\nimport {\n  type CompileQueryOptions,\n  compileSetOperation,\n} from \"../compiler/index\";\nimport { mapResults } from \"../execution\";\nimport { buildCompileOptions } from \"./compile-options\";\nimport { composableQueryHasParameterReferences } from \"./prepared-query\";\nimport {\n  type AliasMap,\n  type EdgeAliasMap,\n  type QueryBuilderConfig,\n  type SelectContext,\n} from \"./types\";\n\nconst NOT_COMPUTED = Symbol(\"NOT_COMPUTED\");\n\n// Forward declaration for ExecutableQuery to avoid circular imports\n// G and R are used for type compatibility with ExecutableQuery but not accessed in the interface body\ninterface ExecutableQueryLike<\n  // eslint-disable-next-line @typescript-eslint/no-unused-vars -- Used for type compatibility\n  G extends GraphDef,\n  // eslint-disable-next-line @typescript-eslint/no-unused-vars -- Used for type compatibility\n  R,\n> {\n  toAst(): QueryAst;\n}\n\n/**\n * Internal state for unionable query.\n */\ntype UnionableQueryState = Readonly<{\n  left: ComposableQuery;\n  operator: SetOperationType;\n  right: ComposableQuery;\n  limit?: number;\n  offset?: number;\n  // For result transformation\n  startAlias?: string;\n  traversals?: readonly Traversal[];\n  selectFn?: (context: SelectContext<AliasMap, EdgeAliasMap>) => unknown;\n}>;\n\n/**\n * A query formed by combining multiple queries with set operations.\n * Supports chaining: q1.union(q2).intersect(q3)\n */\nexport class UnionableQuery<G extends GraphDef, R> {\n  readonly #config: QueryBuilderConfig;\n  readonly #state: UnionableQueryState;\n  #cachedCompiled: SQL | typeof NOT_COMPUTED = NOT_COMPUTED;\n\n  constructor(config: QueryBuilderConfig, state: UnionableQueryState) {\n    this.#config = config;\n    this.#state = state;\n  }\n\n  /**\n   * Combines with another query using UNION.\n   */\n  union(other: ExecutableQueryLike<G, R>): UnionableQuery<G, R> {\n    return new UnionableQuery(this.#config, {\n      left: this.toAst(),\n      operator: \"union\",\n      right: other.toAst(),\n      // Preserve result transformation info (only include defined properties)\n      ...(this.#state.startAlias !== undefined && {\n        startAlias: this.#state.startAlias,\n      }),\n      ...(this.#state.traversals !== undefined && {\n        traversals: this.#state.traversals,\n      }),\n      ...(this.#state.selectFn !== undefined && {\n        selectFn: this.#state.selectFn,\n      }),\n    });\n  }\n\n  /**\n   * Combines with another query using UNION ALL.\n   */\n  unionAll(other: ExecutableQueryLike<G, R>): UnionableQuery<G, R> {\n    return new UnionableQuery(this.#config, {\n      left: this.toAst(),\n      operator: \"unionAll\",\n      right: other.toAst(),\n      // Preserve result transformation info (only include defined properties)\n      ...(this.#state.startAlias !== undefined && {\n        startAlias: this.#state.startAlias,\n      }),\n      ...(this.#state.traversals !== undefined && {\n        traversals: this.#state.traversals,\n      }),\n      ...(this.#state.selectFn !== undefined && {\n        selectFn: this.#state.selectFn,\n      }),\n    });\n  }\n\n  /**\n   * Combines with another query using INTERSECT.\n   */\n  intersect(other: ExecutableQueryLike<G, R>): UnionableQuery<G, R> {\n    return new UnionableQuery(this.#config, {\n      left: this.toAst(),\n      operator: \"intersect\",\n      right: other.toAst(),\n      // Preserve result transformation info (only include defined properties)\n      ...(this.#state.startAlias !== undefined && {\n        startAlias: this.#state.startAlias,\n      }),\n      ...(this.#state.traversals !== undefined && {\n        traversals: this.#state.traversals,\n      }),\n      ...(this.#state.selectFn !== undefined && {\n        selectFn: this.#state.selectFn,\n      }),\n    });\n  }\n\n  /**\n   * Combines with another query using EXCEPT.\n   */\n  except(other: ExecutableQueryLike<G, R>): UnionableQuery<G, R> {\n    return new UnionableQuery(this.#config, {\n      left: this.toAst(),\n      operator: \"except\",\n      right: other.toAst(),\n      // Preserve result transformation info (only include defined properties)\n      ...(this.#state.startAlias !== undefined && {\n        startAlias: this.#state.startAlias,\n      }),\n      ...(this.#state.traversals !== undefined && {\n        traversals: this.#state.traversals,\n      }),\n      ...(this.#state.selectFn !== undefined && {\n        selectFn: this.#state.selectFn,\n      }),\n    });\n  }\n\n  /**\n   * Limits the number of results from the combined query.\n   */\n  limit(n: number): UnionableQuery<G, R> {\n    return new UnionableQuery(this.#config, { ...this.#state, limit: n });\n  }\n\n  /**\n   * Offsets the results from the combined query.\n   */\n  offset(n: number): UnionableQuery<G, R> {\n    return new UnionableQuery(this.#config, { ...this.#state, offset: n });\n  }\n\n  /**\n   * Builds the set operation AST.\n   */\n  toAst(): SetOperation {\n    return {\n      __type: \"set_operation\",\n      operator: this.#state.operator,\n      left: this.#state.left,\n      right: this.#state.right,\n      ...(this.#state.limit !== undefined && { limit: this.#state.limit }),\n      ...(this.#state.offset !== undefined && { offset: this.#state.offset }),\n    };\n  }\n\n  /**\n   * Compiles the query and returns the SQL text and parameters.\n   *\n   * Requires a backend to be configured (the backend determines the SQL dialect).\n   * Use this for debugging, logging, or running the query with a custom executor.\n   */\n  toSQL(): Readonly<{ sql: string; params: readonly unknown[] }> {\n    if (!this.#config.backend?.compileSql) {\n      throw new Error(\n        \"Cannot convert to SQL: no backend configured or backend does not support compileSql. \" +\n          \"Use store.query() to get a backend-aware query builder.\",\n      );\n    }\n    return this.#config.backend.compileSql(this.compile());\n  }\n\n  /**\n   * Compiles the set operation to SQL.\n   */\n  compile(): SQL {\n    if (this.#cachedCompiled !== NOT_COMPUTED) {\n      return this.#cachedCompiled;\n    }\n\n    const compiled = compileSetOperation(\n      this.toAst(),\n      this.#config.graphId,\n      this.#compileOptions(),\n    );\n    this.#cachedCompiled = compiled;\n    return compiled;\n  }\n\n  #compileOptions(): CompileQueryOptions {\n    return buildCompileOptions(this.#config);\n  }\n\n  /**\n   * Executes the combined query.\n   */\n  async execute(): Promise<readonly R[]> {\n    if (!this.#config.backend) {\n      throw new Error(\n        \"Cannot execute query: no backend configured. \" +\n          \"Use store.query() or pass a backend to createQueryBuilder().\",\n      );\n    }\n\n    if (composableQueryHasParameterReferences(this.toAst())) {\n      throw new Error(\n        \"Query contains param() references. Use .prepare().execute({...}) instead of .execute().\",\n      );\n    }\n\n    const compiled = this.compile();\n    const rows =\n      await this.#config.backend.execute<Record<string, unknown>>(compiled);\n\n    // Apply select function transformation if available\n    if (this.#state.selectFn && this.#state.startAlias) {\n      return mapResults(\n        rows,\n        this.#state.startAlias,\n        this.#state.traversals ?? [],\n        this.#state.selectFn,\n      ) as readonly R[];\n    }\n\n    return rows as readonly R[];\n  }\n\n  /**\n   * Executes the combined query against a provided backend.\n   *\n   * Used by `store.batch()` to run multiple queries over a single connection.\n   */\n  async executeOn(\n    backend: GraphBackend | TransactionBackend,\n  ): Promise<readonly R[]> {\n    if (composableQueryHasParameterReferences(this.toAst())) {\n      throw new Error(\n        \"Query contains param() references. Use .prepare().execute({...}) instead of .execute().\",\n      );\n    }\n\n    const compiled = this.compile();\n    const rows = await backend.execute<Record<string, unknown>>(compiled);\n\n    if (this.#state.selectFn && this.#state.startAlias) {\n      return mapResults(\n        rows,\n        this.#state.startAlias,\n        this.#state.traversals ?? [],\n        this.#state.selectFn,\n      ) as readonly R[];\n    }\n\n    return rows as readonly R[];\n  }\n}\n","/**\n * Aggregate and HAVING Helper Functions\n *\n * Provides factory functions for creating aggregate expressions (COUNT, SUM, etc.)\n * and HAVING clause predicates for use in GROUP BY queries.\n */\nimport {\n  type AggregateComparisonPredicate,\n  type AggregateExpr,\n  type ComparisonOp,\n  type FieldRef,\n} from \"../ast\";\nimport { jsonPointer } from \"../json-pointer\";\n\n// ============================================================\n// Aggregate Helpers\n// ============================================================\n\n/**\n * Creates a COUNT aggregate expression.\n *\n * @param alias - The node alias to count\n * @param field - Optional field to count (defaults to counting nodes by ID)\n *\n * @example\n * ```typescript\n * // COUNT all persons\n * count(\"p\")\n *\n * // COUNT persons with email field\n * count(\"p\", \"email\")\n * ```\n */\nexport function count(alias: string, field?: string): AggregateExpr {\n  return {\n    __type: \"aggregate\",\n    function: \"count\",\n    field: {\n      __type: \"field_ref\",\n      alias,\n      path: field ? [\"props\"] : [\"id\"],\n      jsonPointer: field ? jsonPointer([field]) : undefined,\n      valueType: field ? undefined : \"string\",\n    },\n  };\n}\n\n/**\n * Creates a COUNT DISTINCT aggregate expression.\n *\n * @param alias - The node alias to count\n * @param field - Optional field to count distinct values of\n */\nexport function countDistinct(alias: string, field?: string): AggregateExpr {\n  return {\n    __type: \"aggregate\",\n    function: \"countDistinct\",\n    field: {\n      __type: \"field_ref\",\n      alias,\n      path: field ? [\"props\"] : [\"id\"],\n      jsonPointer: field ? jsonPointer([field]) : undefined,\n      valueType: field ? undefined : \"string\",\n    },\n  };\n}\n\n/**\n * Creates a COUNT aggregate expression over an edge alias.\n *\n * Counts edges directly, without joining back to the target node table.\n * This has different semantics from `count(targetAlias)`:\n *\n * - `countEdges(edgeAlias)` — counts live edges, regardless of target-node\n *   temporal state. If a target node's `validTo` is in the past while its\n *   incident edges are still live, those edges are still counted.\n * - `count(targetAlias)` — counts edges whose target node is currently\n *   valid under the query's temporal mode.\n *\n * For the common case (\"how many follow relationships does this user\n * have?\") the edge-count semantics is what you want, and the compiler\n * can skip the target-node join entirely — measurably faster on\n * full-graph aggregates where the join dominates cost.\n *\n * @example\n * ```typescript\n * store\n *   .query()\n *   .from(\"User\", \"u\")\n *   .optionalTraverse(\"follows\", \"e\", { expand: \"none\" })\n *   .to(\"User\", \"target\")\n *   .groupByNode(\"u\")\n *   .aggregate({\n *     name: field(\"u\", \"name\"),\n *     // counts edges — skips the target-node join\n *     followCount: countEdges(\"e\"),\n *   })\n *   .execute();\n * ```\n */\nexport function countEdges(edgeAlias: string): AggregateExpr {\n  return count(edgeAlias);\n}\n\n/**\n * Creates a COUNT DISTINCT aggregate expression over an edge alias.\n * See {@link countEdges} for semantics.\n *\n * Distinct-on-edge-id is equivalent to `countEdges` when the query\n * surface produces each edge exactly once, but stays meaningful under\n * polymorphic expansions and ontology-driven edge fan-outs where the\n * same edge can appear multiple times in the join output.\n */\nexport function countDistinctEdges(edgeAlias: string): AggregateExpr {\n  return countDistinct(edgeAlias);\n}\n\n/**\n * Creates a SUM aggregate expression.\n *\n * @param alias - The node alias\n * @param field - The numeric field to sum\n */\nexport function sum(alias: string, field: string): AggregateExpr {\n  return {\n    __type: \"aggregate\",\n    function: \"sum\",\n    field: {\n      __type: \"field_ref\",\n      alias,\n      path: [\"props\"],\n      jsonPointer: jsonPointer([field]),\n      valueType: \"number\",\n    },\n  };\n}\n\n/**\n * Creates an AVG aggregate expression.\n *\n * @param alias - The node alias\n * @param field - The numeric field to average\n */\nexport function avg(alias: string, field: string): AggregateExpr {\n  return {\n    __type: \"aggregate\",\n    function: \"avg\",\n    field: {\n      __type: \"field_ref\",\n      alias,\n      path: [\"props\"],\n      jsonPointer: jsonPointer([field]),\n      valueType: \"number\",\n    },\n  };\n}\n\n/**\n * Creates a MIN aggregate expression.\n *\n * @param alias - The node alias\n * @param field - The field to find minimum of\n */\nexport function min(alias: string, field: string): AggregateExpr {\n  return {\n    __type: \"aggregate\",\n    function: \"min\",\n    field: {\n      __type: \"field_ref\",\n      alias,\n      path: [\"props\"],\n      jsonPointer: jsonPointer([field]),\n      valueType: \"number\",\n    },\n  };\n}\n\n/**\n * Creates a MAX aggregate expression.\n *\n * @param alias - The node alias\n * @param field - The field to find maximum of\n */\nexport function max(alias: string, field: string): AggregateExpr {\n  return {\n    __type: \"aggregate\",\n    function: \"max\",\n    field: {\n      __type: \"field_ref\",\n      alias,\n      path: [\"props\"],\n      jsonPointer: jsonPointer([field]),\n      valueType: \"number\",\n    },\n  };\n}\n\n/**\n * Creates a field reference for use in aggregate.\n *\n * @param alias - The node alias\n * @param path - Path to the field. Use \"id\" for node ID, \"kind\" for node kind,\n *               or the property name directly (e.g., \"title\", \"year\").\n *\n * @example\n * ```typescript\n * field(\"p\", \"id\")      // Node ID\n * field(\"p\", \"kind\")    // Node kind\n * field(\"p\", \"title\")   // Property field\n * field(\"p\", \"nested\", \"field\")  // Nested property\n * ```\n */\nexport function field(alias: string, ...path: string[]): FieldRef {\n  if (path.length === 0 || path[0] === \"id\") {\n    return {\n      __type: \"field_ref\",\n      alias,\n      path: [\"id\"],\n      valueType: \"string\",\n    };\n  }\n  if (path[0] === \"kind\") {\n    return {\n      __type: \"field_ref\",\n      alias,\n      path: [\"kind\"],\n      valueType: \"string\",\n    };\n  }\n  if (path[0] === \"props\") {\n    throw new Error(\n      `field(): Do not include \"props\" in the path. Use field(\"${alias}\", ${path\n        .slice(1)\n        .map((p) => `\"${p}\"`)\n        .join(\", \")}) instead.`,\n    );\n  }\n  return {\n    __type: \"field_ref\",\n    alias,\n    path: [\"props\"],\n    jsonPointer: jsonPointer(path),\n  };\n}\n\n// ============================================================\n// HAVING Helpers\n// ============================================================\n\n/**\n * Creates a HAVING predicate that compares an aggregate to a value.\n *\n * @param aggregate - The aggregate expression (count, sum, avg, etc.)\n * @param op - The comparison operator\n * @param value - The value to compare against\n *\n * @example\n * ```typescript\n * // HAVING COUNT(*) > 10\n * having(count(\"p\"), \"gt\", 10)\n *\n * // HAVING AVG(salary) >= 50000\n * having(avg(\"p\", \"salary\"), \"gte\", 50000)\n * ```\n */\nexport function having(\n  aggregate: AggregateExpr,\n  op: ComparisonOp,\n  value: number | string | boolean,\n): AggregateComparisonPredicate {\n  return {\n    __type: \"aggregate_comparison\",\n    op,\n    aggregate,\n    value: {\n      __type: \"literal\",\n      value,\n      valueType: typeof value === \"number\" ? \"number\" : \"string\",\n    },\n  };\n}\n\n/**\n * Creates a HAVING predicate: aggregate > value\n */\nexport function havingGt(\n  aggregate: AggregateExpr,\n  value: number,\n): AggregateComparisonPredicate {\n  return having(aggregate, \"gt\", value);\n}\n\n/**\n * Creates a HAVING predicate: aggregate >= value\n */\nexport function havingGte(\n  aggregate: AggregateExpr,\n  value: number,\n): AggregateComparisonPredicate {\n  return having(aggregate, \"gte\", value);\n}\n\n/**\n * Creates a HAVING predicate: aggregate < value\n */\nexport function havingLt(\n  aggregate: AggregateExpr,\n  value: number,\n): AggregateComparisonPredicate {\n  return having(aggregate, \"lt\", value);\n}\n\n/**\n * Creates a HAVING predicate: aggregate <= value\n */\nexport function havingLte(\n  aggregate: AggregateExpr,\n  value: number,\n): AggregateComparisonPredicate {\n  return having(aggregate, \"lte\", value);\n}\n\n/**\n * Creates a HAVING predicate: aggregate = value\n */\nexport function havingEq(\n  aggregate: AggregateExpr,\n  value: number,\n): AggregateComparisonPredicate {\n  return having(aggregate, \"eq\", value);\n}\n","/**\n * Query Fragment Composition\n *\n * Provides types and utilities for creating reusable query fragments\n * that can be composed together using the pipe() method.\n *\n * @example\n * ```typescript\n * // Define a reusable fragment\n * const activeUsers = createFragment<MyGraph>()((q) =>\n *   q.whereNode(\"u\", ({ status }) => status.eq(\"active\"))\n * );\n *\n * // Use in queries\n * const results = await query()\n *   .from(\"User\", \"u\")\n *   .pipe(activeUsers)\n *   .select((ctx) => ctx.u)\n *   .execute();\n * ```\n */\nimport { type GraphDef } from \"../../core/define-graph\";\nimport { type QueryBuilder } from \"./query-builder\";\nimport { type TraversalBuilder } from \"./traversal-builder\";\nimport { type AliasMap, type EdgeAliasMap } from \"./types\";\n\n// ============================================================\n// Fragment Types\n// ============================================================\n\n/**\n * A query fragment that transforms a QueryBuilder.\n *\n * Fragments are functions that take a builder and return a modified builder.\n * They can add predicates, traversals, ordering, and other query operations.\n *\n * @typeParam G - The graph definition\n * @typeParam InAliases - Input alias map (what the fragment requires)\n * @typeParam OutAliases - Output alias map (what the fragment produces)\n * @typeParam InEdgeAliases - Input edge alias map\n * @typeParam OutEdgeAliases - Output edge alias map\n */\nexport type QueryFragment<\n  G extends GraphDef,\n  InAliases extends AliasMap = AliasMap,\n  OutAliases extends AliasMap = InAliases,\n  InEdgeAliases extends EdgeAliasMap = EdgeAliasMap,\n  OutEdgeAliases extends EdgeAliasMap = InEdgeAliases,\n> = (\n  builder: QueryBuilder<G, InAliases, InEdgeAliases>,\n) => QueryBuilder<G, OutAliases, OutEdgeAliases>;\n\n/**\n * A flexible query fragment that works with any compatible builder.\n *\n * Use this when you want a fragment that only requires certain aliases\n * to exist, but doesn't care about other aliases that may be present.\n */\nexport type FlexibleQueryFragment<\n  G extends GraphDef,\n  RequiredAliases extends AliasMap = AliasMap,\n  AddedAliases extends AliasMap = AliasMap,\n  RequiredEdgeAliases extends EdgeAliasMap = EdgeAliasMap,\n  AddedEdgeAliases extends EdgeAliasMap = EdgeAliasMap,\n> = <Aliases extends RequiredAliases, EdgeAliases extends RequiredEdgeAliases>(\n  builder: QueryBuilder<G, Aliases, EdgeAliases>,\n) => QueryBuilder<G, Aliases & AddedAliases, EdgeAliases & AddedEdgeAliases>;\n\n/**\n * A traversal fragment that transforms a TraversalBuilder.\n *\n * Use this for reusable traversal patterns including edge filtering,\n * recursive traversals, and path collection.\n */\nexport type TraversalFragment<\n  G extends GraphDef,\n  EK extends keyof G[\"edges\"] & string,\n  EA extends string,\n  InAliases extends AliasMap = AliasMap,\n  InEdgeAliases extends EdgeAliasMap = EdgeAliasMap,\n> = (\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Direction type is context-dependent\n  builder: TraversalBuilder<G, InAliases, InEdgeAliases, EK, EA, any>,\n) => unknown;\n\n// ============================================================\n// Fragment Factory\n// ============================================================\n\n/**\n * Creates a typed query fragment factory for a specific graph.\n *\n * This is the recommended way to create reusable fragments with full type safety.\n * The factory returns a function that creates fragments bound to your graph type.\n *\n * @example\n * ```typescript\n * // Create a factory for your graph\n * const fragment = createFragment<MyGraph>();\n *\n * // Define a simple filter fragment\n * const activeOnly = fragment((q) =>\n *   q.whereNode(\"u\", ({ isActive }) => isActive.eq(true))\n * );\n *\n * // Define a traversal fragment\n * const withManager = fragment((q) =>\n *   q.traverse(\"reportsTo\", \"r\").to(\"User\", \"manager\")\n * );\n *\n * // Compose fragments\n * query()\n *   .from(\"User\", \"u\")\n *   .pipe(activeOnly)\n *   .pipe(withManager)\n *   .select((ctx) => ({ user: ctx.u, manager: ctx.manager }))\n * ```\n */\n/**\n * Identity function used by createFragment to return the fragment unchanged.\n * Defined at module scope to satisfy consistent-function-scoping lint rule.\n */\nfunction fragmentIdentity<\n  G extends GraphDef,\n  InAliases extends AliasMap,\n  OutAliases extends AliasMap,\n  InEdgeAliases extends EdgeAliasMap,\n  OutEdgeAliases extends EdgeAliasMap,\n>(\n  fn: (\n    builder: QueryBuilder<G, InAliases, InEdgeAliases>,\n  ) => QueryBuilder<G, OutAliases, OutEdgeAliases>,\n): QueryFragment<G, InAliases, OutAliases, InEdgeAliases, OutEdgeAliases> {\n  return fn;\n}\n\nexport function createFragment<G extends GraphDef>(): <\n  InAliases extends AliasMap,\n  OutAliases extends AliasMap,\n  InEdgeAliases extends EdgeAliasMap,\n  OutEdgeAliases extends EdgeAliasMap,\n>(\n  fn: (\n    builder: QueryBuilder<G, InAliases, InEdgeAliases>,\n  ) => QueryBuilder<G, OutAliases, OutEdgeAliases>,\n) => QueryFragment<G, InAliases, OutAliases, InEdgeAliases, OutEdgeAliases> {\n  return fragmentIdentity;\n}\n\n/**\n * Combines multiple fragments into a single fragment.\n *\n * Fragments are applied in order from left to right.\n *\n * @example\n * ```typescript\n * const combinedFragment = composeFragments(\n *   activeOnly,\n *   withManager,\n *   recentlyUpdated\n * );\n *\n * query()\n *   .from(\"User\", \"u\")\n *   .pipe(combinedFragment)\n *   .select(...)\n * ```\n */\nexport function composeFragments<\n  G extends GraphDef,\n  A1 extends AliasMap,\n  A2 extends AliasMap,\n  E1 extends EdgeAliasMap,\n  E2 extends EdgeAliasMap,\n>(f1: QueryFragment<G, A1, A2, E1, E2>): QueryFragment<G, A1, A2, E1, E2>;\n\nexport function composeFragments<\n  G extends GraphDef,\n  A1 extends AliasMap,\n  A2 extends AliasMap,\n  A3 extends AliasMap,\n  E1 extends EdgeAliasMap,\n  E2 extends EdgeAliasMap,\n  E3 extends EdgeAliasMap,\n>(\n  f1: QueryFragment<G, A1, A2, E1, E2>,\n  f2: QueryFragment<G, A2, A3, E2, E3>,\n): QueryFragment<G, A1, A3, E1, E3>;\n\nexport function composeFragments<\n  G extends GraphDef,\n  A1 extends AliasMap,\n  A2 extends AliasMap,\n  A3 extends AliasMap,\n  A4 extends AliasMap,\n  E1 extends EdgeAliasMap,\n  E2 extends EdgeAliasMap,\n  E3 extends EdgeAliasMap,\n  E4 extends EdgeAliasMap,\n>(\n  f1: QueryFragment<G, A1, A2, E1, E2>,\n  f2: QueryFragment<G, A2, A3, E2, E3>,\n  f3: QueryFragment<G, A3, A4, E3, E4>,\n): QueryFragment<G, A1, A4, E1, E4>;\n\nexport function composeFragments<\n  G extends GraphDef,\n  A1 extends AliasMap,\n  A2 extends AliasMap,\n  A3 extends AliasMap,\n  A4 extends AliasMap,\n  A5 extends AliasMap,\n  E1 extends EdgeAliasMap,\n  E2 extends EdgeAliasMap,\n  E3 extends EdgeAliasMap,\n  E4 extends EdgeAliasMap,\n  E5 extends EdgeAliasMap,\n>(\n  f1: QueryFragment<G, A1, A2, E1, E2>,\n  f2: QueryFragment<G, A2, A3, E2, E3>,\n  f3: QueryFragment<G, A3, A4, E3, E4>,\n  f4: QueryFragment<G, A4, A5, E4, E5>,\n): QueryFragment<G, A1, A5, E1, E5>;\n\nexport function composeFragments<G extends GraphDef>(\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Variadic composition requires any\n  ...fragments: QueryFragment<G, any, any, any, any>[]\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Return type depends on input types\n): QueryFragment<G, any, any, any, any> {\n  return (builder) => {\n    let result = builder;\n    for (const fragment of fragments) {\n      result = fragment(result);\n    }\n    return result;\n  };\n}\n\n// ============================================================\n// Common Fragment Patterns\n// ============================================================\n\n/**\n * Creates a fragment that adds ordering.\n *\n * @example\n * ```typescript\n * const byCreatedAt = orderByFragment<MyGraph, \"u\">(\"u\", \"createdAt\", \"desc\");\n * ```\n */\nexport function orderByFragment<G extends GraphDef, A extends string>(\n  alias: A,\n  field: string,\n  direction: \"asc\" | \"desc\" = \"asc\",\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Flexible alias types\n): QueryFragment<G, any, any, any, any> {\n  return (builder) => builder.orderBy(alias, field, direction);\n}\n\n/**\n * Creates a fragment that adds a limit.\n *\n * @example\n * ```typescript\n * const first10 = limitFragment<MyGraph>(10);\n * ```\n */\nexport function limitFragment<G extends GraphDef>(\n  n: number,\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Flexible alias types\n): QueryFragment<G, any, any, any, any> {\n  return (builder) => builder.limit(n);\n}\n\n/**\n * Creates a fragment that adds an offset.\n *\n * @example\n * ```typescript\n * const skip10 = offsetFragment<MyGraph>(10);\n * ```\n */\nexport function offsetFragment<G extends GraphDef>(\n  n: number,\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Flexible alias types\n): QueryFragment<G, any, any, any, any> {\n  return (builder) => builder.offset(n);\n}\n","/**\n * Query Builder Module\n *\n * Re-exports from the builder submodules for clean imports.\n * Also wires up circular dependencies between classes.\n */\n\n// Import classes for circular dependency wiring\nimport { setUnionableQueryClass } from \"./executable-query\";\nimport { QueryBuilder } from \"./query-builder\";\nimport { setQueryBuilderClass } from \"./traversal-builder\";\nimport { UnionableQuery } from \"./unionable-query\";\n\n// Wire up circular dependencies.\n// Type assertions are needed because the circular dependency resolution\n// requires passing classes that TypeScript can't verify at module init time.\nsetQueryBuilderClass(QueryBuilder);\nsetUnionableQueryClass(UnionableQuery);\n\n// Classes\nexport {\n  type AggregateResult,\n  ExecutableAggregateQuery,\n} from \"./executable-aggregate-query\";\nexport { ExecutableQuery } from \"./executable-query\";\nexport { PreparedQuery } from \"./prepared-query\";\nexport { QueryBuilder } from \"./query-builder\";\nexport { TraversalBuilder } from \"./traversal-builder\";\nexport { UnionableQuery } from \"./unionable-query\";\n\n// Aggregate helpers\nexport {\n  avg,\n  count,\n  countDistinct,\n  countDistinctEdges,\n  countEdges,\n  field,\n  having,\n  havingEq,\n  havingGt,\n  havingGte,\n  havingLt,\n  havingLte,\n  max,\n  min,\n  sum,\n} from \"./aggregates\";\n\n// Fragment composition\nexport {\n  composeFragments,\n  createFragment,\n  type FlexibleQueryFragment,\n  limitFragment,\n  offsetFragment,\n  orderByFragment,\n  type QueryFragment,\n  type TraversalFragment,\n} from \"./fragment\";\n\n// AST building utilities\nexport { buildQueryAst } from \"./ast-builder\";\n\n// Types\nexport {\n  type AliasMap,\n  type ArrayFieldAccessor,\n  type BaseFieldAccessor,\n  type BatchableQuery,\n  type BatchResults,\n  type BooleanFieldAccessor,\n  type CreateQueryBuilderOptions,\n  type DateFieldAccessor,\n  type EdgeAccessor,\n  type EmbeddingFieldAccessor,\n  type FieldAccessor,\n  type NodeAccessor,\n  type NodeAlias,\n  type NumberFieldAccessor,\n  type ObjectFieldAccessor,\n  type PaginatedResult,\n  type PaginateOptions,\n  type PropsAccessor,\n  type QueryBuilderConfig,\n  type QueryBuilderState,\n  type RecursiveAlias,\n  type RecursiveAliasMap,\n  type RecursiveAliasValue,\n  type RecursiveTraversalOptions,\n  type SelectableEdge,\n  type SelectableEdgeMeta,\n  type SelectableNode,\n  type SelectableNodeMeta,\n  type SelectContext,\n  type StreamOptions,\n  type StringFieldAccessor,\n  type TraversalExpansion,\n  type UniqueAlias,\n  type ValidEdgeTargets,\n} from \"./types\";\n\n// Dynamic (string-keyed) builder types\nexport {\n  type DynamicEdgeAccessor,\n  type DynamicEdgeType,\n  type DynamicFieldBuilder,\n  type DynamicNodeAccessor,\n  type DynamicNodeType,\n  type DynamicSelectableEdge,\n  type DynamicSelectableNode,\n} from \"./dynamic\";\n\n// Validation utilities\nexport { validateSqlIdentifier } from \"./validation\";\n","/**\n * Fluent query builder for TypeGraph.\n *\n * Provides a type-safe, chainable API for building queries.\n * Each method returns a new builder instance with expanded type information.\n *\n * This module re-exports from the builder submodules and provides the\n * createQueryBuilder factory function.\n */\nimport { type GraphDef } from \"../core/define-graph\";\nimport { type KindRegistry } from \"../registry/kind-registry\";\nimport {\n  type CreateQueryBuilderOptions,\n  QueryBuilder,\n  type QueryBuilderConfig,\n  type QueryBuilderState,\n} from \"./builder/index\";\nimport { createSchemaIntrospector } from \"./schema-introspector\";\n\n// Re-export all classes\nexport {\n  ExecutableAggregateQuery,\n  ExecutableQuery,\n  QueryBuilder,\n} from \"./builder/index\";\n\n// Re-export aggregate helpers\nexport {\n  avg,\n  count,\n  countDistinct,\n  countDistinctEdges,\n  countEdges,\n  field,\n  having,\n  havingEq,\n  havingGt,\n  havingGte,\n  havingLt,\n  havingLte,\n  max,\n  min,\n  sum,\n} from \"./builder/index\";\n\n// Re-export types\nexport type {\n  AggregateResult,\n  AliasMap,\n  BatchableQuery,\n  BatchResults,\n  DynamicEdgeAccessor,\n  DynamicEdgeType,\n  DynamicFieldBuilder,\n  DynamicNodeAccessor,\n  DynamicNodeType,\n  DynamicSelectableEdge,\n  DynamicSelectableNode,\n  EdgeAccessor,\n  FieldAccessor,\n  NodeAccessor,\n  NodeAlias,\n  PaginatedResult,\n  PaginateOptions,\n  PropsAccessor,\n  RecursiveTraversalOptions,\n  SelectableEdge,\n  SelectableNode,\n  SelectContext,\n  StreamOptions,\n  TraversalExpansion,\n} from \"./builder/index\";\n\n// ============================================================\n// Factory Function\n// ============================================================\n\n/**\n * Creates a new query builder for a graph.\n *\n * @param graphId - The graph identifier\n * @param registry - The kind registry for ontology lookups\n * @param options - Optional backend and dialect configuration\n * @returns A new QueryBuilder instance\n *\n * @example\n * ```typescript\n * // Without execution capability (compile only)\n * const builder = createQueryBuilder<MyGraph>(\"my_graph\", registry);\n *\n * // With execution capability\n * const builder = createQueryBuilder<MyGraph>(\"my_graph\", registry, {\n *   backend: myBackend,\n *   dialect: \"sqlite\",\n * });\n * ```\n */\nexport function createQueryBuilder<G extends GraphDef>(\n  graphId: string,\n  registry: KindRegistry,\n  options?: CreateQueryBuilderOptions,\n): QueryBuilder<G> {\n  const schemaIntrospector = createSchemaIntrospector(\n    registry.nodeKinds,\n    registry.edgeKinds,\n  );\n\n  // Build config, only including optional properties if defined\n  const config: QueryBuilderConfig = {\n    graphId,\n    registry,\n    schemaIntrospector,\n    defaultTraversalExpansion: options?.defaultTraversalExpansion ?? \"inverse\",\n    ...(options?.backend !== undefined && { backend: options.backend }),\n    ...(options?.dialect !== undefined && { dialect: options.dialect }),\n    ...(options?.schema !== undefined && { schema: options.schema }),\n    ...(options?.sealedCoordinate !== undefined && {\n      sealedCoordinate: options.sealedCoordinate,\n    }),\n  };\n\n  // A sealed coordinate (StoreView pin) seeds the temporal axis; `.temporal()`\n  // then refuses to override it.\n  const sealed = options?.sealedCoordinate?.valid;\n\n  const initialState: QueryBuilderState = {\n    startAlias: \"\",\n    currentAlias: \"\",\n    startKinds: [],\n    includeSubClasses: false,\n    traversals: [],\n    predicates: [],\n    projection: [],\n    orderBy: [],\n    limit: undefined,\n    offset: undefined,\n    temporalMode: sealed?.mode ?? \"current\",\n    asOf: sealed?.asOf,\n    groupBy: undefined,\n    having: undefined,\n    fusion: undefined,\n    dynamicNodeAliases: new Set(),\n    dynamicEdgeAliases: new Set(),\n  };\n\n  return new QueryBuilder(config, initialState);\n}\n","/**\n * Keeps the fulltext index in sync with node data. One row per node:\n * the values of every `searchable()` field are concatenated (joined by\n * `\\n`) and stored as the indexed `content`, so a single FTS query can\n * match terms spanning multiple source fields — which a per-field\n * layout cannot, since FTS5 / Postgres MATCH require all terms in one\n * indexed document.\n *\n * Sync runs inline in the node-operation call path, so it inherits the\n * caller's transaction context.\n */\nimport { type z } from \"zod\";\n\nimport { type GraphBackend, type TransactionBackend } from \"../backend/types\";\nimport {\n  DEFAULT_SEARCHABLE_LANGUAGE,\n  getSearchableMetadata,\n  type SearchableMetadata,\n} from \"../core/searchable\";\n\ntype SearchableFieldInfo = Readonly<{\n  fieldPath: string;\n  metadata: SearchableMetadata;\n}>;\n\nexport type FulltextSyncContext = Readonly<{\n  graphId: string;\n  nodeKind: string;\n  nodeId: string;\n  backend: GraphBackend | TransactionBackend;\n}>;\n\n/**\n * Cache keyed by the Zod schema *instance*. Schemas are immutable at\n * runtime and the same `nodeKind.schema` reference is reused across\n * every CRUD call, so this collapses the per-write introspection cost\n * to one walk per schema for the lifetime of the process.\n */\nconst searchableFieldsCache = new WeakMap<\n  z.ZodType,\n  readonly SearchableFieldInfo[]\n>();\n\n/**\n * Extracts searchable field information from a Zod schema.\n *\n * Handles top-level searchable() strings as well as wrapped variants\n * (optional / nullable / default / readonly / pipe).\n */\nexport function getSearchableFields(\n  schema: z.ZodType,\n): readonly SearchableFieldInfo[] {\n  const cached = searchableFieldsCache.get(schema);\n  if (cached) return cached;\n\n  const fields = computeSearchableFields(schema);\n  searchableFieldsCache.set(schema, fields);\n  return fields;\n}\n\nfunction computeSearchableFields(\n  schema: z.ZodType,\n): readonly SearchableFieldInfo[] {\n  if (schema.type !== \"object\") return [];\n\n  const def = schema.def as { shape?: Record<string, z.ZodType> };\n  const shape = def.shape;\n  if (!shape) return [];\n\n  const fields: SearchableFieldInfo[] = [];\n  for (const [fieldPath, fieldSchema] of Object.entries(shape)) {\n    const metadata = getSearchableMetadata(fieldSchema);\n    if (metadata !== undefined) {\n      fields.push({ fieldPath, metadata });\n    }\n  }\n  warnIfConflictingLanguages(fields);\n  return fields;\n}\n\n/**\n * Emits a one-time warning per schema when searchable fields declare\n * different `language` values. The first field's language wins on the\n * stored row; true per-field multilingual indexing is not supported\n * today. This fires from `computeSearchableFields`, which is memoized\n * via a WeakMap keyed by schema instance — so the warning is emitted\n * at most once per schema for the lifetime of the process.\n */\nfunction warnIfConflictingLanguages(\n  fields: readonly SearchableFieldInfo[],\n): void {\n  if (fields.length < 2) return;\n  const languages = new Set(fields.map((field) => field.metadata.language));\n  if (languages.size < 2) return;\n  if (typeof console === \"undefined\" || typeof console.warn !== \"function\") {\n    return;\n  }\n  const fieldSummary = fields\n    .map((field) => `${field.fieldPath}=${field.metadata.language}`)\n    .join(\", \");\n  const winning = fields[0]?.metadata.language ?? DEFAULT_SEARCHABLE_LANGUAGE;\n  console.warn(\n    `[typegraph] searchable() fields declare conflicting languages ` +\n      `(${fieldSummary}). The first field's language (\"${winning}\") is ` +\n      `recorded on the fulltext row; true multilingual indexing requires ` +\n      `a dedicated node kind per language.`,\n  );\n}\n\nconst FIELD_SEPARATOR = \"\\n\";\n\n/**\n * Picks a representative language when a node has searchable fields with\n * different language settings. Users who need true per-field\n * multilingual indexing should split the data across node kinds.\n */\nfunction resolveCombinedLanguage(\n  fields: readonly SearchableFieldInfo[],\n): string {\n  return fields[0]?.metadata.language ?? DEFAULT_SEARCHABLE_LANGUAGE;\n}\n\n/**\n * Computes the combined fulltext content for a node, or `undefined`\n * if the node has no non-empty searchable fields.\n *\n * Shared between `syncFulltext` (per-write) and `rebuildFulltextIndex`\n * (bulk) so the two never drift.\n */\nexport function computeFulltextContent(\n  schema: z.ZodType,\n  props: Record<string, unknown>,\n): { content: string; language: string } | undefined {\n  const searchableFields = getSearchableFields(schema);\n  if (searchableFields.length === 0) return undefined;\n\n  const parts: string[] = [];\n  for (const field of searchableFields) {\n    const value = props[field.fieldPath];\n    if (typeof value === \"string\" && value.length > 0) {\n      parts.push(value);\n    }\n  }\n  if (parts.length === 0) return undefined;\n\n  return {\n    content: parts.join(FIELD_SEPARATOR),\n    language: resolveCombinedLanguage(searchableFields),\n  };\n}\n\n/**\n * Syncs the fulltext index row after a node create or update.\n *\n * Concatenates the values of all searchable fields into a single content\n * string and upserts it. If every field is empty / undefined, deletes\n * any existing row for the node.\n */\nexport async function syncFulltext(\n  ctx: FulltextSyncContext,\n  schema: z.ZodType,\n  props: Record<string, unknown>,\n): Promise<void> {\n  const { backend } = ctx;\n\n  if (!backend.upsertFulltext || !backend.deleteFulltext) {\n    return;\n  }\n\n  // `computeFulltextContent` returns `undefined` both when the schema has\n  // no `searchable()` fields and when every value is empty — either case\n  // means the row should not exist. Delete any stale row only when the\n  // schema declares searchable fields (nothing to clean up otherwise).\n  const computed = computeFulltextContent(schema, props);\n  if (computed !== undefined) {\n    await backend.upsertFulltext({\n      graphId: ctx.graphId,\n      nodeKind: ctx.nodeKind,\n      nodeId: ctx.nodeId,\n      content: computed.content,\n      language: computed.language,\n    });\n    return;\n  }\n  if (getSearchableFields(schema).length === 0) return;\n  await backend.deleteFulltext({\n    graphId: ctx.graphId,\n    nodeKind: ctx.nodeKind,\n    nodeId: ctx.nodeId,\n  });\n}\n\n/**\n * Deletes the fulltext row for a node.\n * Called on soft-delete; hard-delete is handled by the backend cascade.\n */\nexport async function deleteNodeFulltext(\n  ctx: FulltextSyncContext,\n  schema: z.ZodType,\n): Promise<void> {\n  const { backend } = ctx;\n\n  if (!backend.deleteFulltext) {\n    return;\n  }\n\n  if (getSearchableFields(schema).length === 0) {\n    return;\n  }\n\n  await backend.deleteFulltext({\n    graphId: ctx.graphId,\n    nodeKind: ctx.nodeKind,\n    nodeId: ctx.nodeId,\n  });\n}\n","/**\n * Rebuilds the fulltext index from existing node data.\n *\n * Iterates nodes via keyset pagination (ORDER BY id ASC, WHERE id > cursor)\n * so rebuild is stable even under shared created_at timestamps and light\n * concurrent writes. Each page runs in its own transaction; batch primitives\n * are used when the backend provides them, with per-row fallback otherwise.\n *\n * Rebuild is a maintenance operation. Concurrent deletes that happen\n * between page fetches can be missed by this pass — document as such.\n */\nimport { type z } from \"zod\";\n\nimport {\n  type GraphBackend,\n  type NodeRow,\n  runOptionallyInTransaction,\n  type TransactionBackend,\n} from \"../backend/types\";\nimport { ConfigurationError, ValidationError } from \"../errors\";\nimport { type KindRegistry } from \"../registry\";\nimport { computeFulltextContent, getSearchableFields } from \"./fulltext-sync\";\n\n/**\n * Default page size. Fits under SQLite's ~32766 placeholder limit with\n * headroom: 6 params/row × 500 rows + 500-entry DELETE IN list ≈ 3500\n * placeholders. Bumping past ~5000 risks the ceiling on SQLite.\n */\nconst DEFAULT_PAGE_SIZE = 500;\n\n/**\n * Default cap on the length of `skippedIds` returned from rebuild. A\n * corrupted database could produce millions of skipped rows; surfacing\n * them all as a single in-memory array would turn a recovery tool into\n * an OOM. The total skipped *count* remains accurate; only the ID\n * listing is truncated. Operators who need the full list for recovery\n * can raise the cap via `maxSkippedIds`.\n */\nconst DEFAULT_MAX_SKIPPED_IDS = 10_000;\n\nexport type RebuildFulltextOptions = Readonly<{\n  /** Page size. Must be a positive integer. Default: 500. */\n  pageSize?: number;\n  /**\n   * Maximum number of skipped node IDs to include in the `skippedIds`\n   * array. Default: 10,000. Set higher to collect the full list when\n   * investigating systemic corruption; set lower when `processed` is\n   * all you care about. The `skipped` total is always accurate.\n   */\n  maxSkippedIds?: number;\n}>;\n\nexport type RebuildFulltextResult = Readonly<{\n  /** Node kinds that were rebuilt (those with at least one searchable field). */\n  kinds: readonly string[];\n  /** Total nodes scanned. */\n  processed: number;\n  /** Fulltext upsert operations executed. */\n  upserted: number;\n  /** Fulltext delete operations executed (soft-deleted or all-empty nodes). */\n  cleared: number;\n  /**\n   * Nodes skipped due to corrupt or non-object `props` (not counted in\n   * upserted/cleared).\n   */\n  skipped: number;\n  /**\n   * IDs of skipped nodes, capped at 10,000 entries so pathological\n   * corruption doesn't turn rebuild into an OOM. See `skippedTruncated`\n   * to tell whether the cap was hit. Empty when `skipped === 0`.\n   */\n  skippedIds: readonly string[];\n  /** True when `skipped > skippedIds.length` (the cap was reached). */\n  skippedTruncated: boolean;\n}>;\n\ntype RebuildContext = Readonly<{\n  graphId: string;\n  backend: GraphBackend;\n  registry: KindRegistry;\n}>;\n\nfunction validatePageSize(value: number | undefined): number {\n  if (value === undefined) return DEFAULT_PAGE_SIZE;\n  if (!Number.isInteger(value) || value <= 0) {\n    throw new ValidationError(\n      `pageSize must be a positive integer, got: ${String(value)}`,\n      {\n        issues: [{ path: \"pageSize\", message: \"Must be a positive integer.\" }],\n      },\n    );\n  }\n  return value;\n}\n\nfunction validateMaxSkippedIds(value: number | undefined): number {\n  if (value === undefined) return DEFAULT_MAX_SKIPPED_IDS;\n  if (!Number.isInteger(value) || value < 0) {\n    throw new ValidationError(\n      `maxSkippedIds must be a non-negative integer, got: ${String(value)}`,\n      {\n        issues: [\n          {\n            path: \"maxSkippedIds\",\n            message: \"Must be a non-negative integer.\",\n          },\n        ],\n      },\n    );\n  }\n  return value;\n}\n\nfunction isPropsObject(value: unknown): value is Record<string, unknown> {\n  return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\nexport async function rebuildFulltextIndex(\n  ctx: RebuildContext,\n  nodeKind: string | undefined,\n  options: RebuildFulltextOptions,\n): Promise<RebuildFulltextResult> {\n  const { backend, registry } = ctx;\n\n  if (!backend.upsertFulltext || !backend.deleteFulltext) {\n    throw new ConfigurationError(\n      \"Backend does not support fulltext; cannot rebuild index\",\n      { backend: backend.dialect, capability: \"fulltext\" },\n    );\n  }\n\n  const pageSize = validatePageSize(options.pageSize);\n  const maxSkippedIds = validateMaxSkippedIds(options.maxSkippedIds);\n\n  const targetKinds =\n    nodeKind === undefined ? [...registry.nodeKinds.keys()] : [nodeKind];\n\n  const rebuiltKinds: string[] = [];\n  let processed = 0;\n  let upserted = 0;\n  let cleared = 0;\n  let skipped = 0;\n  const skippedIds: string[] = [];\n\n  for (const kind of targetKinds) {\n    const nodeType = registry.getNodeType(kind);\n    if (!nodeType) {\n      throw new ConfigurationError(`Unknown node kind: ${kind}`, { kind });\n    }\n    if (getSearchableFields(nodeType.schema).length === 0) {\n      continue;\n    }\n\n    rebuiltKinds.push(kind);\n    let cursor: string | undefined;\n    for (;;) {\n      // Keyset pagination on id. Include soft-deleted nodes so their\n      // stale fulltext rows get cleaned up by this rebuild.\n      const rows = await backend.findNodesByKind({\n        graphId: ctx.graphId,\n        kind,\n        limit: pageSize,\n        excludeDeleted: false,\n        orderBy: \"id\",\n        ...(cursor === undefined ? {} : { after: cursor }),\n      });\n      if (rows.length === 0) break;\n\n      const pageResult = processPage(nodeType.schema, rows);\n      skipped += pageResult.skipped;\n      const remaining = maxSkippedIds - skippedIds.length;\n      if (remaining > 0 && pageResult.skippedIds.length > 0) {\n        skippedIds.push(...pageResult.skippedIds.slice(0, remaining));\n      }\n\n      const writePage = async (\n        target: GraphBackend | TransactionBackend,\n      ): Promise<void> => {\n        if (pageResult.toUpsert.length > 0) {\n          if (target.upsertFulltextBatch) {\n            await target.upsertFulltextBatch({\n              graphId: ctx.graphId,\n              nodeKind: kind,\n              rows: pageResult.toUpsert,\n            });\n          } else if (target.upsertFulltext) {\n            for (const item of pageResult.toUpsert) {\n              await target.upsertFulltext({\n                graphId: ctx.graphId,\n                nodeKind: kind,\n                nodeId: item.nodeId,\n                content: item.content,\n                language: item.language,\n              });\n            }\n          }\n        }\n        if (pageResult.toDelete.length > 0) {\n          if (target.deleteFulltextBatch) {\n            await target.deleteFulltextBatch({\n              graphId: ctx.graphId,\n              nodeKind: kind,\n              nodeIds: pageResult.toDelete,\n            });\n          } else if (target.deleteFulltext) {\n            for (const nodeId of pageResult.toDelete) {\n              await target.deleteFulltext({\n                graphId: ctx.graphId,\n                nodeKind: kind,\n                nodeId,\n              });\n            }\n          }\n        }\n      };\n\n      // Wrapped in a transaction when supported so a partial failure\n      // mid-page doesn't leave the index half-rebuilt. On backends without\n      // transactions, refusing to rebuild would be worse than the lost\n      // atomicity (the index would stay permanently stale).\n      await runOptionallyInTransaction(backend, writePage);\n\n      processed += rows.length;\n      upserted += pageResult.toUpsert.length;\n      cleared += pageResult.toDelete.length;\n\n      const lastRow = rows.at(-1);\n      if (!lastRow) break;\n      cursor = lastRow.id;\n      if (rows.length < pageSize) break;\n    }\n  }\n\n  return {\n    kinds: rebuiltKinds,\n    processed,\n    upserted,\n    cleared,\n    skipped,\n    skippedIds,\n    skippedTruncated: skipped > skippedIds.length,\n  };\n}\n\ninterface PageResult {\n  toUpsert: { nodeId: string; content: string; language: string }[];\n  toDelete: string[];\n  skipped: number;\n  skippedIds: string[];\n}\n\nfunction processPage(schema: z.ZodType, rows: readonly NodeRow[]): PageResult {\n  const toUpsert: PageResult[\"toUpsert\"] = [];\n  const toDelete: string[] = [];\n  const skippedIds: string[] = [];\n  let skipped = 0;\n\n  for (const row of rows) {\n    if (row.deleted_at !== undefined) {\n      toDelete.push(row.id);\n      continue;\n    }\n    let parsed: unknown;\n    try {\n      parsed = JSON.parse(row.props);\n    } catch {\n      skipped += 1;\n      skippedIds.push(row.id);\n      continue;\n    }\n    if (!isPropsObject(parsed)) {\n      skipped += 1;\n      skippedIds.push(row.id);\n      continue;\n    }\n    const computed = computeFulltextContent(schema, parsed);\n    if (computed === undefined) {\n      toDelete.push(row.id);\n    } else {\n      toUpsert.push({\n        nodeId: row.id,\n        content: computed.content,\n        language: computed.language,\n      });\n    }\n  }\n\n  return { toUpsert, toDelete, skipped, skippedIds };\n}\n","/**\n * Embedding Sync Utilities\n *\n * Handles automatic synchronization of embedding fields with the embeddings table.\n * When nodes with embedding properties are created, updated, or deleted,\n * these utilities ensure the embeddings table stays in sync.\n */\nimport { type z } from \"zod\";\n\nimport { type GraphBackend, type TransactionBackend } from \"../backend/types\";\nimport {\n  type ResolvedEmbeddingField,\n  resolveEmbeddingFields,\n} from \"../core/embedding\";\n\n// ============================================================\n// Types\n// ============================================================\n\n/**\n * Information about an embedding field in a node schema.\n *\n * Re-exports the canonical {@link ResolvedEmbeddingField} so the backend\n * gets `dimensions` plus the resolved index `(metric, indexType)` — all\n * three needed to address the field's typed per-`(kind, field)` storage\n * slot when upserting.\n */\ntype EmbeddingFieldInfo = ResolvedEmbeddingField;\n\n/**\n * Context for embedding sync operations.\n */\nexport type EmbeddingSyncContext = Readonly<{\n  graphId: string;\n  nodeKind: string;\n  nodeId: string;\n  backend: GraphBackend | TransactionBackend;\n}>;\n\n// ============================================================\n// Schema Introspection\n// ============================================================\n\n/**\n * Cache keyed by the Zod schema instance. Schemas are immutable at\n * runtime; the same reference recurs across every CRUD call.\n */\nconst embeddingFieldsCache = new WeakMap<\n  z.ZodType,\n  readonly EmbeddingFieldInfo[]\n>();\n\n/**\n * Extracts embedding field information from a Zod schema.\n * Returns all embedding fields found at the top level of an object schema.\n *\n * Thin per-schema-instance memoization over the canonical\n * {@link resolveEmbeddingFields}; the same schema reference recurs across\n * every CRUD call, so caching avoids re-walking the shape each time.\n */\nexport function getEmbeddingFields(\n  schema: z.ZodType,\n): readonly EmbeddingFieldInfo[] {\n  const cached = embeddingFieldsCache.get(schema);\n  if (cached) return cached;\n  const fields = resolveEmbeddingFields(schema);\n  embeddingFieldsCache.set(schema, fields);\n  return fields;\n}\n\n// ============================================================\n// Embedding Sync Operations\n// ============================================================\n\n/**\n * Syncs embeddings after a node create or update operation.\n *\n * For each embedding field in the schema:\n * - If the props contain an embedding value, upsert it to the embeddings table\n * - If the props don't contain an embedding value (undefined), delete any existing embedding\n */\nexport async function syncEmbeddings(\n  ctx: EmbeddingSyncContext,\n  schema: z.ZodType,\n  props: Record<string, unknown>,\n): Promise<void> {\n  const { backend } = ctx;\n\n  // Check if backend supports embedding operations\n  if (!backend.upsertEmbedding || !backend.deleteEmbedding) {\n    return;\n  }\n\n  const embeddingFields = getEmbeddingFields(schema);\n  if (embeddingFields.length === 0) {\n    return;\n  }\n\n  for (const field of embeddingFields) {\n    const value = props[field.fieldPath];\n\n    if (isValidEmbeddingValue(value)) {\n      // Upsert the embedding\n      await backend.upsertEmbedding({\n        graphId: ctx.graphId,\n        nodeKind: ctx.nodeKind,\n        nodeId: ctx.nodeId,\n        fieldPath: field.fieldPath,\n        embedding: value,\n        dimensions: field.dimensions,\n        metric: field.metric,\n        indexType: field.indexType,\n      });\n    } else if (value === undefined) {\n      // Delete any existing embedding for this field\n      await backend.deleteEmbedding({\n        graphId: ctx.graphId,\n        nodeKind: ctx.nodeKind,\n        nodeId: ctx.nodeId,\n        fieldPath: field.fieldPath,\n        dimensions: field.dimensions,\n        metric: field.metric,\n        indexType: field.indexType,\n      });\n    }\n    // If value is null or invalid, skip (validation should have caught this)\n  }\n}\n\n/**\n * Deletes a node's embeddings for the embedding fields its kind CURRENTLY\n * declares. A field dropped from the schema after the node was written is\n * intentionally NOT swept here — its entire per-field table is reclaimed\n * wholesale by `store.materializeRemovals()` (the deferred-cleanup verb), which\n * also covers live (never-deleted) nodes' rows. So a hard/soft delete can leave\n * a transient orphan row in a removed field's table until the next reclaim pass;\n * that is the deferred-cleanup design, not a leak.\n */\nexport async function deleteNodeEmbeddings(\n  ctx: EmbeddingSyncContext,\n  schema: z.ZodType,\n): Promise<void> {\n  const { backend } = ctx;\n\n  // Check if backend supports embedding operations\n  if (!backend.deleteEmbedding) {\n    return;\n  }\n\n  const embeddingFields = getEmbeddingFields(schema);\n  if (embeddingFields.length === 0) {\n    return;\n  }\n\n  for (const field of embeddingFields) {\n    await backend.deleteEmbedding({\n      graphId: ctx.graphId,\n      nodeKind: ctx.nodeKind,\n      nodeId: ctx.nodeId,\n      fieldPath: field.fieldPath,\n      dimensions: field.dimensions,\n      metric: field.metric,\n      indexType: field.indexType,\n    });\n  }\n}\n\n// ============================================================\n// Validation Helpers\n// ============================================================\n\n/**\n * Checks if a value is a valid embedding (array of numbers).\n */\nfunction isValidEmbeddingValue(value: unknown): value is readonly number[] {\n  if (!Array.isArray(value)) {\n    return false;\n  }\n  return value.every((n) => typeof n === \"number\" && Number.isFinite(n));\n}\n","/**\n * Store-level search helpers.\n *\n * `fulltextSearch` is a thin typed wrapper over `backend.fulltextSearch`.\n * `hybridSearch` runs a vector and a fulltext query in parallel and\n * fuses the two ranked lists with Reciprocal Rank Fusion. RRF is\n * rank-based, so it papers over score-scale differences between\n * pgvector/sqlite-vec (distance-derived) and tsvector/FTS5 (BM25-style).\n */\nimport {\n  type FulltextCapabilities,\n  type FulltextQueryMode,\n  type GraphBackend,\n  type VectorIndexType,\n  type VectorMetric,\n} from \"../backend/types\";\nimport { ConfigurationError } from \"../errors\";\nimport {\n  DEFAULT_RRF_K,\n  DEFAULT_RRF_WEIGHT,\n  type HybridFusionOptions,\n} from \"../query/ast\";\nimport { validateHybridFusionOptions } from \"../query/builder/validation\";\nimport { type FulltextStrategy } from \"../query/dialect/fulltext-strategy\";\nimport { assertVectorMinScore } from \"../query/dialect/vector-strategy\";\nimport { type KindRegistry } from \"../registry/kind-registry\";\nimport { getEmbeddingFields } from \"./embedding-sync\";\nimport { rowToNode } from \"./row-mappers\";\nimport { type Node } from \"./types\";\n\n/**\n * A fulltext search hit. `N` defaults to the generic `Node`; the\n * `store.search.fulltext<K>(kind)` facade narrows it to the concrete\n * typed node for that kind so callers get `hit.node.title` without a cast.\n */\nexport type FulltextSearchHit<N = Node> = Readonly<{\n  node: N;\n  /** Backend-native relevance score; higher is better. */\n  score: number;\n  /** 1-based rank within the result set. */\n  rank: number;\n  /** Highlighted snippet (only present when `includeSnippets: true`). */\n  snippet?: string;\n}>;\n\nexport type VectorSearchHit<N = Node> = Readonly<{\n  node: N;\n  score: number;\n  rank: number;\n}>;\n\n/**\n * A hybrid search hit. Both sub-results (`vector`, `fulltext`) carry the\n * same narrowed node type as the top-level `node` for ergonomic access.\n */\nexport type HybridSearchHit<N = Node> = Readonly<{\n  node: N;\n  /** Fused RRF score (higher is better). */\n  score: number;\n  /** 1-based rank in the fused list. */\n  rank: number;\n  /** Sub-result from the vector half, if it ranked this node. */\n  vector?: VectorSearchHit<N>;\n  /** Sub-result from the fulltext half, if it ranked this node. */\n  fulltext?: FulltextSearchHit<N>;\n}>;\n\nexport type FulltextSearchOptions = Readonly<{\n  /** The user-supplied query string. */\n  query: string;\n  /** Max results. Required. */\n  limit: number;\n  /** Query parser mode. Default: \"websearch\". */\n  mode?: FulltextQueryMode;\n  /**\n   * Language override for query parsing. Default: per-row language as\n   * stored at insert time.\n   */\n  language?: string;\n  /** Minimum relevance score to include in results. */\n  minScore?: number;\n  /** Return a highlighted snippet alongside each hit. */\n  includeSnippets?: boolean;\n}>;\n\nexport type HybridVectorOptions = Readonly<{\n  /** Field path of the embedding column on the node kind. */\n  fieldPath: string;\n  /** Query embedding to compare against. */\n  queryEmbedding: readonly number[];\n  /** Distance metric. Default: \"cosine\". */\n  metric?: VectorMetric;\n  /** How many candidates to retrieve from the vector side. Default: 4 * limit. */\n  k?: number;\n  /** Minimum similarity to include (units depend on metric). */\n  minScore?: number;\n  /**\n   * HNSW search frontier for this query (pgvector `hnsw.ef_search`).\n   * The vector side over-fetches `k` (default `4 * limit`) candidates;\n   * `efSearch` must be `>= k` for the index to surface that many\n   * neighbors, and ~2–4× `k` is the high-recall target. Postgres HNSW\n   * only — no-op elsewhere. See `VectorSearchOptions.efSearch`.\n   */\n  efSearch?: number;\n}>;\n\n/**\n * Options for the standalone `store.search.vector` path. Mirrors the\n * vector half of `HybridSearchOptions` but flattens it because the\n * standalone path doesn't fuse against fulltext.\n */\nexport type VectorSearchOptions = Readonly<{\n  /** Field path of the embedding column on the node kind. */\n  fieldPath: string;\n  /** Query embedding to compare against. */\n  queryEmbedding: readonly number[];\n  /** Max results. Required. */\n  limit: number;\n  /** Distance metric. Default: \"cosine\". */\n  metric?: VectorMetric;\n  /** Minimum similarity to include (units depend on metric). */\n  minScore?: number;\n  /**\n   * HNSW search frontier for this query (pgvector `hnsw.ef_search`).\n   * Sizes the dynamic candidate list the index scan maintains — higher\n   * trades latency for recall. The floor for the index to surface\n   * `limit` neighbors is `efSearch >= limit`; ~2–4× is the high-recall\n   * target on million-scale corpora. Lets a latency-sensitive\n   * interactive path and a recall-sensitive batch path share one\n   * connection pool, tuning per query rather than per session.\n   *\n   * Postgres HNSW only: applied transaction-locally via `SET LOCAL`.\n   * sqlite-vec has no equivalent frontier knob and ignores it; Postgres\n   * backends without transactions (`drizzle-orm/neon-http`) ignore it\n   * with a one-time warning. Must be a positive integer; pgvector caps\n   * it at 1000.\n   */\n  efSearch?: number;\n}>;\n\nexport type HybridFulltextOptions = Readonly<{\n  query: string;\n  /** How many candidates to retrieve from the fulltext side. Default: 4 * limit. */\n  k?: number;\n  mode?: FulltextQueryMode;\n  language?: string;\n  minScore?: number;\n  includeSnippets?: boolean;\n}>;\n\nexport type HybridSearchOptions = Readonly<{\n  vector: HybridVectorOptions;\n  fulltext: HybridFulltextOptions;\n  fusion?: HybridFusionOptions;\n  /** Final number of fused results to return. Required. */\n  limit: number;\n}>;\n\ntype StoreSearchContext = Readonly<{\n  graphId: string;\n  backend: GraphBackend;\n  registry: KindRegistry;\n}>;\n\n/**\n * Resolved storage identity of one embedding field on a concrete node\n * kind — the `(dimensions, metric, indexType)` the backend needs (in\n * addition to the runtime `metric` override) to address the field's\n * typed per-`(kind, field)` storage slot during search.\n */\ntype ResolvedSearchSlot = Readonly<{\n  dimensions: number;\n  metric: VectorMetric;\n  indexType: VectorIndexType;\n}>;\n\n/**\n * Resolves the `(dimensions, metric, indexType)` for a node kind's\n * embedding field from the registered node schema's `embedding()`\n * declaration. Throws a `ConfigurationError` when the kind has no such\n * embedding field so the caller gets a clear boundary error instead of a\n * downstream missing-table failure.\n */\nfunction resolveSearchSlot(\n  ctx: StoreSearchContext,\n  nodeKind: string,\n  fieldPath: string,\n): ResolvedSearchSlot {\n  const nodeType = ctx.registry.getNodeType(nodeKind);\n  if (nodeType !== undefined) {\n    const fields = getEmbeddingFields(nodeType.schema);\n    const field = fields.find((entry) => entry.fieldPath === fieldPath);\n    if (field !== undefined) {\n      return {\n        dimensions: field.dimensions,\n        metric: field.metric,\n        indexType: field.indexType,\n      };\n    }\n  }\n  throw new ConfigurationError(\n    `Node kind \"${nodeKind}\" has no embedding field \"${fieldPath}\". ` +\n      `Declare it with embedding(dimensions) on the node schema.`,\n    { capability: \"vector\", graphId: ctx.graphId },\n  );\n}\n\nexport async function executeFulltextSearch<N = Node>(\n  ctx: StoreSearchContext,\n  nodeKind: string,\n  options: FulltextSearchOptions,\n): Promise<readonly FulltextSearchHit<N>[]> {\n  const { backend, graphId } = ctx;\n  if (!backend.fulltextSearch) {\n    throw new ConfigurationError(\"Backend does not support fulltext search\", {\n      backend: backend.dialect,\n      capability: \"fulltext\",\n    });\n  }\n  if (!Number.isInteger(options.limit) || options.limit <= 0) {\n    throw new RangeError(\n      `fulltextSearch.limit must be a positive integer, got: ${options.limit}`,\n    );\n  }\n  validateFulltextCallOptions(backend, {\n    mode: options.mode,\n    includeSnippets: options.includeSnippets,\n    language: options.language,\n  });\n\n  const params: Parameters<NonNullable<GraphBackend[\"fulltextSearch\"]>>[0] = {\n    graphId,\n    nodeKind,\n    query: options.query,\n    limit: options.limit,\n    ...(options.mode ? { mode: options.mode } : {}),\n    ...(options.language ? { language: options.language } : {}),\n    ...(options.minScore === undefined ? {} : { minScore: options.minScore }),\n    ...(options.includeSnippets === undefined ?\n      {}\n    : { includeSnippets: options.includeSnippets }),\n  };\n\n  const rows = await backend.fulltextSearch(params);\n  if (rows.length === 0) return [];\n\n  const ids = rows.map((row) => row.nodeId);\n  const nodeMap = await fetchNodesByIds(backend, graphId, nodeKind, ids);\n\n  const hits: FulltextSearchHit<N>[] = [];\n  let rank = 1;\n  for (const row of rows) {\n    const node = nodeMap.get(row.nodeId);\n    if (!node) continue;\n    hits.push({\n      node: node as N,\n      score: row.score,\n      rank,\n      ...(row.snippet === undefined ? {} : { snippet: row.snippet }),\n    });\n    rank += 1;\n  }\n  return hits;\n}\n\nexport async function executeVectorSearch<N = Node>(\n  ctx: StoreSearchContext,\n  nodeKind: string,\n  options: VectorSearchOptions,\n): Promise<readonly VectorSearchHit<N>[]> {\n  const { backend, graphId } = ctx;\n  if (!backend.vectorSearch) {\n    throw new ConfigurationError(\"Backend does not support vector search\", {\n      backend: backend.dialect,\n      capability: \"vector\",\n    });\n  }\n  if (!Number.isInteger(options.limit) || options.limit <= 0) {\n    throw new RangeError(\n      `vectorSearch.limit must be a positive integer, got: ${options.limit}`,\n    );\n  }\n  assertEfSearch(options.efSearch, \"vectorSearch.efSearch\");\n\n  const slot = resolveSearchSlot(ctx, nodeKind, options.fieldPath);\n  assertVectorQueryCompatible(\n    backend,\n    slot,\n    { metric: options.metric, queryEmbedding: options.queryEmbedding },\n    \"vectorSearch\",\n  );\n  assertMinScore(\n    options.minScore,\n    options.metric ?? slot.metric,\n    \"vectorSearch.minScore\",\n  );\n  const rows = await backend.vectorSearch({\n    graphId,\n    nodeKind,\n    fieldPath: options.fieldPath,\n    queryEmbedding: options.queryEmbedding,\n    // Default to the field's DECLARED metric (the metric its index was built\n    // for); only an explicit caller override changes it. Defaulting to cosine\n    // here would mis-rank l2 / inner_product fields and bypass their ANN index.\n    metric: options.metric ?? slot.metric,\n    dimensions: slot.dimensions,\n    indexType: slot.indexType,\n    limit: options.limit,\n    ...(options.minScore === undefined ? {} : { minScore: options.minScore }),\n    ...(options.efSearch === undefined ? {} : { efSearch: options.efSearch }),\n  });\n  if (rows.length === 0) return [];\n\n  const ids = rows.map((row) => row.nodeId);\n  const nodeMap = await fetchNodesByIds(backend, graphId, nodeKind, ids);\n\n  const hits: VectorSearchHit<N>[] = [];\n  let rank = 1;\n  for (const row of rows) {\n    const node = nodeMap.get(row.nodeId);\n    if (!node) continue;\n    hits.push({ node: node as N, score: row.score, rank });\n    rank += 1;\n  }\n  return hits;\n}\n\nexport async function executeHybridSearch<N = Node>(\n  ctx: StoreSearchContext,\n  nodeKind: string,\n  options: HybridSearchOptions,\n): Promise<readonly HybridSearchHit<N>[]> {\n  const { backend, graphId } = ctx;\n  if (!backend.vectorSearch) {\n    throw new ConfigurationError(\"Backend does not support vector search\", {\n      backend: backend.dialect,\n      capability: \"vector\",\n    });\n  }\n  if (!backend.fulltextSearch) {\n    throw new ConfigurationError(\"Backend does not support fulltext search\", {\n      backend: backend.dialect,\n      capability: \"fulltext\",\n    });\n  }\n  if (!Number.isInteger(options.limit) || options.limit <= 0) {\n    throw new RangeError(\n      `hybridSearch.limit must be a positive integer, got: ${options.limit}`,\n    );\n  }\n\n  if (options.fusion !== undefined) {\n    validateHybridFusionOptions(options.fusion);\n  }\n  assertEfSearch(options.vector.efSearch, \"hybridSearch.vector.efSearch\");\n\n  validateFulltextCallOptions(backend, {\n    mode: options.fulltext.mode,\n    includeSnippets: options.fulltext.includeSnippets,\n    language: options.fulltext.language,\n  });\n\n  const fusionK = options.fusion?.k ?? DEFAULT_RRF_K;\n  const vectorWeight = options.fusion?.weights?.vector ?? DEFAULT_RRF_WEIGHT;\n  const fulltextWeight =\n    options.fusion?.weights?.fulltext ?? DEFAULT_RRF_WEIGHT;\n  const overFetchMultiplier = 4;\n  const vectorK = options.vector.k ?? options.limit * overFetchMultiplier;\n  const fulltextK = options.fulltext.k ?? options.limit * overFetchMultiplier;\n\n  const vectorSlot = resolveSearchSlot(ctx, nodeKind, options.vector.fieldPath);\n  assertVectorQueryCompatible(\n    backend,\n    vectorSlot,\n    {\n      metric: options.vector.metric,\n      queryEmbedding: options.vector.queryEmbedding,\n    },\n    \"hybridSearch.vector\",\n  );\n  assertMinScore(\n    options.vector.minScore,\n    options.vector.metric ?? vectorSlot.metric,\n    \"hybridSearch.vector.minScore\",\n  );\n  const vectorPromise = backend.vectorSearch({\n    graphId,\n    nodeKind,\n    fieldPath: options.vector.fieldPath,\n    queryEmbedding: options.vector.queryEmbedding,\n    // Default to the field's declared metric (see executeVectorSearch).\n    metric: options.vector.metric ?? vectorSlot.metric,\n    dimensions: vectorSlot.dimensions,\n    indexType: vectorSlot.indexType,\n    limit: vectorK,\n    ...(options.vector.minScore === undefined ?\n      {}\n    : { minScore: options.vector.minScore }),\n    ...(options.vector.efSearch === undefined ?\n      {}\n    : { efSearch: options.vector.efSearch }),\n  });\n\n  const fulltextPromise = backend.fulltextSearch({\n    graphId,\n    nodeKind,\n    query: options.fulltext.query,\n    limit: fulltextK,\n    ...(options.fulltext.mode ? { mode: options.fulltext.mode } : {}),\n    ...(options.fulltext.language ?\n      { language: options.fulltext.language }\n    : {}),\n    ...(options.fulltext.minScore === undefined ?\n      {}\n    : { minScore: options.fulltext.minScore }),\n    ...(options.fulltext.includeSnippets === undefined ?\n      {}\n    : { includeSnippets: options.fulltext.includeSnippets }),\n  });\n\n  const [vectorRows, fulltextRows] = await Promise.all([\n    vectorPromise,\n    fulltextPromise,\n  ]);\n\n  // RRF fusion. The classic formula is score = Σ_src 1 / (k + rank_src).\n  // Per-source weights extend it to a weighted sum.\n  interface FusedEntry {\n    nodeId: string;\n    fusedScore: number;\n    vectorRank?: number;\n    vectorScore?: number;\n    fulltextRank?: number;\n    fulltextScore?: number;\n    fulltextSnippet?: string;\n  }\n  const fused = new Map<string, FusedEntry>();\n\n  for (const [index, row] of vectorRows.entries()) {\n    const rank = index + 1;\n    const contribution = vectorWeight / (fusionK + rank);\n    const entry = fused.get(row.nodeId) ?? {\n      nodeId: row.nodeId,\n      fusedScore: 0,\n    };\n    entry.fusedScore += contribution;\n    entry.vectorRank = rank;\n    entry.vectorScore = row.score;\n    fused.set(row.nodeId, entry);\n  }\n\n  for (const [index, row] of fulltextRows.entries()) {\n    const rank = index + 1;\n    const contribution = fulltextWeight / (fusionK + rank);\n    const entry = fused.get(row.nodeId) ?? {\n      nodeId: row.nodeId,\n      fusedScore: 0,\n    };\n    entry.fusedScore += contribution;\n    entry.fulltextRank = rank;\n    entry.fulltextScore = row.score;\n    if (row.snippet !== undefined) {\n      entry.fulltextSnippet = row.snippet;\n    }\n    fused.set(row.nodeId, entry);\n  }\n\n  const ranked = [...fused.values()]\n    .toSorted(\n      (a, b) => b.fusedScore - a.fusedScore || a.nodeId.localeCompare(b.nodeId),\n    )\n    .slice(0, options.limit);\n\n  const ids = ranked.map((entry) => entry.nodeId);\n  const nodeMap = await fetchNodesByIds(backend, graphId, nodeKind, ids);\n\n  const hits: HybridSearchHit<N>[] = [];\n  let rank = 1;\n  for (const entry of ranked) {\n    const node = nodeMap.get(entry.nodeId);\n    if (!node) continue;\n    const typedNode = node as N;\n    const hit: HybridSearchHit<N> = {\n      node: typedNode,\n      score: entry.fusedScore,\n      rank,\n      ...(entry.vectorRank !== undefined && entry.vectorScore !== undefined ?\n        {\n          vector: {\n            node: typedNode,\n            score: entry.vectorScore,\n            rank: entry.vectorRank,\n          },\n        }\n      : {}),\n      ...((\n        entry.fulltextRank !== undefined && entry.fulltextScore !== undefined\n      ) ?\n        {\n          fulltext: {\n            node: typedNode,\n            score: entry.fulltextScore,\n            rank: entry.fulltextRank,\n            ...(entry.fulltextSnippet === undefined ?\n              {}\n            : { snippet: entry.fulltextSnippet }),\n          },\n        }\n      : {}),\n    };\n    hits.push(hit);\n    rank += 1;\n  }\n  return hits;\n}\n\n/**\n * Validates the optional `efSearch` knob at the API boundary. Rejects\n * non-positive-integer values uniformly across backends — the\n * backend-specific ceiling (pgvector caps `hnsw.ef_search` at 1000) is\n * enforced on the Postgres path, and backends without an HNSW frontier\n * knob treat a valid value as a no-op.\n */\nfunction assertEfSearch(efSearch: number | undefined, label: string): void {\n  if (efSearch === undefined) return;\n  if (!Number.isInteger(efSearch) || efSearch <= 0) {\n    throw new RangeError(\n      `${label} must be a positive integer, got: ${efSearch}`,\n    );\n  }\n}\n\n/**\n * Validates the optional `minScore` filter at the API boundary, mirroring the\n * query-compiler vector pass. Rejects non-finite values for any metric and,\n * for cosine (where the score is `1 - distance` similarity), values outside\n * [-1, 1]. Without this a `NaN` minScore compiles to `distance <= (1 - NaN)`,\n * which matches nothing — a silent empty result instead of a clear error.\n */\nfunction assertMinScore(\n  minScore: number | undefined,\n  metric: VectorMetric,\n  label: string,\n): void {\n  if (minScore === undefined) return;\n  assertVectorMinScore(minScore, metric, label);\n}\n\n/**\n * Validates a vector search/hybrid call against the field's resolved slot:\n * an explicit `metric` override must match the field's declared metric (its\n * storage / ANN index is built for that metric), the declared metric must be\n * one the backend supports, and the query vector's length must match the\n * field's dimension. Rejects at the API boundary instead of surfacing an\n * opaque engine error from deep in `buildSearch`.\n */\nfunction assertVectorQueryCompatible(\n  backend: GraphBackend,\n  slot: ResolvedSearchSlot,\n  options: {\n    metric: VectorMetric | undefined;\n    queryEmbedding: readonly number[];\n  },\n  label: string,\n): void {\n  if (options.metric !== undefined && options.metric !== slot.metric) {\n    throw new ConfigurationError(\n      `${label}: metric \"${options.metric}\" does not match the field's declared metric \"${slot.metric}\". Vector storage is built for the declared metric — omit metric or pass \"${slot.metric}\".`,\n      { backend: backend.dialect, capability: \"vector\" },\n    );\n  }\n  const supported = backend.capabilities.vector?.metrics;\n  if (supported !== undefined && !supported.includes(slot.metric)) {\n    throw new ConfigurationError(\n      `${label}: backend \"${backend.dialect}\" does not support the \"${slot.metric}\" metric (supported: ${supported.join(\", \")}).`,\n      { backend: backend.dialect, capability: \"vector\" },\n    );\n  }\n  if (options.queryEmbedding.length !== slot.dimensions) {\n    throw new RangeError(\n      `${label}: queryEmbedding has ${options.queryEmbedding.length} dimensions, but \"${slot.dimensions}\" are declared for this field.`,\n    );\n  }\n}\n\ntype FulltextCallOptions = Readonly<{\n  mode: FulltextQueryMode | undefined;\n  includeSnippets: boolean | undefined;\n  language: string | undefined;\n}>;\n\n/**\n * Validates caller-supplied fulltext options against the active\n * `FulltextStrategy` (when present) or the declared `FulltextCapabilities`\n * projection (as a fallback). Strategy validation is authoritative:\n * `supportedModes` and `supportsLanguageOverride` reject options that the\n * capabilities projection would silently ignore (e.g. a `language`\n * override on the SQLite FTS5 strategy, whose tokenizer is fixed at\n * table-create time). Mode, snippets, and language are the fields\n * callers commonly get wrong; catching them here turns a downstream SQL\n * error — or worse, silent misbehavior — into a clear\n * `ConfigurationError` at the API boundary.\n */\nfunction validateFulltextCallOptions(\n  backend: GraphBackend,\n  options: FulltextCallOptions,\n): void {\n  const strategy = backend.fulltextStrategy;\n  const capabilities = backend.capabilities.fulltext;\n\n  if (options.mode !== undefined) {\n    validateFulltextMode(backend, strategy, capabilities, options.mode);\n  }\n  if (options.includeSnippets === true) {\n    validateFulltextSnippets(backend, strategy, capabilities);\n  }\n  if (options.language !== undefined) {\n    validateFulltextLanguageOption(\n      backend,\n      strategy,\n      capabilities,\n      options.language,\n    );\n  }\n}\n\nfunction validateFulltextMode(\n  backend: GraphBackend,\n  strategy: FulltextStrategy | undefined,\n  capabilities: FulltextCapabilities | undefined,\n  mode: FulltextQueryMode,\n): void {\n  if (strategy !== undefined) {\n    if (strategy.supportedModes.includes(mode)) return;\n    throw new ConfigurationError(\n      `Backend \"${backend.dialect}\" fulltext strategy \"${strategy.name}\" ` +\n        `does not support mode \"${mode}\". Supported modes: ${strategy.supportedModes.join(\", \")}`,\n      {\n        backend: backend.dialect,\n        strategy: strategy.name,\n        capability: `fulltext.modes.${mode}`,\n      },\n    );\n  }\n  if (mode === \"phrase\" && capabilities && !capabilities.phraseQueries) {\n    throw new ConfigurationError(\n      `Backend \"${backend.dialect}\" does not support phrase queries`,\n      { backend: backend.dialect, capability: \"fulltext.phraseQueries\" },\n    );\n  }\n}\n\nfunction validateFulltextSnippets(\n  backend: GraphBackend,\n  strategy: FulltextStrategy | undefined,\n  capabilities: FulltextCapabilities | undefined,\n): void {\n  const supportsSnippets =\n    strategy === undefined ?\n      capabilities?.highlighting !== false\n    : strategy.supportsSnippets;\n  if (supportsSnippets) return;\n  throw new ConfigurationError(\n    `Backend \"${backend.dialect}\" does not support snippet highlighting; ` +\n      `drop includeSnippets or switch to a backend where highlighting is supported`,\n    { backend: backend.dialect, capability: \"fulltext.highlighting\" },\n  );\n}\n\nfunction validateFulltextLanguageOption(\n  backend: GraphBackend,\n  strategy: FulltextStrategy | undefined,\n  capabilities: FulltextCapabilities | undefined,\n  language: string,\n): void {\n  if (strategy !== undefined && !strategy.supportsLanguageOverride) {\n    throw new ConfigurationError(\n      `Backend \"${backend.dialect}\" fulltext strategy \"${strategy.name}\" ` +\n        `does not honor a per-query \\`language\\` override ` +\n        `(its tokenizer is fixed at table-create time). ` +\n        `Drop the option, or pick a strategy that advertises \\`supportsLanguageOverride: true\\`.`,\n      {\n        backend: backend.dialect,\n        strategy: strategy.name,\n        capability: \"fulltext.languageOverride\",\n      },\n    );\n  }\n  if (capabilities !== undefined) {\n    warnIfLanguageNotAdvertised(backend.dialect, capabilities, language);\n  }\n}\n\n/**\n * Advisory language check — warn, don't throw. Postgres accepts any\n * installed regconfig at runtime, so a strict list would produce false\n * positives for extension-provided dictionaries.\n */\nfunction warnIfLanguageNotAdvertised(\n  dialect: string,\n  capabilities: FulltextCapabilities,\n  language: string,\n): void {\n  if (capabilities.languages.length === 0) return;\n  if (capabilities.languages.includes(language)) return;\n  if (typeof console === \"undefined\" || typeof console.warn !== \"function\") {\n    return;\n  }\n  console.warn(\n    `[typegraph] fulltext language \"${language}\" is not in the advertised list ` +\n      `for dialect \"${dialect}\" (${capabilities.languages.join(\", \")}). ` +\n      `If your backend has this language installed this warning is safe to ignore.`,\n  );\n}\n\nasync function fetchNodesByIds(\n  backend: GraphBackend,\n  graphId: string,\n  nodeKind: string,\n  ids: readonly string[],\n): Promise<Map<string, Node>> {\n  if (ids.length === 0) return new Map();\n  const map = new Map<string, Node>();\n  if (backend.getNodes) {\n    const rows = await backend.getNodes(graphId, nodeKind, ids);\n    for (const row of rows) {\n      // `getNodes` returns rows regardless of deleted_at. If the fulltext\n      // or embedding index has drifted (a stale row for a soft-deleted\n      // node), skip it here so search never resurrects tombstones.\n      if (row.deleted_at !== undefined) continue;\n      map.set(row.id, rowToNode(row));\n    }\n    return map;\n  }\n  // Fallback: fetch one at a time. Slow, but only triggers on backends\n  // that haven't implemented the batched accessor.\n  for (const id of ids) {\n    const row = await backend.getNode(graphId, nodeKind, id);\n    if (row && row.deleted_at === undefined) map.set(row.id, rowToNode(row));\n  }\n  return map;\n}\n\nexport { type HybridFusionOptions } from \"../query/ast\";\n","/**\n * StoreSearch — store.search facade.\n *\n * Groups fulltext, vector, hybrid, and maintenance operations under one\n * namespace so the top-level Store API stays focused on CRUD + graph\n * traversal. The methods delegate to their respective execution\n * modules; this class exists to shape the surface and to gate kind\n * names through the registry — the kind argument is `string` so\n * graph-extension kinds (added via `store.evolve()`) work without a\n * type cast, with a runtime guard rejecting misspellings at the call\n * site.\n */\nimport { type GraphBackend } from \"../backend/types\";\nimport { type GraphDef, type NodeKinds } from \"../core/define-graph\";\nimport { type NodeRegistration, type NodeType } from \"../core/types\";\nimport { KindNotFoundError } from \"../errors\";\nimport { type KindRegistry } from \"../registry/kind-registry\";\nimport {\n  rebuildFulltextIndex,\n  type RebuildFulltextOptions,\n  type RebuildFulltextResult,\n} from \"./fulltext-rebuild\";\nimport {\n  executeFulltextSearch,\n  executeHybridSearch,\n  executeVectorSearch,\n  type FulltextSearchHit,\n  type FulltextSearchOptions,\n  type HybridSearchHit,\n  type HybridSearchOptions,\n  type VectorSearchHit,\n  type VectorSearchOptions,\n} from \"./search\";\nimport { type Node } from \"./types\";\n\n/**\n * Resolves the hit's `node` type. Compile-time kinds keep their\n * narrowed `Node<N>`; kinds outside `G` (added via graph extension through\n * `store.evolve()`, or string variables the type system can't see)\n * widen to the base `Node` so callers don't need a cast.\n *\n * This is the same shape as `getNodeCollection` — the dynamic form\n * works for any registered kind, and the type narrows when (and only\n * when) the literal is statically known.\n */\ntype ResolveNode<G extends GraphDef, K extends string> =\n  K extends NodeKinds<G> ?\n    G[\"nodes\"][K] extends NodeRegistration<infer N extends NodeType> ?\n      Node<N>\n    : Node\n  : Node;\n\ntype StoreSearchContext = Readonly<{\n  graphId: string;\n  backend: GraphBackend;\n  registry: KindRegistry;\n}>;\n\n/**\n * Search-related operations exposed via `store.search`.\n *\n * @example\n * ```typescript\n * // Fulltext only\n * const hits = await store.search.fulltext(\"Document\", {\n *   query: \"climate change\",\n *   limit: 10,\n *   includeSnippets: true,\n * });\n *\n * // Vector only — for extension kinds with embedding() modifiers,\n * // the auto-derived index serves this query.\n * const nearest = await store.search.vector(\"Document\", {\n *   fieldPath: \"embedding\",\n *   queryEmbedding: vec,\n *   limit: 10,\n * });\n *\n * // Hybrid: vector + fulltext, fused with RRF\n * const ranked = await store.search.hybrid(\"Document\", {\n *   limit: 10,\n *   vector: { fieldPath: \"embedding\", queryEmbedding: vec },\n *   fulltext: { query: \"climate change\" },\n * });\n *\n * // Rebuild after backfill / schema change\n * const stats = await store.search.rebuildFulltext();\n * ```\n *\n * Extension kinds added via `store.evolve(...)` work with all four\n * methods without a type cast — the kind argument is `string` and a\n * registry check rejects misspellings at the call site.\n */\nexport class StoreSearch<G extends GraphDef> {\n  readonly #context: StoreSearchContext;\n\n  constructor(context: StoreSearchContext) {\n    this.#context = context;\n  }\n\n  /**\n   * Runs a fulltext search against nodes of the given kind.\n   *\n   * Requires fields on the node schema declared with `searchable()`.\n   * The search hits the backend's fulltext index (tsvector + GIN on\n   * Postgres, FTS5 on SQLite — or whatever strategy the backend is\n   * configured with) and resolves the matching node IDs back to typed\n   * `Node` objects.\n   */\n  async fulltext<K extends string>(\n    nodeKind: K,\n    options: FulltextSearchOptions,\n  ): Promise<readonly FulltextSearchHit<ResolveNode<G, K>>[]> {\n    this.#assertKindRegistered(nodeKind);\n    return executeFulltextSearch<ResolveNode<G, K>>(\n      {\n        graphId: this.#context.graphId,\n        backend: this.#context.backend,\n        registry: this.#context.registry,\n      },\n      nodeKind,\n      options,\n    );\n  }\n\n  /**\n   * Runs a vector similarity search against nodes of the given kind.\n   *\n   * Requires a field on the node schema declared with `embedding()`,\n   * either at compile time or via a graph extension (the auto-derived\n   * `VectorIndexDeclaration` flows through `materializeIndexes()` on\n   * the same path either way).\n   *\n   * Pure vector — no fulltext leg, no fusion. For combined\n   * vector+fulltext ranking, use `hybrid`.\n   */\n  async vector<K extends string>(\n    nodeKind: K,\n    options: VectorSearchOptions,\n  ): Promise<readonly VectorSearchHit<ResolveNode<G, K>>[]> {\n    this.#assertKindRegistered(nodeKind);\n    return executeVectorSearch<ResolveNode<G, K>>(\n      {\n        graphId: this.#context.graphId,\n        backend: this.#context.backend,\n        registry: this.#context.registry,\n      },\n      nodeKind,\n      options,\n    );\n  }\n\n  /**\n   * Runs a vector + fulltext hybrid search and fuses the results with\n   * Reciprocal Rank Fusion.\n   *\n   * RRF is rank-based, so it composes well across heterogeneous score\n   * scales (cosine similarity vs ts_rank_cd vs FTS5 BM25). Default\n   * over-fetch is 4× `limit` from each source — tune via `vector.k` /\n   * `fulltext.k` for higher-recall corpora.\n   */\n  async hybrid<K extends string>(\n    nodeKind: K,\n    options: HybridSearchOptions,\n  ): Promise<readonly HybridSearchHit<ResolveNode<G, K>>[]> {\n    this.#assertKindRegistered(nodeKind);\n    return executeHybridSearch<ResolveNode<G, K>>(\n      {\n        graphId: this.#context.graphId,\n        backend: this.#context.backend,\n        registry: this.#context.registry,\n      },\n      nodeKind,\n      options,\n    );\n  }\n\n  /**\n   * Rebuilds the fulltext index from existing node data.\n   *\n   * Use when:\n   * - A node kind gained a `searchable()` field after data was already\n   *   written and existing rows were never indexed.\n   * - The fulltext table was dropped / truncated.\n   * - `language` was changed on a `searchable()` field.\n   *\n   * Iterates nodes with keyset pagination (stable under shared\n   * timestamps and light concurrent writes), transacts per page, skips\n   * kinds with no searchable fields, and cleans up stale rows for\n   * soft-deleted nodes. Corrupt or non-object `props` are counted in\n   * `skipped` with their node IDs surfaced via `skippedIds` so operators\n   * can investigate. Concurrent hard-deletes between page fetches can\n   * be missed by a single pass — run during a maintenance window for\n   * full consistency.\n   */\n  async rebuildFulltext<K extends string>(\n    nodeKind?: K,\n    options: RebuildFulltextOptions = {},\n  ): Promise<RebuildFulltextResult> {\n    if (nodeKind !== undefined) this.#assertKindRegistered(nodeKind);\n    return rebuildFulltextIndex(\n      {\n        graphId: this.#context.graphId,\n        backend: this.#context.backend,\n        registry: this.#context.registry,\n      },\n      nodeKind,\n      options,\n    );\n  }\n\n  #assertKindRegistered(kind: string): void {\n    if (this.#context.registry.hasNodeType(kind)) return;\n    throw new KindNotFoundError(kind, \"node\", {\n      graphId: this.#context.graphId,\n      suggestion:\n        \"Compile-time kinds come from defineGraph; extension kinds appear after store.evolve() returns. Check store.introspect() for the registered set.\",\n    });\n  }\n}\n","/**\n * Per-delta classification for `evolve()` modify-existing-kind support.\n *\n * Distinguishes additive / loosening changes (allowed without data\n * inspection) from tightening changes that require an empty-kind\n * probe, from genuinely incompatible changes that always reject.\n *\n * Pure function — no I/O. The caller (`store.evolve`) takes the\n * `requireEmpty` candidate list and runs the existence probes before\n * committing.\n */\nimport type { KindEntity } from \"../core/types\";\nimport { canonicalEqual } from \"../schema/canonical\";\nimport { type IncompatibleChange, IncompatibleChangeError } from \"./errors\";\nimport {\n  type ExtensionArrayProperty,\n  type ExtensionEdgeDef,\n  type ExtensionEnumProperty,\n  type ExtensionNodeDef,\n  type ExtensionNumberProperty,\n  type ExtensionObjectProperty,\n  type ExtensionPropertyType,\n  type ExtensionStringProperty,\n  type ExtensionUniqueConstraint,\n  type GraphExtension,\n} from \"./extension-types\";\n\n/**\n * Result of classifying every delta between two graph-extension documents.\n *\n * `incompatible` collects rejections that the caller throws as a\n * single `IncompatibleChangeError`. `requireEmpty`\n * collects the names of kinds where at least one delta is\n * allowed-only-on-empty — the caller probes each kind's row count\n * and promotes the `requireEmpty` entries to `incompatible` when\n * the kind has rows.\n *\n * `entity` is tracked per-key so the probe dispatches to the right\n * backend primitive: `countNodesByKind` for `node`, `countEdgesByKind`\n * for `edge`. Without this, an edge-keyed `TIGHTEN_EDGE_ENDPOINTS`\n * delta would silently slip past the empty-kind gate (the node-\n * keyed count would always be 0 for an edge name).\n */\ntype ModificationClassification = Readonly<{\n  /** Deltas that always reject. */\n  incompatible: readonly IncompatibleChange[];\n  /**\n   * Deltas allowed only when the kind has zero rows. One entry per\n   * `(entity, kindName)`; each carries the per-delta detail to promote\n   * to `incompatible` if the empty-probe shows rows. Caller looks up\n   * by entry identity (frozen reference) — no string-key encoding.\n   */\n  requireEmpty: readonly RequireEmptyEntry[];\n}>;\n\nexport type RequireEmptyEntry = Readonly<{\n  entity: KindEntity;\n  kindName: string;\n  changes: readonly IncompatibleChange[];\n}>;\n\n/**\n * Classifies every delta between an existing and proposed graph-extension\n * document. Same-shape kinds produce no entries; new-kind additions\n * produce no entries (handled by the union spread upstream).\n *\n * The classification covers nodes and edges in scope; ontology and\n * indexes pass through unchanged because v1 evolve doesn't modify\n * them in-place (consumers add new ontology relations, runtime\n * indexes follow auto-derive on the underlying nodes).\n */\nexport function classifyModifications(\n  existing: GraphExtension,\n  next: GraphExtension,\n): ModificationClassification {\n  const incompatible: IncompatibleChange[] = [];\n  // Aggregate by (entity, kindName) using a temporary string-keyed Map\n  // — the encoding is private to this function. The Map's values are\n  // returned as a plain array; the caller never sees the key.\n  const requireEmptyMutable = new Map<\n    string,\n    { entity: KindEntity; kindName: string; changes: IncompatibleChange[] }\n  >();\n\n  const recordIncompatible = (entry: IncompatibleChange): void => {\n    incompatible.push(entry);\n  };\n  const recordRequireEmpty = (\n    entity: KindEntity,\n    entry: IncompatibleChange,\n  ): void => {\n    const key = `${entity}:${entry.kind}`;\n    const existingEntry = requireEmptyMutable.get(key);\n    if (existingEntry === undefined) {\n      requireEmptyMutable.set(key, {\n        entity,\n        kindName: entry.kind,\n        changes: [entry],\n      });\n    } else {\n      existingEntry.changes.push(entry);\n    }\n  };\n\n  for (const [name, nextNode] of Object.entries(next.nodes ?? {})) {\n    const existingNode = existing.nodes?.[name];\n    if (existingNode === undefined) continue;\n    classifyNode(name, existingNode, nextNode, {\n      recordIncompatible,\n      recordRequireEmpty: (entry) => {\n        recordRequireEmpty(\"node\", entry);\n      },\n    });\n  }\n  for (const [name, nextEdge] of Object.entries(next.edges ?? {})) {\n    const existingEdge = existing.edges?.[name];\n    if (existingEdge === undefined) continue;\n    classifyEdge(name, existingEdge, nextEdge, {\n      recordIncompatible,\n      recordRequireEmpty: (entry) => {\n        recordRequireEmpty(\"edge\", entry);\n      },\n    });\n  }\n\n  const requireEmpty: RequireEmptyEntry[] = [];\n  for (const value of requireEmptyMutable.values()) {\n    requireEmpty.push(\n      Object.freeze({\n        entity: value.entity,\n        kindName: value.kindName,\n        changes: Object.freeze([...value.changes]),\n      }),\n    );\n  }\n\n  return { incompatible, requireEmpty };\n}\n\n/**\n * Promotes the `requireEmpty` entries whose probe came back non-empty\n * to incompatible, returning a single `IncompatibleChangeError`\n * covering both the always-incompatible deltas and the promoted ones.\n * Returns `undefined` when nothing rejects (probe came back empty for\n * every entry and `incompatible` is empty).\n */\nexport function buildIncompatibleChangeError(\n  classification: ModificationClassification,\n  nonEmpty: ReadonlySet<RequireEmptyEntry>,\n  graphId: string,\n): IncompatibleChangeError | undefined {\n  const promoted: IncompatibleChange[] = [];\n  for (const entry of nonEmpty) {\n    promoted.push(...entry.changes);\n  }\n  const all = [...classification.incompatible, ...promoted];\n  if (all.length === 0) return undefined;\n  return new IncompatibleChangeError(all, graphId);\n}\n\n// ============================================================\n// Node classification\n// ============================================================\n\ntype Recorders = Readonly<{\n  recordIncompatible: (entry: IncompatibleChange) => void;\n  recordRequireEmpty: (entry: IncompatibleChange) => void;\n}>;\n\nfunction classifyNode(\n  kind: string,\n  existing: ExtensionNodeDef,\n  next: ExtensionNodeDef,\n  recorders: Recorders,\n): void {\n  classifyProperties(kind, existing.properties, next.properties, recorders);\n  classifyUnique(kind, existing.unique ?? [], next.unique ?? [], recorders);\n  // description / annotations — always allowed (no semantic effect).\n}\n\nfunction classifyEdge(\n  kind: string,\n  existing: ExtensionEdgeDef,\n  next: ExtensionEdgeDef,\n  recorders: Recorders,\n): void {\n  classifyProperties(\n    kind,\n    existing.properties ?? {},\n    next.properties ?? {},\n    recorders,\n  );\n  classifyEdgeEndpoints(kind, existing, next, recorders);\n}\n\nfunction classifyEdgeEndpoints(\n  kind: string,\n  existing: ExtensionEdgeDef,\n  next: ExtensionEdgeDef,\n  recorders: Recorders,\n): void {\n  // Adding kinds to from/to is broadening — always allowed.\n  // Removing kinds with no existing edges of that endpoint would be\n  // allowed in the spec, but TypeGraph doesn't have a per-(edge,\n  // endpoint-kind) row probe today; v1 stays conservative by treating\n  // endpoint-kind removal as allowed-on-empty for the whole edge kind.\n  const fromExisting = new Set(existing.from);\n  const toExisting = new Set(existing.to);\n  const fromNext = new Set(next.from);\n  const toNext = new Set(next.to);\n\n  for (const removed of [...fromExisting].filter(\n    (entry) => !fromNext.has(entry),\n  )) {\n    recorders.recordRequireEmpty({\n      kind,\n      type: \"TIGHTEN_EDGE_ENDPOINTS\",\n      detail: `removed \"${removed}\" from \\`from\\``,\n    });\n  }\n  for (const removed of [...toExisting].filter((entry) => !toNext.has(entry))) {\n    recorders.recordRequireEmpty({\n      kind,\n      type: \"TIGHTEN_EDGE_ENDPOINTS\",\n      detail: `removed \"${removed}\" from \\`to\\``,\n    });\n  }\n}\n\n// ============================================================\n// Properties\n// ============================================================\n\nfunction classifyProperties(\n  kind: string,\n  existing: Readonly<Record<string, ExtensionPropertyType>>,\n  next: Readonly<Record<string, ExtensionPropertyType>>,\n  recorders: Recorders,\n): void {\n  const existingNames = new Set(Object.keys(existing));\n  const nextNames = new Set(Object.keys(next));\n\n  // Removed properties — REMOVE_PROPERTY (always reject).\n  for (const name of existingNames) {\n    if (!nextNames.has(name)) {\n      recorders.recordIncompatible({\n        kind,\n        field: name,\n        type: \"REMOVE_PROPERTY\",\n      });\n    }\n  }\n\n  // Added properties — ADD_OPTIONAL (allowed) or ADD_REQUIRED\n  // (allowed-on-empty).\n  for (const name of nextNames) {\n    if (!existingNames.has(name)) {\n      const property = next[name]!;\n      if (property.optional === true) continue;\n      recorders.recordRequireEmpty({\n        kind,\n        field: name,\n        type: \"ADD_REQUIRED_PROPERTY\",\n      });\n    }\n  }\n\n  // Modified properties — per-property classification.\n  for (const name of existingNames) {\n    if (!nextNames.has(name)) continue;\n    classifyProperty(kind, name, existing[name]!, next[name]!, recorders);\n  }\n}\n\nfunction classifyProperty(\n  kind: string,\n  field: string,\n  existing: ExtensionPropertyType,\n  next: ExtensionPropertyType,\n  recorders: Recorders,\n): void {\n  // Type change — always reject.\n  if (existing.type !== next.type) {\n    recorders.recordIncompatible({\n      kind,\n      field,\n      type: \"TYPE_CHANGE\",\n      detail: `${existing.type} → ${next.type}`,\n    });\n    return;\n  }\n\n  // Optionality.\n  const wasOptional = existing.optional === true;\n  const isOptional = next.optional === true;\n  if (!wasOptional && isOptional) {\n    // LOOSEN_OPTIONALITY — allowed.\n  } else if (wasOptional && !isOptional) {\n    recorders.recordRequireEmpty({\n      kind,\n      field,\n      type: \"TIGHTEN_OPTIONALITY\",\n      detail: \"optional: true → false\",\n    });\n  }\n\n  // Searchable / embedding modifiers — always allowed (the materializer\n  // backfills indexes via materializeIndexes; vector regen is on the\n  // consumer per the design doc).\n\n  // Per-type constraint deltas.\n  switch (existing.type) {\n    case \"string\": {\n      classifyString(\n        kind,\n        field,\n        existing,\n        next as ExtensionStringProperty,\n        recorders,\n      );\n      break;\n    }\n    case \"number\": {\n      classifyNumber(\n        kind,\n        field,\n        existing,\n        next as ExtensionNumberProperty,\n        recorders,\n      );\n      break;\n    }\n    case \"enum\": {\n      classifyEnum(\n        kind,\n        field,\n        existing,\n        next as ExtensionEnumProperty,\n        recorders,\n      );\n      break;\n    }\n    case \"array\": {\n      classifyArray(\n        kind,\n        field,\n        existing,\n        next as ExtensionArrayProperty,\n        recorders,\n      );\n      break;\n    }\n    case \"object\": {\n      classifyObject(\n        kind,\n        field,\n        existing,\n        next as ExtensionObjectProperty,\n        recorders,\n      );\n      break;\n    }\n    case \"boolean\": {\n      // No classifiable deltas beyond optionality, already handled.\n      break;\n    }\n  }\n}\n\nfunction classifyString(\n  kind: string,\n  field: string,\n  existing: ExtensionStringProperty,\n  next: ExtensionStringProperty,\n  recorders: Recorders,\n): void {\n  // Length bounds: tighten requires empty, loosen allowed.\n  if (\n    existing.minLength !== next.minLength &&\n    next.minLength !== undefined &&\n    (existing.minLength === undefined || next.minLength > existing.minLength)\n  ) {\n    recorders.recordRequireEmpty({\n      kind,\n      field,\n      type: \"TIGHTEN_CONSTRAINT\",\n      detail: `minLength: ${existing.minLength ?? \"(none)\"} → ${next.minLength}`,\n    });\n  }\n  if (\n    existing.maxLength !== next.maxLength &&\n    next.maxLength !== undefined &&\n    (existing.maxLength === undefined || next.maxLength < existing.maxLength)\n  ) {\n    recorders.recordRequireEmpty({\n      kind,\n      field,\n      type: \"TIGHTEN_CONSTRAINT\",\n      detail: `maxLength: ${existing.maxLength ?? \"(none)\"} → ${next.maxLength}`,\n    });\n  }\n  // Pattern.\n  if (existing.pattern !== next.pattern) {\n    if (existing.pattern === undefined && next.pattern !== undefined) {\n      recorders.recordRequireEmpty({\n        kind,\n        field,\n        type: \"ADD_PATTERN\",\n        detail: next.pattern,\n      });\n    } else if (existing.pattern !== undefined && next.pattern === undefined) {\n      // DROP_PATTERN — allowed.\n    } else if (\n      existing.pattern !== undefined &&\n      next.pattern !== undefined &&\n      existing.pattern !== next.pattern\n    ) {\n      recorders.recordRequireEmpty({\n        kind,\n        field,\n        type: \"CHANGE_PATTERN\",\n        detail: `${existing.pattern} → ${next.pattern}`,\n      });\n    }\n  }\n  // Format.\n  if (existing.format !== next.format) {\n    if (existing.format === undefined && next.format !== undefined) {\n      recorders.recordRequireEmpty({\n        kind,\n        field,\n        type: \"ADD_FORMAT\",\n        detail: next.format,\n      });\n    } else if (existing.format !== undefined && next.format === undefined) {\n      // DROP_FORMAT — allowed.\n    } else {\n      recorders.recordRequireEmpty({\n        kind,\n        field,\n        type: \"CHANGE_FORMAT\",\n        detail: `${existing.format} → ${next.format}`,\n      });\n    }\n  }\n}\n\nfunction classifyNumber(\n  kind: string,\n  field: string,\n  existing: ExtensionNumberProperty,\n  next: ExtensionNumberProperty,\n  recorders: Recorders,\n): void {\n  if (\n    next.min !== undefined &&\n    (existing.min === undefined || next.min > existing.min)\n  ) {\n    recorders.recordRequireEmpty({\n      kind,\n      field,\n      type: \"TIGHTEN_CONSTRAINT\",\n      detail: `min: ${existing.min ?? \"(none)\"} → ${next.min}`,\n    });\n  }\n  if (\n    next.max !== undefined &&\n    (existing.max === undefined || next.max < existing.max)\n  ) {\n    recorders.recordRequireEmpty({\n      kind,\n      field,\n      type: \"TIGHTEN_CONSTRAINT\",\n      detail: `max: ${existing.max ?? \"(none)\"} → ${next.max}`,\n    });\n  }\n  if (existing.int !== next.int && next.int === true && existing.int !== true) {\n    recorders.recordRequireEmpty({\n      kind,\n      field,\n      type: \"TIGHTEN_INT\",\n      detail: \"int: false → true\",\n    });\n  }\n  // LOOSEN_INT — allowed.\n}\n\nfunction classifyEnum(\n  kind: string,\n  field: string,\n  existing: ExtensionEnumProperty,\n  next: ExtensionEnumProperty,\n  recorders: Recorders,\n): void {\n  const nextValues = new Set(next.values);\n  const removed = existing.values.filter((value) => !nextValues.has(value));\n  if (removed.length > 0) {\n    recorders.recordRequireEmpty({\n      kind,\n      field,\n      type: \"TIGHTEN_ENUM\",\n      detail: `removed values: ${removed.join(\", \")}`,\n    });\n  }\n  // Adding values — LOOSEN_ENUM, allowed.\n}\n\nfunction classifyArray(\n  kind: string,\n  field: string,\n  existing: ExtensionArrayProperty,\n  next: ExtensionArrayProperty,\n  recorders: Recorders,\n): void {\n  // v1: array.items deltas are nested-property deltas. Same-type\n  // recurse; different-type → TYPE_CHANGE.\n  if (existing.items.type !== next.items.type) {\n    recorders.recordIncompatible({\n      kind,\n      field: `${field}.items`,\n      type: \"TYPE_CHANGE\",\n      detail: `${existing.items.type} → ${next.items.type}`,\n    });\n    return;\n  }\n  classifyProperty(\n    kind,\n    `${field}.items`,\n    existing.items,\n    next.items,\n    recorders,\n  );\n}\n\nfunction classifyObject(\n  kind: string,\n  field: string,\n  existing: ExtensionObjectProperty,\n  next: ExtensionObjectProperty,\n  recorders: Recorders,\n): void {\n  // Recurse into the object's properties with field-prefixed names so\n  // the issue carries a useful path for the reviewer.\n  classifyProperties(kind, existing.properties, next.properties, {\n    recordIncompatible: (entry) => {\n      recorders.recordIncompatible({\n        ...entry,\n        field: `${field}.${entry.field ?? \"\"}`,\n      });\n    },\n    recordRequireEmpty: (entry) => {\n      recorders.recordRequireEmpty({\n        ...entry,\n        field: `${field}.${entry.field ?? \"\"}`,\n      });\n    },\n  });\n}\n\n// ============================================================\n// Unique constraints\n// ============================================================\n\nfunction classifyUnique(\n  kind: string,\n  existing: readonly ExtensionUniqueConstraint[],\n  next: readonly ExtensionUniqueConstraint[],\n  recorders: Recorders,\n): void {\n  const existingByName = new Map(\n    existing.map((constraint) => [constraint.name, constraint]),\n  );\n  const nextByName = new Map(\n    next.map((constraint) => [constraint.name, constraint]),\n  );\n  for (const [name, constraint] of nextByName) {\n    if (!existingByName.has(name)) {\n      // ADD_UNIQUE — allowed-on-empty (existing rule, kept).\n      recorders.recordRequireEmpty({\n        kind,\n        type: \"ADD_UNIQUE_ON_POPULATED\",\n        detail: `unique constraint \"${name}\" on [${constraint.fields.join(\", \")}]`,\n      });\n    }\n  }\n  // Dropped unique constraints — DROP_UNIQUE, allowed.\n  // Modified — DROP + ADD; the ADD is recorded above for any\n  // structurally-different constraint with a same name.\n  for (const [name, constraint] of existingByName) {\n    const newOne = nextByName.get(name);\n    if (newOne === undefined) continue;\n    // Different shape with same name → treat as modify; ADD half is\n    // allowed-on-empty. Use `canonicalEqual` so the comparison is\n    // key-order-stable; plain `JSON.stringify` would flag two\n    // structurally identical constraints with differently-ordered\n    // keys as reshaped.\n    const { name: _existingName, ...existingShape } = constraint;\n    const { name: _nextName, ...nextShape } = newOne;\n    if (!canonicalEqual(existingShape, nextShape)) {\n      recorders.recordRequireEmpty({\n        kind,\n        type: \"ADD_UNIQUE_ON_POPULATED\",\n        detail: `unique constraint \"${name}\" reshaped`,\n      });\n    }\n  }\n}\n","/**\n * Graph-extension removal: mutate a `GraphExtension` to drop a\n * set of graph-extension kinds with cascading edge / ontology cleanup.\n *\n * Pure function — no I/O, no compilation. The caller (`store.removeKinds`)\n * handles persistence (CAS commit of the resulting document) and the\n * deferred data-cleanup phase via `materializeRemovals`. This module\n * answers two questions:\n *\n *   1. Is it valid to remove these names? Compile-time kinds are\n *      rejected (compile-time kinds are removed by recompiling and\n *      redeploying — persisting \"removed-compile-time-kind\" state in\n *      `schema_doc` is incoherent). Graph-extension kinds referenced by a\n *      compile-time edge or ontology relation are also rejected\n *      (removing them would orphan compile-time references at the\n *      next deploy).\n *\n *   2. What does the new document look like? Edges whose endpoint\n *      list becomes empty after removal are cascading-removed; edges\n *      with surviving endpoints are retained with the removed name\n *      dropped from `from`/`to`. Ontology relations referencing any\n *      removed kind are also cascading-removed.\n */\nimport { type GraphDef } from \"../core/define-graph\";\nimport { getTypeName } from \"../ontology/types\";\nimport {\n  KindHasReferentsError,\n  type KindReferent,\n  RemoveCompileTimeKindError,\n} from \"./errors\";\nimport {\n  type ExtensionEdgeDef,\n  type ExtensionIndex,\n  type ExtensionNodeDef,\n  type ExtensionOntologyRelation,\n  type GraphExtension,\n} from \"./extension-types\";\nimport {\n  buildGraphExtensionOntologyKeySet,\n  compileTimeOntologyKey,\n  extensionKindNames,\n} from \"./ontology-keys\";\n\ntype RemovalPlan = Readonly<{\n  /**\n   * The new extension after applying the removals. When the input\n   * list contained only absent names, the document is structurally\n   * equal to the existing extension and the caller short-circuits\n   * the schema commit.\n   */\n  document: GraphExtension | undefined;\n  /** Kinds actually removed (extension kinds present in the document). */\n  removedNodeKinds: readonly string[];\n  /** Edge kinds dropped because every endpoint they connected was removed. */\n  removedEdgeKinds: readonly string[];\n}>;\n\n/**\n * Plans the removal of a set of names from a host graph's\n * extension, validating against the host graph's compile-time\n * kinds and graph-extension kinds. Throws on the rejection cases:\n *\n *   - `RemoveCompileTimeKindError` if any name is a compile-time kind.\n *   - `KindHasReferentsError` if a graph-extension kind is referenced\n *     by a compile-time edge endpoint or ontology relation.\n *\n * Returns a plan describing the new document and which kinds will be\n * cascading-removed alongside the explicitly named ones.\n */\nexport function planRemovals<G extends GraphDef>(\n  graph: G,\n  names: readonly string[],\n): RemovalPlan {\n  const document = graph.extension;\n  const namesSet = new Set(names);\n  if (namesSet.size === 0) {\n    return { document, removedNodeKinds: [], removedEdgeKinds: [] };\n  }\n\n  const { nodes: runtimeNodeNames, edges: runtimeEdgeNames } =\n    extensionKindNames(document);\n  const compileTimeNodeNames = new Set(\n    Object.keys(graph.nodes).filter((name) => !runtimeNodeNames.has(name)),\n  );\n  const compileTimeEdgeNames = new Set(\n    Object.keys(graph.edges).filter((name) => !runtimeEdgeNames.has(name)),\n  );\n\n  // Reject compile-time names first — same shape across the API\n  // surface even when the call also references absent runtime names.\n  for (const name of namesSet) {\n    if (compileTimeNodeNames.has(name)) {\n      throw new RemoveCompileTimeKindError(name, \"node\", graph.id);\n    }\n    if (compileTimeEdgeNames.has(name)) {\n      throw new RemoveCompileTimeKindError(name, \"edge\", graph.id);\n    }\n  }\n\n  const removedNodeKinds = [...namesSet].filter((name) =>\n    runtimeNodeNames.has(name),\n  );\n  const explicitlyRemovedEdgeKinds = [...namesSet].filter((name) =>\n    runtimeEdgeNames.has(name),\n  );\n\n  // Compile-time-edge referent check: a graph-extension kind being\n  // removed cannot remain a target of any compile-time edge or ontology\n  // relation, because the compile-time declaration would resurrect the\n  // reference on the next deploy. Pre-build an inverted index of\n  // `kindName → referents` once so the per-kind check is O(1) instead\n  // of walking all edges + ontology per removed kind.\n  const referentsByKind = buildCompileTimeReferentIndex(\n    graph,\n    runtimeEdgeNames,\n  );\n  for (const kindName of removedNodeKinds) {\n    const referents = referentsByKind.get(kindName);\n    if (referents !== undefined && referents.length > 0) {\n      throw new KindHasReferentsError(kindName, referents, graph.id);\n    }\n  }\n\n  if (document === undefined) {\n    return {\n      document: undefined,\n      removedNodeKinds: [],\n      removedEdgeKinds: [],\n    };\n  }\n\n  // Build the cascading-edges set: any graph-extension edge whose `from` or\n  // `to` becomes empty after removal is also removed; edges with\n  // surviving endpoints are retained with the removed name pruned.\n  const removedNodeKindsSet = new Set(removedNodeKinds);\n  const explicitlyRemovedEdgeKindsSet = new Set(explicitlyRemovedEdgeKinds);\n  const cascadeEdges = new Set<string>();\n  const updatedEdges: Record<string, ExtensionEdgeDef> = {};\n\n  for (const [edgeName, edgeDocument] of Object.entries(document.edges ?? {})) {\n    if (explicitlyRemovedEdgeKindsSet.has(edgeName)) {\n      cascadeEdges.add(edgeName);\n      continue;\n    }\n    const newFrom = edgeDocument.from.filter(\n      (kind) => !removedNodeKindsSet.has(kind),\n    );\n    const newTo = edgeDocument.to.filter(\n      (kind) => !removedNodeKindsSet.has(kind),\n    );\n    if (newFrom.length === 0 || newTo.length === 0) {\n      cascadeEdges.add(edgeName);\n      continue;\n    }\n    updatedEdges[edgeName] = {\n      ...edgeDocument,\n      from: newFrom,\n      to: newTo,\n    };\n  }\n\n  // Filter nodes — explicit removals are dropped.\n  const updatedNodes: Record<string, ExtensionNodeDef> = {};\n  for (const [nodeName, nodeDocument] of Object.entries(document.nodes ?? {})) {\n    if (removedNodeKindsSet.has(nodeName)) continue;\n    updatedNodes[nodeName] = nodeDocument;\n  }\n\n  // Drop ontology relations referencing any removed kind. The compile-\n  // time-referent check above already rejects compile-time-side\n  // ontology referencing the removed kind, so any remaining ontology\n  // is safe to filter.\n  const survivingOntology: ExtensionOntologyRelation[] = (\n    document.ontology ?? []\n  ).filter(\n    (relation) =>\n      !removedNodeKindsSet.has(relation.from) &&\n      !removedNodeKindsSet.has(relation.to),\n  );\n\n  // Drop graph-extension indexes referencing removed kinds (relational + edge\n  // entries; the auto-derived vector indexes follow the graph-extension nodes\n  // they were derived from, so dropping the graph-extension node implicitly\n  // drops the index when `mergeGraphExtension` re-runs auto-derive\n  // against the smaller node set).\n  const allRemovedKinds = new Set([\n    ...removedNodeKindsSet,\n    ...cascadeEdges,\n    ...explicitlyRemovedEdgeKindsSet,\n  ]);\n  const survivingIndexes: ExtensionIndex[] = (document.indexes ?? []).filter(\n    (index) => !allRemovedKinds.has(index.kind),\n  );\n\n  const newDocument: GraphExtension = Object.freeze({\n    ...(document.version === undefined ? {} : { version: document.version }),\n    ...(Object.keys(updatedNodes).length === 0 ? {} : { nodes: updatedNodes }),\n    ...(Object.keys(updatedEdges).length === 0 ? {} : { edges: updatedEdges }),\n    ...(survivingOntology.length === 0 ? {} : { ontology: survivingOntology }),\n    ...(survivingIndexes.length === 0 ? {} : { indexes: survivingIndexes }),\n  });\n\n  return {\n    document: newDocument,\n    removedNodeKinds,\n    removedEdgeKinds: [\n      ...explicitlyRemovedEdgeKinds,\n      ...[...cascadeEdges].filter(\n        (name) => !explicitlyRemovedEdgeKindsSet.has(name),\n      ),\n    ],\n  };\n}\n\n/**\n * Returns a graph with the graph-extension slice stripped: nodes and edges\n * registered by `mergeGraphExtension` are dropped along with the\n * `extension` itself, leaving the compile-time-only graph.\n *\n * Used by `removeKinds` as the base for re-merging the post-removal\n * graph-extension document — the alternative (mutating `graph.nodes` /\n * `graph.edges` in-place) would skip the merge step's validation\n * (collision checks, endpoint resolution).\n */\nexport function stripGraphExtension<G extends GraphDef>(graph: G): G {\n  const document = graph.extension;\n  if (document === undefined) return graph;\n  const { nodes: runtimeNodeNames, edges: runtimeEdgeNames } =\n    extensionKindNames(document);\n  const runtimeOntologyKeys = buildGraphExtensionOntologyKeySet(document);\n\n  const compileNodes: Record<string, (typeof graph.nodes)[string]> = {};\n  for (const [name, registration] of Object.entries(graph.nodes)) {\n    if (runtimeNodeNames.has(name)) continue;\n    compileNodes[name] = registration;\n  }\n  const compileEdges: Record<string, (typeof graph.edges)[string]> = {};\n  for (const [name, registration] of Object.entries(graph.edges)) {\n    if (runtimeEdgeNames.has(name)) continue;\n    compileEdges[name] = registration;\n  }\n  const compileOntology = graph.ontology.filter(\n    (relation) => !runtimeOntologyKeys.has(compileTimeOntologyKey(relation)),\n  );\n  // Drop runtime-origin indexes too — `mergeGraphExtension` re-runs\n  // auto-derivation against the new (smaller) graph-extension kind set.\n  const compileIndexes = (graph.indexes ?? []).filter(\n    (index) => index.origin !== \"runtime\",\n  );\n\n  return Object.freeze({\n    ...graph,\n    nodes: compileNodes,\n    edges: compileEdges,\n    ontology: compileOntology,\n    indexes: compileIndexes.length === 0 ? undefined : compileIndexes,\n    extension: undefined,\n  });\n}\n\n/**\n * Builds an inverted index `kindName → KindReferent[]` over the\n * compile-time edges and ontology relations of `graph`. One walk per\n * graph instead of one walk per removed kind, dropping the cost of the\n * referent check from O(K × (E + O)) to O(K + E + O).\n */\nfunction buildCompileTimeReferentIndex<G extends GraphDef>(\n  graph: G,\n  runtimeEdgeNames: ReadonlySet<string>,\n): ReadonlyMap<string, readonly KindReferent[]> {\n  const index = new Map<string, KindReferent[]>();\n  const append = (kindName: string, referent: KindReferent): void => {\n    const existing = index.get(kindName);\n    if (existing === undefined) index.set(kindName, [referent]);\n    else existing.push(referent);\n  };\n\n  for (const [edgeName, registration] of Object.entries(graph.edges)) {\n    if (runtimeEdgeNames.has(edgeName)) continue;\n    const reg = registration as {\n      from?: readonly { kind: string }[];\n      to?: readonly { kind: string }[];\n    };\n    const referent: KindReferent = {\n      type: \"compile-time-edge\",\n      name: edgeName,\n    };\n    const seen = new Set<string>();\n    for (const endpoint of reg.from ?? []) {\n      if (seen.has(endpoint.kind)) continue;\n      seen.add(endpoint.kind);\n      append(endpoint.kind, referent);\n    }\n    for (const endpoint of reg.to ?? []) {\n      if (seen.has(endpoint.kind)) continue;\n      seen.add(endpoint.kind);\n      append(endpoint.kind, referent);\n    }\n  }\n\n  const runtimeOntologyKeys = buildGraphExtensionOntologyKeySet(\n    graph.extension,\n  );\n  for (const relation of graph.ontology) {\n    if (runtimeOntologyKeys.has(compileTimeOntologyKey(relation))) continue;\n    const fromName = getTypeName(relation.from);\n    const toName = getTypeName(relation.to);\n    const referent: KindReferent = {\n      type: \"compile-time-ontology\",\n      name: `${relation.metaEdge.name}(${fromName}, ${toName})`,\n    };\n    append(fromName, referent);\n    if (toName !== fromName) append(toName, referent);\n  }\n\n  return index;\n}\n","/**\n * Builder functions for creating KindRegistry from GraphDef.\n */\nimport {\n  getEdgeKinds,\n  getNodeKinds,\n  type GraphDef,\n} from \"../core/define-graph\";\nimport {\n  type AnyEdgeType,\n  type EdgeRegistration,\n  type NodeRegistration,\n  type NodeType,\n} from \"../core/types\";\nimport {\n  computeClosuresFromOntology,\n  createEmptyClosures,\n  KindRegistry,\n} from \"./kind-registry\";\n\n// ============================================================\n// Build Registry from GraphDef\n// ============================================================\n\n/**\n * Builds a KindRegistry from a GraphDef.\n *\n * This precomputes all transitive closures for efficient runtime queries.\n *\n * @example\n * ```typescript\n * const graph = defineGraph({\n *   id: \"my_graph\",\n *   nodes: { Person: { type: Person }, Company: { type: Company } },\n *   edges: { worksAt: { type: worksAt, from: [Person], to: [Company] } },\n *   ontology: [subClassOf(Company, Organization)],\n * });\n *\n * const registry = buildKindRegistry(graph);\n * registry.isSubClassOf(\"Company\", \"Organization\"); // true\n * ```\n */\nexport function buildKindRegistry<G extends GraphDef>(graph: G): KindRegistry {\n  // Extract node types\n  const nodeTypes = extractNodeTypes(graph);\n\n  // Extract edge types\n  const edgeTypes = extractEdgeTypes(graph);\n\n  // Compute closures from ontology\n  const closures =\n    graph.ontology.length > 0 ?\n      computeClosuresFromOntology(graph.ontology)\n    : createEmptyClosures();\n\n  return new KindRegistry(nodeTypes, edgeTypes, closures);\n}\n\n// ============================================================\n// Node Kind Extraction\n// ============================================================\n\n/**\n * Extracts all node types from a GraphDef into a Map.\n */\nfunction extractNodeTypes<G extends GraphDef>(\n  graph: G,\n): ReadonlyMap<string, NodeType> {\n  const result = new Map<string, NodeType>();\n\n  for (const typeName of getNodeKinds(graph)) {\n    const registration = graph.nodes[typeName] as NodeRegistration;\n    result.set(typeName, registration.type);\n  }\n\n  return result;\n}\n\n// ============================================================\n// Edge Type Extraction\n// ============================================================\n\n/**\n * Extracts all edge types from a GraphDef into a Map.\n */\nfunction extractEdgeTypes<G extends GraphDef>(\n  graph: G,\n): ReadonlyMap<string, AnyEdgeType> {\n  const result = new Map<string, AnyEdgeType>();\n\n  for (const typeName of getEdgeKinds(graph)) {\n    const registration = graph.edges[typeName] as EdgeRegistration;\n    result.set(typeName, registration.type);\n  }\n\n  return result;\n}\n","import { type GraphBackend } from \"../../backend/types\";\nimport { resolveReadCoordinate } from \"../../core/temporal\";\nimport { type TemporalMode } from \"../../core/types\";\nimport { ConfigurationError } from \"../../errors\";\nimport { MAX_EXPLICIT_RECURSIVE_DEPTH } from \"../../query/compiler/recursive\";\nimport { type SqlSchema } from \"../../query/compiler/schema\";\nimport {\n  compileTemporalFilter,\n  type TemporalFilterOptions,\n} from \"../../query/compiler/temporal\";\nimport { type DialectAdapter } from \"../../query/dialect/types\";\nimport type { AlgorithmCyclePolicy, TraversalDirection } from \"./types\";\n\nexport const DEFAULT_ALGORITHM_MAX_HOPS = 10;\nexport const DEFAULT_NEIGHBOR_DEPTH = 1;\n\nexport type AlgorithmContext = Readonly<{\n  graphId: string;\n  backend: GraphBackend;\n  dialect: DialectAdapter;\n  schema: SqlSchema;\n  defaultTemporalMode: TemporalMode;\n}>;\n\nexport type InternalTemporalOptions = Readonly<{\n  temporalMode?: TemporalMode;\n  asOf?: string;\n}>;\n\nexport type InternalTraversalOptions = InternalTemporalOptions &\n  Readonly<{\n    edges: readonly string[];\n    maxHops?: number;\n    direction?: TraversalDirection;\n    cyclePolicy?: AlgorithmCyclePolicy;\n  }>;\n\n/**\n * Resolves per-call temporal overrides against the graph's default mode into\n * a plain `{ temporalMode, asOf? }` object. Shared by callers that forward\n * the pair to `buildReachableCte`. An `asOf` is rejected unless the mode is\n * `\"asOf\"` (via {@link resolveReadCoordinate}), matching every other read path.\n */\nexport function resolveTemporalOptions(\n  ctx: AlgorithmContext,\n  options: InternalTemporalOptions,\n): Readonly<{ temporalMode: TemporalMode; asOf?: string }> {\n  const { valid } = resolveReadCoordinate(\n    options.temporalMode ?? ctx.defaultTemporalMode,\n    options.asOf,\n  );\n  return {\n    temporalMode: valid.mode,\n    ...(valid.asOf !== undefined && { asOf: valid.asOf }),\n  };\n}\n\n/**\n * Compiles the resolved temporal filter to SQL. `resolveTemporalOptions`\n * has already rejected an `asOf` paired with any non-`\"asOf\"` mode, so a\n * stray pin can never reach the filter; `current` resolves against the\n * dialect's current-timestamp expression.\n */\nexport function resolveTemporalFilter(\n  ctx: AlgorithmContext,\n  options: InternalTemporalOptions,\n  tableAlias?: string,\n): ReturnType<typeof compileTemporalFilter> {\n  const resolved = resolveTemporalOptions(ctx, options);\n  const filterOptions: TemporalFilterOptions = {\n    mode: resolved.temporalMode,\n    asOf: resolved.asOf,\n    tableAlias,\n    currentTimestamp: ctx.dialect.currentTimestamp(),\n  };\n  return compileTemporalFilter(filterOptions);\n}\n\nexport function resolveMaxHops(\n  rawMaxHops: number | undefined,\n  fallback: number,\n  optionName: \"maxHops\" | \"depth\",\n): number {\n  const value = rawMaxHops ?? fallback;\n\n  if (!Number.isFinite(value) || !Number.isInteger(value)) {\n    throw new ConfigurationError(\n      `Graph algorithm ${optionName} must be a finite integer, got ${String(value)}.`,\n      { option: optionName, value },\n    );\n  }\n\n  if (value < 1) {\n    throw new ConfigurationError(\n      `Graph algorithm ${optionName} must be at least 1, got ${value}.`,\n      { option: optionName, value },\n    );\n  }\n\n  if (value > MAX_EXPLICIT_RECURSIVE_DEPTH) {\n    throw new ConfigurationError(\n      `Graph algorithm ${optionName} (${value}) exceeds the maximum of ${MAX_EXPLICIT_RECURSIVE_DEPTH}.`,\n      { option: optionName, value, limit: MAX_EXPLICIT_RECURSIVE_DEPTH },\n    );\n  }\n\n  return value;\n}\n\nexport function assertEdgeKinds(edges: readonly string[]): void {\n  if (edges.length === 0) {\n    throw new ConfigurationError(\n      `Graph algorithms require at least one edge kind in 'edges'.`,\n      { edges },\n    );\n  }\n}\n","import { type SQL, sql } from \"drizzle-orm\";\n\nimport { compileKindFilter } from \"../../query/compiler/predicate-utils\";\nimport {\n  type AlgorithmContext,\n  type InternalTemporalOptions,\n  resolveTemporalFilter,\n} from \"./context\";\nimport type { TraversalDirection } from \"./types\";\n\ntype InternalDegreeOptions = InternalTemporalOptions &\n  Readonly<{\n    edges?: readonly string[];\n    direction?: TraversalDirection;\n  }>;\n\nexport async function executeDegree(\n  ctx: AlgorithmContext,\n  nodeId: string,\n  options: InternalDegreeOptions = {},\n): Promise<number> {\n  const direction = options.direction ?? \"both\";\n\n  const whereClauses: SQL[] = [\n    sql`graph_id = ${ctx.graphId}`,\n    resolveTemporalFilter(ctx, options),\n    compileDirectionFilter(direction, nodeId),\n  ];\n  if (options.edges !== undefined) {\n    whereClauses.push(compileKindFilter(sql.raw(\"kind\"), options.edges));\n  }\n\n  // COUNT(DISTINCT id) collapses self-loops (from === to === nodeId) to a\n  // single edge so they don't double-count under `\"both\"`.\n  const countExpr =\n    direction === \"both\" ? sql`COUNT(DISTINCT id)` : sql`COUNT(*)`;\n\n  const query = sql`SELECT ${countExpr} AS count FROM ${ctx.schema.edgesTable} WHERE ${sql.join(whereClauses, sql` AND `)}`;\n\n  const rows =\n    await ctx.backend.execute<Readonly<{ count: number | string }>>(query);\n  return Number(rows[0]?.count ?? 0);\n}\n\nfunction compileDirectionFilter(\n  direction: TraversalDirection,\n  nodeId: string,\n): ReturnType<typeof sql> {\n  switch (direction) {\n    case \"out\": {\n      return sql`from_id = ${nodeId}`;\n    }\n    case \"in\": {\n      return sql`to_id = ${nodeId}`;\n    }\n    case \"both\": {\n      return sql`(from_id = ${nodeId} OR to_id = ${nodeId})`;\n    }\n  }\n}\n","import { sql } from \"drizzle-orm\";\n\nimport { buildReachableCte } from \"../recursive-cte\";\nimport {\n  type AlgorithmContext,\n  assertEdgeKinds,\n  DEFAULT_ALGORITHM_MAX_HOPS,\n  DEFAULT_NEIGHBOR_DEPTH,\n  type InternalTraversalOptions,\n  resolveMaxHops,\n  resolveTemporalOptions,\n} from \"./context\";\nimport type { ReachableNode } from \"./types\";\n\ntype InternalReachableOptions = InternalTraversalOptions &\n  Readonly<{ excludeSource?: boolean }>;\n\ntype InternalNeighborsOptions = Omit<InternalTraversalOptions, \"maxHops\"> &\n  Readonly<{ depth?: number }>;\n\ntype ReachableRow = Readonly<{\n  id: string;\n  kind: string;\n  depth: number | string;\n}>;\n\nexport async function executeReachable(\n  ctx: AlgorithmContext,\n  sourceId: string,\n  options: InternalReachableOptions,\n): Promise<readonly ReachableNode[]> {\n  assertEdgeKinds(options.edges);\n  const maxHops = resolveMaxHops(\n    options.maxHops,\n    DEFAULT_ALGORITHM_MAX_HOPS,\n    \"maxHops\",\n  );\n\n  const cte = buildReachableCte({\n    graphId: ctx.graphId,\n    sourceId,\n    edgeKinds: options.edges,\n    maxHops,\n    direction: options.direction ?? \"out\",\n    cyclePolicy: options.cyclePolicy ?? \"prevent\",\n    includePath: false,\n    ...resolveTemporalOptions(ctx, options),\n    dialect: ctx.dialect,\n    schema: ctx.schema,\n  });\n\n  const sourceFilter =\n    options.excludeSource === true ? sql` WHERE id != ${sourceId}` : sql``;\n\n  const query = sql`${cte} SELECT id, kind, MIN(depth) AS depth FROM reachable${sourceFilter} GROUP BY id, kind ORDER BY depth ASC, id ASC`;\n\n  const rows = await ctx.backend.execute<ReachableRow>(query);\n  return rows.map((row) => ({\n    id: row.id,\n    kind: row.kind,\n    depth: Number(row.depth),\n  }));\n}\n\nexport async function executeCanReach(\n  ctx: AlgorithmContext,\n  sourceId: string,\n  targetId: string,\n  options: InternalTraversalOptions,\n): Promise<boolean> {\n  assertEdgeKinds(options.edges);\n\n  const maxHops = resolveMaxHops(\n    options.maxHops,\n    DEFAULT_ALGORITHM_MAX_HOPS,\n    \"maxHops\",\n  );\n\n  // Self-case (sourceId === targetId) is not short-circuited: the CTE base\n  // case emits the source row only if it passes the temporal filter, so\n  // `canReach(a, a)` correctly returns false when `a` is not visible under\n  // the resolved mode — consistent with `shortestPath(a, a)`.\n  const cte = buildReachableCte({\n    graphId: ctx.graphId,\n    sourceId,\n    edgeKinds: options.edges,\n    maxHops,\n    direction: options.direction ?? \"out\",\n    cyclePolicy: options.cyclePolicy ?? \"prevent\",\n    includePath: false,\n    ...resolveTemporalOptions(ctx, options),\n    dialect: ctx.dialect,\n    schema: ctx.schema,\n  });\n\n  const query = sql`${cte} SELECT 1 AS hit FROM reachable WHERE id = ${targetId} LIMIT 1`;\n\n  const rows = await ctx.backend.execute<Readonly<{ hit: number }>>(query);\n  return rows.length > 0;\n}\n\nexport async function executeNeighbors(\n  ctx: AlgorithmContext,\n  sourceId: string,\n  options: InternalNeighborsOptions,\n): Promise<readonly ReachableNode[]> {\n  const depth = resolveMaxHops(options.depth, DEFAULT_NEIGHBOR_DEPTH, \"depth\");\n\n  return executeReachable(ctx, sourceId, {\n    edges: options.edges,\n    maxHops: depth,\n    direction: options.direction ?? \"out\",\n    cyclePolicy: options.cyclePolicy ?? \"prevent\",\n    ...(options.temporalMode !== undefined && {\n      temporalMode: options.temporalMode,\n    }),\n    ...(options.asOf !== undefined && { asOf: options.asOf }),\n    excludeSource: true,\n  });\n}\n","import { type SQL, sql } from \"drizzle-orm\";\n\nimport { normalizePath } from \"../../utils\";\nimport { buildReachableCte } from \"../recursive-cte\";\nimport {\n  type AlgorithmContext,\n  assertEdgeKinds,\n  DEFAULT_ALGORITHM_MAX_HOPS,\n  type InternalTraversalOptions,\n  resolveMaxHops,\n  resolveTemporalFilter,\n  resolveTemporalOptions,\n} from \"./context\";\nimport type { PathNode, ShortestPathResult } from \"./types\";\n\ntype ShortestPathRow = Readonly<{\n  hit_id: string;\n  hit_kind: string;\n  hit_depth: number | string;\n  hit_path: unknown;\n  node_id: string | undefined;\n  node_kind: string | undefined;\n}>;\n\ntype NodeKindRow = Readonly<{ id: string; kind: string }>;\n\nexport async function executeShortestPath(\n  ctx: AlgorithmContext,\n  sourceId: string,\n  targetId: string,\n  options: InternalTraversalOptions,\n): Promise<ShortestPathResult | undefined> {\n  assertEdgeKinds(options.edges);\n  const maxHops = resolveMaxHops(\n    options.maxHops,\n    DEFAULT_ALGORITHM_MAX_HOPS,\n    \"maxHops\",\n  );\n\n  // Self-path short-circuit: avoids the recursive CTE entirely while still\n  // honouring the configured temporal mode via a lightweight existence check.\n  if (sourceId === targetId) {\n    const source = await fetchNodeKind(ctx, sourceId, options);\n    if (source === undefined) return undefined;\n    return { nodes: [source], depth: 0 };\n  }\n\n  const cte = buildReachableCte({\n    graphId: ctx.graphId,\n    sourceId,\n    edgeKinds: options.edges,\n    maxHops,\n    direction: options.direction ?? \"out\",\n    cyclePolicy: options.cyclePolicy ?? \"prevent\",\n    includePath: true,\n    ...resolveTemporalOptions(ctx, options),\n    dialect: ctx.dialect,\n    schema: ctx.schema,\n  });\n\n  // `cycleCheck` returns TRUE when id is NOT in path; negating it yields the\n  // \"id is in path\" predicate needed to hydrate every hop's kind in one query.\n  //\n  // Cost model: the LEFT JOIN scans `reachable` with an O(path length) check\n  // per row. Under cyclePolicy: \"prevent\" (default), |reachable| ≤ V, so this\n  // is bounded by V × p. Under \"allow\" + high maxHops, |reachable| grows with\n  // the CTE itself (O(V × maxHops)) — but that cost is proportional to the\n  // CTE materialization the user already opted into, not a new asymptotic\n  // class. If this ever dominates in a real workload, the path-unpack +\n  // nodes-PK join variant is the likely next step.\n  const pathContainsCheck = sql`NOT (${ctx.dialect.cycleCheck(sql.raw(\"r.id\"), sql.raw(\"h.path\"))})`;\n\n  const query = sql`${cte}, hit AS (SELECT id, kind, depth, path FROM reachable WHERE id = ${targetId} ORDER BY depth ASC LIMIT 1) SELECT h.id AS hit_id, h.kind AS hit_kind, h.depth AS hit_depth, h.path AS hit_path, r.id AS node_id, r.kind AS node_kind FROM hit h LEFT JOIN reachable r ON ${pathContainsCheck}`;\n\n  const rows = await ctx.backend.execute<ShortestPathRow>(query);\n  const first = rows[0];\n  if (first === undefined) return undefined;\n\n  const pathIds = normalizePath(first.hit_path);\n  const kindById = buildKindIndex(rows);\n\n  const pathNodes: PathNode[] = pathIds.map((id) => ({\n    id,\n    kind: kindById.get(id) ?? \"\",\n  }));\n\n  return { nodes: pathNodes, depth: Number(first.hit_depth) };\n}\n\nfunction buildKindIndex(\n  rows: readonly ShortestPathRow[],\n): ReadonlyMap<string, string> {\n  const map = new Map<string, string>();\n  for (const row of rows) {\n    if (row.node_id !== undefined && row.node_kind !== undefined) {\n      map.set(row.node_id, row.node_kind);\n    }\n  }\n  return map;\n}\n\nasync function fetchNodeKind(\n  ctx: AlgorithmContext,\n  nodeId: string,\n  options: InternalTraversalOptions,\n): Promise<PathNode | undefined> {\n  const temporalFilter = resolveTemporalFilter(ctx, options);\n  const query: SQL = sql`SELECT id, kind FROM ${ctx.schema.nodesTable} WHERE graph_id = ${ctx.graphId} AND id = ${nodeId} AND ${temporalFilter} LIMIT 1`;\n  const rows = await ctx.backend.execute<NodeKindRow>(query);\n  const row = rows[0];\n  if (row === undefined) return undefined;\n  return { id: row.id, kind: row.kind };\n}\n","import { type GraphBackend } from \"../../backend/types\";\nimport { type GraphDef } from \"../../core/define-graph\";\nimport { type TemporalMode } from \"../../core/types\";\nimport { createSqlSchema, type SqlSchema } from \"../../query/compiler/schema\";\nimport { getDialect } from \"../../query/dialect\";\nimport { type AlgorithmContext } from \"./context\";\nimport { executeDegree } from \"./degree\";\nimport {\n  executeCanReach,\n  executeNeighbors,\n  executeReachable,\n} from \"./reachable\";\nimport { executeShortestPath } from \"./shortest-path\";\nimport type {\n  BaseTraversalOptions,\n  DegreeOptions,\n  NeighborsOptions,\n  ReachableNode,\n  ReachableOptions,\n  ShortestPathOptions,\n  ShortestPathResult,\n} from \"./types\";\n\n/**\n * Raw node id or any object with an `id: string` field. Covers `Node`,\n * `NodeRef`, and the lightweight `ReachableNode` / `PathNode` shapes\n * returned by the algorithms themselves.\n *\n * Deliberately kind-agnostic: graph algorithms don't constrain the source\n * node's kind — you can start a traversal from any node reachable via the\n * given edge kinds. `NodeRef<N>` exists for the edge-endpoint case where\n * kind *is* load-bearing; using it here would paint a constraint onto a\n * contract that doesn't need one and would reject common patterns like\n * passing `ReachableNode` / cache entries / `{ id }` records straight\n * through.\n */\nexport type NodeIdentifier = string | Readonly<{ id: string }>;\n\nfunction resolveNodeId(value: NodeIdentifier): string {\n  return typeof value === \"string\" ? value : value.id;\n}\n\nexport type GraphAlgorithms<G extends GraphDef> = Readonly<{\n  /**\n   * Finds the shortest directed path from `from` to `to` using the given\n   * edge kinds. Returns `undefined` when no path exists within `maxHops`.\n   *\n   * @example\n   * ```typescript\n   * const path = await store.algorithms.shortestPath(alice, bob, {\n   *   edges: [\"knows\"],\n   *   maxHops: 6,\n   * });\n   * if (path) {\n   *   console.log(`${path.depth} hops via`, path.nodes.map((n) => n.id));\n   * }\n   * ```\n   */\n  shortestPath: (\n    from: NodeIdentifier,\n    to: NodeIdentifier,\n    options: ShortestPathOptions<G>,\n  ) => Promise<ShortestPathResult | undefined>;\n\n  /**\n   * Returns every node reachable from `from` within `maxHops` edges of the\n   * allowed kinds. Each node carries its minimum discovered depth.\n   */\n  reachable: (\n    from: NodeIdentifier,\n    options: ReachableOptions<G>,\n  ) => Promise<readonly ReachableNode[]>;\n\n  /**\n   * Fast boolean check: is `to` reachable from `from` within `maxHops`\n   * edges? Short-circuits the underlying recursive CTE with `LIMIT 1`.\n   */\n  canReach: (\n    from: NodeIdentifier,\n    to: NodeIdentifier,\n    options: BaseTraversalOptions<G>,\n  ) => Promise<boolean>;\n\n  /**\n   * Returns the k-hop neighborhood of a node. The source is always\n   * excluded. `depth` defaults to 1, matching the common \"immediate\n   * neighbors\" interpretation.\n   */\n  neighbors: (\n    node: NodeIdentifier,\n    options: NeighborsOptions<G>,\n  ) => Promise<readonly ReachableNode[]>;\n\n  /**\n   * Counts active edges incident to `node`.\n   *\n   * With `direction: \"both\"` (default), self-loops contribute once.\n   */\n  degree: (node: NodeIdentifier, options?: DegreeOptions<G>) => Promise<number>;\n}>;\n\nexport type CreateGraphAlgorithmsParams = Readonly<{\n  graphId: string;\n  backend: GraphBackend;\n  schema: SqlSchema | undefined;\n  defaultTemporalMode: TemporalMode;\n}>;\n\nexport function createGraphAlgorithms<G extends GraphDef>(\n  params: CreateGraphAlgorithmsParams,\n): GraphAlgorithms<G> {\n  const ctx: AlgorithmContext = {\n    graphId: params.graphId,\n    backend: params.backend,\n    dialect: getDialect(params.backend.dialect),\n    schema:\n      params.schema ??\n      (params.backend.tableNames ?\n        createSqlSchema(params.backend.tableNames)\n      : createSqlSchema()),\n    defaultTemporalMode: params.defaultTemporalMode,\n  };\n\n  return {\n    shortestPath(from, to, options) {\n      return executeShortestPath(\n        ctx,\n        resolveNodeId(from),\n        resolveNodeId(to),\n        options,\n      );\n    },\n    reachable(from, options) {\n      return executeReachable(ctx, resolveNodeId(from), options);\n    },\n    canReach(from, to, options) {\n      return executeCanReach(\n        ctx,\n        resolveNodeId(from),\n        resolveNodeId(to),\n        options,\n      );\n    },\n    neighbors(node, options) {\n      return executeNeighbors(ctx, resolveNodeId(node), options);\n    },\n    degree(node, options) {\n      return executeDegree(ctx, resolveNodeId(node), options ?? {});\n    },\n  };\n}\n\nexport type {\n  AlgorithmCyclePolicy,\n  BaseTraversalOptions,\n  DegreeOptions,\n  NeighborsOptions,\n  PathNode,\n  ReachableNode,\n  ReachableOptions,\n  ShortestPathOptions,\n  ShortestPathResult,\n  TemporalAlgorithmOptions,\n  TraversalDirection,\n} from \"./types\";\n","/**\n * EdgeCollection implementation.\n *\n * Provides an ergonomic API for CRUD operations on a specific edge type.\n */\nimport { type z } from \"zod\";\n\nimport {\n  type FindEdgesByKindParams,\n  type GraphBackend,\n  type TransactionBackend,\n} from \"../../backend/types\";\nimport { type GraphDef } from \"../../core/define-graph\";\nimport { type AnyEdgeType, type TemporalMode } from \"../../core/types\";\nimport { UnsupportedPredicateError } from \"../../errors\";\nimport { type QueryBuilder } from \"../../query/builder\";\nimport type { BatchableQuery } from \"../../query/builder/types\";\nimport { type EdgeRow } from \"../row-mappers\";\nimport {\n  type CreateEdgeInput,\n  type Edge,\n  type EdgeCollection,\n  type EdgeFindByEndpointsOptions,\n  type EdgeGetOrCreateByEndpointsOptions,\n  type EdgeGetOrCreateByEndpointsResult,\n  type GetOrCreateAction,\n  type IfExistsMode,\n  type NodeRef,\n  type QueryOptions,\n} from \"../types\";\nimport {\n  resolveTemporalReadParams,\n  type TemporalReadParams,\n} from \"./temporal-read-params\";\n\n/**\n * Narrows unparameterized Edge to Edge<E>.\n * Safe: props are validated by Zod at creation/update boundaries.\n */\nfunction narrowEdge<E extends AnyEdgeType>(edge: Edge): Edge<E> {\n  return edge as Edge<E>;\n}\n\n/**\n * Narrows a readonly Edge array to Edge<E>[].\n */\nfunction narrowEdges<E extends AnyEdgeType>(edges: readonly Edge[]): Edge<E>[] {\n  return edges as Edge<E>[];\n}\n\n/**\n * Config for creating an EdgeCollection.\n */\nexport type EdgeCollectionConfig = Readonly<{\n  graphId: string;\n  kind: string;\n  backend: GraphBackend | TransactionBackend;\n  defaultTemporalMode: TemporalMode;\n  rowToEdge: (row: EdgeRow) => Edge;\n  executeCreate: (\n    input: CreateEdgeInput,\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<Edge>;\n  executeCreateNoReturnBatch: (\n    inputs: readonly CreateEdgeInput[],\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<void>;\n  executeCreateBatch: (\n    inputs: readonly CreateEdgeInput[],\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<readonly Edge[]>;\n  executeUpdate: (\n    input: {\n      id: string;\n      props: Partial<Record<string, unknown>>;\n      validTo?: string;\n    },\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<Edge>;\n  executeUpsertUpdate: (\n    input: {\n      id: string;\n      props: Partial<Record<string, unknown>>;\n      validTo?: string;\n    },\n    backend: GraphBackend | TransactionBackend,\n    options?: Readonly<{ clearDeleted?: boolean }>,\n  ) => Promise<Edge>;\n  executeDelete: (\n    id: string,\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<void>;\n  executeHardDelete: (\n    id: string,\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<void>;\n  temporalRowMatcher: (options?: QueryOptions) => (row: EdgeRow) => boolean;\n  createQuery?: () => QueryBuilder<GraphDef>;\n  executeGetOrCreateByEndpoints: (\n    kind: string,\n    fromKind: string,\n    fromId: string,\n    toKind: string,\n    toId: string,\n    props: Record<string, unknown>,\n    backend: GraphBackend | TransactionBackend,\n    options?: Readonly<{\n      matchOn?: readonly string[];\n      ifExists?: IfExistsMode;\n    }>,\n  ) => Promise<Readonly<{ edge: Edge; action: GetOrCreateAction }>>;\n  executeBulkGetOrCreateByEndpoints: (\n    kind: string,\n    items: readonly Readonly<{\n      fromKind: string;\n      fromId: string;\n      toKind: string;\n      toId: string;\n      props: Record<string, unknown>;\n    }>[],\n    backend: GraphBackend | TransactionBackend,\n    options?: Readonly<{\n      matchOn?: readonly string[];\n      ifExists?: IfExistsMode;\n    }>,\n  ) => Promise<Readonly<{ edge: Edge; action: GetOrCreateAction }>[]>;\n  executeFindByEndpoints: (\n    kind: string,\n    fromKind: string,\n    fromId: string,\n    toKind: string,\n    toId: string,\n    backend: GraphBackend | TransactionBackend,\n    options?: Readonly<{\n      matchOn?: readonly string[];\n      props?: Record<string, unknown>;\n      excludeDeleted?: boolean;\n      temporalMode?: TemporalMode;\n      asOf?: string;\n    }>,\n  ) => Promise<Edge | undefined>;\n}>;\n\nfunction buildCreateEdgeInput(\n  kind: string,\n  from: NodeRef,\n  to: NodeRef,\n  props: Record<string, unknown>,\n  options?: Readonly<{ id?: string; validFrom?: string; validTo?: string }>,\n): CreateEdgeInput {\n  const input: {\n    kind: string;\n    id?: string;\n    fromKind: string;\n    fromId: string;\n    toKind: string;\n    toId: string;\n    props: Record<string, unknown>;\n    validFrom?: string;\n    validTo?: string;\n  } = {\n    kind,\n    fromKind: from.kind,\n    fromId: from.id,\n    toKind: to.kind,\n    toId: to.id,\n    props,\n  };\n  if (options?.id !== undefined) input.id = options.id;\n  if (options?.validFrom !== undefined) input.validFrom = options.validFrom;\n  if (options?.validTo !== undefined) input.validTo = options.validTo;\n  return input;\n}\n\ntype EdgeUpdateInput = Readonly<{\n  id: string;\n  props: Partial<Record<string, unknown>>;\n  validTo?: string;\n}>;\n\nfunction buildUpdateEdgeInput(\n  id: string,\n  props: Record<string, unknown>,\n  options?: Readonly<{ validTo?: string }>,\n): EdgeUpdateInput {\n  const input: {\n    id: string;\n    props: Partial<Record<string, unknown>>;\n    validTo?: string;\n  } = { id, props };\n  if (options?.validTo !== undefined) input.validTo = options.validTo;\n  return input;\n}\n\nfunction mapBulkEdgeInputs(\n  kind: string,\n  items: readonly Readonly<{\n    from: NodeRef;\n    to: NodeRef;\n    props?: Record<string, unknown>;\n    id?: string;\n    validFrom?: string;\n    validTo?: string;\n  }>[],\n): CreateEdgeInput[] {\n  return items.map((item) =>\n    buildCreateEdgeInput(kind, item.from, item.to, item.props ?? {}, item),\n  );\n}\n\n/**\n * Creates an EdgeCollection for a specific edge type.\n */\nexport function createEdgeCollection<\n  G extends GraphDef,\n  K extends keyof G[\"edges\"] & string,\n>(config: EdgeCollectionConfig): EdgeCollection<G[\"edges\"][K][\"type\"]> {\n  type E = G[\"edges\"][K][\"type\"];\n\n  const {\n    graphId,\n    kind,\n    backend,\n    defaultTemporalMode,\n    rowToEdge,\n    executeCreate: executeEdgeCreate,\n    executeCreateNoReturnBatch: executeEdgeCreateNoReturnBatch,\n    executeCreateBatch: executeEdgeCreateBatch,\n    executeUpdate: executeEdgeUpdate,\n    executeUpsertUpdate: executeEdgeUpsertUpdate,\n    executeDelete: executeEdgeDelete,\n    executeHardDelete: executeEdgeHardDelete,\n    temporalRowMatcher,\n  } = config;\n\n  const mapRows = (rows: readonly EdgeRow[]): Edge<E>[] =>\n    rows.map((row) => narrowEdge<E>(rowToEdge(row)));\n\n  /**\n   * Builds the `findEdgesByKind` params for an endpoint lookup, resolving\n   * the temporal mode the same way `find` / `getById` do: the per-call\n   * `options` win, falling back to the graph's default mode. Keeps\n   * `findFrom` / `findTo` honoring the temporal model instead of silently\n   * returning every non-deleted edge.\n   */\n  function buildEndpointFindParams(\n    endpoint:\n      | Readonly<{ fromKind: string; fromId: string }>\n      | Readonly<{ toKind: string; toId: string }>,\n    options: QueryOptions | undefined,\n  ): FindEdgesByKindParams {\n    return {\n      graphId,\n      kind,\n      ...endpoint,\n      ...resolveTemporalReadParams(options, defaultTemporalMode),\n    };\n  }\n\n  async function findEdgesFrom(\n    from: NodeRef,\n    target: GraphBackend | TransactionBackend,\n    options?: QueryOptions,\n  ): Promise<Edge<E>[]> {\n    const rows = await target.findEdgesByKind(\n      buildEndpointFindParams(\n        { fromKind: from.kind, fromId: from.id },\n        options,\n      ),\n    );\n    return mapRows(rows);\n  }\n\n  async function findEdgesTo(\n    to: NodeRef,\n    target: GraphBackend | TransactionBackend,\n    options?: QueryOptions,\n  ): Promise<Edge<E>[]> {\n    const rows = await target.findEdgesByKind(\n      buildEndpointFindParams({ toKind: to.kind, toId: to.id }, options),\n    );\n    return mapRows(rows);\n  }\n\n  function buildFindByEndpointsOptions(\n    options?: EdgeFindByEndpointsOptions<E>,\n    temporal?: QueryOptions,\n  ): Readonly<{\n    matchOn?: readonly string[];\n    props?: Record<string, unknown>;\n    excludeDeleted?: boolean;\n    temporalMode?: TemporalMode;\n    asOf?: string;\n  }> {\n    const result: {\n      matchOn?: readonly string[];\n      props?: Record<string, unknown>;\n      excludeDeleted?: boolean;\n      temporalMode?: TemporalMode;\n      asOf?: string;\n    } = { ...resolveTemporalReadParams(temporal, defaultTemporalMode) };\n    if (options?.matchOn !== undefined)\n      result.matchOn = options.matchOn as readonly string[];\n    if (options?.props !== undefined) result.props = options.props;\n    return result;\n  }\n\n  return {\n    async create(\n      from: NodeRef,\n      to: NodeRef,\n      props?: z.input<E[\"schema\"]>,\n      options?: Readonly<{ id?: string; validFrom?: string; validTo?: string }>,\n    ): Promise<Edge<E>> {\n      const result = await executeEdgeCreate(\n        buildCreateEdgeInput(kind, from, to, props ?? {}, options),\n        backend,\n      );\n      return narrowEdge<E>(result);\n    },\n\n    async getById(\n      id: string,\n      options?: QueryOptions,\n    ): Promise<Edge<E> | undefined> {\n      const row = await backend.getEdge(graphId, id);\n      if (!row) return undefined;\n      if (row.kind !== kind) return undefined; // Edge is a different type\n      if (!temporalRowMatcher(options)(row)) return undefined;\n      return narrowEdge<E>(rowToEdge(row));\n    },\n\n    async getByIds(\n      ids: readonly string[],\n      options?: QueryOptions,\n    ): Promise<readonly (Edge<E> | undefined)[]> {\n      if (ids.length === 0) return [];\n\n      // Resolve the coordinate once so the whole batch observes one instant.\n      const matches = temporalRowMatcher(options);\n\n      if (backend.getEdges !== undefined) {\n        const rows = await backend.getEdges(graphId, ids);\n        const rowMap = new Map<string, (typeof rows)[number]>();\n        for (const row of rows) {\n          rowMap.set(row.id, row);\n        }\n        return ids.map((id) => {\n          const row = rowMap.get(id);\n          if (!row) return;\n          if (row.kind !== kind) return;\n          if (!matches(row)) return;\n          return narrowEdge<E>(rowToEdge(row));\n        });\n      }\n\n      return Promise.all(\n        ids.map(async (id) => {\n          const row = await backend.getEdge(graphId, id);\n          if (!row) return;\n          if (row.kind !== kind) return;\n          if (!matches(row)) return;\n          return narrowEdge<E>(rowToEdge(row));\n        }),\n      );\n    },\n\n    async update(\n      id: string,\n      props: Partial<z.input<E[\"schema\"]>>,\n      options?: Readonly<{ validTo?: string }>,\n    ): Promise<Edge<E>> {\n      const result = await executeEdgeUpdate(\n        buildUpdateEdgeInput(id, props, options),\n        backend,\n      );\n      return narrowEdge<E>(result);\n    },\n\n    async findFrom(from: NodeRef, options?: QueryOptions): Promise<Edge<E>[]> {\n      return findEdgesFrom(from, backend, options);\n    },\n\n    async findTo(to: NodeRef, options?: QueryOptions): Promise<Edge<E>[]> {\n      return findEdgesTo(to, backend, options);\n    },\n\n    batchFindFrom(\n      from: NodeRef,\n      options?: QueryOptions,\n    ): BatchableQuery<Edge<E>> {\n      return { executeOn: (target) => findEdgesFrom(from, target, options) };\n    },\n\n    batchFindTo(to: NodeRef, options?: QueryOptions): BatchableQuery<Edge<E>> {\n      return { executeOn: (target) => findEdgesTo(to, target, options) };\n    },\n\n    batchFindByEndpoints(\n      from: NodeRef,\n      to: NodeRef,\n      options?: EdgeFindByEndpointsOptions<E>,\n      temporal?: QueryOptions,\n    ): BatchableQuery<Edge<E>> {\n      return {\n        executeOn: async (target) => {\n          const result = await config.executeFindByEndpoints(\n            kind,\n            from.kind,\n            from.id,\n            to.kind,\n            to.id,\n            target,\n            buildFindByEndpointsOptions(options, temporal),\n          );\n          return result === undefined ? [] : [narrowEdge<E>(result)];\n        },\n      };\n    },\n\n    async delete(id: string): Promise<void> {\n      await executeEdgeDelete(id, backend);\n    },\n\n    async hardDelete(id: string): Promise<void> {\n      await executeEdgeHardDelete(id, backend);\n    },\n\n    async find(\n      filter?: Readonly<{\n        from?: NodeRef;\n        to?: NodeRef;\n        limit?: number;\n        offset?: number;\n      }>,\n      temporal?: QueryOptions,\n    ): Promise<Edge<E>[]> {\n      const untypedFilter = filter as Readonly<{ where?: unknown }> | undefined;\n      if (untypedFilter?.where !== undefined) {\n        throw new UnsupportedPredicateError(\n          `store.edges.${kind}.find({ where }) is not supported. ` +\n            `Use store.query().traverse(...).whereEdge(...) for edge property filters.`,\n          { kind, operation: \"find\" },\n        );\n      }\n\n      const params: {\n        graphId: string;\n        kind: string;\n        fromKind?: string;\n        fromId?: string;\n        toKind?: string;\n        toId?: string;\n        limit?: number;\n        offset?: number;\n      } & TemporalReadParams = {\n        graphId,\n        kind,\n        ...resolveTemporalReadParams(temporal, defaultTemporalMode),\n      };\n      if (filter?.from?.kind !== undefined) params.fromKind = filter.from.kind;\n      if (filter?.from?.id !== undefined) params.fromId = filter.from.id;\n      if (filter?.to?.kind !== undefined) params.toKind = filter.to.kind;\n      if (filter?.to?.id !== undefined) params.toId = filter.to.id;\n      if (filter?.limit !== undefined) params.limit = filter.limit;\n      if (filter?.offset !== undefined) params.offset = filter.offset;\n\n      const rows = await backend.findEdgesByKind(params);\n      return mapRows(rows);\n    },\n\n    async count(\n      filter?: Readonly<{\n        from?: NodeRef;\n        to?: NodeRef;\n      }>,\n      temporal?: QueryOptions,\n    ): Promise<number> {\n      const params: {\n        graphId: string;\n        kind: string;\n        fromKind?: string;\n        fromId?: string;\n        toKind?: string;\n        toId?: string;\n      } & TemporalReadParams = {\n        graphId,\n        kind,\n        ...resolveTemporalReadParams(temporal, defaultTemporalMode),\n      };\n      if (filter?.from?.kind !== undefined) params.fromKind = filter.from.kind;\n      if (filter?.from?.id !== undefined) params.fromId = filter.from.id;\n      if (filter?.to?.kind !== undefined) params.toKind = filter.to.kind;\n      if (filter?.to?.id !== undefined) params.toId = filter.to.id;\n\n      return backend.countEdgesByKind(params);\n    },\n\n    async bulkCreate(\n      items: readonly Readonly<{\n        from: NodeRef;\n        to: NodeRef;\n        props?: z.input<E[\"schema\"]>;\n        id?: string;\n        validFrom?: string;\n        validTo?: string;\n      }>[],\n    ): Promise<Edge<E>[]> {\n      const batchInputs = mapBulkEdgeInputs(kind, items);\n\n      if (backend.capabilities.transactions && \"transaction\" in backend) {\n        const results = await backend.transaction(async (txBackend) =>\n          executeEdgeCreateBatch(batchInputs, txBackend),\n        );\n        return narrowEdges<E>(results);\n      }\n      const results = await executeEdgeCreateBatch(batchInputs, backend);\n      return narrowEdges<E>(results);\n    },\n\n    async bulkUpsertById(\n      items: readonly Readonly<{\n        id: string;\n        from: NodeRef;\n        to: NodeRef;\n        props?: z.input<E[\"schema\"]>;\n        validFrom?: string;\n        validTo?: string;\n      }>[],\n    ): Promise<Edge<E>[]> {\n      if (items.length === 0) return [];\n\n      const upsertAll = async (\n        target: GraphBackend | TransactionBackend,\n      ): Promise<Edge<E>[]> => {\n        const ids = items.map((item) => item.id);\n        const existingMap = new Map<\n          string,\n          { deleted_at: string | undefined }\n        >();\n\n        if (target.getEdges === undefined) {\n          const rows = await Promise.all(\n            ids.map((id) => target.getEdge(graphId, id)),\n          );\n          for (const row of rows) {\n            if (row !== undefined) existingMap.set(row.id, row);\n          }\n        } else {\n          const rows = await target.getEdges(graphId, ids);\n          for (const row of rows) {\n            existingMap.set(row.id, row);\n          }\n        }\n\n        // Bucket items into creates and updates\n        const toCreate: { index: number; input: CreateEdgeInput }[] = [];\n        const toUpdate: {\n          index: number;\n          input: EdgeUpdateInput;\n          clearDeleted: boolean;\n        }[] = [];\n\n        let itemIndex = 0;\n        for (const item of items) {\n          const existing = existingMap.get(item.id);\n\n          if (existing) {\n            toUpdate.push({\n              index: itemIndex,\n              input: buildUpdateEdgeInput(item.id, item.props ?? {}, item),\n              clearDeleted: existing.deleted_at !== undefined,\n            });\n          } else {\n            toCreate.push({\n              index: itemIndex,\n              input: buildCreateEdgeInput(\n                kind,\n                item.from,\n                item.to,\n                item.props ?? {},\n                item,\n              ),\n            });\n          }\n          itemIndex++;\n        }\n\n        // Hookless batch create\n        const results: Edge<E>[] = Array.from({ length: items.length });\n\n        if (toCreate.length > 0) {\n          const createInputs = toCreate.map((entry) => entry.input);\n          const created = await executeEdgeCreateBatch(createInputs, target);\n          for (const [index, entry] of toCreate.entries()) {\n            results[entry.index] = narrowEdge<E>(created[index]!);\n          }\n        }\n\n        // Hookless individual updates (executeEdgeUpsertUpdate is already hookless)\n        for (const entry of toUpdate) {\n          const result = await executeEdgeUpsertUpdate(entry.input, target, {\n            clearDeleted: entry.clearDeleted,\n          });\n          results[entry.index] = narrowEdge<E>(result);\n        }\n\n        return results;\n      };\n\n      if (backend.capabilities.transactions && \"transaction\" in backend) {\n        return backend.transaction(async (txBackend) => upsertAll(txBackend));\n      }\n      return upsertAll(backend);\n    },\n\n    async bulkInsert(\n      items: readonly Readonly<{\n        from: NodeRef;\n        to: NodeRef;\n        props?: z.input<E[\"schema\"]>;\n        id?: string;\n        validFrom?: string;\n        validTo?: string;\n      }>[],\n    ): Promise<void> {\n      const batchInputs = mapBulkEdgeInputs(kind, items);\n\n      if (backend.capabilities.transactions && \"transaction\" in backend) {\n        await backend.transaction(async (txBackend) => {\n          await executeEdgeCreateNoReturnBatch(batchInputs, txBackend);\n        });\n        return;\n      }\n\n      await executeEdgeCreateNoReturnBatch(batchInputs, backend);\n    },\n\n    async bulkDelete(ids: readonly string[]): Promise<void> {\n      if (ids.length === 0) return;\n      const deleteAll = async (\n        target: GraphBackend | TransactionBackend,\n      ): Promise<void> => {\n        for (const id of ids) {\n          await executeEdgeDelete(id, target);\n        }\n      };\n      if (backend.capabilities.transactions && \"transaction\" in backend) {\n        await backend.transaction(async (txBackend) => deleteAll(txBackend));\n        return;\n      }\n      await deleteAll(backend);\n    },\n\n    async findByEndpoints(\n      from: NodeRef,\n      to: NodeRef,\n      options?: EdgeFindByEndpointsOptions<E>,\n      temporal?: QueryOptions,\n    ): Promise<Edge<E> | undefined> {\n      const result = await config.executeFindByEndpoints(\n        kind,\n        from.kind,\n        from.id,\n        to.kind,\n        to.id,\n        backend,\n        buildFindByEndpointsOptions(options, temporal),\n      );\n      return result === undefined ? undefined : narrowEdge<E>(result);\n    },\n\n    async getOrCreateByEndpoints(\n      from: NodeRef,\n      to: NodeRef,\n      props: z.input<E[\"schema\"]>,\n      options?: EdgeGetOrCreateByEndpointsOptions<E>,\n    ): Promise<EdgeGetOrCreateByEndpointsResult<E>> {\n      const getOrCreateOptions: {\n        matchOn?: readonly string[];\n        ifExists?: IfExistsMode;\n      } = {};\n      if (options?.matchOn !== undefined)\n        getOrCreateOptions.matchOn = options.matchOn as readonly string[];\n      if (options?.ifExists !== undefined)\n        getOrCreateOptions.ifExists = options.ifExists;\n\n      const result = await config.executeGetOrCreateByEndpoints(\n        kind,\n        from.kind,\n        from.id,\n        to.kind,\n        to.id,\n        props,\n        backend,\n        getOrCreateOptions,\n      );\n      return { edge: narrowEdge<E>(result.edge), action: result.action };\n    },\n\n    async bulkGetOrCreateByEndpoints(\n      items: readonly Readonly<{\n        from: NodeRef;\n        to: NodeRef;\n        props: z.input<E[\"schema\"]>;\n      }>[],\n      options?: EdgeGetOrCreateByEndpointsOptions<E>,\n    ): Promise<EdgeGetOrCreateByEndpointsResult<E>[]> {\n      if (items.length === 0) return [];\n\n      const mappedItems = items.map((item) => ({\n        fromKind: item.from.kind,\n        fromId: item.from.id,\n        toKind: item.to.kind,\n        toId: item.to.id,\n        props: item.props,\n      }));\n\n      const getOrCreateOptions: {\n        matchOn?: readonly string[];\n        ifExists?: IfExistsMode;\n      } = {};\n      if (options?.matchOn !== undefined)\n        getOrCreateOptions.matchOn = options.matchOn as readonly string[];\n      if (options?.ifExists !== undefined)\n        getOrCreateOptions.ifExists = options.ifExists;\n\n      const getOrCreateAll = async (\n        target: GraphBackend | TransactionBackend,\n      ): Promise<EdgeGetOrCreateByEndpointsResult<E>[]> => {\n        const results = await config.executeBulkGetOrCreateByEndpoints(\n          kind,\n          mappedItems,\n          target,\n          getOrCreateOptions,\n        );\n        return results.map((result) => ({\n          edge: narrowEdge<E>(result.edge),\n          action: result.action,\n        }));\n      };\n\n      if (backend.capabilities.transactions && \"transaction\" in backend) {\n        return backend.transaction(async (txBackend) =>\n          getOrCreateAll(txBackend),\n        );\n      }\n      return getOrCreateAll(backend);\n    },\n  };\n}\n","/**\n * Shared node-row fetching.\n *\n * Both collection reads (`getByIds`) and declared-index lookup hydration need\n * to fetch many node rows by id, preferring the backend's batch `getNodes`\n * and falling back to parallel `getNode` calls. Centralizing the fetch\n * mechanics keeps the two paths from drifting; each caller layers its own\n * filtering (temporal mode vs. live-only) on top.\n */\nimport {\n  type GraphBackend,\n  type NodeRow as BackendNodeRow,\n  type TransactionBackend,\n} from \"../backend/types\";\n\n/**\n * Fetches node rows by id into a Map keyed by id. Uses `backend.getNodes`\n * when available, otherwise issues parallel `getNode` calls for the distinct\n * ids. Missing ids are simply absent from the returned Map.\n */\nexport async function getNodeRowsByIds(\n  backend: GraphBackend | TransactionBackend,\n  graphId: string,\n  kind: string,\n  ids: readonly string[],\n): Promise<Map<string, BackendNodeRow>> {\n  const rowsById = new Map<string, BackendNodeRow>();\n  if (ids.length === 0) return rowsById;\n\n  if (backend.getNodes !== undefined) {\n    const rows = await backend.getNodes(graphId, kind, ids);\n    for (const row of rows) {\n      rowsById.set(row.id, row);\n    }\n    return rowsById;\n  }\n\n  const uniqueIds = [...new Set(ids)];\n  const rows = await Promise.all(\n    uniqueIds.map((id) => backend.getNode(graphId, kind, id)),\n  );\n  for (const row of rows) {\n    if (row !== undefined) rowsById.set(row.id, row);\n  }\n  return rowsById;\n}\n","/**\n * NodeCollection implementation.\n *\n * Provides an ergonomic API for CRUD operations on a specific node type.\n */\nimport { type z } from \"zod\";\n\nimport {\n  type GraphBackend,\n  type TransactionBackend,\n} from \"../../backend/types\";\nimport { type GraphDef } from \"../../core/define-graph\";\nimport {\n  type NodeId,\n  type NodeType,\n  type TemporalMode,\n} from \"../../core/types\";\nimport { ConfigurationError } from \"../../errors\";\nimport { type QueryBuilder } from \"../../query/builder\";\nimport { getNodeRowsByIds } from \"../node-fetch\";\nimport { type NodeRow } from \"../row-mappers\";\nimport {\n  type CreateNodeInput,\n  type GetOrCreateAction,\n  type Node,\n  type NodeBulkFindByIndexOptions,\n  type NodeCollection,\n  type NodeGetOrCreateByConstraintOptions,\n  type NodeGetOrCreateByConstraintResult,\n  type QueryOptions,\n  type UpdateNodeInput,\n} from \"../types\";\nimport {\n  resolveTemporalReadParams,\n  type TemporalReadParams,\n} from \"./temporal-read-params\";\n\n/**\n * Narrows unparameterized Node to Node<N>.\n * Safe: props are validated by Zod at creation/update boundaries.\n */\nfunction narrowNode<N extends NodeType>(node: Node): Node<N> {\n  return node as Node<N>;\n}\n\n/**\n * Narrows a readonly Node array to Node<N>[].\n */\nfunction narrowNodes<N extends NodeType>(nodes: readonly Node[]): Node<N>[] {\n  return nodes as Node<N>[];\n}\n\n/**\n * Config for creating a NodeCollection.\n */\nexport type NodeCollectionConfig = Readonly<{\n  graphId: string;\n  kind: string;\n  backend: GraphBackend | TransactionBackend;\n  defaultTemporalMode: TemporalMode;\n  rowToNode: (row: NodeRow) => Node;\n  executeCreate: (\n    input: CreateNodeInput,\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<Node>;\n  executeCreateNoReturnBatch: (\n    inputs: readonly CreateNodeInput[],\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<void>;\n  executeCreateBatch: (\n    inputs: readonly CreateNodeInput[],\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<readonly Node[]>;\n  executeUpdate: (\n    input: UpdateNodeInput,\n    backend: GraphBackend | TransactionBackend,\n    options?: Readonly<{ clearDeleted?: boolean }>,\n  ) => Promise<Node>;\n  executeUpsertUpdate: (\n    input: UpdateNodeInput,\n    backend: GraphBackend | TransactionBackend,\n    options?: Readonly<{ clearDeleted?: boolean }>,\n  ) => Promise<Node>;\n  executeDelete: (\n    kind: string,\n    id: string,\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<void>;\n  executeHardDelete: (\n    kind: string,\n    id: string,\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<void>;\n  temporalRowMatcher: (options?: QueryOptions) => (row: NodeRow) => boolean;\n  createQuery?: () => QueryBuilder<GraphDef>;\n  executeGetOrCreateByConstraint: (\n    kind: string,\n    constraintName: string,\n    props: Record<string, unknown>,\n    backend: GraphBackend | TransactionBackend,\n    options?: NodeGetOrCreateByConstraintOptions,\n  ) => Promise<Readonly<{ node: Node; action: GetOrCreateAction }>>;\n  executeBulkGetOrCreateByConstraint: (\n    kind: string,\n    constraintName: string,\n    items: readonly Readonly<{ props: Record<string, unknown> }>[],\n    backend: GraphBackend | TransactionBackend,\n    options?: NodeGetOrCreateByConstraintOptions,\n  ) => Promise<Readonly<{ node: Node; action: GetOrCreateAction }>[]>;\n  executeFindByConstraint: (\n    kind: string,\n    constraintName: string,\n    props: Record<string, unknown>,\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<Node | undefined>;\n  executeBulkFindByConstraint: (\n    kind: string,\n    constraintName: string,\n    items: readonly Readonly<{ props: Record<string, unknown> }>[],\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<(Node | undefined)[]>;\n  executeBulkFindByIndex: (\n    kind: string,\n    indexName: string,\n    items: readonly Readonly<{ props: Record<string, unknown> }>[],\n    backend: GraphBackend | TransactionBackend,\n    options?: NodeBulkFindByIndexOptions,\n  ) => Promise<Node[][]>;\n}>;\n\nfunction buildCreateInput(\n  kind: string,\n  props: Record<string, unknown>,\n  options?: Readonly<{ id?: string; validFrom?: string; validTo?: string }>,\n): CreateNodeInput {\n  const input: {\n    kind: string;\n    id?: string;\n    props: Record<string, unknown>;\n    validFrom?: string;\n    validTo?: string;\n  } = { kind, props };\n  if (options?.id !== undefined) input.id = options.id;\n  if (options?.validFrom !== undefined) input.validFrom = options.validFrom;\n  if (options?.validTo !== undefined) input.validTo = options.validTo;\n  return input;\n}\n\nfunction buildUpdateInput(\n  kind: string,\n  id: string,\n  props: Record<string, unknown>,\n  options?: Readonly<{ validTo?: string }>,\n): UpdateNodeInput {\n  const input: {\n    kind: string;\n    id: string;\n    props: Partial<Record<string, unknown>>;\n    validTo?: string;\n  } = { kind, id, props };\n  if (options?.validTo !== undefined) input.validTo = options.validTo;\n  return input as UpdateNodeInput;\n}\n\nfunction mapBulkNodeInputs(\n  kind: string,\n  items: readonly Readonly<{\n    props: Record<string, unknown>;\n    id?: string;\n    validFrom?: string;\n    validTo?: string;\n  }>[],\n): CreateNodeInput[] {\n  return items.map((item) => buildCreateInput(kind, item.props, item));\n}\n\n/**\n * Creates a NodeCollection for a specific node type.\n */\nexport function createNodeCollection<\n  G extends GraphDef,\n  K extends keyof G[\"nodes\"] & string,\n>(config: NodeCollectionConfig): NodeCollection<G[\"nodes\"][K][\"type\"]> {\n  type N = G[\"nodes\"][K][\"type\"];\n\n  const {\n    graphId,\n    kind,\n    backend,\n    defaultTemporalMode,\n    rowToNode,\n    executeCreate: executeNodeCreate,\n    executeCreateNoReturnBatch: executeNodeCreateNoReturnBatch,\n    executeCreateBatch: executeNodeCreateBatch,\n    executeUpdate: executeNodeUpdate,\n    executeUpsertUpdate: executeNodeUpsertUpdate,\n    executeDelete: executeNodeDelete,\n    executeHardDelete: executeNodeHardDelete,\n    temporalRowMatcher,\n    createQuery,\n    executeGetOrCreateByConstraint,\n    executeBulkGetOrCreateByConstraint,\n    executeFindByConstraint,\n    executeBulkFindByConstraint,\n    executeBulkFindByIndex,\n  } = config;\n\n  return {\n    async create(\n      props: z.input<N[\"schema\"]>,\n      options?: Readonly<{ id?: string; validFrom?: string; validTo?: string }>,\n    ): Promise<Node<N>> {\n      return this.createFromRecord(props, options);\n    },\n\n    async createFromRecord(\n      data: Record<string, unknown>,\n      options?: Readonly<{ id?: string; validFrom?: string; validTo?: string }>,\n    ): Promise<Node<N>> {\n      const result = await executeNodeCreate(\n        buildCreateInput(kind, data, options),\n        backend,\n      );\n      return narrowNode<N>(result);\n    },\n\n    async getById(\n      id: NodeId<N>,\n      options?: QueryOptions,\n    ): Promise<Node<N> | undefined> {\n      const row = await backend.getNode(graphId, kind, id);\n      if (!row) return undefined;\n      if (!temporalRowMatcher(options)(row)) return undefined;\n      return narrowNode<N>(rowToNode(row));\n    },\n\n    async getByIds(\n      ids: readonly NodeId<N>[],\n      options?: QueryOptions,\n    ): Promise<readonly (Node<N> | undefined)[]> {\n      if (ids.length === 0) return [];\n\n      const rowsById = await getNodeRowsByIds(backend, graphId, kind, ids);\n      // Resolve the coordinate once so the whole batch observes one instant.\n      const matches = temporalRowMatcher(options);\n      return ids.map((id) => {\n        const row = rowsById.get(id);\n        if (!row) return;\n        if (!matches(row)) return;\n        return narrowNode<N>(rowToNode(row));\n      });\n    },\n\n    async update(\n      id: NodeId<N>,\n      props: Partial<z.input<N[\"schema\"]>>,\n      options?: Readonly<{ validTo?: string }>,\n    ): Promise<Node<N>> {\n      const result = await executeNodeUpdate(\n        buildUpdateInput(kind, id, props, options),\n        backend,\n      );\n      return narrowNode<N>(result);\n    },\n\n    async delete(id: NodeId<N>): Promise<void> {\n      await executeNodeDelete(kind, id, backend);\n    },\n\n    async hardDelete(id: NodeId<N>): Promise<void> {\n      await executeNodeHardDelete(kind, id, backend);\n    },\n\n    async find(\n      filter?: Readonly<{\n        where?: (accessor: never) => unknown;\n        limit?: number;\n        offset?: number;\n      }>,\n      temporal?: QueryOptions,\n    ): Promise<Node<N>[]> {\n      if (filter?.where !== undefined && createQuery === undefined) {\n        throw new ConfigurationError(\n          `store.nodes.${kind}.find({ where }) requires a query-capable store`,\n          { kind, operation: \"find\" },\n        );\n      }\n      if (filter?.where !== undefined && createQuery !== undefined) {\n        // Resolve the coordinate through the same helper as the non-where\n        // branch and count(), so find({ where }) and find(filter) observe\n        // identical rows. `current` / `asOf` both resolve to a concrete instant\n        // the backend find path compares against; pin the query to that same\n        // instant — `current` would otherwise compile against the DB clock and\n        // ignore the resolved asOf. includeEnded / includeTombstones carry no\n        // instant. Routing through resolveTemporalReadParams also makes a\n        // missing asOf in asOf mode throw here, matching the non-where branch.\n        const { temporalMode, asOf } = resolveTemporalReadParams(\n          temporal,\n          defaultTemporalMode,\n        );\n        let query = createQuery()\n          .from(kind, \"_n\")\n          .temporal(asOf === undefined ? temporalMode : \"asOf\", asOf)\n          .whereNode(\"_n\", filter.where as never)\n          .select((ctx: Record<string, unknown>) => ctx._n);\n        if (filter.limit !== undefined) query = query.limit(filter.limit);\n        if (filter.offset !== undefined) query = query.offset(filter.offset);\n        const results = await query.execute();\n        return results as Node<N>[];\n      }\n\n      const params: {\n        graphId: string;\n        kind: string;\n        limit?: number;\n        offset?: number;\n      } & TemporalReadParams = {\n        graphId,\n        kind,\n        ...resolveTemporalReadParams(temporal, defaultTemporalMode),\n      };\n      if (filter?.limit !== undefined) params.limit = filter.limit;\n      if (filter?.offset !== undefined) params.offset = filter.offset;\n\n      const rows = await backend.findNodesByKind(params);\n      return rows.map((row) => narrowNode<N>(rowToNode(row)));\n    },\n\n    async count(temporal?: QueryOptions): Promise<number> {\n      const params: {\n        graphId: string;\n        kind: string;\n      } & TemporalReadParams = {\n        graphId,\n        kind,\n        ...resolveTemporalReadParams(temporal, defaultTemporalMode),\n      };\n      return backend.countNodesByKind(params);\n    },\n\n    async upsertById(\n      id: string,\n      props: z.input<N[\"schema\"]>,\n      options?: Readonly<{ validFrom?: string; validTo?: string }>,\n    ): Promise<Node<N>> {\n      return this.upsertByIdFromRecord(id, props, options);\n    },\n\n    async upsertByIdFromRecord(\n      id: string,\n      data: Record<string, unknown>,\n      options?: Readonly<{ validFrom?: string; validTo?: string }>,\n    ): Promise<Node<N>> {\n      const existing = await backend.getNode(graphId, kind, id);\n\n      if (existing) {\n        const clearDeleted = existing.deleted_at !== undefined;\n        const result = await executeNodeUpdate(\n          buildUpdateInput(kind, id, data, options),\n          backend,\n          { clearDeleted },\n        );\n        return narrowNode<N>(result);\n      }\n\n      const result = await executeNodeCreate(\n        buildCreateInput(kind, data, { ...options, id }),\n        backend,\n      );\n      return narrowNode<N>(result);\n    },\n\n    async bulkCreate(\n      items: readonly Readonly<{\n        props: z.input<N[\"schema\"]>;\n        id?: string;\n        validFrom?: string;\n        validTo?: string;\n      }>[],\n    ): Promise<Node<N>[]> {\n      const batchInputs = mapBulkNodeInputs(kind, items);\n\n      if (backend.capabilities.transactions && \"transaction\" in backend) {\n        const results = await backend.transaction(async (txBackend) =>\n          executeNodeCreateBatch(batchInputs, txBackend),\n        );\n        return narrowNodes<N>(results);\n      }\n      const results = await executeNodeCreateBatch(batchInputs, backend);\n      return narrowNodes<N>(results);\n    },\n\n    async bulkUpsertById(\n      items: readonly Readonly<{\n        id: string;\n        props: z.input<N[\"schema\"]>;\n        validFrom?: string;\n        validTo?: string;\n      }>[],\n    ): Promise<Node<N>[]> {\n      if (items.length === 0) return [];\n\n      const upsertAll = async (\n        target: GraphBackend | TransactionBackend,\n      ): Promise<Node<N>[]> => {\n        const ids = items.map((item) => item.id);\n        const existingMap = new Map<\n          string,\n          {\n            deleted_at: string | undefined;\n          }\n        >();\n\n        if (target.getNodes === undefined) {\n          const rows = await Promise.all(\n            ids.map((id) => target.getNode(graphId, kind, id)),\n          );\n          for (const row of rows) {\n            if (row !== undefined) existingMap.set(row.id, row);\n          }\n        } else {\n          const rows = await target.getNodes(graphId, kind, ids);\n          for (const row of rows) {\n            existingMap.set(row.id, row);\n          }\n        }\n\n        // Bucket items into creates and updates\n        const toCreate: { index: number; input: CreateNodeInput }[] = [];\n        const toUpdate: {\n          index: number;\n          input: UpdateNodeInput;\n          clearDeleted: boolean;\n        }[] = [];\n\n        let itemIndex = 0;\n        for (const item of items) {\n          const existing = existingMap.get(item.id);\n\n          if (existing) {\n            toUpdate.push({\n              index: itemIndex,\n              input: buildUpdateInput(kind, item.id, item.props, item),\n              clearDeleted: existing.deleted_at !== undefined,\n            });\n          } else {\n            toCreate.push({\n              index: itemIndex,\n              input: buildCreateInput(kind, item.props, item),\n            });\n          }\n          itemIndex++;\n        }\n\n        // Hookless batch create\n        const results: Node<N>[] = Array.from({ length: items.length });\n\n        if (toCreate.length > 0) {\n          const createInputs = toCreate.map((entry) => entry.input);\n          const created = await executeNodeCreateBatch(createInputs, target);\n          for (const [index, entry] of toCreate.entries()) {\n            results[entry.index] = narrowNode<N>(created[index]!);\n          }\n        }\n\n        // Hookless individual updates\n        for (const entry of toUpdate) {\n          const result = await executeNodeUpsertUpdate(entry.input, target, {\n            clearDeleted: entry.clearDeleted,\n          });\n          results[entry.index] = narrowNode<N>(result);\n        }\n\n        return results;\n      };\n\n      if (backend.capabilities.transactions && \"transaction\" in backend) {\n        return backend.transaction(async (txBackend) => upsertAll(txBackend));\n      }\n      return upsertAll(backend);\n    },\n\n    async bulkInsert(\n      items: readonly Readonly<{\n        props: z.input<N[\"schema\"]>;\n        id?: string;\n        validFrom?: string;\n        validTo?: string;\n      }>[],\n    ): Promise<void> {\n      const batchInputs = mapBulkNodeInputs(kind, items);\n\n      if (backend.capabilities.transactions && \"transaction\" in backend) {\n        await backend.transaction(async (txBackend) => {\n          await executeNodeCreateNoReturnBatch(batchInputs, txBackend);\n        });\n        return;\n      }\n\n      await executeNodeCreateNoReturnBatch(batchInputs, backend);\n    },\n\n    async bulkDelete(ids: readonly NodeId<N>[]): Promise<void> {\n      if (ids.length === 0) return;\n      const deleteAll = async (\n        target: GraphBackend | TransactionBackend,\n      ): Promise<void> => {\n        for (const id of ids) {\n          await executeNodeDelete(kind, id, target);\n        }\n      };\n      if (backend.capabilities.transactions && \"transaction\" in backend) {\n        await backend.transaction(async (txBackend) => deleteAll(txBackend));\n        return;\n      }\n      await deleteAll(backend);\n    },\n\n    async findByConstraint(\n      constraintName: string,\n      props: z.input<N[\"schema\"]>,\n    ): Promise<Node<N> | undefined> {\n      const result = await executeFindByConstraint(\n        kind,\n        constraintName,\n        props,\n        backend,\n      );\n      return result === undefined ? undefined : narrowNode<N>(result);\n    },\n\n    async bulkFindByConstraint(\n      constraintName: string,\n      items: readonly Readonly<{\n        props: z.input<N[\"schema\"]>;\n      }>[],\n    ): Promise<(Node<N> | undefined)[]> {\n      if (items.length === 0) return [];\n\n      const mappedItems = items.map((item) => ({\n        props: item.props,\n      }));\n\n      const results = await executeBulkFindByConstraint(\n        kind,\n        constraintName,\n        mappedItems,\n        backend,\n      );\n      return results.map((result) =>\n        result === undefined ? undefined : narrowNode<N>(result),\n      );\n    },\n\n    async bulkFindByIndex(\n      indexName: string,\n      items: readonly Readonly<{\n        props: Partial<z.input<N[\"schema\"]>>;\n      }>[],\n      options?: NodeBulkFindByIndexOptions,\n    ): Promise<readonly Node<N>[][]> {\n      if (items.length === 0) return [];\n\n      const mappedItems = items.map((item) => ({\n        props: item.props,\n      }));\n\n      const results = await executeBulkFindByIndex(\n        kind,\n        indexName,\n        mappedItems,\n        backend,\n        options,\n      );\n      return results.map((bucket) => narrowNodes<N>(bucket));\n    },\n\n    async getOrCreateByConstraint(\n      constraintName: string,\n      props: z.input<N[\"schema\"]>,\n      options?: NodeGetOrCreateByConstraintOptions,\n    ): Promise<NodeGetOrCreateByConstraintResult<N>> {\n      const execute = async (\n        target: GraphBackend | TransactionBackend,\n      ): Promise<NodeGetOrCreateByConstraintResult<N>> => {\n        const result = await executeGetOrCreateByConstraint(\n          kind,\n          constraintName,\n          props,\n          target,\n          options,\n        );\n        return result as NodeGetOrCreateByConstraintResult<N>;\n      };\n\n      if (backend.capabilities.transactions && \"transaction\" in backend) {\n        return backend.transaction(async (txBackend) => execute(txBackend));\n      }\n      return execute(backend);\n    },\n\n    async bulkGetOrCreateByConstraint(\n      constraintName: string,\n      items: readonly Readonly<{\n        props: z.input<N[\"schema\"]>;\n      }>[],\n      options?: NodeGetOrCreateByConstraintOptions,\n    ): Promise<NodeGetOrCreateByConstraintResult<N>[]> {\n      if (items.length === 0) return [];\n\n      const mappedItems = items.map((item) => ({\n        props: item.props,\n      }));\n\n      const getOrCreateAll = async (\n        target: GraphBackend | TransactionBackend,\n      ): Promise<NodeGetOrCreateByConstraintResult<N>[]> => {\n        const results = await executeBulkGetOrCreateByConstraint(\n          kind,\n          constraintName,\n          mappedItems,\n          target,\n          options,\n        );\n        return results as NodeGetOrCreateByConstraintResult<N>[];\n      };\n\n      if (backend.capabilities.transactions && \"transaction\" in backend) {\n        return backend.transaction(async (txBackend) =>\n          getOrCreateAll(txBackend),\n        );\n      }\n      return getOrCreateAll(backend);\n    },\n  };\n}\n","/**\n * Collection Factory for Store\n *\n * Creates typed node and edge collection proxies for both\n * Store and TransactionContext to reduce code duplication.\n */\nimport { type GraphBackend, type TransactionBackend } from \"../backend/types\";\nimport { type GraphDef } from \"../core/define-graph\";\nimport { type TemporalMode } from \"../core/types\";\nimport { KindNotFoundError } from \"../errors\";\nimport { type QueryBuilder } from \"../query/builder\";\nimport { type KindRegistry } from \"../registry/kind-registry\";\nimport { createEdgeCollection, createNodeCollection } from \"./collections\";\nimport { type EdgeRow, type NodeRow } from \"./row-mappers\";\nimport {\n  type CreateEdgeInput,\n  type CreateNodeInput,\n  type Edge,\n  type GetOrCreateAction,\n  type GraphEdgeCollections,\n  type GraphNodeCollections,\n  type IfExistsMode,\n  type Node,\n  type NodeBulkFindByIndexOptions,\n  type NodeGetOrCreateByConstraintOptions,\n  type QueryOptions,\n  type UpdateNodeInput,\n} from \"./types\";\n\n/**\n * Operation functions passed to collections.\n */\nexport type NodeOperations = Readonly<{\n  defaultTemporalMode: TemporalMode;\n  rowToNode: (row: NodeRow) => Node;\n  executeCreate: (\n    input: CreateNodeInput,\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<Node>;\n  executeCreateBatch: (\n    inputs: readonly CreateNodeInput[],\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<readonly Node[]>;\n  executeCreateNoReturnBatch: (\n    inputs: readonly CreateNodeInput[],\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<void>;\n  executeUpdate: (\n    input: UpdateNodeInput,\n    backend: GraphBackend | TransactionBackend,\n    options?: Readonly<{ clearDeleted?: boolean }>,\n  ) => Promise<Node>;\n  executeUpsertUpdate: (\n    input: UpdateNodeInput,\n    backend: GraphBackend | TransactionBackend,\n    options?: Readonly<{ clearDeleted?: boolean }>,\n  ) => Promise<Node>;\n  executeDelete: (\n    kind: string,\n    id: string,\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<void>;\n  executeHardDelete: (\n    kind: string,\n    id: string,\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<void>;\n  temporalRowMatcher: (options?: QueryOptions) => (row: NodeRow) => boolean;\n  createQuery?: () => QueryBuilder<GraphDef>;\n  executeGetOrCreateByConstraint: (\n    kind: string,\n    constraintName: string,\n    props: Record<string, unknown>,\n    backend: GraphBackend | TransactionBackend,\n    options?: NodeGetOrCreateByConstraintOptions,\n  ) => Promise<Readonly<{ node: Node; action: GetOrCreateAction }>>;\n  executeBulkGetOrCreateByConstraint: (\n    kind: string,\n    constraintName: string,\n    items: readonly Readonly<{ props: Record<string, unknown> }>[],\n    backend: GraphBackend | TransactionBackend,\n    options?: NodeGetOrCreateByConstraintOptions,\n  ) => Promise<Readonly<{ node: Node; action: GetOrCreateAction }>[]>;\n  executeFindByConstraint: (\n    kind: string,\n    constraintName: string,\n    props: Record<string, unknown>,\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<Node | undefined>;\n  executeBulkFindByConstraint: (\n    kind: string,\n    constraintName: string,\n    items: readonly Readonly<{ props: Record<string, unknown> }>[],\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<(Node | undefined)[]>;\n  executeBulkFindByIndex: (\n    kind: string,\n    indexName: string,\n    items: readonly Readonly<{ props: Record<string, unknown> }>[],\n    backend: GraphBackend | TransactionBackend,\n    options?: NodeBulkFindByIndexOptions,\n  ) => Promise<Node[][]>;\n}>;\n\nexport type EdgeOperations = Readonly<{\n  defaultTemporalMode: TemporalMode;\n  rowToEdge: (row: EdgeRow) => Edge;\n  executeCreate: (\n    input: CreateEdgeInput,\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<Edge>;\n  executeCreateBatch: (\n    inputs: readonly CreateEdgeInput[],\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<readonly Edge[]>;\n  executeCreateNoReturnBatch: (\n    inputs: readonly CreateEdgeInput[],\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<void>;\n  executeUpdate: (\n    input: {\n      id: string;\n      props: Partial<Record<string, unknown>>;\n      validTo?: string;\n    },\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<Edge>;\n  executeUpsertUpdate: (\n    input: {\n      id: string;\n      props: Partial<Record<string, unknown>>;\n      validTo?: string;\n    },\n    backend: GraphBackend | TransactionBackend,\n    options?: Readonly<{ clearDeleted?: boolean }>,\n  ) => Promise<Edge>;\n  executeDelete: (\n    id: string,\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<void>;\n  executeHardDelete: (\n    id: string,\n    backend: GraphBackend | TransactionBackend,\n  ) => Promise<void>;\n  temporalRowMatcher: (options?: QueryOptions) => (row: EdgeRow) => boolean;\n  createQuery?: () => QueryBuilder<GraphDef>;\n  executeGetOrCreateByEndpoints: (\n    kind: string,\n    fromKind: string,\n    fromId: string,\n    toKind: string,\n    toId: string,\n    props: Record<string, unknown>,\n    backend: GraphBackend | TransactionBackend,\n    options?: Readonly<{\n      matchOn?: readonly string[];\n      ifExists?: IfExistsMode;\n    }>,\n  ) => Promise<Readonly<{ edge: Edge; action: GetOrCreateAction }>>;\n  executeBulkGetOrCreateByEndpoints: (\n    kind: string,\n    items: readonly Readonly<{\n      fromKind: string;\n      fromId: string;\n      toKind: string;\n      toId: string;\n      props: Record<string, unknown>;\n    }>[],\n    backend: GraphBackend | TransactionBackend,\n    options?: Readonly<{\n      matchOn?: readonly string[];\n      ifExists?: IfExistsMode;\n    }>,\n  ) => Promise<Readonly<{ edge: Edge; action: GetOrCreateAction }>[]>;\n  executeFindByEndpoints: (\n    kind: string,\n    fromKind: string,\n    fromId: string,\n    toKind: string,\n    toId: string,\n    backend: GraphBackend | TransactionBackend,\n    options?: Readonly<{\n      matchOn?: readonly string[];\n      props?: Record<string, unknown>;\n    }>,\n  ) => Promise<Edge | undefined>;\n}>;\n\n/**\n * Creates a typed node collections proxy.\n *\n * The proxy dynamically creates NodeCollection instances for each node kind\n * when accessed.\n */\nexport function createNodeCollectionsProxy<G extends GraphDef>(\n  graph: G,\n  graphId: string,\n  registry: KindRegistry,\n  backend: GraphBackend | TransactionBackend,\n  operations: NodeOperations,\n): GraphNodeCollections<G> {\n  const collectionCache = new Map<string, unknown>();\n\n  // The proxy dynamically returns typed collections for each key.\n  // Type assertions are necessary because the proxy pattern doesn't preserve\n  // the relationship between keys and their specific node types at compile time.\n  return new Proxy({} as unknown as GraphNodeCollections<G>, {\n    get: (_, kind: string) => {\n      if (!Object.hasOwn(graph.nodes, kind)) {\n        throw new KindNotFoundError(kind, \"node\");\n      }\n\n      const cached = collectionCache.get(kind);\n      if (cached !== undefined) {\n        return cached;\n      }\n\n      const collection = createNodeCollection({\n        graphId,\n        kind,\n        backend,\n        ...operations,\n      });\n      collectionCache.set(kind, collection);\n      return collection;\n    },\n  });\n}\n\n/**\n * Creates a typed edge collections proxy.\n *\n * The proxy dynamically creates EdgeCollection instances for each edge kind\n * when accessed.\n */\nexport function createEdgeCollectionsProxy<G extends GraphDef>(\n  graph: G,\n  graphId: string,\n  registry: KindRegistry,\n  backend: GraphBackend | TransactionBackend,\n  operations: EdgeOperations,\n): GraphEdgeCollections<G> {\n  const collectionCache = new Map<string, unknown>();\n\n  // The proxy dynamically returns typed collections for each key.\n  // Type assertions are necessary because the proxy pattern doesn't preserve\n  // the relationship between keys and their specific edge types at compile time.\n  return new Proxy({} as unknown as GraphEdgeCollections<G>, {\n    get: (_, kind: string) => {\n      if (!Object.hasOwn(graph.edges, kind)) {\n        throw new KindNotFoundError(kind, \"edge\");\n      }\n\n      const cached = collectionCache.get(kind);\n      if (cached !== undefined) {\n        return cached;\n      }\n\n      const collection = createEdgeCollection({\n        graphId,\n        kind,\n        backend,\n        ...operations,\n      });\n      collectionCache.set(kind, collection);\n      return collection;\n    },\n  });\n}\n","/**\n * `store.introspect()` — unified read of the merged schema.\n *\n * Returns a coherent snapshot of \"what does my schema look like right\n * now\" suitable for schema-management UIs, codegen, and IDE plugins.\n * The previous surface was fragmented across `registry.hasNodeType`,\n * `store.deprecatedKinds`, and direct graph poking; `introspect()`\n * unifies them with explicit `origin` markers distinguishing\n * compile-time from runtime declarations.\n *\n * Pure read — no I/O. Built from the in-memory `GraphDef` and the\n * persisted-but-already-merged `extension`. `schemaVersion` /\n * `schemaHash` are populated when the loader cached them at\n * construction time and `undefined` otherwise; consumers needing a\n * fresh read should call `backend.getActiveSchema(graphId)` directly.\n */\nimport {\n  type AllEdgeTypes,\n  type AllNodeTypes,\n  type GraphDef,\n} from \"../core/define-graph\";\nimport {\n  type Cardinality,\n  type Collation,\n  type EdgeType,\n  type EndpointExistence,\n  type KindAnnotations,\n  type NodeRegistration,\n  type NodeType,\n  type UniquenessScope,\n} from \"../core/types\";\nimport { type GraphExtension } from \"../graph-extension/extension-types\";\nimport {\n  buildGraphExtensionOntologyKeySet,\n  compileTimeOntologyKey,\n  extensionKindNames,\n} from \"../graph-extension/ontology-keys\";\nimport { getTypeName } from \"../ontology/types\";\nimport { serializeSchemaProperties } from \"../schema/serializer\";\nimport { type JsonSchema } from \"../schema/types\";\n\nexport type SchemaIntrospection = Readonly<{\n  graphId: string;\n  /** Active schema version on the backend, when known to the caller. */\n  schemaVersion: number | undefined;\n  /** Hash of the active schema document, when known to the caller. */\n  schemaHash: string | undefined;\n  kinds: readonly KindIntrospection[];\n  edges: readonly EdgeIntrospection[];\n  ontology: readonly OntologyIntrospection[];\n  deprecatedKinds: ReadonlySet<string>;\n  /**\n   * The persisted graph extension, or `undefined` when the store has\n   * no extensions. Round-trips: passing this value to\n   * `defineGraphExtension` and `evolve` against an empty graph yields\n   * a graph with the same extension kinds.\n   */\n  extension: GraphExtension | undefined;\n}>;\n\nexport type KindIntrospection = Readonly<{\n  name: string;\n  origin: \"compile-time\" | \"runtime\";\n  description: string | undefined;\n  annotations: KindAnnotations | undefined;\n  deprecated: boolean;\n  /**\n   * JSON-Schema view of the kind's properties. For extension kinds the\n   * lower-level `ExtensionPropertyType` shape (with first-class\n   * `searchable` / `embedding` modifiers) is reachable via\n   * `introspection.extension.nodes[name].properties`.\n   */\n  properties: JsonSchema;\n  unique: readonly UniqueIntrospection[];\n}>;\n\nexport type EdgeIntrospection = Readonly<{\n  name: string;\n  origin: \"compile-time\" | \"runtime\";\n  description: string | undefined;\n  from: readonly string[];\n  to: readonly string[];\n  cardinality: Cardinality;\n  endpointExistence: EndpointExistence;\n  properties: JsonSchema;\n  annotations: KindAnnotations | undefined;\n  deprecated: boolean;\n}>;\n\nexport type OntologyIntrospection = Readonly<{\n  metaEdge: string;\n  from: string;\n  to: string;\n  origin: \"compile-time\" | \"runtime\";\n}>;\n\nexport type UniqueIntrospection = Readonly<{\n  name: string;\n  fields: readonly string[];\n  scope: UniquenessScope;\n  collation: Collation;\n}>;\n\ntype IntrospectContext = Readonly<{\n  graphId: string;\n  schemaVersion: number | undefined;\n  schemaHash: string | undefined;\n}>;\n\nexport function introspectSchema<G extends GraphDef>(\n  graph: G,\n  context: IntrospectContext,\n): SchemaIntrospection {\n  const extension = graph.extension;\n  const { nodes: runtimeNodeNames, edges: runtimeEdgeNames } =\n    extensionKindNames(extension);\n  const deprecated = graph.deprecatedKinds;\n\n  const kinds: KindIntrospection[] = [];\n  for (const [name, registration] of Object.entries(graph.nodes)) {\n    const reg = registration as NodeRegistration<NodeType>;\n    kinds.push({\n      name,\n      origin: runtimeNodeNames.has(name) ? \"runtime\" : \"compile-time\",\n      description: reg.type.description,\n      annotations: reg.type.annotations,\n      deprecated: deprecated.has(name),\n      properties: serializeSchemaProperties(reg.type.schema),\n      unique: (reg.unique ?? []).map((constraint) => ({\n        name: constraint.name,\n        fields: [...constraint.fields],\n        scope: constraint.scope,\n        collation: constraint.collation,\n      })),\n    });\n  }\n\n  const edges: EdgeIntrospection[] = [];\n  for (const [name, registration] of Object.entries(graph.edges)) {\n    const reg = registration;\n    const edgeType = reg.type as AllEdgeTypes<G> & EdgeType;\n    edges.push({\n      name,\n      origin: runtimeEdgeNames.has(name) ? \"runtime\" : \"compile-time\",\n      description: edgeType.description,\n      from: reg.from.map((entry) => (entry as AllNodeTypes<G> & NodeType).kind),\n      to: reg.to.map((entry) => (entry as AllNodeTypes<G> & NodeType).kind),\n      cardinality: reg.cardinality ?? \"many\",\n      endpointExistence: reg.endpointExistence ?? \"notDeleted\",\n      properties: serializeSchemaProperties(edgeType.schema),\n      annotations: edgeType.annotations,\n      deprecated: deprecated.has(name),\n    });\n  }\n\n  const runtimeOntologyKeys = buildGraphExtensionOntologyKeySet(extension);\n  const ontology: OntologyIntrospection[] = graph.ontology.map((relation) => ({\n    metaEdge: relation.metaEdge.name,\n    from: getTypeName(relation.from),\n    to: getTypeName(relation.to),\n    origin:\n      runtimeOntologyKeys.has(compileTimeOntologyKey(relation)) ? \"runtime\" : (\n        \"compile-time\"\n      ),\n  }));\n\n  return {\n    graphId: context.graphId,\n    schemaVersion: context.schemaVersion,\n    schemaHash: context.schemaHash,\n    kinds,\n    edges,\n    ontology,\n    deprecatedKinds: new Set(deprecated),\n    extension,\n  };\n}\n","/**\n * Shared building blocks for the materialize-* verbs (`materializeIndexes`\n * and `materializeRemovals`) and `Store.removeKinds`. Each verb owns a\n * per-deployment status table (`typegraph_index_materializations`,\n * `typegraph_kind_removals`) and bootstraps it lazily; this module\n * centralizes the bootstrap dispatch + parallel orchestration shape so\n * the runners stay thin.\n */\nimport { type GraphBackend } from \"../backend/types\";\n\n/**\n * Idempotently ensure a per-verb status table exists, preferring the\n * focused `ensure*Table` primitive when available and falling back to\n * the full `bootstrapTables` for legacy backends.\n *\n * Why focused: `bootstrapTables` issues 20+ `CREATE TABLE / CREATE\n * INDEX IF NOT EXISTS` statements covering every base table. Two\n * concurrent callers (e.g. two replicas of the same `schema_doc` both\n * starting up) deadlock on Postgres SHARE locks. Restricting the\n * ensure-step to a single table eliminates the cross-table race —\n * concurrent `CREATE TABLE IF NOT EXISTS` for one specific table is\n * well-behaved on Postgres.\n */\nexport async function ensureFocusedStatusTable(\n  backend: GraphBackend,\n  ensureFocused: (() => Promise<void>) | undefined,\n): Promise<void> {\n  if (ensureFocused !== undefined) {\n    await ensureFocused();\n    return;\n  }\n  await backend.bootstrapTables?.();\n}\n\n/**\n * Best-effort vs strict orchestration for materialization runners.\n * `stopOnError === true` runs sequentially and short-circuits on the\n * first `failed` entry (mirrors typical schema-migration safety\n * semantics); the default best-effort path runs `runOne` over `items`\n * concurrently. Custom orchestrators (e.g. `materializeIndexes`'s\n * per-relation bucketing) bypass this helper and assemble their own\n * Promise topology.\n */\nexport async function runMaterialization<\n  TInput,\n  TEntry extends { status: string },\n>(\n  items: readonly TInput[],\n  options: Readonly<{ stopOnError?: boolean }>,\n  runOne: (item: TInput) => Promise<TEntry>,\n): Promise<readonly TEntry[]> {\n  if (options.stopOnError === true) {\n    const results: TEntry[] = [];\n    for (const item of items) {\n      const entry = await runOne(item);\n      results.push(entry);\n      if (entry.status === \"failed\") break;\n    }\n    return results;\n  }\n  return Promise.all(items.map((item) => runOne(item)));\n}\n","/**\n * Index materialization — runs declared index DDL against the live\n * database and tracks per-deployment status in\n * `typegraph_index_materializations`.\n *\n * Reads `IndexDeclaration[]` from `GraphDef.indexes`, generates DDL via\n * `generateIndexDDL`, executes via `backend.executeDdl` (Postgres path\n * uses `CREATE INDEX CONCURRENTLY`, which cannot run inside a\n * transaction — `executeDdl` runs at the top-level backend, never inside\n * `transaction(...)`), and upserts a status row per index.\n *\n * Caveats baked in to the algorithm:\n *\n * - SQL index names are physical, database-global identifiers.\n *   Cross-graph collisions (two graphs declaring the same name with\n *   different shapes) surface as a `failed` result with reason\n *   \"signature drift\", because the existing recorded signature won't\n *   match the new one.\n * - On Postgres, `CREATE INDEX CONCURRENTLY IF NOT EXISTS` does NOT\n *   prove the existing physical index has the same shape as ours —\n *   only that something with that name exists. Drift detection here\n *   relies on TypeGraph's recorded signature, not on PG metadata.\n * - Failed `CONCURRENTLY` builds leave invalid indexes behind\n *   (`pg_index.indisvalid = false`). v1 surfaces this as a `failed`\n *   result; the operator must drop the invalid index manually before\n *   retry.\n */\n\nimport {\n  type CreateVectorIndexParams,\n  type GraphBackend,\n  type IndexMaterializationRow,\n  type RecordIndexMaterializationParams,\n} from \"../backend/types\";\nimport { type GraphDef, isKnownKind } from \"../core/define-graph\";\nimport type { IndexEntity } from \"../core/types\";\nimport { ConfigurationError, KindNotFoundError } from \"../errors\";\nimport { generateIndexDDL } from \"../indexes/ddl\";\nimport {\n  type IndexDeclaration,\n  type RelationalIndexDeclaration,\n  type VectorIndexDeclaration,\n} from \"../indexes/types\";\nimport { type SqlDialect } from \"../query/dialect/types\";\nimport { sortedReplacer } from \"../schema/canonical\";\nimport { nowIso } from \"../utils/date\";\nimport { sha256Hex } from \"../utils/hash\";\nimport { ensureFocusedStatusTable } from \"./materialize-shared\";\n\nexport type MaterializeIndexesOptions = Readonly<{\n  /** Restrict to indexes whose `kind` is in this set. */\n  kinds?: readonly string[];\n  /** Stop on the first failure. Default: false (best-effort). */\n  stopOnError?: boolean;\n}>;\n\n/**\n * Per-index outcome from `materializeIndexes()`.\n *\n * Status values:\n * - `created`: DDL ran successfully and a new physical index now exists.\n * - `alreadyMaterialized`: status table shows a prior successful\n *   materialization with the same signature; no DDL ran.\n * - `failed`: the DDL or status write failed; `error` carries the\n *   captured exception. Best-effort mode continues to the next index;\n *   `stopOnError: true` halts.\n * - `skipped`: the backend can't materialize this index variant in its\n *   current configuration (e.g. vector indexes against SQLite without\n *   sqlite-vec, or `indexType: \"none\"` declared on an embedding). The\n *   declaration is recognized but intentionally not acted on. Status\n *   table is NOT updated for skipped entries.\n */\nexport type MaterializeIndexesEntry = Readonly<{\n  indexName: string;\n  entity: IndexEntity;\n  kind: string;\n  status: \"created\" | \"alreadyMaterialized\" | \"failed\" | \"skipped\";\n  error?: Error;\n  /**\n   * Human-readable reason. Required for `skipped`; optional otherwise.\n   */\n  reason?: string;\n}>;\n\nexport type MaterializeIndexesResult = Readonly<{\n  results: readonly MaterializeIndexesEntry[];\n}>;\n\ntype MaterializeIndexesContext = Readonly<{\n  graph: GraphDef;\n  graphId: string;\n  backend: GraphBackend;\n  schemaVersion: number;\n}>;\n\nexport async function materializeIndexes(\n  context: MaterializeIndexesContext,\n  options: MaterializeIndexesOptions = {},\n): Promise<MaterializeIndexesResult> {\n  const { graph, graphId, backend, schemaVersion } = context;\n\n  if (backend.executeDdl === undefined) {\n    throw new ConfigurationError(\n      \"store.materializeIndexes() requires a backend with `executeDdl` \" +\n        \"support. The bundled SQLite and Postgres backends provide it; \" +\n        \"a custom backend without `executeDdl` cannot run index DDL.\",\n      { code: \"MATERIALIZE_BACKEND_UNSUPPORTED\" },\n    );\n  }\n  if (\n    backend.getIndexMaterialization === undefined ||\n    backend.recordIndexMaterialization === undefined\n  ) {\n    throw new ConfigurationError(\n      \"store.materializeIndexes() requires a backend with index \" +\n        \"materialization status primitives. The bundled SQLite and \" +\n        \"Postgres backends provide them; a custom backend must implement \" +\n        \"`getIndexMaterialization` and `recordIndexMaterialization`.\",\n      { code: \"MATERIALIZE_BACKEND_UNSUPPORTED\" },\n    );\n  }\n\n  const declared = graph.indexes ?? [];\n  const kindFilter =\n    options.kinds === undefined ? undefined : new Set(options.kinds);\n\n  if (kindFilter !== undefined) {\n    for (const name of kindFilter) {\n      if (!isKnownKind(graph, name)) {\n        throw new KindNotFoundError(\n          name,\n          Object.hasOwn(graph.edges, name) ? \"edge\" : \"node\",\n          {\n            graphId,\n            suggestion:\n              \"Only kinds declared on the graph (compile-time or runtime) can be passed to materializeIndexes.\",\n          },\n        );\n      }\n    }\n  }\n\n  const candidates = declared.filter((index) =>\n    kindFilter === undefined ? true : kindFilter.has(index.kind),\n  );\n\n  // Short-circuit before any I/O when there's nothing to do. The\n  // ensure-step below issues a CREATE TABLE statement — paying that\n  // cost only to return an empty result is wasteful, especially on\n  // repeated `evolve(sameExt, { eager: {} })` calls.\n  if (candidates.length === 0) {\n    return { results: [] };\n  }\n\n  await ensureFocusedStatusTable(\n    backend,\n    backend.ensureIndexMaterializationsTable,\n  );\n\n  const dialect = backend.dialect;\n  const tableNames = backend.tableNames;\n  const ddlOptions = {\n    ifNotExists: true,\n    concurrent: dialect === \"postgres\",\n    ...(tableNames?.nodes === undefined ?\n      {}\n    : { nodesTableName: tableNames.nodes }),\n    ...(tableNames?.edges === undefined ?\n      {}\n    : { edgesTableName: tableNames.edges }),\n  } as const;\n\n  // Bulk-preload existing materialization rows for every candidate's\n  // status key in one round-trip. With 30 declared indexes this drops 30\n  // sequential SELECTs to one. Backends without the bulk primitive fall\n  // back to per-key lookups inside `materializeOne`.\n  const statusKeys = candidates.map((declaration) =>\n    statusKeyFor(declaration, graphId),\n  );\n  const existingByStatusKey = await preloadMaterializations(\n    backend,\n    statusKeys,\n  );\n\n  const materializeEntry = (\n    declaration: IndexDeclaration,\n  ): Promise<MaterializeIndexesEntry> =>\n    declaration.entity === \"vector\" ?\n      materializeVectorIndex(\n        declaration,\n        backend,\n        graphId,\n        schemaVersion,\n        existingByStatusKey,\n      )\n    : materializeRelationalIndex(\n        declaration,\n        backend,\n        dialect,\n        ddlOptions,\n        graphId,\n        schemaVersion,\n        existingByStatusKey,\n      );\n\n  if (options.stopOnError === true) {\n    const results: MaterializeIndexesEntry[] = [];\n    for (const declaration of candidates) {\n      const entry = await materializeEntry(declaration);\n      results.push(entry);\n      if (entry.status === \"failed\") break;\n    }\n    return { results };\n  }\n\n  // Postgres restricts `CREATE INDEX CONCURRENTLY` to one in-flight\n  // build per relation, so we group declarations by target table and\n  // run each group sequentially while running the groups in parallel.\n  // Typical schemas land in three buckets (nodes, edges, vector\n  // embeddings), giving a ~3× round-trip win over fully sequential\n  // without ever issuing two CONCURRENTLY builds against the same\n  // relation. SQLite ignores the grouping (writes serialize at the\n  // engine level either way).\n  const buckets = new Map<IndexEntity, IndexDeclaration[]>();\n  for (const declaration of candidates) {\n    const key = parallelBucketKey(declaration);\n    const list = buckets.get(key);\n    if (list === undefined) buckets.set(key, [declaration]);\n    else list.push(declaration);\n  }\n\n  const bucketResults = await Promise.all(\n    [...buckets.values()].map(async (group) => {\n      const out: MaterializeIndexesEntry[] = [];\n      for (const declaration of group) {\n        out.push(await materializeEntry(declaration));\n      }\n      return out;\n    }),\n  );\n\n  // Flatten in declaration order so callers see a stable result shape\n  // regardless of how the buckets resolved.\n  const byDeclaration = new Map<IndexDeclaration, MaterializeIndexesEntry>();\n  let bucketIndex = 0;\n  for (const group of buckets.values()) {\n    const entries = bucketResults[bucketIndex]!;\n    for (const [declarationIndex, declaration] of group.entries()) {\n      byDeclaration.set(declaration, entries[declarationIndex]!);\n    }\n    bucketIndex += 1;\n  }\n  return {\n    results: candidates.map((declaration) => byDeclaration.get(declaration)!),\n  };\n}\n\nfunction parallelBucketKey(declaration: IndexDeclaration): IndexEntity {\n  // Vector indexes now target typed per-`(kind, field)` tables rather\n  // than one shared table, so distinct vector declarations could in\n  // principle build concurrently. They still share one bucket (keyed by\n  // the `\"vector\"` entity) — serializing them is conservative but\n  // correct, and keeps Postgres CIC's \"one in-flight build per relation\"\n  // rule trivially satisfied without tracking per-table identity here.\n  // Relational node and edge indexes split into their own entity buckets.\n  return declaration.entity;\n}\n\nasync function materializeRelationalIndex(\n  declaration: RelationalIndexDeclaration,\n  backend: GraphBackend,\n  dialect: SqlDialect,\n  ddlOptions: Readonly<{\n    ifNotExists: boolean;\n    concurrent: boolean;\n    nodesTableName?: string;\n    edgesTableName?: string;\n  }>,\n  graphId: string,\n  schemaVersion: number,\n  existingByStatusKey: ReadonlyMap<string, IndexMaterializationRow>,\n): Promise<MaterializeIndexesEntry> {\n  const ddl = generateIndexDDL(declaration, dialect, ddlOptions);\n  const targetTable =\n    declaration.entity === \"node\" ?\n      (ddlOptions.nodesTableName ?? \"typegraph_nodes\")\n    : (ddlOptions.edgesTableName ?? \"typegraph_edges\");\n  const signature = await computeIndexSignature(\n    dialect,\n    targetTable,\n    declaration,\n  );\n  return materializeOne(declaration, backend, graphId, schemaVersion, {\n    statusKey: declaration.name,\n    signature,\n    driftLabel: \"Index\",\n    run: () => backend.executeDdl!(ddl),\n    existingByStatusKey,\n  });\n}\n\nasync function materializeVectorIndex(\n  declaration: VectorIndexDeclaration,\n  backend: GraphBackend,\n  graphId: string,\n  schemaVersion: number,\n  existingByStatusKey: ReadonlyMap<string, IndexMaterializationRow>,\n): Promise<MaterializeIndexesEntry> {\n  // `indexType: \"none\"` is a declarative opt-out — the declaration\n  // carries shape metadata (dimensions, metric) for tooling but the\n  // operator has signaled \"no automatic index\". Surface as `skipped`.\n  if (declaration.indexType === \"none\") {\n    return skippedEntry(\n      declaration,\n      \"indexType: 'none' opts out of automatic materialization\",\n    );\n  }\n\n  // Capability check: backends declare vector support via\n  // `capabilities.vector` (derived from the active `VectorStrategy`) and\n  // expose that strategy as `backend.vectorStrategy`. When either is\n  // absent the backend can't act on the declaration — surface as\n  // skipped. The `vectorStrategy` check also narrows it to defined for\n  // the per-field table-name resolution below.\n  const vectorCapability = backend.capabilities.vector;\n  if (\n    vectorCapability?.supported !== true ||\n    backend.createVectorIndex === undefined ||\n    backend.vectorStrategy === undefined\n  ) {\n    return skippedEntry(\n      declaration,\n      `Backend (${backend.dialect}) does not support vector indexes in its current configuration`,\n    );\n  }\n  // Capability check (per index type): backends advertise the specific\n  // index implementations they support (e.g. SQLite + sqlite-vec\n  // accepts vectors but no HNSW/IVFFlat — the brute-force scan IS the\n  // \"index\"). Surface unsupported types as skipped so consumers see a\n  // clear \"this backend can't materialize this declaration\" signal\n  // instead of a silent no-op masquerading as `created`.\n  if (!vectorCapability.indexTypes.includes(declaration.indexType)) {\n    return skippedEntry(\n      declaration,\n      `Backend (${backend.dialect}) does not support index type \"${declaration.indexType}\" for vector indexes; supported: ${vectorCapability.indexTypes.join(\", \") || \"(none)\"}`,\n    );\n  }\n\n  // Hash against the strategy's typed per-`(kind, field)` physical table\n  // — the storage this declaration's index actually targets. Folding the\n  // resolved table name into the signature keeps drift detection honest:\n  // if the strategy (and thus the physical table) changes, the recorded\n  // signature mismatches and re-materialization is forced.\n  const embeddingsTable = backend.vectorStrategy.tableName(\n    graphId,\n    declaration.kind,\n    declaration.fieldPath,\n  );\n  const signature = await computeIndexSignature(\n    backend.dialect,\n    embeddingsTable,\n    declaration,\n  );\n  const params: CreateVectorIndexParams = {\n    graphId,\n    nodeKind: declaration.kind,\n    fieldPath: declaration.fieldPath,\n    dimensions: declaration.dimensions,\n    metric: declaration.metric,\n    indexType: declaration.indexType,\n    indexParams: {\n      m: declaration.indexParams.m,\n      efConstruction: declaration.indexParams.efConstruction,\n      ...(declaration.indexParams.lists === undefined ?\n        {}\n      : { lists: declaration.indexParams.lists }),\n    },\n    concurrent: backend.dialect === \"postgres\",\n  };\n  return materializeOne(declaration, backend, graphId, schemaVersion, {\n    // Compound status-table key for vector entries. Pgvector creates\n    // one physical index per (graphId, kind, field) — so the\n    // per-deployment status table needs to disambiguate entries that\n    // SHARE a declaration name but belong to different graphs.\n    // Applied uniformly to auto-derived AND explicit declarations.\n    statusKey: vectorStatusKey(graphId, declaration.name),\n    signature,\n    driftLabel: \"Vector index\",\n    run: () => backend.createVectorIndex!(params),\n    existingByStatusKey,\n  });\n}\n\n/**\n * Shared \"check existing → run → record\" frame for both relational and\n * vector materialization. Both paths track a per-deployment status row\n * keyed by `statusKey`, short-circuit on a matching signature, surface\n * signature drift as a recorded failure, and execute `run()` on first\n * materialization. Differences live entirely in the `MaterializeAction`\n * the caller passes.\n */\nasync function materializeOne(\n  declaration: IndexDeclaration,\n  backend: GraphBackend,\n  graphId: string,\n  schemaVersion: number,\n  action: Readonly<{\n    statusKey: string;\n    signature: string;\n    driftLabel: string;\n    run: () => Promise<void>;\n    existingByStatusKey: ReadonlyMap<string, IndexMaterializationRow>;\n  }>,\n): Promise<MaterializeIndexesEntry> {\n  // Narrowed by callsite — guaranteed defined when this is reached\n  // (validated in `materializeIndexes`).\n  const recordIndexMaterialization = backend.recordIndexMaterialization!;\n\n  const { statusKey, signature, driftLabel, run, existingByStatusKey } = action;\n  const statusOverride =\n    statusKey === declaration.name ? undefined : { statusName: statusKey };\n\n  const existing = existingByStatusKey.get(statusKey);\n  if (existing?.materializedAt !== undefined) {\n    if (existing.signature === signature) {\n      return entry(declaration, \"alreadyMaterialized\");\n    }\n    const error = new Error(\n      `${driftLabel} \"${declaration.name}\" already materialized with a different signature (recorded by graph \"${existing.graphId}\" at version ${existing.schemaVersion}). Drop the index manually and retry, or rename the new declaration.`,\n    );\n    await recordIndexMaterialization(\n      buildAttempt({\n        declaration,\n        graphId,\n        signature,\n        schemaVersion,\n        materializedAt: undefined,\n        error,\n        ...statusOverride,\n      }),\n    );\n    return entry(declaration, \"failed\", error);\n  }\n\n  try {\n    await run();\n    const attemptedAt = nowIso();\n    await recordIndexMaterialization(\n      buildAttempt({\n        declaration,\n        graphId,\n        signature,\n        schemaVersion,\n        materializedAt: attemptedAt,\n        error: undefined,\n        attemptedAt,\n        ...statusOverride,\n      }),\n    );\n    return entry(declaration, \"created\");\n  } catch (error_) {\n    const error = error_ instanceof Error ? error_ : new Error(String(error_));\n    await recordIndexMaterialization(\n      buildAttempt({\n        declaration,\n        graphId,\n        signature,\n        schemaVersion,\n        materializedAt: undefined,\n        error,\n        ...statusOverride,\n      }),\n    );\n    return entry(declaration, \"failed\", error);\n  }\n}\n\nfunction entry(\n  declaration: IndexDeclaration,\n  status: MaterializeIndexesEntry[\"status\"],\n  error?: Error,\n): MaterializeIndexesEntry {\n  return {\n    indexName: declaration.name,\n    entity: declaration.entity,\n    kind: declaration.kind,\n    status,\n    ...(error === undefined ? {} : { error }),\n  };\n}\n\nfunction skippedEntry(\n  declaration: VectorIndexDeclaration,\n  reason: string,\n): MaterializeIndexesEntry {\n  return {\n    indexName: declaration.name,\n    entity: \"vector\",\n    kind: declaration.kind,\n    status: \"skipped\",\n    reason,\n  };\n}\n\n/**\n * Compose the per-deployment status-table key for a vector index.\n * Pgvector physical indexes are partial-by-graph_id (one per graph),\n * so the status table needs graph-scoped identity to disambiguate\n * two graphs reusing the same declaration name. The `::` separator\n * keeps the compound visually unambiguous when inspecting the table.\n */\nexport function vectorStatusKey(\n  graphId: string,\n  declarationName: string,\n): string {\n  return `${graphId}::${declarationName}`;\n}\n\nfunction statusKeyFor(declaration: IndexDeclaration, graphId: string): string {\n  return declaration.entity === \"vector\" ?\n      vectorStatusKey(graphId, declaration.name)\n    : declaration.name;\n}\n\n/**\n * Bulk-load the recorded materialization rows for `statusKeys` into a\n * Map keyed by status key. Backends that implement\n * `getIndexMaterializations` return everything in one round-trip;\n * legacy backends fall back to per-key parallel `getIndexMaterialization`\n * calls. Missing rows are simply absent from the map.\n */\nasync function preloadMaterializations(\n  backend: GraphBackend,\n  statusKeys: readonly string[],\n): Promise<ReadonlyMap<string, IndexMaterializationRow>> {\n  const map = new Map<string, IndexMaterializationRow>();\n  if (statusKeys.length === 0) return map;\n  if (backend.getIndexMaterializations !== undefined) {\n    const rows = await backend.getIndexMaterializations(statusKeys);\n    for (const row of rows) map.set(row.indexName, row);\n    return map;\n  }\n  const getOne = backend.getIndexMaterialization!;\n  const rows = await Promise.all(statusKeys.map((key) => getOne(key)));\n  for (const [index, row] of rows.entries()) {\n    if (row !== undefined) map.set(statusKeys[index]!, row);\n  }\n  return map;\n}\n\nfunction buildAttempt(\n  args: Readonly<{\n    declaration: IndexDeclaration;\n    graphId: string;\n    signature: string;\n    schemaVersion: number;\n    materializedAt: string | undefined;\n    error: Error | undefined;\n    attemptedAt?: string;\n    /**\n     * Override the status-table identity. Used by vector entries to\n     * inject the graph-scoped compound key (`vectorStatusKey`).\n     * Relational entries default to the declaration name because\n     * physical CREATE INDEX names are already database-global.\n     */\n    statusName?: string;\n  }>,\n): RecordIndexMaterializationParams {\n  return {\n    indexName: args.statusName ?? args.declaration.name,\n    graphId: args.graphId,\n    entity: args.declaration.entity,\n    kind: args.declaration.kind,\n    signature: args.signature,\n    schemaVersion: args.schemaVersion,\n    attemptedAt: args.attemptedAt ?? nowIso(),\n    materializedAt: args.materializedAt,\n    error: args.error?.message,\n  };\n}\n\n/**\n * Canonical hash of `{ dialect, targetTableName, declaration }`.\n *\n * Includes the physical target table name because custom backends can\n * remap `typegraph_nodes` / `typegraph_edges` — a declaration-only\n * signature would falsely report \"already materialized\" after a table\n * rename. Excludes execution flags (`CONCURRENTLY`, `IF NOT EXISTS`)\n * because those are runtime modifiers, not shape.\n */\nexport async function computeIndexSignature(\n  dialect: SqlDialect,\n  targetTableName: string,\n  declaration: IndexDeclaration,\n): Promise<string> {\n  const hashable = { dialect, targetTableName, declaration };\n  const json = JSON.stringify(hashable, sortedReplacer);\n  return sha256Hex(json, 16);\n}\n","/**\n * Data-cleanup phase for `store.removeKinds()`.\n *\n * The removeKinds verb commits the new schema atomically (millisecond\n * budget); the data deletion happens here, scoped per-deployment via\n * the `typegraph_kind_removals` status table. Splitting the verbs\n * mirrors how `materializeIndexes` complements `evolve`: schema\n * commits are atomic and fast, data work is bounded by row count and\n * deferrable / parallelizable.\n */\nimport {\n  type GraphBackend,\n  type KindRemovalRow,\n  type RecordKindRemovalParams,\n} from \"../backend/types\";\nimport type { KindEntity } from \"../core/types\";\nimport { ConfigurationError } from \"../errors\";\nimport type {\n  VectorSlot,\n  VectorStrategy,\n} from \"../query/dialect/vector-strategy\";\nimport { parseSerializedSchema } from \"../schema/manager\";\nimport { nowIso } from \"../utils/date\";\nimport { isMissingTableError } from \"../utils/sql-errors\";\nimport {\n  ensureFocusedStatusTable,\n  runMaterialization,\n} from \"./materialize-shared\";\n\nconst ENTITY_KINDS: readonly KindEntity[] = [\"node\", \"edge\"];\n\n/**\n * Build the \"pending\" `recordKindRemoval` payload shared by\n * `Store.removeKinds` (the original commit-time write) and\n * `materializeRemovals` reconciliation (the catch-up write for kinds\n * that crashed before their queue row landed). Centralizes the\n * `removedAt: undefined, error: undefined` constants so a future\n * status-table column expansion has one site to update.\n */\nexport function buildPendingKindRemoval(\n  args: Readonly<{\n    graphId: string;\n    kindName: string;\n    entity: KindEntity;\n    schemaVersion: number;\n    attemptedAt: string;\n  }>,\n): RecordKindRemovalParams {\n  return { ...args, removedAt: undefined, error: undefined };\n}\n\nexport type MaterializeRemovalsOptions = Readonly<{\n  /** Restrict to specific kind names. */\n  kinds?: readonly string[];\n  /** Halt on first failure. Default: false (best-effort). */\n  stopOnError?: boolean;\n}>;\n\nexport type MaterializeRemovalsEntry = Readonly<{\n  kind: string;\n  entity: KindEntity;\n  status: \"removed\" | \"failed\";\n  error?: Error;\n}>;\n\n/**\n * Outcome of reclaiming one per-`(graphId, kind, field)` vector table that\n * was orphaned when its embedding field was dropped from a *surviving*\n * kind's schema. Distinct from {@link MaterializeRemovalsEntry} (whole\n * kinds) because the unit is a single embedding field, not a kind.\n */\nexport type ReclaimedVectorFieldEntry = Readonly<{\n  kind: string;\n  fieldPath: string;\n  status: \"reclaimed\" | \"failed\";\n  error?: Error;\n}>;\n\nexport type MaterializeRemovalsResult = Readonly<{\n  results: readonly MaterializeRemovalsEntry[];\n  /**\n   * Embedding fields removed from a *surviving* kind whose per-field vector\n   * table this pass dropped (or confirmed already absent). Empty when the\n   * backend has no vector strategy or no embedding field has ever been\n   * dropped. Re-derived from immutable schema history each call, so it lists\n   * the same removed fields on repeat passes — the underlying drop is\n   * idempotent (`DROP ... IF EXISTS`). See {@link reclaimRemovedVectorFieldTables}.\n   */\n  reclaimedVectorFields: readonly ReclaimedVectorFieldEntry[];\n}>;\n\ntype MaterializeRemovalsContext = Readonly<{\n  graphId: string;\n  backend: GraphBackend;\n}>;\n\nexport async function materializeRemovals(\n  context: MaterializeRemovalsContext,\n  options: MaterializeRemovalsOptions = {},\n): Promise<MaterializeRemovalsResult> {\n  const { backend, graphId } = context;\n\n  if (\n    backend.executeDdl === undefined ||\n    backend.recordKindRemoval === undefined ||\n    backend.getPendingKindRemovals === undefined\n  ) {\n    throw new ConfigurationError(\n      \"store.materializeRemovals() requires a backend with kind-removal \" +\n        \"primitives (executeDdl, recordKindRemoval, getPendingKindRemovals). \" +\n        \"The bundled SQLite and Postgres backends provide them.\",\n      { code: \"MATERIALIZE_REMOVALS_BACKEND_UNSUPPORTED\" },\n    );\n  }\n\n  await ensureFocusedStatusTable(backend, backend.ensureKindRemovalsTable);\n\n  // Recovery path: `removeKinds()` commits the schema-version diff\n  // (kind dropped from `nodes`/`edges`) BEFORE recording the cleanup\n  // queue rows. If the queue write fails between those two steps the\n  // schema is durable but the queue is missing rows — and a retry of\n  // `removeKinds()` short-circuits on the no-op path because the kind\n  // is already absent. Atomicity isn't an option (the schema-commit\n  // path takes dialect-specific advisory locks that can't be extended\n  // across the status-table write), so reconcile here against schema\n  // history: walk every transition, find kinds whose removal isn't\n  // reflected in the queue, and re-record them.\n  await reconcilePendingRemovals(context);\n\n  // Independent of pending kind removals: a per-field vector table is\n  // orphaned the moment its embedding field is dropped from a *surviving*\n  // kind (an `evolve` that removes the field, with no kind removal at all).\n  // The add-only `materializeIndexes` path never reclaims it and the\n  // candidate loop below only handles whole kinds, so reclaim here before\n  // the no-candidates short-circuit.\n  const reclaimedVectorFields = await reclaimRemovedVectorFieldTables(context);\n\n  const pending = await backend.getPendingKindRemovals(graphId);\n\n  const kindFilter =\n    options.kinds === undefined ? undefined : new Set(options.kinds);\n  const candidates = pending.filter((row) =>\n    kindFilter === undefined ? true : kindFilter.has(row.kindName),\n  );\n\n  if (candidates.length === 0) return { results: [], reclaimedVectorFields };\n\n  const tableNames = backend.tableNames;\n  const nodesTable = tableNames?.nodes ?? \"typegraph_nodes\";\n  const edgesTable = tableNames?.edges ?? \"typegraph_edges\";\n  const fulltextTable = tableNames?.fulltext ?? \"typegraph_node_fulltext\";\n  const uniquesTable = tableNames?.uniques ?? \"typegraph_node_uniques\";\n\n  const ctx = {\n    backend,\n    graphId,\n    nodesTable,\n    edgesTable,\n    fulltextTable,\n    uniquesTable,\n  } as const;\n\n  // Each kind targets a disjoint row set (DELETEs filtered by kindName),\n  // so the default best-effort path runs them concurrently — Postgres\n  // parallelizes round-trips across pool connections, SQLite serializes\n  // writes at the engine level either way. `stopOnError` honors strict\n  // sequential semantics; the first failure short-circuits the rest.\n  return {\n    results: await runMaterialization(candidates, options, (removal) =>\n      materializeOne(removal, ctx),\n    ),\n    reclaimedVectorFields,\n  };\n}\n\n/**\n * Walks the schema-version history backward from the active version\n * and re-records any kind-removal whose queue row is missing entirely.\n *\n * Handles the full crash-window recovery: a `removeKinds()` call that\n * commits the schema diff but fails before recording the queue row\n * can be followed by any number of additional schema transitions\n * (evolve, deprecate, further removes) — the lost queue row is still\n * recoverable from schema history because the kind diff at that\n * specific transition is permanent metadata.\n *\n * Uses `getAllKindRemovals` to distinguish \"row missing entirely\" (the\n * crash window — needs recovery) from \"row already completed\" (a\n * successful prior cleanup — re-recording would churn\n * `last_attempted_at` even though COALESCE preserves the success).\n * Backends without that primitive fall back to the pending-only set,\n * which keeps reconciliation correct (the COALESCE rule preserves the\n * completed state) but does churn `last_attempted_at` on already-\n * completed rows. The bundled SQLite and Postgres backends implement\n * `getAllKindRemovals`.\n */\nasync function reconcilePendingRemovals(\n  context: MaterializeRemovalsContext,\n): Promise<void> {\n  const { backend, graphId } = context;\n  const recordKindRemoval = backend.recordKindRemoval;\n  if (recordKindRemoval === undefined) return;\n\n  const activeRow = await backend.getActiveSchema(graphId);\n  if (activeRow === undefined || activeRow.version <= 1) return;\n\n  // Watermark short-circuit: when a previous reconciliation pass\n  // verified history through some version M, only walk transitions\n  // newer than M. Without the watermark this loop walked from active\n  // down to version 1 on every call — N round-trips + N Zod parses\n  // per call — and re-verified already-good history every time.\n  // Backends without the marker primitives fall back to walking from\n  // version 1 (the legacy behavior) so existing custom backends\n  // keep working.\n  //\n  // Bootstrap the marker table BEFORE the read — DBs that pre-date\n  // this slice would otherwise SELECT from a missing table and throw\n  // before they got the chance to create it.\n  if (backend.ensureReconciliationMarkersTable !== undefined) {\n    await backend.ensureReconciliationMarkersTable();\n  }\n  const marker =\n    backend.getReconciliationMarker === undefined ?\n      undefined\n    : await backend.getReconciliationMarker(graphId);\n  if (marker !== undefined && marker >= activeRow.version) return;\n\n  // Existence map: a (entity, kindName, schemaVersion) is recorded if\n  // a row exists in any state (pending or completed). The rows we want\n  // to reconcile are the ones missing from this set entirely.\n  const allRemovals = await (backend.getAllKindRemovals === undefined ?\n    backend.getPendingKindRemovals!(graphId)\n  : backend.getAllKindRemovals(graphId));\n  const recorded = new Set(\n    allRemovals.map((row) =>\n      kindRemovalKey(row.entity, row.kindName, row.schemaVersion),\n    ),\n  );\n\n  const reconciliations: {\n    kindName: string;\n    entity: KindEntity;\n    schemaVersion: number;\n  }[] = [];\n\n  // Walk backward through transitions, stopping at the watermark.\n  // At each pair (priorRow, currentRow) we compute \"kinds removed at\n  // currentRow.version\" and check the existence map — any missing\n  // entry needs an idempotent upsert. The marker bounds the walk so\n  // long-running deployments with hundreds of schema versions skip\n  // the bulk of the round-trips after their first reconciliation.\n  const stopAtVersion = marker ?? 1;\n  let currentRow = activeRow;\n  let currentSchema = parseSerializedSchema(activeRow.schema_doc);\n  while (currentRow.version > stopAtVersion) {\n    const priorRow = await backend.getSchemaVersion(\n      graphId,\n      currentRow.version - 1,\n    );\n    if (priorRow === undefined) break;\n    const priorSchema = parseSerializedSchema(priorRow.schema_doc);\n\n    for (const entity of ENTITY_KINDS) {\n      const priorEntries = priorSchema[entity === \"node\" ? \"nodes\" : \"edges\"];\n      const currentEntries =\n        currentSchema[entity === \"node\" ? \"nodes\" : \"edges\"];\n      for (const kindName of Object.keys(priorEntries)) {\n        if (kindName in currentEntries) continue;\n        if (\n          recorded.has(kindRemovalKey(entity, kindName, currentRow.version))\n        ) {\n          continue;\n        }\n        reconciliations.push({\n          kindName,\n          entity,\n          schemaVersion: currentRow.version,\n        });\n      }\n    }\n\n    currentRow = priorRow;\n    currentSchema = priorSchema;\n  }\n\n  if (reconciliations.length > 0) {\n    const attemptedAt = nowIso();\n    await Promise.all(\n      reconciliations.map((entry) =>\n        recordKindRemoval(\n          buildPendingKindRemoval({\n            graphId,\n            kindName: entry.kindName,\n            entity: entry.entity,\n            schemaVersion: entry.schemaVersion,\n            attemptedAt,\n          }),\n        ),\n      ),\n    );\n  }\n\n  // Persist the new high-water mark so the next call walks only\n  // versions newer than this one. Done after the reconciliation\n  // upserts succeed — a crash before this point leaves the marker\n  // unchanged, so the next call re-walks (idempotent — recorded\n  // rows skip via the existence-map check above).\n  if (backend.setReconciliationMarker !== undefined) {\n    await backend.setReconciliationMarker(graphId, activeRow.version);\n  }\n}\n\nfunction kindRemovalKey(\n  entity: KindEntity,\n  kindName: string,\n  version: number,\n): string {\n  return `${entity}|${kindName}|${version}`;\n}\n\nasync function materializeOne(\n  row: KindRemovalRow,\n  ctx: Readonly<{\n    backend: GraphBackend;\n    graphId: string;\n    nodesTable: string;\n    edgesTable: string;\n    fulltextTable: string;\n    uniquesTable: string;\n  }>,\n): Promise<MaterializeRemovalsEntry> {\n  const executeDdl = ctx.backend.executeDdl!;\n  const recordKindRemoval = ctx.backend.recordKindRemoval!;\n  try {\n    // Build the per-row DELETEs. For a removed node kind: drop the\n    // primary rows, every edge referencing it (via from_kind / to_kind\n    // — those would otherwise dangle), the secondary tables that\n    // partition by node_kind (fulltext, uniques), plus the strategy's\n    // typed per-`(kind, field)` embedding tables. Without the secondary\n    // cleanup, repeated remove/re-add cycles accumulate dead rows that\n    // fulltext / unique / vector lookups still scan. For a removed edge\n    // kind: only the edges table needs cleanup. All statements target\n    // disjoint row sets — issued in parallel.\n    const deletes: Promise<void>[] = [];\n    const graphLit = literal(ctx.graphId);\n    const kindLit = literal(row.kindName);\n    if (row.entity === \"node\") {\n      deletes.push(\n        executeDdl(\n          `DELETE FROM ${quote(ctx.nodesTable)} WHERE graph_id = ${graphLit} AND kind = ${kindLit}`,\n        ),\n        executeDdl(\n          `DELETE FROM ${quote(ctx.edgesTable)} WHERE graph_id = ${graphLit} AND (from_kind = ${kindLit} OR to_kind = ${kindLit})`,\n        ),\n        executeDdl(\n          `DELETE FROM ${quote(ctx.fulltextTable)} WHERE graph_id = ${graphLit} AND node_kind = ${kindLit}`,\n        ),\n        executeDdl(\n          `DELETE FROM ${quote(ctx.uniquesTable)} WHERE graph_id = ${graphLit} AND node_kind = ${kindLit}`,\n        ),\n        ...buildEmbeddingTableCleanup(ctx, row),\n      );\n    } else {\n      deletes.push(\n        executeDdl(\n          `DELETE FROM ${quote(ctx.edgesTable)} WHERE graph_id = ${graphLit} AND kind = ${kindLit}`,\n        ),\n      );\n    }\n    await Promise.all(deletes);\n\n    const removedAt = nowIso();\n    await recordKindRemoval({\n      graphId: ctx.graphId,\n      kindName: row.kindName,\n      entity: row.entity,\n      schemaVersion: row.schemaVersion,\n      attemptedAt: removedAt,\n      removedAt,\n      error: undefined,\n    });\n    return {\n      kind: row.kindName,\n      entity: row.entity,\n      status: \"removed\",\n    };\n  } catch (error_) {\n    const error = error_ instanceof Error ? error_ : new Error(String(error_));\n    await recordKindRemoval({\n      graphId: ctx.graphId,\n      kindName: row.kindName,\n      entity: row.entity,\n      schemaVersion: row.schemaVersion,\n      attemptedAt: nowIso(),\n      removedAt: undefined,\n      error: error.message,\n    });\n    return {\n      kind: row.kindName,\n      entity: row.entity,\n      status: \"failed\",\n      error,\n    };\n  }\n}\n\n/**\n * Builds the embedding-storage cleanup for a removed node kind.\n *\n * With per-`(graphId, kind, field)` storage there is no single shared\n * embeddings table to filter by `node_kind`; each embedding field of the\n * removed kind has its own typed, graph-scoped table. We resolve those fields\n * from the schema version that still *had* the kind (`schemaVersion - 1`) and\n * drop each per-field table via the strategy — the same teardown the\n * removed-*field* reclamation uses — so the kind's table and any ANN index it\n * owns are fully reclaimed (a stale empty table would otherwise collide with a\n * re-added kind at a different dimension).\n *\n * Backends without a vector strategy, or schema history that can't be\n * read, yield no cleanup — there is no embedding storage to reclaim.\n * Returned as a single combined promise so the caller can issue it\n * alongside the other disjoint DELETEs.\n */\nfunction buildEmbeddingTableCleanup(\n  ctx: Readonly<{\n    backend: GraphBackend;\n    graphId: string;\n  }>,\n  row: KindRemovalRow,\n): readonly Promise<void>[] {\n  const vectorStrategy = ctx.backend.vectorStrategy;\n  if (vectorStrategy === undefined) return [];\n\n  const executeDdl = ctx.backend.executeDdl!;\n  const cleanup = (async () => {\n    const slots = await resolveRemovedKindEmbeddingSlots(ctx.backend, row);\n    await Promise.all(\n      slots.map((slot) =>\n        dropVectorSlotStorage(vectorStrategy, executeDdl, slot),\n      ),\n    );\n  })();\n  return [cleanup];\n}\n\n/**\n * Drops a per-field vector slot's storage via the strategy (table + any ANN\n * index it owns), tolerating an already-absent table — a declared field whose\n * per-field table was never materialized (no write, no index build) has nothing\n * to reclaim. Runs as autocommit statements, so swallowing a missing-table\n * failure can't poison a sibling drop. Shared by removed-kind cleanup and\n * removed-field reclamation so both reclaim storage the same way.\n */\nasync function dropVectorSlotStorage(\n  strategy: VectorStrategy,\n  executeDdl: (statement: string) => Promise<void>,\n  slot: VectorSlot,\n): Promise<void> {\n  try {\n    for (const ddl of strategy.buildDropStorage(slot)) {\n      await executeDdl(ddl);\n    }\n  } catch (error) {\n    if (!isMissingTableError(error)) throw error;\n  }\n}\n\n/**\n * Resolves the embedding field paths a removed node kind declared, read\n * from the persisted vector index declarations in the schema version\n * just before the removal (`schemaVersion - 1`). Returns `[]` when the\n * prior version is unavailable or declared no embedding fields for the\n * kind.\n */\nasync function resolveRemovedKindEmbeddingSlots(\n  backend: GraphBackend,\n  row: KindRemovalRow,\n): Promise<readonly VectorSlot[]> {\n  const priorVersion = row.schemaVersion - 1;\n  if (priorVersion < 1) return [];\n  const priorRow = await backend.getSchemaVersion(row.graphId, priorVersion);\n  if (priorRow === undefined) return [];\n\n  const priorSchema = parseSerializedSchema(priorRow.schema_doc);\n  const slots = new Map<string, VectorSlot>();\n  for (const declaration of priorSchema.indexes ?? []) {\n    if (declaration.entity === \"vector\" && declaration.kind === row.kindName) {\n      slots.set(declaration.fieldPath, {\n        graphId: row.graphId,\n        nodeKind: row.kindName,\n        fieldPath: declaration.fieldPath,\n        dimensions: declaration.dimensions,\n        metric: declaration.metric,\n        indexType: declaration.indexType,\n      });\n    }\n  }\n  return [...slots.values()];\n}\n\n/** Stable key for a `(kind, fieldPath)` embedding-field pair. */\nfunction vectorFieldKey(kind: string, fieldPath: string): string {\n  return `${kind}\\u0000${fieldPath}`;\n}\n\n/**\n * The historical declaration of a vector field, carrying everything\n * {@link VectorStrategy.buildDropStorage} needs to tear the storage down —\n * notably `indexType`, which libSQL reads to also drop its DiskANN index.\n */\ntype HistoricalVectorField = Readonly<{\n  kind: string;\n  fieldPath: string;\n  slot: VectorSlot;\n}>;\n\n/**\n * Reclaims per-`(graphId, kind, field)` vector tables orphaned by embedding-\n * field removals on *surviving* kinds.\n *\n * Per-field storage means every embedding field owns a typed table. When a\n * field is dropped from a kind that still exists (an `evolve` that removes the\n * embedding), nothing reclaims that table: the add-only `materializeIndexes`\n * path ignores removals and the kind-scoped cleanup above only fires for whole\n * removed kinds. Left alone the table lingers with dead rows that no query\n * reads again, and — worse — a later re-add of the field at a different\n * dimension would collide with the stale table.\n *\n * The orphan set is derived from schema history: every vector field ever\n * declared, minus the ones still declared in the *active* schema, restricted\n * to kinds that still exist (removed-kind fields are the kind path's job).\n * Using the active schema as the \"still declared\" source of truth makes\n * remove-then-re-add safe — a re-added field is current, so it is never\n * dropped. `buildDropStorage` emits `DROP ... IF EXISTS`, so the pass is\n * idempotent and a never-materialized field is a clean no-op; deriving from\n * full history each call also reclaims tables orphaned before this shipped.\n *\n * Backends without a vector strategy or `executeDdl` have no per-field tables\n * to reclaim and yield an empty result.\n */\nasync function reclaimRemovedVectorFieldTables(\n  context: MaterializeRemovalsContext,\n): Promise<readonly ReclaimedVectorFieldEntry[]> {\n  const { backend, graphId } = context;\n  const vectorStrategy = backend.vectorStrategy;\n  const executeDdl = backend.executeDdl;\n  if (vectorStrategy === undefined || executeDdl === undefined) return [];\n\n  const activeRow = await backend.getActiveSchema(graphId);\n  if (activeRow === undefined) return [];\n\n  // The orphan set is a pure function of (graphId, active version) over\n  // immutable schema history and the drops are idempotent, so re-walking the\n  // whole history on every materializeRemovals call is wasted O(versions) work.\n  // Memoize per (backend, graphId:version); an evolve bumps the version and\n  // invalidates. Only fully-successful passes are cached (a failed drop must be\n  // retried), and the cache is in-process so a fresh backend re-walks once.\n  const cacheKey = `${graphId}\u0000${activeRow.version}`;\n  let perBackend = reclaimCache.get(backend);\n  const cached = perBackend?.get(cacheKey);\n  if (cached !== undefined) return cached;\n\n  const activeSchema = parseSerializedSchema(activeRow.schema_doc);\n\n  const activeVectorFields = new Set<string>();\n  for (const declaration of activeSchema.indexes ?? []) {\n    if (declaration.entity === \"vector\") {\n      activeVectorFields.add(\n        vectorFieldKey(declaration.kind, declaration.fieldPath),\n      );\n    }\n  }\n  const survivingKinds = new Set(Object.keys(activeSchema.nodes));\n\n  // Walk history backward, keeping the most-recent declaration of each\n  // vector field (first seen wins) so `buildDropStorage` gets a faithful\n  // `indexType`/`dimensions`.\n  const historical = new Map<string, HistoricalVectorField>();\n  for (let version = activeRow.version - 1; version >= 1; version -= 1) {\n    const priorRow = await backend.getSchemaVersion(graphId, version);\n    if (priorRow === undefined) continue;\n    const priorSchema = parseSerializedSchema(priorRow.schema_doc);\n    for (const declaration of priorSchema.indexes ?? []) {\n      if (declaration.entity !== \"vector\") continue;\n      const key = vectorFieldKey(declaration.kind, declaration.fieldPath);\n      if (historical.has(key)) continue;\n      historical.set(key, {\n        kind: declaration.kind,\n        fieldPath: declaration.fieldPath,\n        slot: {\n          graphId,\n          nodeKind: declaration.kind,\n          fieldPath: declaration.fieldPath,\n          dimensions: declaration.dimensions,\n          metric: declaration.metric,\n          indexType: declaration.indexType,\n        },\n      });\n    }\n  }\n\n  const orphans = [...historical.values()].filter(\n    (field) =>\n      !activeVectorFields.has(vectorFieldKey(field.kind, field.fieldPath)) &&\n      survivingKinds.has(field.kind),\n  );\n\n  const results: ReclaimedVectorFieldEntry[] = [];\n  for (const field of orphans) {\n    // dropVectorSlotStorage swallows the missing-table case (a never-\n    // materialized field has nothing to reclaim), so reaching the catch means\n    // a genuine failure.\n    try {\n      await dropVectorSlotStorage(vectorStrategy, executeDdl, field.slot);\n      results.push({\n        kind: field.kind,\n        fieldPath: field.fieldPath,\n        status: \"reclaimed\",\n      });\n    } catch (error) {\n      results.push({\n        kind: field.kind,\n        fieldPath: field.fieldPath,\n        status: \"failed\",\n        error: error instanceof Error ? error : new Error(String(error)),\n      });\n    }\n  }\n\n  // Cache only a fully-successful pass — a failed drop must be retried.\n  if (results.every((entry) => entry.status === \"reclaimed\")) {\n    if (perBackend === undefined) {\n      perBackend = new Map();\n      reclaimCache.set(backend, perBackend);\n    }\n    perBackend.set(cacheKey, results);\n  }\n  return results;\n}\n\n/**\n * In-process memo for {@link reclaimRemovedVectorFieldTables}, keyed by backend\n * then `graphId:activeVersion`. See that function for why version-keying is\n * sound (the orphan set is a pure function of immutable history + the version).\n */\nconst reclaimCache = new WeakMap<\n  GraphBackend,\n  Map<string, readonly ReclaimedVectorFieldEntry[]>\n>();\n\n// `executeDdl` accepts a raw SQL string. The DELETE statements built\n// here are dialect-neutral (no SQLite/Postgres-specific syntax) and\n// use single-quote string literals for graph_id / kind names. Both\n// values come from the schema — never untrusted user input — but we\n// still escape single quotes defensively to avoid surprises if a\n// future kind-name validator narrows beyond `[A-Za-z_][A-Za-z0-9_]*`.\nfunction quote(identifier: string): string {\n  return `\"${identifier.replaceAll('\"', '\"\"')}\"`;\n}\n\nfunction literal(value: string): string {\n  return `'${value.replaceAll(\"'\", \"''\")}'`;\n}\n","/**\n * Constraint validation module.\n *\n * Provides validation functions for enforcing graph constraints:\n * - Uniqueness constraints on node properties\n * - Cardinality constraints on edges\n * - Endpoint type constraints on edges\n * - Disjointness constraints between node kinds\n */\n\n/**\n * Separator used between field values in composite unique keys.\n * Uses ASCII Record Separator (0x1E) — valid UTF-8 and safe for PostgreSQL\n * TEXT columns (unlike \\0 which PostgreSQL rejects).\n */\nconst UNIQUE_KEY_SEPARATOR = \"\\u001E\";\n\n/** Marker for undefined/null field values in unique keys. */\nconst UNIQUE_KEY_NULL_MARKER = \"\\u001F\"; // ASCII Unit Separator\nimport {\n  type Cardinality,\n  type Collation,\n  type EdgeRegistration,\n  type NullCheckOp,\n  type UniqueConstraint,\n  type UniquenessScope,\n} from \"../core/types\";\nimport {\n  CardinalityError,\n  DisjointError,\n  EndpointError,\n  UniquenessError,\n} from \"../errors\";\nimport { type KindRegistry } from \"../registry/kind-registry\";\n\n// ============================================================\n// Uniqueness Validation\n// ============================================================\n\n/**\n * Computes the unique key for a node's uniqueness constraint.\n *\n * The key is built by concatenating the specified field values,\n * optionally normalized for case-insensitive comparison.\n */\nexport function computeUniqueKey(\n  props: Record<string, unknown>,\n  fields: readonly string[],\n  collation: Collation,\n): string {\n  const values = fields.map((field) => {\n    const value = props[field];\n    if (value === undefined || value === null) {\n      return UNIQUE_KEY_NULL_MARKER;\n    }\n    // Convert to string, handling primitives safely\n    const stringValue =\n      typeof value === \"string\" ? value\n      : typeof value === \"number\" || typeof value === \"boolean\" ?\n        value.toString()\n      : JSON.stringify(value);\n    return collation === \"caseInsensitive\" ?\n        stringValue.toLowerCase()\n      : stringValue;\n  });\n  return values.join(UNIQUE_KEY_SEPARATOR);\n}\n\n/**\n * Checks if a uniqueness constraint's where predicate passes.\n */\nexport function checkWherePredicate(\n  constraint: UniqueConstraint,\n  props: Record<string, unknown>,\n): boolean {\n  if (!constraint.where) {\n    return true; // No where clause, always applies\n  }\n\n  // Build predicate context\n  const predicateBuilder = buildPredicateContext(props);\n  const predicate = constraint.where(predicateBuilder);\n\n  // Evaluate predicate\n  return evaluatePredicate(predicate, props);\n}\n\ntype UniquePredicate = Readonly<{\n  __type: \"unique_predicate\";\n  field: string;\n  op: NullCheckOp;\n}>;\n\ntype PredicateContext = Readonly<\n  Record<\n    string,\n    Readonly<{\n      isNull: () => UniquePredicate;\n      isNotNull: () => UniquePredicate;\n    }>\n  >\n>;\n\n/**\n * Builds a predicate context for where clause evaluation.\n */\nfunction buildPredicateContext(\n  props: Record<string, unknown>,\n): PredicateContext {\n  const context: Record<\n    string,\n    { isNull: () => UniquePredicate; isNotNull: () => UniquePredicate }\n  > = {};\n\n  for (const key of Object.keys(props)) {\n    context[key] = {\n      isNull: () => ({\n        __type: \"unique_predicate\" as const,\n        field: key,\n        op: \"isNull\" as const,\n      }),\n      isNotNull: () => ({\n        __type: \"unique_predicate\" as const,\n        field: key,\n        op: \"isNotNull\" as const,\n      }),\n    };\n  }\n\n  return context;\n}\n\n/**\n * Evaluates a uniqueness predicate.\n */\nfunction evaluatePredicate(\n  predicate: unknown,\n  props: Record<string, unknown>,\n): boolean {\n  if (\n    typeof predicate !== \"object\" ||\n    predicate === null ||\n    !(\"__type\" in predicate)\n  ) {\n    return true;\n  }\n\n  const pred = predicate as {\n    __type: string;\n    field: string;\n    op: NullCheckOp;\n  };\n\n  if (pred.__type !== \"unique_predicate\") {\n    return true;\n  }\n\n  const value = props[pred.field];\n  if (pred.op === \"isNull\") {\n    return value === null || value === undefined;\n  }\n  return value !== null && value !== undefined;\n}\n\n/**\n * Gets all kinds that should be checked for a uniqueness constraint.\n *\n * For \"kindWithSubClasses\" scope, includes the entire subclass hierarchy:\n * - The kind itself\n * - All ancestors (parent classes)\n * - All descendants of those ancestors (sibling classes)\n *\n * For \"kind\" scope, only the specific kind.\n */\nexport function getKindsForUniquenessCheck(\n  baseKind: string,\n  scope: UniquenessScope,\n  registry: KindRegistry,\n): readonly string[] {\n  if (scope === \"kind\") {\n    return [baseKind];\n  }\n\n  // Get the entire connected subclass hierarchy by finding the root ancestor\n  const root = findRootAncestor(baseKind, registry);\n\n  // Return the root and all its descendants (which includes baseKind and siblings)\n  return registry.expandSubClasses(root);\n}\n\n/**\n * Finds the topmost ancestor of a kind, or the kind itself if it has no ancestors.\n */\nfunction findRootAncestor(kind: string, registry: KindRegistry): string {\n  const ancestors = registry.getAncestors(kind);\n\n  if (ancestors.size === 0) {\n    return kind;\n  }\n\n  // Find an ancestor with no ancestors (the root)\n  for (const ancestor of ancestors) {\n    if (registry.getAncestors(ancestor).size === 0) {\n      return ancestor;\n    }\n  }\n\n  // If all ancestors have ancestors, recurse up\n  const firstAncestor = [...ancestors][0];\n  return firstAncestor ? findRootAncestor(firstAncestor, registry) : kind;\n}\n\n/**\n * Creates a uniqueness error.\n */\nexport function createUniquenessError(\n  constraintName: string,\n  kind: string,\n  existingId: string,\n  newId: string,\n  fields: readonly string[],\n): UniquenessError {\n  return new UniquenessError({\n    constraintName,\n    kind,\n    existingId,\n    newId,\n    fields: [...fields],\n  });\n}\n\n// ============================================================\n// Cardinality Validation\n// ============================================================\n\n/**\n * Checks if adding an edge would violate cardinality constraints.\n *\n * @param edgeKind - The edge kind being added\n * @param fromKind - The source node kind\n * @param fromId - The source node ID\n * @param cardinality - The cardinality constraint\n * @param existingEdgeCount - Number of existing edges of this kind from this source\n * @param hasActiveEdge - Whether there's an active (valid_to IS NULL) edge\n * @returns Error if violation, undefined if valid\n */\nexport function checkCardinality(\n  edgeKind: string,\n  fromKind: string,\n  fromId: string,\n  cardinality: Cardinality,\n  existingEdgeCount: number,\n  hasActiveEdge: boolean,\n): CardinalityError | undefined {\n  switch (cardinality) {\n    case \"many\": {\n      // No constraint\n      return undefined;\n    }\n    case \"one\": {\n      // At most one edge of this kind from any source node\n      if (existingEdgeCount > 0) {\n        return new CardinalityError({\n          edgeKind,\n          fromKind,\n          fromId,\n          cardinality: \"one\",\n          existingCount: existingEdgeCount,\n        });\n      }\n      return undefined;\n    }\n    case \"unique\": {\n      // unique is checked separately per (source, target) pair\n      return undefined;\n    }\n    case \"oneActive\": {\n      // At most one edge with valid_to IS NULL from any source\n      if (hasActiveEdge) {\n        return new CardinalityError({\n          edgeKind,\n          fromKind,\n          fromId,\n          cardinality: \"oneActive\",\n          existingCount: 1,\n        });\n      }\n      return undefined;\n    }\n  }\n}\n\n/**\n * Checks unique edge constraint (at most one edge between any source-target pair).\n */\nexport function checkUniqueEdge(\n  edgeKind: string,\n  fromKind: string,\n  fromId: string,\n  _toKind: string,\n  _toId: string,\n  existingCount: number,\n): CardinalityError | undefined {\n  if (existingCount > 0) {\n    return new CardinalityError({\n      edgeKind,\n      fromKind,\n      fromId,\n      cardinality: \"unique\",\n      existingCount,\n    });\n  }\n  return undefined;\n}\n\n// ============================================================\n// Endpoint Validation\n// ============================================================\n\n/**\n * Validates that an edge's endpoints are valid node kinds.\n */\nexport function validateEdgeEndpoints(\n  edgeKind: string,\n  fromKind: string,\n  toKind: string,\n  registration: EdgeRegistration,\n  registry: KindRegistry,\n): EndpointError | undefined {\n  // Check from kinds\n  const validFromKinds = registration.from.map((node) => node.kind);\n  const fromValid = validFromKinds.some((validKind) =>\n    registry.isAssignableTo(fromKind, validKind),\n  );\n\n  if (!fromValid) {\n    return new EndpointError({\n      edgeKind,\n      endpoint: \"from\",\n      actualKind: fromKind,\n      expectedKinds: validFromKinds,\n    });\n  }\n\n  // Check to kinds\n  const validToKinds = registration.to.map((node) => node.kind);\n  const toValid = validToKinds.some((validKind) =>\n    registry.isAssignableTo(toKind, validKind),\n  );\n\n  if (!toValid) {\n    return new EndpointError({\n      edgeKind,\n      endpoint: \"to\",\n      actualKind: toKind,\n      expectedKinds: validToKinds,\n    });\n  }\n\n  return undefined;\n}\n\n// ============================================================\n// Disjointness Validation\n// ============================================================\n\n/**\n * Checks if creating a node would violate disjointness constraints.\n *\n * @param nodeId - The node ID being created\n * @param nodeKind - The kind of the new node\n * @param existingKinds - Kinds of existing nodes with the same ID\n * @param registry - The kind registry for disjointness checks\n * @returns Error if disjoint violation, undefined if valid\n */\nexport function checkDisjointness(\n  nodeId: string,\n  nodeKind: string,\n  existingKinds: readonly string[],\n  registry: KindRegistry,\n): DisjointError | undefined {\n  for (const existingKind of existingKinds) {\n    if (registry.areDisjoint(nodeKind, existingKind)) {\n      return new DisjointError({\n        nodeId,\n        attemptedKind: nodeKind,\n        conflictingKind: existingKind,\n      });\n    }\n  }\n  return undefined;\n}\n\n/**\n * Gets all disjoint kinds for a given kind.\n */\nexport function getDisjointKinds(\n  kind: string,\n  registry: KindRegistry,\n): readonly string[] {\n  return registry.getDisjointKinds(kind);\n}\n","/**\n * Constraint Checking for Store Operations\n *\n * Handles checking disjointness and cardinality constraints.\n */\nimport { type GraphBackend, type TransactionBackend } from \"../backend/types\";\nimport {\n  checkCardinality,\n  checkDisjointness,\n  checkUniqueEdge,\n} from \"../constraints\";\nimport { type KindRegistry } from \"../registry/kind-registry\";\n\n/**\n * Context for constraint operations.\n */\nexport type ConstraintContext = Readonly<{\n  graphId: string;\n  registry: KindRegistry;\n  backend: GraphBackend | TransactionBackend;\n}>;\n\n/**\n * Checks disjointness constraints for a node.\n *\n * Ensures that a node with a given ID doesn't exist in any disjoint kinds.\n *\n * @throws ValidationError if disjointness constraint is violated\n */\nexport async function checkDisjointnessConstraint(\n  ctx: ConstraintContext,\n  kind: string,\n  id: string,\n): Promise<void> {\n  // Get all kinds that are disjoint with this kind\n  const disjointKinds = ctx.registry.getDisjointKinds(kind);\n\n  // For each disjoint kind, check if a node with this ID exists\n  for (const disjointKind of disjointKinds) {\n    const existing = await ctx.backend.getNode(ctx.graphId, disjointKind, id);\n    if (existing && !existing.deleted_at) {\n      const error = checkDisjointness(id, kind, [disjointKind], ctx.registry);\n      if (error) throw error;\n    }\n  }\n}\n\n/**\n * Checks cardinality constraints for an edge.\n *\n * @throws CardinalityError if cardinality constraint is violated\n */\nexport async function checkCardinalityConstraint(\n  ctx: ConstraintContext,\n  edgeKind: string,\n  cardinality: \"many\" | \"one\" | \"unique\" | \"oneActive\",\n  fromKind: string,\n  fromId: string,\n  toKind: string,\n  toId: string,\n  validTo: string | undefined,\n): Promise<void> {\n  switch (cardinality) {\n    case \"many\": {\n      // No constraint - allow any number of edges\n      return;\n    }\n\n    case \"one\": {\n      // At most one edge of this kind from this source\n      const count = await ctx.backend.countEdgesFrom({\n        graphId: ctx.graphId,\n        edgeKind,\n        fromKind,\n        fromId,\n      });\n      const error = checkCardinality(\n        edgeKind,\n        fromKind,\n        fromId,\n        \"one\",\n        count,\n        false,\n      );\n      if (error) throw error;\n      return;\n    }\n\n    case \"unique\": {\n      // At most one edge between this specific source-target pair\n      const exists = await ctx.backend.edgeExistsBetween({\n        graphId: ctx.graphId,\n        edgeKind,\n        fromKind,\n        fromId,\n        toKind,\n        toId,\n      });\n      const error = checkUniqueEdge(\n        edgeKind,\n        fromKind,\n        fromId,\n        toKind,\n        toId,\n        exists ? 1 : 0,\n      );\n      if (error) throw error;\n      return;\n    }\n\n    case \"oneActive\": {\n      // At most one active edge (valid_to IS NULL) from this source\n      // Only check if the new edge will be active (validTo is not set)\n      if (validTo !== undefined) {\n        // New edge is already ended, no active constraint to check\n        return;\n      }\n      const count = await ctx.backend.countEdgesFrom({\n        graphId: ctx.graphId,\n        edgeKind,\n        fromKind,\n        fromId,\n        activeOnly: true,\n      });\n      const error = checkCardinality(\n        edgeKind,\n        fromKind,\n        fromId,\n        \"oneActive\",\n        count,\n        count > 0,\n      );\n      if (error) throw error;\n      return;\n    }\n  }\n}\n","/**\n * Edge Operations for Store\n *\n * Handles edge CRUD operations: create, update, delete.\n */\nimport {\n  type EdgeRow as BackendEdgeRow,\n  type GraphBackend,\n  type InsertEdgeParams,\n  type TransactionBackend,\n} from \"../../backend/types\";\nimport { validateEdgeEndpoints } from \"../../constraints\";\nimport { type GraphDef } from \"../../core/define-graph\";\nimport {\n  type Cardinality,\n  type KindEntity,\n  type TemporalMode,\n} from \"../../core/types\";\nimport {\n  DatabaseOperationError,\n  EdgeNotFoundError,\n  EndpointNotFoundError,\n  KindNotFoundError,\n  ValidationError,\n} from \"../../errors\";\nimport { validateEdgeProps } from \"../../errors/validation\";\nimport { type KindRegistry } from \"../../registry/kind-registry\";\nimport { validateOptionalCanonicalIsoDate } from \"../../utils/date\";\nimport { generateId } from \"../../utils/id\";\nimport {\n  checkCardinalityConstraint,\n  type ConstraintContext,\n} from \"../constraints\";\nimport { rowToEdge } from \"../row-mappers\";\nimport {\n  type CreateEdgeInput,\n  type Edge,\n  type GetOrCreateAction,\n  type IfExistsMode,\n  type OperationHookContext,\n} from \"../types\";\n\n// ============================================================\n// Types\n// ============================================================\n\n/**\n * Context for edge operations.\n */\nexport type EdgeOperationContext<G extends GraphDef> = Readonly<{\n  graph: G;\n  graphId: string;\n  registry: KindRegistry;\n  createOperationContext: (\n    operation: \"create\" | \"update\" | \"delete\",\n    entity: KindEntity,\n    kind: string,\n    id: string,\n  ) => OperationHookContext;\n  withOperationHooks: <T>(\n    ctx: OperationHookContext,\n    fn: () => Promise<T>,\n  ) => Promise<T>;\n}>;\n\n// ============================================================\n// Helper Functions\n// ============================================================\n\nfunction getEdgeRegistration<G extends GraphDef>(graph: G, kind: string) {\n  const registration = graph.edges[kind];\n  if (registration === undefined) throw new KindNotFoundError(kind, \"edge\");\n  return registration;\n}\n\ntype EdgeCreatePrepared = Readonly<{\n  insertParams: InsertEdgeParams;\n  cardinality: Cardinality;\n}>;\n\nfunction buildEdgeEndpointCacheKey(\n  graphId: string,\n  kind: string,\n  id: string,\n): string {\n  return `${graphId}\\u0000${kind}\\u0000${id}`;\n}\n\nfunction buildEdgeFromCacheKey(\n  graphId: string,\n  edgeKind: string,\n  fromKind: string,\n  fromId: string,\n): string {\n  return `${graphId}\\u0000${edgeKind}\\u0000${fromKind}\\u0000${fromId}`;\n}\n\nfunction buildEdgeBetweenCacheKey(\n  graphId: string,\n  edgeKind: string,\n  fromKind: string,\n  fromId: string,\n  toKind: string,\n  toId: string,\n): string {\n  return `${graphId}\\u0000${edgeKind}\\u0000${fromKind}\\u0000${fromId}\\u0000${toKind}\\u0000${toId}`;\n}\n\nfunction buildCountEdgesFromCacheKey(\n  params: Parameters<GraphBackend[\"countEdgesFrom\"]>[0],\n): string {\n  const activeOnly = params.activeOnly === true ? \"1\" : \"0\";\n  return `${params.graphId}\\u0000${params.edgeKind}\\u0000${params.fromKind}\\u0000${params.fromId}\\u0000${activeOnly}`;\n}\n\nfunction buildInsertEdgeParams(\n  graphId: string,\n  id: string,\n  kind: string,\n  fromKind: string,\n  fromId: string,\n  toKind: string,\n  toId: string,\n  props: Record<string, unknown>,\n  validFrom: string | undefined,\n  validTo: string | undefined,\n): InsertEdgeParams {\n  const insertParams: {\n    graphId: string;\n    id: string;\n    kind: string;\n    fromKind: string;\n    fromId: string;\n    toKind: string;\n    toId: string;\n    props: Record<string, unknown>;\n    validFrom?: string;\n    validTo?: string;\n  } = {\n    graphId,\n    id,\n    kind,\n    fromKind,\n    fromId,\n    toKind,\n    toId,\n    props,\n  };\n  if (validFrom !== undefined) insertParams.validFrom = validFrom;\n  if (validTo !== undefined) insertParams.validTo = validTo;\n  return insertParams;\n}\n\nfunction incrementPendingCount(counts: Map<string, number>, key: string): void {\n  const previous = counts.get(key) ?? 0;\n  counts.set(key, previous + 1);\n}\n\nfunction createEdgeBatchValidationBackend(\n  backend: GraphBackend | TransactionBackend,\n): Readonly<{\n  backend: GraphBackend | TransactionBackend;\n  registerPendingEdgeForCardinality: (\n    insertParams: InsertEdgeParams,\n    cardinality: Cardinality,\n  ) => void;\n}> {\n  const endpointCache = new Map<\n    string,\n    Awaited<ReturnType<GraphBackend[\"getNode\"]>>\n  >();\n  const countEdgesFromCache = new Map<string, number>();\n  const edgeExistsCache = new Map<string, boolean>();\n  const pendingOneCounts = new Map<string, number>();\n  const pendingOneActiveCounts = new Map<string, number>();\n  const pendingUniquePairs = new Set<string>();\n\n  async function getNodeCached(\n    graphId: string,\n    kind: string,\n    id: string,\n  ): Promise<Awaited<ReturnType<GraphBackend[\"getNode\"]>>> {\n    const cacheKey = buildEdgeEndpointCacheKey(graphId, kind, id);\n    if (endpointCache.has(cacheKey)) {\n      return endpointCache.get(cacheKey);\n    }\n    const node = await backend.getNode(graphId, kind, id);\n    endpointCache.set(cacheKey, node);\n    return node;\n  }\n\n  async function countEdgesFromCached(\n    params: Parameters<GraphBackend[\"countEdgesFrom\"]>[0],\n  ): Promise<number> {\n    const cacheKey = buildCountEdgesFromCacheKey(params);\n    let baseCount = countEdgesFromCache.get(cacheKey);\n    if (baseCount === undefined) {\n      baseCount = await backend.countEdgesFrom(params);\n      countEdgesFromCache.set(cacheKey, baseCount);\n    }\n    const pendingKey = buildEdgeFromCacheKey(\n      params.graphId,\n      params.edgeKind,\n      params.fromKind,\n      params.fromId,\n    );\n    const pendingCount =\n      params.activeOnly === true ?\n        (pendingOneActiveCounts.get(pendingKey) ?? 0)\n      : (pendingOneCounts.get(pendingKey) ?? 0);\n    return baseCount + pendingCount;\n  }\n\n  async function edgeExistsBetweenCached(\n    params: Parameters<GraphBackend[\"edgeExistsBetween\"]>[0],\n  ): Promise<boolean> {\n    const cacheKey = buildEdgeBetweenCacheKey(\n      params.graphId,\n      params.edgeKind,\n      params.fromKind,\n      params.fromId,\n      params.toKind,\n      params.toId,\n    );\n    if (pendingUniquePairs.has(cacheKey)) {\n      return true;\n    }\n    if (edgeExistsCache.has(cacheKey)) {\n      return edgeExistsCache.get(cacheKey) ?? false;\n    }\n    const exists = await backend.edgeExistsBetween(params);\n    edgeExistsCache.set(cacheKey, exists);\n    return exists;\n  }\n\n  function registerPendingEdgeForCardinality(\n    insertParams: InsertEdgeParams,\n    cardinality: Cardinality,\n  ): void {\n    const fromCacheKey = buildEdgeFromCacheKey(\n      insertParams.graphId,\n      insertParams.kind,\n      insertParams.fromKind,\n      insertParams.fromId,\n    );\n    if (cardinality === \"one\") {\n      incrementPendingCount(pendingOneCounts, fromCacheKey);\n      return;\n    }\n    if (cardinality === \"oneActive\") {\n      if (insertParams.validTo === undefined) {\n        incrementPendingCount(pendingOneActiveCounts, fromCacheKey);\n      }\n      return;\n    }\n    if (cardinality === \"unique\") {\n      const uniqueCacheKey = buildEdgeBetweenCacheKey(\n        insertParams.graphId,\n        insertParams.kind,\n        insertParams.fromKind,\n        insertParams.fromId,\n        insertParams.toKind,\n        insertParams.toId,\n      );\n      pendingUniquePairs.add(uniqueCacheKey);\n    }\n  }\n\n  // Override specific methods on the backend for validation caching.\n  // The cast is necessary because spreading a union type (GraphBackend | TransactionBackend)\n  // produces an intersection of their members, which TypeScript can't narrow back to the union.\n  const validationBackend = {\n    ...backend,\n    getNode: getNodeCached,\n    countEdgesFrom: countEdgesFromCached,\n    edgeExistsBetween: edgeExistsBetweenCached,\n  } as GraphBackend | TransactionBackend;\n\n  return {\n    backend: validationBackend,\n    registerPendingEdgeForCardinality,\n  };\n}\n\nasync function validateAndPrepareEdgeCreate<G extends GraphDef>(\n  ctx: EdgeOperationContext<G>,\n  input: CreateEdgeInput,\n  id: string,\n  backend: GraphBackend | TransactionBackend,\n): Promise<EdgeCreatePrepared> {\n  const kind = input.kind;\n  const fromKind = input.fromKind;\n  const toKind = input.toKind;\n\n  // Validate kind exists and get registration\n  const registration = getEdgeRegistration(ctx.graph, kind);\n  const edgeKind = registration.type;\n\n  // Validate endpoint types\n  const endpointError = validateEdgeEndpoints(\n    kind,\n    fromKind,\n    toKind,\n    registration,\n    ctx.registry,\n  );\n  if (endpointError) throw endpointError;\n\n  // Validate source node exists\n  const fromNode = await backend.getNode(ctx.graphId, fromKind, input.fromId);\n  if (!fromNode || fromNode.deleted_at) {\n    throw new EndpointNotFoundError({\n      edgeKind: kind,\n      endpoint: \"from\",\n      nodeKind: fromKind,\n      nodeId: input.fromId,\n    });\n  }\n\n  // Validate target node exists\n  const toNode = await backend.getNode(ctx.graphId, toKind, input.toId);\n  if (!toNode || toNode.deleted_at) {\n    throw new EndpointNotFoundError({\n      edgeKind: kind,\n      endpoint: \"to\",\n      nodeKind: toKind,\n      nodeId: input.toId,\n    });\n  }\n\n  // Validate props with full context\n  const validatedProps = validateEdgeProps(edgeKind.schema, input.props, {\n    kind,\n    operation: \"create\",\n  });\n\n  // Validate temporal fields\n  const validFrom = validateOptionalCanonicalIsoDate(\n    input.validFrom,\n    \"validFrom\",\n  );\n  const validTo = validateOptionalCanonicalIsoDate(input.validTo, \"validTo\");\n\n  // Check cardinality constraints\n  const cardinality = registration.cardinality ?? \"many\";\n  const constraintContext: ConstraintContext = {\n    graphId: ctx.graphId,\n    registry: ctx.registry,\n    backend,\n  };\n  await checkCardinalityConstraint(\n    constraintContext,\n    kind,\n    cardinality,\n    fromKind,\n    input.fromId,\n    toKind,\n    input.toId,\n    validTo,\n  );\n\n  return {\n    cardinality,\n    insertParams: buildInsertEdgeParams(\n      ctx.graphId,\n      id,\n      kind,\n      fromKind,\n      input.fromId,\n      toKind,\n      input.toId,\n      validatedProps,\n      validFrom,\n      validTo,\n    ),\n  };\n}\n\n// ============================================================\n// Edge Operations\n// ============================================================\n\n/**\n * Executes an edge create operation.\n */\nasync function executeEdgeCreateInternal<G extends GraphDef>(\n  ctx: EdgeOperationContext<G>,\n  input: CreateEdgeInput,\n  backend: GraphBackend | TransactionBackend,\n  options?: Readonly<{ returnRow?: boolean }>,\n): Promise<Edge | undefined> {\n  const kind = input.kind;\n  const id = input.id ?? generateId();\n  const opContext = ctx.createOperationContext(\"create\", \"edge\", kind, id);\n  const shouldReturnRow = options?.returnRow ?? true;\n\n  return ctx.withOperationHooks(opContext, async () => {\n    const prepared = await validateAndPrepareEdgeCreate(\n      ctx,\n      input,\n      id,\n      backend,\n    );\n\n    let row: BackendEdgeRow | undefined;\n    if (shouldReturnRow) {\n      row = await backend.insertEdge(prepared.insertParams);\n    } else {\n      await (backend.insertEdgeNoReturn?.(prepared.insertParams) ??\n        backend.insertEdge(prepared.insertParams));\n    }\n\n    if (row === undefined) return;\n    return rowToEdge(row);\n  });\n}\n\n/**\n * Executes an edge create operation and returns the created edge.\n */\nexport async function executeEdgeCreate<G extends GraphDef>(\n  ctx: EdgeOperationContext<G>,\n  input: CreateEdgeInput,\n  backend: GraphBackend | TransactionBackend,\n): Promise<Edge> {\n  const result = await executeEdgeCreateInternal(ctx, input, backend, {\n    returnRow: true,\n  });\n  if (!result) {\n    throw new DatabaseOperationError(\n      \"Edge create failed: expected created edge row\",\n      { operation: \"insert\", entity: \"edge\" },\n    );\n  }\n  return result;\n}\n\n/**\n * Executes an edge create operation without returning the created edge payload.\n */\nexport async function executeEdgeCreateNoReturn<G extends GraphDef>(\n  ctx: EdgeOperationContext<G>,\n  input: CreateEdgeInput,\n  backend: GraphBackend | TransactionBackend,\n): Promise<void> {\n  await executeEdgeCreateInternal(ctx, input, backend, { returnRow: false });\n}\n\n/**\n * Executes batched edge creates without returning inserted edge payloads.\n *\n * Note: `withOperationHooks` is intentionally skipped for batch throughput.\n * Per-item hooks would negate the performance benefit of batching.\n */\nexport async function executeEdgeCreateNoReturnBatch<G extends GraphDef>(\n  ctx: EdgeOperationContext<G>,\n  inputs: readonly CreateEdgeInput[],\n  backend: GraphBackend | TransactionBackend,\n): Promise<void> {\n  if (inputs.length === 0) {\n    return;\n  }\n\n  const { backend: validationBackend, registerPendingEdgeForCardinality } =\n    createEdgeBatchValidationBackend(backend);\n  const preparedCreates: EdgeCreatePrepared[] = [];\n\n  for (const input of inputs) {\n    const id = input.id ?? generateId();\n    const prepared = await validateAndPrepareEdgeCreate(\n      ctx,\n      input,\n      id,\n      validationBackend,\n    );\n    preparedCreates.push(prepared);\n    registerPendingEdgeForCardinality(\n      prepared.insertParams,\n      prepared.cardinality,\n    );\n  }\n\n  const batchInsertParams = preparedCreates.map(\n    (prepared) => prepared.insertParams,\n  );\n  if (backend.insertEdgesBatch === undefined) {\n    for (const insertParams of batchInsertParams) {\n      await (backend.insertEdgeNoReturn?.(insertParams) ??\n        backend.insertEdge(insertParams));\n    }\n    return;\n  }\n  await backend.insertEdgesBatch(batchInsertParams);\n}\n\n/**\n * Executes batched edge creates and returns the inserted edge payloads.\n *\n * Uses batch validation caching and a single multi-row INSERT with RETURNING\n * when the backend supports it. Falls back to sequential inserts otherwise.\n *\n * Note: `withOperationHooks` is intentionally skipped for batch throughput.\n * Per-item hooks would negate the performance benefit of batching.\n */\nexport async function executeEdgeCreateBatch<G extends GraphDef>(\n  ctx: EdgeOperationContext<G>,\n  inputs: readonly CreateEdgeInput[],\n  backend: GraphBackend | TransactionBackend,\n): Promise<readonly Edge[]> {\n  if (inputs.length === 0) {\n    return [];\n  }\n\n  const { backend: validationBackend, registerPendingEdgeForCardinality } =\n    createEdgeBatchValidationBackend(backend);\n  const preparedCreates: EdgeCreatePrepared[] = [];\n\n  for (const input of inputs) {\n    const id = input.id ?? generateId();\n    const prepared = await validateAndPrepareEdgeCreate(\n      ctx,\n      input,\n      id,\n      validationBackend,\n    );\n    preparedCreates.push(prepared);\n    registerPendingEdgeForCardinality(\n      prepared.insertParams,\n      prepared.cardinality,\n    );\n  }\n\n  const batchInsertParams = preparedCreates.map(\n    (prepared) => prepared.insertParams,\n  );\n\n  let rows: readonly BackendEdgeRow[];\n  if (backend.insertEdgesBatchReturning === undefined) {\n    const sequentialRows: BackendEdgeRow[] = [];\n    for (const insertParams of batchInsertParams) {\n      sequentialRows.push(await backend.insertEdge(insertParams));\n    }\n    rows = sequentialRows;\n  } else {\n    rows = await backend.insertEdgesBatchReturning(batchInsertParams);\n  }\n\n  return rows.map((row) => rowToEdge(row));\n}\n\n/**\n * Executes an edge update operation.\n */\nexport async function executeEdgeUpdate<G extends GraphDef>(\n  ctx: EdgeOperationContext<G>,\n  input: {\n    id: string;\n    props: Partial<Record<string, unknown>>;\n    validTo?: string;\n  },\n  backend: GraphBackend | TransactionBackend,\n): Promise<Edge> {\n  const id = input.id;\n\n  // Get existing edge first to get the kind for the hook context\n  const existing = await backend.getEdge(ctx.graphId, id);\n  if (!existing || existing.deleted_at) {\n    throw new EdgeNotFoundError(\"unknown\", id);\n  }\n\n  const opContext = ctx.createOperationContext(\n    \"update\",\n    \"edge\",\n    existing.kind,\n    id,\n  );\n\n  return ctx.withOperationHooks(opContext, async () => {\n    // Get registration for schema validation\n    const registration = getEdgeRegistration(ctx.graph, existing.kind);\n    const edgeKind = registration.type;\n\n    // Merge props\n    const existingProps = JSON.parse(existing.props) as Record<string, unknown>;\n    const mergedProps = { ...existingProps, ...input.props };\n\n    // Validate merged props with full context\n    const validatedProps = validateEdgeProps(edgeKind.schema, mergedProps, {\n      kind: existing.kind,\n      operation: \"update\",\n      id,\n    });\n\n    // Validate temporal fields\n    const validTo = validateOptionalCanonicalIsoDate(input.validTo, \"validTo\");\n\n    // Update edge - conditionally include optional fields\n    const updateParams: {\n      graphId: string;\n      id: string;\n      props: Record<string, unknown>;\n      validTo?: string;\n    } = {\n      graphId: ctx.graphId,\n      id,\n      props: validatedProps,\n    };\n    if (validTo !== undefined) updateParams.validTo = validTo;\n\n    const row = await backend.updateEdge(updateParams);\n\n    return rowToEdge(row);\n  });\n}\n\n/**\n * Executes an edge update for upsert — bypasses the soft-delete check\n * and optionally clears `deleted_at`.\n */\nexport async function executeEdgeUpsertUpdate<G extends GraphDef>(\n  ctx: EdgeOperationContext<G>,\n  input: {\n    id: string;\n    props: Partial<Record<string, unknown>>;\n    validTo?: string;\n  },\n  backend: GraphBackend | TransactionBackend,\n  options?: Readonly<{ clearDeleted?: boolean }>,\n): Promise<Edge> {\n  const id = input.id;\n\n  const existing = await backend.getEdge(ctx.graphId, id);\n  if (!existing) {\n    throw new EdgeNotFoundError(\"unknown\", id);\n  }\n\n  const registration = getEdgeRegistration(ctx.graph, existing.kind);\n  const edgeKind = registration.type;\n\n  const existingProps = JSON.parse(existing.props) as Record<string, unknown>;\n  const mergedProps = { ...existingProps, ...input.props };\n\n  const validatedProps = validateEdgeProps(edgeKind.schema, mergedProps, {\n    kind: existing.kind,\n    operation: \"update\",\n    id,\n  });\n\n  const validTo = validateOptionalCanonicalIsoDate(input.validTo, \"validTo\");\n\n  const updateParams: {\n    graphId: string;\n    id: string;\n    props: Record<string, unknown>;\n    validTo?: string;\n    clearDeleted?: boolean;\n  } = {\n    graphId: ctx.graphId,\n    id,\n    props: validatedProps,\n  };\n  if (validTo !== undefined) updateParams.validTo = validTo;\n  if (options?.clearDeleted) updateParams.clearDeleted = true;\n\n  const row = await backend.updateEdge(updateParams);\n\n  return rowToEdge(row);\n}\n\n/**\n * Executes an edge delete operation.\n */\nexport async function executeEdgeDelete<G extends GraphDef>(\n  ctx: EdgeOperationContext<G>,\n  id: string,\n  backend: GraphBackend | TransactionBackend,\n): Promise<void> {\n  // Get edge first to know the kind for the hook context\n  const existing = await backend.getEdge(ctx.graphId, id);\n  if (!existing || existing.deleted_at) {\n    // Already deleted - nothing to do\n    return;\n  }\n\n  const opContext = ctx.createOperationContext(\n    \"delete\",\n    \"edge\",\n    existing.kind,\n    id,\n  );\n\n  return ctx.withOperationHooks(opContext, async () => {\n    await backend.deleteEdge({\n      graphId: ctx.graphId,\n      id,\n    });\n  });\n}\n\n/**\n * Executes an edge hard delete operation (permanent removal).\n *\n * Unlike soft delete, this permanently removes the edge from the database.\n */\nexport async function executeEdgeHardDelete<G extends GraphDef>(\n  ctx: EdgeOperationContext<G>,\n  id: string,\n  backend: GraphBackend | TransactionBackend,\n): Promise<void> {\n  // Get edge first to know the kind for the hook context\n  const existing = await backend.getEdge(ctx.graphId, id);\n  if (!existing) {\n    // Doesn't exist - nothing to do\n    return;\n  }\n\n  const opContext = ctx.createOperationContext(\n    \"delete\",\n    \"edge\",\n    existing.kind,\n    id,\n  );\n\n  return ctx.withOperationHooks(opContext, async () => {\n    await backend.hardDeleteEdge({\n      graphId: ctx.graphId,\n      id,\n    });\n  });\n}\n\n// ============================================================\n// Get-Or-Create Operations\n// ============================================================\n\n// Delimiters for composite match keys\nconst RECORD_SEP = \"\\u001E\";\nconst UNIT_SEP = \"\\u001F\";\nconst UNDEFINED_SENTINEL = \"\\u001D\";\n\n/**\n * Validates that all `matchOn` fields exist in the edge schema shape.\n * Throws a ValidationError for invalid fields.\n */\nfunction validateMatchOnFields(\n  schema: { shape?: Record<string, unknown> },\n  matchOn: readonly string[],\n  edgeKind: string,\n): void {\n  if (matchOn.length === 0) return;\n  const shape = schema.shape;\n  if (shape === undefined) {\n    throw new ValidationError(\n      `Edge kind \"${edgeKind}\" has no schema shape to validate matchOn fields against`,\n      {\n        kind: edgeKind,\n        operation: \"create\",\n        issues: matchOn.map((field) => ({\n          path: field,\n          message: `Field \"${field}\" does not exist in edge schema`,\n        })),\n      },\n    );\n  }\n\n  const invalidFields = matchOn.filter((field) => !(field in shape));\n  if (invalidFields.length > 0) {\n    throw new ValidationError(\n      `Invalid matchOn fields for edge kind \"${edgeKind}\": ${invalidFields.join(\", \")}`,\n      {\n        kind: edgeKind,\n        operation: \"create\",\n        issues: invalidFields.map((field) => ({\n          path: field,\n          message: `Field \"${field}\" does not exist in edge schema`,\n        })),\n      },\n    );\n  }\n}\n\n/**\n * Serializes a value for composite key construction.\n * Sorts object keys for deterministic ordering of nested values.\n */\nfunction stableStringify(value: unknown): string {\n  if (value === undefined) return UNDEFINED_SENTINEL;\n  if (value === null || typeof value !== \"object\") return JSON.stringify(value);\n  if (Array.isArray(value)) {\n    return `[${value.map((item) => stableStringify(item)).join(\",\")}]`;\n  }\n  const sorted = Object.keys(value).toSorted();\n  const entries = sorted.map(\n    (key) =>\n      `${JSON.stringify(key)}:${stableStringify((value as Record<string, unknown>)[key])}`,\n  );\n  return `{${entries.join(\",\")}}`;\n}\n\n/**\n * Builds a deterministic composite key for edge matching.\n *\n * Format: `fromKind\\u001EfromId\\u001EtoKind\\u001EtoId[\\u001Efield\\u001Fvalue]*`\n */\nfunction buildEdgeCompositeKey(\n  fromKind: string,\n  fromId: string,\n  toKind: string,\n  toId: string,\n  props: Record<string, unknown>,\n  matchOn: readonly string[],\n): string {\n  const endpointPart = `${fromKind}${RECORD_SEP}${fromId}${RECORD_SEP}${toKind}${RECORD_SEP}${toId}`;\n  if (matchOn.length === 0) return endpointPart;\n\n  const sortedFields = [...matchOn].toSorted();\n  const propertyParts = sortedFields.map(\n    (field) =>\n      `${RECORD_SEP}${field}${UNIT_SEP}${stableStringify(props[field])}`,\n  );\n  return endpointPart + propertyParts.join(\"\");\n}\n\n/**\n * Endpoint-only key for grouping findEdgesByKind queries.\n */\nfunction buildEndpointPairKey(\n  fromKind: string,\n  fromId: string,\n  toKind: string,\n  toId: string,\n): string {\n  return `${fromKind}${RECORD_SEP}${fromId}${RECORD_SEP}${toKind}${RECORD_SEP}${toId}`;\n}\n\ntype EdgeMatch = Readonly<{\n  liveRow: BackendEdgeRow | undefined;\n  deletedRow: BackendEdgeRow | undefined;\n}>;\n\n/**\n * Finds the best matching edge from candidate rows.\n * Partitions into live vs deleted; prefers live.\n */\nfunction findMatchingEdge(\n  rows: readonly BackendEdgeRow[],\n  matchOn: readonly string[],\n  inputProps: Record<string, unknown>,\n): EdgeMatch {\n  let liveRow: BackendEdgeRow | undefined;\n  let deletedRow: BackendEdgeRow | undefined;\n\n  for (const row of rows) {\n    if (matchOn.length > 0) {\n      const rowProps = JSON.parse(row.props) as Record<string, unknown>;\n      const matches = matchOn.every(\n        (field) =>\n          stableStringify(rowProps[field]) ===\n          stableStringify(inputProps[field]),\n      );\n      if (!matches) continue;\n    }\n\n    if (row.deleted_at === undefined) {\n      liveRow ??= row;\n    } else {\n      deletedRow ??= row;\n    }\n\n    if (liveRow !== undefined) break;\n  }\n\n  return { liveRow, deletedRow };\n}\n\n/**\n * Executes a single findByEndpoints operation.\n *\n * Looks up an edge by endpoints and optional matchOn fields, honoring the\n * temporal coordinate in `options` (mode / asOf / excludeDeleted) the same way\n * `findFrom` / `findTo` do. Returns the matching edge, or undefined. By default\n * soft-deleted and out-of-window edges are excluded; under `includeTombstones`\n * (excludeDeleted = false) a soft-deleted edge can be returned.\n */\nexport async function executeEdgeFindByEndpoints<G extends GraphDef>(\n  ctx: EdgeOperationContext<G>,\n  kind: string,\n  fromKind: string,\n  fromId: string,\n  toKind: string,\n  toId: string,\n  backend: GraphBackend | TransactionBackend,\n  options?: Readonly<{\n    matchOn?: readonly string[];\n    props?: Record<string, unknown>;\n    excludeDeleted?: boolean;\n    temporalMode?: TemporalMode;\n    asOf?: string;\n  }>,\n): Promise<Edge | undefined> {\n  const matchOn = options?.matchOn ?? [];\n  const props = options?.props ?? {};\n\n  const registration = getEdgeRegistration(ctx.graph, kind);\n  const edgeKind = registration.type;\n\n  if (matchOn.length > 0) {\n    validateMatchOnFields(edgeKind.schema, matchOn, kind);\n  }\n\n  const candidateRows = await backend.findEdgesByKind({\n    graphId: ctx.graphId,\n    kind,\n    fromKind,\n    fromId,\n    toKind,\n    toId,\n    excludeDeleted: options?.excludeDeleted ?? true,\n    ...(options?.temporalMode !== undefined && {\n      temporalMode: options.temporalMode,\n    }),\n    ...(options?.asOf !== undefined && { asOf: options.asOf }),\n  });\n\n  if (candidateRows.length === 0) return undefined;\n\n  if (matchOn.length === 0) return rowToEdge(candidateRows[0]!);\n\n  const { liveRow } = findMatchingEdge(candidateRows, matchOn, props);\n  return liveRow === undefined ? undefined : rowToEdge(liveRow);\n}\n\n/**\n * Executes a single getOrCreateByEndpoints operation.\n */\nexport async function executeEdgeGetOrCreateByEndpoints<G extends GraphDef>(\n  ctx: EdgeOperationContext<G>,\n  kind: string,\n  fromKind: string,\n  fromId: string,\n  toKind: string,\n  toId: string,\n  props: Record<string, unknown>,\n  backend: GraphBackend | TransactionBackend,\n  options?: Readonly<{\n    matchOn?: readonly string[];\n    ifExists?: IfExistsMode;\n  }>,\n): Promise<Readonly<{ edge: Edge; action: GetOrCreateAction }>> {\n  const ifExists = options?.ifExists ?? \"return\";\n  const matchOn = options?.matchOn ?? [];\n\n  const registration = getEdgeRegistration(ctx.graph, kind);\n  const edgeKind = registration.type;\n\n  // Validate props\n  const validatedProps = validateEdgeProps(edgeKind.schema, props, {\n    kind,\n    operation: \"create\",\n  });\n\n  // Validate matchOn fields\n  validateMatchOnFields(edgeKind.schema, matchOn, kind);\n\n  // Query all edges of this kind between (from, to) including tombstones\n  const candidateRows = await backend.findEdgesByKind({\n    graphId: ctx.graphId,\n    kind,\n    fromKind,\n    fromId,\n    toKind,\n    toId,\n    excludeDeleted: false,\n    temporalMode: \"includeTombstones\",\n  });\n\n  const { liveRow, deletedRow } = findMatchingEdge(\n    candidateRows,\n    matchOn,\n    validatedProps,\n  );\n\n  // No match → create new edge\n  if (liveRow === undefined && deletedRow === undefined) {\n    const input: CreateEdgeInput = {\n      kind,\n      fromKind,\n      fromId,\n      toKind,\n      toId,\n      props: validatedProps,\n    };\n    const edge = await executeEdgeCreate(ctx, input, backend);\n    return { edge, action: \"created\" };\n  }\n\n  // Live match found\n  if (liveRow !== undefined) {\n    if (ifExists === \"return\") {\n      return { edge: rowToEdge(liveRow), action: \"found\" };\n    }\n    // ifExists === \"update\"\n    const edge = await executeEdgeUpsertUpdate(\n      ctx,\n      { id: liveRow.id, props: validatedProps },\n      backend,\n    );\n    return { edge, action: \"updated\" };\n  }\n\n  // Deleted match only → check cardinality before resurrect\n  const cardinality = registration.cardinality ?? \"many\";\n  if (deletedRow === undefined) {\n    throw new Error(\"Expected deletedRow to be defined\");\n  }\n  const matchedDeletedRow = deletedRow;\n  const effectiveValidTo = matchedDeletedRow.valid_to;\n  const constraintContext: ConstraintContext = {\n    graphId: ctx.graphId,\n    registry: ctx.registry,\n    backend,\n  };\n  await checkCardinalityConstraint(\n    constraintContext,\n    kind,\n    cardinality,\n    fromKind,\n    fromId,\n    toKind,\n    toId,\n    effectiveValidTo,\n  );\n\n  const edge = await executeEdgeUpsertUpdate(\n    ctx,\n    { id: matchedDeletedRow.id, props: validatedProps },\n    backend,\n    { clearDeleted: true },\n  );\n  return { edge, action: \"resurrected\" };\n}\n\n/**\n * Executes a bulk getOrCreateByEndpoints operation.\n */\nexport async function executeEdgeBulkGetOrCreateByEndpoints<G extends GraphDef>(\n  ctx: EdgeOperationContext<G>,\n  kind: string,\n  items: readonly Readonly<{\n    fromKind: string;\n    fromId: string;\n    toKind: string;\n    toId: string;\n    props: Record<string, unknown>;\n  }>[],\n  backend: GraphBackend | TransactionBackend,\n  options?: Readonly<{\n    matchOn?: readonly string[];\n    ifExists?: IfExistsMode;\n  }>,\n): Promise<Readonly<{ edge: Edge; action: GetOrCreateAction }>[]> {\n  if (items.length === 0) return [];\n\n  const ifExists = options?.ifExists ?? \"return\";\n  const matchOn = options?.matchOn ?? [];\n\n  const registration = getEdgeRegistration(ctx.graph, kind);\n  const edgeKind = registration.type;\n  const cardinality = registration.cardinality ?? \"many\";\n\n  // Validate matchOn fields once\n  validateMatchOnFields(edgeKind.schema, matchOn, kind);\n\n  // Step 1: Validate all props and compute composite keys\n  const validated: {\n    fromKind: string;\n    fromId: string;\n    toKind: string;\n    toId: string;\n    validatedProps: Record<string, unknown>;\n    compositeKey: string;\n    endpointKey: string;\n  }[] = [];\n\n  for (const item of items) {\n    const validatedProps = validateEdgeProps(edgeKind.schema, item.props, {\n      kind,\n      operation: \"create\",\n    });\n\n    const compositeKey = buildEdgeCompositeKey(\n      item.fromKind,\n      item.fromId,\n      item.toKind,\n      item.toId,\n      validatedProps,\n      matchOn,\n    );\n    const endpointKey = buildEndpointPairKey(\n      item.fromKind,\n      item.fromId,\n      item.toKind,\n      item.toId,\n    );\n\n    validated.push({\n      fromKind: item.fromKind,\n      fromId: item.fromId,\n      toKind: item.toKind,\n      toId: item.toId,\n      validatedProps,\n      compositeKey,\n      endpointKey,\n    });\n  }\n\n  // Step 2: Group by unique endpoint pair and query edges\n  const uniqueEndpoints = new Map<\n    string,\n    { fromKind: string; fromId: string; toKind: string; toId: string }\n  >();\n  for (const entry of validated) {\n    if (!uniqueEndpoints.has(entry.endpointKey)) {\n      uniqueEndpoints.set(entry.endpointKey, {\n        fromKind: entry.fromKind,\n        fromId: entry.fromId,\n        toKind: entry.toKind,\n        toId: entry.toId,\n      });\n    }\n  }\n\n  // Fetch all candidate rows, grouped by endpoint pair\n  const rowsByEndpoint = new Map<string, readonly BackendEdgeRow[]>();\n  for (const [endpointKey, endpoint] of uniqueEndpoints) {\n    const rows = await backend.findEdgesByKind({\n      graphId: ctx.graphId,\n      kind,\n      fromKind: endpoint.fromKind,\n      fromId: endpoint.fromId,\n      toKind: endpoint.toKind,\n      toId: endpoint.toId,\n      excludeDeleted: false,\n      temporalMode: \"includeTombstones\",\n    });\n    rowsByEndpoint.set(endpointKey, rows);\n  }\n\n  // Step 3: Partition into toCreate, toFetch, and duplicates\n  interface CreateEntry {\n    index: number;\n    input: CreateEdgeInput;\n  }\n  interface FetchEntry {\n    index: number;\n    row: BackendEdgeRow;\n    isDeleted: boolean;\n    validatedProps: Record<string, unknown>;\n    fromKind: string;\n    fromId: string;\n    toKind: string;\n    toId: string;\n  }\n\n  const toCreate: CreateEntry[] = [];\n  const toFetch: FetchEntry[] = [];\n  const duplicateOf: { index: number; sourceIndex: number }[] = [];\n  const seenKeys = new Map<string, number>();\n\n  for (const [index, entry] of validated.entries()) {\n    // Check within-batch duplicate\n    const previousIndex = seenKeys.get(entry.compositeKey);\n    if (previousIndex !== undefined) {\n      duplicateOf.push({ index, sourceIndex: previousIndex });\n      continue;\n    }\n    seenKeys.set(entry.compositeKey, index);\n\n    const candidateRows = rowsByEndpoint.get(entry.endpointKey) ?? [];\n    const { liveRow, deletedRow } = findMatchingEdge(\n      candidateRows,\n      matchOn,\n      entry.validatedProps,\n    );\n\n    if (liveRow === undefined && deletedRow === undefined) {\n      toCreate.push({\n        index,\n        input: {\n          kind,\n          fromKind: entry.fromKind,\n          fromId: entry.fromId,\n          toKind: entry.toKind,\n          toId: entry.toId,\n          props: entry.validatedProps,\n        },\n      });\n    } else {\n      // At least one of liveRow/deletedRow is defined (both-undefined handled above)\n      const bestRow = liveRow ?? deletedRow;\n      if (bestRow === undefined) {\n        throw new Error(\"Expected at least one of liveRow or deletedRow\");\n      }\n      toFetch.push({\n        index,\n        row: bestRow,\n        isDeleted: liveRow === undefined,\n        validatedProps: entry.validatedProps,\n        fromKind: entry.fromKind,\n        fromId: entry.fromId,\n        toKind: entry.toKind,\n        toId: entry.toId,\n      });\n    }\n  }\n\n  interface Result {\n    readonly edge: Edge;\n    readonly action: GetOrCreateAction;\n  }\n  const results: Result[] = Array.from({ length: items.length });\n\n  // Step 4: Execute creates in batch\n  if (toCreate.length > 0) {\n    const createInputs = toCreate.map((entry) => entry.input);\n    const createdEdges = await executeEdgeCreateBatch(\n      ctx,\n      createInputs,\n      backend,\n    );\n    for (const [batchIndex, entry] of toCreate.entries()) {\n      results[entry.index] = {\n        edge: createdEdges[batchIndex]!,\n        action: \"created\",\n      };\n    }\n  }\n\n  // Step 5: Handle existing edges (update/skip/resurrect)\n  for (const entry of toFetch) {\n    if (entry.isDeleted) {\n      // Check cardinality before resurrect\n      const effectiveValidTo = entry.row.valid_to;\n      const constraintContext: ConstraintContext = {\n        graphId: ctx.graphId,\n        registry: ctx.registry,\n        backend,\n      };\n      await checkCardinalityConstraint(\n        constraintContext,\n        kind,\n        cardinality,\n        entry.fromKind,\n        entry.fromId,\n        entry.toKind,\n        entry.toId,\n        effectiveValidTo,\n      );\n\n      const edge = await executeEdgeUpsertUpdate(\n        ctx,\n        { id: entry.row.id, props: entry.validatedProps },\n        backend,\n        { clearDeleted: true },\n      );\n      results[entry.index] = { edge, action: \"resurrected\" };\n    } else if (ifExists === \"update\") {\n      const edge = await executeEdgeUpsertUpdate(\n        ctx,\n        { id: entry.row.id, props: entry.validatedProps },\n        backend,\n      );\n      results[entry.index] = { edge, action: \"updated\" };\n    } else {\n      results[entry.index] = { edge: rowToEdge(entry.row), action: \"found\" };\n    }\n  }\n\n  // Step 6: Resolve within-batch duplicates\n  for (const { index, sourceIndex } of duplicateOf) {\n    const sourceResult = results[sourceIndex]!;\n    results[index] = { edge: sourceResult.edge, action: \"found\" };\n  }\n\n  return results;\n}\n","/**\n * Uniqueness Constraint Management\n *\n * Handles checking, inserting, updating, and deleting uniqueness constraint entries.\n */\nimport { type GraphBackend, type TransactionBackend } from \"../backend/types\";\nimport {\n  checkWherePredicate,\n  computeUniqueKey,\n  getKindsForUniquenessCheck,\n} from \"../constraints\";\nimport { type UniqueConstraint } from \"../core/types\";\nimport { UniquenessError } from \"../errors\";\nimport { type KindRegistry } from \"../registry/kind-registry\";\n\n/**\n * Context for uniqueness operations.\n */\nexport type UniquenessContext = Readonly<{\n  graphId: string;\n  registry: KindRegistry;\n  backend: GraphBackend | TransactionBackend;\n}>;\n\n/**\n * Checks uniqueness constraints for a new or existing node.\n *\n * @throws ValidationError if any constraint is violated\n */\nexport async function checkUniquenessConstraints(\n  ctx: UniquenessContext,\n  kind: string,\n  id: string,\n  props: Record<string, unknown>,\n  constraints: readonly UniqueConstraint[],\n): Promise<void> {\n  for (const constraint of constraints) {\n    if (!checkWherePredicate(constraint, props)) {\n      continue;\n    }\n\n    const key = computeUniqueKey(\n      props,\n      constraint.fields,\n      constraint.collation,\n    );\n\n    const kindsToCheck = getKindsForUniquenessCheck(\n      kind,\n      constraint.scope,\n      ctx.registry,\n    );\n\n    for (const kindToCheck of kindsToCheck) {\n      const existing = await ctx.backend.checkUnique({\n        graphId: ctx.graphId,\n        nodeKind: kindToCheck,\n        constraintName: constraint.name,\n        key,\n      });\n\n      if (existing && existing.node_id !== id) {\n        throw new UniquenessError({\n          constraintName: constraint.name,\n          kind: kindToCheck,\n          existingId: existing.node_id,\n          newId: id,\n          fields: constraint.fields,\n        });\n      }\n    }\n  }\n}\n\n/**\n * Inserts uniqueness entries for a newly created node.\n */\nexport async function insertUniquenessEntries(\n  ctx: UniquenessContext,\n  kind: string,\n  id: string,\n  props: Record<string, unknown>,\n  constraints: readonly UniqueConstraint[],\n): Promise<void> {\n  for (const constraint of constraints) {\n    if (!checkWherePredicate(constraint, props)) {\n      continue;\n    }\n\n    const key = computeUniqueKey(\n      props,\n      constraint.fields,\n      constraint.collation,\n    );\n\n    await ctx.backend.insertUnique({\n      graphId: ctx.graphId,\n      nodeKind: kind,\n      constraintName: constraint.name,\n      key,\n      nodeId: id,\n      concreteKind: kind,\n    });\n  }\n}\n\n/**\n * Deletes uniqueness entries for a node being deleted.\n */\nexport async function deleteUniquenessEntries(\n  ctx: UniquenessContext,\n  kind: string,\n  props: Record<string, unknown>,\n  constraints: readonly UniqueConstraint[],\n): Promise<void> {\n  for (const constraint of constraints) {\n    if (!checkWherePredicate(constraint, props)) {\n      continue;\n    }\n\n    const key = computeUniqueKey(\n      props,\n      constraint.fields,\n      constraint.collation,\n    );\n\n    await ctx.backend.deleteUnique({\n      graphId: ctx.graphId,\n      nodeKind: kind,\n      constraintName: constraint.name,\n      key,\n    });\n  }\n}\n\n/**\n * Updates uniqueness entries when a node's props change.\n * Handles cases where:\n * - Constraint now applies (wasn't before)\n * - Constraint no longer applies (was before)\n * - Key value changed\n *\n * @throws ValidationError if updated value violates a constraint\n */\nexport async function updateUniquenessEntries(\n  ctx: UniquenessContext,\n  kind: string,\n  id: string,\n  oldProps: Record<string, unknown>,\n  newProps: Record<string, unknown>,\n  constraints: readonly UniqueConstraint[],\n): Promise<void> {\n  for (const constraint of constraints) {\n    const oldApplies = checkWherePredicate(constraint, oldProps);\n    const newApplies = checkWherePredicate(constraint, newProps);\n\n    const oldKey =\n      oldApplies ?\n        computeUniqueKey(oldProps, constraint.fields, constraint.collation)\n      : undefined;\n    const newKey =\n      newApplies ?\n        computeUniqueKey(newProps, constraint.fields, constraint.collation)\n      : undefined;\n\n    // No change - constraint didn't apply and still doesn't\n    if (!oldApplies && !newApplies) {\n      continue;\n    }\n\n    // Keys are the same and constraint still applies - nothing to do\n    if (oldApplies && newApplies && oldKey === newKey) {\n      continue;\n    }\n\n    // Delete old entry if constraint used to apply\n    if (oldApplies && oldKey !== undefined) {\n      await ctx.backend.deleteUnique({\n        graphId: ctx.graphId,\n        nodeKind: kind,\n        constraintName: constraint.name,\n        key: oldKey,\n      });\n    }\n\n    // Check and insert new entry if constraint now applies\n    if (newApplies && newKey !== undefined) {\n      const kindsToCheck = getKindsForUniquenessCheck(\n        kind,\n        constraint.scope,\n        ctx.registry,\n      );\n\n      // Check for conflicts with other nodes\n      for (const kindToCheck of kindsToCheck) {\n        const existing = await ctx.backend.checkUnique({\n          graphId: ctx.graphId,\n          nodeKind: kindToCheck,\n          constraintName: constraint.name,\n          key: newKey,\n        });\n\n        if (existing && existing.node_id !== id) {\n          throw new UniquenessError({\n            constraintName: constraint.name,\n            kind: kindToCheck,\n            existingId: existing.node_id,\n            newId: id,\n            fields: constraint.fields,\n          });\n        }\n      }\n\n      // Insert new uniqueness entry\n      await ctx.backend.insertUnique({\n        graphId: ctx.graphId,\n        nodeKind: kind,\n        constraintName: constraint.name,\n        key: newKey,\n        nodeId: id,\n        concreteKind: kind,\n      });\n    }\n  }\n}\n","/**\n * Node Operations for Store\n *\n * Handles node CRUD operations: create, update, delete.\n */\nimport { type SQL, sql } from \"drizzle-orm\";\n\nimport {\n  type GraphBackend,\n  type InsertNodeParams,\n  type NodeRow as BackendNodeRow,\n  type TransactionBackend,\n  type UniqueRow,\n} from \"../../backend/types\";\nimport {\n  checkWherePredicate,\n  computeUniqueKey,\n  getKindsForUniquenessCheck,\n} from \"../../constraints\";\nimport { type GraphDef } from \"../../core/define-graph\";\nimport {\n  type KindEntity,\n  type NodeType,\n  type UniqueConstraint,\n} from \"../../core/types\";\nimport {\n  ConfigurationError,\n  DatabaseOperationError,\n  KindNotFoundError,\n  NodeConstraintNotFoundError,\n  NodeIndexNotFoundError,\n  NodeNotFoundError,\n  RestrictedDeleteError,\n  ValidationError,\n} from \"../../errors\";\nimport { validateNodeProps } from \"../../errors/validation\";\nimport {\n  compileIndexWhere,\n  compileNodeIndexFieldKeys,\n  type IndexCompilationContext,\n} from \"../../indexes/compiler\";\nimport { type NodeIndexDeclaration } from \"../../indexes/types\";\nimport { type ValueType } from \"../../query/ast\";\nimport {\n  createSqlSchema,\n  DEFAULT_SQL_SCHEMA,\n} from \"../../query/compiler/schema\";\nimport { getDialect } from \"../../query/dialect\";\nimport { type DialectAdapter } from \"../../query/dialect/types\";\nimport { type JsonPointer, resolveJsonPointer } from \"../../query/json-pointer\";\nimport { type KindRegistry } from \"../../registry/kind-registry\";\nimport { validateOptionalCanonicalIsoDate } from \"../../utils/date\";\nimport { generateId } from \"../../utils/id\";\nimport {\n  checkDisjointnessConstraint,\n  type ConstraintContext,\n} from \"../constraints\";\nimport {\n  deleteNodeEmbeddings,\n  type EmbeddingSyncContext,\n  syncEmbeddings,\n} from \"../embedding-sync\";\nimport {\n  deleteNodeFulltext,\n  type FulltextSyncContext,\n  syncFulltext,\n} from \"../fulltext-sync\";\nimport { getNodeRowsByIds } from \"../node-fetch\";\nimport { rowToNode } from \"../row-mappers\";\nimport {\n  type CreateNodeInput,\n  type GetOrCreateAction,\n  type Node,\n  type NodeBulkFindByIndexOptions,\n  type NodeGetOrCreateByConstraintOptions,\n  type OperationHookContext,\n  type UpdateNodeInput,\n} from \"../types\";\nimport {\n  checkUniquenessConstraints,\n  deleteUniquenessEntries,\n  insertUniquenessEntries,\n  type UniquenessContext,\n  updateUniquenessEntries,\n} from \"../uniqueness\";\n\n// ============================================================\n// Types\n// ============================================================\n\nexport type NodeOperationContext<G extends GraphDef> = Readonly<{\n  graph: G;\n  graphId: string;\n  registry: KindRegistry;\n  createOperationContext: (\n    operation: \"create\" | \"update\" | \"delete\",\n    entity: KindEntity,\n    kind: string,\n    id: string,\n  ) => OperationHookContext;\n  withOperationHooks: <T>(\n    ctx: OperationHookContext,\n    fn: () => Promise<T>,\n  ) => Promise<T>;\n}>;\n\ntype NodeCreatePrepared = Readonly<{\n  kind: string;\n  id: string;\n  nodeKind: NodeType;\n  validatedProps: Record<string, unknown>;\n  uniqueConstraints: readonly UniqueConstraint[];\n  insertParams: InsertNodeParams;\n}>;\n\ntype CachedNodeRow = Awaited<ReturnType<GraphBackend[\"getNode\"]>>;\ntype CachedUniqueRow = Awaited<ReturnType<GraphBackend[\"checkUnique\"]>>;\n\ntype DeleteMode = \"soft\" | \"hard\";\n\n// ============================================================\n// Helper Functions\n// ============================================================\n\nfunction getNodeRegistration<G extends GraphDef>(graph: G, kind: string) {\n  const registration = graph.nodes[kind];\n  if (registration === undefined) throw new KindNotFoundError(kind, \"node\");\n  return registration;\n}\n\nconst CACHE_KEY_SEPARATOR = \"\\u0000\";\n\nfunction buildNodeCacheKey(graphId: string, kind: string, id: string): string {\n  return `${graphId}${CACHE_KEY_SEPARATOR}${kind}${CACHE_KEY_SEPARATOR}${id}`;\n}\n\nfunction buildUniqueCacheKey(\n  graphId: string,\n  nodeKind: string,\n  constraintName: string,\n  key: string,\n): string {\n  return `${graphId}${CACHE_KEY_SEPARATOR}${nodeKind}${CACHE_KEY_SEPARATOR}${constraintName}${CACHE_KEY_SEPARATOR}${key}`;\n}\n\nfunction createNodeAlreadyExistsError(\n  kind: string,\n  id: string,\n): ValidationError {\n  return new ValidationError(\n    `Node already exists: ${kind}/${id}`,\n    {\n      entityType: \"node\",\n      kind,\n      operation: \"create\",\n      id,\n      issues: [{ path: \"id\", message: \"A node with this ID already exists\" }],\n    },\n    { suggestion: `Use a different ID or update the existing node.` },\n  );\n}\n\nfunction buildInsertNodeParams(\n  graphId: string,\n  kind: string,\n  id: string,\n  props: Record<string, unknown>,\n  validFrom: string | undefined,\n  validTo: string | undefined,\n): InsertNodeParams {\n  const insertParams: {\n    graphId: string;\n    kind: string;\n    id: string;\n    props: Record<string, unknown>;\n    validFrom?: string;\n    validTo?: string;\n  } = {\n    graphId,\n    kind,\n    id,\n    props,\n  };\n  if (validFrom !== undefined) insertParams.validFrom = validFrom;\n  if (validTo !== undefined) insertParams.validTo = validTo;\n  return insertParams;\n}\n\nfunction createPendingUniqueRow(\n  graphId: string,\n  nodeKind: string,\n  constraintName: string,\n  key: string,\n  nodeId: string,\n): UniqueRow {\n  return {\n    graph_id: graphId,\n    node_kind: nodeKind,\n    constraint_name: constraintName,\n    key,\n    node_id: nodeId,\n    concrete_kind: nodeKind,\n    deleted_at: undefined,\n  };\n}\n\nfunction resolveConstraint<G extends GraphDef>(\n  graph: G,\n  kind: string,\n  constraintName: string,\n): UniqueConstraint {\n  const registration = getNodeRegistration(graph, kind);\n  const constraints = registration.unique ?? [];\n  const constraint = constraints.find(\n    (candidate) => candidate.name === constraintName,\n  );\n  if (constraint === undefined) {\n    throw new NodeConstraintNotFoundError(constraintName, kind);\n  }\n  return constraint;\n}\n\nfunction createUniquenessContext(\n  graphId: string,\n  registry: KindRegistry,\n  backend: GraphBackend | TransactionBackend,\n): UniquenessContext {\n  return { graphId, registry, backend };\n}\n\nfunction createEmbeddingSyncContext(\n  graphId: string,\n  nodeKind: string,\n  nodeId: string,\n  backend: GraphBackend | TransactionBackend,\n): EmbeddingSyncContext {\n  return { graphId, nodeKind, nodeId, backend };\n}\n\nfunction createFulltextSyncContext(\n  graphId: string,\n  nodeKind: string,\n  nodeId: string,\n  backend: GraphBackend | TransactionBackend,\n): FulltextSyncContext {\n  return { graphId, nodeKind, nodeId, backend };\n}\n\n// ============================================================\n// Batch Validation Cache\n//\n// During batch operations, multiple items may reference the same\n// nodes/unique keys. This cache avoids redundant backend lookups\n// and tracks pending (not-yet-flushed) inserts so that later items\n// in the batch can see earlier ones during validation.\n// ============================================================\n\nfunction createNodeBatchValidationBackend(\n  graphId: string,\n  registry: KindRegistry,\n  backend: GraphBackend | TransactionBackend,\n): Readonly<{\n  backend: GraphBackend | TransactionBackend;\n  registerPendingNode: (params: InsertNodeParams) => void;\n  registerPendingUniqueEntries: (\n    kind: string,\n    id: string,\n    props: Record<string, unknown>,\n    constraints: readonly UniqueConstraint[],\n  ) => void;\n}> {\n  const nodeCache = new Map<string, CachedNodeRow>();\n  const pendingNodes = new Map<string, NonNullable<CachedNodeRow>>();\n  const uniqueCache = new Map<string, CachedUniqueRow>();\n  const pendingUniqueOwners = new Map<string, string>();\n\n  async function getNodeCached(\n    lookupGraphId: string,\n    kind: string,\n    id: string,\n  ): Promise<CachedNodeRow> {\n    const cacheKey = buildNodeCacheKey(lookupGraphId, kind, id);\n    const pendingNode = pendingNodes.get(cacheKey);\n    if (pendingNode !== undefined) return pendingNode;\n    if (nodeCache.has(cacheKey)) return nodeCache.get(cacheKey);\n    const existing = await backend.getNode(lookupGraphId, kind, id);\n    nodeCache.set(cacheKey, existing);\n    return existing;\n  }\n\n  async function checkUniqueCached(\n    params: Parameters<GraphBackend[\"checkUnique\"]>[0],\n  ): Promise<CachedUniqueRow> {\n    const cacheKey = buildUniqueCacheKey(\n      params.graphId,\n      params.nodeKind,\n      params.constraintName,\n      params.key,\n    );\n    const pendingOwner = pendingUniqueOwners.get(cacheKey);\n    if (pendingOwner !== undefined) {\n      return createPendingUniqueRow(\n        params.graphId,\n        params.nodeKind,\n        params.constraintName,\n        params.key,\n        pendingOwner,\n      );\n    }\n    if (uniqueCache.has(cacheKey)) return uniqueCache.get(cacheKey);\n    const existing = await backend.checkUnique(params);\n    uniqueCache.set(cacheKey, existing);\n    return existing;\n  }\n\n  function registerPendingNode(params: InsertNodeParams): void {\n    const cacheKey = buildNodeCacheKey(params.graphId, params.kind, params.id);\n    pendingNodes.set(cacheKey, {\n      graph_id: params.graphId,\n      kind: params.kind,\n      id: params.id,\n      props: JSON.stringify(params.props),\n      version: 1,\n      valid_from: params.validFrom,\n      valid_to: params.validTo,\n      created_at: \"\",\n      updated_at: \"\",\n      deleted_at: undefined,\n    });\n  }\n\n  function registerPendingUniqueEntries(\n    kind: string,\n    id: string,\n    props: Record<string, unknown>,\n    constraints: readonly UniqueConstraint[],\n  ): void {\n    for (const constraint of constraints) {\n      if (!checkWherePredicate(constraint, props)) continue;\n\n      const key = computeUniqueKey(\n        props,\n        constraint.fields,\n        constraint.collation,\n      );\n      const concreteEntryKey = buildUniqueCacheKey(\n        graphId,\n        kind,\n        constraint.name,\n        key,\n      );\n      pendingUniqueOwners.set(concreteEntryKey, id);\n\n      if (constraint.scope !== \"kind\") {\n        const kindsToCheck = getKindsForUniquenessCheck(\n          kind,\n          constraint.scope,\n          registry,\n        );\n        for (const kindToCheck of kindsToCheck) {\n          const inheritedEntryKey = buildUniqueCacheKey(\n            graphId,\n            kindToCheck,\n            constraint.name,\n            key,\n          );\n          pendingUniqueOwners.set(inheritedEntryKey, id);\n        }\n      }\n    }\n  }\n\n  // The cast is necessary because spreading a union type (GraphBackend | TransactionBackend)\n  // produces an intersection of their members, which TypeScript can't narrow back to the union.\n  const validationBackend = {\n    ...backend,\n    getNode: getNodeCached,\n    checkUnique: checkUniqueCached,\n  } as GraphBackend | TransactionBackend;\n\n  return {\n    backend: validationBackend,\n    registerPendingNode,\n    registerPendingUniqueEntries,\n  };\n}\n\n// ============================================================\n// Shared Create Pipeline\n// ============================================================\n\nasync function validateAndPrepareNodeCreate<G extends GraphDef>(\n  ctx: NodeOperationContext<G>,\n  input: CreateNodeInput,\n  id: string,\n  backend: GraphBackend | TransactionBackend,\n): Promise<NodeCreatePrepared> {\n  const kind = input.kind;\n  const registration = getNodeRegistration(ctx.graph, kind);\n  const nodeKind = registration.type;\n\n  const validatedProps = validateNodeProps(nodeKind.schema, input.props, {\n    kind,\n    operation: \"create\",\n  });\n\n  const validFrom = validateOptionalCanonicalIsoDate(\n    input.validFrom,\n    \"validFrom\",\n  );\n  const validTo = validateOptionalCanonicalIsoDate(input.validTo, \"validTo\");\n\n  const existingNode = await backend.getNode(ctx.graphId, kind, id);\n  if (existingNode && !existingNode.deleted_at) {\n    throw createNodeAlreadyExistsError(kind, id);\n  }\n\n  const constraintContext: ConstraintContext = {\n    graphId: ctx.graphId,\n    registry: ctx.registry,\n    backend,\n  };\n  await checkDisjointnessConstraint(constraintContext, kind, id);\n\n  const uniqueConstraints = registration.unique ?? [];\n  await checkUniquenessConstraints(\n    createUniquenessContext(ctx.graphId, ctx.registry, backend),\n    kind,\n    id,\n    validatedProps,\n    uniqueConstraints,\n  );\n\n  return {\n    kind,\n    id,\n    nodeKind,\n    validatedProps,\n    uniqueConstraints,\n    insertParams: buildInsertNodeParams(\n      ctx.graphId,\n      kind,\n      id,\n      validatedProps,\n      validFrom,\n      validTo,\n    ),\n  };\n}\n\nasync function finalizeNodeCreate<G extends GraphDef>(\n  ctx: NodeOperationContext<G>,\n  prepared: NodeCreatePrepared,\n  backend: GraphBackend | TransactionBackend,\n): Promise<void> {\n  await insertUniquenessEntries(\n    createUniquenessContext(ctx.graphId, ctx.registry, backend),\n    prepared.kind,\n    prepared.id,\n    prepared.validatedProps,\n    prepared.uniqueConstraints,\n  );\n\n  await syncEmbeddings(\n    createEmbeddingSyncContext(\n      ctx.graphId,\n      prepared.kind,\n      prepared.id,\n      backend,\n    ),\n    prepared.nodeKind.schema,\n    prepared.validatedProps,\n  );\n\n  await syncFulltext(\n    createFulltextSyncContext(ctx.graphId, prepared.kind, prepared.id, backend),\n    prepared.nodeKind.schema,\n    prepared.validatedProps,\n  );\n}\n\n// ============================================================\n// Shared Update Pipeline\n//\n// executeNodeUpdate wraps this in operation hooks.\n// executeNodeUpsertUpdate calls it directly (no hooks) for\n// getOrCreate resurrections.\n// ============================================================\n\nasync function performNodeUpdate<G extends GraphDef>(\n  ctx: NodeOperationContext<G>,\n  input: UpdateNodeInput,\n  backend: GraphBackend | TransactionBackend,\n  options?: Readonly<{ clearDeleted?: boolean }>,\n): Promise<Node> {\n  const { kind, id } = input;\n  const registration = getNodeRegistration(ctx.graph, kind);\n\n  const existing = await backend.getNode(ctx.graphId, kind, id);\n  if (!existing || (existing.deleted_at && !options?.clearDeleted)) {\n    throw new NodeNotFoundError(kind, id);\n  }\n\n  const existingProps = JSON.parse(existing.props) as Record<string, unknown>;\n  const mergedProps = { ...existingProps, ...input.props };\n\n  const nodeKind = registration.type;\n  const validatedProps = validateNodeProps(nodeKind.schema, mergedProps, {\n    kind,\n    operation: \"update\",\n    id,\n  });\n\n  const validTo = validateOptionalCanonicalIsoDate(input.validTo, \"validTo\");\n\n  await updateUniquenessEntries(\n    createUniquenessContext(ctx.graphId, ctx.registry, backend),\n    kind,\n    id,\n    existingProps,\n    validatedProps,\n    registration.unique ?? [],\n  );\n\n  const updateParams: {\n    graphId: string;\n    kind: string;\n    id: string;\n    props: Record<string, unknown>;\n    validTo?: string;\n    incrementVersion?: boolean;\n    clearDeleted?: boolean;\n  } = {\n    graphId: ctx.graphId,\n    kind,\n    id,\n    props: validatedProps,\n    incrementVersion: true,\n  };\n  if (validTo !== undefined) updateParams.validTo = validTo;\n  if (options?.clearDeleted) updateParams.clearDeleted = true;\n\n  const row = await backend.updateNode(updateParams);\n\n  await syncEmbeddings(\n    createEmbeddingSyncContext(ctx.graphId, kind, id, backend),\n    nodeKind.schema,\n    validatedProps,\n  );\n\n  await syncFulltext(\n    createFulltextSyncContext(ctx.graphId, kind, id, backend),\n    nodeKind.schema,\n    validatedProps,\n  );\n\n  return rowToNode(row);\n}\n\n// ============================================================\n// Shared Delete Pipeline\n//\n// Soft and hard delete share the same delete-behavior logic\n// (restrict / cascade / disconnect). The only differences are:\n// - whether soft-deleted nodes are skippable (soft) or deletable (hard)\n// - which backend method removes edges and the node itself\n// ============================================================\n\nasync function enforceDeleteBehavior<G extends GraphDef>(\n  ctx: NodeOperationContext<G>,\n  kind: string,\n  id: string,\n  mode: DeleteMode,\n  backend: GraphBackend | TransactionBackend,\n  registration: ReturnType<typeof getNodeRegistration>,\n): Promise<void> {\n  const deleteBehavior = registration.onDelete ?? \"restrict\";\n  const connectedEdges = await backend.findEdgesConnectedTo({\n    graphId: ctx.graphId,\n    nodeKind: kind,\n    nodeId: id,\n  });\n\n  if (connectedEdges.length === 0) return;\n\n  switch (deleteBehavior) {\n    case \"restrict\": {\n      const edgeKinds = [...new Set(connectedEdges.map((edge) => edge.kind))];\n      throw new RestrictedDeleteError({\n        nodeKind: kind,\n        nodeId: id,\n        edgeCount: connectedEdges.length,\n        edgeKinds,\n      });\n    }\n\n    case \"cascade\":\n    case \"disconnect\": {\n      // Both behaviors remove connected edges. \"cascade\" signals intent to\n      // remove dependent data; \"disconnect\" signals intent to sever the\n      // relationship. The effect is identical because edges cannot exist\n      // without both endpoints.\n      for (const edge of connectedEdges) {\n        await (mode === \"hard\" ?\n          backend.hardDeleteEdge({\n            graphId: ctx.graphId,\n            id: edge.id,\n          })\n        : backend.deleteEdge({\n            graphId: ctx.graphId,\n            id: edge.id,\n          }));\n      }\n      break;\n    }\n  }\n}\n\n// ============================================================\n// Shared Batch Preparation\n//\n// Both returning and non-returning batch creates share the same\n// validate-and-register loop. This extracts it.\n// ============================================================\n\nasync function prepareBatchCreates<G extends GraphDef>(\n  ctx: NodeOperationContext<G>,\n  inputs: readonly CreateNodeInput[],\n  backend: GraphBackend | TransactionBackend,\n): Promise<{\n  preparedCreates: NodeCreatePrepared[];\n  batchInsertParams: InsertNodeParams[];\n}> {\n  const {\n    backend: validationBackend,\n    registerPendingNode,\n    registerPendingUniqueEntries,\n  } = createNodeBatchValidationBackend(ctx.graphId, ctx.registry, backend);\n\n  const preparedCreates: NodeCreatePrepared[] = [];\n\n  for (const input of inputs) {\n    const id = input.id ?? generateId();\n    const prepared = await validateAndPrepareNodeCreate(\n      ctx,\n      input,\n      id,\n      validationBackend,\n    );\n    preparedCreates.push(prepared);\n    registerPendingNode(prepared.insertParams);\n    registerPendingUniqueEntries(\n      prepared.kind,\n      prepared.id,\n      prepared.validatedProps,\n      prepared.uniqueConstraints,\n    );\n  }\n\n  const batchInsertParams = preparedCreates.map(\n    (prepared) => prepared.insertParams,\n  );\n\n  return { preparedCreates, batchInsertParams };\n}\n\n// ============================================================\n// Shared Constraint Lookup\n//\n// Both single and bulk find/getOrCreate operations need to look up\n// unique constraint entries across all applicable kinds.\n// ============================================================\n\nasync function findUniqueRowAcrossKinds(\n  backend: GraphBackend | TransactionBackend,\n  graphId: string,\n  constraintName: string,\n  key: string,\n  kindsToCheck: readonly string[],\n  includeDeleted: boolean,\n): Promise<\n  | { node_id: string; concrete_kind: string; deleted_at: string | undefined }\n  | undefined\n> {\n  for (const kindToCheck of kindsToCheck) {\n    const row = await backend.checkUnique({\n      graphId,\n      nodeKind: kindToCheck,\n      constraintName,\n      key,\n      includeDeleted,\n    });\n    if (row !== undefined) return row;\n  }\n  return undefined;\n}\n\ninterface UniqueMatchRow {\n  node_id: string;\n  concrete_kind: string;\n  deleted_at: string | undefined;\n}\n\nasync function batchCheckUniqueAcrossKinds(\n  backend: GraphBackend | TransactionBackend,\n  graphId: string,\n  constraintName: string,\n  uniqueKeys: readonly string[],\n  kindsToCheck: readonly string[],\n  includeDeleted: boolean,\n): Promise<Map<string, UniqueMatchRow>> {\n  const existingByKey = new Map<string, UniqueMatchRow>();\n\n  for (const kindToCheck of kindsToCheck) {\n    if (backend.checkUniqueBatch === undefined) {\n      for (const key of uniqueKeys) {\n        if (existingByKey.has(key)) continue;\n        const row = await backend.checkUnique({\n          graphId,\n          nodeKind: kindToCheck,\n          constraintName,\n          key,\n          includeDeleted,\n        });\n        if (row !== undefined) {\n          existingByKey.set(row.key, row);\n        }\n      }\n    } else {\n      const rows = await backend.checkUniqueBatch({\n        graphId,\n        nodeKind: kindToCheck,\n        constraintName,\n        keys: uniqueKeys,\n        includeDeleted,\n      });\n      for (const row of rows) {\n        if (!existingByKey.has(row.key)) {\n          existingByKey.set(row.key, row);\n        }\n      }\n    }\n  }\n\n  return existingByKey;\n}\n\n// ============================================================\n// Node Create Operations\n// ============================================================\n\nasync function executeNodeCreateInternal<G extends GraphDef>(\n  ctx: NodeOperationContext<G>,\n  input: CreateNodeInput,\n  backend: GraphBackend | TransactionBackend,\n  options?: Readonly<{ returnRow?: boolean }>,\n): Promise<Node | undefined> {\n  const kind = input.kind;\n  const id = input.id ?? generateId();\n  const opContext = ctx.createOperationContext(\"create\", \"node\", kind, id);\n  const shouldReturnRow = options?.returnRow ?? true;\n\n  return ctx.withOperationHooks(opContext, async () => {\n    const prepared = await validateAndPrepareNodeCreate(\n      ctx,\n      input,\n      id,\n      backend,\n    );\n\n    let row: BackendNodeRow | undefined;\n    if (shouldReturnRow) {\n      row = await backend.insertNode(prepared.insertParams);\n    } else {\n      await (backend.insertNodeNoReturn?.(prepared.insertParams) ??\n        backend.insertNode(prepared.insertParams));\n    }\n\n    await finalizeNodeCreate(ctx, prepared, backend);\n\n    if (row === undefined) return;\n    return rowToNode(row);\n  });\n}\n\nexport async function executeNodeCreate<G extends GraphDef>(\n  ctx: NodeOperationContext<G>,\n  input: CreateNodeInput,\n  backend: GraphBackend | TransactionBackend,\n): Promise<Node> {\n  const result = await executeNodeCreateInternal(ctx, input, backend, {\n    returnRow: true,\n  });\n  if (!result) {\n    throw new DatabaseOperationError(\n      \"Node create failed: expected created node row\",\n      { operation: \"insert\", entity: \"node\" },\n    );\n  }\n  return result;\n}\n\nexport async function executeNodeCreateNoReturn<G extends GraphDef>(\n  ctx: NodeOperationContext<G>,\n  input: CreateNodeInput,\n  backend: GraphBackend | TransactionBackend,\n): Promise<void> {\n  await executeNodeCreateInternal(ctx, input, backend, { returnRow: false });\n}\n\n/**\n * Executes batched node creates without returning inserted node payloads.\n *\n * Note: `withOperationHooks` is intentionally skipped for batch throughput.\n * Per-item hooks would negate the performance benefit of batching.\n */\nexport async function executeNodeCreateNoReturnBatch<G extends GraphDef>(\n  ctx: NodeOperationContext<G>,\n  inputs: readonly CreateNodeInput[],\n  backend: GraphBackend | TransactionBackend,\n): Promise<void> {\n  if (inputs.length === 0) return;\n\n  const { preparedCreates, batchInsertParams } = await prepareBatchCreates(\n    ctx,\n    inputs,\n    backend,\n  );\n\n  if (backend.insertNodesBatch === undefined) {\n    for (const insertParams of batchInsertParams) {\n      await (backend.insertNodeNoReturn?.(insertParams) ??\n        backend.insertNode(insertParams));\n    }\n  } else {\n    await backend.insertNodesBatch(batchInsertParams);\n  }\n\n  for (const prepared of preparedCreates) {\n    await finalizeNodeCreate(ctx, prepared, backend);\n  }\n}\n\n/**\n * Executes batched node creates and returns the inserted node payloads.\n *\n * Uses batch validation caching and a single multi-row INSERT with RETURNING\n * when the backend supports it. Falls back to sequential inserts otherwise.\n *\n * Note: `withOperationHooks` is intentionally skipped for batch throughput.\n * Per-item hooks would negate the performance benefit of batching.\n */\nexport async function executeNodeCreateBatch<G extends GraphDef>(\n  ctx: NodeOperationContext<G>,\n  inputs: readonly CreateNodeInput[],\n  backend: GraphBackend | TransactionBackend,\n): Promise<readonly Node[]> {\n  if (inputs.length === 0) return [];\n\n  const { preparedCreates, batchInsertParams } = await prepareBatchCreates(\n    ctx,\n    inputs,\n    backend,\n  );\n\n  let rows: readonly BackendNodeRow[];\n  if (backend.insertNodesBatchReturning === undefined) {\n    const sequentialRows: BackendNodeRow[] = [];\n    for (const insertParams of batchInsertParams) {\n      sequentialRows.push(await backend.insertNode(insertParams));\n    }\n    rows = sequentialRows;\n  } else {\n    rows = await backend.insertNodesBatchReturning(batchInsertParams);\n  }\n\n  for (const prepared of preparedCreates) {\n    await finalizeNodeCreate(ctx, prepared, backend);\n  }\n\n  return rows.map((row) => rowToNode(row));\n}\n\n// ============================================================\n// Node Update Operations\n// ============================================================\n\nexport async function executeNodeUpdate<G extends GraphDef>(\n  ctx: NodeOperationContext<G>,\n  input: UpdateNodeInput,\n  backend: GraphBackend | TransactionBackend,\n  options?: Readonly<{ clearDeleted?: boolean }>,\n): Promise<Node> {\n  const opContext = ctx.createOperationContext(\n    \"update\",\n    \"node\",\n    input.kind,\n    input.id,\n  );\n  return ctx.withOperationHooks(opContext, () =>\n    performNodeUpdate(ctx, input, backend, options),\n  );\n}\n\n/**\n * Executes a node update for upsert — bypasses operation hooks\n * and allows updating soft-deleted nodes when clearDeleted is set.\n */\nexport async function executeNodeUpsertUpdate<G extends GraphDef>(\n  ctx: NodeOperationContext<G>,\n  input: UpdateNodeInput,\n  backend: GraphBackend | TransactionBackend,\n  options?: Readonly<{ clearDeleted?: boolean }>,\n): Promise<Node> {\n  return performNodeUpdate(ctx, input, backend, options);\n}\n\n// ============================================================\n// Node Delete Operations\n// ============================================================\n\nexport async function executeNodeDelete<G extends GraphDef>(\n  ctx: NodeOperationContext<G>,\n  kind: string,\n  id: string,\n  backend: GraphBackend | TransactionBackend,\n): Promise<void> {\n  const opContext = ctx.createOperationContext(\"delete\", \"node\", kind, id);\n\n  return ctx.withOperationHooks(opContext, async () => {\n    const registration = getNodeRegistration(ctx.graph, kind);\n\n    const existing = await backend.getNode(ctx.graphId, kind, id);\n    if (!existing || existing.deleted_at) return;\n\n    const existingProps = JSON.parse(existing.props) as Record<string, unknown>;\n\n    await enforceDeleteBehavior(ctx, kind, id, \"soft\", backend, registration);\n\n    await backend.deleteNode({ graphId: ctx.graphId, kind, id });\n\n    await deleteUniquenessEntries(\n      createUniquenessContext(ctx.graphId, ctx.registry, backend),\n      kind,\n      existingProps,\n      registration.unique ?? [],\n    );\n\n    const nodeKind = registration.type;\n    await deleteNodeEmbeddings(\n      createEmbeddingSyncContext(ctx.graphId, kind, id, backend),\n      nodeKind.schema,\n    );\n    await deleteNodeFulltext(\n      createFulltextSyncContext(ctx.graphId, kind, id, backend),\n      nodeKind.schema,\n    );\n  });\n}\n\n/**\n * Executes a node hard delete operation (permanent removal).\n *\n * Unlike soft delete, this permanently removes the node and all\n * associated data (uniqueness entries, embeddings) from the database.\n */\nexport async function executeNodeHardDelete<G extends GraphDef>(\n  ctx: NodeOperationContext<G>,\n  kind: string,\n  id: string,\n  backend: GraphBackend | TransactionBackend,\n): Promise<void> {\n  const opContext = ctx.createOperationContext(\"delete\", \"node\", kind, id);\n\n  return ctx.withOperationHooks(opContext, async () => {\n    const registration = getNodeRegistration(ctx.graph, kind);\n\n    const existing = await backend.getNode(ctx.graphId, kind, id);\n    if (!existing) return;\n\n    await enforceDeleteBehavior(ctx, kind, id, \"hard\", backend, registration);\n\n    // The cascade (uniques, embeddings, edges, node) is not individually atomic,\n    // so wrap in a transaction when the backend supports it. Embeddings live in\n    // strategy-owned per-`(kind, field)` tables, so they are cleaned up here —\n    // through `deleteNodeEmbeddings` → `backend.deleteEmbedding` — rather than\n    // in the backend's graph-agnostic `hardDeleteNode` cascade.\n    const hardDelete = async (\n      target: GraphBackend | TransactionBackend,\n    ): Promise<void> => {\n      await target.hardDeleteNode({ graphId: ctx.graphId, kind, id });\n      await deleteNodeEmbeddings(\n        createEmbeddingSyncContext(ctx.graphId, kind, id, target),\n        registration.type.schema,\n      );\n    };\n\n    await (\"transaction\" in backend && backend.capabilities.transactions ?\n      backend.transaction(async (tx) => hardDelete(tx))\n    : hardDelete(backend));\n  });\n}\n\n// ============================================================\n// Get-Or-Create Operations\n// ============================================================\n\nexport async function executeNodeGetOrCreateByConstraint<G extends GraphDef>(\n  ctx: NodeOperationContext<G>,\n  kind: string,\n  constraintName: string,\n  props: Record<string, unknown>,\n  backend: GraphBackend | TransactionBackend,\n  options?: NodeGetOrCreateByConstraintOptions,\n): Promise<Readonly<{ node: Node; action: GetOrCreateAction }>> {\n  const ifExists = options?.ifExists ?? \"return\";\n\n  const registration = getNodeRegistration(ctx.graph, kind);\n  const nodeKind = registration.type;\n  const validatedProps = validateNodeProps(nodeKind.schema, props, {\n    kind,\n    operation: \"create\",\n  });\n\n  const constraint = resolveConstraint(ctx.graph, kind, constraintName);\n\n  if (!checkWherePredicate(constraint, validatedProps)) {\n    const node = await executeNodeCreate(\n      ctx,\n      { kind, props: validatedProps },\n      backend,\n    );\n    return { node, action: \"created\" };\n  }\n\n  const key = computeUniqueKey(\n    validatedProps,\n    constraint.fields,\n    constraint.collation,\n  );\n\n  const kindsToCheck = getKindsForUniquenessCheck(\n    kind,\n    constraint.scope,\n    ctx.registry,\n  );\n\n  const existingUniqueRow = await findUniqueRowAcrossKinds(\n    backend,\n    ctx.graphId,\n    constraint.name,\n    key,\n    kindsToCheck,\n    true,\n  );\n\n  if (existingUniqueRow === undefined) {\n    const node = await executeNodeCreate(\n      ctx,\n      { kind, props: validatedProps },\n      backend,\n    );\n    return { node, action: \"created\" };\n  }\n\n  // Fetch using concrete_kind (may differ from requested kind\n  // when scope is \"kindWithSubClasses\" and the match is on a sibling/parent kind)\n  const existingRow = await backend.getNode(\n    ctx.graphId,\n    existingUniqueRow.concrete_kind,\n    existingUniqueRow.node_id,\n  );\n\n  if (existingRow === undefined) {\n    const node = await executeNodeCreate(\n      ctx,\n      { kind, props: validatedProps },\n      backend,\n    );\n    return { node, action: \"created\" };\n  }\n\n  const isSoftDeleted = existingRow.deleted_at !== undefined;\n\n  if (isSoftDeleted || ifExists === \"update\") {\n    const concreteKind = existingUniqueRow.concrete_kind;\n    const node = await executeNodeUpsertUpdate(\n      ctx,\n      {\n        kind: concreteKind,\n        id: existingRow.id as UpdateNodeInput[\"id\"],\n        props: validatedProps,\n      },\n      backend,\n      { clearDeleted: isSoftDeleted },\n    );\n    return { node, action: isSoftDeleted ? \"resurrected\" : \"updated\" };\n  }\n\n  return { node: rowToNode(existingRow), action: \"found\" };\n}\n\n// ============================================================\n// Find-By-Constraint Operations\n// ============================================================\n\nexport async function executeNodeFindByConstraint<G extends GraphDef>(\n  ctx: NodeOperationContext<G>,\n  kind: string,\n  constraintName: string,\n  props: Record<string, unknown>,\n  backend: GraphBackend | TransactionBackend,\n): Promise<Node | undefined> {\n  const registration = getNodeRegistration(ctx.graph, kind);\n  const nodeKind = registration.type;\n  const validatedProps = validateNodeProps(nodeKind.schema, props, {\n    kind,\n    operation: \"create\",\n  });\n\n  const constraint = resolveConstraint(ctx.graph, kind, constraintName);\n  if (!checkWherePredicate(constraint, validatedProps)) return undefined;\n\n  const key = computeUniqueKey(\n    validatedProps,\n    constraint.fields,\n    constraint.collation,\n  );\n\n  const kindsToCheck = getKindsForUniquenessCheck(\n    kind,\n    constraint.scope,\n    ctx.registry,\n  );\n\n  const existingUniqueRow = await findUniqueRowAcrossKinds(\n    backend,\n    ctx.graphId,\n    constraint.name,\n    key,\n    kindsToCheck,\n    false,\n  );\n\n  if (existingUniqueRow === undefined) return undefined;\n\n  const existingRow = await backend.getNode(\n    ctx.graphId,\n    existingUniqueRow.concrete_kind,\n    existingUniqueRow.node_id,\n  );\n\n  if (existingRow === undefined || existingRow.deleted_at !== undefined)\n    return undefined;\n\n  return rowToNode(existingRow);\n}\n\n// ============================================================\n// Bulk Find-By-Constraint\n// ============================================================\n\n/**\n * Validates all items and computes unique constraint keys.\n * Shared by both bulk find and bulk getOrCreate.\n */\nfunction validateAndComputeKeys(\n  nodeKind: NodeType,\n  kind: string,\n  constraint: UniqueConstraint,\n  items: readonly Readonly<{ props: Record<string, unknown> }>[],\n): { validatedProps: Record<string, unknown>; key: string | undefined }[] {\n  const validated: {\n    validatedProps: Record<string, unknown>;\n    key: string | undefined;\n  }[] = [];\n\n  for (const item of items) {\n    const validatedProps = validateNodeProps(nodeKind.schema, item.props, {\n      kind,\n      operation: \"create\",\n    });\n    const applies = checkWherePredicate(constraint, validatedProps);\n    const key =\n      applies ?\n        computeUniqueKey(\n          validatedProps,\n          constraint.fields,\n          constraint.collation,\n        )\n      : undefined;\n    validated.push({ validatedProps, key });\n  }\n\n  return validated;\n}\n\nfunction collectUniqueKeys(\n  validated: readonly { key: string | undefined }[],\n): string[] {\n  return [\n    ...new Set(\n      validated\n        .map((entry) => entry.key)\n        .filter((key): key is string => key !== undefined),\n    ),\n  ];\n}\n\nexport async function executeNodeBulkFindByConstraint<G extends GraphDef>(\n  ctx: NodeOperationContext<G>,\n  kind: string,\n  constraintName: string,\n  items: readonly Readonly<{ props: Record<string, unknown> }>[],\n  backend: GraphBackend | TransactionBackend,\n): Promise<(Node | undefined)[]> {\n  if (items.length === 0) return [];\n\n  const registration = getNodeRegistration(ctx.graph, kind);\n  const nodeKind = registration.type;\n  const constraint = resolveConstraint(ctx.graph, kind, constraintName);\n\n  const validated = validateAndComputeKeys(nodeKind, kind, constraint, items);\n  const uniqueKeys = collectUniqueKeys(validated);\n\n  const kindsToCheck = getKindsForUniquenessCheck(\n    kind,\n    constraint.scope,\n    ctx.registry,\n  );\n\n  const existingByKey =\n    uniqueKeys.length > 0 ?\n      await batchCheckUniqueAcrossKinds(\n        backend,\n        ctx.graphId,\n        constraint.name,\n        uniqueKeys,\n        kindsToCheck,\n        false,\n      )\n    : new Map<string, { node_id: string; concrete_kind: string }>();\n\n  // Assemble results, deduplicating keys seen within the batch\n  const results: (Node | undefined)[] = Array.from({ length: items.length });\n  const seenKeys = new Map<string, number>();\n\n  for (const [index, { key }] of validated.entries()) {\n    if (key === undefined) {\n      results[index] = undefined;\n      continue;\n    }\n\n    const previousIndex = seenKeys.get(key);\n    if (previousIndex !== undefined) {\n      results[index] = results[previousIndex];\n      continue;\n    }\n    seenKeys.set(key, index);\n\n    const existing = existingByKey.get(key);\n    if (existing === undefined) {\n      results[index] = undefined;\n      continue;\n    }\n\n    const existingRow = await backend.getNode(\n      ctx.graphId,\n      existing.concrete_kind,\n      existing.node_id,\n    );\n\n    if (existingRow === undefined || existingRow.deleted_at !== undefined) {\n      results[index] = undefined;\n      continue;\n    }\n\n    results[index] = rowToNode(existingRow);\n  }\n\n  return results;\n}\n\n// ============================================================\n// Bulk Find-By-Index\n// ============================================================\n\n/**\n * Resolves a declared node index by name, validating the kind first.\n *\n * @throws {KindNotFoundError} when the node kind is not registered\n * @throws {NodeIndexNotFoundError} when no node index of that name exists\n */\nfunction resolveNodeIndex<G extends GraphDef>(\n  graph: G,\n  kind: string,\n  indexName: string,\n): NodeIndexDeclaration {\n  getNodeRegistration(graph, kind);\n\n  const declaration = graph.indexes?.find(\n    (candidate) =>\n      candidate.entity === \"node\" &&\n      candidate.kind === kind &&\n      candidate.name === indexName,\n  );\n\n  if (declaration?.entity !== \"node\") {\n    throw new NodeIndexNotFoundError(indexName, kind);\n  }\n\n  return declaration;\n}\n\nconst INDEX_PROBE_EXPECTED_TYPEOF: Partial<Record<ValueType, string>> = {\n  string: \"string\",\n  number: \"number\",\n  boolean: \"boolean\",\n};\n\n/**\n * Validates a single probe value against its declared index-field type.\n * Missing/null values are valid (null probes); only a present, scalar\n * value of the wrong type is rejected.\n */\nfunction validateIndexProbeValue(\n  value: unknown,\n  valueType: ValueType | undefined,\n  pointer: JsonPointer,\n  kind: string,\n): void {\n  if (value === undefined || value === null) return;\n\n  // Index keys are scalar; a non-scalar probe can't be bound and must fail\n  // with a typed error rather than a cryptic driver bind error downstream.\n  if (\n    typeof value !== \"string\" &&\n    typeof value !== \"number\" &&\n    typeof value !== \"boolean\" &&\n    !(value instanceof Date)\n  ) {\n    throw indexProbeTypeError(\n      pointer,\n      kind,\n      \"a scalar (string, number, boolean, or Date)\",\n      value,\n    );\n  }\n\n  if (valueType === \"date\") {\n    if (value instanceof Date || typeof value === \"string\") return;\n    throw indexProbeTypeError(\n      pointer,\n      kind,\n      \"date (Date or ISO string)\",\n      value,\n    );\n  }\n\n  const expected = INDEX_PROBE_EXPECTED_TYPEOF[valueType ?? \"unknown\"];\n  if (expected === undefined) return;\n  if (typeof value !== expected) {\n    throw indexProbeTypeError(pointer, kind, expected, value);\n  }\n}\n\nfunction indexProbeTypeError(\n  pointer: JsonPointer,\n  kind: string,\n  expected: string,\n  value: unknown,\n): ValidationError {\n  return new ValidationError(\n    `Index probe value for \"${pointer}\" on node kind \"${kind}\" has an incompatible type`,\n    {\n      entityType: \"node\",\n      kind,\n      issues: [\n        {\n          path: pointer,\n          message: `Expected ${expected}, received ${typeof value}`,\n          code: \"invalid_type\",\n        },\n      ],\n    },\n  );\n}\n\n/** Coerces a non-null probe value into a driver-bindable scalar. */\nfunction coerceIndexProbeBind(\n  value: unknown,\n  adapter: DialectAdapter,\n): unknown {\n  return adapter.bindValue(normalizeProbeScalar(value as ProbeScalar));\n}\n\ntype ProbeScalar = string | number | boolean | Date;\n\n/**\n * Canonical scalar form of a validated probe value, shared by the dedup key\n * and the bound SQL value so the two can never drift (a Date and its ISO\n * string normalize identically — and produce identical predicates).\n */\nfunction normalizeProbeScalar(value: ProbeScalar): string | number | boolean {\n  return value instanceof Date ? value.toISOString() : value;\n}\n\nconst PROBE_NULL_TAG = 0;\nconst PROBE_VALUE_TAG = 1;\n\n/**\n * Stable dedup key for a probe tuple. Each slot is tagged so a null/undefined\n * value can never collide with a string that happens to equal a sentinel -\n * null maps to [0], a present scalar to [1, normalized].\n */\nfunction canonicalIndexProbeKey(probe: readonly unknown[]): string {\n  return JSON.stringify(\n    probe.map((value) =>\n      value === undefined || value === null ?\n        [PROBE_NULL_TAG]\n      : [PROBE_VALUE_TAG, normalizeProbeScalar(value as ProbeScalar)],\n    ),\n  );\n}\n\n/**\n * Batched candidate retrieval against a declared node index.\n *\n * Emits a single query against the nodes table: each input's indexed-field\n * values become a probe predicate (null-safe equality, reusing the index's\n * own extraction expressions so the planner can use the physical index), and\n * a `CASE` selector tags each matched row with the deduped probe group it\n * satisfies. Rows are grouped back to input positions in order; each input's\n * candidate set is ordered by node id.\n */\nexport async function executeNodeBulkFindByIndex<G extends GraphDef>(\n  ctx: NodeOperationContext<G>,\n  kind: string,\n  indexName: string,\n  items: readonly Readonly<{ props: Record<string, unknown> }>[],\n  backend: GraphBackend | TransactionBackend,\n  options?: NodeBulkFindByIndexOptions,\n): Promise<Node[][]> {\n  if (items.length === 0) return [];\n\n  const index = resolveNodeIndex(ctx.graph, kind, indexName);\n\n  // Date-typed lookup keys can't satisfy the cross-backend parity guarantee:\n  // SQLite compares stored ISO text byte-wise while Postgres compares\n  // timestamptz instants, so equal instants in different ISO forms diverge.\n  // Declare the gap rather than return backend-dependent results.\n  if (index.fieldValueTypes.includes(\"date\")) {\n    throw new ConfigurationError(\n      `bulkFindByIndex does not support date-typed key fields on index \"${indexName}\" (node kind \"${kind}\")`,\n      { indexName, kind },\n      {\n        suggestion:\n          \"Date index keys compare differently across SQLite and PostgreSQL. Use a string-encoded key field, or query date predicates via store.query(...).where(...).\",\n      },\n    );\n  }\n\n  const limitPerInput = options?.limitPerInput;\n  if (\n    limitPerInput !== undefined &&\n    (!Number.isInteger(limitPerInput) || limitPerInput <= 0)\n  ) {\n    throw new ValidationError(\n      \"bulkFindByIndex limitPerInput must be a positive integer\",\n      {\n        entityType: \"node\",\n        kind,\n        issues: [\n          {\n            path: \"limitPerInput\",\n            message: `Expected a positive integer, received ${String(limitPerInput)}`,\n            code: \"invalid_value\",\n          },\n        ],\n      },\n    );\n  }\n\n  const adapter = getDialect(backend.dialect);\n\n  // 1. Extract + validate each input's indexed-field probe tuple.\n  const probes: unknown[][] = items.map((item) =>\n    index.fields.map((pointer, position) => {\n      const value = resolveJsonPointer(item.props, pointer);\n      validateIndexProbeValue(\n        value,\n        index.fieldValueTypes[position],\n        pointer,\n        kind,\n      );\n      return value;\n    }),\n  );\n\n  // 2. Dedupe probe tuples; map each distinct tuple to its input positions.\n  const groupByKey = new Map<string, number>();\n  const groupProbes: unknown[][] = [];\n  const groupToInputs: number[][] = [];\n  for (const [inputIndex, probe] of probes.entries()) {\n    const key = canonicalIndexProbeKey(probe);\n    const existing = groupByKey.get(key);\n    if (existing === undefined) {\n      groupByKey.set(key, groupProbes.length);\n      groupProbes.push(probe);\n      groupToInputs.push([inputIndex]);\n      continue;\n    }\n    groupToInputs[existing]?.push(inputIndex);\n  }\n\n  // 3. Build probe predicates shared by the CASE selector and WHERE filter.\n  const schema =\n    backend.tableNames ?\n      createSqlSchema(backend.tableNames)\n    : DEFAULT_SQL_SCHEMA;\n  const compileContext: IndexCompilationContext = {\n    dialect: backend.dialect,\n    propsColumn: sql.raw(`\"props\"`),\n    systemColumn: (column) => sql.raw(`\"${column}\"`),\n  };\n  const fieldKeys = compileNodeIndexFieldKeys(index, compileContext);\n\n  const groupPredicates = groupProbes.map(\n    (probe) =>\n      sql`(${sql.join(\n        fieldKeys.map((fieldKey, position) => {\n          const value = probe[position];\n          if (value === undefined || value === null) {\n            return sql`${fieldKey} IS NULL`;\n          }\n          return adapter.nullSafeEquals(\n            fieldKey,\n            sql`${coerceIndexProbeBind(value, adapter)}`,\n          );\n        }),\n        sql` AND `,\n      )})`,\n  );\n\n  const caseBranches = groupPredicates.map(\n    (predicate, group) => sql`WHEN ${predicate} THEN ${sql.raw(String(group))}`,\n  );\n  const probeIndexExpr = sql`CASE ${sql.join(caseBranches, sql` `)} ELSE NULL END`;\n\n  const conditions: SQL[] = [\n    sql`\"graph_id\" = ${ctx.graphId}`,\n    sql`\"kind\" = ${kind}`,\n    sql`\"deleted_at\" IS NULL`,\n  ];\n  if (index.where !== undefined) {\n    conditions.push(compileIndexWhere(compileContext, index.where));\n  }\n  conditions.push(sql`(${sql.join(groupPredicates, sql` OR `)})`);\n  const whereClause = sql.join(conditions, sql` AND `);\n\n  // The probe matching runs against the nodes table; rows are hydrated\n  // separately via the backend's normalized node reads so the returned\n  // shape is identical to every other node API (props/timestamp\n  // normalization is backend-owned, not re-derived from raw driver rows).\n  const probedSelect = sql`SELECT \"id\", ${probeIndexExpr} AS probe_idx FROM ${schema.nodesTable} WHERE ${whereClause}`;\n\n  // limitPerInput caps each input's candidates per probe group. When the\n  // backend supports window functions we cap in SQL (`ROW_NUMBER()`), which\n  // also avoids transferring excess ids on low-selectivity keys. Otherwise we\n  // degrade gracefully: fetch all matching ids and cap per group in JS before\n  // hydration — the cap stays correct, only the id transfer is unbounded.\n  const capInSql =\n    limitPerInput !== undefined && backend.capabilities.windowFunctions;\n\n  const query =\n    capInSql ?\n      sql`SELECT \"id\", probe_idx FROM (SELECT \"id\", probe_idx, ROW_NUMBER() OVER (PARTITION BY probe_idx ORDER BY \"id\") AS probe_rank FROM (${probedSelect}) AS probed) AS ranked WHERE probe_rank <= ${limitPerInput} ORDER BY probe_idx, \"id\"`\n    : sql`${probedSelect} ORDER BY probe_idx, \"id\"`;\n\n  // 4. Execute, hydrate matched nodes, and group back to input positions.\n  const rawMatches = await backend.execute<ProbeMatch>(query);\n  const matches =\n    limitPerInput !== undefined && !capInSql ?\n      capMatchesPerGroup(rawMatches, limitPerInput)\n    : rawMatches;\n\n  const nodesById = await hydrateNodesById(\n    backend,\n    ctx.graphId,\n    kind,\n    matches.map((match) => match.id),\n  );\n\n  const results: Node[][] = Array.from({ length: items.length }, () => []);\n  for (const match of matches) {\n    const node = nodesById.get(match.id);\n    if (node === undefined) continue;\n    const inputs = groupToInputs[match.probe_idx];\n    if (inputs === undefined) continue;\n    for (const inputIndex of inputs) {\n      results[inputIndex]?.push(node);\n    }\n  }\n\n  return results;\n}\n\ntype ProbeMatch = Readonly<{ id: string; probe_idx: number }>;\n\n/**\n * Caps matches to the first `limitPerInput` per probe group (the JS-side\n * equivalent of the `ROW_NUMBER()` window). Relies on `matches` already being\n * ordered by `(probe_idx, id)`, so the kept rows are the lowest ids per group.\n */\nfunction capMatchesPerGroup(\n  matches: readonly ProbeMatch[],\n  limitPerInput: number,\n): ProbeMatch[] {\n  const perGroupCount = new Map<number, number>();\n  const capped: ProbeMatch[] = [];\n  for (const match of matches) {\n    const count = perGroupCount.get(match.probe_idx) ?? 0;\n    if (count >= limitPerInput) continue;\n    perGroupCount.set(match.probe_idx, count + 1);\n    capped.push(match);\n  }\n  return capped;\n}\n\n/** Hydrates live nodes by id via the backend's normalized node reads. */\nasync function hydrateNodesById(\n  backend: GraphBackend | TransactionBackend,\n  graphId: string,\n  kind: string,\n  ids: readonly string[],\n): Promise<Map<string, Node>> {\n  const rowsById = await getNodeRowsByIds(backend, graphId, kind, ids);\n  const nodesById = new Map<string, Node>();\n  for (const [id, row] of rowsById) {\n    if (row.deleted_at !== undefined) continue;\n    nodesById.set(id, rowToNode(row));\n  }\n  return nodesById;\n}\n\n// ============================================================\n// Bulk Get-Or-Create-By-Constraint\n// ============================================================\n\nexport async function executeNodeBulkGetOrCreateByConstraint<\n  G extends GraphDef,\n>(\n  ctx: NodeOperationContext<G>,\n  kind: string,\n  constraintName: string,\n  items: readonly Readonly<{ props: Record<string, unknown> }>[],\n  backend: GraphBackend | TransactionBackend,\n  options?: NodeGetOrCreateByConstraintOptions,\n): Promise<Readonly<{ node: Node; action: GetOrCreateAction }>[]> {\n  if (items.length === 0) return [];\n\n  const ifExists = options?.ifExists ?? \"return\";\n  const registration = getNodeRegistration(ctx.graph, kind);\n  const nodeKind = registration.type;\n  const constraint = resolveConstraint(ctx.graph, kind, constraintName);\n\n  // Step 1: Validate all props and compute keys\n  const validated = validateAndComputeKeys(nodeKind, kind, constraint, items);\n  const uniqueKeys = collectUniqueKeys(validated);\n\n  const kindsToCheck = getKindsForUniquenessCheck(\n    kind,\n    constraint.scope,\n    ctx.registry,\n  );\n\n  // Step 2: Batch-check existing keys\n  const existingByKey =\n    uniqueKeys.length > 0 ?\n      await batchCheckUniqueAcrossKinds(\n        backend,\n        ctx.graphId,\n        constraint.name,\n        uniqueKeys,\n        kindsToCheck,\n        true,\n      )\n    : new Map<\n        string,\n        {\n          node_id: string;\n          concrete_kind: string;\n          deleted_at: string | undefined;\n        }\n      >();\n\n  // Step 3: Partition into toCreate, toFetch, and duplicates\n  const toCreate: { index: number; input: CreateNodeInput }[] = [];\n  const toFetch: {\n    index: number;\n    nodeId: string;\n    concreteKind: string;\n    validatedProps: Record<string, unknown>;\n    isSoftDeleted: boolean;\n  }[] = [];\n  const duplicateOf: { index: number; sourceIndex: number }[] = [];\n  const seenKeys = new Map<string, number>();\n\n  for (const [index, { validatedProps, key }] of validated.entries()) {\n    if (key === undefined) {\n      toCreate.push({ index, input: { kind, props: validatedProps } });\n      continue;\n    }\n\n    const previousIndex = seenKeys.get(key);\n    if (previousIndex !== undefined) {\n      duplicateOf.push({ index, sourceIndex: previousIndex });\n      continue;\n    }\n\n    seenKeys.set(key, index);\n\n    const existing = existingByKey.get(key);\n    if (existing === undefined) {\n      toCreate.push({ index, input: { kind, props: validatedProps } });\n    } else {\n      toFetch.push({\n        index,\n        nodeId: existing.node_id,\n        concreteKind: existing.concrete_kind,\n        validatedProps,\n        isSoftDeleted: existing.deleted_at !== undefined,\n      });\n    }\n  }\n\n  type Result = Readonly<{ node: Node; action: GetOrCreateAction }>;\n  const results: Result[] = Array.from({ length: items.length });\n\n  // Step 4: Execute creates\n  if (toCreate.length > 0) {\n    const createInputs = toCreate.map((entry) => entry.input);\n    const createdNodes = await executeNodeCreateBatch(\n      ctx,\n      createInputs,\n      backend,\n    );\n    for (const [batchIndex, entry] of toCreate.entries()) {\n      results[entry.index] = {\n        node: createdNodes[batchIndex]!,\n        action: \"created\",\n      };\n    }\n  }\n\n  // Step 5: Handle existing nodes (fetch/update/resurrect)\n  for (const entry of toFetch) {\n    const { index, concreteKind, validatedProps, isSoftDeleted, nodeId } =\n      entry;\n\n    const existingRow = await backend.getNode(\n      ctx.graphId,\n      concreteKind,\n      nodeId,\n    );\n\n    if (existingRow === undefined) {\n      const node = await executeNodeCreate(\n        ctx,\n        { kind, props: validatedProps },\n        backend,\n      );\n      results[index] = { node, action: \"created\" };\n      continue;\n    }\n\n    if (isSoftDeleted || ifExists === \"update\") {\n      const node = await executeNodeUpsertUpdate(\n        ctx,\n        {\n          kind: concreteKind,\n          id: existingRow.id as UpdateNodeInput[\"id\"],\n          props: validatedProps,\n        },\n        backend,\n        { clearDeleted: isSoftDeleted },\n      );\n      results[index] = {\n        node,\n        action: isSoftDeleted ? \"resurrected\" : \"updated\",\n      };\n    } else {\n      results[index] = { node: rowToNode(existingRow), action: \"found\" };\n    }\n  }\n\n  // Step 6: Resolve within-batch duplicates by copying the first occurrence's result\n  for (const { index, sourceIndex } of duplicateOf) {\n    const sourceResult = results[sourceIndex]!;\n    results[index] = { node: sourceResult.node, action: \"found\" };\n  }\n\n  return results;\n}\n","/**\n * Main Store implementation for TypeGraph.\n *\n * The Store is the primary interface for interacting with a TypeGraph.\n * It coordinates:\n * - Node and edge CRUD operations\n * - Constraint validation\n * - Schema management\n * - Transaction handling\n */\nimport type { z } from \"zod\";\n\nimport {\n  type AdoptedTransaction,\n  type GraphBackend,\n  runOptionallyInTransaction,\n  type SchemaVersionRow,\n  type TransactionBackend,\n  type TransactionOptions,\n} from \"../backend/types\";\nimport {\n  type AllNodeTypes,\n  type EdgeKinds,\n  type GraphDef,\n  isKnownKind,\n  type NodeKinds,\n} from \"../core/define-graph\";\nimport { resolveEmbeddingFields } from \"../core/embedding\";\nimport { type ReadCoordinate } from \"../core/temporal\";\nimport type { KindEntity, NodeId } from \"../core/types\";\nimport {\n  ConfigurationError,\n  EagerMaterializationError,\n  KindNotFoundError,\n} from \"../errors\";\nimport {\n  buildIncompatibleChangeError,\n  classifyModifications,\n  type RequireEmptyEntry,\n} from \"../graph-extension/classify\";\nimport { IncompatibleChangeError } from \"../graph-extension/errors\";\nimport { type GraphExtension } from \"../graph-extension/extension-types\";\nimport { mergeGraphExtension } from \"../graph-extension/merge\";\nimport { planRemovals, stripGraphExtension } from \"../graph-extension/remove\";\nimport { type VectorIndexDeclaration } from \"../indexes/types\";\nimport type { TraversalExpansion } from \"../query/ast\";\nimport {\n  type BatchableQuery,\n  type BatchResults,\n  createQueryBuilder,\n  type QueryBuilder,\n} from \"../query/builder\";\nimport { createSqlSchema } from \"../query/compiler/schema\";\nimport { getDialect } from \"../query/dialect\";\nimport { type VectorSlot } from \"../query/dialect/vector-strategy\";\nimport { buildKindRegistry, type KindRegistry } from \"../registry\";\nimport {\n  applyDeprecatedKinds,\n  commitNewSchemaVersion,\n  ensureSchema as ensureSchemaImpl,\n  loadActiveSchemaWithBootstrap,\n  loadAndMergeGraphExtensionDocument,\n  loadAndVerifyGraph,\n  parseSerializedSchema,\n  type SchemaManagerOptions,\n  type SchemaValidationResult,\n} from \"../schema/manager\";\nimport { type SerializedSchema } from \"../schema/types\";\nimport { nowIso } from \"../utils/date\";\nimport { generateId } from \"../utils/id\";\nimport { createGraphAlgorithms, type GraphAlgorithms } from \"./algorithms\";\nimport {\n  createEdgeCollectionsProxy,\n  createNodeCollectionsProxy,\n  type EdgeOperations,\n  type NodeOperations,\n} from \"./collection-factory\";\nimport { resolveTemporalReadParams } from \"./collections/temporal-read-params\";\nimport { introspectSchema, type SchemaIntrospection } from \"./introspect\";\nimport {\n  computeIndexSignature,\n  materializeIndexes as materializeIndexesImpl,\n  type MaterializeIndexesOptions,\n  type MaterializeIndexesResult,\n  vectorStatusKey,\n} from \"./materialize-indexes\";\nimport {\n  buildPendingKindRemoval,\n  materializeRemovals as materializeRemovalsImpl,\n  type MaterializeRemovalsOptions,\n  type MaterializeRemovalsResult,\n} from \"./materialize-removals\";\nimport {\n  type EdgeOperationContext,\n  executeEdgeBulkGetOrCreateByEndpoints,\n  executeEdgeCreate,\n  executeEdgeCreateBatch,\n  executeEdgeCreateNoReturnBatch,\n  executeEdgeDelete,\n  executeEdgeFindByEndpoints,\n  executeEdgeGetOrCreateByEndpoints,\n  executeEdgeHardDelete,\n  executeEdgeUpdate,\n  executeEdgeUpsertUpdate,\n  executeNodeBulkFindByConstraint,\n  executeNodeBulkFindByIndex,\n  executeNodeBulkGetOrCreateByConstraint,\n  executeNodeCreate,\n  executeNodeCreateBatch,\n  executeNodeCreateNoReturnBatch,\n  executeNodeDelete,\n  executeNodeFindByConstraint,\n  executeNodeGetOrCreateByConstraint,\n  executeNodeHardDelete,\n  executeNodeUpdate,\n  executeNodeUpsertUpdate,\n  type NodeOperationContext,\n} from \"./operations\";\nimport { rowToEdge, rowToNode } from \"./row-mappers\";\nimport { StoreSearch } from \"./search-facade\";\nimport { StoreView, type StoreViewCoordinate } from \"./store-view\";\nimport {\n  executeSubgraph,\n  type SubgraphOptions,\n  type SubgraphProject,\n  type SubgraphResult,\n} from \"./subgraph\";\nimport {\n  type DynamicEdgeCollection,\n  type DynamicNodeCollection,\n  type GraphEdgeCollections,\n  type GraphNodeCollections,\n  type HookContext,\n  type Node,\n  type OperationHookContext,\n  type QueryOptions,\n  type StoreHooks,\n  type StoreOptions,\n  type StoreRef,\n  type TransactionContext,\n} from \"./types\";\n\ntype StoreSchemaMetadata = Readonly<{\n  schemaVersion: number | undefined;\n  schemaHash: string | undefined;\n}>;\n\nconst UNKNOWN_SCHEMA_METADATA: StoreSchemaMetadata = Object.freeze({\n  schemaVersion: undefined,\n  schemaHash: undefined,\n});\n\ntype CaughtUpVerb =\n  | \"evolve\"\n  | \"materialize\"\n  | \"deprecate\"\n  | \"undeprecate\"\n  | \"remove\"\n  | \"reembed\";\n\n/** Default page size for the {@link Store.reembedVectorField} re-embed loop. */\nconst DEFAULT_REEMBED_BATCH_SIZE = 200;\n\nconst CAUGHT_UP_VERB_DETAILS: Readonly<\n  Record<CaughtUpVerb, Readonly<{ phrase: string; code: string }>>\n> = {\n  evolve: { phrase: \"evolve\", code: \"EVOLVE_BEFORE_INITIALIZE\" },\n  materialize: {\n    phrase: \"materialize indexes on\",\n    code: \"MATERIALIZE_BEFORE_INITIALIZE\",\n  },\n  remove: { phrase: \"remove kinds on\", code: \"REMOVE_BEFORE_INITIALIZE\" },\n  deprecate: {\n    phrase: \"deprecate kinds on\",\n    code: \"DEPRECATE_BEFORE_INITIALIZE\",\n  },\n  undeprecate: {\n    phrase: \"undeprecate kinds on\",\n    code: \"DEPRECATE_BEFORE_INITIALIZE\",\n  },\n  reembed: {\n    phrase: \"re-embed a vector field on\",\n    code: \"REEMBED_BEFORE_INITIALIZE\",\n  },\n};\n\n// ============================================================\n// Store Class\n// ============================================================\n\n/**\n * The Store provides typed access to a TypeGraph database.\n *\n * @example\n * ```typescript\n * const store = createStore(myGraph, backend);\n *\n * // Create nodes using collection API\n * const person = await store.nodes.Person.create({\n *   name: \"Alice\",\n *   email: \"alice@example.com\",\n * });\n *\n * const company = await store.nodes.Company.create({\n *   name: \"Acme\",\n *   industry: \"Technology\",\n * });\n *\n * // Create edges\n * await store.edges.worksAt.create(\n *   { kind: \"Person\", id: person.id },\n *   { kind: \"Company\", id: company.id },\n *   { role: \"Engineer\" }\n * );\n *\n * // Query with the fluent API\n * const results = await store.query()\n *   .from(\"Person\", \"p\")\n *   .whereNode(\"p\", (p) => p.name.eq(\"Alice\"))\n *   .select((ctx) => ctx.p)\n *   .execute();\n * ```\n */\n\n/**\n * Optional embedder for {@link Store.reembedVectorField}. Receives a batch of\n * the kind's nodes and returns a map of `nodeId → new embedding vector` (omit\n * an id to leave that node without an embedding). Called once per page; the\n * page size is `batchSize`.\n */\nexport type ReembedFunction = (\n  nodes: readonly Node[],\n) =>\n  | Promise<ReadonlyMap<string, readonly number[]>>\n  | ReadonlyMap<string, readonly number[]>;\n\n/** Options for {@link Store.reembedVectorField}. */\nexport type ReembedVectorFieldOptions = Readonly<{\n  /**\n   * When supplied, drives a batched re-embed loop after recreating storage:\n   * pages the kind's nodes, calls `embed(batch)`, and upserts the returned\n   * vectors. When omitted, storage is recreated empty and the caller\n   * re-embeds via normal `update()` / `upsertEmbedding` writes.\n   */\n  embed?: ReembedFunction;\n  /** Re-embed page size. Default 200. */\n  batchSize?: number;\n}>;\n\n/** Result of {@link Store.reembedVectorField}. */\nexport type ReembedVectorFieldResult = Readonly<{\n  /** Whether the per-field storage was dropped and recreated. */\n  recreated: boolean;\n  /** Number of nodes whose embedding was re-written (0 without `embed`). */\n  reembedded: number;\n}>;\n\nexport class Store<G extends GraphDef> {\n  readonly #graph: G;\n  readonly #backend: GraphBackend;\n  readonly #registry: KindRegistry;\n  readonly #hooks: StoreHooks;\n  readonly #schema: StoreOptions[\"schema\"];\n  readonly #schemaMetadata: StoreSchemaMetadata;\n  readonly #defaultTraversalExpansion: TraversalExpansion;\n  // Stored verbatim so `evolve()` can construct the next Store with\n  // identical options. Reconstructing from the individual private\n  // fields would silently drop any future StoreOptions field a\n  // maintainer adds without also threading it through evolve.\n  readonly #options: StoreOptions | undefined;\n  #nodeCollections: GraphNodeCollections<G> | undefined;\n  #edgeCollections: GraphEdgeCollections<G> | undefined;\n  #algorithms: GraphAlgorithms<G> | undefined;\n  #search: StoreSearch<G> | undefined;\n\n  constructor(\n    graph: G,\n    backend: GraphBackend,\n    options?: StoreOptions,\n    schemaMetadata?: StoreSchemaMetadata,\n  ) {\n    this.#graph = graph;\n    this.#backend = backend;\n    this.#registry = buildKindRegistry(graph);\n    this.#hooks = options?.hooks ?? {};\n    this.#schema =\n      options?.schema ??\n      (backend.tableNames ? createSqlSchema(backend.tableNames) : undefined);\n    this.#defaultTraversalExpansion =\n      options?.queryDefaults?.traversalExpansion ?? \"inverse\";\n    this.#options = options;\n    this.#schemaMetadata = schemaMetadata ?? UNKNOWN_SCHEMA_METADATA;\n  }\n\n  // === Accessors ===\n\n  /** The graph definition */\n  get graph(): G {\n    return this.#graph;\n  }\n\n  /** The graph ID */\n  get graphId(): string {\n    return this.#graph.id;\n  }\n\n  /** The kind registry for ontology lookups */\n  get registry(): KindRegistry {\n    return this.#registry;\n  }\n\n  /** The database backend */\n  get backend(): GraphBackend {\n    return this.#backend;\n  }\n\n  // === Collections ===\n\n  /**\n   * Node collections for ergonomic CRUD operations.\n   *\n   * @example\n   * ```typescript\n   * // Create a node\n   * const person = await store.nodes.Person.create({ name: \"Alice\" });\n   *\n   * // Get by ID\n   * const fetched = await store.nodes.Person.getById(person.id);\n   *\n   * // Find all\n   * const people = await store.nodes.Person.find({ limit: 10 });\n   * ```\n   */\n  get nodes(): GraphNodeCollections<G> {\n    if (this.#nodeCollections === undefined) {\n      this.#nodeCollections = createNodeCollectionsProxy(\n        this.#graph,\n        this.graphId,\n        this.#registry,\n        this.#backend,\n        this.#nodeOperations,\n      );\n    }\n\n    return this.#nodeCollections;\n  }\n\n  /**\n   * Edge collections for ergonomic CRUD operations.\n   *\n   * @example\n   * ```typescript\n   * // Create an edge\n   * const edge = await store.edges.worksAt.create(\n   *   { kind: \"Person\", id: person.id },\n   *   { kind: \"Company\", id: company.id },\n   *   { role: \"Engineer\" }\n   * );\n   *\n   * // Find edges from a node\n   * const edges = await store.edges.worksAt.findFrom({ kind: \"Person\", id: person.id });\n   * ```\n   */\n  get edges(): GraphEdgeCollections<G> {\n    if (this.#edgeCollections === undefined) {\n      this.#edgeCollections = createEdgeCollectionsProxy(\n        this.#graph,\n        this.graphId,\n        this.#registry,\n        this.#backend,\n        this.#edgeOperations,\n      );\n    }\n\n    return this.#edgeCollections;\n  }\n\n  // === Graph Algorithms ===\n\n  /**\n   * Tier 1 graph algorithms: shortest path, reachability, neighborhoods, and\n   * degree centrality.\n   *\n   * Each call compiles to a single recursive-CTE query against the backend.\n   * The facade is built lazily on first access and cached for the lifetime\n   * of the store.\n   *\n   * @example\n   * ```typescript\n   * const path = await store.algorithms.shortestPath(alice, bob, {\n   *   edges: [\"knows\"],\n   * });\n   *\n   * const friends = await store.algorithms.neighbors(alice, {\n   *   edges: [\"knows\"],\n   *   depth: 2,\n   * });\n   * ```\n   */\n  get algorithms(): GraphAlgorithms<G> {\n    if (this.#algorithms === undefined) {\n      this.#algorithms = createGraphAlgorithms<G>({\n        graphId: this.graphId,\n        backend: this.#backend,\n        schema: this.#schema,\n        defaultTemporalMode: this.#graph.defaults.temporalMode,\n      });\n    }\n    return this.#algorithms;\n  }\n\n  // === Dynamic Collection Access ===\n\n  /**\n   * Returns the node collection for the given kind, or undefined if the kind\n   * is not registered in this graph.\n   *\n   * Use this for runtime string-keyed access when the kind is not known at\n   * compile time (e.g., iterating all kinds, resolving from edge metadata,\n   * dynamic admin UIs). For the post-evolve \"I just added this kind, give\n   * me the collection\" pattern, prefer `getNodeCollectionOrThrow` — it\n   * throws `KindNotFoundError` instead of forcing a null-check.\n   */\n  getNodeCollection(kind: string): DynamicNodeCollection | undefined {\n    if (!Object.hasOwn(this.#graph.nodes, kind)) return undefined;\n    return this.nodes[\n      kind as keyof G[\"nodes\"] & string\n    ] as unknown as DynamicNodeCollection;\n  }\n\n  /**\n   * Returns the node collection for the given kind. Throws\n   * `KindNotFoundError` when the kind is not registered.\n   *\n   * The dominant graph-extension-kind access pattern: `await store.evolve(...)`\n   * returns a new store, the caller immediately operates on the new\n   * kind, and the null-check the optional variant requires is busywork.\n   */\n  getNodeCollectionOrThrow(kind: string): DynamicNodeCollection {\n    const collection = this.getNodeCollection(kind);\n    if (collection === undefined) {\n      throw new KindNotFoundError(kind, \"node\", {\n        graphId: this.graphId,\n      });\n    }\n    return collection;\n  }\n\n  /**\n   * Returns the edge collection for the given kind, or undefined if the kind\n   * is not registered in this graph.\n   *\n   * Use this for runtime string-keyed access when the kind is not known at\n   * compile time. For post-evolve access, prefer `getEdgeCollectionOrThrow`.\n   */\n  getEdgeCollection(kind: string): DynamicEdgeCollection | undefined {\n    if (!Object.hasOwn(this.#graph.edges, kind)) return undefined;\n    return this.edges[\n      kind as keyof G[\"edges\"] & string\n    ] as unknown as DynamicEdgeCollection;\n  }\n\n  /**\n   * Returns the edge collection for the given kind. Throws\n   * `KindNotFoundError` when the kind is not registered.\n   */\n  getEdgeCollectionOrThrow(kind: string): DynamicEdgeCollection {\n    const collection = this.getEdgeCollection(kind);\n    if (collection === undefined) {\n      throw new KindNotFoundError(kind, \"edge\", {\n        graphId: this.graphId,\n      });\n    }\n    return collection;\n  }\n\n  // === Dynamic Props Schema Access ===\n\n  /**\n   * Returns the Zod props schema for the given node kind, or `undefined`\n   * if the kind is not registered. Identity-preserving: returns the\n   * exact instance used by `.create()` / `.update()`, so a `parse()`\n   * surfaces the same underlying Zod issues that `ValidationError`\n   * wraps (operation-level checks like uniqueness and endpoints stay\n   * in `collection.create`).\n   */\n  getNodePropsSchema(kind: string): z.ZodObject<z.ZodRawShape> | undefined {\n    if (!Object.hasOwn(this.#graph.nodes, kind)) return undefined;\n    return this.#graph.nodes[kind]!.type.schema;\n  }\n\n  /**\n   * Returns the Zod props schema for the given node kind. Throws\n   * `KindNotFoundError` when the kind is not registered.\n   */\n  getNodePropsSchemaOrThrow(kind: string): z.ZodObject<z.ZodRawShape> {\n    const schema = this.getNodePropsSchema(kind);\n    if (schema === undefined) {\n      throw new KindNotFoundError(kind, \"node\", {\n        graphId: this.graphId,\n      });\n    }\n    return schema;\n  }\n\n  /**\n   * Returns the Zod props schema for the given edge kind, or `undefined`\n   * if the kind is not registered. Symmetric with `getNodePropsSchema`.\n   */\n  getEdgePropsSchema(kind: string): z.ZodObject<z.ZodRawShape> | undefined {\n    if (!Object.hasOwn(this.#graph.edges, kind)) return undefined;\n    return this.#graph.edges[kind]!.type.schema;\n  }\n\n  /**\n   * Returns the Zod props schema for the given edge kind. Throws\n   * `KindNotFoundError` when the kind is not registered.\n   */\n  getEdgePropsSchemaOrThrow(kind: string): z.ZodObject<z.ZodRawShape> {\n    const schema = this.getEdgePropsSchema(kind);\n    if (schema === undefined) {\n      throw new KindNotFoundError(kind, \"edge\", {\n        graphId: this.graphId,\n      });\n    }\n    return schema;\n  }\n\n  /**\n   * Returns a unified read of the merged schema — every compile-time\n   * and graph-extension kind, every edge, every ontology relation,\n   * with explicit `origin: \"compile-time\" | \"runtime\"` markers — plus\n   * the persisted `extension` for round-tripping.\n   *\n   * Pure synchronous read built from the in-memory graph and the\n   * already-merged graph-extension document. `schemaVersion` and `schemaHash`\n   * are populated when the loader cached them at construction or after\n   * `evolve` returns; consumers needing a fresh read should call\n   * `backend.getActiveSchema(graphId)`.\n   *\n   * The return shape is the canonical schema-introspection surface:\n   * the prior standalone `store.deprecatedKinds` accessor is replaced\n   * by `introspect().deprecatedKinds`.\n   */\n  introspect(): SchemaIntrospection {\n    return introspectSchema(this.#graph, {\n      graphId: this.graphId,\n      schemaVersion: this.#schemaMetadata.schemaVersion,\n      schemaHash: this.#schemaMetadata.schemaHash,\n    });\n  }\n\n  /**\n   * Node operations bound to this store instance.\n   */\n  get #nodeOperations(): NodeOperations {\n    const ctx = this.#createNodeOperationContext();\n    return {\n      defaultTemporalMode: this.#graph.defaults.temporalMode,\n      rowToNode: (row) => rowToNode(row),\n      executeCreate: (input, backend) => executeNodeCreate(ctx, input, backend),\n      executeCreateBatch: (inputs, backend) =>\n        executeNodeCreateBatch(ctx, inputs, backend),\n      executeCreateNoReturnBatch: (inputs, backend) =>\n        executeNodeCreateNoReturnBatch(ctx, inputs, backend),\n      executeUpdate: (input, backend, options) =>\n        executeNodeUpdate(ctx, { ...input, id: input.id }, backend, options),\n      executeUpsertUpdate: (input, backend, options) =>\n        executeNodeUpsertUpdate(\n          ctx,\n          { ...input, id: input.id },\n          backend,\n          options,\n        ),\n      executeDelete: (kind, id, backend) =>\n        executeNodeDelete(ctx, kind, id, backend),\n      executeHardDelete: (kind, id, backend) =>\n        executeNodeHardDelete(ctx, kind, id, backend),\n      temporalRowMatcher: (options) => this.#temporalRowMatcher(options),\n      createQuery: () => this.query(),\n      executeGetOrCreateByConstraint: (\n        kind,\n        constraintName,\n        props,\n        backend,\n        options,\n      ) =>\n        executeNodeGetOrCreateByConstraint(\n          ctx,\n          kind,\n          constraintName,\n          props,\n          backend,\n          options,\n        ),\n      executeBulkGetOrCreateByConstraint: (\n        kind,\n        constraintName,\n        items,\n        backend,\n        options,\n      ) =>\n        executeNodeBulkGetOrCreateByConstraint(\n          ctx,\n          kind,\n          constraintName,\n          items,\n          backend,\n          options,\n        ),\n      executeFindByConstraint: (kind, constraintName, props, backend) =>\n        executeNodeFindByConstraint(ctx, kind, constraintName, props, backend),\n      executeBulkFindByConstraint: (kind, constraintName, items, backend) =>\n        executeNodeBulkFindByConstraint(\n          ctx,\n          kind,\n          constraintName,\n          items,\n          backend,\n        ),\n      executeBulkFindByIndex: (kind, indexName, items, backend, options) =>\n        executeNodeBulkFindByIndex(\n          ctx,\n          kind,\n          indexName,\n          items,\n          backend,\n          options,\n        ),\n    };\n  }\n\n  /**\n   * Edge operations bound to this store instance.\n   */\n  get #edgeOperations(): EdgeOperations {\n    const ctx = this.#createEdgeOperationContext();\n    return {\n      defaultTemporalMode: this.#graph.defaults.temporalMode,\n      rowToEdge: (row) => rowToEdge(row),\n      executeCreate: (input, backend) => executeEdgeCreate(ctx, input, backend),\n      executeCreateBatch: (inputs, backend) =>\n        executeEdgeCreateBatch(ctx, inputs, backend),\n      executeCreateNoReturnBatch: (inputs, backend) =>\n        executeEdgeCreateNoReturnBatch(ctx, inputs, backend),\n      executeUpdate: (input, backend) => executeEdgeUpdate(ctx, input, backend),\n      executeUpsertUpdate: (input, backend, options) =>\n        executeEdgeUpsertUpdate(ctx, input, backend, options),\n      executeDelete: (id, backend) => executeEdgeDelete(ctx, id, backend),\n      executeHardDelete: (id, backend) =>\n        executeEdgeHardDelete(ctx, id, backend),\n      temporalRowMatcher: (options) => this.#temporalRowMatcher(options),\n      createQuery: () => this.query(),\n      executeGetOrCreateByEndpoints: (\n        kind,\n        fromKind,\n        fromId,\n        toKind,\n        toId,\n        props,\n        backend,\n        options,\n      ) =>\n        executeEdgeGetOrCreateByEndpoints(\n          ctx,\n          kind,\n          fromKind,\n          fromId,\n          toKind,\n          toId,\n          props,\n          backend,\n          options,\n        ),\n      executeBulkGetOrCreateByEndpoints: (kind, items, backend, options) =>\n        executeEdgeBulkGetOrCreateByEndpoints(\n          ctx,\n          kind,\n          items,\n          backend,\n          options,\n        ),\n      executeFindByEndpoints: (\n        kind,\n        fromKind,\n        fromId,\n        toKind,\n        toId,\n        backend,\n        options,\n      ) =>\n        executeEdgeFindByEndpoints(\n          ctx,\n          kind,\n          fromKind,\n          fromId,\n          toKind,\n          toId,\n          backend,\n          options,\n        ),\n    };\n  }\n\n  // === Query Builder ===\n\n  /**\n   * Creates a query builder for this store.\n   *\n   * @example\n   * ```typescript\n   * const results = await store.query()\n   *   .from(\"Person\", \"p\")\n   *   .whereNode(\"p\", (p) => p.name.eq(\"Alice\"))\n   *   .select((ctx) => ctx.p)\n   *   .execute();\n   * ```\n   */\n  query(): QueryBuilder<G> {\n    return this.#createQueryForBackend(this.#backend);\n  }\n\n  /**\n   * Internal seam for {@link StoreView.query}: a query builder pinned to a\n   * view's {@link ReadCoordinate} with its temporal axis sealed\n   * (`.temporal()` throws). Not part of the stable public API — construct a\n   * view via {@link Store.view} / {@link Store.asOf} and call `.query()`.\n   */\n  sealedQuery(coordinate: ReadCoordinate): QueryBuilder<G> {\n    return this.#createQueryForBackend(this.#backend, coordinate);\n  }\n\n  // === Temporal Views ===\n\n  /**\n   * Returns a read-only {@link StoreView} pinned to a valid-time instant.\n   *\n   * The view routes every supported read — `nodes` / `edges` collections,\n   * `query()`, `subgraph()`, and the graph algorithms — through the\n   * `asOf` coordinate, so they observe the graph as it was valid at `T`.\n   * Writes stay on the live `Store`. Mirrors Datomic's `(d/as-of db t)`.\n   *\n   * @example\n   * ```typescript\n   * const past = store.asOf(\"2026-01-01T00:00:00.000Z\");\n   * const alice = await past.nodes.Person.getById(aliceId);\n   * const names = await past\n   *   .query()\n   *   .from(\"Person\", \"p\")\n   *   .whereNode(\"p\", (p) => p.name.eq(\"Alice\"))\n   *   .select((ctx) => ctx.p.name)\n   *   .execute();\n   * ```\n   *\n   * @param asOf - ISO-8601 timestamp to pin the valid-time coordinate to.\n   */\n  asOf(asOf: string): StoreView<G> {\n    return new StoreView(this, { mode: \"asOf\", asOf });\n  }\n\n  /**\n   * Returns a read-only {@link StoreView} pinned to an arbitrary public\n   * temporal mode. Use {@link Store.asOf} for the common valid-time case;\n   * reach for `view` to pin `\"current\"`, `\"includeEnded\"`, or\n   * `\"includeTombstones\"`.\n   *\n   * @example\n   * ```typescript\n   * const withTombstones = store.view({ mode: \"includeTombstones\" });\n   * const everyEverVersion = await withTombstones.nodes.Person.find();\n   * ```\n   *\n   * @param coordinate - The `(mode, asOf)` coordinate to pin. `asOf` is\n   *   required when `mode` is `\"asOf\"` and rejected for every other mode.\n   */\n  view(coordinate: StoreViewCoordinate): StoreView<G> {\n    return new StoreView(this, coordinate);\n  }\n\n  /**\n   * Returns a read-only {@link StoreView} pinned to the current instant,\n   * captured once at construction — a stable point-in-time snapshot. Unlike\n   * `store.view({ mode: \"current\" })` (which tracks \"now\" live and can read\n   * different surfaces against slightly different clocks), a snapshot pins one\n   * `asOf` timestamp, so every surface observes the same instant. Sugar for\n   * `store.asOf(new Date().toISOString())`; mirrors Datomic's `(d/db conn)`.\n   *\n   * @example\n   * ```typescript\n   * const snap = store.snapshot();\n   * // Every read on `snap` sees the graph as of one fixed instant.\n   * const a = await snap.nodes.Person.find();\n   * const r = await snap.reachable(rootId, { edges: [\"knows\"] });\n   * ```\n   */\n  snapshot(): StoreView<G> {\n    return this.asOf(nowIso());\n  }\n\n  // === Search ===\n\n  /**\n   * Search-related operations (fulltext, hybrid, and rebuild).\n   *\n   * All search methods live under this facade to keep the top-level\n   * Store API focused on CRUD + graph traversal. The facade is\n   * lazy-initialized and cached for the lifetime of the store.\n   *\n   * @example\n   * ```typescript\n   * // Fulltext\n   * const hits = await store.search.fulltext(\"Document\", {\n   *   query: \"climate warming\",\n   *   limit: 10,\n   *   includeSnippets: true,\n   * });\n   *\n   * // Hybrid (vector + fulltext fused with RRF)\n   * const ranked = await store.search.hybrid(\"Document\", {\n   *   limit: 10,\n   *   vector: { fieldPath: \"embedding\", queryEmbedding: vec },\n   *   fulltext: { query: \"climate warming\" },\n   * });\n   *\n   * // Rebuild index after schema change\n   * const stats = await store.search.rebuildFulltext();\n   * ```\n   */\n  get search(): StoreSearch<G> {\n    if (this.#search === undefined) {\n      this.#search = new StoreSearch<G>({\n        graphId: this.graphId,\n        backend: this.#backend,\n        registry: this.#registry,\n      });\n    }\n    return this.#search;\n  }\n\n  // === Batch Query Execution ===\n\n  /**\n   * Executes multiple queries and returns a typed tuple of results.\n   *\n   * Each query preserves its own result type, projection, filtering, sorting,\n   * and pagination.\n   *\n   * **Snapshot consistency is conditional.** When\n   * `backend.capabilities.transactions` is `true`, queries run sequentially\n   * on a single connection inside an implicit transaction and observe the\n   * same database snapshot. When transactions are unavailable\n   * (Cloudflare D1, `drizzle-orm/neon-http`), queries run sequentially over\n   * independent connections and may observe writes that landed between them.\n   * Branch on `backend.capabilities.transactions` if you need a guaranteed\n   * snapshot.\n   *\n   * Read-only — use `bulkCreate`, `bulkInsert`, etc. for write batching.\n   *\n   * @example\n   * ```typescript\n   * const [people, companies] = await store.batch(\n   *   store.query()\n   *     .from(\"Person\", \"p\")\n   *     .select((ctx) => ({ id: ctx.p.id, name: ctx.p.name })),\n   *   store.query()\n   *     .from(\"Company\", \"c\")\n   *     .select((ctx) => ({ id: ctx.c.id, name: ctx.c.name }))\n   *     .orderBy(\"c\", \"name\", \"asc\")\n   *     .limit(5),\n   * );\n   * // people:    readonly { id: string; name: string }[]\n   * // companies: readonly { id: string; name: string }[]\n   * ```\n   *\n   * @param queries - Two or more executable queries (from `.select()` or set operations)\n   * @returns A tuple with per-query typed results, preserving input order\n   */\n  async batch<\n    const Queries extends readonly [\n      BatchableQuery<unknown>,\n      BatchableQuery<unknown>,\n      ...BatchableQuery<unknown>[],\n    ],\n  >(...queries: Queries): Promise<BatchResults<Queries>> {\n    return runOptionallyInTransaction(this.#backend, async (target) => {\n      const results: unknown[] = [];\n      for (const query of queries) {\n        const result = await query.executeOn(target);\n        results.push(result);\n      }\n      return results as BatchResults<Queries>;\n    });\n  }\n\n  // === Subgraph Extraction ===\n\n  /**\n   * Extracts a typed subgraph by traversing from a root node.\n   *\n   * Performs a BFS traversal from `rootId` following the specified edge kinds,\n   * returning an indexed result with adjacency maps for immediate traversal.\n   *\n   * @example\n   * ```typescript\n   * const sg = await store.subgraph(run.id, {\n   *   edges: [\"has_task\", \"runs_agent\", \"uses_skill\"],\n   *   maxDepth: 4,\n   * });\n   *\n   * // Root node (the traversal starting point)\n   * console.log(sg.root?.kind);\n   *\n   * // Lookup by ID\n   * const task = sg.nodes.get(taskId);\n   *\n   * // Forward adjacency: edges of a kind from a node\n   * const taskEdges = sg.adjacency.get(run.id)?.get(\"has_task\") ?? [];\n   *\n   * // Reverse adjacency: edges of a kind pointing to a node\n   * const parentEdges = sg.reverseAdjacency.get(taskId)?.get(\"has_task\") ?? [];\n   * ```\n   */\n  async subgraph<\n    const EK extends EdgeKinds<G>,\n    const NK extends NodeKinds<G> = NodeKinds<G>,\n    const P extends SubgraphProject<G, NK, EK> | undefined = undefined,\n  >(\n    rootId: NodeId<AllNodeTypes<G>>,\n    options: SubgraphOptions<G, EK, NK, P>,\n  ): Promise<SubgraphResult<G, NK, EK, P>> {\n    return executeSubgraph({\n      graph: this.#graph,\n      graphId: this.graphId,\n      rootId,\n      backend: this.#backend,\n      dialect: getDialect(this.#backend.dialect),\n      schema: this.#schema,\n      options,\n    });\n  }\n\n  // === Transactions ===\n\n  /**\n   * Executes a function within a transaction.\n   *\n   * The transaction context provides the same collection API as the Store:\n   * - `tx.nodes.Person.create(...)` - Create a node\n   * - `tx.edges.worksAt.create(...)` - Create an edge\n   * - `tx.sql` - the raw Drizzle handle **bound to this same\n   *   transaction**, for writing the caller's own relational tables in\n   *   the same atomic boundary (the graph-owned counterpart of\n   *   {@link Store.withTransaction}). See {@link TransactionContext}\n   *   for per-backend semantics; it is `undefined` only on the\n   *   non-transactional fallback.\n   *\n   * @example\n   * ```typescript\n   * await store.transaction(async (tx) => {\n   *   const person = await tx.nodes.Person.create({ name: \"Alice\" });\n   *   const company = await tx.nodes.Company.create({ name: \"Acme\" });\n   *   await tx.edges.worksAt.create(\n   *     { kind: \"Person\", id: person.id },\n   *     { kind: \"Company\", id: company.id },\n   *     { role: \"Engineer\" }\n   *   );\n   * });\n   * ```\n   *\n   * @example Cross-store write via `tx.sql` (graph-owned boundary):\n   * ```typescript\n   * await store.transaction(async (tx) => {\n   *   await tx.nodes.Document.update(documentId, props);\n   *   // cast `tx.sql` to your concrete Drizzle database type\n   *   const sqlTx = tx.sql as NodePgDatabase;\n   *   await sqlTx.insert(documentVersions).values(versionRow);\n   * });\n   * ```\n   *\n   * **Backends without transactions.** When `backend.capabilities.transactions`\n   * is `false` (Cloudflare D1, `drizzle-orm/neon-http`), this method runs the\n   * callback against the same backend used outside `transaction()` — writes\n   * are applied as they happen and a thrown error does **not** roll back\n   * earlier writes inside the callback. Branch on\n   * `backend.capabilities.transactions` if you require atomicity:\n   *\n   * ```typescript\n   * if (backend.capabilities.transactions) {\n   *   await store.transaction(async (tx) => { ... });\n   * } else {\n   *   // sequential, non-atomic — handle partial-failure recovery yourself\n   * }\n   * ```\n   *\n   * @param fn The callback run inside the transaction boundary.\n   * @param options Optional {@link TransactionOptions} forwarded to the\n   *   backend (e.g. `isolationLevel: \"serializable\"` on Postgres). Backends\n   *   without isolation-level support ignore it; the non-transactional\n   *   fallback ignores it entirely.\n   */\n  async transaction<T>(\n    fn: (tx: TransactionContext<G>) => Promise<T>,\n    options?: TransactionOptions,\n  ): Promise<T> {\n    // Without a real transaction the tx-scoped collections would be\n    // bound to the same backend as this.nodes/this.edges and exposing\n    // the cached versions avoids rebuilding the proxies on every call.\n    // An isolation-level request in `options` is equally meaningless here.\n    if (!this.#backend.capabilities.transactions) {\n      return fn({\n        nodes: this.nodes,\n        edges: this.edges,\n        backend: this.#backend,\n      });\n    }\n\n    // #134/#135: no gate here. The backend's transaction() wraps the\n    // tx-scoped fulltext methods so the durable-marker assert fires at\n    // point of use (a cached SELECT, never DDL). A transaction that\n    // never touches fulltext requires no fulltext initialization.\n    return this.#backend.transaction(\n      async (txBackend, sql) =>\n        fn(this.#buildTransactionContext(txBackend, sql)),\n      options,\n    );\n  }\n\n  /**\n   * Adopts a caller-owned, already-open Drizzle transaction so the graph\n   * store and the caller's relational writes commit or roll back as one\n   * Postgres/SQLite transaction (#134).\n   *\n   * Use this when the **relational layer owns the transaction**: the\n   * caller has opened a transaction and needs TypeGraph writes enlisted\n   * on the *same* connection. Unlike {@link transaction}, this opens no\n   * transaction — the caller's transaction is the single commit/rollback\n   * boundary.\n   *\n   * `withTransaction` is driver-agnostic; how the caller opens the\n   * transaction is not. **Async drivers** (node-postgres,\n   * `neon-serverless` Pool, libsql) use `db.transaction(async …)`.\n   * **Synchronous `better-sqlite3`** cannot — its driver rejects an\n   * `async` transaction callback (`Transaction function cannot return a\n   * promise`) and the async continuation would run outside the\n   * rolled-back transaction — so the caller opens the transaction with\n   * explicit `BEGIN`/`COMMIT`/`ROLLBACK` on the single connection\n   * instead. See the \"Cross-Store Transactions\" recipe for both shapes.\n   *\n   * The returned context reuses this store's already-resolved\n   * schema/registry: it runs **no** schema bootstrap, `evolve`, or\n   * migration, and emits **no DDL** inside the caller's transaction.\n   * Fulltext operations assert the durable materialization marker (a\n   * cached SELECT) and throw {@link StoreNotInitializedError} on a\n   * missing/stale/failed marker rather than migrating mid-transaction —\n   * so boot the parent store via `createStoreWithSchema` once at\n   * startup.\n   *\n   * @example\n   * ```typescript\n   * // Async driver (Postgres / libsql):\n   * await db.transaction(async (sqlTx) => {\n   *   const connector = await createConnectorRow(sqlTx, input); // Drizzle\n   *   const txStore = store.withTransaction(sqlTx);\n   *   await txStore.nodes.ArtifactSource.create({              // TypeGraph\n   *     connectorId: connector.id,\n   *   });\n   * }); // one COMMIT / ROLLBACK across both layers\n   * ```\n   *\n   * @throws {ConfigurationError} when the backend cannot adopt an\n   *   external transaction — either it is not a Drizzle Postgres/SQLite\n   *   backend, or `backend.capabilities.transactions` is `false`\n   *   (`drizzle-orm/neon-http`, Cloudflare D1, SQLite\n   *   `transactionMode: \"none\"`). A non-atomic fallback is deliberately\n   *   not offered here: the caller's relational write *would* still\n   *   commit, defeating the purpose of cross-store atomicity.\n   * @throws {StoreNotInitializedError} at point of use, when a fulltext\n   *   operation on the returned context observes a missing/stale/failed\n   *   durable materialization marker (parent store not booted via\n   *   `createStoreWithSchema`). Rolls back the caller's transaction\n   *   without emitting any DDL.\n   */\n  withTransaction(externalTx: AdoptedTransaction): TransactionContext<G> {\n    const adopt = this.#backend.adoptTransaction;\n    if (!adopt) {\n      throw new ConfigurationError(\n        \"This backend cannot adopt an external transaction for cross-store \" +\n          \"atomicity. adoptTransaction is provided only by the Drizzle \" +\n          \"Postgres/SQLite backends with transaction support. Check \" +\n          \"backend.capabilities.transactions, or run the relational and \" +\n          \"graph writes as separate transactions with manual compensation.\",\n        { capability: \"adoptTransaction\" },\n      );\n    }\n    // The caller already owns the boundary, so `externalTx` *is* the\n    // bound handle — surface it as `tx.sql` for symmetry with the\n    // graph-owned `transaction()` path.\n    return this.#buildTransactionContext(adopt(externalTx), externalTx);\n  }\n\n  /**\n   * Builds the `{ nodes, edges, sql }` projection bound to a\n   * transaction-scoped backend. Shared verbatim by {@link transaction}\n   * (TypeGraph opens the tx) and {@link withTransaction} (#134 — the\n   * caller opened it) so both surfaces resolve collections, query\n   * factories, and the reused graph/registry identically. `sql` is the\n   * raw Drizzle handle bound to the same transaction (#140);\n   * `undefined` only on the non-transactional fallback.\n   */\n  #buildTransactionContext(\n    txBackend: TransactionBackend,\n    sql?: AdoptedTransaction,\n  ): TransactionContext<G> {\n    const txNodeOperations: NodeOperations = {\n      ...this.#nodeOperations,\n      createQuery: () => this.#createQueryForBackend(txBackend),\n    };\n    const txEdgeOperations: EdgeOperations = {\n      ...this.#edgeOperations,\n      createQuery: () => this.#createQueryForBackend(txBackend),\n    };\n\n    const nodes = createNodeCollectionsProxy(\n      this.#graph,\n      this.graphId,\n      this.#registry,\n      txBackend,\n      txNodeOperations,\n    );\n\n    const edges = createEdgeCollectionsProxy(\n      this.#graph,\n      this.graphId,\n      this.#registry,\n      txBackend,\n      txEdgeOperations,\n    );\n\n    return sql === undefined ?\n        { nodes, edges, backend: txBackend }\n      : { nodes, edges, sql, backend: txBackend };\n  }\n\n  // === Graph Lifecycle ===\n\n  /**\n   * Hard-deletes all data for this graph from the database.\n   *\n   * Removes all nodes, edges, uniqueness entries, embeddings, and schema versions\n   * for this graph's ID. No hooks, no per-row logic. Wrapped in a transaction\n   * when the backend supports it.\n   *\n   * The store is usable after clearing — new data can be created immediately.\n   */\n  async clear(): Promise<void> {\n    const doClear = async (\n      target: GraphBackend | TransactionBackend,\n    ): Promise<void> => {\n      await target.clearGraph(this.graphId);\n    };\n\n    await (this.#backend.capabilities.transactions ?\n      this.#backend.transaction(async (tx) => doClear(tx))\n    : doClear(this.#backend));\n\n    // `clearGraph` is graph-agnostic and can't reach the strategy-owned\n    // per-`(kind, field)` vector tables, so reset them here — otherwise cleared\n    // embeddings leak and a reused node id would resurface a stale vector.\n    await this.#clearVectorStorage();\n\n    // Reset lazy-initialized collection caches\n    this.#nodeCollections = undefined;\n    this.#edgeCollections = undefined;\n    this.#algorithms = undefined;\n    this.#search = undefined;\n  }\n\n  /**\n   * Resets every declared embedding field's per-field storage for this graph by\n   * dropping and recreating it empty. Drop+recreate (rather than DELETE) mirrors\n   * `reembedVectorField` and keeps the backend's storage-ensure latch valid: the\n   * table still exists after clear, so a later write finds it. Enumerated from\n   * the in-memory registry (not the DB schema, which `clearGraph` just wiped).\n   */\n  async #clearVectorStorage(): Promise<void> {\n    const backend = this.#backend;\n    const strategy = backend.vectorStrategy;\n    if (strategy === undefined || backend.executeDdl === undefined) return;\n\n    for (const [nodeKind, nodeType] of this.#registry.nodeKinds) {\n      for (const field of resolveEmbeddingFields(nodeType.schema)) {\n        const slot: VectorSlot = {\n          graphId: this.graphId,\n          nodeKind,\n          fieldPath: field.fieldPath,\n          dimensions: field.dimensions,\n          metric: field.metric,\n          indexType: field.indexType,\n        };\n        for (const ddl of strategy.buildDropStorage(slot)) {\n          await backend.executeDdl(ddl);\n        }\n        for (const contribution of strategy.ownedTables(slot)) {\n          for (const ddl of contribution.createDdl) {\n            await backend.executeDdl(ddl);\n          }\n        }\n      }\n    }\n  }\n\n  // === Lifecycle ===\n\n  /**\n   * Refreshes the backend's query-planner statistics.\n   *\n   * Call this once after a large initial import or bulk backfill. The\n   * planner uses table statistics to choose between TypeGraph's\n   * multi-column indexes; without fresh stats a forward traversal can\n   * pick a reverse index and run an order of magnitude slower than\n   * needed. Autovacuum / background statistics will catch up\n   * eventually, but calling this explicitly after a bulk load gives\n   * you correct latencies immediately.\n   *\n   * Implementations:\n   * - SQLite runs `ANALYZE`, populating `sqlite_stat1`\n   * - PostgreSQL runs `ANALYZE` on the TypeGraph-managed tables\n   *\n   * Costs a few tens of milliseconds at the sizes this library is\n   * designed for. Safe to call at any time.\n   *\n   * @example\n   * ```typescript\n   * // After a bulk import\n   * for (const batch of batches) {\n   *   await store.nodes.Document.bulkCreate(batch);\n   * }\n   * await store.refreshStatistics();\n   * ```\n   */\n  async refreshStatistics(): Promise<void> {\n    await this.#backend.refreshStatistics();\n  }\n\n  /**\n   * Evolves the graph at runtime by merging a graph extension into the\n   * current schema, atomically committing a new schema version, and\n   * returning a fresh `Store` constructed against the merged graph.\n   *\n   * The `Store` is immutable — its registry, collections, and operation\n   * contexts close over the graph at construction time — so callers\n   * must use the returned store (or pass a `ref` to be re-pointed) for\n   * any work involving the new kinds.\n   *\n   * **Cost for purely additive extensions is proportional to schema\n   * document size, not row count.** The commit is a single CAS write.\n   * Tightening changes against existing graph-extension-declared kinds run\n   * row-count probes for those affected kinds so populated kinds can\n   * be rejected without a backfill.\n   *\n   * **Concurrent evolve recovery.** On `StaleVersionError`, refetch the\n   * current active schema (or dereference your `StoreRef`),\n   * reconstruct your `Store`, and re-call `evolve(extension)` against\n   * the new store. Re-validation may now surface deterministic errors\n   * (e.g., another caller just added a kind that collides with yours,\n   * or redeclared one of yours with a different shape). Don't loop\n   * blindly — surface the error.\n   *\n   * @param extension - Graph extension produced by\n   *   `defineGraphExtension(...)`.\n   * @param options.ref - Optional handle whose `current` is overwritten\n   *   atomically with the schema commit. Long-lived consumers\n   *   (request handlers, background workers) that dereference through\n   *   the ref see the new kinds on the *next* call.\n   *\n   * @throws {GraphExtensionValidationError} when the extension is\n   *   structurally invalid.\n   * @throws {KindCollisionError} when an extension kind shadows a\n   *   compile-time kind (code `KIND_COLLISION`).\n   * @throws {IncompatibleChangeError} when a redeclared kind narrows\n   *   in a way the existing rows can't satisfy\n   *   (code `INCOMPATIBLE_CHANGE`).\n   * @throws {GraphExtensionUnresolvedEndpointError} when an edge\n   *   endpoint references a kind that exists in neither the extension\n   *   nor the host graph\n   *   (code `GRAPH_EXTENSION_UNRESOLVED_ENDPOINT`).\n   * @throws {StaleVersionError} when another writer has advanced the\n   *   schema since this store was constructed; recovery as above.\n   * @throws {SchemaContentConflictError} when a row already exists at\n   *   the target version with a different content hash.\n   */\n  async evolve(\n    extension: GraphExtension,\n    options?: Readonly<{\n      ref?: StoreRef<Store<G>>;\n      /**\n       * When set, automatically run `materializeIndexes()` on the new\n       * Store after the schema commit succeeds. Pass `{}` for default\n       * behavior (all declared indexes, best-effort) or a populated\n       * options object for finer control. Omit to defer materialization\n       * to a later `materializeIndexes()` call.\n       *\n       * The schema-version write is NOT rolled back if materialization\n       * produces failed entries — failure surfaces as\n       * `EagerMaterializationError` thrown AFTER the new Store is\n       * constructed and `ref.current` is updated, so the caller can\n       * recover via the ref handle.\n       */\n      eager?: MaterializeIndexesOptions;\n    }>,\n  ): Promise<Store<G>> {\n    // Catch up to the persisted state first (extension AND deprecated\n    // set). Without this, a stale store applying an extension on top\n    // of an out-of-date baseline would make ensureSchema diff against\n    // the persisted schema and either treat missing-locally kinds as\n    // removed (breaking MigrationError) or silently drop another\n    // writer's deprecation flags. The CAS guard inside\n    // commitSchemaVersion still serializes the actual commit. If the\n    // stored extension redefines a local extension kind with a\n    // different shape, classifyModifications throws\n    // IncompatibleChangeError here — surfacing the divergence rather\n    // than overwriting.\n    const { activeRow, baseline } = await this.#loadCaughtUp(\"evolve\");\n\n    // Merge first so the \"I evolved with the same extension again\"\n    // hot path short-circuits before we walk every property in\n    // `classifyModifications`. The merge itself canonicalEqual-checks\n    // and returns the input graph unchanged for no-op re-evolves.\n    const merged = mergeGraphExtension(baseline, extension);\n\n    // No-op evolve (extension already applied to the persisted state):\n    // skip the schema commit. We compare against `baseline` (the\n    // caught-up graph), not `this.#graph` (the local one). When\n    // another writer has just committed the same extension, the local\n    // store is stale — `baseline !== this.#graph` — but the merge is\n    // still a structural no-op, so re-committing would only churn the\n    // schema version. When the local store is also fresh\n    // (`baseline === this.#graph`) we return `this` so repeated\n    // `evolve(sameExt)` calls keep warm registry,\n    // collection, and query caches; otherwise we return a clone\n    // wrapping the caught-up baseline so `introspect()` reflects the\n    // persisted version. Eager still runs in either case because the\n    // contract is \"schema committed AND indexes materialized\" — the\n    // local DB may have unmaterialized indexes even when the local\n    // graph hasn't changed (restart-parity flow, prior failed\n    // materialize).\n    if (merged === baseline) {\n      if (baseline === this.#graph) {\n        if (options?.ref !== undefined) options.ref.current = this;\n        if (options?.eager !== undefined) {\n          await this.#runEagerOrThrow(this, options.eager);\n        }\n        return this;\n      }\n      const caughtUp = this.#cloneWithGraph(\n        baseline,\n        options?.ref,\n        schemaMetadataFromRow(activeRow),\n      );\n      if (options?.eager !== undefined) {\n        await this.#runEagerOrThrow(caughtUp, options.eager);\n      }\n      return caughtUp;\n    }\n\n    // Classification gates the schema commit. Same-shape re-evolves\n    // already short-circuited above; here we know there's at least\n    // one delta. Additive changes produce `allowed` deltas (no entry);\n    // tightening changes produce `requireEmpty` entries that we\n    // promote to incompatible only when the kind has rows; genuinely\n    // incompatible changes (REMOVE_PROPERTY, TYPE_CHANGE) are\n    // rejected unconditionally.\n    const baselineDocument = baseline.extension ?? Object.freeze({});\n    const classification = classifyModifications(baselineDocument, extension);\n    if (classification.incompatible.length > 0) {\n      throw new IncompatibleChangeError(\n        classification.incompatible,\n        this.graphId,\n      );\n    }\n    if (classification.requireEmpty.length > 0) {\n      const nonEmpty = await this.#probeEmptyKinds(classification.requireEmpty);\n      const error = buildIncompatibleChangeError(\n        classification,\n        nonEmpty,\n        this.graphId,\n      );\n      if (error !== undefined) throw error;\n    }\n\n    // Commit via `commitNewSchemaVersion` directly (the row-returning\n    // sibling of `migrateSchema`). The classification step above is the\n    // authoritative compatibility gate — `ensureSchema`'s\n    // `isBackwardsCompatible` check would over-restrict ADD-required-\n    // on-empty / TIGHTEN-on-empty modifications that the classifier\n    // already approved.\n    const committed = await commitNewSchemaVersion(\n      this.#backend,\n      merged,\n      activeRow.version,\n    );\n    const evolved = this.#cloneWithGraph(\n      merged,\n      options?.ref,\n      schemaMetadataFromRow(committed),\n    );\n    if (options?.eager !== undefined) {\n      await this.#runEagerOrThrow(evolved, options.eager);\n    }\n    return evolved;\n  }\n\n  async #runEagerOrThrow(\n    store: Store<G>,\n    eager: MaterializeIndexesOptions,\n  ): Promise<void> {\n    const result = await store.materializeIndexes(eager);\n    if (result.results.some((entry) => entry.status === \"failed\")) {\n      throw new EagerMaterializationError(result, this.graphId);\n    }\n  }\n\n  /**\n   * Marks the named node and edge kinds as soft-deprecated. Surfaces in\n   * `store.introspect().deprecatedKinds` for introspection (codegen,\n   * UI tooling, lints) but does not gate reads, writes, or queries —\n   * deprecation is a signal, not a removal.\n   *\n   * Atomically commits a new schema version through the same primitive\n   * `evolve()` uses, so concurrent deprecate/evolve calls produce\n   * `StaleVersionError | SchemaContentConflictError` race losers that\n   * the caller refetches and retries. Idempotent: re-deprecating a\n   * kind that's already marked is a no-op (no version bump).\n   *\n   * @param names - Node or edge kind names to mark as deprecated.\n   * @param options.ref - Optional handle to be re-pointed atomically\n   *   with the schema commit, mirroring `evolve()`.\n   *\n   * @throws {ConfigurationError} on `DEPRECATE_BEFORE_INITIALIZE` (no\n   *   schema yet) or `DEPRECATE_UNKNOWN_KIND` (name not on the graph).\n   * @throws {StaleVersionError} when another writer has advanced the\n   *   schema since this store was constructed; refetch and retry per\n   *   the same recipe `evolve()` documents.\n   * @throws {SchemaContentConflictError} when a row already exists at\n   *   the target version with a different content hash.\n   */\n  async deprecateKinds(\n    names: readonly string[],\n    options?: Readonly<{ ref?: StoreRef<Store<G>> }>,\n  ): Promise<Store<G>> {\n    return this.#updateDeprecatedKinds(\"add\", names, options);\n  }\n\n  /**\n   * Reverses `deprecateKinds(...)` for the named kinds. Same race +\n   * idempotency semantics: removing a name that isn't currently\n   * deprecated is a no-op for that name (the call as a whole is a\n   * no-op only if every name was already absent).\n   *\n   * @param names - Node or edge kind names to remove from the\n   *   deprecated set.\n   * @param options.ref - Optional handle to be re-pointed atomically\n   *   with the schema commit.\n   *\n   * @throws {ConfigurationError} on `DEPRECATE_BEFORE_INITIALIZE`.\n   * @throws {StaleVersionError} on a CAS race with another writer.\n   * @throws {SchemaContentConflictError} on a same-version content\n   *   conflict.\n   */\n  async undeprecateKinds(\n    names: readonly string[],\n    options?: Readonly<{ ref?: StoreRef<Store<G>> }>,\n  ): Promise<Store<G>> {\n    return this.#updateDeprecatedKinds(\"remove\", names, options);\n  }\n\n  /**\n   * Runs `CREATE INDEX` DDL for the indexes declared on this graph and\n   * records per-deployment status in `typegraph_index_materializations`.\n   * The status table is per-database (two replicas of the same\n   * `schema_doc` are still two different databases for DDL purposes),\n   * so the same call against two replicas materializes independently.\n   *\n   * Idempotent. Re-running the verb against an already-materialized\n   * index is a no-op (`status: \"alreadyMaterialized\"`). Postgres uses\n   * `CREATE INDEX CONCURRENTLY` so live tables never take an\n   * `AccessExclusiveLock`. SQLite is single-writer regardless.\n   *\n   * Best-effort by default: a failed index records `status: \"failed\"`\n   * with the error and the loop continues. Pass `{ stopOnError: true }`\n   * to halt on the first failure.\n   *\n   * @param options.kinds - Restrict to indexes whose `kind` is in this\n   *   set. Throws `ConfigurationError` (`code:\n   *   \"MATERIALIZE_UNKNOWN_KIND\"`) if any name doesn't match a known\n   *   compile-time or extension kind.\n   * @param options.stopOnError - Halt on first failure. Default false.\n   *\n   * @throws {ConfigurationError} `MATERIALIZE_BACKEND_UNSUPPORTED` if\n   *   the backend lacks `executeDdl`, `getIndexMaterialization`, or\n   *   `recordIndexMaterialization`; `MATERIALIZE_UNKNOWN_KIND` for an\n   *   unknown kind name; `MATERIALIZE_BEFORE_INITIALIZE` if the store\n   *   has no schema yet.\n   */\n  async materializeIndexes(\n    options?: MaterializeIndexesOptions,\n  ): Promise<MaterializeIndexesResult> {\n    const { activeRow, baseline } = await this.#loadCaughtUp(\"materialize\");\n    return materializeIndexesImpl(\n      {\n        graph: baseline,\n        graphId: this.graphId,\n        backend: this.#backend,\n        schemaVersion: activeRow.version,\n      },\n      options ?? {},\n    );\n  }\n\n  /**\n   * Recreate a vector field's per-field storage at its current declared\n   * dimension, then optionally re-embed existing rows.\n   *\n   * Use this after changing a field's `embedding(N)` to `embedding(M)` (e.g. a\n   * new embedding model): the stored N-dim vectors are invalid under the new\n   * dimension and must be recomputed, not converted. This drops and recreates\n   * the per-`(graphId, kind, field)` table at the new dimension — a brief\n   * window where the field returns no vector hits — resets its materialization\n   * marker, then, when `options.embed` is supplied, pages the kind's nodes,\n   * calls `embed(batch)`, and upserts the returned vectors. Without `embed`,\n   * storage is recreated empty and the caller re-embeds via normal\n   * `update()` / `upsertEmbedding` writes.\n   *\n   * @throws {ConfigurationError} when the backend has no vector strategy or\n   *   cannot execute DDL, or `(kind, fieldPath)` is not a declared embedding.\n   */\n  async reembedVectorField(\n    kind: string,\n    fieldPath: string,\n    options?: ReembedVectorFieldOptions,\n  ): Promise<ReembedVectorFieldResult> {\n    // Validate up front, before any drop/recreate side effects.\n    if (\n      options?.batchSize !== undefined &&\n      (!Number.isInteger(options.batchSize) || options.batchSize <= 0)\n    ) {\n      throw new RangeError(\n        `reembedVectorField batchSize must be a positive integer, got: ${options.batchSize}`,\n      );\n    }\n    const { activeRow, baseline } = await this.#loadCaughtUp(\"reembed\");\n    const backend = this.#backend;\n    const strategy = backend.vectorStrategy;\n    if (strategy === undefined || backend.executeDdl === undefined) {\n      throw new ConfigurationError(\n        \"reembedVectorField requires a backend with a vector strategy and executeDdl.\",\n        {\n          backend: backend.dialect,\n          capability: \"vector\",\n          operation: \"reembed\",\n        },\n      );\n    }\n    const declaration = (baseline.indexes ?? []).find(\n      (candidate): candidate is VectorIndexDeclaration =>\n        candidate.entity === \"vector\" &&\n        candidate.kind === kind &&\n        candidate.fieldPath === fieldPath,\n    );\n    if (declaration === undefined) {\n      throw new ConfigurationError(\n        `No embedding field \"${kind}.${fieldPath}\" is declared in the active schema.`,\n        { kind, fieldPath, operation: \"reembed\" },\n      );\n    }\n\n    const slot: VectorSlot = {\n      graphId: this.graphId,\n      nodeKind: kind,\n      fieldPath,\n      dimensions: declaration.dimensions,\n      metric: declaration.metric,\n      indexType: declaration.indexType,\n    };\n\n    // Recreate storage at the new dimension: drop, then re-emit the table DDL\n    // the strategy owns (libSQL/sqlite-vec also (re)create their index/vtable\n    // here; pgvector's index is built via createVectorIndex below). Run via\n    // executeDdl directly so it bypasses the ensure-latch, which may still\n    // record the pre-drop slot as ensured.\n    for (const ddl of strategy.buildDropStorage(slot)) {\n      await backend.executeDdl(ddl);\n    }\n    for (const contribution of strategy.ownedTables(slot)) {\n      for (const ddl of contribution.createDdl) {\n        await backend.executeDdl(ddl);\n      }\n    }\n\n    // Whether this backend would actually materialize an ANN index for the\n    // declared slot — brute-force-only (\"none\") slots and index types the\n    // backend doesn't advertise are skipped. Gates both the index (re)build\n    // and the materialization-marker reset below so they stay in lockstep.\n    const declaredIndexMaterializes =\n      declaration.indexType !== \"none\" &&\n      backend.capabilities.vector?.indexTypes.includes(\n        declaration.indexType,\n      ) === true;\n\n    // (Re)build the ANN index with the field's DECLARED tuning. The table was\n    // just recreated above, so createVectorIndex's own ensure is a safe no-op\n    // even if the latch is stale.\n    if (declaredIndexMaterializes && backend.createVectorIndex !== undefined) {\n      await backend.createVectorIndex({\n        graphId: this.graphId,\n        nodeKind: kind,\n        fieldPath,\n        dimensions: declaration.dimensions,\n        metric: declaration.metric,\n        indexType: declaration.indexType,\n        indexParams: {\n          m: declaration.indexParams.m,\n          efConstruction: declaration.indexParams.efConstruction,\n          ...(declaration.indexParams.lists === undefined ?\n            {}\n          : { lists: declaration.indexParams.lists }),\n        },\n      });\n    }\n\n    // Reset the index-materialization marker so a later materializeIndexes()\n    // sees the new-dimension signature as already materialized, not as drift.\n    if (\n      declaredIndexMaterializes &&\n      backend.recordIndexMaterialization !== undefined\n    ) {\n      const tableName = strategy.tableName(this.graphId, kind, fieldPath);\n      const signature = await computeIndexSignature(\n        backend.dialect,\n        tableName,\n        declaration,\n      );\n      const now = nowIso();\n      await backend.recordIndexMaterialization({\n        indexName: vectorStatusKey(this.graphId, declaration.name),\n        graphId: this.graphId,\n        entity: \"vector\",\n        kind,\n        signature,\n        schemaVersion: activeRow.version,\n        attemptedAt: now,\n        materializedAt: now,\n        error: undefined,\n      });\n    }\n\n    if (options?.embed === undefined) {\n      return { recreated: true, reembedded: 0 };\n    }\n\n    if (backend.upsertEmbedding === undefined) {\n      throw new ConfigurationError(\n        \"reembedVectorField with an `embed` callback requires a backend that supports upsertEmbedding.\",\n        {\n          backend: backend.dialect,\n          capability: \"vector\",\n          operation: \"reembed\",\n        },\n      );\n    }\n\n    // Re-embed: page the kind's nodes, compute vectors, upsert. Offset paging\n    // is stable because upserts target the per-field table, not the nodes table.\n    const upsertEmbedding = backend.upsertEmbedding;\n    const batchSize = options.batchSize ?? DEFAULT_REEMBED_BATCH_SIZE;\n    const collection = this.getNodeCollectionOrThrow(kind);\n    let reembedded = 0;\n    let offset = 0;\n    for (;;) {\n      const batch = (await collection.find({\n        limit: batchSize,\n        offset,\n      })) as readonly Node[];\n      if (batch.length === 0) break;\n      const vectors = await options.embed(batch);\n      for (const node of batch) {\n        const embedding = vectors.get(node.id);\n        if (embedding === undefined) continue;\n        await upsertEmbedding({\n          graphId: this.graphId,\n          nodeKind: kind,\n          nodeId: node.id,\n          fieldPath,\n          embedding,\n          dimensions: declaration.dimensions,\n          metric: declaration.metric,\n          indexType: declaration.indexType,\n        });\n        reembedded += 1;\n      }\n      offset += batch.length;\n      if (batch.length < batchSize) break;\n    }\n    return { recreated: true, reembedded };\n  }\n\n  /**\n   * Removes extension kinds from the schema with cascading edge and\n   * ontology cleanup. Two-phase by design:\n   *\n   *   1. **Schema commit (this method).** Validates the removal,\n   *      rebuilds the persisted extension without the named kinds\n   *      (and without extension edges that lose their last endpoint),\n   *      CAS-commits the new schema version, and queues\n   *      per-deployment data-cleanup status. Millisecond budget.\n   *   2. **Data cleanup (`materializeRemovals`).** Deletes the orphan\n   *      rows from the nodes/edges tables. Bounded by row count.\n   *\n   * Pass `{ eager: {} }` to run the data-cleanup pass inline with\n   * default options, or `{ eager: { ... } }` to scope it; otherwise\n   * call `materializeRemovals()` later.\n   *\n   * Idempotent: removing a name that doesn't exist is a no-op (no\n   * version bump). Removing an extension kind referenced by a compile-\n   * time edge or ontology relation throws `KindHasReferentsError`.\n   * Removing a compile-time kind throws `RemoveCompileTimeKindError` —\n   * compile-time kinds are removed by recompiling and redeploying.\n   *\n   * @throws {RemoveCompileTimeKindError} when `names` includes a\n   *   compile-time kind.\n   * @throws {KindHasReferentsError} when an extension kind being\n   *   removed is referenced by a compile-time declaration.\n   * @throws {StaleVersionError} on a CAS race with another writer.\n   * @throws {SchemaContentConflictError} on a same-version content\n   *   conflict.\n   */\n  async removeKinds(\n    names: readonly string[],\n    options?: Readonly<{\n      ref?: StoreRef<Store<G>>;\n      eager?: MaterializeRemovalsOptions;\n    }>,\n  ): Promise<Store<G>> {\n    const { activeRow, baseline } = await this.#loadCaughtUp(\"remove\");\n    const plan = planRemovals(baseline, names);\n\n    // True no-op: every name was either absent or already removed.\n    // Mirrors the (un)deprecateKinds same-set short-circuit.\n    if (\n      plan.removedNodeKinds.length === 0 &&\n      plan.removedEdgeKinds.length === 0\n    ) {\n      if (baseline === this.#graph) {\n        if (options?.ref !== undefined) options.ref.current = this;\n        return this;\n      }\n      return this.#cloneWithGraph(\n        baseline,\n        options?.ref,\n        schemaMetadataFromRow(activeRow),\n      );\n    }\n\n    // Build the post-removal graph: rebuild from the new\n    // extension by re-applying the merge against the host\n    // graph's compile-time slice. Take the host's compile-time\n    // graph (the `Store<G>`'s original `#graph` minus extension\n    // kinds) and merge the planned extension on top of it.\n    const compileTimeGraph = stripGraphExtension(this.#graph);\n    const merged =\n      plan.document === undefined ?\n        compileTimeGraph\n      : mergeGraphExtension(compileTimeGraph, plan.document);\n    const finalGraph = applyDeprecatedKinds(merged, baseline.deprecatedKinds);\n\n    // Atomic schema commit via the lower-level `migrateSchema`\n    // primitive — `ensureSchema`'s breaking-change check would\n    // reject the kind removal as a destructive diff. The removal IS\n    // destructive by design; that's why removeKinds is a separate\n    // verb. Concurrent commits surface as `StaleVersionError` from\n    // `commitSchemaVersion` (CAS check).\n    const committedRow = await commitNewSchemaVersion(\n      this.#backend,\n      finalGraph,\n      activeRow.version,\n    );\n\n    // Queue per-deployment data-cleanup status — one row per removed\n    // kind. The status table is best-effort: if recordKindRemoval\n    // throws, the schema commit is already done and the rows just\n    // become invisible (queries against the kind go through the new\n    // store). Operators reconcile via materializeRemovals later.\n    const recordKindRemoval = this.#backend.recordKindRemoval;\n    if (recordKindRemoval !== undefined) {\n      if (this.#backend.ensureKindRemovalsTable !== undefined) {\n        await this.#backend.ensureKindRemovalsTable();\n      }\n      const attemptedAt = nowIso();\n      const newSchemaVersion = committedRow.version;\n      const queue = (kindName: string, entity: KindEntity): Promise<void> =>\n        recordKindRemoval(\n          buildPendingKindRemoval({\n            graphId: this.graphId,\n            kindName,\n            entity,\n            schemaVersion: newSchemaVersion,\n            attemptedAt,\n          }),\n        );\n      // Independent rows on independent primary keys — issue in parallel.\n      // For typical cascades (one kind + a few edges) this drops the\n      // schema-commit budget by 30-100ms on Postgres.\n      await Promise.all([\n        ...plan.removedNodeKinds.map((name) => queue(name, \"node\")),\n        ...plan.removedEdgeKinds.map((name) => queue(name, \"edge\")),\n      ]);\n    }\n\n    const evolved = this.#cloneWithGraph(\n      finalGraph,\n      options?.ref,\n      schemaMetadataFromRow(committedRow),\n    );\n    if (options?.eager !== undefined) {\n      // Scope to just the kinds removed by THIS call (other pending\n      // removals from prior calls aren't this caller's concern).\n      const kinds = [...plan.removedNodeKinds, ...plan.removedEdgeKinds];\n      await evolved.materializeRemovals({\n        ...options.eager,\n        kinds: options.eager.kinds ?? kinds,\n      });\n    }\n    return evolved;\n  }\n\n  /**\n   * Runs the data-cleanup phase for any kinds removed via\n   * `removeKinds()` whose data has not yet been deleted on this\n   * deployment. Safe to call repeatedly; idempotent.\n   */\n  async materializeRemovals(\n    options?: MaterializeRemovalsOptions,\n  ): Promise<MaterializeRemovalsResult> {\n    return materializeRemovalsImpl(\n      { graphId: this.graphId, backend: this.#backend },\n      options ?? {},\n    );\n  }\n\n  async #updateDeprecatedKinds(\n    direction: \"add\" | \"remove\",\n    names: readonly string[],\n    options: Readonly<{ ref?: StoreRef<Store<G>> }> | undefined,\n  ): Promise<Store<G>> {\n    const verb = direction === \"add\" ? \"deprecate\" : \"undeprecate\";\n    const { activeRow, storedSchema, baseline } =\n      await this.#loadCaughtUp(verb);\n    const nextSet = new Set(baseline.deprecatedKinds);\n\n    if (direction === \"add\") {\n      for (const name of names) {\n        if (!isKnownKind(baseline, name)) {\n          // Deprecate accepts either node OR edge kinds — the runtime\n          // kind type is reported as \"node\" here for the error\n          // message default; consumers branch on `kindName` not\n          // `entity` for this code path.\n          throw new KindNotFoundError(\n            name,\n            isKnownEdgeKind(baseline, name) ? \"edge\" : \"node\",\n            {\n              graphId: this.graphId,\n              suggestion:\n                \"Only kinds declared on the graph (compile-time or runtime) can be deprecated.\",\n            },\n          );\n        }\n        nextSet.add(name);\n      }\n    } else {\n      for (const name of names) nextSet.delete(name);\n    }\n\n    if (setsEqual(nextSet, baseline.deprecatedKinds)) {\n      // True no-op only when the catch-up didn't change anything\n      // either. Otherwise the caller's `this` reference is stale\n      // relative to the persisted state — return a clone of the\n      // caught-up baseline so they pick up another writer's\n      // extension kinds and deprecation flags.\n      if (baseline === this.#graph) {\n        if (options?.ref !== undefined) options.ref.current = this;\n        return this;\n      }\n      return this.#cloneWithGraph(\n        baseline,\n        options?.ref,\n        schemaMetadataFromRow(activeRow),\n      );\n    }\n\n    const merged = applyDeprecatedKinds(baseline, nextSet);\n    const result = await ensureSchemaImpl(this.#backend, merged, {\n      preloaded: { activeRow, storedSchema },\n      autoMigrate: true,\n    });\n    // Use the committed row from the migration result when available,\n    // skipping the post-commit `getActiveSchema` round-trip. The\n    // `unchanged` / `pending` / `breaking` branches don't write a new\n    // version, so the existing `activeRow` metadata is still authoritative.\n    const metadata =\n      result.status === \"migrated\" || result.status === \"initialized\" ?\n        schemaMetadataFromRow(result.committedRow)\n      : schemaMetadataFromRow(activeRow);\n    return this.#cloneWithGraph(merged, options?.ref, metadata);\n  }\n\n  #catchUpToStored(storedSchema: SerializedSchema): G {\n    // Strip the local extension slice before re-applying the persisted\n    // extension. Otherwise a stale store whose `this.#graph` carries\n    // extension kinds another writer has since removed would resurrect\n    // them: `unionDocuments` unions local extension nodes/edges back in,\n    // and the absent-from-stored kinds win the spread. Stripping first\n    // makes the merge a function of the persisted document alone, so\n    // removeKinds on one store cannot be silently undone by a stale peer.\n    const compileTimeGraph = stripGraphExtension(this.#graph);\n    const withGraphExtension =\n      storedSchema.extension === undefined ?\n        compileTimeGraph\n      : mergeGraphExtension(compileTimeGraph, storedSchema.extension);\n    return applyDeprecatedKinds(\n      withGraphExtension,\n      storedSchema.deprecatedKinds,\n    );\n  }\n\n  /**\n   * Loads the active schema row, parses it, and catches the in-memory\n   * graph up to the persisted state — the shared preamble for\n   * `evolve`, `materializeIndexes`, and `(un)deprecateKinds`.\n   *\n   * Throws `ConfigurationError` with a verb-specific code when the\n   * graph has not been initialized yet. The catch-up step replays the\n   * persisted graph-extension document and deprecation set on top of the\n   * compile-time graph so we diff against the same baseline another\n   * writer would; the CAS guard inside `commitSchemaVersion` still\n   * serializes the actual commit.\n   */\n  async #loadCaughtUp(verb: CaughtUpVerb): Promise<{\n    activeRow: SchemaVersionRow;\n    storedSchema: SerializedSchema;\n    baseline: G;\n  }> {\n    const activeRow = await loadActiveSchemaWithBootstrap(\n      this.#backend,\n      this.graphId,\n    );\n    if (activeRow === undefined) {\n      const { phrase, code } = CAUGHT_UP_VERB_DETAILS[verb];\n      throw new ConfigurationError(\n        `Cannot ${phrase} graph \"${this.graphId}\": no schema has been initialized. Call createStoreWithSchema first.`,\n        { code },\n      );\n    }\n    const storedSchema = parseSerializedSchema(activeRow.schema_doc);\n    const baseline = this.#catchUpToStored(storedSchema);\n    return { activeRow, storedSchema, baseline };\n  }\n\n  /**\n   * Probes each `requireEmpty` entry for any rows. Returns the set of\n   * composite keys (`${entity}:${kindName}`) that have at least one\n   * row — those entries need to be promoted from \"allowed-on-empty\"\n   * to incompatible. Dispatches to `countNodesByKind` for `node`\n   * entries and `countEdgesByKind` for `edge` entries (a single-\n   * primitive probe would always return 0 for the wrong-entity case\n   * and silently bypass the gate).\n   *\n   * Probes run in parallel; each entry is independent. Race window\n   * (probe → CAS commit): another writer can insert a row into a\n   * previously-empty kind. The schema commit still succeeds (CAS\n   * guards on schema version, not row count); the new schema rejects\n   * the inserted row at next read, which the operator inspects and\n   * either deletes or reverts. Rare in practice; tighter elimination\n   * would require `SELECT FOR UPDATE` on the rows table, too\n   * heavyweight for a millisecond-budget operation.\n   */\n  async #probeEmptyKinds(\n    requireEmpty: readonly RequireEmptyEntry[],\n  ): Promise<Set<RequireEmptyEntry>> {\n    const probes = requireEmpty.map(\n      async (entry): Promise<readonly [RequireEmptyEntry, number]> => {\n        const count =\n          entry.entity === \"node\" ?\n            await this.#backend.countNodesByKind({\n              graphId: this.graphId,\n              kind: entry.kindName,\n            })\n          : await this.#backend.countEdgesByKind({\n              graphId: this.graphId,\n              kind: entry.kindName,\n            });\n        return [entry, count];\n      },\n    );\n    const results = await Promise.all(probes);\n    const nonEmpty = new Set<RequireEmptyEntry>();\n    for (const [entry, count] of results) {\n      if (count > 0) nonEmpty.add(entry);\n    }\n    return nonEmpty;\n  }\n\n  #cloneWithGraph(\n    graph: G,\n    ref: StoreRef<Store<G>> | undefined,\n    schemaMetadata: StoreSchemaMetadata = this.#schemaMetadata,\n  ): Store<G> {\n    const next = new Store(graph, this.#backend, this.#options, schemaMetadata);\n    if (ref !== undefined) ref.current = next;\n    return next;\n  }\n\n  /**\n   * Closes the store and releases underlying resources.\n   *\n   * Note: When using the Drizzle adapter, this method does not close the database\n   * connection itself, as Drizzle delegates connection management to the user.\n   * You should close the underlying database connection (e.g., better-sqlite3 or pg pool)\n   * using their respective APIs.\n   */\n  async close(): Promise<void> {\n    await this.#backend.close();\n  }\n\n  // === Internal: Operation Contexts ===\n\n  #createNodeOperationContext(): NodeOperationContext<G> {\n    return {\n      graph: this.#graph,\n      graphId: this.graphId,\n      registry: this.#registry,\n      createOperationContext: (operation, entity, kind, id) =>\n        this.#createOperationContext(operation, entity, kind, id),\n      withOperationHooks: <T>(\n        ctx: OperationHookContext,\n        fn: () => Promise<T>,\n      ) => this.#withOperationHooks(ctx, fn),\n    };\n  }\n\n  #createEdgeOperationContext(): EdgeOperationContext<G> {\n    return {\n      graph: this.#graph,\n      graphId: this.graphId,\n      registry: this.#registry,\n      createOperationContext: (operation, entity, kind, id) =>\n        this.#createOperationContext(operation, entity, kind, id),\n      withOperationHooks: <T>(\n        ctx: OperationHookContext,\n        fn: () => Promise<T>,\n      ) => this.#withOperationHooks(ctx, fn),\n    };\n  }\n\n  // === Internal: Hook Helpers ===\n\n  #createHookContext(): HookContext {\n    return {\n      operationId: generateId(),\n      graphId: this.graphId,\n      startedAt: new Date(),\n    };\n  }\n\n  #createOperationContext(\n    operation: \"create\" | \"update\" | \"delete\",\n    entity: KindEntity,\n    kind: string,\n    id: string,\n  ): OperationHookContext {\n    return {\n      ...this.#createHookContext(),\n      operation,\n      entity,\n      kind,\n      id,\n    };\n  }\n\n  async #withOperationHooks<T>(\n    ctx: OperationHookContext,\n    fn: () => Promise<T>,\n  ): Promise<T> {\n    this.#hooks.onOperationStart?.(ctx);\n    const startTime = Date.now();\n    try {\n      const result = await fn();\n      this.#hooks.onOperationEnd?.(ctx, {\n        durationMs: Date.now() - startTime,\n      });\n      return result;\n    } catch (error) {\n      this.#hooks.onError?.(\n        ctx,\n        error instanceof Error ? error : new Error(String(error)),\n      );\n      throw error;\n    }\n  }\n\n  // === Internal: Temporal Filtering ===\n\n  #temporalRowMatcher(options?: QueryOptions): (\n    row: Readonly<{\n      deleted_at: string | undefined;\n      valid_from: string | undefined;\n      valid_to: string | undefined;\n    }>,\n  ) => boolean {\n    // Resolve the coordinate ONCE (via the shared resolveTemporalReadParams, so\n    // the in-memory getById/getByIds filter cannot drift from the SQL-side\n    // filter, and a non-canonical asOf is rejected here too). Returning a\n    // predicate lets getByIds pin one instant for the whole batch instead of\n    // recomputing nowIso() — and re-validating — per row.\n    const { temporalMode, asOf } = resolveTemporalReadParams(\n      options,\n      this.#graph.defaults.temporalMode,\n    );\n\n    return (row) => {\n      switch (temporalMode) {\n        case \"current\":\n        case \"asOf\": {\n          // resolveTemporalReadParams always resolves an instant for these modes.\n          if (row.deleted_at) return false;\n          if (asOf !== undefined && row.valid_from && asOf < row.valid_from)\n            return false;\n          if (asOf !== undefined && row.valid_to && asOf >= row.valid_to)\n            return false;\n          return true;\n        }\n        case \"includeEnded\": {\n          return !row.deleted_at;\n        }\n        case \"includeTombstones\": {\n          return true;\n        }\n      }\n    };\n  }\n\n  #createQueryForBackend(\n    backend: GraphBackend | TransactionBackend,\n    sealedCoordinate?: ReadCoordinate,\n  ): QueryBuilder<G> {\n    return createQueryBuilder<G>(this.graphId, this.#registry, {\n      // TransactionBackend omits transaction/close, but query execution only needs\n      // the read-path/query capabilities shared with GraphBackend.\n      backend: backend as GraphBackend,\n      dialect: backend.dialect,\n      defaultTraversalExpansion: this.#defaultTraversalExpansion,\n      ...(this.#schema !== undefined && { schema: this.#schema }),\n      ...(sealedCoordinate !== undefined && { sealedCoordinate }),\n    });\n  }\n}\n\n// ============================================================\n// Factory Function\n// ============================================================\n\n/**\n * Creates a new Store instance.\n *\n * @param graph - The graph definition\n * @param backend - The database backend\n * @param options - Optional store configuration including observability hooks\n * @returns A new Store instance\n *\n * @example\n * ```typescript\n * // Basic usage\n * const store = createStore(graph, backend);\n *\n * // With observability hooks\n * const store = createStore(graph, backend, {\n *   hooks: {\n *     onOperationStart: (ctx) => {\n *       console.log(`Starting ${ctx.operation} on ${ctx.entity}:${ctx.kind}`);\n *     },\n *     onOperationEnd: (ctx, result) => {\n *       console.log(`Completed in ${result.durationMs}ms`);\n *     },\n *     onError: (ctx, error) => {\n *       console.error(`Operation ${ctx.operationId} failed:`, error);\n *     },\n *   },\n * });\n * ```\n */\nexport function createStore<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n  options?: StoreOptions,\n): Store<G> {\n  return new Store(graph, backend, options);\n}\n\nfunction isKnownEdgeKind(graph: GraphDef, name: string): boolean {\n  return Object.hasOwn(graph.edges, name);\n}\n\nfunction setsEqual(a: ReadonlySet<string>, b: ReadonlySet<string>): boolean {\n  if (a.size !== b.size) return false;\n  for (const value of a) if (!b.has(value)) return false;\n  return true;\n}\n\nfunction schemaMetadataFromRow(\n  row: SchemaVersionRow | undefined,\n): StoreSchemaMetadata {\n  if (row === undefined) return UNKNOWN_SCHEMA_METADATA;\n  return Object.freeze({\n    schemaVersion: row.version,\n    schemaHash: row.schema_hash,\n  });\n}\n\nfunction schemaMetadataForResult(\n  activeRow: SchemaVersionRow | undefined,\n  result: SchemaValidationResult,\n): StoreSchemaMetadata {\n  if (result.status === \"initialized\" || result.status === \"migrated\") {\n    return schemaMetadataFromRow(result.committedRow);\n  }\n  return schemaMetadataFromRow(activeRow);\n}\n\n/**\n * Prefer the #129 contribution path; fall back to the pre-#129\n * `ensureFulltextTable` for backends that predate it. Idempotent and\n * cheap on a warm re-call (per-instance cache + recorded-signature\n * short-circuit).\n */\nasync function materializeRuntimeContributions(\n  backend: GraphBackend,\n  graphId: string,\n): Promise<void> {\n  if (backend.ensureRuntimeContributions) {\n    await backend.ensureRuntimeContributions(graphId);\n    return;\n  }\n  await backend.ensureFulltextTable?.(graphId);\n}\n\n// ============================================================\n// Async Factory with Schema Management\n// ============================================================\n\n// Re-export schema manager types\nexport type {\n  SchemaManagerOptions,\n  SchemaValidationResult,\n} from \"../schema/manager\";\n\n/**\n * Creates a store and ensures the schema is initialized/migrated.\n *\n * This is the recommended way to create a store in production.\n * It automatically:\n * - Creates base tables on a fresh database (if the backend supports bootstrapTables)\n * - Initializes the schema on first run (version 1)\n * - Auto-migrates safe changes (additive changes)\n * - Throws MigrationError for breaking changes\n *\n * @param graph - The graph definition\n * @param backend - The database backend\n * @param options - Store and schema options\n * @returns A tuple of [store, validationResult]\n *\n * @example\n * ```typescript\n * const [store, result] = await createStoreWithSchema(graph, backend);\n *\n * if (result.status === \"initialized\") {\n *   console.log(\"Schema initialized at version\", result.version);\n * } else if (result.status === \"migrated\") {\n *   console.log(`Migrated from v${result.fromVersion} to v${result.toVersion}`);\n * } else if (result.status === \"pending\") {\n *   console.log(`Safe changes pending at version ${result.version}`);\n * }\n * ```\n */\nexport async function createStoreWithSchema<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n  options?: StoreOptions & SchemaManagerOptions,\n): Promise<[Store<G>, SchemaValidationResult]> {\n  // Fold any persisted graph extension into the graph BEFORE\n  // constructing the Store. The prefetched row + parsed schema thread\n  // through to ensureSchema so each Store boot pays for one DB round\n  // trip and one Zod parse, not two. Additional extension kinds are\n  // reachable through the registry but invisible to the type system —\n  // see `mergeGraphExtension`.\n  const {\n    graph: merged,\n    activeRow,\n    storedSchema,\n  } = await loadAndMergeGraphExtensionDocument(backend, graph);\n\n  const result = await ensureSchemaImpl(backend, merged, {\n    ...options,\n    preloaded: { activeRow, storedSchema },\n  });\n\n  // #135/#143: this is the single durable-marker writer, and it MUST\n  // run after ensureSchemaImpl so the breaking-change gate is reached\n  // first — otherwise contribution DDL derived from the new code graph\n  // would hit a stale table shape and mask `MigrationError`.\n  await materializeRuntimeContributions(backend, merged.id);\n\n  const store = new Store(\n    merged,\n    backend,\n    options,\n    schemaMetadataForResult(activeRow, result),\n  );\n  return [store, result];\n}\n\n/**\n * Creates a Store after **verifying** that the database is at the same\n * schema version as the code graph — without running any DDL, bootstrap,\n * or marker writes. The runtime counterpart of `createStoreWithSchema`\n * for the deployment model in \"Database roles & least privilege\":\n *\n * - **`createStoreWithSchema(graph, backend)`** runs DDL (bootstrap,\n *   safe auto-migrations, durable contribution materialization). Run it\n *   once at startup under a privileged role that holds `CREATE` / DDL.\n * - **`createVerifiedStore(graph, backend)`** is the zero-DDL runtime\n *   attach with a verification gate. Throws `MigrationError` when the\n *   persisted schema is behind the code graph (any pending change, safe\n *   or breaking), `ConfigurationError` when no schema has been\n *   initialized, or `StoreNotInitializedError` when the schema is\n *   current but the runtime-contribution markers are missing/stale.\n *   The runtime can use a least-privilege, DML-only database role.\n * - **`createStore(graph, backend)`** is the same zero-DDL attach\n *   *without* the verification gate — fastest, but schema drift goes\n *   undetected until a hot-path operation trips.\n *\n * Folds any persisted graph-extension document into the supplied graph\n * before building the Store, just like `createStoreWithSchema`.\n *\n * @param graph - The graph definition\n * @param backend - The database backend\n * @param options - Optional store configuration\n * @returns A tuple of [store, validationResult] — `result.status` is\n *   always `\"unchanged\"` on success\n *\n * @example\n * ```typescript\n * // Runtime — least-privilege, DML-only role. Zero DDL.\n * const [store, result] = await createVerifiedStore(graph, backend);\n * // result.status === \"unchanged\" — the privileged migrator is current.\n * ```\n *\n * @throws ConfigurationError if no schema has been initialized.\n * @throws MigrationError if the persisted schema is behind the code graph.\n * @throws StoreNotInitializedError if runtime-contribution markers are\n *   missing/stale/failed for this graph on this connection.\n */\nexport async function createVerifiedStore<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n  options?: StoreOptions,\n): Promise<[Store<G>, SchemaValidationResult]> {\n  const {\n    graph: merged,\n    activeRow,\n    result,\n  } = await loadAndVerifyGraph(backend, graph);\n  const store = new Store(\n    merged,\n    backend,\n    options,\n    schemaMetadataFromRow(activeRow),\n  );\n  return [store, result];\n}\n"]}