@nicia-ai/typegraph 0.38.0 → 0.39.0

package/dist/chunk-CBK2IVI2.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/store/collection-surface.ts","../src/store/recorded-coordinate-guard.ts","../src/store/collections/temporal-read-params.ts","../src/store/store-view.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/utils/identifier.ts","../src/query/ast.ts","../src/query/compiler/typed-json-extract.ts","../src/query/compiler/utils.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/passes/temporal.ts","../src/query/compiler/passes/vector.ts","../src/query/compiler/plan/lowering.ts","../src/query/compiler/recorded-current-index-guard.ts","../src/query/compiler/recursive.ts","../src/query/execution/value-decoder.ts","../src/store/recursive-cte.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/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/read-instant-template.ts","../src/query/builder/prepared-query.ts","../src/query/builder/validation.ts","../src/query/builder/ast-builder.ts","../src/query/builder/internal-context.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-rebuild.ts","../src/store/search.ts","../src/store/search-facade.ts","../src/backend/branded.ts","../src/graph-extension/classify.ts","../src/graph-extension/remove.ts","../src/store/algorithms/context.ts","../src/store/algorithms/degree.ts","../src/store/algorithms/iterative-graph-operation.ts","../src/store/algorithms/label-propagation.ts","../src/store/algorithms/page-rank.ts","../src/store/algorithms/breadth-first.ts","../src/store/algorithms/reachable.ts","../src/store/algorithms/shortest-path.ts","../src/store/algorithms/weakly-connected-components.ts","../src/store/algorithms/weighted-shortest-path.ts","../src/store/algorithms/index.ts","../src/store/collections/edge-collection.ts","../src/store/collections/coalesce.ts","../src/store/collections/node-collection.ts","../src/store/collection-factory.ts","../src/store/history-store-backend.ts","../src/store/introspect.ts","../src/store/materialize-shared.ts","../src/store/materialize-indexes.ts","../src/store/materialize-removals.ts","../src/store/operations/edge-operations.ts","../src/store/recorded-read-service.ts","../src/store/transaction-receipt.ts","../src/store/store.ts"],"names":["target","field","hasVariableLengthTraversal","compileKindFilter","compileRecursiveBranch","compileQuery","collectRequiredColumnsByAlias","compileSetOperation","having","nullToUndefined","jsonPointer","value","rawRows","outputName","aliasObject","NOT_COMPUTED","max","min","coordinate","entry","rank","chunk","createWorkingTable","initializeWorkingTable","runLabelPropagationRound","extractMemberships","applyNextLabels","rowToEdge","executeEdgeCreate","executeEdgeCreateNoReturnBatch","executeEdgeCreateBatch","executeEdgeUpdate","executeEdgeUpsertUpdate","executeEdgeDelete","executeEdgeHardDelete","results","rowToNode","executeNodeCreate","executeNodeCreateNoReturnBatch","executeNodeCreateBatch","executeNodeUpdate","executeNodeUpsertUpdate","executeNodeDelete","executeNodeHardDelete","result","rows","materializeOne","edge","count","options","sql","replacement"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkCO,IAAM,uBAAA,GAA0B;AAAA,EACrC,kBAAA;AAAA,EACA,sBAAA;AAAA,EACA;AACF,CAAA;AAGO,IAAM,gBAAA,GAAmB;AAAA,EAC9B,QAAA;AAAA,EACA,kBAAA;AAAA,EACA,QAAA;AAAA,EACA,QAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,sBAAA;AAAA,EACA,YAAA;AAAA,EACA,gBAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,yBAAA;AAAA,EACA;AACF,CAAA;AAkBO,IAAM,qBAAA,GAAwB;AAAA,EACnC,eAAA;AAAA,EACA,aAAA;AAAA,EACA;AACF,CAAA;AAOO,IAAM,gBAAA,GAAmB;AAAA,EAC9B,QAAA;AAAA,EACA,QAAA;AAAA,EACA,QAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,gBAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,wBAAA;AAAA,EACA;AACF,CAAA;;;ACpFA,SAAS,mBACP,OAAA,EACsC;AACtC,EAAA,OACE,OAAO,YAAY,QAAA,IACnB,OAAA,KAAY,QACZ,MAAA,CAAO,MAAA,CAAO,SAAS,cAAc,CAAA;AAEzC;AAEA,SAAS,gBAAgB,OAAA,EAA2B;AAClD,EAAA,OAAO,kBAAA,CAAmB,OAAO,CAAA,GAAI,OAAA,CAAQ,YAAA,GAAe,MAAA;AAC9D;AAEO,SAAS,0BAAA,CACd,SACA,KAAA,EACM;AACN,EAAA,MAAM,YAAA,GAAe,gBAAgB,OAAO,CAAA;AAC5C,EAAA,IAAI,iBAAiB,MAAA,EAAW;AAEhC,EAAA,MAAM,IAAI,kBAAA;AAAA,IACR,KAAA,CAAM,OAAA;AAAA,IACN;AAAA,MACE,GAAG,KAAA,CAAM,OAAA;AAAA,MACT,MAAM,KAAA,CAAM,IAAA;AAAA,MACZ;AAAA,KACF;AAAA,IACA,MAAM,UAAA,KAAe,MAAA,GACnB,SACA,EAAE,UAAA,EAAY,MAAM,UAAA;AAAW,GACnC;AACF;;;ACzBA,SAAS,gBAAgB,UAAA,EAA6C;AACpE,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;AAEO,SAAS,oBAAoB,UAAA,EAA0C;AAC5E,EAAA,0BAAA;AAAA,IACE,UAAA,CAAW,aAAa,MAAA,GACtB,MAAA,GACA,EAAE,YAAA,EAAc,UAAA,CAAW,SAAS,IAAA,EAAK;AAAA,IAC3C;AAAA,MACE,IAAA,EAAM,sCAAA;AAAA,MACN,OAAA,EACE;AAAA;AACJ,GACF;AACA,EAAA,OAAO,gBAAgB,UAAU,CAAA;AACnC;AAWO,SAAS,eAAe,UAAA,EAAgD;AAC7E,EAAA,MAAM,KAAA,GAAQ,gBAAgB,UAAU,CAAA;AACxC,EAAA,OAAO,UAAA,CAAW,QAAA,KAAa,MAAA,GAC3B,KAAA,GACA,EAAE,GAAG,KAAA,EAAO,YAAA,EAAc,UAAA,CAAW,QAAA,CAAS,IAAA,EAAK;AACzD;AA0BO,SAAS,yBAAA,CACd,SACA,mBAAA,EACoB;AACpB,EAAA,0BAAA,CAA2B,OAAA,EAAS;AAAA,IAClC,IAAA,EAAM,sCAAA;AAAA,IACN,OAAA,EAAS,gEAAA;AAAA,IACT,UAAA,EACE;AAAA,GACH,CAAA;AAED,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;AAAA,MACL,GAAG,IAAA;AAAA,MACH,IAAA,EAAM,QAAQ,MAAA;AAAO,KACvB;AAAA,EACF;AACA,EAAA,OAAO,IAAA;AACT;;;AC8HA,SAAS,iBACP,UAAA,EAC8B;AAC9B,EAAA,OAAO,OAAA,IAAW,UAAA;AACpB;AAcA,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;AAWA,SAAS,sBAAA,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,oMAAA,CAAA;AAAA,MAGxF;AAAA,QACE,IAAA,EAAM,8BAAA;AAAA,QACN,MAAA;AAAA,QACA,MAAA;AAAA,QACA,GAAG,kBAAkB,UAAU;AAAA;AACjC,KACF;AAAA,EACF,CAAA;AACF;AAEA,SAAS,gCAAA,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,2CAAA,EAA8C,kBAAA,CAAmB,UAAU,CAAC,CAAA,sJAAA,CAAA;AAAA,MAGtF;AAAA,QACE,IAAA,EAAM,iCAAA;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;AAQA,IAAM,gBAAA,GAAwC,IAAI,GAAA,CAAI,qBAAqB,CAAA;AAW3E,SAAS,mBAAA,CACP,KAAA,EACA,IAAA,EACA,eAAA,EACG;AACH,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,OAAO,gBAAgB,QAAQ,CAAA;AAAA,MACjC;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;AAQA,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,OAAO,mBAAA,CAAoB,KAAA,EAAO,IAAA,EAAM,CAAC,QAAA,KAAa;AACpD,IAAA,IAAI,kBAAA,CAAmB,GAAA,CAAI,QAAQ,CAAA,EAAG;AACpC,MAAA,OAAO,YACF,IAAA,CAAiC,QAAQ,IAC1C,wBAAA,CAAyB,MAAA,EAAQ,UAAU,UAAU,CAAA;AAAA,IAC3D;AACA,IAAA,IAAI,gBAAA,CAAiB,GAAA,CAAI,QAAQ,CAAA,EAAG;AAClC,MAAA,OAAO,sBAAA,CAAuB,MAAA,EAAQ,QAAA,EAAU,UAAU,CAAA;AAAA,IAC5D;AACA,IAAA,OAAO,qBAAA,CAAsB,MAAA,EAAQ,QAAA,EAAU,UAAU,CAAA;AAAA,EAC3D,CAAC,CAAA;AACH;AAMA,SAAS,uBAAA,CACP,KAAA,EACA,IAAA,EACA,UAAA,EACA,MAAA,EACG;AACH,EAAA,OAAO,mBAAA,CAAoB,KAAA,EAAO,IAAA,EAAM,CAAC,QAAA,KAAa;AACpD,IAAA,IAAI,gBAAA,CAAiB,GAAA,CAAI,QAAQ,CAAA,EAAG;AAClC,MAAA,OAAO,sBAAA,CAAuB,MAAA,EAAQ,QAAA,EAAU,UAAU,CAAA;AAAA,IAC5D;AACA,IAAA,OAAO,gCAAA,CAAiC,MAAA,EAAQ,QAAA,EAAU,UAAU,CAAA;AAAA,EACtE,CAAC,CAAA;AACH;AAEA,SAAS,oBAAA,CACP,MACA,UAAA,EACmC;AACnC,EAAA,MAAM,QAAA,GAAW,oBAAoB,UAAU,CAAA;AAG/C,EAAA,MAAM,KAAA,GAQC;AAAA,IACL,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,IAC9C,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,oBAAoB,UAAU,CAAA;AAC/C,EAAA,MAAM,KAAA,GAKC;AAAA,IACL,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,IAC9C,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;AAWA,SAAS,iBAAA,CACP,IAAA,EACA,UAAA,EACA,MAAA,EACA,IAAA,EACmB;AACnB,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAe;AACjC,EAAA,OAAO,IAAI,KAAA;AAAA,IACT,EAAC;AAAA,IACD;AAAA,MACE,GAAA,CAAI,MAAA,EAAQ,IAAA,EAAM,QAAA,EAAU;AAC1B,QAAA,IAAI,OAAO,SAAS,QAAA,EAAU;AAC9B,QAAA,IAAI,CAAC,MAAA,CAAO,IAAI,CAAA,EAAG;AACjB,UAAA,IAAI,aAAA,CAAc,GAAA,CAAI,IAAI,CAAA,EAAG;AAC7B,UAAA,IAAI,MAAA,CAAO,MAAA,CAAO,MAAA,CAAO,SAAA,EAAW,IAAI,CAAA,EAAG;AACzC,YAAA,MAAM,cAAA,GAA0B,OAAA,CAAQ,GAAA,CAAI,MAAA,EAAQ,MAAM,QAAQ,CAAA;AAClE,YAAA,OAAO,cAAA;AAAA,UACT;AAAA,QACF;AACA,QAAA,MAAM,MAAA,GAAS,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA;AAC7B,QAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AACjC,QAAA,MAAM,OAAA,GAAU,IAAA;AAAA,UACd,IAAA;AAAA,UACA,cAAA,CAAgB,IAAA,CAA2B,IAAI,CAAC,CAAA;AAAA,UAChD;AAAA,SACF;AACA,QAAA,KAAA,CAAM,GAAA,CAAI,MAAM,OAAO,CAAA;AACvB,QAAA,OAAO,OAAA;AAAA,MACT;AAAA;AACF,GACF;AACF;AAEA,SAAS,wBAAA,CACP,KAAA,EACA,UAAA,EACA,IAAA,EAKmB;AACnB,EAAA,OAAO,iBAAA;AAAA,IACL,KAAA,CAAM,KAAA;AAAA,IACN,UAAA;AAAA,IACA,CAAC,IAAA,KAAS,MAAA,CAAO,OAAO,KAAA,CAAM,KAAA,CAAM,OAAO,IAAI,CAAA;AAAA,IAC/C;AAAA,GACF;AACF;AAEA,SAAS,wBAAA,CACP,KAAA,EACA,UAAA,EACA,IAAA,EAKmB;AACnB,EAAA,OAAO,iBAAA;AAAA,IACL,KAAA,CAAM,KAAA;AAAA,IACN,UAAA;AAAA,IACA,CAAC,IAAA,KAAS,MAAA,CAAO,OAAO,KAAA,CAAM,KAAA,CAAM,OAAO,IAAI,CAAA;AAAA,IAC/C;AAAA,GACF;AACF;AAEA,SAAS,sBAAA,CACP,KAAA,EACA,IAAA,EACA,IAAA,EACA,UAAA,EAC2C;AAC3C,EAAA,MAAM,KAAA,GAKC;AAAA,IACL,OAAA,EAAS,CAAC,EAAA,KACR,YAAA,CAAa,KAAK,CAAA,CAAE,mBAAA,CAAoB,IAAA,EAAM,EAAA,EAAI,UAAU,CAAA;AAAA,IAC9D,QAAA,EAAU,CAAC,GAAA,KACT,YAAA,CAAa,KAAK,CAAA,CAAE,oBAAA,CAAqB,IAAA,EAAM,GAAA,EAAK,UAAU,CAAA;AAAA,IAChE,IAAA,EAAM,CAAC,OAAA,KACL,YAAA,CAAa,KAAK,CAAA,CAAE,gBAAA,CAAiB,IAAA,EAAM,UAAA,EAAY,OAAO;AAAA,GAClE;AACA,EAAA,OAAO,uBAAA,CAAwB,KAAA,EAAO,IAAA,EAAM,UAAA,EAAY,MAAM,CAAA;AAChE;AAEA,SAAS,sBAAA,CACP,KAAA,EACA,IAAA,EACA,IAAA,EACA,UAAA,EACkE;AAClE,EAAA,MAAM,KAAA,GAaC;AAAA,IACL,OAAA,EAAS,CAAC,EAAA,KACR,YAAA,CAAa,KAAK,CAAA,CAAE,mBAAA,CAAoB,IAAA,EAAM,EAAA,EAAI,UAAU,CAAA;AAAA,IAC9D,QAAA,EAAU,CAAC,GAAA,KACT,YAAA,CAAa,KAAK,CAAA,CAAE,oBAAA,CAAqB,IAAA,EAAM,GAAA,EAAK,UAAU,CAAA;AAAA,IAChE,IAAA,EAAM,CAAC,OAAA,KACL,YAAA,CAAa,KAAK,CAAA,CAAE,gBAAA,CAAiB,IAAA,EAAM,UAAA,EAAY,OAAO;AAAA,GAClE;AACA,EAAA,OAAO,uBAAA,CAAwB,KAAA,EAAO,IAAA,EAAM,UAAA,EAAY,MAAM,CAAA;AAChE;AAcA,IAAM,wBAAA,GAA2B;AAAA,EAC/B,UAAA;AAAA,EACA,QAAA;AAAA,EACA;AACF,CAAA;AACA,IAAM,sBAA2C,IAAI,GAAA;AAAA,EACnD;AACF,CAAA;AAIA,SAAS,YACP,OAAA,EACgB;AAChB,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,OAAO,QAAQ,MAAM,CAAA;AAAA,IACvB,CAAA;AAAA,IACA,GAAA,CAAI,QAAQ,MAAA,EAAQ;AAClB,MAAA,IAAI,OAAO,MAAA,KAAW,QAAA,SAAiB,OAAA,CAAQ,GAAA,CAAI,QAAQ,MAAM,CAAA;AACjE,MAAA,IAAI,aAAA,CAAc,GAAA,CAAI,MAAM,CAAA,EAAG,OAAO,KAAA;AACtC,MAAA,IAAI,OAAO,MAAA,CAAO,MAAA,CAAO,SAAA,EAAW,MAAM,GAAG,OAAO,IAAA;AACpD,MAAA,OAAO,OAAA,CAAQ,MAAM,CAAA,KAAM,MAAA;AAAA,IAC7B;AAAA,GACD,CAAA;AACH;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,GACP,MAAA;AACJ,EAAA,OAAO,WAAA,CAAe,CAAC,MAAA,KAAW;AAChC,IAAA,IAAI,IAAA,KAAS,MAAA,IAAa,mBAAA,CAAoB,GAAA,CAAI,MAAM,CAAA,EAAG;AACzD,MAAA,MAAM,UAAA,GAAa,KAAK,MAAM,CAAA;AAC9B,MAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,QAAA,OAAO,IAAI,IAAA,KACT,OAAA,CAAQ,KAAA,CAAM,UAAA,EAAY,MAAM,IAAI,CAAA;AAAA,MACxC;AAAA,IACF;AACA,IAAA,OAAO,MAAM,OAAA,CAAQ,MAAA,CAAO,cAAc,MAAA,EAAQ,UAAA,EAAY,SAAS,CAAC,CAAA;AAAA,EAC1E,CAAC,CAAA;AACH;AAQA,SAAS,qBAAA,CACP,QACA,UAAA,EACoB;AACpB,EAAA,OAAO,IAAI,kBAAA;AAAA,IACT,CAAA,aAAA,EAAgB,MAAM,CAAA,0CAAA,EAA6C,kBAAA,CAAmB,UAAU,CAAC,CAAA,iIAAA,CAAA;AAAA,IAGjG;AAAA,MACE,IAAA,EAAM,wCAAA;AAAA,MACN,MAAA;AAAA,MACA,GAAG,kBAAkB,UAAU;AAAA;AACjC,GACF;AACF;AAUA,SAAS,eACP,UAAA,EACgB;AAChB,EAAA,OAAO,WAAA;AAAA,IACL,CAAC,WAAW,MAAM,OAAA,CAAQ,OAAO,qBAAA,CAAsB,MAAA,EAAQ,UAAU,CAAC;AAAA,GAC5E;AACF;AAcA,IAAe,uBAAf,MAAwD;AAAA,EACnC,KAAA;AAAA,EACA,UAAA;AAAA,EACnB,gBAAA;AAAA,EACA,mBAAA;AAAA,EAEA,WAAA,CAAY,OAAiB,UAAA,EAA4B;AACvD,IAAA,IAAA,CAAK,KAAA,GAAQ,KAAA;AACb,IAAA,IAAA,CAAK,UAAA,GAAa,UAAA;AAAA,EACpB;AAAA;AAAA,EAGA,IAAI,IAAA,GAAqB;AACvB,IAAA,OAAO,IAAA,CAAK,WAAW,KAAA,CAAM,IAAA;AAAA,EAC/B;AAAA;AAAA,EAGA,IAAI,IAAA,GAA2B;AAC7B,IAAA,OAAO,IAAA,CAAK,WAAW,KAAA,CAAM,IAAA;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,KAAA,GAA0C;AACxC,IAAA,OAAO,aAAa,IAAA,CAAK,KAAK,CAAA,CAAE,WAAA,CAAY,KAAK,UAAU,CAAA;AAAA,EAC7D;AAAA,EAEU,kBAAA,GAAiD;AACzD,IAAA,IAAA,CAAK,mBAAA,KAAwB,YAAA;AAAA,MAC3B,IAAA,CAAK;AAAA,KACP,CAAE,sBAAA,CAAuB,IAAA,CAAK,UAAU,CAAA;AACxC,IAAA,OAAO,IAAA,CAAK,mBAAA;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,UAAA,GAA0C;AAC5C,IAAA,IAAA,CAAK,gBAAA,KAAqB,OAAO,MAAA,CAAO;AAAA,MACtC,YAAA,EAAc,CAAC,IAAA,EAAM,EAAA,EAAI,YAAY,IAAA,CAAK,YAAA,CAAa,IAAA,EAAM,EAAA,EAAI,OAAO,CAAA;AAAA,MACxE,oBAAA,EAAsB,CAAC,IAAA,EAAM,EAAA,EAAI,YAC/B,IAAA,CAAK,oBAAA,CAAqB,IAAA,EAAM,EAAA,EAAI,OAAO,CAAA;AAAA,MAC7C,WAAW,CAAC,IAAA,EAAM,YAAY,IAAA,CAAK,SAAA,CAAU,MAAM,OAAO,CAAA;AAAA,MAC1D,QAAA,EAAU,CAAC,IAAA,EAAM,EAAA,EAAI,YAAY,IAAA,CAAK,QAAA,CAAS,IAAA,EAAM,EAAA,EAAI,OAAO,CAAA;AAAA,MAChE,WAAW,CAAC,IAAA,EAAM,YAAY,IAAA,CAAK,SAAA,CAAU,MAAM,OAAO,CAAA;AAAA,MAC1D,QAAQ,CAAC,IAAA,EAAM,YAAY,IAAA,CAAK,MAAA,CAAO,MAAM,OAAO,CAAA;AAAA,MACpD,gBAAA,EAAkB,CAAC,OAAA,KAAY,IAAA,CAAK,iBAAiB,OAAO,CAAA;AAAA,MAC5D,yBAAA,EAA2B,CAAC,OAAA,KAC1B,IAAA,CAAK,0BAA0B,OAAO,CAAA;AAAA,MACxC,QAAA,EAAU,CAAC,OAAA,KAAY,IAAA,CAAK,SAAS,OAAO,CAAA;AAAA,MAC5C,oBAAA,EAAsB,CAAC,OAAA,KAAY,IAAA,CAAK,qBAAqB,OAAO;AAAA,KACrE,CAAA;AACD,IAAA,OAAO,IAAA,CAAK,gBAAA;AAAA,EACd;AAAA;AAAA,EAGA,QAAA,CAKE,QACA,OAAA,EACuC;AACvC,IAAA,MAAM,eAAA,GAAkB;AAAA,MACtB,GAAG,OAAA;AAAA,MACH,GAAG,cAAA,CAAe,IAAA,CAAK,UAAU;AAAA,KACnC;AACA,IAAA,OAAO,YAAA,CAAa,IAAA,CAAK,KAAK,CAAA,CAAE,oBAAA;AAAA,MAC9B,MAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAAA;AAAA,EAGA,YAAA,CACE,IAAA,EACA,EAAA,EACA,OAAA,EACyC;AACzC,IAAA,OAAO,IAAA,CAAK,kBAAA,EAAmB,CAAE,YAAA,CAAa,MAAM,EAAA,EAAI;AAAA,MACtD,GAAG,OAAA;AAAA,MACH,GAAG,cAAA,CAAe,IAAA,CAAK,UAAU;AAAA,KAClC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,oBAAA,CACE,IAAA,EACA,EAAA,EACA,OAAA,EACiD;AACjD,IAAA,OAAO,IAAA,CAAK,kBAAA,EAAmB,CAAE,oBAAA,CAAqB,MAAM,EAAA,EAAI;AAAA,MAC9D,GAAG,OAAA;AAAA,MACH,GAAG,cAAA,CAAe,IAAA,CAAK,UAAU;AAAA,KAClC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,SAAA,CACE,MACA,OAAA,EACmC;AACnC,IAAA,OAAO,IAAA,CAAK,kBAAA,EAAmB,CAAE,SAAA,CAAU,IAAA,EAAM;AAAA,MAC/C,GAAG,OAAA;AAAA,MACH,GAAG,cAAA,CAAe,IAAA,CAAK,UAAU;AAAA,KAClC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,QAAA,CACE,IAAA,EACA,EAAA,EACA,OAAA,EACkB;AAClB,IAAA,OAAO,IAAA,CAAK,kBAAA,EAAmB,CAAE,QAAA,CAAS,MAAM,EAAA,EAAI;AAAA,MAClD,GAAG,OAAA;AAAA,MACH,GAAG,cAAA,CAAe,IAAA,CAAK,UAAU;AAAA,KAClC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,SAAA,CACE,MACA,OAAA,EACmC;AACnC,IAAA,OAAO,IAAA,CAAK,kBAAA,EAAmB,CAAE,SAAA,CAAU,IAAA,EAAM;AAAA,MAC/C,GAAG,OAAA;AAAA,MACH,GAAG,cAAA,CAAe,IAAA,CAAK,UAAU;AAAA,KAClC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,MAAA,CACE,MACA,OAAA,EACiB;AACjB,IAAA,OAAO,IAAA,CAAK,kBAAA,EAAmB,CAAE,MAAA,CAAO,IAAA,EAAM;AAAA,MAC5C,GAAG,OAAA;AAAA,MACH,GAAG,cAAA,CAAe,IAAA,CAAK,UAAU;AAAA,KAClC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,iBACE,OAAA,EACgD;AAChD,IAAA,OAAO,IAAA,CAAK,kBAAA,EAAmB,CAAE,gBAAA,CAAiB;AAAA,MAChD,GAAG,OAAA;AAAA,MACH,GAAG,cAAA,CAAe,IAAA,CAAK,UAAU;AAAA,KAClC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,0BACE,OAAA,EACwD;AACxD,IAAA,OAAO,IAAA,CAAK,kBAAA,EAAmB,CAAE,yBAAA,CAA0B;AAAA,MACzD,GAAG,OAAA;AAAA,MACH,GAAG,cAAA,CAAe,IAAA,CAAK,UAAU;AAAA,KAClC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,SACE,OAAA,EACmC;AACnC,IAAA,OAAO,IAAA,CAAK,kBAAA,EAAmB,CAAE,QAAA,CAAS;AAAA,MACxC,GAAG,OAAA;AAAA,MACH,GAAG,cAAA,CAAe,IAAA,CAAK,UAAU;AAAA,KAClC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,qBACE,OAAA,EACmC;AACnC,IAAA,OAAO,IAAA,CAAK,kBAAA,EAAmB,CAAE,oBAAA,CAAqB;AAAA,MACpD,GAAG,OAAA;AAAA,MACH,GAAG,cAAA,CAAe,IAAA,CAAK,UAAU;AAAA,KAClC,CAAA;AAAA,EACH;AACF,CAAA;AAmBO,IAAM,SAAA,GAAN,cAA4C,oBAAA,CAAwB;AAAA,EACzE,MAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EAEA,WAAA,CACE,OACA,UAAA,EACA;AACA,IAAA,KAAA;AAAA,MACE,KAAA;AAAA,MACA,gBAAA,CAAiB,UAAU,CAAA,GAAI,UAAA,GAC7B,qBAAA;AAAA,QACE,UAAA,CAAW,IAAA;AAAA,QACX,UAAA,CAAW,IAAA;AAAA,QACX;AAAA;AACF,KAEJ;AAAA,EACF;AAAA;AAAA,EAGA,aAAa,YAAA,EAAqD;AAChE,IAAA,OAAO,IAAI,iBAAA;AAAA,MACT,IAAA,CAAK,KAAA;AAAA,MACL,sBAAA,CAAuB,IAAA,CAAK,UAAA,EAAY,YAAY;AAAA,KACtD;AAAA,EACF;AAAA;AAAA,EAGA,IAAI,KAAA,GAAqC;AACvC,IAAA,IAAA,CAAK,MAAA,KAAW,wBAAA;AAAA,MACd,IAAA,CAAK,KAAA;AAAA,MACL,IAAA,CAAK,UAAA;AAAA,MACL,CAAC,KAAA,EAAO,IAAA,EAAwC,UAAA,KAC9C,oBAAA,CAAqB,MAAM,UAAU;AAAA,KACzC;AACA,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,KAAA,GAAqC;AACvC,IAAA,IAAA,CAAK,MAAA,KAAW,wBAAA;AAAA,MACd,IAAA,CAAK,KAAA;AAAA,MACL,IAAA,CAAK,UAAA;AAAA,MACL,CACE,KAAA,EACA,IAAA,EACA,UAAA,KACG,oBAAA,CAAqB,MAAM,UAAU;AAAA,KAC5C;AACA,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,IAAI,MAAA,GAAyB;AAC3B,IAAA,IAAA,CAAK,OAAA,KAAY,YAAA,CAAgB,IAAA,CAAK,KAAA,EAAO,KAAK,UAAU,CAAA;AAC5D,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AACF;AASO,IAAM,iBAAA,GAAN,cAEG,oBAAA,CAAwB;AAAA,EAChC,MAAA;AAAA,EACA,MAAA;AAAA,EAEA,WAAA,CAAY,OAAiB,UAAA,EAA4B;AACvD,IAAA,KAAA,CAAM,OAAO,UAAU,CAAA;AACvB,IAAA,IAAI,CAAC,MAAM,iBAAA,EAAmB;AAC5B,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,mDAAA;AAAA,QACA,EAAE,MAAM,gCAAA,EAAiC;AAAA,QACzC;AAAA,UACE,UAAA,EACE;AAAA;AACJ,OACF;AAAA,IACF;AACA,IAAA,IAAI,UAAA,CAAW,aAAa,MAAA,EAAW;AACrC,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,wDAAA;AAAA,QACA,EAAE,MAAM,wCAAA;AAAyC,OACnD;AAAA,IACF;AASA,IAAA,IAAI,cAAA;AACJ,IAAA,MAAA,CAAO,cAAA,CAAe,MAAM,QAAA,EAAU;AAAA,MACpC,UAAA,EAAY,KAAA;AAAA,MACZ,GAAA,GAAsB;AACpB,QAAA,cAAA,KAAmB,eAAkB,UAAU,CAAA;AAC/C,QAAA,OAAO,cAAA;AAAA,MACT;AAAA,KACD,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,IAAI,YAAA,GAAuB;AACzB,IAAA,MAAM,QAAA,GAAW,KAAK,UAAA,CAAW,QAAA;AACjC,IAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,wDAAA;AAAA,QACA,EAAE,MAAM,wCAAA;AAAyC,OACnD;AAAA,IACF;AACA,IAAA,OAAO,QAAA,CAAS,IAAA;AAAA,EAClB;AAAA;AAAA,EAGA,IAAI,KAAA,GAA6C;AAC/C,IAAA,IAAA,CAAK,MAAA,KAAW,wBAAA;AAAA,MACd,IAAA,CAAK,KAAA;AAAA,MACL,IAAA,CAAK,UAAA;AAAA,MACL,CAAC,MAAM,IAAA,EAAwC,UAAA,KAC7C,uBAAuB,IAAA,CAAK,KAAA,EAAO,IAAA,EAAM,IAAA,EAAM,UAAU;AAAA,KAC7D;AACA,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,KAAA,GAA6C;AAC/C,IAAA,IAAA,CAAK,MAAA,KAAW,wBAAA;AAAA,MACd,IAAA,CAAK,KAAA;AAAA,MACL,IAAA,CAAK,UAAA;AAAA,MACL,CACE,MACA,IAAA,EACA,UAAA,KACG,uBAAuB,IAAA,CAAK,KAAA,EAAO,IAAA,EAAM,IAAA,EAAM,UAAU;AAAA,KAChE;AACA,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AACF;;;ACnnCA,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;;;ACtOA,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,sBACd,KAAA,EACa;AACb,EAAA,qCAAA,CAAsC,KAAA,CAAM,aAAa,KAAK,CAAA;AAE9D,EAAA,MAAM,KAAA,GAAuB;AAAA,IAC3B,GAAA,CAAA,cAAA,CAAA;AAAA,IACA,KAAA,CAAM,YAAA;AAAA,IACN,GAAA,CAAA,OAAA,EAAa,MAAM,UAAU,CAAA,CAAA;AAAA,IAC7B,GAAA,CAAA,kBAAA,CAAA;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,OAAO,GAAA,CAAI,IAAA,CAAK,KAAA,EAAO,GAAA,CAAA,CAAA,CAAM,CAAA;AAC/B;;;ACtDA,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,EACa;AACb,EAAA,wCAAA;AAAA,IACE,KAAA,CAAM,WAAA;AAAA,IACN,KAAA,CAAM;AAAA,GACR;AAEA,EAAA,MAAM,QAAuB,EAAC;AAC9B,EAAA,IAAI,MAAM,IAAA,KAAS,MAAA,IAAa,KAAA,CAAM,IAAA,CAAK,SAAS,CAAA,EAAG;AACrD,IAAA,KAAA,CAAM,IAAA,CAAK,GAAA,CAAA,KAAA,EAAW,GAAA,CAAI,IAAA,CAAK,CAAC,GAAG,KAAA,CAAM,IAAI,CAAA,EAAG,GAAA,CAAA,EAAA,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,OAAO,GAAA,CAAI,IAAA,CAAK,KAAA,EAAO,GAAA,CAAA,CAAA,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,qBACd,KAAA,EACa;AACb,EAAA,oCAAA,CAAqC,KAAA,CAAM,aAAa,KAAK,CAAA;AAE7D,EAAA,MAAM,QAAuB,EAAC;AAC9B,EAAA,IAAI,KAAA,CAAM,IAAA,CAAK,MAAA,GAAS,CAAA,EAAG;AACzB,IAAA,KAAA,CAAM,IAAA,CAAK,GAAA,CAAA,KAAA,EAAW,GAAA,CAAI,IAAA,CAAK,CAAC,GAAG,KAAA,CAAM,IAAI,CAAA,EAAG,GAAA,CAAA,EAAA,CAAO,CAAC,CAAA,CAAE,CAAA;AAAA,EAC5D;AAEA,EAAA,KAAA,CAAM,KAAK,GAAA,CAAA,OAAA,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,OAAO,GAAA,CAAI,IAAA,CAAK,KAAA,EAAO,GAAA,CAAA,CAAA,CAAM,CAAA;AAC/B;;;AClEA,IAAM,YAAA,GAAe,IAAI,WAAA,EAAY;AAM9B,SAAS,eAAA,CAAgB,OAAe,QAAA,EAA0B;AACvE,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,OACE,GAAA,GAAM,CAAA,IACN,cAAA,CAAe,OAAA,CAAQ,GAAG,CAAC,CAAA,IAAK,GAAA,IAChC,cAAA,CAAe,OAAA,CAAQ,GAAG,CAAC,IAAI,GAAA,EAC/B;AACA,IAAA,GAAA,EAAA;AAAA,EACF;AAEA,EAAA,OAAO,IAAI,aAAY,CAAE,MAAA,CAAO,QAAQ,KAAA,CAAM,CAAA,EAAG,GAAG,CAAC,CAAA;AACvD;AAeO,SAAS,iBAAA,CAAkB,MAAc,SAAA,EAA2B;AACzE,EAAA,IAAI,YAAA,CAAa,MAAA,CAAO,IAAI,CAAA,CAAE,cAAc,wBAAA,EAA0B;AACpE,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,MAAM,IAAA,GAAO,YAAY,SAAS,CAAA;AAClC,EAAA,MAAM,SAAA,GAAY,eAAA;AAAA,IAChB,IAAA;AAAA,IACA,wBAAA,GAA2B,IAAI,IAAA,CAAK;AAAA,GACtC;AACA,EAAA,OAAO,CAAA,EAAG,SAAS,CAAA,CAAA,EAAI,IAAI,CAAA,CAAA;AAC7B;;;AC4QO,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;;;ACvbO,SAAS,wBACd,KAAA,EACa;AACb,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;AAYO,SAAS,+BAAA,CACdC,MAAAA,EACA,MAAA,EACA,OAAA,EACa;AACb,EAAA,OAAO,uBAAA,CAAwB;AAAA,IAC7B,MAAA;AAAA,IACA,OAAA;AAAA,IACA,OAAA,EAAS,WAAA,CAAY,CAACA,MAAAA,CAAM,KAAK,CAAC,CAAA;AAAA,IAClC,WAAWA,MAAAA,CAAM;AAAA,GAClB,CAAA;AACH;;;AC1DO,IAAM,YAAA,GAAe;AAAA,EAC1B,IAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,SAAA;AAAA,EACA,YAAA;AAAA,EACA,UAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA;AACF,CAAA;AAEO,IAAM,YAAA,GAAe;AAAA,EAC1B,IAAA;AAAA,EACA,MAAA;AAAA,EACA,SAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,YAAA;AAAA,EACA,UAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA;AACF,CAAA;AAGO,IAAM,sBAAA,uBAA6B,GAAA,EAAY;AAM/C,SAAS,gBAAgB,UAAA,EAAiC;AAC/D,EAAA,OAAO,GAAA,CAAI,WAAW,UAAU,CAAA;AAClC;AAcO,SAAS,mBAAA,CACd,eAAA,EACA,MAAA,EACA,qBAAA,EACS;AACT,EAAA,IAAI,qBAAA,EAAuB,GAAA,CAAI,MAAM,CAAA,EAAG,OAAO,IAAA;AAC/C,EAAA,IAAI,eAAA,KAAoB,QAAW,OAAO,IAAA;AAC1C,EAAA,OAAO,eAAA,CAAgB,IAAI,MAAM,CAAA;AACnC;AAMO,SAAS,iBAAA,CACd,sBAAA,EACA,KAAA,EACA,MAAA,EACM;AACN,EAAA,MAAM,QAAA,GAAW,sBAAA,CAAuB,GAAA,CAAI,KAAK,CAAA;AACjD,EAAA,IAAI,QAAA,EAAU;AACZ,IAAA,QAAA,CAAS,IAAI,MAAM,CAAA;AACnB,IAAA;AAAA,EACF;AACA,EAAA,sBAAA,CAAuB,IAAI,KAAA,kBAAO,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAA;AACrD;AAEO,SAAS,sBAAA,CACd,wBACAA,MAAAA,EACM;AACN,EAAA,MAAM,MAAA,GAASA,MAAAA,CAAM,IAAA,CAAK,CAAC,CAAA;AAC3B,EAAA,IAAI,WAAW,MAAA,EAAW;AAC1B,EAAA,iBAAA,CAAkB,sBAAA,EAAwBA,MAAAA,CAAM,KAAA,EAAO,MAAM,CAAA;AAC/D;AAEO,SAAS,gCAAgCA,MAAAA,EAAuB;AACrE,EAAA,IAAIA,MAAAA,KAAU,UAAU,OAAO,SAAA;AAC/B,EAAA,IAAIA,MAAAA,KAAU,QAAQ,OAAO,OAAA;AAC7B,EAAA,IAAIA,MAAAA,CAAM,UAAA,CAAW,OAAO,CAAA,EAAG;AAC7B,IAAA,OAAOA,MAAAA,CACJ,MAAM,CAAC,CAAA,CACP,WAAW,UAAA,EAAY,KAAK,EAC5B,WAAA,EAAY;AAAA,EACjB;AACA,EAAA,OAAOA,MAAAA;AACT;AAEO,SAAS,4BAAA,CACd,wBACAA,MAAAA,EACM;AACN,EAAA,IAAIA,OAAM,aAAA,EAAe;AACvB,IAAA,iBAAA;AAAA,MACE,sBAAA;AAAA,MACAA,MAAAA,CAAM,KAAA;AAAA,MACN,+BAAA,CAAgCA,OAAM,KAAK;AAAA,KAC7C;AACA,IAAA;AAAA,EACF;AACA,EAAA,iBAAA,CAAkB,sBAAA,EAAwBA,MAAAA,CAAM,KAAA,EAAO,OAAO,CAAA;AAChE;AAEA,SAAS,0BAA0BA,MAAAA,EAAqC;AACtE,EAAA,MAAM,OAAA,GAAU,gBAAgBA,MAAK,CAAA;AACrC,EAAA,IAAI,OAAA,KAAY,QAAW,OAAO,MAAA;AAElC,EAAA,MAAM,QAAA,GAAW,iBAAiB,OAAO,CAAA;AACzC,EAAA,OAAO,QAAA,CAAS,MAAA,KAAW,CAAA,GAAI,QAAA,CAAS,CAAC,CAAA,GAAI,MAAA;AAC/C;AAEO,SAAS,kCAAA,CACd,iBACAA,MAAAA,EAC4B;AAC5B,EAAA,IAAI,eAAA,KAAoB,MAAA,IAAa,eAAA,CAAgB,MAAA,KAAW,CAAA,EAAG;AACjE,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,cAAA,GAAiB,0BAA0BA,MAAK,CAAA;AACtD,EAAA,IAAI,cAAA,KAAmB,QAAW,OAAO,MAAA;AAEzC,EAAA,OAAO,eAAA,CAAgB,IAAA;AAAA,IACrB,CAAC,cAAA,KACC,CAAC,cAAA,CAAe,aAAA,IAChB,eAAe,KAAA,KAAUA,MAAAA,CAAM,KAAA,IAC/B,cAAA,CAAe,KAAA,KAAU;AAAA,GAC7B;AACF;AAMO,SAAS,aAAaA,MAAAA,EAA0B;AACrD,EAAA,OACEA,MAAAA,CAAM,IAAA,CAAK,MAAA,KAAW,CAAA,IACtBA,MAAAA,CAAM,KAAK,CAAC,CAAA,KAAM,IAAA,IAClBA,MAAAA,CAAM,WAAA,KAAgB,MAAA;AAE1B;AAEO,SAAS,gBACd,MAAA,EACyB;AACzB,EAAA,OAAO,QAAA,IAAY,MAAA,IAAU,MAAA,CAAO,MAAA,KAAW,WAAA;AACjD;;;AChHA,SAAS,sBAAA,CACP,YACA,MAAA,EACa;AACb,EAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,IAAA,OAAO,GAAA,CAAI,IAAI,MAAM,CAAA;AAAA,EACvB;AACA,EAAA,OAAO,GAAA,CAAA,EAAM,IAAI,GAAA,CAAI,UAAU,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,GAAA,CAAI,MAAM,CAAC,CAAA,CAAA;AACrD;AAEA,SAAS,aAAA,CAAc,OAAe,IAAA,EAA2B;AAC/D,EAAA,OAAO,MAAM,eAAA,CAAgB,KAAK,CAAC,CAAA,CAAA,EAAI,eAAA,CAAgB,IAAI,CAAC,CAAA,CAAA;AAC9D;AAEA,IAAM,4BAAA,GAA+B,wBAAA;AAkBrC,SAAS,4BAA4BA,MAAAA,EAA+B;AAClE,EAAA,MAAM,EAAE,KAAA,EAAO,KAAA,EAAO,SAAA,EAAU,GAAIA,MAAAA;AACpC,EAAA,MAAM,OAAA,GAAU,CAAA,KAAA,EAAQ,KAAA,CAAM,MAAM,CAAA,CAAA,EAAI,KAAK,CAAA,CAAA,EAAI,SAAA,CAAU,MAAM,CAAA,CAAA,EAAI,SAAS,CAAA,CAAA;AAC9E,EAAA,OAAO,kBAAkB,OAAA,EAAS,CAAA,EAAG,KAAK,CAAA,EAAA,EAAK,SAAS,CAAA,CAAE,CAAA;AAC5D;AAEA,SAAS,2BAA2B,SAAA,EAAgC;AAClE,EAAA,MAAM,QAAA,GAAW,CAAA,EAAG,gBAAgB,CAAA,EAAG,SAAS,CAAA,CAAA;AAChD,EAAA,OAAO,GAAA;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,EAC3B,GAAA,CAAI,GAAA,CAAI,4BAA4B,CAAC;AAAA,EAAA,CAAA;AAElD;AASA,SAAS,mCACP,KAAA,EACe;AACf,EAAA,MAAM,EAAE,KAAA,EAAO,OAAA,EAAS,eAAA,EAAiB,YAAW,GAAI,KAAA;AACxD,EAAA,MAAM,cACJ,eAAA,EAAiB,MAAA;AAAA,IACf,CAACA,MAAAA,KAAU,CAACA,MAAAA,CAAM,aAAA,IAAiBA,OAAM,KAAA,KAAU;AAAA,OAChD,EAAC;AACR,EAAA,IAAI,WAAA,CAAY,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAEtC,EAAA,MAAM,WAAA,GAAc,sBAAA,CAAuB,UAAA,EAAY,OAAO,CAAA;AAC9D,EAAA,OAAO,WAAA,CAAY,GAAA,CAAI,CAACA,MAAAA,KAAU;AAChC,IAAA,MAAM,SAAA,GAAY,+BAAA;AAAA,MAChBA,MAAAA;AAAA,MACA,WAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,OAAO,MAAM,SAAS,CAAA,IAAA,EAAO,gBAAgB,2BAAA,CAA4BA,MAAK,CAAC,CAAC,CAAA,CAAA;AAAA,EAClF,CAAC,CAAA;AACH;AAEA,SAAS,2BAAA,CACP,aACA,KAAA,EACe;AACf,EAAA,OAAO,CAAC,GAAG,WAAA,EAAa,GAAG,kCAAA,CAAmC,KAAK,CAAC,CAAA;AACtE;AAUA,SAAS,yBACP,KAAA,EACe;AACf,EAAA,MAAM,EAAE,KAAA,EAAO,OAAA,EAAS,eAAA,EAAiB,eAAA,EAAiB,YAAW,GACnE,KAAA;AACF,EAAA,MAAM,cAAc,YAAA,CAAa,MAAA;AAAA,IAC/B,CAAC,WACC,MAAA,KAAW,IAAA,IACX,WAAW,MAAA,IACX,mBAAA,CAAoB,iBAAiB,MAAM;AAAA,GAC/C,CAAE,GAAA;AAAA,IACA,CAAC,MAAA,KACC,GAAA,CAAA,EAAM,sBAAA,CAAuB,YAAY,MAAM,CAAC,CAAA,IAAA,EAAO,GAAA,CAAI,IAAI,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,MAAM,EAAE,CAAC,CAAA;AAAA,GACxF;AACA,EAAA,OAAO,4BAA4B,WAAA,EAAa;AAAA,IAC9C,KAAA;AAAA,IACA,OAAA;AAAA,IACA,eAAA;AAAA,IACA;AAAA,GACD,CAAA;AACH;AAUA,SAAS,yBACP,KAAA,EACe;AACf,EAAA,MAAM,EAAE,KAAA,EAAO,OAAA,EAAS,eAAA,EAAiB,eAAA,EAAiB,YAAW,GACnE,KAAA;AACF,EAAA,MAAM,cAAc,YAAA,CAAa,MAAA;AAAA,IAAO,CAAC,MAAA,KACvC,mBAAA,CAAoB,eAAA,EAAiB,MAAM;AAAA,GAC7C,CAAE,GAAA;AAAA,IACA,CAAC,MAAA,KACC,GAAA,CAAA,EAAM,sBAAA,CAAuB,YAAY,MAAM,CAAC,CAAA,IAAA,EAAO,GAAA,CAAI,IAAI,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,MAAM,EAAE,CAAC,CAAA;AAAA,GACxF;AACA,EAAA,OAAO,4BAA4B,WAAA,EAAa;AAAA,IAC9C,KAAA;AAAA,IACA,OAAA;AAAA,IACA,eAAA;AAAA,IACA;AAAA,GACD,CAAA;AACH;AAgBO,SAAS,sBACd,KAAA,EACa;AACb,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,0BACvB,GAAA,CAAA,iBAAA,CAAA,GACA,GAAA,CAAA,CAAA;AAEJ,EAAA,MAAM,aAAa,iBAAA,CAAkB,GAAA,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,IACnB,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,GAAY,QAChC,KAAA,CAAM,WAAA,CAAY,WAAW,MAAA,GAC7B,GAAA;AAAA,cAAA,EACU,KAAA,CAAM,YAAY,KAAK;AAAA,MAAA,CAAA,GAEjC,GAAA;AAAA,YAAA,EACQ,MAAM,WAAA,CAAY,KAAK,CAAA,QAAA,EAAW,KAAA,CAAM,YAAY,MAAM;AAAA,IAAA,CAAA;AAGtE,EAAA,OAAO,GAAA;AAAA,QAAA,EACC,GAAA,CAAI,GAAA,CAAI,KAAK,CAAC,OAAO,kBAAkB,CAAA;AAAA,aAAA,EAClC,GAAA,CAAI,IAAA;AAAA,IACX,wBAAA,CAAyB;AAAA,MACvB,KAAA;AAAA,MACA,SAAS,GAAA,CAAI,OAAA;AAAA,MACb,eAAA,EAAiB,wBAAA;AAAA,MACjB,iBAAiB,GAAA,CAAI,eAAA;AAAA,MACrB,UAAA,EAAY;AAAA,KACb,CAAA;AAAA,IACD,GAAA,CAAA,EAAA;AAAA,GACD;AAAA,WAAA,EACM,GAAA,CAAI,OAAO,UAAU;AAAA,YAAA,EACpB,IAAI,IAAA,CAAK,YAAA,EAAc,GAAA,CAAA,KAAA,CAAU,CAAC,GAAG,WAAW;AAAA;AAAA,EAAA,CAAA;AAG9D;AAeO,SAAS,0BACd,KAAA,EACa;AACb,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,cAAA,CAAe,GAAA,CAAI,UAAA,CAAW,cAAc,CAAC,CAAA;AAC/D,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,CAAkB,GAAA,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,IACvB,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,CAAC,GAAA,CAAA,IAAA,EAAU,IAAI,GAAA,CAAI,aAAa,CAAC,CAAA,EAAA,CAAI,CAAA,GACrC;AAAA,IACE,GAAA,CAAA,IAAA,EAAU,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,OAAA,EAAU,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,GAAA,CAAA;AAAA,IAC1F,GAAA,CAAA,IAAA,EAAU,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,SAAA,EAAY,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,KAAA;AAAA,GAC9F;AACJ,EAAA,MAAM,aAAA,GAAgB;AAAA,IACpB,GAAG,kBAAA;AAAA,IACH,GAAG,wBAAA,CAAyB;AAAA,MAC1B,KAAA,EAAO,SAAA;AAAA,MACP,SAAS,GAAA,CAAI,OAAA;AAAA,MACb,eAAA,EAAiB,mBAAA;AAAA,MACjB,iBAAiB,GAAA,CAAI,eAAA;AAAA,MACrB,UAAA,EAAY;AAAA,KACb,CAAA;AAAA,IACD,GAAG,wBAAA,CAAyB;AAAA,MAC1B,KAAA,EAAO,SAAA;AAAA,MACP,SAAS,GAAA,CAAI,OAAA;AAAA,MACb,eAAA,EAAiB,mBAAA;AAAA,MACjB,iBAAiB,GAAA,CAAI,eAAA;AAAA,MACrB,UAAA,EAAY;AAAA,KACb;AAAA,GACH;AACA,EAAA,MAAM,qBACJ,cAAA,GAAiB,GAAA,CAAA,aAAA,CAAA,GACf,IAAI,OAAA,CAAQ,YAAA,CAAa,0BAA0B,GAAA,CAAA,iBAAA,CAAA,GACnD,GAAA,CAAA,CAAA;AAEJ,EAAA,SAAS,uBACP,MAAA,EAQa;AACb,IAAA,MAAM,YAAA,GAAe;AAAA,MACnB,GAAG,gBAAA;AAAA,MACH,kBAAkB,GAAA,CAAI,GAAA,CAAI,QAAQ,CAAA,EAAG,OAAO,SAAS,CAAA;AAAA,MACrD,iBAAA;AAAA,QACE,GAAA,CAAI,GAAA,CAAI,CAAA,EAAA,EAAK,MAAA,CAAO,aAAa,CAAA,CAAE,CAAA;AAAA,QACnC;AAAA,OACF;AAAA,MACA,iBAAA,CAAkB,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,OAAO,GAAA;AAAA,aAAA,EACI,GAAA,CAAI,IAAA,CAAK,aAAA,EAAe,GAAA,CAAA,EAAA,CAAO,CAAC;AAAA,eAAA,EAC9B,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC;AAAA,WAAA,EAC1B,IAAI,MAAA,CAAO,UAAU,aAAa,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,QAAA,EAAW,IAAI,GAAA,CAAI,MAAA,CAAO,SAAS,CAAC;AAAA,gBAAA,EACjH,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC,IAAI,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,UAAA,EAAa,GAAA,CAAI,GAAA,CAAI,MAAA,CAAO,aAAa,CAAC;AAAA,WAAA,EAC/F,GAAA,CAAI,OAAO,UAAU,CAAA;AAAA,qBAAA,EACX,GAAA,CAAI,GAAA,CAAI,MAAA,CAAO,WAAW,CAAC;AAAA,uBAAA,EACzB,GAAA,CAAI,GAAA,CAAI,MAAA,CAAO,eAAe,CAAC;AAAA,YAAA,EAC1C,GAAA,CAAI,IAAA,CAAK,YAAA,EAAc,GAAA,CAAA,KAAA,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,OAAO,GAAA;AAAA,YAAA,EACC,GAAA,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,OAAO,GAAA;AAAA,UAAA,EACC,GAAA,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,GACxB,GAAA,CAAA,6BAAA,EAAmC,iBAAA;AAAA,IACjC,GAAA,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,OAAO,GAAA;AAAA,UAAA,EACC,GAAA,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,OAAO,GAAA;AAAA,QAAA,EACC,GAAA,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,EACa;AACb,EAAA,MAAM,EAAE,KAAA,EAAAA,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,OAAO,qBAAqB,MAAM,CAAA,CAAA,CAAA;AAAA,MACpC;AACA,MAAA,OAAO,GAAA,CAAA,EAAM,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,CACPA,QAIA,OAAA,EACa;AACb,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,EACa;AACb,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,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,OAAO,GAAA,CAAI,IAAI,GAAG,CAAA;AAAA,EACpB;AAEA,EAAA,MAAM,eAAA,GAAkB,MAAA,CAAO,GAAA,CAAI,CAACA,MAAAA,KAAU;AAC5C,IAAA,MAAM,MAAA,GAAS,sBAAA,CAAuBA,MAAAA,EAAO,OAAO,CAAA;AACpD,IAAA,OAAO,MAAM,MAAM,CAAA,IAAA,EAAO,eAAA,CAAgBA,MAAAA,CAAM,UAAU,CAAC,CAAA,CAAA;AAAA,EAC7D,CAAC,CAAA;AACD,EAAA,OAAO,GAAA,CAAI,IAAA,CAAK,eAAA,EAAiB,GAAA,CAAA,EAAA,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,GAAA,EACA,0BAAA,EACa;AACb,EAAA,MAAM,UAAA,GAAa,mBAAmB,GAAG,CAAA;AAEzC,EAAA,MAAM,OAAA,GAAU,MAAA,CAAO,GAAA,CAAI,CAACA,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,OAAO,MAAM,GAAA,CAAI,GAAA,CAAI,QAAQ,CAAC,CAAA,CAAA,EAAI,IAAI,GAAA,CAAI,CAAA,EAAGA,OAAM,KAAK,CAAA,CAAA,EAAI,QAAQ,CAAA,CAAE,CAAC,OAAO,eAAA,CAAgBA,MAAAA,CAAM,UAAU,CAAC,CAAA,CAAA;AAAA,IACjH;AAEA,IAAA,OAAO,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,QAAQ,CAAC,CAAA,CAAA,EAAI,eAAA,CAAgB,2BAAA,CAA4BA,MAAK,CAAC,CAAC,CAAA,IAAA,EAAO,eAAA,CAAgBA,MAAAA,CAAM,UAAU,CAAC,CAAA,CAAA;AAAA,EAC/H,CAAC,CAAA;AAED,EAAA,OAAO,GAAA,CAAI,IAAA,CAAK,OAAA,EAAS,GAAA,CAAA,EAAA,CAAO,CAAA;AAClC;AAEA,SAAS,sBAAA,CACP,GAAA,EACAA,MAAAA,EACA,OAAA,EACA,QAAA,EACa;AACb,EAAA,MAAM,cAAA,GAAiB,kCAAA;AAAA,IACrB,GAAA,CAAI,eAAA;AAAA,IACJA;AAAA,GACF;AACA,EAAA,IAAI,mBAAmB,MAAA,EAAW;AAChC,IAAA,OAAO,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,QAAQ,CAAC,IAAI,eAAA,CAAgB,2BAAA,CAA4B,cAAc,CAAC,CAAC,CAAA,CAAA;AAAA,EAChG;AAEA,EAAA,OAAO,iBAAA,CAAkBA,MAAAA,EAAO,OAAA,EAASA,MAAAA,CAAM,WAAW,QAAQ,CAAA;AACpE;AAEA,SAAS,mBAAA,CACP,iBACA,iBAAA,EACe;AACf,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,QAAuB,EAAC;AAC9B,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,EAAgC;AAChE,EAAA,MAAM,YAAA,GAAe,GAAA,CAAI,GAAA,CAAI,2BAA2B,CAAA;AACxD,EAAA,MAAM,OAAO,GAAA,CAAI,GAAA,CAAI,GAAG,gBAAgB,CAAA,EAAG,SAAS,CAAA,CAAE,CAAA;AACtD,EAAA,MAAM,QAAA,GAAW,GAAA,CAAI,GAAA,CAAI,CAAA,EAAG,SAAS,CAAA,GAAA,CAAK,CAAA;AAC1C,EAAA,MAAM,UAAA,GAAa,GAAA,CAAI,GAAA,CAAI,CAAA,EAAG,SAAS,CAAA,KAAA,CAAO,CAAA;AAC9C,EAAA,OAAO,GAAA,CAAA,WAAA,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,EACE;AACb,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,GAAA,CAAI,QAAQ,CAAA;AAC5B,EAAA,MAAM,OAAO,GAAA,CAAI,GAAA,CAAI,GAAG,gBAAgB,CAAA,EAAG,SAAS,CAAA,CAAE,CAAA;AACtD,EAAA,MAAM,QAAA,GAAW,GAAA,CAAI,GAAA,CAAI,CAAA,EAAG,SAAS,CAAA,GAAA,CAAK,CAAA;AAC1C,EAAA,MAAM,UAAA,GAAa,GAAA,CAAI,GAAA,CAAI,CAAA,EAAG,SAAS,CAAA,KAAA,CAAO,CAAA;AAC9C,EAAA,OAAO,MAAM,GAAA,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,EACa;AACb,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,OAAO,GAAA,CAAA,KAAA,EAAW,GAAA,CAAI,GAAA,CAAI,0BAA0B,CAAC,CAAA,CAAA;AAAA,EACvD;AAEA,EAAA,MAAM,UAAA,GAAa,IAAI,KAAA,CAAM,KAAA;AAC7B,EAAA,MAAM,UAAA,GAAa,GAAA,CAAA,SAAA,EAAe,GAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,CAAA;AAErD,EAAA,MAAM,QAAuB,EAAC;AAC9B,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,MACJ,GAAA,CAAA,EAAM,IAAI,GAAA,CAAI,QAAQ,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,GAAA,CAAI,QAAQ,CAAC,CAAA,IAAA,EAAO,IAAI,GAAA,CAAI,QAAQ,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,IAAI,aAAa,CAAC,CAAA,UAAA,EAAa,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,IAAI,aAAa,CAAC,WAAW,GAAA,CAAI,GAAA,CAAI,QAAQ,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,IAAI,aAAa,CAAC,CAAA,YAAA,EAAe,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAI,GAAA,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,GACA,GAAA,CAAA,EAAM,UAAU,CAAA,CAAA,EAAI,GAAA,CAAI,IAAA,CAAK,KAAA,EAAO,GAAA,CAAA,CAAA,CAAM,CAAC,CAAA,CAAA;AACjD;AAQO,SAAS,qBACd,KAAA,EACyB;AACzB,EAAA,MAAM,EAAE,GAAA,EAAK,0BAAA,EAA4B,OAAA,EAAQ,GAAI,KAAA;AACrD,EAAA,MAAM,YAAA,GAAe,GAAA,CAAI,OAAA,IAAW,EAAC;AACrC,EAAA,MAAM,gBAAA,GAAmB,GAAA,CAAI,gBAAA,IAAoB,EAAC;AAClD,EAAA,IAAI,YAAA,CAAa,MAAA,KAAW,CAAA,IAAK,gBAAA,CAAiB,WAAW,CAAA,EAAG;AAC9D,IAAA,OAAO,MAAA;AAAA,EACT;AAMA,EAAA,MAAM,aACJ,YAAA,CAAa,MAAA,GAAS,CAAA,GAAI,kBAAA,CAAmB,GAAG,CAAA,GAAI,MAAA;AACtD,EAAA,MAAM,QAAuB,EAAC;AAC9B,EAAA,KAAA,MAAW,aAAa,YAAA,EAAc;AACpC,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,EAAY,GAAA,CAAI,SAAA,CAAU,KAAA,CAAM,KAAK,CAAA,IACrC,CAAA,IAAA,EAAO,SAAA,CAAU,KAAA,CAAM,KAAK,CAAA,CAAA;AAC9B,IAAA,MAAMA,MAAAA,GAAQ,sBAAA;AAAA,MACZ,GAAA;AAAA,MACA,SAAA,CAAU,KAAA;AAAA,MACV,OAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,MAAM,YAAY,GAAA,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,iBAAiB,GAAA,CAAI,GAAA,CAAI,KAAA,KAAU,OAAA,GAAU,SAAS,KAAK,CAAA;AACjE,IAAA,KAAA,CAAM,IAAA;AAAA,MACJ,GAAA,CAAA,CAAA,EAAOA,MAAK,CAAA,UAAA,EAAa,cAAc,CAAA,CAAA;AAAA,MACvC,GAAA,CAAA,EAAMA,MAAK,CAAA,CAAA,EAAI,SAAS,CAAA;AAAA,KAC1B;AAAA,EACF;AAgBA,EAAA,KAAA,MAAW,aAAa,gBAAA,EAAkB;AACxC,IAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,SAAA,CAAU,UAAU,CAAA;AACnD,IAAA,MAAM,YAAY,GAAA,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,eAAe,GAAA,CAAI,GAAA;AAAA,MACvB,KAAA,KAAU,UAAU,aAAA,GAAgB;AAAA,KACtC;AACA,IAAA,KAAA,CAAM,KAAK,GAAA,CAAA,EAAM,MAAM,IAAI,SAAS,CAAA,CAAA,EAAI,YAAY,CAAA,CAAE,CAAA;AAAA,EACxD;AAEA,EAAA,OAAO,GAAA,CAAA,SAAA,EAAe,GAAA,CAAI,IAAA,CAAK,KAAA,EAAO,OAAO,CAAC,CAAA,CAAA;AAChD;AAeO,IAAM,uBAAA,GAA0B,aAAA;AACvC,IAAM,wBAAA,GAA2B,SAAA;AACjC,IAAM,8BAAA,GAAiC,KAAA;AAEhC,SAAS,8BAA8B,KAAA,EAAuB;AACnE,EAAA,OAAO,CAAA,EAAG,8BAA8B,CAAA,EAAG,KAAK,CAAA,CAAA;AAClD;AAGA,SAAS,4BAA4B,GAAA,EAAkC;AACrE,EAAA,OAAO;AAAA,IACL,IAAI,KAAA,CAAM,KAAA;AAAA,IACV,GAAG,GAAA,CAAI,UAAA,CAAW,IAAI,CAAC,SAAA,KAAc,UAAU,SAAS;AAAA,GAC1D;AACF;AAOO,SAAS,qCACd,GAAA,EACmB;AACnB,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAY;AACnC,EAAA,KAAA,MAAWA,MAAAA,IAAS,GAAA,CAAI,eAAA,IAAmB,EAAC,EAAG;AAC7C,IAAA,UAAA,CAAW,GAAA,CAAIA,OAAM,KAAK,CAAA;AAAA,EAC5B;AACA,EAAA,OAAO,2BAAA,CAA4B,GAAG,CAAA,CAAE,MAAA;AAAA,IAAO,CAAC,KAAA,KAC9C,UAAA,CAAW,GAAA,CAAI,KAAK;AAAA,GACtB;AACF;AAoBO,SAAS,6BACd,KAAA,EACa;AACb,EAAA,MAAM,EAAE,GAAA,EAAK,0BAAA,EAA4B,OAAA,EAAS,YAAW,GAAI,KAAA;AACjE,EAAA,MAAM,UAAA,GAAa,mBAAmB,GAAG,CAAA;AACzC,EAAA,MAAM,WAAA,GAAc,CAAC,KAAA,KACnB,0BAAA,IACA,UAAA,CAAW,GAAA,CAAI,KAAK,CAAA,IACpB,CAAA,EAAG,gBAAgB,CAAA,EAAG,KAAK,CAAA,CAAA;AAE7B,EAAA,MAAM,UAAyB,EAAC;AAChC,EAAA,KAAA,MAAW,KAAA,IAAS,2BAAA,CAA4B,GAAG,CAAA,EAAG;AACpD,IAAA,MAAM,QAAA,GAAW,YAAY,KAAK,CAAA;AAClC,IAAA,OAAA,CAAQ,IAAA;AAAA,MACN,GAAA,CAAA,EAAM,aAAA,CAAc,QAAA,EAAU,CAAA,EAAG,KAAK,CAAA,GAAA,CAAK,CAAC,CAAA,IAAA,EAAO,GAAA,CAAI,GAAA,CAAI,CAAA,EAAG,KAAK,KAAK,CAAC,CAAA,CAAA;AAAA,MACzE,GAAA,CAAA,EAAM,aAAA,CAAc,QAAA,EAAU,CAAA,EAAG,KAAK,CAAA,KAAA,CAAO,CAAC,CAAA,IAAA,EAAO,GAAA,CAAI,GAAA,CAAI,CAAA,EAAG,KAAK,OAAO,CAAC,CAAA;AAAA,KAC/E;AAAA,EACF;AACA,EAAA,KAAA,MAAW,CAAC,OAAO,SAAS,CAAA,IAAA,CAAM,IAAI,OAAA,IAAW,EAAC,EAAG,OAAA,EAAQ,EAAG;AAC9D,IAAA,MAAM,KAAA,GAAQ,sBAAA;AAAA,MACZ,GAAA;AAAA,MACA,SAAA,CAAU,KAAA;AAAA,MACV,OAAA;AAAA,MACA,WAAA,CAAY,SAAA,CAAU,KAAA,CAAM,KAAK;AAAA,KACnC;AACA,IAAA,OAAA,CAAQ,IAAA;AAAA,MACN,GAAA,CAAA,EAAM,KAAK,CAAA,IAAA,EAAO,GAAA,CAAI,GAAA,CAAI,GAAG,wBAAwB,CAAA,EAAG,KAAK,CAAA,CAAE,CAAC,CAAA;AAAA,KAClE;AAAA,EACF;AAEA,EAAA,MAAM,eAAe,oBAAA,CAAqB;AAAA,IACxC,GAAA;AAAA,IACA,OAAA;AAAA,IACA,GAAI,0BAAA,KAA+B,MAAA,GACjC,EAAC,GACD,EAAE,0BAAA;AAA2B,GAChC,CAAA;AACD,EAAA,MAAM,cAAc,sBAAA,CAAuB;AAAA,IACzC,OAAO,KAAA,CAAM,KAAA;AAAA,IACb,QAAQ,KAAA,CAAM;AAAA,GACf,CAAA;AAED,EAAA,MAAM,KAAA,GAAuB;AAAA,IAC3B,GAAA,CAAA,OAAA,EAAa,GAAA,CAAI,IAAA,CAAK,OAAA,EAAS,OAAO,CAAC,CAAA,CAAA;AAAA,IACvC;AAAA,GACF;AACA,EAAA,IAAI,YAAA,KAAiB,MAAA,EAAW,KAAA,CAAM,IAAA,CAAK,YAAY,CAAA;AACvD,EAAA,IAAI,WAAA,KAAgB,MAAA,EAAW,KAAA,CAAM,IAAA,CAAK,WAAW,CAAA;AAErD,EAAA,OAAO,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,uBAAuB,CAAC,QAAQ,GAAA,CAAI,IAAA,CAAK,KAAA,EAAO,GAAA,CAAA,CAAA,CAAM,CAAC,CAAA,CAAA,CAAA;AAC9E;AAOO,SAAS,oCAAA,CACd,KACA,OAAA,EACa;AACb,EAAA,MAAM,WAAW,GAAA,CAAI,eAAA,IAAmB,EAAC,EAAG,GAAA,CAAI,CAACA,MAAAA,KAAU;AACzD,IAAA,MAAM,aAAA,GAAgB,6BAAA,CAA8BA,MAAAA,CAAM,KAAK,CAAA;AAC/D,IAAA,IAAIA,OAAM,aAAA,EAAe;AACvB,MAAA,MAAM,QAAA,GAAW,+BAAA,CAAgCA,MAAAA,CAAM,KAAK,CAAA;AAC5D,MAAA,OAAO,GAAA,CAAA,EAAM,uBAAuB,aAAA,EAAe,QAAQ,CAAC,CAAA,IAAA,EAAO,eAAA,CAAgBA,MAAAA,CAAM,UAAU,CAAC,CAAA,CAAA;AAAA,IACtG;AACA,IAAA,MAAM,SAAA,GAAY,+BAAA;AAAA,MAChBA,MAAAA;AAAA,MACA,sBAAA,CAAuB,eAAe,OAAO,CAAA;AAAA,MAC7C;AAAA,KACF;AACA,IAAA,OAAO,MAAM,SAAS,CAAA,IAAA,EAAO,eAAA,CAAgBA,MAAAA,CAAM,UAAU,CAAC,CAAA,CAAA;AAAA,EAChE,CAAC,CAAA;AACD,EAAA,OAAO,GAAA,CAAI,IAAA,CAAK,OAAA,EAAS,GAAA,CAAA,EAAA,CAAO,CAAA;AAClC;AAQO,SAAS,kCACd,GAAA,EACyB;AACzB,EAAA,MAAM,OAAA,GAAU,GAAA,CAAI,OAAA,IAAW,EAAC;AAChC,EAAA,IAAI,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AACjC,EAAA,MAAM,IAAA,GAAO,GAAA,CAAI,GAAA,CAAI,uBAAuB,CAAA;AAC5C,EAAA,MAAM,QAAuB,EAAC;AAC9B,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,SAAS,CAAA,IAAK,OAAA,CAAQ,SAAQ,EAAG;AAClD,IAAA,MAAM,MAAA,GAAS,GAAA,CAAA,EAAM,IAAI,CAAA,CAAA,EAAI,GAAA,CAAI,GAAA,CAAI,CAAA,EAAG,wBAAwB,CAAA,EAAG,KAAK,CAAA,CAAE,CAAC,CAAA,CAAA;AAC3E,IAAA,MAAM,YAAY,GAAA,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,iBAAiB,GAAA,CAAI,GAAA,CAAI,KAAA,KAAU,OAAA,GAAU,SAAS,KAAK,CAAA;AACjE,IAAA,KAAA,CAAM,IAAA;AAAA,MACJ,GAAA,CAAA,CAAA,EAAO,MAAM,CAAA,UAAA,EAAa,cAAc,CAAA,CAAA;AAAA,MACxC,GAAA,CAAA,EAAM,MAAM,CAAA,CAAA,EAAI,SAAS,CAAA;AAAA,KAC3B;AAAA,EACF;AACA,EAAA,OAAO,GAAA,CAAA,SAAA,EAAe,GAAA,CAAI,IAAA,CAAK,KAAA,EAAO,OAAO,CAAC,CAAA,CAAA;AAChD;AAEA,SAAS,YAAYA,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,EACyB;AACzB,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,OAAO,GAAA,CAAA,SAAA,EAAe,GAAA,CAAI,IAAA,CAAK,KAAA,EAAO,OAAO,CAAC,CAAA,CAAA;AAChD;AAOO,SAAS,oBACd,KAAA,EACyB;AACzB,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,OAAO,aAAa,SAAS,CAAA,CAAA;AAC/B;AAyBO,SAAS,2BACd,KAAA,EACa;AACb,EAAA,MAAM,EAAE,GAAA,EAAK,OAAA,EAAS,SAAA,EAAW,iBAAgB,GAAI,KAAA;AACrD,EAAA,MAAM,EAAE,KAAA,EAAAA,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;AACnE,IAAA,MAAM,iBAAiB,WAAA,EAAa,GAAA,CAAI,aAAA,CAAc,IAAA,EAAM,SAAS,CAAC,CAAA;AAItE,IAAA,MAAM,YAAA,GAAe,MAAA,IAAU,cAAA,EAAgB,MAAA,IAAU,QAAA;AAyBzD,IAAA,MAAM,kBAAA,GACJ,eAAA,CAAgB,WAAA,KAAgB,IAAA,IAChC,eAAe,aAAA,KAAkB,IAAA;AACnC,IAAA,MAAM,OAAA,GACJ,kBAAA,IAAsB,YAAA,KAAiB,cAAA,EAAgB,SACrD,cAAA,GACA,MAAA;AACJ,IAAA,IAAI,YAAY,MAAA,EAAW;AACzB,MAAA,GAAA,CAAI,aAAA,EAAe,GAAA,CAAI,OAAA,CAAQ,SAAS,CAAA;AAWxC,MAAA,MAAM,YAAA,GAAe,CAAA,EAAG,gBAAgB,CAAA,EAAGA,OAAM,KAAK,CAAA,CAAA;AACtD,MAAA,MAAM,cAAA,GAAiB,aAAa,aAAA,CAAc,YAAA,EAAc,GAAGA,MAAAA,CAAM,KAAK,CAAA,GAAA,CAAK,CAAC,CAAA,MAAA,EAAS,eAAA,CAAgB,YAAY,CAAC,CAAA,OAAA,EAAU,cAAc,YAAA,EAAc,CAAA,EAAGA,OAAM,KAAK,CAAA,KAAA,CAAO,CAAC,CAAA,GAAA,EAAM,IAAI,CAAA,CAAA;AAChM,MAAA,MAAM,SAAS,cAAA,CAAe,WAAA;AAAA,QAC5B;AAAA,UACE,OAAA;AAAA,UACA,QAAA,EAAU,IAAA;AAAA,UACV,SAAA;AAAA,UACA,YAAY,OAAA,CAAQ,UAAA;AAAA,UACpB,MAAA,EAAQ,YAAA;AAAA,UACR,WAAW,OAAA,CAAQ;AAAA,SACrB;AAAA,QACA;AAAA,UACE,OAAA;AAAA,UACA,QAAA,EAAU,IAAA;AAAA,UACV,SAAA;AAAA,UACA,cAAA;AAAA,UACA,MAAA,EAAQ,YAAA;AAAA,UACR,YAAY,OAAA,CAAQ,UAAA;AAAA,UACpB,WAAW,OAAA,CAAQ,SAAA;AAAA,UACnB,OAAO,eAAA,CAAgB,KAAA;AAAA,UACvB,GAAI,QAAA,KAAa,MAAA,GAAY,EAAC,GAAI,EAAE,QAAA;AAAS,SAC/C;AAAA,QACA;AAAA,OACF;AACA,MAAA,MAAM,iBAAA,GACJ,iBAAiB,QAAA,GAAW,GAAA,CAAI,IAAI,eAAe,CAAA,GAAI,GAAA,CAAI,GAAA,CAAI,OAAO,CAAA;AACxE,MAAA,OAAO,GAAA;AAAA,wBAAA,EACa,IAAI,kBAAkB,iBAAiB,CAAA;AAAA,cAAA,EACjD,MAAM,CAAA;AAAA,MAAA,CAAA;AAAA,IAElB;AACA,IAAA,MAAM,eAAe,cAAA,CAAe,kBAAA;AAAA,MAClC,aAAA,CAAc,WAAW,WAAW,CAAA;AAAA,MACpC,cAAA;AAAA,MACA;AAAA,KACF;AAWA,IAAA,MAAM,iBAAA,GAAoB,OAAO,YAAY,CAAA,OAAA,CAAA;AAC7C,IAAA,MAAM,SAAA,GAAY,qBAAA,CAAsB,YAAA,EAAc,YAAY,CAAA;AAElE,IAAA,MAAM,UAAA,GAA4B;AAAA,MAChC,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,OAAO,GAAA;AAAA;AAAA,QAAA,EAED,aAAA,CAAc,SAAA,EAAW,SAAS,CAAC,CAAA;AAAA,QAAA,EACnC,IAAI,CAAA;AAAA,QAAA,EACJ,iBAAiB,CAAA;AAAA,QAAA,EACjB,SAAS,CAAA;AAAA,WAAA,EACN,eAAA,CAAgB,SAAS,CAAC;AAAA,iBAAA,EACpB,WAAW;AAAA,WAAA,EACjB,GAAA,CAAI,GAAA,CAAI,CAAA,EAAG,4BAA4B,UAAU,CAAC,CAAA;AAAA,WAAA,EAClD,aAAA,CAAc,SAAA,EAAW,SAAS,CAAC;AAAA,WAAA,EACnC,IAAI,GAAA,CAAI,CAAA,EAAG,4BAA4B,CAAA,UAAA,CAAY,CAAC,MAAM,IAAI;AAAA,YAAA,EAC7D,GAAA,CAAI,IAAA,CAAK,UAAA,EAAY,GAAA,CAAA,KAAA,CAAU,CAAC;AAAA,IAAA,CAAA;AAAA,EAE5C,CAAC,CAAA;AAKD,EAAA,MAAM,YACJ,QAAA,CAAS,MAAA,KAAW,CAAA,GAClB,mBAAA,KACA,GAAA,CAAI,IAAA;AAAA,IACF,QAAA;AAAA,IACA,GAAA;AAAA;AAAA,QAAA;AAAA,GAGF;AAOJ,EAAA,OAAO,GAAA;AAAA,IAAA,EACH,GAAA,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,GAAmC;AAC1C,EAAA,OAAO,GAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAAA,CAAA;AAQT;AAaO,SAAS,yBACd,KAAA,EACa;AACb,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;AASA,EAAA,MAAM,iBAAA,GACJ,QAAA,IAAY,sBAAA,CAAuB,GAAA,CAAI,mBAAmB,SAAS,CAAA;AACrE,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,GAA4B;AAAA,IAChC,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,CAAK,GAAA,CAAA,EAAM,cAAc,CAAA,IAAA,EAAO,QAAQ,CAAA,CAAE,CAAA;AAAA,EACvD;AAQA,EAAA,OAAO,GAAA;AAAA,IAAA,EACH,GAAA,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,EACjB,GAAA,CAAI,GAAA,CAAI,CAAA,EAAG,4BAA4B,UAAU,CAAC,CAAA;AAAA,aAAA,EAClD,aAAA,CAAc,SAAA,EAAW,SAAS,CAAC;AAAA,aAAA,EACnC,GAAA,CAAI,GAAA,CAAI,CAAA,EAAG,4BAA4B,YAAY,CAAC,CAAA;AAAA,aAAA,EACpD,aAAA,CAAc,SAAA,EAAW,WAAW,CAAC;AAAA,cAAA,EACpC,GAAA,CAAI,IAAA,CAAK,UAAA,EAAY,GAAA,CAAA,KAAA,CAAU,CAAC;AAAA,4BAAA,EAClB,aAAA,CAAc,SAAA,EAAW,SAAS,CAAC,CAAA;AAAA,cAAA,EACjD,KAAK;AAAA;AAAA;AAAA,EAAA,CAAA;AAIrB;AAOA,SAAS,sBAAA,CACP,mBACA,SAAA,EACoB;AACpB,EAAA,IAAI,iBAAA,KAAsB,QAAW,OAAO,MAAA;AAC5C,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAY;AAClC,EAAA,KAAA,MAAW,QAAQ,SAAA,EAAW;AAC5B,IAAA,MAAM,QAAA,GAAW,iBAAA,CAAkB,GAAA,CAAI,IAAI,CAAA;AAC3C,IAAA,IAAI,QAAA,KAAa,MAAA,EAAW,SAAA,CAAU,GAAA,CAAI,QAAQ,CAAA;AAAA,EACpD;AACA,EAAA,IAAI,SAAA,CAAU,IAAA,KAAS,CAAA,EAAG,OAAO,MAAA;AACjC,EAAA,OAAO,CAAC,GAAG,SAAS,CAAA,CAAE,CAAC,CAAA;AACzB;AAEO,SAAS,+BAAA,GAA+C;AAC7D,EAAA,OAAO,GAAA;AAAA,IAAA,EACH,GAAA,CAAI,GAAA,CAAI,2BAA2B,CAAC,CAAA;AAAA,qCAAA,EACH,GAAA,CAAI,GAAA,CAAI,oBAAoB,CAAC;AAAA;AAAA,qCAAA,EAE7B,GAAA,CAAI,GAAA,CAAI,kBAAkB,CAAC;AAAA;AAAA,EAAA,CAAA;AAGlE;AAOA,SAAS,kBAAA,CACP,KACA,OAAA,EACwB;AACxB,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,YAA2B,EAAC;AAClC,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,MAAMA,MAAAA,GAAQ,sBAAA;AAAA,MACZ,GAAA;AAAA,MACA,SAAA,CAAU,KAAA;AAAA,MACV,OAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,MAAM,YAAY,GAAA,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,iBAAiB,GAAA,CAAI,GAAA,CAAI,KAAA,KAAU,OAAA,GAAU,SAAS,KAAK,CAAA;AACjE,IAAA,SAAA,CAAU,IAAA;AAAA,MACR,GAAA,CAAA,CAAA,EAAOA,MAAK,CAAA,UAAA,EAAa,cAAc,CAAA,CAAA;AAAA,MACvC,GAAA,CAAA,EAAMA,MAAK,CAAA,CAAA,EAAI,SAAS,CAAA;AAAA,KAC1B;AAAA,EACF;AACA,EAAA,OAAO,SAAA;AACT;AAWO,SAAS,6BACd,KAAA,EACa;AACb,EAAA,MAAM,EAAE,GAAA,EAAK,OAAA,EAAQ,GAAI,KAAA;AACzB,EAAA,MAAM,SAAA,GAAY,GAAA,CAAI,GAAA,CAAI,CAAA,EAAG,kBAAkB,CAAA,UAAA,CAAY,CAAA;AAC3D,EAAA,MAAM,UAAA,GAAa,kBAAA,CAAmB,GAAA,EAAK,OAAO,CAAA;AAClD,EAAA,OAAO,GAAA,CAAA,SAAA,EAAe,IAAI,IAAA,CAAK,CAAC,WAAW,GAAG,UAAU,CAAA,EAAG,GAAA,CAAA,EAAA,CAAO,CAAC,CAAA,CAAA;AACrE;AAuBO,SAAS,8BACd,KAAA,EACa;AACb,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,WAAW,GAAA,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;AAOA,EAAA,MAAM,aAAa,GAAA,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,OAAO,GAAA,CAAA,SAAA,EAAe,GAAA,CAAI,IAAA,CAAK,CAAC,QAAA,EAAU,GAAG,UAAA,EAAY,UAAU,CAAA,EAAG,GAAA,CAAA,EAAA,CAAO,CAAC,CAAA,CAAA;AAChF;AAOO,SAAS,2BACd,KAAA,EACa;AACb,EAAA,MAAM,EAAE,GAAA,EAAK,OAAA,EAAQ,GAAI,KAAA;AACzB,EAAA,MAAM,aAAA,GAAgB,GAAA,CAAI,GAAA,CAAI,CAAA,EAAG,oBAAoB,CAAA,aAAA,CAAe,CAAA;AACpE,EAAA,MAAM,UAAA,GAAa,kBAAA,CAAmB,GAAA,EAAK,OAAO,CAAA;AAClD,EAAA,OAAO,GAAA,CAAA,SAAA,EAAe,IAAI,IAAA,CAAK,CAAC,eAAe,GAAG,UAAU,CAAA,EAAG,GAAA,CAAA,EAAA,CAAO,CAAC,CAAA,CAAA;AACzE;AAOO,SAAS,uBACd,KAAA,EACyB;AACzB,EAAA,MAAM,EAAE,KAAA,EAAO,MAAA,EAAO,GAAI,KAAA;AAC1B,EAAA,MAAM,QAAuB,EAAC;AAE9B,EAAA,IAAI,UAAU,MAAA,EAAW;AACvB,IAAA,KAAA,CAAM,IAAA,CAAK,GAAA,CAAA,MAAA,EAAY,KAAK,CAAA,CAAE,CAAA;AAAA,EAChC;AACA,EAAA,IAAI,WAAW,MAAA,EAAW;AACxB,IAAA,KAAA,CAAM,IAAA,CAAK,GAAA,CAAA,OAAA,EAAa,MAAM,CAAA,CAAE,CAAA;AAAA,EAClC;AAEA,EAAA,OAAO,MAAM,MAAA,GAAS,CAAA,GAAI,IAAI,IAAA,CAAK,KAAA,EAAO,MAAM,CAAA,GAAI,MAAA;AACtD;;;AC1hDO,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;;;ACIO,SAAS,wBAAA,CACd,GAAA,EACA,WAAA,GAA+B,SAAA,EACX;AACpB,EAAA,MAAM,gBAAA,GAAmB,sBAAsB,WAAW,CAAA;AAC1D,EAAA,OAAO;AAAA,IACL,SAAS,UAAA,EAAkC;AACzC,MAAA,OAAO,qBAAA,CAAsB;AAAA,QAC3B,GAAG,sBAAA,CAAuB,GAAA,EAAK,UAAU,CAAA;AAAA,QACzC;AAAA,OACD,CAAA;AAAA,IACH;AAAA,GACF;AACF;;;ACTO,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;;;ACxCA,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,MAAWA,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,CAAC,SAAA,KAAc;AAC1C,IAAA,MAAM,UAAA,GAAa,UAAU,UAAA,IAAc,MAAA;AAC3C,IAAA,OACE,SAAA,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,CAAC,SAAA,KAAc,UAAU,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,MAAM,kBAAkB,GAAA,CAAI,OAAA,KAAY,MAAA,IAAa,GAAA,CAAI,QAAQ,MAAA,GAAS,CAAA;AAC1E,EAAA,MAAM,sBACJ,GAAA,CAAI,gBAAA,KAAqB,MAAA,IAAa,GAAA,CAAI,iBAAiB,MAAA,GAAS,CAAA;AACtE,EAAA,IAAI,mBAAmB,mBAAA,EAAqB;AAM1C,IAAA,IAAA,GAAO;AAAA,MACL,IAAI,cAAA,EAAe;AAAA,MACnB,KAAA,EAAO,IAAA;AAAA,MACP,EAAA,EAAI,MAAA;AAAA,MACJ,OAAA,EAAS,GAAA,CAAI,OAAA,IAAW;AAAC,KAC3B;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,QAAQ,cAAA,CAAe,EAAA,CAAG,MAAM,CAAA,EAAE;AAAA,IACxE,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;;;ACvfO,SAAS,2CAAA,CACd,GAAA,EACA,eAAA,EACA,iBAAA,EACM;AACN,EAAA,yCAAA,CAA0C,GAAA,EAAK;AAAA,IAC7C,qBAAqB,eAAA,KAAoB,MAAA;AAAA,IACzC,uBAAuB,iBAAA,KAAsB;AAAA,GAC9C,CAAA;AACH;AAEO,SAAS,+CACd,GAAA,EACM;AACN,EAAA,IAAI,GAAA,CAAI,iBAAiB,MAAA,EAAW;AACpC,EAAA,MAAM,gBAAA,GAAmB,iCAAA,CAAkC,GAAA,CAAI,UAAU,CAAA;AACzE,EAAA,MAAM,kBAAA,GAAqB,8BAAA,CAA+B,GAAA,CAAI,UAAU,CAAA;AACxE,EAAA,yCAAA,CAA0C,GAAA,EAAK;AAAA,IAC7C,mBAAA,EAAqB,iBAAiB,MAAA,GAAS,CAAA;AAAA,IAC/C,qBAAA,EAAuB,mBAAmB,MAAA,GAAS;AAAA,GACpD,CAAA;AACH;AAEA,SAAS,yCAAA,CACP,KACA,KAAA,EACM;AACN,EAAA,IAAI,GAAA,CAAI,iBAAiB,MAAA,EAAW;AACpC,EAAA,IAAI,CAAC,KAAA,CAAM,mBAAA,IAAuB,CAAC,MAAM,qBAAA,EAAuB;AAEhE,EAAA,8BAAA,CAA+B,GAAA,CAAI,cAAc,KAAK,CAAA;AACxD;AAEA,SAAS,8BAAA,CACP,cACA,KAAA,EACO;AACP,EAAA,MAAM,IAAI,yBAAA;AAAA,IACR,6GAAA;AAAA,IACA;AAAA,MACE,YAAA;AAAA,MACA,GAAG;AAAA,KACL;AAAA,IACA;AAAA,MACE,UAAA,EACE;AAAA;AACJ,GACF;AACF;;;ACNO,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,aAAa,GAAA,CAAI;AAAA,OACnB;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,8CAAA,CAA+C,MAAM,GAAG,CAAA;AAExD,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,EACa;AACb,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,EACa;AACb,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,GAAI,GAAA,CAAA,eAAA,EAAqB,QAAQ,CAAA,CAAA,GAAK,GAAA,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,EACa;AACb,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,GAAkBC,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,GAAoB,gBAAgB,iBAAiB,CAAA,CAAA;AAE3D,EAAA,MAAM,UAAA,GACJ,uBAAA,GACE,OAAA,CAAQ,UAAA,CAAW,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA,EAAG,GAAA,CAAI,GAAA,CAAI,QAAQ,CAAC,CAAA,GACrD,MAAA;AACJ,EAAA,MAAM,WAAA,GACJ,kBAAkB,OAAA,CAAQ,cAAA,CAAe,IAAI,GAAA,CAAI,OAAO,CAAC,CAAA,GAAI,MAAA;AAC/D,EAAA,MAAM,aAAA,GACJ,eAAA,GACE,OAAA,CAAQ,UAAA,CAAW,GAAA,CAAI,GAAA,CAAI,QAAQ,CAAA,EAAG,GAAA,CAAI,GAAA,CAAI,MAAM,CAAC,CAAA,GACrD,MAAA;AAGJ,EAAA,MAAM,gBAAA,GAAmB;AAAA,IACvB,oBAAoB,OAAO,CAAA,CAAA;AAAA,IAC3B,eAAA;AAAA,IACA,mBAAA;AAAA,IACA,GAAG;AAAA,GACL;AAEA,EAAA,MAAM,yBAAA,GAA2C;AAAA,IAC/C,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,SAASC,wBACP,MAAA,EAQa;AACb,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,MACH,GAAA,CAAA,oBAAA;AAAA,KACF;AACA,IAAA,IAAI,kBAAkB,MAAA,EAAW;AAC/B,MAAA,sBAAA,CAAuB,IAAA,CAAK,GAAA,CAAA,EAAM,aAAa,CAAA,QAAA,CAAU,CAAA;AAAA,IAC3D;AACA,IAAA,MAAM,oBAAA,GAAsC;AAAA,MAC1C,GAAA,CAAA,EAAA,EAAQ,GAAA,CAAI,GAAA,CAAI,MAAA,CAAO,SAAS,CAAC,CAAA,KAAA,EAAQ,GAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,GAAA;AAAA,KAC7D;AACA,IAAA,IAAI,iBAAA,CAAkB,SAAS,CAAA,EAAG;AAChC,MAAA,oBAAA,CAAqB,IAAA;AAAA,QACnB,GAAA,CAAA,EAAA,EAAQ,GAAA,CAAI,GAAA,CAAI,MAAA,CAAO,aAAa,CAAC,CAAA,KAAA,EAAQ,GAAA,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,OAAO,GAAA;AAAA,eAAA,EACI,GAAA,CAAI,IAAA,CAAK,sBAAA,EAAwB,GAAA,CAAA,EAAA,CAAO,CAAC;AAAA;AAAA,mBAAA,EAErC,GAAA,CAAI,OAAO,UAAU,CAAA;AAAA,aAAA,EAC3B,GAAA,CAAI,OAAO,UAAU,CAAA;AAAA,uBAAA,EACX,GAAA,CAAI,GAAA,CAAI,MAAA,CAAO,WAAW,CAAC;AAAA,yBAAA,EACzB,GAAA,CAAI,GAAA,CAAI,MAAA,CAAO,eAAe,CAAC;AAAA,cAAA,EAC1C,GAAA,CAAI,IAAA,CAAK,qBAAA,EAAuB,GAAA,CAAA,KAAA,CAAU,CAAC;AAAA,MAAA,CAAA;AAAA,IAEvD;AAEA,IAAA,OAAO,GAAA;AAAA,aAAA,EACI,GAAA,CAAI,IAAA,CAAK,sBAAA,EAAwB,GAAA,CAAA,EAAA,CAAO,CAAC;AAAA;AAAA,WAAA,EAE3C,GAAA,CAAI,OAAO,UAAU,CAAA,MAAA,EAAS,IAAI,IAAA,CAAK,oBAAA,EAAsB,UAAU,CAAC;AAAA,WAAA,EACxE,GAAA,CAAI,OAAO,UAAU,CAAA;AAAA,qBAAA,EACX,GAAA,CAAI,GAAA,CAAI,MAAA,CAAO,WAAW,CAAC;AAAA,uBAAA,EACzB,GAAA,CAAI,GAAA,CAAI,MAAA,CAAO,eAAe,CAAC;AAAA,YAAA,EAC1C,GAAA,CAAI,IAAA,CAAK,sBAAA,EAAwB,GAAA,CAAA,KAAA,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,eAAeC,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,GAA6C;AACpD,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,GACxB,mCAAmCD,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,OAAO,GAAA;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,IACH,GAAA,CAAA,UAAA;AAAA,GACF;AACA,EAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,IAAA,iBAAA,CAAkB,IAAA,CAAK,GAAA,CAAA,EAAM,WAAW,CAAA,QAAA,CAAU,CAAA;AAAA,EACpD;AAEA,EAAA,OAAO,GAAA;AAAA;AAAA;AAAA,aAAA,EAGM,GAAA,CAAI,IAAA,CAAK,iBAAA,EAAmB,GAAA,CAAA,EAAA,CAAO,CAAC;AAAA,WAAA,EACtC,GAAA,CAAI,OAAO,UAAU,CAAA;AAAA,YAAA,EACpB,GAAA,CAAI,IAAA,CAAK,gBAAA,EAAkB,GAAA,CAAA,KAAA,CAAU,CAAC;;AAAA;;AAAA;AAAA,MAAA,EAK5C,kBAAkB;AAAA;AAAA,EAAA,CAAA;AAG1B;AAWA,SAASD,kBAAAA,CACP,OACA,UAAA,EACa;AACb,EAAA,OAAO,iBAAA,CAAwB,GAAA,CAAI,GAAA,CAAI,UAAU,GAAG,KAAK,CAAA;AAC3D;AAMA,SAAS,qBAAA,CACP,GAAA,EACA,KAAA,EACA,GAAA,EACe;AACf,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,EACe;AACf,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,MAAWF,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,EACe;AACf,EAAA,OAAO,YAAA,CAAa,MAAA;AAAA,IAAO,CAAC,MAAA,KAC1B,mBAAA,CAAoB,eAAA,EAAiB,QAAQ,qBAAqB;AAAA,GACpE,CAAE,GAAA;AAAA,IACA,CAAC,WACC,GAAA,CAAA,EAAM,GAAA,CAAI,IAAI,UAAU,CAAC,IAAI,GAAA,CAAI,GAAA,CAAI,MAAM,CAAC,CAAA,IAAA,EAAO,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,EACe;AACf,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,OAAO,GAAA,CAAA,EAAA,EAAQ,IAAI,GAAA,CAAI,SAAS,CAAC,CAAA,IAAA,EAAO,GAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,CAAA;AAAA,EAC5D,CAAC,CAAA;AACH;AAKA,SAAS,0BAAA,CACP,GAAA,EACA,SAAA,EACA,OAAA,EACa;AACb,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,GAAwB;AAAA;AAAA,IAE5B,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,GAAA,CAAA;AAAA,IACzB,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,KAAA,CAAA;AAAA,IACzB,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,MAAA,CAAA;AAAA,IACzB,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,QAAA,CAAA;AAAA,IACzB,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,WAAA,CAAA;AAAA,IACzB,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,SAAA,CAAA;AAAA,IACzB,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,WAAA,CAAA;AAAA,IACzB,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,WAAA,CAAA;AAAA,IACzB,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,UAAU,CAAC,CAAA,WAAA,CAAA;AAAA;AAAA,IAEzB,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,GAAA,CAAA;AAAA,IACxB,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,KAAA,CAAA;AAAA,IACxB,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,MAAA,CAAA;AAAA,IACxB,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,QAAA,CAAA;AAAA,IACxB,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,WAAA,CAAA;AAAA,IACxB,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,SAAA,CAAA;AAAA,IACxB,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,WAAA,CAAA;AAAA,IACxB,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,WAAA,CAAA;AAAA,IACxB,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,WAAA;AAAA,GAC1B;AAEA,EAAA,IAAI,EAAA,CAAG,eAAe,MAAA,EAAW;AAC/B,IAAA,MAAA,CAAO,KAAK,GAAA,CAAA,SAAA,EAAe,eAAA,CAAgB,EAAA,CAAG,UAAU,CAAC,CAAA,CAAE,CAAA;AAAA,EAC7D;AAEA,EAAA,IAAI,EAAA,CAAG,cAAc,MAAA,EAAW;AAC9B,IAAA,MAAA,CAAO,KAAK,GAAA,CAAA,QAAA,EAAc,eAAA,CAAgB,EAAA,CAAG,SAAS,CAAC,CAAA,CAAE,CAAA;AAAA,EAC3D;AAEA,EAAA,OAAO,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,GAAA,CAAA,EAAA,CAAO,CAAA;AACjC;AAEA,SAAS,mCAAA,CACP,MAAA,EACA,GAAA,EACA,SAAA,EACA,OAAA,EACa;AACb,EAAA,MAAM,cAAA,uBAAqB,GAAA,CAAI,CAAC,IAAI,KAAA,CAAM,KAAA,EAAO,SAAA,CAAU,SAAS,CAAC,CAAA;AAErE,EAAA,MAAM,OAAA,GAAyB,MAAA,CAAO,GAAA,CAAI,CAACA,MAAAA,KAAU;AACnD,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,OAAO,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,CAAA,EAAGA,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,SAAS,GAAA,CAAI,GAAA,CAAI,CAAA,EAAGA,MAAAA,CAAM,KAAK,CAAA,MAAA,CAAQ,CAAA;AAC7C,IAAA,MAAM,SAAA,GAAY,+BAAA,CAAgCA,MAAAA,EAAO,MAAA,EAAQ,OAAO,CAAA;AACxE,IAAA,OAAO,MAAM,SAAS,CAAA,IAAA,EAAO,eAAA,CAAgBA,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,KAAK,GAAA,CAAA,SAAA,EAAe,eAAA,CAAgB,EAAA,CAAG,UAAU,CAAC,CAAA,CAAE,CAAA;AAAA,EAC9D;AACA,EAAA,IAAI,EAAA,CAAG,cAAc,MAAA,EAAW;AAC9B,IAAA,OAAA,CAAQ,KAAK,GAAA,CAAA,QAAA,EAAc,eAAA,CAAgB,EAAA,CAAG,SAAS,CAAC,CAAA,CAAE,CAAA;AAAA,EAC5D;AAEA,EAAA,OAAO,GAAA,CAAI,IAAA,CAAK,OAAA,EAAS,GAAA,CAAA,EAAA,CAAO,CAAA;AAClC;AAKA,SAAS,uBAAA,CACP,KACA,OAAA,EACyB;AACzB,EAAA,IAAI,CAAC,GAAA,CAAI,OAAA,IAAW,GAAA,CAAI,OAAA,CAAQ,WAAW,CAAA,EAAG;AAC5C,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,QAAuB,EAAC;AAE9B,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,MAAMA,MAAAA,GAAQ,iBAAA,CAAkB,SAAA,CAAU,KAAA,EAAO,SAAS,SAAS,CAAA;AACnE,IAAA,MAAM,YAAY,GAAA,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,iBAAiB,GAAA,CAAI,GAAA,CAAI,KAAA,KAAU,OAAA,GAAU,SAAS,KAAK,CAAA;AAEjE,IAAA,KAAA,CAAM,IAAA;AAAA,MACJ,GAAA,CAAA,CAAA,EAAOA,MAAK,CAAA,UAAA,EAAa,cAAc,CAAA,CAAA;AAAA,MACvC,GAAA,CAAA,EAAMA,MAAK,CAAA,CAAA,EAAI,SAAS,CAAA;AAAA,KAC1B;AAAA,EACF;AAEA,EAAA,OAAO,GAAA,CAAA,SAAA,EAAe,GAAA,CAAI,IAAA,CAAK,KAAA,EAAO,OAAO,CAAC,CAAA,CAAA;AAChD;AAKA,SAAS,mBAAmB,GAAA,EAAwC;AAClE,EAAA,MAAM,QAAuB,EAAC;AAE9B,EAAA,IAAI,GAAA,CAAI,UAAU,MAAA,EAAW;AAC3B,IAAA,KAAA,CAAM,IAAA,CAAK,GAAA,CAAA,MAAA,EAAY,GAAA,CAAI,KAAK,CAAA,CAAE,CAAA;AAAA,EACpC;AACA,EAAA,IAAI,GAAA,CAAI,WAAW,MAAA,EAAW;AAC5B,IAAA,KAAA,CAAM,IAAA,CAAK,GAAA,CAAA,OAAA,EAAa,GAAA,CAAI,MAAM,CAAA,CAAE,CAAA;AAAA,EACtC;AAEA,EAAA,OAAO,MAAM,MAAA,GAAS,CAAA,GAAI,IAAI,IAAA,CAAK,KAAA,EAAO,MAAM,CAAA,GAAI,MAAA;AACtD;;;AClxBO,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;;;AC9BO,SAAS,kBACd,OAAA,EACa;AACb,EAAA,MAAM,SAAA,GAAY,OAAA,CAAQ,WAAA,KAAgB,SAAA,IAAa,OAAA,CAAQ,WAAA;AAC/D,EAAA,MAAM,cAAA,GAAiB,iBAAA;AAAA,IACrB,GAAA,CAAI,IAAI,QAAQ,CAAA;AAAA,IAChB,OAAA,CAAQ;AAAA,GACV;AACA,EAAA,MAAM,mBAAmB,kBAAA,EAAmB;AAC5C,EAAA,MAAM,qBAAqB,qBAAA,CAAsB;AAAA,IAC/C,MAAM,OAAA,CAAQ,YAAA;AAAA,IACd,MAAM,OAAA,CAAQ,IAAA;AAAA,IACd,cAAc,OAAA,CAAQ,YAAA;AAAA,IACtB,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,cAAc,OAAA,CAAQ,YAAA;AAAA,IACtB,UAAA,EAAY,GAAA;AAAA,IACZ;AAAA,GACD,CAAA;AAKD,EAAA,MAAM,MAAA,GAAS,qBAAA;AAAA,IACb,OAAA,CAAQ,MAAA;AAAA,IACR,OAAA,CAAQ,YAAA;AAAA,IACR,OAAA,CAAQ,mBAAA;AAAA,IACR;AAAA,GACF;AAEA,EAAA,MAAM,WAAA,GACJ,YAAY,OAAA,CAAQ,OAAA,CAAQ,eAAe,GAAA,CAAI,GAAA,CAAI,MAAM,CAAC,CAAA,GAAI,MAAA;AAChE,EAAA,MAAM,aAAA,GACJ,SAAA,GACE,OAAA,CAAQ,OAAA,CAAQ,UAAA,CAAW,GAAA,CAAI,GAAA,CAAI,QAAQ,CAAA,EAAG,GAAA,CAAI,GAAA,CAAI,MAAM,CAAC,CAAA,GAC7D,MAAA;AACJ,EAAA,MAAM,UAAA,GACJ,OAAA,CAAQ,WAAA,KAAgB,SAAA,GACtB,QAAQ,OAAA,CAAQ,UAAA,CAAW,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA,EAAG,GAAA,CAAI,GAAA,CAAI,QAAQ,CAAC,CAAA,GAC7D,MAAA;AAEJ,EAAA,MAAM,WAAA,GAA6B,CAAC,GAAA,CAAA,IAAA,CAAA,EAAW,GAAA,CAAA,MAAA,CAAA,EAAa,GAAA,CAAA,UAAA,CAAe,CAAA;AAC3E,EAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,IAAA,WAAA,CAAY,IAAA,CAAK,GAAA,CAAA,EAAM,WAAW,CAAA,QAAA,CAAU,CAAA;AAAA,EAC9C;AAEA,EAAA,MAAM,WAAW,GAAA,CAAA,OAAA,EAAa,GAAA,CAAI,IAAA,CAAK,WAAA,EAAa,OAAO,CAAC,CAAA,MAAA,EAAS,MAAA,CAAO,UAAU,yBAAyB,OAAA,CAAQ,OAAO,eAAe,OAAA,CAAQ,QAAQ,QAAQ,kBAAkB,CAAA,CAAA;AAEvL,EAAA,MAAM,gBAAA,GAAkC;AAAA,IACtC,GAAA,CAAA,IAAA,CAAA;AAAA,IACA,GAAA,CAAA,MAAA,CAAA;AAAA,IACA,GAAA,CAAA,oBAAA;AAAA,GACF;AACA,EAAA,IAAI,kBAAkB,MAAA,EAAW;AAC/B,IAAA,gBAAA,CAAiB,IAAA,CAAK,GAAA,CAAA,EAAM,aAAa,CAAA,QAAA,CAAU,CAAA;AAAA,EACrD;AAEA,EAAA,MAAM,cAAA,GAAgC;AAAA,IACpC,GAAA,CAAA,aAAA,EAAmB,QAAQ,OAAO,CAAA,CAAA;AAAA,IAClC,cAAA;AAAA,IACA,kBAAA;AAAA,IACA,kBAAA;AAAA,IACA,GAAA,CAAA,UAAA,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;AAAA,GACD,CAAA;AAED,EAAA,OAAO,GAAA,CAAA,6BAAA,EAAmC,QAAQ,CAAA,WAAA,EAAc,aAAa,CAAA,CAAA,CAAA;AAC/E;AAUA,SAAS,uBACP,OAAA,EACa;AACb,EAAA,MAAM,YAAA,GAAe,GAAA,CAAA,OAAA,EAAa,GAAA,CAAI,IAAA,CAAK,CAAC,GAAG,OAAA,CAAQ,gBAAgB,CAAA,EAAG,GAAA,CAAA,EAAA,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,uBACP,OAAA,EACa;AACb,EAAA,MAAM,WAAW,GAAA,CAAA,KAAA,EAAW,OAAA,CAAQ,MAAA,CAAO,UAAU,8CAA8C,GAAA,CAAI,GAAA,CAAI,OAAA,CAAQ,WAAW,CAAC,CAAA,gBAAA,EAAmB,GAAA,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,MACX,GAAA,CAAA,EAAA,EAAQ,GAAA,CAAI,GAAA,CAAI,OAAA,CAAQ,SAAS,CAAC,CAAA,OAAA;AAAA,KACpC;AACA,IAAA,OAAO,GAAA,CAAA,EAAM,OAAA,CAAQ,YAAY,CAAA,6BAAA,EAAgC,QAAQ,MAAA,CAAO,UAAU,CAAA,GAAA,EAAM,QAAQ,CAAA,OAAA,EAAU,GAAA,CAAI,IAAA,CAAK,QAAA,EAAU,UAAU,CAAC,CAAA,CAAA;AAAA,EAClJ;AAEA,EAAA,OAAO,GAAA,CAAA,EAAM,OAAA,CAAQ,YAAY,CAAA,uBAAA,EAA0B,OAAA,CAAQ,OAAO,UAAU,CAAA,QAAA,EAAW,GAAA,CAAI,GAAA,CAAI,OAAA,CAAQ,SAAS,CAAC,CAAA,QAAA,EAAW,QAAQ,CAAA,OAAA,EAAU,GAAA,CAAI,IAAA,CAAK,CAAC,GAAG,OAAA,CAAQ,YAAY,CAAA,EAAG,GAAA,CAAA,KAAA,CAAU,CAAC,CAAA,CAAA;AACvM;AASA,SAAS,yBACP,OAAA,EACa;AAGb,EAAA,MAAM,QAAA,GAAW,GAAA,CAAA,KAAA,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,MACX,GAAA,CAAA,oCAAA;AAAA,KACF;AACA,IAAA,OAAO,GAAA,CAAA,EAAM,OAAA,CAAQ,YAAY,CAAA,6BAAA,EAAgC,QAAQ,MAAA,CAAO,UAAU,CAAA,GAAA,EAAM,QAAQ,CAAA,OAAA,EAAU,GAAA,CAAI,IAAA,CAAK,QAAA,EAAU,UAAU,CAAC,CAAA,CAAA;AAAA,EAClJ;AAEA,EAAA,OAAO,MAAM,OAAA,CAAQ,YAAY,0BAA0B,OAAA,CAAQ,MAAA,CAAO,UAAU,CAAA,2CAAA,EAA8C,QAAQ,CAAA,OAAA,EAAU,GAAA,CAAI,KAAK,CAAC,GAAG,QAAQ,YAAY,CAAA,EAAG,UAAU,CAAC,CAAA,CAAA;AACrM;;;AC/JA,IAAM,0BAAA,GAA6B,EAAA;AAanC,SAAS,eAAA,CACP,YAAA,EACA,IAAA,EACAA,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;AAmHO,SAAS,sBACd,MAAA,EACuD;AACvD,EAAA,OAAO,CAAqC,OAAA,KAAkB,OAAA;AAChE;AAiPA,eAAsB,gBAKpB,MAAA,EASwC;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;AAIhC,EAAA,MAAM,eAAe,OAAA,CAAQ,YAAA;AAC7B,EAAA,MAAM,UAAA,GAAa,OAAO,MAAA,IAAU,kBAAA;AAEpC,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,YAAA;AAAA,IACA,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,MAAA,EAAQ,qBAAA;AAAA,MACN,UAAA;AAAA,MACA,YAAA;AAAA,MACA,MAAA,CAAO,mBAAA;AAAA,MACP;AAAA,KACF;AAAA,IACA,qBAAqB,MAAA,CAAO,mBAAA;AAAA,IAC5B,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,GAAI,GAAA,CAAI,YAAA,KAAiB,UAAa,EAAE,YAAA,EAAc,IAAI,YAAA,EAAa;AAAA,IACvE,SAAS,GAAA,CAAI,OAAA;AAAA;AAAA,IAEb,MAAA,EAAQ,UAAA;AAAA,IACR,GAAI,IAAI,mBAAA,KAAwB,MAAA,GAC9B,EAAC,GACD,EAAE,mBAAA,EAAqB,GAAA,CAAI,mBAAA;AAAoB,GAClD,CAAA;AACD,EAAA,MAAM,cAAA,GAAiB,oBAAoB,GAAG,CAAA;AAW9C,EAAA,IAAI,UAAA;AACJ,EAAA,MAAM,OAAA,GAAU,IAAI,OAAA,CAAQ,IAAA;AAC5B,EAAA,QAAQ,OAAA;AAAS,IACf,KAAK,UAAA,EAAY;AACf,MAAA,MAAM,cAAc,MAAM,gBAAA;AAAA,QACxB,GAAA;AAAA,QACA,YAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,MAAM,QAAA,GAAW,eAAe,WAAW,CAAA;AAC3C,MAAA,UAAA,GAAa;AAAA,QACX,MAAA,EAAQ,GAAA,CAAA,CAAA;AAAA,QACR,UAAU,CAAC,MAAA,KACT,GAAA,CAAA,6BAAA,EAAmC,QAAQ,+CAA+C,MAAM,CAAA,CAAA,CAAA;AAAA,QAClG,sBAAA,EAAwB;AAAA,OAC1B;AACA,MAAA;AAAA,IACF;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA,UAAA,GAAa;AAAA,QACX,MAAA,EAAQ,GAAA,CAAA,EAAM,YAAY,CAAA,EAAG,cAAc,CAAA,CAAA,CAAA;AAAA;AAAA;AAAA,QAG3C,QAAA,EAAU,CAAC,MAAA,KAAW,GAAA,CAAA,EAAM,MAAM,CAAA,iCAAA,CAAA;AAAA,QAClC,sBAAA,EAAwB;AAAA,OAC1B;AACA,MAAA;AAAA,IACF;AAAA,IACA,SAAS;AAEP,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,yBAAA,EAA4B,MAAA,CAAO,OAAO,CAAC,CAAA,CAAE,CAAA;AAAA,IAC/D;AAAA;AAGF,EAAA,MAAM,CAAC,QAAA,EAAU,QAAQ,CAAA,GAAI,MAAM,QAAQ,GAAA,CAAI;AAAA,IAC7C,kBAAA,CAAmB,GAAA,EAAK,UAAA,EAAY,kBAAkB,CAAA;AAAA,IACtD,kBAAA,CAAmB,GAAA,EAAK,UAAA,EAAY,kBAAkB;AAAA,GACvD,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,EAEA,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,EAAmC;AAC9D,EAAA,MAAM,UAAyB,EAAC;AAEhC,EAAA,IAAI,IAAI,YAAA,KAAiB,MAAA,IAAa,GAAA,CAAI,YAAA,CAAa,SAAS,CAAA,EAAG;AACjE,IAAA,OAAA,CAAQ,IAAA,CAAK,kBAAkB,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA,EAAG,GAAA,CAAI,YAAY,CAAC,CAAA;AAAA,EACnE;AAEA,EAAA,IAAI,IAAI,WAAA,EAAa;AACnB,IAAA,OAAA,CAAQ,IAAA,CAAK,GAAA,CAAA,MAAA,EAAY,GAAA,CAAI,MAAM,CAAA,CAAE,CAAA;AAAA,EACvC;AAEA,EAAA,MAAM,WAAA,GACJ,OAAA,CAAQ,MAAA,GAAS,CAAA,GAAI,GAAA,CAAA,OAAA,EAAa,IAAI,IAAA,CAAK,OAAA,EAAS,GAAA,CAAA,KAAA,CAAU,CAAC,CAAA,CAAA,GAAK,GAAA,CAAA,CAAA;AAEtE,EAAA,OAAO,0DAA0D,WAAW,CAAA,CAAA,CAAA;AAC9E;AA0BA,SAAS,eAAe,MAAA,EAAwC;AAC9D,EAAA,MAAM,WAAW,MAAA,CAAO,GAAA;AAAA,IACtB,CAAC,KAAA,KACC,CAAA,CAAA,EAAI,KAAA,CAAM,UAAA,CAAW,IAAA,EAAM,MAAM,CAAA,CAAE,UAAA,CAAW,GAAA,EAAK,MAAA,CAAO,GAAA,CAAA,EAAA,CAAO,CAAC,CAAA,CAAA;AAAA,GACtE;AACA,EAAA,OAAO,MAAM,CAAA,CAAA,EAAI,QAAA,CAAS,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAG,CAAA,QAAA,CAAA;AACxC;AAGA,eAAe,gBAAA,CACb,GAAA,EACA,YAAA,EACA,cAAA,EAC4B;AAC5B,EAAA,MAAM,IAAA,GAAO,MAAM,GAAA,CAAI,OAAA,CAAQ,OAAA;AAAA,IAC7B,iBAAA;AAAA,MACE,GAAA,CAAA,EAAM,YAAY,CAAA,EAAG,cAAc,CAAA,4BAAA;AAAA;AACrC,GACF;AACA,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ,IAAI,EAAE,CAAA;AACjC;AAEA,eAAe,kBAAA,CACb,GAAA,EACA,UAAA,EACA,cAAA,EACiC;AACjC,EAAA,MAAM,qBAAqB,qBAAA,CAAsB;AAAA,IAC/C,MAAM,GAAA,CAAI,YAAA;AAAA,IACV,MAAM,GAAA,CAAI,IAAA;AAAA,IACV,cAAc,GAAA,CAAI,YAAA;AAAA,IAClB,UAAA,EAAY,GAAA;AAAA,IACZ,kBAAkB,kBAAA;AAAmB,GACtC,CAAA;AACD,EAAA,MAAM,OAAA,GAAyB;AAAA,IAC7B,GAAA,CAAA,MAAA,CAAA;AAAA,IACA,GAAA,CAAA,IAAA,CAAA;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,KAAA,GAAQ,GAAA,CAAA,EAAM,UAAA,CAAW,MAAM,CAAA,OAAA,EAAU,GAAA,CAAI,IAAA,CAAK,OAAA,EAAS,GAAA,CAAA,EAAA,CAAO,CAAC,CAAA,MAAA,EAAS,GAAA,CAAI,MAAA,CAAO,UAAU,CAAA,sBAAA,EAAyB,GAAA,CAAI,OAAO,CAAA,KAAA,EAAQ,kBAAkB,CAAA,KAAA,EAAQ,UAAA,CAAW,QAAA,CAAS,GAAA,CAAI,GAAA,CAAI,MAAM,CAAC,CAAC,CAAA,CAAA;AACjN,EAAA,IAAI,UAAA,CAAW,sBAAA,EAAwB,mBAAA,CAAoB,KAAK,CAAA;AAEhE,EAAA,OAAO,IAAI,OAAA,CAAQ,OAAA;AAAA,IACjB,kBAAkB,KAAK;AAAA,GACzB;AACF;AAEA,eAAe,kBAAA,CACb,GAAA,EACA,UAAA,EACA,cAAA,EACiC;AACjC,EAAA,MAAM,iBAAiB,iBAAA,CAAkB,GAAA,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,cAAc,GAAA,CAAI,YAAA;AAAA,IAClB,UAAA,EAAY,GAAA;AAAA,IACZ,kBAAkB,kBAAA;AAAmB,GACtC,CAAA;AACD,EAAA,MAAM,OAAA,GAAyB;AAAA,IAC7B,GAAA,CAAA,IAAA,CAAA;AAAA,IACA,GAAA,CAAA,MAAA,CAAA;AAAA,IACA,GAAA,CAAA,WAAA,CAAA;AAAA,IACA,GAAA,CAAA,SAAA,CAAA;AAAA,IACA,GAAA,CAAA,SAAA,CAAA;AAAA,IACA,GAAA,CAAA,OAAA,CAAA;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,QAAQ,GAAA,CAAA,EAAM,UAAA,CAAW,MAAM,CAAA,OAAA,EAAU,IAAI,IAAA,CAAK,OAAA,EAAS,GAAA,CAAA,EAAA,CAAO,CAAC,SAAS,GAAA,CAAI,MAAA,CAAO,UAAU,CAAA,sBAAA,EAAyB,IAAI,OAAO,CAAA,KAAA,EAAQ,cAAc,CAAA,KAAA,EAAQ,kBAAkB,CAAA,KAAA,EAAQ,UAAA,CAAW,QAAA,CAAS,GAAA,CAAI,IAAI,WAAW,CAAC,CAAC,CAAA,KAAA,EAAQ,WAAW,QAAA,CAAS,GAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAC,CAAA,CAAA;AAC3R,EAAA,IAAI,UAAA,CAAW,sBAAA,EAAwB,mBAAA,CAAoB,KAAK,CAAA;AAEhE,EAAA,OAAO,IAAI,OAAA,CAAQ,OAAA;AAAA,IACjB,kBAAkB,KAAK;AAAA,GACzB;AACF;AAEA,SAAS,oBAAA,CACP,KAAA,EACA,IAAA,EACA,OAAA,EACwB;AACxB,EAAA,IAAI,IAAA,CAAK,cAAA,CAAe,IAAA,KAAS,CAAA,EAAG;AAClC,IAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,GAAA,KAAQ,GAAA,CAAA,EAAM,GAAA,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,KAAQ,cAAc,GAAA,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,KAAQ,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,GAAG,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA;AAAA,EAChE;AAEA,EAAA,MAAM,MAAA,GAAS,kBAAkB,GAAA,CAAI,GAAA,CAAI,GAAG,KAAK,CAAA,KAAA,CAAO,GAAG,SAAS,CAAA;AACpE,EAAA,OAAO,OAAA,CAAQ,GAAA;AAAA,IACb,CAAC,GAAA,KACC,GAAA,CAAA,UAAA,EAAgB,MAAM,CAAA,MAAA,EAAS,IAAI,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,GAAG,CAAA,CAAE,CAAC,qBAAqB,GAAA,CAAI,GAAA,CAAI,GAAG,CAAC,CAAA;AAAA,GAC9F;AACF;AAEA,SAAS,oBAAA,CACP,OACA,IAAA,EACa;AACb,EAAA,IAAI,IAAA,CAAK,cAAA,CAAe,IAAA,KAAS,CAAA,EAAG;AAClC,IAAA,OAAO,MAAM,GAAA,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,OAAO,GAAA,CAAA,aAAA,CAAA;AAAA,EACT;AAEA,EAAA,MAAM,MAAA,GAAS,kBAAkB,GAAA,CAAI,GAAA,CAAI,GAAG,KAAK,CAAA,KAAA,CAAO,CAAA,EAAG,IAAA,CAAK,SAAS,CAAA;AACzE,EAAA,OAAO,GAAA,CAAA,UAAA,EAAgB,MAAM,CAAA,MAAA,EAAS,GAAA,CAAI,IAAI,CAAA,EAAG,KAAK,QAAQ,CAAC,CAAA,uBAAA,CAAA;AACjE;AAEA,SAAS,6BAAA,CACP,KAAA,EACA,IAAA,EACA,OAAA,EACwB;AACxB,EAAA,MAAM,UAAyB,EAAC;AAEhC,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,EAAQ,GAAA,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,QACN,GAAA,CAAA,UAAA,EAAgB,GAAA,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,MAAM,CAAA,GAAI,aAAA,CAAc,GAAG,CAAA;AAAA,EAC3C;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,MAAM,CAAA,GAAI,aAAA,CAAc,GAAG,CAAA;AAAA,EAC3C;AAEA,EAAA,oBAAA,CAAqB,aAAA,EAAe,KAAK,QAAQ,CAAA;AACjD,EAAA,OAAO,aAAA;AACT;;;ACp9BA,IAAM,YAAA,GAAiD;AAAA,EACrD,KAAA,EAAO,OAAA;AAAA,EACP,QAAA,EAAU,WAAA;AAAA,EACV,SAAA,EAAW,WAAA;AAAA,EACX,MAAA,EAAQ;AACV,CAAA;AAWA,SAAS,2BAA2B,GAAA,EAAsC;AACxE,EAAA,OAAO,IAAI,YAAA,IAAgB,MAAA;AAC7B;AAEA,SAAS,kCAAA,CACP,OACA,IAAA,EACM;AACN,EAAA,IAAI,YAAY,KAAA,EAAO;AACrB,IAAA,kCAAA,CAAmC,KAAA,CAAM,MAAM,IAAI,CAAA;AACnD,IAAA,kCAAA,CAAmC,KAAA,CAAM,OAAO,IAAI,CAAA;AACpD,IAAA;AAAA,EACF;AACA,EAAA,IAAA,CAAK,GAAA,CAAI,0BAAA,CAA2B,KAAK,CAAC,CAAA;AAC5C;AAEA,SAAS,6CAA6C,EAAA,EAAwB;AAC5E,EAAA,MAAM,IAAA,uBAAW,GAAA,EAA2B;AAC5C,EAAA,kCAAA,CAAmC,IAAI,IAAI,CAAA;AAC3C,EAAA,IAAI,IAAA,CAAK,QAAQ,CAAA,EAAG;AACpB,EAAA,MAAM,IAAI,kBAAA;AAAA,IACR,2RAAA;AAAA,IAIA,EAAE,MAAM,4CAAA,EAA6C;AAAA,IACrD;AAAA,MACE,UAAA,EACE;AAAA;AACJ,GACF;AACF;AAEA,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,EACAI,eACA,cAAA,EACa;AACb,EAAA,4CAAA,CAA6C,EAAE,CAAA;AAC/C,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,EACa;AACb,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,QAAQ,GAAA,CAAI,GAAA,CAAI,YAAA,CAAa,EAAA,CAAG,QAAQ,CAAC,CAAA;AAE/C,EAAA,OAAO,GAAA,CAAA,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,EACa;AACb,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,EACa;AACb,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,OAAO,IAAI,IAAA,CAAK,CAAC,MAAM,GAAG,aAAa,GAAG,GAAA,CAAA,CAAA,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,qBAAqBJ,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,EACe;AACf,EAAA,MAAM,UAAyB,EAAC;AAGhC,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,aAA4B,EAAC;AAEnC,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,YAAY,GAAA,CAAI,GAAA,CAAI,QAAQ,eAAA,CAAgB,SAAA,CAAU,UAAU,CAAC,CAAA;AACvE,MAAA,MAAM,MAAM,GAAA,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,WAAW,GAAA,CAAI,GAAA,CAAI,KAAA,KAAU,OAAA,GAAU,SAAS,KAAK,CAAA;AAG3D,MAAA,UAAA,CAAW,IAAA;AAAA,QACT,GAAA,CAAA,CAAA,EAAO,SAAS,CAAA,UAAA,EAAa,QAAQ,CAAA,CAAA;AAAA,QACrC,GAAA,CAAA,EAAM,SAAS,CAAA,CAAA,EAAI,GAAG,CAAA;AAAA,OACxB;AAAA,IACF;AAEA,IAAA,OAAA,CAAQ,KAAK,GAAA,CAAA,SAAA,EAAe,GAAA,CAAI,KAAK,UAAA,EAAY,GAAA,CAAA,EAAA,CAAO,CAAC,CAAA,CAAE,CAAA;AAAA,EAC7D;AAGA,EAAA,IAAI,EAAA,CAAG,UAAU,MAAA,EAAW;AAC1B,IAAA,OAAA,CAAQ,IAAA,CAAK,GAAA,CAAA,MAAA,EAAY,EAAA,CAAG,KAAK,CAAA,CAAE,CAAA;AAAA,EACrC;AAGA,EAAA,IAAI,EAAA,CAAG,WAAW,MAAA,EAAW;AAC3B,IAAA,OAAA,CAAQ,IAAA,CAAK,GAAA,CAAA,OAAA,EAAa,EAAA,CAAG,MAAM,CAAA,CAAE,CAAA;AAAA,EACvC;AAEA,EAAA,OAAO,OAAA;AACT;;;ACxWA,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,CAACA,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,MAAW,SAAA,IAAa,WAAW,UAAA,EAAY;AAC7C,QAAA,6BAAA,CAA8B,wBAAwB,SAAS,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;AAWO,SAASK,8BAAAA,CACd,KACA,OAAA,EACwB;AACxB,EAAA,MAAM,iBAAA,GAAoB,SAAS,iBAAA,IAAqB,IAAA;AACxD,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,MAAM,kBAAA,GAAA,CAAsB,GAAA,CAAI,eAAA,EAAiB,MAAA,IAAU,CAAA,IAAK,CAAA;AAEhE,EAAA,IAAI,iBAAA,EAAmB;AACrB,IAAA,IAAI,kBAAA,EAAoB;AACtB,MAAA,KAAA,MAAWL,MAAAA,IAAS,GAAA,CAAI,eAAA,IAAmB,EAAC,EAAG;AAC7C,QAAA,IAAIA,OAAM,aAAA,EAAe;AACvB,UAAA,iBAAA;AAAA,YACE,sBAAA;AAAA,YACAA,MAAAA,CAAM,KAAA;AAAA,YACN,+BAAA,CAAgCA,OAAM,KAAK;AAAA,WAC7C;AAAA,QACF;AAAA,MACF;AAAA,IACF,CAAA,MAAO;AACL,MAAA,KAAA,MAAW,cAAA,IAAkB,GAAA,CAAI,UAAA,CAAW,MAAA,EAAQ;AAClD,QAAA,MAAM,SAAS,cAAA,CAAe,MAAA;AAC9B,QAAA,IAAI,MAAA,CAAO,WAAW,WAAA,EAAa;AACjC,UAAA,sBAAA,CAAuB,wBAAwB,MAAM,CAAA;AAAA,QACvD,CAAA,MAAO;AACL,UAAA,iBAAA,CAAkB,sBAAA,EAAwB,MAAA,CAAO,KAAA,CAAM,KAAA,EAAO,IAAI,CAAA;AAClE,UAAA,sBAAA,CAAuB,sBAAA,EAAwB,OAAO,KAAK,CAAA;AAAA,QAC7D;AAAA,MACF;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,IACE,kCAAA;AAAA,QACE,GAAA,CAAI,eAAA;AAAA,QACJ,SAAA,CAAU;AAAA,YACN,MAAA,EACN;AACA,QAAA;AAAA,MACF;AACA,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,IAAI,CAAC,kBAAA,EAAoB;AACvB,IAAA,KAAA,MAAW,SAAA,IAAa,IAAI,UAAA,EAAY;AACtC,MAAA,6BAAA;AAAA,QACE,sBAAA;AAAA,QACA,SAAA,CAAU;AAAA,OACZ;AAAA,IACF;AAAA,EACF;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,CAAC,SAAA,KACjC,sBAAA,CAAuB,SAAA,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,CAAC,SAAA,KACC,sBAAA,CAAuB,UAAU,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,CAACA,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,2CAAA;AAAA,IACE,KAAA,CAAM,GAAA;AAAA,IACN,KAAA,CAAM,eAAA;AAAA,IACN,KAAA,CAAM;AAAA,GACR;AAEA,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,CAAyB,YAAA,CAAa,GAAA,EAAK,GAAA,CAAI,WAAW,CAAA;AAAA,IACnE,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,IAC1CK,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,EACzB;AAEnB,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,UAAA,GACJ,SAAS,MAAA,KAAW,MAAA,GAClB,qBACA,gBAAA,CAAiB,QAAA,CAAS,QAAQ,qBAAqB,CAAA;AAC3D,EAAA,MAAM,MAAA,GAAS,qBAAA;AAAA,IACb,UAAA;AAAA,IACA,GAAA,CAAI,YAAA;AAAA,IACJ,QAAA,CAAS,mBAAA;AAAA,IACT;AAAA,GACF;AAEA,EAAA,MAAM,OAAA,GAAU,qBAAA,CAAsB,OAAA,EAAS,QAAA,CAAS,gBAAgB,CAAA;AAQxE,EAAA,MAAM,aAAA,uBAAoB,GAAA,EAAY;AACtC,EAAA,MAAM,GAAA,GAAgC;AAAA,IACpC,OAAA,EAAS,OAAA;AAAA,IACT,MAAA;AAAA,IACA,aAAA;AAAA,IACA,WAAA,EAAa,SAAS,WAAA,IAAe,SAAA;AAAA,IACrC,YAAA,EAAc,CAAC,MAAA,EAAQ,UAAA,KACrB,YAAA;AAAA,MACE,mBAAA,CAAoB,MAAA,EAAQ,GAAA,CAAI,YAAY,CAAA;AAAA,MAC5C,UAAA;AAAA,MACA,iBAAiB,QAAQ;AAAA,KAC3B;AAAA,IACF,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,EAAY;AAAA,IACtC,GAAI,SAAS,iBAAA,KAAsB,MAAA,GACjC,EAAC,GACD,EAAE,iBAAA,EAAmB,QAAA,CAAS,iBAAA;AAAkB,GACpD;AAEA,EAAA,SAAS,OAAO,QAAA,EAA0C;AACxD,IAAA,IAAI,aAAA,CAAc,OAAO,CAAA,EAAG;AAC1B,MAAA,gBAAA,CAAiB,QAAA,EAAU,CAAC,GAAG,aAAa,CAAC,CAAA;AAAA,IAC/C;AACA,IAAA,OAAO,oBAAoB,QAAQ,CAAA;AAAA,EACrC;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,MAAA,CAAO,oBAAA,CAAqB,OAAA,EAAS,OAAA,EAAS,GAAG,CAAC,CAAA;AAAA,IAC3D;AACA,IAAA,OAAO,MAAA,CAAO,0BAAA,CAA2B,GAAA,EAAK,OAAA,EAAS,GAAG,CAAC,CAAA;AAAA,EAC7D;AAGA,EAAA,OAAO,MAAA,CAAO,oBAAA,CAAqB,GAAA,EAAK,OAAA,EAAS,GAAG,CAAC,CAAA;AACvD;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,cAAA,CAAe,GAAA,CAAI,UAAA,CAAW,CAAC,CAAC,CAAA;AAClD,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,EACzB;AAEnB,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;AAMxE,EAAA,MAAM,aAAA,uBAAoB,GAAA,EAAY;AACtC,EAAA,MAAM,cAAA,GAAiB,CAAC,GAAA,EAAe,GAAA,KAAmC;AACxE,IAAA,MAAM,WAAW,YAAA,CAAa,GAAA,EAAK,GAAA,EAAK,gBAAA,CAAiB,QAAQ,CAAC,CAAA;AAClE,IAAA,KAAA,MAAW,SAAA,IAAa,iBAAA,CAAkB,QAAQ,CAAA,IAAK,EAAC,EAAG;AACzD,MAAA,aAAA,CAAc,IAAI,SAAS,CAAA;AAAA,IAC7B;AACA,IAAA,OAAO,QAAA;AAAA,EACT,CAAA;AAKA,EAAA,MAAM,QAAA,GAAW,qBAAA;AAAA,IAAsB,MACrC,mBAAA,CAAa,EAAA,EAAI,SAAS,OAAA,EAAS,cAAA,EAAgB,SAAS,cAAc;AAAA,GAC5E;AACA,EAAA,IAAI,aAAA,CAAc,OAAO,CAAA,EAAG;AAC1B,IAAA,gBAAA,CAAiB,QAAA,EAAU,CAAC,GAAG,aAAa,CAAC,CAAA;AAAA,EAC/C;AACA,EAAA,OAAO,oBAAoB,QAAQ,CAAA;AACrC;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;AAmBA,SAAS,mBAAA,CACP,QACA,YAAA,EACU;AACV,EAAA,IAAI,iBAAiB,MAAA,EAAW;AAC9B,IAAA,IAAI,MAAA,CAAO,iBAAiB,MAAA,EAAW;AACrC,MAAA,MAAM,kCAAA;AAAA,QACJ;AAAA,OACF;AAAA,IACF;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,IAAI,OAAO,YAAA,KAAiB,MAAA,SAAkB,EAAE,GAAG,QAAQ,YAAA,EAAa;AACxE,EAAA,IAAI,MAAA,CAAO,iBAAiB,YAAA,EAAc;AACxC,IAAA,MAAM,kCAAA;AAAA,MACJ;AAAA,KACF;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,mCACP,OAAA,EACoB;AACpB,EAAA,OAAO,IAAI,kBAAA;AAAA,IACT,OAAA;AAAA,IACA,EAAE,MAAM,uCAAA,EAAwC;AAAA,IAChD;AAAA,MACE,UAAA,EACE;AAAA;AACJ,GACF;AACF;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,EAAY;AAAA,IACtC,GAAI,SAAS,iBAAA,KAAsB,MAAA,GACjC,EAAC,GACD,EAAE,iBAAA,EAAmB,QAAA,CAAS,iBAAA,EAAkB;AAAA,IAClD,GAAI,SAAS,mBAAA,KAAwB,MAAA,GACnC,EAAC,GACD,EAAE,mBAAA,EAAqB,QAAA,CAAS,mBAAA,EAAoB;AAAA,IACtD,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,cAAA,CAAe,GAAA,CAAI,UAAA,CAAW,CAAC,CAAC,CAAA;AAClD,EAAA,IAAA,CAAK,SAAA,CAAU,gBAAA,EAAkB,MAAA,IAAU,CAAA,IAAK,CAAA,EAAG;AACjD,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,aAAa,cAAA,CAAe,GAAA,CAAI,OAAA,CAAQ,MAAA,CAAO,CAAC,CAAC,CAAA;AACvD,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,EACyB;AACzB,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,IACnB,mBAAmB,OAAO,CAAA,CAAA;AAAA,IAC1B,iBAAA,CAAkB,GAAA,CAAI,GAAA,CAAI,QAAQ,GAAG,SAAS,CAAA;AAAA,IAC9C,kBAAkB,GAAA,CAAI,GAAA,CAAI,KAAK,aAAa,CAAA,CAAE,GAAG,iBAAiB,CAAA;AAAA,IAClE,kBAAkB,GAAA,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,CAAkB,GAAA,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,MACE,GAAA,CAAA,uBAAA,CAAA;AAAA,MACA,GAAA,CAAA,SAAA,EAAe,GAAA,CAAI,GAAA,CAAI,WAAW,CAAC,CAAA,CAAA;AAAA,MACnC,GAAA,CAAA,WAAA,EAAiB,GAAA,CAAI,GAAA,CAAI,eAAe,CAAC,CAAA;AAAA;AAC3C,MAIA;AAAA,IACE,GAAA,CAAA,uBAAA,CAAA;AAAA,IACA,GAAA,CAAA,SAAA,EAAe,GAAA,CAAI,GAAA,CAAI,WAAW,CAAC,CAAA,CAAA;AAAA,IACnC,GAAA,CAAA,WAAA,EAAiB,GAAA,CAAI,GAAA,CAAI,eAAe,CAAC,CAAA,CAAA;AAAA,IACzC,iBAAA,CAAkB,GAAA,CAAI,GAAA,CAAI,QAAQ,GAAG,SAAS,CAAA;AAAA,IAC9C;AAAA,MAEJ,EAAC;AAEL,EAAA,MAAM,mBAAkC,EAAC;AACzC,EAAA,IAAI,iBAAA,EAAmB;AACrB,IAAA,gBAAA,CAAiB,KAAK,GAAA,CAAA,eAAA,EAAqB,GAAA,CAAI,GAAA,CAAI,eAAe,CAAC,CAAA,CAAE,CAAA;AAAA,EACvE;AACA,EAAA,IAAI,yBAAA,EAA2B;AAC7B,IAAA,gBAAA,CAAiB,IAAA;AAAA,MACf,GAAA,CAAA,wBAAA,EAA8B,GAAA,CAAI,GAAA,CAAI,uBAAuB,CAAC,CAAA;AAAA,KAChE;AAAA,EACF;AACA,EAAA,IAAI,iBAAA,EAAmB;AACrB,IAAA,gBAAA,CAAiB,KAAK,GAAA,CAAA,eAAA,EAAqB,GAAA,CAAI,GAAA,CAAI,eAAe,CAAC,CAAA,CAAE,CAAA;AAAA,EACvE;AACA,EAAA,IAAI,yBAAA,EAA2B;AAC7B,IAAA,gBAAA,CAAiB,IAAA;AAAA,MACf,GAAA,CAAA,wBAAA,EAA8B,GAAA,CAAI,GAAA,CAAI,uBAAuB,CAAC,CAAA;AAAA,KAChE;AAAA,EACF;AAqBA,EAAA,MAAM,gBAEF,SAAA,CAAU,QAAA,IACV,IAAI,OAAA,KAAY,MAAA,IAChB,IAAI,gBAAA,KAAqB,MAAA,IACzB,IAAI,KAAA,KAAU,MAAA,GAEd,EAAE,KAAA,EAAO,GAAA,CAAI,OAAO,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,GACE,GAAA;AAAA,QAAA,EACI,GAAA,CAAI,GAAA,CAAI,qBAAqB,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,MAAA,CAAO,UAAU,CAAA,MAAA,EAAS,GAAA,CAAI,IAAA,CAAK,iBAAA,EAAmB,UAAU,CAAC;AAAA,MAAA,CAAA,GAE3G,GAAA,CAAA,CAAA;AAEJ,EAAA,MAAM,QAAA,GAAW,GAAA;AAAA,IAAA,EACb,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA;AAAA;AAAA,YAAA,EAEd,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,GAAA,CAAI,qBAAqB,CAAC,CAAA,IAAA,EAAO,GAAA,CAAI,GAAA,CAAI,qBAAqB,CAAC,CAAA;AAAA,YAAA,EAC7F,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,GAAA,CAAI,uBAAuB,CAAC,CAAA,IAAA,EAAO,GAAA,CAAI,GAAA,CAAI,uBAAuB,CAAC,CAAA;AAAA,QAAA,EACrG,GAAA,CAAI,IAAA,CAAK,gBAAA,EAAkB,GAAA,CAAA,EAAA,CAAO,CAAC;AAAA,eAAA,EAC5B,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC;AAAA,WAAA,EAC1B,IAAI,MAAA,CAAO,UAAU,CAAA,UAAA,EAAa,GAAA,CAAI,IAAI,aAAa,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,IAAI,qBAAqB,CAAC,QAAQ,GAAA,CAAI,GAAA,CAAI,SAAS,CAAC;AAAA,gBAAA,EAC/G,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC,IAAI,GAAA,CAAI,GAAA,CAAI,uBAAuB,CAAC,QAAQ,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC,GAAG,cAAc;AAAA,YAAA,EAC7G,GAAA,CAAI,IAAA,CAAK,YAAA,EAAc,GAAA,CAAA,KAAA,CAAU,CAAC;AAAA;AAAA,YAAA,EAElC,GAAA,CAAI,IAAI,aAAa,CAAC,IAAI,GAAA,CAAI,GAAA,CAAI,qBAAqB,CAAC,CAAA;AAAA,YAAA,EACxD,GAAA,CAAI,IAAI,aAAa,CAAC,IAAI,GAAA,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,aAAa,GAAA,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,OAAO,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,GAAa,GAAA,CAAA,EAAM,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,GAAA,CAAI,oBAAoB,CAAC,CAAA,CAAA;AAChF,MAAA,MAAM,cAAA,GACJ,SAAA,CAAU,QAAA,GAAW,GAAA,CAAA,SAAA,EAAe,UAAU,CAAA,IAAA,CAAA,GAAS,UAAA;AAEzD,MAAA,OAAO,MAAM,cAAc,CAAA,IAAA,EAAO,eAAA,CAAgB,cAAA,CAAe,UAAU,CAAC,CAAA,CAAA;AAAA,IAC9E,CAAC,CAAA;AAAA,IACD,GAAA,CAAA,EAAA;AAAA,GACF;AAEA,EAAA,MAAM,QAAA,GAAW,SAAA,CAAU,QAAA,GAAW,WAAA,GAAc,YAAA;AACpD,EAAA,MAAM,UAAA,GAAa,GAAA;AAAA,aAAA,EACN,GAAA,CAAI,GAAA,CAAI,UAAU,CAAC;AAAA,IAAA,EAC5B,GAAA,CAAI,IAAI,QAAQ,CAAC,IAAI,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC;AAAA,SAAA,EACtC,IAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,IAAI,qBAAqB,CAAC,CAAA,OAAA,EAAU,GAAA,CAAI,IAAI,aAAa,CAAC,IAAI,GAAA,CAAI,GAAA,CAAI,qBAAqB,CAAC;AAAA,UAAA,EACzH,IAAI,GAAA,CAAI,aAAa,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,IAAI,uBAAuB,CAAC,CAAA,OAAA,EAAU,GAAA,CAAI,IAAI,aAAa,CAAC,IAAI,GAAA,CAAI,GAAA,CAAI,uBAAuB,CAAC;AAAA,EAAA,CAAA;AAQxI,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;AAOA,SAAS,mCACP,KAAA,EAUe;AACf,EAAA,MAAM;AAAA,IACJ,GAAA;AAAA,IACA,2BAAA;AAAA,IACA,GAAA;AAAA,IACA,OAAA;AAAA,IACA,cAAA;AAAA,IACA,sBAAA;AAAA,IACA,kBAAA;AAAA,IACA;AAAA,GACF,GAAI,KAAA;AACJ,EAAA,MAAM,IAAA,GAAsB;AAAA,IAC1B,qBAAA,CAAsB;AAAA,MACpB,GAAA;AAAA,MACA,GAAA;AAAA,MACA,OAAA;AAAA,MACA,cAAA;AAAA,MACA,sBAAA;AAAA,MACA;AAAA,KACD;AAAA,GACH;AACA,EAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,KAAA,GAAQ,GAAA,CAAI,UAAA,CAAW,QAAQ,KAAA,EAAA,EAAS;AAC1D,IAAA,IAAA,CAAK,IAAA;AAAA,MACH,yBAAA,CAA0B;AAAA,QACxB,GAAA;AAAA,QACA,2BAAA;AAAA,QACA,GAAA;AAAA,QACA,OAAA;AAAA,QACA,cAAA,EAAgB,6BAAA;AAAA,UACd,GAAA,CAAI,OAAA;AAAA,UACJ,IAAI,UAAA,CAAW,MAAA;AAAA,UACf;AAAA,SACF;AAAA,QACA,cAAA;AAAA,QACA,sBAAA;AAAA,QACA,kBAAA;AAAA,QACA,cAAA,EAAgB,KAAA;AAAA,QAChB;AAAA,OACD;AAAA,KACH;AAAA,EACF;AACA,EAAA,OAAO,IAAA;AACT;AAYA,SAAS,yBAAyBN,MAAAA,EAAgC;AAChE,EAAA,IAAI,CAACA,OAAM,aAAA,EAAe;AACxB,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,MAAA,GAAS,+BAAA,CAAgCA,MAAAA,CAAM,KAAK,CAAA;AAC1D,EAAA,OAAO,MAAA,KAAW,QAAQ,MAAA,KAAW,MAAA;AACvC;AAQA,SAAS,+BACP,GAAA,EACqC;AAMrC,EAAA,IAAI,GAAA,CAAI,iBAAiB,MAAA,EAAW;AAClC,IAAA,OAAO,MAAA;AAAA,EACT;AAKA,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;AAKA,EAAA,MAAM,UAAU,GAAA,CAAI,OAAA;AACpB,EAAA,IAAI,OAAA,KAAY,MAAA,IAAa,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG;AACjD,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,IAAI,GAAA,CAAI,KAAA,KAAU,MAAA,IAAa,GAAA,CAAI,SAAS,CAAA,EAAG;AAC7C,IAAA,OAAO,MAAA;AAAA,EACT;AAGA,EAAA,IAAI,GAAA,CAAI,OAAA,KAAY,MAAA,IAAa,GAAA,CAAI,WAAW,MAAA,EAAW;AACzD,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,IAAI,IAAI,gBAAA,KAAqB,MAAA,IAAa,GAAA,CAAI,gBAAA,CAAiB,SAAS,CAAA,EAAG;AACzE,IAAA,OAAO,MAAA;AAAA,EACT;AAIA,EAAA,IAAI,IAAI,UAAA,CAAW,IAAA,CAAK,CAAC,SAAA,KAAc,SAAA,CAAU,QAAQ,CAAA,EAAG;AAC1D,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,WAAA,uBAAkB,GAAA,CAAY;AAAA,IAClC,IAAI,KAAA,CAAM,KAAA;AAAA,IACV,GAAG,GAAA,CAAI,UAAA,CAAW,IAAI,CAAC,SAAA,KAAc,UAAU,SAAS;AAAA,GACzD,CAAA;AAID,EAAA,KAAA,MAAWA,UAAS,eAAA,EAAiB;AACnC,IAAA,IAAI,CAAC,WAAA,CAAY,GAAA,CAAIA,MAAAA,CAAM,KAAK,CAAA,EAAG;AACjC,MAAA,OAAO,MAAA;AAAA,IACT;AAAA,EACF;AACA,EAAA,KAAA,MAAW,aAAa,OAAA,EAAS;AAC/B,IAAA,IAAI,CAAC,WAAA,CAAY,GAAA,CAAI,SAAA,CAAU,KAAA,CAAM,KAAK,CAAA,EAAG;AAC3C,MAAA,OAAO,MAAA;AAAA,IACT;AAAA,EACF;AAIA,EAAA,MAAM,eAAA,uBAAsB,GAAA,EAAoB;AAChD,EAAA,KAAA,MAAW,aAAa,OAAA,EAAS;AAC/B,IAAA,MAAM,OAAA,GAAU,kCAAA;AAAA,MACd,eAAA;AAAA,MACA,SAAA,CAAU;AAAA,KACZ;AACA,IAAA,IAAI,YAAY,MAAA,EAAW;AACzB,MAAA,eAAA,CAAgB,IAAI,OAAO,CAAA;AAAA,IAC7B;AAAA,EACF;AAIA,EAAA,MAAM,oBAAoB,eAAA,CAAgB,IAAA;AAAA,IACxC,CAACA,WAAU,CAAC,wBAAA,CAAyBA,MAAK,CAAA,IAAK,CAAC,eAAA,CAAgB,GAAA,CAAIA,MAAK;AAAA,GAC3E;AACA,EAAA,IAAI,CAAC,iBAAA,EAAmB;AACtB,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,wBAAwB,eAAA,CAAgB,MAAA;AAAA,IAC5C,CAACA,MAAAA,KAAUA,MAAAA,CAAM,aAAA,IAAiB,eAAA,CAAgB,IAAIA,MAAK;AAAA,GAC7D;AAEA,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,EAAE,GAAG,GAAA,EAAK,iBAAiB,qBAAA,EAAsB;AAAA,IAC1D,OAAO,GAAA,CAAI,KAAA;AAAA,IACX,QAAQ,GAAA,CAAI;AAAA,GACd;AACF;AAUA,SAAS,oCAAA,CACP,GAAA,EACA,OAAA,EACA,GAAA,EACa;AACb,EAAA,MAAM,IAAA,GAAO,GAAA,CAAI,GAAA,CAAI,uBAAuB,CAAA;AAC5C,EAAA,MAAM,QAAQ,oCAAA,CAAqC,GAAG,CAAA,CAAE,GAAA,CAAI,CAAC,KAAA,KAAU;AACrE,IAAA,MAAM,QAAA,GAAW,GAAA,CAAI,GAAA,CAAI,6BAAA,CAA8B,KAAK,CAAC,CAAA;AAC7D,IAAA,OAAO,GAAA,CAAA,KAAA,EAAW,GAAA,CAAI,MAAA,CAAO,UAAU,CAAA,CAAA,EAAI,QAAQ,CAAA,IAAA,EAAO,QAAQ,CAAA,YAAA,EAAe,OAAO,CAAA,KAAA,EAAQ,QAAQ,WAAW,IAAI,CAAA,CAAA,EAAI,GAAA,CAAI,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,KAAA,CAAO,CAAC,QAAQ,QAAQ,CAAA,MAAA,EAAS,IAAI,CAAA,CAAA,EAAI,GAAA,CAAI,GAAA,CAAI,CAAA,EAAG,KAAK,KAAK,CAAC,CAAA,CAAA;AAAA,EAC5M,CAAC,CAAA;AACD,EAAA,OAAO,KAAA,CAAM,MAAA,KAAW,CAAA,GACpB,GAAA,CAAA,KAAA,EAAW,IAAI,CAAA,CAAA,GACf,GAAA,CAAA,KAAA,EAAW,IAAI,CAAA,CAAA,EAAI,GAAA,CAAI,IAAA,CAAK,KAAA,EAAO,MAAM,CAAC,CAAA,CAAA;AAChD;AAEA,SAAS,4BAAA,CACP,KACA,OAAA,EACA,GAAA,EACA,aACA,cAAA,EACA,kBAAA,EACA,4BACA,sCAAA,EACyB;AACzB,EAAA,MAAM,IAAA,GAAO,+BAA+B,GAAG,CAAA;AAC/C,EAAA,IAAI,SAAS,MAAA,EAAW;AACtB,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,EAAE,OAAA,EAAS,KAAA,EAAO,MAAA,EAAO,GAAI,IAAA;AACnC,EAAA,MAAM,EAAE,SAAQ,GAAI,GAAA;AACpB,EAAA,MAAM,mBAAA,GAAsBK,+BAA8B,OAAA,EAAS;AAAA,IACjE,iBAAA,EAAmB;AAAA,GACpB,CAAA;AAED,EAAA,MAAM,OAAO,kCAAA,CAAmC;AAAA,IAC9C,GAAA,EAAK,OAAA;AAAA,IACL,2BAAA,EAA6B,sCAAA;AAAA,IAC7B,GAAA;AAAA,IACA,OAAA;AAAA,IACA,cAAA;AAAA,IACA,sBAAA,EAAwB,mBAAA;AAAA,IACxB,kBAAA;AAAA,IACA,cAAA,EAAgB;AAAA,GACjB,CAAA;AACD,EAAA,IAAA,CAAK,IAAA;AAAA,IACH,4BAAA,CAA6B;AAAA,MAC3B,GAAA,EAAK,OAAA;AAAA,MACL,OAAA;AAAA,MACA,YAAY,uBAAA,CAAwB;AAAA,QAClC,GAAA,EAAK,OAAA;AAAA,QACL,GAAI,0BAAA,KAA+B,MAAA,GACjC,EAAC,GACD,EAAE,0BAAA;AAA2B,OAChC,CAAA;AAAA,MACD,KAAA;AAAA,MACA,MAAA;AAAA,MACA,GAAI,0BAAA,KAA+B,MAAA,GACjC,EAAC,GACD,EAAE,0BAAA;AAA2B,KAChC;AAAA,GACH;AAEA,EAAA,MAAM,OAAA,GAAU,kCAAkC,GAAG,CAAA;AACrD,EAAA,OAAO,oBAAA,CAAqB;AAAA,IAC1B,IAAA;AAAA,IACA,UAAA,EAAY,oCAAA,CAAqC,GAAA,EAAK,OAAA,EAAS,GAAG,CAAA;AAAA,IAClE,GAAI,OAAA,KAAY,MAAA,GAAY,EAAC,GAAI,EAAE,OAAA,EAAQ;AAAA,IAC3C,WAAA,EAAa,yBAAyB,WAAW,CAAA;AAAA,IACjD,UAAA,EAAY,oCAAA,CAAqC,GAAA,EAAK,OAAO;AAAA,GAC9D,CAAA;AACH;AAWA,IAAM,gCAAA,GAGF;AAAA,EACF,WAAA,EAAa;AACf,CAAA;AAEA,SAAS,oBAAA,CACP,GAAA,EACA,OAAA,EACA,GAAA,EACa;AACb,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,EACyB;AACzB,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,EACa;AACb,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;AAEA,IAAA,MAAM,mBAAA,GAAsB,4BAAA;AAAA,MAC1B,GAAA;AAAA,MACA,OAAA;AAAA,MACA,GAAA;AAAA,MACA,WAAA;AAAA,MACA,cAAA;AAAA,MACA,kBAAA;AAAA,MACA,0BAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,IAAI,mBAAA,EAAqB;AACvB,MAAA,OAAO,mBAAA;AAAA,IACT;AAAA,EACF;AAGA,EAAA,MAAM,OAAO,kCAAA,CAAmC;AAAA,IAC9C,GAAA;AAAA,IACA,2BAAA,EAA6B,sCAAA;AAAA,IAC7B,GAAA;AAAA,IACA,OAAA;AAAA,IACA,cAAA;AAAA,IACA,sBAAA;AAAA,IACA,kBAAA;AAAA,IACA,cAAA,EAAgB;AAAA,GACjB,CAAA;AAGD,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,MAAME,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;;;ACl1CO,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,IAAM,qCAAqB,IAAI,GAAA,CAAI,CAAC,IAAA,EAAM,MAAA,EAAQ,MAAM,CAAC,CAAA;AACzD,IAAM,kBAAA,uBAAyB,GAAA,CAAI,CAAC,MAAM,MAAA,EAAQ,QAAA,EAAU,MAAA,EAAQ,MAAM,CAAC,CAAA;AAM3E,SAASC,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,UAAU,kBAAkB,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,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,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,UAAU,kBAAkB,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,IAAI,GAAG,CAAA,KAAM,YAAY,GAAA,CAAI,GAAG,IAAI,cAAA,EAAgB;AAC7D,MAAA,MAAM,IAAI,eAAA;AAAA,QACR,+BAA+B,MAAA,CAAO,GAAA,CAAI,GAAG,CAAC,CAAC,wBAAwB,cAAc,CAAA,CAAA;AAAA,QACrF;AAAA,UACE,MAAA,EAAQ;AAAA,YACN;AAAA,cACE,IAAA,EAAM,QAAA;AAAA,cACN,SAAS,CAAA,eAAA,EAAkB,MAAA,CAAO,GAAA,CAAI,GAAG,CAAC,CAAC,CAAA,iBAAA;AAAA;AAC7C;AACF,SACF;AAAA,QACA;AAAA,UACE,UAAA,EAAY,CAAA,2FAAA;AAAA;AACd,OACF;AAAA,IACF;AAEA,IAAA,IAAI,IAAI,GAAG,CAAA,KAAM,OAAO,GAAA,CAAI,GAAG,MAAM,GAAA,EAAK;AACxC,MAAA,MAAM,IAAI,eAAA;AAAA,QACR,CAAA,0BAAA,EAA6B,MAAA,CAAO,GAAA,CAAI,GAAG,CAAC,CAAC,CAAA,CAAA;AAAA,QAC7C;AAAA,UACE,MAAA,EAAQ;AAAA,YACN;AAAA,cACE,IAAA,EAAM,QAAA;AAAA,cACN,OAAA,EAAS,CAAA,iDAAA;AAAA;AACX;AACF;AACF,OACF;AAAA,IACF;AAEA,IAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAC,CAAA,IAAK,CAAC,KAAA,CAAM,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAC,CAAA,EAAG;AAC9D,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,IAAI,MAAM,CAAA,CAAE,WAAW,GAAA,CAAI,MAAM,EAAE,MAAA,EAAQ;AAC7C,MAAA,MAAM,IAAI,gBAAgB,8BAAA,EAAgC;AAAA,QACxD,MAAA,EAAQ;AAAA,UACN;AAAA,YACE,IAAA,EAAM,QAAA;AAAA,YACN,OAAA,EAAS,CAAA,MAAA,EAAS,GAAA,CAAI,MAAM,CAAA,CAAE,MAAM,CAAA,YAAA,EAAe,GAAA,CAAI,MAAM,CAAA,CAAE,MAAM,CAAA,uBAAA;AAAA;AACvE;AACF,OACD,CAAA;AAAA,IACH;AAEA,IAAA,OAAO;AAAA,MACL,CAAA,EAAG,IAAI,GAAG,CAAA;AAAA,MACV,CAAA,EAAG,IAAI,GAAG,CAAA;AAAA,MACV,IAAA,EAAM,IAAI,MAAM,CAAA;AAAA,MAChB,IAAA,EAAM,IAAI,MAAM;AAAA,KAClB;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;;;AC5MO,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,cAAA,CAAe,OAAA,CAAQ,MAAM,CAAC,CAAA;AAC3C,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,cAAA,CAAe,OAAA,CAAQ,KAAK,CAAC,CAAA;AACjD,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,cAAA,CAAe,aAAA,CAAc,CAAC,CAAC,CAAC,CAAA;AAAA,IACpD,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,cAAA,CAAe,YAAA,CAAa,CAAC,CAAC,CAAA,GAC9B,EAAE,MAAA,EAAQ,IAAA,EAAM,YAAY,YAAA,EAAa;AAE7C,EAAA,OAAO;AAAA,IACL,WAAA;AAAA,IACA;AAAA,GACF;AACF;AAKA,SAAS,sBAAA,CACPT,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,cAAA,CAAe,WAAA,CAAY,CAAC,CAAC,CAAA;AAC9C,IAAA,MAAM,OAAA,GAAU,cAAA,CAAe,WAAA,CAAY,EAAA,CAAG,EAAE,CAAC,CAAA;AAGjD,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,CAAA,CAAE,KAAA,EAAO,EAAE,KAAK,CAAA;AACpD,IAAA,IAAI,YAAA,KAAiB,GAAG,OAAO,YAAA;AAC/B,IAAA,OAAO,cAAA,CAAe,CAAA,CAAE,KAAA,EAAO,CAAA,CAAE,KAAK,CAAA;AAAA,EACxC,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;;;ACvYO,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,MAAWU,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,MAAWV,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,CAAA,CAAE,KAAA,EAAO,CAAA,CAAE,KAAK,CAAC,CAAA;AAClE;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,MAAM,CAAA,GAAI,kBAAA,CAAmB,MAAM,CAAA,EAAG,IAAA,CAAK,KAAK,CAAA,KAAA,CAAO,CAAA;AAAA,EAC9D;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;;;AC/UA,SAAS,uBAAuB,QAAA,EAAqC;AACnE,EAAA,OAAO,SAAS,MAAA,CAAO,IAAA;AAAA,IACrB,CAAC,SAAA,KACC,gBAAA,CAAiB,SAAS,CAAA,IAC1B,UAAU,IAAA,KAAS;AAAA,GACvB;AACF;AAUA,SAAS,gCAAgC,GAAA,EAAwB;AAC/D,EAAA,OAAO,GAAA,CAAI,YAAA,CAAa,IAAA,KAAS,SAAA,IAAa,IAAI,YAAA,KAAiB,MAAA;AACrE;AAGO,SAAS,kCACd,KAAA,EACS;AACT,EAAA,IAAI,YAAY,KAAA,EAAO;AACrB,IAAA,OACE,kCAAkC,KAAA,CAAM,IAAI,CAAA,IAC5C,iCAAA,CAAkC,MAAM,KAAK,CAAA;AAAA,EAEjD;AACA,EAAA,OAAO,gCAAgC,KAAK,CAAA;AAC9C;AAmCO,SAAS,yBACd,IAAA,EAC8B;AAC9B,EAAA,MAAM,EAAE,SAAQ,GAAI,IAAA;AACpB,EAAA,IAAI,OAAA,EAAS,UAAA,KAAe,MAAA,EAAW,OAAO,MAAA;AAE9C,EAAA,MAAM,QAAA,GAAW,KAAK,OAAA,EAAQ;AAK9B,EAAA,IAAI,CAAC,eAAA,CAAgB,QAAQ,CAAA,EAAG,OAAO,MAAA;AAEvC,EAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,UAAA,CAAW,QAAQ,CAAA;AAC5C,EAAA,IAAI,IAAA,CAAK,gBAAA,IAAoB,CAAC,sBAAA,CAAuB,QAAQ,CAAA,EAAG;AAC9D,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,OAAO,QAAA;AACT;AASO,SAAS,kBAAA,CACd,GAAA,EACA,OAAA,EACA,cAAA,EACA,OAAA,EAC8B;AAC9B,EAAA,OAAO,wBAAA,CAAyB;AAAA,IAC9B,OAAA,EAAS,MACP,YAAA,CAAa,GAAA,EAAK,OAAA,EAAS;AAAA,MACzB,GAAG,cAAA;AAAA,MACH,WAAA,EAAa;AAAA,KACd,CAAA;AAAA,IACH,OAAA;AAAA,IACA,gBAAA,EAAkB,gCAAgC,GAAG;AAAA,GACtD,CAAA;AACH;AAaO,SAAS,kBAAA,CACd,MAAA,EACA,QAAA,EACA,OAAA,EACW;AACX,EAAA,IAAI,WAAA;AACJ,EAAA,OAAO,MAAA,CAAO,GAAA,CAAI,CAAC,SAAA,KAAc;AAC/B,IAAA,IAAI,CAAC,gBAAA,CAAiB,SAAS,CAAA,EAAG,OAAO,SAAA;AAEzC,IAAA,MAAM,OAAO,SAAA,CAAU,IAAA;AACvB,IAAA,IAAI,SAAS,gCAAA,EAAkC;AAC7C,MAAA,WAAA,KAAgB,MAAA,EAAO;AACvB,MAAA,OAAO,WAAA;AAAA,IACT;AAEA,IAAA,MAAM,KAAA,GAAQ,SAAS,IAAI,CAAA;AAC3B,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,MAAM,IAAI,kBAAA,CAAmB,CAAA,+BAAA,EAAkC,IAAI,CAAA,CAAA,CAAA,EAAK;AAAA,QACtE,aAAA,EAAe;AAAA,OAChB,CAAA;AAAA,IACH;AACA,IAAA,OAAO,YAAA,CAAa,OAAO,OAAO,CAAA;AAAA,EACpC,CAAC,CAAA;AACH;;;ACrIA,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;AAqCO,IAAM,gBAAN,MAAuB;AAAA,EACnB,IAAA;AAAA,EACA,eAAA;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;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,cAAA,uBAAqB,GAAA,EAA4C;AAAA,EAE1E,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,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;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,UAAU,GAAA,EAA6C;AACrD,IAAA,IAAI,IAAA,CAAK,eAAe,GAAA,CAAI,GAAG,GAAG,OAAO,IAAA,CAAK,cAAA,CAAe,GAAA,CAAI,GAAG,CAAA;AACpE,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,cAAA,CAAe,GAAG,CAAA;AACxC,IAAA,IAAA,CAAK,cAAA,CAAe,GAAA,CAAI,GAAA,EAAK,QAAQ,CAAA;AACrC,IAAA,OAAO,QAAA;AAAA,EACT;AAAA,EAEA,eAAe,GAAA,EAA6C;AAC1D,IAAA,OAAO,kBAAA;AAAA,MACL,GAAA;AAAA,MACA,IAAA,CAAK,QAAA;AAAA,MACL,IAAA,CAAK,eAAA;AAAA,MACL,IAAA,CAAK;AAAA,KACP;AAAA,EACF;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,OAAO,IAAA,CAAK,YAAA,CAAa,IAAA,CAAK,IAAA,EAAM,QAAQ,CAAA;AAAA,EAC9C;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,OAAO,IAAA,CAAK,YAAA,CAAa,IAAA,CAAK,eAAA,EAAiB,QAAQ,CAAA;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,YAAA,CACJ,GAAA,EACA,QAAA,EAC6C;AAC7C,IAAA,MAAM,UAAA,GAAa,KAAK,QAAA,CAAS,UAAA;AACjC,IAAA,MAAM,WAAW,UAAA,KAAe,MAAA,GAAY,MAAA,GAAY,IAAA,CAAK,UAAU,GAAG,CAAA;AAC1E,IAAA,IAAI,QAAA,KAAa,MAAA,IAAa,UAAA,KAAe,MAAA,EAAW;AACtD,MAAA,MAAM,MAAA,GAAS,kBAAA;AAAA,QACb,QAAA,CAAS,MAAA;AAAA,QACT,QAAA;AAAA,QACA,IAAA,CAAK;AAAA,OACP;AACA,MAAA,MAAMW,WAAU,MAAM,UAAA;AAAA,QACpB,QAAA,CAAS,GAAA;AAAA,QACT;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,GAAA,EAAK,QAAQ,CAAA;AACtD,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,MAAW,SAAA,IAAa,IAAI,UAAA,EAAY;AACtC,IAAA,sCAAA;AAAA,MACE,SAAA,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,MAAW,SAAA,IAAa,WAAW,UAAA,EAAY;AAC7C,QAAA,sCAAA;AAAA,UACE,SAAA;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;;;AClmBA,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,EAAO,SAAS,CAAA,IAAK,UAAA,CAAW,SAAQ,EAAG;AACrD,IAAA,oCAAA;AAAA,MACE,SAAA,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,EAAO,SAAS,CAAA,IAAK,UAAA,CAAW,SAAQ,EAAG;AACrD,IAAA,oCAAA;AAAA,MACE,SAAA,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,KAAA,CAAM,YAAA,KAAiB,MAAA,IAAa;AAAA,MACtC,cAAc,KAAA,CAAM;AAAA,KACtB;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,gBAAA,CAAiB,MAAA,GAAS,CAAA,IAAK;AAAA,MACvC,kBAAkB,KAAA,CAAM;AAAA,KAC1B;AAAA,IACA,GAAI,KAAA,CAAM,MAAA,KAAW,UAAa,EAAE,MAAA,EAAQ,MAAM,MAAA;AAAO,GAC3D;AACF;;;ACzCA,IAAM,QAAA,uBAAe,OAAA,EAAyD;AAEvE,SAAS,mCAAA,CACd,QACA,OAAA,EACM;AACN,EAAA,IACE,OAAA,CAAQ,mBAAA,KAAwB,MAAA,IAChC,OAAA,CAAQ,qBAAqB,MAAA,EAC7B;AACA,IAAA;AAAA,EACF;AACA,EAAA,QAAA,CAAS,GAAA,CAAI,QAAQ,OAAO,CAAA;AAC9B;AAEO,SAAS,+BACd,MAAA,EAC6B;AAC7B,EAAA,OAAO,QAAA,CAAS,GAAA,CAAI,MAAM,CAAA,IAAK,EAAC;AAClC;;;ACnBO,SAAS,oBACd,MAAA,EACqB;AACrB,EAAA,MAAM,gBAAA,GAAmB,OAAO,OAAA,EAAS,gBAAA;AACzC,EAAA,MAAM,cAAA,GAAiB,OAAO,OAAA,EAAS,cAAA;AACvC,EAAA,MAAM,EAAE,mBAAA,EAAoB,GAAI,8BAAA,CAA+B,MAAM,CAAA;AACrE,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,GACvB,EAAC,GACD;AAAA,MACE,gBAAA;AAAA,MACA,iBAAA,EAAmB,sBAAA,CAAuB,MAAA,CAAO,QAAQ;AAAA,KAC3D;AAAA,IACF,GAAI,cAAA,KAAmB,MAAA,GACrB,EAAC,GACD,EAAE,cAAA,EAAgB,WAAA,EAAa,gBAAA,CAAiB,MAAA,CAAO,QAAQ,CAAA,EAAE;AAAA,IACnE,GAAI,mBAAA,KAAwB,MAAA,GAAY,EAAC,GAAI,EAAE,mBAAA;AAAoB,GACrE;AACF;AAQA,IAAM,gBAAA,uBAAuB,OAAA,EAAqC;AAWlE,IAAM,sBAAA,uBAA6B,OAAA,EAGjC;AAEF,SAAS,uBACP,QAAA,EAC6B;AAC7B,EAAA,MAAM,MAAA,GAAS,sBAAA,CAAuB,GAAA,CAAI,QAAQ,CAAA;AAClD,EAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AAEjC,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAoB;AAC1C,EAAA,KAAA,MAAW,CAAC,QAAA,EAAU,QAAQ,CAAA,IAAK,SAAS,SAAA,EAAW;AACrD,IAAA,MAAM,QAAA,GAAW,+BAAA,CAAgC,QAAA,CAAS,MAAM,CAAA;AAChE,IAAA,IAAI,QAAA,KAAa,MAAA,EAAW,SAAA,CAAU,GAAA,CAAI,UAAU,QAAQ,CAAA;AAAA,EAC9D;AACA,EAAA,sBAAA,CAAuB,GAAA,CAAI,UAAU,SAAS,CAAA;AAC9C,EAAA,OAAO,SAAA;AACT;AASA,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;;;AC/BA,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,gCAAA,GACgE,YAAA;AAAA,EAChE,mCAAA,GACgE,YAAA;AAAA;AAAA;AAAA;AAAA,EAIhE,UAAA;AAAA,EACA,6BAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,aAAA,GACE,YAAA;AAAA,EACF,kBAAA,GACE,YAAA;AAAA,EAEF,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,OAAQ,KAAK,UAAA,KAAe,aAAA,CAAc,IAAA,CAAK,OAAA,EAAS,KAAK,MAAM,CAAA;AAAA,EACrE;AAAA;AAAA,EAGA,uBAAA,GAAmC;AACjC,IAAA,OAAQ,KAAK,6BAAA,KAAkC,sBAAA;AAAA,MAC7C,KAAK,KAAA;AAAM,KACb;AAAA,EACF;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,GAA6B;AAI3B,IAAA,MAAM,GAAA,GAAM,KAAK,KAAA,EAAM;AACvB,IAAA,OAAO,aAAa,GAAA,EAAK,IAAA,CAAK,QAAQ,OAAA,EAAS,IAAA,CAAK,iBAAiB,CAAA;AAAA,EACvE;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,EA6BA,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,KAAK,KAAA,EAAM;AAG3B,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;AAMvB,IAAA,MAAM,cAAA,GAAiB,KAAK,eAAA,EAAgB;AAC5C,IAAA,YAAA,CAAa,GAAA,EAAK,IAAA,CAAK,OAAA,CAAQ,OAAA,EAAS,cAAc,CAAA;AACtD,IAAA,YAAA,CAAa,cAAA,EAAgB,IAAA,CAAK,OAAA,CAAQ,OAAA,EAAS,cAAc,CAAA;AAEjE,IAAA,OAAO,IAAI,aAAA,CAAc;AAAA,MACvB,GAAA;AAAA,MACA,cAAA;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,EAEA,iBAAA,CACE,OAAA,EACA,OAAA,EACA,OAAA,EACY;AACZ,IAAA,IAAI,IAAA,CAAK,MAAA,CAAO,YAAA,KAAiB,MAAA,EAAW,OAAO,OAAA;AACnD,IAAA,OAAO,kCAAkC,OAAA,EAAS;AAAA,MAChD,SAAS,OAAA,CAAQ,OAAA;AAAA,MACjB;AAAA,KACD,CAAA;AAAA,EACH;AAAA,EAEA,QAAA,GAAuB;AACrB,IAAA,OAAO,IAAA,CAAK,QAAQ,OAAA,IAAW,QAAA;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,YAAA,CACE,KACA,IAAA,EAC8B;AAC9B,IAAA,MAAM,MAAA,GACJ,IAAA,KAAS,MAAA,GAAS,IAAA,CAAK,gBAAgB,IAAA,CAAK,kBAAA;AAC9C,IAAA,IAAI,MAAA,KAAW,cAAc,OAAO,MAAA;AACpC,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,cAAA,CAAe,GAAG,CAAA;AACrC,IAAA,IAAI,IAAA,KAAS,MAAA,EAAQ,IAAA,CAAK,aAAA,GAAgB,KAAA;AAAA,cAChC,kBAAA,GAAqB,KAAA;AAC/B,IAAA,OAAO,KAAA;AAAA,EACT;AAAA,EAEA,eAAe,GAAA,EAA6C;AAC1D,IAAA,OAAO,kBAAA;AAAA,MACL,GAAA;AAAA,MACA,KAAK,OAAA,CAAQ,OAAA;AAAA,MACb,KAAK,eAAA,EAAgB;AAAA,MACrB,KAAK,OAAA,CAAQ;AAAA,KACf;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,UAAA,CACJ,OAAA,EACA,GAAA,EACA,MACA,OAAA,EAC6C;AAC7C,IAAA,MAAM,aAAa,OAAA,CAAQ,UAAA;AAC3B,IAAA,MAAM,WACJ,UAAA,KAAe,MAAA,GAAY,SAAY,IAAA,CAAK,YAAA,CAAa,KAAK,IAAI,CAAA;AACpE,IAAA,MAAM,OAAA,GAAU,MAAM,IAAA,CAAK,iBAAA;AAAA,MACzB,OAAA;AAAA,MACA,QAAA,KAAa,MAAA,IAAa,UAAA,KAAe,MAAA,GACvC,UAAA;AAAA,QACE,QAAA,CAAS,GAAA;AAAA,QACT,mBAAmB,QAAA,CAAS,MAAA,EAAQ,EAAC,EAAG,IAAA,CAAK,UAAU;AAAA,UAEzD,OAAA,CAAQ,OAAA;AAAA,QACN,aAAa,GAAA,EAAK,IAAA,CAAK,QAAQ,OAAA,EAAS,IAAA,CAAK,iBAAiB;AAAA,OAChE;AAAA,MACF;AAAA,KACF;AACA,IAAA,OAAO,qBAAqB,OAAA,EAAS,IAAA,CAAK,MAAA,EAAQ,IAAA,CAAK,UAAU,CAAA;AAAA,EACnE;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;AACA,IAAA,MAAM,OAAA,GAAU,KAAK,OAAA,CAAQ,OAAA;AAG7B,IAAA,MAAM,GAAA,GAAM,KAAK,KAAA,EAAM;AACvB,IAAA,IAAI,IAAA,CAAK,yBAAwB,EAAG;AAClC,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;AAIA,IAAA,MAAM,OAAO,MAAM,IAAA,CAAK,WAAW,OAAA,EAAS,GAAA,EAAK,QAAQ,gBAAgB,CAAA;AAGzE,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;AACvB,IAAA,MAAM,GAAA,GAAM,KAAK,KAAA,EAAM;AAEvB,IAAA,IAAI,IAAA,CAAK,yBAAwB,EAAG;AAClC,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;AAIA,IAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,UAAA;AAAA,MACtB,OAAA;AAAA,MACA,GAAA;AAAA,MACA,MAAA;AAAA,MACA;AAAA,KACF;AAEA,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;AAKA,IAAA,MAAM,OAAA,GAAU,KAAK,KAAA,EAAM;AAC3B,IAAA,MAAM,YAAA,GAAe,EAAE,GAAG,OAAA,EAAS,eAAA,EAAgB;AAEnD,IAAA,MAAM,OAAA,GAAU,KAAK,eAAA,EAAgB;AACrC,IAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,UAAA;AAAA,MACtB,OAAA;AAAA,MACA,YAAA;AAAA,MACA,WAAA;AAAA,MACA;AAAA,KACF;AAEA,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,OAAO,MAAA;AAAA,MACT;AACA,MAAA,IAAI,iBAAiB,yBAAA,EAA2B;AAC9C,QAAA,IAAA,CAAK,gCAAA,GAAmC,MAAA;AACxC,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;AAIA,IAAA,MAAM,OAAA,GAAU,KAAK,KAAA,EAAM;AAC3B,IAAA,MAAM,YAAA,GAAe,EAAE,GAAG,OAAA,EAAS,eAAA,EAAgB;AAEnD,IAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,UAAA;AAAA,MACtB,OAAA;AAAA,MACA,YAAA;AAAA,MACA,WAAA;AAAA,MACA;AAAA,KACF;AAEA,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,OAAO,MAAA;AAAA,MACT;AACA,MAAA,IAAI,iBAAiB,yBAAA,EAA2B;AAC9C,QAAA,IAAA,CAAK,gCAAA,GAAmC,MAAA;AACxC,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,CAAA,CAAE,KAAA,EAAO,EAAE,KAAK,CAAA;AACpD,MAAA,IAAI,YAAA,KAAiB,GAAG,OAAO,YAAA;AAC/B,MAAA,OAAO,cAAA,CAAe,CAAA,CAAE,KAAA,EAAO,CAAA,CAAE,KAAK,CAAA;AAAA,IACxC,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,cAAA,CAAe,WAAA,CAAY,CAAC,CAAC,CAAA;AAAA,UAC7B,eAAA;AAAA,UACA;AAAA,SACF;AACA,QAAA,UAAA,GAAa,IAAA,CAAK,4BAAA;AAAA,UAChB,cAAA,CAAe,WAAA,CAAY,EAAA,CAAG,CAAA,CAAE,CAAC,CAAA;AAAA,UACjC,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,kBAAA,EAAmB,EAAG;AAC5C,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,MAAA,CAAOA,OAAM,KAAA,EAAO,cAAA,CAAeA,OAAM,IAAA,CAAK,CAAC,CAAC,CAAA,EAAG,IAAI,CAAA;AAC/D,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,MAAA,CAAOA,OAAM,KAAA,EAAO,cAAA,CAAe,SAAS,CAAC,CAAC,GAAG,KAAK,CAAA;AAAA,IAChE;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,kBAAA,IAAsB,SAAS,CAAA;AAAA,EAC5E;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,kBAAA,EAAmB,EAAG;AAC5C,MAAA,MAAM,KAAA,GAAQ,KAAK,KAAA,CAAM,KAAA;AACzB,MAAA,MAAMS,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,YAAY,cAAA,CAAe,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,CAAC,CAAC,CAAA;AACnD,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,cAAA,CAAe,QAAA,CAAS,CAAC,CAAC,CAAA;AAC3C,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,cAAA,CAAe,QAAA,CAAS,KAAK,CAAC,CAAA;AAC9C,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,eAAe,QAAA,CAAS,EAAA,CAAG,EAAE,CAAC,CAAC,CAAA,GAAI,OAAA;AAAA,IAC7C;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;AAAA;AAAA;AAAA,EAeA,kBAAA,GAA2C;AACzC,IAAA,MAAM,OAAA,GAAU,KAAK,MAAA,CAAO,OAAA;AAC5B,IAAA,MAAM,UAAA,GAAa,KAAK,MAAA,CAAO,UAAA;AAC/B,IAAA,MAAM,eAAe,OAAA,CAAQ,IAAA;AAAA,MAC3B,CAAC,IAAA,KACC,IAAA,CAAK,MAAM,KAAA,KAAU,UAAA,IACrB,KAAK,KAAA,CAAM,IAAA,CAAK,WAAW,CAAA,IAC3B,IAAA,CAAK,MAAM,IAAA,CAAK,CAAC,MAAM,IAAA,IACvB,IAAA,CAAK,MAAM,WAAA,KAAgB;AAAA,KAC/B;AACA,IAAA,IAAI,cAAc,OAAO,OAAA;AACzB,IAAA,MAAM,UAAA,GAAwB;AAAA,MAC5B,KAAA,EAAO,EAAE,MAAA,EAAQ,WAAA,EAAa,OAAO,UAAA,EAAY,IAAA,EAAM,CAAC,IAAI,CAAA,EAAE;AAAA,MAC9D,SAAA,EAAW;AAAA,KACb;AACA,IAAA,OAAO,CAAC,GAAG,OAAA,EAAS,UAAU,CAAA;AAAA,EAChC;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,kBAAA,EAAoB,CAAA;AAAA,IAC7D;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,kBAAA,EAAmB;AAAA,MACxB,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,kBAAA,EAAmB;AACtC,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,kBAAA,EAAmB;AAAA,QACxB,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;;;AC5yCA,IAAMK,aAAAA,0BAAsB,cAAc,CAAA;AAiBnC,IAAM,wBAAA,GAAN,MAAM,yBAAA,CAIX;AAAA,EACS,OAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA;AAAA;AAAA;AAAA,EAIT,SAAA,GAAgEA,aAAAA;AAAA,EAEhE,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;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA4BA,OAAA,CACE,GAAA,EACA,SAAA,GAA2B,KAAA,EACc;AACzC,IAAA,MAAM,SAAA,GAAgC,EAAE,UAAA,EAAY,GAAA,EAAK,SAAA,EAAU;AACnE,IAAA,OAAO,IAAI,yBAAA;AAAA,MACT,IAAA,CAAK,OAAA;AAAA,MACL;AAAA,QACE,GAAG,IAAA,CAAK,MAAA;AAAA,QACR,kBAAkB,CAAC,GAAG,IAAA,CAAK,MAAA,CAAO,kBAAkB,SAAS;AAAA,OAC/D;AAAA,MACA,IAAA,CAAK;AAAA,KACP;AAAA,EACF;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,GAA6B;AAI3B,IAAA,MAAM,GAAA,GAAM,KAAK,KAAA,EAAM;AACvB,IAAA,OAAO,aAAa,GAAA,EAAK,IAAA,CAAK,QAAQ,OAAA,EAAS,IAAA,CAAK,iBAAiB,CAAA;AAAA,EACvE;AAAA,EAEA,eAAA,GAAuC;AACrC,IAAA,OAAO,mBAAA,CAAoB,KAAK,OAAO,CAAA;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,iBAAiB,GAAA,EAA6C;AAC5D,IAAA,IAAI,IAAA,CAAK,SAAA,KAAcA,aAAAA,EAAc,OAAO,IAAA,CAAK,SAAA;AACjD,IAAA,IAAA,CAAK,SAAA,GAAY,kBAAA;AAAA,MACf,GAAA;AAAA,MACA,KAAK,OAAA,CAAQ,OAAA;AAAA,MACb,KAAK,eAAA,EAAgB;AAAA,MACrB,KAAK,OAAA,CAAQ;AAAA,KACf;AACA,IAAA,OAAO,IAAA,CAAK,SAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,OAAA,GAAkD;AACtD,IAAA,MAAM,OAAA,GAAU,KAAK,OAAA,CAAQ,OAAA;AAC7B,IAAA,IAAI,CAAC,OAAA,EAAS;AACZ,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OAEF;AAAA,IACF;AAEA,IAAA,MAAM,GAAA,GAAM,KAAK,KAAA,EAAM;AAIvB,IAAA,IAAI,sBAAA,CAAuB,GAAG,CAAA,EAAG;AAC/B,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OACF;AAAA,IACF;AAEA,IAAA,MAAM,aAAa,OAAA,CAAQ,UAAA;AAC3B,IAAA,MAAM,WACJ,UAAA,KAAe,MAAA,GAAY,MAAA,GAAY,IAAA,CAAK,iBAAiB,GAAG,CAAA;AAClE,IAAA,MAAM,IAAA,GACJ,QAAA,KAAa,MAAA,IAAa,UAAA,KAAe,SACvC,MAAM,UAAA;AAAA,MACJ,QAAA,CAAS,GAAA;AAAA,MACT,kBAAA;AAAA,QACE,QAAA,CAAS,MAAA;AAAA,QACT,EAAC;AAAA,QACD,IAAA,CAAK,QAAQ,OAAA,IAAW;AAAA;AAC1B,KACF,GACA,MAAM,OAAA,CAAQ,OAAA;AAAA,MACZ,aAAa,GAAA,EAAK,IAAA,CAAK,QAAQ,OAAA,EAAS,IAAA,CAAK,iBAAiB;AAAA,KAChE;AAEJ,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,MAAMd,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;;;AC1JA,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;;;ACtHA,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,gBAAgBe,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,CAYX;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,EAaA;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,MAaT,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,EAaA;AACA,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,mBAAA,CAAoB,KAAK,CAAA;AAC/C,IAAA,MAAM,SAAA,GAAY,iBAAA;AAAA,MAChB;AAAA,KACF;AAEA,IAAA,MAAM,YAAA,GAA8B;AAAA,MAClC,WAAA,EAAa,KAAA;AAAA,MACb,UAAA,EAAY,MAAA;AAAA,MACZ,YAAY,SAAA,CAAU;AAAA,KACxB;AAEA,IAAA,OAAO,IAAI,iBAAA;AAAA,MAaT,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,EAoCA,EAAA,CACE,IAAA,EACA,KAAA,EACA,OAAA,EAOA;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,EAOrD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAA,CACE,IAAA,EACA,KAAA,EACA,OAAA,EAOA;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,EAOrD;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;;;AC5jBA,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;AAwBO,IAAM,YAAA,GAAN,MAAM,aAAA,CAMX;AAAA,EACS,OAAA;AAAA,EACA,MAAA;AAAA,EACA,QAAA;AAAA,EAQT,WAAA,CAAY,QAA4B,KAAA,EAA0B;AAChE,IAAA,IAAA,CAAK,OAAA,GAAU,MAAA;AACf,IAAA,IAAA,CAAK,MAAA,GAAS,KAAA;AACd,IAAA,IAAA,CAAK,YAAY,CAAC,IAAA,EAAM,SACtB,IAAA,CAAK,YAAA,CAAa,MAAM,IAAI,CAAA,CAAA;AAAA,EAOhC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,YAAA,CACE,MACA,IAAA,EACiE;AACjE,IAAA,MAAM,EAAE,gBAAA,EAAiB,GAAI,8BAAA,CAA+B,KAAK,OAAO,CAAA;AACxE,IAAA,IAAI,qBAAqB,MAAA,EAAW;AAClC,MAAA,MAAMC,WAAAA,GAAa,gBAAA;AACnB,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,EAgCA,IAAA,CACE,IAAA,EACA,KAAA,EACA,OAAA,EAOA;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,EAOA;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,EAC0E;AAC1E,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,mBAAA,CAAoB,KAAK,CAAA;AAC/C,IAAA,MAAM,SAAA,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,YAAY,SAAA,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,EAG0E;AAC1E,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,mBAAA,CAAoB,KAAK,CAAA;AAC/C,IAAA,MAAM,SAAA,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,YAAY,SAAA,CAAU;AAAA;AACxB;AACF,KACF;AAEA,IAAA,OAAO,IAAI,aAAA,CAAa,IAAA,CAAK,OAAA,EAAS,QAAQ,CAAA;AAAA,EAChD;AAAA,EAiEA,QAAA,CACE,QAAA,EACA,SAAA,EACA,OAAA,EAiBA;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,MAaT,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,EAiBA;AACA,IAAA,OAAO,IAAA,CAAK,sBAAA,CAAuB,QAAA,EAAU,SAAA,EAAW,OAAO,OAAO,CAAA;AAAA,EACxE;AAAA,EAyDA,gBAAA,CACE,QAAA,EACA,SAAA,EACA,OAAA,EAiBA;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,MAaT,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,EAiBA;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,EAmBA;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,MAaT,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,EACAjB,MAAAA,EACA,SAAA,GAA2B,KAAA,EAC+C;AAC1E,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,MACE,CAAA,EAC0E;AAC1E,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,OACE,CAAA,EAC0E;AAC1E,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,EASA,OAAA,CACE,OACAA,MAAAA,EAC0E;AAC1E,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,EAC0E;AAC1E,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,OACE,SAAA,EAC0E;AAC1E,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,EAyBA,SACE,OAAA,EAC0E;AAC1E,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,EAqBA;AACA,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;;;AC/0CA,SAAS,gBAAA,CACP,OAAA,EACA,YAAA,EACA,OAAA,EACA,OAAA,EACY;AACZ,EAAA,IAAI,YAAA,KAAiB,QAAW,OAAO,OAAA;AACvC,EAAA,OAAO,kCAAkC,OAAA,EAAS;AAAA,IAChD,SAAS,OAAA,CAAQ,OAAA;AAAA,IACjB;AAAA,GACD,CAAA;AACH;AAEA,SAAS,+BACP,KAAA,EACoB;AACpB,EAAA,IAAI,YAAY,KAAA,EAAO;AACrB,IAAA,OACE,+BAA+B,KAAA,CAAM,IAAI,CAAA,IACzC,8BAAA,CAA+B,MAAM,KAAK,CAAA;AAAA,EAE9C;AACA,EAAA,OAAO,KAAA,CAAM,YAAA;AACf;AAiCA,IAAMc,aAAAA,0BAAsB,cAAc,CAAA;AAEnC,IAAM,cAAA,GAAN,MAAM,eAAA,CAAsC;AAAA,EACxC,OAAA;AAAA,EACA,MAAA;AAAA;AAAA;AAAA;AAAA,EAIT,SAAA,GAAgEA,aAAAA;AAAA,EAEhE,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,GAA6B;AAI3B,IAAA,OAAOR,oBAAAA;AAAA,MACL,KAAK,KAAA,EAAM;AAAA,MACX,KAAK,OAAA,CAAQ,OAAA;AAAA,MACb,KAAK,eAAA;AAAgB,KACvB;AAAA,EACF;AAAA,EAEA,eAAA,GAAuC;AACrC,IAAA,OAAO,mBAAA,CAAoB,KAAK,OAAO,CAAA;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,iBAAiB,GAAA,EAAiD;AAChE,IAAA,IAAI,IAAA,CAAK,SAAA,KAAcQ,aAAAA,EAAc,OAAO,IAAA,CAAK,SAAA;AACjD,IAAA,IAAA,CAAK,YAAY,wBAAA,CAAyB;AAAA,MACxC,SAAS,MACPR,oBAAAA,CAAoB,GAAA,EAAK,IAAA,CAAK,QAAQ,OAAA,EAAS;AAAA,QAC7C,GAAG,KAAK,eAAA,EAAgB;AAAA,QACxB,WAAA,EAAa;AAAA,OACd,CAAA;AAAA,MACH,OAAA,EAAS,KAAK,OAAA,CAAQ,OAAA;AAAA,MACtB,gBAAA,EAAkB,kCAAkC,GAAG;AAAA,KACxD,CAAA;AACD,IAAA,OAAO,IAAA,CAAK,SAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,UAAA,CACJ,OAAA,EACA,GAAA,EACA,OAAA,EAC6C;AAC7C,IAAA,MAAM,aAAa,OAAA,CAAQ,UAAA;AAC3B,IAAA,MAAM,WACJ,UAAA,KAAe,MAAA,GAAY,MAAA,GAAY,IAAA,CAAK,iBAAiB,GAAG,CAAA;AAClE,IAAA,OAAO,gBAAA;AAAA,MACL,OAAA;AAAA,MACA,+BAA+B,GAAG,CAAA;AAAA,MAClC,QAAA,KAAa,MAAA,IAAa,UAAA,KAAe,MAAA,GACvC,UAAA;AAAA,QACE,QAAA,CAAS,GAAA;AAAA,QACT,kBAAA;AAAA,UACE,QAAA,CAAS,MAAA;AAAA,UACT,EAAC;AAAA,UACD,IAAA,CAAK,QAAQ,OAAA,IAAW;AAAA;AAC1B,UAEF,OAAA,CAAQ,OAAA;AAAA,QACNA,oBAAAA;AAAA,UACE,GAAA;AAAA,UACA,KAAK,OAAA,CAAQ,OAAA;AAAA,UACb,KAAK,eAAA;AAAgB;AACvB,OACF;AAAA,MACF;AAAA,KACF;AAAA,EACF;AAAA;AAAA,EAGA,SAAS,IAAA,EAAwD;AAC/D,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;AACA,IAAA,OAAO,IAAA;AAAA,EACT;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;AACA,IAAA,MAAM,OAAA,GAAU,KAAK,OAAA,CAAQ,OAAA;AAE7B,IAAA,MAAM,GAAA,GAAM,KAAK,KAAA,EAAM;AACvB,IAAA,IAAI,qCAAA,CAAsC,GAAG,CAAA,EAAG;AAC9C,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OACF;AAAA,IACF;AAEA,IAAA,OAAO,IAAA,CAAK,SAAS,MAAM,IAAA,CAAK,WAAW,OAAA,EAAS,GAAA,EAAK,gBAAgB,CAAC,CAAA;AAAA,EAC5E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,UACJ,OAAA,EACuB;AACvB,IAAA,MAAM,GAAA,GAAM,KAAK,KAAA,EAAM;AACvB,IAAA,IAAI,qCAAA,CAAsC,GAAG,CAAA,EAAG;AAC9C,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OACF;AAAA,IACF;AAEA,IAAA,OAAO,IAAA,CAAK,QAAA;AAAA,MACV,MAAM,IAAA,CAAK,UAAA,CAAW,OAAA,EAAS,KAAK,sBAAsB;AAAA,KAC5D;AAAA,EACF;AACF;;;AC1UO,SAAS,KAAA,CAAM,OAAeN,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;;;ACtJA,SAAS,iBASP,EAAA,EAiBA;AACA,EAAA,OAAO,EAAA;AACT;AAEO,SAAS,cAAA,GAyBd;AACA,EAAA,OAAO,gBAAA;AACT;AA+FO,SAAS,oBAAoB,SAAA,EAAwC;AAC1E,EAAA,OAAO,CAAC,OAAA,KAAqB;AAC3B,IAAA,IAAI,MAAA,GAAS,OAAA;AACb,IAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,MAAA,MAAA,GAAU,SAA4B,MAAM,CAAA;AAAA,IAC9C;AACA,IAAA,OAAO,MAAA;AAAA,EACT,CAAA;AACF;AAcO,SAAS,eAAA,CACd,KAAA,EACAA,MAAAA,EACA,SAAA,GAA4B,KAAA,EACF;AAC1B,EAAA,OAAO,CAAC,OAAA,KAAY,OAAA,CAAQ,OAAA,CAAQ,KAAA,EAAOA,QAAO,SAAS,CAAA;AAC7D;AAUO,SAAS,cACd,CAAA,EAC0B;AAC1B,EAAA,OAAO,CAAC,OAAA,KAAY,OAAA,CAAQ,KAAA,CAAM,CAAC,CAAA;AACrC;AAUO,SAAS,eACd,CAAA,EAC0B;AAC1B,EAAA,OAAO,CAAC,OAAA,KAAY,OAAA,CAAQ,MAAA,CAAO,CAAC,CAAA;AACtC;;;ACpXA,oBAAA,CAAqB,YAAY,CAAA;AACjC,sBAAA,CAAuB,cAAc,CAAA;;;AC+G9B,SAAS,kBAAA,CACd,OAAA,EACA,QAAA,EACA,OAAA,EACwB;AACxB,EAAA,OAAO,6BAAA,CAAiC,OAAA,EAAS,QAAA,EAAU,OAAO,CAAA;AACpE;AAEO,SAAS,0BAAA,CAId,OAAA,EACA,QAAA,EACA,OAAA,EACyC;AACzC,EAAA,OAAO,6BAAA;AAAA,IACL,OAAA;AAAA,IACA,QAAA;AAAA,IACA;AAAA,GACF;AACF;AAEA,SAAS,6BAAA,CAIP,OAAA,EACA,QAAA,EACA,OAAA,EACyC;AACzC,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;AAAO,GAChE;AACA,EAAA,mCAAA,CAAoC,MAAA,EAAQ;AAAA,IAC1C,GAAI,OAAA,EAAS,mBAAA,KAAwB,MAAA,IAAa;AAAA,MAChD,qBAAqB,OAAA,CAAQ;AAAA,KAC/B;AAAA,IACA,GAAI,OAAA,EAAS,gBAAA,KAAqB,MAAA,IAAa;AAAA,MAC7C,kBAAkB,OAAA,CAAQ;AAAA;AAC5B,GACD,CAAA;AAID,EAAA,MAAM,MAAA,GAAS,SAAS,gBAAA,EAAkB,KAAA;AAC1C,EAAA,MAAM,QAAA,GAAW,SAAS,gBAAA,EAAkB,QAAA;AAE5C,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,kBAAkB,EAAC;AAAA,IACnB,KAAA,EAAO,MAAA;AAAA,IACP,MAAA,EAAQ,MAAA;AAAA,IACR,YAAA,EAAc,QAAQ,IAAA,IAAQ,SAAA;AAAA,IAC9B,MAAM,MAAA,EAAQ,IAAA;AAAA,IACd,cAAc,QAAA,EAAU,IAAA;AAAA,IACxB,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;AAI9C;;;ACzLA,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,gBAAA,CAAiB,IAAI,KAAK,CAAA;AAAA,IACrC,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;;;ACnEA,IAAM,sBAAA,GAAyB,KAAA;AAe/B,SAAS,mBAAA,CACP,GAAA,EACA,QAAA,EACA,KAAA,EACyB;AACzB,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,MAAA;AAChC,EAAA,IAAI,GAAA,CAAI,gBAAgB,MAAA,EAAW;AACjC,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,8DAAA;AAAA,MACA,EAAE,UAAA,EAAY,QAAA,EAAU,OAAA,EAAS,IAAI,OAAA;AAAQ,KAC/C;AAAA,EACF;AACA,EAAA,MAAM,KAAA,GAAQ,GAAA,CACX,WAAA,EAAY,CACZ,IAAA,CAAK,UAAU,sBAAsB,CAAA,CACrC,SAAA,CAAU,sBAAA,EAAwB,KAAK,CAAA;AAC1C,EAAA,MAAM,WAAW,KAAA,CACd,MAAA;AAAA,IACC,CAAC,OAAA,KAAqC,OAAA,CAAQ,sBAAsB;AAAA,IAErE,OAAA,EAAQ;AACX,EAAA,OAAO,GAAA,CAAA,OAAA,EAAa,IAAI,GAAA,CAAI,CAAA,CAAA,EAAI,sBAAsB,CAAA,IAAA,CAAM,CAAC,qBAAqB,QAAQ,CAAA,yBAAA,CAAA;AAC5F;AAMA,SAAS,kBAAA,CACP,GAAA,EACA,QAAA,EACA,iBAAA,EACmB;AACnB,EAAA,IAAI,iBAAA,KAAsB,IAAA,EAAM,OAAO,CAAC,QAAQ,CAAA;AAChD,EAAA,IAAI,GAAA,CAAI,gBAAgB,MAAA,EAAW;AACjC,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,8DAAA;AAAA,MACA,EAAE,UAAA,EAAY,QAAA,EAAU,OAAA,EAAS,IAAI,OAAA;AAAQ,KAC/C;AAAA,EACF;AACA,EAAA,OAAO,GAAA,CAAI,QAAA,CAAS,gBAAA,CAAiB,QAAQ,CAAA;AAC/C;AAEA,SAAS,kBAAA,CAAmB,QAA4B,KAAA,EAAqB;AAC3E,EAAA,IAAI,WAAW,MAAA,EAAW;AAC1B,EAAA,IAAI,CAAC,MAAA,CAAO,SAAA,CAAU,MAAM,CAAA,IAAK,SAAS,CAAA,EAAG;AAC3C,IAAA,MAAM,IAAI,UAAA;AAAA,MACR,CAAA,EAAG,KAAK,CAAA,sCAAA,EAAyC,MAAM,CAAA;AAAA,KACzD;AAAA,EACF;AACF;AAUA,SAAS,yBAAA,CACP,GAAA,EACA,QAAA,EACA,QAAA,EACoB;AACpB,EAAA,IAAI,QAAA,KAAa,QAAW,OAAO,QAAA;AACnC,EAAA,MAAM,QAAA,GAAW,GAAA,CAAI,QAAA,CAAS,WAAA,CAAY,QAAQ,CAAA;AAClD,EAAA,IAAI,QAAA,KAAa,QAAW,OAAO,MAAA;AACnC,EAAA,OAAO,+BAAA,CAAgC,SAAS,MAAM,CAAA;AACxD;AAWA,SAAS,aAAA,CAAc,MAAc,MAAA,EAAwB;AAC3D,EAAA,OAAO,CAAA,EAAG,IAAI,CAAA,EAAA,EAAS,MAAM,CAAA,CAAA;AAC/B;AAQA,SAAS,gBAAgB,MAAA,EAA+B;AACtD,EAAA,OAAO,MAAA,KAAW,QAAA;AACpB;AAMA,eAAe,iBAAA,CACb,OAAA,EACA,OAAA,EACA,IAAA,EAC4B;AAC5B,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAyB;AAC/C,EAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,IAAA,MAAM,MAAM,SAAA,CAAU,GAAA,CAAI,IAAI,IAAI,CAAA,wBAAS,GAAA,EAAY;AACvD,IAAA,GAAA,CAAI,GAAA,CAAI,IAAI,MAAM,CAAA;AAClB,IAAA,SAAA,CAAU,GAAA,CAAI,GAAA,CAAI,IAAA,EAAM,GAAG,CAAA;AAAA,EAC7B;AACA,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAkB;AAClC,EAAA,MAAM,OAAA,CAAQ,GAAA;AAAA,IACZ,CAAC,GAAG,SAAS,CAAA,CAAE,IAAI,OAAO,CAAC,IAAA,EAAM,GAAG,CAAA,KAAM;AACxC,MAAA,MAAM,OAAA,GAAU,MAAM,eAAA,CAAgB,OAAA,EAAS,SAAS,IAAA,EAAM,CAAC,GAAG,GAAG,CAAC,CAAA;AACtE,MAAA,KAAA,MAAW,CAAC,EAAA,EAAI,IAAI,CAAA,IAAK,OAAA,EAAS;AAChC,QAAA,GAAA,CAAI,GAAA,CAAI,aAAA,CAAc,IAAA,EAAM,EAAE,GAAG,IAAI,CAAA;AAAA,MACvC;AAAA,IACF,CAAC;AAAA,GACH;AACA,EAAA,OAAO,GAAA;AACT;AAqBA,SAAS,oBAAA,CACP,GAAA,EACA,QAAA,EACA,SAAA,EACgC;AAChC,EAAA,MAAM,QAAA,GAAW,GAAA,CAAI,QAAA,CAAS,WAAA,CAAY,QAAQ,CAAA;AAClD,EAAA,IAAI,QAAA,KAAa,QAAW,OAAO,MAAA;AACnC,EAAA,MAAM,MAAA,GAAS,kBAAA,CAAmB,QAAA,CAAS,MAAM,CAAA;AACjD,EAAA,MAAMA,SAAQ,MAAA,CAAO,IAAA,CAAK,CAACkB,MAAAA,KAAUA,MAAAA,CAAM,cAAc,SAAS,CAAA;AAClE,EAAA,IAAIlB,MAAAA,KAAU,QAAW,OAAO,MAAA;AAChC,EAAA,OAAO;AAAA,IACL,YAAYA,MAAAA,CAAM,UAAA;AAAA,IAClB,QAAQA,MAAAA,CAAM,MAAA;AAAA,IACd,WAAWA,MAAAA,CAAM;AAAA,GACnB;AACF;AAEA,SAAS,iBAAA,CACP,GAAA,EACA,QAAA,EACA,SAAA,EACoB;AACpB,EAAA,MAAM,IAAA,GAAO,oBAAA,CAAqB,GAAA,EAAK,QAAA,EAAU,SAAS,CAAA;AAC1D,EAAA,IAAI,IAAA,KAAS,QAAW,OAAO,IAAA;AAC/B,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,kBAAA,CAAmB,OAAA,CAAQ,QAAQ,uBAAuB,CAAA;AAC1D,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,KAAA,GAAQ,kBAAA,CAAmB,GAAA,EAAK,QAAA,EAAU,QAAQ,iBAAiB,CAAA;AACzE,EAAA,MAAM,MAAA,GAAS,QAAQ,MAAA,IAAU,CAAA;AACjC,EAAA,MAAM,UAAA,GAAa,MAAM,MAAA,KAAW,CAAA;AAEpC,EAAA,MAAM,WAAA,GAAc,MAAM,OAAA,CAAQ,GAAA;AAAA,IAChC,KAAA,CAAM,GAAA,CAAI,OAAO,IAAA,KAA8C;AAC7D,MAAA,MAAM,UAAA,GAAa,mBAAA,CAAoB,GAAA,EAAK,IAAA,EAAM,QAAQ,KAAK,CAAA;AAC/D,MAAA,MAAM,QAAA,GAAW,yBAAA,CAA0B,GAAA,EAAK,IAAA,EAAM,QAAQ,QAAQ,CAAA;AACtE,MAAA,MAAM,IAAA,GAAO,MAAM,cAAA,CAAe,OAAA,CAAQ,cAAc,CAAA,CAAE;AAAA,QACxD,OAAA;AAAA,QACA,QAAA,EAAU,IAAA;AAAA,QACV,OAAO,OAAA,CAAQ,KAAA;AAAA;AAAA;AAAA,QAGf,KAAA,EAAO,UAAA,GAAa,OAAA,CAAQ,KAAA,GAAQ,QAAQ,KAAA,GAAQ,MAAA;AAAA,QACpD,GAAI,UAAA,IAAc,MAAA,GAAS,IAAI,EAAE,MAAA,KAAW,EAAC;AAAA,QAC7C,GAAI,UAAA,KAAe,MAAA,GAAY,EAAC,GAAI,EAAE,UAAA,EAAW;AAAA,QACjD,GAAI,QAAQ,IAAA,GAAO,EAAE,MAAM,OAAA,CAAQ,IAAA,KAAS,EAAC;AAAA,QAC7C,GAAI,QAAA,KAAa,MAAA,GAAY,EAAC,GAAI,EAAE,QAAA,EAAS;AAAA,QAC7C,GAAI,QAAQ,QAAA,KAAa,MAAA,GACvB,EAAC,GACD,EAAE,QAAA,EAAU,OAAA,CAAQ,QAAA,EAAS;AAAA,QAC/B,GAAI,QAAQ,eAAA,KAAoB,MAAA,GAC9B,EAAC,GACD,EAAE,eAAA,EAAiB,OAAA,CAAQ,eAAA;AAAgB,OAC9C,CAAA;AACD,MAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,MAAS;AAAA,QACxB,IAAA;AAAA,QACA,QAAQ,GAAA,CAAI,MAAA;AAAA,QACZ,OAAO,GAAA,CAAI,KAAA;AAAA,QACX,GAAI,IAAI,OAAA,KAAY,MAAA,GAAY,EAAC,GAAI,EAAE,OAAA,EAAS,GAAA,CAAI,OAAA;AAAQ,OAC9D,CAAE,CAAA;AAAA,IACJ,CAAC;AAAA,GACH;AAEA,EAAA,MAAM,MAAA,GACJ,aACE,cAAA,CAAe,WAAA,CAAY,CAAC,CAAC,CAAA,GAC7B,WAAA,CACG,IAAA,EAAK,CACL,QAAA;AAAA,IACC,CAAC,CAAA,EAAG,CAAA,KACF,CAAA,CAAE,KAAA,GAAQ,EAAE,KAAA,IACZ,iBAAA,CAAkB,CAAA,CAAE,IAAA,EAAM,EAAE,IAAI,CAAA,IAChC,kBAAkB,CAAA,CAAE,MAAA,EAAQ,EAAE,MAAM;AAAA,GACxC,CACC,KAAA,CAAM,MAAA,EAAQ,MAAA,GAAS,QAAQ,KAAK,CAAA;AAC3C,EAAA,IAAI,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAEjC,EAAA,MAAM,OAAA,GAAU,MAAM,iBAAA,CAAkB,OAAA,EAAS,SAAS,MAAM,CAAA;AAEhE,EAAA,MAAM,OAA+B,EAAC;AACtC,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,KAAA,MAAW,OAAO,MAAA,EAAQ;AACxB,IAAA,MAAM,IAAA,GAAO,QAAQ,GAAA,CAAI,aAAA,CAAc,IAAI,IAAA,EAAM,GAAA,CAAI,MAAM,CAAC,CAAA;AAC5D,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;AACxD,EAAA,kBAAA,CAAmB,OAAA,CAAQ,QAAQ,qBAAqB,CAAA;AAExD,EAAA,MAAM,WAAA,GAAc,wBAAA;AAAA,IAClB,GAAA;AAAA,IACA,QAAA;AAAA,IACA,OAAA,CAAQ,SAAA;AAAA,IACR,OAAA,CAAQ,iBAAA;AAAA,IACR;AAAA,GACF;AACA,EAAA,KAAA,MAAW,EAAE,IAAA,EAAK,IAAK,WAAA,EAAa;AAClC,IAAA,2BAAA;AAAA,MACE,OAAA;AAAA,MACA,IAAA;AAAA,MACA,EAAE,MAAA,EAAQ,OAAA,CAAQ,MAAA,EAAQ,cAAA,EAAgB,QAAQ,cAAA,EAAe;AAAA,MACjE;AAAA,KACF;AACA,IAAA,cAAA;AAAA,MACE,OAAA,CAAQ,QAAA;AAAA,MACR,OAAA,CAAQ,UAAU,IAAA,CAAK,MAAA;AAAA,MACvB;AAAA,KACF;AAAA,EACF;AACA,EAAA,MAAM,MAAA,GAAS,QAAQ,MAAA,IAAU,CAAA;AACjC,EAAA,MAAM,UAAA,GAAa,YAAY,MAAA,KAAW,CAAA;AAC1C,EAAA,MAAM,MAAA,GAAS,QAAQ,MAAA,IAAU,cAAA,CAAe,YAAY,CAAC,CAAC,EAAE,IAAA,CAAK,MAAA;AAErE,EAAA,MAAM,WAAA,GAAc,MAAM,OAAA,CAAQ,GAAA;AAAA,IAChC,WAAA,CAAY,GAAA;AAAA,MACV,OAAO,EAAE,IAAA,EAAM,IAAA,EAAK,KAA2C;AAC7D,QAAA,MAAM,UAAA,GAAa,mBAAA,CAAoB,GAAA,EAAK,IAAA,EAAM,QAAQ,KAAK,CAAA;AAC/D,QAAA,MAAM,IAAA,GAAO,MAAM,cAAA,CAAe,OAAA,CAAQ,YAAY,CAAA,CAAE;AAAA,UACtD,OAAA;AAAA,UACA,QAAA,EAAU,IAAA;AAAA,UACV,WAAW,OAAA,CAAQ,SAAA;AAAA,UACnB,gBAAgB,OAAA,CAAQ,cAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAKxB,MAAA;AAAA,UACA,YAAY,IAAA,CAAK,UAAA;AAAA,UACjB,WAAW,IAAA,CAAK,SAAA;AAAA;AAAA;AAAA,UAGhB,KAAA,EAAO,UAAA,GAAa,OAAA,CAAQ,KAAA,GAAQ,QAAQ,KAAA,GAAQ,MAAA;AAAA,UACpD,GAAI,UAAA,IAAc,MAAA,GAAS,IAAI,EAAE,MAAA,KAAW,EAAC;AAAA,UAC7C,GAAI,UAAA,KAAe,MAAA,GAAY,EAAC,GAAI,EAAE,UAAA,EAAW;AAAA,UACjD,GAAI,QAAQ,QAAA,KAAa,MAAA,GACvB,EAAC,GACD,EAAE,QAAA,EAAU,OAAA,CAAQ,QAAA,EAAS;AAAA,UAC/B,GAAI,QAAQ,QAAA,KAAa,MAAA,GACvB,EAAC,GACD,EAAE,QAAA,EAAU,OAAA,CAAQ,QAAA;AAAS,SAChC,CAAA;AACD,QAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,MAAS;AAAA,UACxB,IAAA;AAAA,UACA,QAAQ,GAAA,CAAI,MAAA;AAAA,UACZ,OAAO,GAAA,CAAI;AAAA,SACb,CAAE,CAAA;AAAA,MACJ;AAAA;AACF,GACF;AAEA,EAAA,MAAM,MAAA,GACJ,UAAA,GACE,cAAA,CAAe,WAAA,CAAY,CAAC,CAAC,CAAA,GAC7B,eAAA,CAAgB,WAAA,EAAa,MAAM,CAAA,CAAE,KAAA;AAAA,IACnC,MAAA;AAAA,IACA,SAAS,OAAA,CAAQ;AAAA,GACnB;AACJ,EAAA,IAAI,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAEjC,EAAA,MAAM,OAAA,GAAU,MAAM,iBAAA,CAAkB,OAAA,EAAS,SAAS,MAAM,CAAA;AAEhE,EAAA,MAAM,OAA6B,EAAC;AACpC,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,KAAA,MAAW,OAAO,MAAA,EAAQ;AACxB,IAAA,MAAM,IAAA,GAAO,QAAQ,GAAA,CAAI,aAAA,CAAc,IAAI,IAAA,EAAM,GAAA,CAAI,MAAM,CAAC,CAAA;AAC5D,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,SAAS,wBAAA,CACP,GAAA,EACA,QAAA,EACA,SAAA,EACA,mBACA,KAAA,EAC6B;AAC7B,EAAA,MAAM,KAAA,GAAQ,kBAAA,CAAmB,GAAA,EAAK,QAAA,EAAU,iBAAiB,CAAA;AACjE,EAAA,MAAM,WAA+B,EAAC;AACtC,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,IAAA,GAAO,oBAAA,CAAqB,GAAA,EAAK,IAAA,EAAM,SAAS,CAAA;AACtD,IAAA,IAAI,SAAS,MAAA,EAAW,QAAA,CAAS,KAAK,EAAE,IAAA,EAAM,MAAM,CAAA;AAAA,EACtD;AAGA,EAAA,IAAI,SAAS,MAAA,KAAW,CAAA,EAAG,iBAAA,CAAkB,GAAA,EAAK,UAAU,SAAS,CAAA;AACrE,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,QAAA,CAAS,GAAA,CAAI,CAAC,EAAE,IAAA,EAAK,KAAM,IAAA,CAAK,MAAM,CAAC,CAAA;AAC/D,EAAA,IAAI,OAAA,CAAQ,OAAO,CAAA,EAAG;AACpB,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,EAAG,KAAK,CAAA,uBAAA,EAA0B,QAAQ,CAAA,iCAAA,EACxB,SAAS,CAAA,GAAA,EAAM,CAAC,GAAG,OAAO,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,oGAAA,CAAA;AAAA,MAGxD,EAAE,UAAA,EAAY,QAAA,EAAU,OAAA,EAAS,IAAI,OAAA;AAAQ,KAC/C;AAAA,EACF;AACA,EAAA,OAAO,QAAA;AACT;AAaA,SAAS,eAAA,CACP,aACA,MAAA,EAC4B;AAC5B,EAAA,MAAM,UAAA,GAAa,gBAAgB,MAAM,CAAA;AACzC,EAAA,OAAO,WAAA,CACJ,MAAK,CACL,QAAA;AAAA,IACC,CAAC,GAAG,CAAA,KAAA,CACD,UAAA,GAAa,EAAE,KAAA,GAAQ,CAAA,CAAE,KAAA,GAAQ,CAAA,CAAE,KAAA,GAAQ,CAAA,CAAE,UAC9C,iBAAA,CAAkB,CAAA,CAAE,MAAM,CAAA,CAAE,IAAI,KAChC,iBAAA,CAAkB,CAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,MAAM;AAAA,GACxC;AACJ;AAGA,SAAS,kBACP,WAAA,EAC4B;AAC5B,EAAA,OAAO,WAAA,CACJ,MAAK,CACL,QAAA;AAAA,IACC,CAAC,CAAA,EAAG,CAAA,KACF,CAAA,CAAE,KAAA,GAAQ,EAAE,KAAA,IACZ,iBAAA,CAAkB,CAAA,CAAE,IAAA,EAAM,EAAE,IAAI,CAAA,IAChC,kBAAkB,CAAA,CAAE,MAAA,EAAQ,EAAE,MAAM;AAAA,GACxC;AACJ;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,kBAAA,CAAmB,OAAA,CAAQ,QAAQ,qBAAqB,CAAA;AAExD,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,MAAA,GAAS,QAAQ,MAAA,IAAU,CAAA;AAGjC,EAAA,MAAM,mBAAA,GAAsB,CAAA;AAC5B,EAAA,MAAM,SAAA,GAAY,QAAQ,KAAA,GAAQ,MAAA;AAClC,EAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,MAAA,CAAO,CAAA,IAAK,SAAA,GAAY,mBAAA;AAChD,EAAA,MAAM,SAAA,GAAY,OAAA,CAAQ,QAAA,CAAS,CAAA,IAAK,SAAA,GAAY,mBAAA;AAKpD,EAAA,MAAM,aAAA,GAAgB,kBAAA;AAAA,IACpB,GAAA;AAAA,IACA,QAAA;AAAA,IACA,OAAA,CAAQ;AAAA,GACV;AACA,EAAA,MAAM,WAAA,GAAc,wBAAA;AAAA,IAClB,GAAA;AAAA,IACA,QAAA;AAAA,IACA,QAAQ,MAAA,CAAO,SAAA;AAAA,IACf,OAAA,CAAQ,iBAAA;AAAA,IACR;AAAA,GACF;AACA,EAAA,KAAA,MAAW,EAAE,IAAA,EAAK,IAAK,WAAA,EAAa;AAClC,IAAA,2BAAA;AAAA,MACE,OAAA;AAAA,MACA,IAAA;AAAA,MACA;AAAA,QACE,MAAA,EAAQ,QAAQ,MAAA,CAAO,MAAA;AAAA,QACvB,cAAA,EAAgB,QAAQ,MAAA,CAAO;AAAA,OACjC;AAAA,MACA;AAAA,KACF;AACA,IAAA,cAAA;AAAA,MACE,QAAQ,MAAA,CAAO,QAAA;AAAA,MACf,OAAA,CAAQ,MAAA,CAAO,MAAA,IAAU,IAAA,CAAK,MAAA;AAAA,MAC9B;AAAA,KACF;AAAA,EACF;AACA,EAAA,MAAM,YAAA,GACJ,QAAQ,MAAA,CAAO,MAAA,IAAU,eAAe,WAAA,CAAY,CAAC,CAAC,CAAA,CAAE,IAAA,CAAK,MAAA;AAG/D,EAAA,MAAM,gBAAA,uBAAuB,GAAA,EAAqC;AAClE,EAAA,KAAA,MAAW,QAAQ,aAAA,EAAe;AAChC,IAAA,gBAAA,CAAiB,IAAI,IAAA,EAAM,mBAAA,CAAoB,KAAK,IAAA,EAAM,OAAA,CAAQ,KAAK,CAAC,CAAA;AAAA,EAC1E;AACA,EAAA,KAAA,MAAW,EAAE,IAAA,EAAK,IAAK,WAAA,EAAa;AAClC,IAAA,IAAI,CAAC,gBAAA,CAAiB,GAAA,CAAI,IAAI,CAAA,EAAG;AAC/B,MAAA,gBAAA,CAAiB,IAAI,IAAA,EAAM,mBAAA,CAAoB,KAAK,IAAA,EAAM,OAAA,CAAQ,KAAK,CAAC,CAAA;AAAA,IAC1E;AAAA,EACF;AAMA,EAAA,IACE,QAAQ,YAAA,KAAiB,MAAA,IACzB,aAAA,CAAc,MAAA,KAAW,KACzB,WAAA,CAAY,MAAA,KAAW,CAAA,IACvB,aAAA,CAAc,CAAC,CAAA,KAAM,cAAA,CAAe,YAAY,CAAC,CAAC,EAAE,IAAA,EACpD;AACA,IAAA,MAAM,IAAA,GAAO,cAAc,CAAC,CAAA;AAC5B,IAAA,MAAM,EAAE,IAAA,EAAK,GAAI,cAAA,CAAe,WAAA,CAAY,CAAC,CAAC,CAAA;AAC9C,IAAA,MAAM,UAAA,GAAa,gBAAA,CAAiB,GAAA,CAAI,IAAI,CAAA;AAC5C,IAAA,MAAM,sBAAA,GAAyB,yBAAA;AAAA,MAC7B,GAAA;AAAA,MACA,IAAA;AAAA,MACA,QAAQ,QAAA,CAAS;AAAA,KACnB;AACA,IAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,YAAA,CAAa;AAAA,MACtC,OAAA;AAAA,MACA,QAAA,EAAU,IAAA;AAAA,MACV,MAAA,EAAQ;AAAA,QACN,SAAA,EAAW,QAAQ,MAAA,CAAO,SAAA;AAAA,QAC1B,cAAA,EAAgB,QAAQ,MAAA,CAAO,cAAA;AAAA,QAC/B,MAAA,EAAQ,YAAA;AAAA,QACR,YAAY,IAAA,CAAK,UAAA;AAAA,QACjB,WAAW,IAAA,CAAK,SAAA;AAAA,QAChB,CAAA,EAAG,OAAA;AAAA,QACH,GAAI,OAAA,CAAQ,MAAA,CAAO,QAAA,KAAa,MAAA,GAC9B,EAAC,GACD,EAAE,QAAA,EAAU,OAAA,CAAQ,MAAA,CAAO,QAAA,EAAS;AAAA,QACtC,GAAI,OAAA,CAAQ,MAAA,CAAO,QAAA,KAAa,MAAA,GAC9B,EAAC,GACD,EAAE,QAAA,EAAU,OAAA,CAAQ,MAAA,CAAO,QAAA;AAAS,OACxC;AAAA,MACA,QAAA,EAAU;AAAA,QACR,KAAA,EAAO,QAAQ,QAAA,CAAS,KAAA;AAAA,QACxB,CAAA,EAAG,SAAA;AAAA,QACH,GAAI,OAAA,CAAQ,QAAA,CAAS,IAAA,GAAO,EAAE,MAAM,OAAA,CAAQ,QAAA,CAAS,IAAA,EAAK,GAAI,EAAC;AAAA,QAC/D,GAAI,sBAAA,KAA2B,MAAA,GAC7B,EAAC,GACD,EAAE,UAAU,sBAAA,EAAuB;AAAA,QACrC,GAAI,OAAA,CAAQ,QAAA,CAAS,QAAA,KAAa,MAAA,GAChC,EAAC,GACD,EAAE,QAAA,EAAU,OAAA,CAAQ,QAAA,CAAS,QAAA,EAAS;AAAA,QACxC,GAAI,OAAA,CAAQ,QAAA,CAAS,eAAA,KAAoB,MAAA,GACvC,EAAC,GACD,EAAE,eAAA,EAAiB,OAAA,CAAQ,QAAA,CAAS,eAAA;AAAgB,OACxD;AAAA,MACA,MAAA,EAAQ,EAAE,CAAA,EAAG,OAAA,EAAS,cAAc,cAAA,EAAe;AAAA,MACnD,OAAO,OAAA,CAAQ,KAAA;AAAA,MACf,GAAI,MAAA,KAAW,CAAA,GAAI,EAAC,GAAI,EAAE,MAAA,EAAO;AAAA,MACjC,GAAI,UAAA,KAAe,MAAA,GAAY,EAAC,GAAI,EAAE,UAAA;AAAW,KAClD,CAAA;AACD,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,EAAK,KAAA,KAAU;AAC9B,MAAA,MAAM,SAAA,GAAY,SAAA,CAAU,GAAA,CAAI,IAAI,CAAA;AACpC,MAAA,OAAO;AAAA,QACL,IAAA,EAAM,SAAA;AAAA,QACN,OAAO,GAAA,CAAI,UAAA;AAAA,QACX,MAAM,KAAA,GAAQ,CAAA;AAAA,QACd,GAAI,GAAA,CAAI,UAAA,KAAe,MAAA,IAAa,GAAA,CAAI,gBAAgB,MAAA,GACtD;AAAA,UACE,MAAA,EAAQ;AAAA,YACN,IAAA,EAAM,SAAA;AAAA,YACN,OAAO,GAAA,CAAI,WAAA;AAAA,YACX,MAAM,GAAA,CAAI;AAAA;AACZ,YAEF,EAAC;AAAA,QACH,GAAI,GAAA,CAAI,YAAA,KAAiB,MAAA,IAAa,GAAA,CAAI,kBAAkB,MAAA,GAC1D;AAAA,UACE,QAAA,EAAU;AAAA,YACR,IAAA,EAAM,SAAA;AAAA,YACN,OAAO,GAAA,CAAI,aAAA;AAAA,YACX,MAAM,GAAA,CAAI,YAAA;AAAA,YACV,GAAI,IAAI,OAAA,KAAY,MAAA,GAAY,EAAC,GAAI,EAAE,OAAA,EAAS,GAAA,CAAI,OAAA;AAAQ;AAC9D,YAEF;AAAC,OACL;AAAA,IACF,CAAC,CAAA;AAAA,EACH;AAEA,EAAA,MAAM,gBAAgB,OAAA,CAAQ,GAAA;AAAA,IAC5B,WAAA,CAAY,GAAA;AAAA,MACV,OAAO,EAAE,IAAA,EAAM,IAAA,EAAK,KAA2C;AAC7D,QAAA,MAAM,UAAA,GAAa,gBAAA,CAAiB,GAAA,CAAI,IAAI,CAAA;AAC5C,QAAA,MAAM,IAAA,GAAO,MAAM,cAAA,CAAe,OAAA,CAAQ,YAAY,CAAA,CAAE;AAAA,UACtD,OAAA;AAAA,UACA,QAAA,EAAU,IAAA;AAAA,UACV,SAAA,EAAW,QAAQ,MAAA,CAAO,SAAA;AAAA,UAC1B,cAAA,EAAgB,QAAQ,MAAA,CAAO,cAAA;AAAA;AAAA,UAE/B,MAAA,EAAQ,YAAA;AAAA,UACR,YAAY,IAAA,CAAK,UAAA;AAAA,UACjB,WAAW,IAAA,CAAK,SAAA;AAAA,UAChB,KAAA,EAAO,OAAA;AAAA,UACP,GAAI,UAAA,KAAe,MAAA,GAAY,EAAC,GAAI,EAAE,UAAA,EAAW;AAAA,UACjD,GAAI,OAAA,CAAQ,MAAA,CAAO,QAAA,KAAa,MAAA,GAC9B,EAAC,GACD,EAAE,QAAA,EAAU,OAAA,CAAQ,MAAA,CAAO,QAAA,EAAS;AAAA,UACtC,GAAI,OAAA,CAAQ,MAAA,CAAO,QAAA,KAAa,MAAA,GAC9B,EAAC,GACD,EAAE,QAAA,EAAU,OAAA,CAAQ,MAAA,CAAO,QAAA;AAAS,SACvC,CAAA;AACD,QAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,MAAS;AAAA,UACxB,IAAA;AAAA,UACA,QAAQ,GAAA,CAAI,MAAA;AAAA,UACZ,OAAO,GAAA,CAAI;AAAA,SACb,CAAE,CAAA;AAAA,MACJ;AAAA;AACF,GACF,CAAE,IAAA,CAAK,CAAC,OAAA,KAAY,eAAA,CAAgB,OAAA,EAAS,YAAY,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,OAAO,CAAC,CAAA;AAE5E,EAAA,MAAM,kBAAkB,OAAA,CAAQ,GAAA;AAAA,IAC9B,aAAA,CAAc,GAAA,CAAI,OAAO,IAAA,KAA8C;AACrE,MAAA,MAAM,UAAA,GAAa,gBAAA,CAAiB,GAAA,CAAI,IAAI,CAAA;AAC5C,MAAA,MAAM,QAAA,GAAW,yBAAA;AAAA,QACf,GAAA;AAAA,QACA,IAAA;AAAA,QACA,QAAQ,QAAA,CAAS;AAAA,OACnB;AACA,MAAA,MAAM,IAAA,GAAO,MAAM,cAAA,CAAe,OAAA,CAAQ,cAAc,CAAA,CAAE;AAAA,QACxD,OAAA;AAAA,QACA,QAAA,EAAU,IAAA;AAAA,QACV,KAAA,EAAO,QAAQ,QAAA,CAAS,KAAA;AAAA,QACxB,KAAA,EAAO,SAAA;AAAA,QACP,GAAI,UAAA,KAAe,MAAA,GAAY,EAAC,GAAI,EAAE,UAAA,EAAW;AAAA,QACjD,GAAI,OAAA,CAAQ,QAAA,CAAS,IAAA,GAAO,EAAE,MAAM,OAAA,CAAQ,QAAA,CAAS,IAAA,EAAK,GAAI,EAAC;AAAA,QAC/D,GAAI,QAAA,KAAa,MAAA,GAAY,EAAC,GAAI,EAAE,QAAA,EAAS;AAAA,QAC7C,GAAI,OAAA,CAAQ,QAAA,CAAS,QAAA,KAAa,MAAA,GAChC,EAAC,GACD,EAAE,QAAA,EAAU,OAAA,CAAQ,QAAA,CAAS,QAAA,EAAS;AAAA,QACxC,GAAI,OAAA,CAAQ,QAAA,CAAS,eAAA,KAAoB,MAAA,GACvC,EAAC,GACD,EAAE,eAAA,EAAiB,OAAA,CAAQ,QAAA,CAAS,eAAA;AAAgB,OACvD,CAAA;AACD,MAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,MAAS;AAAA,QACxB,IAAA;AAAA,QACA,QAAQ,GAAA,CAAI,MAAA;AAAA,QACZ,OAAO,GAAA,CAAI,KAAA;AAAA,QACX,GAAI,IAAI,OAAA,KAAY,MAAA,GAAY,EAAC,GAAI,EAAE,OAAA,EAAS,GAAA,CAAI,OAAA;AAAQ,OAC9D,CAAE,CAAA;AAAA,IACJ,CAAC;AAAA,GACH,CAAE,IAAA,CAAK,CAAC,OAAA,KAAY,iBAAA,CAAkB,OAAO,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,SAAS,CAAC,CAAA;AAElE,EAAA,MAAM,CAAC,UAAA,EAAY,YAAY,CAAA,GAAI,MAAM,QAAQ,GAAA,CAAI;AAAA,IACnD,aAAA;AAAA,IACA;AAAA,GACD,CAAA;AAcD,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAwB;AAE1C,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,GAAG,CAAA,IAAK,UAAA,CAAW,SAAQ,EAAG;AAC/C,IAAA,MAAMmB,QAAO,KAAA,GAAQ,CAAA;AACrB,IAAA,MAAM,YAAA,GAAe,gBAAgB,OAAA,GAAUA,KAAAA,CAAAA;AAC/C,IAAA,MAAM,GAAA,GAAM,aAAA,CAAc,GAAA,CAAI,IAAA,EAAM,IAAI,MAAM,CAAA;AAC9C,IAAA,MAAMD,MAAAA,GAAQ,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA,IAAK;AAAA,MAC9B,MAAM,GAAA,CAAI,IAAA;AAAA,MACV,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,KAAKA,MAAK,CAAA;AAAA,EACtB;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,MAAM,GAAA,GAAM,aAAA,CAAc,GAAA,CAAI,IAAA,EAAM,IAAI,MAAM,CAAA;AAC9C,IAAA,MAAMD,MAAAA,GAAQ,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA,IAAK;AAAA,MAC9B,MAAM,GAAA,CAAI,IAAA;AAAA,MACV,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,KAAKA,MAAK,CAAA;AAAA,EACtB;AAOA,EAAA,MAAM,SAAS,CAAC,GAAG,KAAA,CAAM,MAAA,EAAQ,CAAA,CAC9B,QAAA;AAAA,IACC,CAAC,CAAA,EAAG,CAAA,KACF,CAAA,CAAE,UAAA,GAAa,EAAE,UAAA,IACjB,iBAAA,CAAkB,CAAA,CAAE,IAAA,EAAM,EAAE,IAAI,CAAA,IAChC,kBAAkB,CAAA,CAAE,MAAA,EAAQ,EAAE,MAAM;AAAA,GACxC,CACC,KAAA,CAAM,MAAA,EAAQ,MAAA,GAAS,QAAQ,KAAK,CAAA;AAEvC,EAAA,MAAM,UAAU,MAAM,iBAAA;AAAA,IACpB,OAAA;AAAA,IACA,OAAA;AAAA,IACA,MAAA,CAAO,GAAA,CAAI,CAACA,MAAAA,MAAW;AAAA,MACrB,MAAMA,MAAAA,CAAM,IAAA;AAAA,MACZ,QAAQA,MAAAA,CAAM,MAAA;AAAA,MACd,OAAOA,MAAAA,CAAM;AAAA,KACf,CAAE;AAAA,GACJ;AAEA,EAAA,MAAM,OAA6B,EAAC;AACpC,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,KAAA,MAAWA,UAAS,MAAA,EAAQ;AAC1B,IAAA,MAAM,IAAA,GAAO,QAAQ,GAAA,CAAI,aAAA,CAAcA,OAAM,IAAA,EAAMA,MAAAA,CAAM,MAAM,CAAC,CAAA;AAChE,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;AAMtB,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;;;ACxoCO,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,IAAA,CAAK,QAAA;AAAA,MACL,QAAA;AAAA;AAAA;AAAA,MAGA;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,IAAA,CAAK,QAAA;AAAA,MACL,QAAA;AAAA;AAAA;AAAA,MAGA;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,IAAA,CAAK,QAAA;AAAA,MACL,QAAA;AAAA;AAAA;AAAA,MAGA;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;;;ACjLO,SAAS,oBAAoB,OAAA,EAA0C;AAC5E,EAAA,OAAO,OAAA;AACT;AAGO,SAAS,aAAa,OAAA,EAAmC;AAC9D,EAAA,OAAO,OAAA;AACT;;;ACeO,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,cAAA,CAAe,IAAA,CAAK,IAAI,CAAC,CAAA;AAC1C,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;AAAA,MACE,IAAA;AAAA,MACA,IAAA;AAAA,MACA,cAAA,CAAe,QAAA,CAAS,IAAI,CAAC,CAAA;AAAA,MAC7B,cAAA,CAAe,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,MACzB;AAAA,KACF;AAAA,EACF;AACF;AAEA,SAAS,gBAAA,CACP,IAAA,EACAlB,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,CAACkB,MAAAA,KAAU;AAC7B,MAAA,SAAA,CAAU,kBAAA,CAAmB;AAAA,QAC3B,GAAGA,MAAAA;AAAA,QACH,OAAO,CAAA,EAAGlB,MAAK,CAAA,CAAA,EAAIkB,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,EAAGlB,MAAK,CAAA,CAAA,EAAIkB,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;;;AChiBO,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;;;AC9RO,IAAM,0BAAA,GAA6B,EAAA;AACnC,IAAM,sBAAA,GAAyB,CAAA;AAuC/B,SAAS,oBACd,OAAA,EACyB;AACzB,EAAA,OAAO;AAAA,IACL,GAAI,QAAQ,YAAA,KAAiB,MAAA,GAC3B,EAAC,GACD,EAAE,YAAA,EAAc,OAAA,CAAQ,YAAA,EAAa;AAAA,IACvC,GAAI,QAAQ,IAAA,KAAS,MAAA,GAAY,EAAC,GAAI,EAAE,IAAA,EAAM,OAAA,CAAQ,IAAA,EAAK;AAAA,IAC3D,GAAI,QAAQ,YAAA,KAAiB,MAAA,GAC3B,EAAC,GACD,EAAE,YAAA,EAAc,OAAA,CAAQ,YAAA;AAAa,GACzC;AACF;AAQO,SAAS,sBAAA,CACd,KACA,OAAA,EAKC;AACD,EAAA,MAAM,EAAE,OAAM,GAAI,qBAAA;AAAA,IAChB,OAAA,CAAQ,gBAAgB,GAAA,CAAI,mBAAA;AAAA,IAC5B,OAAA,CAAQ;AAAA,GACV;AAMA,EAAA,IAAI,OAAA,CAAQ,iBAAiB,MAAA,EAAW;AACtC,IAAA,0BAAA,CAA2B,OAAA,CAAQ,cAAc,cAAc,CAAA;AAAA,EACjE;AACA,EAAA,OAAO;AAAA,IACL,cAAc,KAAA,CAAM,IAAA;AAAA,IACpB,GAAI,KAAA,CAAM,IAAA,KAAS,UAAa,EAAE,IAAA,EAAM,MAAM,IAAA,EAAK;AAAA,IACnD,GAAI,QAAQ,YAAA,KAAiB,MAAA,GAC3B,EAAC,GACD,EAAE,YAAA,EAAc,OAAA,CAAQ,YAAA;AAAa,GACzC;AACF;AAEO,SAAS,iBAAA,CACd,KACA,OAAA,EACW;AACX,EAAA,OAAO,qBAAA;AAAA,IACL,GAAA,CAAI,MAAA;AAAA,IACJ,OAAA,CAAQ,YAAA;AAAA,IACR,GAAA,CAAI,mBAAA;AAAA,IACJ;AAAA,GACF;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,cAAc,QAAA,CAAS,YAAA;AAAA,IACvB,UAAA;AAAA,IACA,kBAAkB,kBAAA;AAAmB,GACvC;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;AAQO,SAAS,oBAAA,CACd,KAAA,EACA,QAAA,EACA,SAAA,EACQ;AACR,EAAA,MAAM,gBAAgB,KAAA,IAAS,QAAA;AAC/B,EAAA,IAAI,CAAC,MAAA,CAAO,aAAA,CAAc,aAAa,CAAA,IAAK,gBAAgB,CAAA,EAAG;AAC7D,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,EAAG,SAAS,CAAA,oDAAA,EAAuD,MAAA,CAAO,aAAa,CAAC,CAAA,CAAA,CAAA;AAAA,MACxF,EAAE,aAAA;AAAc,KAClB;AAAA,EACF;AACA,EAAA,OAAO,aAAA;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;AAMO,SAAS,0BACd,SAAA,EACa;AACb,EAAA,IAAI,SAAA,KAAc,QAAW,OAAO,GAAA,CAAA,IAAA,CAAA;AACpC,EAAA,OAAO,iBAAA,CAAkB,GAAA,CAAI,GAAA,CAAI,QAAQ,GAAG,SAAS,CAAA;AACvD;AAMO,SAAS,mBACd,SAAA,EAC+B;AAC/B,EAAA,IAAI,SAAA,KAAc,QAAW,OAAO,MAAA;AACpC,EAAA,OAAO,CAAC,GAAG,IAAI,GAAA,CAAI,SAAS,CAAC,CAAA,CAAE,QAAA;AAAA,IAAS,CAAC,IAAA,EAAM,KAAA,KAC7C,iBAAA,CAAkB,MAAM,KAAK;AAAA,GAC/B;AACF;AAEO,SAAS,6BAAA,CACd,GAAA,EACA,SAAA,EACA,OAAA,GAA2D,EAAC,EACtD;AACN,EAAA,MAAM,cAAA,GACJ,GAAA,CAAI,OAAA,CAAQ,YAAA,CAAa,gBAAgB,SAAA,KAAc,IAAA;AACzD,EAAA,MAAM,eAAA,GAAkB,GAAA,CAAI,OAAA,CAAQ,YAAA,CAAa,eAAA;AACjD,EAAA,IACE,cAAA,KACC,OAAA,CAAQ,uBAAA,KAA4B,IAAA,IAAQ,eAAA,CAAA,EAC7C;AACA,IAAA;AAAA,EACF;AAEA,EAAA,MAAM,IAAI,iCAAA;AAAA,IACR,SAAA;AAAA,IACA,gBAAA;AAAA,IACA;AAAA,MACE,OAAA,EAAS,IAAI,OAAA,CAAQ,OAAA;AAAA,MACrB,SAAA,EAAW,cAAA;AAAA,MACX,GAAI,OAAA,CAAQ,uBAAA,KAA4B,OAAO,EAAE,eAAA,KAAoB;AAAC,KACxE;AAAA,IACA;AAAA,GACF;AACF;;;ACtPA,eAAsB,aAAA,CACpB,GAAA,EACA,MAAA,EACA,OAAA,GAAiC,EAAC,EACjB;AACjB,EAAA,MAAM,SAAA,GAAY,QAAQ,SAAA,IAAa,MAAA;AACvC,EAAA,MAAM,YAAY,OAAA,CAAQ,KAAA,IAAS,OAAO,IAAA,CAAK,GAAA,CAAI,MAAM,KAAK,CAAA;AAG9D,EAAA,IAAI,SAAA,CAAU,MAAA,KAAW,CAAA,EAAG,OAAO,CAAA;AAEnC,EAAA,MAAM,MAAA,GAAS,iBAAA,CAAkB,GAAA,EAAK,OAAO,CAAA;AAC7C,EAAA,MAAM,YAAA,GAA8B;AAAA,IAClC,GAAA,CAAA,WAAA,EAAiB,IAAI,OAAO,CAAA,CAAA;AAAA,IAC5B,qBAAA,CAAsB,KAAK,OAAO,CAAA;AAAA,IAClC,sBAAA,CAAuB,GAAA,EAAK,SAAA,EAAW,MAAA,EAAQ,OAAO,UAAU;AAAA,GAClE;AACA,EAAA,IAAI,OAAA,CAAQ,UAAU,MAAA,EAAW;AAC/B,IAAA,YAAA,CAAa,IAAA,CAAK,kBAAkB,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA,EAAG,OAAA,CAAQ,KAAK,CAAC,CAAA;AAAA,EACrE;AAIA,EAAA,MAAM,SAAA,GACJ,SAAA,KAAc,MAAA,GAAS,GAAA,CAAA,kBAAA,CAAA,GAA0B,GAAA,CAAA,QAAA,CAAA;AAEnD,EAAA,MAAM,KAAA,GAAQ,GAAA,CAAA,OAAA,EAAa,SAAS,CAAA,eAAA,EAAkB,MAAA,CAAO,UAAU,CAAA,OAAA,EAAU,GAAA,CAAI,IAAA,CAAK,YAAA,EAAc,GAAA,CAAA,KAAA,CAAU,CAAC,CAAA,CAAA;AAEnH,EAAA,MAAM,IAAA,GAAO,MAAM,GAAA,CAAI,OAAA,CAAQ,OAAA;AAAA,IAC7B,kBAAkB,KAAK;AAAA,GACzB;AACA,EAAA,OAAO,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,EAAG,SAAS,CAAC,CAAA;AACnC;AAyBA,SAAS,gBAAA,CACP,GAAA,EACA,MAAA,EACA,UAAA,EACa;AACb,EAAA,OAAO,wBAAwB,UAAU,CAAA,kBAAA,EAAqB,GAAA,CAAI,OAAO,aAAa,MAAM,CAAA,SAAA,CAAA;AAC9F;AASA,SAAS,sBAAA,CACP,GAAA,EACA,SAAA,EACA,MAAA,EACA,UAAA,EACa;AACb,EAAA,MAAM,QAAA,GAAW,gBAAA,CAAiB,GAAA,EAAK,MAAA,EAAQ,UAAU,CAAA;AACzD,EAAA,MAAM,QAAA,GAAW,GAAA,CAAA,aAAA,EAAmB,QAAQ,CAAA,eAAA,EAAkB,MAAM,CAAA,CAAA,CAAA;AACpE,EAAA,MAAM,MAAA,GAAS,GAAA,CAAA,WAAA,EAAiB,QAAQ,CAAA,aAAA,EAAgB,MAAM,CAAA,CAAA,CAAA;AAE9D,EAAA,QAAQ,SAAA;AAAW,IACjB,KAAK,KAAA,EAAO;AACV,MAAA,OAAO,QAAA;AAAA,IACT;AAAA,IACA,KAAK,IAAA,EAAM;AACT,MAAA,OAAO,MAAA;AAAA,IACT;AAAA,IACA,KAAK,MAAA,EAAQ;AACX,MAAA,OAAO,GAAA,CAAA,CAAA,EAAO,QAAQ,CAAA,IAAA,EAAO,MAAM,CAAA,CAAA,CAAA;AAAA,IACrC;AAAA;AAEJ;;;AClBO,SAAS,wBACd,OAAA,EACa;AACb,EAAA,OAAO,GAAA,CAAI,UAAA;AAAA,IACT,uBAAuB,OAAA,CAAQ,KAAA,CAAM,UAAA,CAAW,GAAA,EAAK,GAAG,CAAC,CAAA,SAAA;AAAA,GAC3D;AACF;AAKA,eAAsB,sBACpB,OAAA,EACiB;AACjB,EAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,OAAA,CAAQ,OAAA;AAAA,IACjC,iBAAA,CAAkB,GAAA;AAAA;AAAA,WAAA,EAET,QAAQ,YAAY;AAAA,uBAAA,EACR,OAAA,CAAQ,OAAO,CAAA,cAAA,EAAiB,OAAA,CAAQ,KAAK;AAAA,IAAA,CACjE;AAAA,GACH;AACA,EAAA,OAAO,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,EAAG,SAAS,CAAC,CAAA;AACnC;AAsCO,IAAM,2BAAA,GAA8B,GAAA;AAC3C,IAAM,4CAAA,GAA+C,EAAA;AAErD,IAAM,0CAAA,GAA6C,CAAA;AAO5C,IAAM,kCAAA,GAAqC,EAAA;AAE3C,IAAM,mCAAA,GAAsC,CAAA;AAQnD,IAAM,gCAAA,GAAmC,mBAAA;AAEzC,IAAM,iCAAA,GAAsE;AAAA,EAC1E,EAAA,EAAI,CAAA;AAAA,EACJ,EAAA,EAAI,IAAA;AAAA,EACJ,IAAI,IAAA,GAAO;AACb,CAAA;AAQA,IAAM,4BAAA,GAA+B,EAAA;AACrC,IAAM,4BAAA,GAA+B,UAAA;AAUrC,SAAS,qBACP,aAAA,EACoB;AACpB,EAAA,IAAI,aAAA,KAAkB,QAAW,OAAO,MAAA;AACxC,EAAA,MAAM,KAAA,GAAQ,gCAAA,CAAiC,IAAA,CAAK,aAAa,CAAA;AACjE,EAAA,IAAI,UAAU,IAAA,EAAM;AAClB,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,2GAAA,EAA8G,IAAA,CAAK,SAAA,CAAU,aAAa,CAAC,CAAA,CAAA,CAAA;AAAA,MAC3I,EAAE,aAAA;AAAc,KAClB;AAAA,EACF;AACA,EAAA,MAAM,SAAA,GACJ,MAAA,CAAO,KAAA,CAAM,CAAC,CAAC,CAAA,IAAK,iCAAA,CAAkC,KAAA,CAAM,CAAC,CAAA,IAAK,EAAE,CAAA,IAAK,CAAA,CAAA;AAC3E,EAAA,IACE,SAAA,GAAY,4BAAA,IACZ,SAAA,GAAY,4BAAA,EACZ;AACA,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,wDAAA,EAA2D,4BAA4B,CAAA,OAAA,EAAU,4BAA4B,WAAW,IAAA,CAAK,SAAA,CAAU,aAAa,CAAC,CAAA,CAAA,CAAA;AAAA,MACrK,EAAE,eAAe,SAAA;AAAU,KAC7B;AAAA,EACF;AACA,EAAA,OAAO,aAAA;AACT;AAYA,eAAsB,iCAAA,CACpB,GAAA,EACA,OAAA,EACA,GAAA,EACY;AACZ,EAAA,IAAI,GAAA,CAAI,OAAA,CAAQ,YAAA,CAAa,YAAA,EAAc;AACzC,IAAA,OAAO,IAAI,OAAA,CAAQ,WAAA;AAAA,MACjB,OAAO,OAAA,KAAY,GAAA,CAAI,gBAAgB,GAAA,EAAK,OAAA,EAAS,OAAO,CAAC,CAAA;AAAA,MAC7D;AAAA,QACE,cAAA,EAAgB,iBAAA;AAAA,QAChB,UAAA,EAAY;AAAA;AACd,KACF;AAAA,EACF;AACA,EAAA,OAAO,IAAI,eAAA,CAAgB,GAAA,EAAK,OAAA,EAAS,GAAA,CAAI,OAAO,CAAC,CAAA;AACvD;AAQA,eAAsB,0BAAA,CAIpB,GAAA,EACA,OAAA,EACA,IAAA,EACiB;AACjB,EAAA,IAAI,CAAC,GAAA,CAAI,OAAA,CAAQ,YAAA,CAAa,YAAA,EAAc;AAC1C,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,mEAAA;AAAA,MACA,EAAE,OAAA,EAAS,GAAA,CAAI,OAAA,CAAQ,OAAA;AAAQ,KACjC;AAAA,EACF;AAEA,EAAA,MAAM,kBAAA,GAAqB;AAAA,IACzB,cAAA,EAAgB,iBAAA;AAAA,IAChB,UAAA,EAAY,WAAA;AAAA,IACZ,eAAA,EAAiB;AAAA,GACnB;AAEA,EAAA,OAAO,GAAA,CAAI,OAAA,CAAQ,WAAA,CAAY,OAAO,OAAA,KAAY;AAChD,IAAA,MAAM,gBAAA,GAAmB,2BAA2B,OAAO,CAAA;AAC3D,IAAA,MAAM,QAAQ,UAAA,EAAW;AACzB,IAAA,MAAM,eAAe,GAAA,CAAI,UAAA;AAAA,MACvB,CAAA,oBAAA,EAAuB,KAAA,CAAM,UAAA,CAAW,GAAA,EAAK,GAAG,CAAC,CAAA;AAAA,KACnD;AACA,IAAA,MAAM,OAAA,GAAoC;AAAA,MACxC,SAAA,EAAW,eAAA,CAAgB,GAAA,EAAK,OAAA,EAAS,gBAAgB,CAAA;AAAA,MACzD,OAAA,EAAS,gBAAA;AAAA,MACT,YAAA;AAAA,MACA,SAAS,GAAA,CAAI,OAAA;AAAA,MACb,KAAA;AAAA,MACA,gBAAA,EAAkB,OAAO,KAAA,KAAU;AACjC,QAAA,MAAM,gBAAA,CAAiB,yBAAA;AAAA,UACrB,gCAAgC,KAAK;AAAA,SACvC;AAAA,MACF;AAAA,KACF;AAOA,IAAA,IAAI,OAAA,CAAQ,SAAA,CAAU,aAAA,KAAkB,MAAA,EAAW;AACjD,MAAA,MAAM,sBAAA,GAAyB,IAAI,OAAA,CAAQ,2BAAA;AAAA,QACzC,QAAQ,SAAA,CAAU;AAAA,OACpB;AACA,MAAA,IAAI,2BAA2B,MAAA,EAAW;AACxC,QAAA,MAAM,OAAA,CAAQ,iBAAiB,sBAAsB,CAAA;AAAA,MACvD;AAAA,IACF;AACA,IAAA,MAAM,OAAA,CAAQ,gBAAA,CAAiB,IAAA,CAAK,kBAAA,CAAmB,OAAO,CAAC,CAAA;AAC/D,IAAA,IAAI,gBAAA;AACJ,IAAA,IAAI;AACF,MAAA,IAAI,KAAA,GAAQ,MAAM,IAAA,CAAK,UAAA,CAAW,OAAO,CAAA;AACzC,MAAA,IAAI,mBAAmB,MAAM,6BAAA;AAAA,QAC3B,OAAA;AAAA,QACA,KAAA,CAAM;AAAA,OACR;AACA,MAAA,KAAA,IACM,SAAA,GAAY,CAAA,EAChB,SAAA,IAAa,IAAA,CAAK,aAAA,IAAiB,CAAC,IAAA,CAAK,YAAA,CAAa,KAAK,CAAA,EAC3D,SAAA,EAAA,EACA;AACA,QAAA,KAAA,GAAQ,MAAM,IAAA,CAAK,QAAA,CAAS,OAAA,EAAS,OAAO,SAAS,CAAA;AAIrD,QAAA,IAAI,YAAY,IAAA,CAAK,aAAA,IAAiB,CAAC,IAAA,CAAK,YAAA,CAAa,KAAK,CAAA,EAAG;AAC/D,UAAA,gBAAA,GAAmB,MAAM,6BAAA;AAAA,YACvB,OAAA;AAAA,YACA,KAAA,CAAM,gBAAA;AAAA,YACN;AAAA,WACF;AAAA,QACF;AAAA,MACF;AACA,MAAA,IAAI,CAAC,IAAA,CAAK,YAAA,CAAa,KAAK,CAAA,EAAG;AAC7B,QAAA,MAAM,IAAI,8BAAA;AAAA,UACR,IAAA,CAAK,SAAA;AAAA,UACL,IAAA,CAAK;AAAA,SACP;AAAA,MACF;AACA,MAAA,OAAO,MAAM,IAAA,CAAK,aAAA,CAAc,OAAA,EAAS,KAAK,CAAA;AAAA,IAChD,SAAS,KAAA,EAAO;AACd,MAAA,gBAAA,GAAmB,EAAE,KAAA,EAAM;AAC3B,MAAA,MAAM,KAAA;AAAA,IACR,CAAA,SAAE;AACA,MAAA,MAAM,oBAAA,CAAqB,OAAA,EAAS,IAAA,CAAK,OAAA,EAAS,gBAAgB,CAAA;AAAA,IACpE;AAAA,EACF,GAAG,kBAAkB,CAAA;AACvB;AAEO,SAAS,mCAAA,CACd,kBACA,gBAAA,EACS;AACT,EAAA,IAAI,gBAAA,GAAmB,oCAAoC,OAAO,KAAA;AAClE,EAAA,IAAI,gBAAA,KAAqB,QAAW,OAAO,IAAA;AAC3C,EAAA,OACE,oBAAoB,gBAAA,GAAmB,mCAAA;AAE3C;AAEA,eAAe,6BAAA,CACb,OAAA,EACA,gBAAA,EACA,gBAAA,EAC6B;AAC7B,EAAA,IACE,CAAC,mCAAA,CAAoC,gBAAA,EAAkB,gBAAgB,CAAA,EACvE;AACA,IAAA,OAAO,gBAAA;AAAA,EACT;AACA,EAAA,MAAM,SAAA,GAAY,OAAA,CAAQ,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,qBAAA;AAAA,IAC9C,OAAA,CAAQ;AAAA,GACV;AACA,EAAA,IAAI,SAAA,KAAc,QAAW,OAAO,gBAAA;AACpC,EAAA,MAAM,OAAA,CAAQ,iBAAiB,SAAS,CAAA;AACxC,EAAA,OAAO,gBAAA;AACT;AAEA,eAAe,gBAAA,CACb,SACA,iBAAA,EACe;AACf,EAAA,IAAI;AACF,IAAA,MAAM,OAAA,CAAQ,gBAAA;AAAA,MACZ,GAAA,CAAA,qBAAA,EAA2B,QAAQ,YAAY,CAAA;AAAA,KACjD;AAAA,EACF,SAAS,YAAA,EAAc;AAIrB,IAAA,IAAI,CAAC,mBAAmB,MAAM,YAAA;AAAA,EAChC;AACF;AAEA,eAAe,oBAAA,CACb,OAAA,EACA,OAAA,EACA,gBAAA,EACe;AACf,EAAA,IAAI,cAAA;AACJ,EAAA,IAAI;AACF,IAAA,MAAM,UAAU,OAAO,CAAA;AAAA,EACzB,SAAS,KAAA,EAAO;AAId,IAAA,IAAI,gBAAA,KAAqB,MAAA,EAAW,cAAA,GAAiB,EAAE,KAAA,EAAM;AAAA,EAC/D;AAEA,EAAA,MAAM,gBAAA;AAAA,IACJ,OAAA;AAAA,IACA,gBAAA,KAAqB,UAAa,cAAA,KAAmB;AAAA,GACvD;AACA,EAAA,IAAI,cAAA,KAAmB,MAAA,EAAW,MAAM,cAAA,CAAe,KAAA;AACzD;AAEA,eAAsB,wBAAA,CACpB,WACA,OAAA,EAC8B;AAC9B,EAAA,MAAM,KAAA,uBAAY,GAAA,EAA+B;AACjD,EAAA,KAAA,MAAWE,MAAAA,IAAS,WAAA,CAAY,OAAA,EAAS,SAAA,CAAU,iBAAiB,CAAA,EAAG;AACrE,IAAA,MAAM,KAAA,GAAQ,GAAA,CAAA,yBAAA,EAA+B,SAAA,CAAU,MAAA,CAAO,UAAU,CAAA,sBAAA,EAAyB,SAAA,CAAU,GAAA,CAAI,OAAO,iBAAiB,YAAA,CAAaA,MAAK,CAAC,CAAA,MAAA,EAAS,UAAU,kBAAkB,CAAA,CAAA;AAC/L,IAAA,MAAM,IAAA,GAAO,MAAM,SAAA,CAAU,OAAA,CAAQ,OAAA;AAAA,MACnC,kBAAkB,KAAK;AAAA,KACzB;AACA,IAAA,KAAA,MAAW,OAAO,IAAA,EAAM,KAAA,CAAM,IAAI,eAAA,CAAgB,GAAG,GAAG,GAAG,CAAA;AAAA,EAC7D;AACA,EAAA,OAAO,CAAC,GAAG,KAAA,CAAM,MAAA,EAAQ,CAAA,CAAE,QAAA;AAAA,IAAS,CAAC,IAAA,EAAM,KAAA,KACzC,mBAAA,CAAoB,MAAM,KAAK;AAAA,GACjC;AACF;AAQA,eAAsB,wBAAA,CACpB,SAAA,EACA,UAAA,EACA,SAAA,EACA,MAAA,EAC0C;AAC1C,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAwB;AAC5C,EAAA,KAAA,MAAW,SAAA,IAAa,UAAU,cAAA,EAAgB;AAChD,IAAA,KAAA,MAAWA,MAAAA,IAAS,WAAA,CAAY,UAAA,EAAY,SAAA,CAAU,iBAAiB,CAAA,EAAG;AACxE,MAAA,MAAM,IAAA,GAAO,MAAM,SAAA,CAAU,OAAA,CAAQ,OAAA;AAAA,QACnC,iBAAA;AAAA,UACE,qBAAA,CAAsB,SAAA,EAAWA,MAAAA,EAAO,SAAA,EAAW,SAAS;AAAA;AAC9D,OACF;AACA,MAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AAOtB,QAAA,IACE,UAAU,gBAAA,KAAqB,MAAA,IAC/B,CAAC,SAAA,CAAU,GAAA,CAAI,MAAM,CAAA,EACrB;AACA,UAAA,MAAM,IAAI,sBAAA;AAAA,YACR,oLAAA;AAAA,YACA,EAAE,MAAA,EAAQ,GAAA,CAAI,SAAA,EAAW,MAAA,EAAQ,IAAI,SAAA;AAAU,WACjD;AAAA,QACF;AACA,QAAA,MAAM,SAAA,GAAY;AAAA,UAChB,QAAQ,EAAE,EAAA,EAAI,IAAI,SAAA,EAAW,IAAA,EAAM,IAAI,WAAA,EAAY;AAAA,UACnD,QAAQ,EAAE,EAAA,EAAI,IAAI,SAAA,EAAW,IAAA,EAAM,IAAI,WAAA,EAAY;AAAA,UACnD,GAAI,SAAA,CAAU,GAAA,CAAI,MAAM,CAAA,GAAI,EAAE,MAAA,EAAQ,MAAA,CAAO,GAAA,CAAI,MAAM,CAAA,EAAE,GAAI;AAAC,SAChE;AACA,QAAA,MAAM,SAAA,GAAY,eAAA,CAAgB,SAAA,CAAU,MAAM,CAAA;AAClD,QAAA,MAAM,WAAW,MAAA,CAAO,OAAA,CAAQ,GAAA,CAAI,SAAS,GAAG,SAAS,CAAA;AACzD,QAAA,IAAI,QAAA,KAAa,MAAA,EAAW,OAAA,CAAQ,GAAA,CAAI,WAAW,QAAQ,CAAA;AAAA,MAC7D;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,OAAA;AACT;AAEO,SAAS,gBAAgB,IAAA,EAAiC;AAC/D,EAAA,OAAO,CAAA,EAAG,IAAA,CAAK,IAAI,CAAA,EAAA,EAAS,KAAK,EAAE,CAAA,CAAA;AACrC;AAOO,SAAS,sBAAA,CACd,IACA,IAAA,EAC6B;AAC7B,EAAA,IAAI,OAAO,EAAA,KAAO,QAAA,IAAY,OAAO,IAAA,KAAS,UAAU,OAAO,MAAA;AAC/D,EAAA,OAAO,eAAA,CAAgB,EAAE,EAAA,EAAI,IAAA,EAAM,CAAA;AACrC;AAEO,SAAS,mBAAA,CAAoB,MAAgB,KAAA,EAAyB;AAC3E,EAAA,OACE,iBAAA,CAAkB,IAAA,CAAK,EAAA,EAAI,KAAA,CAAM,EAAE,KACnC,iBAAA,CAAkB,IAAA,CAAK,IAAA,EAAM,KAAA,CAAM,IAAI,CAAA;AAE3C;AASA,IAAM,yBAAA,GAA4B;AAAA,EAChC,SAAA,EAAW,SAAA;AAAA,EACX,aAAA,EAAe,WAAA;AAAA,EACf,WAAA,EAAa,OAAA;AAAA,EACb,eAAA,EAAiB;AACnB,CAAA;AAEA,IAAM,yBAAA,GAA4B;AAAA,EAChC,SAAA,EAAW,OAAA;AAAA,EACX,aAAA,EAAe,SAAA;AAAA,EACf,WAAA,EAAa,SAAA;AAAA,EACb,eAAA,EAAiB;AACnB,CAAA;AAEA,SAAS,mBACP,SAAA,EAC4B;AAC5B,EAAA,QAAQ,SAAA;AAAW,IACjB,KAAK,KAAA,EAAO;AACV,MAAA,OAAO,CAAC,yBAAyB,CAAA;AAAA,IACnC;AAAA,IACA,KAAK,IAAA,EAAM;AACT,MAAA,OAAO,CAAC,yBAAyB,CAAA;AAAA,IACnC;AAAA,IACA,KAAK,MAAA,EAAQ;AACX,MAAA,OAAO,CAAC,2BAA2B,yBAAyB,CAAA;AAAA,IAC9D;AAAA;AAEJ;AAEA,SAAS,qBAAA,CACP,WACA,gBAAA,EACa;AACb,EAAA,OAAO,GAAA,CAAI,IAAA;AAAA,IACT,kBAAA,CAAmB,SAAS,CAAA,CAAE,GAAA,CAAI,CAAC,MAAA,KAAW,gBAAA,CAAiB,MAAM,CAAC,CAAA;AAAA,IACtE,GAAA,CAAA,WAAA;AAAA,GACF;AACF;AAEA,SAAS,qBAAA,CACP,SAAA,EACA,UAAA,EACA,SAAA,EACA,SAAA,EACwB;AACxB,EAAA,MAAM,gBAAgB,GAAA,CAAI,IAAA;AAAA,IACxB,UAAA,CAAW,GAAA,CAAI,CAAC,IAAA,KAAS,GAAA,CAAA,CAAA,EAAO,KAAK,EAAE,CAAA,EAAA,EAAK,IAAA,CAAK,IAAI,CAAA,CAAA,CAAG,CAAA;AAAA,IACxD,GAAA,CAAA,EAAA;AAAA,GACF;AACA,EAAA,MAAM,UAAA,GAAa,sDAAsD,aAAa,CAAA,CAAA,CAAA;AAEtF,EAAA,MAAM,SAAA,GAAY,qBAAA;AAAA,IAAsB,SAAA;AAAA,IAAW,CAAC,MAAA,KAClD,2BAAA;AAAA,MACE,SAAA;AAAA,MACA,GAAA,CAAA,WAAA,CAAA;AAAA,MACA,GAAA,CAAA,IAAA,CAAA;AAAA,MACA,SAAA;AAAA,MACA,MAAA,CAAO,SAAA;AAAA,MACP,MAAA,CAAO,aAAA;AAAA,MACP,MAAA,CAAO,WAAA;AAAA,MACP,MAAA,CAAO;AAAA;AACT,GACF;AACA,EAAA,OAAO,GAAA,CAAA,EAAM,UAAU,CAAA,CAAA,EAAI,SAAS,CAAA,CAAA;AACtC;AAEO,SAAS,4BAAA,CACd,SAAA,EACA,YAAA,EACA,YAAA,EACA,WACA,SAAA,EACa;AACb,EAAA,OAAO,qBAAA;AAAA,IAAsB,SAAA;AAAA,IAAW,CAAC,MAAA,KACvC,2BAAA;AAAA,MACE,SAAA;AAAA,MACA,YAAA;AAAA,MACA,YAAA;AAAA,MACA,SAAA;AAAA,MACA,MAAA,CAAO,SAAA;AAAA,MACP,MAAA,CAAO,aAAA;AAAA,MACP,MAAA,CAAO,WAAA;AAAA,MACP,MAAA,CAAO;AAAA;AACT,GACF;AACF;AASO,SAAS,iCACd,SAAA,EACA,YAAA,EACA,YAAA,EACA,SAAA,EACA,WACA,gBAAA,EACa;AACb,EAAA,OAAO,qBAAA;AAAA,IAAsB,SAAA;AAAA,IAAW,CAAC,MAAA,KACvC,+BAAA;AAAA,MACE,SAAA;AAAA,MACA,YAAA;AAAA,MACA,YAAA;AAAA,MACA,SAAA;AAAA,MACA,MAAA,CAAO,SAAA;AAAA,MACP,MAAA,CAAO,aAAA;AAAA,MACP,MAAA,CAAO,WAAA;AAAA,MACP,MAAA,CAAO,eAAA;AAAA,MACP;AAAA;AACF,GACF;AACF;AAEA,SAAS,2BAAA,CACP,WACA,eAAA,EACA,YAAA,EACA,WACA,SAAA,EACA,aAAA,EACA,aACA,eAAA,EACwB;AACxB,EAAA,MAAM,aAAA,GAAgB,+BAAA;AAAA,IACpB,SAAA;AAAA,IACA,eAAA;AAAA,IACA,YAAA;AAAA,IACA,SAAA;AAAA,IACA,SAAA;AAAA,IACA,aAAA;AAAA,IACA,WAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,MAAM,YAAA,GACJ,SAAA,CAAU,gBAAA,KAAqB,MAAA,GAAY,GAAA,CAAA,CAAA,GAAQ,GAAA,CAAA,iBAAA,CAAA;AACrD,EAAA,OAAO,GAAA,CAAA,yFAAA,EAA+F,YAAY,CAAA,OAAA,EAAU,aAAa,mBAAmB,SAAA,CAAU,MAAA,CAAO,UAAU,CAAA,mBAAA,EAAsB,SAAA,CAAU,GAAA,CAAI,OAAO,CAAA,uEAAA,EAA0E,UAAU,kBAAkB,CAAA,CAAA;AAC1U;AAEA,SAAS,+BAAA,CACP,WACA,eAAA,EACA,YAAA,EACA,WACA,SAAA,EACA,aAAA,EACA,WAAA,EACA,eAAA,EACA,gBAAA,EACwB;AACxB,EAAA,MAAM,iBAAiB,iBAAA,CAAkB,GAAA,CAAI,GAAA,CAAI,QAAQ,GAAG,SAAS,CAAA;AACrE,EAAA,MAAM,eACJ,SAAA,CAAU,gBAAA,KAAqB,SAC7B,GAAA,CAAA,CAAA,GACA,GAAA,CAAA,EAAA,EAAQ,UAAU,gBAAgB,CAAA,UAAA,CAAA;AACtC,EAAA,MAAM,aAAA,GACJ,gBAAA,KAAqB,MAAA,GAAY,GAAA,CAAA,CAAA,GAAQ,QAAQ,gBAAgB,CAAA,CAAA;AACnE,EAAA,OAAO,+DAA+D,aAAa,CAAA,IAAA,EAAO,IAAI,GAAA,CAAI,WAAW,CAAC,CAAA,iBAAA,EAAoB,GAAA,CAAI,GAAA,CAAI,eAAe,CAAC,CAAA,eAAA,EAAkB,YAAY,SAAS,eAAe,CAAA,QAAA,EAAW,UAAU,MAAA,CAAO,UAAU,CAAA,QAAA,EAAW,GAAA,CAAI,IAAI,SAAS,CAAC,sBAAsB,GAAA,CAAI,GAAA,CAAI,aAAa,CAAC,CAAA,gCAAA,EAAmC,SAAA,CAAU,GAAA,CAAI,OAAO,CAAA,OAAA,EAAU,YAAY,QAAQ,cAAc,CAAA,KAAA,EAAQ,UAAU,kBAAkB,CAAA,CAAA;AACzc;AAEA,SAAS,WAAA,CACP,QACA,SAAA,EAC2B;AAC3B,EAAA,MAAM,SAAgB,EAAC;AACvB,EAAA,KAAA,IAAS,SAAS,CAAA,EAAG,MAAA,GAAS,MAAA,CAAO,MAAA,EAAQ,UAAU,SAAA,EAAW;AAChE,IAAA,MAAA,CAAO,KAAK,MAAA,CAAO,KAAA,CAAM,MAAA,EAAQ,MAAA,GAAS,SAAS,CAAC,CAAA;AAAA,EACtD;AACA,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,eAAA,CACP,GAAA,EACA,OAAA,EACA,OAAA,EACyB;AACzB,EAAA,MAAM,QAAA,GAAW,sBAAA,CAAuB,GAAA,EAAK,OAAO,CAAA;AACpD,EAAA,MAAM,mBAAmB,kBAAA,EAAmB;AAC5C,EAAA,MAAM,qBAAqB,qBAAA,CAAsB;AAAA,IAC/C,MAAM,QAAA,CAAS,YAAA;AAAA,IACf,GAAI,SAAS,IAAA,KAAS,MAAA,GAAY,EAAC,GAAI,EAAE,IAAA,EAAM,QAAA,CAAS,IAAA,EAAK;AAAA,IAC7D,GAAI,SAAS,YAAA,KAAiB,MAAA,GAC5B,EAAC,GACD,EAAE,YAAA,EAAc,QAAA,CAAS,YAAA,EAAa;AAAA,IACxC,UAAA,EAAY,GAAA;AAAA,IACZ;AAAA,GACD,CAAA;AACD,EAAA,MAAM,qBAAqB,qBAAA,CAAsB;AAAA,IAC/C,MAAM,QAAA,CAAS,YAAA;AAAA,IACf,GAAI,SAAS,IAAA,KAAS,MAAA,GAAY,EAAC,GAAI,EAAE,IAAA,EAAM,QAAA,CAAS,IAAA,EAAK;AAAA,IAC7D,GAAI,SAAS,YAAA,KAAiB,MAAA,GAC5B,EAAC,GACD,EAAE,YAAA,EAAc,QAAA,CAAS,YAAA,EAAa;AAAA,IACxC,UAAA,EAAY,GAAA;AAAA,IACZ;AAAA,GACD,CAAA;AACD,EAAA,MAAM,gBAAA,GACJ,OAAA,CAAQ,cAAA,KAAmB,MAAA,GACzB,MAAA,GACA,uBAAA;AAAA,IACE,GAAA,CAAI,OAAA;AAAA,IACJ,OAAA,CAAQ,cAAA;AAAA,IACR,OAAA,CAAQ;AAAA,GACV;AACJ,EAAA,MAAM,SAAA,GAAY,QAAQ,SAAA,IAAa,KAAA;AACvC,EAAA,MAAM,WAAA,GAAc,SAAA,KAAc,MAAA,GAAS,CAAA,GAAI,CAAA;AAC/C,EAAA,MAAM,cAAA,GACJ,OAAA,CAAQ,YAAA,CAAa,iBAAA,IAAqB,2BAAA;AAC5C,EAAA,MAAM,iBAAA,GACJ,4CAAA,IACC,gBAAA,KAAqB,MAAA,GAAY,CAAA,GAChC,0CAAA,CAAA;AAEJ,EAAA,MAAM,kBAAkB,WAAA,GAAc,iBAAA;AACtC,EAAA,MAAM,eAAe,cAAA,GAAiB,eAAA;AACtC,EAAA,MAAM,oBAAA,GAAuB,IAAA,CAAK,KAAA,CAAM,YAAA,IAAgB,cAAc,CAAA,CAAE,CAAA;AACxE,EAAA,IAAI,uBAAuB,CAAA,EAAG;AAC5B,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,oGAAA;AAAA,MACA,EAAE,gBAAgB,SAAA;AAAU,KAC9B;AAAA,EACF;AACA,EAAA,MAAM,cAAA,GAAiB,WAAA;AAAA,IACrB,CAAC,GAAG,IAAI,IAAI,OAAA,CAAQ,KAAK,CAAC,CAAA,CAAE,QAAA;AAAA,MAAS,CAAC,IAAA,EAAM,KAAA,KAC1C,cAAA,CAAe,MAAM,KAAK;AAAA,KAC5B;AAAA,IACA;AAAA,GACF;AACA,EAAA,MAAM,uBAAuB,IAAA,CAAK,GAAA;AAAA,IAChC,GAAG,cAAA,CAAe,GAAA,CAAI,CAACA,MAAAA,KAAUA,OAAM,MAAM;AAAA,GAC/C;AACA,EAAA,MAAM,oBAAoB,IAAA,CAAK,KAAA;AAAA,IAAA,CAC5B,cAAA,GACC,WAAA,IAAe,oBAAA,GAAuB,iBAAA,CAAA,IACtC;AAAA,GACJ;AACA,EAAA,IAAI,oBAAoB,CAAA,EAAG;AACzB,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,uGAAA;AAAA,MACA,EAAE,gBAAgB,SAAA;AAAU,KAC9B;AAAA,EACF;AAEA,EAAA,OAAO;AAAA,IACL,OAAA;AAAA,IACA,GAAA;AAAA,IACA,cAAA;AAAA,IACA,SAAA;AAAA,IACA,iBAAA;AAAA,IACA,kBAAA;AAAA,IACA,kBAAA;AAAA,IACA,MAAA,EAAQ,iBAAA,CAAkB,GAAA,EAAK,OAAO,CAAA;AAAA,IACtC,aAAA,EAAe,oBAAA,CAAqB,OAAA,CAAQ,aAAa,CAAA;AAAA,IACzD;AAAA,GACF;AACF;AAcA,SAAS,uBAAA,CACP,OAAA,EACA,cAAA,EACA,aAAA,EACa;AACb,EAAA,MAAM,YAAY,OAAA,CAAQ,iBAAA;AAAA,IACxB,GAAA,CAAI,IAAI,SAAS,CAAA;AAAA,IACjB,WAAA,CAAY,CAAC,cAAc,CAAC;AAAA,GAC9B;AACA,EAAA,OAAO,kBAAkB,MAAA,GAAY,SAAA,GACjC,GAAA,CAAA,SAAA,EAAe,SAAS,KAAK,aAAa,CAAA,CAAA,CAAA;AAEhD;AAQO,SAAS,2BAA2B,GAAA,EAAgC;AACzE,EAAA,OACE,IAAI,OAAA,CAAQ,YAAA,CAAa,YAAA,IACzB,GAAA,CAAI,QAAQ,YAAA,CAAa,cAAA,EAAgB,SAAA,KAAc,KAAA,IACvD,IAAI,OAAA,CAAQ,YAAA,CAAa,cAAc,KAAA,IACvC,GAAA,CAAI,QAAQ,yBAAA,KAA8B,MAAA;AAE9C;AAEA,SAAS,2BACP,OAAA,EAC2B;AAC3B,EAAA,IAAI,OAAA,CAAQ,8BAA8B,MAAA,EAAW;AACnD,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,4FAAA;AAAA,MACA,EAAE,OAAA,EAAS,OAAA,CAAQ,OAAA,EAAQ;AAAA,MAC3B;AAAA,QACE,UAAA,EACE;AAAA;AACJ,KACF;AAAA,EACF;AACA,EAAA,OAAO,OAAA;AACT;;;ACnwBA,IAAM,wCAAA,GAA2C,GAAA;AAGjD,eAAsB,uBAAA,CACpB,KACA,OAAA,EACgD;AAChD,EAAA,eAAA,CAAgB,QAAQ,KAAK,CAAA;AAC7B,EAAA,6BAAA,CAA8B,KAAK,kBAAA,EAAoB;AAAA,IACrD,uBAAA,EAAyB;AAAA,GAC1B,CAAA;AACD,EAAA,MAAM,aAAA,GAAgB,oBAAA;AAAA,IACpB,OAAA,CAAQ,aAAA;AAAA,IACR,wCAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,MAAM,SAAA,GAAY,kBAAA,CAAmB,OAAA,CAAQ,SAAS,CAAA;AACtD,EAAA,MAAM,MAAA,GAAsB;AAAA,IAC1B,UAAU,yBAAA,EAA0B;AAAA,IACpC,aAAA;AAAA,IACA,eAAA,EAAiB,QAAQ,eAAA,IAAmB;AAAA,GAC9C;AACA,EAAA,MAAM,gBAAA,GAA6C;AAAA,IACjD,OAAO,OAAA,CAAQ,KAAA;AAAA,IACf,SAAA,EAAW,MAAA;AAAA,IACX,GAAG,oBAAoB,OAAO,CAAA;AAAA,IAC9B,GAAI,QAAQ,aAAA,KAAkB,MAAA,GAC5B,EAAC,GACD,EAAE,aAAA,EAAe,OAAA,CAAQ,aAAA;AAAc,GAC3C;AAEA,EAAA,OAAO,0BAAA,CAA2B,KAAK,gBAAA,EAAkB;AAAA,IACvD,SAAA,EAAW,kBAAA;AAAA,IACX,aAAA;AAAA,IACA,kBAAA;AAAA,IACA,UAAA,EAAY,CAAC,OAAA,KAAY,uBAAA,CAAwB,SAAS,SAAS,CAAA;AAAA,IACnE,QAAA,EAAU,CAAC,OAAA,EAAS,KAAA,EAAO,cACzB,wBAAA,CAAyB,OAAA,EAAS,KAAA,EAAO,SAAA,EAAW,MAAM,CAAA;AAAA,IAC5D,aAAa,KAAA,EAAO;AAClB,MAAA,OAAO,KAAA,CAAM,YAAA,KAAiB,CAAA,IAAK,KAAA,CAAM,SAAA;AAAA,IAC3C,CAAA;AAAA,IACA,aAAA,EAAe,kBAAA;AAAA,IACf,OAAA,EAAS;AAAA,GACV,CAAA;AACH;AAYA,SAAS,yBAAA,GAA4B;AACnC,EAAA,MAAM,YAAA,uBAAmB,GAAA,EAAsC;AAC/D,EAAA,IAAI,aAAA;AAGJ,EAAA,OAAO;AAAA;AAAA,IAEL,aAAa,WAAA,EAA6C;AACxD,MAAA,MAAM,KAAA,uBAAY,GAAA,EAGhB;AACF,MAAA,KAAA,MAAW,OAAO,WAAA,EAAa;AAC7B,QAAA,MAAM,IAAA,GAAO,gBAAgB,EAAE,EAAA,EAAI,IAAI,OAAA,EAAS,IAAA,EAAM,GAAA,CAAI,SAAA,EAAW,CAAA;AACrE,QAAA,MAAM,QAAQ,eAAA,CAAgB;AAAA,UAC5B,IAAI,GAAA,CAAI,QAAA;AAAA,UACR,MAAM,GAAA,CAAI;AAAA,SACX,CAAA;AACD,QAAA,MAAM,MAAA,GAAS,YAAA,CAAa,GAAA,CAAI,IAAI,CAAA,IAAK,IAAA;AACzC,QAAA,KAAA,CAAM,GAAA,CAAI,IAAA,EAAM,EAAE,MAAA,EAAQ,OAAO,CAAA;AACjC,QAAA,YAAA,CAAa,GAAA,CAAI,MAAM,KAAK,CAAA;AAAA,MAC9B;AACA,MAAA,MAAM,UAAA,GAAa,aAAA;AACnB,MAAA,aAAA,GAAgB,KAAA;AAChB,MAAA,IAAI,UAAA,EAAY,IAAA,KAAS,KAAA,CAAM,IAAA,EAAM,OAAO,KAAA;AAC5C,MAAA,IAAI,KAAA,CAAM,IAAA,KAAS,CAAA,EAAG,OAAO,KAAA;AAC7B,MAAA,KAAA,MAAW,CAAC,IAAA,EAAM,MAAM,CAAA,IAAK,KAAA,EAAO;AAClC,QAAA,IAAI,WAAW,GAAA,CAAI,IAAI,GAAG,MAAA,KAAW,MAAA,CAAO,OAAO,OAAO,KAAA;AAAA,MAC5D;AACA,MAAA,OAAO,IAAA;AAAA,IACT;AAAA,GACF;AACF;AAEA,SAAS,mBAAmB,OAAA,EAAgD;AAC1E,EAAA,OAAO,GAAA;AAAA,sBAAA,EACe,QAAQ,YAAY,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAAA,CAAA;AAc5C;AAKA,SAAS,wBAAwB,OAAA,EAAmC;AAClE,EAAA,OAAO,GAAA,CAAI,UAAA;AAAA,IACT,yBAAyB,OAAA,CAAQ,KAAA,CAAM,UAAA,CAAW,GAAA,EAAK,GAAG,CAAC,CAAA;AAAA,GAC7D;AACF;AAEA,SAAS,sBAAsB,OAAA,EAAmC;AAChE,EAAA,OAAO,GAAA,CAAI,UAAA;AAAA,IACT,yBAAyB,OAAA,CAAQ,KAAA,CAAM,UAAA,CAAW,GAAA,EAAK,GAAG,CAAC,CAAA;AAAA,GAC7D;AACF;AAEA,eAAe,uBAAA,CACb,SACA,SAAA,EACyB;AACzB,EAAA,MAAM,EAAE,SAAA,EAAW,YAAA,EAAc,OAAA,EAAS,OAAM,GAAI,OAAA;AACpD,EAAA,MAAM,cAAA,GAAiB,0BAA0B,SAAS,CAAA;AAC1D,EAAA,MAAM,QAAQ,gBAAA,CAAiB,GAAA;AAAA,gBAAA,EACf,YAAY;AAAA;AAAA;AAAA;AAAA,MAAA,EAItB,OAAO,KAAK,KAAK,CAAA;AAAA,SAAA,EACd,SAAA,CAAU,OAAO,UAAU,CAAA;AAAA,uBAAA,EACb,OAAO;AAAA,UAAA,EACpB,cAAc;AAAA,UAAA,EACd,UAAU,kBAAkB;AAAA,EAAA,CACrC,CAAA;AACD,EAAA,MAAM,QAAQ,gBAAA,CAAiB,GAAA;AAAA,iBAAA,EACd,uBAAA,CAAwB,OAAO,CAAC;AAAA,OAAA,EAC1C,YAAY,CAAA;AAAA,EAAA,CAClB,CAAA;AACD,EAAA,MAAM,QAAQ,gBAAA,CAAiB,GAAA;AAAA,iBAAA,EACd,qBAAA,CAAsB,OAAO,CAAC;AAAA,OAAA,EACxC,YAAY,CAAA;AAAA,EAAA,CAClB,CAAA;AACD,EAAA,MAAM,aAAA,GAAgB,wBAAwB,OAAO,CAAA;AACrD,EAAA,MAAM,QAAQ,gBAAA,CAAiB,GAAA;AAAA,sBAAA,EACT,aAAa,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAAA,CAOlC,CAAA;AACD,EAAA,KAAA,MAAW,SAAA,IAAa,UAAU,cAAA,EAAgB;AAChD,IAAA,MAAM,yBAAA,CAA0B,SAAS,SAAS,CAAA;AAAA,EACpD;AACA,EAAA,MAAM,gBAAA,GACJ,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,sBAAsB,aAAa,CAAA;AAC3D,EAAA,IAAI,qBAAqB,MAAA,EAAW;AAClC,IAAA,MAAM,OAAA,CAAQ,iBAAiB,gBAAgB,CAAA;AAAA,EACjD;AAEA,EAAA,MAAM,gBAAA,GAAmB,MAAM,qBAAA,CAAsB,OAAO,CAAA;AAC5D,EAAA,OAAO;AAAA,IACL,YAAA,EAAc,gBAAA;AAAA,IACd,gBAAA;AAAA,IACA,SAAA,EAAW,KAAA;AAAA,IACX,eAAA,EAAiB;AAAA,GACnB;AACF;AAEA,eAAe,wBAAA,CACb,OAAA,EACA,KAAA,EACA,SAAA,EACA,MAAA,EACyB;AAGzB,EAAA,IAAI,YAAY,CAAA,EAAG;AACjB,IAAA,MAAM,mBAAA,CAAoB,SAAS,SAAS,CAAA;AAAA,EAC9C;AACA,EAAA,MAAM,mBAAA,CAAoB,SAAS,SAAS,CAAA;AAC5C,EAAA,MAAM,WAAA,GAAc,MAAM,eAAA,CAAgB,OAAA,EAAS,SAAS,CAAA;AAC5D,EAAA,MAAM,IAAA,GAAuB;AAAA,IAC3B,cAAc,WAAA,CAAY,MAAA;AAAA,IAC1B,kBAAkB,KAAA,CAAM,gBAAA;AAAA,IACxB,SAAA,EAAW,KAAA;AAAA,IACX,eAAA,EAAiB;AAAA,GACnB;AACA,EAAA,IAAI,IAAA,CAAK,YAAA,KAAiB,CAAA,EAAG,OAAO,IAAA;AACpC,EAAA,IAAI,MAAM,eAAA,EAAiB,OAAO,EAAE,GAAG,IAAA,EAAM,WAAW,IAAA,EAAK;AAC7D,EAAA,IAAI,MAAA,CAAO,QAAA,CAAS,YAAA,CAAa,WAAW,CAAA,EAAG;AAC7C,IAAA,OAAO,kBAAA,CAAmB,IAAA,EAAM,SAAA,EAAW,MAAM,CAAA;AAAA,EACnD;AACA,EAAA,IACE,MAAA,CAAO,eAAA,KAAoB,QAAA,IAC3B,SAAA,KAAc,OAAO,aAAA,EACrB;AACA,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,SAAA,EAAW,IAAA,EAAK;AAAA,EACpC;AACA,EAAA,OAAO,IAAA;AACT;AAQA,SAAS,kBAAA,CACP,KAAA,EACA,SAAA,EACA,MAAA,EACgB;AAChB,EAAA,IAAI,MAAA,CAAO,oBAAoB,OAAA,EAAS;AACtC,IAAA,MAAM,IAAI,8BAAA;AAAA,MACR,kBAAA;AAAA,MACA,MAAA,CAAO,aAAA;AAAA,MACP,EAAE,aAAa,IAAA;AAAK,KACtB;AAAA,EACF;AACA,EAAA,MAAM,SAAA,GAAY,OAAO,aAAA,GAAgB,SAAA;AACzC,EAAA,IAAI,SAAA,GAAY,MAAM,CAAA,EAAG,OAAO,EAAE,GAAG,KAAA,EAAO,WAAW,IAAA,EAAK;AAC5D,EAAA,OAAO,EAAE,GAAG,KAAA,EAAO,eAAA,EAAiB,IAAA,EAAK;AAC3C;AAGA,eAAe,mBAAA,CACb,SACA,SAAA,EACe;AACf,EAAA,MAAM,EAAE,YAAA,EAAc,OAAA,EAAS,KAAA,EAAM,GAAI,OAAA;AACzC,EAAA,MAAM,aAAA,GAAgB,wBAAwB,OAAO,CAAA;AAKrD,EAAA,MAAM,QAAQ,gBAAA,CAAiB,GAAA;AAAA;AAAA;AAAA,WAAA,EAGpB,YAAY,CAAA;AAAA,WAAA,EACZ,aAAa,CAAA;AAAA;AAAA;AAAA,+BAAA,EAGO,OAAO;AAAA,6BAAA,EACT,KAAK;AAAA,oCAAA,EACE,YAAY,CAAC;AAAA;AAAA,WAAA,EAEtC,YAAY,CAAA;AAAA,uBAAA,EACA,SAAS;AAAA;AAAA,4BAAA,EAEJ,OAAO;AAAA,0BAAA,EACT,KAAK;AAAA;AAAA;AAAA,EAAA,CAG9B,CAAA;AACH;AAQA,eAAe,yBAAA,CACb,SACA,SAAA,EACe;AACf,EAAA,MAAM,EAAE,SAAA,EAAW,YAAA,EAAc,OAAA,EAAS,OAAM,GAAI,OAAA;AACpD,EAAA,MAAM,SAAA,GAAY,gCAAA;AAAA,IAChB,SAAA;AAAA,IACA,YAAA;AAAA,IACA,GAAA;AAAA,mBAAA,EACiB,OAAO;AAAA,qBAAA,EACL,KAAK;AAAA,IAAA,CAAA;AAAA,IAExB,MAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,MAAM,aAAA,GAAgB,wBAAwB,OAAO,CAAA;AACrD,EAAA,MAAM,QAAQ,gBAAA,CAAiB,GAAA;AAAA,gBAAA,EACf,aAAa;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAAA,EAOnB,SAAS,CAAA;AAAA,SAAA,EACV,YAAY,CAAA;AAAA,oCAAA,EACe,OAAO;AAAA,mCAAA,EACR,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAAA,CAOvC,CAAA;AACH;AAEA,eAAe,mBAAA,CACb,SACA,SAAA,EACe;AACf,EAAA,MAAM,EAAE,SAAA,EAAW,YAAA,EAAc,OAAA,EAAS,OAAM,GAAI,OAAA;AACpD,EAAA,MAAM,aAAA,GAAgB,wBAAwB,OAAO,CAAA;AACrD,EAAA,MAAM,QAAA,GAAW,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,gBAAA,CAAqB,CAAA;AACvE,EAAA,MAAM,UAAA,GAAa,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,kBAAA,CAAuB,CAAA;AAC3E,EAAA,MAAM,OAAA,GAAU,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,eAAA,CAAoB,CAAA;AACrE,EAAA,MAAM,SAAA,GAAY,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,iBAAA,CAAsB,CAAA;AACzE,EAAA,MAAM,QAAQ,gBAAA,CAAiB,GAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,WAAA,EAQpB,aAAa,CAAA;AAAA,WAAA,EACb,YAAY,CAAA;AAAA,6BAAA,EACM,OAAO;AAAA,4BAAA,EACR,KAAK;AAAA,kCAAA,EACC,SAAS;AAAA;AAAA;AAAA,WAAA,EAGhC,YAAY,CAAA;AAAA,+BAAA,EACQ,OAAO;AAAA,8BAAA,EACR,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,uBAAA,EAeZ,UAAU,KAAK,QAAQ;AAAA,qCAAA,EACT,OAAO,KAAK,SAAS;AAAA;AAAA;AAAA;AAAA,WAAA,EAI/C,YAAY,CAAA;AAAA;AAAA;AAAA;AAAA,4BAAA,EAIK,OAAO;AAAA,0BAAA,EACT,KAAK;AAAA,gCAAA,EACC,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAAA,CAQxC,CAAA;AACH;AAEA,SAAS,eAAA,CACP,SACA,SAAA,EACgC;AAIhC,EAAA,OAAO,QAAQ,OAAA,CAAQ,OAAA;AAAA,IACrB,iBAAA,CAAkB,GAAA;AAAA,aAAA,EACP,QAAQ,YAAY;AAAA;AAAA;AAAA,0BAAA,EAGP,SAAS;AAAA,uBAAA,EACZ,QAAQ,OAAO;AAAA,qBAAA,EACjB,QAAQ,KAAK;AAAA,2BAAA,EACP,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,CAKjC;AAAA,GACH;AACF;AAEA,eAAe,mBACb,OAAA,EACgD;AAChD,EAAA,MAAM,EAAE,WAAU,GAAI,OAAA;AACtB,EAAA,MAAM,OAAA,GAAU,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,QAAA,CAAa,CAAA;AAC9D,EAAA,MAAM,SAAA,GAAY,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,UAAA,CAAe,CAAA;AAClE,EAAA,MAAM,MAAA,GAAS,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,OAAA,CAAY,CAAA;AAC5D,EAAA,MAAM,QAAA,GAAW,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,SAAA,CAAc,CAAA;AAChE,EAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,OAAA,CAAQ,OAAA;AAAA,IACjC,iBAAA,CAAkB,GAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,WAAA,EAMT,QAAQ,YAAY;AAAA,uBAAA,EACR,OAAA,CAAQ,OAAO,CAAA,cAAA,EAAiB,OAAA,CAAQ,KAAK;AAAA,eAAA,EACrD,OAAO,CAAA,EAAA,EAAK,SAAS,CAAA,EAAA,EAAK,MAAM,KAAK,QAAQ;AAAA,IAAA,CACzD;AAAA,GACH;AAEA,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,MAAS;AAAA,IACxB,IAAI,GAAA,CAAI,OAAA;AAAA,IACR,MAAM,GAAA,CAAI,SAAA;AAAA,IACV,SAAS,GAAA,CAAI,QAAA;AAAA,IACb,WAAW,GAAA,CAAI;AAAA,GACjB,CAAE,CAAA;AACJ;AAEA,eAAe,kBACb,OAAA,EACe;AACf,EAAA,MAAM,OAAA,CAAQ,gBAAA;AAAA,IACZ,GAAA,CAAA,qBAAA,EAA2B,uBAAA,CAAwB,OAAO,CAAC,CAAA;AAAA,GAC7D;AACF;;;AC1aA,IAAM,sBAAA,GAAyB,IAAA;AAC/B,IAAM,iBAAA,GAAoB,IAAA;AAC1B,IAAM,sBAAA,GAAyB,GAAA;AAE/B,IAAM,wBAAA,GAA2B,CAAA;AAEjC,IAAM,uCAAA,GAA0C,CAAA;AAGhD,eAAsB,eAAA,CACpB,KACA,OAAA,EACmC;AACnC,EAAA,OAAO,wBAAA,CAAyB,GAAA,EAAK,OAAA,EAAS,MAAS,CAAA;AACzD;AAGA,eAAsB,2BAAA,CACpB,KACA,OAAA,EACmC;AACnC,EAAA,OAAO,yBAAyB,GAAA,EAAK,OAAA,EAAS,cAAA,CAAe,OAAA,CAAQ,KAAK,CAAC,CAAA;AAC7E;AAEA,SAAS,wBAAA,CACP,GAAA,EACA,OAAA,EACA,KAAA,EACmC;AACnC,EAAA,MAAM,SAAA,GACJ,KAAA,KAAU,MAAA,GAAY,UAAA,GAAa,sBAAA;AACrC,EAAA,eAAA,CAAgB,QAAQ,KAAK,CAAA;AAC7B,EAAA,6BAAA,CAA8B,KAAK,SAAS,CAAA;AAC5C,EAAA,MAAM,QAAA,GAAW,sBAAA,CAAuB,OAAA,EAAS,SAAS,CAAA;AAC1D,EAAA,MAAM,gBAAA,GAA6C;AAAA,IACjD,OAAO,OAAA,CAAQ,KAAA;AAAA,IACf,SAAA,EAAW,QAAQ,SAAA,IAAa,KAAA;AAAA,IAChC,GAAG,oBAAoB,OAAO,CAAA;AAAA,IAC9B,GAAI,QAAQ,aAAA,KAAkB,MAAA,GAC5B,EAAC,GACD,EAAE,aAAA,EAAe,OAAA,CAAQ,aAAA;AAAc,GAC3C;AAEA,EAAA,OAAO,0BAAA,CAA2B,KAAK,gBAAA,EAAkB;AAAA,IACvD,SAAA;AAAA,IACA,eAAe,QAAA,CAAS,aAAA;AAAA,IACxB,kBAAA,EAAAC,mBAAAA;AAAA,IACA,YAAY,CAAC,OAAA,KACX,uBAAuB,OAAA,EAAS,QAAA,CAAS,WAAW,KAAK,CAAA;AAAA,IAC3D,QAAA,EAAU,CAAC,OAAA,EAAS,KAAA,KAClB,uBAAuB,OAAA,EAAS,KAAA,EAAO,SAAS,aAAa,CAAA;AAAA,IAC/D,aAAa,KAAA,EAAO;AAClB,MAAA,OAAO,KAAA,CAAM,iBAAiB,QAAA,CAAS,SAAA;AAAA,IACzC,CAAA;AAAA,IACA,aAAA,EAAe;AAAA,GAChB,CAAA;AACH;AAEA,SAAS,sBAAA,CACP,SACA,SAAA,EACyB;AACzB,EAAA,MAAM,aAAA,GAAgB,QAAQ,aAAA,IAAiB,sBAAA;AAC/C,EAAA,IACE,CAAC,OAAO,QAAA,CAAS,aAAa,KAC9B,aAAA,GAAgB,CAAA,IAChB,iBAAiB,CAAA,EACjB;AACA,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,yDAAA,EAA4D,MAAA,CAAO,aAAa,CAAC,CAAA,CAAA,CAAA;AAAA,MACjF,EAAE,aAAA;AAAc,KAClB;AAAA,EACF;AAEA,EAAA,MAAM,SAAA,GAAY,QAAQ,SAAA,IAAa,iBAAA;AACvC,EAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,SAAS,CAAA,IAAK,aAAa,CAAA,EAAG;AACjD,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,0DAAA,EAA6D,MAAA,CAAO,SAAS,CAAC,CAAA,CAAA,CAAA;AAAA,MAC9E,EAAE,SAAA;AAAU,KACd;AAAA,EACF;AAEA,EAAA,OAAO;AAAA,IACL,aAAA;AAAA,IACA,SAAA;AAAA,IACA,aAAA,EAAe,oBAAA;AAAA,MACb,OAAA,CAAQ,aAAA;AAAA,MACR,sBAAA;AAAA,MACA;AAAA,KACF;AAAA,IACA,SAAA,EAAW,kBAAA,CAAmB,OAAA,CAAQ,SAAS;AAAA,GACjD;AACF;AAEA,SAAS,eACP,KAAA,EAC2B;AAC3B,EAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AACtB,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,mDAAA;AAAA,MACA,EAAE,KAAA;AAAM,KACV;AAAA,EACF;AAEA,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAqC;AAC1D,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AAGxB,IAAA,IACE,OAAO,IAAA,CAAK,EAAA,KAAO,QAAA,IACnB,IAAA,CAAK,GAAG,MAAA,KAAW,CAAA,IACnB,IAAA,CAAK,EAAA,CAAG,QAAA,CAAS,IAAQ,KACzB,OAAO,IAAA,CAAK,IAAA,KAAS,QAAA,IACrB,IAAA,CAAK,IAAA,CAAK,MAAA,KAAW,CAAA,IACrB,IAAA,CAAK,IAAA,CAAK,QAAA,CAAS,IAAQ,CAAA,EAC3B;AACA,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,0FAAA;AAAA,QACA,EAAE,IAAA;AAAK,OACT;AAAA,IACF;AACA,IAAA,MAAM,MAAA,GAAS,KAAK,MAAA,IAAU,CAAA;AAC9B,IAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,MAAM,CAAA,IAAK,UAAU,CAAA,EAAG;AAC3C,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,CAAA,yEAAA,EAA4E,MAAA,CAAO,MAAM,CAAC,CAAA,CAAA,CAAA;AAAA,QAC1F,EAAE,IAAA;AAAK,OACT;AAAA,IACF;AACA,IAAA,MAAM,GAAA,GAAM,gBAAgB,IAAI,CAAA;AAChC,IAAA,MAAM,QAAA,GAAW,QAAA,CAAS,GAAA,CAAI,GAAG,CAAA;AACjC,IAAA,MAAM,cAAA,GAAA,CAAkB,QAAA,EAAU,MAAA,IAAU,CAAA,IAAK,MAAA;AACjD,IAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,cAAc,CAAA,EAAG;AACpC,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,gFAAA;AAAA,QACA,EAAE,IAAA;AAAK,OACT;AAAA,IACF;AACA,IAAA,QAAA,CAAS,GAAA,CAAI,GAAA,EAAK,EAAE,EAAA,EAAI,IAAA,CAAK,EAAA,EAAI,IAAA,EAAM,IAAA,CAAK,IAAA,EAAM,MAAA,EAAQ,cAAA,EAAgB,CAAA;AAAA,EAC5E;AAEA,EAAA,MAAM,aAAA,GAAgB,CAAC,GAAG,QAAA,CAAS,QAAQ,CAAA;AAC3C,EAAA,IAAI,aAAA,GAAgB,CAAA;AACpB,EAAA,KAAA,MAAW,QAAQ,aAAA,EAAe;AAChC,IAAA,aAAA,GAAgB,IAAA,CAAK,GAAA,CAAI,aAAA,EAAe,IAAA,CAAK,MAAM,CAAA;AAAA,EACrD;AACA,EAAA,MAAM,cAAc,aAAA,CAAc,MAAA;AAAA,IAChC,CAAC,KAAA,EAAO,IAAA,KAAS,KAAA,GAAQ,KAAK,MAAA,GAAS,aAAA;AAAA,IACvC;AAAA,GACF;AACA,EAAA,OAAO,aAAA,CACJ,GAAA,CAAI,CAAC,IAAA,KAAS;AACb,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,MAAA,GAAS,aAAA,GAAgB,WAAA;AAC7C,IAAA,IAAI,WAAW,CAAA,EAAG;AAChB,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,oFAAA;AAAA,QACA,EAAE,IAAA;AAAK,OACT;AAAA,IACF;AACA,IAAA,OAAO,EAAE,EAAA,EAAI,IAAA,CAAK,IAAI,IAAA,EAAM,IAAA,CAAK,MAAM,MAAA,EAAO;AAAA,EAChD,CAAC,EACA,QAAA,CAAS,CAAC,MAAM,KAAA,KAAU,mBAAA,CAAoB,IAAA,EAAM,KAAK,CAAC,CAAA;AAC/D;AAEA,SAASA,oBAAmB,OAAA,EAAgD;AAC1E,EAAA,OAAO,GAAA;AAAA,sBAAA,EACe,QAAQ,YAAY,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAAA,CAAA;AAY5C;AAEA,eAAe,sBAAA,CACb,OAAA,EACA,SAAA,EACA,KAAA,EACyB;AACzB,EAAA,MAAM,EAAE,SAAA,EAAW,YAAA,EAAc,OAAA,EAAS,OAAM,GAAI,OAAA;AACpD,EAAA,MAAM,cAAA,GAAiB,0BAA0B,SAAS,CAAA;AAC1D,EAAA,MAAM,QAAQ,gBAAA,CAAiB,GAAA;AAAA,gBAAA,EACf,YAAY;AAAA;AAAA;AAAA,WAAA,EAGjB,OAAO,KAAK,KAAK,CAAA;AAAA,SAAA,EACnB,SAAA,CAAU,OAAO,UAAU,CAAA;AAAA,uBAAA,EACb,OAAO;AAAA,UAAA,EACpB,cAAc;AAAA,UAAA,EACd,UAAU,kBAAkB;AAAA,EAAA,CACrC,CAAA;AAED,EAAA,MAAM,gBAAA,GAAmB,MAAM,qBAAA,CAAsB,OAAO,CAAA;AAC5D,EAAA,IAAI,qBAAqB,CAAA,EAAG;AAC1B,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,MAAM,iBAAiB,KAAK,CAAA;AAAA,IAC9B;AACA,IAAA,OAAO;AAAA,MACL,iBAAA,EAAmB,OAAA;AAAA,MACnB,aAAA,EAAe,CAAA;AAAA,MACf;AAAA,KACF;AAAA,EACF;AAEA,EAAA,IAAI,UAAU,MAAA,EAAW;AACvB,IAAA,MAAM,gBAAgB,CAAA,GAAI,gBAAA;AAC1B,IAAA,MAAM,QAAQ,gBAAA,CAAiB,GAAA;AAAA,aAAA,EACpB,YAAY;AAAA,kBAAA,EACP,aAAa,CAAA;AAAA,4BAAA,EACH,aAAa;AAAA,uBAAA,EAClB,OAAO,iBAAiB,KAAK;AAAA,IAAA,CACjD,CAAA;AAAA,EACH,CAAA,MAAO;AACL,IAAA,MAAM,yBAAA,CAA0B,SAAS,KAAK,CAAA;AAAA,EAChD;AAEA,EAAA,KAAA,MAAW,SAAA,IAAa,UAAU,cAAA,EAAgB;AAChD,IAAA,MAAM,oBAAA,CAAqB,SAAS,SAAS,CAAA;AAAA,EAC/C;AACA,EAAA,OAAO;AAAA,IACL,iBAAA,EAAmB,OAAA;AAAA,IACnB,eAAe,MAAA,CAAO,iBAAA;AAAA,IACtB;AAAA,GACF;AACF;AAEA,eAAe,yBAAA,CACb,SACA,KAAA,EACe;AACf,EAAA,MAAM,cAAA,GACJ,OAAA,CAAQ,SAAA,CAAU,OAAA,CAAQ,aAAa,iBAAA,IACvC,2BAAA;AACF,EAAA,MAAM,gBAAgB,IAAA,CAAK,KAAA;AAAA,IAAA,CACxB,iBAAiB,uCAAA,IAChB;AAAA,GACJ;AACA,EAAA,IAAI,gBAAgB,CAAA,EAAG;AACrB,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,oFAAA;AAAA,MACA,EAAE,cAAA;AAAe,KACnB;AAAA,EACF;AAEA,EAAA,KAAA,IAAS,SAAS,CAAA,EAAG,MAAA,GAAS,KAAA,CAAM,MAAA,EAAQ,UAAU,aAAA,EAAe;AACnE,IAAA,MAAMD,MAAAA,GAAQ,KAAA,CAAM,KAAA,CAAM,MAAA,EAAQ,SAAS,aAAa,CAAA;AACxD,IAAA,MAAM,SAAS,GAAA,CAAI,IAAA;AAAA,MACjBA,MAAAA,CAAM,GAAA;AAAA,QACJ,CAAC,IAAA,KACC,GAAA,CAAA,CAAA,EAAO,IAAA,CAAK,EAAE,KAAK,IAAA,CAAK,IAAI,CAAA,OAAA,EAAU,IAAA,CAAK,MAAM,CAAA,sBAAA;AAAA,OACrD;AAAA,MACA,GAAA,CAAA,EAAA;AAAA,KACF;AACA,IAAA,MAAM,QAAQ,gBAAA,CAAiB,GAAA;AAAA,8DAAA,EAC6B,MAAM,CAAA;AAAA,aAAA,EACvD,QAAQ,YAAY,CAAA;AAAA;AAAA;AAAA;AAAA,8BAAA,EAIH,QAAQ,OAAO;AAAA,4BAAA,EACjB,QAAQ,KAAK;AAAA;AAAA;AAAA,IAAA,CAGtC,CAAA;AAAA,EACH;AAEA,EAAA,MAAM,WAAA,GAAc,MAAM,OAAA,CAAQ,OAAA,CAAQ,OAAA;AAAA,IACxC,iBAAA,CAAkB,GAAA;AAAA;AAAA,WAAA,EAET,QAAQ,YAAY;AAAA,uBAAA,EACR,QAAQ,OAAO;AAAA,qBAAA,EACjB,QAAQ,KAAK;AAAA;AAAA,IAAA,CAE/B;AAAA,GACH;AACA,EAAA,MAAM,UAAU,IAAI,GAAA;AAAA,IAClB,WAAA,CAAY,GAAA;AAAA,MAAI,CAAC,GAAA,KACf,eAAA,CAAgB,EAAE,EAAA,EAAI,IAAI,OAAA,EAAS,IAAA,EAAM,GAAA,CAAI,SAAA,EAAW;AAAA;AAC1D,GACF;AACA,EAAA,MAAM,OAAA,GAAU,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,CAAC,OAAA,CAAQ,GAAA,CAAI,eAAA,CAAgB,IAAI,CAAC,CAAC,CAAA;AAC1E,EAAA,IAAI,OAAA,CAAQ,MAAA,GAAS,CAAA,EAAG,MAAM,iBAAiB,OAAO,CAAA;AACxD;AAEA,SAAS,iBACP,KAAA,EACoB;AACpB,EAAA,OAAO,IAAI,kBAAA;AAAA,IACT,+FAAA;AAAA,IACA,EAAE,YAAA,EAAc,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,MAAU,EAAE,EAAA,EAAI,IAAA,CAAK,EAAA,EAAI,IAAA,EAAM,IAAA,CAAK,IAAA,GAAO,CAAA;AAAE,GAC1E;AACF;AAEA,eAAe,oBAAA,CACb,SACA,SAAA,EACe;AACf,EAAA,MAAM,EAAE,SAAA,EAAW,YAAA,EAAc,OAAA,EAAS,OAAM,GAAI,OAAA;AACpD,EAAA,MAAM,SAAA,GAAY,gCAAA;AAAA,IAChB,SAAA;AAAA,IACA,YAAA;AAAA,IACA,GAAA,CAAA,aAAA,EAAmB,OAAO,CAAA,gBAAA,EAAmB,KAAK,CAAA,CAAA;AAAA,IAClD,SAAA,CAAU,SAAA;AAAA,IACV;AAAA,GACF;AACA,EAAA,MAAM,gBAAA,GAAmB,uBAAA,CAAwB,SAAA,CAAU,SAAS,CAAA;AAEpE,EAAA,MAAM,QAAQ,gBAAA,CAAiB,GAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAAA,EAKvB,gBAAgB,CAAA;AAAA,YAAA,EACZ,SAAS,CAAA;AAAA,WAAA,EACV,YAAY,CAAA;AAAA,oCAAA,EACa,OAAO;AAAA,mCAAA,EACR,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,WAAA,EAQ7B,YAAY,CAAA;AAAA;AAAA;AAAA,4BAAA,EAGK,OAAO;AAAA,0BAAA,EACT,KAAK;AAAA;AAAA;AAAA,EAAA,CAG9B,CAAA;AACH;AAEA,SAAS,wBAAwB,SAAA,EAA4C;AAC3E,EAAA,IAAI,SAAA,KAAc,QAAQ,OAAO,GAAA,CAAA,GAAA,CAAA;AAIjC,EAAA,OAAO,GAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAAA,CAAA;AAQT;AAEA,eAAe,sBAAA,CACb,OAAA,EACA,KAAA,EACA,aAAA,EACyB;AACzB,EAAA,MAAM,oBAAoB,KAAA,CAAM,iBAAA;AAChC,EAAA,MAAM,iBAAA,GACJ,iBAAA,KAAsB,OAAA,GAAU,YAAA,GAAe,OAAA;AACjD,EAAA,MAAM,iBAAA;AAAA,IACJ,OAAA;AAAA,IACA,iBAAA;AAAA,IACA,iBAAA;AAAA,IACA;AAAA,GACF;AAEA,EAAA,KAAA,MAAW,SAAA,IAAa,OAAA,CAAQ,SAAA,CAAU,cAAA,EAAgB;AACxD,IAAA,MAAM,uBAAA;AAAA,MACJ,OAAA;AAAA,MACA,SAAA;AAAA,MACA,aAAA;AAAA,MACA,iBAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAEA,EAAA,MAAM,gBAAgB,MAAM,iBAAA;AAAA,IAC1B,OAAA;AAAA,IACA,iBAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,OAAO;AAAA,IACL,iBAAA,EAAmB,iBAAA;AAAA,IACnB,aAAA;AAAA,IACA,kBAAkB,KAAA,CAAM;AAAA,GAC1B;AACF;AAEA,eAAe,iBAAA,CACb,OAAA,EACA,iBAAA,EACA,iBAAA,EACA,aAAA,EACe;AACf,EAAA,MAAM,WAAA,GAAc,GAAA,CAAI,UAAA,CAAW,iBAAiB,CAAA;AACpD,EAAA,MAAM,WAAA,GAAc,GAAA,CAAI,UAAA,CAAW,iBAAiB,CAAA;AACpD,EAAA,MAAM,QAAQ,gBAAA,CAAiB,GAAA;AAAA,WAAA,EACpB,QAAQ,YAAY;AAAA,QAAA,EACvB,WAAW,CAAA;AAAA,MAAA,EACb,CAAA,GAAI,aAAa,CAAA,GAAA,EAAM,aAAa,CAAA;AAAA,qCAAA,EACL,WAAW,CAAA;AAAA,aAAA,EACnC,QAAQ,YAAY,CAAA;AAAA,kCAAA,EACC,QAAQ,OAAO;AAAA,gCAAA,EACjB,QAAQ,KAAK;AAAA;AAAA;AAAA;AAAA,qBAAA,EAIxB,OAAA,CAAQ,OAAO,CAAA,cAAA,EAAiB,OAAA,CAAQ,KAAK;AAAA,EAAA,CACjE,CAAA;AACH;AAEA,eAAe,uBAAA,CACb,OAAA,EACA,SAAA,EACA,aAAA,EACA,mBACA,iBAAA,EACe;AACf,EAAA,MAAM,EAAE,SAAA,EAAW,YAAA,EAAc,OAAA,EAAS,OAAM,GAAI,OAAA;AACpD,EAAA,MAAM,WAAA,GAAc,GAAA,CAAI,UAAA,CAAW,iBAAiB,CAAA;AACpD,EAAA,MAAM,WAAA,GAAc,GAAA,CAAI,UAAA,CAAW,iBAAiB,CAAA;AACpD,EAAA,MAAM,SAAA,GAAY,gCAAA;AAAA,IAChB,SAAA;AAAA,IACA,YAAA;AAAA,IACA,GAAA,CAAA,aAAA,EAAmB,OAAO,CAAA,gBAAA,EAAmB,KAAK,CAAA,CAAA;AAAA,IAClD,SAAA,CAAU,SAAA;AAAA,IACV,SAAA;AAAA,IACA,QAAQ,WAAW,CAAA,mDAAA;AAAA,GACrB;AACA,EAAA,MAAM,gBAAA,GAAmB,uBAAA,CAAwB,SAAA,CAAU,SAAS,CAAA;AAEpE,EAAA,MAAM,QAAQ,gBAAA,CAAiB,GAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAAA,EAOvB,gBAAgB,CAAA;AAAA,YAAA,EACZ,SAAS,CAAA;AAAA,WAAA,EACV,YAAY,CAAA;AAAA,oCAAA,EACa,OAAO;AAAA,mCAAA,EACR,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,WAAA,EAY7B,YAAY,CAAA;AAAA,QAAA,EACf,WAAW,CAAA,UAAA,EAAa,WAAW,CAAA,GAAA,EAAM,aAAa,CAAA;AAAA;AAAA,4BAAA,EAElC,OAAO;AAAA,0BAAA,EACT,KAAK;AAAA;AAAA;AAAA,EAAA,CAG9B,CAAA;AACH;AAEA,eAAe,iBAAA,CACb,OAAA,EACA,iBAAA,EACA,iBAAA,EACiB;AACjB,EAAA,MAAM,WAAA,GAAc,GAAA,CAAI,UAAA,CAAW,iBAAiB,CAAA;AACpD,EAAA,MAAM,WAAA,GAAc,GAAA,CAAI,UAAA,CAAW,iBAAiB,CAAA;AACpD,EAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,OAAA,CAAQ,OAAA;AAAA,IACjC,iBAAA,CAAkB,GAAA;AAAA,8BAAA,EACU,WAAW,MAAM,WAAW,CAAA;AAAA,WAAA,EAC/C,QAAQ,YAAY;AAAA,uBAAA,EACR,OAAA,CAAQ,OAAO,CAAA,cAAA,EAAiB,OAAA,CAAQ,KAAK;AAAA,IAAA,CACjE;AAAA,GACH;AACA,EAAA,OAAO,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,EAAG,SAAS,CAAC,CAAA;AACnC;AAEA,eAAe,aAAA,CACb,SACA,KAAA,EACmC;AACnC,EAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,UAAA,CAAW,KAAA,CAAM,iBAAiB,CAAA;AACpD,EAAA,MAAM,SAAS,OAAA,CAAQ,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,OAAA,CAAY,CAAA;AACpE,EAAA,MAAM,WAAW,OAAA,CAAQ,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,SAAA,CAAc,CAAA;AACxE,EAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,OAAA,CAAQ,OAAA;AAAA,IACjC,iBAAA,CAAkB,GAAA;AAAA,iCAAA,EACa,KAAK,CAAA;AAAA,WAAA,EAC3B,QAAQ,YAAY;AAAA,uBAAA,EACR,OAAA,CAAQ,OAAO,CAAA,cAAA,EAAiB,OAAA,CAAQ,KAAK;AAAA,eAAA,EACrD,KAAK,CAAA,OAAA,EAAU,MAAM,CAAA,EAAA,EAAK,QAAQ;AAAA,IAAA,CAC9C;AAAA,GACH;AACA,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,MAAS;AAAA,IACxB,IAAI,GAAA,CAAI,OAAA;AAAA,IACR,MAAM,GAAA,CAAI,SAAA;AAAA,IACV,KAAA,EAAO,MAAA,CAAO,GAAA,CAAI,KAAK;AAAA,GACzB,CAAE,CAAA;AACJ;;;ACjfA,eAAsB,kBAAA,CACpB,GAAA,EACA,QAAA,EACA,OAAA,EACA,OAAA,EACmC;AACnC,EAAA,IAAI,0BAAA,CAA2B,GAAG,CAAA,EAAG;AACnC,IAAA,OAAO,gCAAA,CAAiC,GAAA,EAAK,QAAA,EAAU,OAAA,EAAS,OAAO,CAAA;AAAA,EACzE;AACA,EAAA,OAAO,wBAAA,CAAyB,GAAA,EAAK,QAAA,EAAU,OAAA,EAAS,OAAO,CAAA;AACjE;AAEA,eAAsB,gBAAA,CACpB,GAAA,EACA,QAAA,EACA,QAAA,EACA,SACA,OAAA,EACyC;AACzC,EAAA,IAAI,0BAAA,CAA2B,GAAG,CAAA,EAAG;AACnC,IAAA,OAAO,8BAAA;AAAA,MACL,GAAA;AAAA,MACA,QAAA;AAAA,MACA,QAAA;AAAA,MACA,OAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AACA,EAAA,OAAO,sBAAA,CAAuB,GAAA,EAAK,QAAA,EAAU,QAAA,EAAU,SAAS,OAAO,CAAA;AACzE;AAEA,eAAe,gCAAA,CACb,GAAA,EACA,QAAA,EACA,OAAA,EACA,OAAA,EACmC;AACnC,EAAA,OAAO,0BAAA,CAA2B,KAAK,OAAA,EAAS;AAAA,IAC9C,SAAA,EAAW,WAAA;AAAA,IACX,aAAA,EAAe,OAAA;AAAA,IACf,kBAAA,EAAAC,mBAAAA;AAAA,IACA,MAAM,WAAW,OAAA,EAAS;AACxB,MAAA,MAAM,MAAA,GAAS,MAAM,eAAA,CAAgB,OAAA,EAAS,UAAU,SAAS,CAAA;AACjE,MAAA,OAAO;AAAA,QACL,KAAA,EAAO,CAAA;AAAA,QACP,eAAe,MAAA,CAAO,MAAA;AAAA,QACtB,kBAAkB,MAAA,CAAO;AAAA,OAC3B;AAAA,IACF,CAAA;AAAA,IACA,MAAM,QAAA,CAAS,OAAA,EAAS,KAAA,EAAO;AAC7B,MAAA,MAAM,SAAA,GAAY,MAAM,KAAA,GAAQ,CAAA;AAChC,MAAA,MAAM,gBAAgB,MAAM,gCAAA;AAAA,QAC1B,OAAA;AAAA,QACA,SAAA;AAAA,QACA,KAAA,CAAM,KAAA;AAAA,QACN,SAAA;AAAA,QACA,QAAQ,SAAA,CAAU;AAAA,OACpB;AACA,MAAA,OAAO;AAAA,QACL,KAAA,EAAO,SAAA;AAAA,QACP,aAAA;AAAA,QACA,gBAAA,EAAkB,MAAM,gBAAA,GAAmB;AAAA,OAC7C;AAAA,IACF,CAAA;AAAA,IACA,aAAa,KAAA,EAAO;AAClB,MAAA,OAAO,KAAA,CAAM,aAAA,KAAkB,CAAA,IAAK,KAAA,CAAM,KAAA,IAAS,OAAA;AAAA,IACrD,CAAA;AAAA,IACA,MAAM,cAAc,OAAA,EAAS;AAC3B,MAAA,MAAM,IAAA,GAAO,MAAM,eAAA,CAAgB,OAAA,EAAS,SAAS,CAAA;AACrD,MAAA,OAAO,IAAA,CACJ,GAAA,CAAI,CAAC,GAAA,MAAS;AAAA,QACb,IAAI,GAAA,CAAI,OAAA;AAAA,QACR,MAAM,GAAA,CAAI,SAAA;AAAA,QACV,KAAA,EAAO,MAAA,CAAO,GAAA,CAAI,KAAK;AAAA,QACvB,CAAA,CACD,QAAA;AAAA,QACC,CAAC,MAAM,KAAA,KACL,IAAA,CAAK,QAAQ,KAAA,CAAM,KAAA,IAAS,mBAAA,CAAoB,IAAA,EAAM,KAAK;AAAA,OAC/D;AAAA,IACJ;AAAA,GACD,CAAA;AACH;AAEA,eAAe,8BAAA,CACb,GAAA,EACA,QAAA,EACA,QAAA,EACA,SACA,OAAA,EACyC;AACzC,EAAA,OAAO,0BAAA,CAA2B,KAAK,OAAA,EAAS;AAAA,IAC9C,SAAA,EAAW,cAAA;AAAA,IACX,aAAA,EAAe,OAAA;AAAA,IACf,kBAAA,EAAAA,mBAAAA;AAAA,IACA,MAAM,WAAW,OAAA,EAAS;AACxB,MAAA,MAAM,YAAA,GAAe,MAAM,eAAA,CAAgB,OAAA,EAAS,UAAU,SAAS,CAAA;AACvE,MAAA,MAAM,YAAA,GAAe,MAAM,eAAA,CAAgB,OAAA,EAAS,UAAU,SAAS,CAAA;AACvE,MAAA,OAAO;AAAA,QACL,YAAA,EAAc,CAAA;AAAA,QACd,YAAA,EAAc,CAAA;AAAA,QACd,sBAAsB,YAAA,CAAa,MAAA;AAAA,QACnC,sBAAsB,YAAA,CAAa,MAAA;AAAA,QACnC,OAAA,EAAS,eAAA,CAAgB,YAAA,EAAc,YAAY,CAAA;AAAA,QACnD,gBAAA,EAAkB,YAAA,CAAa,MAAA,GAAS,YAAA,CAAa;AAAA,OACvD;AAAA,IACF,CAAA;AAAA,IACA,MAAM,QAAA,CAAS,OAAA,EAAS,KAAA,EAAO;AAC7B,MAAA,MAAM,aAAA,GACJ,KAAA,CAAM,oBAAA,IAAwB,KAAA,CAAM,oBAAA;AACtC,MAAA,MAAM,IAAA,GAAO,gBAAgB,SAAA,GAAY,SAAA;AACzC,MAAA,MAAM,YAAA,GACJ,aAAA,GAAgB,KAAA,CAAM,YAAA,GAAe,KAAA,CAAM,YAAA;AAC7C,MAAA,MAAM,YAAY,YAAA,GAAe,CAAA;AACjC,MAAA,MAAM,SAAA,GACJ,gBACE,OAAA,CAAQ,SAAA,CAAU,YAClB,gBAAA,CAAiB,OAAA,CAAQ,UAAU,SAAS,CAAA;AAChD,MAAA,MAAM,QAAQ,MAAM,uBAAA;AAAA,QAClB,OAAA;AAAA,QACA,IAAA;AAAA,QACA,YAAA;AAAA,QACA,SAAA;AAAA,QACA,SAAA;AAAA,QACA;AAAA,OACF;AAEA,MAAA,OAAO;AAAA,QACL,YAAA,EAAc,aAAA,GAAgB,SAAA,GAAY,KAAA,CAAM,YAAA;AAAA,QAChD,YAAA,EAAc,aAAA,GAAgB,KAAA,CAAM,YAAA,GAAe,SAAA;AAAA,QACnD,oBAAA,EACE,aAAA,GAAgB,KAAA,CAAM,aAAA,GAAgB,KAAA,CAAM,oBAAA;AAAA,QAC9C,oBAAA,EACE,aAAA,GAAgB,KAAA,CAAM,oBAAA,GAAuB,KAAA,CAAM,aAAA;AAAA,QACrD,SAAS,KAAA,CAAM,OAAA;AAAA,QACf,gBAAA,EAAkB,KAAA,CAAM,gBAAA,GAAmB,KAAA,CAAM;AAAA,OACnD;AAAA,IACF,CAAA;AAAA,IACA,aAAa,KAAA,EAAO;AAClB,MAAA,OACE,KAAA,CAAM,OAAA,KAAY,MAAA,IAClB,KAAA,CAAM,oBAAA,KAAyB,CAAA,IAC/B,KAAA,CAAM,oBAAA,KAAyB,CAAA,IAC/B,KAAA,CAAM,YAAA,GAAe,KAAA,CAAM,YAAA,IAAgB,OAAA;AAAA,IAE/C,CAAA;AAAA,IACA,MAAM,aAAA,CAAc,OAAA,EAAS,KAAA,EAAO;AAClC,MAAA,IAAI,KAAA,CAAM,YAAY,MAAA,EAAW;AACjC,MAAA,MAAM,IAAA,GAAO,MAAM,eAAA,CAAgB,OAAO,CAAA;AAC1C,MAAA,OAAO,iBAAA;AAAA,QACL,eAAA,CAAgB,MAAM,OAAO,CAAA;AAAA,QAC7B,wBAAA,CAAyB,MAAM,SAAS,CAAA;AAAA,QACxC,wBAAA,CAAyB,MAAM,SAAS;AAAA,OAC1C;AAAA,IACF;AAAA,GACD,CAAA;AACH;AAEA,SAASA,oBAAmB,OAAA,EAAmC;AAC7D,EAAA,OAAO,GAAA;AAAA,sBAAA,EACe,QAAQ,YAAY,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAAA,CAAA;AAa5C;AAQA,eAAe,eAAA,CACb,OAAA,EACA,MAAA,EACA,IAAA,EAC+B;AAC/B,EAAA,MAAM,EAAE,SAAA,EAAW,YAAA,EAAc,OAAA,EAAS,OAAM,GAAI,OAAA;AACpD,EAAA,OAAO,QAAQ,OAAA,CAAQ,OAAA;AAAA,IACrB,iBAAA,CAAkB,GAAA;AAAA,kBAAA,EACF,YAAY;AAAA;AAAA;AAAA,aAAA,EAGjB,OAAO,CAAA,EAAA,EAAK,KAAK,CAAA,EAAA,EAAK,IAAI,CAAA;AAAA,WAAA,EAC5B,SAAA,CAAU,OAAO,UAAU,CAAA;AAAA,yBAAA,EACb,OAAO;AAAA,mBAAA,EACb,MAAM;AAAA,YAAA,EACb,UAAU,kBAAkB;AAAA;AAAA;AAAA,IAAA,CAGrC;AAAA,GACH;AACF;AASA,SAAS,eAAA,CACP,cACA,YAAA,EACyB;AACzB,EAAA,MAAM,cAAc,IAAI,GAAA;AAAA,IACtB,YAAA,CAAa,GAAA;AAAA,MAAI,CAAC,GAAA,KAChB,eAAA,CAAgB,EAAE,EAAA,EAAI,IAAI,OAAA,EAAS,IAAA,EAAM,GAAA,CAAI,SAAA,EAAW;AAAA;AAC1D,GACF;AACA,EAAA,IAAI,OAAA;AACJ,EAAA,KAAA,MAAW,OAAO,YAAA,EAAc;AAC9B,IAAA,MAAM,SAAA,GAAY,EAAE,EAAA,EAAI,GAAA,CAAI,SAAS,IAAA,EAAM,GAAA,CAAI,SAAA,EAAW,KAAA,EAAO,CAAA,EAAE;AACnE,IAAA,IAAI,CAAC,WAAA,CAAY,GAAA,CAAI,eAAA,CAAgB,SAAS,CAAC,CAAA,EAAG;AAClD,IAAA,IAAI,YAAY,MAAA,IAAa,mBAAA,CAAoB,SAAA,EAAW,OAAO,IAAI,CAAA,EAAG;AACxE,MAAA,OAAA,GAAU,SAAA;AAAA,IACZ;AAAA,EACF;AACA,EAAA,OAAO,OAAA;AACT;AAWA,eAAe,wBACb,OAAA,EACA,IAAA,EACA,YAAA,EACA,SAAA,EACA,WACA,OAAA,EACwB;AACxB,EAAA,MAAM,YAAA,GAA4B,IAAA,KAAS,SAAA,GAAY,SAAA,GAAY,SAAA;AACnE,EAAA,IAAI,aAAA,GAAgB,CAAA;AACpB,EAAA,IAAI,OAAA;AACJ,EAAA,MAAM,EAAE,OAAA,EAAQ,GAAI,OAAA,CAAQ,SAAA,CAAU,GAAA;AACtC,EAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,UAAA,CAAW,GAAA,CAAA,oBAAA,CAAyB,CAAA;AAC/D,EAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,UAAA,CAAW,GAAA,CAAA,kBAAA,CAAuB,CAAA;AAC3D,EAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,UAAA,CAAW,GAAA,CAAA,kBAAA,CAAuB,CAAA;AAC3D,EAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,UAAA,CAAW,GAAA,CAAA,oBAAA,CAAyB,CAAA;AAC/D,EAAA,KAAA,MAAW,SAAA,IAAa,OAAA,CAAQ,SAAA,CAAU,cAAA,EAAgB;AACxD,IAAA,MAAM,YAAA,GAAe,GAAA;AAAA,mBAAA,EACJ,QAAQ,OAAO;AAAA,qBAAA,EACb,QAAQ,KAAK;AAAA,mBAAA,EACf,IAAI;AAAA,oBAAA,EACH,YAAY;AAAA,IAAA,CAAA;AAE9B,IAAA,MAAM,SAAA,GAAY,4BAAA;AAAA,MAChB,OAAA,CAAQ,SAAA;AAAA,MACR,OAAA,CAAQ,YAAA;AAAA,MACR,YAAA;AAAA,MACA,SAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,OAAA,CAAQ,OAAA;AAAA,MACjC,iBAAA,CAAkB,GAAA;AAAA,oBAAA,EACF,QAAQ,YAAY;AAAA;AAAA;AAAA;AAAA,UAAA,EAI9B,QAAQ,OAAO,CAAA,EAAA,EAAK,OAAA,CAAQ,KAAK,KAAK,IAAI,CAAA;AAAA,gDAAA,EACJ,SAAS,CAAA;AAAA;AAAA;AAAA;AAAA,iBAAA,EAIxC,QAAQ,YAAY,CAAA;AAAA,sCAAA,EACC,QAAQ,OAAO;AAAA,oCAAA,EACjB,QAAQ,KAAK;AAAA,kCAAA,EACf,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,2BAAA,EAOnB,UAAU,KAAK,QAAQ;AAAA,uBAAA,EAC3B,QAAQ,KAAK,UAAU;AAAA;AAAA,gBAAA,EAE9B,SAAS,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iBAAA,EAKR,QAAQ,YAAY,CAAA;AAAA,qCAAA,EACA,QAAQ,OAAO;AAAA,mCAAA,EACjB,QAAQ,KAAK;AAAA,iCAAA,EACf,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAAA,CAMhC;AAAA,KACH;AACA,IAAA,aAAA,IAAiB,IAAA,CAAK,MAAA;AACtB,IAAA,OAAA,GAAU,kBAAA,CAAmB,OAAA,EAAS,IAAA,EAAM,SAAA,EAAW,OAAO,CAAA;AAAA,EAChE;AACA,EAAA,OAAO,EAAE,eAAe,OAAA,EAAQ;AAClC;AAUA,SAAS,kBAAA,CACP,cAAA,EACA,IAAA,EACA,SAAA,EACA,OAAA,EACyB;AACzB,EAAA,IAAI,OAAA,GAAU,cAAA;AACd,EAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AAItB,IAAA,IAAI,GAAA,CAAI,aAAA,KAAkB,IAAA,IAAQ,GAAA,CAAI,kBAAkB,MAAA,EAAW;AACjE,MAAA;AAAA,IACF;AACA,IAAA,MAAM,UAAA,GAAa,SAAA,GAAY,MAAA,CAAO,GAAA,CAAI,aAAa,CAAA;AACvD,IAAA,IAAI,aAAa,OAAA,EAAS;AAC1B,IAAA,MAAM,SAAA,GAAY;AAAA,MAChB,IAAI,GAAA,CAAI,OAAA;AAAA,MACR,MAAM,GAAA,CAAI,SAAA;AAAA,MACV,KAAA,EAAO;AAAA,KACT;AACA,IAAA,IACE,OAAA,KAAY,MAAA,IACZ,SAAA,CAAU,KAAA,GAAQ,QAAQ,KAAA,IACzB,SAAA,CAAU,KAAA,KAAU,OAAA,CAAQ,KAAA,IAC3B,mBAAA,CAAoB,SAAA,EAAW,OAAO,IAAI,CAAA,EAC5C;AACA,MAAA,OAAA,GAAU,SAAA;AAAA,IACZ;AAAA,EACF;AACA,EAAA,OAAO,OAAA;AACT;AAQA,eAAe,gCAAA,CACb,OAAA,EACA,IAAA,EACA,YAAA,EACA,WACA,SAAA,EACiB;AACjB,EAAA,IAAI,aAAA,GAAgB,CAAA;AACpB,EAAA,KAAA,MAAW,SAAA,IAAa,OAAA,CAAQ,SAAA,CAAU,cAAA,EAAgB;AACxD,IAAA,MAAM,YAAA,GAAe,GAAA;AAAA,mBAAA,EACJ,QAAQ,OAAO;AAAA,qBAAA,EACb,QAAQ,KAAK;AAAA,mBAAA,EACf,IAAI;AAAA,oBAAA,EACH,YAAY;AAAA,IAAA,CAAA;AAE9B,IAAA,MAAM,aAAA,GAAgB,gCAAA;AAAA,MACpB,OAAA,CAAQ,SAAA;AAAA,MACR,OAAA,CAAQ,YAAA;AAAA,MACR,YAAA;AAAA,MACA,SAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,OAAA,CAAQ,OAAA;AAAA,MACjC,iBAAA,CAAkB,GAAA;AAAA,oBAAA,EACF,QAAQ,YAAY;AAAA;AAAA;AAAA;AAAA,UAAA,EAI9B,QAAQ,OAAO,CAAA,EAAA,EAAK,OAAA,CAAQ,KAAK,KAAK,IAAI,CAAA;AAAA,wDAAA,EACI,SAAS,CAAA;AAAA;AAAA;AAAA;AAAA,gBAAA,EAIjD,aAAa,CAAA;AAAA;AAAA,aAAA,EAEhB,OAAA,CAAQ,SAAA,CAAU,MAAA,CAAO,UAAU,CAAA;AAAA,0BAAA,EACtB,QAAQ,OAAO;AAAA;AAAA;AAAA,cAAA,EAG3B,OAAA,CAAQ,UAAU,kBAAkB;AAAA;AAAA;AAAA,iBAAA,EAGjC,QAAQ,YAAY,CAAA;AAAA,qCAAA,EACA,QAAQ,OAAO;AAAA,mCAAA,EACjB,QAAQ,KAAK;AAAA,iCAAA,EACf,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAAA,CAMhC;AAAA,KACH;AACA,IAAA,aAAA,IAAiB,IAAA,CAAK,MAAA;AAAA,EACxB;AACA,EAAA,OAAO,aAAA;AACT;AAEA,eAAe,eAAA,CACb,SACA,IAAA,EACgC;AAChC,EAAA,MAAM,UAAA,GAAa,IAAA,KAAS,MAAA,GAAY,GAAA,CAAA,IAAA,CAAA,GAAY,aAAa,IAAI,CAAA,CAAA;AACrE,EAAA,OAAO,QAAQ,OAAA,CAAQ,OAAA;AAAA,IACrB,iBAAA,CAAkB,GAAA;AAAA;AAAA;AAAA,WAAA,EAGT,QAAQ,YAAY;AAAA,uBAAA,EACR,QAAQ,OAAO;AAAA,qBAAA,EACjB,QAAQ,KAAK;AAAA,YAAA,EACtB,UAAU;AAAA,IAAA,CACnB;AAAA,GACH;AACF;AAEA,eAAe,wBAAA,CACb,GAAA,EACA,QAAA,EACA,OAAA,EACA,OAAA,EACmC;AACnC,EAAA,OAAO,iCAAA,CAAkC,GAAA,EAAK,OAAA,EAAS,OAAO,SAAA,KAAc;AAC1E,IAAA,MAAM,UAAU,MAAM,wBAAA,CAAyB,SAAA,EAAW,CAAC,QAAQ,CAAC,CAAA;AACpE,IAAA,IAAI,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAElC,IAAA,MAAM,UAAU,IAAI,GAAA;AAAA,MAClB,OAAA,CAAQ,GAAA,CAAI,CAAC,MAAA,KAAW;AAAA,QACtB,gBAAgB,MAAM,CAAA;AAAA,QACtB,EAAE,IAAI,MAAA,CAAO,EAAA,EAAI,MAAM,MAAA,CAAO,IAAA,EAAM,OAAO,CAAA;AAAE,OAC9C;AAAA,KACH;AACA,IAAA,IAAI,UAAA,GAAkC,OAAA;AAEtC,IAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,KAAA,IAAS,WAAW,UAAA,CAAW,MAAA,GAAS,GAAG,KAAA,EAAA,EAAS;AACtE,MAAA,MAAM,aAAa,MAAM,sBAAA;AAAA,QACvB,SAAA;AAAA,QACA,UAAA;AAAA,QACA,SAAA,CAAU,SAAA;AAAA,QACV;AAAA,OACF;AACA,MAAA,MAAM,cAAA,GAAiB,eAAe,UAAU,CAAA;AAChD,MAAA,KAAA,MAAW,aAAa,cAAA,EAAgB;AACtC,QAAA,OAAA,CAAQ,GAAA,CAAI,eAAA,CAAgB,SAAS,CAAA,EAAG;AAAA,UACtC,IAAI,SAAA,CAAU,EAAA;AAAA,UACd,MAAM,SAAA,CAAU,IAAA;AAAA,UAChB;AAAA,SACD,CAAA;AAAA,MACH;AACA,MAAA,UAAA,GAAa,cAAA;AAAA,IACf;AAEA,IAAA,OAAO,CAAC,GAAG,OAAA,CAAQ,MAAA,EAAQ,CAAA,CAAE,QAAA;AAAA,MAC3B,CAAC,MAAM,KAAA,KACL,IAAA,CAAK,QAAQ,KAAA,CAAM,KAAA,IAAS,mBAAA,CAAoB,IAAA,EAAM,KAAK;AAAA,KAC/D;AAAA,EACF,CAAC,CAAA;AACH;AAEA,eAAe,sBAAA,CACb,GAAA,EACA,QAAA,EACA,QAAA,EACA,SACA,OAAA,EACyC;AACzC,EAAA,OAAO,iCAAA,CAAkC,GAAA,EAAK,OAAA,EAAS,OAAO,SAAA,KAAc;AAC1E,IAAA,MAAM,YAAA,GAAe,MAAM,wBAAA,CAAyB,SAAA,EAAW;AAAA,MAC7D,QAAA;AAAA,MACA;AAAA,KACD,CAAA;AACD,IAAA,MAAM,UAAU,YAAA,CAAa,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,OAAO,QAAQ,CAAA;AAClE,IAAA,MAAM,UAAU,YAAA,CAAa,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,OAAO,QAAQ,CAAA;AAClE,IAAA,IAAI,OAAA,CAAQ,MAAA,KAAW,CAAA,IAAK,OAAA,CAAQ,WAAW,CAAA,EAAG;AAClD,IAAA,IAAI,QAAA,KAAa,QAAA;AACf,MAAA,OAAO,EAAE,KAAA,EAAO,CAAC,cAAA,CAAe,OAAA,CAAQ,CAAC,CAAC,CAAC,CAAA,EAAG,KAAA,EAAO,CAAA,EAAE;AAEzD,IAAA,MAAM,cAAA,GAAiB,iBAAiB,OAAO,CAAA;AAC/C,IAAA,MAAM,cAAA,GAAiB,iBAAiB,OAAO,CAAA;AAC/C,IAAA,IAAI,iBAAA,GAAyC,OAAA;AAC7C,IAAA,IAAI,iBAAA,GAAyC,OAAA;AAC7C,IAAA,IAAI,YAAA,GAAe,CAAA;AACnB,IAAA,IAAI,YAAA,GAAe,CAAA;AAEnB,IAAA,OACE,iBAAA,CAAkB,SAAS,CAAA,IAC3B,iBAAA,CAAkB,SAAS,CAAA,IAC3B,YAAA,GAAe,eAAe,OAAA,EAC9B;AACA,MAAA,MAAM,aAAA,GACJ,iBAAA,CAAkB,MAAA,IAAU,iBAAA,CAAkB,MAAA;AAChD,MAAA,MAAM,aAAA,GAAgB,gBAAgB,cAAA,GAAiB,cAAA;AACvD,MAAA,MAAM,eAAA,GAAkB,gBAAgB,cAAA,GAAiB,cAAA;AACzD,MAAA,MAAM,iBAAA,GACJ,gBAAgB,iBAAA,GAAoB,iBAAA;AACtC,MAAA,MAAM,YACJ,aAAA,GACE,SAAA,CAAU,SAAA,GACV,gBAAA,CAAiB,UAAU,SAAS,CAAA;AACxC,MAAA,MAAM,aAAa,MAAM,sBAAA;AAAA,QACvB,SAAA;AAAA,QACA,iBAAA;AAAA,QACA,SAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,MAAM,SAAA,GAAA,CAAa,aAAA,GAAgB,YAAA,GAAe,YAAA,IAAgB,CAAA;AAClE,MAAA,MAAM,cAAA,GAAiB,eAAe,UAAU,CAAA;AAEhD,MAAA,KAAA,MAAW,aAAa,cAAA,EAAgB;AACtC,QAAA,aAAA,CAAc,GAAA,CAAI,eAAA,CAAgB,SAAS,CAAA,EAAG;AAAA,UAC5C,IAAI,SAAA,CAAU,EAAA;AAAA,UACd,MAAM,SAAA,CAAU,IAAA;AAAA,UAChB,KAAA,EAAO,SAAA;AAAA,UACP,WAAW,eAAA,CAAgB;AAAA,YACzB,IAAI,SAAA,CAAU,QAAA;AAAA,YACd,MAAM,SAAA,CAAU;AAAA,WACjB;AAAA,SACF,CAAA;AAAA,MACH;AAEA,MAAA,MAAM,UAAA,GAAa,kBAAA;AAAA,QACjB,cAAA;AAAA,QACA,aAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,QAAA,OAAO,iBAAA,CAAkB,UAAA,EAAY,cAAA,EAAgB,cAAc,CAAA;AAAA,MACrE;AAEA,MAAA,IAAI,aAAA,EAAe;AACjB,QAAA,iBAAA,GAAoB,cAAA;AACpB,QAAA,YAAA,GAAe,SAAA;AAAA,MACjB,CAAA,MAAO;AACL,QAAA,iBAAA,GAAoB,cAAA;AACpB,QAAA,YAAA,GAAe,SAAA;AAAA,MACjB;AAAA,IACF;AACA,IAAA;AAAA,EACF,CAAC,CAAA;AACH;AAEA,eAAe,sBAAA,CACb,SAAA,EACA,UAAA,EACA,SAAA,EACA,OAAA,EAC0D;AAC1D,EAAA,OAAO,wBAAA;AAAA,IACL,SAAA;AAAA,IACA,UAAA;AAAA,IACA,SAAA;AAAA,IACA,CAAC,QAAA,EAAU,SAAA,KAAc,iBAAA,CAAkB,QAAA,EAAU,WAAW,OAAO;AAAA,GACzE;AACF;AAEA,SAAS,iBAAA,CACP,QAAA,EACA,SAAA,EACA,OAAA,EAC+B;AAC/B,EAAA,IAAI,QAAQ,GAAA,CAAI,eAAA,CAAgB,UAAU,MAAM,CAAC,GAAG,OAAO,QAAA;AAC3D,EAAA,IACE,QAAA,KAAa,MAAA,IACb,mBAAA,CAAoB,SAAA,CAAU,MAAA,EAAQ;AAAA,IACpC,IAAI,QAAA,CAAS,QAAA;AAAA,IACb,MAAM,QAAA,CAAS;AAAA,GAChB,KAAK,CAAA,EACN;AACA,IAAA,OAAO,QAAA;AAAA,EACT;AACA,EAAA,OAAO;AAAA,IACL,EAAA,EAAI,UAAU,MAAA,CAAO,EAAA;AAAA,IACrB,IAAA,EAAM,UAAU,MAAA,CAAO,IAAA;AAAA,IACvB,QAAA,EAAU,UAAU,MAAA,CAAO,EAAA;AAAA,IAC3B,UAAA,EAAY,UAAU,MAAA,CAAO;AAAA,GAC/B;AACF;AAEA,SAAS,eACP,UAAA,EAC8B;AAC9B,EAAA,OAAO,CAAC,GAAG,UAAA,CAAW,MAAA,EAAQ,CAAA,CAAE,QAAA;AAAA,IAAS,CAAC,IAAA,EAAM,KAAA,KAC9C,mBAAA,CAAoB,MAAM,KAAK;AAAA,GACjC;AACF;AAEA,SAAS,kBAAA,CACP,UAAA,EACA,aAAA,EACA,eAAA,EAC6B;AAC7B,EAAA,IAAI,IAAA;AAOJ,EAAA,KAAA,MAAW,aAAa,UAAA,EAAY;AAClC,IAAA,MAAM,GAAA,GAAM,gBAAgB,SAAS,CAAA;AACrC,IAAA,MAAM,MAAA,GAAS,aAAA,CAAc,GAAA,CAAI,GAAG,CAAA;AACpC,IAAA,MAAM,QAAA,GAAW,eAAA,CAAgB,GAAA,CAAI,GAAG,CAAA;AACxC,IAAA,IAAI,MAAA,KAAW,MAAA,IAAa,QAAA,KAAa,MAAA,EAAW;AACpD,IAAA,MAAM,OAAA,GAAU;AAAA,MACd,GAAA;AAAA,MACA,MAAM,EAAE,EAAA,EAAI,UAAU,EAAA,EAAI,IAAA,EAAM,UAAU,IAAA,EAAK;AAAA,MAC/C,KAAA,EAAO,MAAA,CAAO,KAAA,GAAQ,QAAA,CAAS;AAAA,KACjC;AACA,IAAA,IACE,SAAS,MAAA,IACT,OAAA,CAAQ,KAAA,GAAQ,IAAA,CAAK,SACpB,OAAA,CAAQ,KAAA,KAAU,IAAA,CAAK,KAAA,IACtB,oBAAoB,OAAA,CAAQ,IAAA,EAAM,IAAA,CAAK,IAAI,IAAI,CAAA,EACjD;AACA,MAAA,IAAA,GAAO,OAAA;AAAA,IACT;AAAA,EACF;AACA,EAAA,OAAO,IAAA,EAAM,GAAA;AACf;AAEA,SAAS,iBAAA,CACP,UAAA,EACA,cAAA,EACA,cAAA,EACoB;AACpB,EAAA,MAAM,cAAiC,EAAC;AACxC,EAAA,IAAI,MAAA,GAAsC,UAAA;AAC1C,EAAA,OAAO,WAAW,MAAA,EAAW;AAC3B,IAAA,WAAA,CAAY,KAAK,MAAM,CAAA;AACvB,IAAA,MAAA,GAAS,cAAA,CAAe,GAAA,CAAI,MAAM,CAAA,EAAG,SAAA;AAAA,EACvC;AACA,EAAA,WAAA,CAAY,OAAA,EAAQ;AAEpB,EAAA,MAAM,QAAA,GAAW,CAAC,GAAG,WAAW,CAAA;AAChC,EAAA,MAAA,GAAS,cAAA,CAAe,GAAA,CAAI,UAAU,CAAA,EAAG,SAAA;AACzC,EAAA,OAAO,WAAW,MAAA,EAAW;AAC3B,IAAA,QAAA,CAAS,KAAK,MAAM,CAAA;AACpB,IAAA,MAAA,GAAS,cAAA,CAAe,GAAA,CAAI,MAAM,CAAA,EAAG,SAAA;AAAA,EACvC;AAEA,EAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,GAAA,CAAI,CAAC,GAAA,KAAQ;AAClC,IAAA,MAAM,OAAO,cAAA,CAAe,GAAA,CAAI,GAAG,CAAA,IAAK,cAAA,CAAe,IAAI,GAAG,CAAA;AAC9D,IAAA,OAAO,EAAE,IAAI,IAAA,EAAM,EAAA,IAAM,IAAI,IAAA,EAAM,IAAA,EAAM,QAAQ,EAAA,EAAG;AAAA,EACtD,CAAC,CAAA;AACD,EAAA,OAAO,EAAE,KAAA,EAAO,KAAA,EAAO,KAAA,CAAM,SAAS,CAAA,EAAE;AAC1C;AAEA,SAAS,iBACP,KAAA,EACmC;AACnC,EAAA,OAAO,IAAI,GAAA;AAAA,IACT,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AAAA,MAClB,gBAAgB,IAAI,CAAA;AAAA,MACpB,EAAE,EAAA,EAAI,IAAA,CAAK,EAAA,EAAI,IAAA,EAAM,KAAK,IAAA,EAAM,KAAA,EAAO,CAAA,EAAG,SAAA,EAAW,MAAA;AAAU,KAChE;AAAA,GACH;AACF;AAEA,SAAS,wBAAA,CACP,MACA,IAAA,EACmC;AACnC,EAAA,OAAO,IAAI,GAAA;AAAA,IACT,IAAA,CACG,MAAA,CAAO,CAAC,GAAA,KAAQ,GAAA,CAAI,SAAS,IAAI,CAAA,CACjC,GAAA,CAAI,CAAC,GAAA,KAAQ;AACZ,MAAA,MAAM,SAAA,GAAY,sBAAA;AAAA,QAChB,GAAA,CAAI,cAAA;AAAA,QACJ,GAAA,CAAI;AAAA,OACN;AACA,MAAA,MAAM,IAAA,GAAO;AAAA,QACX,IAAI,GAAA,CAAI,OAAA;AAAA,QACR,MAAM,GAAA,CAAI,SAAA;AAAA,QACV,KAAA,EAAO,MAAA,CAAO,GAAA,CAAI,KAAK,CAAA;AAAA,QACvB;AAAA,OACF;AACA,MAAA,OAAO,CAAC,eAAA,CAAgB,IAAI,CAAA,EAAG,IAAI,CAAA;AAAA,IACrC,CAAC;AAAA,GACL;AACF;AAEA,SAAS,iBAAiB,SAAA,EAAmD;AAC3E,EAAA,QAAQ,SAAA;AAAW,IACjB,KAAK,KAAA,EAAO;AACV,MAAA,OAAO,IAAA;AAAA,IACT;AAAA,IACA,KAAK,IAAA,EAAM;AACT,MAAA,OAAO,KAAA;AAAA,IACT;AAAA,IACA,KAAK,MAAA,EAAQ;AACX,MAAA,OAAO,MAAA;AAAA,IACT;AAAA;AAEJ;;;AC7vBA,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,UAAU,MAAM,kBAAA,CAAmB,GAAA,EAAK,QAAA,EAAU,SAAS,OAAO,CAAA;AACxE,EAAA,OAAO,OAAA,CAAQ,aAAA,KAAkB,IAAA,GAC7B,OAAA,CAAQ,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,EAAA,KAAO,QAAQ,CAAA,GAC7C,OAAA;AACN;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;AAEA,EAAA,OACG,MAAM,gBAAA,CAAiB,GAAA,EAAK,UAAU,QAAA,EAAU,OAAA,EAAS,OAAO,CAAA,KACjE,MAAA;AAEJ;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,GAAG,oBAAoB,OAAO,CAAA;AAAA,IAC9B,GAAI,OAAA,CAAQ,aAAA,KAAkB,MAAA,IAAa;AAAA,MACzC,eAAe,OAAA,CAAQ;AAAA,KACzB;AAAA,IACA,aAAA,EAAe;AAAA,GAChB,CAAA;AACH;;;AChEA,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;AACA,EAAA,OAAO,gBAAA,CAAiB,GAAA,EAAK,QAAA,EAAU,QAAA,EAAU,SAAS,OAAO,CAAA;AACnE;;;ACeA,IAAM,0BAAA,GAA6B,GAAA;AAGnC,eAAsB,gCAAA,CACpB,KACA,OAAA,EACwD;AACxD,EAAA,eAAA,CAAgB,QAAQ,KAAK,CAAA;AAC7B,EAAA,6BAAA,CAA8B,KAAK,2BAAA,EAA6B;AAAA,IAC9D,uBAAA,EAAyB;AAAA,GAC1B,CAAA;AACD,EAAA,MAAM,aAAA,GAAgB,oBAAA;AAAA,IACpB,OAAA,CAAQ,aAAA;AAAA,IACR,0BAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,MAAM,SAAA,GAAY,kBAAA,CAAmB,OAAA,CAAQ,SAAS,CAAA;AACtD,EAAA,MAAM,gBAAA,GAA6C;AAAA,IACjD,OAAO,OAAA,CAAQ,KAAA;AAAA,IACf,SAAA,EAAW,MAAA;AAAA,IACX,GAAG,oBAAoB,OAAO,CAAA;AAAA,IAC9B,GAAI,QAAQ,aAAA,KAAkB,MAAA,GAC5B,EAAC,GACD,EAAE,aAAA,EAAe,OAAA,CAAQ,aAAA;AAAc,GAC3C;AAEA,EAAA,OAAO,0BAAA,CAA2B,KAAK,gBAAA,EAAkB;AAAA,IACvD,SAAA,EAAW,2BAAA;AAAA,IACX,aAAA;AAAA,IACA,kBAAA,EAAAA,mBAAAA;AAAA,IACA,UAAA,EAAY,CAAC,OAAA,KAAYC,uBAAAA,CAAuB,SAAS,SAAS,CAAA;AAAA,IAClE,QAAA,EAAUC,yBAAAA;AAAA,IACV,aAAa,KAAA,EAAO;AAClB,MAAA,OAAO,MAAM,YAAA,KAAiB,CAAA;AAAA,IAChC,CAAA;AAAA,IACA,aAAA,EAAeC;AAAA,GAChB,CAAA;AACH;AAEA,SAASH,oBAAmB,OAAA,EAAgD;AAC1E,EAAA,OAAO,GAAA;AAAA,sBAAA,EACe,QAAQ,YAAY,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAAA,CAAA;AAa5C;AAEA,eAAeC,uBAAAA,CACb,SACA,SAAA,EACyB;AACzB,EAAA,MAAM,EAAE,SAAA,EAAW,YAAA,EAAc,OAAA,EAAS,OAAM,GAAI,OAAA;AACpD,EAAA,MAAM,cAAA,GAAiB,0BAA0B,SAAS,CAAA;AAC1D,EAAA,MAAM,QAAQ,gBAAA,CAAiB,GAAA;AAAA,gBAAA,EACf,YAAY;AAAA;AAAA;AAAA;AAAA,MAAA,EAItB,OAAO,KAAK,KAAK,CAAA;AAAA,SAAA,EACd,SAAA,CAAU,OAAO,UAAU,CAAA;AAAA,uBAAA,EACb,OAAO;AAAA,UAAA,EACpB,cAAc;AAAA,UAAA,EACd,UAAU,kBAAkB;AAAA,EAAA,CACrC,CAAA;AACD,EAAA,MAAM,QAAQ,gBAAA,CAAiB,GAAA;AAAA,iBAAA,EACd,uBAAA,CAAwB,OAAO,CAAC;AAAA,OAAA,EAC1C,YAAY,CAAA;AAAA,EAAA,CAClB,CAAA;AAED,EAAA,MAAM,gBAAA,GAAmB,MAAM,qBAAA,CAAsB,OAAO,CAAA;AAC5D,EAAA,OAAO,EAAE,YAAA,EAAc,gBAAA,EAAkB,gBAAA,EAAiB;AAC5D;AAEA,eAAeC,yBAAAA,CACb,OAAA,EACA,KAAA,EACA,SAAA,EACyB;AACzB,EAAA,KAAA,MAAW,SAAA,IAAa,OAAA,CAAQ,SAAA,CAAU,cAAA,EAAgB;AACxD,IAAA,MAAM,oBAAA,CAAqB,OAAA,EAAS,SAAA,EAAW,SAAS,CAAA;AAAA,EAC1D;AACA,EAAA,MAAM,WAAA,GAAc,MAAME,gBAAAA,CAAgB,OAAA,EAAS,SAAS,CAAA;AAC5D,EAAA,OAAO;AAAA,IACL,cAAc,WAAA,CAAY,MAAA;AAAA,IAC1B,kBAAkB,KAAA,CAAM;AAAA,GAC1B;AACF;AAYA,eAAe,oBAAA,CACb,OAAA,EACA,SAAA,EACA,SAAA,EACe;AACf,EAAA,MAAM,EAAE,SAAA,EAAW,YAAA,EAAc,OAAA,EAAS,OAAM,GAAI,OAAA;AACpD,EAAA,MAAM,SAAA,GAAY,gCAAA;AAAA,IAChB,SAAA;AAAA,IACA,YAAA;AAAA,IACA,GAAA;AAAA,mBAAA,EACiB,OAAO;AAAA,qBAAA,EACL,KAAK;AAAA,6BAAA,EACG,YAAY,CAAC;AAAA,IAAA,CAAA;AAAA,IAExC,MAAA;AAAA,IACA,SAAA;AAAA,IACA,GAAA,CAAA,gEAAA;AAAA,GACF;AACA,EAAA,MAAM,WAAA,GAAc,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,eAAA,CAAoB,CAAA;AACzE,EAAA,MAAM,aAAA,GAAgB,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,UAAA;AAAA,IAC1C,GAAA,CAAA,iBAAA;AAAA,GACF;AACA,EAAA,MAAM,SAAA,GAAY,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,oBAAA,CAAyB,CAAA;AAC5E,EAAA,MAAM,WAAA,GAAc,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,UAAA;AAAA,IACxC,GAAA,CAAA,sBAAA;AAAA,GACF;AACA,EAAA,MAAM,QAAA,GAAW,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,eAAA,CAAoB,CAAA;AACtE,EAAA,MAAM,UAAA,GAAa,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,iBAAA,CAAsB,CAAA;AAC1E,EAAA,MAAM,QAAA,GAAW,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,gBAAA,CAAqB,CAAA;AACvE,EAAA,MAAM,UAAA,GAAa,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,kBAAA,CAAuB,CAAA;AAE3E,EAAA,MAAM,QAAQ,gBAAA,CAAiB,GAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAAA,EAOnB,SAAS,CAAA;AAAA,WAAA,EACV,YAAY,CAAA;AAAA,oCAAA,EACa,OAAO;AAAA,mCAAA,EACR,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,uBAAA,EAUjB,UAAU,KAAK,QAAQ;AAAA,mBAAA,EAC3B,QAAQ,KAAK,UAAU;AAAA;AAAA;AAAA;AAAA,WAAA,EAI/B,YAAY,CAAA;AAAA;AAAA;AAAA;AAAA,4BAAA,EAIK,OAAO;AAAA,0BAAA,EACT,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA,QAAA,EAKvB,WAAW,MAAM,SAAS;AAAA;AAAA,UAAA,EAExB,WAAW,MAAM,SAAS;AAAA,cAAA,EACtB,aAAa,MAAM,WAAW;AAAA;AAAA;AAAA,EAAA,CAG3C,CAAA;AACH;AAEA,SAASA,gBAAAA,CACP,SACA,SAAA,EACgC;AAChC,EAAA,OAAO,QAAQ,OAAA,CAAQ,OAAA;AAAA,IACrB,iBAAA,CAAkB,GAAA;AAAA,aAAA,EACP,QAAQ,YAAY;AAAA;AAAA;AAAA,2BAAA,EAGN,SAAS;AAAA,uBAAA,EACb,QAAQ,OAAO;AAAA,qBAAA,EACjB,QAAQ,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,CAK/B;AAAA,GACH;AACF;AAEA,eAAeD,oBACb,OAAA,EACwD;AACxD,EAAA,MAAM,EAAE,WAAU,GAAI,OAAA;AACtB,EAAA,MAAM,WAAA,GAAc,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,QAAA,CAAa,CAAA;AAClE,EAAA,MAAM,aAAA,GAAgB,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,UAAA,CAAe,CAAA;AACtE,EAAA,MAAM,MAAA,GAAS,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,OAAA,CAAY,CAAA;AAC5D,EAAA,MAAM,QAAA,GAAW,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,WAAW,GAAA,CAAA,SAAA,CAAc,CAAA;AAChE,EAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,OAAA,CAAQ,OAAA;AAAA,IACjC,iBAAA,CAAkB,GAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,uBAAA,EAOG,aAAa,KAAK,WAAW;AAAA;AAAA,WAAA,EAEzC,QAAQ,YAAY;AAAA,uBAAA,EACR,OAAA,CAAQ,OAAO,CAAA,cAAA,EAAiB,OAAA,CAAQ,KAAK;AAAA,eAAA,EACrD,WAAW,CAAA,EAAA,EAAK,aAAa,CAAA,EAAA,EAAK,MAAM,KAAK,QAAQ;AAAA,IAAA,CACjE;AAAA,GACH;AAEA,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,MAAS;AAAA,IACxB,IAAI,GAAA,CAAI,OAAA;AAAA,IACR,MAAM,GAAA,CAAI,SAAA;AAAA,IACV,aAAa,GAAA,CAAI,YAAA;AAAA,IACjB,eAAe,GAAA,CAAI,cAAA;AAAA,IACnB,IAAA,EAAM,MAAA,CAAO,GAAA,CAAI,cAAc;AAAA,GACjC,CAAE,CAAA;AACJ;;;AC7OA,IAAM,6CAAA,GAAgD,GAAA;AAEtD,IAAM,uBAAA,GAA0B,sBAAA;AAWhC,IAAM,eAAA,GAAkB,MAAA,CAAO,SAAA,GAAY,CAAA,IAAK,EAAA;AAUhD,IAAM,kBAAkB,MAAA,CAAO,SAAA;AAwE/B,eAAsB,2BAAA,CACpB,GAAA,EACA,QAAA,EACA,QAAA,EACA,OAAA,EACiD;AACjD,EAAA,eAAA,CAAgB,QAAQ,KAAK,CAAA;AAC7B,EAAA,mBAAA,CAAoB,OAAA,CAAQ,cAAA,EAAgB,OAAA,CAAQ,aAAa,CAAA;AACjE,EAAA,MAAM,aAAA,GAAgB,oBAAA;AAAA,IACpB,OAAA,CAAQ,aAAA;AAAA,IACR,6CAAA;AAAA,IACA;AAAA,GACF;AAGA,EAAA,MAAM,gBAAA,GAA6C,OAAA;AAKnD,EAAA,IAAI,aAAa,QAAA,EAAU;AACzB,IAAA,OAAO,oBAAA,CAAqB,GAAA,EAAK,QAAA,EAAU,gBAAgB,CAAA;AAAA,EAC7D;AAEA,EAAA,IAAI,0BAAA,CAA2B,GAAG,CAAA,EAAG;AACnC,IAAA,OAAO,sCAAA;AAAA,MACL,GAAA;AAAA,MACA,QAAA;AAAA,MACA,QAAA;AAAA,MACA,aAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AACA,EAAA,OAAO,8BAAA;AAAA,IACL,GAAA;AAAA,IACA,QAAA;AAAA,IACA,QAAA;AAAA,IACA,aAAA;AAAA,IACA;AAAA,GACF;AACF;AAEA,SAAS,mBAAA,CACP,gBACA,aAAA,EACM;AACN,EAAA,IAAI,OAAO,cAAA,KAAmB,QAAA,IAAY,cAAA,CAAe,WAAW,CAAA,EAAG;AACrE,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,GAAG,uBAAuB,CAAA,2CAAA,CAAA;AAAA,MAC1B,EAAE,cAAA;AAAe,KACnB;AAAA,EACF;AAIA,EAAA,IACE,aAAA,KAAkB,MAAA,KACjB,CAAC,MAAA,CAAO,QAAA,CAAS,aAAa,CAAA,IAC7B,aAAA,GAAgB,CAAA,IAChB,aAAA,GAAgB,eAAA,CAAA,EAClB;AACA,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,GAAG,uBAAuB,CAAA,6DAAA,EAAgE,eAAe,CAAA,MAAA,EAAS,MAAA,CAAO,aAAa,CAAC,CAAA,CAAA,CAAA;AAAA,MACvI,EAAE,aAAA,EAAe,OAAA,EAAS,eAAA;AAAgB,KAC5C;AAAA,EACF;AACF;AAcA,eAAe,sBAAA,CACb,SAAA,EACA,cAAA,EACA,aAAA,EACe;AACf,EAAA,MAAM,EAAE,OAAA,EAAQ,GAAI,SAAA,CAAU,GAAA;AAC9B,EAAA,MAAM,OAAA,GAAU,WAAA,CAAY,CAAC,cAAc,CAAC,CAAA;AAC5C,EAAA,MAAM,WAAA,GAAc,GAAA,CAAI,GAAA,CAAI,SAAS,CAAA;AAQrC,EAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,gBAAA,CAAiB,WAAA,EAAa,OAAO,CAAA;AAC9D,EAAA,MAAM,SAAA,GAAY,OAAA,CAAQ,cAAA,CAAe,WAAA,EAAa,OAAO,CAAA;AAC7D,EAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,eAAA,CAAgB,WAAA,EAAa,OAAO,CAAA;AAO/D,EAAA,MAAM,YAAA,GAAe,gBAAgB,QAAQ,CAAA,MAAA,EAAS,QAAQ,iBAAA,CAAkB,WAAA,EAAa,OAAO,CAAC,CAAA,IAAA,CAAA;AACrG,EAAA,MAAM,mBACJ,aAAA,KAAkB,MAAA,GAChB,GAAA,CAAA,sBAAA,CAAA,GACA,OAAA,CAAQ,eAAe,KAAK,CAAA;AAChC,EAAA,MAAM,iBAAA,GAAoB,GAAA,CAAA,mDAAA,CAAA;AAO1B,EAAA,MAAM,mBAAA,GAAsB,GAAA,CAAA,6DAAA,EAAmE,eAAe,CAAA,kFAAA,EAAqF,eAAe,CAAA,cAAA,CAAA;AAElN,EAAA,KAAA,MAAW,SAAA,IAAa,UAAU,cAAA,EAAgB;AAChD,IAAA,MAAM,iBAAiB,iBAAA,CAAkB,GAAA,CAAI,GAAA,CAAI,QAAQ,GAAG,SAAS,CAAA;AACrE,IAAA,MAAM,IAAA,GAAO,MAAM,SAAA,CAAU,OAAA,CAAQ,OAAA;AAAA,MACnC,iBAAA,CAAkB,GAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAAA,EAKV,UAAU,CAAA;AAAA,YAAA,EACV,YAAY,CAAA;AAAA,sBAAA,EACF,QAAQ,CAAA;AAAA,sBAAA,EACR,SAAS,CAAA;AAAA,eAAA,EAChB,SAAA,CAAU,OAAO,UAAU,CAAA;AAAA,6BAAA,EACb,SAAA,CAAU,IAAI,OAAO;AAAA,gBAAA,EAClC,cAAc;AAAA,gBAAA,EACd,UAAU,kBAAkB;AAAA;AAAA,eAAA,EAE7B,gBAAgB,CAAA;AAAA;AAAA,cAAA,EAEjB,iBAAiB,CAAA;AAAA,cAAA,EACjB,mBAAmB,CAAA;AAAA,iBAAA,EAChB,OAAA,CAAQ,UAAA,CAAW,GAAA,CAAA,eAAA,CAAoB,CAAC;AAAA;AAAA,MAAA,CAEpD;AAAA,KACH;AACA,IAAA,MAAM,GAAA,GAAM,KAAK,CAAC,CAAA;AAClB,IAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,MAAA,MAAM,4BAAA,CAA6B,KAAK,cAAc,CAAA;AAAA,IACxD;AAAA,EACF;AACF;AAEA,SAAS,4BAAA,CACP,KACA,cAAA,EACwB;AACxB,EAAA,MAAM,MAAA,GAAS,2BAA2B,GAAG,CAAA;AAC7C,EAAA,MAAM,KAAA,GACJ,WAAW,SAAA,IAAa,GAAA,CAAI,gBAAgB,IAAA,GAC1C,MAAA,GACA,iBAAA,CAAkB,GAAA,CAAI,WAAW,CAAA;AACrC,EAAA,OAAO,IAAI,sBAAA,CAAuB;AAAA,IAChC,QAAQ,GAAA,CAAI,OAAA;AAAA,IACZ,UAAU,GAAA,CAAI,SAAA;AAAA,IACd,QAAA,EAAU,cAAA;AAAA,IACV,MAAA;AAAA,IACA,GAAI,KAAA,KAAU,MAAA,GAAY,EAAC,GAAI,EAAE,KAAA;AAAM,GACxC,CAAA;AACH;AAEA,SAAS,2BACP,GAAA,EACyB;AACzB,EAAA,IAAI,SAAA,CAAU,GAAA,CAAI,UAAU,CAAA,EAAG,OAAO,SAAA;AACtC,EAAA,IAAI,CAAC,SAAA,CAAU,GAAA,CAAI,SAAS,GAAG,OAAO,aAAA;AAItC,EAAA,OAAO,MAAA,CAAO,GAAA,CAAI,WAAW,CAAA,GAAI,IAAI,UAAA,GAAa,cAAA;AACpD;AAGA,SAAS,UAAU,KAAA,EAAyB;AAC1C,EAAA,OAAO,MAAA,CAAO,KAAK,CAAA,KAAM,CAAA;AAC3B;AAGA,SAAS,kBAAkB,KAAA,EAAwB;AACjD,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,OAAO,KAAA;AACtC,EAAA,IACE,OAAO,UAAU,QAAA,IACjB,OAAO,UAAU,QAAA,IACjB,OAAO,UAAU,SAAA,EACjB;AACA,IAAA,OAAO,OAAO,KAAK,CAAA;AAAA,EACrB;AACA,EAAA,OAAO,IAAA,CAAK,UAAU,KAAK,CAAA;AAC7B;AAMA,eAAe,sCAAA,CACb,GAAA,EACA,QAAA,EACA,QAAA,EACA,eACA,OAAA,EACiD;AACjD,EAAA,OAAO,0BAAA,CAGL,KAAK,OAAA,EAAS;AAAA,IACd,SAAA,EAAW,uBAAA;AAAA,IACX,aAAA;AAAA,IACA,kBAAA,EAAAH,mBAAAA;AAAA,IACA,MAAM,WAAW,OAAA,EAAS;AACxB,MAAA,MAAM,sBAAA;AAAA,QACJ,OAAA,CAAQ,SAAA;AAAA,QACR,OAAA,CAAQ,cAAA;AAAA,QACR,OAAA,CAAQ;AAAA,OACV;AAGA,MAAA,IAAI,CAAE,MAAM,cAAA,CAAe,OAAA,CAAQ,SAAA,EAAW,QAAQ,CAAA,EAAI;AACxD,QAAA,OAAO;AAAA,UACL,aAAA,EAAe,CAAA;AAAA,UACf,gBAAA,EAAkB,CAAA;AAAA,UAClB,kBAAA,EAAoB;AAAA,SACtB;AAAA,MACF;AAIA,MAAA,MAAM,QAAQ,gBAAA,CAAiB,GAAA;AAAA,qBAAA,EACd,uBAAA,CAAwB,OAAO,CAAC;AAAA,WAAA,EAC1C,QAAQ,YAAY,CAAA;AAAA,MAAA,CAC1B,CAAA;AACD,MAAA,MAAM,MAAA,GAAS,MAAM,aAAA,CAAc,OAAA,EAAS,QAAQ,CAAA;AACpD,MAAA,OAAO;AAAA,QACL,eAAe,MAAA,CAAO,MAAA;AAAA,QACtB,kBAAkB,MAAA,CAAO,MAAA;AAAA;AAAA;AAAA,QAGzB,kBAAA,EAAoB;AAAA,OACtB;AAAA,IACF,CAAA;AAAA,IACA,MAAM,QAAA,CAAS,OAAA,EAAS,KAAA,EAAO,SAAA,EAAW;AACxC,MAAA,MAAM,QAAQ,MAAM,kBAAA;AAAA,QAClB,OAAA;AAAA,QACA,QAAA;AAAA,QACA,SAAA;AAAA,QACA,KAAA,CAAM;AAAA,OACR;AACA,MAAA,OAAO;AAAA,QACL,eAAe,KAAA,CAAM,aAAA;AAAA;AAAA;AAAA;AAAA,QAIrB,gBAAA,EAAkB,KAAA,CAAM,gBAAA,GAAmB,KAAA,CAAM,aAAA;AAAA,QACjD,oBAAoB,KAAA,CAAM;AAAA,OAC5B;AAAA,IACF,CAAA;AAAA,IACA,aAAa,KAAA,EAAsB;AACjC,MAAA,OAAO,MAAM,aAAA,KAAkB,CAAA;AAAA,IACjC,CAAA;AAAA,IACA,MAAM,cAAc,OAAA,EAAS;AAC3B,MAAA,OAAO,2BAAA,CAA4B,OAAA,EAAS,QAAA,EAAU,aAAa,CAAA;AAAA,IACrE;AAAA,GACD,CAAA;AACH;AAKA,eAAe,cAAA,CACb,WACA,MAAA,EACkB;AAClB,EAAA,MAAM,IAAA,GAAO,MAAM,SAAA,CAAU,OAAA,CAAQ,OAAA;AAAA,IACnC,iBAAA,CAAkB,GAAA;AAAA,uBAAA,EACG,SAAA,CAAU,OAAO,UAAU,CAAA;AAAA,yBAAA,EACzB,SAAA,CAAU,IAAI,OAAO;AAAA,mBAAA,EAC3B,MAAM;AAAA,YAAA,EACb,UAAU,kBAAkB;AAAA;AAAA,IAAA,CAErC;AAAA,GACH;AACA,EAAA,OAAO,KAAK,MAAA,GAAS,CAAA;AACvB;AAEA,SAASA,oBAAmB,OAAA,EAAgD;AAG1E,EAAA,OAAO,GAAA;AAAA,sBAAA,EACe,QAAQ,YAAY,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAAA,CAAA;AAa5C;AAEA,eAAe,aAAA,CACb,SACA,QAAA,EAC+B;AAC/B,EAAA,MAAM,EAAE,SAAA,EAAW,YAAA,EAAc,OAAA,EAAS,OAAM,GAAI,OAAA;AACpD,EAAA,OAAO,QAAQ,OAAA,CAAQ,OAAA;AAAA,IACrB,iBAAA,CAAkB,GAAA;AAAA,kBAAA,EACF,YAAY;AAAA;AAAA;AAAA,aAAA,EAGjB,OAAO,KAAK,KAAK,CAAA;AAAA,WAAA,EACnB,SAAA,CAAU,OAAO,UAAU,CAAA;AAAA,yBAAA,EACb,OAAO;AAAA,mBAAA,EACb,QAAQ;AAAA,YAAA,EACf,UAAU,kBAAkB;AAAA;AAAA;AAAA,IAAA,CAGrC;AAAA,GACH;AACF;AAmBA,eAAe,kBAAA,CACb,OAAA,EACA,QAAA,EACA,SAAA,EACA,UAAA,EACwB;AACxB,EAAA,MAAM,EAAE,SAAA,EAAW,YAAA,EAAc,OAAA,EAAS,OAAM,GAAI,OAAA;AACpD,EAAA,MAAM,EAAE,OAAA,EAAQ,GAAI,SAAA,CAAU,GAAA;AAC9B,EAAA,IAAI,aAAA,GAAgB,CAAA;AACpB,EAAA,IAAI,kBAAA,GAAqB,UAAA;AACzB,EAAA,KAAA,MAAW,SAAA,IAAa,UAAU,cAAA,EAAgB;AAChD,IAAA,MAAM,YAAA,GAAe,GAAA;AAAA,mBAAA,EACJ,OAAO;AAAA,qBAAA,EACL,KAAK;AAAA,6BAAA,EACG,YAAY,CAAC;AAAA,IAAA,CAAA;AAExC,IAAA,MAAM,SAAA,GAAY,4BAAA;AAAA,MAChB,SAAA;AAAA,MACA,YAAA;AAAA,MACA,YAAA;AAAA,MACA,SAAA,CAAU,SAAA;AAAA,MACV;AAAA,KACF;AACA,IAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,OAAA,CAAQ,OAAA;AAAA,MACjC,iBAAA,CAAkB,GAAA;AAAA,oBAAA,EACF,YAAY;AAAA;AAAA;AAAA;AAAA,UAAA,EAItB,OAAO,KAAK,KAAK,CAAA;AAAA;AAAA,gDAAA,EAEqB,SAAS;AAAA;AAAA;AAAA;AAAA,2BAAA,EAI9B,OAAA,CAAQ,UAAA,CAAW,GAAA,CAAA,sBAAA,CAA2B,CAAC,CAAA;AAAA,gBAAA,EAC1D,OAAA,CAAQ,UAAA,CAAW,GAAA,CAAA,oBAAA,CAAyB,CAAC;AAAA;AAAA,gBAAA,EAE7C,OAAA,CAAQ,UAAA,CAAW,GAAA,CAAA,oBAAA,CAAyB,CAAC,CAAA;AAAA,gBAAA,EAC7C,OAAA,CAAQ,UAAA,CAAW,GAAA,CAAA,sBAAA,CAA2B,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kBAAA,EAO7C,SAAS,CAAA;AAAA,iBAAA,EACV,YAAY,CAAA;AAAA,qCAAA,EACQ,OAAO;AAAA,oCAAA,EACR,KAAK;AAAA;AAAA;AAAA;AAAA,gBAAA,EAK/B,UAAA,KAAe,MAAA,GACb,GAAA,CAAA,IAAA,CAAA,GACA,GAAA,CAAA,iCAAA,EAAuC,UAAU,CAAA,CACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kCAAA,EAS0B,YAAY,CAAA;AAAA;AAAA,MAAA,CAEzC;AAAA,KACH;AACA,IAAA,aAAA,IAAiB,IAAA,CAAK,MAAA;AACtB,IAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,MAAA,IAAI,GAAA,CAAI,YAAY,QAAA,EAAU;AAC9B,MAAA,MAAM,QAAA,GAAW,MAAA,CAAO,GAAA,CAAI,QAAQ,CAAA;AACpC,MAAA,IAAI,kBAAA,KAAuB,MAAA,IAAa,QAAA,GAAW,kBAAA,EAAoB;AACrE,QAAA,kBAAA,GAAqB,QAAA;AAAA,MACvB;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,EAAE,eAAe,kBAAA,EAAmB;AAC7C;AAWA,eAAe,2BAAA,CACb,OAAA,EACA,QAAA,EACA,aAAA,EACiD;AACjD,EAAA,MAAM,EAAE,SAAA,EAAW,YAAA,EAAc,OAAA,EAAS,OAAM,GAAI,OAAA;AACpD,EAAA,MAAM,EAAE,OAAA,EAAQ,GAAI,SAAA,CAAU,GAAA;AAC9B,EAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,OAAA,CAAQ,OAAA;AAAA,IACjC,iBAAA,CAAkB,GAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,eAAA,EAOL,YAAY;AAAA,2BAAA,EACA,OAAO;AAAA,yBAAA,EACT,KAAK;AAAA,0BAAA,EACJ,QAAQ;AAAA,iCAAA,EACD,OAAA,CAAQ,UAAA,CAAW,GAAA,CAAA,SAAA,CAAc,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,aAAA,EAOtD,YAAY,CAAA;AAAA,0BAAA,EACC,OAAO;AAAA,yBAAA,EACR,KAAK;AAAA;AAAA;AAAA,4BAAA,EAGF,aAAa;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,CAKtC;AAAA,GACH;AAEA,EAAA,MAAM,MAAA,GAAS,IAAA,CAAK,EAAA,CAAG,EAAE,CAAA;AACzB,EAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AACjC,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,MAAS,EAAE,EAAA,EAAI,GAAA,CAAI,OAAA,EAAS,IAAA,EAAM,GAAA,CAAI,SAAA,EAAU,CAAE,CAAA;AAAA,IACnE,KAAA,EAAO,MAAA,CAAO,MAAA,CAAO,IAAI,CAAA;AAAA,IACzB,WAAA,EAAa,MAAA,CAAO,MAAA,CAAO,QAAQ;AAAA,GACrC;AACF;AAQA,eAAe,oBAAA,CACb,GAAA,EACA,MAAA,EACA,OAAA,EACiD;AACjD,EAAA,OAAO,iCAAA,CAAkC,GAAA,EAAK,OAAA,EAAS,OAAO,SAAA,KAAc;AAC1E,IAAA,MAAM,sBAAA;AAAA,MACJ,SAAA;AAAA,MACA,OAAA,CAAQ,cAAA;AAAA,MACR,OAAA,CAAQ;AAAA,KACV;AACA,IAAA,MAAM,QAAQ,MAAM,wBAAA,CAAyB,SAAA,EAAW,CAAC,MAAM,CAAC,CAAA;AAChE,IAAA,MAAM,OAAO,KAAA,CAAM,QAAA;AAAA,MAAS,CAAC,IAAA,EAAM,KAAA,KACjC,mBAAA,CAAoB,MAAM,KAAK;AAAA,MAC/B,CAAC,CAAA;AACH,IAAA,IAAI,SAAS,MAAA,EAAW;AACxB,IAAA,OAAO,EAAE,OAAO,CAAC,IAAI,GAAG,KAAA,EAAO,CAAA,EAAG,aAAa,CAAA,EAAE;AAAA,EACnD,CAAC,CAAA;AACH;AAMA,eAAe,8BAAA,CACb,GAAA,EACA,QAAA,EACA,QAAA,EACA,eACA,OAAA,EACiD;AACjD,EAAA,OAAO,iCAAA,CAAkC,GAAA,EAAK,OAAA,EAAS,OAAO,SAAA,KAAc;AAC1E,IAAA,MAAM,sBAAA;AAAA,MACJ,SAAA;AAAA,MACA,OAAA,CAAQ,cAAA;AAAA,MACR,OAAA,CAAQ;AAAA,KACV;AACA,IAAA,MAAM,SAAA,GAAY,MAAM,wBAAA,CAAyB,SAAA,EAAW;AAAA,MAC1D,QAAA;AAAA,MACA;AAAA,KACD,CAAA;AACD,IAAA,MAAM,UAAU,SAAA,CAAU,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,OAAO,QAAQ,CAAA;AAG/D,IAAA,IACE,OAAA,CAAQ,MAAA,KAAW,CAAA,IACnB,CAAC,SAAA,CAAU,IAAA,CAAK,CAAC,IAAA,KAAS,IAAA,CAAK,EAAA,KAAO,QAAQ,CAAA,EAC9C;AACA,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,UAAU,IAAI,GAAA;AAAA,MAClB,OAAA,CAAQ,GAAA,CAAI,CAAC,MAAA,KAAW;AAAA,QACtB,gBAAgB,MAAM,CAAA;AAAA,QACtB;AAAA,UACE,IAAI,MAAA,CAAO,EAAA;AAAA,UACX,MAAM,MAAA,CAAO,IAAA;AAAA,UACb,QAAA,EAAU,CAAA;AAAA,UACV,IAAA,EAAM,CAAA;AAAA,UACN,SAAA,EAAW;AAAA;AACb,OACD;AAAA,KACH;AACA,IAAA,IAAI,kBAAA;AACJ,IAAA,IAAI,QAAA,GAAgC,OAAA;AACpC,IAAA,IAAI,MAAA,GAAS,CAAA;AAEb,IAAA,OAAO,QAAA,CAAS,SAAS,CAAA,EAAG;AAC1B,MAAA,IAAI,UAAU,aAAA,EAAe;AAC3B,QAAA,MAAM,IAAI,8BAAA;AAAA,UACR,uBAAA;AAAA,UACA;AAAA,SACF;AAAA,MACF;AACA,MAAA,MAAA,EAAA;AAEA,MAAA,MAAM,aAAa,MAAM,wBAAA;AAAA,QACvB,SAAA;AAAA,QACA,QAAA;AAAA,QACA,SAAA,CAAU,SAAA;AAAA,QACV,CAAC,QAAA,EAAU,SAAA,KACT,uBAAA,CAAwB,QAAA,EAAU,WAAW,OAAO;AAAA,OACxD;AAKA,MAAA,MAAM,UAAA,GAAa,kBAAA;AACnB,MAAA,MAAM,WAAuB,EAAC;AAC9B,MAAA,KAAA,MAAW,CAAC,YAAA,EAAc,SAAS,CAAA,IAAK,UAAA,EAAY;AAClD,QAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,GAAA,CAAI,YAAY,CAAA;AACzC,QAAA,IAAI,QAAA,KAAa,MAAA,IAAa,QAAA,CAAS,QAAA,IAAY,UAAU,QAAA,EAAU;AACrE,UAAA;AAAA,QACF;AAKA,QAAA,IAAI,UAAA,KAAe,MAAA,IAAa,SAAA,CAAU,QAAA,GAAW,UAAA,EAAY;AAC/D,UAAA;AAAA,QACF;AACA,QAAA,OAAA,CAAQ,IAAI,YAAA,EAAc;AAAA,UACxB,IAAI,SAAA,CAAU,EAAA;AAAA,UACd,MAAM,SAAA,CAAU,IAAA;AAAA,UAChB,UAAU,SAAA,CAAU,QAAA;AAAA,UACpB,MAAM,SAAA,CAAU,IAAA;AAAA,UAChB,WAAW,eAAA,CAAgB;AAAA,YACzB,IAAI,SAAA,CAAU,QAAA;AAAA,YACd,MAAM,SAAA,CAAU;AAAA,WACjB;AAAA,SACF,CAAA;AACD,QAAA,QAAA,CAAS,IAAA,CAAK,EAAE,EAAA,EAAI,SAAA,CAAU,IAAI,IAAA,EAAM,SAAA,CAAU,MAAM,CAAA;AACxD,QAAA,IACE,UAAU,EAAA,KAAO,QAAA,KAChB,uBAAuB,MAAA,IACtB,SAAA,CAAU,WAAW,kBAAA,CAAA,EACvB;AACA,UAAA,kBAAA,GAAqB,SAAA,CAAU,QAAA;AAAA,QACjC;AAAA,MACF;AACA,MAAA,QAAA,GAAW,QAAA,CAAS,QAAA;AAAA,QAAS,CAAC,IAAA,EAAM,KAAA,KAClC,mBAAA,CAAoB,MAAM,KAAK;AAAA,OACjC;AAAA,IACF;AAEA,IAAA,OAAO,uBAAA,CAAwB,SAAS,QAAQ,CAAA;AAAA,EAClD,CAAC,CAAA;AACH;AAMA,SAAS,uBAAA,CACP,QAAA,EACA,SAAA,EACA,OAAA,EAC+B;AAG/B,EAAA,MAAM,SAAS,SAAA,CAAU,MAAA;AACzB,EAAA,IAAI,MAAA,KAAW,QAAW,OAAO,QAAA;AACjC,EAAA,MAAM,cAAc,OAAA,CAAQ,GAAA,CAAI,eAAA,CAAgB,SAAA,CAAU,MAAM,CAAC,CAAA;AACjE,EAAA,IAAI,WAAA,KAAgB,QAAW,OAAO,QAAA;AACtC,EAAA,MAAM,iBAAA,GAAoB,YAAY,QAAA,GAAW,MAAA;AACjD,EAAA,IACE,aAAa,MAAA,KACZ,QAAA,CAAS,WAAW,iBAAA,IAClB,QAAA,CAAS,aAAa,iBAAA,IACrB,mBAAA;AAAA,IACE,EAAE,EAAA,EAAI,QAAA,CAAS,QAAA,EAAU,IAAA,EAAM,SAAS,UAAA,EAAW;AAAA,IACnD,SAAA,CAAU;AAAA,OACP,CAAA,CAAA,EACT;AACA,IAAA,OAAO,QAAA;AAAA,EACT;AACA,EAAA,OAAO;AAAA,IACL,EAAA,EAAI,UAAU,MAAA,CAAO,EAAA;AAAA,IACrB,IAAA,EAAM,UAAU,MAAA,CAAO,IAAA;AAAA,IACvB,QAAA,EAAU,iBAAA;AAAA,IACV,IAAA,EAAM,YAAY,IAAA,GAAO,CAAA;AAAA,IACzB,QAAA,EAAU,UAAU,MAAA,CAAO,EAAA;AAAA,IAC3B,UAAA,EAAY,UAAU,MAAA,CAAO;AAAA,GAC/B;AACF;AAWA,SAAS,uBAAA,CACP,SACA,QAAA,EACwC;AACxC,EAAA,IAAI,MAAA;AACJ,EAAA,KAAA,MAAW,IAAA,IAAQ,OAAA,CAAQ,MAAA,EAAO,EAAG;AACnC,IAAA,IAAI,IAAA,CAAK,OAAO,QAAA,EAAU;AAC1B,IAAA,IACE,MAAA,KAAW,MAAA,IACX,IAAA,CAAK,QAAA,GAAW,OAAO,QAAA,IACtB,IAAA,CAAK,QAAA,KAAa,MAAA,CAAO,QAAA,IACxB,mBAAA,CAAoB,IAAA,EAAM,MAAM,IAAI,CAAA,EACtC;AACA,MAAA,MAAA,GAAS,IAAA;AAAA,IACX;AAAA,EACF;AACA,EAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AAEjC,EAAA,MAAM,gBAA4B,EAAC;AACnC,EAAA,IAAI,MAAA,GAA0C,MAAA;AAC9C,EAAA,OAAO,WAAW,MAAA,EAAW;AAC3B,IAAA,aAAA,CAAc,IAAA,CAAK,EAAE,EAAA,EAAI,MAAA,CAAO,IAAI,IAAA,EAAM,MAAA,CAAO,MAAM,CAAA;AACvD,IAAA,MAAA,GACE,OAAO,SAAA,KAAc,MAAA,GACnB,SACA,OAAA,CAAQ,GAAA,CAAI,OAAO,SAAS,CAAA;AAAA,EAClC;AAEA,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,cAAc,UAAA,EAAW;AAAA,IAChC,OAAO,MAAA,CAAO,IAAA;AAAA,IACd,aAAa,MAAA,CAAO;AAAA,GACtB;AACF;;;AC1vBA,SAAS,cAAc,KAAA,EAA+B;AACpD,EAAA,OAAO,OAAO,KAAA,KAAU,QAAA,GAAW,KAAA,GAAQ,KAAA,CAAM,EAAA;AACnD;AA2KA,SAAS,8BAAA,CACP,OAAA,EACA,MAAA,EACA,iBAAA,EACM;AACN,EAAA,IAAI,iBAAA,EAAmB;AACvB,EAAA,0BAAA,CAA2B,OAAA,EAAS;AAAA,IAClC,IAAA,EAAM,uCAAA;AAAA,IACN,OAAA,EAAS,kEAAkE,MAAM,CAAA,MAAA,CAAA;AAAA,IACjF,OAAA,EAAS,EAAE,MAAA,EAAO;AAAA,IAClB,UAAA,EACE;AAAA,GACH,CAAA;AACH;AAEO,SAAS,sBACd,MAAA,EAC4B;AAC5B,EAAA,MAAM,iBAAA,GAAoB,OAAO,iBAAA,KAAsB,IAAA;AACvD,EAAA,MAAM,GAAA,GAAwB;AAAA,IAC5B,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,OAAO,MAAA,CAAO,KAAA;AAAA,IACd,UAAU,MAAA,CAAO,QAAA;AAAA,IACjB,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,OAAA,EAAS,UAAA,CAAW,MAAA,CAAO,OAAA,CAAQ,OAAO,CAAA;AAAA,IAC1C,QAAQ,MAAA,CAAO,MAAA,IAAU,eAAA,CAAgB,MAAA,CAAO,QAAQ,UAAU,CAAA;AAAA,IAClE,qBAAqB,MAAA,CAAO,mBAAA;AAAA,IAC5B,qBAAqB,MAAA,CAAO;AAAA,GAC9B;AAEA,EAAA,OAAO;AAAA,IACL,YAAA,CAAa,IAAA,EAAM,EAAA,EAAI,OAAA,EAAS;AAC9B,MAAA,8BAAA;AAAA,QACE,OAAA;AAAA,QACA,cAAA;AAAA,QACA;AAAA,OACF;AACA,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,oBAAA,CAAqB,IAAA,EAAM,EAAA,EAAI,OAAA,EAAS;AACtC,MAAA,8BAAA;AAAA,QACE,OAAA;AAAA,QACA,sBAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,OAAO,2BAAA;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,8BAAA,CAA+B,OAAA,EAAS,aAAa,iBAAiB,CAAA;AACtE,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,8BAAA,CAA+B,OAAA,EAAS,YAAY,iBAAiB,CAAA;AACrE,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,8BAAA,CAA+B,OAAA,EAAS,aAAa,iBAAiB,CAAA;AACtE,MAAA,OAAO,gBAAA,CAAiB,GAAA,EAAK,aAAA,CAAc,IAAI,GAAG,OAAO,CAAA;AAAA,IAC3D,CAAA;AAAA,IACA,MAAA,CAAO,MAAM,OAAA,EAAS;AACpB,MAAA,8BAAA,CAA+B,OAAA,EAAS,UAAU,iBAAiB,CAAA;AACnE,MAAA,OAAO,cAAc,GAAA,EAAK,aAAA,CAAc,IAAI,CAAA,EAAG,OAAA,IAAW,EAAE,CAAA;AAAA,IAC9D,CAAA;AAAA,IACA,iBAAiB,OAAA,EAAS;AACxB,MAAA,8BAAA;AAAA,QACE,OAAA;AAAA,QACA,kBAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,OAAO,uBAAA,CAAwB,KAAK,OAAO,CAAA;AAAA,IAC7C,CAAA;AAAA,IACA,0BAA0B,OAAA,EAAS;AACjC,MAAA,8BAAA;AAAA,QACE,OAAA;AAAA,QACA,2BAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,OAAO,gCAAA,CAAiC,KAAK,OAAO,CAAA;AAAA,IACtD,CAAA;AAAA,IACA,SAAS,OAAA,EAAS;AAChB,MAAA,8BAAA,CAA+B,OAAA,EAAS,YAAY,iBAAiB,CAAA;AACrE,MAAA,OAAO,eAAA,CAAgB,KAAK,OAAO,CAAA;AAAA,IACrC,CAAA;AAAA,IACA,qBAAqB,OAAA,EAAS;AAC5B,MAAA,8BAAA;AAAA,QACE,OAAA;AAAA,QACA,sBAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,OAAO,2BAAA,CAA4B,KAAK,OAAO,CAAA;AAAA,IACjD;AAAA,GACF;AACF;;;AC7SA,SAAS,WAAkC,IAAA,EAAqB;AAC9D,EAAA,OAAO,IAAA;AACT;AAKA,SAAS,YAAmC,KAAA,EAAmC;AAC7E,EAAA,OAAO,KAAA;AACT;AAoGA,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,EAAAK,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;AAE9B,MAAA,MAAM,QAAA,GAAW,MAAM,gBAAA,CAAiB,OAAA,EAAS,SAAS,GAAG,CAAA;AAE7D,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,GAAA,CAAI,SAAS,IAAA,EAAM;AACvB,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,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,MAAM,MAAA,CAAO,+BAAA,GAAkCK,QAAAA,CAAQ,MAAM,CAAA;AAC7D,QAAA,OAAO,YAAeA,QAAO,CAAA;AAAA,MAC/B;AACA,MAAA,MAAM,OAAA,GAAU,MAAML,uBAAAA,CAAuB,WAAA,EAAa,OAAO,CAAA;AACjE,MAAA,MAAM,MAAA,CAAO,+BAAA,GAAkC,OAAA,CAAQ,MAAM,CAAA;AAC7D,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,KACuD;AACvD,QAAA,MAAM,MAAM,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,KAAK,EAAE,CAAA;AACvC,QAAA,MAAM,WAAA,GAAc,MAAM,gBAAA,CAAiB,MAAA,EAAQ,SAAS,GAAG,CAAA;AAK/D,QAAA,MAAMK,WAAqB,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,KAAA,CAAM,QAAQ,CAAA;AAG9D,QAAA,MAAM,WAAwD,EAAC;AAC/D,QAAA,MAAM,WAIA,EAAC;AAKP,QAAA,MAAM,OAAA,uBAAc,GAAA,EAGlB;AACF,QAAA,MAAM,WAAqD,EAAC;AAE5D,QAAA,IAAI,SAAA,GAAY,CAAA;AAChB,QAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,UAAA,MAAM,YAAA,GAAe,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AACxC,UAAA,MAAM,QAAA,GAAW,WAAA,CAAY,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AACxC,UAAA,MAAM,UAAA,GAAa,IAAA,CAAK,KAAA,IAAS,EAAC;AAElC,UAAA,IAAI,YAAA,KAAiB,MAAA,IAAa,QAAA,KAAa,MAAA,EAAW;AACxD,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,UAAA;AAAA,gBACA;AAAA;AACF,aACD,CAAA;AACD,YAAA,SAAA,EAAA;AACA,YAAA;AAAA,UACF;AAEA,UAAA,MAAM,YACJ,YAAA,KAAiB,MAAA,GACf,cAAA,CAAe,QAAQ,EAAE,UAAA,GACzB,MAAA;AAEJ,UAAA,IAAI,KAAA;AACJ,UAAA,IAAI,MAAA,CAAO,qBAAqB,MAAA,EAAW;AACzC,YAAA,MAAM,eACJ,YAAA,EAAc,KAAA,IACd,iBAAiB,cAAA,CAAe,QAAQ,EAAE,KAAK,CAAA;AACjD,YAAA,IAAI;AAGF,cAAA,KAAA,GAAQ,MAAA,CAAO,gBAAA;AAAA,gBACb,UAAU,IAAA,IAAQ,IAAA;AAAA,gBAClB,IAAA,CAAK,EAAA;AAAA,gBACL,YAAA;AAAA,gBACA;AAAA,eACF;AAAA,YACF,CAAA,CAAA,MAAQ;AACN,cAAA,KAAA,GAAQ,MAAA;AAAA,YACV;AAAA,UACF;AAEA,UAAA,MAAM,QAAA,GACJ,KAAA,EAAO,SAAA,KAAc,IAAA,IACrB,SAAA,KAAc,UACd,IAAA,CAAK,SAAA,KAAc,MAAA,IACnB,IAAA,CAAK,OAAA,KAAY,MAAA;AAEnB,UAAA,IAAI,QAAA,EAAU;AACZ,YAAA,IAAI,iBAAiB,MAAA,EAAW;AAC9B,cAAAA,QAAAA,CAAQ,SAAS,CAAA,GAAI,UAAA;AAAA,gBACnBR,UAAAA,CAAU,cAAA,CAAe,QAAQ,CAAC;AAAA,eACpC;AAAA,YACF,CAAA,MAAO;AACL,cAAA,QAAA,CAAS,IAAA,CAAK;AAAA,gBACZ,KAAA,EAAO,SAAA;AAAA,gBACP,aAAa,YAAA,CAAa;AAAA,eAC3B,CAAA;AAAA,YACH;AAAA,UACF,CAAA,MAAO;AACL,YAAA,QAAA,CAAS,IAAA,CAAK;AAAA,cACZ,KAAA,EAAO,SAAA;AAAA,cACP,KAAA,EAAO,oBAAA,CAAqB,IAAA,CAAK,EAAA,EAAI,YAAY,IAAI,CAAA;AAAA,cACrD,cAAc,SAAA,KAAc;AAAA,aAC7B,CAAA;AACD,YAAA,IAAI,UAAU,MAAA,EAAW;AACvB,cAAA,OAAA,CAAQ,GAAA,CAAI,KAAK,EAAA,EAAI;AAAA,gBACnB,OAAO,KAAA,CAAM,cAAA;AAAA,gBACb,WAAA,EAAa;AAAA,eACd,CAAA;AAAA,YACH;AAAA,UACF;AACA,UAAA,SAAA,EAAA;AAAA,QACF;AAEA,QAAA,IAAI,QAAA,CAAS,SAAS,CAAA,EAAG;AACvB,UAAA,MAAM,eAAe,QAAA,CAAS,GAAA,CAAI,CAACR,MAAAA,KAAUA,OAAM,KAAK,CAAA;AACxD,UAAA,MAAM,OAAA,GAAU,MAAMW,uBAAAA,CAAuB,YAAA,EAAc,MAAM,CAAA;AACjE,UAAA,KAAA,MAAW,CAAC,KAAA,EAAOX,MAAK,CAAA,IAAK,QAAA,CAAS,SAAQ,EAAG;AAC/C,YAAAgB,QAAAA,CAAQhB,MAAAA,CAAM,KAAK,CAAA,GAAI,UAAA;AAAA,cACrB,cAAA,CAAe,OAAA,CAAQ,KAAK,CAAC;AAAA,aAC/B;AAAA,UACF;AAAA,QACF;AAGA,QAAA,KAAA,MAAWA,UAAS,QAAA,EAAU;AAC5B,UAAA,MAAM,MAAA,GAAS,MAAMa,wBAAAA,CAAwBb,MAAAA,CAAM,OAAO,MAAA,EAAQ;AAAA,YAChE,cAAcA,MAAAA,CAAM;AAAA,WACrB,CAAA;AACD,UAAAgB,QAAAA,CAAQhB,MAAAA,CAAM,KAAK,CAAA,GAAI,WAAc,MAAM,CAAA;AAAA,QAC7C;AAIA,QAAA,KAAA,MAAW,EAAE,KAAA,EAAO,WAAA,EAAY,IAAK,QAAA,EAAU;AAC7C,UAAAgB,SAAQ,KAAK,CAAA,GAAI,cAAA,CAAeA,QAAAA,CAAQ,WAAW,CAAC,CAAA;AAAA,QACtD;AAEA,QAAA,OAAO,EAAE,OAAA,EAAAA,QAAAA,EAAS,WAAW,QAAA,CAAS,MAAA,GAAS,SAAS,MAAA,EAAO;AAAA,MACjE,CAAA;AAEA,MAAA,MAAM,EAAE,SAAS,SAAA,EAAU,GACzB,QAAQ,YAAA,CAAa,YAAA,IAAgB,iBAAiB,OAAA,GACpD,MAAM,QAAQ,WAAA,CAAY,OAAO,cAAc,SAAA,CAAU,SAAS,CAAC,CAAA,GACnE,MAAM,UAAU,OAAO,CAAA;AAK3B,MAAA,MAAM,MAAA,CAAO,kCAAkC,SAAS,CAAA;AACxD,MAAA,OAAO,OAAA;AAAA,IACT,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,MAAMN,+BAAAA,CAA+B,aAAa,SAAS,CAAA;AAAA,QAC7D,CAAC,CAAA;AACD,QAAA,MAAM,MAAA,CAAO,+BAAA,GAAkC,WAAA,CAAY,MAAM,CAAA;AACjE,QAAA;AAAA,MACF;AAEA,MAAA,MAAMA,+BAAAA,CAA+B,aAAa,OAAO,CAAA;AACzD,MAAA,MAAM,MAAA,CAAO,+BAAA,GAAkC,WAAA,CAAY,MAAM,CAAA;AAAA,IACnE,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;;;AC5vBO,SAAS,oBAAA,CACd,QAAA,EACA,OAAA,EACA,aAAA,EACS;AACT,EAAA,IACE,aAAA,KAAkB,MAAA,IAClB,QAAA,CAAS,UAAA,KAAe,MAAA,IACxB,SAAS,SAAA,KAAc,MAAA,IACvB,OAAA,EAAS,OAAA,KAAY,MAAA,EACrB;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,IAAI;AACF,IAAA,OAAO,eAAc,CAAE,SAAA;AAAA,EACzB,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,KAAA;AAAA,EACT;AACF;;;AChBA,SAAS,WAA+B,IAAA,EAAqB;AAC3D,EAAA,OAAO,IAAA;AACT;AAKA,SAAS,YAAgC,KAAA,EAAmC;AAC1E,EAAA,OAAO,KAAA;AACT;AAqFA,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,EAAAG,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,WAAA,EAAY,CACrB,IAAA,CAAK,IAAA,EAAM,IAAI,CAAA,CACf,QAAA,CAAS,IAAA,KAAS,MAAA,GAAY,YAAA,GAAe,MAAA,EAAQ,IAAI,CAAA,CACzD,SAAA,CAAU,IAAA,EAAM,MAAA,CAAO,KAAc,CAAA,CACrC,OAAO,CAAC,GAAA,KAAiC,GAAA,CAAI,IAAI,CAAC,CAAA;AACrD,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;AAKZ,QAAA,MAAM,gBACJ,MAAA,CAAO,gBAAA,KACN,MACC,cAAA,CAAe,OAAO,gBAAgB,CAAA;AAAA,UACpC,IAAA;AAAA,UACA,EAAA;AAAA,UACA,gBAAA,CAAiB,SAAS,KAAK,CAAA;AAAA,UAC/B;AAAA,SACF,CAAA;AACJ,QAAA,IAAI,oBAAA,CAAqB,QAAA,EAAU,OAAA,EAAS,aAAa,CAAA,EAAG;AAC1D,UAAA,OAAO,UAAA,CAAcA,UAAAA,CAAU,QAAQ,CAAC,CAAA;AAAA,QAC1C;AACA,QAAA,MAAMQ,UAAS,MAAMJ,kBAAAA;AAAA,UACnB,gBAAA,CAAiB,IAAA,EAAM,EAAA,EAAI,IAAA,EAAM,OAAO,CAAA;AAAA,UACxC,OAAA;AAAA,UACA,EAAE,YAAA,EAAc,QAAA,CAAS,UAAA,KAAe,MAAA;AAAU,SACpD;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,MAAMF,QAAAA,GAAU,MAAM,OAAA,CAAQ,WAAA;AAAA,UAAY,OAAO,SAAA,KAC/CI,uBAAAA,CAAuB,WAAA,EAAa,SAAS;AAAA,SAC/C;AACA,QAAA,MAAM,MAAA,CAAO,+BAAA,GAAkCJ,QAAAA,CAAQ,MAAM,CAAA;AAC7D,QAAA,OAAO,YAAeA,QAAO,CAAA;AAAA,MAC/B;AACA,MAAA,MAAM,OAAA,GAAU,MAAMI,uBAAAA,CAAuB,WAAA,EAAa,OAAO,CAAA;AACjE,MAAA,MAAM,MAAA,CAAO,+BAAA,GAAkC,OAAA,CAAQ,MAAM,CAAA;AAC7D,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,KACuD;AACvD,QAAA,MAAM,MAAM,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,KAAK,EAAE,CAAA;AAGvC,QAAA,MAAM,WAAA,uBAAkB,GAAA,EAAqB;AAE7C,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;AAKA,QAAA,MAAMJ,WAAqB,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,KAAA,CAAM,QAAQ,CAAA;AAG9D,QAAA,MAAM,WAAwD,EAAC;AAC/D,QAAA,MAAM,WAIA,EAAC;AAQP,QAAA,MAAM,OAAA,uBAAc,GAAA,EAGlB;AAGF,QAAA,MAAM,WAAqD,EAAC;AAE5D,QAAA,IAAI,SAAA,GAAY,CAAA;AAChB,QAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,UAAA,MAAM,YAAA,GAAe,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AACxC,UAAA,MAAM,QAAA,GAAW,WAAA,CAAY,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAExC,UAAA,IAAI,YAAA,KAAiB,MAAA,IAAa,QAAA,KAAa,MAAA,EAAW;AACxD,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;AACD,YAAA,SAAA,EAAA;AACA,YAAA;AAAA,UACF;AAIA,UAAA,MAAM,YACJ,YAAA,KAAiB,MAAA,GACf,cAAA,CAAe,QAAQ,EAAE,UAAA,GACzB,MAAA;AAEJ,UAAA,IAAI,KAAA;AACJ,UAAA,IAAI,MAAA,CAAO,qBAAqB,MAAA,EAAW;AACzC,YAAA,MAAM,eACJ,YAAA,EAAc,KAAA,IACd,iBAAiB,cAAA,CAAe,QAAQ,EAAE,KAAK,CAAA;AACjD,YAAA,IAAI;AACF,cAAA,KAAA,GAAQ,MAAA,CAAO,gBAAA;AAAA,gBACb,IAAA;AAAA,gBACA,IAAA,CAAK,EAAA;AAAA,gBACL,YAAA;AAAA,gBACA,IAAA,CAAK;AAAA,eACP;AAAA,YACF,CAAA,CAAA,MAAQ;AAGN,cAAA,KAAA,GAAQ,MAAA;AAAA,YACV;AAAA,UACF;AAEA,UAAA,MAAM,QAAA,GACJ,KAAA,EAAO,SAAA,KAAc,IAAA,IACrB,SAAA,KAAc,UACd,IAAA,CAAK,SAAA,KAAc,MAAA,IACnB,IAAA,CAAK,OAAA,KAAY,MAAA;AAEnB,UAAA,IAAI,QAAA,EAAU;AACZ,YAAA,IAAI,iBAAiB,MAAA,EAAW;AAC9B,cAAAA,QAAAA,CAAQ,SAAS,CAAA,GAAI,UAAA;AAAA,gBACnBC,UAAAA,CAAU,cAAA,CAAe,QAAQ,CAAC;AAAA,eACpC;AAAA,YACF,CAAA,MAAO;AACL,cAAA,QAAA,CAAS,IAAA,CAAK;AAAA,gBACZ,KAAA,EAAO,SAAA;AAAA,gBACP,aAAa,YAAA,CAAa;AAAA,eAC3B,CAAA;AAAA,YACH;AAAA,UACF,CAAA,MAAO;AACL,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,cAAc,SAAA,KAAc;AAAA,aAC7B,CAAA;AACD,YAAA,IAAI,UAAU,MAAA,EAAW;AACvB,cAAA,OAAA,CAAQ,GAAA,CAAI,KAAK,EAAA,EAAI;AAAA,gBACnB,OAAO,KAAA,CAAM,cAAA;AAAA,gBACb,WAAA,EAAa;AAAA,eACd,CAAA;AAAA,YACH;AAAA,UACF;AACA,UAAA,SAAA,EAAA;AAAA,QACF;AAEA,QAAA,IAAI,QAAA,CAAS,SAAS,CAAA,EAAG;AACvB,UAAA,MAAM,eAAe,QAAA,CAAS,GAAA,CAAI,CAACjB,MAAAA,KAAUA,OAAM,KAAK,CAAA;AACxD,UAAA,MAAM,OAAA,GAAU,MAAMoB,uBAAAA,CAAuB,YAAA,EAAc,MAAM,CAAA;AACjE,UAAA,KAAA,MAAW,CAAC,KAAA,EAAOpB,MAAK,CAAA,IAAK,QAAA,CAAS,SAAQ,EAAG;AAC/C,YAAAgB,QAAAA,CAAQhB,MAAAA,CAAM,KAAK,CAAA,GAAI,UAAA;AAAA,cACrB,cAAA,CAAe,OAAA,CAAQ,KAAK,CAAC;AAAA,aAC/B;AAAA,UACF;AAAA,QACF;AAGA,QAAA,KAAA,MAAWA,UAAS,QAAA,EAAU;AAC5B,UAAA,MAAM,MAAA,GAAS,MAAMsB,wBAAAA,CAAwBtB,MAAAA,CAAM,OAAO,MAAA,EAAQ;AAAA,YAChE,cAAcA,MAAAA,CAAM;AAAA,WACrB,CAAA;AACD,UAAAgB,QAAAA,CAAQhB,MAAAA,CAAM,KAAK,CAAA,GAAI,WAAc,MAAM,CAAA;AAAA,QAC7C;AAIA,QAAA,KAAA,MAAW,EAAE,KAAA,EAAO,WAAA,EAAY,IAAK,QAAA,EAAU;AAC7C,UAAAgB,SAAQ,KAAK,CAAA,GAAI,cAAA,CAAeA,QAAAA,CAAQ,WAAW,CAAC,CAAA;AAAA,QACtD;AAEA,QAAA,OAAO,EAAE,OAAA,EAAAA,QAAAA,EAAS,WAAW,QAAA,CAAS,MAAA,GAAS,SAAS,MAAA,EAAO;AAAA,MACjE,CAAA;AAEA,MAAA,MAAM,EAAE,SAAS,SAAA,EAAU,GACzB,QAAQ,YAAA,CAAa,YAAA,IAAgB,iBAAiB,OAAA,GACpD,MAAM,QAAQ,WAAA,CAAY,OAAO,cAAc,SAAA,CAAU,SAAS,CAAC,CAAA,GACnE,MAAM,UAAU,OAAO,CAAA;AAK3B,MAAA,MAAM,MAAA,CAAO,kCAAkC,SAAS,CAAA;AACxD,MAAA,OAAO,OAAA;AAAA,IACT,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,MAAMG,+BAAAA,CAA+B,aAAa,SAAS,CAAA;AAAA,QAC7D,CAAC,CAAA;AACD,QAAA,MAAM,MAAA,CAAO,+BAAA,GAAkC,WAAA,CAAY,MAAM,CAAA;AACjE,QAAA;AAAA,MACF;AAEA,MAAA,MAAMA,+BAAAA,CAA+B,aAAa,OAAO,CAAA;AACzD,MAAA,MAAM,MAAA,CAAO,+BAAA,GAAkC,WAAA,CAAY,MAAM,CAAA;AAAA,IACnE,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;AAM/C,MAAA,MAAM,SAAS,MAAM,8BAAA;AAAA,QACnB,IAAA;AAAA,QACA,cAAA;AAAA,QACA,KAAA;AAAA,QACA,OAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,OAAO,MAAA;AAAA,IACT,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;;;ACxgBO,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;;;AC9RA,IAAM,0BAAA,GAA6B;AAAA,EACjC,uCAAA;AAAA,EACA,6BAAA;AAAA,EACA,8BAAA;AAAA,EACA,iBAAA;AAAA,EACA,cAAA;AAAA,EACA,aAAA;AAAA,EACA,kBAAA;AAAA,EACA,2BAAA;AAAA,EACA,OAAA;AAAA,EACA,qBAAA;AAAA,EACA,YAAA;AAAA,EACA,kBAAA;AAAA,EACA,gBAAA;AAAA,EACA,kBAAA;AAAA,EACA,mBAAA;AAAA,EACA,YAAA;AAAA,EACA,kBAAA;AAAA,EACA,iBAAA;AAAA,EACA,gBAAA;AAAA,EACA,qBAAA;AAAA,EACA,YAAA;AAAA,EACA,cAAA;AAAA,EACA,8BAAA;AAAA,EACA,SAAA;AAAA,EACA,iBAAA;AAAA,EACA,mBAAA;AAAA,EACA,yCAAA;AAAA,EACA,qBAAA;AAAA,EACA,kCAAA;AAAA,EACA,yBAAA;AAAA,EACA,kCAAA;AAAA,EACA,4BAAA;AAAA,EACA,4BAAA;AAAA,EACA,8BAAA;AAAA,EACA,+BAAA;AAAA,EACA,SAAA;AAAA,EACA,2BAAA;AAAA,EACA,iBAAA;AAAA,EACA,sBAAA;AAAA,EACA,iBAAA;AAAA,EACA,gBAAA;AAAA,EACA,kBAAA;AAAA,EACA,iBAAA;AAAA,EACA,oBAAA;AAAA,EACA,gCAAA;AAAA,EACA,SAAA;AAAA,EACA,UAAA;AAAA,EACA,yBAAA;AAAA,EACA,0BAAA;AAAA,EACA,SAAA;AAAA,EACA,UAAA;AAAA,EACA,wBAAA;AAAA,EACA,yBAAA;AAAA,EACA,kBAAA;AAAA,EACA,gBAAA;AAAA,EACA,sBAAA;AAAA,EACA,gBAAA;AAAA,EACA,cAAA;AAAA,EACA,YAAA;AAAA,EACA,oBAAA;AAAA,EACA,kBAAA;AAAA,EACA,2BAAA;AAAA,EACA,YAAA;AAAA,EACA,oBAAA;AAAA,EACA,kBAAA;AAAA,EACA,2BAAA;AAAA,EACA,cAAA;AAAA,EACA,mBAAA;AAAA,EACA,mCAAA;AAAA,EACA,4BAAA;AAAA,EACA,mBAAA;AAAA,EACA,mBAAA;AAAA,EACA,kCAAA;AAAA,EACA,kBAAA;AAAA,EACA,yBAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,iBAAA;AAAA,EACA,sBAAA;AAAA,EACA,gBAAA;AAAA,EACA,qBAAA;AAAA,EACA,cAAA;AAAA,EACA;AACF,CAAA;AAuBO,SAAS,oCACd,OAAA,EACqB;AACrB,EAAA,OAAO,MAAA,CAAO,MAAA;AAAA,IACZ,qBAAA,CAAsB,SAAS,0BAA0B;AAAA,GAC3D;AACF;;;AChBO,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,CAACvB,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;AAaA,eAAsB,0BAAA,CAIpB,KAAA,EACA,OAAA,EACA,SAAA,EACA,MAAA,EAC4B;AAC5B,EAAA,IAAI,OAAA,CAAQ,gBAAgB,IAAA,EAAM;AAChC,IAAA,MAAMgB,WAAoB,EAAC;AAC3B,IAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,MAAA,MAAMhB,MAAAA,GAAQ,MAAM,MAAA,CAAO,IAAI,CAAA;AAC/B,MAAAgB,QAAAA,CAAQ,KAAKhB,MAAK,CAAA;AAClB,MAAA,IAAIA,MAAAA,CAAM,WAAW,QAAA,EAAU;AAAA,IACjC;AACA,IAAA,OAAOgB,QAAAA;AAAA,EACT;AAEA,EAAA,MAAM,OAAA,uBAAc,GAAA,EAA+B;AACnD,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,IAAI,CAAA,IAAK,KAAA,CAAM,SAAQ,EAAG;AAC3C,IAAA,MAAM,GAAA,GAAM,UAAU,IAAI,CAAA;AAC1B,IAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AAC9B,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,OAAA,CAAQ,GAAA,CAAI,GAAA,EAAK,CAAC,CAAC,KAAA,EAAO,IAAI,CAAC,CAAC,CAAA;AAAA,SACrD,MAAA,CAAO,IAAA,CAAK,CAAC,KAAA,EAAO,IAAI,CAAC,CAAA;AAAA,EAChC;AAEA,EAAA,MAAM,UAAoB,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,KAAA,CAAM,QAAQ,CAAA;AAC7D,EAAA,MAAM,OAAA,CAAQ,GAAA;AAAA,IACZ,CAAC,GAAG,OAAA,CAAQ,MAAA,EAAQ,CAAA,CAAE,GAAA,CAAI,OAAO,KAAA,KAAU;AACzC,MAAA,KAAA,MAAW,CAAC,KAAA,EAAO,IAAI,CAAA,IAAK,KAAA,EAAO;AACjC,QAAA,OAAA,CAAQ,KAAK,CAAA,GAAI,MAAM,MAAA,CAAO,IAAI,CAAA;AAAA,MACpC;AAAA,IACF,CAAC;AAAA,GACH;AACA,EAAA,OAAO,OAAA;AACT;AAUA,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,MAAMhB,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;;;AC5BA,IAAM,iBAAiB,EAAA,GAAK,GAAA;AAC5B,IAAM,oBAAA,GAAuB,GAAA;AAC7B,IAAM,wBAAwB,cAAA,GAAiB,GAAA;AAE/C,IAAM,sBAAA,GAAyB;AAAA,EAC7B,QAAA,EAAU;AAAA,IACR,gBAAA,EAAkB,IAAA;AAAA,IAClB,oBAAA,EAAsB,IAAA;AAAA,IACtB,iBAAA,EAAmB;AAAA,GACrB;AAAA,EACA,MAAA,EAAQ;AAAA,IACN,gBAAA,EAAkB,KAAA;AAAA,IAClB,oBAAA,EAAsB,KAAA;AAAA,IACtB,iBAAA,EAAmB;AAAA;AAEvB,CAAA;AAgBA,SAAS,2BAA2B,OAAA,EAAgC;AAClE,EAAA,OACE,OAAA,CAAQ,yBAAA,KAA8B,MAAA,IACtC,OAAA,CAAQ,gCAAA,KAAqC,MAAA;AAEjD;AAEA,SAAS,MAAM,EAAA,EAA2B;AACxC,EAAA,OAAO,IAAI,OAAA,CAAQ,CAAC,OAAA,KAAY;AAC9B,IAAA,UAAA,CAAW,SAAS,EAAE,CAAA;AAAA,EACxB,CAAC,CAAA;AACH;AA8DA,eAAsB,kBAAA,CACpB,OAAA,EACA,OAAA,GAAqC,EAAC,EACH;AACnC,EAAA,MAAM,EAAE,KAAA,EAAO,OAAA,EAAS,OAAA,EAAS,eAAc,GAAI,OAAA;AAEnD,EAAA,yCAAA;AAAA,IACE,OAAA;AAAA,IACA;AAAA,GACF;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,UAAA,EAAY,sBAAA,CAAuB,OAAO,CAAA,CAAE,gBAAA;AAAA,IAC5C,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;AAUA,EAAA,MAAM,uBAAA,GAA0B,UAAA,CAC7B,MAAA,CAAO,CAAC,WAAA,KAAgB,WAAA,CAAY,MAAA,KAAW,QAAQ,CAAA,CACvD,GAAA,CAAI,CAAC,WAAA,KAAgB,YAAY,IAAI,CAAA;AACxC,EAAA,MAAM,mBAAmB,MAAM,4BAAA;AAAA,IAC7B,OAAA;AAAA,IACA;AAAA,GACF;AAOA,EAAA,MAAM,mBAAA,GAAsB,uBAAA,CAAwB,OAAA,CAAQ,UAAU,CAAA;AAEtE,EAAA,MAAM,gBAAA,GAAmB,CACvB,WAAA,KACqC;AACrC,IAAA,IACE,YAAY,MAAA,KAAW,QAAA,IACvB,oBAAoB,GAAA,CAAI,WAAA,CAAY,IAAI,CAAA,EACxC;AACA,MAAA,OAAO,OAAA,CAAQ,OAAA;AAAA,QACb,KAAA;AAAA,UACE,WAAA;AAAA,UACA,QAAA;AAAA,UACA,IAAI,KAAA;AAAA,YACF,CAAA,YAAA,EAAe,YAAY,IAAI,CAAA,mMAAA;AAAA;AAIjC;AACF,OACF;AAAA,IACF;AACA,IAAA,OAAO,WAAA,CAAY,WAAW,QAAA,GAC1B,sBAAA;AAAA,MACE,WAAA;AAAA,MACA,OAAA;AAAA,MACA,OAAA;AAAA,MACA,aAAA;AAAA,MACA,mBAAA;AAAA,MACA;AAAA,KACF,GACA,0BAAA;AAAA,MACE,WAAA;AAAA,MACA,OAAA;AAAA,MACA,OAAA;AAAA,MACA,UAAA;AAAA,MACA,OAAA;AAAA,MACA,aAAA;AAAA,MACA,mBAAA;AAAA,MACA;AAAA,KACF;AAAA,EACN,CAAA;AAUA,EAAA,MAAM,UAAU,MAAM,0BAAA;AAAA,IACpB,UAAA;AAAA,IACA,OAAA;AAAA,IACA,CAAC,WAAA,KAAgB,iBAAA,CAAkB,WAAW,CAAA;AAAA,IAC9C,CAAC,WAAA,KAAgB,gBAAA,CAAiB,WAAW;AAAA,GAC/C;AACA,EAAA,MAAM,8BAAA;AAAA,IACJ,OAAA;AAAA,IACA,OAAA;AAAA,IACA,OAAA;AAAA,IACA,UAAA,CAAW;AAAA,GACb;AACA,EAAA,OAAO,EAAE,OAAA,EAAQ;AACnB;AAmBA,eAAe,8BAAA,CACb,OAAA,EACA,OAAA,EACA,OAAA,EACA,oBAAA,EACe;AACf,EAAA,IAAI,OAAA,CAAQ,sBAAsB,KAAA,EAAO;AAOzC,EAAA,IAAI,oBAAA,IAAwB,CAAC,0BAAA,CAA2B,OAAO,CAAA,EAAG;AAClE,EAAA,IAAI,CAAC,QAAQ,IAAA,CAAK,CAACA,WAAUA,MAAAA,CAAM,MAAA,KAAW,SAAS,CAAA,EAAG;AAC1D,EAAA,IAAI;AACF,IAAA,MAAM,QAAQ,iBAAA,EAAkB;AAAA,EAClC,SAAS,KAAA,EAAO;AACd,IAAA,IAAI,OAAO,OAAA,KAAY,WAAA,IAAe,OAAO,OAAA,CAAQ,SAAS,UAAA,EAAY;AACxE,MAAA;AAAA,IACF;AACA,IAAA,OAAA,CAAQ,IAAA;AAAA,MACN,qKAAA;AAAA,MAGA;AAAA,KACF;AAAA,EACF;AACF;AAEA,SAAS,kBAAkB,WAAA,EAA4C;AAQrE,EAAA,OAAO,WAAA,CAAY,MAAA;AACrB;AAEA,eAAe,0BAAA,CACb,aACA,OAAA,EACA,OAAA,EACA,YAMA,OAAA,EACA,aAAA,EACA,qBACA,gBAAA,EACkC;AAKlC,EAAA,IACE,YAAY,MAAA,KAAW,MAAA,IACvB,CAAC,sBAAA,CAAuB,OAAO,EAAE,iBAAA,EACjC;AACA,IAAA,OAAO;AAAA,MACL,WAAW,WAAA,CAAY,IAAA;AAAA,MACvB,QAAQ,WAAA,CAAY,MAAA;AAAA,MACpB,MAAM,WAAA,CAAY,IAAA;AAAA,MAClB,MAAA,EAAQ,SAAA;AAAA,MACR,MAAA,EACE,iBAAiB,WAAA,CAAY,MAAM,wCACjB,WAAA,CAAY,MAAA,KAAW,SAAA,GAAY,YAAA,GAAe,EAAE,CAAA,4DAAA;AAAA,KAE1E;AAAA,EACF;AAEA,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,KAAK,YAAY;AACf,MAAA,IAAI,WAAA,CAAY,WAAW,SAAA,EAAW;AAIpC,QAAA,MAAM,cAAA,CAAe,QAAQ,UAAU,CAAA;AAAA,UACrC;AAAA,SACF;AAAA,MACF;AACA,MAAA,MAAM,cAAA,CAAe,OAAA,CAAQ,UAAU,CAAA,CAAE,GAAG,CAAA;AAAA,IAC9C,CAAA;AAAA,IACA,mBAAA;AAAA,IACA,sBAAA,EAAwB;AAAA,GACzB,CAAA;AACH;AAEA,eAAe,uBACb,WAAA,EACA,OAAA,EACA,OAAA,EACA,aAAA,EACA,qBACA,gBAAA,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,sBAAA,CAAuB,OAAA,CAAQ,OAAO,CAAA,CAAE;AAAA,GACtD;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,KAAK,MAAM,cAAA,CAAe,OAAA,CAAQ,iBAAiB,EAAE,MAAM,CAAA;AAAA,IAC3D,mBAAA;AAAA,IACA,sBAAA,EAAwB;AAAA,GACzB,CAAA;AACH;AAsBA,eAAe,cAAA,CACb,WAAA,EACA,OAAA,EACA,OAAA,EACA,eACA,MAAA,EA4BkC;AAGlC,EAAA,MAAM,0BAAA,GAA6B,cAAA;AAAA,IACjC,OAAA,CAAQ;AAAA,GACV;AAEA,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;AAIvE,EAAA,MAAM,UAAU,MAAM,qBAAA;AAAA,IACpB,mBAAA,CAAoB,IAAI,SAAS,CAAA;AAAA,IACjC,WAAA;AAAA,IACA,OAAA;AAAA,IACA,OAAA;AAAA,IACA,aAAA;AAAA,IACA;AAAA,MACE,SAAA;AAAA,MACA,SAAA;AAAA,MACA,UAAA;AAAA,MACA,sBAAsB,CAAC,iBAAA,KACrB,MAAA,CAAO,sBAAA,CAAuB,IAAI,iBAAiB,CAAA;AAAA,MACrD,GAAI,OAAO,mBAAA,KAAwB,MAAA,GACjC,EAAC,GACD,EAAE,mBAAA,EAAqB,MAAA,CAAO,mBAAA;AAAoB;AACtD,GACF;AACA,EAAA,IAAI,OAAA,KAAY,QAAW,OAAO,OAAA;AAKlC,EAAA,IAAI,0BAAA,CAA2B,OAAO,CAAA,EAAG;AACvC,IAAA,OAAO,oBAAA,CAAqB,WAAA,EAAa,OAAA,EAAS,OAAA,EAAS,aAAA,EAAe;AAAA,MACxE,SAAA;AAAA,MACA,SAAA;AAAA,MACA,UAAA;AAAA,MACA,GAAA;AAAA,MACA,GAAI,OAAO,yBAAA,KAA8B,MAAA,GACvC,EAAC,GACD,EAAE,yBAAA,EAA2B,MAAA,CAAO,yBAAA,EAA0B;AAAA,MAChE,GAAI,OAAO,mBAAA,KAAwB,MAAA,GACjC,EAAC,GACD,EAAE,mBAAA,EAAqB,MAAA,CAAO,mBAAA;AAAoB,KACrD,CAAA;AAAA,EACH;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;AASA,eAAe,sBACb,QAAA,EACA,WAAA,EACA,OAAA,EACA,OAAA,EACA,eACA,MAAA,EAkB8C;AAC9C,EAAA,IAAI,QAAA,EAAU,cAAA,KAAmB,MAAA,EAAW,OAAO,MAAA;AACnD,EAAA,MAAM,EAAE,SAAA,EAAW,SAAA,EAAW,UAAA,EAAY,sBAAqB,GAAI,MAAA;AACnE,EAAA,IAAI,QAAA,CAAS,cAAc,SAAA,EAAW;AAQpC,IAAA,IACE,WAAA,CAAY,MAAA,KAAW,QAAA,KACtB,0BAAA,CAA2B,OAAO,CAAA,IACjC,MAAA,CAAO,mBAAA,KAAwB,IAAA,CAAA,IAChC,MAAM,oBAAA,CAAqB,WAAA,CAAY,IAAI,CAAA,EAC5C;AACA,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,OAAO,KAAA,CAAM,aAAa,qBAAqB,CAAA;AAAA,EACjD;AACA,EAAA,MAAM,QAAQ,IAAI,KAAA;AAAA,IAChB,CAAA,EAAG,UAAU,CAAA,EAAA,EAAK,WAAA,CAAY,IAAI,yEAAyE,QAAA,CAAS,OAAO,CAAA,aAAA,EAAgB,QAAA,CAAS,aAAa,CAAA,oEAAA;AAAA,GACnK;AACA,EAAA,MAAM,cAAA,CAAe,QAAQ,0BAA0B,CAAA;AAAA,IACrD,YAAA,CAAa;AAAA,MACX,WAAA;AAAA,MACA,OAAA;AAAA,MACA,SAAA;AAAA,MACA,aAAA;AAAA,MACA,cAAA,EAAgB,MAAA;AAAA,MAChB,KAAA;AAAA,MACA,GAAI,cAAc,WAAA,CAAY,IAAA,GAAO,EAAC,GAAI,EAAE,YAAY,SAAA;AAAU,KACnE;AAAA,GACH;AACA,EAAA,OAAO,KAAA,CAAM,WAAA,EAAa,QAAA,EAAU,KAAK,CAAA;AAC3C;AAgBA,eAAe,oBAAA,CACb,WAAA,EACA,OAAA,EACA,OAAA,EACA,eACA,MAAA,EAQkC;AAClC,EAAA,MAAM,EAAE,SAAA,EAAW,SAAA,EAAW,UAAA,EAAY,KAAI,GAAI,MAAA;AAClD,EAAA,MAAM,iBACJ,SAAA,KAAc,WAAA,CAAY,OAAO,MAAA,GAAY,EAAE,YAAY,SAAA,EAAU;AACvE,EAAA,MAAM,0BAAA,GAA6B,cAAA;AAAA,IACjC,OAAA,CAAQ;AAAA,GACV;AACA,EAAA,MAAM,KAAA,GAAQ,CAAA,EAAG,SAAS,CAAA,CAAA,EAAI,MAAA,EAAQ,CAAA,CAAA,EAAI,IAAA,CAAK,KAAA,CAAM,WAAA,CAAY,GAAA,EAAI,GAAI,GAAI,CAAC,CAAA,CAAA;AAC9E,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,GAAA,EAAI,GAAI,qBAAA;AAE9B,EAAA,WAAS;AACP,IAAA,MAAM,OAAA,GAAU,MAAM,cAAA,CAAe,OAAA,CAAQ,yBAAyB,CAAA,CAAE;AAAA,MACtE,SAAA,EAAW,SAAA;AAAA,MACX,OAAA;AAAA,MACA,QAAQ,WAAA,CAAY,MAAA;AAAA,MACpB,MAAM,WAAA,CAAY,IAAA;AAAA,MAClB,SAAA;AAAA,MACA,aAAA;AAAA,MACA,KAAA;AAAA,MACA,OAAA,EAAS;AAAA,KACV,CAAA;AAED,IAAA,IAAI,CAAC,OAAA,EAAS;AACZ,MAAA,IAAI,IAAA,CAAK,GAAA,EAAI,IAAK,QAAA,EAAU;AAC1B,QAAA,OAAO,KAAA;AAAA,UACL,WAAA;AAAA,UACA,QAAA;AAAA,UACA,IAAI,KAAA;AAAA,YACF,CAAA,4DAAA,EAA+D,SAAS,CAAA,UAAA,EAAa,MAAA,CAAO,qBAAqB,CAAC,CAAA,0DAAA;AAAA;AACpH,SACF;AAAA,MACF;AACA,MAAA,MAAM,MAAM,oBAAoB,CAAA;AAChC,MAAA;AAAA,IACF;AAEA,IAAA,IAAI;AAGF,MAAA,MAAM,KAAA,GAAQ,MAAM,cAAA,CAAe,OAAA,CAAQ,uBAAuB,CAAA;AAAA,QAChE;AAAA,OACF;AACA,MAAA,MAAM,UAAU,MAAM,qBAAA;AAAA,QACpB,KAAA;AAAA,QACA,WAAA;AAAA,QACA,OAAA;AAAA,QACA,OAAA;AAAA,QACA,aAAA;AAAA,QACA;AAAA,UACE,SAAA;AAAA,UACA,SAAA;AAAA,UACA,UAAA;AAAA;AAAA;AAAA,UAGA,sBACE,MAAA,CAAO,yBAAA,KACN,CAAC,iBAAA,KACA,uBAAA,CAAwB,SAAS,iBAAiB,CAAA,CAAA;AAAA,UACtD,GAAI,OAAO,mBAAA,KAAwB,KAAA,CAAA,GACjC,EAAC,GACD,EAAE,mBAAA,EAAqB,MAAA,CAAO,mBAAA;AAAoB;AACtD,OACF;AACA,MAAA,IAAI,OAAA,KAAY,QAAW,OAAO,OAAA;AAElC,MAAA,IAAI,WAAA,CAAY,WAAW,QAAA,EAAU;AACnC,QAAA,MAAM,wBAAA,CAAyB,OAAA,EAAS,WAAA,CAAY,IAAI,CAAA;AAAA,MAC1D;AAEA,MAAA,IAAI;AACF,QAAA,MAAM,GAAA,EAAI;AACV,QAAA,MAAM,cAAc,MAAA,EAAO;AAC3B,QAAA,MAAM,0BAAA;AAAA,UACJ,YAAA,CAAa;AAAA,YACX,WAAA;AAAA,YACA,OAAA;AAAA,YACA,SAAA;AAAA,YACA,aAAA;AAAA,YACA,cAAA,EAAgB,WAAA;AAAA,YAChB,KAAA,EAAO,KAAA,CAAA;AAAA,YACP,WAAA;AAAA,YACA,GAAG;AAAA,WACJ;AAAA,SACH;AACA,QAAA,OAAO,KAAA,CAAM,aAAa,SAAS,CAAA;AAAA,MACrC,SAAS,MAAA,EAAQ;AACf,QAAA,MAAM,KAAA,GACJ,kBAAkB,KAAA,GAAQ,MAAA,GAAS,IAAI,KAAA,CAAM,MAAA,CAAO,MAAM,CAAC,CAAA;AAC7D,QAAA,MAAM,0BAAA;AAAA,UACJ,YAAA,CAAa;AAAA,YACX,WAAA;AAAA,YACA,OAAA;AAAA,YACA,SAAA;AAAA,YACA,aAAA;AAAA,YACA,cAAA,EAAgB,KAAA,CAAA;AAAA,YAChB,KAAA;AAAA,YACA,GAAG;AAAA,WACJ;AAAA,SACH;AACA,QAAA,OAAO,KAAA,CAAM,WAAA,EAAa,QAAA,EAAU,KAAK,CAAA;AAAA,MAC3C;AAAA,IACF,CAAA,SAAE;AAMA,MAAA,IAAI;AACF,QAAA,MAAM,cAAA,CAAe,OAAA,CAAQ,gCAAgC,CAAA,CAAE;AAAA,UAC7D,SAAA,EAAW,SAAA;AAAA,UACX;AAAA,SACD,CAAA;AAAA,MACH,SAAS,YAAA,EAAc;AACrB,QAAA,OAAA,CAAQ,IAAA;AAAA,UACN,qEACM,SAAS,CAAA,8DAAA,CAAA;AAAA,UAEf;AAAA,SACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAOA,eAAe,uBAAA,CACb,SACA,iBAAA,EACkB;AAClB,EAAA,IAAI,CAAC,sBAAA,CAAuB,OAAA,CAAQ,OAAO,EAAE,oBAAA,EAAsB;AACjE,IAAA,OAAO,KAAA;AAAA,EACT;AAIA,EAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,OAAA;AAAA,IACzB,iBAAA,CAAkB,GAAA;AAAA;AAAA;AAAA;AAAA,wBAAA,EAII,iBAAiB;AAAA;AAAA,IAAA,CAEtC;AAAA,GACH;AACA,EAAA,OAAO,IAAA,CAAK,CAAC,CAAA,EAAG,OAAA,KAAY,IAAA;AAC9B;AAaA,eAAe,4BAAA,CACb,SACA,kBAAA,EAC8B;AAC9B,EAAA,IACE,CAAC,uBAAuB,OAAA,CAAQ,OAAO,EAAE,oBAAA,IACzC,kBAAA,CAAmB,WAAW,CAAA,EAC9B;AACA,IAAA,2BAAW,GAAA,EAAI;AAAA,EACjB;AACA,EAAA,MAAM,EAAE,OAAA,EAAQ,GAAI,MAAM,0BAAA;AAAA,IACxB,OAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,OAAO,OAAA;AACT;AAMA,eAAe,qBAAA,CACb,SACA,UAAA,EAC8B;AAC9B,EAAA,IAAI,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG,2BAAW,GAAA,EAAI;AAC5C,EAAA,QAAQ,QAAQ,OAAA;AAAS,IACvB,KAAK,UAAA,EAAY;AACf,MAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,OAAA;AAAA,QACzB,iBAAA,CAAkB,GAAA;AAAA;AAAA;AAAA,8BAAA,EAGM,YAAA,CAAa,UAAU,CAAC,CAAA;AAAA;AAAA;AAAA,QAAA,CAG/C;AAAA,OACH;AACA,MAAA,OAAO,IAAI,IAAI,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ,GAAA,CAAI,IAAI,CAAC,CAAA;AAAA,IAC5C;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,OAAA;AAAA,QACzB,iBAAA,CAAkB,GAAA;AAAA;AAAA;AAAA;AAAA,yBAAA,EAIC,YAAA,CAAa,UAAU,CAAC,CAAA;AAAA,QAAA,CAC1C;AAAA,OACH;AACA,MAAA,OAAO,IAAI,IAAI,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ,GAAA,CAAI,IAAI,CAAC,CAAA;AAAA,IAC5C;AAAA,IACA,SAAS;AACP,MAAA,OAAO,OAAA,CAAQ,OAAA;AAAA,IACjB;AAAA;AAEJ;AAkBA,eAAe,0BAAA,CACb,SACA,kBAAA,EAC8B;AAC9B,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,IAAI,mBAAmB,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,OAAO,OAAA,EAAQ;AAC7D,EAAA,QAAQ,QAAQ,OAAA;AAAS,IACvB,KAAK,UAAA,EAAY;AAEf,MAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,OAAA;AAAA,QACzB,iBAAA,CAAkB,GAAA;AAAA;AAAA;AAAA;AAAA,8BAAA,EAIM,YAAA,CAAa,kBAAkB,CAAC,CAAA;AAAA;AAAA,QAAA,CAEvD;AAAA,OACH;AACA,MAAA,KAAA,MAAW,GAAA,IAAO,MAAM,CAAC,GAAA,CAAI,QAAQ,KAAA,GAAQ,OAAA,EAAS,GAAA,CAAI,GAAA,CAAI,IAAI,CAAA;AAClE,MAAA,OAAO,EAAE,OAAO,OAAA,EAAQ;AAAA,IAC1B;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,OAAA;AAAA,QACzB,iBAAA,CAAkB,GAAA;AAAA;AAAA;AAAA;AAAA,yBAAA,EAIC,YAAA,CAAa,kBAAkB,CAAC,CAAA;AAAA,QAAA,CAClD;AAAA,OACH;AACA,MAAA,KAAA,MAAW,GAAA,IAAO,IAAA,EAAM,KAAA,CAAM,GAAA,CAAI,IAAI,IAAI,CAAA;AAC1C,MAAA,OAAO,EAAE,OAAO,OAAA,EAAQ;AAAA,IAC1B;AAAA,IACA,SAAS;AACP,MAAA,OAAO,OAAA,CAAQ,OAAA;AAAA,IACjB;AAAA;AAEJ;AAUA,eAAe,wBAAA,CACb,SACA,iBAAA,EACe;AACf,EAAA,IAAI,OAAA,CAAQ,eAAe,MAAA,EAAW;AACtC,EAAA,IAAI,CAAE,MAAM,uBAAA,CAAwB,OAAA,EAAS,iBAAiB,CAAA,EAAI;AAClE,EAAA,MAAM,SAAS,CAAA,CAAA,EAAI,iBAAA,CAAkB,UAAA,CAAW,GAAA,EAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAC1D,EAAA,MAAM,OAAA,CAAQ,UAAA,CAAW,CAAA,kCAAA,EAAqC,MAAM,CAAA,CAAA,CAAG,CAAA;AACzE;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,MAAM0B,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,MAAA,GAAS,cAAA,CAAe,OAAA,CAAQ,uBAAuB,CAAA;AAC7D,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,GAAA,KAAQ,QAAW,GAAA,CAAI,GAAA,CAAI,eAAe,UAAA,CAAW,KAAK,CAAC,CAAA,EAAG,GAAG,CAAA;AAAA,EACvE;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;AAqDO,SAAS,oCACd,OAAA,EACS;AACT,EAAA,OACE,QAAQ,UAAA,KAAe,MAAA,IACvB,QAAQ,uBAAA,KAA4B,MAAA,IACpC,QAAQ,0BAAA,KAA+B,MAAA;AAE3C;AAOA,SAAS,yCAAA,CACP,SACA,OAAA,EACM;AACN,EAAA,IAAI,mCAAA,CAAoC,OAAO,CAAA,EAAG;AAClD,EAAA,MAAM,IAAI,kBAAA;AAAA,IACR,GAAG,OAAO,CAAA,wPAAA,CAAA;AAAA,IAIV,EAAE,MAAM,iCAAA;AAAkC,GAC5C;AACF;AAEA,eAAsB,wBAAA,CACpB,OAAA,EAKA,OAAA,GAA2C,EAAC,EACT;AACnC,EAAA,MAAM,EAAE,OAAA,EAAS,OAAA,EAAS,aAAA,EAAc,GAAI,OAAA;AAE5C,EAAA,yCAAA;AAAA,IACE,OAAA;AAAA,IACA;AAAA,GACF;AAEA,EAAA,MAAM,wBAAA;AAAA,IACJ,OAAA;AAAA,IACA,OAAA,CAAQ;AAAA,GACV;AAEA,EAAA,MAAM,UAAA,GAAa,sBAAA,CAAuB,OAAA,CAAQ,OAAO,CAAA,CAAE,gBAAA;AAC3D,EAAA,MAAM,UAAA,GACJ,yBAAA,CAA0B,GAAA,CAAI,CAAC,WAAA,KAAgB;AAC7C,IAAA,MAAM,aAAA,GAAgB,2BAAA;AAAA,MACpB,WAAA,CAAY,KAAA;AAAA,MACZ,OAAA,CAAQ;AAAA,KACV;AACA,IAAA,OAAO;AAAA,MACL,WAAA;AAAA,MACA,aAAA;AAAA,MACA,IAAA,EAAM,eAAA,CAAgB,aAAA,EAAe,WAAA,CAAY,MAAM;AAAA,KACzD;AAAA,EACF,CAAC,CAAA;AAKH,EAAA,MAAM,aAAa,UAAA,CAAW,GAAA,CAAI,CAAC,SAAA,KAAc,UAAU,IAAI,CAAA;AAC/D,EAAA,MAAM,YAAA,GAAe;AAAA,IACnB,GAAG,IAAI,GAAA,CAAI,UAAA,CAAW,IAAI,CAAC,SAAA,KAAc,SAAA,CAAU,aAAa,CAAC;AAAA,GACnE;AACA,EAAA,MAAM,CAAC,mBAAA,EAAqB,cAAA,EAAgB,cAAc,CAAA,GACxD,MAAM,QAAQ,GAAA,CAAI;AAAA,IAChB,uBAAA,CAAwB,SAAS,UAAU,CAAA;AAAA,IAC3C,0BAAA,CAA2B,SAAS,UAAU,CAAA;AAAA,IAC9C,qBAAA,CAAsB,SAAS,YAAY;AAAA,GAC5C,CAAA;AACH,EAAA,MAAM,EAAE,KAAA,EAAO,iBAAA,EAAkB,GAAI,cAAA;AAIrC,EAAA,MAAM,yBAA8C,IAAI,GAAA;AAAA,IACtD,UAAA,CAAW,OAAO,CAAC,IAAA,KAAS,CAAC,iBAAA,CAAkB,GAAA,CAAI,IAAI,CAAC;AAAA,GAC1D;AAEA,EAAA,MAAM,gBAAA,GAAmB,OACvB,SAAA,KACqC;AACrC,IAAA,MAAM,QAAA,GAAwC;AAAA,MAC5C,MAAM,SAAA,CAAU,IAAA;AAAA,MAChB,MAAA,EAAQ,QAAA;AAAA,MACR,IAAA,EAAM,UAAU,WAAA,CAAY;AAAA,KAC9B;AAMA,IAAA,IAAI,CAAC,cAAA,CAAe,GAAA,CAAI,SAAA,CAAU,aAAa,CAAA,EAAG;AAChD,MAAA,OAAO;AAAA,QACL,WAAW,SAAA,CAAU,IAAA;AAAA,QACrB,MAAA,EAAQ,QAAA;AAAA,QACR,IAAA,EAAM,UAAU,WAAA,CAAY,KAAA;AAAA,QAC5B,MAAA,EAAQ,SAAA;AAAA,QACR,MAAA,EAAQ,CAAA,UAAA,EAAa,SAAA,CAAU,aAAa,CAAA,iCAAA;AAAA,OAC9C;AAAA,IACF;AAEA,IAAA,MAAM,QAAA,GAAW,mBAAA,CAAoB,GAAA,CAAI,SAAA,CAAU,IAAI,CAAA;AAMvD,IAAA,IAAI,QAAA,KAAa,MAAA,IAAa,QAAA,CAAS,MAAA,KAAW,QAAA,EAAU;AAC1D,MAAA,OAAO,KAAA;AAAA,QACL,QAAA;AAAA,QACA,QAAA;AAAA,QACA,IAAI,KAAA;AAAA,UACF,CAAA,mBAAA,EAAsB,UAAU,IAAI,CAAA,2BAAA,EAC/B,SAAS,MAAM,CAAA,2BAAA,EAA8B,SAAS,OAAO,CAAA,4GAAA;AAAA;AAGpE,OACF;AAAA,IACF;AAeA,IAAA,IAAI,aAAa,MAAA,IAAa,iBAAA,CAAkB,GAAA,CAAI,SAAA,CAAU,IAAI,CAAA,EAAG;AACnE,MAAA,OAAO,KAAA,CAAM,UAAU,qBAAqB,CAAA;AAAA,IAC9C;AACA,IAAA,MAAM,YAAY,MAAM,2BAAA;AAAA,MACtB,OAAA,CAAQ,OAAA;AAAA,MACR,SAAA,CAAU,aAAA;AAAA,MACV,SAAA,CAAU;AAAA,KACZ;AACA,IAAA,MAAM,GAAA,GAAM,sBAAA;AAAA,MACV,SAAA,CAAU,WAAA;AAAA,MACV,SAAA,CAAU,aAAA;AAAA,MACV,EAAE,UAAA;AAAW,KACf;AACA,IAAA,OAAO,cAAA,CAAe,QAAA,EAAU,OAAA,EAAS,OAAA,EAAS,aAAA,EAAe;AAAA,MAC/D,WAAW,SAAA,CAAU,IAAA;AAAA,MACrB,SAAA;AAAA,MACA,UAAA,EAAY,cAAA;AAAA,MACZ,KAAK,MAAM,cAAA,CAAe,OAAA,CAAQ,UAAU,EAAE,GAAG,CAAA;AAAA,MACjD,mBAAA;AAAA,MACA,sBAAA;AAAA,MACA,yBAAA,EAA2B,OAAO,iBAAA,KAAsB;AACtD,QAAA,MAAM,KAAA,GAAQ,MAAM,0BAAA,CAA2B,OAAA,EAAS;AAAA,UACtD;AAAA,SACD,CAAA;AACD,QAAA,OAAO,CAAC,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,iBAAiB,CAAA;AAAA,MAC3C,CAAA;AAAA,MACA,mBAAA,EAAqB;AAAA,KACtB,CAAA;AAAA,EACH,CAAA;AAIA,EAAA,MAAM,UAAU,MAAM,0BAAA;AAAA,IACpB,UAAA;AAAA,IACA,OAAA;AAAA,IACA,CAAC,cAAc,SAAA,CAAU,aAAA;AAAA,IACzB,CAAC,SAAA,KAAc,gBAAA,CAAiB,SAAS;AAAA,GAC3C;AACA,EAAA,MAAM,8BAAA,CAA+B,OAAA,EAAS,OAAA,EAAS,OAAA,EAAS,UAAU,CAAA;AAC1E,EAAA,OAAO,EAAE,OAAA,EAAQ;AACnB;AASA,eAAe,2BAAA,CACb,OAAA,EACA,eAAA,EACA,WAAA,EACiB;AACjB,EAAA,MAAM,OAAO,IAAA,CAAK,SAAA;AAAA,IAChB,EAAE,OAAA,EAAS,eAAA,EAAiB,WAAA,EAAY;AAAA,IACxC;AAAA,GACF;AACA,EAAA,OAAO,SAAA,CAAU,MAAM,EAAE,CAAA;AAC3B;AAkBA,eAAsB,qBAAA,CACpB,OAAA,EACA,eAAA,EACA,WAAA,EACiB;AACjB,EAAA,MAAM,QAAA,GAAW;AAAA,IACf,OAAA;AAAA,IACA,eAAA;AAAA,IACA,WAAA,EAAa,0BAA0B,WAAW;AAAA,GACpD;AACA,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,SAAA,CAAU,QAAA,EAAU,cAAc,CAAA;AACpD,EAAA,OAAO,SAAA,CAAU,MAAM,EAAE,CAAA;AAC3B;;;ACz5CA,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;AAoEA,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,uBAAA,GAA0B,QAAQ,uBAAA,KAA4B,IAAA;AACpE,EAAA,MAAM,GAAA,GAAM;AAAA,IACV,OAAA;AAAA,IACA,OAAA;AAAA,IACA,UAAA;AAAA,IACA,UAAA;AAAA,IACA,aAAA;AAAA,IACA,YAAA;AAAA,IACA,uBAAA;AAAA,IACA,gBACE,uBAAA,GACG,OAAA,CAAQ,kBAAkB,eAAA,CAAgB,OAAA,CAAQ,UAAU,CAAA,GAC7D;AAAA,GACN;AAOA,EAAA,OAAO;AAAA,IACL,SAAS,MAAM,kBAAA;AAAA,MAAmB,UAAA;AAAA,MAAY,OAAA;AAAA,MAAS,CAAC,OAAA,KACtDC,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,cAAA,CAAe,OAAA,CAAQ,sBAAsB,CAAA,CAAE,OAAO,CAAA,GACtD,OAAA,CAAQ,mBAAmB,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,CAAC3B,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,eAAe2B,eAAAA,CACb,KACA,GAAA,EACmC;AACnC,EAAA,MAAM,iBAAA,GAAoB,cAAA,CAAe,GAAA,CAAI,OAAA,CAAQ,iBAAiB,CAAA;AACtE,EAAA,IAAI;AACF,IAAA,MAAM,8BAAA,CAA+B,KAAK,GAAG,CAAA;AAC7C,IAAA,MAAM,OAAA,CAAQ,GAAA,CAAI,0BAAA,CAA2B,GAAA,EAAK,GAAG,CAAC,CAAA;AAEtD,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;AAcA,eAAe,8BAAA,CACb,KACA,GAAA,EACe;AACf,EAAA,MAAM,gBAAA,GAAmB,oCAAA,CAAqC,GAAA,EAAK,GAAG,CAAA;AACtE,EAAA,IAAI,CAAC,GAAA,CAAI,uBAAA,IAA2B,GAAA,CAAI,mBAAmB,MAAA,EAAW;AACpE,IAAA,MAAM,uBAAA,CAAwB,GAAA,CAAI,OAAA,EAAS,gBAAgB,CAAA;AAC3D,IAAA;AAAA,EACF;AAEA,EAAA,MAAM,iBAAiB,GAAA,CAAI,cAAA;AAC3B,EAAA,IAAI;AACF,IAAA,MAAM,GAAA,CAAI,OAAA,CAAQ,WAAA,CAAY,OAAO,MAAA,KAAW;AAC9C,MAAA,MAAM,4BAAA;AAAA,QACJ,MAAA;AAAA,QACA,cAAA;AAAA,QACA,GAAA,CAAI,OAAA;AAAA,QACJ,EAAE,MAAA,EAAQ,GAAA,CAAI,MAAA,EAAQ,IAAA,EAAM,IAAI,QAAA,EAAS;AAAA,QACzC;AAAA,OACF;AACA,MAAA,MAAM,uBAAA,CAAwB,QAAQ,gBAAgB,CAAA;AAAA,IACxD,CAAC,CAAA;AAAA,EACH,SAAS,KAAA,EAAO;AACd,IAAA,IAAI,CAAC,mBAAA,CAAoB,KAAK,CAAA,EAAG,MAAM,KAAA;AACvC,IAAA,MAAM,uBAAA,CAAwB,GAAA,CAAI,OAAA,EAAS,gBAAgB,CAAA;AAAA,EAC7D;AACF;AAEA,SAAS,oCAAA,CACP,KACA,GAAA,EACmB;AACnB,EAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,GAAA,CAAI,OAAO,CAAA;AACpC,EAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,GAAA,CAAI,QAAQ,CAAA;AACpC,EAAA,IAAI,GAAA,CAAI,WAAW,MAAA,EAAQ;AACzB,IAAA,OAAO;AAAA,MACL,CAAA,YAAA,EAAe,MAAM,GAAA,CAAI,UAAU,CAAC,CAAA,kBAAA,EAAqB,QAAQ,eAAe,OAAO,CAAA,CAAA;AAAA,MACvF,CAAA,YAAA,EAAe,KAAA,CAAM,GAAA,CAAI,UAAU,CAAC,qBAAqB,QAAQ,CAAA,kBAAA,EAAqB,OAAO,CAAA,cAAA,EAAiB,OAAO,CAAA,CAAA,CAAA;AAAA,MACrH,CAAA,YAAA,EAAe,MAAM,GAAA,CAAI,aAAa,CAAC,CAAA,kBAAA,EAAqB,QAAQ,oBAAoB,OAAO,CAAA,CAAA;AAAA,MAC/F,CAAA,YAAA,EAAe,MAAM,GAAA,CAAI,YAAY,CAAC,CAAA,kBAAA,EAAqB,QAAQ,oBAAoB,OAAO,CAAA;AAAA,KAChG;AAAA,EACF;AACA,EAAA,OAAO;AAAA,IACL,CAAA,YAAA,EAAe,MAAM,GAAA,CAAI,UAAU,CAAC,CAAA,kBAAA,EAAqB,QAAQ,eAAe,OAAO,CAAA;AAAA,GACzF;AACF;AAEA,eAAe,uBAAA,CACb,QACA,UAAA,EACe;AACf,EAAA,IAAI,MAAA,CAAO,qBAAqB,MAAA,EAAW;AACzC,IAAA,MAAM,OAAA,CAAQ,GAAA;AAAA,MACZ,UAAA,CAAW,GAAA;AAAA,QAAI,CAAC,SAAA,KACd,cAAA,CAAe,MAAA,CAAO,gBAAgB,CAAA;AAAA,UACpC,sBAAA,CAAuB,GAAA,CAAI,GAAA,CAAI,SAAS,CAAC;AAAA;AAC3C;AACF,KACF;AACA,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,MAAA,CAAO,eAAe,MAAA,EAAW;AACnC,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,qFAAA;AAAA,MACA,EAAE,MAAM,0CAAA;AAA2C,KACrD;AAAA,EACF;AACA,EAAA,MAAM,OAAA,CAAQ,GAAA;AAAA,IACZ,UAAA,CAAW,IAAI,CAAC,SAAA,KAAc,eAAe,MAAA,CAAO,UAAU,CAAA,CAAE,SAAS,CAAC;AAAA,GAC5E;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,cAAA,CAAe,GAAA,CAAI,OAAA,CAAQ,UAAU,CAAA;AACxD,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,IAAI,OAAA,EAAS,cAAA,EAAgB,YAAY,IAAI;AAAA;AACrE,KACF;AAAA,EACF,CAAA,GAAG;AACH,EAAA,OAAO,CAAC,OAAO,CAAA;AACjB;AAUA,eAAe,qBAAA,CACb,OAAA,EACA,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;AAMA,EAAA,MAAM,OAAA,CAAQ,+BAA+B,IAAI,CAAA;AACnD;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,EAAS,UAAU,OAAO,CAAA,CAAA;AACrD,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,CAAC7C,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;AAAA,QACJ,OAAA;AAAA,QACA,cAAA;AAAA,QACA,UAAA;AAAA,QACAA,MAAAA,CAAM;AAAA,OACR;AACA,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,CAACkB,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,SAAS,QAAQ,KAAA,EAAuB;AACtC,EAAA,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,UAAA,CAAW,GAAA,EAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AACxC;;;ACrpBA,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,EAaC;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;AAQA,EAAA,SAAS,eAAA,CACP,OAAA,EACA,IAAA,EACA,EAAA,EACA,GAAA,EACM;AACN,IAAA,MAAM,QAAA,GAAW,yBAAA,CAA0B,OAAA,EAAS,IAAA,EAAM,EAAE,CAAA;AAC5D,IAAA,IAAI,aAAA,CAAc,GAAA,CAAI,QAAQ,CAAA,EAAG;AACjC,IAAA,aAAA,CAAc,GAAA,CAAI,UAAU,GAAG,CAAA;AAAA,EACjC;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,MAAM,MAAA,GAAS,MAAM,OAAA,CAAQ,iBAAA,CAAkB,MAAM,CAAA;AACrD,IAAA,eAAA,CAAgB,GAAA,CAAI,UAAU,MAAM,CAAA;AACpC,IAAA,OAAO,MAAA;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;AAEA,EAAA,MAAM,iBAAA,GAAoB,qBAAqB,OAAA,EAAS;AAAA,IACtD,OAAA,EAAS,aAAA;AAAA,IACT,cAAA,EAAgB,oBAAA;AAAA,IAChB,iBAAA,EAAmB;AAAA,GACiC,CAAA;AAEtD,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,iBAAA;AAAA,IACT,iCAAA;AAAA,IACA;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,uBAAA,CAAwB,GAAA,EAAK,SAAA,EAAW,OAAA,EAAS,OAAO,MAAA,KAAW;AACxE,IAAA,MAAM,WAAW,MAAM,4BAAA,CAA6B,GAAA,EAAK,KAAA,EAAO,IAAI,MAAM,CAAA;AAE1E,IAAA,IAAI,GAAA;AACJ,IAAqB;AACnB,MAAA,GAAA,GAAM,MAAM,MAAA,CAAO,UAAA,CAAW,QAAA,CAAS,YAAY,CAAA;AAAA,IACrD;AAOA,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,eAAe,6BAAA,CACb,GAAA,EACA,MAAA,EACA,OAAA,EACA,eAAA,EAMe;AACf,EAAA,IAAI,OAAA,CAAQ,aAAa,MAAA,EAAW;AAEpC,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAyB;AAC/C,EAAA,MAAM,WAAA,GAAc,CAAC,IAAA,EAAc,EAAA,KAAqB;AACtD,IAAA,MAAM,MAAM,SAAA,CAAU,GAAA,CAAI,IAAI,CAAA,wBAAS,GAAA,EAAY;AACnD,IAAA,GAAA,CAAI,IAAI,EAAE,CAAA;AACV,IAAA,SAAA,CAAU,GAAA,CAAI,MAAM,GAAG,CAAA;AAAA,EACzB,CAAA;AACA,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,IAAA,WAAA,CAAY,KAAA,CAAM,QAAA,EAAU,KAAA,CAAM,MAAM,CAAA;AACxC,IAAA,WAAA,CAAY,KAAA,CAAM,MAAA,EAAQ,KAAA,CAAM,IAAI,CAAA;AAAA,EACtC;AAEA,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,GAAG,CAAA,IAAK,SAAA,EAAW;AACnC,IAAA,MAAM,UAAA,GAAa,CAAC,GAAG,GAAG,CAAA;AAC1B,IAAA,MAAM,OAAO,MAAM,OAAA,CAAQ,SAAS,GAAA,CAAI,OAAA,EAAS,MAAM,UAAU,CAAA;AACjE,IAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ,CAAC,GAAA,CAAI,EAAA,EAAI,GAAG,CAAC,CAAC,CAAA;AACzD,IAAA,KAAA,MAAW,MAAM,UAAA,EAAY;AAC3B,MAAA,eAAA,CAAgB,IAAI,OAAA,EAAS,IAAA,EAAM,IAAI,QAAA,CAAS,GAAA,CAAI,EAAE,CAAC,CAAA;AAAA,IACzD;AAAA,EACF;AACF;AAUA,eAAe,uBAAA,CACb,GAAA,EACA,MAAA,EACA,OAAA,EAIC;AACD,EAAA,MAAM;AAAA,IACJ,OAAA,EAAS,iBAAA;AAAA,IACT,iCAAA;AAAA,IACA;AAAA,GACF,GAAI,iCAAiC,OAAO,CAAA;AAE5C,EAAA,MAAM,6BAAA,CAA8B,GAAA,EAAK,MAAA,EAAQ,OAAA,EAAS,eAAe,CAAA;AAEzE,EAAA,MAAM,kBAAwC,EAAC;AAC/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,OAAO,EAAE,iBAAiB,iBAAA,EAAkB;AAC9C;AAQA,eAAsB,8BAAA,CACpB,GAAA,EACA,MAAA,EACA,OAAA,EACe;AACf,EAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AACvB,IAAA;AAAA,EACF;AAEA,EAAA,MAAM,qBAAA,CAAsB,GAAA,EAAK,OAAA,EAAS,OAAO,MAAA,KAAW;AAC1D,IAAA,MAAM,EAAE,iBAAA,EAAkB,GAAI,MAAM,uBAAA;AAAA,MAClC,GAAA;AAAA,MACA,MAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,MAAM,cAAA,CAAe,kBAAA,CAAmB,MAAM,CAAA,EAAG,iBAAiB,CAAA;AAAA,EACpE,CAAC,CAAA;AACH;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,OAAO,qBAAA,CAAsB,GAAA,EAAK,OAAA,EAAS,OAAO,MAAA,KAAW;AAC3D,IAAA,MAAM,EAAE,iBAAA,EAAkB,GAAI,MAAM,uBAAA;AAAA,MAClC,GAAA;AAAA,MACA,MAAA;AAAA,MACA;AAAA,KACF;AAEA,IAAA,MAAM,OAAO,MAAM,uBAAA;AAAA,MACjB,mBAAmB,MAAM,CAAA;AAAA,MACzB;AAAA,KACF;AAEA,IAAA,OAAO,KAAK,GAAA,CAAI,CAAC,GAAA,KAAQ,SAAA,CAAU,GAAG,CAAC,CAAA;AAAA,EACzC,CAAC,CAAA;AACH;AAUA,SAAS,iBAAA,CACP,GAAA,EACA,IAAA,EACA,EAAA,EACA,eACA,UAAA,EACyB;AACzB,EAAA,MAAM,YAAA,GAAe,mBAAA,CAAoB,GAAA,CAAI,KAAA,EAAO,IAAI,CAAA;AACxD,EAAA,OAAO,iBAAA;AAAA,IACL,aAAa,IAAA,CAAK,MAAA;AAAA,IAClB,EAAE,GAAG,aAAA,EAAe,GAAG,UAAA,EAAW;AAAA,IAClC,EAAE,IAAA,EAAM,SAAA,EAAW,QAAA,EAAU,EAAA;AAAG,GAClC;AACF;AAKA,SAAS,sBAAA,CACP,GAAA,EACA,QAAA,EACA,UAAA,EAIC;AACD,EAAA,MAAM,aAAA,GAAgB,gBAAA,CAAiB,QAAA,CAAS,KAAK,CAAA;AACrD,EAAA,MAAM,cAAA,GAAiB,iBAAA;AAAA,IACrB,GAAA;AAAA,IACA,QAAA,CAAS,IAAA;AAAA,IACT,QAAA,CAAS,EAAA;AAAA,IACT,aAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,OAAO,EAAE,eAAe,cAAA,EAAe;AACzC;AAOO,SAAS,oBAAA,CACd,GAAA,EACA,IAAA,EACA,EAAA,EACA,eACA,UAAA,EACkB;AAClB,EAAA,MAAM,cAAA,GAAiB,iBAAA;AAAA,IACrB,GAAA;AAAA,IACA,IAAA;AAAA,IACA,EAAA;AAAA,IACA,aAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,OAAO;AAAA,IACL,cAAA;AAAA,IACA,SAAA,EAAW,cAAA,CAAe,cAAA,EAAgB,aAAa;AAAA,GACzD;AACF;AAOA,eAAe,iBAAA,CACb,GAAA,EACA,KAAA,EAKA,MAAA,EACA,OAAA,EACe;AACf,EAAA,MAAM,KAAK,KAAA,CAAM,EAAA;AAEjB,EAAA,MAAM,WAAW,MAAM,MAAA,CAAO,OAAA,CAAQ,GAAA,CAAI,SAAS,EAAE,CAAA;AACrD,EAAA,IAAI,CAAC,QAAA,IAAa,CAAC,OAAA,EAAS,YAAA,IAAgB,SAAS,UAAA,EAAa;AAChE,IAAA,MAAM,IAAI,iBAAA,CAAkB,SAAA,EAAW,EAAE,CAAA;AAAA,EAC3C;AAEA,EAAA,MAAM,EAAE,cAAA,EAAe,GAAI,uBAAuB,GAAA,EAAK,QAAA,EAAU,MAAM,KAAK,CAAA;AAE5E,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,MAAA,CAAO,UAAA,CAAW,YAAY,CAAA;AAEhD,EAAA,OAAO,UAAU,GAAG,CAAA;AACtB;AAKA,eAAsB,iBAAA,CACpB,GAAA,EACA,KAAA,EAKA,OAAA,EACe;AACf,EAAA,MAAM,KAAK,KAAA,CAAM,EAAA;AASjB,EAAA,MAAM,OAAO,MAAM,OAAA,CAAQ,OAAA,CAAQ,GAAA,CAAI,SAAS,EAAE,CAAA;AAClD,EAAA,IAAI,CAAC,IAAA,IAAQ,IAAA,CAAK,UAAA,EAAY;AAC5B,IAAA,MAAM,IAAI,iBAAA,CAAkB,SAAA,EAAW,EAAE,CAAA;AAAA,EAC3C;AAEA,EAAA,MAAM,YAAY,GAAA,CAAI,sBAAA,CAAuB,UAAU,MAAA,EAAQ,IAAA,CAAK,MAAM,EAAE,CAAA;AAE5E,EAAA,OAAO,uBAAA;AAAA,IAAwB,GAAA;AAAA,IAAK,SAAA;AAAA,IAAW,OAAA;AAAA,IAAS,CAAC,MAAA,KACvD,iBAAA,CAAkB,GAAA,EAAK,OAAO,MAAM;AAAA,GACtC;AACF;AAMA,eAAsB,uBAAA,CACpB,GAAA,EACA,KAAA,EAKA,OAAA,EACA,OAAA,EACe;AACf,EAAA,OAAO,qBAAA;AAAA,IAAsB,GAAA;AAAA,IAAK,OAAA;AAAA,IAAS,CAAC,MAAA,KAC1C,iBAAA,CAAkB,GAAA,EAAK,KAAA,EAAO,QAAQ,OAAO;AAAA,GAC/C;AACF;AAKA,eAAsB,iBAAA,CACpB,GAAA,EACA,EAAA,EACA,OAAA,EACe;AAKf,EAAA,MAAM,OAAO,MAAM,OAAA,CAAQ,OAAA,CAAQ,GAAA,CAAI,SAAS,EAAE,CAAA;AAClD,EAAA,IAAI,CAAC,IAAA,IAAQ,IAAA,CAAK,UAAA,EAAY;AAE9B,EAAA,MAAM,YAAY,GAAA,CAAI,sBAAA,CAAuB,UAAU,MAAA,EAAQ,IAAA,CAAK,MAAM,EAAE,CAAA;AAE5E,EAAA,OAAO,uBAAA,CAAwB,GAAA,EAAK,SAAA,EAAW,OAAA,EAAS,OAAO,MAAA,KAAW;AAKxE,IAAA,MAAM,OAAO,UAAA,CAAW;AAAA,MACtB,SAAS,GAAA,CAAI,OAAA;AAAA,MACb;AAAA,KACD,CAAA;AAAA,EACH,CAAC,CAAA;AACH;AAOA,eAAsB,qBAAA,CACpB,GAAA,EACA,EAAA,EACA,OAAA,EACe;AAGf,EAAA,MAAM,OAAO,MAAM,OAAA,CAAQ,OAAA,CAAQ,GAAA,CAAI,SAAS,EAAE,CAAA;AAClD,EAAA,IAAI,CAAC,IAAA,EAAM;AAEX,EAAA,MAAM,YAAY,GAAA,CAAI,sBAAA,CAAuB,UAAU,MAAA,EAAQ,IAAA,CAAK,MAAM,EAAE,CAAA;AAE5E,EAAA,OAAO,uBAAA,CAAwB,GAAA,EAAK,SAAA,EAAW,OAAA,EAAS,OAAO,MAAA,KAAW;AAIxE,IAAA,MAAM,OAAO,cAAA,CAAe;AAAA,MAC1B,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,CAAClB,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,gBAAA,CAAiB,GAAA,CAAI,KAAK,CAAA;AAC3C,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,OAAA,CAAQ,WAAW,CAAA,EAAG,OAAO,UAAU,cAAA,CAAe,aAAA,CAAc,CAAC,CAAC,CAAC,CAAA;AAE3E,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;AAOpD,EAAA,IAAI,aAAa,QAAA,EAAU;AACzB,IAAA,MAAM,SAAA,GAAY,MAAM,OAAA,CAAQ,eAAA,CAAgB;AAAA,MAC9C,SAAS,GAAA,CAAI,OAAA;AAAA,MACb,IAAA;AAAA,MACA,QAAA;AAAA,MACA,MAAA;AAAA,MACA,MAAA;AAAA,MACA,IAAA;AAAA,MACA,cAAA,EAAgB,KAAA;AAAA,MAChB,YAAA,EAAc;AAAA,KACf,CAAA;AACD,IAAA,MAAM,EAAE,OAAA,EAAS,aAAA,EAAc,GAAI,gBAAA;AAAA,MACjC,SAAA;AAAA,MACA,OAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,IAAI,kBAAkB,MAAA,EAAW;AAC/B,MAAA,OAAO,EAAE,IAAA,EAAM,SAAA,CAAU,aAAa,CAAA,EAAG,QAAQ,OAAA,EAAQ;AAAA,IAC3D;AAAA,EACF;AAQA,EAAA,eAAe,OAAA,GAEb;AAEA,IAAA,MAAM,aAAA,GAAgB,MAAM,OAAA,CAAQ,eAAA,CAAgB;AAAA,MAClD,SAAS,GAAA,CAAI,OAAA;AAAA,MACb,IAAA;AAAA,MACA,QAAA;AAAA,MACA,MAAA;AAAA,MACA,MAAA;AAAA,MACA,IAAA;AAAA,MACA,cAAA,EAAgB,KAAA;AAAA,MAChB,YAAA,EAAc;AAAA,KACf,CAAA;AAED,IAAA,MAAM,EAAE,OAAA,EAAS,UAAA,EAAW,GAAI,gBAAA;AAAA,MAC9B,aAAA;AAAA,MACA,OAAA;AAAA,MACA;AAAA,KACF;AAGA,IAAA,IAAI,OAAA,KAAY,MAAA,IAAa,UAAA,KAAe,MAAA,EAAW;AACrD,MAAA,MAAM,KAAA,GAAyB;AAAA,QAC7B,IAAA;AAAA,QACA,QAAA;AAAA,QACA,MAAA;AAAA,QACA,MAAA;AAAA,QACA,IAAA;AAAA,QACA,KAAA,EAAO;AAAA,OACT;AACA,MAAA,MAAM8C,KAAAA,GAAO,MAAM,iBAAA,CAAkB,GAAA,EAAK,OAAO,OAAO,CAAA;AACxD,MAAA,OAAO,EAAE,IAAA,EAAAA,KAAAA,EAAM,MAAA,EAAQ,SAAA,EAAU;AAAA,IACnC;AAGA,IAAA,IAAI,YAAY,MAAA,EAAW;AACzB,MAAA,IAAI,aAAa,QAAA,EAAU;AACzB,QAAA,OAAO,EAAE,IAAA,EAAM,SAAA,CAAU,OAAO,CAAA,EAAG,QAAQ,OAAA,EAAQ;AAAA,MACrD;AAEA,MAAA,MAAMA,QAAO,MAAM,uBAAA;AAAA,QACjB,GAAA;AAAA,QACA,EAAE,EAAA,EAAI,OAAA,CAAQ,EAAA,EAAI,OAAO,cAAA,EAAe;AAAA,QACxC;AAAA,OACF;AACA,MAAA,OAAO,EAAE,IAAA,EAAAA,KAAAA,EAAM,MAAA,EAAQ,SAAA,EAAU;AAAA,IACnC;AAGA,IAAA,MAAM,WAAA,GAAc,aAAa,WAAA,IAAe,MAAA;AAChD,IAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,MAAA,MAAM,IAAI,MAAM,mCAAmC,CAAA;AAAA,IACrD;AACA,IAAA,MAAM,iBAAA,GAAoB,UAAA;AAC1B,IAAA,MAAM,mBAAmB,iBAAA,CAAkB,QAAA;AAC3C,IAAA,MAAM,iBAAA,GAAuC;AAAA,MAC3C,SAAS,GAAA,CAAI,OAAA;AAAA,MACb,UAAU,GAAA,CAAI,QAAA;AAAA,MACd;AAAA,KACF;AACA,IAAA,MAAM,0BAAA;AAAA,MACJ,iBAAA;AAAA,MACA,IAAA;AAAA,MACA,WAAA;AAAA,MACA,QAAA;AAAA,MACA,MAAA;AAAA,MACA,MAAA;AAAA,MACA,IAAA;AAAA,MACA;AAAA,KACF;AAEA,IAAA,MAAM,OAAO,MAAM,uBAAA;AAAA,MACjB,GAAA;AAAA,MACA,EAAE,EAAA,EAAI,iBAAA,CAAkB,EAAA,EAAI,OAAO,cAAA,EAAe;AAAA,MAClD,OAAA;AAAA,MACA,EAAE,cAAc,IAAA;AAAK,KACvB;AACA,IAAA,OAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,aAAA,EAAc;AAAA,EACvC;AAEA,EAAA,IAAI;AACF,IAAA,OAAO,MAAM,OAAA,EAAQ;AAAA,EACvB,SAAS,KAAA,EAAO;AACd,IAAA,IAAI,EAAE,KAAA,YAAiB,gBAAA,CAAA,EAAmB,MAAM,KAAA;AAChD,IAAA,OAAO,OAAA,EAAQ;AAAA,EACjB;AACF;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,MAAW5B,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;AAKA,EAAA,eAAe,oBACb,MAAA,EACyD;AACzD,IAAA,MAAM,cAAA,uBAAqB,GAAA,EAAuC;AAClE,IAAA,KAAA,MAAW,CAAC,WAAA,EAAa,QAAQ,CAAA,IAAK,eAAA,EAAiB;AACrD,MAAA,MAAM,IAAA,GAAO,MAAM,MAAA,CAAO,eAAA,CAAgB;AAAA,QACxC,SAAS,GAAA,CAAI,OAAA;AAAA,QACb,IAAA;AAAA,QACA,UAAU,QAAA,CAAS,QAAA;AAAA,QACnB,QAAQ,QAAA,CAAS,MAAA;AAAA,QACjB,QAAQ,QAAA,CAAS,MAAA;AAAA,QACjB,MAAM,QAAA,CAAS,IAAA;AAAA,QACf,cAAA,EAAgB,KAAA;AAAA,QAChB,YAAA,EAAc;AAAA,OACf,CAAA;AACD,MAAA,cAAA,CAAe,GAAA,CAAI,aAAa,IAAI,CAAA;AAAA,IACtC;AACA,IAAA,OAAO,cAAA;AAAA,EACT;AA0BA,EAAA,SAAS,iBACP,cAAA,EAKC;AACD,IAAA,MAAM,WAA0B,EAAC;AACjC,IAAA,MAAM,UAAwB,EAAC;AAC/B,IAAA,MAAM,cAAgC,EAAC;AACvC,IAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AAEzC,IAAA,KAAA,MAAW,CAAC,KAAA,EAAOA,MAAK,CAAA,IAAK,SAAA,CAAU,SAAQ,EAAG;AAEhD,MAAA,MAAM,aAAA,GAAgB,QAAA,CAAS,GAAA,CAAIA,MAAAA,CAAM,YAAY,CAAA;AACrD,MAAA,IAAI,kBAAkB,MAAA,EAAW;AAC/B,QAAA,WAAA,CAAY,IAAA,CAAK,EAAE,KAAA,EAAO,WAAA,EAAa,eAAe,CAAA;AACtD,QAAA;AAAA,MACF;AACA,MAAA,QAAA,CAAS,GAAA,CAAIA,MAAAA,CAAM,YAAA,EAAc,KAAK,CAAA;AAEtC,MAAA,MAAM,gBAAgB,cAAA,CAAe,GAAA,CAAIA,MAAAA,CAAM,WAAW,KAAK,EAAC;AAChE,MAAA,MAAM,EAAE,OAAA,EAAS,UAAA,EAAW,GAAI,gBAAA;AAAA,QAC9B,aAAA;AAAA,QACA,OAAA;AAAA,QACAA,MAAAA,CAAM;AAAA,OACR;AAEA,MAAA,IAAI,OAAA,KAAY,MAAA,IAAa,UAAA,KAAe,MAAA,EAAW;AACrD,QAAA,QAAA,CAAS,IAAA,CAAK;AAAA,UACZ,KAAA;AAAA,UACA,KAAA,EAAO;AAAA,YACL,IAAA;AAAA,YACA,UAAUA,MAAAA,CAAM,QAAA;AAAA,YAChB,QAAQA,MAAAA,CAAM,MAAA;AAAA,YACd,QAAQA,MAAAA,CAAM,MAAA;AAAA,YACd,MAAMA,MAAAA,CAAM,IAAA;AAAA,YACZ,OAAOA,MAAAA,CAAM;AAAA;AACf,SACD,CAAA;AAAA,MACH,CAAA,MAAO;AAEL,QAAA,MAAM,UAAU,OAAA,IAAW,UAAA;AAC3B,QAAA,IAAI,YAAY,MAAA,EAAW;AACzB,UAAA,MAAM,IAAI,MAAM,gDAAgD,CAAA;AAAA,QAClE;AACA,QAAA,OAAA,CAAQ,IAAA,CAAK;AAAA,UACX,KAAA;AAAA,UACA,GAAA,EAAK,OAAA;AAAA,UACL,WAAW,OAAA,KAAY,MAAA;AAAA,UACvB,gBAAgBA,MAAAA,CAAM,cAAA;AAAA,UACtB,UAAUA,MAAAA,CAAM,QAAA;AAAA,UAChB,QAAQA,MAAAA,CAAM,MAAA;AAAA,UACd,QAAQA,MAAAA,CAAM,MAAA;AAAA,UACd,MAAMA,MAAAA,CAAM;AAAA,SACb,CAAA;AAAA,MACH;AAAA,IACF;AAEA,IAAA,OAAO,EAAE,QAAA,EAAU,OAAA,EAAS,WAAA,EAAY;AAAA,EAC1C;AAQA,EAAA,IAAI,aAAa,QAAA,EAAU;AACzB,IAAA,MAAM,KAAA,GAAQ,gBAAA,CAAiB,MAAM,mBAAA,CAAoB,OAAO,CAAC,CAAA;AACjE,IAAA,MAAM,YAAA,GACJ,KAAA,CAAM,QAAA,CAAS,MAAA,KAAW,CAAA,IAC1B,KAAA,CAAM,OAAA,CAAQ,KAAA,CAAM,CAACA,MAAAA,KAAU,CAACA,MAAAA,CAAM,SAAS,CAAA;AACjD,IAAA,IAAI,YAAA,EAAc;AAChB,MAAA,MAAM,QAAkB,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,KAAA,CAAM,QAAQ,CAAA;AAC3D,MAAA,KAAA,MAAWA,MAAAA,IAAS,MAAM,OAAA,EAAS;AACjC,QAAA,KAAA,CAAMA,MAAAA,CAAM,KAAK,CAAA,GAAI,EAAE,IAAA,EAAM,UAAUA,MAAAA,CAAM,GAAG,CAAA,EAAG,MAAA,EAAQ,OAAA,EAAQ;AAAA,MACrE;AACA,MAAA,KAAA,MAAW,EAAE,KAAA,EAAO,WAAA,EAAY,IAAK,MAAM,WAAA,EAAa;AACtD,QAAA,KAAA,CAAM,KAAK,CAAA,GAAI;AAAA,UACb,IAAA,EAAM,cAAA,CAAe,KAAA,CAAM,WAAW,CAAC,CAAA,CAAE,IAAA;AAAA,UACzC,MAAA,EAAQ;AAAA,SACV;AAAA,MACF;AACA,MAAA,OAAO,KAAA;AAAA,IACT;AAAA,EACF;AAEA,EAAA,OAAO,qBAAA,CAAsB,GAAA,EAAK,OAAA,EAAS,OAAO,MAAA,KAAW;AAC3D,IAAA,MAAM,EAAE,QAAA,EAAU,OAAA,EAAS,WAAA,EAAY,GAAI,gBAAA;AAAA,MACzC,MAAM,oBAAoB,MAAM;AAAA,KAClC;AACA,IAAA,MAAM,UAAoB,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,KAAA,CAAM,QAAQ,CAAA;AAG7D,IAAA,IAAI,QAAA,CAAS,SAAS,CAAA,EAAG;AACvB,MAAA,MAAM,eAAe,QAAA,CAAS,GAAA,CAAI,CAACA,MAAAA,KAAUA,OAAM,KAAK,CAAA;AACxD,MAAA,MAAM,eAAe,MAAM,sBAAA;AAAA,QACzB,GAAA;AAAA,QACA,YAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,KAAA,MAAW,CAAC,UAAA,EAAYA,MAAK,CAAA,IAAK,QAAA,CAAS,SAAQ,EAAG;AACpD,QAAA,OAAA,CAAQA,MAAAA,CAAM,KAAK,CAAA,GAAI;AAAA,UACrB,IAAA,EAAM,cAAA,CAAe,YAAA,CAAa,UAAU,CAAC,CAAA;AAAA,UAC7C,MAAA,EAAQ;AAAA,SACV;AAAA,MACF;AAAA,IACF;AAGA,IAAA,KAAA,MAAWA,UAAS,OAAA,EAAS;AAC3B,MAAA,IAAIA,OAAM,SAAA,EAAW;AAEnB,QAAA,MAAM,gBAAA,GAAmBA,OAAM,GAAA,CAAI,QAAA;AACnC,QAAA,MAAM,iBAAA,GAAuC;AAAA,UAC3C,SAAS,GAAA,CAAI,OAAA;AAAA,UACb,UAAU,GAAA,CAAI,QAAA;AAAA,UACd,OAAA,EAAS;AAAA,SACX;AACA,QAAA,MAAM,0BAAA;AAAA,UACJ,iBAAA;AAAA,UACA,IAAA;AAAA,UACA,WAAA;AAAA,UACAA,MAAAA,CAAM,QAAA;AAAA,UACNA,MAAAA,CAAM,MAAA;AAAA,UACNA,MAAAA,CAAM,MAAA;AAAA,UACNA,MAAAA,CAAM,IAAA;AAAA,UACN;AAAA,SACF;AAEA,QAAA,MAAM,OAAO,MAAM,uBAAA;AAAA,UACjB,GAAA;AAAA,UACA,EAAE,EAAA,EAAIA,MAAAA,CAAM,IAAI,EAAA,EAAI,KAAA,EAAOA,OAAM,cAAA,EAAe;AAAA,UAChD,MAAA;AAAA,UACA,EAAE,cAAc,IAAA;AAAK,SACvB;AACA,QAAA,OAAA,CAAQA,OAAM,KAAK,CAAA,GAAI,EAAE,IAAA,EAAM,QAAQ,aAAA,EAAc;AAAA,MACvD,CAAA,MAAA,IAAW,aAAa,QAAA,EAAU;AAChC,QAAA,MAAM,OAAO,MAAM,uBAAA;AAAA,UACjB,GAAA;AAAA,UACA,EAAE,EAAA,EAAIA,MAAAA,CAAM,IAAI,EAAA,EAAI,KAAA,EAAOA,OAAM,cAAA,EAAe;AAAA,UAChD;AAAA,SACF;AACA,QAAA,OAAA,CAAQA,OAAM,KAAK,CAAA,GAAI,EAAE,IAAA,EAAM,QAAQ,SAAA,EAAU;AAAA,MACnD,CAAA,MAAO;AACL,QAAA,OAAA,CAAQA,MAAAA,CAAM,KAAK,CAAA,GAAI,EAAE,IAAA,EAAM,UAAUA,MAAAA,CAAM,GAAG,CAAA,EAAG,MAAA,EAAQ,OAAA,EAAQ;AAAA,MACvE;AAAA,IACF;AAGA,IAAA,KAAA,MAAW,EAAE,KAAA,EAAO,WAAA,EAAY,IAAK,WAAA,EAAa;AAChD,MAAA,MAAM,YAAA,GAAe,cAAA,CAAe,OAAA,CAAQ,WAAW,CAAC,CAAA;AACxD,MAAA,OAAA,CAAQ,KAAK,CAAA,GAAI,EAAE,MAAM,YAAA,CAAa,IAAA,EAAM,QAAQ,OAAA,EAAQ;AAAA,IAC9D;AAEA,IAAA,OAAO,OAAA;AAAA,EACT,CAAC,CAAA;AACH;;;ACz7CA,IAAM,qCAAA,GAAwC,CAAA;AAC9C,IAAM,mBAAA,GAAsB,GAAA;AAwE5B,SAAS,yBAAyB,OAAA,EAA+B;AAC/D,EAAA,MAAM,MAAA,GAAS,wBAAwB,OAAO,CAAA;AAC9C,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,MAAA,GAAS,qCAAqC,CAAA;AACnE;AAEA,SAAS,4BAAA,CACP,SACA,OAAA,EACiE;AACjE,EAAA,OAAO,EAAE,OAAA,EAAS,OAAA,CAAQ,OAAA,EAAS,OAAA,EAAQ;AAC7C;AAEA,SAAS,yBAAA,CACP,OAAA,EACA,OAAA,EACA,OAAA,EACY;AACZ,EAAA,OAAO,iCAAA;AAAA,IACL,OAAA;AAAA,IACA,4BAAA,CAA6B,SAAS,OAAO;AAAA,GAC/C;AACF;AAEA,SAAS,yBAAA,CACP,SACA,OAAA,EACc;AAId,EAAA,MAAM,gBAAA,GAAmB,6BAA6B,OAAO,CAAA;AAC7D,EAAA,OAAO,qBAAqB,gBAAA,EAAkB;AAAA,IAC5C,OAAA,EAAS,CAAI,KAAA,KACX,yBAAA,CAA0B,SAAS,OAAA,CAAQ,OAAA,CAAW,KAAK,CAAA,EAAG,OAAO,CAAA;AAAA,IACvE,GAAI,OAAA,CAAQ,UAAA,KAAe,MAAA,GACzB,EAAC,GACD;AAAA,MACE,UAAA,EAAY,CACV,OAAA,EACA,MAAA,KAEA,yBAAA;AAAA,QACE,OAAA;AAAA,QACA,cAAA,CAAe,OAAA,CAAQ,UAAU,CAAA,CAAK,SAAS,MAAM,CAAA;AAAA,QACrD;AAAA;AACF;AACJ,GACH,CAAA;AACH;AAEA,SAAS,sBAAA,CACP,OAAA,EACA,UAAA,EACA,UAAA,EACa;AACb,EAAA,MAAM,YAAA,GAAe,WAAW,QAAA,EAAU,IAAA;AAC1C,EAAA,IAAI,iBAAiB,MAAA,EAAW;AAC9B,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,0DAAA;AAAA,MACA,EAAE,MAAM,wCAAA;AAAyC,KACnD;AAAA,EACF;AACA,EAAA,OAAO,qBAAA,CAAsB;AAAA,IAC3B,IAAA,EAAM,WAAW,KAAA,CAAM,IAAA;AAAA,IACvB,IAAA,EAAM,WAAW,KAAA,CAAM,IAAA;AAAA,IACvB,YAAA;AAAA,IACA,UAAA;AAAA,IACA,kBAAkB,kBAAA;AAAmB,GACtC,CAAA;AACH;AAEA,SAAS,+BACP,MAAA,EAOoB;AACpB,EAAA,OAAO,IAAI,kBAAA;AAAA,IACT,+FAAA;AAAA,IACA;AAAA,MACE,IAAA,EAAM,uCAAA;AAAA,MACN,SAAS,MAAA,CAAO,OAAA;AAAA,MAChB,QAAQ,MAAA,CAAO,MAAA;AAAA,MACf,MAAM,MAAA,CAAO,IAAA;AAAA,MACb,IAAI,MAAA,CAAO,EAAA;AAAA,MACX,SAAA,EAAW,MAAA,CAAO,UAAA,CAAW,KAAA,CAAM,IAAA;AAAA,MACnC,SAAA,EAAW,MAAA,CAAO,UAAA,CAAW,KAAA,CAAM,IAAA;AAAA,MACnC,YAAA,EAAc,MAAA,CAAO,UAAA,CAAW,QAAA,EAAU;AAAA,KAC5C;AAAA,IACA;AAAA,MACE,UAAA,EACE;AAAA;AACJ,GACF;AACF;AAEA,SAAS,0BAA0B,KAAA,EAAmC;AACpE,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,mBAAA;AAChC,EAAA,IAAI,CAAC,OAAO,SAAA,CAAU,KAAK,KAAK,KAAA,IAAS,CAAA,IAAK,QAAQ,mBAAA,EAAqB;AACzE,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,CAAA,qDAAA,EAAwD,mBAAmB,CAAA,OAAA,EAAU,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA;AAAA,MAClG;AAAA,QACE,MAAA,EAAQ;AAAA,UACN;AAAA,YACE,IAAA,EAAM,OAAA;AAAA,YACN,OAAA,EAAS,oCAAoC,mBAAmB,CAAA,CAAA;AAAA;AAClE;AACF;AACF,KACF;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,uBAAA,CACP,OAAA,EACA,MAAA,EACA,IAAA,EACA,UAAA,EACQ;AACR,EAAA,OAAO,KAAK,SAAA,CAAU;AAAA,IACpB,eAAA;AAAA,IACA,OAAA;AAAA,IACA,MAAA;AAAA,IACA,IAAA;AAAA,IACA,WAAW,KAAA,CAAM,IAAA;AAAA,IACjB,WAAW,KAAA,CAAM,IAAA;AAAA,IACjB,WAAW,QAAA,EAAU;AAAA,GACtB,CAAA;AACH;AAEA,SAAS,yBAAA,GAA6C;AACpD,EAAA,OAAO,IAAI,eAAA;AAAA,IACT,qFAAA;AAAA,IACA;AAAA,MACE,MAAA,EAAQ;AAAA,QACN;AAAA,UACE,IAAA,EAAM,OAAA;AAAA,UACN,OAAA,EACE;AAAA;AACJ;AACF;AACF,GACF;AACF;AAEA,SAAS,wBAAA,CACP,QACA,aAAA,EACQ;AACR,EAAA,MAAM,OAAA,GAAU,aAAa,MAAM,CAAA;AACnC,EAAA,IACE,OAAA,CAAQ,MAAM,GAAA,IACd,OAAA,CAAQ,KAAK,MAAA,KAAW,CAAA,IACxB,QAAQ,IAAA,CAAK,CAAC,MAAM,aAAA,IACpB,OAAA,CAAQ,KAAK,MAAA,KAAW,CAAA,IACxB,OAAO,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA,KAAM,QAAA,EAC3B;AACA,IAAA,MAAM,yBAAA,EAA0B;AAAA,EAClC;AACA,EAAA,OAAO,OAAA,CAAQ,KAAK,CAAC,CAAA;AACvB;AAEA,SAAS,wBAAA,CAAyB,IAAY,KAAA,EAAuB;AACnE,EAAA,OAAO,YAAA,CAAa,EAAE,CAAA,EAAG,CAAA,EAAG,GAAG,GAAA,EAAK,IAAA,EAAM,CAAC,EAAE,CAAA,EAAG,IAAA,EAAM,CAAC,KAAK,GAAG,CAAA;AACjE;AAEO,SAAS,0BACd,MAAA,EACqB;AACrB,EAAA,MAAM;AAAA,IACJ,OAAA;AAAA,IACA,OAAA;AAAA,IACA,mBAAA;AAAA,IACA,kBAAA;AAAA,IACA;AAAA,GACF,GAAI,MAAA;AACJ,EAAA,MAAM,cAAA,GACJ,mBAAA,KAAwB,MAAA,GAAY,MAAA,GAClC,sBAAsB,mBAAmB,CAAA;AAG7C,EAAA,SAAS,sBAAsB,OAAA,EAAiB;AAC9C,IAAA,OACE,cAAA,IACA,qBAAA;AAAA,MACE,0BAAA,CAA2B,qBAAqB,OAAO;AAAA,KACzD;AAAA,EAEJ;AAEA,EAAA,eAAe,iBACb,IAAA,EACqC;AACrC,IAAA,MAAM,EAAE,OAAO,KAAA,EAAO,IAAA,EAAM,KAAK,UAAA,EAAY,QAAA,EAAU,QAAO,GAAI,IAAA;AAClE,IAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAE9B,IAAA,MAAM,YAAY,CAAC,GAAG,IAAI,GAAA,CAAI,GAAG,CAAC,CAAA;AAClC,IAAA,MAAM,QAAA,GAAW,GAAA,CAAI,GAAA,CAAI,KAAK,CAAA;AAC9B,IAAA,MAAM,cAAA,GAAiB,sBAAA,CAAuB,OAAA,EAAS,UAAA,EAAY,KAAK,CAAA;AACxE,IAAA,MAAM,eAAe,MAAM,yBAAA;AAAA,MACzB,OAAA;AAAA,MACA,OAAA,CAAQ,GAAA;AAAA,QACN,KAAA,CAAM,SAAA,EAAW,wBAAA,CAAyB,OAAO,CAAC,CAAA,CAAE,GAAA;AAAA,UAAI,CAAC,YACvD,OAAA,CAAQ,OAAA;AAAA,YACN,iBAAA,CAAkB,GAAA;AAAA,4BAAA,EACA,KAAK,IAAI,QAAQ;AAAA,oBAAA,EACzB,QAAQ,eAAe,OAAO;AAAA,oBAAA,EAC9B,QAAQ,WAAW,IAAI;AAAA,oBAAA,EACvB,QAAQ,CAAA,QAAA,EAAW,YAAA,CAAa,OAAO,CAAC,CAAA;AAAA,oBAAA,EACxC,cAAc;AAAA,uBAAA,EACX,QAAQ,CAAA;AAAA,YAAA,CACpB;AAAA;AACH;AACF,OACF;AAAA,MACA;AAAA,KACF;AAEA,IAAA,MAAM,IAAA,uBAAW,GAAA,EAAe;AAChC,IAAA,KAAA,MAAW,QAAQ,YAAA,EAAc;AAC/B,MAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,QAAA,MAAM,SAAA,GAAY,SAAS,GAAG,CAAA;AAC9B,QAAA,IAAI,IAAA,CAAK,GAAA,CAAI,SAAA,CAAU,EAAE,CAAA,EAAG;AAC1B,UAAA,MAAM,8BAAA,CAA+B;AAAA,YACnC,OAAA;AAAA,YACA,MAAA;AAAA,YACA,IAAA;AAAA,YACA,IAAI,SAAA,CAAU,EAAA;AAAA,YACd;AAAA,WACD,CAAA;AAAA,QACH;AACA,QAAA,IAAA,CAAK,GAAA,CAAI,SAAA,CAAU,EAAA,EAAI,SAAS,CAAA;AAAA,MAClC;AAAA,IACF;AACA,IAAA,OAAO,IAAI,GAAA,CAAI,CAAC,OAAO,IAAA,CAAK,GAAA,CAAI,EAAE,CAAC,CAAA;AAAA,EACrC;AAEA,EAAA,eAAe,aACb,IAAA,EAC8B;AAC9B,IAAA,MAAM,EAAE,OAAO,KAAA,EAAO,IAAA,EAAM,YAAY,OAAA,EAAS,QAAA,EAAU,QAAO,GAAI,IAAA;AACtE,IAAA,MAAM,KAAA,GAAQ,yBAAA,CAA0B,OAAA,EAAS,KAAK,CAAA;AACtD,IAAA,MAAM,KAAA,GAAQ,uBAAA,CAAwB,OAAA,EAAS,MAAA,EAAQ,MAAM,UAAU,CAAA;AACvE,IAAA,MAAM,KAAA,GACJ,SAAS,KAAA,KAAU,MAAA,GACjB,SACA,wBAAA,CAAyB,OAAA,CAAQ,OAAO,KAAK,CAAA;AACjD,IAAA,MAAM,QAAA,GAAW,GAAA,CAAI,GAAA,CAAI,KAAK,CAAA;AAC9B,IAAA,MAAM,cAAA,GAAiB,sBAAA,CAAuB,OAAA,EAAS,UAAA,EAAY,KAAK,CAAA;AACxE,IAAA,MAAM,OAAO,MAAM,yBAAA;AAAA,MACjB,OAAA;AAAA,MACA,OAAA,CAAQ,OAAA;AAAA,QACN,iBAAA,CAAkB,GAAA;AAAA,wBAAA,EACA,KAAK,IAAI,QAAQ;AAAA,gBAAA,EACzB,QAAQ,eAAe,OAAO;AAAA,gBAAA,EAC9B,QAAQ,WAAW,IAAI;AAAA,YAAA,EAC3B,KAAA,KAAU,MAAA,GAAY,GAAA,CAAI,GAAA,CAAI,EAAE,IAAI,GAAA,CAAA,IAAA,EAAU,QAAQ,CAAA,MAAA,EAAS,KAAK,CAAA,CAAE;AAAA,gBAAA,EAClE,cAAc;AAAA,mBAAA,EACX,QAAQ,YAAY,QAAQ,CAAA;AAAA,gBAAA,EAC/B,QAAQ,CAAC;AAAA,QAAA,CAClB;AAAA,OACH;AAAA,MACA;AAAA,KACF;AACA,IAAA,MAAM,WAAW,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ,QAAA,CAAS,GAAG,CAAC,CAAA;AAChD,IAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,KAAA,GAAQ,QAAA,CAAS,MAAA,EAAQ,SAAS,CAAA,EAAG;AACvD,MAAA,MAAM,QAAA,GAAW,cAAA,CAAe,QAAA,CAAS,KAAA,GAAQ,CAAC,CAAC,CAAA;AACnD,MAAA,MAAM,OAAA,GAAU,cAAA,CAAe,QAAA,CAAS,KAAK,CAAC,CAAA;AAC9C,MAAA,IAAI,QAAA,CAAS,EAAA,KAAO,OAAA,CAAQ,EAAA,EAAI;AAChC,MAAA,MAAM,8BAAA,CAA+B;AAAA,QACnC,OAAA;AAAA,QACA,MAAA;AAAA,QACA,IAAA;AAAA,QACA,IAAI,OAAA,CAAQ,EAAA;AAAA,QACZ;AAAA,OACD,CAAA;AAAA,IACH;AAEA,IAAA,MAAM,WAAA,GAAc,SAAS,MAAA,GAAS,KAAA;AACtC,IAAA,MAAM,OAAO,WAAA,GAAc,QAAA,CAAS,KAAA,CAAM,CAAA,EAAG,KAAK,CAAA,GAAI,QAAA;AACtD,IAAA,OAAO;AAAA,MACL,IAAA;AAAA,MACA,UAAA,EACE,WAAA,GACE,wBAAA,CAAyB,cAAA,CAAe,IAAA,CAAK,EAAA,CAAG,EAAE,CAAC,CAAA,CAAE,EAAA,EAAI,KAAK,CAAA,GAC9D,MAAA;AAAA,MACJ;AAAA,KACF;AAAA,EACF;AAEA,EAAA,SAAS,YAAA,CACP,IAAA,EACA,GAAA,EACA,UAAA,EAC2C;AAC3C,IAAA,MAAM,MAAA,GAAS,sBAAsB,qBAAqB,CAAA;AAC1D,IAAA,OAAO,gBAAA,CAAiB;AAAA,MACtB,MAAA,EAAQ,MAAA;AAAA,MACR,OAAO,MAAA,CAAO,UAAA;AAAA,MACd,KAAA,EAAO,GAAA;AAAA,MACP,IAAA;AAAA,MACA,GAAA;AAAA,MACA,UAAA;AAAA,MACA,UAAU,CAAC,GAAA,KAAQ,SAAA,CAAU,kBAAA,CAAmB,GAAG,CAAC;AAAA,KACrD,CAAA;AAAA,EACH;AAEA,EAAA,SAAS,YAAA,CACP,IAAA,EACA,GAAA,EACA,UAAA,EAC2C;AAC3C,IAAA,MAAM,MAAA,GAAS,sBAAsB,qBAAqB,CAAA;AAC1D,IAAA,OAAO,gBAAA,CAAiB;AAAA,MACtB,MAAA,EAAQ,MAAA;AAAA,MACR,OAAO,MAAA,CAAO,UAAA;AAAA,MACd,KAAA,EAAO,GAAA;AAAA,MACP,IAAA;AAAA,MACA,GAAA;AAAA,MACA,UAAA;AAAA,MACA,UAAU,CAAC,GAAA,KAAQ,SAAA,CAAU,kBAAA,CAAmB,GAAG,CAAC;AAAA,KACrD,CAAA;AAAA,EACH;AAEA,EAAA,SAAS,QAAA,CACP,IAAA,EACA,UAAA,EACA,OAAA,EACoC;AACpC,IAAA,MAAM,MAAA,GAAS,sBAAsB,eAAe,CAAA;AACpD,IAAA,OAAO,YAAA,CAAa;AAAA,MAClB,MAAA,EAAQ,MAAA;AAAA,MACR,OAAO,MAAA,CAAO,UAAA;AAAA,MACd,KAAA,EAAO,GAAA;AAAA,MACP,IAAA;AAAA,MACA,UAAA;AAAA,MACA,OAAA;AAAA,MACA,UAAU,CAAC,GAAA,KAAQ,SAAA,CAAU,kBAAA,CAAmB,GAAG,CAAC;AAAA,KACrD,CAAA;AAAA,EACH;AAEA,EAAA,SAAS,QAAA,CACP,IAAA,EACA,UAAA,EACA,OAAA,EACoC;AACpC,IAAA,MAAM,MAAA,GAAS,sBAAsB,eAAe,CAAA;AACpD,IAAA,OAAO,YAAA,CAAa;AAAA,MAClB,MAAA,EAAQ,MAAA;AAAA,MACR,OAAO,MAAA,CAAO,UAAA;AAAA,MACd,KAAA,EAAO,GAAA;AAAA,MACP,IAAA;AAAA,MACA,UAAA;AAAA,MACA,OAAA;AAAA,MACA,UAAU,CAAC,GAAA,KAAQ,SAAA,CAAU,kBAAA,CAAmB,GAAG,CAAC;AAAA,KACrD,CAAA;AAAA,EACH;AAEA,EAAA,OAAO;AAAA,IACL,oBAAA,CACE,YACA,OAAA,EACc;AACd,MAAA,IAAI,UAAA,CAAW,QAAA,KAAa,MAAA,EAAW,OAAO,OAAA;AAC9C,MAAA,0BAAA,CAA2B,qBAAqB,OAAO,CAAA;AACvD,MAAA,OAAO,yBAAA,CAA0B,SAAS,OAAO,CAAA;AAAA,IACnD,CAAA;AAAA,IAEA,MAAM,WAAA,CACJ,IAAA,EACA,EAAA,EACA,UAAA,EAC8B;AAC9B,MAAA,MAAM,UAAU,MAAM,YAAA,CAAa,MAAM,CAAC,EAAE,GAAG,UAAU,CAAA;AACzD,MAAA,OAAO,QAAQ,CAAC,CAAA;AAAA,IAClB,CAAA;AAAA,IAEA,YAAA;AAAA,IACA,QAAA;AAAA,IAEA,MAAM,WAAA,CACJ,IAAA,EACA,EAAA,EACA,UAAA,EAC8B;AAC9B,MAAA,MAAM,UAAU,MAAM,YAAA,CAAa,MAAM,CAAC,EAAE,GAAG,UAAU,CAAA;AACzD,MAAA,OAAO,QAAQ,CAAC,CAAA;AAAA,IAClB,CAAA;AAAA,IAEA,YAAA;AAAA,IACA;AAAA,GACF;AACF;;;AC1cA,SAAS,YAAY,KAAA,EAAwB;AAC3C,EAAA,OAAO,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,GAAI,MAAM,MAAA,GAAS,CAAA;AAC/C;AAEA,SAAS,gBAAA,GAA2B;AAClC,EAAA,OAAO,CAAA;AACT;AAEA,SAAS,iBAAiB,KAAA,EAAmC;AAC3D,EAAA,OAAO,CAAC,IAAA,KAAS,WAAA,CAAY,IAAA,CAAK,KAAK,CAAC,CAAA;AAC1C;AAKA,IAAM,0BAAA,GAA6B;AAAA,EACjC,MAAA,EAAQ,gBAAA;AAAA,EACR,gBAAA,EAAkB,gBAAA;AAAA,EAClB,MAAA,EAAQ,gBAAA;AAAA,EACR,MAAA,EAAQ,gBAAA;AAAA,EACR,UAAA,EAAY,gBAAA;AAAA,EACZ,UAAA,EAAY,gBAAA;AAAA,EACZ,oBAAA,EAAsB,gBAAA;AAAA,EACtB,UAAA,EAAY,iBAAiB,CAAC,CAAA;AAAA,EAC9B,cAAA,EAAgB,iBAAiB,CAAC,CAAA;AAAA,EAClC,UAAA,EAAY,iBAAiB,CAAC,CAAA;AAAA,EAC9B,UAAA,EAAY,iBAAiB,CAAC,CAAA;AAAA,EAC9B,uBAAA,EAAyB,gBAAA;AAAA,EACzB,2BAAA,EAA6B,iBAAiB,CAAC;AACjD,CAAA;AAEA,IAAM,0BAAA,GAA6B;AAAA,EACjC,MAAA,EAAQ,gBAAA;AAAA,EACR,MAAA,EAAQ,gBAAA;AAAA,EACR,MAAA,EAAQ,gBAAA;AAAA,EACR,UAAA,EAAY,gBAAA;AAAA,EACZ,UAAA,EAAY,iBAAiB,CAAC,CAAA;AAAA,EAC9B,cAAA,EAAgB,iBAAiB,CAAC,CAAA;AAAA,EAClC,UAAA,EAAY,iBAAiB,CAAC,CAAA;AAAA,EAC9B,UAAA,EAAY,iBAAiB,CAAC,CAAA;AAAA,EAC9B,sBAAA,EAAwB,gBAAA;AAAA,EACxB,0BAAA,EAA4B,iBAAiB,CAAC;AAChD,CAAA;AAMA,SAAS,iBAAA,GAA4C;AACnD,EAAA,uBAAO,MAAA,CAAO,OAAO,IAAI,CAAA;AAC3B;AAEA,SAAS,SAAA,CACP,MAAA,EACA,IAAA,EACA6B,MAAAA,EACM;AACN,EAAA,IAAIA,WAAU,CAAA,EAAG;AACjB,EAAA,MAAA,CAAO,IAAI,CAAA,GAAA,CAAK,MAAA,CAAO,IAAI,KAAK,CAAA,IAAKA,MAAAA;AACvC;AAeO,SAAS,gCAAA,GAA+D;AAC7E,EAAA,MAAM,QAAA,GAA0B;AAAA,IAC9B,OAAO,iBAAA,EAAkB;AAAA,IACzB,OAAO,iBAAA,EAAkB;AAAA,IACzB,KAAA,EAAO;AAAA,GACT;AACA,EAAA,IAAI,MAAA,GAAS,KAAA;AAEb,EAAA,OAAO;AAAA,IACL,UAAA,CAAW,MAAMA,MAAAA,EAAa;AAC5B,MAAA,SAAA,CAAU,QAAA,CAAS,KAAA,EAAO,IAAA,EAAMA,MAAK,CAAA;AACrC,MAAA,QAAA,CAAS,KAAA,IAASA,MAAAA;AAAA,IACpB,CAAA;AAAA,IAEA,UAAA,CAAW,MAAMA,MAAAA,EAAa;AAC5B,MAAA,SAAA,CAAU,QAAA,CAAS,KAAA,EAAO,IAAA,EAAMA,MAAK,CAAA;AACrC,MAAA,QAAA,CAAS,KAAA,IAASA,MAAAA;AAAA,IACpB,CAAA;AAAA,IAEA,SAAS,QAAA,EAA8B;AAGrC,MAAA,OAAO,OAAO,MAAA,CAAO;AAAA,QACnB,MAAA,EAAQ,OAAO,MAAA,CAAO;AAAA,UACpB,OAAO,MAAA,CAAO,MAAA;AAAA,YACZ,MAAA,CAAO,MAAA,CAAO,iBAAA,EAAkB,EAAG,SAAS,KAAK;AAAA,WACnD;AAAA,UACA,OAAO,MAAA,CAAO,MAAA;AAAA,YACZ,MAAA,CAAO,MAAA,CAAO,iBAAA,EAAkB,EAAG,SAAS,KAAK;AAAA,WACnD;AAAA,UACA,OAAO,QAAA,CAAS;AAAA,SACjB,CAAA;AAAA,QACD,GAAI,QAAA,KAAa,MAAA,GAAY,EAAC,GAAI,EAAE,QAAA;AAAS,OAC9C,CAAA;AAAA,IACH,CAAA;AAAA,IAEA,IAAA,GAAa;AACX,MAAA,MAAA,GAAS,IAAA;AAAA,IACX,CAAA;AAAA,IAEA,cAAA,GAAuB;AACrB,MAAA,IAAI,MAAA,EAAQ;AACV,QAAA,MAAM,IAAI,kBAAA;AAAA,UACR,kIAAA;AAAA,UACA,EAAC;AAAA,UACD;AAAA,YACE,UAAA,EACE;AAAA;AACJ,SACF;AAAA,MACF;AAAA,IACF;AAAA,GACF;AACF;AAEA,SAAS,gBAAgB,KAAA,EAAwC;AAC/D,EAAA,OAAO,OAAO,KAAA,KAAU,UAAA;AAC1B;AAEA,SAAS,SAAS,KAAA,EAAiC;AACjD,EAAA,OAAO,OAAO,KAAA,KAAU,QAAA,IAAY,OAAA,CAAQ,KAAK,CAAA;AACnD;AAeA,IAAM,kBAAA,GAA8D;AAAA,EAClE,WAAA,EAAa,IAAI,GAAA,CAAI,gBAAgB,CAAA;AAAA,EACrC,QAAA,EAAU;AACZ,CAAA;AAEA,IAAM,kBAAA,GAA8D;AAAA,EAClE,WAAA,EAAa,IAAI,GAAA,CAAI,gBAAgB,CAAA;AAAA,EACrC,QAAA,EAAU;AACZ,CAAA;AAWA,SAAS,gBAAA,CACP,MAAA,EACA,UAAA,EACA,IAAA,EACG;AACH,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAqB;AAEvC,EAAA,OAAO,IAAI,MAAM,MAAA,EAAQ;AAAA,IACvB,GAAA,CAAI,WAAA,EAAa,QAAA,EAAU,QAAA,EAAU;AACnC,MAAA,IAAI,OAAO,QAAA,KAAa,QAAA,IAAY,CAAC,UAAA,CAAW,QAAQ,CAAA,EAAG;AACzD,QAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,WAAA,EAAa,QAAA,EAAU,QAAQ,CAAA;AAAA,MACpD;AAEA,MAAA,MAAM,MAAA,GAAS,KAAA,CAAM,GAAA,CAAI,QAAQ,CAAA;AACjC,MAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AAEjC,MAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,GAAA,CAAI,WAAA,EAAa,UAAU,QAAQ,CAAA;AACzD,MAAA,MAAM,OAAA,GAAU,IAAA,CAAK,KAAA,EAAO,QAAQ,CAAA;AACpC,MAAA,KAAA,CAAM,GAAA,CAAI,UAAU,OAAO,CAAA;AAC3B,MAAA,OAAO,OAAA;AAAA,IACT;AAAA,GACD,CAAA;AACH;AAOA,SAAS,mBAAA,CACP,UAAA,EACA,IAAA,EACA,OAAA,EACA,QACA,cAAA,EACG;AACH,EAAA,OAAO,gBAAA;AAAA,IACL,UAAA;AAAA,IACA,CAAC,QAAA,KAAa,OAAA,CAAQ,WAAA,CAAY,IAAI,QAAQ,CAAA;AAAA,IAC9C,CAAC,OAAO,QAAA,KAAa;AACnB,MAAA,IAAI,CAAC,eAAA,CAAgB,KAAK,CAAA,EAAG,OAAO,KAAA;AAEpC,MAAA,MAAM,MAAA,GAAS,QAAA;AACf,MAAA,MAAM,OAAA,GAAyB,UAAU,IAAA,KAAS;AAGhD,QAAA,cAAA,EAAe;AAKf,QAAA,MAAMA,MAAAA,GAAQ,OAAA,CAAQ,QAAA,CAAS,MAAM,EAAE,IAAI,CAAA;AAC3C,QAAA,MAAM,SAAS,MAAM,OAAA,CAAQ,KAAA,CAAM,KAAA,EAAO,YAAY,IAAI,CAAA;AAC1D,QAAA,MAAA,CAAO,MAAMA,MAAK,CAAA;AAClB,QAAA,OAAO,MAAA;AAAA,MACT,CAAA;AACA,MAAA,OAAO,OAAA;AAAA,IACT;AAAA,GACF;AACF;AAOA,SAAS,eAAA,CACP,aACA,OAAA,EACG;AACH,EAAA,OAAO,gBAAA;AAAA,IACL,WAAA;AAAA,IACA,MAAM,IAAA;AAAA,IACN,CAAC,YAAY,IAAA,KACX,QAAA,CAAS,UAAU,CAAA,GAAI,OAAA,CAAQ,UAAA,EAAY,IAAI,CAAA,GAAI;AAAA,GACvD;AACF;AAEO,SAAS,0BAAA,CACd,KAAA,EACA,KAAA,EACA,QAAA,EAIC;AACD,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,eAAA;AAAA,MAAgB,KAAA;AAAA,MAAO,CAAC,YAAY,IAAA,KACzC,mBAAA;AAAA,QACE,UAAA;AAAA,QACA,IAAA;AAAA,QACA,kBAAA;AAAA,QACA,QAAA,CAAS,UAAA;AAAA,QACT,QAAA,CAAS;AAAA;AACX,KACF;AAAA,IACA,KAAA,EAAO,eAAA;AAAA,MAAgB,KAAA;AAAA,MAAO,CAAC,YAAY,IAAA,KACzC,mBAAA;AAAA,QACE,UAAA;AAAA,QACA,IAAA;AAAA,QACA,kBAAA;AAAA,QACA,QAAA,CAAS,UAAA;AAAA,QACT,QAAA,CAAS;AAAA;AACX;AACF,GACF;AACF;;;AChFA,IAAM,uBAAA,GAA+C,OAAO,MAAA,CAAO;AAAA,EACjE,aAAA,EAAe,MAAA;AAAA,EACf,UAAA,EAAY;AACd,CAAC,CAAA;AAMD,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;AAEA,IAAM,kBAAA,GAAqB;AAAA,EACzB,QAAA,EAAU,0BAAA;AAAA,EACV,MAAA,EAAQ;AACV,CAAA;AAEA,SAAS,mBAAmB,OAAA,EAA4C;AACtE,EAAA,OAAO,kBAAA,CAAmB,QAAQ,OAAO,CAAA;AAC3C;AA0EA,SAAS,QAAQ,KAAA,EAAuB;AACtC,EAAA,OAAO,iBAAiB,KAAA,GAAQ,KAAA,GAAQ,IAAI,KAAA,CAAM,MAAA,CAAO,KAAK,CAAC,CAAA;AACjE;AAwBA,IAAM,6BAAA,uBAA2D,GAAA,EAAI;AAErE,SAAS,kBAAA,CACP,MAAA,EACA,QAAA,EACA,eAAA,EACA,OAAA,EACuB;AACvB,EAAA,MAAM,QAAA,GAAW,eAAA,EAAiB,GAAA,CAAI,OAAO,CAAA;AAC7C,EAAA,OAAO;AAAA,IACL,MAAA;AAAA,IACA,SAAS,QAAA,CAAS,QAAA;AAAA,MAChB,QAAA,KAAa,MAAA,GAAY,MAAA,GAAY,iBAAA,CAAkB,QAAQ;AAAA;AACjE,GACF;AACF;AAGA,SAAS,0BAAA,CAGP,MAAa,OAAA,EAAqC;AAClD,EAAA,OAAO,MAAA,CAAO,iBAAiB,MAAA,CAAO,MAAA,CAAO,QAAQ,cAAA,CAAe,IAAI,CAAC,CAAA,EAAG;AAAA,IAC1E,GAAG,MAAA,CAAO,yBAAA,CAA0B,IAAI,CAAA;AAAA,IACxC,GAAG,MAAA,CAAO,yBAAA,CAA0B,OAAO;AAAA,GAC5C,CAAA;AACH;AAGA,SAAS,yBAAA,CAA0B,SAAiB,KAAA,EAA0B;AAC5E,EAAA,MAAA,CAAO,cAAA,CAAe,SAAS,KAAA,EAAO;AAAA,IACpC,YAAA,EAAc,KAAA;AAAA,IACd,UAAA,EAAY,IAAA;AAAA,IACZ,GAAA,EAAK;AAAA,GACN,CAAA;AACH;AA6GA,SAAS,uBAAA,CAGP,KAAsC,WAAA,EAAiC;AACvE,EAAA,IAAI,QAAQ,MAAA,EAAW;AAIvB,EAAA,GAAA,CAAI,OAAA,GAAU,WAAA;AAChB;AAiDA,IAAM,mBAAA,GAAN,MAAM,oBAAA,CAAsE;AAAA,EAC1E,CAAU,aAAa;AAAA,EACd,MAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,YAAA;AAAA,EACA,QAAA;AAAA,EACA,eAAA;AAAA,EACA,eAAA;AAAA,EACA,wBAAA;AAAA,EACT,eAAA;AAAA,EACS,oBAAA;AAAA,EACA,SAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,cAAA;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,gBACA,cAAA,EACA;AACA,IAAA,IAAA,CAAK,MAAA,GAAS,KAAA;AACd,IAAA,IAAA,CAAK,YAAA,GAAe,aAAa,OAAO,CAAA;AACxC,IAAA,IAAA,CAAK,eAAA,GAAkB,cAAA;AACvB,IAAA,IAAA,CAAK,eAAA,GAAkB,SAAS,OAAA,KAAY,IAAA;AAC5C,IAAA,IAAA,CAAK,wBAAA,GACH,IAAA,CAAK,eAAA,IAAmB,OAAA,EAAS,gBAAA,KAAqB,IAAA;AACxD,IAAA,IAAI,KAAK,wBAAA,EAA0B;AACjC,MAAA,8BAAA,CAA+B,OAAO,CAAA;AAAA,IACxC;AAIA,IAAA,MAAM,cAAA,GACJ,SAAS,MAAA,KAAW,MAAA,GAClB,SACA,gBAAA,CAAiB,OAAA,CAAQ,QAAQ,cAAc,CAAA;AACnD,IAAA,MAAM,iBACJ,cAAA,KACC,OAAA,CAAQ,aAAa,eAAA,CAAgB,OAAA,CAAQ,UAAU,CAAA,GAAI,MAAA,CAAA;AAC9D,IAAA,MAAM,UAAA,GAAa,cAAA,IAAkB,eAAA,CAAgB,OAAA,CAAQ,UAAU,CAAA;AACvE,IAAA,IAAI,IAAA,CAAK,eAAA,IAAmB,OAAA,EAAS,YAAA,KAAiB,MAAA,EAAW;AAC/D,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,qDAAA;AAAA,QACA,EAAE,MAAM,sCAAA,EAAuC;AAAA,QAC/C;AAAA,UACE,UAAA,EACE;AAAA;AACJ,OACF;AAAA,IACF;AACA,IAAA,MAAM,oBAAA,GAAuB,iCAAA;AAAA,MAC3B,OAAA,EAAS;AAAA,KACX;AACA,IAAA,IAAA,CAAK,oBAAA,GACH,IAAA,CAAK,eAAA,GACH,yBAAA,CAA0B,UAAU,CAAA,GACpC,oBAAA;AACJ,IAAA,IAAA,CAAK,QAAA,GACH,IAAA,CAAK,eAAA,GACH,mBAAA,CAAoB,qBAAA,CAAsB,SAAS,cAAc,CAAC,CAAA,GAClE,mBAAA,CAAoB,OAAO,CAAA;AAC/B,IAAA,IAAA,CAAK,OAAA,GAAU,cAAA;AACf,IAAA,MAAM,eAAA,GAAkB,kBAAA,CAAmB,IAAA,CAAK,QAAQ,CAAA;AACxD,IAAA,IAAA,CAAK,iBAAiB,yBAAA,CAA0B;AAAA,MAC9C,SAAS,KAAA,CAAM,EAAA;AAAA,MACf,SAAS,IAAA,CAAK,QAAA;AAAA,MACd,qBAAqB,IAAA,CAAK,oBAAA;AAAA,MAC1B,kBAAA,EAAoB,oBAAoB,eAAe,CAAA;AAAA,MACvD,kBAAA,EAAoB,oBAAoB,eAAe;AAAA,KACxD,CAAA;AACD,IAAA,IAAA,CAAK,SAAA,GAAY,kBAAkB,KAAK,CAAA;AACxC,IAAA,IAAA,CAAK,MAAA,GAAS,OAAA,EAAS,KAAA,IAAS,EAAC;AACjC,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;AACzC,IAAA,IAAA,CAAK,aAAa,CAAA,GAAI;AAAA,MACpB,SAAS,IAAA,CAAK,QAAA;AAAA,MACd,WAAA,EAAa,CAAC,UAAA,KAAe,IAAA,CAAK,YAAY,UAAU,CAAA;AAAA,MACxD,mBAAA,EAAqB,CAAC,IAAA,EAAM,EAAA,EAAI,eAC9B,IAAA,CAAK,mBAAA,CAAoB,IAAA,EAAM,EAAA,EAAI,UAAU,CAAA;AAAA,MAC/C,oBAAA,EAAsB,CAAC,IAAA,EAAM,GAAA,EAAK,eAChC,IAAA,CAAK,oBAAA,CAAqB,IAAA,EAAM,GAAA,EAAK,UAAU,CAAA;AAAA,MACjD,gBAAA,EAAkB,CAAC,IAAA,EAAM,UAAA,EAAYC,aACnC,IAAA,CAAK,gBAAA,CAAiB,IAAA,EAAM,UAAA,EAAYA,QAAO,CAAA;AAAA,MACjD,mBAAA,EAAqB,CAAC,IAAA,EAAM,EAAA,EAAI,eAC9B,IAAA,CAAK,mBAAA,CAAoB,IAAA,EAAM,EAAA,EAAI,UAAU,CAAA;AAAA,MAC/C,oBAAA,EAAsB,CAAC,IAAA,EAAM,GAAA,EAAK,eAChC,IAAA,CAAK,oBAAA,CAAqB,IAAA,EAAM,GAAA,EAAK,UAAU,CAAA;AAAA,MACjD,gBAAA,EAAkB,CAAC,IAAA,EAAM,UAAA,EAAYA,aACnC,IAAA,CAAK,gBAAA,CAAiB,IAAA,EAAM,UAAA,EAAYA,QAAO,CAAA;AAAA,MACjD,sBAAsB,CAAC,MAAA,EAAQ,oBAC7B,IAAA,CAAK,oBAAA,CAAqB,QAAQ,eAAe,CAAA;AAAA,MACnD,sBAAA,EAAwB,CAAC,UAAA,KACvB,IAAA,CAAK,uBAAuB,UAAU;AAAA,KAC1C;AACA,IAAA,MAAA,CAAO,cAAA,CAAe,MAAM,aAAA,EAAe;AAAA,MACzC,YAAA,EAAc,KAAA;AAAA,MACd,UAAA,EAAY,KAAA;AAAA,MACZ,QAAA,EAAU;AAAA,KACX,CAAA;AAAA,EACH;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,YAAA,GAAoC;AACtC,IAAA,OAAO,KAAK,YAAA,CAAa,YAAA;AAAA,EAC3B;AAAA;AAAA,EAGA,IAAI,QAAA,GAAyB;AAC3B,IAAA,OAAO,IAAA,CAAK,SAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,cAAA,GAA0B;AAC5B,IAAA,OAAO,IAAA,CAAK,eAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,uBAAA,GAAmC;AACrC,IAAA,OAAO,IAAA,CAAK,wBAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,cAAA,GAA4B;AAC9B,IAAA,OAAO,KAAK,UAAA,EAAW;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,iBAAA,GAA6B;AAC/B,IAAA,OAAO,KAAK,oBAAA,KAAyB,MAAA;AAAA,EACvC;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;AAAA;AAAA,EA0BA,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,OAAO,IAAA,CAAK,MAAA;AAAA,QACZ,UAAU,IAAA,CAAK,SAAA;AAAA,QACf,SAAS,IAAA,CAAK,QAAA;AAAA,QACd,QAAQ,IAAA,CAAK,OAAA;AAAA,QACb,qBAAqB,IAAA,CAAK,oBAAA;AAAA,QAC1B,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,EAaA,6BAAA,CACE,aACA,IAAA,EACmC;AACnC,IAAA,IAAI,CAAC,OAAO,MAAA,CAAO,IAAA,CAAK,OAAO,KAAA,EAAO,IAAI,GAAG,OAAO,MAAA;AACpD,IAAA,OAAO,YACL,IACF,CAAA;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,kBAAkB,IAAA,EAAiD;AACjE,IAAA,OAAO,IAAA,CAAK,6BAAA,CAA8B,IAAA,CAAK,KAAA,EAAO,IAAI,CAAA;AAAA,EAC5D;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,eAAe,IAAA,CAAK,MAAA,CAAO,MAAM,IAAI,CAAC,EAAE,IAAA,CAAK,MAAA;AAAA,EACtD;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,eAAe,IAAA,CAAK,MAAA,CAAO,MAAM,IAAI,CAAC,EAAE,IAAA,CAAK,MAAA;AAAA,EACtD;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,OAAO,IAAA,CAAK,oBAAA,CAAqB,IAAA,CAAK,2BAAA,EAA6B,CAAA;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,iCAAiC,QAAA,EAAiC;AACtE,IAAA,MAAM,UAAA,GAAa,KAAK,QAAA,EAAU,qBAAA;AAClC,IAAA,IAAI,eAAe,KAAA,EAAO;AAC1B,IAAA,MAAM,YAAY,UAAA,IAAc,qCAAA;AAChC,IAAA,IAAI,WAAW,SAAA,EAAW;AAC1B,IAAA,IAAI;AACF,MAAA,MAAM,KAAK,iBAAA,EAAkB;AAAA,IAC/B,SAAS,KAAA,EAAO;AACd,MAAA,OAAA,CAAQ,IAAA;AAAA,QACN,yHAAA;AAAA,QAEA;AAAA,OACF;AAAA,IACF;AAAA,EACF;AAAA,EAEA,qBAAqB,GAAA,EAA8C;AACjE,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,+BAAA,EAAiC,CAAC,QAAA,KAChC,IAAA,CAAK,iCAAiC,QAAQ,CAAA;AAAA,MAChD,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;AAAA,MAEF,GAAI,IAAA,CAAK,QAAA,EAAU,wBAAA,KAA6B,IAAA,IAAQ;AAAA,QACtD,gBAAA,EAAkB,CAAC,IAAA,EAAM,EAAA,EAAI,aAAA,EAAe,UAAA,KAC1C,oBAAA,CAAqB,GAAA,EAAK,IAAA,EAAM,EAAA,EAAI,aAAA,EAAe,UAAU;AAAA,OACjE;AAAA,MACA,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,OAAO,IAAA,CAAK,oBAAA,CAAqB,IAAA,CAAK,2BAAA,EAA6B,CAAA;AAAA,EACrE;AAAA,EAEA,qBAAqB,GAAA,EAA8C;AACjE,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,+BAAA,EAAiC,CAAC,QAAA,KAChC,IAAA,CAAK,iCAAiC,QAAQ,CAAA;AAAA,MAChD,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;AAAA,MAEtD,GAAI,IAAA,CAAK,QAAA,EAAU,wBAAA,KAA6B,IAAA,IAAQ;AAAA,QACtD,gBAAA,EAAkB,CAAC,IAAA,EAAM,EAAA,EAAI,aAAA,EAAe,UAAA,KAC1C,oBAAA,CAAqB,GAAA,EAAK,IAAA,EAAM,EAAA,EAAI,aAAA,EAAe,UAAU;AAAA,OACjE;AAAA,MACA,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,GAAwC;AACtC,IAAA,OAAO,IAAA,CAAK,sBAAA,CAAuB,IAAA,CAAK,QAAQ,CAAA;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,YAAY,UAAA,EAA8D;AACxE,IAAA,OAAO,IAAA,CAAK,sBAAA;AAAA,MACV,IAAA,CAAK,cAAA,CAAe,oBAAA,CAAqB,UAAA,EAAY,gBAAgB,CAAA;AAAA,MACrE;AAAA,KACF;AAAA,EACF;AAAA,EAEA,UAAA,GAAwB;AACtB,IAAA,OAAO,IAAA,CAAK,OAAA,IAAW,eAAA,CAAgB,IAAA,CAAK,SAAS,UAAU,CAAA;AAAA,EACjE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,mBAAA,CACJ,IAAA,EACA,EAAA,EACA,UAAA,EAC8B;AAC9B,IAAA,OAAO,IAAA,CAAK,cAAA,CAAe,WAAA,CAAY,IAAA,EAAM,IAAI,UAAU,CAAA;AAAA,EAC7D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,oBAAA,CACJ,IAAA,EACA,GAAA,EACA,UAAA,EAC2C;AAC3C,IAAA,OAAO,IAAA,CAAK,cAAA,CAAe,YAAA,CAAa,IAAA,EAAM,KAAK,UAAU,CAAA;AAAA,EAC/D;AAAA;AAAA,EAGA,MAAM,gBAAA,CACJ,IAAA,EACA,UAAA,EACA,OAAA,EACoC;AACpC,IAAA,OAAO,IAAA,CAAK,cAAA,CAAe,QAAA,CAAS,IAAA,EAAM,YAAY,OAAO,CAAA;AAAA,EAC/D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,mBAAA,CACJ,IAAA,EACA,EAAA,EACA,UAAA,EAC8B;AAC9B,IAAA,OAAO,IAAA,CAAK,cAAA,CAAe,WAAA,CAAY,IAAA,EAAM,IAAI,UAAU,CAAA;AAAA,EAC7D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,oBAAA,CACJ,IAAA,EACA,GAAA,EACA,UAAA,EAC2C;AAC3C,IAAA,OAAO,IAAA,CAAK,cAAA,CAAe,YAAA,CAAa,IAAA,EAAM,KAAK,UAAU,CAAA;AAAA,EAC/D;AAAA;AAAA,EAGA,MAAM,gBAAA,CACJ,IAAA,EACA,UAAA,EACA,OAAA,EACoC;AACpC,IAAA,OAAO,IAAA,CAAK,cAAA,CAAe,QAAA,CAAS,IAAA,EAAM,YAAY,OAAO,CAAA;AAAA,EAC/D;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;AAAA,EAkBA,aAAa,YAAA,EAAqD;AAChE,IAAA,MAAM,eAAA,GAAkB,qBAAA;AAAA,MACtB,MAAA;AAAA,MACA,YAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,OAAO,IAAI,iBAAA;AAAA,MACT,IAAA;AAAA,MACA,sBAAA,CAAuB,iBAAiB,YAAY;AAAA,KACtD;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,EAyBA,MAAM,WAAA,GAAoD;AACxD,IAAA,IAAI,CAAC,KAAK,eAAA,EAAiB;AACzB,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,gEAAA;AAAA,QACA,EAAE,MAAM,+BAAA,EAAgC;AAAA,QACxC;AAAA,UACE,UAAA,EACE;AAAA;AACJ,OACF;AAAA,IACF;AACA,IAAA,MAAM,aAAa,MAAM,iCAAA;AAAA,MACvB,kBAAkB,IAAA,CAAK,QAAA,EAAU,KAAK,UAAA,EAAW,EAAG,KAAK,OAAO,CAAA;AAAA,MAChE,EAAE,OAAA,EAAS,IAAA,CAAK,QAAA,CAAS,OAAA,EAAS,SAAS,cAAA;AAAe,KAC5D;AAGA,IAAA,OAAO,UAAA,KAAe,MAAA,GAAY,MAAA,GAAY,iBAAA,CAAkB,UAAU,CAAA;AAAA,EAC5E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,WAAA,GAA2C;AAC/C,IAAA,IAAI,CAAC,IAAA,CAAK,wBAAA,EAA0B,OAAO,MAAA;AAC3C,IAAA,OAAO,kBAAkB,IAAA,CAAK,QAAA,EAAU,KAAK,UAAA,EAAW,EAAG,KAAK,OAAO,CAAA;AAAA,EACzE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,iBAAA,GAAqC;AACzC,IAAA,IAAI,CAAC,KAAK,wBAAA,EAA0B;AAClC,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,uEAAA;AAAA,QACA,EAAE,MAAM,mCAAA;AAAoC,OAC9C;AAAA,IACF;AACA,IAAA,MAAM,aAAA,GACJ,IAAA,CAAK,eAAA,IACL,oBAAA,CAAqB,IAAA,CAAK,cAAc,IAAA,CAAK,UAAA,EAAW,EAAG,IAAA,CAAK,OAAO,CAAA;AACzE,IAAA,IAAA,CAAK,eAAA,GAAkB,aAAA;AACvB,IAAA,IAAI;AACF,MAAA,OAAO,MAAM,aAAA;AAAA,IACf,SAAS,KAAA,EAAO;AAId,MAAA,IAAI,IAAA,CAAK,oBAAoB,aAAA,EAAe;AAC1C,QAAA,IAAA,CAAK,eAAA,GAAkB,MAAA;AAAA,MACzB;AACA,MAAA,MAAM,KAAA;AAAA,IACR;AAAA,EACF;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,SAAA;AAAA,QACf,WAAA,EAAa,MAAM,IAAA,CAAK,KAAA;AAAM,OAC/B,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;AAKrD,IAAA,OAAO,0BAAA,CAA2B,IAAA,CAAK,YAAA,EAAc,OAAO,MAAA,KAAW;AACrE,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;AAKvC,IAAA,0BAAA,CAA2B,OAAA,EAAS;AAAA,MAClC,IAAA,EAAM,sCAAA;AAAA,MACN,OAAA,EACE,+EAAA;AAAA,MACF,UAAA,EACE;AAAA,KACH,CAAA;AAGD,IAAA,OAAO,IAAA,CAAK,oBAAA,CAAqB,MAAA,EAAQ,OAAO,CAAA;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,oBAAA,CAKE,QACA,OAAA,EACuC;AACvC,IAAA,MAAM,UAAA,GAAa,qBAAA;AAAA,MACjB,OAAA,CAAQ,YAAA,IAAgB,IAAA,CAAK,MAAA,CAAO,QAAA,CAAS,YAAA;AAAA,MAC7C,OAAA,CAAQ;AAAA,KACV;AACA,IAAA,MAAM,cAAA,GACJ,QAAQ,YAAA,KAAiB,MAAA,GACvB,aACA,sBAAA,CAAuB,UAAA,EAAY,QAAQ,YAAY,CAAA;AAC3D,IAAA,OAAO,eAAA,CAAgB;AAAA,MACrB,OAAO,IAAA,CAAK,MAAA;AAAA,MACZ,SAAS,IAAA,CAAK,OAAA;AAAA,MACd,MAAA;AAAA,MACA,OAAA,EAAS,KAAK,cAAA,CAAe,oBAAA;AAAA,QAC3B,cAAA;AAAA,QACA;AAAA,OACF;AAAA,MACA,OAAA,EAAS,UAAA,CAAW,IAAA,CAAK,QAAA,CAAS,OAAO,CAAA;AAAA,MACzC,QAAQ,IAAA,CAAK,OAAA;AAAA,MACb,qBAAqB,IAAA,CAAK,oBAAA;AAAA,MAC1B;AAAA,KACD,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,uBACE,UAAA,EAC4B;AAC5B,IAAA,OAAO,qBAAA,CAAyB;AAAA,MAC9B,SAAS,IAAA,CAAK,OAAA;AAAA,MACd,OAAO,IAAA,CAAK,MAAA;AAAA,MACZ,UAAU,IAAA,CAAK,SAAA;AAAA,MACf,OAAA,EAAS,KAAK,cAAA,CAAe,oBAAA;AAAA,QAC3B,UAAA;AAAA,QACA;AAAA,OACF;AAAA,MACA,QAAQ,IAAA,CAAK,OAAA;AAAA,MACb,qBAAqB,IAAA,CAAK,oBAAA;AAAA,MAC1B,mBAAA,EAAqB,IAAA,CAAK,MAAA,CAAO,QAAA,CAAS,YAAA;AAAA,MAC1C,iBAAA,EAAmB,WAAW,QAAA,KAAa;AAAA,KAC5C,CAAA;AAAA,EACH;AAAA,EA6FA,MAAM,WAAA,CACJ,EAAA,EAKA,OAAA,EACY;AACZ,IAAA,MAAM,MAAA,GAAS,EAAA;AAGf,IAAA,MAAM,EAAE,QAAO,GAAI,MAAM,KAAK,eAAA,CAAgB,MAAA,EAAQ,SAAS,MAAS,CAAA;AACxE,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EA0DA,MAAM,sBAAA,CACJ,EAAA,EAOA,OAAA,EACgC;AAChC,IAAA,MAAM,MAAA,GAAS,EAAA;AAGf,IAAA,MAAM,kBAAkB,gCAAA,EAAiC;AACzD,IAAA,MAAM,EAAE,MAAA,EAAQ,eAAA,EAAgB,GAAI,MAAM,IAAA,CAAK,eAAA;AAAA,MAC7C,MAAA;AAAA,MACA,OAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,OAAO,kBAAA;AAAA,MACL,MAAA;AAAA,MACA,eAAA;AAAA,MACA,eAAA;AAAA,MACA,IAAA,CAAK;AAAA,KACP;AAAA,EACF;AAAA,EAEA,MAAM,eAAA,CACJ,MAAA,EAGA,cAAA,EACA,eAAA,EACkC;AAKlC,IAAA,IAAI,CAAC,IAAA,CAAK,QAAA,CAAS,YAAA,CAAa,YAAA,EAAc;AAC5C,MAAA,IAAI,QAAQ,IAAA,CAAK,KAAA;AACjB,MAAA,IAAI,QAAQ,IAAA,CAAK,KAAA;AACjB,MAAA,IAAI,oBAAoB,MAAA,EAAW;AACjC,QAAA,CAAC,EAAE,KAAA,EAAO,KAAA,EAAM,GAAI,0BAAA;AAAA,UAClB,KAAA;AAAA,UACA,KAAA;AAAA,UACA;AAAA,SACF;AAAA,MACF;AACA,MAAA,MAAM,eAAA,GACJ;AAAA,QACE,KAAA;AAAA,QACA,KAAA;AAAA;AAAA,QAEA,eAAA,EAAiB,aAAA;AAAA,QACjB,OAAA,EAAS,4BAAA,CAA6B,IAAA,CAAK,QAAQ,CAAA;AAAA,QACnD,CAAC,mBAAmB,GAAG;AAAA,UACrB,SAAS,IAAA,CAAK,QAAA;AAAA,UACd,uBAAuB,CAAC,SAAA,EAAW,IAAA,EAAM,EAAA,EAAI,mBAC3C,IAAA,CAAK,mBAAA;AAAA,YACH,IAAA,CAAK,uBAAA,CAAwB,SAAA,EAAW,MAAA,EAAQ,MAAM,EAAE,CAAA;AAAA,YACxD;AAAA;AACF,SACJ;AAAA,QACA,mBAAmB,CAAC,IAAA,KAClB,IAAA,CAAK,6BAAA,CAA8B,OAAO,IAAI;AAAA,OAClD;AACF,MAAA,MAAA,CAAO,cAAA,CAAe,iBAAiB,mBAAA,EAAqB;AAAA,QAC1D,YAAA,EAAc,KAAA;AAAA,QACd,UAAA,EAAY,KAAA;AAAA,QACZ,QAAA,EAAU;AAAA,OACX,CAAA;AAID,MAAA,MAAM,SAAS,MAAM,MAAA;AAAA,QACnB,eAAA,KAAoB,MAAA,GAAY,eAAA,GAC9B,IAAA,CAAK,eAAe,eAAe;AAAA,OAEvC;AACA,MAAA,OAAO,EAAE,MAAA,EAAQ,eAAA,EAAiB,MAAA,EAAU;AAAA,IAC9C;AAmBA,IAAA,MAAM,UAAqC,EAAC;AAC5C,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,yBAAA,CAA0B,OAAO,CAAA;AACvD,IAAA,IAAI,eAAA;AACJ,IAAA,MAAM,kBAAA,GACJ,oBAAoB,MAAA,IAAa,IAAA,CAAK,kBACpC,yBAAA,CAA0B,cAAA,EAAgB,CAAC,QAAA,KAAa;AACtD,MAAA,eAAA,GAAkB,QAAA;AAAA,IACpB,CAAC,CAAA,GACD,cAAA;AACJ,IAAA,IAAI;AACF,MAAA,MAAM,GAAA,GAAM,OACV,SAAA,EACA,iBAAA,KAEA,MAAA;AAAA,QACE,IAAA,CAAK,wBAAA;AAAA,UACH,SAAA;AAAA,UACA,iBAAA;AAAA,UACA,QAAA;AAAA,UACA;AAAA;AACF,OACF;AACF,MAAA,MAAM,MAAA,GACJ,KAAK,eAAA,IAAmB,IAAA,CAAK,oBAAoB,KAAA,CAAA,GAC/C,MAAM,KAAK,QAAA,CAAS,WAAA;AAAA,QAClB,CAAC,SAAA,KAAc,GAAA,CAAI,SAAA,EAAW,KAAA,CAAS,CAAA;AAAA,QACvC;AAAA,OACF,GACA,MAAM,IAAA,CAAK,eAAA,CAAgB,qBAAA;AAAA,QACzB,CAAC,SAAA,EAAW,iBAAA,KAAsB,GAAA,CAAI,WAAW,iBAAiB,CAAA;AAAA,QAClE;AAAA,OACF;AACJ,MAAA,KAAA,MAAW,WAAW,OAAA,EAAS;AAC7B,QAAA,IAAA,CAAK,MAAA,CAAO,cAAA,GAAiB,OAAA,CAAQ,GAAA,EAAK;AAAA,UACxC,YAAY,OAAA,CAAQ;AAAA,SACrB,CAAA;AAAA,MACH;AACA,MAAA,OAAO,EAAE,QAAQ,eAAA,EAAgB;AAAA,IACnC,SAAS,KAAA,EAAO;AACd,MAAA,MAAM,OAAA,GAAU,QAAQ,KAAK,CAAA;AAC7B,MAAA,KAAA,MAAW,WAAW,OAAA,EAAS;AAC7B,QAAA,IAAA,CAAK,MAAA,CAAO,OAAA,GAAU,OAAA,CAAQ,GAAA,EAAK,OAAO,CAAA;AAAA,MAC5C;AACA,MAAA,MAAM,KAAA;AAAA,IACR;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;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA4EA,gBACE,UAAA,EACkD;AAClD,IAAA,IAAI,KAAK,eAAA,EAAiB;AACxB,MAAA,MAAM,+CAAA,EAAgD;AAAA,IACxD;AACA,IAAA,MAAM,KAAA,GAAQ,KAAK,eAAA,EAAiB,gBAAA;AACpC,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,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,EA0EA,MAAM,uBAAA,CACJ,UAAA,EACA,EAAA,EAOgC;AAChC,IAAA,MAAM,KAAA,GAAQ,KAAK,eAAA,EAAiB,gBAAA;AACpC,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,8EAAA;AAAA,QACA,EAAE,YAAY,kBAAA,EAAmB;AAAA,QACjC;AAAA,UACE,UAAA,EACE;AAAA;AACJ,OACF;AAAA,IACF;AACA,IAAA,MAAM,SAAA,GAAY,MAAM,UAAU,CAAA;AAClC,IAAA,IAAI,KAAK,eAAA,EAAiB;AACxB,MAAA,MAAM,0CAA0C,SAAS,CAAA;AAAA,IAC3D;AAIA,IAAA,MAAM,KAAA,GACJ,KAAK,eAAA,GACH,8BAAA,CAA+B,WAAW,IAAA,CAAK,UAAA,EAAY,CAAA,GAC3D;AAAA,MACE,OAAA,EAAS,SAAA;AAAA,MACT,KAAA,EAAO,MACL,OAAA,CAAQ,OAAA,CAAQ,6BAA6B;AAAA,KACjD;AACJ,IAAA,IAAI,KAAK,eAAA,EAAiB;AACxB,MAAA,MAAM,sBAAA,CAAuB,KAAA,CAAM,OAAA,EAAS,IAAA,CAAK,OAAO,CAAA;AAAA,IAC1D;AACA,IAAA,MAAM,kBAAkB,gCAAA,EAAiC;AACzD,IAAA,MAAM,MAAA,GAAS,EAAA;AAGf,IAAA,MAAM,SAAS,MAAM,MAAA;AAAA,MACnB,IAAA,CAAK,wBAAA;AAAA,QACH,KAAA,CAAM,OAAA;AAAA,QACN,UAAA;AAAA,QACA,MAAA;AAAA,QACA;AAAA;AACF,KACF;AAIA,IAAA,MAAM,eAAA,GAAkB,MAAM,KAAA,CAAM,KAAA,EAAM;AAM1C,IAAA,IAAI,CAAC,IAAA,CAAK,eAAA,EAAiB,eAAA,CAAgB,IAAA,EAAK;AAChD,IAAA,OAAO,kBAAA;AAAA,MACL,MAAA;AAAA,MACA,eAAA;AAAA,MACA,eAAA;AAAA,MACA,IAAA,CAAK;AAAA,KACP;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,eACE,OAAA,EAC4D;AAC5D,IAAA,MAAM,OAAA,GAEF,OAAO,EAAA,KAAO;AAChB,MAAA,MAAM,gBAAgB,gCAAA,EAAiC;AACvD,MAAA,MAAM,EAAE,KAAA,EAAO,KAAA,EAAM,GAAI,0BAAA;AAAA,QACvB,OAAA,CAAQ,KAAA;AAAA,QACR,OAAA,CAAQ,KAAA;AAAA,QACR;AAAA,OACF;AACA,MAAA,MAAM,SAAS,IAAA,CAAK,cAAA;AAAA,QAClB,2BAA2B,OAAA,EAAS;AAAA,UAClC,KAAA;AAAA,UACA,KAAA;AAAA,UACA,mBAAmB,CAAC,IAAA,KAClB,IAAA,CAAK,6BAAA,CAA8B,OAAO,IAAI;AAAA,SACjD;AAAA,OACH;AACA,MAAA,MAAM,MAAA,GAAS,MAAM,EAAA,CAAG,MAAM,CAAA;AAC9B,MAAA,OAAO,EAAE,MAAA,EAAQ,OAAA,EAAS,aAAA,CAAc,UAAS,EAAE;AAAA,IACrD,CAAA;AACA,IAAA,OAAO,0BAAA,CAA2B,OAAA,EAAS,EAAE,OAAA,EAAS,CAAA;AAAA,EACxD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,yBACE,SAAA,EACAC,IAAAA,EACA,WAAgC,IAAA,CAAK,oBAAA,IACrC,eAAA,EACkD;AAIlD,IAAA,MAAM,gBAAA,GAAmC;AAAA,MACvC,GAAG,IAAA,CAAK,oBAAA,CAAqB,IAAA,CAAK,2BAAA,CAA4B,QAAQ,CAAC,CAAA;AAAA,MACvE,WAAA,EAAa,MAAM,IAAA,CAAK,sBAAA,CAAuB,SAAS,CAAA;AAAA,MACxD,+BAAA,EAAiC;AAAA,KACnC;AACA,IAAA,MAAM,gBAAA,GAAmC;AAAA,MACvC,GAAG,IAAA,CAAK,oBAAA,CAAqB,IAAA,CAAK,2BAAA,CAA4B,QAAQ,CAAC,CAAA;AAAA,MACvE,WAAA,EAAa,MAAM,IAAA,CAAK,sBAAA,CAAuB,SAAS,CAAA;AAAA,MACxD,+BAAA,EAAiC;AAAA,KACnC;AAEA,IAAA,MAAM,qBAAA,GAAwB,CAC5B,SAAA,EACA,IAAA,EACA,IACA,EAAA,KAEA,QAAA,CAAS,IAAA,CAAK,uBAAA,CAAwB,SAAA,EAAW,MAAA,EAAQ,IAAA,EAAM,EAAE,GAAG,EAAE,CAAA;AAExE,IAAA,IAAI,KAAA,GAAQ,0BAAA;AAAA,MACV,IAAA,CAAK,MAAA;AAAA,MACL,IAAA,CAAK,OAAA;AAAA,MACL,IAAA,CAAK,SAAA;AAAA,MACL,SAAA;AAAA,MACA;AAAA,KACF;AAEA,IAAA,IAAI,KAAA,GAAQ,0BAAA;AAAA,MACV,IAAA,CAAK,MAAA;AAAA,MACL,IAAA,CAAK,OAAA;AAAA,MACL,IAAA,CAAK,SAAA;AAAA,MACL,SAAA;AAAA,MACA;AAAA,KACF;AAEA,IAAA,IAAI,oBAAoB,MAAA,EAAW;AACjC,MAAA,CAAC,EAAE,KAAA,EAAO,KAAA,EAAM,GAAI,0BAAA;AAAA,QAClB,KAAA;AAAA,QACA,KAAA;AAAA,QACA;AAAA,OACF;AAAA,IACF;AAEA,IAAA,MAAM,oBAAoB,CACxB,IAAA,KAEA,IAAA,CAAK,6BAAA,CAA8B,OAAO,IAAI,CAAA;AAOhD,IAAA,MAAM,IAAA,GAAO;AAAA,MACX,KAAA;AAAA,MACA,KAAA;AAAA,MACA,OAAA,EAAS,6BAA6B,SAAS,CAAA;AAAA,MAC/C,CAAC,mBAAmB,GAAG,EAAE,OAAA,EAAS,WAAW,qBAAA,EAAsB;AAAA,MACnE;AAAA,KACF;AAEA,IAAA,IAAI,OAAA;AACJ,IAAA,IAAI,KAAK,eAAA,EAAiB;AACxB,MAAA,OAAA,GAAU;AAAA,QACR,GAAG,IAAA;AAAA,QACH,eAAA,EAAiB;AAAA,OACnB;AACA,MAAA,yBAAA,CAA0B,OAAA,EAAS,MAAM,2BAAA,EAA6B,CAAA;AAAA,IACxE,CAAA,MAAA,IAAW,KAAK,wBAAA,EAA0B;AACxC,MAAA,OAAA,GAAU;AAAA,QACR,GAAG,IAAA;AAAA,QACH,eAAA,EAAiB;AAAA,OACnB;AACA,MAAA,yBAAA;AAAA,QAA0B,OAAA;AAAA,QAAS,MACjC,oCAAA;AAAqC,OACvC;AAAA,IACF,CAAA,MAAA,IAAWA,SAAQ,MAAA,EAAW;AAC5B,MAAA,OAAA,GAAU,EAAE,GAAG,IAAA,EAAM,eAAA,EAAiB,aAAA,EAAc;AAAA,IACtD,CAAA,MAAO;AACL,MAAA,OAAA,GAAU,EAAE,GAAG,IAAA,EAAM,GAAA,EAAAA,IAAAA,EAAK,iBAAiB,WAAA,EAAY;AAAA,IACzD;AACA,IAAA,MAAA,CAAO,cAAA,CAAe,SAAS,mBAAA,EAAqB;AAAA,MAClD,YAAA,EAAc,KAAA;AAAA,MACd,UAAA,EAAY,KAAA;AAAA,MACZ,QAAA,EAAU;AAAA,KACX,CAAA;AAKD,IAAA,OAAO,eAAA,KAAoB,MAAA,GAAY,OAAA,GACnC,IAAA,CAAK,eAAe,OAAO,CAAA;AAAA,EAEjC;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,IAAI,KAAK,wBAAA,EAA0B;AACjC,QAAA,MAAM,sBAAA,CAAuB,MAAA,EAAQ,IAAA,CAAK,OAAO,CAAA;AAAA,MACnD;AACA,MAAA,MAAM,gBAAA,GACJ,IAAA,CAAK,wBAAA,IAA4B,CAAC,KAAK,eAAA,GACrC,MAAM,iBAAA,CAAkB,MAAA,EAAQ,IAAA,CAAK,UAAA,EAAW,EAAG,IAAA,CAAK,OAAO,CAAA,GAC/D,MAAA;AACJ,MAAA,MAAM,MAAA,CAAO,UAAA,CAAW,IAAA,CAAK,OAAO,CAAA;AAOpC,MAAA,IAAI,IAAA,CAAK,wBAAA,IAA4B,CAAC,IAAA,CAAK,eAAA,EAAiB;AAC1D,QAAA,MAAM,oBAAA;AAAA,UACJ,MAAA;AAAA,UACA,KAAK,UAAA,EAAW;AAAA,UAChB,IAAA,CAAK,OAAA;AAAA,UACL,IAAA,CAAK,aAAa,YAAA,CAAa,YAAA;AAAA,UAC/B;AAAA,SACF;AAAA,MACF;AAAA,IACF,CAAA;AAEA,IAAA,OAAO,IAAA,CAAK,YAAA,CAAa,YAAA,CAAa,YAAA,GACpC,KAAK,YAAA,CAAa,WAAA,CAAY,OAAO,EAAA,KAAO,QAAQ,EAAE,CAAC,CAAA,GACvD,OAAA,CAAQ,KAAK,YAAY,CAAA,CAAA;AAK3B,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,YAAA;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,MAAWjD,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,EAiBqD;AAYrD,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,uBAAA,CAAwB,OAAA,EAAS,KAAK,IAAI,CAAA;AAC1C,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;AASA,IAAA,MAAM,8BAAA,CAA+B,IAAA,CAAK,QAAA,EAAU,MAAM,CAAA;AAC1D,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,CAACkB,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,EACqD;AACrD,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,EACqD;AACrD,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,YAAA;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,EAcA,MAAM,yBACJ,OAAA,EACmC;AACnC,IAAA,MAAM,EAAE,SAAA,EAAU,GAAI,MAAM,IAAA,CAAK,cAAc,aAAa,CAAA;AAC5D,IAAA,OAAO,wBAAA;AAAA,MACL;AAAA,QACE,SAAS,IAAA,CAAK,YAAA;AAAA,QACd,SAAS,IAAA,CAAK,OAAA;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,YAAA;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;AAWA,IAAA,KAAA,MAAW,GAAA,IAAO,QAAA,CAAS,gBAAA,CAAiB,IAAI,CAAA,EAAG;AACjD,MAAA,MAAM,OAAA,CAAQ,WAAW,GAAG,CAAA;AAAA,IAC9B;AACA,IAAA,IAAI,OAAA,CAAQ,iCAAiC,MAAA,EAAW;AACtD,MAAA,KAAA,MAAW,YAAA,IAAgB,QAAA,CAAS,WAAA,CAAY,IAAI,CAAA,EAAG;AACrD,QAAA,KAAA,MAAW,GAAA,IAAO,aAAa,SAAA,EAAW;AACxC,UAAA,MAAM,OAAA,CAAQ,WAAW,GAAG,CAAA;AAAA,QAC9B;AAAA,MACF;AAAA,IACF,CAAA,MAAO;AACL,MAAA,MAAM,QAAQ,4BAAA,CAA6B,IAAA,EAAM,EAAE,KAAA,EAAO,MAAM,CAAA;AAAA,IAClE;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,EAIqD;AACrD,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,uBAAA,CAAwB,OAAA,EAAS,KAAK,IAAI,CAAA;AAC1C,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;AAAA,QACE,SAAS,IAAA,CAAK,OAAA;AAAA,QACd,SAAS,IAAA,CAAK,YAAA;AAAA,QACd,yBAAyB,IAAA,CAAK,eAAA;AAAA,QAC9B,GAAI,IAAA,CAAK,eAAA,IAAmB,EAAE,cAAA,EAAgB,IAAA,CAAK,YAAW;AAAE,OAClE;AAAA,MACA,WAAW;AAAC,KACd;AAAA,EACF;AAAA,EAEA,MAAM,sBAAA,CACJ,SAAA,EACA,KAAA,EACA,OAAA,EACqD;AACrD,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,uBAAA,CAAwB,OAAA,EAAS,KAAK,IAAI,CAAA;AAC1C,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,MAAM6B,SACJ7B,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,QAAO6B,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,CAAC7B,MAAAA,EAAO6B,MAAK,CAAA,IAAK,OAAA,EAAS;AACpC,MAAA,IAAIA,MAAAA,GAAQ,CAAA,EAAG,QAAA,CAAS,GAAA,CAAI7B,MAAK,CAAA;AAAA,IACnC;AACA,IAAA,OAAO,QAAA;AAAA,EACT;AAAA,EAEA,eAAA,CACE,KAAA,EACA,GAAA,EACA,cAAA,GAAsC,KAAK,eAAA,EACC;AAC5C,IAAA,MAAM,IAAA,GACJ,IAAA,CAAK,eAAA,KAAoB,MAAA,GACvB,IAAI,oBAAA;AAAA,MACF,KAAA;AAAA,MACA,IAAA,CAAK,YAAA;AAAA,MACL,IAAA,CAAK,QAAA;AAAA,MACL;AAAA,QAEF,IAAI,0BAAA;AAAA,MACF,KAAA;AAAA,MACA,IAAA,CAAK,eAAA;AAAA,MACL,IAAA,CAAK,QAAA;AAAA,MACL;AAAA,KACF;AACJ,IAAA,uBAAA,CAAwB,KAAK,IAAI,CAAA;AACjC,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,oBAAA,GAA4C;AAC1C,IAAA,OAAO,CAAI,GAAA,EAA2B,EAAA,KACpC,IAAA,CAAK,mBAAA,CAAoB,KAAK,EAAE,CAAA;AAAA,EACpC;AAAA,EAEA,2BAAA,CACE,QAAA,GAAgC,IAAA,CAAK,oBAAA,EAAqB,EACjC;AACzB,IAAA,OAAO;AAAA,MACL,OAAO,IAAA,CAAK,MAAA;AAAA,MACZ,SAAS,IAAA,CAAK,OAAA;AAAA,MACd,gBAAgB,IAAA,CAAK,eAAA;AAAA,MACrB,yBAAyB,IAAA,CAAK,wBAAA;AAAA,MAC9B,cAAA,EAAgB,KAAK,UAAA,EAAW;AAAA,MAChC,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,kBAAA,EAAoB;AAAA,KACtB;AAAA,EACF;AAAA,EAEA,2BAAA,CACE,QAAA,GAAgC,IAAA,CAAK,oBAAA,EAAqB,EACjC;AACzB,IAAA,OAAO;AAAA,MACL,OAAO,IAAA,CAAK,MAAA;AAAA,MACZ,SAAS,IAAA,CAAK,OAAA;AAAA,MACd,gBAAgB,IAAA,CAAK,eAAA;AAAA,MACrB,yBAAyB,IAAA,CAAK,wBAAA;AAAA,MAC9B,cAAA,EAAgB,KAAK,UAAA,EAAW;AAAA,MAChC,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,kBAAA,EAAoB;AAAA,KACtB;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,GAAU,GAAA,EAAK,OAAA,CAAQ,KAAK,CAAC,CAAA;AACzC,MAAA,MAAM,KAAA;AAAA,IACR;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,0BACE,OAAA,EACqB;AACrB,IAAA,OAAO,OACL,KACA,EAAA,KACe;AACf,MAAA,IAAA,CAAK,MAAA,CAAO,mBAAmB,GAAG,CAAA;AAClC,MAAA,MAAM,SAAA,GAAY,KAAK,GAAA,EAAI;AAC3B,MAAA,IAAI;AACF,QAAA,MAAM,MAAA,GAAS,MAAM,EAAA,EAAG;AACxB,QAAA,OAAA,CAAQ,IAAA,CAAK,EAAE,GAAA,EAAK,UAAA,EAAY,KAAK,GAAA,EAAI,GAAI,WAAW,CAAA;AACxD,QAAA,OAAO,MAAA;AAAA,MACT,SAAS,KAAA,EAAO;AACd,QAAA,IAAA,CAAK,MAAA,CAAO,OAAA,GAAU,GAAA,EAAK,OAAA,CAAQ,KAAK,CAAC,CAAA;AACzC,QAAA,MAAM,KAAA;AAAA,MACR;AAAA,IACF,CAAA;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,EACyC;AACzC,IAAA,OAAO,0BAAA;AAAA,MACL,IAAA,CAAK,OAAA;AAAA,MACL,IAAA,CAAK,SAAA;AAAA,MACL;AAAA;AAAA;AAAA,QAGE,OAAA;AAAA,QACA,SAAS,OAAA,CAAQ,OAAA;AAAA,QACjB,2BAA2B,IAAA,CAAK,0BAAA;AAAA,QAChC,GAAI,IAAA,CAAK,OAAA,KAAY,UAAa,EAAE,MAAA,EAAQ,KAAK,OAAA,EAAQ;AAAA,QACzD,GAAI,IAAA,CAAK,oBAAA,KAAyB,MAAA,IAAa;AAAA,UAC7C,qBAAqB,IAAA,CAAK;AAAA,SAC5B;AAAA,QACA,GAAI,gBAAA,KAAqB,MAAA,IAAa,EAAE,gBAAA;AAAiB;AAC3D,KACF;AAAA,EACF;AACF,CAAA;AAGA,IAAM,0BAAA,GAAN,cAGU,mBAAA,CAA2C;AAAA,EAC1C,OAAA;AAAA,EAET,WAAA,CACE,KAAA,EACA,OAAA,EACA,OAAA,EACA,cAAA,EACA;AACA,IAAA,KAAA,CAAM,KAAA,EAAO,OAAA,EAAS,OAAA,EAAS,cAAA,EAAgB,OAAO,CAAA;AAGtD,IAAA,IAAA,CAAK,OAAA,GACH,OAAA,EAAS,OAAA,KAAY,IAAA,GACnB,mCAAA,CAAoC,KAAK,aAAa,CAAA,CAAE,OAAO,CAAA,GAC/D,MAAA,CAAO,MAAA;AAAA,MACL,4BAAA,CAA6B,IAAA,CAAK,aAAa,CAAA,CAAE,OAAO;AAAA,KAC1D;AAAA,EACN;AAAA,EAEA,MAAe,MAAA,CACb,SAAA,EACA,OAAA,EAI4D;AAC5D,IAAA,OAAO,IAAA,CAAK,uBAAA;AAAA,MAAwB,OAAA,EAAS,GAAA;AAAA,MAAK,CAAC,mBACjD,KAAA,CAAM,MAAA;AAAA,QACJ,SAAA;AAAA,QACA,OAAA,EAAS,KAAA,KAAU,MAAA,GACjB,EAAE,GAAA,EAAK,cAAA,EAAe,GACtB,EAAE,KAAA,EAAO,OAAA,CAAQ,KAAA,EAAO,GAAA,EAAK,cAAA;AAAe;AAChD,KACF;AAAA,EACF;AAAA,EAEA,MAAe,cAAA,CACb,KAAA,EACA,OAAA,EAG4D;AAC5D,IAAA,OAAO,IAAA,CAAK,uBAAA;AAAA,MAAwB,OAAA,EAAS,GAAA;AAAA,MAAK,CAAC,mBACjD,KAAA,CAAM,cAAA,CAAe,OAAO,EAAE,GAAA,EAAK,gBAAgB;AAAA,KACrD;AAAA,EACF;AAAA,EAEA,MAAe,gBAAA,CACb,KAAA,EACA,OAAA,EAG4D;AAC5D,IAAA,OAAO,IAAA,CAAK,uBAAA;AAAA,MAAwB,OAAA,EAAS,GAAA;AAAA,MAAK,CAAC,mBACjD,KAAA,CAAM,gBAAA,CAAiB,OAAO,EAAE,GAAA,EAAK,gBAAgB;AAAA,KACvD;AAAA,EACF;AAAA,EAEA,MAAe,WAAA,CACb,KAAA,EACA,OAAA,EAI4D;AAC5D,IAAA,OAAO,IAAA,CAAK,uBAAA;AAAA,MAAwB,OAAA,EAAS,GAAA;AAAA,MAAK,CAAC,mBACjD,KAAA,CAAM,WAAA;AAAA,QACJ,KAAA;AAAA,QACA,OAAA,EAAS,KAAA,KAAU,MAAA,GACjB,EAAE,GAAA,EAAK,cAAA,EAAe,GACtB,EAAE,KAAA,EAAO,OAAA,CAAQ,KAAA,EAAO,GAAA,EAAK,cAAA;AAAe;AAChD,KACF;AAAA,EACF;AAAA,EAEA,MAAM,uBAAA,CACJ,GAAA,EACA,SAAA,EAC4D;AAC5D,IAAA,MAAM,OAAA,GAAU,4BAA+B,IAAI,CAAA;AACnD,IAAA,IAAI;AACF,MAAA,MAAM,SAAA,CAAU,QAAQ,GAAG,CAAA;AAAA,IAC7B,SAAS,KAAA,EAAO;AACd,MAAA,IAAI,OAAA,CAAQ,aAAY,EAAG;AACzB,QAAA,MAAMgC,YAAAA,GAAc,iCAAA,CAGlB,OAAA,CAAQ,GAAA,CAAI,OAAO,CAAA;AACrB,QAAA,yBAAA,CAA0B,KAAKA,YAAW,CAAA;AAAA,MAC5C;AACA,MAAA,MAAM,KAAA;AAAA,IACR;AACA,IAAA,MAAM,WAAA,GAAc,iCAAA,CAGlB,OAAA,CAAQ,GAAA,CAAI,OAAO,CAAA;AACrB,IAAA,yBAAA,CAA0B,KAAK,WAAW,CAAA;AAC1C,IAAA,OAAO,WAAA;AAAA,EACT;AACF,CAAA;AAEA,SAAS,4BACP,OAAA,EAIC;AACD,EAAA,IAAI,OAAA,GAAU,OAAA;AACd,EAAA,IAAI,QAAA,GAAW,KAAA;AACf,EAAA,OAAO;AAAA,IACL,GAAA,EAAK;AAAA,MACH,IAAI,OAAA,GAAoB;AACtB,QAAA,OAAO,OAAA;AAAA,MACT,CAAA;AAAA,MACA,IAAI,QAAQ,IAAA,EAAgB;AAC1B,QAAA,OAAA,GAAU,IAAA;AACV,QAAA,QAAA,GAAW,IAAA;AAAA,MACb;AAAA,KACF;AAAA,IACA,aAAa,MAAM;AAAA,GACrB;AACF;AAEA,SAAS,yBAAA,CAKP,KACA,WAAA,EACM;AACN,EAAA,IAAI,QAAQ,MAAA,EAAW;AAIvB,EAAA,GAAA,CAAI,OAAA,GAAU,WAAA;AAChB;AAEA,SAAS,kCAGP,KAAA,EAAoE;AACpE,EAAA,IAAI,4BAAA,CAAoD,KAAK,CAAA,EAAG,OAAO,KAAA;AACvE,EAAA,MAAM,IAAI,kBAAA;AAAA,IACR,0DAAA;AAAA,IACA,EAAE,MAAM,qCAAA;AAAsC,GAChD;AACF;AAEA,SAAS,6BACP,KAAA,EAC4D;AAC5D,EAAA,OAAO,KAAA,YAAiB,0BAAA;AAC1B;AAEA,SAAS,sBACP,KAAA,EAIkD;AAIlD,EAAA,OAAO,KAAA;AAIT;AAqJO,SAAS,WAAA,CACd,KAAA,EACA,OAAA,EACA,OAAA,EACmD;AACnD,EAAA,OAAO,IAAI,mBAAA,CAAuB,KAAA,EAAO,OAAA,EAAS,OAAO,CAAA;AAC3D;AAgCO,SAAS,kBAAA,CACd,KAAA,EACA,OAAA,EACA,OAAA,EAIkD;AAClD,EAAA,OAAO,qBAAA;AAAA,IACL,IAAI,0BAAA,CAA2B,KAAA,EAAO,OAAA,EAAS,OAAO;AAAA,GACxD;AACF;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;AAqBA,eAAe,8BAAA,CACb,SACA,KAAA,EACe;AACf,EAAA,IAAI,OAAA,CAAQ,YAAA,CAAa,MAAA,EAAQ,SAAA,KAAc,IAAA,EAAM;AACrD,EAAA,MAAM,KAAA,GAAQ,wBAAwB,KAAK,CAAA;AAC3C,EAAA,MAAM,gCAAgC,OAAA,CAAQ,6BAAA;AAC9C,EAAA,IAAI,kCAAkC,MAAA,EAAW;AAC/C,IAAA,MAAM,6BAAA,CAA8B,KAAA,EAAO,EAAE,OAAA,EAAS,QAAQ,CAAA;AAC9D,IAAA;AAAA,EACF;AACA,EAAA,MAAM,+BAA+B,OAAA,CAAQ,4BAAA;AAC7C,EAAA,IAAI,iCAAiC,MAAA,EAAW;AAChD,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,4BAAA,CAA6B,IAAA,EAAM,EAAE,OAAA,EAAS,QAAQ,CAAA;AAAA,EAC9D;AACF;AAmEA,eAAsB,qBAAA,CACpB,KAAA,EACA,OAAA,EACA,OAAA,EAGA;AACA,EAAA,MAAM,QAAA,GAAW,MAAM,sBAAA,CAAuB,KAAA,EAAO,SAAS,OAAO,CAAA;AACrE,EAAA,OAAO;AAAA,IACL,IAAI,mBAAA;AAAA,MACF,QAAA,CAAS,KAAA;AAAA,MACT,OAAA;AAAA,MACA,OAAA;AAAA,MACA,QAAA,CAAS;AAAA,KACX;AAAA,IACA,QAAA,CAAS;AAAA,GACX;AACF;AAQA,eAAe,sBAAA,CACb,KAAA,EACA,OAAA,EACA,OAAA,EAC2B;AAO3B,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;AAIxD,EAAA,MAAM,8BAAA,CAA+B,SAAS,MAAM,CAAA;AAOpD,EAAA,IAAI,OAAA,EAAS,kBAAkB,MAAA,EAAQ;AACrC,IAAA,MAAM,8BAAA,CAA+B,OAAA,EAAS,MAAA,CAAO,EAAA,EAAI,MAAM,CAAA;AAAA,EACjE;AAEA,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,MAAA;AAAA,IACP,MAAA;AAAA,IACA,cAAA,EAAgB,uBAAA,CAAwB,SAAA,EAAW,MAAM;AAAA,GAC3D;AACF;AA+DA,eAAsB,4BAAA,CAIpB,KAAA,EACA,OAAA,EACA,OAAA,EAUA;AACA,EAAA,MAAM,QAAA,GAAW,MAAM,sBAAA,CAAuB,KAAA,EAAO,SAAS,OAAO,CAAA;AACrE,EAAA,OAAO;AAAA,IACL,qBAAA;AAAA,MACE,IAAI,0BAAA;AAAA,QACF,QAAA,CAAS,KAAA;AAAA,QACT,OAAA;AAAA,QACA,OAAA;AAAA,QACA,QAAA,CAAS;AAAA;AACX,KACF;AAAA,IACA,QAAA,CAAS;AAAA,GACX;AACF;AAcA,eAAe,8BAAA,CACb,OAAA,EACA,OAAA,EACA,MAAA,EACe;AACf,EAAA,IAAI,MAAA,CAAO,WAAW,UAAA,EAAY;AAClC,EAAA,IAAI,CAAC,mCAAA,CAAoC,OAAO,CAAA,EAAG;AACnD,EAAA,MAAM,gBACJ,MAAA,CAAO,MAAA,KAAW,UAAA,GAAa,MAAA,CAAO,YAAY,MAAA,CAAO,OAAA;AAC3D,EAAA,IAAI;AACF,IAAA,MAAM,EAAE,OAAA,EAAQ,GAAI,MAAM,wBAAA;AAAA,MACxB,EAAE,OAAA,EAAS,YAAA,CAAa,OAAO,CAAA,EAAG,SAAS,aAAA,EAAc;AAAA,MACzD;AAAC,KACH;AACA,IAAA,MAAM,SAAS,OAAA,CAAQ,MAAA;AAAA,MACrB,CAAC,WAAA,KAAgB,WAAA,CAAY,MAAA,KAAW;AAAA,KAC1C;AACA,IAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AACzB,IAAA,OAAA,CAAQ,IAAA;AAAA,MACN,CAAA,YAAA,EAAe,MAAA,CAAO,MAAA,CAAO,MAAM,CAAC,CAAA,iDAAA,EACV,MAAA,CACrB,GAAA,CAAI,CAAC,gBAAgB,WAAA,CAAY,SAAS,CAAA,CAC1C,IAAA,CAAK,IAAI,CAAC,CAAA,oHAAA,CAAA;AAAA,MAEf,MAAA,CAAO,CAAC,CAAA,EAAG;AAAA,KACb;AAAA,EACF,SAAS,KAAA,EAAO;AAKd,IAAA,OAAA,CAAQ,IAAA;AAAA,MACN,mKAAA;AAAA,MAGA;AAAA,KACF;AAAA,EACF;AACF;AAsEA,eAAsB,mBAAA,CACpB,KAAA,EACA,OAAA,EACA,OAAA,EAGA;AACA,EAAA,MAAM,QAAA,GAAW,MAAM,oBAAA,CAAqB,KAAA,EAAO,OAAO,CAAA;AAC1D,EAAA,OAAO;AAAA,IACL,IAAI,mBAAA;AAAA,MACF,QAAA,CAAS,KAAA;AAAA,MACT,OAAA;AAAA,MACA,OAAA;AAAA,MACA,QAAA,CAAS;AAAA,KACX;AAAA,IACA,QAAA,CAAS;AAAA,GACX;AACF;AAEA,eAAe,oBAAA,CACb,OACA,OAAA,EAC2B;AAC3B,EAAA,MAAM;AAAA,IACJ,KAAA,EAAO,MAAA;AAAA,IACP,SAAA;AAAA,IACA;AAAA,GACF,GAAI,MAAM,kBAAA,CAAmB,OAAA,EAAS,KAAK,CAAA;AAC3C,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,MAAA;AAAA,IACP,MAAA;AAAA,IACA,cAAA,EAAgB,sBAAsB,SAAS;AAAA,GACjD;AACF;AA+DA,eAAsB,0BAAA,CAIpB,KAAA,EACA,OAAA,EACA,OAAA,EAUA;AACA,EAAA,MAAM,QAAA,GAAW,MAAM,oBAAA,CAAqB,KAAA,EAAO,OAAO,CAAA;AAC1D,EAAA,OAAO;AAAA,IACL,qBAAA;AAAA,MACE,IAAI,0BAAA;AAAA,QACF,QAAA,CAAS,KAAA;AAAA,QACT,OAAA;AAAA,QACA,OAAA;AAAA,QACA,QAAA,CAAS;AAAA;AACX,KACF;AAAA,IACA,QAAA,CAAS;AAAA,GACX;AACF","file":"chunk-CBK2IVI2.js","sourcesContent":["import { type AnyEdgeType, type NodeType } from \"../core/types\";\nimport type {\n  EdgeCollection,\n  NodeCollection,\n  StoreViewEdgeCollection,\n  StoreViewNodeCollection,\n} from \"./types\";\n\n/**\n * StoreView collection surface buckets.\n *\n * The live NodeCollection / EdgeCollection partition into buckets a StoreView\n * treats differently:\n *\n * - temporal reads honor the pinned coordinate;\n * - current reads have no temporal axis and are refused on temporal pins;\n * - writes are never available on a read-only view; and\n * - batch reads require store.batch() and are absent from a view.\n *\n * These arrays are the single runtime source of truth for the proxy routing and\n * the type-level source for the derived StoreView collection types. The\n * StoreView surface-classification test asserts they exactly partition the live\n * collection methods so new collection methods cannot be silently omitted.\n */\n\n/** Temporal-aware node read method names. */\nexport const NODE_TEMPORAL_READ_NAMES = [\n  \"getById\",\n  \"getByIds\",\n  \"find\",\n  \"count\",\n] as const satisfies readonly (keyof NodeCollection<NodeType, string>)[];\n\n/** Current-state-only node reads (constraint / index lookups). */\nexport const CURRENT_ONLY_READ_NAMES = [\n  \"findByConstraint\",\n  \"bulkFindByConstraint\",\n  \"bulkFindByIndex\",\n] as const satisfies readonly (keyof NodeCollection<NodeType, string>)[];\n\n/** Node write method names: never available on a read-only StoreView. */\nexport const NODE_WRITE_NAMES = [\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] as const satisfies readonly (keyof NodeCollection<NodeType, string>)[];\n\n/** Temporal-aware edge read method names. */\nexport const EDGE_TEMPORAL_READ_NAMES = [\n  \"getById\",\n  \"getByIds\",\n  \"find\",\n  \"count\",\n  \"findFrom\",\n  \"findTo\",\n  \"findByEndpoints\",\n] as const satisfies readonly (keyof EdgeCollection<\n  AnyEdgeType,\n  NodeType,\n  NodeType\n>)[];\n\n/** Deferred edge batch-read method names. */\nexport const EDGE_BATCH_READ_NAMES = [\n  \"batchFindFrom\",\n  \"batchFindTo\",\n  \"batchFindByEndpoints\",\n] as const satisfies readonly (keyof EdgeCollection<\n  AnyEdgeType,\n  NodeType,\n  NodeType\n>)[];\n\n/** Edge write method names: never available on a read-only StoreView. */\nexport const EDGE_WRITE_NAMES = [\n  \"create\",\n  \"update\",\n  \"delete\",\n  \"hardDelete\",\n  \"bulkCreate\",\n  \"bulkUpsertById\",\n  \"bulkInsert\",\n  \"bulkDelete\",\n  \"getOrCreateByEndpoints\",\n  \"bulkGetOrCreateByEndpoints\",\n] as const satisfies readonly (keyof EdgeCollection<\n  AnyEdgeType,\n  NodeType,\n  NodeType\n>)[];\n\n/** Recorded-time collection point reads that reconstruct safely by id. */\nexport const RECORDED_POINT_READ_NAMES = [\n  \"getById\",\n  \"getByIds\",\n] as const satisfies readonly (keyof StoreViewNodeCollection<NodeType> &\n  keyof StoreViewEdgeCollection<AnyEdgeType, NodeType, NodeType>)[];\n","import { ConfigurationError } from \"../errors\";\n\ntype RecordedCoordinateGuardOptions = Readonly<{\n  code: string;\n  message: string;\n  context?: Readonly<Record<string, unknown>>;\n  suggestion?: string;\n}>;\n\ntype RecordedCoordinateOptions = Readonly<{ recordedAsOf?: unknown }>;\n\nfunction hasOwnRecordedAsOf(\n  options: unknown,\n): options is RecordedCoordinateOptions {\n  return (\n    typeof options === \"object\" &&\n    options !== null &&\n    Object.hasOwn(options, \"recordedAsOf\")\n  );\n}\n\nfunction ownRecordedAsOf(options: unknown): unknown {\n  return hasOwnRecordedAsOf(options) ? options.recordedAsOf : undefined;\n}\n\nexport function assertNoRecordedCoordinate(\n  options: unknown,\n  guard: RecordedCoordinateGuardOptions,\n): void {\n  const recordedAsOf = ownRecordedAsOf(options);\n  if (recordedAsOf === undefined) return;\n\n  throw new ConfigurationError(\n    guard.message,\n    {\n      ...guard.context,\n      code: guard.code,\n      recordedAsOf,\n    },\n    guard.suggestion === undefined ?\n      undefined\n    : { suggestion: guard.suggestion },\n  );\n}\n","/**\n * Shared temporal read-parameter resolution for collection reads.\n */\nimport {\n  type ReadCoordinate,\n  type RecordedInstant,\n  resolveReadCoordinate,\n} from \"../../core/temporal\";\nimport { type TemporalMode } from \"../../core/types\";\nimport { nowIso } from \"../../utils/date\";\nimport { assertNoRecordedCoordinate } from \"../recorded-coordinate-guard\";\nimport { type QueryOptions } from \"../types\";\n\ntype ValidReadParams = Omit<QueryOptions, \"recordedAsOf\">;\n\nexport type InternalReadParams = ValidReadParams &\n  Readonly<{ recordedAsOf?: RecordedInstant }>;\n\nfunction validReadParams(coordinate: ReadCoordinate): ValidReadParams {\n  const { mode, asOf } = coordinate.valid;\n  return asOf === undefined ?\n      { temporalMode: mode }\n    : { temporalMode: mode, asOf };\n}\n\nexport function withValidCoordinate(coordinate: ReadCoordinate): QueryOptions {\n  assertNoRecordedCoordinate(\n    coordinate.recorded === undefined ?\n      undefined\n    : { recordedAsOf: coordinate.recorded.asOf },\n    {\n      code: \"RECORDED_COLLECTION_READ_UNSUPPORTED\",\n      message:\n        \"Collection reads on StoreView cannot carry recorded-time coordinates.\",\n    },\n  );\n  return validReadParams(coordinate);\n}\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): InternalReadParams {\n  const valid = validReadParams(coordinate);\n  return coordinate.recorded === undefined ?\n      valid\n    : { ...valid, recordedAsOf: coordinate.recorded.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: InternalReadParams | undefined,\n  defaultTemporalMode: TemporalMode,\n): TemporalReadParams {\n  assertNoRecordedCoordinate(options, {\n    code: \"RECORDED_COLLECTION_READ_UNSUPPORTED\",\n    message: \"Broad collection reads cannot honor recorded-time coordinates.\",\n    suggestion:\n      \"Use store.asOfRecorded(...).nodes.Kind.getById/getByIds for point reads, or query() for recorded-time scans.\",\n  });\n\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 {\n      ...base,\n      asOf: asOf ?? nowIso(),\n    };\n  }\n  return base;\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  type RecordedInstant,\n  resolveReadCoordinate,\n  withRecordedCoordinate,\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 InitialQueryBuilder } from \"../query/builder\";\nimport { requireDefined } from \"../utils/presence\";\nimport {\n  type BaseTraversalOptions,\n  type DegreeOptions,\n  type InternalGraphAlgorithms,\n  type LabelPropagationMembership,\n  type LabelPropagationOptions,\n  type NeighborsOptions,\n  type NodeIdentifier,\n  type PageRankOptions,\n  type PageRankScore,\n  type PersonalizedPageRankOptions,\n  type ReachableNode,\n  type ReachableOptions,\n  type ShortestPathOptions,\n  type ShortestPathResult,\n  type TemporalAlgorithmOptions,\n  type WeaklyConnectedComponentMembership,\n  type WeaklyConnectedComponentsOptions,\n  type WeightedShortestPathOptions,\n  type WeightedShortestPathResult,\n} from \"./algorithms\";\nimport {\n  CURRENT_ONLY_READ_NAMES,\n  EDGE_BATCH_READ_NAMES,\n  type EDGE_TEMPORAL_READ_NAMES,\n  type NODE_TEMPORAL_READ_NAMES,\n  type RECORDED_POINT_READ_NAMES,\n} from \"./collection-surface\";\nimport {\n  withCoordinate,\n  withValidCoordinate,\n} from \"./collections/temporal-read-params\";\nimport { storeRuntime } from \"./runtime-port\";\nimport { type StoreSearch } from \"./search-facade\";\nimport { type Store } from \"./store\";\nimport {\n  type InternalSubgraphOptions,\n  type SubgraphOptions,\n  type SubgraphProject,\n  type SubgraphResult,\n} from \"./subgraph\";\nimport {\n  type EdgeCollection,\n  type NodeCollection,\n  type NodeCurrentReads,\n  type RecordedStoreViewEdgeCollection,\n  type RecordedStoreViewEdgeCollections,\n  type RecordedStoreViewNodeCollection,\n  type RecordedStoreViewNodeCollections,\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<\n  SubgraphOptions<G, EK, NK, P>,\n  \"temporalMode\" | \"asOf\" | \"recordedAsOf\"\n>;\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/**\n * `weightedShortestPath` options with the temporal axis removed (the pin\n * supplies it).\n */\nexport type StoreViewWeightedShortestPathOptions<G extends GraphDef> = Omit<\n  WeightedShortestPathOptions<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/** WCC options with the temporal axis removed (the view's pin supplies it). */\nexport type StoreViewWeaklyConnectedComponentsOptions<G extends GraphDef> =\n  Omit<WeaklyConnectedComponentsOptions<G>, keyof TemporalAlgorithmOptions>;\n\n/** Label-propagation options pinned to the view's temporal coordinate. */\nexport type StoreViewLabelPropagationOptions<G extends GraphDef> = Omit<\n  LabelPropagationOptions<G>,\n  keyof TemporalAlgorithmOptions\n>;\n\n/** PageRank options with the temporal axis removed (the view supplies it). */\nexport type StoreViewPageRankOptions<G extends GraphDef> = Omit<\n  PageRankOptions<G>,\n  keyof TemporalAlgorithmOptions\n>;\n\n/** Personalized PageRank options pinned to the view's temporal coordinate. */\nexport type StoreViewPersonalizedPageRankOptions<G extends GraphDef> = Omit<\n  PersonalizedPageRankOptions<G>,\n  keyof TemporalAlgorithmOptions\n>;\n\n/** Graph-algorithm facade sealed to a {@link StoreView}'s coordinate. */\nexport type StoreViewGraphAlgorithms<G extends GraphDef> = Readonly<{\n  shortestPath: (\n    from: NodeIdentifier,\n    to: NodeIdentifier,\n    options: StoreViewShortestPathOptions<G>,\n  ) => Promise<ShortestPathResult | undefined>;\n  weightedShortestPath: (\n    from: NodeIdentifier,\n    to: NodeIdentifier,\n    options: StoreViewWeightedShortestPathOptions<G>,\n  ) => Promise<WeightedShortestPathResult | undefined>;\n  reachable: (\n    from: NodeIdentifier,\n    options: StoreViewReachableOptions<G>,\n  ) => Promise<readonly ReachableNode[]>;\n  canReach: (\n    from: NodeIdentifier,\n    to: NodeIdentifier,\n    options: StoreViewCanReachOptions<G>,\n  ) => Promise<boolean>;\n  neighbors: (\n    node: NodeIdentifier,\n    options: StoreViewNeighborsOptions<G>,\n  ) => Promise<readonly ReachableNode[]>;\n  degree: (\n    node: NodeIdentifier,\n    options?: StoreViewDegreeOptions<G>,\n  ) => Promise<number>;\n  labelPropagation: (\n    options: StoreViewLabelPropagationOptions<G>,\n  ) => Promise<readonly LabelPropagationMembership[]>;\n  weaklyConnectedComponents: (\n    options: StoreViewWeaklyConnectedComponentsOptions<G>,\n  ) => Promise<readonly WeaklyConnectedComponentMembership[]>;\n  pageRank: (\n    options: StoreViewPageRankOptions<G>,\n  ) => Promise<readonly PageRankScore[]>;\n  personalizedPageRank: (\n    options: StoreViewPersonalizedPageRankOptions<G>,\n  ) => Promise<readonly PageRankScore[]>;\n}>;\n\nfunction isReadCoordinate(\n  coordinate: StoreViewCoordinate | ReadCoordinate,\n): coordinate is ReadCoordinate {\n  return \"valid\" in coordinate;\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 * Returns a function that refuses a deferred edge batch read\n * ({@link EDGE_BATCH_READ_NAMES}) on a read-only view. These reads are *reads*,\n * not writes, but they resolve through `store.batch(...)` — a DataLoader context\n * a view does not expose — so the view cannot honor them. The refusal is\n * synchronous because the live method returns a `BatchableQuery` synchronously\n * (it is invoked, not awaited), so a misuse fail-louds at the call site instead\n * of being routed through the write-refusal fallthrough and mislabeled a write.\n */\nfunction createBatchReadRefusal(\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        `Batch endpoint reads resolve through store.batch(...), which a view does not expose — ` +\n        `use the live Store's batch loader, or the view's findFrom / findTo / findByEndpoints for single reads.`,\n      {\n        code: \"STORE_VIEW_BATCH_UNAVAILABLE\",\n        entity,\n        method,\n        ...coordinateContext(coordinate),\n      },\n    );\n  };\n}\n\nfunction createRecordedUnsupportedRefusal(\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 RecordedStoreView (${describeCoordinate(coordinate)}). ` +\n          `Recorded-time reads are reconstructing reads; this view exposes only query, ` +\n          `subgraph, graph algorithms, and collection getById/getByIds/scan reads.`,\n        {\n          code: \"RECORDED_STORE_VIEW_UNSUPPORTED\",\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 * Deferred edge batch reads ({@link EDGE_BATCH_READ_NAMES}): refused on every\n * view (current or temporal) because they resolve through `store.batch(...)`,\n * which a view does not expose. Routed to {@link createBatchReadRefusal} so they\n * are categorized as reads rather than misrouted through the write fallthrough.\n */\nconst EDGE_BATCH_READS: ReadonlySet<string> = new Set(EDGE_BATCH_READ_NAMES);\n\n/**\n * Wraps a `reads` object so its supported reads pass through while any other\n * method that exists on the live collection is handled by `resolveLiveOnly` —\n * the one piece that differs between the read-only (valid-time) and recorded\n * facades. The frozen target and the rejecting `set` / `defineProperty` /\n * `deleteProperty` traps make the view read-only by construction at runtime, and\n * `Object.hasOwn` — not `in` — lets inherited `Object.prototype` members\n * (`toString`, `valueOf`, …) pass straight through so coercion / logging works.\n */\nfunction collectionReadProxy<T extends object>(\n  reads: T,\n  live: object,\n  resolveLiveOnly: (property: string) => unknown,\n): T {\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        return resolveLiveOnly(property);\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\n/**\n * Read-only valid-time collection facade. Writes refuse synchronously\n * ({@link createReadOnlyRefusal}); current-state-only reads refuse via Promise\n * rejection on a temporal pin but are delegated to the live collection on a\n * `current` view ({@link CURRENT_ONLY_READS}).\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  return collectionReadProxy(reads, live, (property) => {\n    if (CURRENT_ONLY_READS.has(property)) {\n      return isCurrent ?\n          (live as Record<string, unknown>)[property]\n        : createCurrentOnlyRefusal(entity, property, coordinate);\n    }\n    if (EDGE_BATCH_READS.has(property)) {\n      return createBatchReadRefusal(entity, property, coordinate);\n    }\n    return createReadOnlyRefusal(entity, property, coordinate);\n  });\n}\n\n/**\n * Recorded-time collection facade: any live-collection method that is not a\n * supported reconstructing read refuses uniformly.\n */\nfunction recordedCollectionProxy<T extends object>(\n  reads: T,\n  live: object,\n  coordinate: ReadCoordinate,\n  entity: \"node\" | \"edge\",\n): T {\n  return collectionReadProxy(reads, live, (property) => {\n    if (EDGE_BATCH_READS.has(property)) {\n      return createBatchReadRefusal(entity, property, coordinate);\n    }\n    return createRecordedUnsupportedRefusal(entity, property, coordinate);\n  });\n}\n\nfunction pinnedNodeCollection(\n  live: NodeCollection<NodeType, string>,\n  coordinate: ReadCoordinate,\n): StoreViewNodeCollection<NodeType> {\n  const temporal = withValidCoordinate(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    Readonly<{\n      [\n        Method in (typeof NODE_TEMPORAL_READ_NAMES)[number]\n      ]: StoreViewNodeCollection<NodeType>[Method];\n    }> = {\n    getById: (id) => live.getById(id, temporal),\n    getByIds: (ids) => live.getByIds(ids, temporal),\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 = withValidCoordinate(coordinate);\n  const reads: StoreViewEdgeCollection<AnyEdgeType, NodeType, NodeType> &\n    Readonly<{\n      [\n        Method in (typeof EDGE_TEMPORAL_READ_NAMES)[number]\n      ]: StoreViewEdgeCollection<AnyEdgeType, NodeType, NodeType>[Method];\n    }> = {\n    getById: (id) => live.getById(id, temporal),\n    getByIds: (ids) => live.getByIds(ids, temporal),\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 the valid-time and recorded views' `nodes` and\n * `edges`: indexing the live proxy throws `KindNotFoundError` for an unknown\n * kind, so the view refuses an unknown kind the same way the live store does —\n * while interop probes ({@link NON_KIND_KEYS}) resolve to `undefined`. `wrap`\n * receives the resolved `kind` so the recorded view can route point reads\n * through the store's recorded seams.\n */\nfunction pinnedCollections<L, W>(\n  live: object,\n  coordinate: ReadCoordinate,\n  isKind: (kind: string) => boolean,\n  wrap: (kind: string, 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, receiver) {\n        if (typeof kind !== \"string\") return;\n        if (!isKind(kind)) {\n          if (NON_KIND_KEYS.has(kind)) return;\n          if (Object.hasOwn(Object.prototype, kind)) {\n            const inheritedValue: unknown = Reflect.get(target, kind, receiver);\n            return inheritedValue;\n          }\n        }\n        const cached = cache.get(kind);\n        if (cached !== undefined) return cached;\n        const wrapped = wrap(\n          kind,\n          requireDefined((live as Record<string, L>)[kind]),\n          coordinate,\n        );\n        cache.set(kind, wrapped);\n        return wrapped;\n      },\n    },\n  );\n}\n\nfunction pinnedNodeCollectionsFor<G extends GraphDef, W>(\n  store: Store<G>,\n  coordinate: ReadCoordinate,\n  wrap: (\n    kind: string,\n    live: NodeCollection<NodeType, string>,\n    coordinate: ReadCoordinate,\n  ) => W,\n): Record<string, W> {\n  return pinnedCollections(\n    store.nodes,\n    coordinate,\n    (kind) => Object.hasOwn(store.graph.nodes, kind),\n    wrap,\n  );\n}\n\nfunction pinnedEdgeCollectionsFor<G extends GraphDef, W>(\n  store: Store<G>,\n  coordinate: ReadCoordinate,\n  wrap: (\n    kind: string,\n    live: EdgeCollection<AnyEdgeType, NodeType, NodeType>,\n    coordinate: ReadCoordinate,\n  ) => W,\n): Record<string, W> {\n  return pinnedCollections(\n    store.edges,\n    coordinate,\n    (kind) => Object.hasOwn(store.graph.edges, kind),\n    wrap,\n  );\n}\n\nfunction recordedNodeCollection<G extends GraphDef>(\n  store: Store<G>,\n  kind: string,\n  live: NodeCollection<NodeType, string>,\n  coordinate: ReadCoordinate,\n): RecordedStoreViewNodeCollection<NodeType> {\n  const reads: RecordedStoreViewNodeCollection<NodeType> &\n    Readonly<{\n      [\n        Method in (typeof RECORDED_POINT_READ_NAMES)[number]\n      ]: RecordedStoreViewNodeCollection<NodeType>[Method];\n    }> = {\n    getById: (id) =>\n      storeRuntime(store).recordedNodeGetById(kind, id, coordinate),\n    getByIds: (ids) =>\n      storeRuntime(store).recordedNodeGetByIds(kind, ids, coordinate),\n    scan: (options) =>\n      storeRuntime(store).recordedNodeScan(kind, coordinate, options),\n  };\n  return recordedCollectionProxy(reads, live, coordinate, \"node\");\n}\n\nfunction recordedEdgeCollection<G extends GraphDef>(\n  store: Store<G>,\n  kind: string,\n  live: EdgeCollection<AnyEdgeType, NodeType, NodeType>,\n  coordinate: ReadCoordinate,\n): RecordedStoreViewEdgeCollection<AnyEdgeType, NodeType, NodeType> {\n  const reads: RecordedStoreViewEdgeCollection<\n    AnyEdgeType,\n    NodeType,\n    NodeType\n  > &\n    Readonly<{\n      [\n        Method in (typeof RECORDED_POINT_READ_NAMES)[number]\n      ]: RecordedStoreViewEdgeCollection<\n        AnyEdgeType,\n        NodeType,\n        NodeType\n      >[Method];\n    }> = {\n    getById: (id) =>\n      storeRuntime(store).recordedEdgeGetById(kind, id, coordinate),\n    getByIds: (ids) =>\n      storeRuntime(store).recordedEdgeGetByIds(kind, ids, coordinate),\n    scan: (options) =>\n      storeRuntime(store).recordedEdgeScan(kind, coordinate, options),\n  };\n  return recordedCollectionProxy(reads, live, coordinate, \"edge\");\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\ntype SearchInvocation = (...args: readonly unknown[]) => unknown;\n\nfunction searchProxy<G extends GraphDef>(\n  resolve: (method: string) => SearchInvocation | undefined,\n): StoreSearch<G> {\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      return resolve(method);\n    },\n    has(target, method) {\n      if (typeof method !== \"string\") return Reflect.has(target, method);\n      if (NON_KIND_KEYS.has(method)) return false;\n      if (Object.hasOwn(Object.prototype, method)) return true;\n      return resolve(method) !== undefined;\n    },\n  });\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<string, SearchInvocation>)\n    : undefined;\n  return searchProxy<G>((method) => {\n    if (live !== undefined && READ_SEARCH_METHODS.has(method)) {\n      const liveMethod = live[method];\n      if (liveMethod !== undefined) {\n        return (...args: readonly unknown[]) =>\n          Reflect.apply(liveMethod, live, args);\n      }\n    }\n    return () => Promise.reject(searchRefusal(method, coordinate, isCurrent));\n  });\n}\n\n/**\n * Builds the error a refused {@link RecordedStoreView} search method rejects\n * with. Unlike {@link searchRefusal}, the recorded view refuses search for\n * *every* method regardless of the composed valid-time mode, so there is no\n * `current` delegating branch.\n */\nfunction recordedSearchRefusal(\n  method: string,\n  coordinate: ReadCoordinate,\n): ConfigurationError {\n  return new ConfigurationError(\n    `store.search.${method} is not available on a RecordedStoreView (${describeCoordinate(coordinate)}). ` +\n      `The fulltext / vector index reflects current state only and cannot answer a ` +\n      `recorded-time query. Run search on the live Store.`,\n    {\n      code: \"RECORDED_STORE_VIEW_SEARCH_UNSUPPORTED\",\n      method,\n      ...coordinateContext(coordinate),\n    },\n  );\n}\n\n/**\n * The recorded view's search facade: every method refuses. It never delegates\n * to the live `store.search` even when the composed valid-time mode is\n * `current` — a recorded-time read reconstructs from the history relations,\n * while the fulltext / vector index reflects current state only, so serving a\n * live hit would be a silent lie. A Proxy (not a fixed literal) so a future\n * `StoreSearch` method refuses too instead of resolving to `undefined`.\n */\nfunction recordedSearch<G extends GraphDef>(\n  coordinate: ReadCoordinate,\n): StoreSearch<G> {\n  return searchProxy<G>(\n    (method) => () => Promise.reject(recordedSearchRefusal(method, coordinate)),\n  );\n}\n\n// ============================================================\n// Coordinate-pinned view base\n// ============================================================\n\n/**\n * Shared base for the read-only views. Holds the pinned {@link ReadCoordinate}\n * and delegates the graph algorithms, `subgraph`, and `query` to the live store\n * with that coordinate flattened into each call. {@link StoreView} (valid-time)\n * and {@link RecordedStoreView} (recorded-time) extend it; only the surfaces\n * that genuinely differ — collections, search, and the coordinate-changing\n * helpers — live on the subclasses.\n */\nabstract class CoordinatePinnedView<G extends GraphDef> {\n  protected readonly store: Store<G>;\n  protected readonly coordinate: ReadCoordinate;\n  #algorithmFacade: StoreViewGraphAlgorithms<G> | undefined;\n  #internalAlgorithms: InternalGraphAlgorithms<G> | undefined;\n\n  constructor(store: Store<G>, coordinate: ReadCoordinate) {\n    this.store = store;\n    this.coordinate = coordinate;\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 valid-time `asOf` timestamp, or `undefined` for other modes. */\n  get asOf(): string | undefined {\n    return this.coordinate.valid.asOf;\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(): InitialQueryBuilder<G, \"sealed\"> {\n    return storeRuntime(this.store).sealedQuery(this.coordinate);\n  }\n\n  protected internalAlgorithms(): InternalGraphAlgorithms<G> {\n    this.#internalAlgorithms ??= storeRuntime(\n      this.store,\n    ).algorithmsAtCoordinate(this.coordinate);\n    return this.#internalAlgorithms;\n  }\n\n  /** Graph algorithms pinned to this view's immutable temporal coordinate. */\n  get algorithms(): StoreViewGraphAlgorithms<G> {\n    this.#algorithmFacade ??= Object.freeze({\n      shortestPath: (from, to, options) => this.shortestPath(from, to, options),\n      weightedShortestPath: (from, to, options) =>\n        this.weightedShortestPath(from, to, options),\n      reachable: (from, options) => this.reachable(from, options),\n      canReach: (from, to, options) => this.canReach(from, to, options),\n      neighbors: (node, options) => this.neighbors(node, options),\n      degree: (node, options) => this.degree(node, options),\n      labelPropagation: (options) => this.labelPropagation(options),\n      weaklyConnectedComponents: (options) =>\n        this.weaklyConnectedComponents(options),\n      pageRank: (options) => this.pageRank(options),\n      personalizedPageRank: (options) => this.personalizedPageRank(options),\n    });\n    return this.#algorithmFacade;\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    const internalOptions = {\n      ...options,\n      ...withCoordinate(this.coordinate),\n    } as InternalSubgraphOptions<G, EK, NK, P>;\n    return storeRuntime(this.store).subgraphAtCoordinate(\n      rootId,\n      internalOptions,\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.internalAlgorithms().shortestPath(from, to, {\n      ...options,\n      ...withCoordinate(this.coordinate),\n    });\n  }\n\n  /** Minimum-total-weight path at this view's pinned coordinate. */\n  weightedShortestPath(\n    from: NodeIdentifier,\n    to: NodeIdentifier,\n    options: StoreViewWeightedShortestPathOptions<G>,\n  ): Promise<WeightedShortestPathResult | undefined> {\n    return this.internalAlgorithms().weightedShortestPath(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.internalAlgorithms().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.internalAlgorithms().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.internalAlgorithms().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.internalAlgorithms().degree(node, {\n      ...options,\n      ...withCoordinate(this.coordinate),\n    });\n  }\n\n  /** Deterministic label-propagation memberships at this view's coordinate. */\n  labelPropagation(\n    options: StoreViewLabelPropagationOptions<G>,\n  ): Promise<readonly LabelPropagationMembership[]> {\n    return this.internalAlgorithms().labelPropagation({\n      ...options,\n      ...withCoordinate(this.coordinate),\n    });\n  }\n\n  /** Exact WCC memberships at this view's pinned coordinate. */\n  weaklyConnectedComponents(\n    options: StoreViewWeaklyConnectedComponentsOptions<G>,\n  ): Promise<readonly WeaklyConnectedComponentMembership[]> {\n    return this.internalAlgorithms().weaklyConnectedComponents({\n      ...options,\n      ...withCoordinate(this.coordinate),\n    });\n  }\n\n  /** Global PageRank scores at this view's pinned coordinate. */\n  pageRank(\n    options: StoreViewPageRankOptions<G>,\n  ): Promise<readonly PageRankScore[]> {\n    return this.internalAlgorithms().pageRank({\n      ...options,\n      ...withCoordinate(this.coordinate),\n    });\n  }\n\n  /** Personalized PageRank scores at this view's pinned coordinate. */\n  personalizedPageRank(\n    options: StoreViewPersonalizedPageRankOptions<G>,\n  ): Promise<readonly PageRankScore[]> {\n    return this.internalAlgorithms().personalizedPageRank({\n      ...options,\n      ...withCoordinate(this.coordinate),\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> extends CoordinatePinnedView<G> {\n  #nodes: StoreViewNodeCollections<G> | undefined;\n  #edges: StoreViewEdgeCollections<G> | undefined;\n  #search: StoreSearch<G> | undefined;\n\n  constructor(\n    store: Store<G>,\n    coordinate: StoreViewCoordinate | ReadCoordinate,\n  ) {\n    super(\n      store,\n      isReadCoordinate(coordinate) ? coordinate : (\n        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  }\n\n  /** Adds a recorded-time pin, returning the narrow reconstructing view. */\n  asOfRecorded(recordedAsOf: RecordedInstant): RecordedStoreView<G> {\n    return new RecordedStoreView(\n      this.store,\n      withRecordedCoordinate(this.coordinate, recordedAsOf),\n    );\n  }\n\n  /** Read-only node collections pinned to this view's coordinate. */\n  get nodes(): StoreViewNodeCollections<G> {\n    this.#nodes ??= pinnedNodeCollectionsFor(\n      this.store,\n      this.coordinate,\n      (_kind, live: NodeCollection<NodeType, string>, coordinate) =>\n        pinnedNodeCollection(live, coordinate),\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 ??= pinnedEdgeCollectionsFor(\n      this.store,\n      this.coordinate,\n      (\n        _kind,\n        live: EdgeCollection<AnyEdgeType, NodeType, NodeType>,\n        coordinate,\n      ) => pinnedEdgeCollection(live, coordinate),\n    ) as unknown as StoreViewEdgeCollections<G>;\n    return this.#edges;\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/**\n * A narrow recorded-time read lens. It preserves the valid-time coordinate\n * carried by the source view and adds a recorded/system-time pin. Collection\n * reads expose point reconstruction and bounded scans; broad collection\n * predicates, endpoint reads, search, and further coordinate changes are absent\n * from the typed surface and refused by the runtime proxies for JS callers.\n */\nexport class RecordedStoreView<\n  G extends GraphDef,\n> extends CoordinatePinnedView<G> {\n  #nodes: RecordedStoreViewNodeCollections<G> | undefined;\n  #edges: RecordedStoreViewEdgeCollections<G> | undefined;\n\n  constructor(store: Store<G>, coordinate: ReadCoordinate) {\n    super(store, coordinate);\n    if (!store.recordedReadBound) {\n      throw new ConfigurationError(\n        \"asOfRecorded() requires a recorded read relation.\",\n        { code: \"ASOF_RECORDED_REQUIRES_BINDING\" },\n        {\n          suggestion:\n            \"Create the store with createStore(graph, backend, { history: true }) to bind TypeGraph's built-in captured relation, or pass { recordedRead: recordedRelation({ schema }) } for an externally populated recorded relation.\",\n        },\n      );\n    }\n    if (coordinate.recorded === undefined) {\n      throw new ConfigurationError(\n        \"RecordedStoreView requires a recorded-time coordinate.\",\n        { code: \"RECORDED_STORE_VIEW_MISSING_COORDINATE\" },\n      );\n    }\n\n    // `search` is intentionally absent from the typed recorded surface (a TS\n    // caller gets a compile error). It is installed here as a runtime-only\n    // backstop — invisible to the class type — so a JS caller reaching past the\n    // types gets a clear refusal rather than a bare `TypeError`. The fulltext /\n    // vector index reflects current state only and cannot answer a\n    // recorded-time query; the facade refuses every method. Mirrors the\n    // per-collection runtime refusals ({@link recordedCollectionProxy}).\n    let searchBackstop: StoreSearch<G> | undefined;\n    Object.defineProperty(this, \"search\", {\n      enumerable: false,\n      get(): StoreSearch<G> {\n        searchBackstop ??= recordedSearch<G>(coordinate);\n        return searchBackstop;\n      },\n    });\n  }\n\n  /** The recorded/system-time timestamp this view reconstructs. */\n  get asOfRecorded(): string {\n    const recorded = this.coordinate.recorded;\n    if (recorded === undefined) {\n      throw new ConfigurationError(\n        \"RecordedStoreView requires a recorded-time coordinate.\",\n        { code: \"RECORDED_STORE_VIEW_MISSING_COORDINATE\" },\n      );\n    }\n    return recorded.asOf;\n  }\n\n  /** Recorded-time node reconstructing-read collections. */\n  get nodes(): RecordedStoreViewNodeCollections<G> {\n    this.#nodes ??= pinnedNodeCollectionsFor(\n      this.store,\n      this.coordinate,\n      (kind, live: NodeCollection<NodeType, string>, coordinate) =>\n        recordedNodeCollection(this.store, kind, live, coordinate),\n    ) as unknown as RecordedStoreViewNodeCollections<G>;\n    return this.#nodes;\n  }\n\n  /** Recorded-time edge reconstructing-read collections. */\n  get edges(): RecordedStoreViewEdgeCollections<G> {\n    this.#edges ??= pinnedEdgeCollectionsFor(\n      this.store,\n      this.coordinate,\n      (\n        kind,\n        live: EdgeCollection<AnyEdgeType, NodeType, NodeType>,\n        coordinate,\n      ) => recordedEdgeCollection(this.store, kind, live, coordinate),\n    ) as unknown as RecordedStoreViewEdgeCollections<G>;\n    return this.#edges;\n  }\n}\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 { CompilerInvariantError } from \"../../../errors\";\nimport { sql, type SqlFragment } from \"../../sql-fragment\";\nimport { type LogicalPlan } from \"../plan\";\nimport { inspectRecursiveProjectPlan } from \"./plan-inspector\";\n\nexport type RecursiveQueryEmitterInput = Readonly<{\n  depthFilter: SqlFragment;\n  limitOffset?: SqlFragment;\n  logicalPlan: LogicalPlan;\n  orderBy?: SqlFragment;\n  projection: SqlFragment;\n  recursiveCte: SqlFragment;\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(\n  input: RecursiveQueryEmitterInput,\n): SqlFragment {\n  assertRecursiveEmitterClauseAlignment(input.logicalPlan, input);\n\n  const parts: SqlFragment[] = [\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 { CompilerInvariantError } from \"../../../errors\";\nimport { sql, type SqlFragment } from \"../../sql-fragment\";\nimport { type LogicalPlan } from \"../plan\";\nimport { inspectSetOperationPlan } from \"./plan-inspector\";\n\nexport type SetOperationQueryEmitterInput = Readonly<{\n  baseQuery: SqlFragment;\n  ctes?: readonly SqlFragment[];\n  logicalPlan: LogicalPlan;\n  suffixClauses?: readonly SqlFragment[];\n}>;\n\nfunction assertSetOperationEmitterClauseAlignment(\n  logicalPlan: LogicalPlan,\n  suffixClauses: readonly SqlFragment[] | 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): SqlFragment {\n  assertSetOperationEmitterClauseAlignment(\n    input.logicalPlan,\n    input.suffixClauses,\n  );\n\n  const parts: SqlFragment[] = [];\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 { CompilerInvariantError } from \"../../../errors\";\nimport { sql, type SqlFragment } from \"../../sql-fragment\";\nimport { type LogicalPlan } from \"../plan\";\nimport { inspectStandardProjectPlan } from \"./plan-inspector\";\n\nexport type StandardQueryEmitterInput = Readonly<{\n  ctes: readonly SqlFragment[];\n  fromClause: SqlFragment;\n  groupBy?: SqlFragment;\n  having?: SqlFragment;\n  limitOffset?: SqlFragment;\n  logicalPlan: LogicalPlan;\n  orderBy?: SqlFragment;\n  projection: SqlFragment;\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(\n  input: StandardQueryEmitterInput,\n): SqlFragment {\n  assertStandardEmitterClauseAlignment(input.logicalPlan, input);\n\n  const parts: SqlFragment[] = [];\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 * Bounding for generated SQL identifiers (column aliases, index names).\n *\n * PostgreSQL silently truncates any identifier longer than 63 *bytes* —\n * not characters — keeping only the leading bytes. Two distinct generated\n * identifiers that share a >63-byte prefix therefore collapse onto the same\n * physical name, producing an \"ambiguous column\" error or, worse, a\n * silently wrong value.\n *\n * `boundPgIdentifier` closes that gap: a name that already fits is returned\n * verbatim (short, human-readable identifiers stay readable and previously\n * emitted SQL is unchanged), and a name that does not is truncated by BYTE\n * length to leave room for a deterministic hash suffix computed from the\n * caller's FULL, untruncated input. Hashing the untruncated input is what\n * makes two colliding names diverge — the bytes truncation would discard\n * still shape the suffix.\n */\nimport { MAX_PG_IDENTIFIER_LENGTH } from \"../constants\";\nimport { fnv1aBase36 } from \"./hash\";\nimport { requireDefined } from \"./presence\";\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 */\nexport function 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 (\n    end > 0 &&\n    requireDefined(encoded[end]) >= 0x80 &&\n    requireDefined(encoded[end]) < 0xc0\n  ) {\n    end--;\n  }\n\n  return new TextDecoder().decode(encoded.slice(0, end));\n}\n\n/**\n * Bounds `name` to PostgreSQL's 63-byte identifier limit.\n *\n * Returns `name` unchanged when its UTF-8 byte length already fits, so\n * short identifiers keep their exact, readable form. Otherwise the name is\n * truncated by BYTE length to leave room for `\"_\" + fnv1aBase36(hashInput)`,\n * and the hash is appended — guaranteeing the result stays within the limit\n * while distinguishing inputs that share a truncated prefix.\n *\n * `hashInput` must be the caller's full, untruncated discriminator (for\n * example `alias + \"\\0\" + field`): hashing the already-truncated `name`\n * would not disambiguate a collision.\n */\nexport function boundPgIdentifier(name: string, hashInput: string): string {\n  if (TEXT_ENCODER.encode(name).byteLength <= MAX_PG_IDENTIFIER_LENGTH) {\n    return name;\n  }\n\n  const hash = fnv1aBase36(hashInput);\n  const truncated = truncateToBytes(\n    name,\n    MAX_PG_IDENTIFIER_LENGTH - 1 - hash.length,\n  );\n  return `${truncated}_${hash}`;\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\" | \"neq\" | \"gt\" | \"gte\" | \"lt\" | \"lte\" | \"in\" | \"notIn\";\n\n/**\n * String operators.\n */\nexport type StringOp =\n  \"contains\" | \"startsWith\" | \"endsWith\" | \"like\" | \"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   * Retrieve each kind's candidates via the engine's native ANN structure\n   * instead of an exact distance scan (see `SimilarToOptions.approximate`).\n   */\n  approximate?: boolean;\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\" | \"countDistinct\" | \"sum\" | \"avg\" | \"min\" | \"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 * An ordering specification for aggregate queries.\n *\n * Unlike {@link OrderSpec}, this references a projected SELECT-list output\n * column by name rather than a `FieldRef` into a source table/CTE. Aggregate\n * query projections always assign an output alias to every grouped field\n * and aggregate expression (via `.aggregate({ outputName: ... })`), so\n * ordering by that alias works uniformly for both — and both SQLite and\n * PostgreSQL allow `ORDER BY` to reference a SELECT-list alias directly, so\n * no re-derivation of the underlying expression (and no dialect seam) is\n * needed.\n */\nexport type AggregateOrderSpec = Readonly<{\n  outputName: string;\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  /** Recorded/system-time timestamp for recorded-pinned reads. */\n  recordedAsOf?: string;\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   * ORDER BY specification for aggregate queries, referencing projected\n   * output aliases (grouped fields or aggregate expressions) instead of\n   * source-table field refs. See {@link AggregateOrderSpec}.\n   */\n  aggregateOrderBy?: readonly AggregateOrderSpec[];\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","import { type SelectiveField } from \"../ast\";\nimport { type DialectAdapter } from \"../dialect/types\";\nimport { type JsonPointer, jsonPointer } from \"../json-pointer\";\nimport { type SqlFragment } from \"../sql-fragment\";\n\ntype JsonExtractFallback = \"json\" | \"text\";\n\ntype TypedJsonExtractInput = Readonly<{\n  column: SqlFragment;\n  dialect: DialectAdapter;\n  fallback?: JsonExtractFallback;\n  pointer: JsonPointer;\n  valueType: string | undefined;\n}>;\n\nexport function compileTypedJsonExtract(\n  input: TypedJsonExtractInput,\n): SqlFragment {\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\n/**\n * Extracts a single top-level selective-projection field from a JSON props\n * column, typed by the field's declared value type.\n *\n * Shared by both projection shapes: the standard emitter pushes this extraction\n * into a CTE synthetic column, while the recursive emitter applies it in the\n * outer SELECT over the props carried through the recursive CTE. The two SQL\n * shapes differ by design, but they must extract identically — centralizing the\n * pointer/valueType wiring here keeps their extraction semantics from drifting.\n */\nexport function compileSelectivePropsExtraction(\n  field: SelectiveField,\n  column: SqlFragment,\n  dialect: DialectAdapter,\n): SqlFragment {\n  return compileTypedJsonExtract({\n    column,\n    dialect,\n    pointer: jsonPointer([field.field]),\n    valueType: field.valueType,\n  });\n}\n","/**\n * Shared Compiler Utilities\n *\n * Functions and constants shared between the standard and recursive compilers.\n */\nimport { type AggregateExpr, type FieldRef, type SelectiveField } from \"../ast\";\nimport { parseJsonPointer } from \"../json-pointer\";\nimport { sql, type SqlFragment } from \"../sql-fragment\";\nimport { getFieldPointer } from \"./predicates\";\n\n// ============================================================\n// Constants\n// ============================================================\n\nexport const NODE_COLUMNS = [\n  \"id\",\n  \"kind\",\n  \"props\",\n  \"version\",\n  \"valid_from\",\n  \"valid_to\",\n  \"created_at\",\n  \"updated_at\",\n  \"deleted_at\",\n] as const;\n\nexport const EDGE_COLUMNS = [\n  \"id\",\n  \"kind\",\n  \"from_id\",\n  \"to_id\",\n  \"props\",\n  \"valid_from\",\n  \"valid_to\",\n  \"created_at\",\n  \"updated_at\",\n  \"deleted_at\",\n] as const;\n\nexport type RequiredColumnsByAlias = ReadonlyMap<string, ReadonlySet<string>>;\nexport const EMPTY_REQUIRED_COLUMNS = new Set<string>();\n\n// ============================================================\n// SQL Helpers\n// ============================================================\n\nexport function quoteIdentifier(identifier: string): SqlFragment {\n  return sql.identifier(identifier);\n}\n\n// ============================================================\n// Column Projection\n// ============================================================\n\n/**\n * Determines whether a column should be included in the projection.\n *\n * @param requiredColumns - Set of columns required by the query, or undefined to include all.\n * @param column - The column name to check.\n * @param alwaysRequiredColumns - Optional set of columns that are always projected\n *   (e.g. join keys in recursive CTEs). Pass only from recursive compiler callers.\n */\nexport function shouldProjectColumn(\n  requiredColumns: ReadonlySet<string> | undefined,\n  column: string,\n  alwaysRequiredColumns?: ReadonlySet<string>,\n): boolean {\n  if (alwaysRequiredColumns?.has(column)) return true;\n  if (requiredColumns === undefined) return true;\n  return requiredColumns.has(column);\n}\n\n// ============================================================\n// Required Column Tracking\n// ============================================================\n\nexport function addRequiredColumn(\n  requiredColumnsByAlias: Map<string, Set<string>>,\n  alias: string,\n  column: string,\n): void {\n  const existing = requiredColumnsByAlias.get(alias);\n  if (existing) {\n    existing.add(column);\n    return;\n  }\n  requiredColumnsByAlias.set(alias, new Set([column]));\n}\n\nexport function markFieldRefAsRequired(\n  requiredColumnsByAlias: Map<string, Set<string>>,\n  field: FieldRef,\n): void {\n  const column = field.path[0];\n  if (column === undefined) return;\n  addRequiredColumn(requiredColumnsByAlias, field.alias, column);\n}\n\nexport function mapSelectiveSystemFieldToColumn(field: string): string {\n  if (field === \"fromId\") return \"from_id\";\n  if (field === \"toId\") return \"to_id\";\n  if (field.startsWith(\"meta.\")) {\n    return field\n      .slice(5)\n      .replaceAll(/([A-Z])/g, \"_$1\")\n      .toLowerCase();\n  }\n  return field;\n}\n\nexport function markSelectiveFieldAsRequired(\n  requiredColumnsByAlias: Map<string, Set<string>>,\n  field: SelectiveField,\n): void {\n  if (field.isSystemField) {\n    addRequiredColumn(\n      requiredColumnsByAlias,\n      field.alias,\n      mapSelectiveSystemFieldToColumn(field.field),\n    );\n    return;\n  }\n  addRequiredColumn(requiredColumnsByAlias, field.alias, \"props\");\n}\n\nfunction getTopLevelPropsFieldName(field: FieldRef): string | undefined {\n  const pointer = getFieldPointer(field);\n  if (pointer === undefined) return undefined;\n\n  const segments = parseJsonPointer(pointer);\n  return segments.length === 1 ? segments[0] : undefined;\n}\n\nexport function findSelectivePropsFieldForFieldRef(\n  selectiveFields: readonly SelectiveField[] | undefined,\n  field: FieldRef,\n): SelectiveField | undefined {\n  if (selectiveFields === undefined || selectiveFields.length === 0) {\n    return undefined;\n  }\n\n  const propsFieldName = getTopLevelPropsFieldName(field);\n  if (propsFieldName === undefined) return undefined;\n\n  return selectiveFields.find(\n    (selectiveField) =>\n      !selectiveField.isSystemField &&\n      selectiveField.alias === field.alias &&\n      selectiveField.field === propsFieldName,\n  );\n}\n\n// ============================================================\n// AST Type Guards\n// ============================================================\n\nexport function isIdFieldRef(field: FieldRef): boolean {\n  return (\n    field.path.length === 1 &&\n    field.path[0] === \"id\" &&\n    field.jsonPointer === undefined\n  );\n}\n\nexport function isAggregateExpr(\n  source: FieldRef | AggregateExpr,\n): source is AggregateExpr {\n  return \"__type\" in source && source.__type === \"aggregate\";\n}\n","import { UnsupportedPredicateError } from \"../../../errors\";\nimport { boundPgIdentifier } from \"../../../utils/identifier\";\nimport { requireDefined } from \"../../../utils/presence\";\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 { sql, type SqlFragment } from \"../../sql-fragment\";\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 { compileSelectivePropsExtraction } from \"../typed-json-extract\";\nimport {\n  EDGE_COLUMNS,\n  EMPTY_REQUIRED_COLUMNS,\n  findSelectivePropsFieldForFieldRef,\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): SqlFragment {\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): SqlFragment {\n  return sql`${quoteIdentifier(owner)}.${quoteIdentifier(name)}`;\n}\n\nconst SCOPED_RELEVANCE_NODES_ALIAS = \"scoped_relevance_nodes\";\n\n/**\n * Builds a synthetic CTE column name for a selectively-extracted props field.\n *\n * Length-prefixes each component (`<length>:<value>`) rather than joining\n * `alias`/`field` on a bare `_`: alias and field are both attacker/user-controlled\n * strings that may themselves contain `_`, so naive concatenation lets two distinct\n * (alias, field) pairs collide on the same column name (e.g. alias=\"p_full\",\n * field=\"name\" vs. alias=\"p\", field=\"full_name\" would otherwise both produce\n * \"__tg_p_full_name\"). The length prefix makes the encoding unambiguous regardless\n * of what characters alias/field contain.\n *\n * The encoding is unbounded, but PostgreSQL truncates identifiers at 63 bytes,\n * so `boundPgIdentifier` hash-guards long names: two pairs whose encodings share\n * a >63-byte prefix would otherwise collapse onto the same physical column.\n * Short names are returned verbatim, preserving the readable `__tg_...` form.\n */\nfunction selectivePropsCteColumnName(field: SelectiveField): string {\n  const { alias, field: fieldName } = field;\n  const encoded = `__tg_${alias.length}:${alias}:${fieldName.length}:${fieldName}`;\n  return boundPgIdentifier(encoded, `${alias}\\0${fieldName}`);\n}\n\nfunction buildScopedNodeIdsSubquery(nodeAlias: string): SqlFragment {\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\ntype CompileSelectivePropsSelectColumnsInput = Readonly<{\n  alias: string;\n  dialect: DialectAdapter;\n  selectiveFields: readonly SelectiveField[] | undefined;\n  tableAlias: string | undefined;\n}>;\n\nfunction compileSelectivePropsSelectColumns(\n  input: CompileSelectivePropsSelectColumnsInput,\n): SqlFragment[] {\n  const { alias, dialect, selectiveFields, tableAlias } = input;\n  const propsFields =\n    selectiveFields?.filter(\n      (field) => !field.isSystemField && field.alias === alias,\n    ) ?? [];\n  if (propsFields.length === 0) return [];\n\n  const propsColumn = compileColumnReference(tableAlias, \"props\");\n  return propsFields.map((field) => {\n    const extracted = compileSelectivePropsExtraction(\n      field,\n      propsColumn,\n      dialect,\n    );\n    return sql`${extracted} AS ${quoteIdentifier(selectivePropsCteColumnName(field))}`;\n  });\n}\n\nfunction appendSelectivePropsColumns(\n  baseColumns: readonly SqlFragment[],\n  input: CompileSelectivePropsSelectColumnsInput,\n): SqlFragment[] {\n  return [...baseColumns, ...compileSelectivePropsSelectColumns(input)];\n}\n\ntype CompileNodeSelectColumnsInput = Readonly<{\n  alias: string;\n  dialect: DialectAdapter;\n  requiredColumns: ReadonlySet<string> | undefined;\n  selectiveFields: readonly SelectiveField[] | undefined;\n  tableAlias: string | undefined;\n}>;\n\nfunction compileNodeSelectColumns(\n  input: CompileNodeSelectColumnsInput,\n): SqlFragment[] {\n  const { alias, dialect, requiredColumns, selectiveFields, tableAlias } =\n    input;\n  const baseColumns = 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  return appendSelectivePropsColumns(baseColumns, {\n    alias,\n    dialect,\n    selectiveFields,\n    tableAlias,\n  });\n}\n\ntype CompileEdgeSelectColumnsInput = Readonly<{\n  alias: string;\n  dialect: DialectAdapter;\n  requiredColumns: ReadonlySet<string> | undefined;\n  selectiveFields: readonly SelectiveField[] | undefined;\n  tableAlias: string | undefined;\n}>;\n\nfunction compileEdgeSelectColumns(\n  input: CompileEdgeSelectColumnsInput,\n): SqlFragment[] {\n  const { alias, dialect, requiredColumns, selectiveFields, tableAlias } =\n    input;\n  const baseColumns = EDGE_COLUMNS.filter((column) =>\n    shouldProjectColumn(requiredColumns, column),\n  ).map(\n    (column) =>\n      sql`${compileColumnReference(tableAlias, column)} AS ${sql.raw(`${alias}_${column}`)}`,\n  );\n  return appendSelectivePropsColumns(baseColumns, {\n    alias,\n    dialect,\n    selectiveFields,\n    tableAlias,\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(\n  input: BuildStandardStartCteInput,\n): SqlFragment {\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({\n          alias,\n          dialect: ctx.dialect,\n          requiredColumns: effectiveRequiredColumns,\n          selectiveFields: ast.selectiveFields,\n          tableAlias: undefined,\n        }),\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): SqlFragment {\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 = requireDefined(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({\n      alias: edgeAlias,\n      dialect: ctx.dialect,\n      requiredColumns: requiredEdgeColumns,\n      selectiveFields: ast.selectiveFields,\n      tableAlias: \"e\",\n    }),\n    ...compileNodeSelectColumns({\n      alias: nodeAlias,\n      dialect: ctx.dialect,\n      requiredColumns: requiredNodeColumns,\n      selectiveFields: ast.selectiveFields,\n      tableAlias: \"n\",\n    }),\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?: SqlFragment | 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  ): SqlFragment {\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): SqlFragment {\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): SqlFragment {\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): SqlFragment {\n  const { ast, collapsedTraversalCteAlias, dialect } = input;\n  if (ast.selectiveFields && ast.selectiveFields.length > 0) {\n    return compileSelectiveProjection(\n      ast.selectiveFields,\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  ast: QueryAst,\n  collapsedTraversalCteAlias?: string,\n): SqlFragment {\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    return sql`${sql.raw(cteAlias)}.${quoteIdentifier(selectivePropsCteColumnName(field))} AS ${quoteIdentifier(field.outputName)}`;\n  });\n\n  return sql.join(columns, sql`, `);\n}\n\nfunction compileOrderFieldValue(\n  ast: QueryAst,\n  field: FieldRef,\n  dialect: DialectAdapter,\n  cteAlias: string,\n): SqlFragment {\n  const selectiveField = findSelectivePropsFieldForFieldRef(\n    ast.selectiveFields,\n    field,\n  );\n  if (selectiveField !== undefined) {\n    return sql`${sql.raw(cteAlias)}.${quoteIdentifier(selectivePropsCteColumnName(selectiveField))}`;\n  }\n\n  return compileFieldValue(field, dialect, field.valueType, cteAlias);\n}\n\nfunction buildRelevanceJoins(\n  vectorPredicate: VectorSimilarityPredicate | undefined,\n  fulltextPredicate: FulltextMatchPredicate | undefined,\n): SqlFragment[] {\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: SqlFragment[] = [];\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): SqlFragment {\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): SqlFragment {\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): SqlFragment {\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: SqlFragment[] = [];\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): SqlFragment | undefined {\n  const { ast, collapsedTraversalCteAlias, dialect } = input;\n  const fieldOrderBy = ast.orderBy ?? [];\n  const aggregateOrderBy = ast.aggregateOrderBy ?? [];\n  if (fieldOrderBy.length === 0 && aggregateOrderBy.length === 0) {\n    return undefined;\n  }\n\n  // Only built when there's a FieldRef-based order spec to resolve against\n  // a CTE — the aggregate-alias loop below references the SELECT-list\n  // output alias directly and never needs it, which matters because the\n  // common case for `.aggregate().orderBy(...)` has `fieldOrderBy` empty.\n  const aliasToCte =\n    fieldOrderBy.length > 0 ? buildAliasToCteMap(ast) : undefined;\n  const parts: SqlFragment[] = [];\n  for (const orderSpec of fieldOrderBy) {\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 = compileOrderFieldValue(\n      ast,\n      orderSpec.field,\n      dialect,\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  // Aggregate ordering references the projected SELECT-list output alias\n  // directly rather than recompiling a FieldRef/AggregateExpr — every\n  // `.aggregate()` field (grouped or aggregated) is always projected with\n  // an alias, and both SQLite and PostgreSQL allow ORDER BY to reference\n  // it, so this needs no per-CTE or per-dialect resolution.\n  //\n  // Nulls ordering can't reuse the `(field IS NULL) direction, field\n  // direction` trick above: unlike a source-table field reference, an\n  // output alias is only resolved by either dialect when the ORDER BY term\n  // is the bare identifier itself — wrapping it in `(alias IS NULL)`\n  // makes both SQLite and PostgreSQL look for a real column named\n  // `alias` and fail. The standard `NULLS FIRST`/`NULLS LAST` suffix\n  // (supported by both dialects) sidesteps that: it attaches to the bare\n  // identifier rather than embedding it in a larger expression.\n  for (const orderSpec of aggregateOrderBy) {\n    const column = quoteIdentifier(orderSpec.outputName);\n    const direction = sql.raw(orderSpec.direction.toUpperCase());\n    const nulls =\n      orderSpec.nulls ?? (orderSpec.direction === \"asc\" ? \"last\" : \"first\");\n    const nullsKeyword = sql.raw(\n      nulls === \"first\" ? \"NULLS FIRST\" : \"NULLS LAST\",\n    );\n    parts.push(sql`${column} ${direction} ${nullsKeyword}`);\n  }\n\n  return sql`ORDER BY ${sql.join(parts, sql`, `)}`;\n}\n\n// ============================================================\n// Late materialization (deferred projection)\n// ============================================================\n//\n// For an ORDER BY … LIMIT query whose projection reads columns beyond the\n// ordering/identity keys, the flat plan carries every projected column (e.g. a\n// large `content` prop) through the sorter for every candidate row and then\n// discards all but the LIMIT survivors. Late materialization sorts+limits a\n// *lean* candidate set (identity + sort keys only), then re-joins the physical\n// node table by `(graph_id, kind, id)` to fetch the deferred columns for only\n// the surviving rows. See the standard emitter's late-materialization branch\n// for the eligibility gate; these builders assume it already held.\n\nexport const LATE_MAT_TOPK_CTE_ALIAS = \"cte_lm_topk\";\nconst LATE_MAT_SORT_KEY_PREFIX = \"__lm_sk\";\nconst LATE_MAT_PHYSICAL_ALIAS_PREFIX = \"lm_\";\n\nexport function lateMaterializedPhysicalAlias(alias: string): string {\n  return `${LATE_MAT_PHYSICAL_ALIAS_PREFIX}${alias}`;\n}\n\n/** Node aliases in the query: the start alias plus each traversal's node. */\nfunction lateMaterializedNodeAliases(ast: QueryAst): readonly string[] {\n  return [\n    ast.start.alias,\n    ...ast.traversals.map((traversal) => traversal.nodeAlias),\n  ];\n}\n\n/**\n * Node aliases the projection actually reads — the physical tables the outer\n * SELECT must re-join. Edge aliases are gated out upstream, so every projected\n * alias resolves to a node table here.\n */\nexport function lateMaterializedProjectedNodeAliases(\n  ast: QueryAst,\n): readonly string[] {\n  const referenced = new Set<string>();\n  for (const field of ast.selectiveFields ?? []) {\n    referenced.add(field.alias);\n  }\n  return lateMaterializedNodeAliases(ast).filter((alias) =>\n    referenced.has(alias),\n  );\n}\n\ntype BuildLateMaterializedTopKCteInput = Readonly<{\n  ast: QueryAst;\n  collapsedTraversalCteAlias?: string;\n  dialect: DialectAdapter;\n  fromClause: SqlFragment;\n  limit: number;\n  offset?: number | undefined;\n}>;\n\n/**\n * The topK CTE: selects each node alias's identity `(id, kind)` plus each sort\n * key value (aliased `__lm_sk{n}` so the outer SELECT can re-order the survivors\n * without re-extracting), ordered and limited on the lean candidate set.\n *\n * When the traversal rowset is collapsed onto a single CTE, every alias's\n * identity is carried into that one CTE (keyed by alias prefix), so all columns\n * resolve against `collapsedTraversalCteAlias` and the FROM references it alone.\n */\nexport function buildLateMaterializedTopKCte(\n  input: BuildLateMaterializedTopKCteInput,\n): SqlFragment {\n  const { ast, collapsedTraversalCteAlias, dialect, fromClause } = input;\n  const aliasToCte = buildAliasToCteMap(ast);\n  const cteAliasFor = (alias: string): string =>\n    collapsedTraversalCteAlias ??\n    aliasToCte.get(alias) ??\n    `${ALIAS_CTE_PREFIX}${alias}`;\n\n  const columns: SqlFragment[] = [];\n  for (const alias of lateMaterializedNodeAliases(ast)) {\n    const cteAlias = cteAliasFor(alias);\n    columns.push(\n      sql`${qualifyColumn(cteAlias, `${alias}_id`)} AS ${sql.raw(`${alias}_id`)}`,\n      sql`${qualifyColumn(cteAlias, `${alias}_kind`)} AS ${sql.raw(`${alias}_kind`)}`,\n    );\n  }\n  for (const [index, orderSpec] of (ast.orderBy ?? []).entries()) {\n    const value = compileOrderFieldValue(\n      ast,\n      orderSpec.field,\n      dialect,\n      cteAliasFor(orderSpec.field.alias),\n    );\n    columns.push(\n      sql`${value} AS ${sql.raw(`${LATE_MAT_SORT_KEY_PREFIX}${index}`)}`,\n    );\n  }\n\n  const innerOrderBy = buildStandardOrderBy({\n    ast,\n    dialect,\n    ...(collapsedTraversalCteAlias === undefined ?\n      {}\n    : { collapsedTraversalCteAlias }),\n  });\n  const limitOffset = buildLimitOffsetClause({\n    limit: input.limit,\n    offset: input.offset,\n  });\n\n  const parts: SqlFragment[] = [\n    sql`SELECT ${sql.join(columns, sql`, `)}`,\n    fromClause,\n  ];\n  if (innerOrderBy !== undefined) parts.push(innerOrderBy);\n  if (limitOffset !== undefined) parts.push(limitOffset);\n\n  return sql`${sql.raw(LATE_MAT_TOPK_CTE_ALIAS)} AS (${sql.join(parts, sql` `)})`;\n}\n\n/**\n * The outer projection: each selective field sourced from the re-joined\n * physical node table alias `lm_<alias>` rather than a candidate CTE, so the\n * deferred columns are read only for the surviving rows.\n */\nexport function buildLateMaterializedOuterProjection(\n  ast: QueryAst,\n  dialect: DialectAdapter,\n): SqlFragment {\n  const columns = (ast.selectiveFields ?? []).map((field) => {\n    const physicalAlias = lateMaterializedPhysicalAlias(field.alias);\n    if (field.isSystemField) {\n      const dbColumn = mapSelectiveSystemFieldToColumn(field.field);\n      return sql`${compileColumnReference(physicalAlias, dbColumn)} AS ${quoteIdentifier(field.outputName)}`;\n    }\n    const extracted = compileSelectivePropsExtraction(\n      field,\n      compileColumnReference(physicalAlias, \"props\"),\n      dialect,\n    );\n    return sql`${extracted} AS ${quoteIdentifier(field.outputName)}`;\n  });\n  return sql.join(columns, sql`, `);\n}\n\n/**\n * The outer ORDER BY: re-orders the LIMIT survivors by the `__lm_sk{n}` sort\n * values carried out of the topK CTE, matching `buildStandardOrderBy`'s\n * null-ordering semantics. Referencing the CTE's real columns (not bare output\n * aliases) keeps the `(x IS NULL)` null-placement trick valid on both dialects.\n */\nexport function buildLateMaterializedOuterOrderBy(\n  ast: QueryAst,\n): SqlFragment | undefined {\n  const orderBy = ast.orderBy ?? [];\n  if (orderBy.length === 0) return undefined;\n  const topk = sql.raw(LATE_MAT_TOPK_CTE_ALIAS);\n  const parts: SqlFragment[] = [];\n  for (const [index, orderSpec] of orderBy.entries()) {\n    const column = sql`${topk}.${sql.raw(`${LATE_MAT_SORT_KEY_PREFIX}${index}`)}`;\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`(${column} IS NULL) ${nullsDirection}`,\n      sql`${column} ${direction}`,\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): SqlFragment | 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): SqlFragment | 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.\n *\n * Default (exact): splices the strategy's `distanceExpression` and scans each\n * declaring kind's per-field table (`ORDER BY distance LIMIT k`). On\n * pgvector >= 0.8 the planner can serve this shape from an HNSW index for a\n * single-kind alias; on the SQLite-family engines it is a full scan.\n *\n * Opt-in (`{ approximate: true }`): each declaring kind's branch compiles to\n * the strategy's own search SQL — the engine-native ANN form (vec0\n * `MATCH … k=`, libSQL `vector_top_k`, pgvector's index-eligible scan) —\n * scoped to the alias's candidate nodes via the same `candidates` pushdown\n * the search facade uses. Semantics become approximate (index recall); a\n * slot declared `indexType: \"none\"` degrades to the exact scan.\n */\nexport function buildStandardEmbeddingsCte(\n  input: BuildStandardEmbeddingsCteInput,\n): SqlFragment {\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    const slotDescriptor = vectorSlots?.get(vectorSlotKey(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 = metric ?? slotDescriptor?.metric ?? \"cosine\";\n\n    // Approximate opt-in: retrieve this kind's candidates via the\n    // strategy's own search SQL — the engine's native ANN form — scoped to\n    // the alias's candidate nodes (predicates, currency, traversal\n    // reachability) via the same `candidates` pushdown the search facade\n    // uses. A slot declared `indexType: \"none\"` compiles to the strategy's\n    // exact scan, so the opt-in degrades to today's semantics. Distance is\n    // re-derived from the strategy's score convention (cosine score =\n    // `1 - distance`; l2 / inner_product score = raw distance) so the\n    // shared ORDER BY / ROW_NUMBER machinery below is untouched.\n    //\n    // The ANN path additionally requires the effective metric to MATCH the\n    // slot's declared metric: every engine materializes metric-specific\n    // ANN structures (vec0 bakes `distance_metric` into the virtual table,\n    // libSQL's DiskANN index and pgvector's operator class are built for\n    // one metric), so retrieving by the declared metric and re-scoring\n    // under an overridden one would silently miss the override metric's\n    // true nearest neighbors. A mismatched override falls back to the\n    // exact scan below — correct for any metric, like `indexType: \"none\"`.\n    // Engines whose `buildSearch` is EXACT (vec0's brute-force C KNN)\n    // serve the non-approximate branch through it as well: identical\n    // results to the SQL distance scan at engine speed (489ms -> 113ms\n    // at 50k on the SQLite lane). The metric gate stays: the engine\n    // form is built for the slot's declared metric.\n    const engineFormEligible =\n      vectorPredicate.approximate === true ||\n      vectorStrategy.searchIsExact === true;\n    const annSlot =\n      engineFormEligible && branchMetric === slotDescriptor?.metric ?\n        slotDescriptor\n      : undefined;\n    if (annSlot !== undefined) {\n      ctx.annIndexTypes?.add(annSlot.indexType);\n      // Membership candidates WITHOUT the scoped subquery's DISTINCT:\n      // strategies embed these as `node_id IN (...)`, where duplicates\n      // cannot change the result — and the DISTINCT is what kept\n      // PostgreSQL off the ordered ANN index scan entirely (verified:\n      // the identical statement flips from a full sort to an HNSW\n      // Index Scan when the DISTINCT is dropped; even\n      // `enable_seqscan = off` could not rescue the DISTINCT form).\n      // The JOIN consumers (exact branch, fulltext CTE) keep\n      // buildScopedNodeIdsSubquery's DISTINCT — a join DOES multiply\n      // rows on duplicates.\n      const candidateCte = `${ALIAS_CTE_PREFIX}${field.alias}`;\n      const kindCandidates = sql`SELECT ${qualifyColumn(candidateCte, `${field.alias}_id`)} FROM ${quoteIdentifier(candidateCte)} WHERE ${qualifyColumn(candidateCte, `${field.alias}_kind`)} = ${kind}`;\n      const annSql = vectorStrategy.buildSearch(\n        {\n          graphId,\n          nodeKind: kind,\n          fieldPath,\n          dimensions: annSlot.dimensions,\n          metric: branchMetric,\n          indexType: annSlot.indexType,\n        },\n        {\n          graphId,\n          nodeKind: kind,\n          fieldPath,\n          queryEmbedding,\n          metric: branchMetric,\n          dimensions: annSlot.dimensions,\n          indexType: annSlot.indexType,\n          limit: vectorPredicate.limit,\n          ...(minScore === undefined ? {} : { minScore }),\n        },\n        kindCandidates,\n      );\n      const distanceFromScore =\n        branchMetric === \"cosine\" ? sql.raw(\"(1.0 - score)\") : sql.raw(\"score\");\n      return sql`\n        SELECT node_id, ${kind} AS node_kind, ${distanceFromScore} AS distance, score\n        FROM (${annSql}) AS tg_ann_src\n      `;\n    }\n    const distanceExpr = vectorStrategy.distanceExpression(\n      qualifyColumn(tableName, \"embedding\"),\n      queryEmbedding,\n      branchMetric,\n    );\n    // EXACT MEANS EXACT: this branch is the non-approximate path, but on\n    // pgvector any `ORDER BY embedding <=> q LIMIT k` whose expression\n    // matches the ANN opclass is silently served by the HNSW/IVFFlat\n    // index — approximate results with plan-dependent recall (measured\n    // recall 0.980 unfiltered, 0.000 under a selective filter at 50k,\n    // where the index frontier starves). `+ 0.0` makes the ordered\n    // expression unmatchable to the opclass, forcing the true flat scan;\n    // numerically identity, and inert on engines whose ANN forms are\n    // opt-in anyway (vec0 MATCH, libSQL vector_top_k). The sanctioned\n    // index path is `approximate: true` above.\n    const exactDistanceExpr = sql`(${distanceExpr} + 0.0)`;\n    const scoreExpr = vectorScoreExpression(distanceExpr, branchMetric);\n\n    const conditions: SqlFragment[] = [\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        ${exactDistanceExpr} 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(): SqlFragment {\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): SqlFragment {\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  // Parse the query with a CONSTANT language whenever possible: the\n  // caller's explicit override, else the one declared language shared by\n  // every kind in the alias (rows are written with their kind's declared\n  // language, so this matches the stored tsv). A constant keeps the\n  // tsquery plan-time-stable, so PostgreSQL's GIN index on `tsv` can\n  // serve the match — the per-row `websearch_to_tsquery(\"language\", ...)`\n  // fallback (mixed-language aliases only) forces a scan of the kinds'\n  // rows.\n  const effectiveLanguage =\n    language ?? sharedDeclaredLanguage(ctx.fulltextLanguages, nodeKinds);\n  const matchCondition = fulltextStrategy.matchCondition(\n    tableName,\n    query,\n    mode,\n    effectiveLanguage,\n  );\n  const rankExpression = fulltextStrategy.rankExpression(\n    tableName,\n    query,\n    mode,\n    effectiveLanguage,\n  );\n\n  const conditions: SqlFragment[] = [\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\n/**\n * The single declared language shared by every kind in the alias that\n * declares searchable fields, or `undefined` when they disagree (or none\n * declares any — such kinds contribute no fulltext rows either way).\n */\nfunction sharedDeclaredLanguage(\n  fulltextLanguages: ReadonlyMap<string, string> | undefined,\n  nodeKinds: readonly string[],\n): string | undefined {\n  if (fulltextLanguages === undefined) return undefined;\n  const languages = new Set<string>();\n  for (const kind of nodeKinds) {\n    const language = fulltextLanguages.get(kind);\n    if (language !== undefined) languages.add(language);\n  }\n  if (languages.size !== 1) return undefined;\n  return [...languages][0];\n}\n\nexport function buildStandardHybridCandidateCte(): SqlFragment {\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 `SqlFragment` values 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 SqlFragment[] {\n  if (!ast.orderBy || ast.orderBy.length === 0) return [];\n\n  const aliasToCte = buildAliasToCteMap(ast);\n  const fragments: SqlFragment[] = [];\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 = compileOrderFieldValue(\n      ast,\n      orderSpec.field,\n      dialect,\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): SqlFragment {\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): SqlFragment {\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 code-unit `compareStrings(nodeId)`\n  // tiebreak so the two paths produce identical top-k under ties (SQLite\n  // BINARY collation is code-unit order for the ASCII id alphabet).\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): SqlFragment {\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): SqlFragment | undefined {\n  const { limit, offset } = input;\n  const parts: SqlFragment[] = [];\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","import type { QueryAst } from \"../../ast\";\nimport { type SqlFragment } from \"../../sql-fragment\";\nimport {\n  compileTemporalFilter,\n  currentReadInstantFor,\n  extractTemporalOptions,\n  type ReadInstantMode,\n} from \"../temporal\";\n\nexport type TemporalFilterPass = Readonly<{\n  forAlias: (tableAlias?: string) => SqlFragment;\n}>;\n\n/**\n * Creates a temporal filter pass bound to a query AST.\n *\n * Invariant: all temporal clauses for a query use the same \"current\" instant,\n * bound once here from the application clock. In `\"literal\"` mode that is a\n * concrete value; in `\"placeholder\"` mode it is the reserved read-instant\n * placeholder (filled fresh per execution by the query builder's template\n * cache) — see {@link currentReadInstantFor}.\n */\nexport function createTemporalFilterPass(\n  ast: QueryAst,\n  readInstant: ReadInstantMode = \"literal\",\n): TemporalFilterPass {\n  const currentTimestamp = currentReadInstantFor(readInstant);\n  return {\n    forAlias(tableAlias?: string): SqlFragment {\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 { requireDefined } from \"../../../utils/presence\";\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  const hasFieldOrderBy = ast.orderBy !== undefined && ast.orderBy.length > 0;\n  const hasAggregateOrderBy =\n    ast.aggregateOrderBy !== undefined && ast.aggregateOrderBy.length > 0;\n  if (hasFieldOrderBy || hasAggregateOrderBy) {\n    // The sort node's presence (not its `orderBy` payload) is what the\n    // emitter's plan-shape invariant reads — see `hasSort` in\n    // emitter/plan-inspector.ts. `orderBy` here can be `[]` when only\n    // `ast.aggregateOrderBy` is set; that's fine today since nothing reads\n    // this field's contents, only whether the node exists.\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: requireDefined(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","import { UnsupportedPredicateError } from \"../../errors\";\nimport type {\n  FulltextMatchPredicate,\n  QueryAst,\n  VectorSimilarityPredicate,\n} from \"../ast\";\nimport {\n  extractFulltextMatchPredicates,\n  extractVectorSimilarityPredicates,\n} from \"./predicates\";\n\ntype CurrentIndexUsage = Readonly<{\n  usesVectorPredicate: boolean;\n  usesFulltextPredicate: boolean;\n}>;\n\nexport function assertRecordedQueryDoesNotUseCurrentIndexes(\n  ast: QueryAst,\n  vectorPredicate: VectorSimilarityPredicate | undefined,\n  fulltextPredicate: FulltextMatchPredicate | undefined,\n): void {\n  assertRecordedQueryHasNoCurrentIndexUsage(ast, {\n    usesVectorPredicate: vectorPredicate !== undefined,\n    usesFulltextPredicate: fulltextPredicate !== undefined,\n  });\n}\n\nexport function assertRecordedQueryAstDoesNotUseCurrentIndexes(\n  ast: QueryAst,\n): void {\n  if (ast.recordedAsOf === undefined) return;\n  const vectorPredicates = extractVectorSimilarityPredicates(ast.predicates);\n  const fulltextPredicates = extractFulltextMatchPredicates(ast.predicates);\n  assertRecordedQueryHasNoCurrentIndexUsage(ast, {\n    usesVectorPredicate: vectorPredicates.length > 0,\n    usesFulltextPredicate: fulltextPredicates.length > 0,\n  });\n}\n\nfunction assertRecordedQueryHasNoCurrentIndexUsage(\n  ast: QueryAst,\n  usage: CurrentIndexUsage,\n): void {\n  if (ast.recordedAsOf === undefined) return;\n  if (!usage.usesVectorPredicate && !usage.usesFulltextPredicate) return;\n\n  throwRecordedCurrentIndexError(ast.recordedAsOf, usage);\n}\n\nfunction throwRecordedCurrentIndexError(\n  recordedAsOf: string,\n  usage: CurrentIndexUsage,\n): never {\n  throw new UnsupportedPredicateError(\n    \"Recorded-time queries cannot use vector or fulltext predicates because those indexes reflect current state.\",\n    {\n      recordedAsOf,\n      ...usage,\n    },\n    {\n      suggestion:\n        \"Use ordinary property predicates on the recorded view, or run vector/fulltext predicates against the live Store.\",\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 {\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 { sql, type SqlFragment } from \"../sql-fragment\";\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 { assertRecordedQueryAstDoesNotUseCurrentIndexes } from \"./recorded-current-index-guard\";\nimport { compileSelectivePropsExtraction } 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.readInstant,\n      );\n    },\n    update(currentState, temporalFilterPass): RecursiveQueryPassState {\n      return {\n        ...currentState,\n        temporalFilterPass,\n      };\n    },\n  });\n  state = temporalPass.state;\n\n  assertRecordedQueryAstDoesNotUseCurrentIndexes(state.ast);\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 `SqlFragment` for the recursive query\n */\nexport function compileVariableLengthQuery(\n  ast: QueryAst,\n  graphId: string,\n  ctx: PredicateCompilerContext,\n): SqlFragment {\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) => SqlFragment;\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): SqlFragment {\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): SqlFragment {\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: SqlFragment[] = [\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?: SqlFragment | undefined;\n    }>,\n  ): SqlFragment {\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: SqlFragment[] = [\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(): SqlFragment {\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(\n  kinds: readonly string[],\n  columnExpr: string,\n): SqlFragment {\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): SqlFragment[] {\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): SqlFragment[] {\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): SqlFragment[] {\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): SqlFragment[] {\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): SqlFragment {\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: SqlFragment[] = [\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): SqlFragment {\n  const allowedAliases = new Set([ast.start.alias, traversal.nodeAlias]);\n\n  const columns: SqlFragment[] = 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 = compileSelectivePropsExtraction(field, column, dialect);\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): SqlFragment | undefined {\n  if (!ast.orderBy || ast.orderBy.length === 0) {\n    return undefined;\n  }\n\n  const parts: SqlFragment[] = [];\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): SqlFragment | undefined {\n  const parts: SqlFragment[] = [];\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 RecordedInstant } from \"../core/temporal\";\nimport { type TemporalMode } from \"../core/types\";\nimport { type RecursiveCyclePolicy } from \"../query/ast\";\nimport { compileKindFilter } from \"../query/compiler/predicate-utils\";\nimport {\n  type RecordedReadBinding,\n  recordedReadSchemaFor,\n  type SqlSchema,\n} from \"../query/compiler/schema\";\nimport {\n  compileTemporalFilter,\n  currentReadInstant,\n} from \"../query/compiler/temporal\";\nimport { type DialectAdapter } from \"../query/dialect/types\";\nimport { sql, type SqlFragment } from \"../query/sql-fragment\";\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  /** Recorded/system-time timestamp for recorded-pinned reads. */\n  recordedAsOf?: RecordedInstant;\n  dialect: DialectAdapter;\n  /**\n   * The base (live-table) schema. The recorded-relation swap is derived here\n   * from `recordedAsOf`, so the table source and the recorded interval predicate\n   * cannot drift — callers pass their base schema and need not pre-resolve it.\n   */\n  schema: SqlSchema;\n  recordedReadBinding?: RecordedReadBinding;\n}>;\n\nexport function buildReachableCte(\n  options: BuildReachableCteOptions,\n): SqlFragment {\n  const trackPath = options.cyclePolicy === \"prevent\" || options.includePath;\n  const edgeKindFilter = compileKindFilter(\n    sql.raw(\"e.kind\"),\n    options.edgeKinds,\n  );\n  const currentTimestamp = currentReadInstant();\n  const nodeTemporalFilter = compileTemporalFilter({\n    mode: options.temporalMode,\n    asOf: options.asOf,\n    recordedAsOf: options.recordedAsOf,\n    tableAlias: \"n\",\n    currentTimestamp,\n  });\n  const edgeTemporalFilter = compileTemporalFilter({\n    mode: options.temporalMode,\n    asOf: options.asOf,\n    recordedAsOf: options.recordedAsOf,\n    tableAlias: \"e\",\n    currentTimestamp,\n  });\n  // Derive the read schema from the same `recordedAsOf` that drives the temporal\n  // filters above: when a recorded pin is set the node/edge sources become the\n  // recorded relations, matching the `recorded_from/to` interval predicate. One\n  // derivation means the table source and the predicate cannot disagree.\n  const schema = recordedReadSchemaFor(\n    options.schema,\n    options.recordedAsOf,\n    options.recordedReadBinding,\n    \"recorded-recursive-cte\",\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: SqlFragment[] = [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 ${schema.nodesTable} n WHERE n.graph_id = ${options.graphId} AND n.id = ${options.sourceId} AND ${nodeTemporalFilter}`;\n\n  const recursiveColumns: SqlFragment[] = [\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: SqlFragment[] = [\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,\n  });\n\n  return sql`WITH RECURSIVE reachable AS (${baseCase} UNION ALL ${recursiveCase})`;\n}\n\ntype CompileRecursiveBranchOptions = Readonly<{\n  recursiveColumns: readonly SqlFragment[];\n  whereClauses: readonly SqlFragment[];\n  direction: TraversalDirection;\n  forceWorktableOuterJoinOrder: boolean;\n  schema: SqlSchema;\n}>;\n\nfunction compileRecursiveBranch(\n  options: CompileRecursiveBranchOptions,\n): SqlFragment {\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: SqlFragment;\n  whereClauses: readonly SqlFragment[];\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(\n  options: DirectionalBranchOptions,\n): SqlFragment {\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: SqlFragment;\n  whereClauses: readonly SqlFragment[];\n  forceWorktableOuterJoinOrder: boolean;\n  schema: SqlSchema;\n}>;\n\nfunction buildBidirectionalBranch(\n  options: BidirectionalBranchOptions,\n): SqlFragment {\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 * 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 { 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 { type RecordedInstant, 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 {\n  DEFAULT_SQL_SCHEMA,\n  type RecordedReadBinding,\n  recordedReadSchemaFor,\n  type SqlSchema,\n} from \"../query/compiler/schema\";\nimport {\n  compileTemporalFilter,\n  currentReadInstant,\n} 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 { sql, type SqlFragment } from \"../query/sql-fragment\";\nimport { asCompiledRowsSql, markForceCustomPlan } from \"../query/sql-intent\";\nimport { fnv1aBase36 } from \"../utils/hash\";\nimport { truncateToBytes } from \"../utils/identifier\";\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\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> | \"meta\";\n\ntype SubgraphEdgeProjectionField<E extends AnyEdgeType = AnyEdgeType> =\n  EdgeProjectionPropertyKey<E> | \"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  /** @internal Recorded coordinates are supplied by StoreView only. */\n  recordedAsOf?: never;\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 * Subgraph options as seen by the internal executor: identical to the public\n * {@link SubgraphOptions} except the recorded/system-time pin is a branded\n * instant the StoreView seam supplies. The public surface keeps\n * `recordedAsOf?: never`;\n * recorded reads reach the executor only through `store.subgraphAtCoordinate`.\n */\nexport type InternalSubgraphOptions<\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>, \"recordedAsOf\"> &\n  Readonly<{\n    recordedAsOf?: RecordedInstant;\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  recordedAsOf: RecordedInstant | undefined;\n  dialect: DialectAdapter;\n  schema: SqlSchema;\n  recordedReadBinding: RecordedReadBinding | undefined;\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  recordedReadBinding: RecordedReadBinding | undefined;\n  options: InternalSubgraphOptions<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  // `recordedAsOf` reaches here only via the internal `subgraphAtCoordinate`\n  // seam; the public `store.subgraph` rejects it (typed `never`, runtime-guarded\n  // for JS callers) before this executor is reached.\n  const recordedAsOf = options.recordedAsOf;\n  const baseSchema = params.schema ?? DEFAULT_SQL_SCHEMA;\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    recordedAsOf,\n    dialect: params.dialect,\n    schema: recordedReadSchemaFor(\n      baseSchema,\n      recordedAsOf,\n      params.recordedReadBinding,\n      \"recorded-subgraph\",\n    ),\n    recordedReadBinding: params.recordedReadBinding,\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    ...(ctx.recordedAsOf !== undefined && { recordedAsOf: ctx.recordedAsOf }),\n    dialect: ctx.dialect,\n    // Base schema: buildReachableCte derives the recorded swap from recordedAsOf.\n    schema: baseSchema,\n    ...(ctx.recordedReadBinding === undefined ?\n      {}\n    : { recordedReadBinding: ctx.recordedReadBinding }),\n  });\n  const includedIdsCte = buildIncludedIdsCte(ctx);\n\n  // The node and edge fetches both need the traversal closure. Embedding\n  // the recursive CTE in each statement runs the BFS twice; on Postgres\n  // the closure ids are fetched ONCE and passed to both fetches as a\n  // single text[] parameter, filtered via a hashed semi-join\n  // (EXISTS over unnest — measured faster than `= ANY` on the same\n  // closure). SQLite keeps the embedded form: its in-process traversal\n  // is cheap, an id list would bind one parameter per id (bind-budget\n  // pressure), and per-count SQL texts would churn the prepared-statement\n  // cache.\n  let membership: SubgraphMembership;\n  const dialect = ctx.dialect.name;\n  switch (dialect) {\n    case \"postgres\": {\n      const includedIds = await fetchIncludedIds(\n        ctx,\n        reachableCte,\n        includedIdsCte,\n      );\n      const idsArray = textArrayParam(includedIds);\n      membership = {\n        prefix: sql``,\n        idFilter: (column) =>\n          sql`EXISTS (SELECT 1 FROM unnest(${idsArray}) AS tg_included(id) WHERE tg_included.id = ${column})`,\n        parameterDependentPlan: true,\n      };\n      break;\n    }\n    case \"sqlite\": {\n      membership = {\n        prefix: sql`${reachableCte}${includedIdsCte} `,\n        // SQLite: `column IN (subquery)` evaluates via a transient index —\n        // optimal as-is. (Postgres takes the parameterized text[] form above.)\n        idFilter: (column) => sql`${column} IN (SELECT id FROM included_ids)`,\n        parameterDependentPlan: false,\n      };\n      break;\n    }\n    default: {\n      dialect satisfies never;\n      throw new Error(`Unsupported SQL dialect: ${String(dialect)}`);\n    }\n  }\n\n  const [nodeRows, edgeRows] = await Promise.all([\n    fetchSubgraphNodes(ctx, membership, nodeProjectionPlan),\n    fetchSubgraphEdges(ctx, membership, 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>> | 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): SqlFragment {\n  const filters: SqlFragment[] = [];\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\n/**\n * How the node/edge fetches restrict rows to the traversal closure:\n * either a statement prefix re-declaring the recursive CTE with an\n * `included_ids` membership subquery (SQLite), or an empty prefix with a\n * pre-fetched id-array filter (Postgres).\n */\ntype SubgraphMembership = Readonly<{\n  prefix: SqlFragment;\n  idFilter: (column: SqlFragment) => SqlFragment;\n  /**\n   * True in id-array mode: the fetch plans depend on the array\n   * cardinality, so the statements must never fall onto a prepared\n   * generic plan (see markForceCustomPlan).\n   */\n  parameterDependentPlan: boolean;\n}>;\n\n/**\n * Binds a string list as ONE text parameter in Postgres array-literal\n * form, cast to text[]. A single parameter keeps the statement text\n * constant across id counts, and the fetch statements semi-join against\n * `unnest` of the array. (Drizzle would otherwise serialize a JS array\n * param as JSON text.)\n */\nfunction textArrayParam(values: readonly string[]): SqlFragment {\n  const elements = values.map(\n    (value) =>\n      `\"${value.replaceAll(\"\\\\\", \"\\\\\\\\\").replaceAll('\"', String.raw`\\\"`)}\"`,\n  );\n  return sql`${`{${elements.join(\",\")}}`}::text[]`;\n}\n\n/** Runs the traversal once and returns the closure's node ids. */\nasync function fetchIncludedIds(\n  ctx: SubgraphContext,\n  reachableCte: SqlFragment,\n  includedIdsCte: SqlFragment,\n): Promise<readonly string[]> {\n  const rows = await ctx.backend.execute<{ id: string }>(\n    asCompiledRowsSql(\n      sql`${reachableCte}${includedIdsCte} SELECT id FROM included_ids`,\n    ),\n  );\n  return rows.map((row) => row.id);\n}\n\nasync function fetchSubgraphNodes(\n  ctx: SubgraphContext,\n  membership: SubgraphMembership,\n  projectionPlan: ProjectionPlan,\n): Promise<SubgraphNodeFetchRow[]> {\n  const nodeTemporalFilter = compileTemporalFilter({\n    mode: ctx.temporalMode,\n    asOf: ctx.asOf,\n    recordedAsOf: ctx.recordedAsOf,\n    tableAlias: \"n\",\n    currentTimestamp: currentReadInstant(),\n  });\n  const columns: SqlFragment[] = [\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`${membership.prefix}SELECT ${sql.join(columns, sql`, `)} FROM ${ctx.schema.nodesTable} n WHERE n.graph_id = ${ctx.graphId} AND ${nodeTemporalFilter} AND ${membership.idFilter(sql.raw(\"n.id\"))}`;\n  if (membership.parameterDependentPlan) markForceCustomPlan(query);\n\n  return ctx.backend.execute<SubgraphNodeFetchRow>(\n    asCompiledRowsSql(query),\n  ) as Promise<SubgraphNodeFetchRow[]>;\n}\n\nasync function fetchSubgraphEdges(\n  ctx: SubgraphContext,\n  membership: SubgraphMembership,\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    recordedAsOf: ctx.recordedAsOf,\n    tableAlias: \"e\",\n    currentTimestamp: currentReadInstant(),\n  });\n  const columns: SqlFragment[] = [\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`${membership.prefix}SELECT ${sql.join(columns, sql`, `)} FROM ${ctx.schema.edgesTable} e WHERE e.graph_id = ${ctx.graphId} AND ${edgeKindFilter} AND ${edgeTemporalFilter} AND ${membership.idFilter(sql.raw(\"e.from_id\"))} AND ${membership.idFilter(sql.raw(\"e.to_id\"))}`;\n  if (membership.parameterDependentPlan) markForceCustomPlan(query);\n\n  return ctx.backend.execute<SubgraphEdgeFetchRow>(\n    asCompiledRowsSql(query),\n  ) as Promise<SubgraphEdgeFetchRow[]>;\n}\n\nfunction buildMetadataColumns(\n  alias: \"n\" | \"e\",\n  plan: ProjectionPlan,\n  columns: readonly string[],\n): readonly SqlFragment[] {\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(\n  alias: \"n\" | \"e\",\n  plan: ProjectionPlan,\n): SqlFragment {\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 SqlFragment[] {\n  const columns: SqlFragment[] = [];\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 {\n  CompilerInvariantError,\n  ConfigurationError,\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 { sql, type SqlFragment } from \"../sql-fragment\";\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 = (\n  ast: QueryAst,\n  graphId: string,\n) => SqlFragment;\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\ntype RecordedCoordinateKey = string;\n\nfunction queryRecordedCoordinateKey(ast: QueryAst): RecordedCoordinateKey {\n  return ast.recordedAsOf ?? \"live\";\n}\n\nfunction collectQueryRecordedCoordinateKeys(\n  query: ComposableQuery,\n  keys: Set<RecordedCoordinateKey>,\n): void {\n  if (\"__type\" in query) {\n    collectQueryRecordedCoordinateKeys(query.left, keys);\n    collectQueryRecordedCoordinateKeys(query.right, keys);\n    return;\n  }\n  keys.add(queryRecordedCoordinateKey(query));\n}\n\nfunction assertUniformSetOperationRecordedCoordinates(op: SetOperation): void {\n  const keys = new Set<RecordedCoordinateKey>();\n  collectQueryRecordedCoordinateKeys(op, keys);\n  if (keys.size <= 1) return;\n  throw new ConfigurationError(\n    \"Cannot combine queries with different recorded-time coordinates in a set \" +\n      \"operation: each operand reads either the live tables or the recorded \" +\n      \"relation at one instant, so mixing live with recorded (or two different \" +\n      \"recorded instants) is rejected. Valid-time differences are allowed.\",\n    { code: \"SET_OPERATION_RECORDED_COORDINATE_MISMATCH\" },\n    {\n      suggestion:\n        \"Build every operand from the same Store or recorded StoreView coordinate before calling union/intersect/except.\",\n    },\n  );\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 `SqlFragment` for the set operation\n */\nexport function compileSetOperation(\n  op: SetOperation,\n  graphId: string,\n  dialect: DialectAdapter,\n  compileQuery: QueryCompilerFunction,\n  vectorStrategy?: VectorStrategy,\n): SqlFragment {\n  assertUniformSetOperationRecordedCoordinates(op);\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): SqlFragment {\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): SqlFragment {\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): SqlFragment {\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): SqlFragment[] {\n  const clauses: SqlFragment[] = [];\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: SqlFragment[] = [];\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 { assertRecordedQueryDoesNotUseCurrentIndexes } from \"./recorded-current-index-guard\";\nimport {\n  addRequiredColumn,\n  findSelectivePropsFieldForFieldRef,\n  isIdFieldRef,\n  mapSelectiveSystemFieldToColumn,\n  markFieldRefAsRequired,\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\n/**\n * Collects the columns each alias must carry out of its CTE.\n *\n * `includeProjection` (default true) folds in the SELECT-list fields. The late\n * materialization path passes `false` to build a *lean* candidate CTE that\n * carries only identity, ordering, and predicate columns — the projection-only\n * columns (e.g. a large `content` prop) are deferred and re-fetched by identity\n * for the surviving rows, not materialized for every candidate.\n */\nexport function collectRequiredColumnsByAlias(\n  ast: QueryAst,\n  options?: Readonly<{ includeProjection?: boolean }>,\n): RequiredColumnsByAlias {\n  const includeProjection = options?.includeProjection ?? true;\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  const hasSelectiveFields = (ast.selectiveFields?.length ?? 0) > 0;\n\n  if (includeProjection) {\n    if (hasSelectiveFields) {\n      for (const field of ast.selectiveFields ?? []) {\n        if (field.isSystemField) {\n          addRequiredColumn(\n            requiredColumnsByAlias,\n            field.alias,\n            mapSelectiveSystemFieldToColumn(field.field),\n          );\n        }\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\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      if (\n        findSelectivePropsFieldForFieldRef(\n          ast.selectiveFields,\n          orderSpec.field,\n        ) !== undefined\n      ) {\n        continue;\n      }\n      markFieldRefAsRequired(requiredColumnsByAlias, orderSpec.field);\n    }\n  }\n\n  if (ast.having) {\n    markPredicateFieldsAsRequired(requiredColumnsByAlias, ast.having);\n  }\n\n  if (!hasSelectiveFields) {\n    for (const predicate of ast.predicates) {\n      markPredicateFieldsAsRequired(\n        requiredColumnsByAlias,\n        predicate.expression,\n      );\n    }\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  assertRecordedQueryDoesNotUseCurrentIndexes(\n    state.ast,\n    state.vectorPredicate,\n    state.fulltextPredicate,\n  );\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(currentState.ast, ctx.readInstant);\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","import { requireDefined } from \"../../utils/presence\";\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 ExternalRecordedReadSource,\n  recordedRelation,\n  type RecordedRelationOptions,\n  type ResolvedSqlTableNames,\n  type SqlSchema,\n  type SqlTableNames,\n} from \"./schema\";\nexport {\n  compileTemporalFilter,\n  extractTemporalOptions,\n  type TemporalFilterOptions,\n} from \"./temporal\";\nimport { type ReadInstantMode, withPinnedReadInstant } from \"./temporal\";\n\n// Re-export dialect helpers and types\nexport { getDialect } from \"../dialect\";\nexport { type DialectAdapter, type SqlDialect } from \"../dialect/types\";\n\nimport { CompilerInvariantError, ConfigurationError } from \"../../errors\";\nimport {\n  type AggregateExpr,\n  type FulltextMatchPredicate,\n  type HybridFusionOptions,\n  type QueryAst,\n  type SelectiveField,\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 { sql, type SqlFragment } from \"../sql-fragment\";\nimport {\n  annIndexScanTypes,\n  asCompiledSelectSql,\n  type CompiledSelectSql,\n  markAnnIndexScan,\n} from \"../sql-intent\";\nimport { emitStandardQuerySql } from \"./emitter\";\nimport {\n  buildLateMaterializedOuterOrderBy,\n  buildLateMaterializedOuterProjection,\n  buildLateMaterializedTopKCte,\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  LATE_MAT_TOPK_CTE_ALIAS,\n  lateMaterializedPhysicalAlias,\n  lateMaterializedProjectedNodeAliases,\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 RecordedReadBinding,\n  recordedReadSchemaFor,\n  requireSqlSchema,\n  type SqlSchema,\n  type VectorSlotMap,\n} from \"./schema\";\nimport { compileSetOperation as compileSetOp } from \"./set-operations\";\nimport {\n  collectRequiredColumnsByAlias,\n  runStandardQueryPassPipeline,\n  shouldMaterializeTraversalCte,\n} from \"./standard-pass-pipeline\";\nimport {\n  findSelectivePropsFieldForFieldRef,\n  isAggregateExpr,\n  isIdFieldRef,\n  mapSelectiveSystemFieldToColumn,\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 from createSqlSchema(...). 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  /** Per-kind declared fulltext language (see buildFulltextLanguages). */\n  fulltextLanguages?: ReadonlyMap<string, string> | undefined;\n  /**\n   * Recorded read relation to use when the AST carries `recordedAsOf`.\n   * Supplying a recorded timestamp without this binding is rejected so the\n   * compiler never silently swaps to TypeGraph's built-in history tables when\n   * the store was only configured for live/valid-time reads.\n   */\n  recordedReadBinding?: RecordedReadBinding | undefined;\n  /**\n   * How the \"current\" valid-time read instant is emitted. Defaults to\n   * `\"literal\"` (a value frozen at compile time). The query builder's\n   * compiled template cache passes `\"placeholder\"` so the instant is a\n   * reserved execution-time slot, letting one compiled statement be reused\n   * across executions with a fresh \"now\" each call. See {@link ReadInstantMode}.\n   */\n  readInstant?: ReadInstantMode | 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 TypeGraph `SqlFragment` ready for backend 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): CompiledSelectSql {\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 baseSchema =\n    options_.schema === undefined ?\n      DEFAULT_SQL_SCHEMA\n    : requireSqlSchema(options_.schema, \"compileQuery schema\");\n  const schema = recordedReadSchemaFor(\n    baseSchema,\n    ast.recordedAsOf,\n    options_.recordedReadBinding,\n    \"recorded-query\",\n  );\n\n  const adapter = resolveDialectAdapter(dialect, options_.fulltextStrategy);\n  // Collects the ANN slot index types the emitter compiles engine-form\n  // branches for; a non-empty set brands the finished statement so the\n  // backend applies the pgvector iterative-scan GUCs around execution.\n  // (Sub-compiled correlated queries brand their own `SqlFragment` objects, which\n  // are embedded by text — an ANN branch inside a subquery therefore\n  // does not surface the brand; the inline vector predicate compiles at\n  // the top level, so this is theoretical today.)\n  const annIndexTypes = new Set<string>();\n  const ctx: PredicateCompilerContext = {\n    dialect: adapter,\n    schema,\n    annIndexTypes,\n    readInstant: options_.readInstant ?? \"literal\",\n    compileQuery: (subAst, subGraphId) =>\n      compileQuery(\n        inheritRecordedAsOf(subAst, ast.recordedAsOf),\n        subGraphId,\n        propagateOptions(options_),\n      ),\n    ...(options_.vectorStrategy === undefined ?\n      {}\n    : { vectorStrategy: options_.vectorStrategy }),\n    windowFunctions: options_.windowFunctions ?? true,\n    ...(options_.vectorSlots === undefined ?\n      {}\n    : { vectorSlots: options_.vectorSlots }),\n    ...(options_.fulltextLanguages === undefined ?\n      {}\n    : { fulltextLanguages: options_.fulltextLanguages }),\n  };\n\n  function finish(compiled: SqlFragment): CompiledSelectSql {\n    if (annIndexTypes.size > 0) {\n      markAnnIndexScan(compiled, [...annIndexTypes]);\n    }\n    return asCompiledSelectSql(compiled);\n  }\n\n  // Check for variable-length traversals\n  if (hasVariableLengthTraversal(ast)) {\n    const lowered = tryLowerSingleHopRecursiveTraversal(ast);\n    if (lowered !== undefined) {\n      return finish(compileStandardQuery(lowered, graphId, ctx));\n    }\n    return finish(compileVariableLengthQuery(ast, graphId, ctx));\n  }\n\n  // Standard query compilation\n  return finish(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 = requireDefined(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 TypeGraph `SqlFragment`\n */\nexport function compileSetOperation(\n  op: SetOperation,\n  graphId: string,\n  options: CompileQueryOptions | SqlDialect = \"sqlite\",\n): CompiledSelectSql {\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  // Operand statements carry their own ANN brand, but the set-operation\n  // wrapper is a fresh `SqlFragment` object and the backend only inspects the\n  // object it executes — so operand brands are merged onto the final\n  // statement here, or a union with an approximate operand would skip\n  // the pgvector GUC wrapper.\n  const annIndexTypes = new Set<string>();\n  const compileOperand = (ast: QueryAst, gid: string): CompiledSelectSql => {\n    const compiled = compileQuery(ast, gid, propagateOptions(options_));\n    for (const indexType of annIndexScanTypes(compiled) ?? []) {\n      annIndexTypes.add(indexType);\n    }\n    return compiled;\n  };\n  // One statement, one \"current\" instant. Each operand compiles its own\n  // temporal filter, so without this pin an INTERSECT/EXCEPT could bind two\n  // clock samples microseconds apart and disagree about a row created between\n  // them.\n  const combined = withPinnedReadInstant(() =>\n    compileSetOp(op, graphId, adapter, compileOperand, options_.vectorStrategy),\n  );\n  if (annIndexTypes.size > 0) {\n    markAnnIndexScan(combined, [...annIndexTypes]);\n  }\n  return asCompiledSelectSql(combined);\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/**\n * Reconciles the enclosing query's recorded-time pin with an EXISTS/IN\n * subquery's so the whole statement reads one coordinate, never a silent mix\n * of recorded and live tables. Symmetric with the uniformity guard on set\n * operations ({@link assertUniformSetOperationRecordedCoordinates}):\n *\n * - **Recorded outer, unpinned subquery** — propagate the outer pin so the\n *   subquery reads the recorded relations as of the same instant (a subquery\n *   built from the live store carries none and would otherwise cross the axis\n *   and skip the current-index guard).\n * - **Recorded outer, differently-pinned subquery** — coordinate mismatch,\n *   rejected.\n * - **Live outer, recorded subquery** — also a mismatch: the subquery would\n *   read the recorded relations while the outer reads live tables. Rejected\n *   rather than silently honored, the same way the set-operation guard rejects\n *   a live ∪ recorded mix.\n */\nfunction inheritRecordedAsOf(\n  subAst: QueryAst,\n  recordedAsOf: string | undefined,\n): QueryAst {\n  if (recordedAsOf === undefined) {\n    if (subAst.recordedAsOf !== undefined) {\n      throw recordedSubqueryCoordinateMismatch(\n        \"Cannot nest a recorded-time subquery inside a live query without a recorded-time coordinate.\",\n      );\n    }\n    return subAst;\n  }\n  if (subAst.recordedAsOf === undefined) return { ...subAst, recordedAsOf };\n  if (subAst.recordedAsOf !== recordedAsOf) {\n    throw recordedSubqueryCoordinateMismatch(\n      \"Cannot nest a subquery with a different recorded-time coordinate than the enclosing query.\",\n    );\n  }\n  return subAst;\n}\n\nfunction recordedSubqueryCoordinateMismatch(\n  message: string,\n): ConfigurationError {\n  return new ConfigurationError(\n    message,\n    { code: \"SUBQUERY_TEMPORAL_COORDINATE_MISMATCH\" },\n    {\n      suggestion:\n        \"Build the subquery from the same Store or StoreView coordinate as the enclosing query.\",\n    },\n  );\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    ...(options_.fulltextLanguages === undefined ?\n      {}\n    : { fulltextLanguages: options_.fulltextLanguages }),\n    ...(options_.recordedReadBinding === undefined ?\n      {}\n    : { recordedReadBinding: options_.recordedReadBinding }),\n    ...(options_.readInstant === undefined ?\n      {}\n    : { readInstant: options_.readInstant }),\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 = requireDefined(ast.traversals[0]);\n  if ((traversal.inverseEdgeKinds?.length ?? 0) > 0) {\n    return undefined;\n  }\n\n  const groupField = requireDefined(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): SqlFragment | 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: SqlFragment[] = [];\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 of either kind. ORDER BY over the full result requires\n  //     the full result. `ast.orderBy` is FieldRef-based row ordering (the\n  //     fast path already restricts it to the start alias, but we still\n  //     need every row to sort correctly); `ast.aggregateOrderBy` is\n  //     output-alias-based ordering added via `ExecutableAggregateQuery\n  //     .orderBy()` — sorting by an aggregate value (e.g. `employeeCount`)\n  //     needs every start row counted first, so pushing LIMIT into the\n  //     start CTE before aggregation would pick an arbitrary subset of\n  //     rows to count rather than the true top-N.\n  //   - LIMIT is defined. OFFSET is carried with it.\n  const startCteLimit =\n    (\n      traversal.optional &&\n      ast.orderBy === undefined &&\n      ast.aggregateOrderBy === undefined &&\n      ast.limit !== undefined\n    ) ?\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  // Also picks up `ast.aggregateOrderBy` (ORDER BY output-alias entries\n  // added via `ExecutableAggregateQuery.orderBy()`) with no extra handling\n  // here: the fast path's projection above always re-aliases every\n  // projected column to its final output name, so an alias reference\n  // resolves the same way it would on the general query path.\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 * The start CTE followed by one CTE per traversal — the candidate-set prefix\n * shared by the flat plan and the late-materialization plan (which feeds it a\n * lean AST/column set and no per-traversal limit).\n */\nfunction buildStandardStartAndTraversalCtes(\n  input: Readonly<{\n    ast: QueryAst;\n    carryForwardPreviousColumns: boolean;\n    ctx: PredicateCompilerContext;\n    graphId: string;\n    predicateIndex: PredicateIndex;\n    requiredColumnsByAlias: RequiredColumnsByAlias | undefined;\n    temporalFilterPass: TemporalFilterPass;\n    traversalLimit: number | undefined;\n  }>,\n): SqlFragment[] {\n  const {\n    ast,\n    carryForwardPreviousColumns,\n    ctx,\n    graphId,\n    predicateIndex,\n    requiredColumnsByAlias,\n    temporalFilterPass,\n    traversalLimit,\n  } = input;\n  const ctes: SqlFragment[] = [\n    buildStandardStartCte({\n      ast,\n      ctx,\n      graphId,\n      predicateIndex,\n      requiredColumnsByAlias,\n      temporalFilterPass,\n    }),\n  ];\n  for (let index = 0; index < ast.traversals.length; index++) {\n    ctes.push(\n      buildStandardTraversalCte({\n        ast,\n        carryForwardPreviousColumns,\n        ctx,\n        graphId,\n        materializeCte: shouldMaterializeTraversalCte(\n          ctx.dialect,\n          ast.traversals.length,\n          index,\n        ),\n        predicateIndex,\n        requiredColumnsByAlias,\n        temporalFilterPass,\n        traversalIndex: index,\n        traversalLimit,\n      }),\n    );\n  }\n  return ctes;\n}\n\ntype LateMaterializationPlan = Readonly<{\n  leanAst: QueryAst;\n  limit: number;\n  offset: number | undefined;\n}>;\n\n/**\n * A selective field that resolves to a node's identity (`id`/`kind`) — already\n * carried in the topK CTE, so it needs no deferred re-fetch.\n */\nfunction selectiveFieldIsIdentity(field: SelectiveField): boolean {\n  if (!field.isSystemField) {\n    return false;\n  }\n  const column = mapSelectiveSystemFieldToColumn(field.field);\n  return column === \"id\" || column === \"kind\";\n}\n\n/**\n * Decides whether a query is eligible for late materialization and, if so,\n * produces the lean AST whose CTEs carry only identity, ordering, and predicate\n * columns. Returns undefined (fall back to the flat plan) for anything outside\n * the v1 envelope — see the inline gates.\n */\nfunction resolveLateMaterializationPlan(\n  ast: QueryAst,\n): LateMaterializationPlan | undefined {\n  // Recorded-time reads swap `ctx.schema.nodesTable` to the recorded history\n  // relation (see `recordedReadSchemaFor`), where `(graph_id, kind, id)` is\n  // NOT unique — one row per recorded interval. The outer re-fetch joins on\n  // exactly that key with no temporal predicate, so it would match every\n  // historical version of each survivor (duplicate rows, stale props).\n  if (ast.recordedAsOf !== undefined) {\n    return undefined;\n  }\n\n  // v1 targets the selective `.select()` path. The non-selective path would\n  // have to carry the full `props` blob into the lean CTE to order by a prop,\n  // which defeats the deferral — left to a follow-up.\n  const selectiveFields = ast.selectiveFields;\n  if (selectiveFields === undefined || selectiveFields.length === 0) {\n    return undefined;\n  }\n\n  // The transform only pays off when rows past the LIMIT are discarded before\n  // their deferred columns are materialized — so both ORDER BY and a positive\n  // LIMIT must be present.\n  const orderBy = ast.orderBy;\n  if (orderBy === undefined || orderBy.length === 0) {\n    return undefined;\n  }\n  if (ast.limit === undefined || ast.limit <= 0) {\n    return undefined;\n  }\n\n  // Aggregation owns the count fast path / group-by shape, not this transform.\n  if (ast.groupBy !== undefined || ast.having !== undefined) {\n    return undefined;\n  }\n  if (ast.aggregateOrderBy !== undefined && ast.aggregateOrderBy.length > 0) {\n    return undefined;\n  }\n\n  // Optional (LEFT JOIN) traversals yield NULL-identity candidate rows that the\n  // outer identity re-join would drop. Out of v1 scope.\n  if (ast.traversals.some((traversal) => traversal.optional)) {\n    return undefined;\n  }\n\n  const nodeAliases = new Set<string>([\n    ast.start.alias,\n    ...ast.traversals.map((traversal) => traversal.nodeAlias),\n  ]);\n\n  // Every projected and ordered field must resolve to a node alias — edge\n  // fields live in the traversal CTE keyed differently, a follow-up.\n  for (const field of selectiveFields) {\n    if (!nodeAliases.has(field.alias)) {\n      return undefined;\n    }\n  }\n  for (const orderSpec of orderBy) {\n    if (!nodeAliases.has(orderSpec.field.alias)) {\n      return undefined;\n    }\n  }\n\n  // Sort-key props fields must stay in the lean CTE so the topK can order by\n  // them; everything else non-identity is deferred to the outer re-fetch.\n  const orderReferenced = new Set<SelectiveField>();\n  for (const orderSpec of orderBy) {\n    const matched = findSelectivePropsFieldForFieldRef(\n      selectiveFields,\n      orderSpec.field,\n    );\n    if (matched !== undefined) {\n      orderReferenced.add(matched);\n    }\n  }\n\n  // Worth doing only if some projected column is genuinely deferrable: a\n  // non-identity field that isn't already carried as a sort key.\n  const hasDeferredColumn = selectiveFields.some(\n    (field) => !selectiveFieldIsIdentity(field) && !orderReferenced.has(field),\n  );\n  if (!hasDeferredColumn) {\n    return undefined;\n  }\n\n  const prunedSelectiveFields = selectiveFields.filter(\n    (field) => field.isSystemField || orderReferenced.has(field),\n  );\n\n  return {\n    leanAst: { ...ast, selectiveFields: prunedSelectiveFields },\n    limit: ast.limit,\n    offset: ast.offset,\n  };\n}\n\n/**\n * The outer FROM clause: the topK CTE joined to the physical node table for each\n * projected alias, keyed on `(graph_id, kind, id)`. Sound only because that key\n * is the live nodes PK (one row per identity, the exact row the topK already\n * validated for temporal/soft-delete visibility). Recorded-time reads are gated\n * out in `resolveLateMaterializationPlan` — under a recorded pin `nodesTable`\n * is the history relation where this key matches every version.\n */\nfunction buildLateMaterializedOuterFromClause(\n  ast: QueryAst,\n  graphId: string,\n  ctx: PredicateCompilerContext,\n): SqlFragment {\n  const topk = sql.raw(LATE_MAT_TOPK_CTE_ALIAS);\n  const joins = lateMaterializedProjectedNodeAliases(ast).map((alias) => {\n    const physical = sql.raw(lateMaterializedPhysicalAlias(alias));\n    return sql`JOIN ${ctx.schema.nodesTable} ${physical} ON ${physical}.graph_id = ${graphId} AND ${physical}.kind = ${topk}.${sql.raw(`${alias}_kind`)} AND ${physical}.id = ${topk}.${sql.raw(`${alias}_id`)}`;\n  });\n  return joins.length === 0 ?\n      sql`FROM ${topk}`\n    : sql`FROM ${topk} ${sql.join(joins, sql` `)}`;\n}\n\nfunction compileLateMaterializedQuery(\n  ast: QueryAst,\n  graphId: string,\n  ctx: PredicateCompilerContext,\n  logicalPlan: LogicalPlan,\n  predicateIndex: PredicateIndex,\n  temporalFilterPass: TemporalFilterPass,\n  collapsedTraversalCteAlias: string | undefined,\n  shouldCollapseSelectiveTraversalRowset: boolean,\n): SqlFragment | undefined {\n  const plan = resolveLateMaterializationPlan(ast);\n  if (plan === undefined) {\n    return undefined;\n  }\n\n  const { leanAst, limit, offset } = plan;\n  const { dialect } = ctx;\n  const leanRequiredColumns = collectRequiredColumnsByAlias(leanAst, {\n    includeProjection: false,\n  });\n\n  const ctes = buildStandardStartAndTraversalCtes({\n    ast: leanAst,\n    carryForwardPreviousColumns: shouldCollapseSelectiveTraversalRowset,\n    ctx,\n    graphId,\n    predicateIndex,\n    requiredColumnsByAlias: leanRequiredColumns,\n    temporalFilterPass,\n    traversalLimit: undefined,\n  });\n  ctes.push(\n    buildLateMaterializedTopKCte({\n      ast: leanAst,\n      dialect,\n      fromClause: buildStandardFromClause({\n        ast: leanAst,\n        ...(collapsedTraversalCteAlias === undefined ?\n          {}\n        : { collapsedTraversalCteAlias }),\n      }),\n      limit,\n      offset,\n      ...(collapsedTraversalCteAlias === undefined ?\n        {}\n      : { collapsedTraversalCteAlias }),\n    }),\n  );\n\n  const orderBy = buildLateMaterializedOuterOrderBy(ast);\n  return emitStandardQuerySql({\n    ctes,\n    fromClause: buildLateMaterializedOuterFromClause(ast, graphId, ctx),\n    ...(orderBy === undefined ? {} : { orderBy }),\n    logicalPlan: stripLimitOffsetFromPlan(logicalPlan),\n    projection: buildLateMaterializedOuterProjection(ast, dialect),\n  });\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) => SqlFragment;\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): SqlFragment {\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): SqlFragment | 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): SqlFragment {\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    const lateMaterializedSql = compileLateMaterializedQuery(\n      ast,\n      graphId,\n      ctx,\n      logicalPlan,\n      predicateIndex,\n      temporalFilterPass,\n      collapsedTraversalCteAlias,\n      shouldCollapseSelectiveTraversalRowset,\n    );\n    if (lateMaterializedSql) {\n      return lateMaterializedSql;\n    }\n  }\n\n  // Start + traversal candidate CTEs\n  const ctes = buildStandardStartAndTraversalCtes({\n    ast,\n    carryForwardPreviousColumns: shouldCollapseSelectiveTraversalRowset,\n    ctx,\n    graphId,\n    predicateIndex,\n    requiredColumnsByAlias,\n    temporalFilterPass,\n    traversalLimit: traversalCteLimit,\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","/**\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(\n        `Invalid cursor direction: ${String(raw[\"d\"])}`,\n        {\n          issues: [\n            {\n              path: \"cursor\",\n              message: `Direction must be \"f\" (forward) or \"b\" (backward)`,\n            },\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 { requireDefined } from \"../../utils/presence\";\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 = requireDefined(orderBy[index_]);\n      const value = values[index_];\n      andConditions.push(buildEqualityPredicate(spec.field, value));\n    }\n\n    // Current column uses comparison\n    const currentSpec = requireDefined(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(requireDefined(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      requireDefined(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 = requireDefined(orderedRows[0]);\n    const lastRow = requireDefined(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 { compareStrings } from \"../../utils/compare\";\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 = compareStrings(a.alias, b.alias);\n      if (aliasCompare !== 0) return aliasCompare;\n      return compareStrings(a.field, 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 { compareStrings, 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) => compareStrings(a.alias, 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 * Compiled-SQL template cache keyed on the reserved read-instant placeholder.\n *\n * A \"current\" (live) query bakes its valid-time read instant into the compiled\n * SQL as a bound parameter. Recompiling the whole AST on every execution just\n * to refresh that one value — the behavior PR #246 introduced to fix a frozen\n * \"now\" — is pure waste: the SQL text is byte-identical across calls, only the\n * instant differs. This module compiles the statement ONCE in `\"placeholder\"`\n * mode (the read instant becomes {@link CURRENT_READ_INSTANT_PLACEHOLDER}\n * instead of a frozen value), caches the resulting `{ sql, params }`, and fills\n * a fresh instant into the placeholder on every execution via\n * {@link fillTemplateParams}.\n *\n * The fast path requires a backend that can both compile a TypeGraph `SqlFragment`\n * to text (`compileSql`) and execute pre-compiled text (`executeRaw`). Custom\n * or async backends without those members fall back to per-call recompilation,\n * exactly as before.\n */\nimport { ConfigurationError } from \"../../errors\";\nimport { nowIso } from \"../../utils/date\";\nimport { type ComposableQuery, type QueryAst } from \"../ast\";\nimport { compileQuery, type CompileQueryOptions } from \"../compiler/index\";\nimport { CURRENT_READ_INSTANT_PLACEHOLDER } from \"../compiler/temporal\";\nimport { bindSqlValue } from \"../dialect/profile\";\nimport { type SqlDialect } from \"../dialect/types\";\nimport { isSqlPlaceholder, type SqlFragment } from \"../sql-fragment\";\nimport { type CompiledSelectSql, isRawExecutable } from \"../sql-intent\";\n\n/**\n * A compiled statement ready for `executeRaw`: SQL text plus a positional\n * parameter list that may still contain unfilled named placeholder objects\n * (the read instant, and any user `param()` refs on a prepared query).\n */\nexport type CompiledTemplate = Readonly<{\n  sql: string;\n  params: readonly unknown[];\n}>;\n\n/** Compiles a TypeGraph `SqlFragment` to `{ sql, params }` without executing. */\ntype CompileSqlFunction = (query: SqlFragment) => CompiledTemplate;\n\n/**\n * The receiver-free slice of a backend used to build a template.\n */\nexport type SqlCompilerBackend = Readonly<{ compileSql?: CompileSqlFunction }>;\n\n/** Whether a compiled template carries the reserved read-instant placeholder. */\nfunction templateHasReadInstant(template: CompiledTemplate): boolean {\n  return template.params.some(\n    (parameter) =>\n      isSqlPlaceholder(parameter) &&\n      parameter.name === CURRENT_READ_INSTANT_PLACEHOLDER,\n  );\n}\n\n/**\n * True when a query's compiled SQL must bind a fresh \"current\" instant per\n * execution — i.e. it reads valid-time \"current\" and is not pinned to a\n * recorded instant (a recorded pin replaces the wall clock with a fixed\n * instant). `asOf`, `includeEnded`, and `includeTombstones` reads bind no\n * read instant at all, so their compiled statement is stable and cacheable\n * verbatim.\n */\nfunction queryAstNeedsCurrentReadInstant(ast: QueryAst): boolean {\n  return ast.temporalMode.mode === \"current\" && ast.recordedAsOf === undefined;\n}\n\n/** {@link queryAstNeedsCurrentReadInstant} lifted over a set operation's operands. */\nexport function composableNeedsCurrentReadInstant(\n  query: ComposableQuery,\n): boolean {\n  if (\"__type\" in query) {\n    return (\n      composableNeedsCurrentReadInstant(query.left) ||\n      composableNeedsCurrentReadInstant(query.right)\n    );\n  }\n  return queryAstNeedsCurrentReadInstant(query);\n}\n\ntype BuildReadInstantTemplateArguments = Readonly<{\n  /** Compiles the statement in `\"placeholder\"` read-instant mode. */\n  compile: () => CompiledSelectSql;\n  /**\n   * The backend, whose `compileSql` produces the cacheable text. When it (or\n   * its `compileSql`) is absent the backend has no raw-execution fast path, so\n   * there is no template to build.\n   */\n  backend: SqlCompilerBackend | undefined;\n  /**\n   * Whether the source query requires a fresh instant per execution (see\n   * {@link queryAstNeedsCurrentReadInstant}). Used as a correctness guard: a\n   * query that needs a read instant but whose compiled template carries no\n   * read-instant placeholder has frozen \"now\" into a literal, so it is NOT\n   * safe to cache — the caller must recompile per call instead.\n   */\n  needsReadInstant: boolean;\n}>;\n\n/**\n * Compiles the reusable placeholder template, or returns `undefined` when the\n * statement cannot be safely cached (or the backend has no raw-execution fast\n * path).\n *\n * The `needsReadInstant` guard enforces the lesson of the #246 freshness\n * regression: if the query needs a \"current\" instant yet the placeholder-mode\n * compilation did not templatize one, some read-instant emission escaped the\n * placeholder seam and would freeze into the cache. Every \"current\" query in\n * the builder's compile pipeline binds its instant through the one placeholder\n * seam, so this branch is unreachable by construction today; it exists to fail\n * safe — degrading to correct-but-uncached — if a future emission path forgets\n * the mode, rather than resting the invariant on a whole-compiler proof.\n */\nexport function buildReadInstantTemplate(\n  args: BuildReadInstantTemplateArguments,\n): CompiledTemplate | undefined {\n  const { backend } = args;\n  if (backend?.compileSql === undefined) return undefined;\n\n  const compiled = args.compile();\n  // A statement whose execution semantics ride on the compiled SQL OBJECT\n  // (pgvector ANN GUCs, force-custom-plan) loses them when flattened to raw\n  // text, so it can't take the executeRaw fast path — the caller falls back to\n  // backend.execute, which honors the brand. See isRawExecutable.\n  if (!isRawExecutable(compiled)) return undefined;\n\n  const template = backend.compileSql(compiled);\n  if (args.needsReadInstant && !templateHasReadInstant(template)) {\n    return undefined;\n  }\n  return template;\n}\n\n/**\n * Convenience over {@link buildReadInstantTemplate} for a standard (non\n * set-operation) query: compiles `ast` in placeholder mode via\n * {@link compileQuery} and derives {@link queryAstNeedsCurrentReadInstant}.\n * Set operations call {@link buildReadInstantTemplate} directly with their own\n * compile function and composable need-check.\n */\nexport function buildQueryTemplate(\n  ast: QueryAst,\n  graphId: string,\n  compileOptions: CompileQueryOptions,\n  backend: SqlCompilerBackend | undefined,\n): CompiledTemplate | undefined {\n  return buildReadInstantTemplate({\n    compile: () =>\n      compileQuery(ast, graphId, {\n        ...compileOptions,\n        readInstant: \"placeholder\",\n      }),\n    backend,\n    needsReadInstant: queryAstNeedsCurrentReadInstant(ast),\n  });\n}\n\n/**\n * Resolves a template's positional parameters for `executeRaw`, replacing\n * every {@link Placeholder} with a concrete value:\n *\n * - the reserved read-instant placeholder → a single fresh {@link nowIso}\n *   sampled once and shared by every occurrence, preserving the \"one instant\n *   per statement\" invariant the literal path guaranteed;\n * - a user `param()` placeholder → its binding, mapped the same way the\n *   compile path binds a literal (Date → ISO string; everything else through\n *   the dialect's `bindValue`).\n */\nexport function fillTemplateParams(\n  params: readonly unknown[],\n  bindings: Readonly<Record<string, unknown>>,\n  dialect: SqlDialect,\n): unknown[] {\n  let readInstant: string | undefined;\n  return params.map((parameter) => {\n    if (!isSqlPlaceholder(parameter)) return parameter;\n\n    const name = parameter.name;\n    if (name === CURRENT_READ_INSTANT_PLACEHOLDER) {\n      readInstant ??= nowIso();\n      return readInstant;\n    }\n\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 bindSqlValue(value, dialect);\n  });\n}\n","/**\n * PreparedQuery — a pre-validated, parameterized query.\n *\n * Created via `ExecutableQuery.prepare()`. Builds and structurally validates\n * the query AST once at prepare time (so a malformed query fails fast, before\n * the first `execute()`).\n *\n * Fast path: when the backend can compile and run raw SQL (`compileSql` +\n * `executeRaw`), the statement is compiled ONCE into a cached template whose\n * \"current\" read instant and user `param()` refs are reserved placeholders\n * (see {@link buildReadInstantTemplate}). Every `execute()` fills those\n * placeholders — a fresh instant plus the call's bindings — and runs the\n * cached SQL text directly, so a reused prepared query never recompiles and\n * never freezes \"now\" the way a cached literal instant would (the #246\n * regression).\n *\n * Fallback: on a backend without raw execution (custom/async), substitutes\n * parameter refs into the AST, compiles fresh per call, and executes via the\n * standard `backend.execute` path.\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 { 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  buildQueryTemplate,\n  type CompiledTemplate,\n  fillTemplateParams,\n} from \"./read-instant-template\";\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// PreparedQuery\n// ============================================================\n\ntype PreparedQueryConfig<R> = Readonly<{\n  ast: QueryAst;\n  unoptimizedAst: QueryAst;\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-validated, parameterized query — see the module doc comment above for\n * how a reused prepared query runs a cached SQL template with a fresh read\n * instant filled per call.\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 #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   * Per-AST cached placeholder template, keyed by AST reference so the\n   * optimized (`#ast`) and unoptimized (`#unoptimizedAst`) variants cache\n   * independently. A cached `undefined` records \"no fast-path template\" (the\n   * backend lacks `compileSql`, or the statement was not safely cacheable) so\n   * we don't rebuild it on every call.\n   */\n  readonly #templateCache = new Map<QueryAst, CompiledTemplate | undefined>();\n\n  constructor(config: PreparedQueryConfig<R>) {\n    this.#ast = config.ast;\n    this.#unoptimizedAst = config.unoptimizedAst;\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  /**\n   * The cached placeholder template for `ast`, or `undefined` when no fast\n   * path applies. Compiled once (in placeholder mode) and reused across every\n   * `execute()`; the read instant is refreshed per call by\n   * {@link fillTemplateParams}, never frozen into the cache.\n   */\n  #template(ast: QueryAst): CompiledTemplate | undefined {\n    if (this.#templateCache.has(ast)) return this.#templateCache.get(ast);\n    const template = this.#buildTemplate(ast);\n    this.#templateCache.set(ast, template);\n    return template;\n  }\n\n  #buildTemplate(ast: QueryAst): CompiledTemplate | undefined {\n    return buildQueryTemplate(\n      ast,\n      this.#graphId,\n      this.#compileOptions,\n      this.#backend,\n    );\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    return this.#executeRows(this.#ast, bindings);\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    return this.#executeRows(this.#unoptimizedAst, bindings);\n  }\n\n  /**\n   * Runs one AST variant with the given bindings. Prefers the cached template\n   * + `executeRaw` fast path; falls back to substituting bindings into the AST\n   * and compiling fresh when the backend cannot execute raw SQL text.\n   */\n  async #executeRows(\n    ast: QueryAst,\n    bindings: Readonly<Record<string, unknown>>,\n  ): Promise<readonly Record<string, unknown>[]> {\n    const executeRaw = this.#backend.executeRaw;\n    const template = executeRaw === undefined ? undefined : this.#template(ast);\n    if (template !== undefined && executeRaw !== undefined) {\n      const params = fillTemplateParams(\n        template.params,\n        bindings,\n        this.#dialect,\n      );\n      const rawRows = await executeRaw<Record<string, unknown>>(\n        template.sql,\n        params,\n      );\n      return transformPathColumns(rawRows, this.#state, this.#dialect);\n    }\n\n    const concreteAst = substituteParameters(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\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.recordedAsOf !== undefined && {\n      recordedAsOf: state.recordedAsOf,\n    }),\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.aggregateOrderBy.length > 0 && {\n      aggregateOrderBy: state.aggregateOrderBy,\n    }),\n    ...(state.fusion !== undefined && { fusion: state.fusion }),\n  };\n}\n","/**\n * Module-private builder context used by StoreView and recorded-time reads.\n *\n * These values are real query-builder mechanics, but not public builder API:\n * callers should pin coordinates through Store/StoreView and bind recorded\n * reads through Store options. A WeakMap keeps the public QueryBuilderConfig\n * free of internal-only fields while preserving clone-by-config behavior.\n */\nimport { type ReadCoordinate } from \"../../core/temporal\";\nimport { type RecordedReadBinding } from \"../compiler/schema\";\nimport { type QueryBuilderConfig } from \"./types\";\n\nexport type QueryBuilderInternalContext = Readonly<{\n  recordedReadBinding?: RecordedReadBinding | undefined;\n  sealedCoordinate?: ReadCoordinate | undefined;\n}>;\n\nconst contexts = new WeakMap<QueryBuilderConfig, QueryBuilderInternalContext>();\n\nexport function registerQueryBuilderInternalContext(\n  config: QueryBuilderConfig,\n  context: QueryBuilderInternalContext,\n): void {\n  if (\n    context.recordedReadBinding === undefined &&\n    context.sealedCoordinate === undefined\n  ) {\n    return;\n  }\n  contexts.set(config, context);\n}\n\nexport function getQueryBuilderInternalContext(\n  config: QueryBuilderConfig,\n): QueryBuilderInternalContext {\n  return contexts.get(config) ?? {};\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 { resolveDeclaredFulltextLanguage } from \"../../core/searchable\";\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 { getQueryBuilderInternalContext } from \"./internal-context\";\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  const { recordedReadBinding } = getQueryBuilderInternalContext(config);\n  return {\n    dialect: config.dialect ?? \"sqlite\",\n    schema: config.schema,\n    windowFunctions: config.backend?.capabilities.windowFunctions ?? true,\n    ...(fulltextStrategy === undefined ?\n      {}\n    : {\n        fulltextStrategy,\n        fulltextLanguages: buildFulltextLanguages(config.registry),\n      }),\n    ...(vectorStrategy === undefined ?\n      {}\n    : { vectorStrategy, vectorSlots: buildVectorSlots(config.registry) }),\n    ...(recordedReadBinding === undefined ? {} : { recordedReadBinding }),\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 * Memoizes each kind's DECLARED fulltext language per registry (the\n * winning-language rule the write path applies). The `$fulltext` CTE uses\n * it to parse queries with a CONSTANT regconfig when every kind in the\n * alias shares one declared language — the per-row\n * `websearch_to_tsquery(\"language\", ...)` form makes the tsquery\n * non-constant, so PostgreSQL's GIN index on `tsv` can never serve the\n * match.\n */\nconst fulltextLanguagesCache = new WeakMap<\n  KindRegistry,\n  ReadonlyMap<string, string>\n>();\n\nfunction buildFulltextLanguages(\n  registry: KindRegistry,\n): ReadonlyMap<string, string> {\n  const cached = fulltextLanguagesCache.get(registry);\n  if (cached !== undefined) return cached;\n\n  const languages = new Map<string, string>();\n  for (const [nodeKind, nodeType] of registry.nodeKinds) {\n    const language = resolveDeclaredFulltextLanguage(nodeType.schema);\n    if (language !== undefined) languages.set(nodeKind, language);\n  }\n  fulltextLanguagesCache.set(registry, languages);\n  return languages;\n}\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 {\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 { compareStrings } from \"../../utils/compare\";\nimport { requireDefined } from \"../../utils/presence\";\nimport { withRecordedRelationsPrecondition } from \"../../utils/sql-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 { type SqlDialect } from \"../dialect/types\";\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 { type CompiledSelectSql } from \"../sql-intent\";\nimport { buildQueryAst } from \"./ast-builder\";\nimport { buildCompileOptions } from \"./compile-options\";\nimport { hasParameterReferences, PreparedQuery } from \"./prepared-query\";\nimport {\n  buildQueryTemplate,\n  type CompiledTemplate,\n  fillTemplateParams,\n} from \"./read-instant-template\";\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  #cachedSelectiveFieldsForExecute:\n    readonly SelectiveField[] | typeof NOT_COMPUTED | undefined = NOT_COMPUTED;\n  #cachedSelectiveFieldsForPagination:\n    readonly SelectiveField[] | typeof NOT_COMPUTED | undefined = NOT_COMPUTED;\n  // The instance is immutable (every builder method returns a new instance),\n  // so the AST and its param-ref check are invariant — compute each once and\n  // reuse across execute()/paginate()/stream() instead of rebuilding per call.\n  #cachedAst: QueryAst | undefined;\n  #cachedHasParameterReferences: boolean | undefined;\n  // Per-instance compiled placeholder templates for the full and\n  // selective-field ASTs (NOT_COMPUTED = not yet built; undefined = no fast\n  // path). Reused across execute()/executeOn() calls so a repeated query\n  // compiles once; the read instant is filled fresh per call, never cached.\n  #fullTemplate: CompiledTemplate | typeof NOT_COMPUTED | undefined =\n    NOT_COMPUTED;\n  #selectiveTemplate: CompiledTemplate | typeof NOT_COMPUTED | undefined =\n    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 (memoized — the instance is immutable).\n   */\n  toAst(): QueryAst {\n    return (this.#cachedAst ??= buildQueryAst(this.#config, this.#state));\n  }\n\n  /** Whether this query uses `param()` refs (memoized). */\n  #hasParameterReferences(): boolean {\n    return (this.#cachedHasParameterReferences ??= hasParameterReferences(\n      this.toAst(),\n    ));\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 TypeGraph's database-independent SQL fragment.\n   *\n   * Pass the result to a GraphBackend, or use toSQL() to render SQL text and\n   * parameters for the configured dialect.\n   */\n  compile(): CompiledSelectSql {\n    // Emits a directly-runnable statement with the read instant as a literal\n    // (a backend may execute the result directly), so this is not the\n    // reusable placeholder template execute() caches — see #templateFor.\n    const ast = this.toAst();\n    return compileQuery(ast, this.#config.graphId, this.#compileOptions());\n  }\n\n  /**\n   * Creates a prepared (pre-validated) query that can be executed multiple\n   * times with different parameter bindings. Builds and structurally\n   * validates the AST once (a malformed query fails fast, here, instead of on\n   * first use); the prepared query then compiles once into a reusable template\n   * and fills a fresh read instant per execute() — see PreparedQuery's class\n   * doc comment.\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 = this.toAst();\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 here purely to fail fast on a malformed query. PreparedQuery\n    // caches its own reusable placeholder template (built lazily on first\n    // execute), so this validation compile is safe to discard — it only exists\n    // to surface a structural error at prepare() time rather than first use.\n    const compileOptions = this.#compileOptions();\n    compileQuery(ast, this.#config.graphId, compileOptions);\n    compileQuery(unoptimizedAst, this.#config.graphId, compileOptions);\n\n    return new PreparedQuery({\n      ast,\n      unoptimizedAst,\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  #executeOnBackend<T>(\n    backend: GraphBackend | TransactionBackend,\n    promise: Promise<T>,\n    surface: string,\n  ): Promise<T> {\n    if (this.#state.recordedAsOf === undefined) return promise;\n    return withRecordedRelationsPrecondition(promise, {\n      dialect: backend.dialect,\n      surface,\n    });\n  }\n\n  #dialect(): SqlDialect {\n    return this.#config.dialect ?? \"sqlite\";\n  }\n\n  /**\n   * The cached placeholder template for one AST variant (`\"full\"` or\n   * `\"selective\"`), or `undefined` when no fast path applies. Built once per\n   * instance from the store backend's compiler; reusable across executions and\n   * across store/transaction backends of the same dialect, since SQL text and\n   * parameters depend only on the AST and dialect. The read instant is filled\n   * fresh per call by {@link fillTemplateParams}, never frozen into the cache.\n   */\n  #templateFor(\n    ast: QueryAst,\n    slot: \"full\" | \"selective\",\n  ): CompiledTemplate | undefined {\n    const cached =\n      slot === \"full\" ? this.#fullTemplate : this.#selectiveTemplate;\n    if (cached !== NOT_COMPUTED) return cached;\n    const built = this.#buildTemplate(ast);\n    if (slot === \"full\") this.#fullTemplate = built;\n    else this.#selectiveTemplate = built;\n    return built;\n  }\n\n  #buildTemplate(ast: QueryAst): CompiledTemplate | undefined {\n    return buildQueryTemplate(\n      ast,\n      this.#config.graphId,\n      this.#compileOptions(),\n      this.#config.backend,\n    );\n  }\n\n  /**\n   * Fetches raw rows for one AST variant, path-column-normalized. Prefers the\n   * cached template + `executeRaw` fast path; falls back to a fresh literal\n   * compile via `backend.execute` when the backend cannot run raw SQL text (in\n   * which case no template is built). Callers map the returned rows to typed\n   * results.\n   */\n  async #fetchRows(\n    backend: GraphBackend | TransactionBackend,\n    ast: QueryAst,\n    slot: \"full\" | \"selective\",\n    surface: string,\n  ): Promise<readonly Record<string, unknown>[]> {\n    const executeRaw = backend.executeRaw;\n    const template =\n      executeRaw === undefined ? undefined : this.#templateFor(ast, slot);\n    const rawRows = await this.#executeOnBackend(\n      backend,\n      template !== undefined && executeRaw !== undefined ?\n        executeRaw<Record<string, unknown>>(\n          template.sql,\n          fillTemplateParams(template.params, {}, this.#dialect()),\n        )\n      : backend.execute<Record<string, unknown>>(\n          compileQuery(ast, this.#config.graphId, this.#compileOptions()),\n        ),\n      surface,\n    );\n    return transformPathColumns(rawRows, this.#state, this.#dialect());\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    const backend = this.#config.backend;\n\n    // Guard: reject queries with param() refs — must use .prepare().execute({...})\n    const ast = this.toAst();\n    if (this.#hasParameterReferences()) {\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 (cached template + executeRaw, or a\n    // fresh literal compile on backends without raw execution).\n    const rows = await this.#fetchRows(backend, ast, \"full\", \"recorded-query\");\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    const ast = this.toAst();\n    // Guard: reject queries with param() refs — must use .prepare().execute({...})\n    if (this.#hasParameterReferences()) {\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 (cached template + executeRaw on the provided\n    // backend, or a fresh literal compile when it can't run raw SQL).\n    const rows = await this.#fetchRows(\n      backend,\n      ast,\n      \"full\",\n      \"recorded-batch-query\",\n    );\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    // Cached template + executeRaw when available; the read instant is filled\n    // fresh per call, so a reused query never freezes \"now\" (the #246\n    // regression) yet compiles only once.\n    const baseAst = this.toAst();\n    const selectiveAst = { ...baseAst, selectiveFields };\n\n    const backend = this.#requireBackend();\n    const rows = await this.#fetchRows(\n      backend,\n      selectiveAst,\n      \"selective\",\n      \"recorded-query\",\n    );\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        return undefined;\n      }\n      if (error instanceof UnsupportedPredicateError) {\n        this.#cachedSelectiveFieldsForExecute = undefined;\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    // Cached template + executeRaw on the provided backend; see\n    // #tryOptimizedExecution.\n    const baseAst = this.toAst();\n    const selectiveAst = { ...baseAst, selectiveFields };\n\n    const rows = await this.#fetchRows(\n      backend,\n      selectiveAst,\n      \"selective\",\n      \"recorded-batch-query\",\n    );\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        return undefined;\n      }\n      if (error instanceof UnsupportedPredicateError) {\n        this.#cachedSelectiveFieldsForExecute = undefined;\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 = compareStrings(a.alias, b.alias);\n      if (aliasCompare !== 0) return aliasCompare;\n      return compareStrings(a.field, 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          requireDefined(orderedRows[0]),\n          selectiveFields,\n          \"b\",\n        );\n        nextCursor = this.#buildCursorFromSelectiveRow(\n          requireDefined(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.#paginationOrderBy()) {\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, requireDefined(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, requireDefined(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.#paginationOrderBy(), 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.#paginationOrderBy()) {\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 = requireDefined(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 = requireDefined(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 = requireDefined(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[requireDefined(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   * The ORDER BY used for keyset pagination: the caller's ORDER BY plus a final\n   * unique tiebreaker on the start alias's `id`. Without a unique final key, a\n   * non-unique sort (e.g. `orderBy(\"p\", \"age\")` with many equal ages) makes the\n   * keyset predicate `age > lastAge` skip every not-yet-returned equal-age row,\n   * silently losing data across pages. The start node's `id` is unique and\n   * always projected, so appending it gives a total order that page boundaries\n   * can split cleanly. Skipped when the caller already orders by the start\n   * alias's `id` (the sort is already total). Every pagination read of ORDER BY\n   * — the emitted sort, the cursor predicate, cursor encoding, and cursor\n   * validation — routes through here so the extra column stays consistent across\n   * the standard and selective-field-optimized paths.\n   */\n  #paginationOrderBy(): readonly OrderSpec[] {\n    const orderBy = this.#state.orderBy;\n    const startAlias = this.#state.startAlias;\n    const alreadyTotal = orderBy.some(\n      (spec) =>\n        spec.field.alias === startAlias &&\n        spec.field.path.length === 1 &&\n        spec.field.path[0] === \"id\" &&\n        spec.field.jsonPointer === undefined,\n    );\n    if (alreadyTotal) return orderBy;\n    const tiebreaker: OrderSpec = {\n      field: { __type: \"field_ref\", alias: startAlias, path: [\"id\"] },\n      direction: \"asc\",\n    };\n    return [...orderBy, tiebreaker];\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.#paginationOrderBy());\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.#paginationOrderBy(),\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.#paginationOrderBy();\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.#paginationOrderBy(),\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 GraphDef } from \"../../core/define-graph\";\nimport {\n  type AggregateExpr,\n  type AggregateOrderSpec,\n  type FieldRef,\n  type QueryAst,\n  type SortDirection,\n} from \"../ast\";\nimport { compileQuery, type CompileQueryOptions } from \"../compiler/index\";\nimport { type CompiledSelectSql } from \"../sql-intent\";\nimport { buildQueryAst } from \"./ast-builder\";\nimport { buildCompileOptions } from \"./compile-options\";\nimport { hasParameterReferences } from \"./prepared-query\";\nimport {\n  buildQueryTemplate,\n  type CompiledTemplate,\n  fillTemplateParams,\n} from \"./read-instant-template\";\nimport {\n  type AliasMap,\n  type QueryBuilderConfig,\n  type QueryBuilderState,\n} from \"./types\";\n\n/** Sentinel distinguishing \"template not yet built\" from a built `undefined`. */\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  // Per-instance compiled placeholder template, reused across execute() calls\n  // (see #resolveTemplate). NOT_COMPUTED = not yet built; undefined = no fast\n  // path.\n  #template: CompiledTemplate | typeof NOT_COMPUTED | undefined = 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   * Orders results by a grouped field or aggregate alias.\n   *\n   * `key` is one of the output names passed to `.aggregate({...})` — either\n   * a grouped field (e.g. `genre`) or an aggregate alias (e.g. `bookCount`).\n   * Both are ordered the same way: by referencing the SELECT-list output\n   * column, since every `.aggregate()` field is projected with an alias.\n   *\n   * Chain multiple calls to sort by more than one key, in call order:\n   * `.orderBy(\"genre\").orderBy(\"bookCount\", \"desc\")` sorts by genre first,\n   * then by book count within each genre.\n   *\n   * @example\n   * ```typescript\n   * // Top 2 authors by book count\n   * store.query()\n   *   .from(\"Author\", \"a\")\n   *   .traverse(\"wrote\", \"e\")\n   *   .to(\"Book\", \"b\")\n   *   .groupByNode(\"a\")\n   *   .aggregate({ author: field(\"a\", \"name\"), bookCount: count(\"b\") })\n   *   .orderBy(\"bookCount\", \"desc\")\n   *   .limit(2)\n   *   .execute();\n   * ```\n   */\n  orderBy<K extends keyof R & string>(\n    key: K,\n    direction: SortDirection = \"asc\",\n  ): ExecutableAggregateQuery<G, Aliases, R> {\n    const orderSpec: AggregateOrderSpec = { outputName: key, direction };\n    return new ExecutableAggregateQuery(\n      this.#config,\n      {\n        ...this.#state,\n        aggregateOrderBy: [...this.#state.aggregateOrderBy, orderSpec],\n      },\n      this.#fields,\n    );\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 TypeGraph's database-independent SQL fragment.\n   */\n  compile(): CompiledSelectSql {\n    // Emits a directly-runnable statement with the read instant as a literal;\n    // this is not the reusable placeholder template execute() caches (see\n    // #resolveTemplate).\n    const ast = this.toAst();\n    return compileQuery(ast, this.#config.graphId, this.#compileOptions());\n  }\n\n  #compileOptions(): CompileQueryOptions {\n    return buildCompileOptions(this.#config);\n  }\n\n  /**\n   * The cached placeholder template for this aggregate query, or `undefined`\n   * when no fast path applies. Built once per instance; the read instant is\n   * filled fresh per execution by {@link fillTemplateParams}.\n   */\n  #resolveTemplate(ast: QueryAst): CompiledTemplate | undefined {\n    if (this.#template !== NOT_COMPUTED) return this.#template;\n    this.#template = buildQueryTemplate(\n      ast,\n      this.#config.graphId,\n      this.#compileOptions(),\n      this.#config.backend,\n    );\n    return this.#template;\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    const backend = this.#config.backend;\n    if (!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 ast = this.toAst();\n    // Aggregate queries expose no `.prepare()`, so a param() ref can never be\n    // bound — reject it with clear guidance instead of a downstream \"missing\n    // binding\" error once it reaches the template's placeholder fill.\n    if (hasParameterReferences(ast)) {\n      throw new Error(\n        \"Aggregate queries do not support param() references; bind a concrete value instead.\",\n      );\n    }\n\n    const executeRaw = backend.executeRaw;\n    const template =\n      executeRaw === undefined ? undefined : this.#resolveTemplate(ast);\n    const rows =\n      template !== undefined && executeRaw !== undefined ?\n        await executeRaw<Record<string, unknown>>(\n          template.sql,\n          fillTemplateParams(\n            template.params,\n            {},\n            this.#config.dialect ?? \"sqlite\",\n          ),\n        )\n      : await backend.execute<Record<string, unknown>>(\n          compileQuery(ast, this.#config.graphId, this.#compileOptions()),\n        );\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 EmptyEdgeAliasMap,\n  type EmptyRecursiveAliasMap,\n  type NodeAlias,\n  type QueryBuilderConfig,\n  type QueryBuilderState,\n  type QueryCoordinateState,\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  EdgeAliases extends EdgeAliasMap = EmptyEdgeAliasMap,\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  RecAliases extends RecursiveAliasMap = EmptyRecursiveAliasMap,\n  CoordinateState extends QueryCoordinateState = \"open\",\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    CoordinateState\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      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      CoordinateState\n    >(\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    CoordinateState\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      G,\n      Aliases,\n      EdgeAliases,\n      EK,\n      EA,\n      Dir,\n      Optional,\n      DC,\n      PC,\n      RecAliases,\n      CoordinateState\n    >(\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    CoordinateState\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    CoordinateState\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    CoordinateState\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      CoordinateState\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    CoordinateState\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      CoordinateState\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 { getQueryBuilderInternalContext } from \"./internal-context\";\nimport { TraversalBuilder } from \"./traversal-builder\";\nimport {\n  type AliasMap,\n  type BaseFieldAccessor,\n  type EdgeAccessor,\n  type EdgeAlias,\n  type EdgeAliasMap,\n  type EmptyAliasMap,\n  type EmptyEdgeAliasMap,\n  type EmptyRecursiveAliasMap,\n  type NodeAccessor,\n  type NodeAlias,\n  type QueryBuilderConfig,\n  type QueryBuilderState,\n  type QueryCoordinateState,\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\ntype TemporalMethod<\n  G extends GraphDef,\n  Aliases extends AliasMap,\n  EdgeAliases extends EdgeAliasMap,\n  RecursiveAliases extends RecursiveAliasMap,\n  CoordinateState extends QueryCoordinateState,\n> =\n  CoordinateState extends \"open\" ?\n    (\n      mode: TemporalMode,\n      asOf?: string,\n    ) => QueryBuilder<G, Aliases, EdgeAliases, RecursiveAliases, \"open\">\n  : never;\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  Aliases extends AliasMap = EmptyAliasMap,\n  EdgeAliases extends EdgeAliasMap = EmptyEdgeAliasMap,\n  RecursiveAliases extends RecursiveAliasMap = EmptyRecursiveAliasMap,\n  CoordinateState extends QueryCoordinateState = \"open\",\n> {\n  readonly #config: QueryBuilderConfig;\n  readonly #state: QueryBuilderState;\n  readonly temporal: TemporalMethod<\n    G,\n    Aliases,\n    EdgeAliases,\n    RecursiveAliases,\n    CoordinateState\n  >;\n\n  constructor(config: QueryBuilderConfig, state: QueryBuilderState) {\n    this.#config = config;\n    this.#state = state;\n    this.temporal = ((mode, asOf) =>\n      this.#setTemporal(mode, asOf)) as TemporalMethod<\n      G,\n      Aliases,\n      EdgeAliases,\n      RecursiveAliases,\n      CoordinateState\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  #setTemporal(\n    mode: TemporalMode,\n    asOf?: string,\n  ): QueryBuilder<G, Aliases, EdgeAliases, RecursiveAliases, \"open\"> {\n    const { sealedCoordinate } = getQueryBuilderInternalContext(this.#config);\n    if (sealedCoordinate !== undefined) {\n      const coordinate = 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   * 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    CoordinateState\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    CoordinateState\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    CoordinateState\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    CoordinateState\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, CoordinateState> {\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, CoordinateState> {\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    CoordinateState\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    CoordinateState\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    CoordinateState\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      G,\n      Aliases,\n      EdgeAliases,\n      EK,\n      EA,\n      TraversalDirection,\n      false,\n      false,\n      false,\n      RecursiveAliases,\n      CoordinateState\n    >(\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    CoordinateState\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    CoordinateState\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    CoordinateState\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    CoordinateState\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      G,\n      Aliases,\n      EdgeAliases,\n      EK,\n      EA,\n      TraversalDirection,\n      true,\n      false,\n      false,\n      RecursiveAliases,\n      CoordinateState\n    >(\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    CoordinateState\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    CoordinateState\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      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      CoordinateState\n    >(\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, CoordinateState> {\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    n: number,\n  ): QueryBuilder<G, Aliases, EdgeAliases, RecursiveAliases, CoordinateState> {\n    return new QueryBuilder(this.#config, {\n      ...this.#state,\n      limit: n,\n    });\n  }\n\n  /**\n   * Offsets the results.\n   */\n  offset(\n    n: number,\n  ): QueryBuilder<G, Aliases, EdgeAliases, RecursiveAliases, CoordinateState> {\n    return new QueryBuilder(this.#config, {\n      ...this.#state,\n      offset: n,\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, CoordinateState> {\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, CoordinateState> {\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, CoordinateState> {\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, CoordinateState> {\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<\n        G,\n        Aliases,\n        EdgeAliases,\n        RecursiveAliases,\n        CoordinateState\n      >,\n    ) => QueryBuilder<\n      G,\n      OutAliases,\n      OutEdgeAliases,\n      OutRecAliases,\n      CoordinateState\n    >,\n  ): QueryBuilder<\n    G,\n    OutAliases,\n    OutEdgeAliases,\n    OutRecAliases,\n    CoordinateState\n  > {\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 {\n  type GraphBackend,\n  type TransactionBackend,\n} from \"../../backend/types\";\nimport { type GraphDef } from \"../../core/define-graph\";\nimport { withRecordedRelationsPrecondition } from \"../../utils/sql-errors\";\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 { type CompiledSelectSql } from \"../sql-intent\";\nimport { buildCompileOptions } from \"./compile-options\";\nimport { composableQueryHasParameterReferences } from \"./prepared-query\";\nimport {\n  buildReadInstantTemplate,\n  type CompiledTemplate,\n  composableNeedsCurrentReadInstant,\n  fillTemplateParams,\n} from \"./read-instant-template\";\nimport {\n  type AliasMap,\n  type EdgeAliasMap,\n  type QueryBuilderConfig,\n  type SelectContext,\n} from \"./types\";\n\nfunction executeOnBackend<T>(\n  backend: GraphBackend | TransactionBackend,\n  recordedAsOf: string | undefined,\n  promise: Promise<T>,\n  surface: string,\n): Promise<T> {\n  if (recordedAsOf === undefined) return promise;\n  return withRecordedRelationsPrecondition(promise, {\n    dialect: backend.dialect,\n    surface,\n  });\n}\n\nfunction recordedAsOfForComposableQuery(\n  query: ComposableQuery,\n): string | undefined {\n  if (\"__type\" in query) {\n    return (\n      recordedAsOfForComposableQuery(query.left) ??\n      recordedAsOfForComposableQuery(query.right)\n    );\n  }\n  return query.recordedAsOf;\n}\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 */\n/** Sentinel distinguishing \"template not yet built\" from a built `undefined`. */\nconst NOT_COMPUTED = Symbol(\"NOT_COMPUTED\");\n\nexport class UnionableQuery<G extends GraphDef, R> {\n  readonly #config: QueryBuilderConfig;\n  readonly #state: UnionableQueryState;\n  // Per-instance compiled placeholder template, reused across\n  // execute()/executeOn() calls; the read instant is filled fresh per call.\n  // NOT_COMPUTED = not yet built; undefined = no fast path.\n  #template: CompiledTemplate | typeof NOT_COMPUTED | undefined = 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(): CompiledSelectSql {\n    // Emits a directly-runnable statement with the read instant as a literal;\n    // this is not the reusable placeholder template execute() caches (see\n    // #resolveTemplate).\n    return compileSetOperation(\n      this.toAst(),\n      this.#config.graphId,\n      this.#compileOptions(),\n    );\n  }\n\n  #compileOptions(): CompileQueryOptions {\n    return buildCompileOptions(this.#config);\n  }\n\n  /**\n   * The cached placeholder template for this set operation, or `undefined`\n   * when no fast path applies. Built once per instance; every operand's read\n   * instant is the shared placeholder, filled fresh per execution by\n   * {@link fillTemplateParams}.\n   */\n  #resolveTemplate(ast: SetOperation): CompiledTemplate | undefined {\n    if (this.#template !== NOT_COMPUTED) return this.#template;\n    this.#template = buildReadInstantTemplate({\n      compile: () =>\n        compileSetOperation(ast, this.#config.graphId, {\n          ...this.#compileOptions(),\n          readInstant: \"placeholder\",\n        }),\n      backend: this.#config.backend,\n      needsReadInstant: composableNeedsCurrentReadInstant(ast),\n    });\n    return this.#template;\n  }\n\n  /**\n   * Fetches raw rows for the set operation: cached template + `executeRaw`\n   * when available, else a fresh literal compile via `backend.execute`.\n   */\n  async #fetchRows(\n    backend: GraphBackend | TransactionBackend,\n    ast: SetOperation,\n    surface: string,\n  ): Promise<readonly Record<string, unknown>[]> {\n    const executeRaw = backend.executeRaw;\n    const template =\n      executeRaw === undefined ? undefined : this.#resolveTemplate(ast);\n    return executeOnBackend(\n      backend,\n      recordedAsOfForComposableQuery(ast),\n      template !== undefined && executeRaw !== undefined ?\n        executeRaw<Record<string, unknown>>(\n          template.sql,\n          fillTemplateParams(\n            template.params,\n            {},\n            this.#config.dialect ?? \"sqlite\",\n          ),\n        )\n      : backend.execute<Record<string, unknown>>(\n          compileSetOperation(\n            ast,\n            this.#config.graphId,\n            this.#compileOptions(),\n          ),\n        ),\n      surface,\n    );\n  }\n\n  /** Applies the select-function transformation, if one is attached. */\n  #mapRows(rows: readonly Record<string, unknown>[]): readonly R[] {\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    return rows as readonly R[];\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    const backend = this.#config.backend;\n\n    const ast = this.toAst();\n    if (composableQueryHasParameterReferences(ast)) {\n      throw new Error(\n        \"Query contains param() references. Use .prepare().execute({...}) instead of .execute().\",\n      );\n    }\n\n    return this.#mapRows(await this.#fetchRows(backend, ast, \"recorded-query\"));\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    const ast = this.toAst();\n    if (composableQueryHasParameterReferences(ast)) {\n      throw new Error(\n        \"Query contains param() references. Use .prepare().execute({...}) instead of .execute().\",\n      );\n    }\n\n    return this.#mapRows(\n      await this.#fetchRows(backend, ast, \"recorded-batch-query\"),\n    );\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 TraversalDirection } from \"../ast\";\nimport { type QueryBuilder } from \"./query-builder\";\nimport { type TraversalBuilder } from \"./traversal-builder\";\nimport {\n  type AliasMap,\n  type EdgeAliasMap,\n  type EmptyRecursiveAliasMap,\n  type QueryCoordinateState,\n  type RecursiveAliasMap,\n} 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 * @typeParam InRecursiveAliases - Input recursive alias map\n * @typeParam OutRecursiveAliases - Output recursive 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  InRecursiveAliases extends RecursiveAliasMap = EmptyRecursiveAliasMap,\n  OutRecursiveAliases extends RecursiveAliasMap = InRecursiveAliases,\n> = <CoordinateState extends QueryCoordinateState>(\n  builder: QueryBuilder<\n    G,\n    InAliases,\n    InEdgeAliases,\n    InRecursiveAliases,\n    CoordinateState\n  >,\n) => QueryBuilder<\n  G,\n  OutAliases,\n  OutEdgeAliases,\n  OutRecursiveAliases,\n  CoordinateState\n>;\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> = <\n  Aliases extends RequiredAliases,\n  EdgeAliases extends RequiredEdgeAliases,\n  RecursiveAliases extends RecursiveAliasMap,\n  CoordinateState extends QueryCoordinateState,\n>(\n  builder: QueryBuilder<\n    G,\n    Aliases,\n    EdgeAliases,\n    RecursiveAliases,\n    CoordinateState\n  >,\n) => QueryBuilder<\n  G,\n  Aliases & AddedAliases,\n  EdgeAliases & AddedEdgeAliases,\n  RecursiveAliases,\n  CoordinateState\n>;\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  Dir extends TraversalDirection,\n  Optional extends boolean,\n  DC extends boolean | string,\n  PC extends boolean | string,\n  RecursiveAliases extends RecursiveAliasMap,\n  CoordinateState extends QueryCoordinateState,\n>(\n  builder: TraversalBuilder<\n    G,\n    InAliases,\n    InEdgeAliases,\n    EK,\n    EA,\n    Dir,\n    Optional,\n    DC,\n    PC,\n    RecursiveAliases,\n    CoordinateState\n  >,\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  InRecursiveAliases extends RecursiveAliasMap,\n  OutRecursiveAliases extends RecursiveAliasMap,\n>(\n  fn: QueryFragment<\n    G,\n    InAliases,\n    OutAliases,\n    InEdgeAliases,\n    OutEdgeAliases,\n    InRecursiveAliases,\n    OutRecursiveAliases\n  >,\n): QueryFragment<\n  G,\n  InAliases,\n  OutAliases,\n  InEdgeAliases,\n  OutEdgeAliases,\n  InRecursiveAliases,\n  OutRecursiveAliases\n> {\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  InRecursiveAliases extends RecursiveAliasMap = EmptyRecursiveAliasMap,\n  OutRecursiveAliases extends RecursiveAliasMap = InRecursiveAliases,\n>(\n  fn: QueryFragment<\n    G,\n    InAliases,\n    OutAliases,\n    InEdgeAliases,\n    OutEdgeAliases,\n    InRecursiveAliases,\n    OutRecursiveAliases\n  >,\n) => QueryFragment<\n  G,\n  InAliases,\n  OutAliases,\n  InEdgeAliases,\n  OutEdgeAliases,\n  InRecursiveAliases,\n  OutRecursiveAliases\n> {\n  return fragmentIdentity;\n}\n\ntype ErasedFragment = (builder: unknown) => unknown;\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  R1 extends RecursiveAliasMap,\n  R2 extends RecursiveAliasMap,\n>(\n  f1: QueryFragment<G, A1, A2, E1, E2, R1, R2>,\n): QueryFragment<G, A1, A2, E1, E2, R1, R2>;\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  R1 extends RecursiveAliasMap,\n  R2 extends RecursiveAliasMap,\n  R3 extends RecursiveAliasMap,\n>(\n  f1: QueryFragment<G, A1, A2, E1, E2, R1, R2>,\n  f2: QueryFragment<G, A2, A3, E2, E3, R2, R3>,\n): QueryFragment<G, A1, A3, E1, E3, R1, R3>;\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  R1 extends RecursiveAliasMap,\n  R2 extends RecursiveAliasMap,\n  R3 extends RecursiveAliasMap,\n  R4 extends RecursiveAliasMap,\n>(\n  f1: QueryFragment<G, A1, A2, E1, E2, R1, R2>,\n  f2: QueryFragment<G, A2, A3, E2, E3, R2, R3>,\n  f3: QueryFragment<G, A3, A4, E3, E4, R3, R4>,\n): QueryFragment<G, A1, A4, E1, E4, R1, R4>;\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  R1 extends RecursiveAliasMap,\n  R2 extends RecursiveAliasMap,\n  R3 extends RecursiveAliasMap,\n  R4 extends RecursiveAliasMap,\n  R5 extends RecursiveAliasMap,\n>(\n  f1: QueryFragment<G, A1, A2, E1, E2, R1, R2>,\n  f2: QueryFragment<G, A2, A3, E2, E3, R2, R3>,\n  f3: QueryFragment<G, A3, A4, E3, E4, R3, R4>,\n  f4: QueryFragment<G, A4, A5, E4, E5, R4, R5>,\n): QueryFragment<G, A1, A5, E1, E5, R1, R5>;\n\nexport function composeFragments(...fragments: readonly unknown[]): unknown {\n  return (builder: unknown) => {\n    let result = builder;\n    for (const fragment of fragments) {\n      result = (fragment as ErasedFragment)(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): FlexibleQueryFragment<G> {\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): FlexibleQueryFragment<G> {\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): FlexibleQueryFragment<G> {\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 EmptyAliasMap,\n  type EmptyEdgeAliasMap,\n  type EmptyRecursiveAliasMap,\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 QueryCoordinateState,\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  type EmptyAliasMap,\n  type EmptyEdgeAliasMap,\n  type EmptyRecursiveAliasMap,\n  QueryBuilder,\n  type QueryBuilderConfig,\n  type QueryBuilderState,\n  type QueryCoordinateState,\n} from \"./builder/index\";\nimport {\n  type QueryBuilderInternalContext,\n  registerQueryBuilderInternalContext,\n} from \"./builder/internal-context\";\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  EmptyAliasMap,\n  EmptyEdgeAliasMap,\n  EmptyRecursiveAliasMap,\n  FieldAccessor,\n  NodeAccessor,\n  NodeAlias,\n  PaginatedResult,\n  PaginateOptions,\n  PropsAccessor,\n  QueryCoordinateState,\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 */\ntype InternalCreateQueryBuilderOptions = CreateQueryBuilderOptions &\n  QueryBuilderInternalContext;\n\nexport type InitialQueryBuilder<\n  G extends GraphDef,\n  CoordinateState extends QueryCoordinateState = \"open\",\n> = QueryBuilder<\n  G,\n  EmptyAliasMap,\n  EmptyEdgeAliasMap,\n  EmptyRecursiveAliasMap,\n  CoordinateState\n>;\n\nexport function createQueryBuilder<G extends GraphDef>(\n  graphId: string,\n  registry: KindRegistry,\n  options?: CreateQueryBuilderOptions,\n): InitialQueryBuilder<G>;\nexport function createQueryBuilder<G extends GraphDef>(\n  graphId: string,\n  registry: KindRegistry,\n  options?: CreateQueryBuilderOptions,\n): InitialQueryBuilder<G> {\n  return createQueryBuilderWithContext<G>(graphId, registry, options);\n}\n\nexport function createInternalQueryBuilder<\n  G extends GraphDef,\n  CoordinateState extends QueryCoordinateState = \"open\",\n>(\n  graphId: string,\n  registry: KindRegistry,\n  options?: InternalCreateQueryBuilderOptions,\n): InitialQueryBuilder<G, CoordinateState> {\n  return createQueryBuilderWithContext<G, CoordinateState>(\n    graphId,\n    registry,\n    options,\n  );\n}\n\nfunction createQueryBuilderWithContext<\n  G extends GraphDef,\n  CoordinateState extends QueryCoordinateState = \"open\",\n>(\n  graphId: string,\n  registry: KindRegistry,\n  options?: InternalCreateQueryBuilderOptions,\n): InitialQueryBuilder<G, CoordinateState> {\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  };\n  registerQueryBuilderInternalContext(config, {\n    ...(options?.recordedReadBinding !== undefined && {\n      recordedReadBinding: options.recordedReadBinding,\n    }),\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  const recorded = options?.sealedCoordinate?.recorded;\n\n  const initialState: QueryBuilderState = {\n    startAlias: \"\",\n    currentAlias: \"\",\n    startKinds: [],\n    includeSubClasses: false,\n    traversals: [],\n    predicates: [],\n    projection: [],\n    orderBy: [],\n    aggregateOrderBy: [],\n    limit: undefined,\n    offset: undefined,\n    temporalMode: sealed?.mode ?? \"current\",\n    asOf: sealed?.asOf,\n    recordedAsOf: recorded?.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) as InitialQueryBuilder<\n    G,\n    CoordinateState\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  rowPropsToObject,\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 = rowPropsToObject(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 * 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 { type GraphDef } from \"../core/define-graph\";\nimport { resolveDeclaredFulltextLanguage } from \"../core/searchable\";\nimport { type NodeType } from \"../core/types\";\nimport { ConfigurationError } from \"../errors\";\nimport {\n  DEFAULT_RRF_K,\n  DEFAULT_RRF_WEIGHT,\n  type HybridFusionOptions,\n} from \"../query/ast\";\nimport { type QueryBuilder } from \"../query/builder/query-builder\";\nimport { type NodeAccessor } from \"../query/builder/types\";\nimport { validateHybridFusionOptions } from \"../query/builder/validation\";\nimport { type FulltextStrategy } from \"../query/dialect/fulltext-strategy\";\nimport { assertVectorMinScore } from \"../query/dialect/vector-strategy\";\nimport { type Predicate } from \"../query/predicates\";\nimport { sql, type SqlFragment } from \"../query/sql-fragment\";\nimport { type KindRegistry } from \"../registry/kind-registry\";\nimport { compareCodePoints } from \"../utils/compare\";\nimport { requireDefined } from \"../utils/presence\";\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\n/**\n * Scope options shared by every facade search leg.\n *\n * `where` and `includeSubClasses` compile into the search statement's\n * candidate set (a subquery produced by the store's own query compiler), so\n * filtering happens INSIDE the engine's top-k — never by post-filtering a\n * ranked list. `offset` is rank-relative pagination: the engine fetches\n * `limit + offset` ranked candidates and discards the leading page.\n */\nexport type SearchScopeOptions<N extends NodeType = NodeType> = Readonly<{\n  /**\n   * Predicate over the node's properties, compiled by the shared query\n   * compiler into the candidate subquery. Requires a query-capable store.\n   * The facade instantiates `N` to the searched kind's node type, so the\n   * accessor is fully typed at the call site; the base instantiation\n   * exposes the system accessors (`id`, `kind`) for standalone option\n   * values.\n   */\n  where?: (accessor: NodeAccessor<N>) => Predicate;\n  /** Rows to skip after ranking (rank-relative pagination). */\n  offset?: number;\n  /**\n   * Expand the searched kind to include its `subClassOf` descendants.\n   * Vector legs search each declaring kind's storage and merge by score;\n   * kinds that don't declare the embedding field are skipped (mirroring\n   * the query builder). Requires a query-capable store.\n   */\n  includeSubClasses?: boolean;\n}>;\n\nexport type FulltextSearchOptions<N extends NodeType = NodeType> =\n  SearchScopeOptions<N> &\n    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: the kind's\n       * declared language (the same config rows were indexed with),\n       * which keeps the parsed tsquery a plan-time constant on\n       * PostgreSQL so the GIN index can serve the match.\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<N extends NodeType = NodeType> =\n  SearchScopeOptions<N> &\n    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<N extends NodeType = NodeType> =\n  SearchScopeOptions<N> &\n    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   * Builds a fresh query for candidate compilation (`store.query()`, the\n   * same seam collection `find({ where })` uses). Optional so a bare\n   * context still supports unscoped searches; `where` /\n   * `includeSubClasses` throw without it.\n   */\n  createQuery?: () => QueryBuilder<GraphDef>;\n}>;\n\n/**\n * Internal alias for the candidate query. The compiled query prefixes its\n * output columns with the alias, so the id column is `\"_sc_id\"`.\n */\nconst SEARCH_CANDIDATE_ALIAS = \"_sc\";\n\n/**\n * Compiles the candidate subquery for one kind: the ids of nodes a search\n * statement may rank. Runs the store's own query compiler, so the\n * predicate, valid-time currency, tombstone exclusion, and graph scoping\n * are exactly the semantics of a `current` read — search can never return\n * (or lose top-k slots to) rows a `find()` would not see.\n *\n * Compiled ONLY when a `where` predicate exists: the unfiltered case\n * returns `undefined` so the backend supplies its flat, parameter-bound\n * current-read candidates (same semantics, far cheaper — the compiled\n * query's per-row SQL now() currency checks measurably dominated\n * unfiltered facade searches on SQLite and planned poorly on Postgres).\n */\nfunction buildKindCandidates(\n  ctx: StoreSearchContext,\n  nodeKind: string,\n  where: ((accessor: NodeAccessor<NodeType>) => Predicate) | undefined,\n): SqlFragment | undefined {\n  if (where === undefined) return undefined;\n  if (ctx.createQuery === undefined) {\n    throw new ConfigurationError(\n      \"search with a where predicate requires a query-capable store\",\n      { capability: \"search\", graphId: ctx.graphId },\n    );\n  }\n  const chain = ctx\n    .createQuery()\n    .from(nodeKind, SEARCH_CANDIDATE_ALIAS)\n    .whereNode(SEARCH_CANDIDATE_ALIAS, where);\n  const compiled = chain\n    .select(\n      (aliases: Record<string, unknown>) => aliases[SEARCH_CANDIDATE_ALIAS],\n    )\n    .compile();\n  return sql`SELECT ${sql.raw(`\"${SEARCH_CANDIDATE_ALIAS}_id\"`)} AS node_id FROM (${compiled}) AS tg_search_candidates`;\n}\n\n/**\n * The kinds one search call spans: the kind itself, plus its `subClassOf`\n * descendants when requested.\n */\nfunction resolveSearchKinds(\n  ctx: StoreSearchContext,\n  nodeKind: string,\n  includeSubClasses: boolean | undefined,\n): readonly string[] {\n  if (includeSubClasses !== true) return [nodeKind];\n  if (ctx.createQuery === undefined) {\n    throw new ConfigurationError(\n      \"search with includeSubClasses requires a query-capable store\",\n      { capability: \"search\", graphId: ctx.graphId },\n    );\n  }\n  return ctx.registry.expandSubClasses(nodeKind);\n}\n\nfunction assertSearchOffset(offset: number | undefined, label: string): void {\n  if (offset === undefined) return;\n  if (!Number.isInteger(offset) || offset < 0) {\n    throw new RangeError(\n      `${label} must be a non-negative integer, got: ${offset}`,\n    );\n  }\n}\n\n/**\n * The language a fulltext query should be parsed with for one kind: the\n * caller's explicit override, else the kind's DECLARED language (the one\n * its rows were written with). Passing the declared language keeps the\n * tsquery CONSTANT, so PostgreSQL's GIN index on `tsv` can serve the\n * match — the per-row `websearch_to_tsquery(\"language\", ...)` fallback\n * (used only when the kind declares no searchable fields) forces a scan.\n */\nfunction effectiveFulltextLanguage(\n  ctx: StoreSearchContext,\n  nodeKind: string,\n  override: string | undefined,\n): string | undefined {\n  if (override !== undefined) return override;\n  const nodeType = ctx.registry.getNodeType(nodeKind);\n  if (nodeType === undefined) return undefined;\n  return resolveDeclaredFulltextLanguage(nodeType.schema);\n}\n\n/** A ranked row tagged with the kind whose search leg produced it. */\ntype RankedSourceRow = Readonly<{\n  kind: string;\n  nodeId: string;\n  score: number;\n  snippet?: string;\n}>;\n\n/** Node ids are unique per kind, not globally — key hydration by both. */\nfunction searchNodeKey(kind: string, nodeId: string): string {\n  return `${kind}\\u0000${nodeId}`;\n}\n\n/**\n * Whether higher scores rank first for a metric. Cosine scores are\n * similarities (`1 - distance`); l2 / inner_product scores are the raw\n * distance expression, where lower is better (matching each strategy's\n * `ORDER BY distance ASC`).\n */\nfunction scoreDescending(metric: VectorMetric): boolean {\n  return metric === \"cosine\";\n}\n\n/**\n * Hydrates ranked rows spanning multiple kinds. One batched fetch per\n * kind, results keyed by {@link searchNodeKey}.\n */\nasync function fetchNodesForRows(\n  backend: GraphBackend,\n  graphId: string,\n  rows: readonly RankedSourceRow[],\n): Promise<Map<string, Node>> {\n  const idsByKind = new Map<string, Set<string>>();\n  for (const row of rows) {\n    const ids = idsByKind.get(row.kind) ?? new Set<string>();\n    ids.add(row.nodeId);\n    idsByKind.set(row.kind, ids);\n  }\n  const map = new Map<string, Node>();\n  await Promise.all(\n    [...idsByKind].map(async ([kind, ids]) => {\n      const kindMap = await fetchNodesByIds(backend, graphId, kind, [...ids]);\n      for (const [id, node] of kindMap) {\n        map.set(searchNodeKey(kind, id), node);\n      }\n    }),\n  );\n  return map;\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 tryResolveSearchSlot(\n  ctx: StoreSearchContext,\n  nodeKind: string,\n  fieldPath: string,\n): ResolvedSearchSlot | undefined {\n  const nodeType = ctx.registry.getNodeType(nodeKind);\n  if (nodeType === undefined) return undefined;\n  const fields = getEmbeddingFields(nodeType.schema);\n  const field = fields.find((entry) => entry.fieldPath === fieldPath);\n  if (field === undefined) return undefined;\n  return {\n    dimensions: field.dimensions,\n    metric: field.metric,\n    indexType: field.indexType,\n  };\n}\n\nfunction resolveSearchSlot(\n  ctx: StoreSearchContext,\n  nodeKind: string,\n  fieldPath: string,\n): ResolvedSearchSlot {\n  const slot = tryResolveSearchSlot(ctx, nodeKind, fieldPath);\n  if (slot !== undefined) return slot;\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  assertSearchOffset(options.offset, \"fulltextSearch.offset\");\n  validateFulltextCallOptions(backend, {\n    mode: options.mode,\n    includeSnippets: options.includeSnippets,\n    language: options.language,\n  });\n\n  const kinds = resolveSearchKinds(ctx, nodeKind, options.includeSubClasses);\n  const offset = options.offset ?? 0;\n  const singleKind = kinds.length === 1;\n\n  const perKindRows = await Promise.all(\n    kinds.map(async (kind): Promise<readonly RankedSourceRow[]> => {\n      const candidates = buildKindCandidates(ctx, kind, options.where);\n      const language = effectiveFulltextLanguage(ctx, kind, options.language);\n      const rows = await requireDefined(backend.fulltextSearch)({\n        graphId,\n        nodeKind: kind,\n        query: options.query,\n        // A single kind pushes the page into SQL; multiple kinds fetch\n        // each kind's full page-covering prefix and re-slice after merge.\n        limit: singleKind ? options.limit : options.limit + offset,\n        ...(singleKind && offset > 0 ? { offset } : {}),\n        ...(candidates === undefined ? {} : { candidates }),\n        ...(options.mode ? { mode: options.mode } : {}),\n        ...(language === undefined ? {} : { language }),\n        ...(options.minScore === undefined ?\n          {}\n        : { minScore: options.minScore }),\n        ...(options.includeSnippets === undefined ?\n          {}\n        : { includeSnippets: options.includeSnippets }),\n      });\n      return rows.map((row) => ({\n        kind,\n        nodeId: row.nodeId,\n        score: row.score,\n        ...(row.snippet === undefined ? {} : { snippet: row.snippet }),\n      }));\n    }),\n  );\n\n  const merged =\n    singleKind ?\n      requireDefined(perKindRows[0])\n    : perKindRows\n        .flat()\n        .toSorted(\n          (a, b) =>\n            b.score - a.score ||\n            compareCodePoints(a.kind, b.kind) ||\n            compareCodePoints(a.nodeId, b.nodeId),\n        )\n        .slice(offset, offset + options.limit);\n  if (merged.length === 0) return [];\n\n  const nodeMap = await fetchNodesForRows(backend, graphId, merged);\n\n  const hits: FulltextSearchHit<N>[] = [];\n  let rank = 1;\n  for (const row of merged) {\n    const node = nodeMap.get(searchNodeKey(row.kind, 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  assertSearchOffset(options.offset, \"vectorSearch.offset\");\n\n  const searchKinds = resolveVectorSearchKinds(\n    ctx,\n    nodeKind,\n    options.fieldPath,\n    options.includeSubClasses,\n    \"vectorSearch\",\n  );\n  for (const { slot } of searchKinds) {\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  }\n  const offset = options.offset ?? 0;\n  const singleKind = searchKinds.length === 1;\n  const metric = options.metric ?? requireDefined(searchKinds[0]).slot.metric;\n\n  const perKindRows = await Promise.all(\n    searchKinds.map(\n      async ({ kind, slot }): Promise<readonly RankedSourceRow[]> => {\n        const candidates = buildKindCandidates(ctx, kind, options.where);\n        const rows = await requireDefined(backend.vectorSearch)({\n          graphId,\n          nodeKind: kind,\n          fieldPath: options.fieldPath,\n          queryEmbedding: options.queryEmbedding,\n          // Default to the field's DECLARED metric (the metric its index was\n          // built for); only an explicit caller override changes it.\n          // Defaulting to cosine here would mis-rank l2 / inner_product\n          // fields and bypass their ANN index.\n          metric,\n          dimensions: slot.dimensions,\n          indexType: slot.indexType,\n          // A single kind pushes the page into SQL; multiple kinds fetch\n          // each kind's full page-covering prefix and re-slice after merge.\n          limit: singleKind ? options.limit : options.limit + offset,\n          ...(singleKind && offset > 0 ? { offset } : {}),\n          ...(candidates === undefined ? {} : { candidates }),\n          ...(options.minScore === undefined ?\n            {}\n          : { minScore: options.minScore }),\n          ...(options.efSearch === undefined ?\n            {}\n          : { efSearch: options.efSearch }),\n        });\n        return rows.map((row) => ({\n          kind,\n          nodeId: row.nodeId,\n          score: row.score,\n        }));\n      },\n    ),\n  );\n\n  const merged =\n    singleKind ?\n      requireDefined(perKindRows[0])\n    : mergeVectorRows(perKindRows, metric).slice(\n        offset,\n        offset + options.limit,\n      );\n  if (merged.length === 0) return [];\n\n  const nodeMap = await fetchNodesForRows(backend, graphId, merged);\n\n  const hits: VectorSearchHit<N>[] = [];\n  let rank = 1;\n  for (const row of merged) {\n    const node = nodeMap.get(searchNodeKey(row.kind, 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\n/** One vector-search target: a kind and its resolved embedding slot. */\ntype VectorSearchKind = Readonly<{ kind: string; slot: ResolvedSearchSlot }>;\n\n/**\n * Resolves the kinds a vector search spans, keeping only kinds that\n * declare the embedding field (mirroring the query builder, which skips\n * non-declaring kinds instead of referencing a table that was never\n * created). Enforces one shared declared metric across the expansion:\n * scores from different metrics cannot be merged into one ranking, and a\n * per-call metric override cannot bridge the gap either (each kind's\n * storage is built for — and validated against — its declared metric), so\n * mixed declared metrics are unsupported for cross-kind ranking.\n */\nfunction resolveVectorSearchKinds(\n  ctx: StoreSearchContext,\n  nodeKind: string,\n  fieldPath: string,\n  includeSubClasses: boolean | undefined,\n  label: string,\n): readonly VectorSearchKind[] {\n  const kinds = resolveSearchKinds(ctx, nodeKind, includeSubClasses);\n  const resolved: VectorSearchKind[] = [];\n  for (const kind of kinds) {\n    const slot = tryResolveSearchSlot(ctx, kind, fieldPath);\n    if (slot !== undefined) resolved.push({ kind, slot });\n  }\n  // No declaring kind: surface the standard configuration error for the\n  // requested kind.\n  if (resolved.length === 0) resolveSearchSlot(ctx, nodeKind, fieldPath);\n  const metrics = new Set(resolved.map(({ slot }) => slot.metric));\n  if (metrics.size > 1) {\n    throw new ConfigurationError(\n      `${label}: kinds expanded from \"${nodeKind}\" declare different ` +\n        `metrics for \"${fieldPath}\" (${[...metrics].join(\", \")}). ` +\n        `Cross-kind vector ranking requires one shared declared metric — ` +\n        `search the kinds separately.`,\n      { capability: \"vector\", graphId: ctx.graphId },\n    );\n  }\n  return resolved;\n}\n\n/**\n * Merges per-kind ranked rows into one globally ordered list.\n *\n * Applied even to a single kind's rows, whose SQL already ordered them. The\n * vector source SQL breaks a score tie arbitrarily (no `node_id` tiebreak — a\n * second sort key would cost pgvector its ordered index scan), so trusting its\n * arrival order would make the rank a source of nondeterminism. The\n * single-statement hybrid path re-ranks the very same rows with\n * `ROW_NUMBER() OVER (ORDER BY score …, node_id)`; this is that window, in JS.\n * Ranks feed the fusion, so the two paths must assign them identically.\n */\nfunction mergeVectorRows(\n  perKindRows: readonly (readonly RankedSourceRow[])[],\n  metric: VectorMetric,\n): readonly RankedSourceRow[] {\n  const descending = scoreDescending(metric);\n  return perKindRows\n    .flat()\n    .toSorted(\n      (a, b) =>\n        (descending ? b.score - a.score : a.score - b.score) ||\n        compareCodePoints(a.kind, b.kind) ||\n        compareCodePoints(a.nodeId, b.nodeId),\n    );\n}\n\n/** {@link mergeVectorRows} for the fulltext leg, whose score always descends. */\nfunction mergeFulltextRows(\n  perKindRows: readonly (readonly RankedSourceRow[])[],\n): readonly RankedSourceRow[] {\n  return perKindRows\n    .flat()\n    .toSorted(\n      (a, b) =>\n        b.score - a.score ||\n        compareCodePoints(a.kind, b.kind) ||\n        compareCodePoints(a.nodeId, b.nodeId),\n    );\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  assertSearchOffset(options.offset, \"hybridSearch.offset\");\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 offset = options.offset ?? 0;\n  // Over-fetch covers the requested page: fused top-(limit+offset) needs\n  // deep-enough per-source prefixes.\n  const overFetchMultiplier = 4;\n  const pageLimit = options.limit + offset;\n  const vectorK = options.vector.k ?? pageLimit * overFetchMultiplier;\n  const fulltextK = options.fulltext.k ?? pageLimit * overFetchMultiplier;\n\n  // The fulltext half spans every expanded kind; the vector half only the\n  // kinds that declare the embedding field (mirroring the query builder's\n  // treatment of non-declaring kinds).\n  const fulltextKinds = resolveSearchKinds(\n    ctx,\n    nodeKind,\n    options.includeSubClasses,\n  );\n  const vectorKinds = resolveVectorSearchKinds(\n    ctx,\n    nodeKind,\n    options.vector.fieldPath,\n    options.includeSubClasses,\n    \"hybridSearch.vector\",\n  );\n  for (const { slot } of vectorKinds) {\n    assertVectorQueryCompatible(\n      backend,\n      slot,\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 ?? slot.metric,\n      \"hybridSearch.vector.minScore\",\n    );\n  }\n  const vectorMetric =\n    options.vector.metric ?? requireDefined(vectorKinds[0]).slot.metric;\n\n  // One candidate subquery per kind, shared by both halves.\n  const candidatesByKind = new Map<string, SqlFragment | undefined>();\n  for (const kind of fulltextKinds) {\n    candidatesByKind.set(kind, buildKindCandidates(ctx, kind, options.where));\n  }\n  for (const { kind } of vectorKinds) {\n    if (!candidatesByKind.has(kind)) {\n      candidatesByKind.set(kind, buildKindCandidates(ctx, kind, options.where));\n    }\n  }\n\n  // Single-statement fast path: one kind, backend support. Both sources,\n  // fusion, liveness, and hydration compose into ONE statement (see\n  // `buildHybridSearchStatement`) — the multi-statement path below remains\n  // for kind expansions and backends without the member.\n  if (\n    backend.hybridSearch !== undefined &&\n    fulltextKinds.length === 1 &&\n    vectorKinds.length === 1 &&\n    fulltextKinds[0] === requireDefined(vectorKinds[0]).kind\n  ) {\n    const kind = fulltextKinds[0];\n    const { slot } = requireDefined(vectorKinds[0]);\n    const candidates = candidatesByKind.get(kind);\n    const hybridFulltextLanguage = effectiveFulltextLanguage(\n      ctx,\n      kind,\n      options.fulltext.language,\n    );\n    const rows = await backend.hybridSearch({\n      graphId,\n      nodeKind: kind,\n      vector: {\n        fieldPath: options.vector.fieldPath,\n        queryEmbedding: options.vector.queryEmbedding,\n        metric: vectorMetric,\n        dimensions: slot.dimensions,\n        indexType: slot.indexType,\n        k: 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      fulltext: {\n        query: options.fulltext.query,\n        k: fulltextK,\n        ...(options.fulltext.mode ? { mode: options.fulltext.mode } : {}),\n        ...(hybridFulltextLanguage === undefined ?\n          {}\n        : { language: hybridFulltextLanguage }),\n        ...(options.fulltext.minScore === undefined ?\n          {}\n        : { minScore: options.fulltext.minScore }),\n        ...(options.fulltext.includeSnippets === undefined ?\n          {}\n        : { includeSnippets: options.fulltext.includeSnippets }),\n      },\n      fusion: { k: fusionK, vectorWeight, fulltextWeight },\n      limit: options.limit,\n      ...(offset === 0 ? {} : { offset }),\n      ...(candidates === undefined ? {} : { candidates }),\n    });\n    return rows.map((row, index) => {\n      const typedNode = rowToNode(row.node) as N;\n      return {\n        node: typedNode,\n        score: row.fusedScore,\n        rank: index + 1,\n        ...(row.vectorRank !== undefined && row.vectorScore !== undefined ?\n          {\n            vector: {\n              node: typedNode,\n              score: row.vectorScore,\n              rank: row.vectorRank,\n            },\n          }\n        : {}),\n        ...(row.fulltextRank !== undefined && row.fulltextScore !== undefined ?\n          {\n            fulltext: {\n              node: typedNode,\n              score: row.fulltextScore,\n              rank: row.fulltextRank,\n              ...(row.snippet === undefined ? {} : { snippet: row.snippet }),\n            },\n          }\n        : {}),\n      };\n    });\n  }\n\n  const vectorPromise = Promise.all(\n    vectorKinds.map(\n      async ({ kind, slot }): Promise<readonly RankedSourceRow[]> => {\n        const candidates = candidatesByKind.get(kind);\n        const rows = await requireDefined(backend.vectorSearch)({\n          graphId,\n          nodeKind: kind,\n          fieldPath: options.vector.fieldPath,\n          queryEmbedding: options.vector.queryEmbedding,\n          // Default to the field's declared metric (see executeVectorSearch).\n          metric: vectorMetric,\n          dimensions: slot.dimensions,\n          indexType: slot.indexType,\n          limit: vectorK,\n          ...(candidates === undefined ? {} : { candidates }),\n          ...(options.vector.minScore === undefined ?\n            {}\n          : { minScore: options.vector.minScore }),\n          ...(options.vector.efSearch === undefined ?\n            {}\n          : { efSearch: options.vector.efSearch }),\n        });\n        return rows.map((row) => ({\n          kind,\n          nodeId: row.nodeId,\n          score: row.score,\n        }));\n      },\n    ),\n  ).then((perKind) => mergeVectorRows(perKind, vectorMetric).slice(0, vectorK));\n\n  const fulltextPromise = Promise.all(\n    fulltextKinds.map(async (kind): Promise<readonly RankedSourceRow[]> => {\n      const candidates = candidatesByKind.get(kind);\n      const language = effectiveFulltextLanguage(\n        ctx,\n        kind,\n        options.fulltext.language,\n      );\n      const rows = await requireDefined(backend.fulltextSearch)({\n        graphId,\n        nodeKind: kind,\n        query: options.fulltext.query,\n        limit: fulltextK,\n        ...(candidates === undefined ? {} : { candidates }),\n        ...(options.fulltext.mode ? { mode: options.fulltext.mode } : {}),\n        ...(language === undefined ? {} : { language }),\n        ...(options.fulltext.minScore === undefined ?\n          {}\n        : { minScore: options.fulltext.minScore }),\n        ...(options.fulltext.includeSnippets === undefined ?\n          {}\n        : { includeSnippets: options.fulltext.includeSnippets }),\n      });\n      return rows.map((row) => ({\n        kind,\n        nodeId: row.nodeId,\n        score: row.score,\n        ...(row.snippet === undefined ? {} : { snippet: row.snippet }),\n      }));\n    }),\n  ).then((perKind) => mergeFulltextRows(perKind).slice(0, fulltextK));\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    kind: string;\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 key = searchNodeKey(row.kind, row.nodeId);\n    const entry = fused.get(key) ?? {\n      kind: row.kind,\n      nodeId: row.nodeId,\n      fusedScore: 0,\n    };\n    entry.fusedScore += contribution;\n    entry.vectorRank = rank;\n    entry.vectorScore = row.score;\n    fused.set(key, entry);\n  }\n\n  for (const [index, row] of fulltextRows.entries()) {\n    const rank = index + 1;\n    const contribution = fulltextWeight / (fusionK + rank);\n    const key = searchNodeKey(row.kind, row.nodeId);\n    const entry = fused.get(key) ?? {\n      kind: row.kind,\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(key, entry);\n  }\n\n  // Code points, not code units: the single-statement path breaks the same tie\n  // with `ORDER BY fused_score DESC, node_id` under SQLite's BINARY collation\n  // or Postgres's forced `C` collation (see `buildHybridSearchStatement`). A\n  // fused-score tie at the page boundary must pick the same winner on both\n  // paths, and only code-point order agrees with byte order.\n  const ranked = [...fused.values()]\n    .toSorted(\n      (a, b) =>\n        b.fusedScore - a.fusedScore ||\n        compareCodePoints(a.kind, b.kind) ||\n        compareCodePoints(a.nodeId, b.nodeId),\n    )\n    .slice(offset, offset + options.limit);\n\n  const nodeMap = await fetchNodesForRows(\n    backend,\n    graphId,\n    ranked.map((entry) => ({\n      kind: entry.kind,\n      nodeId: entry.nodeId,\n      score: entry.fusedScore,\n    })),\n  );\n\n  const hits: HybridSearchHit<N>[] = [];\n  let rank = 1;\n  for (const entry of ranked) {\n    const node = nodeMap.get(searchNodeKey(entry.kind, 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. The search SQL\n      // already constrains top-k to live nodes; this skip is\n      // defense-in-depth for the window between the search statement and\n      // this hydration read (they are separate transactions, so a\n      // concurrent delete can land in between).\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 QueryBuilder } from \"../query/builder/query-builder\";\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\n/**\n * The registered `NodeType` behind a kind literal — the accessor-level\n * companion of {@link ResolveNode}, used to type `where` predicates.\n * Falls back to the base `NodeType` for dynamic (string) kinds.\n */\ntype ResolveNodeType<G extends GraphDef, K extends string> =\n  K extends NodeKinds<G> ?\n    G[\"nodes\"][K] extends NodeRegistration<infer N extends NodeType> ?\n      N\n    : NodeType\n  : NodeType;\n\ntype StoreSearchContext = Readonly<{\n  graphId: string;\n  backend: GraphBackend;\n  registry: KindRegistry;\n  createQuery?: () => QueryBuilder<GraphDef>;\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<ResolveNodeType<G, K>>,\n  ): Promise<readonly FulltextSearchHit<ResolveNode<G, K>>[]> {\n    this.#assertKindRegistered(nodeKind);\n    return executeFulltextSearch<ResolveNode<G, K>>(\n      this.#context,\n      nodeKind,\n      // Contravariance: the narrowed accessor callback is intentionally\n      // wider than the base instantiation the core helpers take.\n      options as unknown as FulltextSearchOptions,\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<ResolveNodeType<G, K>>,\n  ): Promise<readonly VectorSearchHit<ResolveNode<G, K>>[]> {\n    this.#assertKindRegistered(nodeKind);\n    return executeVectorSearch<ResolveNode<G, K>>(\n      this.#context,\n      nodeKind,\n      // Contravariance: the narrowed accessor callback is intentionally\n      // wider than the base instantiation the core helpers take.\n      options as unknown as VectorSearchOptions,\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<ResolveNodeType<G, K>>,\n  ): Promise<readonly HybridSearchHit<ResolveNode<G, K>>[]> {\n    this.#assertKindRegistered(nodeKind);\n    return executeHybridSearch<ResolveNode<G, K>>(\n      this.#context,\n      nodeKind,\n      // Contravariance: the narrowed accessor callback is intentionally\n      // wider than the base instantiation the core helpers take.\n      options as unknown as HybridSearchOptions,\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 * Nominal brands that make the store's \"which backend does this work go\n * through?\" decision a compile-time choice instead of a convention.\n *\n * A history-enabled `Store` holds the same `GraphBackend` shape in two roles:\n *\n * - the **recorded-capture wrapper**, through which every public graph-entity\n *   write must flow so the write is captured, and\n * - the **bare backend**, used for raw SQL / DDL / bulk-materialization work\n *   that intentionally bypasses capture (the wrapper rejects raw DDL and writes\n *   no graph entities of its own).\n *\n * Routing a graph write through the bare backend silently loses history with no\n * error. The brands below turn that footgun into a type error: a function that\n * does bulk/DDL work declares `RawBackend`, a function that performs graph\n * writes declares `GraphWriteBackend`, and the two are not mutually assignable.\n *\n * The brand is erased at runtime — both values are ordinary `GraphBackend`s.\n * Only the `as*` tagging functions, called at the few seams where a role is\n * asserted, bridge a plain backend into a role; they are the greppable audit\n * surface for \"this path was deliberately routed to a capture role.\"\n *\n * This does not brand `TransactionBackend`: the collection-write entrypoint is\n * polymorphic over `GraphBackend | TransactionBackend`, and a raw backend is\n * structurally a `TransactionBackend`, so a brand there would be swallowed by\n * the union. The protection therefore covers the full-`GraphBackend` bulk/DDL\n * seams (where new capture-bypassing paths are actually added). Branding the\n * transaction surface is a deliberate follow-up, gated on a real bypass pattern.\n */\nimport { type GraphBackend } from \"./types\";\n\ndeclare const BackendRoleBrand: unique symbol;\n\n/**\n * The backend through which **graph-entity writes** (node/edge\n * create/update/delete) flow. When `history: true` this is the recorded-capture\n * wrapper; when history is off it is the bare backend. Either way, routing graph\n * writes here is what guarantees capture runs when it should.\n */\nexport type GraphWriteBackend = GraphBackend &\n  Readonly<{ [BackendRoleBrand]: \"graph-write\" }>;\n\n/**\n * A backend for raw SQL / DDL / bulk-materialization work that **intentionally\n * bypasses** recorded-time capture. Never route public graph-entity writes\n * here — that is the silent-history-loss footgun this brand exists to catch.\n */\nexport type RawBackend = GraphBackend & Readonly<{ [BackendRoleBrand]: \"raw\" }>;\n\n/** Tags a backend as the graph-write seam. Call only where capture is wired. */\nexport function asGraphWriteBackend(backend: GraphBackend): GraphWriteBackend {\n  return backend as GraphWriteBackend;\n}\n\n/** Tags a backend as the raw/DDL/bulk seam (capture-bypassing). */\nexport function asRawBackend(backend: GraphBackend): RawBackend {\n  return backend as RawBackend;\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 { requireDefined } from \"../utils/presence\";\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 = requireDefined(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(\n      kind,\n      name,\n      requireDefined(existing[name]),\n      requireDefined(next[name]),\n      recorders,\n    );\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","import { type GraphBackend } from \"../../backend/types\";\nimport { type GraphDef } from \"../../core/define-graph\";\nimport {\n  assertValidRecordedInstant,\n  type RecordedInstant,\n  resolveReadCoordinate,\n} from \"../../core/temporal\";\nimport { type TemporalMode } from \"../../core/types\";\nimport {\n  ConfigurationError,\n  UnsupportedBackendCapabilityError,\n} from \"../../errors\";\nimport { compileKindFilter } from \"../../query/compiler/predicate-utils\";\nimport { MAX_EXPLICIT_RECURSIVE_DEPTH } from \"../../query/compiler/recursive\";\nimport {\n  type RecordedReadBinding,\n  recordedReadSchemaFor,\n  type SqlSchema,\n} from \"../../query/compiler/schema\";\nimport {\n  compileTemporalFilter,\n  currentReadInstant,\n  type TemporalFilterOptions,\n} from \"../../query/compiler/temporal\";\nimport { type DialectAdapter } from \"../../query/dialect/types\";\nimport { sql, type SqlFragment } from \"../../query/sql-fragment\";\nimport { type KindRegistry } from \"../../registry/kind-registry\";\nimport { compareCodePoints } from \"../../utils/compare\";\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  /** Graph definition — degree() enumerates declared edge endpoint kinds. */\n  graph: GraphDef;\n  /** Kind registry — expands declared endpoint kinds through subClassOf. */\n  registry: KindRegistry;\n  backend: GraphBackend;\n  dialect: DialectAdapter;\n  schema: SqlSchema;\n  recordedReadBinding: RecordedReadBinding | undefined;\n  defaultTemporalMode: TemporalMode;\n}>;\n\nexport type InternalTemporalOptions = Readonly<{\n  temporalMode?: TemporalMode;\n  asOf?: string;\n  recordedAsOf?: RecordedInstant;\n}>;\n\nexport type InternalTraversalOptions = InternalTemporalOptions &\n  Readonly<{\n    edges: readonly string[];\n    maxHops?: number;\n    direction?: TraversalDirection;\n    cyclePolicy?: AlgorithmCyclePolicy;\n    workingMemory?: string;\n    /**\n     * Numeric edge property supplying per-edge traversal weights. When set,\n     * the iterative operation compiles a shared weight expression and every\n     * edge expansion carries a `weight` column.\n     */\n    weightProperty?: string;\n    /** Weight substituted for edges missing `weightProperty`. */\n    defaultWeight?: number;\n  }>;\n\n/** Copies only explicitly supplied temporal overrides for option forwarding. */\nexport function pickTemporalOptions(\n  options: InternalTemporalOptions,\n): InternalTemporalOptions {\n  return {\n    ...(options.temporalMode === undefined ?\n      {}\n    : { temporalMode: options.temporalMode }),\n    ...(options.asOf === undefined ? {} : { asOf: options.asOf }),\n    ...(options.recordedAsOf === undefined ?\n      {}\n    : { recordedAsOf: options.recordedAsOf }),\n  };\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<{\n  temporalMode: TemporalMode;\n  asOf?: string;\n  recordedAsOf?: RecordedInstant;\n}> {\n  const { valid } = resolveReadCoordinate(\n    options.temporalMode ?? ctx.defaultTemporalMode,\n    options.asOf,\n  );\n  // `recordedAsOf` normally arrives pre-validated through StoreView's\n  // withRecordedCoordinate, but it is absent from the public algorithm option\n  // types, so validate here too: a type-unsafe caller that smuggles a\n  // non-canonical timestamp would otherwise be string-compared raw against\n  // recorded_from/recorded_to and return wrong rows on SQLite.\n  if (options.recordedAsOf !== undefined) {\n    assertValidRecordedInstant(options.recordedAsOf, \"recordedAsOf\");\n  }\n  return {\n    temporalMode: valid.mode,\n    ...(valid.asOf !== undefined && { asOf: valid.asOf }),\n    ...(options.recordedAsOf === undefined ?\n      {}\n    : { recordedAsOf: options.recordedAsOf }),\n  };\n}\n\nexport function resolveReadSchema(\n  ctx: AlgorithmContext,\n  options: InternalTemporalOptions,\n): SqlSchema {\n  return recordedReadSchemaFor(\n    ctx.schema,\n    options.recordedAsOf,\n    ctx.recordedReadBinding,\n    \"recorded-graph-algorithm\",\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    recordedAsOf: resolved.recordedAsOf,\n    tableAlias,\n    currentTimestamp: currentReadInstant(),\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\n/**\n * Validates an iterative algorithm's round budget. Unlike {@link\n * resolveMaxHops}, the budget is not a traversal depth bound — convergence\n * normally ends the run first — so it is not capped at the recursive-CTE\n * depth limit.\n */\nexport function resolveMaxIterations(\n  value: number | undefined,\n  fallback: number,\n  algorithm: string,\n): number {\n  const maxIterations = value ?? fallback;\n  if (!Number.isSafeInteger(maxIterations) || maxIterations < 1) {\n    throw new ConfigurationError(\n      `${algorithm} maxIterations must be a positive safe integer, got ${String(maxIterations)}.`,\n      { maxIterations },\n    );\n  }\n  return maxIterations;\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\n/**\n * Compiles the induced-subgraph node filter for a working-table seeding\n * statement over the nodes-table alias `n`; `undefined` selects every kind.\n */\nexport function compileNodeKindSeedFilter(\n  nodeKinds: readonly string[] | undefined,\n): SqlFragment {\n  if (nodeKinds === undefined) return sql`TRUE`;\n  return compileKindFilter(sql.raw(\"n.kind\"), nodeKinds);\n}\n\n/**\n * Deduplicates and code-point-sorts an induced-subgraph kind selection so\n * compiled kind filters are deterministic across call sites and backends.\n */\nexport function normalizeNodeKinds(\n  nodeKinds: readonly string[] | undefined,\n): readonly string[] | undefined {\n  if (nodeKinds === undefined) return undefined;\n  return [...new Set(nodeKinds)].toSorted((left, right) =>\n    compareCodePoints(left, right),\n  );\n}\n\nexport function assertGraphAnalyticsSupported(\n  ctx: AlgorithmContext,\n  algorithm: string,\n  options: Readonly<{ requiresWindowFunctions?: boolean }> = {},\n): void {\n  const graphAnalytics =\n    ctx.backend.capabilities.graphAnalytics?.supported === true;\n  const windowFunctions = ctx.backend.capabilities.windowFunctions;\n  if (\n    graphAnalytics &&\n    (options.requiresWindowFunctions !== true || windowFunctions)\n  ) {\n    return;\n  }\n\n  throw new UnsupportedBackendCapabilityError(\n    algorithm,\n    \"graphAnalytics\",\n    {\n      dialect: ctx.backend.dialect,\n      supported: graphAnalytics,\n      ...(options.requiresWindowFunctions === true ? { windowFunctions } : {}),\n    },\n    \"Use a built-in transactional SQLite/PostgreSQL backend, or declare graphAnalytics support on a compatible custom backend.\",\n  );\n}\n","import { compileKindFilter } from \"../../query/compiler/predicate-utils\";\nimport { sql, type SqlFragment } from \"../../query/sql-fragment\";\nimport { asCompiledRowsSql } from \"../../query/sql-intent\";\nimport {\n  type AlgorithmContext,\n  type InternalTemporalOptions,\n  resolveReadSchema,\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  const edgeKinds = options.edges ?? Object.keys(ctx.graph.edges);\n  // A graph that declares no edge kinds has no edges to count — provably zero\n  // without a round trip.\n  if (edgeKinds.length === 0) return 0;\n\n  const schema = resolveReadSchema(ctx, options);\n  const whereClauses: SqlFragment[] = [\n    sql`graph_id = ${ctx.graphId}`,\n    resolveTemporalFilter(ctx, options),\n    compileDirectionFilter(ctx, direction, nodeId, schema.nodesTable),\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 ${schema.edgesTable} WHERE ${sql.join(whereClauses, sql` AND `)}`;\n\n  const rows = await ctx.backend.execute<Readonly<{ count: number | string }>>(\n    asCompiledRowsSql(query),\n  );\n  return Number(rows[0]?.count ?? 0);\n}\n\n/**\n * The counted node's own kind, as a scalar subquery.\n *\n * Every edge row stores the *actual* kind of each endpoint node — the write\n * path takes `from_kind` straight off the `from` node reference, and a node's\n * kind is immutable for the life of its id. So for any edge incident to\n * `nodeId`, the endpoint kind on `nodeId`'s side equals `nodeId`'s kind, and\n * nothing else. That makes this an equality the composite edge indexes seek on\n * directly, and it stays true no matter how the graph's endpoint declarations\n * evolve.\n *\n * (Enumerating the *declared* endpoint kinds instead — the shape this replaced\n * — held only for rows written under the current declaration. Narrow an edge's\n * `from: [Person]` to `from: [Employee]` and every `Person`-rooted edge already\n * on disk drops out of the filter, silently undercounting.)\n *\n * The subquery is uncorrelated, so both engines evaluate it once and treat the\n * result as a constant: Postgres hoists it to an InitPlan, SQLite runs it as a\n * one-shot scalar subquery. `LIMIT 1` is required in recorded-time mode, where\n * the resolved nodes relation holds one row per recorded version of the node.\n * An unknown `nodeId` yields NULL, and `from_kind = NULL` matches nothing —\n * degree 0, which is what a node that does not exist has.\n */\nfunction nodeKindSubquery(\n  ctx: AlgorithmContext,\n  nodeId: string,\n  nodesTable: SqlFragment,\n): SqlFragment {\n  return sql`(SELECT kind FROM ${nodesTable} WHERE graph_id = ${ctx.graphId} AND id = ${nodeId} LIMIT 1)`;\n}\n\n/**\n * Direction filter shaped for the default edge indexes: the endpoint-kind\n * equality comes first so `edges_from_idx (graph_id, from_kind, from_id, …)`\n * / `edges_to_idx (graph_id, to_kind, to_id, …)` can seek — a bare\n * `from_id = ?` scans the whole edge partition because both indexes lead\n * with the kind column.\n */\nfunction compileDirectionFilter(\n  ctx: AlgorithmContext,\n  direction: TraversalDirection,\n  nodeId: string,\n  nodesTable: SqlFragment,\n): SqlFragment {\n  const nodeKind = nodeKindSubquery(ctx, nodeId, nodesTable);\n  const fromSide = sql`(from_kind = ${nodeKind} AND from_id = ${nodeId})`;\n  const toSide = sql`(to_kind = ${nodeKind} AND to_id = ${nodeId})`;\n\n  switch (direction) {\n    case \"out\": {\n      return fromSide;\n    }\n    case \"in\": {\n      return toSide;\n    }\n    case \"both\": {\n      return sql`(${fromSide} OR ${toSide})`;\n    }\n  }\n}\n","import {\n  type GraphBackend,\n  INTERNAL_TEMPORARY_WRITES,\n  type InternalTransactionOptions,\n  type TransactionBackend,\n} from \"../../backend/types\";\nimport {\n  CompilerInvariantError,\n  ConfigurationError,\n  GraphAlgorithmConvergenceError,\n} from \"../../errors\";\nimport {\n  compileKindFilter,\n  sqlValueList,\n} from \"../../query/compiler/predicate-utils\";\nimport {\n  compileTemporalFilter,\n  currentReadInstant,\n} from \"../../query/compiler/temporal\";\nimport { type DialectAdapter } from \"../../query/dialect/types\";\nimport { jsonPointer } from \"../../query/json-pointer\";\nimport { sql, type SqlFragment } from \"../../query/sql-fragment\";\nimport {\n  asCompiledRowsSql,\n  asCompiledTemporaryStatementSql,\n} from \"../../query/sql-intent\";\nimport { compareCodePoints, compareStrings } from \"../../utils/compare\";\nimport { generateId } from \"../../utils/id\";\nimport { isPresent } from \"../../utils/presence\";\nimport type { AlgorithmContext, InternalTraversalOptions } from \"./context\";\nimport { resolveReadSchema, resolveTemporalOptions } from \"./context\";\nimport type { PathNode, TraversalDirection } from \"./types\";\n\ntype QueryBackend = Pick<GraphBackend, \"capabilities\" | \"execute\">;\ntype WorkingTableIdentifier = ReturnType<typeof sql.identifier>;\ntype CapturedFailure = Readonly<{ error: unknown }>;\n\nexport type IterativeGraphOperation = Readonly<{\n  backend: QueryBackend;\n  ctx: AlgorithmContext;\n  edgeKindChunks: readonly (readonly string[])[];\n  direction: TraversalDirection;\n  maxWorkingSetSize: number;\n  nodeTemporalFilter: ReturnType<typeof compileTemporalFilter>;\n  edgeTemporalFilter: ReturnType<typeof compileTemporalFilter>;\n  schema: ReturnType<typeof resolveReadSchema>;\n  /**\n   * Validated caller-requested transaction-scoped memory override for\n   * working-table rounds; `undefined` inherits the engine's configuration.\n   */\n  workingMemory: string | undefined;\n  /**\n   * Per-edge traversal weight over the expansion's edge alias `e`, compiled\n   * from the caller's `weightProperty`/`defaultWeight`. When set, every edge\n   * expansion carries it as a `weight` column; `undefined` for unweighted\n   * operations.\n   */\n  weightExpression: SqlFragment | undefined;\n}>;\n\nexport type NodeIdentityKey = string & {\n  readonly __nodeIdentityKey: unique symbol;\n};\n\nexport type NodeExpansion = Readonly<{\n  source: PathNode;\n  target: PathNode;\n  /** Edge weight; present exactly when the operation is weighted. */\n  weight?: number;\n}>;\n\ntype TemporaryStatementBackend = QueryBackend &\n  Pick<TransactionBackend, \"executeTemporaryStatement\"> &\n  Readonly<{\n    executeTemporaryStatement: NonNullable<\n      TransactionBackend[\"executeTemporaryStatement\"]\n    >;\n  }>;\n\nexport type IterativeGraphRunContext = Readonly<{\n  operation: IterativeGraphOperation;\n  backend: TemporaryStatementBackend;\n  workingTable: WorkingTableIdentifier;\n  graphId: string;\n  runId: string;\n  executeTemporary: (query: SqlFragment) => Promise<void>;\n}>;\n\nexport type IterativeGraphState = Readonly<{\n  workingTableSize: number;\n}>;\n\nexport function frontierIndexIdentifier(\n  context: IterativeGraphRunContext,\n): SqlFragment {\n  return sql.identifier(\n    `typegraph_iterative_${context.runId.replaceAll(\"-\", \"_\")}_frontier`,\n  );\n}\n\ntype WorkingTableCountRow = Readonly<{ count: number | string }>;\n\n/** Counts this run's working-table rows; drivers may deliver bigint text. */\nexport async function countWorkingTableRows(\n  context: IterativeGraphRunContext,\n): Promise<number> {\n  const rows = await context.backend.execute<WorkingTableCountRow>(\n    asCompiledRowsSql(sql`\n      SELECT COUNT(*) AS count\n      FROM ${context.workingTable}\n      WHERE graph_id = ${context.graphId} AND run_id = ${context.runId}\n    `),\n  );\n  return Number(rows[0]?.count ?? 0);\n}\n\nexport type IterativeGraphPlan<\n  State extends IterativeGraphState,\n  Result,\n> = Readonly<{\n  algorithm: string;\n  maxIterations: number;\n  createWorkingTable: (context: IterativeGraphRunContext) => SqlFragment;\n  initialize: (context: IterativeGraphRunContext) => Promise<State>;\n  runRound: (\n    context: IterativeGraphRunContext,\n    state: State,\n    iteration: number,\n  ) => Promise<State>;\n  hasConverged: (state: State) => boolean;\n  extractResult: (\n    context: IterativeGraphRunContext,\n    state: State,\n  ) => Promise<Result>;\n  /** Drops any plan-owned temporary relations before the working table. */\n  cleanup?: (context: IterativeGraphRunContext) => Promise<void>;\n}>;\n\ntype ExpansionRow = Readonly<{\n  source_id: string;\n  source_kind: string;\n  target_id: string;\n  target_kind: string;\n  /** Present when the operation is weighted; drivers may deliver text. */\n  weight?: number | string | null;\n}>;\n\ntype VisibleNodeRow = Readonly<{\n  id: string;\n  kind: string;\n}>;\n\nexport const DEFAULT_MAX_BIND_PARAMETERS = 999;\nconst RESERVED_TEMPORAL_BIND_PARAMETERS_PER_BRANCH = 12;\n/** Headroom for the weight expression's path and default-weight binds. */\nconst RESERVED_WEIGHT_BIND_PARAMETERS_PER_BRANCH = 4;\n/**\n * PostgreSQL initially estimates an un-analyzed temporary relation at one row.\n * Even a few dozen rows can distort join ordering on a dense edge expansion,\n * while ANALYZE remains a low-single-digit-millisecond operation at this size.\n * Keep the trigger below the 31-person smoke graph that exposed this cliff.\n */\nexport const WORKING_TABLE_ANALYZE_MINIMUM_ROWS = 16;\n/** Caps statistics drift for growing BFS-style working tables at under 4x. */\nexport const WORKING_TABLE_ANALYZE_GROWTH_FACTOR = 4;\n\n/**\n * Accepts only a plain integer with a binary unit suffix. The value reaches\n * the engine as a bound parameter, but a strict shape keeps the option from\n * ever smuggling arbitrary text into a settings statement and rejects\n * ambiguous inputs (fractions, spaces, unknown units) up front.\n */\nconst ITERATIVE_WORKING_MEMORY_PATTERN = /^(\\d+)(kB|MB|GB)$/;\n\nconst WORKING_MEMORY_KILOBYTES_PER_UNIT: Readonly<Record<string, number>> = {\n  kB: 1,\n  MB: 1024,\n  GB: 1024 * 1024,\n};\n\n/**\n * PostgreSQL's accepted `work_mem` range (in kB, its base unit). Values\n * outside it fail `set_config` mid-transaction with a raw engine error on\n * PostgreSQL while SQLite would silently accept them — so both backends\n * reject them up front with the same typed error instead.\n */\nconst MIN_WORKING_MEMORY_KILOBYTES = 64;\nconst MAX_WORKING_MEMORY_KILOBYTES = 2_147_483_647;\n\n/**\n * Validates an explicitly requested working-memory override. `undefined`\n * means the caller did not opt in: the operation inherits the engine's\n * configured setting and emits no override — `work_mem` is a threshold each\n * sort/hash operator (and each parallel worker) may allocate up to, not a\n * per-operation budget, so silently raising it for every algorithm call\n * could multiply memory use far past what a DBA provisioned.\n */\nfunction resolveWorkingMemory(\n  workingMemory: string | undefined,\n): string | undefined {\n  if (workingMemory === undefined) return undefined;\n  const match = ITERATIVE_WORKING_MEMORY_PATTERN.exec(workingMemory);\n  if (match === null) {\n    throw new ConfigurationError(\n      `Iterative graph operation workingMemory must be digits followed by kB, MB, or GB (for example \"64MB\"), got ${JSON.stringify(workingMemory)}.`,\n      { workingMemory },\n    );\n  }\n  const kilobytes =\n    Number(match[1]) * (WORKING_MEMORY_KILOBYTES_PER_UNIT[match[2] ?? \"\"] ?? 0);\n  if (\n    kilobytes < MIN_WORKING_MEMORY_KILOBYTES ||\n    kilobytes > MAX_WORKING_MEMORY_KILOBYTES\n  ) {\n    throw new ConfigurationError(\n      `Iterative graph operation workingMemory must be between ${MIN_WORKING_MEMORY_KILOBYTES}kB and ${MAX_WORKING_MEMORY_KILOBYTES}kB, got ${JSON.stringify(workingMemory)}.`,\n      { workingMemory, kilobytes },\n    );\n  }\n  return workingMemory;\n}\n\n/**\n * Opens the shared execution scope for iterative graph algorithms. The host\n * controls rounds and convergence; this scope supplies a snapshot-consistent,\n * bind-limit-aware SQL working relation for each round.\n *\n * The working relation is emitted as chunked `VALUES` rows rather than a\n * connection-local temporary table. That keeps the primitive portable to\n * backends such as D1 that cannot promise one pinned connection. Transactional\n * backends still run all rounds in one read-only snapshot.\n */\nexport async function withInlineIterativeGraphOperation<T>(\n  ctx: AlgorithmContext,\n  options: InternalTraversalOptions,\n  run: (operation: IterativeGraphOperation) => Promise<T>,\n): Promise<T> {\n  if (ctx.backend.capabilities.transactions) {\n    return ctx.backend.transaction(\n      async (backend) => run(createOperation(ctx, options, backend)),\n      {\n        isolationLevel: \"repeatable_read\",\n        accessMode: \"read_only\",\n      },\n    );\n  }\n  return run(createOperation(ctx, options, ctx.backend));\n}\n\n/**\n * Runs a compiler-defined iterative algorithm against a real temporary working\n * table. The primitive owns the read-only snapshot, iteration cap, convergence\n * check, and `finally` cleanup; the plan owns only table shape, round SQL, and\n * result extraction.\n */\nexport async function runIterativeGraphOperation<\n  State extends IterativeGraphState,\n  Result,\n>(\n  ctx: AlgorithmContext,\n  options: InternalTraversalOptions,\n  plan: IterativeGraphPlan<State, Result>,\n): Promise<Result> {\n  if (!ctx.backend.capabilities.transactions) {\n    throw new ConfigurationError(\n      \"Temporary-table graph iteration requires a transactional backend.\",\n      { dialect: ctx.backend.dialect },\n    );\n  }\n\n  const transactionOptions = {\n    isolationLevel: \"repeatable_read\",\n    accessMode: \"read_only\",\n    temporaryWrites: INTERNAL_TEMPORARY_WRITES,\n  } satisfies InternalTransactionOptions;\n\n  return ctx.backend.transaction(async (backend) => {\n    const temporaryBackend = requireTemporaryStatements(backend);\n    const runId = generateId();\n    const workingTable = sql.identifier(\n      `typegraph_iterative_${runId.replaceAll(\"-\", \"_\")}`,\n    );\n    const context: IterativeGraphRunContext = {\n      operation: createOperation(ctx, options, temporaryBackend),\n      backend: temporaryBackend,\n      workingTable,\n      graphId: ctx.graphId,\n      runId,\n      executeTemporary: async (query) => {\n        await temporaryBackend.executeTemporaryStatement(\n          asCompiledTemporaryStatementSql(query),\n        );\n      },\n    };\n\n    // Opt-in only: without an explicit workingMemory the rounds inherit\n    // the engine's configured setting. When requested, the override is\n    // transaction-scoped — `set_config(..., is_local => true)` reverts\n    // when this transaction ends, so the session/server setting is never\n    // touched. SQLite returns no statement here.\n    if (context.operation.workingMemory !== undefined) {\n      const workingMemoryStatement = ctx.dialect.setTransactionWorkingMemory(\n        context.operation.workingMemory,\n      );\n      if (workingMemoryStatement !== undefined) {\n        await context.executeTemporary(workingMemoryStatement);\n      }\n    }\n    await context.executeTemporary(plan.createWorkingTable(context));\n    let operationFailure: CapturedFailure | undefined;\n    try {\n      let state = await plan.initialize(context);\n      let analyzedRowCount = await refreshWorkingTableStatistics(\n        context,\n        state.workingTableSize,\n      );\n      for (\n        let iteration = 1;\n        iteration <= plan.maxIterations && !plan.hasConverged(state);\n        iteration++\n      ) {\n        state = await plan.runRound(context, state, iteration);\n        // Statistics only pay off in a subsequent round: skip the refresh\n        // when the operation just converged or the iteration budget is\n        // spent — no further round will read the working table.\n        if (iteration < plan.maxIterations && !plan.hasConverged(state)) {\n          analyzedRowCount = await refreshWorkingTableStatistics(\n            context,\n            state.workingTableSize,\n            analyzedRowCount,\n          );\n        }\n      }\n      if (!plan.hasConverged(state)) {\n        throw new GraphAlgorithmConvergenceError(\n          plan.algorithm,\n          plan.maxIterations,\n        );\n      }\n      return await plan.extractResult(context, state);\n    } catch (error) {\n      operationFailure = { error };\n      throw error;\n    } finally {\n      await cleanupWorkingTables(context, plan.cleanup, operationFailure);\n    }\n  }, transactionOptions);\n}\n\nexport function shouldRefreshWorkingTableStatistics(\n  workingTableSize: number,\n  analyzedRowCount?: number,\n): boolean {\n  if (workingTableSize < WORKING_TABLE_ANALYZE_MINIMUM_ROWS) return false;\n  if (analyzedRowCount === undefined) return true;\n  return (\n    workingTableSize >= analyzedRowCount * WORKING_TABLE_ANALYZE_GROWTH_FACTOR\n  );\n}\n\nasync function refreshWorkingTableStatistics(\n  context: IterativeGraphRunContext,\n  workingTableSize: number,\n  analyzedRowCount?: number,\n): Promise<number | undefined> {\n  if (\n    !shouldRefreshWorkingTableStatistics(workingTableSize, analyzedRowCount)\n  ) {\n    return analyzedRowCount;\n  }\n  const statement = context.operation.ctx.dialect.analyzeTemporaryTable(\n    context.workingTable,\n  );\n  if (statement === undefined) return analyzedRowCount;\n  await context.executeTemporary(statement);\n  return workingTableSize;\n}\n\nasync function dropWorkingTable(\n  context: IterativeGraphRunContext,\n  hasPrimaryFailure: boolean,\n): Promise<void> {\n  try {\n    await context.executeTemporary(\n      sql`DROP TABLE IF EXISTS ${context.workingTable}`,\n    );\n  } catch (cleanupError) {\n    // A failed PostgreSQL statement aborts the transaction, so DROP is\n    // rejected too; rollback then owns cleanup. Preserve the algorithm's root\n    // error instead of masking it with \"transaction is aborted\".\n    if (!hasPrimaryFailure) throw cleanupError;\n  }\n}\n\nasync function cleanupWorkingTables(\n  context: IterativeGraphRunContext,\n  cleanup: IterativeGraphPlan<IterativeGraphState, unknown>[\"cleanup\"],\n  operationFailure: CapturedFailure | undefined,\n): Promise<void> {\n  let cleanupFailure: CapturedFailure | undefined;\n  try {\n    await cleanup?.(context);\n  } catch (error) {\n    // Preserve a failed operation over a secondary cleanup failure. When\n    // cleanup itself is the first failure, preserve it over a subsequent\n    // PostgreSQL \"transaction is aborted\" error from dropping the main table.\n    if (operationFailure === undefined) cleanupFailure = { error };\n  }\n\n  await dropWorkingTable(\n    context,\n    operationFailure !== undefined || cleanupFailure !== undefined,\n  );\n  if (cleanupFailure !== undefined) throw cleanupFailure.error;\n}\n\nexport async function fetchVisibleWorkingNodes(\n  operation: IterativeGraphOperation,\n  nodeIds: readonly string[],\n): Promise<readonly PathNode[]> {\n  const nodes = new Map<NodeIdentityKey, PathNode>();\n  for (const chunk of chunkValues(nodeIds, operation.maxWorkingSetSize)) {\n    const query = sql`SELECT n.id, n.kind FROM ${operation.schema.nodesTable} n WHERE n.graph_id = ${operation.ctx.graphId} AND n.id IN (${sqlValueList(chunk)}) AND ${operation.nodeTemporalFilter}`;\n    const rows = await operation.backend.execute<VisibleNodeRow>(\n      asCompiledRowsSql(query),\n    );\n    for (const row of rows) nodes.set(nodeIdentityKey(row), row);\n  }\n  return [...nodes.values()].toSorted((left, right) =>\n    compareNodeIdentity(left, right),\n  );\n}\n\n/**\n * Expands one working-set round and reduces all matching edges by target-node\n * identity before returning to the host loop. Callers choose the reduction:\n * BFS keeps one predecessor, label-min keeps the smallest propagated label,\n * and other fixpoint algorithms can define their own associative merge.\n */\nexport async function reduceExpandedWorkingSet<T>(\n  operation: IterativeGraphOperation,\n  workingSet: readonly PathNode[],\n  direction: TraversalDirection,\n  reduce: (current: T | undefined, expansion: NodeExpansion) => T | undefined,\n): Promise<ReadonlyMap<NodeIdentityKey, T>> {\n  const reduced = new Map<NodeIdentityKey, T>();\n  for (const edgeKinds of operation.edgeKindChunks) {\n    for (const chunk of chunkValues(workingSet, operation.maxWorkingSetSize)) {\n      const rows = await operation.backend.execute<ExpansionRow>(\n        asCompiledRowsSql(\n          compileExpansionQuery(operation, chunk, direction, edgeKinds),\n        ),\n      );\n      for (const row of rows) {\n        // A weighted operation compiles a weight column into every\n        // expansion, and weighted algorithms audit their weight domain\n        // before expanding — so a NULL weight here means either a plan\n        // skipped that audit, or (on a backend without snapshot isolation)\n        // a concurrent write invalidated a weight mid-run. Silently\n        // dropping the edge would return plausible-but-wrong results.\n        if (\n          operation.weightExpression !== undefined &&\n          !isPresent(row.weight)\n        ) {\n          throw new CompilerInvariantError(\n            \"Weighted graph expansion produced a NULL weight. Either the plan skipped its weight audit, or edge data changed concurrently during a run on a backend without snapshot isolation.\",\n            { source: row.source_id, target: row.target_id },\n          );\n        }\n        const expansion = {\n          source: { id: row.source_id, kind: row.source_kind },\n          target: { id: row.target_id, kind: row.target_kind },\n          ...(isPresent(row.weight) ? { weight: Number(row.weight) } : {}),\n        } satisfies NodeExpansion;\n        const targetKey = nodeIdentityKey(expansion.target);\n        const selected = reduce(reduced.get(targetKey), expansion);\n        if (selected !== undefined) reduced.set(targetKey, selected);\n      }\n    }\n  }\n  return reduced;\n}\n\nexport function nodeIdentityKey(node: PathNode): NodeIdentityKey {\n  return `${node.kind}\\u0000${node.id}` as NodeIdentityKey;\n}\n\n/**\n * Builds a node-identity key from a working-table row's nullable\n * predecessor columns. Drivers deliver SQL NULL in varying shapes, so only\n * a string pair counts as a real predecessor.\n */\nexport function nodeIdentityKeyFromRow(\n  id: unknown,\n  kind: unknown,\n): NodeIdentityKey | undefined {\n  if (typeof id !== \"string\" || typeof kind !== \"string\") return undefined;\n  return nodeIdentityKey({ id, kind });\n}\n\nexport function compareNodeIdentity(left: PathNode, right: PathNode): number {\n  return (\n    compareCodePoints(left.id, right.id) ||\n    compareCodePoints(left.kind, right.kind)\n  );\n}\n\ntype DirectionFields = Readonly<{\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\nconst OUTGOING_DIRECTION_FIELDS = {\n  joinField: \"from_id\",\n  joinKindField: \"from_kind\",\n  targetField: \"to_id\",\n  targetKindField: \"to_kind\",\n} as const satisfies DirectionFields;\n\nconst INCOMING_DIRECTION_FIELDS = {\n  joinField: \"to_id\",\n  joinKindField: \"to_kind\",\n  targetField: \"from_id\",\n  targetKindField: \"from_kind\",\n} as const satisfies DirectionFields;\n\nfunction fieldsForDirection(\n  direction: TraversalDirection,\n): readonly DirectionFields[] {\n  switch (direction) {\n    case \"out\": {\n      return [OUTGOING_DIRECTION_FIELDS];\n    }\n    case \"in\": {\n      return [INCOMING_DIRECTION_FIELDS];\n    }\n    case \"both\": {\n      return [OUTGOING_DIRECTION_FIELDS, INCOMING_DIRECTION_FIELDS];\n    }\n  }\n}\n\nfunction compileDirectionUnion(\n  direction: TraversalDirection,\n  compileDirection: (fields: DirectionFields) => SqlFragment,\n): SqlFragment {\n  return sql.join(\n    fieldsForDirection(direction).map((fields) => compileDirection(fields)),\n    sql` UNION ALL `,\n  );\n}\n\nfunction compileExpansionQuery(\n  operation: IterativeGraphOperation,\n  workingSet: readonly PathNode[],\n  direction: TraversalDirection,\n  edgeKinds: readonly string[],\n): ReturnType<typeof sql> {\n  const workingValues = sql.join(\n    workingSet.map((node) => sql`(${node.id}, ${node.kind})`),\n    sql`, `,\n  );\n  const workingCte = sql`WITH working_set(node_id, node_kind) AS (VALUES ${workingValues})`;\n\n  const expansion = compileDirectionUnion(direction, (fields) =>\n    compileDirectionalExpansion(\n      operation,\n      sql`working_set`,\n      sql`TRUE`,\n      edgeKinds,\n      fields.joinField,\n      fields.joinKindField,\n      fields.targetField,\n      fields.targetKindField,\n    ),\n  );\n  return sql`${workingCte} ${expansion}`;\n}\n\nexport function compileWorkingTableExpansion(\n  operation: IterativeGraphOperation,\n  workingTable: WorkingTableIdentifier,\n  sourceFilter: SqlFragment,\n  direction: TraversalDirection,\n  edgeKinds: readonly string[],\n): SqlFragment {\n  return compileDirectionUnion(direction, (fields) =>\n    compileDirectionalExpansion(\n      operation,\n      workingTable,\n      sourceFilter,\n      edgeKinds,\n      fields.joinField,\n      fields.joinKindField,\n      fields.targetField,\n      fields.targetKindField,\n    ),\n  );\n}\n\n/**\n * Expands a working-table frontier through visible edges without joining target\n * nodes. Callers that reduce duplicate targets first can defer the target-node\n * visibility join until after that reduction, avoiding repeated point lookups\n * for the same target on dense frontiers. `sourceProjection` lets callers\n * carry trusted working-row state through the expansion without re-joining it.\n */\nexport function compileWorkingTableEdgeExpansion(\n  operation: IterativeGraphOperation,\n  workingTable: WorkingTableIdentifier,\n  sourceFilter: SqlFragment,\n  direction: TraversalDirection,\n  edgeKinds: readonly string[],\n  sourceProjection?: SqlFragment,\n): SqlFragment {\n  return compileDirectionUnion(direction, (fields) =>\n    compileDirectionalEdgeExpansion(\n      operation,\n      workingTable,\n      sourceFilter,\n      edgeKinds,\n      fields.joinField,\n      fields.joinKindField,\n      fields.targetField,\n      fields.targetKindField,\n      sourceProjection,\n    ),\n  );\n}\n\nfunction compileDirectionalExpansion(\n  operation: IterativeGraphOperation,\n  workingRelation: SqlFragment | WorkingTableIdentifier,\n  sourceFilter: SqlFragment,\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): ReturnType<typeof sql> {\n  const edgeExpansion = compileDirectionalEdgeExpansion(\n    operation,\n    workingRelation,\n    sourceFilter,\n    edgeKinds,\n    joinField,\n    joinKindField,\n    targetField,\n    targetKindField,\n  );\n  const weightColumn =\n    operation.weightExpression === undefined ? sql`` : sql`, expanded.weight`;\n  return sql`SELECT expanded.source_id, expanded.source_kind, n.id AS target_id, n.kind AS target_kind${weightColumn} FROM (${edgeExpansion}) expanded JOIN ${operation.schema.nodesTable} n ON n.graph_id = ${operation.ctx.graphId} AND n.id = expanded.target_id AND n.kind = expanded.target_kind WHERE ${operation.nodeTemporalFilter}`;\n}\n\nfunction compileDirectionalEdgeExpansion(\n  operation: IterativeGraphOperation,\n  workingRelation: SqlFragment | WorkingTableIdentifier,\n  sourceFilter: SqlFragment,\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  sourceProjection?: SqlFragment,\n): ReturnType<typeof sql> {\n  const edgeKindFilter = compileKindFilter(sql.raw(\"e.kind\"), edgeKinds);\n  const weightColumn =\n    operation.weightExpression === undefined ?\n      sql``\n    : sql`, ${operation.weightExpression} AS weight`;\n  const sourceColumns =\n    sourceProjection === undefined ? sql`` : sql`, ${sourceProjection}`;\n  return sql`SELECT w.node_id AS source_id, w.node_kind AS source_kind${sourceColumns}, e.${sql.raw(targetField)} AS target_id, e.${sql.raw(targetKindField)} AS target_kind${weightColumn} FROM ${workingRelation} w JOIN ${operation.schema.edgesTable} e ON e.${sql.raw(joinField)} = w.node_id AND e.${sql.raw(joinKindField)} = w.node_kind AND e.graph_id = ${operation.ctx.graphId} WHERE ${sourceFilter} AND ${edgeKindFilter} AND ${operation.edgeTemporalFilter}`;\n}\n\nfunction chunkValues<T>(\n  values: readonly T[],\n  chunkSize: number,\n): readonly (readonly T[])[] {\n  const chunks: T[][] = [];\n  for (let offset = 0; offset < values.length; offset += chunkSize) {\n    chunks.push(values.slice(offset, offset + chunkSize));\n  }\n  return chunks;\n}\n\nfunction createOperation(\n  ctx: AlgorithmContext,\n  options: InternalTraversalOptions,\n  backend: QueryBackend | TransactionBackend,\n): IterativeGraphOperation {\n  const temporal = resolveTemporalOptions(ctx, options);\n  const currentTimestamp = currentReadInstant();\n  const nodeTemporalFilter = compileTemporalFilter({\n    mode: temporal.temporalMode,\n    ...(temporal.asOf === undefined ? {} : { asOf: temporal.asOf }),\n    ...(temporal.recordedAsOf === undefined ?\n      {}\n    : { recordedAsOf: temporal.recordedAsOf }),\n    tableAlias: \"n\",\n    currentTimestamp,\n  });\n  const edgeTemporalFilter = compileTemporalFilter({\n    mode: temporal.temporalMode,\n    ...(temporal.asOf === undefined ? {} : { asOf: temporal.asOf }),\n    ...(temporal.recordedAsOf === undefined ?\n      {}\n    : { recordedAsOf: temporal.recordedAsOf }),\n    tableAlias: \"e\",\n    currentTimestamp,\n  });\n  const weightExpression =\n    options.weightProperty === undefined ?\n      undefined\n    : compileWeightExpression(\n        ctx.dialect,\n        options.weightProperty,\n        options.defaultWeight,\n      );\n  const direction = options.direction ?? \"out\";\n  const branchCount = direction === \"both\" ? 2 : 1;\n  const parameterLimit =\n    backend.capabilities.maxBindParameters ?? DEFAULT_MAX_BIND_PARAMETERS;\n  const reservedPerBranch =\n    RESERVED_TEMPORAL_BIND_PARAMETERS_PER_BRANCH +\n    (weightExpression === undefined ? 0 : (\n      RESERVED_WEIGHT_BIND_PARAMETERS_PER_BRANCH\n    ));\n  const fixedParameters = branchCount * reservedPerBranch;\n  const sharedBudget = parameterLimit - fixedParameters;\n  const maxEdgeKindsPerQuery = Math.floor(sharedBudget / (branchCount + 2));\n  if (maxEdgeKindsPerQuery < 1) {\n    throw new ConfigurationError(\n      \"An iterative graph operation cannot fit its fixed filters within the backend bind-parameter limit.\",\n      { parameterLimit, direction },\n    );\n  }\n  const edgeKindChunks = chunkValues(\n    [...new Set(options.edges)].toSorted((left, right) =>\n      compareStrings(left, right),\n    ),\n    maxEdgeKindsPerQuery,\n  );\n  const largestEdgeKindChunk = Math.max(\n    ...edgeKindChunks.map((chunk) => chunk.length),\n  );\n  const maxWorkingSetSize = Math.floor(\n    (parameterLimit -\n      branchCount * (largestEdgeKindChunk + reservedPerBranch)) /\n      2,\n  );\n  if (maxWorkingSetSize < 1) {\n    throw new ConfigurationError(\n      \"An iterative graph operation cannot fit one working-set node within the backend bind-parameter limit.\",\n      { parameterLimit, direction },\n    );\n  }\n\n  return {\n    backend,\n    ctx,\n    edgeKindChunks,\n    direction,\n    maxWorkingSetSize,\n    nodeTemporalFilter,\n    edgeTemporalFilter,\n    schema: resolveReadSchema(ctx, options),\n    workingMemory: resolveWorkingMemory(options.workingMemory),\n    weightExpression,\n  };\n}\n\n/**\n * Compiles the per-edge weight expression over the expansion's edge alias\n * `e`. The extraction is cast to DOUBLE PRECISION — a spelling both engines\n * accept — so weight arithmetic is IEEE 754 double on both backends.\n * PostgreSQL's `::numeric` extraction would use exact decimal arithmetic and\n * could produce different accumulated distances (and therefore different\n * paths) than SQLite's binary doubles.\n *\n * The weight audit runs before any expansion, so by the time this expression\n * evaluates, every selected edge's property is a JSON number (never text the\n * cast could mangle or reject) or absent with a configured default.\n */\nfunction compileWeightExpression(\n  dialect: DialectAdapter,\n  weightProperty: string,\n  defaultWeight: number | undefined,\n): SqlFragment {\n  const extracted = dialect.jsonExtractDouble(\n    sql.raw(\"e.props\"),\n    jsonPointer([weightProperty]),\n  );\n  return defaultWeight === undefined ? extracted : (\n      sql`COALESCE(${extracted}, ${defaultWeight})`\n    );\n}\n\n/**\n * Whether the backend can host working-table rounds: a pinned transactional\n * connection, temporary-statement support, and `INSERT … RETURNING` for the\n * folded frontier bookkeeping. Callers without it take the inline\n * chunked-`VALUES` fallback.\n */\nexport function supportsTemporaryIteration(ctx: AlgorithmContext): boolean {\n  return (\n    ctx.backend.capabilities.transactions &&\n    ctx.backend.capabilities.graphAnalytics?.supported !== false &&\n    ctx.backend.capabilities.returning !== false &&\n    ctx.backend.executeTemporaryStatement !== undefined\n  );\n}\n\nfunction requireTemporaryStatements(\n  backend: TransactionBackend,\n): TemporaryStatementBackend {\n  if (backend.executeTemporaryStatement === undefined) {\n    throw new ConfigurationError(\n      \"Iterative graph operations require temporary-statement support on the transaction backend.\",\n      { dialect: backend.dialect },\n      {\n        suggestion:\n          \"Use a built-in SQLite/PostgreSQL backend or implement executeTemporaryStatement on the custom backend.\",\n      },\n    );\n  }\n  return backend as TemporaryStatementBackend;\n}\n","import type { GraphDef } from \"../../core/define-graph\";\nimport { GraphAlgorithmConvergenceError } from \"../../errors\";\nimport { sql, type SqlFragment } from \"../../query/sql-fragment\";\nimport { asCompiledRowsSql } from \"../../query/sql-intent\";\nimport {\n  type AlgorithmContext,\n  assertEdgeKinds,\n  assertGraphAnalyticsSupported,\n  compileNodeKindSeedFilter,\n  type InternalTraversalOptions,\n  normalizeNodeKinds,\n  pickTemporalOptions,\n  resolveMaxIterations,\n} from \"./context\";\nimport {\n  compileWorkingTableEdgeExpansion,\n  countWorkingTableRows,\n  frontierIndexIdentifier,\n  type IterativeGraphRunContext,\n  type NodeIdentityKey,\n  nodeIdentityKey,\n  runIterativeGraphOperation,\n} from \"./iterative-graph-operation\";\nimport type {\n  InternalLabelPropagationOptions,\n  LabelPropagationMembership,\n} from \"./types\";\n\ntype IterationState = Readonly<{\n  changedCount: number;\n  workingTableSize: number;\n  /** Fixed-round completion reached (`onMaxIterations: \"return\"` only). */\n  completed: boolean;\n  /** A detected oscillation needs one parity round before completing. */\n  finishNextRound: boolean;\n}>;\ntype ChangedRow = Readonly<{\n  node_id: string;\n  node_kind: string;\n  label_id: string;\n  label_kind: string;\n}>;\ntype MembershipRow = Readonly<{\n  node_id: string;\n  node_kind: string;\n  label_id: string;\n  label_kind: string;\n}>;\n\ntype CompletionMode = \"return\" | \"throw\";\n\ntype RoundPolicy = Readonly<{\n  detector: OscillationDetector;\n  maxIterations: number;\n  onMaxIterations: CompletionMode;\n}>;\n\ntype OscillationDetector = ReturnType<typeof createOscillationDetector>;\n\nconst DEFAULT_LABEL_PROPAGATION_MAX_ITERATIONS = 1000;\n\n/** Runs exact synchronous CDLP in the shared temporary-table loop. */\nexport async function executeLabelPropagation<G extends GraphDef>(\n  ctx: AlgorithmContext,\n  options: InternalLabelPropagationOptions<G>,\n): Promise<readonly LabelPropagationMembership[]> {\n  assertEdgeKinds(options.edges);\n  assertGraphAnalyticsSupported(ctx, \"labelPropagation\", {\n    requiresWindowFunctions: true,\n  });\n  const maxIterations = resolveMaxIterations(\n    options.maxIterations,\n    DEFAULT_LABEL_PROPAGATION_MAX_ITERATIONS,\n    \"labelPropagation\",\n  );\n  const nodeKinds = normalizeNodeKinds(options.nodeKinds);\n  const policy: RoundPolicy = {\n    detector: createOscillationDetector(),\n    maxIterations,\n    onMaxIterations: options.onMaxIterations ?? \"throw\",\n  };\n  const traversalOptions: InternalTraversalOptions = {\n    edges: options.edges,\n    direction: \"both\",\n    ...pickTemporalOptions(options),\n    ...(options.workingMemory === undefined ?\n      {}\n    : { workingMemory: options.workingMemory }),\n  };\n\n  return runIterativeGraphOperation(ctx, traversalOptions, {\n    algorithm: \"labelPropagation\",\n    maxIterations,\n    createWorkingTable,\n    initialize: (context) => initializeWorkingTables(context, nodeKinds),\n    runRound: (context, state, iteration) =>\n      runLabelPropagationRound(context, state, iteration, policy),\n    hasConverged(state) {\n      return state.changedCount === 0 || state.completed;\n    },\n    extractResult: extractMemberships,\n    cleanup: dropNeighborTable,\n  });\n}\n\n/**\n * Detects period-two oscillation from the per-round change feed. The round\n * map is a delta over a lazily built shadow labeling (every node starts as\n * its own label, and `applyNextLabels` reports every change), so a round\n * whose changes exactly invert the previous round's proves the labeling two\n * rounds back has recurred — and a deterministic synchronous rule then\n * alternates between the two labelings forever. Longer cycles are not\n * detected here and fall through to the `maxIterations` budget. Memory grows\n * with the number of distinct nodes that ever changed label.\n */\nfunction createOscillationDetector() {\n  const shadowLabels = new Map<NodeIdentityKey, NodeIdentityKey>();\n  let previousRound:\n    | ReadonlyMap<NodeIdentityKey, Readonly<{ before: NodeIdentityKey }>>\n    | undefined;\n  return {\n    /** Records one applied round; true when the round inverts the previous. */\n    observeRound(changedRows: readonly ChangedRow[]): boolean {\n      const round = new Map<\n        NodeIdentityKey,\n        Readonly<{ before: NodeIdentityKey; after: NodeIdentityKey }>\n      >();\n      for (const row of changedRows) {\n        const node = nodeIdentityKey({ id: row.node_id, kind: row.node_kind });\n        const after = nodeIdentityKey({\n          id: row.label_id,\n          kind: row.label_kind,\n        });\n        const before = shadowLabels.get(node) ?? node;\n        round.set(node, { before, after });\n        shadowLabels.set(node, after);\n      }\n      const priorRound = previousRound;\n      previousRound = round;\n      if (priorRound?.size !== round.size) return false;\n      if (round.size === 0) return false;\n      for (const [node, change] of round) {\n        if (priorRound.get(node)?.before !== change.after) return false;\n      }\n      return true;\n    },\n  };\n}\n\nfunction createWorkingTable(context: IterativeGraphRunContext): SqlFragment {\n  return sql`\n    CREATE TEMP TABLE ${context.workingTable} (\n      graph_id TEXT NOT NULL,\n      run_id TEXT NOT NULL,\n      node_id TEXT NOT NULL,\n      node_kind TEXT NOT NULL,\n      label_id TEXT NOT NULL,\n      label_kind TEXT NOT NULL,\n      next_label_id TEXT NOT NULL,\n      next_label_kind TEXT NOT NULL,\n      changed_round INTEGER NOT NULL,\n      active_round INTEGER NOT NULL,\n      PRIMARY KEY (graph_id, run_id, node_kind, node_id)\n    )\n  `;\n}\n\n// Single-letter discriminators before the run id keep the auxiliary relation\n// names aligned and clearly grouped per run; every name stays well inside\n// PostgreSQL's 63-byte identifier cap.\nfunction neighborTableIdentifier(context: IterativeGraphRunContext) {\n  return sql.identifier(\n    `typegraph_iterative_n_${context.runId.replaceAll(\"-\", \"_\")}`,\n  );\n}\n\nfunction activeIndexIdentifier(context: IterativeGraphRunContext) {\n  return sql.identifier(\n    `typegraph_iterative_a_${context.runId.replaceAll(\"-\", \"_\")}`,\n  );\n}\n\nasync function initializeWorkingTables(\n  context: IterativeGraphRunContext,\n  nodeKinds: readonly string[] | undefined,\n): Promise<IterationState> {\n  const { operation, workingTable, graphId, runId } = context;\n  const nodeKindFilter = compileNodeKindSeedFilter(nodeKinds);\n  await context.executeTemporary(sql`\n    INSERT INTO ${workingTable}\n      (graph_id, run_id, node_id, node_kind, label_id, label_kind,\n       next_label_id, next_label_kind, changed_round, active_round)\n    SELECT\n      ${graphId}, ${runId}, n.id, n.kind, n.id, n.kind, n.id, n.kind, 0, 1\n    FROM ${operation.schema.nodesTable} n\n    WHERE n.graph_id = ${graphId}\n      AND ${nodeKindFilter}\n      AND ${operation.nodeTemporalFilter}\n  `);\n  await context.executeTemporary(sql`\n    CREATE INDEX ${frontierIndexIdentifier(context)}\n    ON ${workingTable} (graph_id, run_id, changed_round)\n  `);\n  await context.executeTemporary(sql`\n    CREATE INDEX ${activeIndexIdentifier(context)}\n    ON ${workingTable} (graph_id, run_id, active_round)\n  `);\n  const neighborTable = neighborTableIdentifier(context);\n  await context.executeTemporary(sql`\n    CREATE TEMP TABLE ${neighborTable} (\n      target_id TEXT NOT NULL,\n      target_kind TEXT NOT NULL,\n      neighbor_id TEXT NOT NULL,\n      neighbor_kind TEXT NOT NULL,\n      PRIMARY KEY (target_kind, target_id, neighbor_kind, neighbor_id)\n    )\n  `);\n  for (const edgeKinds of operation.edgeKindChunks) {\n    await materializeChunkNeighbors(context, edgeKinds);\n  }\n  const analyzeNeighbors =\n    operation.ctx.dialect.analyzeTemporaryTable(neighborTable);\n  if (analyzeNeighbors !== undefined) {\n    await context.executeTemporary(analyzeNeighbors);\n  }\n\n  const workingTableSize = await countWorkingTableRows(context);\n  return {\n    changedCount: workingTableSize,\n    workingTableSize,\n    completed: false,\n    finishNextRound: false,\n  };\n}\n\nasync function runLabelPropagationRound(\n  context: IterativeGraphRunContext,\n  state: IterationState,\n  iteration: number,\n  policy: RoundPolicy,\n): Promise<IterationState> {\n  // Every node owns a distinct initial label, so every non-isolated node votes\n  // in round one. Later rounds activate only neighbors of the changed frontier.\n  if (iteration > 1) {\n    await markActiveNeighbors(context, iteration);\n  }\n  await selectWinningLabels(context, iteration);\n  const changedRows = await applyNextLabels(context, iteration);\n  const next: IterationState = {\n    changedCount: changedRows.length,\n    workingTableSize: state.workingTableSize,\n    completed: false,\n    finishNextRound: false,\n  };\n  if (next.changedCount === 0) return next;\n  if (state.finishNextRound) return { ...next, completed: true };\n  if (policy.detector.observeRound(changedRows)) {\n    return resolveOscillation(next, iteration, policy);\n  }\n  if (\n    policy.onMaxIterations === \"return\" &&\n    iteration === policy.maxIterations\n  ) {\n    return { ...next, completed: true };\n  }\n  return next;\n}\n\n/**\n * The labeling two rounds back has recurred, so the synchronous rule now\n * alternates between two labelings forever. The fixed-round result is fully\n * determined by parity: an even remainder is this round's labeling, an odd\n * remainder is the next round's.\n */\nfunction resolveOscillation(\n  state: IterationState,\n  iteration: number,\n  policy: RoundPolicy,\n): IterationState {\n  if (policy.onMaxIterations === \"throw\") {\n    throw new GraphAlgorithmConvergenceError(\n      \"labelPropagation\",\n      policy.maxIterations,\n      { oscillating: true },\n    );\n  }\n  const remaining = policy.maxIterations - iteration;\n  if (remaining % 2 === 0) return { ...state, completed: true };\n  return { ...state, finishNextRound: true };\n}\n\n/** Marks exactly the nodes whose vote multiset may have changed this round. */\nasync function markActiveNeighbors(\n  context: IterativeGraphRunContext,\n  iteration: number,\n): Promise<void> {\n  const { workingTable, graphId, runId } = context;\n  const neighborTable = neighborTableIdentifier(context);\n  // The neighbor relation is symmetric — materialization inserts both\n  // orientations of every visible edge — so probing the primary-key prefix by\n  // target and reading the neighbor columns enumerates the same adjacency as\n  // a dedicated reverse index would, without paying for one.\n  await context.executeTemporary(sql`\n    WITH candidates AS (\n      SELECT DISTINCT neighbors.neighbor_id, neighbors.neighbor_kind\n      FROM ${workingTable} changed\n      JOIN ${neighborTable} neighbors\n        ON neighbors.target_id = changed.node_id\n        AND neighbors.target_kind = changed.node_kind\n      WHERE changed.graph_id = ${graphId}\n        AND changed.run_id = ${runId}\n        AND changed.changed_round = ${iteration - 1}\n    )\n    UPDATE ${workingTable} AS target\n    SET active_round = ${iteration}\n    FROM candidates\n    WHERE target.graph_id = ${graphId}\n      AND target.run_id = ${runId}\n      AND target.node_id = candidates.neighbor_id\n      AND target.node_kind = candidates.neighbor_kind\n  `);\n}\n\n/**\n * Materializes one bind-budget edge-kind chunk into the immutable neighbor\n * relation. The primary key collapses parallel edges and duplicate neighbors\n * across chunks; self-loops are excluded because a node is not its own\n * neighbor for CDLP.\n */\nasync function materializeChunkNeighbors(\n  context: IterativeGraphRunContext,\n  edgeKinds: readonly string[],\n): Promise<void> {\n  const { operation, workingTable, graphId, runId } = context;\n  const expansion = compileWorkingTableEdgeExpansion(\n    operation,\n    workingTable,\n    sql`\n      w.graph_id = ${graphId}\n      AND w.run_id = ${runId}\n    `,\n    \"both\",\n    edgeKinds,\n  );\n  const neighborTable = neighborTableIdentifier(context);\n  await context.executeTemporary(sql`\n    INSERT INTO ${neighborTable}\n      (target_id, target_kind, neighbor_id, neighbor_kind)\n    SELECT DISTINCT\n      expanded.source_id,\n      expanded.source_kind,\n      expanded.target_id,\n      expanded.target_kind\n    FROM (${expansion}) expanded\n    JOIN ${workingTable} scoped_neighbor\n      ON scoped_neighbor.graph_id = ${graphId}\n      AND scoped_neighbor.run_id = ${runId}\n      AND scoped_neighbor.node_id = expanded.target_id\n      AND scoped_neighbor.node_kind = expanded.target_kind\n    WHERE expanded.source_id <> expanded.target_id\n      OR expanded.source_kind <> expanded.target_kind\n    ON CONFLICT (target_kind, target_id, neighbor_kind, neighbor_id)\n    DO NOTHING\n  `);\n}\n\nasync function selectWinningLabels(\n  context: IterativeGraphRunContext,\n  iteration: number,\n): Promise<void> {\n  const { operation, workingTable, graphId, runId } = context;\n  const neighborTable = neighborTableIdentifier(context);\n  const targetId = operation.ctx.dialect.binaryText(sql`totals.target_id`);\n  const targetKind = operation.ctx.dialect.binaryText(sql`totals.target_kind`);\n  const labelId = operation.ctx.dialect.binaryText(sql`totals.label_id`);\n  const labelKind = operation.ctx.dialect.binaryText(sql`totals.label_kind`);\n  await context.executeTemporary(sql`\n    WITH totals AS (\n      SELECT\n        neighbors.target_id,\n        neighbors.target_kind,\n        neighbor.label_id,\n        neighbor.label_kind,\n        COUNT(*) AS total_votes\n      FROM ${neighborTable} neighbors\n      JOIN ${workingTable} active\n        ON active.graph_id = ${graphId}\n        AND active.run_id = ${runId}\n        AND active.active_round = ${iteration}\n        AND active.node_id = neighbors.target_id\n        AND active.node_kind = neighbors.target_kind\n      JOIN ${workingTable} neighbor\n        ON neighbor.graph_id = ${graphId}\n        AND neighbor.run_id = ${runId}\n        AND neighbor.node_id = neighbors.neighbor_id\n        AND neighbor.node_kind = neighbors.neighbor_kind\n      GROUP BY\n        target_id,\n        target_kind,\n        neighbor.label_id,\n        neighbor.label_kind\n    ), ranked AS (\n      SELECT\n        target_id,\n        target_kind,\n        label_id,\n        label_kind,\n        ROW_NUMBER() OVER (\n          PARTITION BY ${targetKind}, ${targetId}\n          ORDER BY total_votes DESC, ${labelId}, ${labelKind}\n        ) AS label_rank\n      FROM totals\n    )\n    UPDATE ${workingTable} AS target\n    SET next_label_id = ranked.label_id,\n        next_label_kind = ranked.label_kind\n    FROM ranked\n    WHERE target.graph_id = ${graphId}\n      AND target.run_id = ${runId}\n      AND target.active_round = ${iteration}\n      AND target.node_id = ranked.target_id\n      AND target.node_kind = ranked.target_kind\n      AND ranked.label_rank = 1\n      AND (\n        target.next_label_id <> ranked.label_id\n        OR target.next_label_kind <> ranked.label_kind\n      )\n  `);\n}\n\nfunction applyNextLabels(\n  context: IterativeGraphRunContext,\n  iteration: number,\n): Promise<readonly ChangedRow[]> {\n  // Only rows selectWinningLabels staged this round can diverge, and it stages\n  // active rows exclusively, so the active index bounds this scan by the\n  // frontier instead of the whole working table.\n  return context.backend.execute<ChangedRow>(\n    asCompiledRowsSql(sql`\n      UPDATE ${context.workingTable}\n      SET label_id = next_label_id,\n          label_kind = next_label_kind,\n          changed_round = ${iteration}\n      WHERE graph_id = ${context.graphId}\n        AND run_id = ${context.runId}\n        AND active_round = ${iteration}\n        AND (\n          label_id <> next_label_id OR label_kind <> next_label_kind\n        )\n      RETURNING node_id, node_kind, label_id, label_kind\n    `),\n  );\n}\n\nasync function extractMemberships(\n  context: IterativeGraphRunContext,\n): Promise<readonly LabelPropagationMembership[]> {\n  const { operation } = context;\n  const labelId = operation.ctx.dialect.binaryText(sql`label_id`);\n  const labelKind = operation.ctx.dialect.binaryText(sql`label_kind`);\n  const nodeId = operation.ctx.dialect.binaryText(sql`node_id`);\n  const nodeKind = operation.ctx.dialect.binaryText(sql`node_kind`);\n  const rows = await context.backend.execute<MembershipRow>(\n    asCompiledRowsSql(sql`\n      SELECT\n        node_id,\n        node_kind,\n        label_id,\n        label_kind\n      FROM ${context.workingTable}\n      WHERE graph_id = ${context.graphId} AND run_id = ${context.runId}\n      ORDER BY ${labelId}, ${labelKind}, ${nodeId}, ${nodeKind}\n    `),\n  );\n\n  return rows.map((row) => ({\n    id: row.node_id,\n    kind: row.node_kind,\n    labelId: row.label_id,\n    labelKind: row.label_kind,\n  }));\n}\n\nasync function dropNeighborTable(\n  context: IterativeGraphRunContext,\n): Promise<void> {\n  await context.executeTemporary(\n    sql`DROP TABLE IF EXISTS ${neighborTableIdentifier(context)}`,\n  );\n}\n","import type { GraphDef } from \"../../core/define-graph\";\nimport { ConfigurationError } from \"../../errors\";\nimport { sql, type SqlFragment } from \"../../query/sql-fragment\";\nimport { asCompiledRowsSql } from \"../../query/sql-intent\";\nimport {\n  type AlgorithmContext,\n  assertEdgeKinds,\n  assertGraphAnalyticsSupported,\n  compileNodeKindSeedFilter,\n  type InternalTraversalOptions,\n  normalizeNodeKinds,\n  pickTemporalOptions,\n  resolveMaxIterations,\n} from \"./context\";\nimport {\n  compareNodeIdentity,\n  compileWorkingTableEdgeExpansion,\n  countWorkingTableRows,\n  DEFAULT_MAX_BIND_PARAMETERS,\n  type IterativeGraphRunContext,\n  type NodeIdentityKey,\n  nodeIdentityKey,\n  runIterativeGraphOperation,\n} from \"./iterative-graph-operation\";\nimport type {\n  InternalPageRankOptions,\n  InternalPersonalizedPageRankOptions,\n  PageRankScore,\n  PersonalizedPageRankSeed,\n  TraversalDirection,\n} from \"./types\";\n\ntype IterationState = Readonly<{\n  activeScoreColumn: ScoreColumn;\n  maximumChange: number;\n  workingTableSize: number;\n}>;\n\ntype ScoreColumn = \"next_score\" | \"score\";\n\ntype ResolvedPageRankOptions = Readonly<{\n  dampingFactor: number;\n  tolerance: number;\n  maxIterations: number;\n  nodeKinds: readonly string[] | undefined;\n}>;\n\ntype PageRankAlgorithm = \"pageRank\" | \"personalizedPageRank\";\n\ntype NormalizedSeed = Readonly<{\n  id: string;\n  kind: string;\n  weight: number;\n}>;\n\ntype MetricRow = Readonly<{ value: number | string | null }>;\ntype IdentityRow = Readonly<{ node_id: string; node_kind: string }>;\ntype ScoreRow = Readonly<{\n  node_id: string;\n  node_kind: string;\n  score: number | string;\n}>;\n\nconst DEFAULT_DAMPING_FACTOR = 0.85;\nconst DEFAULT_TOLERANCE = 1e-8;\nconst DEFAULT_MAX_ITERATIONS = 1000;\n/** Each seed VALUES row binds its id, kind, and weight. */\nconst BIND_PARAMETERS_PER_SEED = 3;\n/** The seed UPDATE statement also binds the graph and run identifiers. */\nconst RESERVED_SEED_STATEMENT_BIND_PARAMETERS = 2;\n\n/** Computes global PageRank with a uniform teleport distribution. */\nexport async function executePageRank<G extends GraphDef>(\n  ctx: AlgorithmContext,\n  options: InternalPageRankOptions<G>,\n): Promise<readonly PageRankScore[]> {\n  return executePageRankOperation(ctx, options, undefined);\n}\n\n/** Computes personalized PageRank with a weighted multi-seed teleport vector. */\nexport async function executePersonalizedPageRank<G extends GraphDef>(\n  ctx: AlgorithmContext,\n  options: InternalPersonalizedPageRankOptions<G>,\n): Promise<readonly PageRankScore[]> {\n  return executePageRankOperation(ctx, options, normalizeSeeds(options.seeds));\n}\n\nfunction executePageRankOperation<G extends GraphDef>(\n  ctx: AlgorithmContext,\n  options: InternalPageRankOptions<G>,\n  seeds: readonly NormalizedSeed[] | undefined,\n): Promise<readonly PageRankScore[]> {\n  const algorithm: PageRankAlgorithm =\n    seeds === undefined ? \"pageRank\" : \"personalizedPageRank\";\n  assertEdgeKinds(options.edges);\n  assertGraphAnalyticsSupported(ctx, algorithm);\n  const resolved = resolvePageRankOptions(options, algorithm);\n  const traversalOptions: InternalTraversalOptions = {\n    edges: options.edges,\n    direction: options.direction ?? \"out\",\n    ...pickTemporalOptions(options),\n    ...(options.workingMemory === undefined ?\n      {}\n    : { workingMemory: options.workingMemory }),\n  };\n\n  return runIterativeGraphOperation(ctx, traversalOptions, {\n    algorithm,\n    maxIterations: resolved.maxIterations,\n    createWorkingTable,\n    initialize: (context) =>\n      initializeWorkingTable(context, resolved.nodeKinds, seeds),\n    runRound: (context, state) =>\n      runPowerIterationRound(context, state, resolved.dampingFactor),\n    hasConverged(state) {\n      return state.maximumChange <= resolved.tolerance;\n    },\n    extractResult: extractScores,\n  });\n}\n\nfunction resolvePageRankOptions<G extends GraphDef>(\n  options: InternalPageRankOptions<G>,\n  algorithm: PageRankAlgorithm,\n): ResolvedPageRankOptions {\n  const dampingFactor = options.dampingFactor ?? DEFAULT_DAMPING_FACTOR;\n  if (\n    !Number.isFinite(dampingFactor) ||\n    dampingFactor < 0 ||\n    dampingFactor >= 1\n  ) {\n    throw new ConfigurationError(\n      `PageRank dampingFactor must be finite and in [0, 1), got ${String(dampingFactor)}.`,\n      { dampingFactor },\n    );\n  }\n\n  const tolerance = options.tolerance ?? DEFAULT_TOLERANCE;\n  if (!Number.isFinite(tolerance) || tolerance <= 0) {\n    throw new ConfigurationError(\n      `PageRank tolerance must be finite and greater than 0, got ${String(tolerance)}.`,\n      { tolerance },\n    );\n  }\n\n  return {\n    dampingFactor,\n    tolerance,\n    maxIterations: resolveMaxIterations(\n      options.maxIterations,\n      DEFAULT_MAX_ITERATIONS,\n      algorithm,\n    ),\n    nodeKinds: normalizeNodeKinds(options.nodeKinds),\n  };\n}\n\nfunction normalizeSeeds<G extends GraphDef>(\n  seeds: readonly PersonalizedPageRankSeed<G>[],\n): readonly NormalizedSeed[] {\n  if (seeds.length === 0) {\n    throw new ConfigurationError(\n      \"Personalized PageRank requires at least one seed.\",\n      { seeds },\n    );\n  }\n\n  const combined = new Map<NodeIdentityKey, NormalizedSeed>();\n  for (const seed of seeds) {\n    // Node-identity keys join kind and id with a NUL separator, so an\n    // embedded NUL could alias two distinct seeds onto one key.\n    if (\n      typeof seed.id !== \"string\" ||\n      seed.id.length === 0 ||\n      seed.id.includes(\"\\u0000\") ||\n      typeof seed.kind !== \"string\" ||\n      seed.kind.length === 0 ||\n      seed.kind.includes(\"\\u0000\")\n    ) {\n      throw new ConfigurationError(\n        \"Personalized PageRank seed id and kind must be non-empty strings without NUL characters.\",\n        { seed },\n      );\n    }\n    const weight = seed.weight ?? 1;\n    if (!Number.isFinite(weight) || weight <= 0) {\n      throw new ConfigurationError(\n        `Personalized PageRank seed weight must be finite and greater than 0, got ${String(weight)}.`,\n        { seed },\n      );\n    }\n    const key = nodeIdentityKey(seed);\n    const previous = combined.get(key);\n    const combinedWeight = (previous?.weight ?? 0) + weight;\n    if (!Number.isFinite(combinedWeight)) {\n      throw new ConfigurationError(\n        \"Personalized PageRank seed weights overflowed while combining duplicate seeds.\",\n        { seed },\n      );\n    }\n    combined.set(key, { id: seed.id, kind: seed.kind, weight: combinedWeight });\n  }\n\n  const combinedSeeds = [...combined.values()];\n  let maximumWeight = 0;\n  for (const seed of combinedSeeds) {\n    maximumWeight = Math.max(maximumWeight, seed.weight);\n  }\n  const scaledTotal = combinedSeeds.reduce(\n    (total, seed) => total + seed.weight / maximumWeight,\n    0,\n  );\n  return combinedSeeds\n    .map((seed) => {\n      const weight = seed.weight / maximumWeight / scaledTotal;\n      if (weight === 0) {\n        throw new ConfigurationError(\n          \"Personalized PageRank seed weights differ too much to normalize without underflow.\",\n          { seed },\n        );\n      }\n      return { id: seed.id, kind: seed.kind, weight };\n    })\n    .toSorted((left, right) => compareNodeIdentity(left, right));\n}\n\nfunction createWorkingTable(context: IterativeGraphRunContext): SqlFragment {\n  return sql`\n    CREATE TEMP TABLE ${context.workingTable} (\n      graph_id TEXT NOT NULL,\n      run_id TEXT NOT NULL,\n      node_id TEXT NOT NULL,\n      node_kind TEXT NOT NULL,\n      score DOUBLE PRECISION NOT NULL,\n      next_score DOUBLE PRECISION NOT NULL,\n      personalization DOUBLE PRECISION NOT NULL,\n      out_weight DOUBLE PRECISION NOT NULL,\n      PRIMARY KEY (graph_id, run_id, node_kind, node_id)\n    )\n  `;\n}\n\nasync function initializeWorkingTable(\n  context: IterativeGraphRunContext,\n  nodeKinds: readonly string[] | undefined,\n  seeds: readonly NormalizedSeed[] | undefined,\n): Promise<IterationState> {\n  const { operation, workingTable, graphId, runId } = context;\n  const nodeKindFilter = compileNodeKindSeedFilter(nodeKinds);\n  await context.executeTemporary(sql`\n    INSERT INTO ${workingTable}\n      (graph_id, run_id, node_id, node_kind, score, next_score,\n       personalization, out_weight)\n    SELECT ${graphId}, ${runId}, n.id, n.kind, 0.0, 0.0, 0.0, 0.0\n    FROM ${operation.schema.nodesTable} n\n    WHERE n.graph_id = ${graphId}\n      AND ${nodeKindFilter}\n      AND ${operation.nodeTemporalFilter}\n  `);\n\n  const workingTableSize = await countWorkingTableRows(context);\n  if (workingTableSize === 0) {\n    if (seeds !== undefined) {\n      throw missingSeedError(seeds);\n    }\n    return {\n      activeScoreColumn: \"score\",\n      maximumChange: 0,\n      workingTableSize,\n    };\n  }\n\n  if (seeds === undefined) {\n    const uniformWeight = 1 / workingTableSize;\n    await context.executeTemporary(sql`\n      UPDATE ${workingTable}\n      SET score = ${uniformWeight},\n          personalization = ${uniformWeight}\n      WHERE graph_id = ${graphId} AND run_id = ${runId}\n    `);\n  } else {\n    await initializePersonalization(context, seeds);\n  }\n\n  for (const edgeKinds of operation.edgeKindChunks) {\n    await accumulateOutWeights(context, edgeKinds);\n  }\n  return {\n    activeScoreColumn: \"score\",\n    maximumChange: Number.POSITIVE_INFINITY,\n    workingTableSize,\n  };\n}\n\nasync function initializePersonalization(\n  context: IterativeGraphRunContext,\n  seeds: readonly NormalizedSeed[],\n): Promise<void> {\n  const parameterLimit =\n    context.operation.backend.capabilities.maxBindParameters ??\n    DEFAULT_MAX_BIND_PARAMETERS;\n  const seedChunkSize = Math.floor(\n    (parameterLimit - RESERVED_SEED_STATEMENT_BIND_PARAMETERS) /\n      BIND_PARAMETERS_PER_SEED,\n  );\n  if (seedChunkSize < 1) {\n    throw new ConfigurationError(\n      \"Personalized PageRank cannot fit one seed within the backend bind-parameter limit.\",\n      { parameterLimit },\n    );\n  }\n\n  for (let offset = 0; offset < seeds.length; offset += seedChunkSize) {\n    const chunk = seeds.slice(offset, offset + seedChunkSize);\n    const values = sql.join(\n      chunk.map(\n        (seed) =>\n          sql`(${seed.id}, ${seed.kind}, CAST(${seed.weight} AS DOUBLE PRECISION))`,\n      ),\n      sql`, `,\n    );\n    await context.executeTemporary(sql`\n      WITH seed_values(node_id, node_kind, weight) AS (VALUES ${values})\n      UPDATE ${context.workingTable} AS target\n      SET score = seed_values.weight,\n          personalization = seed_values.weight\n      FROM seed_values\n      WHERE target.graph_id = ${context.graphId}\n        AND target.run_id = ${context.runId}\n        AND target.node_id = seed_values.node_id\n        AND target.node_kind = seed_values.node_kind\n    `);\n  }\n\n  const matchedRows = await context.backend.execute<IdentityRow>(\n    asCompiledRowsSql(sql`\n      SELECT node_id, node_kind\n      FROM ${context.workingTable}\n      WHERE graph_id = ${context.graphId}\n        AND run_id = ${context.runId}\n        AND personalization > 0\n    `),\n  );\n  const matched = new Set(\n    matchedRows.map((row) =>\n      nodeIdentityKey({ id: row.node_id, kind: row.node_kind }),\n    ),\n  );\n  const missing = seeds.filter((seed) => !matched.has(nodeIdentityKey(seed)));\n  if (missing.length > 0) throw missingSeedError(missing);\n}\n\nfunction missingSeedError(\n  seeds: readonly NormalizedSeed[],\n): ConfigurationError {\n  return new ConfigurationError(\n    \"Personalized PageRank seeds must identify visible nodes inside the selected induced subgraph.\",\n    { missingSeeds: seeds.map((seed) => ({ id: seed.id, kind: seed.kind })) },\n  );\n}\n\nasync function accumulateOutWeights(\n  context: IterativeGraphRunContext,\n  edgeKinds: readonly string[],\n): Promise<void> {\n  const { operation, workingTable, graphId, runId } = context;\n  const expansion = compileWorkingTableEdgeExpansion(\n    operation,\n    workingTable,\n    sql`w.graph_id = ${graphId} AND w.run_id = ${runId}`,\n    operation.direction,\n    edgeKinds,\n  );\n  const transitionWeight = compileTransitionWeight(operation.direction);\n\n  await context.executeTemporary(sql`\n    WITH scoped_edges AS (\n      SELECT\n        expanded.source_id,\n        expanded.source_kind,\n        ${transitionWeight} AS transition_weight\n      FROM (${expansion}) expanded\n      JOIN ${workingTable} scoped_target\n        ON scoped_target.graph_id = ${graphId}\n        AND scoped_target.run_id = ${runId}\n        AND scoped_target.node_id = expanded.target_id\n        AND scoped_target.node_kind = expanded.target_kind\n    ), degrees AS (\n      SELECT source_id, source_kind, SUM(transition_weight) AS out_weight\n      FROM scoped_edges\n      GROUP BY source_id, source_kind\n    )\n    UPDATE ${workingTable} AS target\n    SET out_weight = target.out_weight + degrees.out_weight\n    FROM degrees\n    WHERE target.graph_id = ${graphId}\n      AND target.run_id = ${runId}\n      AND target.node_id = degrees.source_id\n      AND target.node_kind = degrees.source_kind\n  `);\n}\n\nfunction compileTransitionWeight(direction: TraversalDirection): SqlFragment {\n  if (direction !== \"both\") return sql`1.0`;\n  // `both` emits one row per edge endpoint. A self-loop appears in both\n  // branches, so each incidence contributes one half and the physical edge\n  // retains total transition weight one. Parallel self-loops remain distinct.\n  return sql`\n    CASE\n      WHEN expanded.source_id = expanded.target_id\n       AND expanded.source_kind = expanded.target_kind\n      THEN 0.5\n      ELSE 1.0\n    END\n  `;\n}\n\nasync function runPowerIterationRound(\n  context: IterativeGraphRunContext,\n  state: IterationState,\n  dampingFactor: number,\n): Promise<IterationState> {\n  const sourceScoreColumn = state.activeScoreColumn;\n  const targetScoreColumn: ScoreColumn =\n    sourceScoreColumn === \"score\" ? \"next_score\" : \"score\";\n  await resetTargetScores(\n    context,\n    sourceScoreColumn,\n    targetScoreColumn,\n    dampingFactor,\n  );\n\n  for (const edgeKinds of context.operation.edgeKindChunks) {\n    await accumulateContributions(\n      context,\n      edgeKinds,\n      dampingFactor,\n      sourceScoreColumn,\n      targetScoreColumn,\n    );\n  }\n\n  const maximumChange = await readMaximumChange(\n    context,\n    sourceScoreColumn,\n    targetScoreColumn,\n  );\n  return {\n    activeScoreColumn: targetScoreColumn,\n    maximumChange,\n    workingTableSize: state.workingTableSize,\n  };\n}\n\nasync function resetTargetScores(\n  context: IterativeGraphRunContext,\n  sourceScoreColumn: ScoreColumn,\n  targetScoreColumn: ScoreColumn,\n  dampingFactor: number,\n): Promise<void> {\n  const sourceScore = sql.identifier(sourceScoreColumn);\n  const targetScore = sql.identifier(targetScoreColumn);\n  await context.executeTemporary(sql`\n    UPDATE ${context.workingTable}\n    SET ${targetScore} = personalization * (\n      ${1 - dampingFactor} + ${dampingFactor} * (\n        SELECT COALESCE(SUM(dangling.${sourceScore}), 0.0)\n        FROM ${context.workingTable} dangling\n        WHERE dangling.graph_id = ${context.graphId}\n          AND dangling.run_id = ${context.runId}\n          AND dangling.out_weight = 0.0\n      )\n    )\n    WHERE graph_id = ${context.graphId} AND run_id = ${context.runId}\n  `);\n}\n\nasync function accumulateContributions(\n  context: IterativeGraphRunContext,\n  edgeKinds: readonly string[],\n  dampingFactor: number,\n  sourceScoreColumn: ScoreColumn,\n  targetScoreColumn: ScoreColumn,\n): Promise<void> {\n  const { operation, workingTable, graphId, runId } = context;\n  const sourceScore = sql.identifier(sourceScoreColumn);\n  const targetScore = sql.identifier(targetScoreColumn);\n  const expansion = compileWorkingTableEdgeExpansion(\n    operation,\n    workingTable,\n    sql`w.graph_id = ${graphId} AND w.run_id = ${runId}`,\n    operation.direction,\n    edgeKinds,\n    sql`w.${sourceScore} AS source_score, w.out_weight AS source_out_weight`,\n  );\n  const transitionWeight = compileTransitionWeight(operation.direction);\n\n  await context.executeTemporary(sql`\n    WITH scoped_edges AS (\n      SELECT\n        expanded.target_id,\n        expanded.target_kind,\n        expanded.source_score,\n        expanded.source_out_weight,\n        ${transitionWeight} AS transition_weight\n      FROM (${expansion}) expanded\n      JOIN ${workingTable} scoped_target\n        ON scoped_target.graph_id = ${graphId}\n        AND scoped_target.run_id = ${runId}\n        AND scoped_target.node_id = expanded.target_id\n        AND scoped_target.node_kind = expanded.target_kind\n      WHERE expanded.source_out_weight > 0.0\n    ), contributions AS (\n      SELECT\n        target_id,\n        target_kind,\n        SUM(source_score * transition_weight / source_out_weight) AS score\n      FROM scoped_edges\n      GROUP BY target_id, target_kind\n    )\n    UPDATE ${workingTable} AS target\n    SET ${targetScore} = target.${targetScore} + ${dampingFactor} * contributions.score\n    FROM contributions\n    WHERE target.graph_id = ${graphId}\n      AND target.run_id = ${runId}\n      AND target.node_id = contributions.target_id\n      AND target.node_kind = contributions.target_kind\n  `);\n}\n\nasync function readMaximumChange(\n  context: IterativeGraphRunContext,\n  sourceScoreColumn: ScoreColumn,\n  targetScoreColumn: ScoreColumn,\n): Promise<number> {\n  const sourceScore = sql.identifier(sourceScoreColumn);\n  const targetScore = sql.identifier(targetScoreColumn);\n  const rows = await context.backend.execute<MetricRow>(\n    asCompiledRowsSql(sql`\n      SELECT COALESCE(MAX(ABS(${targetScore} - ${sourceScore})), 0.0) AS value\n      FROM ${context.workingTable}\n      WHERE graph_id = ${context.graphId} AND run_id = ${context.runId}\n    `),\n  );\n  return Number(rows[0]?.value ?? 0);\n}\n\nasync function extractScores(\n  context: IterativeGraphRunContext,\n  state: IterationState,\n): Promise<readonly PageRankScore[]> {\n  const score = sql.identifier(state.activeScoreColumn);\n  const nodeId = context.operation.ctx.dialect.binaryText(sql`node_id`);\n  const nodeKind = context.operation.ctx.dialect.binaryText(sql`node_kind`);\n  const rows = await context.backend.execute<ScoreRow>(\n    asCompiledRowsSql(sql`\n      SELECT node_id, node_kind, ${score} AS score\n      FROM ${context.workingTable}\n      WHERE graph_id = ${context.graphId} AND run_id = ${context.runId}\n      ORDER BY ${score} DESC, ${nodeId}, ${nodeKind}\n    `),\n  );\n  return rows.map((row) => ({\n    id: row.node_id,\n    kind: row.node_kind,\n    score: Number(row.score),\n  }));\n}\n","import { sql } from \"../../query/sql-fragment\";\nimport { asCompiledRowsSql } from \"../../query/sql-intent\";\nimport { requireDefined } from \"../../utils/presence\";\nimport type { AlgorithmContext, InternalTraversalOptions } from \"./context\";\nimport {\n  compareNodeIdentity,\n  compileWorkingTableEdgeExpansion,\n  compileWorkingTableExpansion,\n  fetchVisibleWorkingNodes,\n  type IterativeGraphOperation,\n  type IterativeGraphRunContext,\n  type NodeExpansion,\n  type NodeIdentityKey,\n  nodeIdentityKey,\n  nodeIdentityKeyFromRow,\n  reduceExpandedWorkingSet,\n  runIterativeGraphOperation,\n  supportsTemporaryIteration,\n  withInlineIterativeGraphOperation,\n} from \"./iterative-graph-operation\";\nimport type {\n  PathNode,\n  ReachableNode,\n  ShortestPathResult,\n  TraversalDirection,\n} from \"./types\";\n\ntype FrontierCandidate = Readonly<{\n  id: string;\n  kind: string;\n  parentId: string;\n  parentKind: string;\n}>;\n\ntype VisitedNode = Readonly<{\n  id: string;\n  kind: string;\n  depth: number;\n  parentKey: NodeIdentityKey | undefined;\n}>;\n\ntype WorkingRow = Readonly<{\n  side: WorkingSide;\n  node_id: string;\n  node_kind: string;\n  depth: number | string;\n  predecessor_id: unknown;\n  predecessor_kind: unknown;\n}>;\n\ntype InsertedRow = Readonly<{ node_id: string }>;\ntype SeededRow = Readonly<{ node_id: string; node_kind: string }>;\ntype InsertedFrontierRow = Readonly<{\n  node_id: string;\n  node_kind: string;\n  meeting_depth: unknown;\n}>;\ntype WorkingSide = \"forward\" | \"reverse\";\n\ntype MeetingNode = Readonly<{\n  id: string;\n  kind: string;\n  depth: number;\n}>;\n\ntype FrontierRound = Readonly<{\n  insertedCount: number;\n  meeting: MeetingNode | undefined;\n}>;\n\nexport async function findReachableNodes(\n  ctx: AlgorithmContext,\n  sourceId: string,\n  maxHops: number,\n  options: InternalTraversalOptions,\n): Promise<readonly ReachableNode[]> {\n  if (supportsTemporaryIteration(ctx)) {\n    return findReachableNodesInWorkingTable(ctx, sourceId, maxHops, options);\n  }\n  return findReachableNodesInline(ctx, sourceId, maxHops, options);\n}\n\nexport async function findShortestPath(\n  ctx: AlgorithmContext,\n  sourceId: string,\n  targetId: string,\n  maxHops: number,\n  options: InternalTraversalOptions,\n): Promise<ShortestPathResult | undefined> {\n  if (supportsTemporaryIteration(ctx)) {\n    return findShortestPathInWorkingTable(\n      ctx,\n      sourceId,\n      targetId,\n      maxHops,\n      options,\n    );\n  }\n  return findShortestPathInline(ctx, sourceId, targetId, maxHops, options);\n}\n\nasync function findReachableNodesInWorkingTable(\n  ctx: AlgorithmContext,\n  sourceId: string,\n  maxHops: number,\n  options: InternalTraversalOptions,\n): Promise<readonly ReachableNode[]> {\n  return runIterativeGraphOperation(ctx, options, {\n    algorithm: \"reachable\",\n    maxIterations: maxHops,\n    createWorkingTable,\n    async initialize(context) {\n      const seeded = await seedWorkingSide(context, sourceId, \"forward\");\n      return {\n        depth: 0,\n        frontierCount: seeded.length,\n        workingTableSize: seeded.length,\n      };\n    },\n    async runRound(context, state) {\n      const nextDepth = state.depth + 1;\n      const frontierCount = await expandReachableWorkingTableRound(\n        context,\n        \"forward\",\n        state.depth,\n        nextDepth,\n        context.operation.direction,\n      );\n      return {\n        depth: nextDepth,\n        frontierCount,\n        workingTableSize: state.workingTableSize + frontierCount,\n      };\n    },\n    hasConverged(state) {\n      return state.frontierCount === 0 || state.depth >= maxHops;\n    },\n    async extractResult(context) {\n      const rows = await readWorkingRows(context, \"forward\");\n      return rows\n        .map((row) => ({\n          id: row.node_id,\n          kind: row.node_kind,\n          depth: Number(row.depth),\n        }))\n        .toSorted(\n          (left, right) =>\n            left.depth - right.depth || compareNodeIdentity(left, right),\n        );\n    },\n  });\n}\n\nasync function findShortestPathInWorkingTable(\n  ctx: AlgorithmContext,\n  sourceId: string,\n  targetId: string,\n  maxHops: number,\n  options: InternalTraversalOptions,\n): Promise<ShortestPathResult | undefined> {\n  return runIterativeGraphOperation(ctx, options, {\n    algorithm: \"shortestPath\",\n    maxIterations: maxHops,\n    createWorkingTable,\n    async initialize(context) {\n      const forwardSeeds = await seedWorkingSide(context, sourceId, \"forward\");\n      const reverseSeeds = await seedWorkingSide(context, targetId, \"reverse\");\n      return {\n        forwardDepth: 0,\n        reverseDepth: 0,\n        forwardFrontierCount: forwardSeeds.length,\n        reverseFrontierCount: reverseSeeds.length,\n        meeting: findSeedMeeting(forwardSeeds, reverseSeeds),\n        workingTableSize: forwardSeeds.length + reverseSeeds.length,\n      };\n    },\n    async runRound(context, state) {\n      const expandForward =\n        state.forwardFrontierCount <= state.reverseFrontierCount;\n      const side = expandForward ? \"forward\" : \"reverse\";\n      const currentDepth =\n        expandForward ? state.forwardDepth : state.reverseDepth;\n      const nextDepth = currentDepth + 1;\n      const direction =\n        expandForward ?\n          context.operation.direction\n        : reverseDirection(context.operation.direction);\n      const round = await expandWorkingTableRound(\n        context,\n        side,\n        currentDepth,\n        nextDepth,\n        direction,\n        maxHops,\n      );\n\n      return {\n        forwardDepth: expandForward ? nextDepth : state.forwardDepth,\n        reverseDepth: expandForward ? state.reverseDepth : nextDepth,\n        forwardFrontierCount:\n          expandForward ? round.insertedCount : state.forwardFrontierCount,\n        reverseFrontierCount:\n          expandForward ? state.reverseFrontierCount : round.insertedCount,\n        meeting: round.meeting,\n        workingTableSize: state.workingTableSize + round.insertedCount,\n      };\n    },\n    hasConverged(state) {\n      return (\n        state.meeting !== undefined ||\n        state.forwardFrontierCount === 0 ||\n        state.reverseFrontierCount === 0 ||\n        state.forwardDepth + state.reverseDepth >= maxHops\n      );\n    },\n    async extractResult(context, state) {\n      if (state.meeting === undefined) return;\n      const rows = await readWorkingRows(context);\n      return buildShortestPath(\n        nodeIdentityKey(state.meeting),\n        createVisitedMapFromRows(rows, \"forward\"),\n        createVisitedMapFromRows(rows, \"reverse\"),\n      );\n    },\n  });\n}\n\nfunction createWorkingTable(context: IterativeGraphRunContext) {\n  return sql`\n    CREATE TEMP TABLE ${context.workingTable} (\n        graph_id TEXT NOT NULL,\n        run_id TEXT NOT NULL,\n        side TEXT NOT NULL,\n        node_id TEXT NOT NULL,\n        node_kind TEXT NOT NULL,\n        depth INTEGER NOT NULL,\n        predecessor_id TEXT,\n        predecessor_kind TEXT,\n        meeting_depth INTEGER,\n        PRIMARY KEY (graph_id, run_id, side, node_kind, node_id)\n      )\n  `;\n}\n\n/**\n * Seeds one traversal side and returns the seeded node identities from the\n * same statement, so the caller reads the frontier size (and, for\n * bidirectional search, the source-equals-target meeting) without a\n * follow-up COUNT round-trip.\n */\nasync function seedWorkingSide(\n  context: IterativeGraphRunContext,\n  nodeId: string,\n  side: WorkingSide,\n): Promise<readonly SeededRow[]> {\n  const { operation, workingTable, graphId, runId } = context;\n  return context.backend.execute<SeededRow>(\n    asCompiledRowsSql(sql`\n      INSERT INTO ${workingTable}\n        (graph_id, run_id, side, node_id, node_kind, depth,\n         predecessor_id, predecessor_kind)\n      SELECT ${graphId}, ${runId}, ${side}, n.id, n.kind, 0, NULL, NULL\n      FROM ${operation.schema.nodesTable} n\n      WHERE n.graph_id = ${graphId}\n        AND n.id = ${nodeId}\n        AND ${operation.nodeTemporalFilter}\n      ON CONFLICT (graph_id, run_id, side, node_kind, node_id) DO NOTHING\n      RETURNING node_id, node_kind\n    `),\n  );\n}\n\n/**\n * Detects the depth-zero meeting for bidirectional search: a node seeded on\n * both sides (source equals target, possibly across kinds sharing that id).\n * Ties break by node id then kind in code-point order — deterministic\n * and identical on both backends, unlike the collation-dependent SQL probe\n * this replaced.\n */\nfunction findSeedMeeting(\n  forwardSeeds: readonly SeededRow[],\n  reverseSeeds: readonly SeededRow[],\n): MeetingNode | undefined {\n  const reverseKeys = new Set(\n    reverseSeeds.map((row) =>\n      nodeIdentityKey({ id: row.node_id, kind: row.node_kind }),\n    ),\n  );\n  let meeting: MeetingNode | undefined;\n  for (const row of forwardSeeds) {\n    const candidate = { id: row.node_id, kind: row.node_kind, depth: 0 };\n    if (!reverseKeys.has(nodeIdentityKey(candidate))) continue;\n    if (meeting === undefined || compareNodeIdentity(candidate, meeting) < 0) {\n      meeting = candidate;\n    }\n  }\n  return meeting;\n}\n\n/**\n * Expands one bidirectional round and detects meetings in the same\n * statement. Each inserted frontier row captures the opposite side's depth\n * for the same node identity (`meeting_depth`); a non-null value marks a\n * meeting. Only newly inserted rows can create a new meeting — both sides'\n * existing rows are immutable and any meeting among them would have\n * converged an earlier round — so the returned rows are a complete meeting\n * probe and the separate per-round meeting query is unnecessary.\n */\nasync function expandWorkingTableRound(\n  context: IterativeGraphRunContext,\n  side: WorkingSide,\n  currentDepth: number,\n  nextDepth: number,\n  direction: TraversalDirection,\n  maxHops: number,\n): Promise<FrontierRound> {\n  const oppositeSide: WorkingSide = side === \"forward\" ? \"reverse\" : \"forward\";\n  let insertedCount = 0;\n  let meeting: MeetingNode | undefined;\n  const { dialect } = context.operation.ctx;\n  const targetKind = dialect.binaryText(sql`expanded.target_kind`);\n  const targetId = dialect.binaryText(sql`expanded.target_id`);\n  const sourceId = dialect.binaryText(sql`expanded.source_id`);\n  const sourceKind = dialect.binaryText(sql`expanded.source_kind`);\n  for (const edgeKinds of context.operation.edgeKindChunks) {\n    const sourceFilter = sql`\n      w.graph_id = ${context.graphId}\n      AND w.run_id = ${context.runId}\n      AND w.side = ${side}\n      AND w.depth = ${currentDepth}\n    `;\n    const expansion = compileWorkingTableExpansion(\n      context.operation,\n      context.workingTable,\n      sourceFilter,\n      direction,\n      edgeKinds,\n    );\n    const rows = await context.backend.execute<InsertedFrontierRow>(\n      asCompiledRowsSql(sql`\n        INSERT INTO ${context.workingTable}\n          (graph_id, run_id, side, node_id, node_kind, depth,\n           predecessor_id, predecessor_kind, meeting_depth)\n        SELECT\n          ${context.graphId}, ${context.runId}, ${side},\n          ranked.target_id, ranked.target_kind, ${nextDepth},\n          ranked.source_id, ranked.source_kind,\n          (\n            SELECT opposite.depth\n            FROM ${context.workingTable} opposite\n            WHERE opposite.graph_id = ${context.graphId}\n              AND opposite.run_id = ${context.runId}\n              AND opposite.side = ${oppositeSide}\n              AND opposite.node_id = ranked.target_id\n              AND opposite.node_kind = ranked.target_kind\n          )\n        FROM (\n          SELECT expanded.*,\n            ROW_NUMBER() OVER (\n              PARTITION BY ${targetKind}, ${targetId}\n              ORDER BY ${sourceId}, ${sourceKind}\n            ) AS candidate_rank\n          FROM (${expansion}) expanded\n        ) ranked\n        WHERE ranked.candidate_rank = 1\n          AND NOT EXISTS (\n            SELECT 1\n            FROM ${context.workingTable} visited\n            WHERE visited.graph_id = ${context.graphId}\n              AND visited.run_id = ${context.runId}\n              AND visited.side = ${side}\n              AND visited.node_id = ranked.target_id\n              AND visited.node_kind = ranked.target_kind\n          )\n        ON CONFLICT (graph_id, run_id, side, node_kind, node_id) DO NOTHING\n        RETURNING node_id, node_kind, meeting_depth\n      `),\n    );\n    insertedCount += rows.length;\n    meeting = selectRoundMeeting(meeting, rows, nextDepth, maxHops);\n  }\n  return { insertedCount, meeting };\n}\n\n/**\n * Folds one round's inserted rows into the best meeting so far: smallest\n * total depth within `maxHops`, ties broken by node id then kind in code-point\n * order. That tie-break is deterministic and identical on both\n * backends; the SQL probe it replaced ordered under the database collation,\n * so equal-depth meetings could previously pick a different node on a\n * PostgreSQL cluster with a linguistic default collation.\n */\nfunction selectRoundMeeting(\n  currentMeeting: MeetingNode | undefined,\n  rows: readonly InsertedFrontierRow[],\n  nextDepth: number,\n  maxHops: number,\n): MeetingNode | undefined {\n  let meeting = currentMeeting;\n  for (const row of rows) {\n    // Drivers may deliver the INTEGER column as number, text, or bigint\n    // (e.g. better-sqlite3 with defaultSafeIntegers); only its absence means\n    // \"no meeting\". Number() coerces every numeric shape.\n    if (row.meeting_depth === null || row.meeting_depth === undefined) {\n      continue;\n    }\n    const totalDepth = nextDepth + Number(row.meeting_depth);\n    if (totalDepth > maxHops) continue;\n    const candidate = {\n      id: row.node_id,\n      kind: row.node_kind,\n      depth: totalDepth,\n    };\n    if (\n      meeting === undefined ||\n      candidate.depth < meeting.depth ||\n      (candidate.depth === meeting.depth &&\n        compareNodeIdentity(candidate, meeting) < 0)\n    ) {\n      meeting = candidate;\n    }\n  }\n  return meeting;\n}\n\n/**\n * Reachability needs only minimum depth, not a reconstructable predecessor.\n * Reduce duplicate edge targets before checking target-node visibility so a\n * dense frontier performs one node lookup per candidate identity rather than\n * one lookup per incident edge.\n */\nasync function expandReachableWorkingTableRound(\n  context: IterativeGraphRunContext,\n  side: WorkingSide,\n  currentDepth: number,\n  nextDepth: number,\n  direction: TraversalDirection,\n): Promise<number> {\n  let insertedCount = 0;\n  for (const edgeKinds of context.operation.edgeKindChunks) {\n    const sourceFilter = sql`\n      w.graph_id = ${context.graphId}\n      AND w.run_id = ${context.runId}\n      AND w.side = ${side}\n      AND w.depth = ${currentDepth}\n    `;\n    const edgeExpansion = compileWorkingTableEdgeExpansion(\n      context.operation,\n      context.workingTable,\n      sourceFilter,\n      direction,\n      edgeKinds,\n    );\n    const rows = await context.backend.execute<InsertedRow>(\n      asCompiledRowsSql(sql`\n        INSERT INTO ${context.workingTable}\n          (graph_id, run_id, side, node_id, node_kind, depth,\n           predecessor_id, predecessor_kind)\n        SELECT\n          ${context.graphId}, ${context.runId}, ${side},\n          candidates.target_id, candidates.target_kind, ${nextDepth},\n          NULL, NULL\n        FROM (\n          SELECT DISTINCT expanded.target_id, expanded.target_kind\n          FROM (${edgeExpansion}) expanded\n        ) candidates\n        JOIN ${context.operation.schema.nodesTable} n\n          ON n.graph_id = ${context.graphId}\n          AND n.id = candidates.target_id\n          AND n.kind = candidates.target_kind\n        WHERE ${context.operation.nodeTemporalFilter}\n          AND NOT EXISTS (\n            SELECT 1\n            FROM ${context.workingTable} visited\n            WHERE visited.graph_id = ${context.graphId}\n              AND visited.run_id = ${context.runId}\n              AND visited.side = ${side}\n              AND visited.node_id = candidates.target_id\n              AND visited.node_kind = candidates.target_kind\n          )\n        ON CONFLICT (graph_id, run_id, side, node_kind, node_id) DO NOTHING\n        RETURNING node_id\n      `),\n    );\n    insertedCount += rows.length;\n  }\n  return insertedCount;\n}\n\nasync function readWorkingRows(\n  context: IterativeGraphRunContext,\n  side?: WorkingSide,\n): Promise<readonly WorkingRow[]> {\n  const sideFilter = side === undefined ? sql`TRUE` : sql`side = ${side}`;\n  return context.backend.execute<WorkingRow>(\n    asCompiledRowsSql(sql`\n      SELECT side, node_id, node_kind, depth,\n        predecessor_id, predecessor_kind\n      FROM ${context.workingTable}\n      WHERE graph_id = ${context.graphId}\n        AND run_id = ${context.runId}\n        AND ${sideFilter}\n    `),\n  );\n}\n\nasync function findReachableNodesInline(\n  ctx: AlgorithmContext,\n  sourceId: string,\n  maxHops: number,\n  options: InternalTraversalOptions,\n): Promise<readonly ReachableNode[]> {\n  return withInlineIterativeGraphOperation(ctx, options, async (operation) => {\n    const sources = await fetchVisibleWorkingNodes(operation, [sourceId]);\n    if (sources.length === 0) return [];\n\n    const reached = new Map<NodeIdentityKey, ReachableNode>(\n      sources.map((source) => [\n        nodeIdentityKey(source),\n        { id: source.id, kind: source.kind, depth: 0 },\n      ]),\n    );\n    let workingSet: readonly PathNode[] = sources;\n\n    for (let depth = 1; depth <= maxHops && workingSet.length > 0; depth++) {\n      const candidates = await expandInlineWorkingSet(\n        operation,\n        workingSet,\n        operation.direction,\n        reached,\n      );\n      const nextWorkingSet = sortCandidates(candidates);\n      for (const candidate of nextWorkingSet) {\n        reached.set(nodeIdentityKey(candidate), {\n          id: candidate.id,\n          kind: candidate.kind,\n          depth,\n        });\n      }\n      workingSet = nextWorkingSet;\n    }\n\n    return [...reached.values()].toSorted(\n      (left, right) =>\n        left.depth - right.depth || compareNodeIdentity(left, right),\n    );\n  });\n}\n\nasync function findShortestPathInline(\n  ctx: AlgorithmContext,\n  sourceId: string,\n  targetId: string,\n  maxHops: number,\n  options: InternalTraversalOptions,\n): Promise<ShortestPathResult | undefined> {\n  return withInlineIterativeGraphOperation(ctx, options, async (operation) => {\n    const visibleNodes = await fetchVisibleWorkingNodes(operation, [\n      sourceId,\n      targetId,\n    ]);\n    const sources = visibleNodes.filter((node) => node.id === sourceId);\n    const targets = visibleNodes.filter((node) => node.id === targetId);\n    if (sources.length === 0 || targets.length === 0) return;\n    if (sourceId === targetId)\n      return { nodes: [requireDefined(sources[0])], depth: 0 };\n\n    const forwardVisited = createVisitedMap(sources);\n    const reverseVisited = createVisitedMap(targets);\n    let forwardWorkingSet: readonly PathNode[] = sources;\n    let reverseWorkingSet: readonly PathNode[] = targets;\n    let forwardDepth = 0;\n    let reverseDepth = 0;\n\n    while (\n      forwardWorkingSet.length > 0 &&\n      reverseWorkingSet.length > 0 &&\n      forwardDepth + reverseDepth < maxHops\n    ) {\n      const expandForward =\n        forwardWorkingSet.length <= reverseWorkingSet.length;\n      const activeVisited = expandForward ? forwardVisited : reverseVisited;\n      const oppositeVisited = expandForward ? reverseVisited : forwardVisited;\n      const currentWorkingSet =\n        expandForward ? forwardWorkingSet : reverseWorkingSet;\n      const direction =\n        expandForward ?\n          operation.direction\n        : reverseDirection(operation.direction);\n      const candidates = await expandInlineWorkingSet(\n        operation,\n        currentWorkingSet,\n        direction,\n        activeVisited,\n      );\n      const nextDepth = (expandForward ? forwardDepth : reverseDepth) + 1;\n      const nextWorkingSet = sortCandidates(candidates);\n\n      for (const candidate of nextWorkingSet) {\n        activeVisited.set(nodeIdentityKey(candidate), {\n          id: candidate.id,\n          kind: candidate.kind,\n          depth: nextDepth,\n          parentKey: nodeIdentityKey({\n            id: candidate.parentId,\n            kind: candidate.parentKind,\n          }),\n        });\n      }\n\n      const meetingKey = findMeetingNodeKey(\n        nextWorkingSet,\n        activeVisited,\n        oppositeVisited,\n      );\n      if (meetingKey !== undefined) {\n        return buildShortestPath(meetingKey, forwardVisited, reverseVisited);\n      }\n\n      if (expandForward) {\n        forwardWorkingSet = nextWorkingSet;\n        forwardDepth = nextDepth;\n      } else {\n        reverseWorkingSet = nextWorkingSet;\n        reverseDepth = nextDepth;\n      }\n    }\n    return;\n  });\n}\n\nasync function expandInlineWorkingSet(\n  operation: IterativeGraphOperation,\n  workingSet: readonly PathNode[],\n  direction: TraversalDirection,\n  visited: ReadonlyMap<NodeIdentityKey, unknown>,\n): Promise<ReadonlyMap<NodeIdentityKey, FrontierCandidate>> {\n  return reduceExpandedWorkingSet(\n    operation,\n    workingSet,\n    direction,\n    (existing, expansion) => selectPredecessor(existing, expansion, visited),\n  );\n}\n\nfunction selectPredecessor(\n  existing: FrontierCandidate | undefined,\n  expansion: NodeExpansion,\n  visited: ReadonlyMap<NodeIdentityKey, unknown>,\n): FrontierCandidate | undefined {\n  if (visited.has(nodeIdentityKey(expansion.target))) return existing;\n  if (\n    existing !== undefined &&\n    compareNodeIdentity(expansion.source, {\n      id: existing.parentId,\n      kind: existing.parentKind,\n    }) >= 0\n  ) {\n    return existing;\n  }\n  return {\n    id: expansion.target.id,\n    kind: expansion.target.kind,\n    parentId: expansion.source.id,\n    parentKind: expansion.source.kind,\n  };\n}\n\nfunction sortCandidates(\n  candidates: ReadonlyMap<NodeIdentityKey, FrontierCandidate>,\n): readonly FrontierCandidate[] {\n  return [...candidates.values()].toSorted((left, right) =>\n    compareNodeIdentity(left, right),\n  );\n}\n\nfunction findMeetingNodeKey(\n  candidates: readonly FrontierCandidate[],\n  activeVisited: ReadonlyMap<NodeIdentityKey, VisitedNode>,\n  oppositeVisited: ReadonlyMap<NodeIdentityKey, VisitedNode>,\n): NodeIdentityKey | undefined {\n  let best:\n    | Readonly<{\n        key: NodeIdentityKey;\n        node: PathNode;\n        depth: number;\n      }>\n    | undefined;\n  for (const candidate of candidates) {\n    const key = nodeIdentityKey(candidate);\n    const active = activeVisited.get(key);\n    const opposite = oppositeVisited.get(key);\n    if (active === undefined || opposite === undefined) continue;\n    const meeting = {\n      key,\n      node: { id: candidate.id, kind: candidate.kind },\n      depth: active.depth + opposite.depth,\n    };\n    if (\n      best === undefined ||\n      meeting.depth < best.depth ||\n      (meeting.depth === best.depth &&\n        compareNodeIdentity(meeting.node, best.node) < 0)\n    ) {\n      best = meeting;\n    }\n  }\n  return best?.key;\n}\n\nfunction buildShortestPath(\n  meetingKey: NodeIdentityKey,\n  forwardVisited: ReadonlyMap<NodeIdentityKey, VisitedNode>,\n  reverseVisited: ReadonlyMap<NodeIdentityKey, VisitedNode>,\n): ShortestPathResult {\n  const forwardKeys: NodeIdentityKey[] = [];\n  let cursor: NodeIdentityKey | undefined = meetingKey;\n  while (cursor !== undefined) {\n    forwardKeys.push(cursor);\n    cursor = forwardVisited.get(cursor)?.parentKey;\n  }\n  forwardKeys.reverse();\n\n  const pathKeys = [...forwardKeys];\n  cursor = reverseVisited.get(meetingKey)?.parentKey;\n  while (cursor !== undefined) {\n    pathKeys.push(cursor);\n    cursor = reverseVisited.get(cursor)?.parentKey;\n  }\n\n  const nodes = pathKeys.map((key) => {\n    const node = forwardVisited.get(key) ?? reverseVisited.get(key);\n    return { id: node?.id ?? \"\", kind: node?.kind ?? \"\" };\n  });\n  return { nodes, depth: nodes.length - 1 };\n}\n\nfunction createVisitedMap(\n  nodes: readonly PathNode[],\n): Map<NodeIdentityKey, VisitedNode> {\n  return new Map(\n    nodes.map((node) => [\n      nodeIdentityKey(node),\n      { id: node.id, kind: node.kind, depth: 0, parentKey: undefined },\n    ]),\n  );\n}\n\nfunction createVisitedMapFromRows(\n  rows: readonly WorkingRow[],\n  side: WorkingSide,\n): Map<NodeIdentityKey, VisitedNode> {\n  return new Map(\n    rows\n      .filter((row) => row.side === side)\n      .map((row) => {\n        const parentKey = nodeIdentityKeyFromRow(\n          row.predecessor_id,\n          row.predecessor_kind,\n        );\n        const node = {\n          id: row.node_id,\n          kind: row.node_kind,\n          depth: Number(row.depth),\n          parentKey,\n        } satisfies VisitedNode;\n        return [nodeIdentityKey(node), node];\n      }),\n  );\n}\n\nfunction reverseDirection(direction: TraversalDirection): TraversalDirection {\n  switch (direction) {\n    case \"out\": {\n      return \"in\";\n    }\n    case \"in\": {\n      return \"out\";\n    }\n    case \"both\": {\n      return \"both\";\n    }\n  }\n}\n","import { findReachableNodes, findShortestPath } from \"./breadth-first\";\nimport {\n  type AlgorithmContext,\n  assertEdgeKinds,\n  DEFAULT_ALGORITHM_MAX_HOPS,\n  DEFAULT_NEIGHBOR_DEPTH,\n  type InternalTraversalOptions,\n  pickTemporalOptions,\n  resolveMaxHops,\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\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 reached = await findReachableNodes(ctx, sourceId, maxHops, options);\n  return options.excludeSource === true ?\n      reached.filter((node) => node.id !== sourceId)\n    : reached;\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  return (\n    (await findShortestPath(ctx, sourceId, targetId, maxHops, options)) !==\n    undefined\n  );\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    ...pickTemporalOptions(options),\n    ...(options.workingMemory !== undefined && {\n      workingMemory: options.workingMemory,\n    }),\n    excludeSource: true,\n  });\n}\n","import { findShortestPath } from \"./breadth-first\";\nimport {\n  type AlgorithmContext,\n  assertEdgeKinds,\n  DEFAULT_ALGORITHM_MAX_HOPS,\n  type InternalTraversalOptions,\n  resolveMaxHops,\n} from \"./context\";\nimport type { ShortestPathResult } from \"./types\";\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  return findShortestPath(ctx, sourceId, targetId, maxHops, options);\n}\n","import type { GraphDef } from \"../../core/define-graph\";\nimport { sql, type SqlFragment } from \"../../query/sql-fragment\";\nimport { asCompiledRowsSql } from \"../../query/sql-intent\";\nimport {\n  type AlgorithmContext,\n  assertEdgeKinds,\n  assertGraphAnalyticsSupported,\n  compileNodeKindSeedFilter,\n  type InternalTraversalOptions,\n  normalizeNodeKinds,\n  pickTemporalOptions,\n  resolveMaxIterations,\n} from \"./context\";\nimport {\n  compileWorkingTableEdgeExpansion,\n  countWorkingTableRows,\n  frontierIndexIdentifier,\n  type IterativeGraphRunContext,\n  runIterativeGraphOperation,\n} from \"./iterative-graph-operation\";\nimport type {\n  InternalWeaklyConnectedComponentsOptions,\n  WeaklyConnectedComponentMembership,\n} from \"./types\";\n\ntype IterationState = Readonly<{\n  changedCount: number;\n  workingTableSize: number;\n}>;\ntype ChangedRow = Readonly<{ node_id: string }>;\ntype MembershipRow = Readonly<{\n  node_id: string;\n  node_kind: string;\n  component_id: string;\n  component_kind: string;\n  component_size: number | string;\n}>;\n\nconst DEFAULT_WCC_MAX_ITERATIONS = 1000;\n\n/** Runs exact label-min weakly connected components in the shared SQL loop. */\nexport async function executeWeaklyConnectedComponents<G extends GraphDef>(\n  ctx: AlgorithmContext,\n  options: InternalWeaklyConnectedComponentsOptions<G>,\n): Promise<readonly WeaklyConnectedComponentMembership[]> {\n  assertEdgeKinds(options.edges);\n  assertGraphAnalyticsSupported(ctx, \"weaklyConnectedComponents\", {\n    requiresWindowFunctions: true,\n  });\n  const maxIterations = resolveMaxIterations(\n    options.maxIterations,\n    DEFAULT_WCC_MAX_ITERATIONS,\n    \"weaklyConnectedComponents\",\n  );\n  const nodeKinds = normalizeNodeKinds(options.nodeKinds);\n  const traversalOptions: InternalTraversalOptions = {\n    edges: options.edges,\n    direction: \"both\",\n    ...pickTemporalOptions(options),\n    ...(options.workingMemory === undefined ?\n      {}\n    : { workingMemory: options.workingMemory }),\n  };\n\n  return runIterativeGraphOperation(ctx, traversalOptions, {\n    algorithm: \"weaklyConnectedComponents\",\n    maxIterations,\n    createWorkingTable,\n    initialize: (context) => initializeWorkingTable(context, nodeKinds),\n    runRound: runLabelPropagationRound,\n    hasConverged(state) {\n      return state.changedCount === 0;\n    },\n    extractResult: extractMemberships,\n  });\n}\n\nfunction createWorkingTable(context: IterativeGraphRunContext): SqlFragment {\n  return sql`\n    CREATE TEMP TABLE ${context.workingTable} (\n      graph_id TEXT NOT NULL,\n      run_id TEXT NOT NULL,\n      node_id TEXT NOT NULL,\n      node_kind TEXT NOT NULL,\n      label_id TEXT NOT NULL,\n      label_kind TEXT NOT NULL,\n      next_label_id TEXT NOT NULL,\n      next_label_kind TEXT NOT NULL,\n      improved_round INTEGER NOT NULL,\n      PRIMARY KEY (graph_id, run_id, node_kind, node_id)\n    )\n  `;\n}\n\nasync function initializeWorkingTable(\n  context: IterativeGraphRunContext,\n  nodeKinds: readonly string[] | undefined,\n): Promise<IterationState> {\n  const { operation, workingTable, graphId, runId } = context;\n  const nodeKindFilter = compileNodeKindSeedFilter(nodeKinds);\n  await context.executeTemporary(sql`\n    INSERT INTO ${workingTable}\n      (graph_id, run_id, node_id, node_kind, label_id, label_kind,\n       next_label_id, next_label_kind, improved_round)\n    SELECT\n      ${graphId}, ${runId}, n.id, n.kind, n.id, n.kind, n.id, n.kind, 0\n    FROM ${operation.schema.nodesTable} n\n    WHERE n.graph_id = ${graphId}\n      AND ${nodeKindFilter}\n      AND ${operation.nodeTemporalFilter}\n  `);\n  await context.executeTemporary(sql`\n    CREATE INDEX ${frontierIndexIdentifier(context)}\n    ON ${workingTable} (graph_id, run_id, improved_round)\n  `);\n\n  const workingTableSize = await countWorkingTableRows(context);\n  return { changedCount: workingTableSize, workingTableSize };\n}\n\nasync function runLabelPropagationRound(\n  context: IterativeGraphRunContext,\n  state: IterationState,\n  iteration: number,\n): Promise<IterationState> {\n  for (const edgeKinds of context.operation.edgeKindChunks) {\n    await propagateChunkLabels(context, edgeKinds, iteration);\n  }\n  const changedRows = await applyNextLabels(context, iteration);\n  return {\n    changedCount: changedRows.length,\n    workingTableSize: state.workingTableSize,\n  };\n}\n\n/**\n * Propagates the minimum neighbor label along one edge-kind chunk. The\n * expansion deliberately skips the target-node visibility join. The working\n * table was seeded through the same graph/kind/temporal filters inside the\n * same snapshot, WCC never inserts rows after seeding, source labels are\n * projected from the frontier, and each target is joined against the working\n * table below. Membership is therefore the visibility-and-scope proof, so a\n * per-edge `typegraph_nodes` lookup would only re-check what the frontier and\n * `scoped_target` already guarantee.\n */\nasync function propagateChunkLabels(\n  context: IterativeGraphRunContext,\n  edgeKinds: readonly string[],\n  iteration: number,\n): Promise<void> {\n  const { operation, workingTable, graphId, runId } = context;\n  const expansion = compileWorkingTableEdgeExpansion(\n    operation,\n    workingTable,\n    sql`\n      w.graph_id = ${graphId}\n      AND w.run_id = ${runId}\n      AND w.improved_round = ${iteration - 1}\n    `,\n    \"both\",\n    edgeKinds,\n    sql`w.label_id AS source_label_id, w.label_kind AS source_label_kind`,\n  );\n  const candidateId = operation.ctx.dialect.binaryText(sql`ranked.label_id`);\n  const candidateKind = operation.ctx.dialect.binaryText(\n    sql`ranked.label_kind`,\n  );\n  const currentId = operation.ctx.dialect.binaryText(sql`target.next_label_id`);\n  const currentKind = operation.ctx.dialect.binaryText(\n    sql`target.next_label_kind`,\n  );\n  const sourceId = operation.ctx.dialect.binaryText(sql`source.label_id`);\n  const sourceKind = operation.ctx.dialect.binaryText(sql`source.label_kind`);\n  const targetId = operation.ctx.dialect.binaryText(sql`source.target_id`);\n  const targetKind = operation.ctx.dialect.binaryText(sql`source.target_kind`);\n\n  await context.executeTemporary(sql`\n    WITH candidates AS (\n      SELECT\n        expanded.target_id,\n        expanded.target_kind,\n        expanded.source_label_id AS label_id,\n        expanded.source_label_kind AS label_kind\n      FROM (${expansion}) expanded\n      JOIN ${workingTable} scoped_target\n        ON scoped_target.graph_id = ${graphId}\n        AND scoped_target.run_id = ${runId}\n        AND scoped_target.node_id = expanded.target_id\n        AND scoped_target.node_kind = expanded.target_kind\n    ), ranked AS (\n      SELECT\n        target_id,\n        target_kind,\n        label_id,\n        label_kind,\n        ROW_NUMBER() OVER (\n          PARTITION BY ${targetKind}, ${targetId}\n          ORDER BY ${sourceId}, ${sourceKind}\n        ) AS candidate_rank\n      FROM candidates source\n    )\n    UPDATE ${workingTable} AS target\n    SET next_label_id = ranked.label_id,\n        next_label_kind = ranked.label_kind\n    FROM ranked\n    WHERE target.graph_id = ${graphId}\n      AND target.run_id = ${runId}\n      AND target.node_id = ranked.target_id\n      AND target.node_kind = ranked.target_kind\n      AND ranked.candidate_rank = 1\n      AND (\n        ${candidateId} < ${currentId}\n        OR (\n          ${candidateId} = ${currentId}\n          AND ${candidateKind} < ${currentKind}\n        )\n      )\n  `);\n}\n\nfunction applyNextLabels(\n  context: IterativeGraphRunContext,\n  iteration: number,\n): Promise<readonly ChangedRow[]> {\n  return context.backend.execute<ChangedRow>(\n    asCompiledRowsSql(sql`\n      UPDATE ${context.workingTable}\n      SET label_id = next_label_id,\n          label_kind = next_label_kind,\n          improved_round = ${iteration}\n      WHERE graph_id = ${context.graphId}\n        AND run_id = ${context.runId}\n        AND (\n          label_id <> next_label_id OR label_kind <> next_label_kind\n        )\n      RETURNING node_id\n    `),\n  );\n}\n\nasync function extractMemberships(\n  context: IterativeGraphRunContext,\n): Promise<readonly WeaklyConnectedComponentMembership[]> {\n  const { operation } = context;\n  const componentId = operation.ctx.dialect.binaryText(sql`label_id`);\n  const componentKind = operation.ctx.dialect.binaryText(sql`label_kind`);\n  const nodeId = operation.ctx.dialect.binaryText(sql`node_id`);\n  const nodeKind = operation.ctx.dialect.binaryText(sql`node_kind`);\n  const rows = await context.backend.execute<MembershipRow>(\n    asCompiledRowsSql(sql`\n      SELECT\n        node_id,\n        node_kind,\n        label_id AS component_id,\n        label_kind AS component_kind,\n        COUNT(*) OVER (\n          PARTITION BY ${componentKind}, ${componentId}\n        ) AS component_size\n      FROM ${context.workingTable}\n      WHERE graph_id = ${context.graphId} AND run_id = ${context.runId}\n      ORDER BY ${componentId}, ${componentKind}, ${nodeId}, ${nodeKind}\n    `),\n  );\n\n  return rows.map((row) => ({\n    id: row.node_id,\n    kind: row.node_kind,\n    componentId: row.component_id,\n    componentKind: row.component_kind,\n    size: Number(row.component_size),\n  }));\n}\n","import type { GraphDef } from \"../../core/define-graph\";\nimport {\n  ConfigurationError,\n  GraphAlgorithmConvergenceError,\n  InvalidEdgeWeightError,\n  type InvalidEdgeWeightReason,\n} from \"../../errors\";\nimport { compileKindFilter } from \"../../query/compiler/predicate-utils\";\nimport { jsonPointer } from \"../../query/json-pointer\";\nimport { sql, type SqlFragment } from \"../../query/sql-fragment\";\nimport { asCompiledRowsSql } from \"../../query/sql-intent\";\nimport type { AlgorithmContext, InternalTraversalOptions } from \"./context\";\nimport { assertEdgeKinds, resolveMaxIterations } from \"./context\";\nimport {\n  compareNodeIdentity,\n  compileWorkingTableExpansion,\n  fetchVisibleWorkingNodes,\n  frontierIndexIdentifier,\n  type IterativeGraphOperation,\n  type IterativeGraphRunContext,\n  type NodeExpansion,\n  type NodeIdentityKey,\n  nodeIdentityKey,\n  reduceExpandedWorkingSet,\n  runIterativeGraphOperation,\n  supportsTemporaryIteration,\n  withInlineIterativeGraphOperation,\n} from \"./iterative-graph-operation\";\nimport type {\n  InternalWeightedShortestPathOptions,\n  PathNode,\n  WeightedShortestPathResult,\n} from \"./types\";\n\nconst DEFAULT_WEIGHTED_SHORTEST_PATH_MAX_ITERATIONS = 1000;\n\nconst WEIGHTED_ALGORITHM_NAME = \"weightedShortestPath\";\n\n/**\n * Largest accepted edge weight (~9.7e289). Auditing weights to this bound\n * makes accumulated overflow impossible rather than merely unlikely: a path\n * gains one working-table row per hop, so it has at most 2^53 hops, and\n * 2^53 · MAX_EDGE_WEIGHT stays far below Number.MAX_VALUE even after\n * float-addition rounding (the 2^64 divisor leaves an ~2000x margin).\n * Without the bound, PostgreSQL's float8 addition would raise a raw 22003\n * overflow mid-round while SQLite silently saturated to Infinity.\n */\nconst MAX_EDGE_WEIGHT = Number.MAX_VALUE / 2 ** 64;\n\n/**\n * Smallest accepted nonzero weight magnitude: the smallest IEEE 754 double\n * (5e-324). PostgreSQL stores smaller nonzero JSON numbers exactly in jsonb\n * and raises a raw underflow when the traversal casts them to float8, so\n * the audit rejects them with the typed error instead. SQLite's JSON parser\n * has already rounded such text to 0 before SQL can observe it — an\n * engine-level difference the audit cannot detect there.\n */\nconst MIN_EDGE_WEIGHT = Number.MIN_VALUE;\n\n/** Traversal options with the weight source guaranteed present. */\ntype WeightedTraversalOptions = InternalTraversalOptions &\n  Readonly<{ weightProperty: string }>;\n\ntype WeightedState = Readonly<{\n  frontierCount: number;\n  workingTableSize: number;\n  /**\n   * Cheapest known distance to any node with the target id, tracked in JS\n   * from each round's RETURNING rows so the next round can prune with a\n   * plain bound parameter instead of per-candidate subqueries.\n   */\n  bestTargetDistance: number | undefined;\n}>;\n\ntype SeededRow = Readonly<{ node_id: string }>;\ntype ImprovedRow = Readonly<{ node_id: string; distance: number | string }>;\n\ntype FrontierRound = Readonly<{\n  frontierCount: number;\n  bestTargetDistance: number | undefined;\n}>;\n\ntype ChainRow = Readonly<{\n  node_id: string;\n  node_kind: string;\n  distance: number | string;\n  hops: number | string;\n}>;\n\ntype WeightAuditRow = Readonly<{\n  edge_id: string;\n  edge_kind: string;\n  weight_text: unknown;\n  is_number: unknown;\n  is_missing: unknown;\n}>;\n\n/**\n * A node settled by weighted relaxation: its best known distance from the\n * source, the hop count of the path achieving it, and the predecessor along\n * that path.\n */\ntype WeightedVisitedNode = Readonly<{\n  id: string;\n  kind: string;\n  distance: number;\n  hops: number;\n  parentKey: NodeIdentityKey | undefined;\n}>;\n\ntype WeightedCandidate = Readonly<{\n  id: string;\n  kind: string;\n  distance: number;\n  hops: number;\n  parentId: string;\n  parentKind: string;\n}>;\n\n/**\n * Finds the minimum-total-weight path from `sourceId` to `targetId` by\n * frontier-based label-correcting relaxation: each round relaxes the edges\n * out of the nodes improved in the previous round, keeping one best\n * `(distance, predecessor)` per node identity, until no distance improves.\n * Weights must be non-negative, which makes pruning against the best known\n * target distance safe: a candidate costing strictly more than a path\n * already reaching the target can never win, while equal-cost candidates\n * stay admitted so the result tie-break sees every equal-cost target.\n */\nexport async function executeWeightedShortestPath<G extends GraphDef>(\n  ctx: AlgorithmContext,\n  sourceId: string,\n  targetId: string,\n  options: InternalWeightedShortestPathOptions<G>,\n): Promise<WeightedShortestPathResult | undefined> {\n  assertEdgeKinds(options.edges);\n  assertWeightOptions(options.weightProperty, options.defaultWeight);\n  const maxIterations = resolveMaxIterations(\n    options.maxIterations,\n    DEFAULT_WEIGHTED_SHORTEST_PATH_MAX_ITERATIONS,\n    WEIGHTED_ALGORITHM_NAME,\n  );\n  // Structurally assignable — the internal options are the traversal options\n  // plus the algorithm-only `maxIterations`, which the substrate ignores.\n  const traversalOptions: WeightedTraversalOptions = options;\n\n  // Non-negative weights make distance 0 unbeatable, so a self path needs\n  // no relaxation rounds — only the weight audit (for deterministic data\n  // errors) and a visibility check on the node itself.\n  if (sourceId === targetId) {\n    return findWeightedSelfPath(ctx, sourceId, traversalOptions);\n  }\n\n  if (supportsTemporaryIteration(ctx)) {\n    return findWeightedShortestPathInWorkingTable(\n      ctx,\n      sourceId,\n      targetId,\n      maxIterations,\n      traversalOptions,\n    );\n  }\n  return findWeightedShortestPathInline(\n    ctx,\n    sourceId,\n    targetId,\n    maxIterations,\n    traversalOptions,\n  );\n}\n\nfunction assertWeightOptions(\n  weightProperty: string,\n  defaultWeight: number | undefined,\n): void {\n  if (typeof weightProperty !== \"string\" || weightProperty.length === 0) {\n    throw new ConfigurationError(\n      `${WEIGHTED_ALGORITHM_NAME} weightProperty must be a non-empty string.`,\n      { weightProperty },\n    );\n  }\n  // The same upper bound the audit applies to stored weights: a default\n  // above it would reopen the accumulated-overflow gap for missing-weight\n  // edges the audit deliberately lets through.\n  if (\n    defaultWeight !== undefined &&\n    (!Number.isFinite(defaultWeight) ||\n      defaultWeight < 0 ||\n      defaultWeight > MAX_EDGE_WEIGHT)\n  ) {\n    throw new ConfigurationError(\n      `${WEIGHTED_ALGORITHM_NAME} defaultWeight must be a non-negative number no greater than ${MAX_EDGE_WEIGHT}, got ${String(defaultWeight)}.`,\n      { defaultWeight, maximum: MAX_EDGE_WEIGHT },\n    );\n  }\n}\n\n/**\n * Fails fast on the first visible edge of the selected kinds whose weight\n * violates the weighted-traversal contract: a non-numeric value, a negative\n * number, or a missing value with no configured default. Runs inside the\n * operation's snapshot before any relaxation round, so a weighted call\n * either observes a fully valid weight domain or throws — the traversal's\n * own weight cast never sees a value it could silently mangle.\n *\n * The audit deliberately covers every visible edge of the selected kinds,\n * not just edges the traversal happens to reach: reachability-dependent\n * validation would make the error nondeterministic in the data.\n */\nasync function assertValidEdgeWeights(\n  operation: IterativeGraphOperation,\n  weightProperty: string,\n  defaultWeight: number | undefined,\n): Promise<void> {\n  const { dialect } = operation.ctx;\n  const pointer = jsonPointer([weightProperty]);\n  const propsColumn = sql.raw(\"e.props\");\n  // The inner projection extracts the JSON path once per edge; the outer\n  // violation predicate then works over plain projected columns. Composing\n  // the checks directly over `e.props` would re-parse the JSON payload for\n  // every predicate branch on the audit's full edge scan.\n  //\n  // Both type predicates are never-NULL by contract, so the multi-branch\n  // violation predicate below stays two-valued.\n  const isNumber = dialect.jsonPathIsNumber(propsColumn, pointer);\n  const isMissing = dialect.jsonPathIsNull(propsColumn, pointer);\n  const weightText = dialect.jsonExtractText(propsColumn, pointer);\n  // CASE keeps the numeric extraction unreachable for non-numeric values:\n  // PostgreSQL does not short-circuit OR/AND, and casting arbitrary text\n  // would error before the audit could produce its typed report. The\n  // extraction is jsonExtractNumber (PostgreSQL `numeric`), NOT the double\n  // extraction the traversal uses: a JSON number beyond the float8 range\n  // must reach the range check below instead of overflowing the cast.\n  const weightNumber = sql`CASE WHEN ${isNumber} THEN ${dialect.jsonExtractNumber(propsColumn, pointer)} END`;\n  const missingViolation =\n    defaultWeight === undefined ?\n      sql`audited.is_missing = 1`\n    : dialect.booleanLiteral(false);\n  const negativeViolation = sql`audited.is_number = 1 AND audited.weight_number < 0`;\n  // CAST the bounds to NUMERIC so PostgreSQL compares in the arbitrary-\n  // precision domain — a numeric-vs-float8 comparison would coerce the\n  // out-of-range value to float8 and overflow before comparing. The lower\n  // arm rejects sub-denormal magnitudes (float8 cast underflow on\n  // PostgreSQL); on SQLite they parsed to exactly 0 and the arm cannot\n  // fire, which is the declared engine caveat on MIN_EDGE_WEIGHT.\n  const outOfRangeViolation = sql`audited.is_number = 1 AND (ABS(audited.weight_number) > CAST(${MAX_EDGE_WEIGHT} AS NUMERIC) OR (audited.weight_number <> 0 AND ABS(audited.weight_number) < CAST(${MIN_EDGE_WEIGHT} AS NUMERIC)))`;\n\n  for (const edgeKinds of operation.edgeKindChunks) {\n    const edgeKindFilter = compileKindFilter(sql.raw(\"e.kind\"), edgeKinds);\n    const rows = await operation.backend.execute<WeightAuditRow>(\n      asCompiledRowsSql(sql`\n        SELECT audited.edge_id, audited.edge_kind, audited.weight_text,\n          audited.is_number, audited.is_missing\n        FROM (\n          SELECT e.id AS edge_id, e.kind AS edge_kind,\n            ${weightText} AS weight_text,\n            ${weightNumber} AS weight_number,\n            CASE WHEN ${isNumber} THEN 1 ELSE 0 END AS is_number,\n            CASE WHEN ${isMissing} THEN 1 ELSE 0 END AS is_missing\n          FROM ${operation.schema.edgesTable} e\n          WHERE e.graph_id = ${operation.ctx.graphId}\n            AND ${edgeKindFilter}\n            AND ${operation.edgeTemporalFilter}\n        ) audited\n        WHERE (${missingViolation})\n          OR (audited.is_missing = 0 AND audited.is_number = 0)\n          OR (${negativeViolation})\n          OR (${outOfRangeViolation})\n        ORDER BY ${dialect.binaryText(sql`audited.edge_id`)}\n        LIMIT 1\n      `),\n    );\n    const row = rows[0];\n    if (row !== undefined) {\n      throw createInvalidEdgeWeightError(row, weightProperty);\n    }\n  }\n}\n\nfunction createInvalidEdgeWeightError(\n  row: WeightAuditRow,\n  weightProperty: string,\n): InvalidEdgeWeightError {\n  const reason = resolveInvalidWeightReason(row);\n  const value =\n    reason === \"missing\" || row.weight_text === null ?\n      undefined\n    : formatWeightValue(row.weight_text);\n  return new InvalidEdgeWeightError({\n    edgeId: row.edge_id,\n    edgeKind: row.edge_kind,\n    property: weightProperty,\n    reason,\n    ...(value === undefined ? {} : { value }),\n  });\n}\n\nfunction resolveInvalidWeightReason(\n  row: WeightAuditRow,\n): InvalidEdgeWeightReason {\n  if (flagIsSet(row.is_missing)) return \"missing\";\n  if (!flagIsSet(row.is_number)) return \"non_numeric\";\n  // A numeric violation is either negative or outside the accepted\n  // magnitude range; the sign distinguishes them (Number() of an oversized\n  // magnitude yields ±Infinity, whose sign still holds).\n  return Number(row.weight_text) < 0 ? \"negative\" : \"out_of_range\";\n}\n\n/** Coerces a driver-shaped 0/1 flag (number, bigint, or boolean) to boolean. */\nfunction flagIsSet(value: unknown): boolean {\n  return Number(value) !== 0;\n}\n\n/** Renders an extracted weight value for the error message. */\nfunction formatWeightValue(value: unknown): string {\n  if (typeof value === \"string\") return value;\n  if (\n    typeof value === \"number\" ||\n    typeof value === \"bigint\" ||\n    typeof value === \"boolean\"\n  ) {\n    return String(value);\n  }\n  return JSON.stringify(value);\n}\n\n// ============================================================\n// Working-table execution\n// ============================================================\n\nasync function findWeightedShortestPathInWorkingTable(\n  ctx: AlgorithmContext,\n  sourceId: string,\n  targetId: string,\n  maxIterations: number,\n  options: WeightedTraversalOptions,\n): Promise<WeightedShortestPathResult | undefined> {\n  return runIterativeGraphOperation<\n    WeightedState,\n    WeightedShortestPathResult | undefined\n  >(ctx, options, {\n    algorithm: WEIGHTED_ALGORITHM_NAME,\n    maxIterations,\n    createWorkingTable,\n    async initialize(context) {\n      await assertValidEdgeWeights(\n        context.operation,\n        options.weightProperty,\n        options.defaultWeight,\n      );\n      // A target no visible node carries can never be reached; converge\n      // immediately instead of relaxing the source's entire component.\n      if (!(await hasVisibleNode(context.operation, targetId))) {\n        return {\n          frontierCount: 0,\n          workingTableSize: 0,\n          bestTargetDistance: undefined,\n        };\n      }\n      // Each round scans only the previous round's frontier; without this\n      // index that filter re-scans the whole (growing) working table, since\n      // the identity primary key cannot serve an improved_round lookup.\n      await context.executeTemporary(sql`\n        CREATE INDEX ${frontierIndexIdentifier(context)}\n        ON ${context.workingTable} (graph_id, run_id, improved_round)\n      `);\n      const seeded = await seedDistances(context, sourceId);\n      return {\n        frontierCount: seeded.length,\n        workingTableSize: seeded.length,\n        // Seeds carry the source id, never the target's — the self-path\n        // case is short-circuited before this plan runs.\n        bestTargetDistance: undefined,\n      };\n    },\n    async runRound(context, state, iteration) {\n      const round = await relaxFrontierRound(\n        context,\n        targetId,\n        iteration,\n        state.bestTargetDistance,\n      );\n      return {\n        frontierCount: round.frontierCount,\n        // Overcounts by re-improved existing rows (RETURNING includes\n        // updates); acceptable because the size only paces the substrate's\n        // ANALYZE refresh, where too-early merely refreshes stats sooner.\n        workingTableSize: state.workingTableSize + round.frontierCount,\n        bestTargetDistance: round.bestTargetDistance,\n      };\n    },\n    hasConverged(state: WeightedState) {\n      return state.frontierCount === 0;\n    },\n    async extractResult(context) {\n      return extractPathFromWorkingTable(context, targetId, maxIterations);\n    },\n  });\n}\n\n/**\n * Point lookup: does any visible node carry this id (under any kind)?\n */\nasync function hasVisibleNode(\n  operation: IterativeGraphOperation,\n  nodeId: string,\n): Promise<boolean> {\n  const rows = await operation.backend.execute<Readonly<{ id: string }>>(\n    asCompiledRowsSql(sql`\n      SELECT n.id FROM ${operation.schema.nodesTable} n\n      WHERE n.graph_id = ${operation.ctx.graphId}\n        AND n.id = ${nodeId}\n        AND ${operation.nodeTemporalFilter}\n      LIMIT 1\n    `),\n  );\n  return rows.length > 0;\n}\n\nfunction createWorkingTable(context: IterativeGraphRunContext): SqlFragment {\n  // DOUBLE PRECISION is accepted by both engines: PostgreSQL's float8, and\n  // REAL affinity on SQLite — the same IEEE 754 double either way.\n  return sql`\n    CREATE TEMP TABLE ${context.workingTable} (\n      graph_id TEXT NOT NULL,\n      run_id TEXT NOT NULL,\n      node_id TEXT NOT NULL,\n      node_kind TEXT NOT NULL,\n      distance DOUBLE PRECISION NOT NULL,\n      hops INTEGER NOT NULL,\n      predecessor_id TEXT,\n      predecessor_kind TEXT,\n      improved_round INTEGER NOT NULL,\n      PRIMARY KEY (graph_id, run_id, node_kind, node_id)\n    )\n  `;\n}\n\nasync function seedDistances(\n  context: IterativeGraphRunContext,\n  sourceId: string,\n): Promise<readonly SeededRow[]> {\n  const { operation, workingTable, graphId, runId } = context;\n  return context.backend.execute<SeededRow>(\n    asCompiledRowsSql(sql`\n      INSERT INTO ${workingTable}\n        (graph_id, run_id, node_id, node_kind, distance, hops,\n         predecessor_id, predecessor_kind, improved_round)\n      SELECT ${graphId}, ${runId}, n.id, n.kind, 0, 0, NULL, NULL, 0\n      FROM ${operation.schema.nodesTable} n\n      WHERE n.graph_id = ${graphId}\n        AND n.id = ${sourceId}\n        AND ${operation.nodeTemporalFilter}\n      ON CONFLICT (graph_id, run_id, node_kind, node_id) DO NOTHING\n      RETURNING node_id\n    `),\n  );\n}\n\n/**\n * Relaxes one round: expands the previous round's frontier through visible\n * edges, keeps the cheapest candidate per target identity (ties broken by\n * source id then kind in binary collation, so both backends pick the same\n * predecessor), and upserts only strict distance improvements.\n *\n * Candidates costing strictly more than `roundBound` — the cheapest path to\n * the target known at round start, tracked in JS from RETURNING rows — are\n * pruned. Sound because the audit guarantees non-negative weights: no\n * extension of such a candidate can beat the known path. Equal-cost\n * candidates stay admitted, because zero-weight edges can extend an\n * equal-cost node to another node with the target id, and the documented\n * smallest-identity target tie-break must see that node; strict-improvement\n * upserts keep the equal-cost plateau finite. A bound parameter keeps the\n * pruning O(1) per candidate and applies the same round-start state on both\n * execution paths, so they run identical round sequences.\n */\nasync function relaxFrontierRound(\n  context: IterativeGraphRunContext,\n  targetId: string,\n  iteration: number,\n  roundBound: number | undefined,\n): Promise<FrontierRound> {\n  const { operation, workingTable, graphId, runId } = context;\n  const { dialect } = operation.ctx;\n  let frontierCount = 0;\n  let bestTargetDistance = roundBound;\n  for (const edgeKinds of operation.edgeKindChunks) {\n    const sourceFilter = sql`\n      w.graph_id = ${graphId}\n      AND w.run_id = ${runId}\n      AND w.improved_round = ${iteration - 1}\n    `;\n    const expansion = compileWorkingTableExpansion(\n      operation,\n      workingTable,\n      sourceFilter,\n      operation.direction,\n      edgeKinds,\n    );\n    const rows = await context.backend.execute<ImprovedRow>(\n      asCompiledRowsSql(sql`\n        INSERT INTO ${workingTable}\n          (graph_id, run_id, node_id, node_kind, distance, hops,\n           predecessor_id, predecessor_kind, improved_round)\n        SELECT\n          ${graphId}, ${runId}, ranked.target_id, ranked.target_kind,\n          ranked.candidate_distance, ranked.candidate_hops,\n          ranked.source_id, ranked.source_kind, ${iteration}\n        FROM (\n          SELECT candidates.*,\n            ROW_NUMBER() OVER (\n              PARTITION BY ${dialect.binaryText(sql`candidates.target_kind`)},\n                ${dialect.binaryText(sql`candidates.target_id`)}\n              ORDER BY candidates.candidate_distance,\n                ${dialect.binaryText(sql`candidates.source_id`)},\n                ${dialect.binaryText(sql`candidates.source_kind`)}\n            ) AS candidate_rank\n          FROM (\n            SELECT expanded.source_id, expanded.source_kind,\n              expanded.target_id, expanded.target_kind,\n              frontier.distance + expanded.weight AS candidate_distance,\n              frontier.hops + 1 AS candidate_hops\n            FROM (${expansion}) expanded\n            JOIN ${workingTable} frontier\n              ON frontier.graph_id = ${graphId}\n              AND frontier.run_id = ${runId}\n              AND frontier.node_id = expanded.source_id\n              AND frontier.node_kind = expanded.source_kind\n          ) candidates\n          WHERE ${\n            roundBound === undefined ?\n              sql`TRUE`\n            : sql`candidates.candidate_distance <= ${roundBound}`\n          }\n        ) ranked\n        WHERE ranked.candidate_rank = 1\n        ON CONFLICT (graph_id, run_id, node_kind, node_id) DO UPDATE SET\n          distance = excluded.distance,\n          hops = excluded.hops,\n          predecessor_id = excluded.predecessor_id,\n          predecessor_kind = excluded.predecessor_kind,\n          improved_round = excluded.improved_round\n        WHERE excluded.distance < ${workingTable}.distance\n        RETURNING node_id, distance\n      `),\n    );\n    frontierCount += rows.length;\n    for (const row of rows) {\n      if (row.node_id !== targetId) continue;\n      const distance = Number(row.distance);\n      if (bestTargetDistance === undefined || distance < bestTargetDistance) {\n        bestTargetDistance = distance;\n      }\n    }\n  }\n  return { frontierCount, bestTargetDistance };\n}\n\n/**\n * Extracts the result path directly in SQL: pick the cheapest row carrying\n * the target id (ties by kind in binary collation, matching the inline\n * path's code-point tie-break since the id is fixed), then walk predecessor\n * pointers through a recursive CTE. Transfer and JS memory stay\n * proportional to the path length instead of the visited set. The\n * `position` guard bounds recursion at the round budget — predecessor\n * chains cannot cycle, but a recursive CTE should never rely on that alone.\n */\nasync function extractPathFromWorkingTable(\n  context: IterativeGraphRunContext,\n  targetId: string,\n  maxIterations: number,\n): Promise<WeightedShortestPathResult | undefined> {\n  const { operation, workingTable, graphId, runId } = context;\n  const { dialect } = operation.ctx;\n  const rows = await context.backend.execute<ChainRow>(\n    asCompiledRowsSql(sql`\n      WITH RECURSIVE chain AS (\n        SELECT best.node_id, best.node_kind, best.distance, best.hops,\n          best.predecessor_id, best.predecessor_kind, 0 AS position\n        FROM (\n          SELECT node_id, node_kind, distance, hops,\n            predecessor_id, predecessor_kind\n          FROM ${workingTable}\n          WHERE graph_id = ${graphId}\n            AND run_id = ${runId}\n            AND node_id = ${targetId}\n          ORDER BY distance ASC, ${dialect.binaryText(sql`node_kind`)}\n          LIMIT 1\n        ) best\n        UNION ALL\n        SELECT w.node_id, w.node_kind, w.distance, w.hops,\n          w.predecessor_id, w.predecessor_kind, c.position + 1\n        FROM chain c\n        JOIN ${workingTable} w\n          ON w.graph_id = ${graphId}\n          AND w.run_id = ${runId}\n          AND w.node_id = c.predecessor_id\n          AND w.node_kind = c.predecessor_kind\n        WHERE c.position <= ${maxIterations}\n      )\n      SELECT node_id, node_kind, distance, hops\n      FROM chain\n      ORDER BY position DESC\n    `),\n  );\n  // position DESC orders source-first, target-last.\n  const target = rows.at(-1);\n  if (target === undefined) return undefined;\n  return {\n    nodes: rows.map((row) => ({ id: row.node_id, kind: row.node_kind })),\n    depth: Number(target.hops),\n    totalWeight: Number(target.distance),\n  };\n}\n\n/**\n * Zero-weight self path: audits the weight domain (so data errors surface\n * identically to a full traversal) and checks the node's visibility, with\n * no relaxation rounds. Multiple kinds sharing the id resolve to the\n * smallest node identity, matching the traversal tie-break.\n */\nasync function findWeightedSelfPath(\n  ctx: AlgorithmContext,\n  nodeId: string,\n  options: WeightedTraversalOptions,\n): Promise<WeightedShortestPathResult | undefined> {\n  return withInlineIterativeGraphOperation(ctx, options, async (operation) => {\n    await assertValidEdgeWeights(\n      operation,\n      options.weightProperty,\n      options.defaultWeight,\n    );\n    const nodes = await fetchVisibleWorkingNodes(operation, [nodeId]);\n    const node = nodes.toSorted((left, right) =>\n      compareNodeIdentity(left, right),\n    )[0];\n    if (node === undefined) return;\n    return { nodes: [node], depth: 0, totalWeight: 0 };\n  });\n}\n\n// ============================================================\n// Inline execution (backends without temporary-table support)\n// ============================================================\n\nasync function findWeightedShortestPathInline(\n  ctx: AlgorithmContext,\n  sourceId: string,\n  targetId: string,\n  maxIterations: number,\n  options: WeightedTraversalOptions,\n): Promise<WeightedShortestPathResult | undefined> {\n  return withInlineIterativeGraphOperation(ctx, options, async (operation) => {\n    await assertValidEdgeWeights(\n      operation,\n      options.weightProperty,\n      options.defaultWeight,\n    );\n    const endpoints = await fetchVisibleWorkingNodes(operation, [\n      sourceId,\n      targetId,\n    ]);\n    const sources = endpoints.filter((node) => node.id === sourceId);\n    // A target no visible node carries can never be reached; skip relaxing\n    // the source's entire component.\n    if (\n      sources.length === 0 ||\n      !endpoints.some((node) => node.id === targetId)\n    ) {\n      return;\n    }\n\n    const settled = new Map<NodeIdentityKey, WeightedVisitedNode>(\n      sources.map((source) => [\n        nodeIdentityKey(source),\n        {\n          id: source.id,\n          kind: source.kind,\n          distance: 0,\n          hops: 0,\n          parentKey: undefined,\n        },\n      ]),\n    );\n    let bestTargetDistance: number | undefined;\n    let frontier: readonly PathNode[] = sources;\n    let rounds = 0;\n\n    while (frontier.length > 0) {\n      if (rounds >= maxIterations) {\n        throw new GraphAlgorithmConvergenceError(\n          WEIGHTED_ALGORITHM_NAME,\n          maxIterations,\n        );\n      }\n      rounds++;\n\n      const candidates = await reduceExpandedWorkingSet<WeightedCandidate>(\n        operation,\n        frontier,\n        operation.direction,\n        (existing, expansion) =>\n          reduceWeightedCandidate(existing, expansion, settled),\n      );\n\n      // Prune against the best target distance as of the round start, the\n      // same state the working-table round's pre-statement snapshot sees, so\n      // both execution paths run identical round sequences.\n      const roundBound = bestTargetDistance;\n      const improved: PathNode[] = [];\n      for (const [candidateKey, candidate] of candidates) {\n        const existing = settled.get(candidateKey);\n        if (existing !== undefined && existing.distance <= candidate.distance) {\n          continue;\n        }\n        // Mirrors the working-table prune: only strictly-worse candidates\n        // are dropped. Equal-cost ones stay admitted so zero-weight edges\n        // from the equal-cost plateau can still reach a smaller-identity\n        // node carrying the target id.\n        if (roundBound !== undefined && candidate.distance > roundBound) {\n          continue;\n        }\n        settled.set(candidateKey, {\n          id: candidate.id,\n          kind: candidate.kind,\n          distance: candidate.distance,\n          hops: candidate.hops,\n          parentKey: nodeIdentityKey({\n            id: candidate.parentId,\n            kind: candidate.parentKind,\n          }),\n        });\n        improved.push({ id: candidate.id, kind: candidate.kind });\n        if (\n          candidate.id === targetId &&\n          (bestTargetDistance === undefined ||\n            candidate.distance < bestTargetDistance)\n        ) {\n          bestTargetDistance = candidate.distance;\n        }\n      }\n      frontier = improved.toSorted((left, right) =>\n        compareNodeIdentity(left, right),\n      );\n    }\n\n    return buildWeightedPathResult(settled, targetId);\n  });\n}\n\n/**\n * Keeps the cheapest candidate per target identity; ties break by source id\n * then kind, mirroring the working-table round's ROW_NUMBER ordering.\n */\nfunction reduceWeightedCandidate(\n  existing: WeightedCandidate | undefined,\n  expansion: NodeExpansion,\n  settled: ReadonlyMap<NodeIdentityKey, WeightedVisitedNode>,\n): WeightedCandidate | undefined {\n  // Unreachable on a weighted run — the substrate rejects NULL weights with\n  // an invariant error — but the field is optional, so narrow it.\n  const weight = expansion.weight;\n  if (weight === undefined) return existing;\n  const sourceEntry = settled.get(nodeIdentityKey(expansion.source));\n  if (sourceEntry === undefined) return existing;\n  const candidateDistance = sourceEntry.distance + weight;\n  if (\n    existing !== undefined &&\n    (existing.distance < candidateDistance ||\n      (existing.distance === candidateDistance &&\n        compareNodeIdentity(\n          { id: existing.parentId, kind: existing.parentKind },\n          expansion.source,\n        ) <= 0))\n  ) {\n    return existing;\n  }\n  return {\n    id: expansion.target.id,\n    kind: expansion.target.kind,\n    distance: candidateDistance,\n    hops: sourceEntry.hops + 1,\n    parentId: expansion.source.id,\n    parentKind: expansion.source.kind,\n  };\n}\n\n// ============================================================\n// Shared result construction\n// ============================================================\n\n/**\n * Selects the cheapest settled node matching the target id (ties by node id\n * then kind) and reconstructs the path by walking predecessors back to the\n * source. Returns `undefined` when the target was never settled.\n */\nfunction buildWeightedPathResult(\n  visited: ReadonlyMap<NodeIdentityKey, WeightedVisitedNode>,\n  targetId: string,\n): WeightedShortestPathResult | undefined {\n  let target: WeightedVisitedNode | undefined;\n  for (const node of visited.values()) {\n    if (node.id !== targetId) continue;\n    if (\n      target === undefined ||\n      node.distance < target.distance ||\n      (node.distance === target.distance &&\n        compareNodeIdentity(node, target) < 0)\n    ) {\n      target = node;\n    }\n  }\n  if (target === undefined) return undefined;\n\n  const reversedNodes: PathNode[] = [];\n  let cursor: WeightedVisitedNode | undefined = target;\n  while (cursor !== undefined) {\n    reversedNodes.push({ id: cursor.id, kind: cursor.kind });\n    cursor =\n      cursor.parentKey === undefined ?\n        undefined\n      : visited.get(cursor.parentKey);\n  }\n\n  return {\n    nodes: reversedNodes.toReversed(),\n    depth: target.hops,\n    totalWeight: target.distance,\n  };\n}\n","import { type GraphBackend } from \"../../backend/types\";\nimport { type GraphDef } from \"../../core/define-graph\";\nimport { type TemporalMode } from \"../../core/types\";\nimport {\n  createSqlSchema,\n  type RecordedReadBinding,\n  type SqlSchema,\n} from \"../../query/compiler/schema\";\nimport { getDialect } from \"../../query/dialect\";\nimport { type KindRegistry } from \"../../registry/kind-registry\";\nimport { assertNoRecordedCoordinate } from \"../recorded-coordinate-guard\";\nimport { type AlgorithmContext } from \"./context\";\nimport { executeDegree } from \"./degree\";\nimport { executeLabelPropagation } from \"./label-propagation\";\nimport { executePageRank, executePersonalizedPageRank } from \"./page-rank\";\nimport {\n  executeCanReach,\n  executeNeighbors,\n  executeReachable,\n} from \"./reachable\";\nimport { executeShortestPath } from \"./shortest-path\";\nimport type {\n  BaseTraversalOptions,\n  DegreeOptions,\n  InternalBaseTraversalOptions,\n  InternalDegreeOptions,\n  InternalLabelPropagationOptions,\n  InternalNeighborsOptions,\n  InternalPageRankOptions,\n  InternalPersonalizedPageRankOptions,\n  InternalReachableOptions,\n  InternalShortestPathOptions,\n  InternalWeaklyConnectedComponentsOptions,\n  InternalWeightedShortestPathOptions,\n  LabelPropagationMembership,\n  LabelPropagationOptions,\n  NeighborsOptions,\n  PageRankOptions,\n  PageRankScore,\n  PersonalizedPageRankOptions,\n  ReachableNode,\n  ReachableOptions,\n  ShortestPathOptions,\n  ShortestPathResult,\n  WeaklyConnectedComponentMembership,\n  WeaklyConnectedComponentsOptions,\n  WeightedShortestPathOptions,\n  WeightedShortestPathResult,\n} from \"./types\";\nimport { executeWeaklyConnectedComponents } from \"./weakly-connected-components\";\nimport { executeWeightedShortestPath } from \"./weighted-shortest-path\";\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   * Finds the minimum-total-weight path from `from` to `to`, weighting each\n   * traversed edge by the numeric `weightProperty` stored on it. Returns\n   * `undefined` when no path exists. Weights must be non-negative; a\n   * negative, non-numeric, or (without `defaultWeight`) missing weight on\n   * any visible edge of the selected kinds throws `InvalidEdgeWeightError`\n   * before traversal starts.\n   *\n   * @example\n   * ```typescript\n   * const path = await store.algorithms.weightedShortestPath(alice, bob, {\n   *   edges: [\"knows\"],\n   *   weightProperty: \"interactionCost\",\n   *   direction: \"both\",\n   * });\n   * if (path) {\n   *   console.log(`total weight ${path.totalWeight} over ${path.depth} hops`);\n   * }\n   * ```\n   */\n  weightedShortestPath: (\n    from: NodeIdentifier,\n    to: NodeIdentifier,\n    options: WeightedShortestPathOptions<G>,\n  ) => Promise<WeightedShortestPathResult | 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? Uses bidirectional BFS and stops when the frontiers meet.\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  /**\n   * Runs deterministic synchronous label propagation over an undirected\n   * projection of the selected edge kinds.\n   */\n  labelPropagation: (\n    options: LabelPropagationOptions<G>,\n  ) => Promise<readonly LabelPropagationMembership[]>;\n\n  /**\n   * Computes exact weakly connected components over the selected edge kinds.\n   *\n   * Iterative: runs multiple SQL rounds in one snapshot and requires\n   * `backend.capabilities.graphAnalytics.supported`.\n   */\n  weaklyConnectedComponents: (\n    options: WeaklyConnectedComponentsOptions<G>,\n  ) => Promise<readonly WeaklyConnectedComponentMembership[]>;\n\n  /**\n   * Computes global PageRank over the visible induced graph. Scores sum to\n   * approximately one and are returned from highest to lowest.\n   */\n  pageRank: (options: PageRankOptions<G>) => Promise<readonly PageRankScore[]>;\n\n  /**\n   * Computes PageRank with teleport mass distributed across weighted seeds.\n   */\n  personalizedPageRank: (\n    options: PersonalizedPageRankOptions<G>,\n  ) => Promise<readonly PageRankScore[]>;\n}>;\n\nexport type InternalGraphAlgorithms<G extends GraphDef> = Readonly<{\n  shortestPath: (\n    from: NodeIdentifier,\n    to: NodeIdentifier,\n    options: InternalShortestPathOptions<G>,\n  ) => Promise<ShortestPathResult | undefined>;\n  weightedShortestPath: (\n    from: NodeIdentifier,\n    to: NodeIdentifier,\n    options: InternalWeightedShortestPathOptions<G>,\n  ) => Promise<WeightedShortestPathResult | undefined>;\n  reachable: (\n    from: NodeIdentifier,\n    options: InternalReachableOptions<G>,\n  ) => Promise<readonly ReachableNode[]>;\n  canReach: (\n    from: NodeIdentifier,\n    to: NodeIdentifier,\n    options: InternalBaseTraversalOptions<G>,\n  ) => Promise<boolean>;\n  neighbors: (\n    node: NodeIdentifier,\n    options: InternalNeighborsOptions<G>,\n  ) => Promise<readonly ReachableNode[]>;\n  degree: (\n    node: NodeIdentifier,\n    options?: InternalDegreeOptions<G>,\n  ) => Promise<number>;\n  labelPropagation: (\n    options: InternalLabelPropagationOptions<G>,\n  ) => Promise<readonly LabelPropagationMembership[]>;\n  weaklyConnectedComponents: (\n    options: InternalWeaklyConnectedComponentsOptions<G>,\n  ) => Promise<readonly WeaklyConnectedComponentMembership[]>;\n  pageRank: (\n    options: InternalPageRankOptions<G>,\n  ) => Promise<readonly PageRankScore[]>;\n  personalizedPageRank: (\n    options: InternalPersonalizedPageRankOptions<G>,\n  ) => Promise<readonly PageRankScore[]>;\n}>;\n\nexport type CreateGraphAlgorithmsParams = Readonly<{\n  graphId: string;\n  graph: GraphDef;\n  registry: KindRegistry;\n  backend: GraphBackend;\n  schema: SqlSchema | undefined;\n  recordedReadBinding: RecordedReadBinding | undefined;\n  defaultTemporalMode: TemporalMode;\n  allowRecordedAsOf?: boolean;\n}>;\n\nfunction assertRecordedAsOfInternalOnly(\n  options: unknown,\n  method: string,\n  allowRecordedAsOf: boolean,\n): void {\n  if (allowRecordedAsOf) return;\n  assertNoRecordedCoordinate(options, {\n    code: \"ALGORITHM_RECORDED_ASOF_INTERNAL_ONLY\",\n    message: `recordedAsOf is only available through store.asOfRecorded(...).${method}(...).`,\n    context: { method },\n    suggestion:\n      \"Use store.asOfRecorded(recordedAt) or a recorded StoreView instead of passing recordedAsOf directly.\",\n  });\n}\n\nexport function createGraphAlgorithms<G extends GraphDef>(\n  params: CreateGraphAlgorithmsParams,\n): InternalGraphAlgorithms<G> {\n  const allowRecordedAsOf = params.allowRecordedAsOf === true;\n  const ctx: AlgorithmContext = {\n    graphId: params.graphId,\n    graph: params.graph,\n    registry: params.registry,\n    backend: params.backend,\n    dialect: getDialect(params.backend.dialect),\n    schema: params.schema ?? createSqlSchema(params.backend.tableNames),\n    recordedReadBinding: params.recordedReadBinding,\n    defaultTemporalMode: params.defaultTemporalMode,\n  };\n\n  return {\n    shortestPath(from, to, options) {\n      assertRecordedAsOfInternalOnly(\n        options,\n        \"shortestPath\",\n        allowRecordedAsOf,\n      );\n      return executeShortestPath(\n        ctx,\n        resolveNodeId(from),\n        resolveNodeId(to),\n        options,\n      );\n    },\n    weightedShortestPath(from, to, options) {\n      assertRecordedAsOfInternalOnly(\n        options,\n        \"weightedShortestPath\",\n        allowRecordedAsOf,\n      );\n      return executeWeightedShortestPath(\n        ctx,\n        resolveNodeId(from),\n        resolveNodeId(to),\n        options,\n      );\n    },\n    reachable(from, options) {\n      assertRecordedAsOfInternalOnly(options, \"reachable\", allowRecordedAsOf);\n      return executeReachable(ctx, resolveNodeId(from), options);\n    },\n    canReach(from, to, options) {\n      assertRecordedAsOfInternalOnly(options, \"canReach\", allowRecordedAsOf);\n      return executeCanReach(\n        ctx,\n        resolveNodeId(from),\n        resolveNodeId(to),\n        options,\n      );\n    },\n    neighbors(node, options) {\n      assertRecordedAsOfInternalOnly(options, \"neighbors\", allowRecordedAsOf);\n      return executeNeighbors(ctx, resolveNodeId(node), options);\n    },\n    degree(node, options) {\n      assertRecordedAsOfInternalOnly(options, \"degree\", allowRecordedAsOf);\n      return executeDegree(ctx, resolveNodeId(node), options ?? {});\n    },\n    labelPropagation(options) {\n      assertRecordedAsOfInternalOnly(\n        options,\n        \"labelPropagation\",\n        allowRecordedAsOf,\n      );\n      return executeLabelPropagation(ctx, options);\n    },\n    weaklyConnectedComponents(options) {\n      assertRecordedAsOfInternalOnly(\n        options,\n        \"weaklyConnectedComponents\",\n        allowRecordedAsOf,\n      );\n      return executeWeaklyConnectedComponents(ctx, options);\n    },\n    pageRank(options) {\n      assertRecordedAsOfInternalOnly(options, \"pageRank\", allowRecordedAsOf);\n      return executePageRank(ctx, options);\n    },\n    personalizedPageRank(options) {\n      assertRecordedAsOfInternalOnly(\n        options,\n        \"personalizedPageRank\",\n        allowRecordedAsOf,\n      );\n      return executePersonalizedPageRank(ctx, options);\n    },\n  };\n}\n\nexport type {\n  AlgorithmCyclePolicy,\n  BaseTraversalOptions,\n  DegreeOptions,\n  InternalBaseTraversalOptions,\n  InternalDegreeOptions,\n  InternalLabelPropagationOptions,\n  InternalNeighborsOptions,\n  InternalPageRankOptions,\n  InternalPersonalizedPageRankOptions,\n  InternalReachableOptions,\n  InternalShortestPathOptions,\n  InternalTemporalAlgorithmOptions,\n  InternalWeaklyConnectedComponentsOptions,\n  InternalWeightedShortestPathOptions,\n  LabelPropagationMembership,\n  LabelPropagationOptions,\n  NeighborsOptions,\n  PageRankOptions,\n  PageRankScore,\n  PathNode,\n  PersonalizedPageRankOptions,\n  PersonalizedPageRankSeed,\n  ReachableNode,\n  ReachableOptions,\n  ShortestPathOptions,\n  ShortestPathResult,\n  TemporalAlgorithmOptions,\n  TraversalDirection,\n  WeaklyConnectedComponentMembership,\n  WeaklyConnectedComponentsOptions,\n  WeightedShortestPathOptions,\n  WeightedShortestPathResult,\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  rowPropsToObject,\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 { requireDefined } from \"../../utils/presence\";\nimport { getEdgeRowsByIds } from \"../edge-fetch\";\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  type UpsertDirtyCheck,\n  type UpsertDirtyCheckFunction,\n} from \"./coalesce\";\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  /** See EdgeOperations.maybeRefreshStatisticsAfterBulk. */\n  maybeRefreshStatisticsAfterBulk?:\n    ((rowCount: number) => Promise<void>) | undefined;\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  /** See EdgeOperations.upsertDirtyCheck. */\n  upsertDirtyCheck?: UpsertDirtyCheckFunction;\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      const rowsById = await getEdgeRowsByIds(backend, graphId, 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 (row.kind !== kind) return;\n        if (!matches(row)) return;\n        return narrowEdge<E>(rowToEdge(row));\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        await config.maybeRefreshStatisticsAfterBulk?.(results.length);\n        return narrowEdges<E>(results);\n      }\n      const results = await executeEdgeCreateBatch(batchInputs, backend);\n      await config.maybeRefreshStatisticsAfterBulk?.(results.length);\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<{ results: Edge<E>[]; mutations: number }> => {\n        const ids = items.map((item) => item.id);\n        const existingMap = await getEdgeRowsByIds(target, graphId, ids);\n\n        // Coalesced items are written straight to results (the existing or\n        // last-written edge) and skipped from the write batch; see the node\n        // collection and BaseStoreOptions.coalesceUnchangedUpserts.\n        const results: Edge<E>[] = Array.from({ length: items.length });\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        // Batch-local running state per id so a repeated id coalesces against\n        // the value earlier items in this batch would write, preserving\n        // last-write-wins. See the node collection for the full rationale.\n        const pending = new Map<\n          string,\n          { props: Record<string, unknown>; sourceIndex: number }\n        >();\n        const deferred: { index: number; sourceIndex: number }[] = [];\n\n        let itemIndex = 0;\n        for (const item of items) {\n          const pendingEntry = pending.get(item.id);\n          const original = existingMap.get(item.id);\n          const inputProps = item.props ?? {};\n\n          if (pendingEntry === undefined && original === undefined) {\n            toCreate.push({\n              index: itemIndex,\n              input: buildCreateEdgeInput(\n                kind,\n                item.from,\n                item.to,\n                inputProps,\n                item,\n              ),\n            });\n            itemIndex++;\n            continue;\n          }\n\n          const deletedAt =\n            pendingEntry === undefined ?\n              requireDefined(original).deleted_at\n            : undefined;\n\n          let dirty: UpsertDirtyCheck | undefined;\n          if (config.upsertDirtyCheck !== undefined) {\n            const currentProps =\n              pendingEntry?.props ??\n              rowPropsToObject(requireDefined(original).props);\n            try {\n              // The fetched edge carries the authoritative kind (an id may\n              // resolve to a different edge kind than this collection).\n              dirty = config.upsertDirtyCheck(\n                original?.kind ?? kind,\n                item.id,\n                currentProps,\n                inputProps,\n              );\n            } catch {\n              dirty = undefined;\n            }\n          }\n\n          const coalesce =\n            dirty?.unchanged === true &&\n            deletedAt === undefined &&\n            item.validFrom === undefined &&\n            item.validTo === undefined;\n\n          if (coalesce) {\n            if (pendingEntry === undefined) {\n              results[itemIndex] = narrowEdge<E>(\n                rowToEdge(requireDefined(original)),\n              );\n            } else {\n              deferred.push({\n                index: itemIndex,\n                sourceIndex: pendingEntry.sourceIndex,\n              });\n            }\n          } else {\n            toUpdate.push({\n              index: itemIndex,\n              input: buildUpdateEdgeInput(item.id, inputProps, item),\n              clearDeleted: deletedAt !== undefined,\n            });\n            if (dirty !== undefined) {\n              pending.set(item.id, {\n                props: dirty.validatedProps,\n                sourceIndex: itemIndex,\n              });\n            }\n          }\n          itemIndex++;\n        }\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>(\n              requireDefined(created[index]),\n            );\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        // Items that coalesced against an in-batch write take that write's\n        // result (now filled). Its sourceIndex is always a write slot.\n        for (const { index, sourceIndex } of deferred) {\n          results[index] = requireDefined(results[sourceIndex]);\n        }\n\n        return { results, mutations: toCreate.length + toUpdate.length };\n      };\n\n      const { results, mutations } =\n        backend.capabilities.transactions && \"transaction\" in backend ?\n          await backend.transaction(async (txBackend) => upsertAll(txBackend))\n        : await upsertAll(backend);\n      // Match bulkCreate/bulkInsert: refresh planner statistics after a large\n      // autocommit bulk write. Coalesced items wrote nothing, so only real\n      // mutations count toward the threshold. A no-op inside a caller\n      // transaction (the hook is intentionally undefined there).\n      await config.maybeRefreshStatisticsAfterBulk?.(mutations);\n      return results;\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        await config.maybeRefreshStatisticsAfterBulk?.(batchInputs.length);\n        return;\n      }\n\n      await executeEdgeCreateNoReturnBatch(batchInputs, backend);\n      await config.maybeRefreshStatisticsAfterBulk?.(batchInputs.length);\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 * Coalesce dirty-check shared by `upsertById` / `bulkUpsertById`.\n *\n * A store created with `coalesceUnchangedUpserts` skips the write for an upsert\n * whose validated props already equal the row's stored props (see\n * {@link file://../types.ts BaseStoreOptions.coalesceUnchangedUpserts}).\n */\n\n/**\n * Result of the dirty check: the props the update WOULD persist (input merged\n * over the current props and run through the kind's Zod schema), and whether\n * they equal the current props (so the write can be skipped). `validatedProps`\n * doubles as the batch-local running value a later same-id item is compared\n * against in the bulk path.\n */\nexport type UpsertDirtyCheck = Readonly<{\n  validatedProps: Record<string, unknown>;\n  unchanged: boolean;\n}>;\n\n/**\n * The seam collections call to run the dirty check. Present only when the store\n * enabled coalescing; its absence is the off switch. `existingProps` is the\n * PARSED current props — the prefetched row's, or the batch-local running value\n * for a repeated id.\n */\nexport type UpsertDirtyCheckFunction = (\n  kind: string,\n  id: string,\n  existingProps: Record<string, unknown>,\n  inputProps: Record<string, unknown>,\n) => UpsertDirtyCheck;\n\n/**\n * Whether a single upsert may be coalesced: coalescing is enabled\n * (`runDirtyCheck` present), the row is live, no explicit temporal override was\n * requested, and the props are unchanged. The dirty check runs last (only when\n * the cheap preconditions pass).\n *\n * A throw from the dirty check is treated as \"do not coalesce\". The check\n * validates the input, so it can throw a `ValidationError`; that must not fail\n * HERE, ahead of the operation hooks. Falling through to the normal write path\n * re-validates inside the hooked pipeline, which raises the error with correct\n * `onError` wiring (matching flag-off) — the error is re-raised there, not\n * swallowed.\n */\nexport function shouldCoalesceUpsert(\n  existing: Readonly<{ deleted_at: string | undefined }>,\n  options: Readonly<{ validFrom?: string; validTo?: string }> | undefined,\n  runDirtyCheck: (() => UpsertDirtyCheck) | undefined,\n): boolean {\n  if (\n    runDirtyCheck === undefined ||\n    existing.deleted_at !== undefined ||\n    options?.validFrom !== undefined ||\n    options?.validTo !== undefined\n  ) {\n    return false;\n  }\n  try {\n    return runDirtyCheck().unchanged;\n  } catch {\n    return false;\n  }\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  rowPropsToObject,\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 { requireDefined } from \"../../utils/presence\";\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  shouldCoalesceUpsert,\n  type UpsertDirtyCheck,\n  type UpsertDirtyCheckFunction,\n} from \"./coalesce\";\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  /** See NodeOperations.maybeRefreshStatisticsAfterBulk. */\n  maybeRefreshStatisticsAfterBulk?:\n    ((rowCount: number) => Promise<void>) | undefined;\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  /** See NodeOperations.upsertDirtyCheck. */\n  upsertDirtyCheck?: UpsertDirtyCheckFunction;\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        // Coalesce a value-identical replay: skip the write entirely (no\n        // updateNode, no recorded capture, no revision advance, no hooks) and\n        // resolve with the existing node. See\n        // BaseStoreOptions.coalesceUnchangedUpserts.\n        const runDirtyCheck =\n          config.upsertDirtyCheck &&\n          (() =>\n            requireDefined(config.upsertDirtyCheck)(\n              kind,\n              id,\n              rowPropsToObject(existing.props),\n              data,\n            ));\n        if (shouldCoalesceUpsert(existing, options, runDirtyCheck)) {\n          return narrowNode<N>(rowToNode(existing));\n        }\n        const result = await executeNodeUpdate(\n          buildUpdateInput(kind, id, data, options),\n          backend,\n          { clearDeleted: existing.deleted_at !== undefined },\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        await config.maybeRefreshStatisticsAfterBulk?.(results.length);\n        return narrowNodes<N>(results);\n      }\n      const results = await executeNodeCreateBatch(batchInputs, backend);\n      await config.maybeRefreshStatisticsAfterBulk?.(results.length);\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<{ results: Node<N>[]; mutations: number }> => {\n        const ids = items.map((item) => item.id);\n        // Full existing rows: the coalesce dirty-check needs their stored\n        // props, not just deleted_at.\n        const existingMap = new Map<string, NodeRow>();\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        // Coalesced items are written straight to results (the existing or\n        // last-written node) and skipped from the write batch; see the\n        // single-upsert path and BaseStoreOptions.coalesceUnchangedUpserts.\n        const results: Node<N>[] = Array.from({ length: items.length });\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        // Batch-local running state per id: the props the row would hold after\n        // the writes queued so far, and the item index that queued that write.\n        // A later same-id item coalesces against this running value, not the\n        // once-prefetched row — otherwise [{x:B},{x:A}] on a row holding A would\n        // coalesce the second item against the stale prefetched A and drop the\n        // first item's write, breaking last-write-wins.\n        const pending = new Map<\n          string,\n          { props: Record<string, unknown>; sourceIndex: number }\n        >();\n        // A coalesced item that matched an in-batch write resolves to that\n        // write's result (filled once the writes run), not a fabricated row.\n        const deferred: { index: number; sourceIndex: number }[] = [];\n\n        let itemIndex = 0;\n        for (const item of items) {\n          const pendingEntry = pending.get(item.id);\n          const original = existingMap.get(item.id);\n\n          if (pendingEntry === undefined && original === undefined) {\n            toCreate.push({\n              index: itemIndex,\n              input: buildCreateInput(kind, item.props, item),\n            });\n            itemIndex++;\n            continue;\n          }\n\n          // A prior in-batch write left the row live; only the prefetched row\n          // (no prior write) can be soft-deleted and trigger a resurrection.\n          const deletedAt =\n            pendingEntry === undefined ?\n              requireDefined(original).deleted_at\n            : undefined;\n\n          let dirty: UpsertDirtyCheck | undefined;\n          if (config.upsertDirtyCheck !== undefined) {\n            const currentProps =\n              pendingEntry?.props ??\n              rowPropsToObject(requireDefined(original).props);\n            try {\n              dirty = config.upsertDirtyCheck(\n                kind,\n                item.id,\n                currentProps,\n                item.props,\n              );\n            } catch {\n              // Validation error → fall through to the write path, which\n              // re-validates and rejects the batch (matching flag-off).\n              dirty = undefined;\n            }\n          }\n\n          const coalesce =\n            dirty?.unchanged === true &&\n            deletedAt === undefined &&\n            item.validFrom === undefined &&\n            item.validTo === undefined;\n\n          if (coalesce) {\n            if (pendingEntry === undefined) {\n              results[itemIndex] = narrowNode<N>(\n                rowToNode(requireDefined(original)),\n              );\n            } else {\n              deferred.push({\n                index: itemIndex,\n                sourceIndex: pendingEntry.sourceIndex,\n              });\n            }\n          } else {\n            toUpdate.push({\n              index: itemIndex,\n              input: buildUpdateInput(kind, item.id, item.props, item),\n              clearDeleted: deletedAt !== undefined,\n            });\n            if (dirty !== undefined) {\n              pending.set(item.id, {\n                props: dirty.validatedProps,\n                sourceIndex: itemIndex,\n              });\n            }\n          }\n          itemIndex++;\n        }\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>(\n              requireDefined(created[index]),\n            );\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        // Items that coalesced against an in-batch write take that write's\n        // result (now filled). Its sourceIndex is always a write slot.\n        for (const { index, sourceIndex } of deferred) {\n          results[index] = requireDefined(results[sourceIndex]);\n        }\n\n        return { results, mutations: toCreate.length + toUpdate.length };\n      };\n\n      const { results, mutations } =\n        backend.capabilities.transactions && \"transaction\" in backend ?\n          await backend.transaction(async (txBackend) => upsertAll(txBackend))\n        : await upsertAll(backend);\n      // Match bulkCreate/bulkInsert: refresh planner statistics after a large\n      // autocommit bulk write. Coalesced items wrote nothing, so only real\n      // mutations count toward the threshold. A no-op inside a caller\n      // transaction (the hook is intentionally undefined there).\n      await config.maybeRefreshStatisticsAfterBulk?.(mutations);\n      return results;\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        await config.maybeRefreshStatisticsAfterBulk?.(batchInputs.length);\n        return;\n      }\n\n      await executeNodeCreateNoReturnBatch(batchInputs, backend);\n      await config.maybeRefreshStatisticsAfterBulk?.(batchInputs.length);\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      // No enclosing transaction: the found path is a pure read and must not\n      // pay for one, and each write leg (create / upsert) opens its own\n      // hooked transaction — nesting them here would fire their hooks before\n      // this wrapper's COMMIT. Race convergence lives in\n      // executeGetOrCreateByConstraint (re-probe on a create collision).\n      const result = await executeGetOrCreateByConstraint(\n        kind,\n        constraintName,\n        props,\n        backend,\n        options,\n      );\n      return result as NodeGetOrCreateByConstraintResult<N>;\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 UpsertDirtyCheckFunction } from \"./collections/coalesce\";\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  /**\n   * Store-provided hook run after an autocommit bulk write completes;\n   * refreshes planner statistics when the row count crosses the\n   * configured threshold. Absent on transaction-scoped collections.\n   */\n  maybeRefreshStatisticsAfterBulk?:\n    ((rowCount: number) => Promise<void>) | undefined;\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  /**\n   * Coalesce dirty-check for `upsertById` / `bulkUpsertById`. Present only when\n   * the store was created with `coalesceUnchangedUpserts: true`; its absence is\n   * the off switch. Given the current (parsed) props, returns the props the\n   * upsert would persist and whether they are unchanged; the collection owns\n   * the other preconditions.\n   */\n  upsertDirtyCheck?: UpsertDirtyCheckFunction;\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  /**\n   * Store-provided hook run after an autocommit bulk write completes;\n   * refreshes planner statistics when the row count crosses the\n   * configured threshold. Absent on transaction-scoped collections.\n   */\n  maybeRefreshStatisticsAfterBulk?:\n    ((rowCount: number) => Promise<void>) | undefined;\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  /**\n   * Coalesce dirty-check for `bulkUpsertById` (props only — endpoints are the\n   * edge's identity). Present only when the store was created with\n   * `coalesceUnchangedUpserts: true`; its absence is the off switch.\n   */\n  upsertDirtyCheck?: UpsertDirtyCheckFunction;\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","import { projectBackendMembers } from \"../backend/graph-backend-projection\";\nimport { type GraphBackend } from \"../backend/types\";\n\n/**\n * Members that are safe to expose through a history-enabled adapter Store.\n *\n * Graph entity writes remain because the source is the capture-wrapped\n * backend. Direct raw SQL, native import, graph clearing, and nested backend\n * transactions stay internal because each can mutate live rows without a\n * corresponding capture flush.\n */\nconst HISTORY_STORE_BACKEND_KEYS = [\n  \"assertRuntimeContributionsInitialized\",\n  \"assertVectorSlotInitialized\",\n  \"assertVectorSlotsInitialized\",\n  \"bootstrapTables\",\n  \"capabilities\",\n  \"checkUnique\",\n  \"checkUniqueBatch\",\n  \"claimIndexMaterialization\",\n  \"close\",\n  \"commitSchemaVersion\",\n  \"compileSql\",\n  \"countEdgesByKind\",\n  \"countEdgesFrom\",\n  \"countNodesByKind\",\n  \"createVectorIndex\",\n  \"deleteEdge\",\n  \"deleteEdgesBatch\",\n  \"deleteEmbedding\",\n  \"deleteFulltext\",\n  \"deleteFulltextBatch\",\n  \"deleteNode\",\n  \"deleteUnique\",\n  \"deleteVectorSlotContribution\",\n  \"dialect\",\n  \"dropVectorIndex\",\n  \"edgeExistsBetween\",\n  \"ensureContributionMaterializationsTable\",\n  \"ensureFulltextTable\",\n  \"ensureIndexMaterializationsTable\",\n  \"ensureKindRemovalsTable\",\n  \"ensureReconciliationMarkersTable\",\n  \"ensureRevisionOriginsTable\",\n  \"ensureRuntimeContributions\",\n  \"ensureVectorSlotContribution\",\n  \"ensureVectorSlotContributions\",\n  \"execute\",\n  \"executeTemporaryStatement\",\n  \"findEdgesByKind\",\n  \"findEdgesConnectedTo\",\n  \"findNodesByKind\",\n  \"fulltextSearch\",\n  \"fulltextStrategy\",\n  \"getActiveSchema\",\n  \"getAllKindRemovals\",\n  \"getContributionMaterialization\",\n  \"getEdge\",\n  \"getEdges\",\n  \"getIndexMaterialization\",\n  \"getIndexMaterializations\",\n  \"getNode\",\n  \"getNodes\",\n  \"getPendingKindRemovals\",\n  \"getReconciliationMarker\",\n  \"getSchemaVersion\",\n  \"hardDeleteEdge\",\n  \"hardDeleteEdgesBatch\",\n  \"hardDeleteNode\",\n  \"hybridSearch\",\n  \"insertEdge\",\n  \"insertEdgeNoReturn\",\n  \"insertEdgesBatch\",\n  \"insertEdgesBatchReturning\",\n  \"insertNode\",\n  \"insertNodeNoReturn\",\n  \"insertNodesBatch\",\n  \"insertNodesBatchReturning\",\n  \"insertUnique\",\n  \"insertUniqueBatch\",\n  \"recordContributionMaterialization\",\n  \"recordIndexMaterialization\",\n  \"recordKindRemoval\",\n  \"refreshStatistics\",\n  \"releaseIndexMaterializationClaim\",\n  \"setActiveVersion\",\n  \"setReconciliationMarker\",\n  \"tableNames\",\n  \"updateEdge\",\n  \"updateNode\",\n  \"upsertEmbedding\",\n  \"upsertEmbeddingBatch\",\n  \"upsertFulltext\",\n  \"upsertFulltextBatch\",\n  \"vectorSearch\",\n  \"vectorStrategy\",\n] as const satisfies readonly (keyof GraphBackend)[];\n\ntype HistoryStoreBackendMember = (typeof HISTORY_STORE_BACKEND_KEYS)[number];\n\ntype UnsafeHistoryStoreBackendMember =\n  | \"clearGraph\"\n  | \"executeDdl\"\n  | \"executeRaw\"\n  | \"executeStatement\"\n  | \"transaction\"\n  | \"trustedImport\";\n\ntype UnclassifiedHistoryStoreBackendMember = Exclude<\n  keyof GraphBackend,\n  HistoryStoreBackendMember | UnsafeHistoryStoreBackendMember\n>;\n\nexport type HistoryStoreBackend =\n  UnclassifiedHistoryStoreBackendMember extends never ?\n    Readonly<Pick<GraphBackend, HistoryStoreBackendMember>>\n  : never;\n\n/** @internal */\nexport function createHistoryStoreBackendProjection(\n  backend: GraphBackend,\n): HistoryStoreBackend {\n  return Object.freeze(\n    projectBackendMembers(backend, HISTORY_STORE_BACKEND_KEYS),\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 * Bucketed orchestration for index-materialization runners.\n *\n * `stopOnError === true` runs sequentially in input order and\n * short-circuits after the first `failed` entry (returning the partial\n * results). Otherwise items are grouped by `bucketKey` and the groups run\n * concurrently with each group sequential — the shape Postgres requires\n * for `CREATE INDEX CONCURRENTLY` (one in-flight build per relation).\n * Results always come back in input order regardless of how the buckets\n * resolved.\n */\nexport async function runBucketedMaterialization<\n  TItem,\n  TEntry extends { status: string },\n>(\n  items: readonly TItem[],\n  options: Readonly<{ stopOnError?: boolean }>,\n  bucketKey: (item: TItem) => string,\n  runOne: (item: TItem) => 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\n  const buckets = new Map<string, [number, TItem][]>();\n  for (const [index, item] of items.entries()) {\n    const key = bucketKey(item);\n    const bucket = buckets.get(key);\n    if (bucket === undefined) buckets.set(key, [[index, item]]);\n    else bucket.push([index, item]);\n  }\n\n  const results: TEntry[] = Array.from({ length: items.length });\n  await Promise.all(\n    [...buckets.values()].map(async (group) => {\n      for (const [index, item] of group) {\n        results[index] = await runOne(item);\n      }\n    }),\n  );\n  return results;\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 bypass this helper and assemble\n * their own 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`). Relational rebuilds self-heal: the\n *   claim-holding materializer drops an invalid leftover with the\n *   declaration's name before rebuilding (see dropInvalidIndexLeftover).\n *   Vector per-field index leftovers remain operator-repair.\n * - Two materializers racing the SAME index name serialize through a\n *   durable claim in the status table (see materializeWithClaim) —\n *   concurrent same-name expression-index CIC builds deadlock on\n *   Postgres (no safe-snapshot exemption).\n */\nimport { type RawBackend } from \"../backend/branded\";\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  generateSystemIndexDDL,\n  resolveSystemIndexNames,\n  resolveSystemIndexTableName,\n  SYSTEM_INDEX_DECLARATIONS,\n  type SystemIndexDeclaration,\n  systemIndexName,\n} from \"../indexes/system\";\nimport {\n  type IndexDeclaration,\n  type RelationalIndexDeclaration,\n  type VectorIndexDeclaration,\n} from \"../indexes/types\";\nimport { sqlValueList } from \"../query/compiler/predicate-utils\";\nimport { type SqlDialect } from \"../query/dialect/types\";\nimport { sql } from \"../query/sql-fragment\";\nimport { asCompiledRowsSql } from \"../query/sql-intent\";\nimport { sortedReplacer } from \"../schema/canonical\";\nimport { serializeIndexDeclaration } from \"../schema/serializer\";\nimport { nowIso } from \"../utils/date\";\nimport { sha256Hex } from \"../utils/hash\";\nimport { requireDefined } from \"../utils/presence\";\nimport {\n  ensureFocusedStatusTable,\n  runBucketedMaterialization,\n} from \"./materialize-shared\";\n\n/**\n * Cross-caller build claim timing (Postgres).\n *\n * A claim older than the lease is stale (its holder crashed mid-build) and\n * may be taken over; the lease is generous because CREATE INDEX\n * CONCURRENTLY on a large relation legitimately runs for minutes, and a\n * premature takeover would recreate exactly the same-index CIC race the\n * claim exists to prevent. Losers retry the claim on an interval —\n * re-claiming after the winner releases converges through the normal\n * already-materialized check — and give up shortly after the lease bound.\n */\nconst CLAIM_LEASE_MS = 15 * 60_000;\nconst CLAIM_RETRY_DELAY_MS = 200;\nconst CLAIM_WAIT_TIMEOUT_MS = CLAIM_LEASE_MS + 60_000;\n\nconst INDEX_DIALECT_BEHAVIOR = {\n  postgres: {\n    concurrentBuilds: true,\n    hasInvalidIndexState: true,\n    supportsGinFamily: true,\n  },\n  sqlite: {\n    concurrentBuilds: false,\n    hasInvalidIndexState: false,\n    supportsGinFamily: false,\n  },\n} as const satisfies Record<\n  SqlDialect,\n  Readonly<{\n    concurrentBuilds: boolean;\n    hasInvalidIndexState: boolean;\n    supportsGinFamily: boolean;\n  }>\n>;\n\n/**\n * Whether the backend implements the FULL cross-caller build-claim\n * protocol. One predicate for both decisions that depend on it — build\n * serialization and the post-create statistics refresh — so a backend\n * implementing only half the surface can never refresh without\n * serializing (the combination that reopens the same-index CIC deadlock).\n */\nfunction hasIndexBuildClaimProtocol(backend: GraphBackend): boolean {\n  return (\n    backend.claimIndexMaterialization !== undefined &&\n    backend.releaseIndexMaterializationClaim !== undefined\n  );\n}\n\nfunction delay(ms: number): Promise<void> {\n  return new Promise((resolve) => {\n    setTimeout(resolve, ms);\n  });\n}\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   * Refresh planner statistics (ANALYZE) after at least one index was\n   * created. A fresh index can be ignored by the planner until statistics\n   * exist. Default: true. Applied on non-concurrent builders (SQLite) and\n   * on concurrent builders that serialize same-index builds via the\n   * cross-caller claim primitive (the bundled Postgres backend); a custom\n   * concurrent backend without the primitive skips the refresh — see\n   * refreshStatisticsAfterCreation — and should call\n   * `store.refreshStatistics()` after materializing.\n   */\n  refreshStatistics?: 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  // Index DDL runs at the top-level backend (CREATE INDEX CONCURRENTLY cannot\n  // run in a transaction) and writes no graph entities — it is the raw seam,\n  // not the capture wrapper. Passing the graph-write backend here is an error.\n  backend: RawBackend;\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  assertBackendSupportsIndexMaterialization(\n    backend,\n    \"store.materializeIndexes()\",\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: INDEX_DIALECT_BEHAVIOR[dialect].concurrentBuilds,\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  // Bulk-preload INVALID index leftovers (interrupted CONCURRENTLY builds)\n  // for the relational candidates in one `pg_index` query. On a warm start\n  // `settleAgainstExisting` would otherwise fire one leftover check per\n  // already-materialized index — the same N-round-trip cost the status\n  // preload above just eliminated. Vector entries are excluded: their\n  // per-field physical index leftovers are operator-repair, and\n  // `settleAgainstExisting` only consults this set for non-vector\n  // declarations. Physical names are the declaration names.\n  const relationalPhysicalNames = candidates\n    .filter((declaration) => declaration.entity !== \"vector\")\n    .map((declaration) => declaration.name);\n  const invalidLeftovers = await preloadInvalidIndexLeftovers(\n    backend,\n    relationalPhysicalNames,\n  );\n\n  // System index names are reserved: a colliding relational declaration's\n  // `CREATE INDEX IF NOT EXISTS` would silently no-op against the\n  // (differently shaped) system index while recording a false success.\n  // The schema factories reject the same collision at table-definition\n  // time; this covers declarations that never pass through them.\n  const reservedSystemNames = resolveSystemIndexNames(backend.tableNames);\n\n  const materializeEntry = (\n    declaration: IndexDeclaration,\n  ): Promise<MaterializeIndexesEntry> => {\n    if (\n      declaration.entity !== \"vector\" &&\n      reservedSystemNames.has(declaration.name)\n    ) {\n      return Promise.resolve(\n        entry(\n          declaration,\n          \"failed\",\n          new Error(\n            `Index name \"${declaration.name}\" collides with a TypeGraph ` +\n              `system index. Rename the declaration — a same-named CREATE ` +\n              `INDEX IF NOT EXISTS would silently no-op against the system ` +\n              `index instead of creating the declared one.`,\n          ),\n        ),\n      );\n    }\n    return declaration.entity === \"vector\" ?\n        materializeVectorIndex(\n          declaration,\n          backend,\n          graphId,\n          schemaVersion,\n          existingByStatusKey,\n          invalidLeftovers,\n        )\n      : materializeRelationalIndex(\n          declaration,\n          backend,\n          dialect,\n          ddlOptions,\n          graphId,\n          schemaVersion,\n          existingByStatusKey,\n          invalidLeftovers,\n        );\n  };\n\n  // Postgres restricts `CREATE INDEX CONCURRENTLY` to one in-flight\n  // build per relation, so declarations group by target relation and\n  // each group runs sequentially while the groups run 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 results = await runBucketedMaterialization(\n    candidates,\n    options,\n    (declaration) => parallelBucketKey(declaration),\n    (declaration) => materializeEntry(declaration),\n  );\n  await refreshStatisticsAfterCreation(\n    backend,\n    results,\n    options,\n    ddlOptions.concurrent,\n  );\n  return { results };\n}\n\n/**\n * Runs ANALYZE once when at least one index was freshly created (unless the\n * caller opted out): the planner can keep seq-scanning past a brand-new\n * index until statistics for it exist.\n *\n * On backends that build with CREATE INDEX CONCURRENTLY, the refresh runs\n * only when the backend also exposes the cross-caller claim primitive\n * (the bundled Postgres backend does): the claim serializes same-index\n * CIC builds, which used to deadlock under the refresh's timing shift\n * (expression-index CIC gets no safe-snapshot exemption). A custom\n * concurrent backend without the primitive keeps the conservative skip\n * and refreshes manually via `store.refreshStatistics()`.\n *\n * Best-effort: by this point the indexes exist and their status rows are\n * recorded, so a failed statistics refresh must not convert that success\n * into a failure — it degrades to a warning.\n */\nasync function refreshStatisticsAfterCreation(\n  backend: RawBackend,\n  results: readonly MaterializeIndexesEntry[],\n  options: MaterializeIndexesOptions,\n  usesConcurrentBuilds: boolean,\n): Promise<void> {\n  if (options.refreshStatistics === false) return;\n  // Concurrent (Postgres) builds were excluded while two callers racing\n  // the SAME expression-index CIC could deadlock — the refresh's timing\n  // shift made that latent race fire reliably. With the cross-caller\n  // claim protocol serializing same-index builds, backends that expose\n  // the claim primitive refresh automatically again; a custom concurrent\n  // backend without the primitive keeps the conservative skip.\n  if (usesConcurrentBuilds && !hasIndexBuildClaimProtocol(backend)) return;\n  if (!results.some((entry) => entry.status === \"created\")) return;\n  try {\n    await backend.refreshStatistics();\n  } catch (error) {\n    if (typeof console === \"undefined\" || typeof console.warn !== \"function\") {\n      return;\n    }\n    console.warn(\n      \"[typegraph] materializeIndexes created its indexes but the follow-up \" +\n        \"statistics refresh failed; run store.refreshStatistics() to give \" +\n        \"the planner fresh statistics.\",\n      error,\n    );\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  invalidLeftovers: ReadonlySet<string>,\n): Promise<MaterializeIndexesEntry> {\n  // GIN-family methods are PostgreSQL expression GINs; SQLite has no\n  // equivalent (its substring-search story is FTS5 fulltext), so the\n  // declaration is recognized and intentionally not acted on — same\n  // contract as vector indexes on engines without vector support.\n  if (\n    declaration.method !== undefined &&\n    !INDEX_DIALECT_BEHAVIOR[dialect].supportsGinFamily\n  ) {\n    return {\n      indexName: declaration.name,\n      entity: declaration.entity,\n      kind: declaration.kind,\n      status: \"skipped\",\n      reason:\n        `Index method \"${declaration.method}\" requires PostgreSQL ` +\n        `(expression GIN${declaration.method === \"trigram\" ? \" + pg_trgm\" : \"\"}); ` +\n        \"SQLite serves substring search via FTS5 fulltext instead.\",\n    };\n  }\n\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: async () => {\n      if (declaration.method === \"trigram\") {\n        // gin_trgm_ops lives in the pg_trgm extension (contrib — present\n        // on stock Postgres and the hosted variants). Idempotent, and a\n        // permission failure surfaces as this index's `failed` entry.\n        await requireDefined(backend.executeDdl)(\n          \"CREATE EXTENSION IF NOT EXISTS pg_trgm;\",\n        );\n      }\n      await requireDefined(backend.executeDdl)(ddl);\n    },\n    existingByStatusKey,\n    physicalRebuildPreload: invalidLeftovers,\n  });\n}\n\nasync function materializeVectorIndex(\n  declaration: VectorIndexDeclaration,\n  backend: GraphBackend,\n  graphId: string,\n  schemaVersion: number,\n  existingByStatusKey: ReadonlyMap<string, IndexMaterializationRow>,\n  invalidLeftovers: ReadonlySet<string>,\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: INDEX_DIALECT_BEHAVIOR[backend.dialect].concurrentBuilds,\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: () => requireDefined(backend.createVectorIndex)(params),\n    existingByStatusKey,\n    physicalRebuildPreload: invalidLeftovers,\n  });\n}\n\n/**\n * The identity a materialization run needs from its declaration: the\n * physical/status name plus the `(entity, kind)` pair recorded on the\n * status row. Relational and vector declarations satisfy it structurally;\n * system indexes construct it from `SYSTEM_INDEX_DECLARATIONS`.\n */\ntype MaterializableIndexIdentity = Readonly<{\n  name: string;\n  entity: IndexEntity;\n  kind: string;\n}>;\n\n/**\n * Shared \"check existing → run → record\" frame for relational, vector,\n * and system materialization. All 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: MaterializableIndexIdentity,\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     * Physical index names whose catalog state requires a rebuild despite\n     * a matching success row. Relational: INVALID `CONCURRENTLY`\n     * leftovers. System: leftovers plus physically absent indexes —\n     * name-presence identifies a system index, so absence is proof the\n     * recorded success is stale (dump/restore, manual drop).\n     */\n    physicalRebuildPreload: ReadonlySet<string>;\n    /**\n     * Fresh per-name variant of `physicalRebuildPreload` for the\n     * post-claim re-check (the preload is stale after waiting on another\n     * builder's claim). Defaults to the Postgres invalid-leftover query.\n     */\n    freshNeedsPhysicalRebuild?: (physicalIndexName: string) => Promise<boolean>;\n    /**\n     * Allow the physical-rebuild check to trigger even on backends\n     * without the claim protocol (SQLite). Sound only when the rebuild is\n     * a plain idempotent CREATE (system indexes); relational leftover\n     * healing requires the claim and keeps the default `false`.\n     */\n    rebuildWithoutClaim?: boolean;\n  }>,\n): Promise<MaterializeIndexesEntry> {\n  // Narrowed by callsite — guaranteed defined when this is reached\n  // (validated in `materializeIndexes`).\n  const recordIndexMaterialization = requireDefined(\n    backend.recordIndexMaterialization,\n  );\n\n  const { statusKey, signature, driftLabel, run, existingByStatusKey } = action;\n  const statusOverride =\n    statusKey === declaration.name ? undefined : { statusName: statusKey };\n\n  // Pre-claim physical check reads the bulk-preloaded set (one catalog\n  // query for all candidates), not one round-trip per index.\n  const settled = await settleAgainstExisting(\n    existingByStatusKey.get(statusKey),\n    declaration,\n    backend,\n    graphId,\n    schemaVersion,\n    {\n      statusKey,\n      signature,\n      driftLabel,\n      needsPhysicalRebuild: (physicalIndexName) =>\n        action.physicalRebuildPreload.has(physicalIndexName),\n      ...(action.rebuildWithoutClaim === undefined ?\n        {}\n      : { rebuildWithoutClaim: action.rebuildWithoutClaim }),\n    },\n  );\n  if (settled !== undefined) return settled;\n\n  // Backends whose concurrent builds can deadlock across callers expose a\n  // claim primitive; one caller builds, the rest wait and converge through\n  // the already-materialized check on re-claim.\n  if (hasIndexBuildClaimProtocol(backend)) {\n    return materializeWithClaim(declaration, backend, graphId, schemaVersion, {\n      statusKey,\n      signature,\n      driftLabel,\n      run,\n      ...(action.freshNeedsPhysicalRebuild === undefined ?\n        {}\n      : { freshNeedsPhysicalRebuild: action.freshNeedsPhysicalRebuild }),\n      ...(action.rebuildWithoutClaim === undefined ?\n        {}\n      : { rebuildWithoutClaim: action.rebuildWithoutClaim }),\n    });\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\n/**\n * Applies the existing-status decision: `alreadyMaterialized` on a prior\n * success with a matching signature, a recorded `failed` on signature\n * drift, and `undefined` when a build is needed. Shared by the pre-claim\n * check (against the bulk-preloaded rows) and the post-claim re-check\n * (against a fresh read — the preload is stale after waiting on a claim).\n */\nasync function settleAgainstExisting(\n  existing: IndexMaterializationRow | undefined,\n  declaration: MaterializableIndexIdentity,\n  backend: GraphBackend,\n  graphId: string,\n  schemaVersion: number,\n  action: Readonly<{\n    statusKey: string;\n    signature: string;\n    driftLabel: string;\n    /**\n     * Whether the physical index behind this name is unusable and must be\n     * rebuilt despite the recorded success (INVALID leftover; for system\n     * indexes also physically absent). The pre-claim caller reads a\n     * bulk-preloaded set (one query for all candidates); the post-claim\n     * caller reads fresh (the preload is stale after waiting on another\n     * builder's claim).\n     */\n    needsPhysicalRebuild: (\n      physicalIndexName: string,\n    ) => boolean | Promise<boolean>;\n    /** See `materializeOne`'s action field of the same name. */\n    rebuildWithoutClaim?: boolean;\n  }>,\n): Promise<MaterializeIndexesEntry | undefined> {\n  if (existing?.materializedAt === undefined) return undefined;\n  const { statusKey, signature, driftLabel, needsPhysicalRebuild } = action;\n  if (existing.signature === signature) {\n    // A recorded success is only trustworthy while the physical index is\n    // usable: a run interrupted after `CREATE ... IF NOT EXISTS` silently\n    // kept an invalid leftover (or a pre-claim-protocol run recorded\n    // success over one), and a dump/restore or manual drop can leave a\n    // success row for an index that no longer exists. Fall through to the\n    // build path — under the claim it drops any leftover and rebuilds;\n    // `rebuildWithoutClaim` callers re-run their plain idempotent CREATE.\n    if (\n      declaration.entity !== \"vector\" &&\n      (hasIndexBuildClaimProtocol(backend) ||\n        action.rebuildWithoutClaim === true) &&\n      (await needsPhysicalRebuild(declaration.name))\n    ) {\n      return undefined;\n    }\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 requireDefined(backend.recordIndexMaterialization)(\n    buildAttempt({\n      declaration,\n      graphId,\n      signature,\n      schemaVersion,\n      materializedAt: undefined,\n      error,\n      ...(statusKey === declaration.name ? {} : { statusName: statusKey }),\n    }),\n  );\n  return entry(declaration, \"failed\", error);\n}\n\n/**\n * Builds one index under the cross-caller claim protocol.\n *\n * Claim → re-check → build → record → release. Losers retry the claim on\n * an interval: once the winner records its result and releases, the next\n * claim succeeds and the fresh status re-check settles them as\n * `alreadyMaterialized` (or surfaces the winner's drift failure) without\n * ever issuing a second same-index CONCURRENTLY build — the shape that\n * deadlocks on Postgres (expression-index CIC gets no safe-snapshot\n * exemption). A crashed holder's claim expires after the lease; the\n * takeover drops the invalid leftover its interrupted build left behind\n * (relational indexes — the declaration name IS the physical name) before\n * rebuilding.\n */\nasync function materializeWithClaim(\n  declaration: MaterializableIndexIdentity,\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    freshNeedsPhysicalRebuild?: (physicalIndexName: string) => Promise<boolean>;\n    rebuildWithoutClaim?: boolean;\n  }>,\n): Promise<MaterializeIndexesEntry> {\n  const { statusKey, signature, driftLabel, run } = action;\n  const statusOverride =\n    statusKey === declaration.name ? undefined : { statusName: statusKey };\n  const recordIndexMaterialization = requireDefined(\n    backend.recordIndexMaterialization,\n  );\n  const token = `${statusKey}:${nowIso()}:${Math.floor(performance.now() * 1000)}`;\n  const deadline = Date.now() + CLAIM_WAIT_TIMEOUT_MS;\n\n  for (;;) {\n    const claimed = await requireDefined(backend.claimIndexMaterialization)({\n      indexName: statusKey,\n      graphId,\n      entity: declaration.entity,\n      kind: declaration.kind,\n      signature,\n      schemaVersion,\n      token,\n      leaseMs: CLAIM_LEASE_MS,\n    });\n\n    if (!claimed) {\n      if (Date.now() >= deadline) {\n        return entry(\n          declaration,\n          \"failed\",\n          new Error(\n            `Timed out waiting for a concurrent materializer's claim on \"${statusKey}\" (waited ${String(CLAIM_WAIT_TIMEOUT_MS)}ms). If its holder crashed, retry after the lease expires.`,\n          ),\n        );\n      }\n      await delay(CLAIM_RETRY_DELAY_MS);\n      continue;\n    }\n\n    try {\n      // Fresh re-check: the bulk preload happened before (possibly) waiting\n      // on another caller's build.\n      const fresh = await requireDefined(backend.getIndexMaterialization)(\n        statusKey,\n      );\n      const settled = await settleAgainstExisting(\n        fresh,\n        declaration,\n        backend,\n        graphId,\n        schemaVersion,\n        {\n          statusKey,\n          signature,\n          driftLabel,\n          // Post-claim the bulk preload is stale (we may have waited on\n          // another builder's claim), so re-check this index fresh.\n          needsPhysicalRebuild:\n            action.freshNeedsPhysicalRebuild ??\n            ((physicalIndexName) =>\n              hasInvalidIndexLeftover(backend, physicalIndexName)),\n          ...(action.rebuildWithoutClaim === undefined ?\n            {}\n          : { rebuildWithoutClaim: action.rebuildWithoutClaim }),\n        },\n      );\n      if (settled !== undefined) return settled;\n\n      if (declaration.entity !== \"vector\") {\n        await dropInvalidIndexLeftover(backend, declaration.name);\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 =\n          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    } finally {\n      // A claim-release failure must not mask the build's own outcome — a\n      // successful build must not surface as a thrown rejection, and one\n      // bucket's release error must not abort its siblings. The claim carries\n      // a lease (CLAIM_LEASE_MS) and self-expires, so a missed release is\n      // reclaimed by the next materializer; warn and move on.\n      try {\n        await requireDefined(backend.releaseIndexMaterializationClaim)({\n          indexName: statusKey,\n          token,\n        });\n      } catch (releaseError) {\n        console.warn(\n          `typegraph: failed to release the index materialization claim for ` +\n            `\"${statusKey}\"; it will expire on its lease and be reclaimed ` +\n            `automatically.`,\n          releaseError,\n        );\n      }\n    }\n  }\n}\n\n/**\n * Whether an index with this name exists but is INVALID (an interrupted\n * CONCURRENTLY build's leftover). False for absent or valid indexes and\n * on non-Postgres dialects.\n */\nasync function hasInvalidIndexLeftover(\n  backend: GraphBackend,\n  physicalIndexName: string,\n): Promise<boolean> {\n  if (!INDEX_DIALECT_BEHAVIOR[backend.dialect].hasInvalidIndexState) {\n    return false;\n  }\n  // Scoped to the session search_path like preloadPhysicalIndexStates —\n  // an unscoped probe could steer the unqualified DROP INDEX heal at\n  // another schema's identically-named (valid) index.\n  const rows = await backend.execute<{ invalid: boolean }>(\n    asCompiledRowsSql(sql`\n      SELECT NOT i.indisvalid AS invalid\n      FROM pg_class c\n      JOIN pg_index i ON i.indexrelid = c.oid\n      WHERE c.relname = ${physicalIndexName}\n        AND pg_catalog.pg_table_is_visible(c.oid)\n    `),\n  );\n  return rows[0]?.invalid === true;\n}\n\n/**\n * Bulk variant of `hasInvalidIndexLeftover`: the set of INVALID leftover\n * index names among `physicalIndexNames`, resolved in ONE `pg_index` query.\n * Empty set on non-Postgres dialects or empty input.\n *\n * A warm start (every index already materialized with a matching signature)\n * would otherwise fire `hasInvalidIndexLeftover` once per already-materialized\n * relational index inside `settleAgainstExisting` — N `pg_index` round-trips.\n * Preloading the whole set collapses that to one, mirroring how\n * `preloadMaterializations` batches the status reads it sits beside.\n */\nasync function preloadInvalidIndexLeftovers(\n  backend: GraphBackend,\n  physicalIndexNames: readonly string[],\n): Promise<ReadonlySet<string>> {\n  if (\n    !INDEX_DIALECT_BEHAVIOR[backend.dialect].hasInvalidIndexState ||\n    physicalIndexNames.length === 0\n  ) {\n    return new Set();\n  }\n  const { invalid } = await preloadPhysicalIndexStates(\n    backend,\n    physicalIndexNames,\n  );\n  return invalid;\n}\n\n/**\n * The subset of `tableNames` that exist as tables in the engine catalog,\n * in one query — `search_path`-scoped on Postgres like the index probes.\n */\nasync function preloadExistingTables(\n  backend: GraphBackend,\n  tableNames: readonly string[],\n): Promise<ReadonlySet<string>> {\n  if (tableNames.length === 0) return new Set();\n  switch (backend.dialect) {\n    case \"postgres\": {\n      const rows = await backend.execute<{ name: string }>(\n        asCompiledRowsSql(sql`\n          SELECT c.relname AS name\n          FROM pg_class c\n          WHERE c.relname IN (${sqlValueList(tableNames)})\n            AND c.relkind IN ('r', 'p')\n            AND pg_catalog.pg_table_is_visible(c.oid)\n        `),\n      );\n      return new Set(rows.map((row) => row.name));\n    }\n    case \"sqlite\": {\n      const rows = await backend.execute<{ name: string }>(\n        asCompiledRowsSql(sql`\n          SELECT name\n          FROM sqlite_master\n          WHERE type = 'table'\n            AND name IN (${sqlValueList(tableNames)})\n        `),\n      );\n      return new Set(rows.map((row) => row.name));\n    }\n    default: {\n      return backend.dialect satisfies never;\n    }\n  }\n}\n\ntype PhysicalIndexStates = Readonly<{\n  /** Names that exist as usable indexes in the engine catalog. */\n  valid: ReadonlySet<string>;\n  /** Postgres INVALID leftovers from interrupted CONCURRENTLY builds. */\n  invalid: ReadonlySet<string>;\n}>;\n\n/**\n * Partitions `physicalIndexNames` by their catalog state in ONE query:\n * `valid` (usable index exists) and `invalid` (Postgres CONCURRENTLY\n * leftover needing the healing build path). SQLite has no invalid state,\n * so its `invalid` set is always empty. The single query serves both the\n * relational runner's leftover preload and the system runner's\n * name-presence fast path — the two predicates are complementary halves\n * of the same `pg_class ⋈ pg_index` probe.\n */\nasync function preloadPhysicalIndexStates(\n  backend: GraphBackend,\n  physicalIndexNames: readonly string[],\n): Promise<PhysicalIndexStates> {\n  const valid = new Set<string>();\n  const invalid = new Set<string>();\n  if (physicalIndexNames.length === 0) return { valid, invalid };\n  switch (backend.dialect) {\n    case \"postgres\": {\n      // Scope to search_path, matching unqualified CREATE/DROP INDEX DDL.\n      const rows = await backend.execute<{ name: string; valid: boolean }>(\n        asCompiledRowsSql(sql`\n          SELECT c.relname AS name, i.indisvalid AS valid\n          FROM pg_class c\n          JOIN pg_index i ON i.indexrelid = c.oid\n          WHERE c.relname IN (${sqlValueList(physicalIndexNames)})\n            AND pg_catalog.pg_table_is_visible(c.oid)\n        `),\n      );\n      for (const row of rows) (row.valid ? valid : invalid).add(row.name);\n      return { valid, invalid };\n    }\n    case \"sqlite\": {\n      const rows = await backend.execute<{ name: string }>(\n        asCompiledRowsSql(sql`\n          SELECT name\n          FROM sqlite_master\n          WHERE type = 'index'\n            AND name IN (${sqlValueList(physicalIndexNames)})\n        `),\n      );\n      for (const row of rows) valid.add(row.name);\n      return { valid, invalid };\n    }\n    default: {\n      return backend.dialect satisfies never;\n    }\n  }\n}\n\n/**\n * Self-heals an interrupted CONCURRENTLY build: a crashed CIC leaves an\n * INVALID index behind, and a later `CREATE INDEX CONCURRENTLY IF NOT\n * EXISTS` would see the name and silently no-op — recording success over an\n * index the planner will never use. Detect via `hasInvalidIndexLeftover` and\n * drop (also CONCURRENTLY — same no-transaction rule). Valid indexes are\n * never touched.\n */\nasync function dropInvalidIndexLeftover(\n  backend: GraphBackend,\n  physicalIndexName: string,\n): Promise<void> {\n  if (backend.executeDdl === undefined) return;\n  if (!(await hasInvalidIndexLeftover(backend, physicalIndexName))) return;\n  const quoted = `\"${physicalIndexName.replaceAll('\"', '\"\"')}\"`;\n  await backend.executeDdl(`DROP INDEX CONCURRENTLY IF EXISTS ${quoted};`);\n}\n\nfunction entry(\n  declaration: MaterializableIndexIdentity,\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 = requireDefined(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(requireDefined(statusKeys[index]), row);\n  }\n  return map;\n}\n\nfunction buildAttempt(\n  args: Readonly<{\n    declaration: MaterializableIndexIdentity;\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// System indexes\n// ============================================================\n\nexport type MaterializeSystemIndexesOptions = Readonly<{\n  /** Stop on the first failure. Default: false (best-effort). */\n  stopOnError?: boolean;\n  /** Refresh planner statistics after a creation. Default: true. */\n  refreshStatistics?: boolean;\n}>;\n\ntype SystemIndexCandidate = Readonly<{\n  declaration: SystemIndexDeclaration;\n  physicalTable: string;\n  name: string;\n}>;\n\n/**\n * Materializes TypeGraph's own base-relation indexes\n * (`SYSTEM_INDEX_DECLARATIONS`) against the live database.\n *\n * Bootstrap DDL runs only on first boot, so a system index added in a new\n * library version never reaches an already-initialized database on its\n * own — this runner is the upgrade path. It rides the same per-deployment\n * status table, drift signatures, invalid-leftover healing, and Postgres\n * `CREATE INDEX CONCURRENTLY` cross-caller claim protocol as\n * graph-declared indexes; on a database whose indexes all exist, a warm\n * call costs three concurrent reads (status, index-catalog, and\n * table-catalog preloads) after the idempotent status-table ensure, and runs no\n * DDL after the first recorded success.\n *\n * Graph-independent: the declarations don't depend on `GraphDef`. The\n * `graphId` is recorded on status rows for observability only (\"who\n * materialized this\"), matching relational rows' semantics.\n *\n * Unlike expression indexes, a system index is fully identified by its\n * physical name, so a candidate that already exists in the engine catalog\n * (valid, with no recorded status row) settles as `alreadyMaterialized`\n * from one bulk catalog read — no claim, no DDL, no status write. Status\n * rows are recorded only for genuine builds and failures, which keeps the\n * common boot (fresh bootstrap or wiped status table) at three concurrent\n * reads. A status row that exists with a mismatching signature still\n * surfaces as drift, exactly like graph-declared indexes.\n */\n/**\n * Whether the backend carries every primitive index materialization\n * requires (DDL execution + status reads/writes). The strict runners\n * throw `ConfigurationError` exactly when this is false; the boot path\n * (`createStoreWithSchema`) consults the same predicate to skip instead\n * — one definition so the two contracts cannot drift apart.\n */\nexport function backendSupportsIndexMaterialization(\n  backend: GraphBackend,\n): boolean {\n  return (\n    backend.executeDdl !== undefined &&\n    backend.getIndexMaterialization !== undefined &&\n    backend.recordIndexMaterialization !== undefined\n  );\n}\n\n/**\n * Strict-side counterpart of {@link backendSupportsIndexMaterialization}:\n * the runners' throw-guard, derived from the same predicate the boot\n * path's skip-guard consults.\n */\nfunction assertBackendSupportsIndexMaterialization(\n  backend: GraphBackend,\n  surface: string,\n): void {\n  if (backendSupportsIndexMaterialization(backend)) return;\n  throw new ConfigurationError(\n    `${surface} requires a backend with \\`executeDdl\\` and the index ` +\n      \"materialization status primitives (`getIndexMaterialization`, \" +\n      \"`recordIndexMaterialization`). The bundled SQLite and Postgres \" +\n      \"backends provide them; a custom backend must implement all three.\",\n    { code: \"MATERIALIZE_BACKEND_UNSUPPORTED\" },\n  );\n}\n\nexport async function materializeSystemIndexes(\n  context: Readonly<{\n    backend: RawBackend;\n    graphId: string;\n    schemaVersion: number;\n  }>,\n  options: MaterializeSystemIndexesOptions = {},\n): Promise<MaterializeIndexesResult> {\n  const { backend, graphId, schemaVersion } = context;\n\n  assertBackendSupportsIndexMaterialization(\n    backend,\n    \"store.materializeSystemIndexes()\",\n  );\n\n  await ensureFocusedStatusTable(\n    backend,\n    backend.ensureIndexMaterializationsTable,\n  );\n\n  const concurrent = INDEX_DIALECT_BEHAVIOR[backend.dialect].concurrentBuilds;\n  const candidates: readonly SystemIndexCandidate[] =\n    SYSTEM_INDEX_DECLARATIONS.map((declaration) => {\n      const physicalTable = resolveSystemIndexTableName(\n        declaration.table,\n        backend.tableNames,\n      );\n      return {\n        declaration,\n        physicalTable,\n        name: systemIndexName(physicalTable, declaration.suffix),\n      };\n    });\n\n  // The three preloads are mutually independent reads (status table +\n  // two catalog probes); running them concurrently keeps the warm boot at\n  // one round-trip latency after the ensure step.\n  const statusKeys = candidates.map((candidate) => candidate.name);\n  const targetTables = [\n    ...new Set(candidates.map((candidate) => candidate.physicalTable)),\n  ];\n  const [existingByStatusKey, physicalStates, existingTables] =\n    await Promise.all([\n      preloadMaterializations(backend, statusKeys),\n      preloadPhysicalIndexStates(backend, statusKeys),\n      preloadExistingTables(backend, targetTables),\n    ]);\n  const { valid: physicallyPresent } = physicalStates;\n  // Physical state is authoritative for system indexes: absent or INVALID\n  // must rebuild even under a matching success row (dump/restore, manual\n  // drop). One set serves every candidate's pre-claim check.\n  const physicalRebuildPreload: ReadonlySet<string> = new Set(\n    statusKeys.filter((name) => !physicallyPresent.has(name)),\n  );\n\n  const materializeEntry = async (\n    candidate: SystemIndexCandidate,\n  ): Promise<MaterializeIndexesEntry> => {\n    const identity: MaterializableIndexIdentity = {\n      name: candidate.name,\n      entity: \"system\",\n      kind: candidate.declaration.table,\n    };\n    // Legacy databases can predate optional relations (the recorded\n    // tables ship with history support; `operation-backend-core` guards\n    // its clears the same way). Their indexes are skipped, not failed —\n    // the relation appearing later (bootstrap on a fresh database always\n    // creates it) brings the indexes with it.\n    if (!existingTables.has(candidate.physicalTable)) {\n      return {\n        indexName: candidate.name,\n        entity: \"system\",\n        kind: candidate.declaration.table,\n        status: \"skipped\",\n        reason: `Relation \"${candidate.physicalTable}\" does not exist in this database`,\n      };\n    }\n\n    const existing = existingByStatusKey.get(candidate.name);\n\n    // A status row owned by another entity means a graph-declared index\n    // was materialized under this name. Refuse WITHOUT writing: driving\n    // this through the drift path would record a system-signature failure\n    // over the graph-declared index's row and permanently brick it.\n    if (existing !== undefined && existing.entity !== \"system\") {\n      return entry(\n        identity,\n        \"failed\",\n        new Error(\n          `System index name \"${candidate.name}\" is already recorded by a ` +\n            `${existing.entity} index declaration (graph \"${existing.graphId}\"). ` +\n            `Rename the graph-declared index — \"typegraph_\"-prefixed names ` +\n            `belong to TypeGraph's system indexes.`,\n        ),\n      );\n    }\n\n    // Name-presence fast path: valid physical index, no status row — the\n    // normal steady state, since bootstrap DDL creates system indexes\n    // without recording status rows. Trusting name-presence is sound\n    // ONLY here: system index names are library-owned with a stable\n    // name→shape contract (reshaping requires a rename), whereas a\n    // graph-declared index name could collide with a foreign index whose\n    // shape only the recorded signature can vouch for. Known limitation\n    // of that contract: a declaration reshaped in place (violating the\n    // rename rule) is NOT detected on bootstrap-created databases, since\n    // there is no recorded signature to drift against — the rename rule\n    // is enforced by review and the parity tests, not at runtime. A row\n    // with a mismatching signature must NOT take the fast path — that is\n    // drift, and the frame below records it as a failure.\n    if (existing === undefined && physicallyPresent.has(candidate.name)) {\n      return entry(identity, \"alreadyMaterialized\");\n    }\n    const signature = await computeSystemIndexSignature(\n      backend.dialect,\n      candidate.physicalTable,\n      candidate.declaration,\n    );\n    const ddl = generateSystemIndexDDL(\n      candidate.declaration,\n      candidate.physicalTable,\n      { concurrent },\n    );\n    return materializeOne(identity, backend, graphId, schemaVersion, {\n      statusKey: candidate.name,\n      signature,\n      driftLabel: \"System index\",\n      run: () => requireDefined(backend.executeDdl)(ddl),\n      existingByStatusKey,\n      physicalRebuildPreload,\n      freshNeedsPhysicalRebuild: async (physicalIndexName) => {\n        const fresh = await preloadPhysicalIndexStates(backend, [\n          physicalIndexName,\n        ]);\n        return !fresh.valid.has(physicalIndexName);\n      },\n      rebuildWithoutClaim: true,\n    });\n  };\n\n  // Same shape as the relational runner: one CONCURRENTLY build per\n  // relation, so buckets key on the physical table.\n  const results = await runBucketedMaterialization(\n    candidates,\n    options,\n    (candidate) => candidate.physicalTable,\n    (candidate) => materializeEntry(candidate),\n  );\n  await refreshStatisticsAfterCreation(backend, results, options, concurrent);\n  return { results };\n}\n\n/**\n * Canonical hash of `{ dialect, targetTableName, declaration }` for a\n * system-index declaration — same drift contract as\n * `computeIndexSignature`: changing a declaration's shape under the same\n * suffix mismatches the recorded signature and surfaces as a `failed`\n * entry until the operator drops the old physical index (rename instead).\n */\nasync function computeSystemIndexSignature(\n  dialect: SqlDialect,\n  targetTableName: string,\n  declaration: SystemIndexDeclaration,\n): Promise<string> {\n  const json = JSON.stringify(\n    { dialect, targetTableName, declaration },\n    sortedReplacer,\n  );\n  return sha256Hex(json, 16);\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 *\n * `declaration` is canonicalized via `serializeIndexDeclaration` before\n * hashing — `defineGraph` accepts pre-built `IndexDeclaration`s directly\n * (bypassing `defineNodeIndex`'s own canonicalization), so a raw\n * declaration with e.g. a present-but-empty `keySystemColumns: []` would\n * otherwise hash differently from the same declaration with the field\n * omitted, spuriously forcing re-materialization for no real shape change.\n */\nexport async function computeIndexSignature(\n  dialect: SqlDialect,\n  targetTableName: string,\n  declaration: IndexDeclaration,\n): Promise<string> {\n  const hashable = {\n    dialect,\n    targetTableName,\n    declaration: serializeIndexDeclaration(declaration),\n  };\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 { type RawBackend } from \"../backend/branded\";\nimport {\n  type GraphBackend,\n  type KindRemovalRow,\n  type RecordKindRemovalParams,\n  type TransactionBackend,\n} from \"../backend/types\";\nimport type { KindEntity } from \"../core/types\";\nimport { ConfigurationError } from \"../errors\";\nimport { createSqlSchema, type SqlSchema } from \"../query/compiler/schema\";\nimport type {\n  VectorSlot,\n  VectorStrategy,\n} from \"../query/dialect/vector-strategy\";\nimport { sql } from \"../query/sql-fragment\";\nimport { asCompiledStatementSql } from \"../query/sql-intent\";\nimport { parseSerializedSchema } from \"../schema/manager\";\nimport { nowIso } from \"../utils/date\";\nimport { requireDefined } from \"../utils/presence\";\nimport { isMissingTableError } from \"../utils/sql-errors\";\nimport {\n  ensureFocusedStatusTable,\n  runMaterialization,\n} from \"./materialize-shared\";\nimport { closeRecordedHardDeletedKind } from \"./recorded-capture\";\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  // Bulk kind-removal deletes live rows directly and closes recorded intervals\n  // by kind — it deliberately bypasses the per-row capture wrapper, so it takes\n  // the raw seam. Passing the graph-write backend here is a type error.\n  backend: RawBackend;\n  captureRecordedRemovals?: boolean;\n  // The store's resolved SQL schema, so recorded-interval closes target the\n  // same relations recorded reads do (honoring a custom `schema` option, not\n  // just `backend.tableNames`). Falls back to the backend's table names.\n  recordedSchema?: SqlSchema;\n}>;\n\ntype MaterializeOneContext = Readonly<{\n  backend: GraphBackend;\n  graphId: string;\n  nodesTable: string;\n  edgesTable: string;\n  fulltextTable: string;\n  uniquesTable: string;\n  captureRecordedRemovals: boolean;\n  // Resolved once per removal pass (not per kind) and threaded into each\n  // recorded-interval close. Undefined when recorded capture is off.\n  recordedSchema: SqlSchema | undefined;\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 captureRecordedRemovals = context.captureRecordedRemovals === true;\n  const ctx = {\n    backend,\n    graphId,\n    nodesTable,\n    edgesTable,\n    fulltextTable,\n    uniquesTable,\n    captureRecordedRemovals,\n    recordedSchema:\n      captureRecordedRemovals ?\n        (context.recordedSchema ?? createSqlSchema(backend.tableNames))\n      : undefined,\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    requireDefined(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: MaterializeOneContext,\n): Promise<MaterializeRemovalsEntry> {\n  const recordKindRemoval = requireDefined(ctx.backend.recordKindRemoval);\n  try {\n    await closeRecordedAndDeleteLiveRows(ctx, row);\n    await Promise.all(buildEmbeddingTableCleanup(ctx, row));\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 * Closes recorded-time intervals for a hard-removed kind and deletes the live\n * rows in one transaction. Without the shared transaction, a crash after the\n * recorded close but before the live deletes leaves broad live reads able to see\n * rows whose kind the active schema has removed.\n *\n * Tolerates absent recorded relations exactly as `clear()` and\n * `refreshStatistics()` do: a history-enabled store whose recorded tables\n * predate recorded-time history (bring-your-own-pool, no DDL re-run) skips only\n * the close, then still deletes the live rows. A no-op close when\n * recorded-removal capture is off.\n */\nasync function closeRecordedAndDeleteLiveRows(\n  ctx: MaterializeOneContext,\n  row: KindRemovalRow,\n): Promise<void> {\n  const deleteStatements = buildRemovedKindLiveDeleteStatements(ctx, row);\n  if (!ctx.captureRecordedRemovals || ctx.recordedSchema === undefined) {\n    await executeDeleteStatements(ctx.backend, deleteStatements);\n    return;\n  }\n\n  const recordedSchema = ctx.recordedSchema;\n  try {\n    await ctx.backend.transaction(async (target) => {\n      await closeRecordedHardDeletedKind(\n        target,\n        recordedSchema,\n        ctx.graphId,\n        { entity: row.entity, kind: row.kindName },\n        false,\n      );\n      await executeDeleteStatements(target, deleteStatements);\n    });\n  } catch (error) {\n    if (!isMissingTableError(error)) throw error;\n    await executeDeleteStatements(ctx.backend, deleteStatements);\n  }\n}\n\nfunction buildRemovedKindLiveDeleteStatements(\n  ctx: MaterializeOneContext,\n  row: KindRemovalRow,\n): readonly string[] {\n  const graphLit = literal(ctx.graphId);\n  const kindLit = literal(row.kindName);\n  if (row.entity === \"node\") {\n    return [\n      `DELETE FROM ${quote(ctx.nodesTable)} WHERE graph_id = ${graphLit} AND kind = ${kindLit}`,\n      `DELETE FROM ${quote(ctx.edgesTable)} WHERE graph_id = ${graphLit} AND (from_kind = ${kindLit} OR to_kind = ${kindLit})`,\n      `DELETE FROM ${quote(ctx.fulltextTable)} WHERE graph_id = ${graphLit} AND node_kind = ${kindLit}`,\n      `DELETE FROM ${quote(ctx.uniquesTable)} WHERE graph_id = ${graphLit} AND node_kind = ${kindLit}`,\n    ];\n  }\n  return [\n    `DELETE FROM ${quote(ctx.edgesTable)} WHERE graph_id = ${graphLit} AND kind = ${kindLit}`,\n  ];\n}\n\nasync function executeDeleteStatements(\n  target: GraphBackend | TransactionBackend,\n  statements: readonly string[],\n): Promise<void> {\n  if (target.executeStatement !== undefined) {\n    await Promise.all(\n      statements.map((statement) =>\n        requireDefined(target.executeStatement)(\n          asCompiledStatementSql(sql.raw(statement)),\n        ),\n      ),\n    );\n    return;\n  }\n\n  if (target.executeDdl === undefined) {\n    throw new ConfigurationError(\n      \"store.materializeRemovals() requires a backend that can execute cleanup statements.\",\n      { code: \"MATERIALIZE_REMOVALS_BACKEND_UNSUPPORTED\" },\n    );\n  }\n  await Promise.all(\n    statements.map((statement) => requireDefined(target.executeDdl)(statement)),\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 = requireDefined(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(ctx.backend, 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  backend: GraphBackend,\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  // Forget the slot's durable contribution marker(s) in lockstep with the\n  // table drop (#135), so a later re-add of the same `(kind, field)` field\n  // re-creates the table instead of trusting an orphaned \"initialized\"\n  // marker. Runs even when the table was already absent — the marker can\n  // outlive the table. No-op on backends without the vector marker method.\n  await backend.deleteVectorSlotContribution?.(slot);\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(\n        backend,\n        vectorStrategy,\n        executeDdl,\n        field.slot,\n      );\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 * Edge Operations for Store\n *\n * Handles edge CRUD operations: create, update, delete.\n */\nimport {\n  createBackendOverlay,\n  type EdgeRow as BackendEdgeRow,\n  type GraphBackend,\n  type GraphReadBackend,\n  type InsertEdgeParams,\n  rowPropsToObject,\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  CardinalityError,\n  DatabaseOperationError,\n  EdgeNotFoundError,\n  EndpointNotFoundError,\n  KindNotFoundError,\n  ValidationError,\n} from \"../../errors\";\nimport { validateEdgeProps } from \"../../errors/validation\";\nimport { type SqlSchema } from \"../../query/compiler/schema\";\nimport { type KindRegistry } from \"../../registry/kind-registry\";\nimport { canonicalEqual } from \"../../schema/canonical\";\nimport { validateOptionalCanonicalIsoDate } from \"../../utils/date\";\nimport { generateId } from \"../../utils/id\";\nimport { requireDefined } from \"../../utils/presence\";\nimport { type UpsertDirtyCheck } from \"../collections/coalesce\";\nimport {\n  checkCardinalityConstraint,\n  type ConstraintContext,\n} from \"../constraints\";\nimport {\n  edgeInsertDispatch,\n  runInsertBatch,\n  runInsertBatchReturning,\n  runInsertNoReturn,\n} from \"../insert-dispatch\";\nimport { type EdgeRow, rowToEdge } from \"../row-mappers\";\nimport {\n  type CreateEdgeInput,\n  type Edge,\n  type GetOrCreateAction,\n  type IfExistsMode,\n  type OperationHookContext,\n} from \"../types\";\nimport {\n  runHookedWriteOperation,\n  runInWriteTransaction,\n} from \"./write-transaction\";\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  historyEnabled: boolean;\n  revisionTrackingEnabled: boolean;\n  revisionSchema: SqlSchema;\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  seedEndpointRow: (\n    graphId: string,\n    kind: string,\n    id: string,\n    row: Awaited<ReturnType<GraphBackend[\"getNode\"]>>,\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  // Lets batch preparation prime the endpoint cache from one getNodes\n  // round trip per (kind) instead of a per-edge getNode probe for each\n  // from/to endpoint — mirrors seedNodeRow in createNodeBatchValidationBackend.\n  // Seeding an absent result (`undefined`) is meaningful — it marks the key\n  // as known-missing so the per-edge check skips the backend read. An\n  // earlier lookup or seed always wins; seeding never overwrites.\n  function seedEndpointRow(\n    graphId: string,\n    kind: string,\n    id: string,\n    row: Awaited<ReturnType<GraphBackend[\"getNode\"]>>,\n  ): void {\n    const cacheKey = buildEdgeEndpointCacheKey(graphId, kind, id);\n    if (endpointCache.has(cacheKey)) return;\n    endpointCache.set(cacheKey, row);\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  const validationBackend = createBackendOverlay(backend, {\n    getNode: getNodeCached,\n    countEdgesFrom: countEdgesFromCached,\n    edgeExistsBetween: edgeExistsBetweenCached,\n  } satisfies Partial<GraphBackend | TransactionBackend>);\n\n  return {\n    backend: validationBackend,\n    registerPendingEdgeForCardinality,\n    seedEndpointRow,\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 runHookedWriteOperation(ctx, opContext, backend, async (target) => {\n    const prepared = await validateAndPrepareEdgeCreate(ctx, input, id, target);\n\n    let row: BackendEdgeRow | undefined;\n    if (shouldReturnRow) {\n      row = await target.insertEdge(prepared.insertParams);\n    } else {\n      await runInsertNoReturn(\n        edgeInsertDispatch(target),\n        prepared.insertParams,\n      );\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 * Batch-primes an edge batch's endpoint validation cache with one\n * `getNodes` round trip per distinct (kind) referenced across every\n * from/to endpoint in the batch, instead of a `getNode` probe per edge.\n * Mirrors `primeBatchValidationCaches`'s node-existence priming.\n */\nasync function primeEdgeBatchValidationCache<G extends GraphDef>(\n  ctx: EdgeOperationContext<G>,\n  inputs: readonly CreateEdgeInput[],\n  backend: GraphBackend | TransactionBackend,\n  seedEndpointRow: (\n    graphId: string,\n    kind: string,\n    id: string,\n    row: Awaited<ReturnType<GraphBackend[\"getNode\"]>>,\n  ) => void,\n): Promise<void> {\n  if (backend.getNodes === undefined) return;\n\n  const idsByKind = new Map<string, Set<string>>();\n  const addEndpoint = (kind: string, id: string): void => {\n    const ids = idsByKind.get(kind) ?? new Set<string>();\n    ids.add(id);\n    idsByKind.set(kind, ids);\n  };\n  for (const input of inputs) {\n    addEndpoint(input.fromKind, input.fromId);\n    addEndpoint(input.toKind, input.toId);\n  }\n\n  for (const [kind, ids] of idsByKind) {\n    const orderedIds = [...ids];\n    const rows = await backend.getNodes(ctx.graphId, kind, orderedIds);\n    const rowsById = new Map(rows.map((row) => [row.id, row]));\n    for (const id of orderedIds) {\n      seedEndpointRow(ctx.graphId, kind, id, rowsById.get(id));\n    }\n  }\n}\n\n/**\n * Shared batch preparation for edge creates: primes the endpoint\n * validation cache with one `getNodes` call per referenced kind, then\n * validates every input against the primed cache in order (so later\n * inputs see earlier ones' pending cardinality/uniqueness registrations).\n * Shared between the non-returning and RETURNING batch paths so both get\n * the same batched-prefetch treatment.\n */\nasync function prepareEdgeBatchCreates<G extends GraphDef>(\n  ctx: EdgeOperationContext<G>,\n  inputs: readonly CreateEdgeInput[],\n  backend: GraphBackend | TransactionBackend,\n): Promise<{\n  preparedCreates: EdgeCreatePrepared[];\n  batchInsertParams: InsertEdgeParams[];\n}> {\n  const {\n    backend: validationBackend,\n    registerPendingEdgeForCardinality,\n    seedEndpointRow,\n  } = createEdgeBatchValidationBackend(backend);\n\n  await primeEdgeBatchValidationCache(ctx, inputs, backend, seedEndpointRow);\n\n  const preparedCreates: EdgeCreatePrepared[] = [];\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  return { preparedCreates, batchInsertParams };\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  await runInWriteTransaction(ctx, backend, async (target) => {\n    const { batchInsertParams } = await prepareEdgeBatchCreates(\n      ctx,\n      inputs,\n      target,\n    );\n    await runInsertBatch(edgeInsertDispatch(target), batchInsertParams);\n  });\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  return runInWriteTransaction(ctx, backend, async (target) => {\n    const { batchInsertParams } = await prepareEdgeBatchCreates(\n      ctx,\n      inputs,\n      target,\n    );\n\n    const rows = await runInsertBatchReturning(\n      edgeInsertDispatch(target),\n      batchInsertParams,\n    );\n\n    return rows.map((row) => rowToEdge(row));\n  });\n}\n\n/**\n * The exact props an edge update would persist: the caller's partial input\n * merged over the current props and run through the edge kind's Zod schema.\n * Operates on PARSED props so the write path and the coalesce dirty-check\n * (which may compare against a batch-local running value, never a row) share\n * one validation. Endpoints are the edge's identity and are not part of an\n * upsert-by-id update, so only props are involved.\n */\nfunction computeEdgeUpdate<G extends GraphDef>(\n  ctx: EdgeOperationContext<G>,\n  kind: string,\n  id: string,\n  existingProps: Record<string, unknown>,\n  inputProps: Partial<Record<string, unknown>>,\n): Record<string, unknown> {\n  const registration = getEdgeRegistration(ctx.graph, kind);\n  return validateEdgeProps(\n    registration.type.schema,\n    { ...existingProps, ...inputProps },\n    { kind, operation: \"update\", id },\n  );\n}\n\n/**\n * Row-based wrapper over {@link computeEdgeUpdate} for the write path.\n */\nfunction resolveEdgeUpdateProps<G extends GraphDef>(\n  ctx: EdgeOperationContext<G>,\n  existing: Pick<EdgeRow, \"kind\" | \"id\" | \"props\">,\n  inputProps: Partial<Record<string, unknown>>,\n): Readonly<{\n  existingProps: Record<string, unknown>;\n  validatedProps: Record<string, unknown>;\n}> {\n  const existingProps = rowPropsToObject(existing.props);\n  const validatedProps = computeEdgeUpdate(\n    ctx,\n    existing.kind,\n    existing.id,\n    existingProps,\n    inputProps,\n  );\n  return { existingProps, validatedProps };\n}\n\n/**\n * The edge coalesce dirty-check: returns the props an upsert would persist and\n * whether they equal `existingProps`. `existingProps` is the PARSED current\n * props — the edge's, or the batch-local running value for a repeated id.\n */\nexport function edgeUpsertDirtyCheck<G extends GraphDef>(\n  ctx: EdgeOperationContext<G>,\n  kind: string,\n  id: string,\n  existingProps: Record<string, unknown>,\n  inputProps: Record<string, unknown>,\n): UpsertDirtyCheck {\n  const validatedProps = computeEdgeUpdate(\n    ctx,\n    kind,\n    id,\n    existingProps,\n    inputProps,\n  );\n  return {\n    validatedProps,\n    unchanged: canonicalEqual(validatedProps, existingProps),\n  };\n}\n\n/**\n * Shared edge-update body: re-reads the edge inside the transaction, merges\n * and validates props, and writes. A plain update requires a live edge; a\n * resurrecting upsert (`clearDeleted`) may target a tombstoned one.\n */\nasync function performEdgeUpdate<G extends GraphDef>(\n  ctx: EdgeOperationContext<G>,\n  input: {\n    id: string;\n    props: Partial<Record<string, unknown>>;\n    validTo?: string;\n  },\n  target: GraphBackend | TransactionBackend,\n  options?: Readonly<{ clearDeleted?: boolean }>,\n): Promise<Edge> {\n  const id = input.id;\n\n  const existing = await target.getEdge(ctx.graphId, id);\n  if (!existing || (!options?.clearDeleted && existing.deleted_at)) {\n    throw new EdgeNotFoundError(\"unknown\", id);\n  }\n\n  const { validatedProps } = resolveEdgeUpdateProps(ctx, existing, input.props);\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 target.updateEdge(updateParams);\n\n  return 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  // Read outside the transaction: the hook context needs the edge kind, and\n  // hooks must WRAP the transaction (matching node operations and edge\n  // create) so onOperationEnd reports success only after COMMIT — a hook\n  // that fires inside the transaction would report success for a write that\n  // a failed commit then rolls back. An absent edge also never opens an empty\n  // transaction. The body re-reads inside the transaction, so a concurrent\n  // delete between this gate and the write lock is still handled correctly.\n  const gate = await backend.getEdge(ctx.graphId, id);\n  if (!gate || gate.deleted_at) {\n    throw new EdgeNotFoundError(\"unknown\", id);\n  }\n\n  const opContext = ctx.createOperationContext(\"update\", \"edge\", gate.kind, id);\n\n  return runHookedWriteOperation(ctx, opContext, backend, (target) =>\n    performEdgeUpdate(ctx, input, target),\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  return runInWriteTransaction(ctx, backend, (target) =>\n    performEdgeUpdate(ctx, input, target, options),\n  );\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  // Gate outside the transaction so an absent/tombstoned edge never opens an\n  // empty one; the gate row also supplies the kind for the hook context,\n  // because hooks must WRAP the transaction (matching node operations and\n  // edge create) so onOperationEnd reports success only after COMMIT.\n  const gate = await backend.getEdge(ctx.graphId, id);\n  if (!gate || gate.deleted_at) return;\n\n  const opContext = ctx.createOperationContext(\"delete\", \"edge\", gate.kind, id);\n\n  return runHookedWriteOperation(ctx, opContext, backend, async (target) => {\n    // No in-transaction preflight: the tombstone UPDATE is guarded by\n    // `deleted_at IS NULL`, so a concurrent delete between the gate and\n    // the write lock is a 0-row no-op — the statement itself is the\n    // concurrency-correct check, and nothing here consumes the row.\n    await target.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  // Gate outside the transaction so an absent edge never opens an empty one;\n  // hooks wrap the transaction (see executeEdgeDelete).\n  const gate = await backend.getEdge(ctx.graphId, id);\n  if (!gate) return;\n\n  const opContext = ctx.createOperationContext(\"delete\", \"edge\", gate.kind, id);\n\n  return runHookedWriteOperation(ctx, opContext, backend, async (target) => {\n    // No in-transaction preflight: DELETE by primary key is idempotent\n    // (0 rows when concurrently removed) and nothing here consumes the\n    // row.\n    await target.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 = rowPropsToObject(row.props);\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: GraphReadBackend,\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(requireDefined(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  // Probe outside the transaction: with ifExists \"return\", the common found\n  // path performs no write, so it must not pay for a write transaction\n  // (BEGIN IMMEDIATE on SQLite, the per-graph advisory lock under history).\n  // The transactional body re-queries, so a concurrent create between this\n  // probe and the write lock is still handled correctly.\n  if (ifExists === \"return\") {\n    const probeRows = 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    const { liveRow: probedLiveRow } = findMatchingEdge(\n      probeRows,\n      matchOn,\n      validatedProps,\n    );\n    if (probedLiveRow !== undefined) {\n      return { edge: rowToEdge(probedLiveRow), action: \"found\" };\n    }\n  }\n\n  // No enclosing transaction: each write leg opens its own (hooked, for the\n  // create leg) transaction. An outer transaction here would make the nested\n  // operation run directly inside it and fire its success hooks before THIS\n  // wrapper's COMMIT — the durability contract hooks promise would be false.\n  // A concurrent create that wins between the lookup and the write surfaces\n  // as a cardinality conflict and is converged by one retry of the lookup.\n  async function attempt(): Promise<\n    Readonly<{ edge: Edge; action: GetOrCreateAction }>\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  try {\n    return await attempt();\n  } catch (error) {\n    if (!(error instanceof CardinalityError)) throw error;\n    return attempt();\n  }\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\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. Shared by the\n  // outside-transaction probe (reading the root backend) and the\n  // transactional body (re-reading through the transaction target).\n  async function fetchRowsByEndpoint(\n    reader: GraphReadBackend,\n  ): Promise<ReadonlyMap<string, readonly BackendEdgeRow[]>> {\n    const rowsByEndpoint = new Map<string, readonly BackendEdgeRow[]>();\n    for (const [endpointKey, endpoint] of uniqueEndpoints) {\n      const rows = await reader.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    return rowsByEndpoint;\n  }\n\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  interface DuplicateEntry {\n    index: number;\n    sourceIndex: number;\n  }\n  interface Result {\n    readonly edge: Edge;\n    readonly action: GetOrCreateAction;\n  }\n\n  // Step 3: Partition into toCreate, toFetch, and duplicates\n  function partitionEntries(\n    rowsByEndpoint: ReadonlyMap<string, readonly BackendEdgeRow[]>,\n  ): Readonly<{\n    toCreate: CreateEntry[];\n    toFetch: FetchEntry[];\n    duplicateOf: DuplicateEntry[];\n  }> {\n    const toCreate: CreateEntry[] = [];\n    const toFetch: FetchEntry[] = [];\n    const duplicateOf: DuplicateEntry[] = [];\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    return { toCreate, toFetch, duplicateOf };\n  }\n\n  // Probe outside the transaction: with ifExists \"return\" and every entry\n  // matching a live edge, the whole call performs no write, so it must not\n  // pay for a write transaction (BEGIN IMMEDIATE on SQLite, the per-graph\n  // advisory lock under history). The transactional body re-queries, so a\n  // concurrent write between this probe and the write lock is still handled\n  // correctly.\n  if (ifExists === \"return\") {\n    const probe = partitionEntries(await fetchRowsByEndpoint(backend));\n    const allFoundLive =\n      probe.toCreate.length === 0 &&\n      probe.toFetch.every((entry) => !entry.isDeleted);\n    if (allFoundLive) {\n      const found: Result[] = Array.from({ length: items.length });\n      for (const entry of probe.toFetch) {\n        found[entry.index] = { edge: rowToEdge(entry.row), action: \"found\" };\n      }\n      for (const { index, sourceIndex } of probe.duplicateOf) {\n        found[index] = {\n          edge: requireDefined(found[sourceIndex]).edge,\n          action: \"found\",\n        };\n      }\n      return found;\n    }\n  }\n\n  return runInWriteTransaction(ctx, backend, async (target) => {\n    const { toCreate, toFetch, duplicateOf } = partitionEntries(\n      await fetchRowsByEndpoint(target),\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        target,\n      );\n      for (const [batchIndex, entry] of toCreate.entries()) {\n        results[entry.index] = {\n          edge: requireDefined(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: target,\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          target,\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          target,\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 = requireDefined(results[sourceIndex]);\n      results[index] = { edge: sourceResult.edge, action: \"found\" };\n    }\n\n    return results;\n  });\n}\n","import { createGraphBackendProjection } from \"../backend/graph-backend-projection\";\nimport {\n  createBackendOverlay,\n  type EdgeRow,\n  type GraphBackend,\n  type NodeRow,\n} from \"../backend/types\";\nimport { type ReadCoordinate } from \"../core/temporal\";\nimport {\n  type AnyEdgeType,\n  type EdgeId,\n  type NodeId,\n  type NodeType,\n} from \"../core/types\";\nimport { ConfigurationError, ValidationError } from \"../errors\";\nimport { sqlValueList } from \"../query/compiler/predicate-utils\";\nimport {\n  type RecordedReadBinding,\n  recordedReadSqlSchema,\n  requireRecordedReadBinding,\n} from \"../query/compiler/schema\";\nimport {\n  compileTemporalFilter,\n  currentReadInstant,\n} from \"../query/compiler/temporal\";\nimport { decodeCursor, encodeCursor } from \"../query/cursor\";\nimport { sql, type SqlFragment } from \"../query/sql-fragment\";\nimport { asCompiledRowsSql, type CompiledRowsSql } from \"../query/sql-intent\";\nimport { chunk } from \"../utils/array\";\nimport { requireDefined } from \"../utils/presence\";\nimport { withRecordedRelationsPrecondition } from \"../utils/sql-errors\";\nimport { recordedBindParamBudget } from \"./recorded-capture/relations\";\nimport { rowToEdge, rowToNode } from \"./row-mappers\";\nimport {\n  type Edge,\n  type Node,\n  type RecordedScanOptions,\n  type RecordedScanPage,\n} from \"./types\";\n\nconst RECORDED_POINT_READ_FIXED_BIND_PARAMS = 8;\nconst RECORDED_SCAN_LIMIT = 1000;\n\ntype RecordedReadServiceParams = Readonly<{\n  graphId: string;\n  backend: GraphBackend;\n  recordedReadBinding: RecordedReadBinding | undefined;\n  mapRecordedNodeRow: (row: Record<string, unknown>) => NodeRow;\n  mapRecordedEdgeRow: (row: Record<string, unknown>) => EdgeRow;\n}>;\n\ntype RecordedGetByIdsParams<T extends Readonly<{ id: string }>> = Readonly<{\n  entity: \"node\" | \"edge\";\n  table: SqlFragment;\n  alias: string;\n  kind: string;\n  ids: readonly string[];\n  coordinate: ReadCoordinate;\n  toEntity: (row: Record<string, unknown>) => T;\n}>;\n\ntype RecordedScanParams<T extends Readonly<{ id: string }>> = Readonly<{\n  entity: \"node\" | \"edge\";\n  table: SqlFragment;\n  alias: string;\n  kind: string;\n  coordinate: ReadCoordinate;\n  options: RecordedScanOptions | undefined;\n  toEntity: (row: Record<string, unknown>) => T;\n}>;\n\nexport type RecordedReadService = Readonly<{\n  backendForCoordinate: (\n    coordinate: ReadCoordinate,\n    surface: string,\n  ) => GraphBackend;\n  nodeGetById: <N extends NodeType>(\n    kind: string,\n    id: NodeId<N>,\n    coordinate: ReadCoordinate,\n  ) => Promise<Node<N> | undefined>;\n  nodeGetByIds: <N extends NodeType>(\n    kind: string,\n    ids: readonly NodeId<N>[],\n    coordinate: ReadCoordinate,\n  ) => Promise<readonly (Node<N> | undefined)[]>;\n  nodeScan: <N extends NodeType>(\n    kind: string,\n    coordinate: ReadCoordinate,\n    options?: RecordedScanOptions,\n  ) => Promise<RecordedScanPage<Node<N>>>;\n  edgeGetById: <E extends AnyEdgeType>(\n    kind: string,\n    id: EdgeId<E>,\n    coordinate: ReadCoordinate,\n  ) => Promise<Edge<E> | undefined>;\n  edgeGetByIds: <E extends AnyEdgeType>(\n    kind: string,\n    ids: readonly EdgeId<E>[],\n    coordinate: ReadCoordinate,\n  ) => Promise<readonly (Edge<E> | undefined)[]>;\n  edgeScan: <E extends AnyEdgeType>(\n    kind: string,\n    coordinate: ReadCoordinate,\n    options?: RecordedScanOptions,\n  ) => Promise<RecordedScanPage<Edge<E>>>;\n}>;\n\n/**\n * Per-chunk id count for a recorded point read: the backend's real\n * bound-parameter ceiling less the statement's fixed binds, so Postgres point\n * reads page thousands of ids per round-trip instead of a dialect-blind 900.\n */\nfunction recordedPointReadIdChunk(backend: GraphBackend): number {\n  const budget = recordedBindParamBudget(backend);\n  return Math.max(1, budget - RECORDED_POINT_READ_FIXED_BIND_PARAMS);\n}\n\nfunction recordedRelationErrorDetails(\n  backend: Pick<GraphBackend, \"dialect\">,\n  surface: string,\n): Readonly<{ dialect: GraphBackend[\"dialect\"]; surface: string }> {\n  return { dialect: backend.dialect, surface };\n}\n\nfunction withRelationsPrecondition<T>(\n  backend: Pick<GraphBackend, \"dialect\">,\n  promise: Promise<T>,\n  surface: string,\n): Promise<T> {\n  return withRecordedRelationsPrecondition(\n    promise,\n    recordedRelationErrorDetails(backend, surface),\n  );\n}\n\nfunction createRecordedReadBackend(\n  backend: GraphBackend,\n  surface: string,\n): GraphBackend {\n  // A public AdapterStore backend is frozen. Decorate a fresh allowlist\n  // projection so Proxy invariants do not prevent the execute guards from\n  // replacing non-configurable function properties.\n  const projectedBackend = createGraphBackendProjection(backend);\n  return createBackendOverlay(projectedBackend, {\n    execute: <T>(query: CompiledRowsSql): Promise<readonly T[]> =>\n      withRelationsPrecondition(backend, backend.execute<T>(query), surface),\n    ...(backend.executeRaw === undefined ?\n      {}\n    : {\n        executeRaw: <T>(\n          sqlText: string,\n          params: readonly unknown[],\n        ): Promise<readonly T[]> =>\n          withRelationsPrecondition(\n            backend,\n            requireDefined(backend.executeRaw)<T>(sqlText, params),\n            surface,\n          ),\n      }),\n  });\n}\n\nfunction recordedTemporalFilter(\n  backend: GraphBackend,\n  coordinate: ReadCoordinate,\n  tableAlias: string,\n): SqlFragment {\n  const recordedAsOf = coordinate.recorded?.asOf;\n  if (recordedAsOf === undefined) {\n    throw new ConfigurationError(\n      \"Recorded point reads require a recorded-time coordinate.\",\n      { code: \"RECORDED_POINT_READ_MISSING_COORDINATE\" },\n    );\n  }\n  return compileTemporalFilter({\n    mode: coordinate.valid.mode,\n    asOf: coordinate.valid.asOf,\n    recordedAsOf,\n    tableAlias,\n    currentTimestamp: currentReadInstant(),\n  });\n}\n\nfunction recordedRelationInvariantError(\n  params: Readonly<{\n    graphId: string;\n    entity: \"node\" | \"edge\";\n    kind: string;\n    id: string;\n    coordinate: ReadCoordinate;\n  }>,\n): ConfigurationError {\n  return new ConfigurationError(\n    \"Recorded relation invariant violation: more than one recorded row matched the requested read.\",\n    {\n      code: \"RECORDED_RELATION_INVARIANT_VIOLATION\",\n      graphId: params.graphId,\n      entity: params.entity,\n      kind: params.kind,\n      id: params.id,\n      validMode: params.coordinate.valid.mode,\n      validAsOf: params.coordinate.valid.asOf,\n      recordedAsOf: params.coordinate.recorded?.asOf,\n    },\n    {\n      suggestion:\n        \"Repair overlapping recorded_from/recorded_to intervals for this entity before using recorded-time reads.\",\n    },\n  );\n}\n\nfunction validateRecordedScanLimit(limit: number | undefined): number {\n  if (limit === undefined) return RECORDED_SCAN_LIMIT;\n  if (!Number.isInteger(limit) || limit <= 0 || limit > RECORDED_SCAN_LIMIT) {\n    throw new ValidationError(\n      `Recorded scan limit must be an integer between 1 and ${RECORDED_SCAN_LIMIT}, got: ${String(limit)}`,\n      {\n        issues: [\n          {\n            path: \"limit\",\n            message: `Must be an integer between 1 and ${RECORDED_SCAN_LIMIT}.`,\n          },\n        ],\n      },\n    );\n  }\n  return limit;\n}\n\nfunction recordedScanCursorScope(\n  graphId: string,\n  entity: \"node\" | \"edge\",\n  kind: string,\n  coordinate: ReadCoordinate,\n): string {\n  return JSON.stringify([\n    \"recorded-scan\",\n    graphId,\n    entity,\n    kind,\n    coordinate.valid.mode,\n    coordinate.valid.asOf,\n    coordinate.recorded?.asOf,\n  ]);\n}\n\nfunction invalidRecordedScanCursor(): ValidationError {\n  return new ValidationError(\n    \"Recorded scan cursor does not match this graph, collection, or temporal coordinate.\",\n    {\n      issues: [\n        {\n          path: \"after\",\n          message:\n            \"Use a cursor returned by the same recorded collection scan.\",\n        },\n      ],\n    },\n  );\n}\n\nfunction decodeRecordedScanCursor(\n  cursor: string,\n  expectedScope: string,\n): string {\n  const decoded = decodeCursor(cursor);\n  if (\n    decoded.d !== \"f\" ||\n    decoded.cols.length !== 1 ||\n    decoded.cols[0] !== expectedScope ||\n    decoded.vals.length !== 1 ||\n    typeof decoded.vals[0] !== \"string\"\n  ) {\n    throw invalidRecordedScanCursor();\n  }\n  return decoded.vals[0];\n}\n\nfunction encodeRecordedScanCursor(id: string, scope: string): string {\n  return encodeCursor({ v: 1, d: \"f\", vals: [id], cols: [scope] });\n}\n\nexport function createRecordedReadService(\n  params: RecordedReadServiceParams,\n): RecordedReadService {\n  const {\n    graphId,\n    backend,\n    recordedReadBinding,\n    mapRecordedNodeRow,\n    mapRecordedEdgeRow,\n  } = params;\n  const recordedSchema =\n    recordedReadBinding === undefined ? undefined : (\n      recordedReadSqlSchema(recordedReadBinding)\n    );\n\n  function schemaForRecordedRead(surface: string) {\n    return (\n      recordedSchema ??\n      recordedReadSqlSchema(\n        requireRecordedReadBinding(recordedReadBinding, surface),\n      )\n    );\n  }\n\n  async function recordedGetByIds<T extends Readonly<{ id: string }>>(\n    read: RecordedGetByIdsParams<T>,\n  ): Promise<readonly (T | undefined)[]> {\n    const { table, alias, kind, ids, coordinate, toEntity, entity } = read;\n    if (ids.length === 0) return [];\n\n    const uniqueIds = [...new Set(ids)];\n    const aliasSql = sql.raw(alias);\n    const temporalFilter = recordedTemporalFilter(backend, coordinate, alias);\n    const chunkResults = await withRelationsPrecondition(\n      backend,\n      Promise.all(\n        chunk(uniqueIds, recordedPointReadIdChunk(backend)).map((idChunk) =>\n          backend.execute<Record<string, unknown>>(\n            asCompiledRowsSql(sql`\n              SELECT * FROM ${table} ${aliasSql}\n              WHERE ${aliasSql}.graph_id = ${graphId}\n                AND ${aliasSql}.kind = ${kind}\n                AND ${aliasSql}.id IN (${sqlValueList(idChunk)})\n                AND ${temporalFilter}\n              ORDER BY ${aliasSql}.recorded_from\n            `),\n          ),\n        ),\n      ),\n      \"recorded-point-read\",\n    );\n\n    const byId = new Map<string, T>();\n    for (const rows of chunkResults) {\n      for (const row of rows) {\n        const entityRow = toEntity(row);\n        if (byId.has(entityRow.id)) {\n          throw recordedRelationInvariantError({\n            graphId,\n            entity,\n            kind,\n            id: entityRow.id,\n            coordinate,\n          });\n        }\n        byId.set(entityRow.id, entityRow);\n      }\n    }\n    return ids.map((id) => byId.get(id));\n  }\n\n  async function recordedScan<T extends Readonly<{ id: string }>>(\n    scan: RecordedScanParams<T>,\n  ): Promise<RecordedScanPage<T>> {\n    const { table, alias, kind, coordinate, options, toEntity, entity } = scan;\n    const limit = validateRecordedScanLimit(options?.limit);\n    const scope = recordedScanCursorScope(graphId, entity, kind, coordinate);\n    const after =\n      options?.after === undefined ?\n        undefined\n      : decodeRecordedScanCursor(options.after, scope);\n    const aliasSql = sql.raw(alias);\n    const temporalFilter = recordedTemporalFilter(backend, coordinate, alias);\n    const rows = await withRelationsPrecondition(\n      backend,\n      backend.execute<Record<string, unknown>>(\n        asCompiledRowsSql(sql`\n          SELECT * FROM ${table} ${aliasSql}\n          WHERE ${aliasSql}.graph_id = ${graphId}\n            AND ${aliasSql}.kind = ${kind}\n            ${after === undefined ? sql.raw(\"\") : sql`AND ${aliasSql}.id > ${after}`}\n            AND ${temporalFilter}\n          ORDER BY ${aliasSql}.id ASC, ${aliasSql}.recorded_from ASC\n          LIMIT ${limit + 1}\n        `),\n      ),\n      \"recorded-scan\",\n    );\n    const entities = rows.map((row) => toEntity(row));\n    for (let index = 1; index < entities.length; index += 1) {\n      const previous = requireDefined(entities[index - 1]);\n      const current = requireDefined(entities[index]);\n      if (previous.id !== current.id) continue;\n      throw recordedRelationInvariantError({\n        graphId,\n        entity,\n        kind,\n        id: current.id,\n        coordinate,\n      });\n    }\n\n    const hasNextPage = entities.length > limit;\n    const data = hasNextPage ? entities.slice(0, limit) : entities;\n    return {\n      data,\n      nextCursor:\n        hasNextPage ?\n          encodeRecordedScanCursor(requireDefined(data.at(-1)).id, scope)\n        : undefined,\n      hasNextPage,\n    };\n  }\n\n  function nodeGetByIds<N extends NodeType>(\n    kind: string,\n    ids: readonly NodeId<N>[],\n    coordinate: ReadCoordinate,\n  ): Promise<readonly (Node<N> | undefined)[]> {\n    const schema = schemaForRecordedRead(\"recorded-point-read\");\n    return recordedGetByIds({\n      entity: \"node\",\n      table: schema.nodesTable,\n      alias: \"n\",\n      kind,\n      ids,\n      coordinate,\n      toEntity: (row) => rowToNode(mapRecordedNodeRow(row)) as Node<N>,\n    });\n  }\n\n  function edgeGetByIds<E extends AnyEdgeType>(\n    kind: string,\n    ids: readonly EdgeId<E>[],\n    coordinate: ReadCoordinate,\n  ): Promise<readonly (Edge<E> | undefined)[]> {\n    const schema = schemaForRecordedRead(\"recorded-point-read\");\n    return recordedGetByIds({\n      entity: \"edge\",\n      table: schema.edgesTable,\n      alias: \"e\",\n      kind,\n      ids,\n      coordinate,\n      toEntity: (row) => rowToEdge(mapRecordedEdgeRow(row)) as Edge<E>,\n    });\n  }\n\n  function nodeScan<N extends NodeType>(\n    kind: string,\n    coordinate: ReadCoordinate,\n    options?: RecordedScanOptions,\n  ): Promise<RecordedScanPage<Node<N>>> {\n    const schema = schemaForRecordedRead(\"recorded-scan\");\n    return recordedScan({\n      entity: \"node\",\n      table: schema.nodesTable,\n      alias: \"n\",\n      kind,\n      coordinate,\n      options,\n      toEntity: (row) => rowToNode(mapRecordedNodeRow(row)) as Node<N>,\n    });\n  }\n\n  function edgeScan<E extends AnyEdgeType>(\n    kind: string,\n    coordinate: ReadCoordinate,\n    options?: RecordedScanOptions,\n  ): Promise<RecordedScanPage<Edge<E>>> {\n    const schema = schemaForRecordedRead(\"recorded-scan\");\n    return recordedScan({\n      entity: \"edge\",\n      table: schema.edgesTable,\n      alias: \"e\",\n      kind,\n      coordinate,\n      options,\n      toEntity: (row) => rowToEdge(mapRecordedEdgeRow(row)) as Edge<E>,\n    });\n  }\n\n  return {\n    backendForCoordinate(\n      coordinate: ReadCoordinate,\n      surface: string,\n    ): GraphBackend {\n      if (coordinate.recorded === undefined) return backend;\n      requireRecordedReadBinding(recordedReadBinding, surface);\n      return createRecordedReadBackend(backend, surface);\n    },\n\n    async nodeGetById<N extends NodeType>(\n      kind: string,\n      id: NodeId<N>,\n      coordinate: ReadCoordinate,\n    ): Promise<Node<N> | undefined> {\n      const results = await nodeGetByIds(kind, [id], coordinate);\n      return results[0];\n    },\n\n    nodeGetByIds,\n    nodeScan,\n\n    async edgeGetById<E extends AnyEdgeType>(\n      kind: string,\n      id: EdgeId<E>,\n      coordinate: ReadCoordinate,\n    ): Promise<Edge<E> | undefined> {\n      const results = await edgeGetByIds(kind, [id], coordinate);\n      return results[0];\n    },\n\n    edgeGetByIds,\n    edgeScan,\n  };\n}\n","import { type GraphDef } from \"../core/define-graph\";\nimport { type AnyEdgeType, type NodeType } from \"../core/types\";\nimport { ConfigurationError } from \"../errors\";\nimport { type Assert, type Equal } from \"../utils/type-assert\";\nimport { EDGE_WRITE_NAMES, NODE_WRITE_NAMES } from \"./collection-surface\";\nimport type {\n  EdgeWrites,\n  GraphEdgeCollections,\n  GraphNodeCollections,\n  NodeWrites,\n  TransactionReceipt,\n} from \"./types\";\n\ntype NodeWriteMethodName = (typeof NODE_WRITE_NAMES)[number];\ntype EdgeWriteMethodName = (typeof EDGE_WRITE_NAMES)[number];\n\n// If these fail, the receipt wrapper drifted away from the collection write\n// surface that defines NodeWrites / EdgeWrites.\n// eslint-disable-next-line @typescript-eslint/no-unused-vars -- compile-time assertion\ntype _receiptNodeSurfaceIsComplete = Assert<\n  Equal<NodeWriteMethodName, keyof NodeWrites<NodeType, string>>\n>;\n// eslint-disable-next-line @typescript-eslint/no-unused-vars -- compile-time assertion\ntype _receiptEdgeSurfaceIsComplete = Assert<\n  Equal<EdgeWriteMethodName, keyof EdgeWrites<AnyEdgeType, NodeType, NodeType>>\n>;\n\nexport type TransactionReceiptRecorder = Readonly<{\n  recordNode: (kind: string, count: number) => void;\n  recordEdge: (kind: string, count: number) => void;\n  snapshot: (recorded?: TransactionReceipt[\"recorded\"]) => TransactionReceipt;\n  /**\n   * Seals the recorder: every subsequent write through a collection wrapped with\n   * it (see {@link wrapTransactionCollections}) throws. Used to fail loud when a\n   * transaction context is retained and written through *after* its callback\n   * returned — where the receipt is already snapshotted and the write would\n   * otherwise persist uncounted.\n   */\n  seal: () => void;\n  /**\n   * Throws {@link ConfigurationError} once {@link seal} has been called. Invoked\n   * at the top of every wrapped write method, before the live write runs, so a\n   * post-seal write never reaches the backend.\n   */\n  assertWritable: () => void;\n}>;\n\ntype WrappedMethod = (...args: unknown[]) => Promise<unknown>;\n\ntype WriteIntentCounter = (args: readonly unknown[]) => number;\n\nfunction inputLength(value: unknown): number {\n  return Array.isArray(value) ? value.length : 0;\n}\n\nfunction countSingleWrite(): number {\n  return 1;\n}\n\nfunction countBulkInputAt(index: number): WriteIntentCounter {\n  return (args) => inputLength(args[index]);\n}\n\n// `satisfies Record<...MethodName, ...>` forces a per-method decision: a new\n// write method fails to compile here until its intent count is chosen, so a\n// future bulk method cannot silently fall back to counting 1 per call.\nconst NODE_WRITE_INTENT_COUNTERS = {\n  create: countSingleWrite,\n  createFromRecord: countSingleWrite,\n  update: countSingleWrite,\n  delete: countSingleWrite,\n  hardDelete: countSingleWrite,\n  upsertById: countSingleWrite,\n  upsertByIdFromRecord: countSingleWrite,\n  bulkCreate: countBulkInputAt(0),\n  bulkUpsertById: countBulkInputAt(0),\n  bulkInsert: countBulkInputAt(0),\n  bulkDelete: countBulkInputAt(0),\n  getOrCreateByConstraint: countSingleWrite,\n  bulkGetOrCreateByConstraint: countBulkInputAt(1),\n} as const satisfies Record<NodeWriteMethodName, WriteIntentCounter>;\n\nconst EDGE_WRITE_INTENT_COUNTERS = {\n  create: countSingleWrite,\n  update: countSingleWrite,\n  delete: countSingleWrite,\n  hardDelete: countSingleWrite,\n  bulkCreate: countBulkInputAt(0),\n  bulkUpsertById: countBulkInputAt(0),\n  bulkInsert: countBulkInputAt(0),\n  bulkDelete: countBulkInputAt(0),\n  getOrCreateByEndpoints: countSingleWrite,\n  bulkGetOrCreateByEndpoints: countBulkInputAt(0),\n} as const satisfies Record<EdgeWriteMethodName, WriteIntentCounter>;\n\n// Null-prototype buckets: kind names are arbitrary identifiers, so\n// `constructor`, `toString`, or `__proto__` are valid kinds. On a plain `{}`\n// they would read inherited Object.prototype members (corrupting the count)\n// or trigger the `__proto__` setter (dropping it).\nfunction createCountBucket(): Record<string, number> {\n  return Object.create(null) as Record<string, number>;\n}\n\nfunction increment(\n  counts: Record<string, number>,\n  kind: string,\n  count: number,\n): void {\n  if (count === 0) return;\n  counts[kind] = (counts[kind] ?? 0) + count;\n}\n\n/**\n * One receipt's running counts. Each recorder owns exactly one: the outer\n * transaction's receipt, or the sub-receipt of one `tx.measure` scope. Scope\n * attribution is structural — a scope is a *second* recorder wrapping the outer\n * collections again (see `attachMeasure` in store.ts) — so no recorder ever\n * needs to know about another's scopes.\n */\ninterface WriteCounters {\n  readonly nodes: Record<string, number>;\n  readonly edges: Record<string, number>;\n  total: number;\n}\n\nexport function createTransactionReceiptRecorder(): TransactionReceiptRecorder {\n  const counters: WriteCounters = {\n    nodes: createCountBucket(),\n    edges: createCountBucket(),\n    total: 0,\n  };\n  let sealed = false;\n\n  return {\n    recordNode(kind, count): void {\n      increment(counters.nodes, kind, count);\n      counters.total += count;\n    },\n\n    recordEdge(kind, count): void {\n      increment(counters.edges, kind, count);\n      counters.total += count;\n    },\n\n    snapshot(recorded): TransactionReceipt {\n      // Object.assign onto a fresh null-prototype bucket (rather than spread)\n      // keeps prototype-colliding kind names readable on the returned receipt.\n      return Object.freeze({\n        writes: Object.freeze({\n          nodes: Object.freeze(\n            Object.assign(createCountBucket(), counters.nodes),\n          ),\n          edges: Object.freeze(\n            Object.assign(createCountBucket(), counters.edges),\n          ),\n          total: counters.total,\n        }),\n        ...(recorded === undefined ? {} : { recorded }),\n      });\n    },\n\n    seal(): void {\n      sealed = true;\n    },\n\n    assertWritable(): void {\n      if (sealed) {\n        throw new ConfigurationError(\n          \"Transaction context is sealed: a write happened through the receipt-tracked collections after the transaction callback returned.\",\n          {},\n          {\n            suggestion:\n              \"Perform all writes inside the transactionWithReceipt / withRecordedTransaction callback; do not reuse the transaction context after it returns.\",\n          },\n        );\n      }\n    },\n  };\n}\n\nfunction isWrappedMethod(value: unknown): value is WrappedMethod {\n  return typeof value === \"function\";\n}\n\nfunction isObject(value: unknown): value is object {\n  return typeof value === \"object\" && Boolean(value);\n}\n\n/**\n * Which methods on a node/edge collection count as writes, and how each\n * counts its intent. Bundled into one value per entity kind (below) rather\n * than passed as separate `methodNames`/`counters` parameters, so a call\n * site can only pick \"the node surface\" or \"the edge surface\" as a unit —\n * it cannot independently mismatch a method-name set against the wrong\n * counter table.\n */\ntype WriteIntentSurface<M extends string> = Readonly<{\n  methodNames: ReadonlySet<string>;\n  counters: Record<M, WriteIntentCounter>;\n}>;\n\nconst NODE_WRITE_SURFACE: WriteIntentSurface<NodeWriteMethodName> = {\n  methodNames: new Set(NODE_WRITE_NAMES),\n  counters: NODE_WRITE_INTENT_COUNTERS,\n};\n\nconst EDGE_WRITE_SURFACE: WriteIntentSurface<EdgeWriteMethodName> = {\n  methodNames: new Set(EDGE_WRITE_NAMES),\n  counters: EDGE_WRITE_INTENT_COUNTERS,\n};\n\n/**\n * Proxies `target`, memoizing the wrapped value for each string-keyed\n * property after first access. `shouldWrap` gates which properties run\n * through `wrap`; everything else (including symbol keys) passes through\n * via `Reflect.get` untouched. Shared by `wrapWriteCollection` (wraps write\n * methods on one collection) and `wrapCollections` (wraps every collection\n * in a kind-keyed map) — both are \"lazily transform and cache one property\n * of an object\" with a different `shouldWrap`/`wrap` pair.\n */\nfunction memoizedProxyGet<T extends object>(\n  target: T,\n  shouldWrap: (property: string) => boolean,\n  wrap: (value: unknown, property: string) => unknown,\n): T {\n  const cache = new Map<string, unknown>();\n\n  return new Proxy(target, {\n    get(proxyTarget, property, receiver) {\n      if (typeof property !== \"string\" || !shouldWrap(property)) {\n        return Reflect.get(proxyTarget, property, receiver);\n      }\n\n      const cached = cache.get(property);\n      if (cached !== undefined) return cached;\n\n      const value = Reflect.get(proxyTarget, property, receiver);\n      const wrapped = wrap(value, property);\n      cache.set(property, wrapped);\n      return wrapped;\n    },\n  });\n}\n\n/**\n * Wraps one node/edge collection so every write method on it (per\n * `surface.methodNames`) fails loud once the recorder is sealed, then counts\n * its intent through `record` on resolution.\n */\nfunction wrapWriteCollection<T extends object, M extends string>(\n  collection: T,\n  kind: string,\n  surface: WriteIntentSurface<M>,\n  record: (kind: string, count: number) => void,\n  assertWritable: () => void,\n): T {\n  return memoizedProxyGet(\n    collection,\n    (property) => surface.methodNames.has(property),\n    (value, property) => {\n      if (!isWrappedMethod(value)) return value;\n\n      const method = property as M;\n      const wrapped: WrappedMethod = async (...args) => {\n        // Reject before the live write: a context retained past its callback\n        // must not persist a row the already-snapshotted receipt cannot count.\n        assertWritable();\n        // Pin the intent count at call time: a caller may mutate a bulk input\n        // array while the write is in flight, and the backend has already\n        // snapshotted the items. Recording still waits for resolution so a\n        // rejected write counts 0.\n        const count = surface.counters[method](args);\n        const result = await Reflect.apply(value, collection, args);\n        record(kind, count);\n        return result;\n      };\n      return wrapped;\n    },\n  );\n}\n\n/**\n * Wraps a kind-keyed collection map (`GraphNodeCollections<G>` /\n * `GraphEdgeCollections<G>`), lazily wrapping each collection with\n * `wrapOne` on first access.\n */\nfunction wrapCollections<T extends object>(\n  collections: T,\n  wrapOne: (collection: object, kind: string) => unknown,\n): T {\n  return memoizedProxyGet(\n    collections,\n    () => true,\n    (collection, kind) =>\n      isObject(collection) ? wrapOne(collection, kind) : collection,\n  );\n}\n\nexport function wrapTransactionCollections<G extends GraphDef>(\n  nodes: GraphNodeCollections<G>,\n  edges: GraphEdgeCollections<G>,\n  recorder: TransactionReceiptRecorder,\n): Readonly<{\n  nodes: GraphNodeCollections<G>;\n  edges: GraphEdgeCollections<G>;\n}> {\n  return {\n    nodes: wrapCollections(nodes, (collection, kind) =>\n      wrapWriteCollection(\n        collection,\n        kind,\n        NODE_WRITE_SURFACE,\n        recorder.recordNode,\n        recorder.assertWritable,\n      ),\n    ),\n    edges: wrapCollections(edges, (collection, kind) =>\n      wrapWriteCollection(\n        collection,\n        kind,\n        EDGE_WRITE_SURFACE,\n        recorder.recordEdge,\n        recorder.assertWritable,\n      ),\n    ),\n  };\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  asGraphWriteBackend,\n  asRawBackend,\n  type GraphWriteBackend,\n  type RawBackend,\n} from \"../backend/branded\";\nimport { createGraphBackendProjection } from \"../backend/graph-backend-projection\";\nimport {\n  createEdgeRowMapper,\n  createNodeRowMapper,\n  POSTGRES_ROW_MAPPER_CONFIG,\n  SQLITE_ROW_MAPPER_CONFIG,\n} from \"../backend/row-mappers\";\nimport {\n  type AdapterBackend,\n  type BackendCapabilities,\n  createTransactionReadBackend,\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 {\n  resolveEmbeddingFields,\n  resolveGraphVectorSlots,\n} from \"../core/embedding\";\nimport {\n  asRecordedInstant,\n  type ReadCoordinate,\n  type RecordedInstant,\n  resolveReadCoordinate,\n  withRecordedCoordinate,\n} from \"../core/temporal\";\nimport type {\n  AnyEdgeType,\n  EdgeId,\n  KindEntity,\n  NodeId,\n  NodeType,\n} 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  createInternalQueryBuilder,\n  type InitialQueryBuilder,\n  type QueryCoordinateState,\n} from \"../query/builder\";\nimport {\n  createRecordedReadBinding,\n  createSqlSchema,\n  type RecordedReadBinding,\n  requireExternalRecordedReadSource,\n  requireSqlSchema,\n  type SqlSchema,\n} from \"../query/compiler/schema\";\nimport { getDialect } from \"../query/dialect\";\nimport type { SqlDialect } from \"../query/dialect/types\";\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 { requireDefined } from \"../utils/presence\";\nimport {\n  createGraphAlgorithms,\n  type GraphAlgorithms,\n  type InternalGraphAlgorithms,\n} 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 {\n  createHistoryStoreBackendProjection,\n  type HistoryStoreBackend,\n} from \"./history-store-backend\";\nimport { introspectSchema, type SchemaIntrospection } from \"./introspect\";\nimport {\n  backendSupportsIndexMaterialization,\n  computeIndexSignature,\n  materializeIndexes as materializeIndexesImpl,\n  type MaterializeIndexesOptions,\n  type MaterializeIndexesResult,\n  materializeSystemIndexes as materializeSystemIndexesImpl,\n  type MaterializeSystemIndexesOptions,\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  edgeUpsertDirtyCheck,\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  nodeUpsertDirtyCheck,\n} from \"./operations\";\nimport {\n  advanceRevisionClock,\n  assertRecordedCaptureTransactionIsolation,\n  assertRevisionTrackableBackend,\n  createRecordedBackend,\n  createRecordedTransactionScope,\n  ensureRevisionOrigin,\n  lockRecordedGraphWrite,\n  readRecordedClock,\n  recordedCaptureRequiresCallbackTransactionError,\n  type RecordedFlushInstants,\n  throwHistoryUnsafeSqlAccess,\n  throwRevisionTrackingUnsafeSqlAccess,\n  withRecordedFlushObserver,\n  withRecordedRelationsPrecondition,\n} from \"./recorded-capture\";\nimport { assertNoRecordedCoordinate } from \"./recorded-coordinate-guard\";\nimport {\n  createRecordedReadService,\n  type RecordedReadService,\n} from \"./recorded-read-service\";\nimport { rowToEdge, rowToNode } from \"./row-mappers\";\nimport { STORE_RUNTIME, type StoreRuntime } from \"./runtime-port\";\nimport { StoreSearch } from \"./search-facade\";\nimport {\n  RecordedStoreView,\n  StoreView,\n  type StoreViewCoordinate,\n} from \"./store-view\";\nimport {\n  executeSubgraph,\n  type InternalSubgraphOptions,\n  type SubgraphOptions,\n  type SubgraphProject,\n  type SubgraphResult,\n} from \"./subgraph\";\nimport {\n  createTransactionReceiptRecorder,\n  type TransactionReceiptRecorder,\n  wrapTransactionCollections,\n} from \"./transaction-receipt\";\nimport {\n  type AdapterTransactionContext,\n  AUTO_REFRESH_STATISTICS_ROW_THRESHOLD,\n  type DynamicEdgeCollection,\n  type DynamicNodeCollection,\n  type Edge,\n  type GraphEdgeCollections,\n  type GraphNodeCollections,\n  type HistoryStoreOptions,\n  type HookContext,\n  type LiveStoreOptions,\n  type MeasurableAdapterTransactionContext,\n  type MeasurableTransactionContext,\n  type Node,\n  type OperationHookContext,\n  type QueryOptions,\n  type RecordedReadStoreOptions,\n  type RecordedScanOptions,\n  type RecordedScanPage,\n  type ScopedMeasure,\n  type StoreHooks,\n  type StoreOptions,\n  type StoreRef,\n  TRANSACTION_RUNTIME,\n  type TransactionContext,\n  type TransactionOutcome,\n  type UnboundLiveStoreOptions,\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\" | \"materialize\" | \"deprecate\" | \"undeprecate\" | \"remove\" | \"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\nconst ROW_MAPPER_CONFIGS = {\n  postgres: POSTGRES_ROW_MAPPER_CONFIG,\n  sqlite: SQLITE_ROW_MAPPER_CONFIG,\n} satisfies Record<SqlDialect, typeof POSTGRES_ROW_MAPPER_CONFIG>;\n\nfunction rowMapperConfigFor(backend: GraphBackend | TransactionBackend) {\n  return ROW_MAPPER_CONFIGS[backend.dialect];\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\n/** One place for the hooks' error normalization. */\nfunction asError(error: unknown): Error {\n  return error instanceof Error ? error : new Error(String(error));\n}\n\n/** The `(hook context, operation body)` wrapper shape operation contexts carry. */\ntype OperationHookRunner = <T>(\n  ctx: OperationHookContext,\n  fn: () => Promise<T>,\n) => Promise<T>;\n\n/** A committed-inside-the-transaction operation awaiting the outer COMMIT. */\ntype PendingOperationOutcome = Readonly<{\n  ctx: OperationHookContext;\n  durationMs: number;\n}>;\n\ntype TransactionRunResult<T> = Readonly<{\n  result: T;\n  recordedByGraph: RecordedFlushInstants | undefined;\n}>;\n\n/**\n * The flush result for a `withRecordedTransaction` on a store without history\n * capture: no recorded rows were closed, so no graph maps to an instant. Shared\n * (rather than allocated per call) — a `ReadonlyMap` is never mutated.\n */\nconst EMPTY_RECORDED_FLUSH_INSTANTS: RecordedFlushInstants = new Map();\n\nfunction transactionOutcome<T>(\n  result: T,\n  recorder: TransactionReceiptRecorder,\n  recordedByGraph: RecordedFlushInstants | undefined,\n  graphId: string,\n): TransactionOutcome<T> {\n  const recorded = recordedByGraph?.get(graphId);\n  return {\n    result,\n    receipt: recorder.snapshot(\n      recorded === undefined ? undefined : asRecordedInstant(recorded),\n    ),\n  };\n}\n\n/** Clones an internal context without evaluating accessor properties. */\nfunction overlayPropertyDescriptors<\n  TBase extends object,\n  TOverlay extends object,\n>(base: TBase, overlay: TOverlay): TBase & TOverlay {\n  return Object.defineProperties(Object.create(Reflect.getPrototypeOf(base)), {\n    ...Object.getOwnPropertyDescriptors(base),\n    ...Object.getOwnPropertyDescriptors(overlay),\n  }) as TBase & TOverlay;\n}\n\n/** Keeps suppressed/JavaScript raw-SQL access fail-loud without advertising it. */\nfunction defineUnavailableSqlGuard(context: object, guard: () => never): void {\n  Object.defineProperty(context, \"sql\", {\n    configurable: false,\n    enumerable: true,\n    get: guard,\n  });\n}\n\ntype StoreCore<G extends GraphDef> = Readonly<{\n  [STORE_RUNTIME]: StoreRuntime<G>;\n  graph: G;\n  graphId: string;\n  capabilities: BackendCapabilities;\n  registry: KindRegistry;\n  historyEnabled: boolean;\n  revisionTrackingEnabled: boolean;\n  revisionSchema: SqlSchema;\n  recordedReadBound: boolean;\n  nodes: GraphNodeCollections<G>;\n  edges: GraphEdgeCollections<G>;\n  algorithms: GraphAlgorithms<G>;\n  search: StoreSearch<G>;\n  getNodeCollection: (kind: string) => DynamicNodeCollection | undefined;\n  getNodeCollectionOrThrow: (kind: string) => DynamicNodeCollection;\n  getEdgeCollection: (kind: string) => DynamicEdgeCollection | undefined;\n  getEdgeCollectionOrThrow: (kind: string) => DynamicEdgeCollection;\n  getNodePropsSchema: (kind: string) => z.ZodObject<z.ZodRawShape> | undefined;\n  getNodePropsSchemaOrThrow: (kind: string) => z.ZodObject<z.ZodRawShape>;\n  getEdgePropsSchema: (kind: string) => z.ZodObject<z.ZodRawShape> | undefined;\n  getEdgePropsSchemaOrThrow: (kind: string) => z.ZodObject<z.ZodRawShape>;\n  introspect: () => SchemaIntrospection;\n  query: () => InitialQueryBuilder<G, \"open\">;\n  asOf: (asOf: string) => StoreView<G>;\n  asOfRecorded: (recordedAsOf: RecordedInstant) => RecordedStoreView<G>;\n  recordedNow: () => Promise<RecordedInstant | undefined>;\n  revisionNow: () => Promise<string | undefined>;\n  revisionOriginNow: () => Promise<string>;\n  view: (coordinate: StoreViewCoordinate) => StoreView<G>;\n  snapshot: () => StoreView<G>;\n  batch: <\n    const Queries extends readonly [\n      BatchableQuery<unknown>,\n      BatchableQuery<unknown>,\n      ...BatchableQuery<unknown>[],\n    ],\n  >(\n    ...queries: Queries\n  ) => Promise<BatchResults<Queries>>;\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: SubgraphOptions<G, EK, NK, P>,\n  ) => Promise<SubgraphResult<G, NK, EK, P>>;\n  clear: () => Promise<void>;\n  refreshStatistics: () => Promise<void>;\n  materializeIndexes: (\n    options?: MaterializeIndexesOptions,\n  ) => Promise<MaterializeIndexesResult>;\n  materializeSystemIndexes: (\n    options?: MaterializeSystemIndexesOptions,\n  ) => Promise<MaterializeIndexesResult>;\n  reembedVectorField: (\n    kind: string,\n    fieldPath: string,\n    options?: ReembedVectorFieldOptions,\n  ) => Promise<ReembedVectorFieldResult>;\n  materializeRemovals: (\n    options?: MaterializeRemovalsOptions,\n  ) => Promise<MaterializeRemovalsResult>;\n  close: () => Promise<void>;\n}>;\n\ntype StoreTransactions<G extends GraphDef> = Readonly<{\n  transaction: <T>(\n    fn: (tx: TransactionContext<G>) => Promise<T>,\n    options?: TransactionOptions,\n  ) => Promise<T>;\n  transactionWithReceipt: <T>(\n    fn: (tx: MeasurableTransactionContext<G>) => Promise<T>,\n    options?: TransactionOptions,\n  ) => Promise<TransactionOutcome<T>>;\n}>;\n\ninterface StoreEvolution<G extends GraphDef, TStore extends StoreCore<G>> {\n  readonly evolve: <TRefStore extends StoreCore<G> = TStore>(\n    extension: GraphExtension,\n    options?: Readonly<{\n      ref?: TStore extends TRefStore ? StoreRef<TRefStore> : never;\n      eager?: MaterializeIndexesOptions;\n    }>,\n  ) => Promise<TStore>;\n  readonly deprecateKinds: <TRefStore extends StoreCore<G> = TStore>(\n    names: readonly string[],\n    options?: Readonly<{\n      ref?: TStore extends TRefStore ? StoreRef<TRefStore> : never;\n    }>,\n  ) => Promise<TStore>;\n  readonly undeprecateKinds: <TRefStore extends StoreCore<G> = TStore>(\n    names: readonly string[],\n    options?: Readonly<{\n      ref?: TStore extends TRefStore ? StoreRef<TRefStore> : never;\n    }>,\n  ) => Promise<TStore>;\n  readonly removeKinds: <TRefStore extends StoreCore<G> = TStore>(\n    names: readonly string[],\n    options?: Readonly<{\n      ref?: TStore extends TRefStore ? StoreRef<TRefStore> : never;\n      eager?: MaterializeRemovalsOptions;\n    }>,\n  ) => Promise<TStore>;\n}\n\nfunction syncStoreReplacementRef<\n  G extends GraphDef,\n  TRefStore extends StoreCore<G>,\n>(ref: StoreRef<TRefStore> | undefined, replacement: StoreCore<G>): void {\n  if (ref === undefined) return;\n  // StoreEvolution admits only refs whose value is a supertype of the returned\n  // Store flavor. Runtime implementations use one broader class for every\n  // overload, so the compiler cannot recover that public conditional here.\n  ref.current = replacement as unknown as TRefStore;\n}\n\n/**\n * The default TypeGraph Store contract. It contains the complete graph API and\n * graph-owned transactions while keeping adapter-native handles, backend\n * internals, and caller-owned transaction adoption out of the public surface.\n */\nexport type Store<G extends GraphDef> = StoreCore<G> &\n  StoreTransactions<G> &\n  StoreEvolution<G, Store<G>>;\n\n/**\n * A Store with explicit adapter interoperability. Adapter entrypoints return\n * this surface so native transaction handles remain precisely typed without\n * leaking into the default Store contract.\n */\nexport type AdapterStore<\n  G extends GraphDef,\n  TNativeTransaction,\n> = StoreCore<G> &\n  StoreEvolution<G, AdapterStore<G, TNativeTransaction>> &\n  AdapterStoreTransactions<G, TNativeTransaction> &\n  Readonly<{ backend: GraphBackend }>;\n\ntype AdapterStoreTransactions<\n  G extends GraphDef,\n  TNativeTransaction,\n> = Readonly<{\n  transaction: <T>(\n    fn: (tx: AdapterTransactionContext<G, TNativeTransaction>) => Promise<T>,\n    options?: TransactionOptions,\n  ) => Promise<T>;\n  transactionWithReceipt: <T>(\n    fn: (\n      tx: MeasurableAdapterTransactionContext<G, TNativeTransaction>,\n    ) => Promise<T>,\n    options?: TransactionOptions,\n  ) => Promise<TransactionOutcome<T>>;\n  withTransaction: (\n    externalTransaction: TNativeTransaction,\n  ) => AdapterTransactionContext<G, TNativeTransaction>;\n  withRecordedTransaction: <T>(\n    externalTransaction: TNativeTransaction,\n    fn: (\n      tx: MeasurableAdapterTransactionContext<G, TNativeTransaction>,\n    ) => Promise<T>,\n  ) => Promise<TransactionOutcome<T>>;\n}>;\n\nclass StoreImplementation<G extends GraphDef, TNativeTransaction = unknown> {\n  readonly [STORE_RUNTIME]: StoreRuntime<G>;\n  readonly #graph: G;\n  /**\n   * Bare backend for DDL, vector-storage, and bulk-materialization work that must\n   * bypass recorded capture. Graph-entity writes use `#backend` instead.\n   */\n  readonly #baseBackend: RawBackend;\n  readonly #backend: GraphWriteBackend;\n  readonly #adapterBackend: AdapterBackend<TNativeTransaction> | undefined;\n  readonly #captureEnabled: boolean;\n  readonly #revisionTrackingEnabled: boolean;\n  #revisionOrigin: Promise<string> | undefined;\n  readonly #recordedReadBinding: RecordedReadBinding | undefined;\n  readonly #registry: KindRegistry;\n  readonly #hooks: StoreHooks;\n  readonly #schema: StoreOptions[\"schema\"];\n  readonly #recordedReads: RecordedReadService;\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    adapterBackend?: AdapterBackend<TNativeTransaction>,\n  ) {\n    this.#graph = graph;\n    this.#baseBackend = asRawBackend(backend);\n    this.#adapterBackend = adapterBackend;\n    this.#captureEnabled = options?.history === true;\n    this.#revisionTrackingEnabled =\n      this.#captureEnabled || options?.revisionTracking === true;\n    if (this.#revisionTrackingEnabled) {\n      assertRevisionTrackableBackend(backend);\n    }\n    // Resolve the schema before wrapping so recorded-time capture targets the\n    // same relations recorded reads do (the explicit `schema` option, not just\n    // `backend.tableNames`).\n    const explicitSchema =\n      options?.schema === undefined ?\n        undefined\n      : requireSqlSchema(options.schema, \"store schema\");\n    const resolvedSchema =\n      explicitSchema ??\n      (backend.tableNames ? createSqlSchema(backend.tableNames) : undefined);\n    const readSchema = resolvedSchema ?? createSqlSchema(backend.tableNames);\n    if (this.#captureEnabled && options?.recordedRead !== undefined) {\n      throw new ConfigurationError(\n        \"recordedRead cannot be combined with history: true.\",\n        { code: \"RECORDED_READ_CONFLICTS_WITH_HISTORY\" },\n        {\n          suggestion:\n            \"Use { history: true } for TypeGraph-managed capture, or omit history and pass { recordedRead: recordedRelation({ schema }) } for an externally populated recorded relation.\",\n        },\n      );\n    }\n    const externalRecordedRead = requireExternalRecordedReadSource(\n      options?.recordedRead,\n    );\n    this.#recordedReadBinding =\n      this.#captureEnabled ?\n        createRecordedReadBinding(readSchema)\n      : externalRecordedRead;\n    this.#backend =\n      this.#captureEnabled ?\n        asGraphWriteBackend(createRecordedBackend(backend, resolvedSchema))\n      : asGraphWriteBackend(backend);\n    this.#schema = resolvedSchema;\n    const rowMapperConfig = rowMapperConfigFor(this.#backend);\n    this.#recordedReads = createRecordedReadService({\n      graphId: graph.id,\n      backend: this.#backend,\n      recordedReadBinding: this.#recordedReadBinding,\n      mapRecordedNodeRow: createNodeRowMapper(rowMapperConfig),\n      mapRecordedEdgeRow: createEdgeRowMapper(rowMapperConfig),\n    });\n    this.#registry = buildKindRegistry(graph);\n    this.#hooks = options?.hooks ?? {};\n    this.#defaultTraversalExpansion =\n      options?.queryDefaults?.traversalExpansion ?? \"inverse\";\n    this.#options = options;\n    this.#schemaMetadata = schemaMetadata ?? UNKNOWN_SCHEMA_METADATA;\n    this[STORE_RUNTIME] = {\n      backend: this.#backend,\n      sealedQuery: (coordinate) => this.sealedQuery(coordinate),\n      recordedNodeGetById: (kind, id, coordinate) =>\n        this.recordedNodeGetById(kind, id, coordinate),\n      recordedNodeGetByIds: (kind, ids, coordinate) =>\n        this.recordedNodeGetByIds(kind, ids, coordinate),\n      recordedNodeScan: (kind, coordinate, options) =>\n        this.recordedNodeScan(kind, coordinate, options),\n      recordedEdgeGetById: (kind, id, coordinate) =>\n        this.recordedEdgeGetById(kind, id, coordinate),\n      recordedEdgeGetByIds: (kind, ids, coordinate) =>\n        this.recordedEdgeGetByIds(kind, ids, coordinate),\n      recordedEdgeScan: (kind, coordinate, options) =>\n        this.recordedEdgeScan(kind, coordinate, options),\n      subgraphAtCoordinate: (rootId, subgraphOptions) =>\n        this.subgraphAtCoordinate(rootId, subgraphOptions),\n      algorithmsAtCoordinate: (coordinate) =>\n        this.algorithmsAtCoordinate(coordinate),\n    };\n    Object.defineProperty(this, STORE_RUNTIME, {\n      configurable: false,\n      enumerable: false,\n      writable: false,\n    });\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  /** Runtime features available through this store's configured backend. */\n  get capabilities(): BackendCapabilities {\n    return this.#baseBackend.capabilities;\n  }\n\n  /** The kind registry for ontology lookups */\n  get registry(): KindRegistry {\n    return this.#registry;\n  }\n\n  /**\n   * Whether recorded-time capture is enabled for this store.\n   *\n   * @internal\n   */\n  get historyEnabled(): boolean {\n    return this.#captureEnabled;\n  }\n\n  /**\n   * Whether this Store advances a durable revision anchor for graph writes.\n   *\n   * @internal\n   */\n  get revisionTrackingEnabled(): boolean {\n    return this.#revisionTrackingEnabled;\n  }\n\n  /**\n   * SQL schema that owns the durable revision clock relation.\n   *\n   * @internal\n   */\n  get revisionSchema(): SqlSchema {\n    return this.#sqlSchema();\n  }\n\n  /**\n   * Whether this store has a recorded read relation bound for reconstruction.\n   *\n   * @internal\n   */\n  get recordedReadBound(): boolean {\n    return this.#recordedReadBinding !== undefined;\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   * Traversal calls use the iterative graph-operation substrate: a set-based\n   * breadth-first frontier backed by a temporary working table, or a chunked\n   * inline relation when the backend cannot pin a transactional connection.\n   * `degree` uses a single count query. The facade is built lazily on first\n   * access and cached for the lifetime 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        graph: this.#graph,\n        registry: this.#registry,\n        backend: this.#backend,\n        schema: this.#schema,\n        recordedReadBinding: this.#recordedReadBinding,\n        defaultTemporalMode: this.#graph.defaults.temporalMode,\n      });\n    }\n    return this.#algorithms;\n  }\n\n  // === Dynamic Collection Access ===\n\n  /**\n   * Resolves `kind` against `collections` (either `this.nodes` or a\n   * transaction-scoped — and possibly receipt-wrapped — node collection map),\n   * or `undefined` when the kind is not registered in this graph. Shared by\n   * `getNodeCollection` and both transaction contexts' `getNodeCollection` so\n   * a receipt-wrapped transaction counts writes made through the dynamic\n   * lookup exactly like `this.#graph.nodes` membership is checked everywhere\n   * else.\n   */\n  #resolveDynamicNodeCollection(\n    collections: GraphNodeCollections<G>,\n    kind: string,\n  ): DynamicNodeCollection | undefined {\n    if (!Object.hasOwn(this.#graph.nodes, kind)) return undefined;\n    return collections[\n      kind as keyof G[\"nodes\"] & string\n    ] as unknown as DynamicNodeCollection;\n  }\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    return this.#resolveDynamicNodeCollection(this.nodes, kind);\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 requireDefined(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 requireDefined(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    return this.#buildNodeOperations(this.#createNodeOperationContext());\n  }\n\n  /**\n   * Refreshes planner statistics after an autocommit bulk write that\n   * reached the configured row threshold. A refresh failure must never\n   * fail the (already committed) write — it degrades to a warning.\n   */\n  async #maybeRefreshStatisticsAfterBulk(rowCount: number): Promise<void> {\n    const configured = this.#options?.autoRefreshStatistics;\n    if (configured === false) return;\n    const threshold = configured ?? AUTO_REFRESH_STATISTICS_ROW_THRESHOLD;\n    if (rowCount < threshold) return;\n    try {\n      await this.refreshStatistics();\n    } catch (error) {\n      console.warn(\n        \"typegraph: statistics refresh after bulk write failed; run \" +\n          \"store.refreshStatistics() to avoid stale planner statistics.\",\n        error,\n      );\n    }\n  }\n\n  #buildNodeOperations(ctx: NodeOperationContext<G>): NodeOperations {\n    return {\n      defaultTemporalMode: this.#graph.defaults.temporalMode,\n      rowToNode: (row) => rowToNode(row),\n      maybeRefreshStatisticsAfterBulk: (rowCount) =>\n        this.#maybeRefreshStatisticsAfterBulk(rowCount),\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      // Present only when opted in; its absence is the coalesce off switch.\n      ...(this.#options?.coalesceUnchangedUpserts === true && {\n        upsertDirtyCheck: (kind, id, existingProps, inputProps) =>\n          nodeUpsertDirtyCheck(ctx, kind, id, existingProps, inputProps),\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    return this.#buildEdgeOperations(this.#createEdgeOperationContext());\n  }\n\n  #buildEdgeOperations(ctx: EdgeOperationContext<G>): EdgeOperations {\n    return {\n      defaultTemporalMode: this.#graph.defaults.temporalMode,\n      rowToEdge: (row) => rowToEdge(row),\n      maybeRefreshStatisticsAfterBulk: (rowCount) =>\n        this.#maybeRefreshStatisticsAfterBulk(rowCount),\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      // Present only when opted in; its absence is the coalesce off switch.\n      ...(this.#options?.coalesceUnchangedUpserts === true && {\n        upsertDirtyCheck: (kind, id, existingProps, inputProps) =>\n          edgeUpsertDirtyCheck(ctx, kind, id, existingProps, inputProps),\n      }),\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(): InitialQueryBuilder<G, \"open\"> {\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): InitialQueryBuilder<G, \"sealed\"> {\n    return this.#createQueryForBackend(\n      this.#recordedReads.backendForCoordinate(coordinate, \"recorded-query\"),\n      coordinate,\n    );\n  }\n\n  #sqlSchema(): SqlSchema {\n    return this.#schema ?? createSqlSchema(this.#backend.tableNames);\n  }\n\n  /**\n   * Internal seam for {@link RecordedStoreView}: reconstruct a node point read\n   * from the recorded-time relation while preserving live getById ordering and\n   * duplicate-input behavior.\n   *\n   * @internal\n   */\n  async recordedNodeGetById<N extends NodeType>(\n    kind: string,\n    id: NodeId<N>,\n    coordinate: ReadCoordinate,\n  ): Promise<Node<N> | undefined> {\n    return this.#recordedReads.nodeGetById(kind, id, coordinate);\n  }\n\n  /**\n   * Internal seam for {@link RecordedStoreView}: reconstruct node point reads\n   * from the recorded-time relation while preserving input order.\n   *\n   * @internal\n   */\n  async recordedNodeGetByIds<N extends NodeType>(\n    kind: string,\n    ids: readonly NodeId<N>[],\n    coordinate: ReadCoordinate,\n  ): Promise<readonly (Node<N> | undefined)[]> {\n    return this.#recordedReads.nodeGetByIds(kind, ids, coordinate);\n  }\n\n  /** @internal Bounded recorded-time node enumeration for RecordedStoreView. */\n  async recordedNodeScan<N extends NodeType>(\n    kind: string,\n    coordinate: ReadCoordinate,\n    options?: RecordedScanOptions,\n  ): Promise<RecordedScanPage<Node<N>>> {\n    return this.#recordedReads.nodeScan(kind, coordinate, options);\n  }\n\n  /**\n   * Internal seam for {@link RecordedStoreView}: reconstruct an edge point read\n   * from the recorded-time relation while preserving live getById behavior.\n   *\n   * @internal\n   */\n  async recordedEdgeGetById<E extends AnyEdgeType>(\n    kind: string,\n    id: EdgeId<E>,\n    coordinate: ReadCoordinate,\n  ): Promise<Edge<E> | undefined> {\n    return this.#recordedReads.edgeGetById(kind, id, coordinate);\n  }\n\n  /**\n   * Internal seam for {@link RecordedStoreView}: reconstruct edge point reads\n   * from the recorded-time relation while preserving input order.\n   *\n   * @internal\n   */\n  async recordedEdgeGetByIds<E extends AnyEdgeType>(\n    kind: string,\n    ids: readonly EdgeId<E>[],\n    coordinate: ReadCoordinate,\n  ): Promise<readonly (Edge<E> | undefined)[]> {\n    return this.#recordedReads.edgeGetByIds(kind, ids, coordinate);\n  }\n\n  /** @internal Bounded recorded-time edge enumeration for RecordedStoreView. */\n  async recordedEdgeScan<E extends AnyEdgeType>(\n    kind: string,\n    coordinate: ReadCoordinate,\n    options?: RecordedScanOptions,\n  ): Promise<RecordedScanPage<Edge<E>>> {\n    return this.#recordedReads.edgeScan(kind, coordinate, options);\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 narrow read-only view pinned to a recorded/system-time instant.\n   *\n   * Direct `store.asOfRecorded(T)` is diagonal bitemporal sugar: it reads the\n   * recorded-time relation as of `T` and uses the same `T` for the valid-time\n   * axis. Use `store.asOf(validT).asOfRecorded(recordedT)` when the valid and\n   * recorded axes should differ.\n   *\n   * The returned view exposes only reconstructing-safe reads: query,\n   * subgraph, graph algorithms, and collection point reads.\n   *\n   * Prefer `await store.recordedNow()` as the anchor over a wall-clock\n   * timestamp: recorded instants are monotonic and can run briefly ahead of the\n   * wall clock under bursty writes, so a `new Date().toISOString()` passed here\n   * may sort before the most recent commits and silently omit them.\n   */\n  asOfRecorded(recordedAsOf: RecordedInstant): RecordedStoreView<G> {\n    const validCoordinate = resolveReadCoordinate(\n      \"asOf\",\n      recordedAsOf,\n      \"Use await store.recordedNow() as the anchor, or asRecordedInstant(value) only for an instant previously read from recordedNow().\",\n    );\n    return new RecordedStoreView(\n      this,\n      withRecordedCoordinate(validCoordinate, recordedAsOf),\n    );\n  }\n\n  /**\n   * Returns the latest recorded-time instant captured for this graph — the\n   * recorded high-water mark. After guarding the `undefined` case,\n   * `store.asOfRecorded(checkpoint)` reconstructs everything committed so far, a\n   * deterministic anchor that avoids guessing with the wall clock (recorded\n   * instants are monotonic and can run briefly ahead of wall-clock time under\n   * bursty writes). Capture each anchor right after the writes it should cover.\n   *\n   * Returns `undefined` until the first write has been captured, so on a\n   * brand-new graph guard the composition — `asOfRecorded(undefined)` rejects\n   * (an instant is required) rather than reconstructing an empty view. Read the\n   * value first and only pass it to `asOfRecorded` once it is defined.\n   *\n   * **Graph-global, not caller-scoped.** This is the single high-water mark for\n   * the whole graph, advanced by every committed capture from any writer — not\n   * a per-write or per-caller value. An advance between two reads means\n   * \"something committed to this graph in between,\" *not* \"the write this caller\n   * just made landed.\" Do not use a `recordedNow()` advance as a \"did my write\n   * succeed?\" signal: under any concurrent writer to the same graph it both\n   * misses dropped writes and misfires on no-op writes. Confirm a specific write\n   * by observing the write itself (its return value, or `store.transaction(...)`\n   * success), not the global clock.\n   */\n  async recordedNow(): Promise<RecordedInstant | undefined> {\n    if (!this.#captureEnabled) {\n      throw new ConfigurationError(\n        \"recordedNow() requires a store created with { history: true }.\",\n        { code: \"RECORDED_NOW_REQUIRES_HISTORY\" },\n        {\n          suggestion:\n            \"Create the store with createStore(graph, backend, { history: true }) to enable recorded-time capture.\",\n        },\n      );\n    }\n    const recordedAt = await withRecordedRelationsPrecondition(\n      readRecordedClock(this.#backend, this.#sqlSchema(), this.graphId),\n      { dialect: this.#backend.dialect, surface: \"recorded-now\" },\n    );\n    // The clock high-water mark is already a canonical recorded instant; brand\n    // it so `asOfRecorded` accepts it without the caller re-wrapping.\n    return recordedAt === undefined ? undefined : asRecordedInstant(recordedAt);\n  }\n\n  /**\n   * Returns the durable graph revision used by graph branching. It is undefined\n   * until the first successful tracked write, which is itself a stable initial\n   * anchor. Unlike {@link recordedNow}, this is also available on a live Store\n   * created with `{ revisionTracking: true }`.\n   *\n   * @internal\n   */\n  async revisionNow(): Promise<string | undefined> {\n    if (!this.#revisionTrackingEnabled) return undefined;\n    return readRecordedClock(this.#backend, this.#sqlSchema(), this.graphId);\n  }\n\n  /**\n   * Returns the durable random namespace for this graph's revision clock. A\n   * tracked base token combines it with {@link revisionNow}, preventing a\n   * branch from one independent store from matching a coincident timestamp in\n   * another store.\n   *\n   * @internal\n   */\n  async revisionOriginNow(): Promise<string> {\n    if (!this.#revisionTrackingEnabled) {\n      throw new ConfigurationError(\n        \"revisionOriginNow() requires revisionTracking: true or history: true.\",\n        { code: \"REVISION_ORIGIN_REQUIRES_TRACKING\" },\n      );\n    }\n    const pendingOrigin =\n      this.#revisionOrigin ??\n      ensureRevisionOrigin(this.#baseBackend, this.#sqlSchema(), this.graphId);\n    this.#revisionOrigin = pendingOrigin;\n    try {\n      return await pendingOrigin;\n    } catch (error) {\n      // A transient DDL/connection failure must not permanently poison this\n      // Store's cached initialization promise. Preserve a newer in-flight\n      // attempt if another caller replaced it before this rejection arrived.\n      if (this.#revisionOrigin === pendingOrigin) {\n        this.#revisionOrigin = undefined;\n      }\n      throw error;\n    }\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        createQuery: () => this.query(),\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    // batch() is read-only, so it routes through the uncaptured backend. Going\n    // through the capture wrapper would open a recorded-capture transaction\n    // scope — which demands executeStatement on the transaction target — for a\n    // path that performs no writes and needs no capture.\n    return runOptionallyInTransaction(this.#baseBackend, 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    // The public surface is valid-time only (`recordedAsOf` is typed `never`).\n    // Guard JS callers who bypass the type so a leaked recorded pin can't\n    // silently switch this read onto the recorded relation; recorded subgraph\n    // reads come through subgraphAtCoordinate (store.asOfRecorded(...).subgraph).\n    assertNoRecordedCoordinate(options, {\n      code: \"SUBGRAPH_RECORDED_ASOF_INTERNAL_ONLY\",\n      message:\n        \"recordedAsOf is only available through store.asOfRecorded(...).subgraph(...).\",\n      suggestion:\n        \"Use store.asOfRecorded(recordedAt).subgraph(rootId, options) instead of passing recordedAsOf directly.\",\n    });\n    // After the guard, the public read is just the coordinate path with no\n    // recorded pin — delegate so the executeSubgraph wiring lives in one place.\n    return this.subgraphAtCoordinate(rootId, options);\n  }\n\n  /**\n   * Internal seam for {@link StoreView} / {@link RecordedStoreView}: runs a\n   * subgraph with a coordinate already flattened into the options (including a\n   * recorded/system-time pin). Trusted caller — the public {@link Store.subgraph}\n   * is the guarded entry point.\n   *\n   * @internal\n   */\n  subgraphAtCoordinate<\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: InternalSubgraphOptions<G, EK, NK, P>,\n  ): Promise<SubgraphResult<G, NK, EK, P>> {\n    const coordinate = resolveReadCoordinate(\n      options.temporalMode ?? this.#graph.defaults.temporalMode,\n      options.asOf,\n    );\n    const readCoordinate =\n      options.recordedAsOf === undefined ?\n        coordinate\n      : withRecordedCoordinate(coordinate, options.recordedAsOf);\n    return executeSubgraph({\n      graph: this.#graph,\n      graphId: this.graphId,\n      rootId,\n      backend: this.#recordedReads.backendForCoordinate(\n        readCoordinate,\n        \"recorded-subgraph\",\n      ),\n      dialect: getDialect(this.#backend.dialect),\n      schema: this.#schema,\n      recordedReadBinding: this.#recordedReadBinding,\n      options,\n    });\n  }\n\n  /**\n   * Internal seam for StoreView graph algorithms at a pinned coordinate.\n   *\n   * @internal\n   */\n  algorithmsAtCoordinate(\n    coordinate: ReadCoordinate,\n  ): InternalGraphAlgorithms<G> {\n    return createGraphAlgorithms<G>({\n      graphId: this.graphId,\n      graph: this.#graph,\n      registry: this.#registry,\n      backend: this.#recordedReads.backendForCoordinate(\n        coordinate,\n        \"recorded-graph-algorithm\",\n      ),\n      schema: this.#schema,\n      recordedReadBinding: this.#recordedReadBinding,\n      defaultTemporalMode: this.#graph.defaults.temporalMode,\n      allowRecordedAsOf: coordinate.recorded !== undefined,\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.backend` - a read-only backend projection bound to this transaction\n   *\n   * {@link AdapterStore} transaction callbacks additionally expose `tx.sql`,\n   * the adapter-native handle bound to the same atomic boundary. Branch on\n   * `tx.sqlAvailability`: `\"available\"` carries the handle and `\"unavailable\"`\n   * carries `undefined`. History and revision-tracking contexts make `tx.sql`\n   * unusable in their public types; reflective or type-suppressed runtime\n   * access throws because raw SQL would bypass capture or the revision anchor.\n   * Use typed collections or {@link AdapterStore.withRecordedTransaction} in\n   * those modes.\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   *   if (tx.sqlAvailability !== \"available\") {\n   *     throw new Error(\"This operation requires a SQL-backed transaction\");\n   *   }\n   *   // Narrowing makes the precisely typed native handle available.\n   *   const sqlTx = tx.sql as NodePgDatabase;\n   *   await sqlTx.insert(documentVersions).values(versionRow);\n   * });\n   * ```\n   *\n   * **`tx.sql` shares the one pinned connection — await it, don't overlap it.**\n   * TypeGraph serializes the statements *its own* collections issue, so a\n   * `Promise.all` of graph writes is safe. A statement you issue through\n   * `tx.sql` bypasses that queue: run it concurrently with a graph write (or\n   * with another `tx.sql` statement) and two queries race on the one\n   * transaction connection — the exact overlap Postgres removes in `pg@9`.\n   * Await each `tx.sql` statement before starting the next write. TypeGraph\n   * cannot police this: it never sees the raw handle's traffic, so it also\n   * cannot drain a raw statement still in flight when the transaction commits.\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. Stores created with `{ history: true }`\n   *   require read-committed semantics for PostgreSQL recorded-clock capture and\n   *   reject stronger snapshot isolation levels.\n   */\n  transaction<T>(\n    this: AdapterHistoryStore<G, TNativeTransaction>,\n    fn: (\n      tx: AdapterHistoryTransactionContext<G, TNativeTransaction>,\n    ) => Promise<T>,\n    options?: TransactionOptions,\n  ): Promise<T>;\n\n  transaction<T>(\n    fn: (tx: AdapterTransactionContext<G, TNativeTransaction>) => Promise<T>,\n    options?: TransactionOptions,\n  ): Promise<T>;\n\n  async transaction<T>(\n    fn:\n      | ((tx: AdapterTransactionContext<G, TNativeTransaction>) => Promise<T>)\n      | ((\n          tx: AdapterHistoryTransactionContext<G, TNativeTransaction>,\n        ) => Promise<T>),\n    options?: TransactionOptions,\n  ): Promise<T> {\n    const invoke = fn as (\n      tx: AdapterTransactionContext<G, TNativeTransaction>,\n    ) => Promise<T>;\n    const { result } = await this.#runTransaction(invoke, options, undefined);\n    return result;\n  }\n\n  /**\n   * Runs a transaction exactly like {@link transaction} and additionally\n   * returns a {@link TransactionOutcome} whose receipt summarizes the\n   * completed write intents on the transaction-scoped collection surface.\n   *\n   * A dedicated method (rather than an option on `transaction()`) keeps the\n   * return type tied to static dispatch: forwarding options through wrappers\n   * can never change what a call returns. See {@link TransactionReceipt} for\n   * exact count semantics.\n   *\n   * The receipt does not count writes that bypass the `tx.nodes.*` /\n   * `tx.edges.*` collections, such as direct backend writes, raw SQL, or\n   * import helpers. The adopted-commit sibling\n   * {@link AdapterStore.withRecordedTransaction} also returns a\n   * {@link TransactionOutcome}; only `withTransaction` (whose commit belongs\n   * entirely to the caller with no flush point) produces no receipt. On\n   * non-transactional backends, the receipt is still returned, but it describes\n   * operations that individually committed rather than one atomic commit; if the\n   * callback rejects on such a backend, no receipt is returned even though\n   * earlier operations committed individually.\n   *\n   * For stores created with `{ history: true }`, `receipt.recorded` is the\n   * recorded commit instant this transaction allocated for the store's\n   * graph, or `undefined` when nothing was captured.\n   *\n   * The callback receives a {@link MeasurableTransactionContext}: call\n   * `tx.measure((scoped) => ...)` to scope a sub-receipt to the writes made\n   * through the `scoped` context (e.g. to attribute writes to user code the\n   * caller invokes, excluding its own bookkeeping written through `tx`). See\n   * {@link MeasurableTransactionContext} for semantics.\n   *\n   * @example\n   * ```typescript\n   * const outcome = await store.transactionWithReceipt(async (tx) => {\n   *   const alice = await tx.nodes.Person.create({ name: \"Alice\" });\n   *   return alice.id;\n   * });\n   * outcome.result; // Alice's id\n   * outcome.receipt.writes; // { nodes: { Person: 1 }, edges: {}, total: 1 }\n   * ```\n   */\n  transactionWithReceipt<T>(\n    this: AdapterHistoryStore<G, TNativeTransaction>,\n    fn: (\n      tx: MeasurableAdapterHistoryTransactionContext<G, TNativeTransaction>,\n    ) => Promise<T>,\n    options?: TransactionOptions,\n  ): Promise<TransactionOutcome<T>>;\n\n  transactionWithReceipt<T>(\n    fn: (\n      tx: MeasurableAdapterTransactionContext<G, TNativeTransaction>,\n    ) => Promise<T>,\n    options?: TransactionOptions,\n  ): Promise<TransactionOutcome<T>>;\n\n  async transactionWithReceipt<T>(\n    fn:\n      | ((\n          tx: MeasurableAdapterTransactionContext<G, TNativeTransaction>,\n        ) => Promise<T>)\n      | ((\n          tx: MeasurableAdapterHistoryTransactionContext<G, TNativeTransaction>,\n        ) => Promise<T>),\n    options?: TransactionOptions,\n  ): Promise<TransactionOutcome<T>> {\n    const invoke = fn as (\n      tx: AdapterTransactionContext<G, TNativeTransaction>,\n    ) => Promise<T>;\n    const receiptRecorder = createTransactionReceiptRecorder();\n    const { result, recordedByGraph } = await this.#runTransaction(\n      invoke,\n      options,\n      receiptRecorder,\n    );\n    return transactionOutcome(\n      result,\n      receiptRecorder,\n      recordedByGraph,\n      this.graphId,\n    );\n  }\n\n  async #runTransaction<T>(\n    invoke: (\n      tx: AdapterTransactionContext<G, TNativeTransaction>,\n    ) => Promise<T>,\n    backendOptions: TransactionOptions | undefined,\n    receiptRecorder: TransactionReceiptRecorder | undefined,\n  ): Promise<TransactionRunResult<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 the options is equally meaningless here.\n    if (!this.#backend.capabilities.transactions) {\n      let nodes = this.nodes;\n      let edges = this.edges;\n      if (receiptRecorder !== undefined) {\n        ({ nodes, edges } = wrapTransactionCollections(\n          nodes,\n          edges,\n          receiptRecorder,\n        ));\n      }\n      const fallbackContext: AdapterTransactionContext<G, TNativeTransaction> =\n        {\n          nodes,\n          edges,\n          // No real transaction: `tx.sql` is absent and there is no atomicity.\n          sqlAvailability: \"unavailable\",\n          backend: createTransactionReadBackend(this.#backend),\n          [TRANSACTION_RUNTIME]: {\n            backend: this.#backend,\n            runNodeOperationHooks: (operation, kind, id, hookedFunction) =>\n              this.#withOperationHooks(\n                this.#createOperationContext(operation, \"node\", kind, id),\n                hookedFunction,\n              ),\n          },\n          getNodeCollection: (kind: string) =>\n            this.#resolveDynamicNodeCollection(nodes, kind),\n        };\n      Object.defineProperty(fallbackContext, TRANSACTION_RUNTIME, {\n        configurable: false,\n        enumerable: false,\n        writable: false,\n      });\n      // `measure` on this non-transactional fallback scopes writes that\n      // individually committed rather than one atomic commit, mirroring the\n      // receipt caveat.\n      const result = await invoke(\n        receiptRecorder === undefined ? fallbackContext : (\n          this.#attachMeasure(fallbackContext)\n        ),\n      );\n      return { result, recordedByGraph: undefined };\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    //\n    // No per-graph write lock here either: under history capture the lock is\n    // taken at each write boundary (runInWriteTransaction before any row work;\n    // the recorded overlay before each row write), so a transaction whose\n    // callback only reads never serializes against writers. Callers that need\n    // read-before-write serialization across the whole callback (provenance\n    // transitions) acquire the lock explicitly at callback start.\n    //\n    // Operation hooks inside the callback run BUFFERED: an operation nested\n    // in this transaction completes only when the transaction commits, so its\n    // onOperationEnd is held back until after COMMIT — and converted into\n    // onError when the transaction fails — keeping \"success\" synonymous with\n    // \"durable\" even for tx-scoped collection operations.\n    const pending: PendingOperationOutcome[] = [];\n    const runHooks = this.#createBufferedHookRunner(pending);\n    let recordedByGraph: RecordedFlushInstants | undefined;\n    const transactionOptions =\n      receiptRecorder !== undefined && this.#captureEnabled ?\n        withRecordedFlushObserver(backendOptions, (instants) => {\n          recordedByGraph = instants;\n        })\n      : backendOptions;\n    try {\n      const run = async (\n        txBackend: TransactionBackend,\n        nativeTransaction: TNativeTransaction | undefined,\n      ): Promise<T> =>\n        invoke(\n          this.#buildTransactionContext(\n            txBackend,\n            nativeTransaction,\n            runHooks,\n            receiptRecorder,\n          ),\n        );\n      const result =\n        this.#captureEnabled || this.#adapterBackend === undefined ?\n          await this.#backend.transaction(\n            (txBackend) => run(txBackend, undefined),\n            transactionOptions,\n          )\n        : await this.#adapterBackend.transactionWithNative(\n            (txBackend, nativeTransaction) => run(txBackend, nativeTransaction),\n            transactionOptions,\n          );\n      for (const outcome of pending) {\n        this.#hooks.onOperationEnd?.(outcome.ctx, {\n          durationMs: outcome.durationMs,\n        });\n      }\n      return { result, recordedByGraph };\n    } catch (error) {\n      const failure = asError(error);\n      for (const outcome of pending) {\n        this.#hooks.onError?.(outcome.ctx, failure);\n      }\n      throw error;\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 `createAdapterStoreWithSchema` 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   * **The caller owns the connection — don't overlap writes on it.** The graph\n   * store and your Drizzle writes share the one connection the caller's\n   * transaction pinned. TypeGraph serializes the statements *its* collections\n   * issue, but your raw Drizzle statements (and any graph write run alongside\n   * them) are yours to sequence: a `Promise.all` mixing the two races two\n   * queries on that connection — the overlap Postgres removes in `pg@9`. Await\n   * each write before starting the next.\n   *\n   * Not available when the store was created with `{ history: true }`: a\n   * caller-owned transaction context would let writes happen after capture has\n   * lost its flush point. {@link AdapterHistoryStore} omits this method, while\n   * the runtime guard still throws `ConfigurationError` if the public contract\n   * is bypassed\n   * (`RECORDED_CAPTURE_REQUIRES_CALLBACK_TRANSACTION`) if the check is\n   * suppressed. Use {@link AdapterStore.withRecordedTransaction} on a history-enabled\n   * store, which adopts the same external transaction but flushes recorded-time\n   * capture before the caller commits.\n   *\n   * @throws {ConfigurationError} when the store has history capture enabled\n   *   (use {@link AdapterStore.withRecordedTransaction} instead), or when the backend\n   *   cannot adopt an external transaction — either it is not a Drizzle\n   *   Postgres/SQLite 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   *   `createAdapterStoreWithSchema`). Rolls back the caller's transaction\n   *   without emitting any DDL.\n   */\n  withTransaction(\n    externalTx: TNativeTransaction,\n  ): AdapterTransactionContext<G, TNativeTransaction> {\n    if (this.#captureEnabled) {\n      throw recordedCaptureRequiresCallbackTransactionError();\n    }\n    const adopt = this.#adapterBackend?.adoptTransaction;\n    if (adopt === undefined) {\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   * Adopts a caller-owned transaction while giving recorded-time capture a\n   * flush point before the caller commits. Required when `history: true` is\n   * enabled because returning a long-lived transaction context would let writes\n   * happen after TypeGraph has lost the chance to close/open recorded rows.\n   *\n   * Capture flushes once, when `fn` resolves. The flush seals the capture\n   * session, so a graph write made through the transaction context *after* `fn`\n   * returns (e.g. retaining `tx` and writing once more before the caller's\n   * COMMIT) throws rather than committing uncaptured — the post-flush write\n   * cannot silently diverge history from live state. This sealing behavior is\n   * unchanged by the receipt return.\n   *\n   * Returns a {@link TransactionOutcome} — the adopted path is the only way to\n   * get exactly-once cursors and graph writes atomically on a history store, so\n   * it surfaces the same receipt `transactionWithReceipt` does: `receipt.writes`\n   * for drop detection (a non-delete change that wrote nothing) and\n   * `receipt.recorded` as the per-transaction replay anchor. Destructure\n   * `{ result, receipt }`:\n   *\n   * ```typescript\n   * const { result, receipt } = await store.withRecordedTransaction(\n   *   externalTx,\n   *   async (tx) => tx.nodes.Document.update(documentId, props),\n   * );\n   * ```\n   *\n   * `receipt.recorded` is the recorded commit instant this transaction allocated\n   * for the store's graph at the flush point (when `fn` resolved), and is\n   * `undefined` when nothing was captured — a read-only `fn`, or a non-history\n   * store (where the receipt still counts write intents but there is no recorded\n   * time). To attribute writes when `fn` invokes user code that also\n   * bookkeeps, use `tx.measure((scoped) => ...)` and have that code write\n   * through the `scoped` context (see {@link MeasurableTransactionContext}).\n   *\n   * Write your own relational tables through the **external transaction handle\n   * you passed in** (`externalTx`) — it *is* the pinned connection. `tx.sql` is\n   * unavailable here (it is a fail-loud guard under history capture, since raw\n   * SQL bypasses recorded-time capture, and `AdapterHistoryTransactionContext` types it\n   * `sql?: never`). Writing through `externalTx` is the sanctioned way to get\n   * cross-store atomicity on a history-enabled store:\n   *\n   * ```typescript\n   * // Async driver (Postgres / libsql):\n   * await db.transaction(async (pgTx) => {\n   *   const { receipt } = await store.withRecordedTransaction(pgTx, async (tx) => {\n   *     await tx.nodes.Document.update(documentId, props); // graph write\n   *   });\n   *   await pgTx.insert(streamCursors).values(cursorRow);  // your own table\n   * }); // one COMMIT / ROLLBACK across both layers\n   * ```\n   *\n   * The graph writes and your `externalTx` statements share the caller's one\n   * pinned connection. TypeGraph serializes the statements its collections\n   * issue; sequence your own raw statements (and don't `Promise.all` them with\n   * graph writes) so two queries never race on that connection.\n   */\n  withRecordedTransaction<T>(\n    this: AdapterHistoryStore<G, TNativeTransaction>,\n    externalTx: TNativeTransaction,\n    fn: (\n      tx: MeasurableAdapterHistoryTransactionContext<G, TNativeTransaction>,\n    ) => Promise<T>,\n  ): Promise<TransactionOutcome<T>>;\n\n  withRecordedTransaction<T>(\n    externalTx: TNativeTransaction,\n    fn: (\n      tx: MeasurableAdapterTransactionContext<G, TNativeTransaction>,\n    ) => Promise<T>,\n  ): Promise<TransactionOutcome<T>>;\n\n  async withRecordedTransaction<T>(\n    externalTx: TNativeTransaction,\n    fn:\n      | ((\n          tx: MeasurableAdapterTransactionContext<G, TNativeTransaction>,\n        ) => Promise<T>)\n      | ((\n          tx: MeasurableAdapterHistoryTransactionContext<G, TNativeTransaction>,\n        ) => Promise<T>),\n  ): Promise<TransactionOutcome<T>> {\n    const adopt = this.#adapterBackend?.adoptTransaction;\n    if (adopt === undefined) {\n      throw new ConfigurationError(\n        \"This backend cannot adopt an external transaction for recorded-time capture.\",\n        { capability: \"adoptTransaction\" },\n        {\n          suggestion:\n            \"Use a Drizzle PostgreSQL/SQLite backend with transaction support, or run writes through store.transaction(...).\",\n        },\n      );\n    }\n    const txBackend = adopt(externalTx);\n    if (this.#captureEnabled) {\n      await assertRecordedCaptureTransactionIsolation(txBackend);\n    }\n    // A uniform `flush → RecordedFlushInstants` shape on both branches keeps the\n    // outcome-building path identical; the non-history branch has no recorded\n    // rows to close, so it flushes to an empty instant map.\n    const scope =\n      this.#captureEnabled ?\n        createRecordedTransactionScope(txBackend, this.#sqlSchema())\n      : {\n          backend: txBackend,\n          flush: (): Promise<RecordedFlushInstants> =>\n            Promise.resolve(EMPTY_RECORDED_FLUSH_INSTANTS),\n        };\n    if (this.#captureEnabled) {\n      await lockRecordedGraphWrite(scope.backend, this.graphId);\n    }\n    const receiptRecorder = createTransactionReceiptRecorder();\n    const invoke = fn as (\n      tx: AdapterTransactionContext<G, TNativeTransaction>,\n    ) => Promise<T>;\n    const result = await invoke(\n      this.#buildTransactionContext(\n        scope.backend,\n        externalTx,\n        undefined,\n        receiptRecorder,\n      ),\n    );\n    // Flush allocates the recorded commit instant for this transaction's graph;\n    // `transactionOutcome` reads this store's instant out of the returned map\n    // (undefined when nothing was captured) into `receipt.recorded`.\n    const recordedByGraph = await scope.flush();\n    // Seal the context so a write through a retained `tx` after this returns\n    // fails loud instead of persisting a row the snapshotted receipt can't\n    // count. Under history capture the capture session already sealed on flush\n    // (its guard throws before the live write); this covers the non-history\n    // path, which has no capture session.\n    if (!this.#captureEnabled) receiptRecorder.seal();\n    return transactionOutcome(\n      result,\n      receiptRecorder,\n      recordedByGraph,\n      this.graphId,\n    );\n  }\n\n  /**\n   * Decorates a receipt-enabled transaction `context` with `measure`.\n   * Attribution is structural: `measure` wraps the context's *own* (already\n   * outer-recording) collections a second time with a fresh scope recorder, so a\n   * write through the scoped context counts in the scope and — via the inner\n   * wrapper it delegates to — the outer receipt, while a write through the outer\n   * `context` never reaches the scope recorder. This makes overlapping/concurrent\n   * measures safe by construction (each holds its own scope recorder) and lets\n   * scopes nest: the scoped context is itself decorated, so `scoped.measure(...)`\n   * chains one more wrapper. The scoped context's `getNodeCollection` resolves\n   * against the scope-wrapped map too, so dynamic-kind writes are attributed like\n   * `scoped.nodes.<Kind>`. The scope receipt's `recorded` is always undefined —\n   * the recorded instant is a whole-transaction flush concern.\n   */\n  #attachMeasure(\n    context: AdapterTransactionContext<G, TNativeTransaction>,\n  ): MeasurableAdapterTransactionContext<G, TNativeTransaction> {\n    const measure: ScopedMeasure<\n      MeasurableAdapterTransactionContext<G, TNativeTransaction>\n    > = async (fn) => {\n      const scopeRecorder = createTransactionReceiptRecorder();\n      const { nodes, edges } = wrapTransactionCollections(\n        context.nodes,\n        context.edges,\n        scopeRecorder,\n      );\n      const scoped = this.#attachMeasure(\n        overlayPropertyDescriptors(context, {\n          nodes,\n          edges,\n          getNodeCollection: (kind: string) =>\n            this.#resolveDynamicNodeCollection(nodes, kind),\n        }),\n      );\n      const result = await fn(scoped);\n      return { result, receipt: scopeRecorder.snapshot() };\n    };\n    return overlayPropertyDescriptors(context, { measure });\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. When history capture\n   * is disabled, `sql` is the raw Drizzle handle bound to the same transaction\n   * (#140); when history capture is enabled it is replaced with a fail-loud\n   * guard because raw graph writes would bypass recorded-time capture.\n   */\n  #buildTransactionContext(\n    txBackend: TransactionBackend,\n    sql?: TNativeTransaction,\n    runHooks: OperationHookRunner = this.#immediateHookRunner(),\n    receiptRecorder?: TransactionReceiptRecorder,\n  ): AdapterTransactionContext<G, TNativeTransaction> {\n    // No statistics auto-refresh inside a caller-provided transaction:\n    // ANALYZE from another connection cannot see the uncommitted rows,\n    // so it would only reset the counter without fixing the estimates.\n    const txNodeOperations: NodeOperations = {\n      ...this.#buildNodeOperations(this.#createNodeOperationContext(runHooks)),\n      createQuery: () => this.#createQueryForBackend(txBackend),\n      maybeRefreshStatisticsAfterBulk: undefined,\n    };\n    const txEdgeOperations: EdgeOperations = {\n      ...this.#buildEdgeOperations(this.#createEdgeOperationContext(runHooks)),\n      createQuery: () => this.#createQueryForBackend(txBackend),\n      maybeRefreshStatisticsAfterBulk: undefined,\n    };\n\n    const runNodeOperationHooks = <T>(\n      operation: \"create\" | \"update\" | \"delete\",\n      kind: string,\n      id: string,\n      fn: () => Promise<T>,\n    ): Promise<T> =>\n      runHooks(this.#createOperationContext(operation, \"node\", kind, id), fn);\n\n    let nodes = createNodeCollectionsProxy(\n      this.#graph,\n      this.graphId,\n      this.#registry,\n      txBackend,\n      txNodeOperations,\n    );\n\n    let edges = createEdgeCollectionsProxy(\n      this.#graph,\n      this.graphId,\n      this.#registry,\n      txBackend,\n      txEdgeOperations,\n    );\n\n    if (receiptRecorder !== undefined) {\n      ({ nodes, edges } = wrapTransactionCollections(\n        nodes,\n        edges,\n        receiptRecorder,\n      ));\n    }\n\n    const getNodeCollection = (\n      kind: string,\n    ): DynamicNodeCollection | undefined =>\n      this.#resolveDynamicNodeCollection(nodes, kind);\n\n    // Honest capability discriminant for `tx.sql`. Capture/revision tracking\n    // take precedence because they replace `tx.sql` with a fail-loud guard even\n    // though the transaction itself is real; only a genuinely absent handle is\n    // \"unavailable\" (this method runs on transactional backends — the\n    // non-transactional fallback context is built in #runTransaction).\n    const base = {\n      nodes,\n      edges,\n      backend: createTransactionReadBackend(txBackend),\n      [TRANSACTION_RUNTIME]: { backend: txBackend, runNodeOperationHooks },\n      getNodeCollection,\n    };\n\n    let withSql: AdapterTransactionContext<G, TNativeTransaction>;\n    if (this.#captureEnabled) {\n      withSql = {\n        ...base,\n        sqlAvailability: \"history\",\n      };\n      defineUnavailableSqlGuard(withSql, () => throwHistoryUnsafeSqlAccess());\n    } else if (this.#revisionTrackingEnabled) {\n      withSql = {\n        ...base,\n        sqlAvailability: \"revisionTracking\",\n      };\n      defineUnavailableSqlGuard(withSql, () =>\n        throwRevisionTrackingUnsafeSqlAccess(),\n      );\n    } else if (sql === undefined) {\n      withSql = { ...base, sqlAvailability: \"unavailable\" };\n    } else {\n      withSql = { ...base, sql, sqlAvailability: \"available\" };\n    }\n    Object.defineProperty(withSql, TRANSACTION_RUNTIME, {\n      configurable: false,\n      enumerable: false,\n      writable: false,\n    });\n\n    // Scoped write measurement (`tx.measure`) is only meaningful with a recorder\n    // to scope; the plain `transaction()` path stays free of a `measure` the\n    // caller has no receiver for.\n    return receiptRecorder === undefined ? withSql : (\n        this.#attachMeasure(withSql)\n      );\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      if (this.#revisionTrackingEnabled) {\n        await lockRecordedGraphWrite(target, this.graphId);\n      }\n      const previousRevision =\n        this.#revisionTrackingEnabled && !this.#captureEnabled ?\n          await readRecordedClock(target, this.#sqlSchema(), this.graphId)\n        : undefined;\n      await target.clearGraph(this.graphId);\n      // `clearGraph` deletes the recorded-clock row alongside graph data.\n      // Live revision tracking immediately seeds a fresh anchor so a pre-clear\n      // branch cannot match a now-empty graph. History capture intentionally\n      // preserves its long-standing `recordedNow() === undefined` clear\n      // contract; a pre-clear history branch already carries a non-empty clock\n      // value and therefore still fails the base-version precondition.\n      if (this.#revisionTrackingEnabled && !this.#captureEnabled) {\n        await advanceRevisionClock(\n          target,\n          this.#sqlSchema(),\n          this.graphId,\n          this.#baseBackend.capabilities.transactions,\n          previousRevision,\n        );\n      }\n    };\n\n    await (this.#baseBackend.capabilities.transactions ?\n      this.#baseBackend.transaction(async (tx) => doClear(tx))\n    : doClear(this.#baseBackend));\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.#baseBackend;\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<TRefStore extends StoreCore<G>>(\n    extension: GraphExtension,\n    options?: Readonly<{\n      ref?: StoreRef<TRefStore>;\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<StoreImplementation<G, TNativeTransaction>> {\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        syncStoreReplacementRef(options?.ref, 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    // Provision per-field vector tables + durable markers for any embedding\n    // fields this evolution introduced (idempotent for fields that already\n    // existed). `evolve()` is a privileged migrator path — it commits schema\n    // versions and runs index DDL in eager mode — so emitting the table DDL\n    // here mirrors how `createStoreWithSchema` provisions at first boot, and\n    // keeps a runtime write to a freshly-added embedding field from hitting\n    // an unmaterialized slot. The shared fulltext table needs no such step\n    // (one table for all kinds); vectors are per-`(kind, field)`.\n    await materializeVectorContributions(this.#backend, merged);\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: StoreImplementation<G, TNativeTransaction>,\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<TRefStore extends StoreCore<G>>(\n    names: readonly string[],\n    options?: Readonly<{ ref?: StoreRef<TRefStore> }>,\n  ): Promise<StoreImplementation<G, TNativeTransaction>> {\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<TRefStore extends StoreCore<G>>(\n    names: readonly string[],\n    options?: Readonly<{ ref?: StoreRef<TRefStore> }>,\n  ): Promise<StoreImplementation<G, TNativeTransaction>> {\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.#baseBackend,\n        schemaVersion: activeRow.version,\n      },\n      options ?? {},\n    );\n  }\n\n  /**\n   * Materializes TypeGraph's own base-relation indexes\n   * (`SYSTEM_INDEX_DECLARATIONS`) against the live database.\n   *\n   * Bootstrap DDL runs only on first boot, so a system index shipped in a\n   * newer library version never reaches an already-initialized database on\n   * its own. `createStoreWithSchema` runs this automatically; deployments\n   * that boot with plain `createStore` / `createVerifiedStore` (zero-DDL by\n   * contract) adopt new system indexes by calling this once under a role\n   * that may run DDL. Same status-table, drift-signature, and Postgres\n   * `CREATE INDEX CONCURRENTLY` claim semantics as `materializeIndexes`.\n   */\n  async materializeSystemIndexes(\n    options?: MaterializeSystemIndexesOptions,\n  ): Promise<MaterializeIndexesResult> {\n    const { activeRow } = await this.#loadCaughtUp(\"materialize\");\n    return materializeSystemIndexesImpl(\n      {\n        backend: this.#baseBackend,\n        graphId: this.graphId,\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.#baseBackend;\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-create the per-\n    // field table the strategy owns (libSQL/sqlite-vec also (re)create their\n    // index/vtable here; pgvector's index is built via createVectorIndex\n    // below). `ensureVectorSlotContribution({ force: true })` re-runs the\n    // table DDL AND re-stamps the durable contribution marker at the new\n    // signature, bypassing the drift-guard — this is the sanctioned shape\n    // change. Without the marker reset, the post-reembed runtime assert would\n    // see a stale marker and refuse every write. Backends without the marker\n    // method (custom, pre-#135) fall back to raw recreate DDL.\n    for (const ddl of strategy.buildDropStorage(slot)) {\n      await backend.executeDdl(ddl);\n    }\n    if (backend.ensureVectorSlotContribution === undefined) {\n      for (const contribution of strategy.ownedTables(slot)) {\n        for (const ddl of contribution.createDdl) {\n          await backend.executeDdl(ddl);\n        }\n      }\n    } else {\n      await backend.ensureVectorSlotContribution(slot, { force: true });\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<TRefStore extends StoreCore<G>>(\n    names: readonly string[],\n    options?: Readonly<{\n      ref?: StoreRef<TRefStore>;\n      eager?: MaterializeRemovalsOptions;\n    }>,\n  ): Promise<StoreImplementation<G, TNativeTransaction>> {\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        syncStoreReplacementRef(options?.ref, 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      {\n        graphId: this.graphId,\n        backend: this.#baseBackend,\n        captureRecordedRemovals: this.#captureEnabled,\n        ...(this.#captureEnabled && { recordedSchema: this.#sqlSchema() }),\n      },\n      options ?? {},\n    );\n  }\n\n  async #updateDeprecatedKinds<TRefStore extends StoreCore<G>>(\n    direction: \"add\" | \"remove\",\n    names: readonly string[],\n    options: Readonly<{ ref?: StoreRef<TRefStore> }> | undefined,\n  ): Promise<StoreImplementation<G, TNativeTransaction>> {\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        syncStoreReplacementRef(options?.ref, 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<TRefStore extends StoreCore<G>>(\n    graph: G,\n    ref: StoreRef<TRefStore> | undefined,\n    schemaMetadata: StoreSchemaMetadata = this.#schemaMetadata,\n  ): StoreImplementation<G, TNativeTransaction> {\n    const next: StoreImplementation<G, TNativeTransaction> =\n      this.#adapterBackend === undefined ?\n        new StoreImplementation<G, TNativeTransaction>(\n          graph,\n          this.#baseBackend,\n          this.#options,\n          schemaMetadata,\n        )\n      : new AdapterStoreImplementation(\n          graph,\n          this.#adapterBackend,\n          this.#options,\n          schemaMetadata,\n        );\n    syncStoreReplacementRef(ref, 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  #immediateHookRunner(): OperationHookRunner {\n    return <T>(ctx: OperationHookContext, fn: () => Promise<T>) =>\n      this.#withOperationHooks(ctx, fn);\n  }\n\n  #createNodeOperationContext(\n    runHooks: OperationHookRunner = this.#immediateHookRunner(),\n  ): NodeOperationContext<G> {\n    return {\n      graph: this.#graph,\n      graphId: this.graphId,\n      historyEnabled: this.#captureEnabled,\n      revisionTrackingEnabled: this.#revisionTrackingEnabled,\n      revisionSchema: this.#sqlSchema(),\n      registry: this.#registry,\n      createOperationContext: (operation, entity, kind, id) =>\n        this.#createOperationContext(operation, entity, kind, id),\n      withOperationHooks: runHooks,\n    };\n  }\n\n  #createEdgeOperationContext(\n    runHooks: OperationHookRunner = this.#immediateHookRunner(),\n  ): EdgeOperationContext<G> {\n    return {\n      graph: this.#graph,\n      graphId: this.graphId,\n      historyEnabled: this.#captureEnabled,\n      revisionTrackingEnabled: this.#revisionTrackingEnabled,\n      revisionSchema: this.#sqlSchema(),\n      registry: this.#registry,\n      createOperationContext: (operation, entity, kind, id) =>\n        this.#createOperationContext(operation, entity, kind, id),\n      withOperationHooks: runHooks,\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?.(ctx, asError(error));\n      throw error;\n    }\n  }\n\n  /**\n   * A hook runner for operations that execute INSIDE an explicit\n   * `store.transaction`: `onOperationStart` (and a failed operation's\n   * `onError`) fire immediately — the attempt and the failure are real when\n   * they happen — but a successful operation's `onOperationEnd` is only\n   * BUFFERED. `transaction()` flushes the buffer after the backend COMMIT\n   * succeeds, or converts every buffered success into `onError` when the\n   * transaction fails, so `onOperationEnd` always means durably committed\n   * even for operations nested in a caller-controlled transaction.\n   */\n  #createBufferedHookRunner(\n    pending: PendingOperationOutcome[],\n  ): OperationHookRunner {\n    return async <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        pending.push({ ctx, durationMs: Date.now() - startTime });\n        return result;\n      } catch (error) {\n        this.#hooks.onError?.(ctx, asError(error));\n        throw error;\n      }\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<CoordinateState extends QueryCoordinateState = \"open\">(\n    backend: GraphBackend | TransactionBackend,\n    sealedCoordinate?: ReadCoordinate,\n  ): InitialQueryBuilder<G, CoordinateState> {\n    return createInternalQueryBuilder<G, CoordinateState>(\n      this.graphId,\n      this.#registry,\n      {\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        ...(this.#recordedReadBinding !== undefined && {\n          recordedReadBinding: this.#recordedReadBinding,\n        }),\n        ...(sealedCoordinate !== undefined && { sealedCoordinate }),\n      },\n    );\n  }\n}\n\n/** Runtime implementation for the explicit adapter-interoperability surface. */\nclass AdapterStoreImplementation<\n  G extends GraphDef,\n  TNativeTransaction,\n> extends StoreImplementation<G, TNativeTransaction> {\n  readonly backend: GraphBackend | HistoryStoreBackend;\n\n  constructor(\n    graph: G,\n    backend: AdapterBackend<TNativeTransaction>,\n    options?: StoreOptions,\n    schemaMetadata?: StoreSchemaMetadata,\n  ) {\n    super(graph, backend, options, schemaMetadata, backend);\n    // Projections remain mutable while they serve as internal overlay targets;\n    // freeze only the final object exposed at this public boundary.\n    this.backend =\n      options?.history === true ?\n        createHistoryStoreBackendProjection(this[STORE_RUNTIME].backend)\n      : Object.freeze(\n          createGraphBackendProjection(this[STORE_RUNTIME].backend),\n        );\n  }\n\n  override async evolve<TRefStore extends StoreCore<G>>(\n    extension: GraphExtension,\n    options?: Readonly<{\n      ref?: StoreRef<TRefStore>;\n      eager?: MaterializeIndexesOptions;\n    }>,\n  ): Promise<AdapterStoreImplementation<G, TNativeTransaction>> {\n    return this.#withAdapterReplacement(options?.ref, (replacementRef) =>\n      super.evolve(\n        extension,\n        options?.eager === undefined ?\n          { ref: replacementRef }\n        : { eager: options.eager, ref: replacementRef },\n      ),\n    );\n  }\n\n  override async deprecateKinds<TRefStore extends StoreCore<G>>(\n    names: readonly string[],\n    options?: Readonly<{\n      ref?: StoreRef<TRefStore>;\n    }>,\n  ): Promise<AdapterStoreImplementation<G, TNativeTransaction>> {\n    return this.#withAdapterReplacement(options?.ref, (replacementRef) =>\n      super.deprecateKinds(names, { ref: replacementRef }),\n    );\n  }\n\n  override async undeprecateKinds<TRefStore extends StoreCore<G>>(\n    names: readonly string[],\n    options?: Readonly<{\n      ref?: StoreRef<TRefStore>;\n    }>,\n  ): Promise<AdapterStoreImplementation<G, TNativeTransaction>> {\n    return this.#withAdapterReplacement(options?.ref, (replacementRef) =>\n      super.undeprecateKinds(names, { ref: replacementRef }),\n    );\n  }\n\n  override async removeKinds<TRefStore extends StoreCore<G>>(\n    names: readonly string[],\n    options?: Readonly<{\n      ref?: StoreRef<TRefStore>;\n      eager?: MaterializeRemovalsOptions;\n    }>,\n  ): Promise<AdapterStoreImplementation<G, TNativeTransaction>> {\n    return this.#withAdapterReplacement(options?.ref, (replacementRef) =>\n      super.removeKinds(\n        names,\n        options?.eager === undefined ?\n          { ref: replacementRef }\n        : { eager: options.eager, ref: replacementRef },\n      ),\n    );\n  }\n\n  async #withAdapterReplacement<TRefStore extends StoreCore<G>>(\n    ref: StoreRef<TRefStore> | undefined,\n    operation: (ref: StoreRef<Store<G>>) => Promise<Store<G>>,\n  ): Promise<AdapterStoreImplementation<G, TNativeTransaction>> {\n    const tracked = createTrackedReplacementRef<G>(this);\n    try {\n      await operation(tracked.ref);\n    } catch (error) {\n      if (tracked.wasReplaced()) {\n        const replacement = requireAdapterStoreImplementation<\n          G,\n          TNativeTransaction\n        >(tracked.ref.current);\n        syncAdapterReplacementRef(ref, replacement);\n      }\n      throw error;\n    }\n    const replacement = requireAdapterStoreImplementation<\n      G,\n      TNativeTransaction\n    >(tracked.ref.current);\n    syncAdapterReplacementRef(ref, replacement);\n    return replacement;\n  }\n}\n\nfunction createTrackedReplacementRef<G extends GraphDef>(\n  initial: Store<G>,\n): Readonly<{\n  ref: StoreRef<Store<G>>;\n  wasReplaced: () => boolean;\n}> {\n  let current = initial;\n  let replaced = false;\n  return {\n    ref: {\n      get current(): Store<G> {\n        return current;\n      },\n      set current(next: Store<G>) {\n        current = next;\n        replaced = true;\n      },\n    },\n    wasReplaced: () => replaced,\n  };\n}\n\nfunction syncAdapterReplacementRef<\n  G extends GraphDef,\n  TNativeTransaction,\n  TRefStore extends StoreCore<G>,\n>(\n  ref: StoreRef<TRefStore> | undefined,\n  replacement: AdapterStoreImplementation<G, TNativeTransaction>,\n): void {\n  if (ref === undefined) return;\n  // Public StoreEvolution only accepts refs whose value is a supertype of the\n  // returned Store flavor. This implementation class is deliberately broader\n  // because one runtime class backs live, recorded-read, and history overloads.\n  ref.current = replacement as unknown as TRefStore;\n}\n\nfunction requireAdapterStoreImplementation<\n  G extends GraphDef,\n  TNativeTransaction,\n>(store: Store<G>): AdapterStoreImplementation<G, TNativeTransaction> {\n  if (isAdapterStoreImplementation<G, TNativeTransaction>(store)) return store;\n  throw new ConfigurationError(\n    \"Adapter store replacement lost its adapter capabilities.\",\n    { code: \"ADAPTER_STORE_REPLACEMENT_INVARIANT\" },\n  );\n}\n\nfunction isAdapterStoreImplementation<G extends GraphDef, TNativeTransaction>(\n  store: Store<G>,\n): store is AdapterStoreImplementation<G, TNativeTransaction> {\n  return store instanceof AdapterStoreImplementation;\n}\n\nfunction asAdapterStoreSurface<G extends GraphDef, TNativeTransaction>(\n  store: AdapterStoreImplementation<G, TNativeTransaction>,\n):\n  | AdapterStore<G, TNativeTransaction>\n  | AdapterHistoryStore<G, TNativeTransaction>\n  | AdapterRecordedReadStore<G, TNativeTransaction> {\n  // One runtime implementation backs the three option-discriminated overloads.\n  // It constructs the matching backend projection and replacement flavor, but\n  // TypeScript cannot derive that structural union from constructor options.\n  return store as unknown as\n    | AdapterStore<G, TNativeTransaction>\n    | AdapterHistoryStore<G, TNativeTransaction>\n    | AdapterRecordedReadStore<G, TNativeTransaction>;\n}\n\n// ============================================================\n// Factory Function\n// ============================================================\n\nexport type AdapterHistoryTransactionContext<\n  G extends GraphDef,\n  TNativeTransaction,\n> = Omit<\n  AdapterTransactionContext<G, TNativeTransaction>,\n  \"sql\" | \"sqlAvailability\"\n> &\n  Readonly<{\n    sqlAvailability: \"history\";\n  }>;\n\n/**\n * The {@link AdapterHistoryTransactionContext} handed to a `withRecordedTransaction`\n * callback, extended with {@link ScopedMeasure}. Its `measure` scopes to a child\n * {@link MeasurableAdapterHistoryTransactionContext} (so nested scopes keep the\n * history-safe absent-`sql` / backend typing). Assignable to\n * {@link MeasurableTransactionContext} (and hence to {@link TransactionContext}),\n * so a projector helper typed against either still accepts it.\n */\nexport type MeasurableAdapterHistoryTransactionContext<\n  G extends GraphDef,\n  TNativeTransaction,\n> = AdapterHistoryTransactionContext<G, TNativeTransaction> &\n  Readonly<{\n    measure: ScopedMeasure<\n      MeasurableAdapterHistoryTransactionContext<G, TNativeTransaction>\n    >;\n  }>;\n\nexport type AdapterRecordedReadStore<\n  G extends GraphDef,\n  TNativeTransaction,\n> = StoreCore<G> &\n  StoreEvolution<G, AdapterRecordedReadStore<G, TNativeTransaction>> &\n  AdapterStoreTransactions<G, TNativeTransaction> &\n  Readonly<{\n    backend: GraphBackend;\n    recordedReadBound: true;\n  }>;\n\nexport type RecordedReadStore<G extends GraphDef> = StoreCore<G> &\n  StoreTransactions<G> &\n  StoreEvolution<G, RecordedReadStore<G>> &\n  Readonly<{ recordedReadBound: true }>;\n\nexport type HistoryStore<G extends GraphDef> = StoreCore<G> &\n  StoreTransactions<G> &\n  StoreEvolution<G, HistoryStore<G>> &\n  Readonly<{\n    historyEnabled: true;\n    recordedReadBound: true;\n  }>;\n\nexport type AdapterHistoryStore<\n  G extends GraphDef,\n  TNativeTransaction,\n> = StoreCore<G> &\n  StoreEvolution<G, AdapterHistoryStore<G, TNativeTransaction>> &\n  AdapterHistoryStoreTransactions<G, TNativeTransaction> &\n  Readonly<{\n    backend: HistoryStoreBackend;\n    historyEnabled: true;\n    recordedReadBound: true;\n  }>;\n\ntype AdapterHistoryStoreTransactions<\n  G extends GraphDef,\n  TNativeTransaction,\n> = Readonly<{\n  transaction: <T>(\n    fn: (\n      tx: AdapterHistoryTransactionContext<G, TNativeTransaction>,\n    ) => Promise<T>,\n    options?: TransactionOptions,\n  ) => Promise<T>;\n  transactionWithReceipt: <T>(\n    fn: (\n      tx: MeasurableAdapterHistoryTransactionContext<G, TNativeTransaction>,\n    ) => Promise<T>,\n    options?: TransactionOptions,\n  ) => Promise<TransactionOutcome<T>>;\n  withRecordedTransaction: <T>(\n    externalTransaction: TNativeTransaction,\n    fn: (\n      tx: MeasurableAdapterHistoryTransactionContext<G, TNativeTransaction>,\n    ) => Promise<T>,\n  ) => Promise<TransactionOutcome<T>>;\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: HistoryStoreOptions,\n): HistoryStore<G>;\nexport function createStore<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n  options: RecordedReadStoreOptions,\n): RecordedReadStore<G>;\nexport function createStore<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n  options?: UnboundLiveStoreOptions,\n): Store<G>;\nexport function createStore<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n  options: LiveStoreOptions | undefined,\n): Store<G> | RecordedReadStore<G>;\nexport function createStore<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n  options: StoreOptions | undefined,\n): Store<G> | HistoryStore<G> | RecordedReadStore<G>;\nexport function createStore<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n  options?: StoreOptions,\n): Store<G> | HistoryStore<G> | RecordedReadStore<G> {\n  return new StoreImplementation<G>(graph, backend, options);\n}\n\nexport function createAdapterStore<G extends GraphDef, TNativeTransaction>(\n  graph: G,\n  backend: AdapterBackend<TNativeTransaction>,\n  options: HistoryStoreOptions,\n): AdapterHistoryStore<G, TNativeTransaction>;\nexport function createAdapterStore<G extends GraphDef, TNativeTransaction>(\n  graph: G,\n  backend: AdapterBackend<TNativeTransaction>,\n  options: RecordedReadStoreOptions,\n): AdapterRecordedReadStore<G, TNativeTransaction>;\nexport function createAdapterStore<G extends GraphDef, TNativeTransaction>(\n  graph: G,\n  backend: AdapterBackend<TNativeTransaction>,\n  options?: UnboundLiveStoreOptions,\n): AdapterStore<G, TNativeTransaction>;\nexport function createAdapterStore<G extends GraphDef, TNativeTransaction>(\n  graph: G,\n  backend: AdapterBackend<TNativeTransaction>,\n  options: LiveStoreOptions | undefined,\n):\n  | AdapterStore<G, TNativeTransaction>\n  | AdapterRecordedReadStore<G, TNativeTransaction>;\nexport function createAdapterStore<G extends GraphDef, TNativeTransaction>(\n  graph: G,\n  backend: AdapterBackend<TNativeTransaction>,\n  options: StoreOptions | undefined,\n):\n  | AdapterStore<G, TNativeTransaction>\n  | AdapterHistoryStore<G, TNativeTransaction>\n  | AdapterRecordedReadStore<G, TNativeTransaction>;\nexport function createAdapterStore<G extends GraphDef, TNativeTransaction>(\n  graph: G,\n  backend: AdapterBackend<TNativeTransaction>,\n  options?: StoreOptions,\n):\n  | AdapterStore<G, TNativeTransaction>\n  | AdapterHistoryStore<G, TNativeTransaction>\n  | AdapterRecordedReadStore<G, TNativeTransaction> {\n  return asAdapterStoreSurface(\n    new AdapterStoreImplementation(graph, backend, options),\n  );\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 * Privileged boot step: materialize every embedding `(kind, field)` slot's\n * per-field vector table + durable marker, enumerated from the graph via\n * {@link resolveGraphVectorSlots}. The vector counterpart of\n * {@link materializeRuntimeContributions} (fulltext) — runs once under the\n * privileged role inside `createStoreWithSchema` so a least-privilege runtime\n * can assert the markers (a cached SELECT) and write embeddings without\n * holding `CREATE` on the schema. No-op on backends without vector support\n * (both vector contribution methods absent, or `capabilities.vector`\n * unsupported) and for graphs that declare no embedding fields. Built-in\n * backends use the batch method; the singular loop is the compatibility path.\n *\n * `onDrift: \"skip\"`: a slot already provisioned at a DIFFERENT shape (the\n * declared dimension changed since the table was created) is warned about\n * and left untouched rather than refused — boot must stay reachable so the\n * operator can run `store.reembedVectorField(kind, fieldPath)`, the\n * sanctioned recreate-and-restamp path. Until then, writes to that slot\n * fail with a typed `stale` StoreNotInitializedError.\n */\nasync function materializeVectorContributions(\n  backend: GraphBackend,\n  graph: GraphDef,\n): Promise<void> {\n  if (backend.capabilities.vector?.supported !== true) return;\n  const slots = resolveGraphVectorSlots(graph);\n  const ensureVectorSlotContributions = backend.ensureVectorSlotContributions;\n  if (ensureVectorSlotContributions !== undefined) {\n    await ensureVectorSlotContributions(slots, { onDrift: \"skip\" });\n    return;\n  }\n  const ensureVectorSlotContribution = backend.ensureVectorSlotContribution;\n  if (ensureVectorSlotContribution === undefined) return;\n  for (const slot of slots) {\n    await ensureVectorSlotContribution(slot, { onDrift: \"skip\" });\n  }\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: HistoryStoreOptions & SchemaManagerOptions,\n): Promise<[HistoryStore<G>, SchemaValidationResult]>;\nexport async function createStoreWithSchema<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n  options: RecordedReadStoreOptions & SchemaManagerOptions,\n): Promise<[RecordedReadStore<G>, SchemaValidationResult]>;\nexport async function createStoreWithSchema<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n  options?: UnboundLiveStoreOptions & SchemaManagerOptions,\n): Promise<[Store<G>, SchemaValidationResult]>;\nexport async function createStoreWithSchema<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n  options: (LiveStoreOptions & SchemaManagerOptions) | undefined,\n): Promise<[Store<G> | RecordedReadStore<G>, SchemaValidationResult]>;\nexport async function createStoreWithSchema<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n  options: (StoreOptions & SchemaManagerOptions) | undefined,\n): Promise<\n  [Store<G> | HistoryStore<G> | RecordedReadStore<G>, SchemaValidationResult]\n>;\nexport async function createStoreWithSchema<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n  options?: StoreOptions & SchemaManagerOptions,\n): Promise<\n  [Store<G> | HistoryStore<G> | RecordedReadStore<G>, SchemaValidationResult]\n> {\n  const prepared = await prepareStoreWithSchema(graph, backend, options);\n  return [\n    new StoreImplementation(\n      prepared.graph,\n      backend,\n      options,\n      prepared.schemaMetadata,\n    ),\n    prepared.result,\n  ];\n}\n\ntype PreparedStore<G extends GraphDef> = Readonly<{\n  graph: G;\n  result: SchemaValidationResult;\n  schemaMetadata: StoreSchemaMetadata;\n}>;\n\nasync function prepareStoreWithSchema<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n  options: (StoreOptions & SchemaManagerOptions) | undefined,\n): Promise<PreparedStore<G>> {\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  // Provision every embedding field's per-`(kind, field)` vector table +\n  // durable marker under the privileged role, so a least-privilege runtime\n  // asserts the markers (SELECT) and writes embeddings without `CREATE`.\n  await materializeVectorContributions(backend, merged);\n  // Bring the base-relation system indexes up to this library version.\n  // Bootstrap DDL only runs on first boot, so an index shipped in a newer\n  // version reaches already-initialized databases here — this is the same\n  // privileged-boot step the contributions above use. `systemIndexes:\n  // \"skip\"` defers to an out-of-band store.materializeSystemIndexes()\n  // for deployments that must not run index builds inline at boot.\n  if (options?.systemIndexes !== \"skip\") {\n    await materializeSystemIndexesOnBoot(backend, merged.id, result);\n  }\n\n  return {\n    graph: merged,\n    result,\n    schemaMetadata: schemaMetadataForResult(activeRow, result),\n  };\n}\n\nexport async function createAdapterStoreWithSchema<\n  G extends GraphDef,\n  TNativeTransaction,\n>(\n  graph: G,\n  backend: AdapterBackend<TNativeTransaction>,\n  options: HistoryStoreOptions & SchemaManagerOptions,\n): Promise<\n  [AdapterHistoryStore<G, TNativeTransaction>, SchemaValidationResult]\n>;\nexport async function createAdapterStoreWithSchema<\n  G extends GraphDef,\n  TNativeTransaction,\n>(\n  graph: G,\n  backend: AdapterBackend<TNativeTransaction>,\n  options: RecordedReadStoreOptions & SchemaManagerOptions,\n): Promise<\n  [AdapterRecordedReadStore<G, TNativeTransaction>, SchemaValidationResult]\n>;\nexport async function createAdapterStoreWithSchema<\n  G extends GraphDef,\n  TNativeTransaction,\n>(\n  graph: G,\n  backend: AdapterBackend<TNativeTransaction>,\n  options?: UnboundLiveStoreOptions & SchemaManagerOptions,\n): Promise<[AdapterStore<G, TNativeTransaction>, SchemaValidationResult]>;\nexport async function createAdapterStoreWithSchema<\n  G extends GraphDef,\n  TNativeTransaction,\n>(\n  graph: G,\n  backend: AdapterBackend<TNativeTransaction>,\n  options: (LiveStoreOptions & SchemaManagerOptions) | undefined,\n): Promise<\n  [\n    (\n      | AdapterStore<G, TNativeTransaction>\n      | AdapterRecordedReadStore<G, TNativeTransaction>\n    ),\n    SchemaValidationResult,\n  ]\n>;\nexport async function createAdapterStoreWithSchema<\n  G extends GraphDef,\n  TNativeTransaction,\n>(\n  graph: G,\n  backend: AdapterBackend<TNativeTransaction>,\n  options: (StoreOptions & SchemaManagerOptions) | undefined,\n): Promise<\n  [\n    (\n      | AdapterStore<G, TNativeTransaction>\n      | AdapterHistoryStore<G, TNativeTransaction>\n      | AdapterRecordedReadStore<G, TNativeTransaction>\n    ),\n    SchemaValidationResult,\n  ]\n>;\nexport async function createAdapterStoreWithSchema<\n  G extends GraphDef,\n  TNativeTransaction,\n>(\n  graph: G,\n  backend: AdapterBackend<TNativeTransaction>,\n  options?: StoreOptions & SchemaManagerOptions,\n): Promise<\n  [\n    (\n      | AdapterStore<G, TNativeTransaction>\n      | AdapterHistoryStore<G, TNativeTransaction>\n      | AdapterRecordedReadStore<G, TNativeTransaction>\n    ),\n    SchemaValidationResult,\n  ]\n> {\n  const prepared = await prepareStoreWithSchema(graph, backend, options);\n  return [\n    asAdapterStoreSurface(\n      new AdapterStoreImplementation(\n        prepared.graph,\n        backend,\n        options,\n        prepared.schemaMetadata,\n      ),\n    ),\n    prepared.result,\n  ];\n}\n\n/**\n * Boot-path system-index materialization. Lenient where the explicit\n * `store.materializeSystemIndexes()` API is strict:\n *\n * - Backends without `executeDdl` / status primitives are skipped —\n *   their deployments keep the bootstrap-only behavior they had before\n *   system indexes were materialized at boot, instead of failing to boot.\n * - Skipped when the schema gate did not pass (`\"breaking\"`).\n * - Individual index failures degrade to a warning: system indexes are a\n *   performance concern, and a store that cannot build one must still\n *   come up (the operator retries via `store.materializeSystemIndexes()`).\n */\nasync function materializeSystemIndexesOnBoot(\n  backend: GraphBackend,\n  graphId: string,\n  result: SchemaValidationResult,\n): Promise<void> {\n  if (result.status === \"breaking\") return;\n  if (!backendSupportsIndexMaterialization(backend)) return;\n  const schemaVersion =\n    result.status === \"migrated\" ? result.toVersion : result.version;\n  try {\n    const { results } = await materializeSystemIndexesImpl(\n      { backend: asRawBackend(backend), graphId, schemaVersion },\n      {},\n    );\n    const failed = results.filter(\n      (entryResult) => entryResult.status === \"failed\",\n    );\n    if (failed.length === 0) return;\n    console.warn(\n      `[typegraph] ${String(failed.length)} system index(es) failed to ` +\n        `materialize at boot (${failed\n          .map((entryResult) => entryResult.indexName)\n          .join(\", \")}); the store is usable but the affected access paths ` +\n        \"fall back to scans. Retry via store.materializeSystemIndexes().\",\n      failed[0]?.error,\n    );\n  } catch (error) {\n    // Leniency must hold for infrastructure throws too (status-table\n    // ensure/preload/record failures, claim writes) — not only per-index\n    // build failures. A store that booted on the previous version must\n    // still come up after an upgrade; the operator retries explicitly.\n    console.warn(\n      \"[typegraph] system-index materialization failed at boot; the store \" +\n        \"is usable but new system indexes were not adopted. Retry via \" +\n        \"store.materializeSystemIndexes().\",\n      error,\n    );\n  }\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: HistoryStoreOptions,\n): Promise<[HistoryStore<G>, SchemaValidationResult]>;\nexport async function createVerifiedStore<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n  options: RecordedReadStoreOptions,\n): Promise<[RecordedReadStore<G>, SchemaValidationResult]>;\nexport async function createVerifiedStore<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n  options?: UnboundLiveStoreOptions,\n): Promise<[Store<G>, SchemaValidationResult]>;\nexport async function createVerifiedStore<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n  options: LiveStoreOptions | undefined,\n): Promise<[Store<G> | RecordedReadStore<G>, SchemaValidationResult]>;\nexport async function createVerifiedStore<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n  options: StoreOptions | undefined,\n): Promise<\n  [Store<G> | HistoryStore<G> | RecordedReadStore<G>, SchemaValidationResult]\n>;\nexport async function createVerifiedStore<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n  options?: StoreOptions,\n): Promise<\n  [Store<G> | HistoryStore<G> | RecordedReadStore<G>, SchemaValidationResult]\n> {\n  const prepared = await prepareVerifiedStore(graph, backend);\n  return [\n    new StoreImplementation(\n      prepared.graph,\n      backend,\n      options,\n      prepared.schemaMetadata,\n    ),\n    prepared.result,\n  ];\n}\n\nasync function prepareVerifiedStore<G extends GraphDef>(\n  graph: G,\n  backend: GraphBackend,\n): Promise<PreparedStore<G>> {\n  const {\n    graph: merged,\n    activeRow,\n    result,\n  } = await loadAndVerifyGraph(backend, graph);\n  return {\n    graph: merged,\n    result,\n    schemaMetadata: schemaMetadataFromRow(activeRow),\n  };\n}\n\nexport async function createVerifiedAdapterStore<\n  G extends GraphDef,\n  TNativeTransaction,\n>(\n  graph: G,\n  backend: AdapterBackend<TNativeTransaction>,\n  options: HistoryStoreOptions,\n): Promise<\n  [AdapterHistoryStore<G, TNativeTransaction>, SchemaValidationResult]\n>;\nexport async function createVerifiedAdapterStore<\n  G extends GraphDef,\n  TNativeTransaction,\n>(\n  graph: G,\n  backend: AdapterBackend<TNativeTransaction>,\n  options: RecordedReadStoreOptions,\n): Promise<\n  [AdapterRecordedReadStore<G, TNativeTransaction>, SchemaValidationResult]\n>;\nexport async function createVerifiedAdapterStore<\n  G extends GraphDef,\n  TNativeTransaction,\n>(\n  graph: G,\n  backend: AdapterBackend<TNativeTransaction>,\n  options?: UnboundLiveStoreOptions,\n): Promise<[AdapterStore<G, TNativeTransaction>, SchemaValidationResult]>;\nexport async function createVerifiedAdapterStore<\n  G extends GraphDef,\n  TNativeTransaction,\n>(\n  graph: G,\n  backend: AdapterBackend<TNativeTransaction>,\n  options: LiveStoreOptions | undefined,\n): Promise<\n  [\n    (\n      | AdapterStore<G, TNativeTransaction>\n      | AdapterRecordedReadStore<G, TNativeTransaction>\n    ),\n    SchemaValidationResult,\n  ]\n>;\nexport async function createVerifiedAdapterStore<\n  G extends GraphDef,\n  TNativeTransaction,\n>(\n  graph: G,\n  backend: AdapterBackend<TNativeTransaction>,\n  options: StoreOptions | undefined,\n): Promise<\n  [\n    (\n      | AdapterStore<G, TNativeTransaction>\n      | AdapterHistoryStore<G, TNativeTransaction>\n      | AdapterRecordedReadStore<G, TNativeTransaction>\n    ),\n    SchemaValidationResult,\n  ]\n>;\nexport async function createVerifiedAdapterStore<\n  G extends GraphDef,\n  TNativeTransaction,\n>(\n  graph: G,\n  backend: AdapterBackend<TNativeTransaction>,\n  options?: StoreOptions,\n): Promise<\n  [\n    (\n      | AdapterStore<G, TNativeTransaction>\n      | AdapterHistoryStore<G, TNativeTransaction>\n      | AdapterRecordedReadStore<G, TNativeTransaction>\n    ),\n    SchemaValidationResult,\n  ]\n> {\n  const prepared = await prepareVerifiedStore(graph, backend);\n  return [\n    asAdapterStoreSurface(\n      new AdapterStoreImplementation(\n        prepared.graph,\n        backend,\n        options,\n        prepared.schemaMetadata,\n      ),\n    ),\n    prepared.result,\n  ];\n}\n"]}