@nicia-ai/typegraph 0.49.0 → 0.51.0

package/dist/chunk-MRDBBHIZ.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/errors/index.ts"],"names":[],"mappings":";;;AA0DA,SAAS,YAAY,KAAA,EAAwB;AAC3C,EAAA,IAAI,iBAAiB,KAAA,EAAO;AAC1B,IAAA,OAAO,KAAA,CAAM,SAAS,KAAA,CAAM,OAAA;AAAA,EAC9B;AACA,EAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,IACE,OAAO,UAAU,QAAA,IACjB,OAAO,UAAU,SAAA,IACjB,OAAO,UAAU,QAAA,EACjB;AACA,IAAA,OAAO,OAAO,KAAK,CAAA;AAAA,EACrB;AACA,EAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,IAAA,OAAO,MAAM,WAAA,IAAe,QAAA;AAAA,EAC9B;AACA,EAAA,IAAI,UAAU,MAAA,EAAW;AACvB,IAAA,OAAO,eAAA;AAAA,EACT;AAEA,EAAA,IAAI;AACF,IAAA,OAAO,IAAA,CAAK,UAAU,KAAK,CAAA;AAAA,EAC7B,SAAS,KAAA,EAAO;AACd,IAAA,OAAO,CAAA,sBAAA,EACL,KAAA,YAAiB,KAAA,GAAQ,KAAA,CAAM,UAAU,eAC3C,CAAA,CAAA;AAAA,EACF;AACF;AAYO,IAAM,cAAA,GAAN,cAA6B,KAAA,CAAM;AAAA;AAAA,EAE/B,IAAA;AAAA;AAAA,EAGA,QAAA;AAAA;AAAA,EAGA,OAAA;AAAA;AAAA,EAGA,UAAA;AAAA,EAET,WAAA,CAAY,OAAA,EAAiB,IAAA,EAAc,OAAA,EAAgC;AACzE,IAAA,KAAA,CAAM,OAAA,EAAS,QAAQ,KAAA,GAAQ,EAAE,OAAO,OAAA,CAAQ,KAAA,KAAU,MAAS,CAAA;AACnE,IAAA,IAAA,CAAK,IAAA,GAAO,gBAAA;AACZ,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,WAAW,OAAA,CAAQ,QAAA;AACxB,IAAA,IAAA,CAAK,UAAU,MAAA,CAAO,MAAA,CAAO,OAAA,CAAQ,OAAA,IAAW,EAAE,CAAA;AAClD,IAAA,IAAI,OAAA,CAAQ,eAAe,MAAA,EAAW;AACpC,MAAA,IAAA,CAAK,aAAa,OAAA,CAAQ,UAAA;AAAA,IAC5B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,aAAA,GAAwB;AACtB,IAAA,IAAI,KAAK,UAAA,EAAY;AACnB,MAAA,OAAO,CAAA,EAAG,KAAK,OAAO;;AAAA,YAAA,EAAmB,KAAK,UAAU,CAAA,CAAA;AAAA,IAC1D;AACA,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,WAAA,GAAsB;AACpB,IAAA,MAAM,KAAA,GAAQ;AAAA,MACZ,CAAA,CAAA,EAAI,IAAA,CAAK,IAAI,CAAA,EAAA,EAAK,KAAK,OAAO,CAAA,CAAA;AAAA,MAC9B,CAAA,YAAA,EAAe,KAAK,QAAQ,CAAA;AAAA,KAC9B;AAEA,IAAA,IAAI,KAAK,UAAA,EAAY;AACnB,MAAA,KAAA,CAAM,IAAA,CAAK,CAAA,cAAA,EAAiB,IAAA,CAAK,UAAU,CAAA,CAAE,CAAA;AAAA,IAC/C;AAEA,IAAA,MAAM,UAAA,GAAa,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,OAAO,CAAA;AAC3C,IAAA,IAAI,UAAA,CAAW,SAAS,CAAA,EAAG;AACzB,MAAA,KAAA,CAAM,KAAK,CAAA,WAAA,EAAc,IAAA,CAAK,UAAU,IAAA,CAAK,OAAO,CAAC,CAAA,CAAE,CAAA;AAAA,IACzD;AAEA,IAAA,IAAI,KAAK,KAAA,EAAO;AACd,MAAA,KAAA,CAAM,KAAK,CAAA,SAAA,EAAY,WAAA,CAAY,IAAA,CAAK,KAAK,CAAC,CAAA,CAAE,CAAA;AAAA,IAClD;AAEA,IAAA,OAAO,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA,EACxB;AACF;AAoCO,IAAM,6BAAA,GAAgC;AAkBtC,IAAM,mCAAA,GACX;AAWK,IAAM,2BAAA,GAA8B;AAcpC,IAAM,0BAAA,GAA6B;AAiCnC,IAAM,eAAA,GAAN,cAA8B,cAAA,CAAe;AAAA,EAGlD,WAAA,CACE,OAAA,EACA,OAAA,EACA,OAAA,EACA;AACA,IAAA,MAAM,YACJ,OAAA,CAAQ,MAAA,CAAO,MAAA,GAAS,CAAA,GACtB,QAAQ,MAAA,CAAO,GAAA,CAAI,CAAC,KAAA,KAAU,MAAM,IAAA,IAAQ,QAAQ,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA,GAC/D,SAAA;AAEJ,IAAA,KAAA,CAAM,SAAS,kBAAA,EAAoB;AAAA,MACjC,OAAA;AAAA,MACA,QAAA,EAAU,MAAA;AAAA,MACV,UAAA,EACE,OAAA,EAAS,UAAA,IACT,CAAA,4BAAA,EAA+B,SAAS,CAAA,4DAAA,CAAA;AAAA,MAC1C,OAAO,OAAA,EAAS;AAAA,KACjB,CAAA;AACD,IAAA,IAAA,CAAK,IAAA,GAAO,iBAAA;AAAA,EACd;AACF;AA4BO,IAAM,iBAAA,GAAN,cAAgC,cAAA,CAAe;AAAA,EAGpD,WAAA,CAAY,IAAA,EAAc,EAAA,EAAY,OAAA,EAA+B;AACnE,IAAA,KAAA,CAAM,CAAA,gBAAA,EAAmB,IAAI,CAAA,CAAA,EAAI,EAAE,IAAI,gBAAA,EAAkB;AAAA,MACvD,OAAA,EAAS,EAAE,IAAA,EAAM,EAAA,EAAG;AAAA,MACpB,QAAA,EAAU,MAAA;AAAA,MACV,UAAA,EAAY,uBAAuB,EAAE,CAAA,kCAAA,CAAA;AAAA,MACrC,OAAO,OAAA,EAAS;AAAA,KACjB,CAAA;AACD,IAAA,IAAA,CAAK,IAAA,GAAO,mBAAA;AAAA,EACd;AACF;AAaO,IAAM,iBAAA,GAAN,cAAgC,cAAA,CAAe;AAAA,EAGpD,WAAA,CAAY,IAAA,EAAc,EAAA,EAAY,OAAA,EAA+B;AACnE,IAAA,KAAA,CAAM,CAAA,gBAAA,EAAmB,IAAI,CAAA,CAAA,EAAI,EAAE,IAAI,gBAAA,EAAkB;AAAA,MACvD,OAAA,EAAS,EAAE,IAAA,EAAM,EAAA,EAAG;AAAA,MACpB,QAAA,EAAU,MAAA;AAAA,MACV,UAAA,EAAY,uBAAuB,EAAE,CAAA,kCAAA,CAAA;AAAA,MACrC,OAAO,OAAA,EAAS;AAAA,KACjB,CAAA;AACD,IAAA,IAAA,CAAK,IAAA,GAAO,mBAAA;AAAA,EACd;AACF;AAoBO,IAAM,iBAAA,GAAN,cAAgC,cAAA,CAAe;AAAA,EAE3C,QAAA;AAAA,EACA,MAAA;AAAA,EAET,WAAA,CACE,QAAA,EACA,MAAA,EACA,OAAA,EAKA;AACA,IAAA,MAAM,QACJ,OAAA,EAAS,OAAA,KAAY,SAAY,EAAA,GAAK,CAAA,WAAA,EAAc,QAAQ,OAAO,CAAA,CAAA,CAAA;AACrE,IAAA,KAAA;AAAA,MACE,CAAA,EAAG,WAAW,MAAA,GAAS,MAAA,GAAS,MAAM,CAAA,OAAA,EAAU,QAAQ,sBAAsB,KAAK,CAAA,CAAA,CAAA;AAAA,MACnF,gBAAA;AAAA,MACA;AAAA,QACE,OAAA,EAAS;AAAA,UACP,QAAA;AAAA,UACA,MAAA;AAAA,UACA,GAAI,SAAS,OAAA,KAAY,MAAA,GACvB,EAAC,GACD,EAAE,OAAA,EAAS,OAAA,CAAQ,OAAA;AAAQ,SAC/B;AAAA,QACA,QAAA,EAAU,MAAA;AAAA,QACV,UAAA,EACE,SAAS,UAAA,IACT,iJAAA;AAAA,QACF,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,mBAAA;AACZ,IAAA,IAAA,CAAK,QAAA,GAAW,QAAA;AAChB,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AAAA,EAChB;AACF;AAaO,IAAM,2BAAA,GAAN,cAA0C,cAAA,CAAe;AAAA,EAG9D,WAAA,CACE,cAAA,EACA,IAAA,EACA,OAAA,EACA;AACA,IAAA,KAAA;AAAA,MACE,CAAA,uBAAA,EAA0B,cAAc,CAAA,gBAAA,EAAmB,IAAI,CAAA,CAAA,CAAA;AAAA,MAC/D,sBAAA;AAAA,MACA;AAAA,QACE,OAAA,EAAS,EAAE,cAAA,EAAgB,IAAA,EAAK;AAAA,QAChC,QAAA,EAAU,MAAA;AAAA,QACV,UAAA,EAAY,CAAA,4BAAA,EAA+B,cAAc,CAAA,4CAAA,EAA+C,IAAI,CAAA,EAAA,CAAA;AAAA,QAC5G,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,6BAAA;AAAA,EACd;AACF;AAaO,IAAM,sBAAA,GAAN,cAAqC,cAAA,CAAe;AAAA,EAGzD,WAAA,CAAY,SAAA,EAAmB,IAAA,EAAc,OAAA,EAA+B;AAC1E,IAAA,KAAA;AAAA,MACE,CAAA,kBAAA,EAAqB,SAAS,CAAA,gBAAA,EAAmB,IAAI,CAAA,CAAA,CAAA;AAAA,MACrD,iBAAA;AAAA,MACA;AAAA,QACE,OAAA,EAAS,EAAE,SAAA,EAAW,IAAA,EAAK;AAAA,QAC3B,QAAA,EAAU,MAAA;AAAA,QACV,UAAA,EAAY,CAAA,uBAAA,EAA0B,SAAS,CAAA,uCAAA,EAA0C,IAAI,CAAA,yCAAA,CAAA;AAAA,QAC7F,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,wBAAA;AAAA,EACd;AACF;AAmBO,IAAM,qBAAA,GAAN,cAAoC,cAAA,CAAe;AAAA,EAGxD,WAAA,CACE,SACA,OAAA,EACA;AACA,IAAA,KAAA;AAAA,MACE,CAAA,kCAAA,EAAqC,OAAA,CAAQ,QAAQ,CAAA,GAAA,EAAM,OAAA,CAAQ,QAAQ,CAAA,CAAA,EAAI,OAAA,CAAQ,MAAM,CAAA,EAAA,EAAK,OAAA,CAAQ,QAAQ,CAAA,CAAA,CAAA;AAAA,MAClH,oBAAA;AAAA,MACA;AAAA,QACE,OAAA;AAAA,QACA,QAAA,EAAU,YAAA;AAAA,QACV,UAAA,EAAY,CAAA,WAAA,EAAc,OAAA,CAAQ,QAAQ,CAAA,sCAAA,CAAA;AAAA,QAC1C,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,uBAAA;AAAA,EACd;AACF;AAeO,IAAM,aAAA,GAAN,cAA4B,cAAA,CAAe;AAAA,EAGhD,WAAA,CAAY,SAA+B,OAAA,EAA+B;AACxE,IAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,aAAA,CAAc,IAAA,CAAK,KAAK,CAAA;AACjD,IAAA,KAAA;AAAA,MACE,CAAA,QAAA,EAAW,OAAA,CAAQ,QAAQ,CAAA,oBAAA,EAAuB,OAAA,CAAQ,QAAQ,CAAA,QAAA,EAAW,OAAA,CAAQ,UAAU,CAAA,YAAA,EAAe,QAAQ,CAAA,CAAA;AAAA,MACtH,gBAAA;AAAA,MACA;AAAA,QACE,OAAA;AAAA,QACA,QAAA,EAAU,YAAA;AAAA,QACV,UAAA,EAAY,CAAA,mBAAA,EAAsB,QAAQ,CAAA,QAAA,EAAW,QAAQ,QAAQ,CAAA,UAAA,CAAA;AAAA,QACrE,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,eAAA;AAAA,EACd;AACF;AAgBO,IAAM,eAAA,GAAN,cAA8B,cAAA,CAAe;AAAA,EAGlD,WAAA,CAAY,SAAiC,OAAA,EAA+B;AAC1E,IAAA,MAAM,SAAA,GAAY,OAAA,CAAQ,MAAA,CAAO,IAAA,CAAK,IAAI,CAAA;AAC1C,IAAA,KAAA;AAAA,MACE,CAAA,yBAAA,EAA4B,OAAA,CAAQ,IAAI,CAAA,eAAA,EAAkB,OAAA,CAAQ,cAAc,CAAA,WAAA,EAAc,SAAS,CAAA,+BAAA,EAAkC,OAAA,CAAQ,UAAU,CAAA,CAAA;AAAA,MAC3J,sBAAA;AAAA,MACA;AAAA,QACE,OAAA;AAAA,QACA,QAAA,EAAU,YAAA;AAAA,QACV,UAAA,EAAY,CAAA,8BAAA,EAAiC,SAAS,CAAA,4CAAA,EAA+C,QAAQ,UAAU,CAAA,SAAA,CAAA;AAAA,QACvH,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,iBAAA;AAAA,EACd;AACF;AAgBO,IAAM,gBAAA,GAAN,cAA+B,cAAA,CAAe;AAAA,EAGnD,WAAA,CAAY,SAAkC,OAAA,EAA+B;AAC3E,IAAA,KAAA;AAAA,MACE,CAAA,wBAAA,EAA2B,OAAA,CAAQ,QAAQ,CAAA,OAAA,EAAU,QAAQ,QAAQ,CAAA,CAAA,EAAI,OAAA,CAAQ,MAAM,CAAA,SAAA,EAAY,OAAA,CAAQ,WAAW,CAAA,MAAA,EAAS,QAAQ,aAAa,CAAA,sBAAA,CAAA;AAAA,MACpJ,mBAAA;AAAA,MACA;AAAA,QACE,OAAA;AAAA,QACA,QAAA,EAAU,YAAA;AAAA,QACV,UAAA,EACE,OAAA,CAAQ,WAAA,KAAgB,KAAA,IAAS,OAAA,CAAQ,gBAAgB,QAAA,GACvD,CAAA,8EAAA,CAAA,GACA,CAAA,qCAAA,EAAwC,OAAA,CAAQ,WAAW,CAAA,+BAAA,CAAA;AAAA,QAC/D,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,kBAAA;AAAA,EACd;AACF;AAiBO,IAAM,aAAA,GAAN,cAA4B,cAAA,CAAe;AAAA,EAGhD,WAAA,CAAY,SAA+B,OAAA,EAA+B;AACxE,IAAA,KAAA;AAAA,MACE,CAAA,6CAAA,EAAgD,QAAQ,aAAa,CAAA,UAAA,EAAa,QAAQ,MAAM,CAAA,4BAAA,EAA+B,QAAQ,eAAe,CAAA,CAAA;AAAA,MACtJ,gBAAA;AAAA,MACA;AAAA,QACE,OAAA;AAAA,QACA,QAAA,EAAU,YAAA;AAAA,QACV,UAAA,EAAY,kCAAkC,OAAA,CAAQ,aAAa,iCAAiC,OAAA,CAAQ,eAAe,CAAA,CAAA,EAAI,OAAA,CAAQ,MAAM,CAAA,OAAA,CAAA;AAAA,QAC7I,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,eAAA;AAAA,EACd;AACF;AAmBO,IAAM,0BAAA,GAAN,cAAyC,cAAA,CAAe;AAAA,EAG7D,WAAA,CACE,SACA,OAAA,EACA;AACA,IAAA,KAAA;AAAA,MACE,2BAA2B,OAAA,CAAQ,CAAA,CAAE,IAAI,CAAA,CAAA,EAAI,OAAA,CAAQ,EAAE,EAAE,CAAA,KAAA,EAAQ,OAAA,CAAQ,CAAA,CAAE,IAAI,CAAA,CAAA,EAAI,OAAA,CAAQ,EAAE,EAAE,CAAA,gBAAA,EAAmB,QAAQ,SAAS,CAAA,CAAA,CAAA;AAAA,MACnI,wBAAA;AAAA,MACA;AAAA,QACE,OAAA;AAAA,QACA,QAAA,EAAU,YAAA;AAAA,QACV,UAAA,EACE,2FAAA;AAAA,QACF,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,4BAAA;AAAA,EACd;AACF;AAcO,IAAM,2BAAA,GAAN,cAA0C,cAAA,CAAe;AAAA,EAG9D,YAAY,OAAA,EAA6C;AACvD,IAAA,MAAM,IAAA,GACJ,OAAA,CAAQ,MAAA,KAAW,mBAAA,GAAsB,gCAAA,GACvC,OAAA,CAAQ,MAAA,KAAW,iBAAA,GAAoB,8BAAA,GACvC,OAAA,CAAQ,MAAA,KAAW,UAAA,GAAa,4BAAA,GAChC,wCAAA;AACJ,IAAA,KAAA;AAAA,MACE,CAAA,sDAAA,EAAyD,QAAQ,MAAM,CAAA,CAAA,CAAA;AAAA,MACvE,IAAA;AAAA,MACA;AAAA,QACE,OAAA;AAAA,QACA,QAAA,EACE,OAAA,CAAQ,MAAA,KAAW,yBAAA,GAA4B,YAAA,GAAe,MAAA;AAAA,QAChE,UAAA,EACE,QAAQ,MAAA,KAAW,UAAA,GAAa,yCAC9B,OAAA,CAAQ,MAAA,KAAW,4BACnB,sHAAA,GACA;AAAA;AACN,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,6BAAA;AAAA,EACd;AACF;AAaO,IAAM,6BAAA,GAAN,cAA4C,cAAA,CAAe;AAAA,EAGhE,YAAY,OAAA,EAA+C;AACzD,IAAA,KAAA;AAAA,MACE,qBAAqB,OAAA,CAAQ,QAAA,CAAS,IAAI,CAAA,CAAA,EAAI,OAAA,CAAQ,SAAS,EAAE,CAAA,mEAAA,CAAA;AAAA,MACjE,4BAAA;AAAA,MACA;AAAA,QACE,OAAA;AAAA,QACA,QAAA,EAAU,YAAA;AAAA,QACV,UAAA,EACE;AAAA;AACJ,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,+BAAA;AAAA,EACd;AACF;AA4BO,IAAM,gCAAA,GAAN,cAA+C,cAAA,CAAe;AAAA,EAGnE,WAAA,CACE,SACA,OAAA,EACA;AACA,IAAA,KAAA;AAAA,MACE,CAAA,8BAAA,EAAiC,QAAQ,CAAA,CAAE,IAAI,IAAI,OAAA,CAAQ,CAAA,CAAE,EAAE,CAAA,KAAA,EAAQ,OAAA,CAAQ,EAAE,IAAI,CAAA,CAAA,EAAI,QAAQ,CAAA,CAAE,EAAE,gCAAgC,OAAA,CAAQ,WAAW,CAAA,kDAAA,EAAqD,OAAA,CAAQ,QAAQ,CAAA,CAAA,CAAA;AAAA,MAC7N,+BAAA;AAAA,MACA;AAAA,QACE,OAAA;AAAA,QACA,QAAA,EAAU,YAAA;AAAA,QACV,UAAA,EACE,+MAAA;AAAA,QACF,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,kCAAA;AAAA,EACd;AACF;AAeO,IAAM,qBAAA,GAAN,cAAoC,cAAA,CAAe;AAAA,EAGxD,WAAA,CACE,SACA,OAAA,EACA;AACA,IAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,SAAA,CAAU,IAAA,CAAK,IAAI,CAAA;AAC5C,IAAA,KAAA;AAAA,MACE,CAAA,cAAA,EAAiB,OAAA,CAAQ,QAAQ,CAAA,CAAA,EAAI,OAAA,CAAQ,MAAM,CAAA,EAAA,EAAK,OAAA,CAAQ,SAAS,CAAA,0BAAA,EAA6B,QAAQ,CAAA,CAAA,CAAA;AAAA,MAC9G,mBAAA;AAAA,MACA;AAAA,QACE,OAAA;AAAA,QACA,QAAA,EAAU,YAAA;AAAA,QACV,UAAA,EAAY,CAAA,mIAAA,CAAA;AAAA,QACZ,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,uBAAA;AAAA,EACd;AACF;AAsBO,IAAM,oBAAA,GAAN,cAAmC,cAAA,CAAe;AAAA,EAGvD,WAAA,CACE,SACA,OAAA,EACA;AACA,IAAA,KAAA;AAAA,MACE,CAAA,oBAAA,EAAuB,OAAA,CAAQ,IAAI,CAAA,CAAA,EAAI,OAAA,CAAQ,EAAE,CAAA,mBAAA,EAAsB,OAAA,CAAQ,eAAe,CAAA,QAAA,EAAW,OAAA,CAAQ,aAAa,CAAA,CAAA;AAAA,MAC9H,kBAAA;AAAA,MACA;AAAA,QACE,OAAA;AAAA,QACA,QAAA,EAAU,QAAA;AAAA,QACV,UAAA,EAAY,CAAA,6GAAA,CAAA;AAAA,QACZ,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,sBAAA;AAAA,EACd;AACF;AAkBO,IAAM,mBAAA,GAAN,cAAkC,cAAA,CAAe;AAAA,EAGtD,WAAA,CACE,SACA,OAAA,EACA;AACA,IAAA,KAAA;AAAA,MACE,CAAA,2BAAA,EAA8B,QAAQ,OAAO,CAAA,2CAAA,CAAA;AAAA,MAC7C,iBAAA;AAAA,MACA;AAAA,QACE,OAAA;AAAA,QACA,QAAA,EAAU,QAAA;AAAA,QACV,UAAA,EAAY,CAAA,oGAAA,CAAA;AAAA,QACZ,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,qBAAA;AAAA,EACd;AACF;AAUO,IAAM,yBAAA,GAA4B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQvC,eAAA;AAAA;AAAA,EAEA,iBAAA;AAAA;AAAA,EAEA,mBAAA;AAAA;AAAA,EAEA,mBAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA;AACF;AAuDO,IAAM,cAAA,GAAN,cAA6B,cAAA,CAAe;AAAA,EAGjD,WAAA,CACE,OAAA,EACA,OAAA,EACA,OAAA,EACA;AACA,IAAA,KAAA,CAAM,SAAS,iBAAA,EAAmB;AAAA,MAChC,OAAA;AAAA,MACA,QAAA,EAAU,QAAA;AAAA,MACV,UAAA,EAAY,CAAA,kGAAA,CAAA;AAAA,MACZ,OAAO,OAAA,EAAS;AAAA,KACjB,CAAA;AACD,IAAA,IAAA,CAAK,IAAA,GAAO,gBAAA;AAAA,EACd;AACF;AAwCO,IAAM,yBAAA,GAAN,cAAwC,cAAA,CAAe;AAAA;AAAA;AAAA;AAAA;AAAA,EAOnD,eAAA;AAAA,EAET,WAAA,CAAY,iBAA2C,OAAA,EAAiB;AACtE,IAAA,MAAM,KAAA,GAAQ,wBAAwB,eAAe,CAAA;AACrD,IAAA,KAAA;AAAA,MACE,CAAA,iCAAA,EAAoC,MAAM,MAAM,CAAA,qBAAA,EAAwB,OAAO,CAAA,GAAA,EAAM,KAAA,CAAM,IAAA,CAAK,IAAI,CAAC,CAAA,kKAAA,CAAA;AAAA,MACrG,8BAAA;AAAA,MACA;AAAA,QACE,OAAA,EAAS,EAAE,OAAA,EAAS,gBAAA,EAAkB,KAAA,EAAM;AAAA,QAC5C,QAAA,EAAU,QAAA;AAAA,QACV,UAAA,EAAY,CAAA,8JAAA;AAAA;AACd,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,2BAAA;AACZ,IAAA,IAAA,CAAK,eAAA,GAAkB,eAAA;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,IAAI,gBAAA,GAAsC;AACxC,IAAA,OAAO,uBAAA,CAAwB,KAAK,eAAe,CAAA;AAAA,EACrD;AACF;AAEA,SAAS,wBACP,eAAA,EACmB;AACnB,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,KAAA,MAAW,KAAA,IAAS,gBAAgB,OAAA,EAAS;AAC3C,IAAA,IAAI,MAAM,MAAA,KAAW,QAAA,EAAU,KAAA,CAAM,IAAA,CAAK,MAAM,SAAS,CAAA;AAAA,EAC3D;AACA,EAAA,OAAO,KAAA;AACT;AA0BO,IAAM,iBAAA,GAAN,cAAgC,cAAA,CAAe;AAAA,EAGpD,WAAA,CACE,SACA,OAAA,EACA;AACA,IAAA,KAAA;AAAA,MACE,CAAA,yDAAA,EAA4D,QAAQ,OAAO,CAAA,2BAAA,EAA8B,QAAQ,QAAQ,CAAA,YAAA,EAAe,QAAQ,MAAM,CAAA,CAAA;AAAA,MACtJ,sBAAA;AAAA,MACA;AAAA,QACE,OAAA;AAAA,QACA,QAAA,EAAU,QAAA;AAAA,QACV,UAAA,EAAY,CAAA,yGAAA,CAAA;AAAA,QACZ,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,mBAAA;AAAA,EACd;AACF;AAsBO,IAAM,0BAAA,GAAN,cAAyC,cAAA,CAAe;AAAA,EAG7D,WAAA,CACE,SACA,OAAA,EACA;AACA,IAAA,KAAA;AAAA,MACE,CAAA,mCAAA,EAAsC,OAAA,CAAQ,OAAO,CAAA,aAAA,EAAgB,OAAA,CAAQ,OAAO,CAAA,gBAAA,EAAmB,OAAA,CAAQ,YAAY,CAAA,4BAAA,EAA+B,OAAA,CAAQ,YAAY,CAAA,CAAA;AAAA,MAC9K,yBAAA;AAAA,MACA;AAAA,QACE,OAAA;AAAA,QACA,QAAA,EAAU,QAAA;AAAA,QACV,UAAA,EAAY,CAAA,yJAAA,CAAA;AAAA,QACZ,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,4BAAA;AAAA,EACd;AACF;AAYO,IAAM,kBAAA,GAAN,cAAiC,cAAA,CAAe;AAAA,EACrD,WAAA,CACE,OAAA,EACA,OAAA,GAAmC,IACnC,OAAA,EACA;AACA,IAAA,KAAA,CAAM,SAAS,qBAAA,EAAuB;AAAA,MACpC,OAAA;AAAA,MACA,QAAA,EAAU,MAAA;AAAA,MACV,UAAA,EACE,SAAS,UAAA,IAAc,CAAA,wCAAA,CAAA;AAAA,MACzB,OAAO,OAAA,EAAS;AAAA,KACjB,CAAA;AACD,IAAA,IAAA,CAAK,IAAA,GAAO,oBAAA;AAAA,EACd;AACF;AAoCA,IAAM,oCAAA,GAEF;AAAA,EACF,2BAAA,EACE,gMAAA;AAAA,EAGF,aAAA,EACE,qHAAA;AAAA,EAEF,iBAAA,EACE,oIAAA;AAAA,EAEF,uBAAA,EACE;AAIJ,CAAA;AAEA,IAAM,uCAAA,GAEF;AAAA,EACF,2BAAA,EACE,kLAAA;AAAA,EAGF,aAAA,EACE,6LAAA;AAAA,EAGF,iBAAA,EACE,qNAAA;AAAA,EAGF,uBAAA,EACE,CAAA,qSAAA;AAKJ,CAAA;AAUO,IAAM,mCAAA,GAAN,cAAkD,cAAA,CAAe;AAAA,EAC7D,MAAA;AAAA,EAET,WAAA,CACE,MAAA,EACA,OAAA,GAA6C,IAC7C,OAAA,EACA;AACA,IAAA,KAAA;AAAA,MACE,qCAAqC,MAAM,CAAA;AAAA,MAC3C,kCAAA;AAAA,MACA;AAAA,QACE,OAAA,EAAS,EAAE,GAAG,OAAA,EAAS,MAAA,EAAO;AAAA,QAC9B,QAAA,EAAU,MAAA;AAAA,QACV,UAAA,EAAY,wCAAwC,MAAM,CAAA;AAAA,QAC1D,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,qCAAA;AACZ,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AAAA,EAChB;AACF;AAMO,IAAM,8BAAA,GAAN,cAA6C,cAAA,CAAe;AAAA,EACjE,WAAA,CACE,SAAA,EACA,aAAA,EACA,OAAA,GAA+C,EAAC,EAChD;AACA,IAAA,MAAM,WAAA,GAAc,QAAQ,WAAA,KAAgB,IAAA;AAC5C,IAAA,KAAA;AAAA,MACE,cACE,CAAA,EAAG,SAAS,kEACZ,CAAA,EAAG,SAAS,4BAA4B,aAAa,CAAA,YAAA,CAAA;AAAA,MACvD,mCAAA;AAAA,MACA;AAAA,QACE,OAAA,EAAS;AAAA,UACP,SAAA;AAAA,UACA,aAAA;AAAA,UACA,GAAI,WAAA,GAAc,EAAE,WAAA,KAAgB;AAAC,SACvC;AAAA,QACA,QAAA,EAAU,MAAA;AAAA,QACV,UAAA,EACE,cACE,6HAAA,GACA;AAAA;AACN,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,gCAAA;AAAA,EACd;AACF;AAoBA,IAAM,mBAAA,GAKF;AAAA,EACF,OAAA,EAAS;AAAA,IACP,OAAA,EAAS,kCAAA;AAAA,IACT,UAAA,EACE;AAAA,GACJ;AAAA,EACA,QAAA,EAAU;AAAA,IACR,OAAA,EAAS,0CAAA;AAAA,IACT,UAAA,EACE;AAAA,GACJ;AAAA,EACA,WAAA,EAAa;AAAA,IACX,OAAA,EAAS,6CAAA;AAAA,IACT,UAAA,EACE;AAAA,GACJ;AAAA,EACA,YAAA,EAAc;AAAA,IACZ,OAAA,EAAS,6DAAA;AAAA,IACT,UAAA,EACE;AAAA;AAEN,CAAA;AAQO,IAAM,sBAAA,GAAN,cAAqC,cAAA,CAAe;AAAA,EAGzD,YAAY,OAAA,EAAwC;AAClD,IAAA,KAAA;AAAA,MACE,CAAA,MAAA,EAAS,QAAQ,MAAM,CAAA,SAAA,EAAY,QAAQ,QAAQ,CAAA,GAAA,EAAM,mBAAA,CAAoB,OAAA,CAAQ,MAAM,CAAA,CAAE,OAAO,CAAA,EAAA,EAAK,OAAA,CAAQ,QAAQ,CAAA,CAAA,EACvH,OAAA,CAAQ,KAAA,KAAU,SAAY,EAAA,GAAK,CAAA,SAAA,EAAY,OAAA,CAAQ,KAAK,CAAA,CAAA,CAC9D,CAAA,CAAA,CAAA;AAAA,MACA,qBAAA;AAAA,MACA;AAAA,QACE,OAAA,EAAS,EAAE,GAAG,OAAA,EAAQ;AAAA,QACtB,QAAA,EAAU,MAAA;AAAA,QACV,UAAA,EAAY,mBAAA,CAAoB,OAAA,CAAQ,MAAM,CAAA,CAAE;AAAA;AAClD,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,wBAAA;AAAA,EACd;AACF;AAGO,IAAM,iCAAA,GAAN,cAAgD,cAAA,CAAe;AAAA,EACpE,YACE,SAAA,EACA,UAAA,EACA,OAAA,GAA6C,IAC7C,UAAA,EACA;AACA,IAAA,KAAA;AAAA,MACE,CAAA,EAAG,SAAS,CAAA,8BAAA,EAAiC,UAAU,CAAA,EAAA,CAAA;AAAA,MACvD,gCAAA;AAAA,MACA;AAAA,QACE,OAAA,EAAS,EAAE,SAAA,EAAW,UAAA,EAAY,GAAG,OAAA,EAAQ;AAAA,QAC7C,QAAA,EAAU,MAAA;AAAA,QACV,YACE,UAAA,IACA;AAAA;AACJ,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,mCAAA;AAAA,EACd;AACF;AAeO,IAAM,kBAAA,GAAN,cAAiC,cAAA,CAAe;AAAA,EACrD,YACE,OAAA,EACA,MAAA,EACA,OAAA,GAA6C,IAC7C,OAAA,EACA;AACA,IAAA,KAAA,CAAM,SAAS,sBAAA,EAAwB;AAAA,MACrC,OAAA,EAAS,EAAE,GAAG,OAAA,EAAS,MAAA,EAAO;AAAA,MAC9B,QAAA,EAAU,MAAA;AAAA,MACV,UAAA,EACE,SAAS,UAAA,IACT,2GAAA;AAAA,MACF,OAAO,OAAA,EAAS;AAAA,KACjB,CAAA;AACD,IAAA,IAAA,CAAK,IAAA,GAAO,oBAAA;AAAA,EACd;AACF;AAgBO,IAAM,0BAAA,GAAN,cAAyC,cAAA,CAAe;AAAA,EAC7D,WAAA,CACE,OAAA,EACA,OAAA,GAA6C,IAC7C,OAAA,EACA;AACA,IAAA,KAAA,CAAM,SAAS,mCAAA,EAAqC;AAAA,MAClD,OAAA;AAAA,MACA,QAAA,EAAU,MAAA;AAAA,MACV,UAAA,EACE,SAAS,UAAA,IACT,mGAAA;AAAA,MACF,OAAO,OAAA,EAAS;AAAA,KACjB,CAAA;AACD,IAAA,IAAA,CAAK,IAAA,GAAO,4BAAA;AAAA,EACd;AACF;AAYO,IAAM,4BAAA,GAAN,cAA2C,cAAA,CAAe;AAAA,EAC/D,WAAA,CAAY,OAAA,EAAiB,aAAA,EAAuB,aAAA,EAAwB;AAC1E,IAAA,KAAA;AAAA,MACE,aAAA,GACE,CAAA,uEAAA,EAA0E,aAAa,CAAA,0FAAA,CAAA,GACvF,0EAA0E,aAAa,CAAA,qIAAA,CAAA;AAAA,MACzF,wCAAA;AAAA,MACA;AAAA,QACE,OAAA,EAAS,EAAE,OAAA,EAAS,aAAA,EAAc;AAAA,QAClC,QAAA,EAAU,MAAA;AAAA,QACV,UAAA,EACE,gBACE,iJAAA,GACA;AAAA;AACN,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,8BAAA;AAAA,EACd;AACF;AAmBO,IAAM,4BAAA,GAA+B;AAAA,EAC1C,gDAAA;AAAA,EACA,mCAAA;AAAA,EACA;AACF;AAgBA,SAAS,2BACP,KAAA,EACmC;AAEnC,EAAA,OAAQ,4BAAA,CAAoD,SAAS,KAAK,CAAA;AAC5E;AA2CO,SAAS,2BAAA,CACd,OACA,IAAA,EACoC;AACpC,EAAA,IAAI,EAAE,KAAA,YAAiB,kBAAA,CAAA,EAAqB,OAAO,KAAA;AACnD,EAAA,MAAM,MAAA,GAAS,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA;AACnC,EAAA,IAAI,CAAC,0BAAA,CAA2B,MAAM,CAAA,EAAG,OAAO,KAAA;AAChD,EAAA,OAAO,IAAA,KAAS,UAAa,MAAA,KAAW,IAAA;AAC1C;AAiBA,IAAM,mCAAA,GAEF;AAAA,EACF,OAAA,EAAS,oBAAA;AAAA,EACT,KAAA,EAAO,iEAAA;AAAA,EACP,MAAA,EAAQ;AACV,CAAA;AAwBO,IAAM,wBAAA,GAAN,cAAuC,cAAA,CAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQ3D,WAAA,CACE,OAAA,EACA,MAAA,EACA,OAAA,EAKA;AACA,IAAA,KAAA;AAAA,MACE,GAAG,2BAAA,CAA4B,OAAA,EAAS,UAAU,aAAa,CAAC,CAAC,CAAA,YAAA,EACrD,OAAO,KAAK,mCAAA,CAAoC,MAAM,CAAC,CAAA,EAAA,CAAA,GACjE,yBAAA,CAA0B,QAAQ,OAAA,EAAS,OAAA,GAAU,aAAa,CAAC,CAAA;AAAA,MACrE,uBAAA;AAAA,MACA;AAAA,QACE,SAAS,EAAE,GAAG,OAAA,EAAS,OAAA,EAAS,SAAS,MAAA,EAAO;AAAA,QAChD,QAAA,EAAU,MAAA;AAAA,QACV,UAAA,EACE,kBAAkB,MAAA,EAAQ,OAAA,EAAS,UAAU,aAAa,CAAC,IACzD,iMAAA,GAIA,4KAAA;AAAA,QAGJ,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,0BAAA;AAAA,EACd;AACF;AAEA,IAAM,0BAAA,GAA6B,SAAA;AASnC,SAAS,iBAAA,CACP,QACA,WAAA,EACS;AACT,EAAA,OACE,WAAW,OAAA,IACX,OAAO,gBAAgB,QAAA,IACvB,WAAA,CAAY,WAAW,0BAA0B,CAAA;AAErD;AAGA,SAAS,yBAAA,CACP,QACA,WAAA,EACQ;AACR,EAAA,IAAI,iBAAA,CAAkB,MAAA,EAAQ,WAAW,CAAA,EAAG;AAC1C,IAAA,OACE,CAAA,4IAAA,CAAA;AAAA,EAIJ;AACA,EAAA,OACE,CAAA,iJAAA,CAAA;AAGJ;AAcO,IAAM,4BAAA,GAAN,cAA2C,cAAA,CAAe;AAAA,EAG/D,WAAA,CACE,OAAA,EACA,YAAA,EACA,OAAA,EACA;AACA,IAAA,MAAM,UAAA,GACJ,CAAA,gHAAA,CAAA;AAEF,IAAA,KAAA;AAAA,MACE,CAAA,kBAAA,EAAqB,YAAY,CAAA,aAAA,EAAgB,OAAO,uCACjB,UAAU,CAAA,CAAA;AAAA,MACjD,0BAAA;AAAA,MACA;AAAA,QACE,OAAA,EAAS;AAAA,UACP,OAAA;AAAA,UACA,WAAA,EAAa,UAAA;AAAA,UACb,YAAA;AAAA,UACA,KAAA,EAAO;AAAA,SACT;AAAA,QACA,QAAA,EAAU,MAAA;AAAA,QACV,UAAA;AAAA,QACA,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,8BAAA;AAAA,EACd;AACF;AASA,SAAS,4BAA4B,WAAA,EAA8B;AACjE,EAAA,IAAI,OAAO,WAAA,KAAgB,QAAA,EAAU,OAAO,iBAAA;AAC5C,EAAA,IAAI,WAAA,CAAY,UAAA,CAAW,0BAA0B,CAAA,EAAG;AACtD,IAAA,OAAO,CAAA,gBAAA,EAAmB,WAAA,CAAY,KAAA,CAAM,0BAAA,CAA2B,MAAM,CAAC,CAAA,CAAA,CAAA;AAAA,EAChF;AACA,EAAA,IAAI,WAAA,KAAgB,YAAY,OAAO,kBAAA;AACvC,EAAA,OAAO,IAAI,WAAW,CAAA,SAAA,CAAA;AACxB;AAoCO,IAAM,sBAAA,GAAN,cAAqC,cAAA,CAAe;AAAA,EAGzD,WAAA,CACE,OAAA,EACA,OAAA,EACA,OAAA,EACA;AACA,IAAA,KAAA,CAAM,SAAS,0BAAA,EAA4B;AAAA,MACzC,OAAA;AAAA,MACA,QAAA,EAAU,QAAA;AAAA,MACV,UAAA,EAAY,CAAA,wJAAA,CAAA;AAAA,MACZ,OAAO,OAAA,EAAS;AAAA,KACjB,CAAA;AACD,IAAA,IAAA,CAAK,IAAA,GAAO,wBAAA;AAAA,EACd;AACF;AAyBO,IAAM,8BAAA,GAAN,cAA6C,cAAA,CAAe;AAAA,EAGjE,WAAA,CACE,OAAA,EACA,OAAA,EACA,OAAA,EACA;AACA,IAAA,KAAA,CAAM,SAAS,6BAAA,EAA+B;AAAA,MAC5C,OAAA;AAAA,MACA,QAAA,EAAU,MAAA;AAAA,MACV,YAAY,CAAA,8BAAA,EAAiC,OAAA,CAAQ,IAAI,CAAA,IAAA,EAAO,QAAQ,SAAS,CAAA,8FAAA,CAAA;AAAA,MACjF,OAAO,OAAA,EAAS;AAAA,KACjB,CAAA;AACD,IAAA,IAAA,CAAK,IAAA,GAAO,gCAAA;AAAA,EACd;AACF;AASO,IAAM,yBAAA,GAAN,cAAwC,cAAA,CAAe;AAAA,EAC5D,WAAA,CACE,OAAA,EACA,OAAA,GAA6C,IAC7C,OAAA,EACA;AACA,IAAA,KAAA,CAAM,SAAS,uBAAA,EAAyB;AAAA,MACtC,OAAA;AAAA,MACA,QAAA,EAAU,QAAA;AAAA,MACV,UAAA,EACE,SAAS,UAAA,IACT,CAAA,+GAAA,CAAA;AAAA,MACF,OAAO,OAAA,EAAS;AAAA,KACjB,CAAA;AACD,IAAA,IAAA,CAAK,IAAA,GAAO,2BAAA;AAAA,EACd;AACF;AAYO,IAAM,sBAAA,GAAN,cAAqC,cAAA,CAAe;AAAA,EACzD,WAAA,CACE,OAAA,EACA,OAAA,EACA,OAAA,EACA;AACA,IAAA,KAAA,CAAM,SAAS,0BAAA,EAA4B;AAAA,MACzC,OAAA,EAAS,WAAW,EAAC;AAAA,MACrB,QAAA,EAAU,QAAA;AAAA,MACV,UAAA,EAAY,CAAA,+FAAA,CAAA;AAAA,MACZ,OAAO,OAAA,EAAS;AAAA,KACjB,CAAA;AACD,IAAA,IAAA,CAAK,IAAA,GAAO,wBAAA;AAAA,EACd;AACF;AAaO,IAAM,oBAAA,GAAN,cAAmC,cAAA,CAAe;AAAA,EACvD,YAAY,OAAA,EAA+B;AACzC,IAAA,KAAA;AAAA,MACE,4FAAA;AAAA,MACA,kBAAA;AAAA,MACA;AAAA,QACE,QAAA,EAAU,QAAA;AAAA,QACV,UAAA,EACE,gJAAA;AAAA,QAEF,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,sBAAA;AAAA,EACd;AACF;AAwBO,IAAM,sBAAA,GAAN,cAAqC,cAAA,CAAe;AAAA,EACzD,YAAY,OAAA,EAA+B;AACzC,IAAA,KAAA;AAAA,MACE,wJAAA;AAAA,MAEA,oBAAA;AAAA,MACA;AAAA,QACE,QAAA,EAAU,MAAA;AAAA,QACV,UAAA,EACE,mMAAA;AAAA,QAGF,OAAO,OAAA,EAAS;AAAA;AAClB,KACF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,wBAAA;AAAA,EACd;AACF;AAoBO,SAAS,iBAAiB,KAAA,EAAyC;AACxE,EAAA,OAAO,KAAA,YAAiB,cAAA;AAC1B;AAmBO,SAAS,kBAAkB,KAAA,EAAyB;AACzD,EAAA,IAAI,CAAC,gBAAA,CAAiB,KAAK,CAAA,EAAG,OAAO,KAAA;AACrC,EAAA,OAAO,KAAA,CAAM,QAAA,KAAa,MAAA,IAAU,KAAA,CAAM,QAAA,KAAa,YAAA;AACzD;AAUO,SAAS,cAAc,KAAA,EAAyB;AACrD,EAAA,OAAO,gBAAA,CAAiB,KAAK,CAAA,IAAK,KAAA,CAAM,QAAA,KAAa,QAAA;AACvD;AAKO,SAAS,kBAAkB,KAAA,EAAyB;AACzD,EAAA,OAAO,gBAAA,CAAiB,KAAK,CAAA,IAAK,KAAA,CAAM,QAAA,KAAa,YAAA;AACvD;AAKO,SAAS,mBAAmB,KAAA,EAAoC;AACrE,EAAA,OAAO,gBAAA,CAAiB,KAAK,CAAA,GAAI,KAAA,CAAM,UAAA,GAAa,MAAA;AACtD","file":"chunk-MRDBBHIZ.cjs","sourcesContent":["/**\n * TypeGraph Error Hierarchy\n *\n * All errors extend TypeGraphError with:\n * - `code`: Machine-readable error code for programmatic handling\n * - `category`: Classification for error handling strategies\n * - `suggestion`: Optional recovery guidance for users\n * - `details`: Structured context about the error\n *\n * @example\n * ```typescript\n * try {\n *   await store.nodes.Person.create({ name: \"\" });\n * } catch (error) {\n *   if (isTypeGraphError(error)) {\n *     console.error(error.toUserMessage());\n *     if (isUserRecoverable(error)) {\n *       // Show to user for correction\n *     }\n *   }\n * }\n * ```\n */\n\nimport type { KindEntity } from \"../core/types\";\nimport type { SchemaDiff } from \"../schema/migration\";\n// Type-only import: `materialize-indexes.ts` value-imports\n// `ConfigurationError` from this file, but type-only imports are erased\n// at runtime so this back-edge does not create a value cycle.\nimport type { MaterializeIndexesResult } from \"../store/materialize-indexes\";\n\n// ============================================================\n// Types\n// ============================================================\n\n/**\n * Error category for programmatic handling.\n *\n * - `user`: Caused by invalid input or incorrect usage. Recoverable by fixing input.\n * - `constraint`: Business rule or schema constraint violation. Recoverable by changing data.\n * - `system`: Internal error or infrastructure issue. May require investigation or retry.\n */\nexport type ErrorCategory = \"user\" | \"constraint\" | \"system\";\n\n/**\n * Options for TypeGraphError constructor.\n */\nexport type TypeGraphErrorOptions = Readonly<{\n  /** Structured context about the error */\n  details?: Record<string, unknown>;\n  /** Error category for handling strategies */\n  category: ErrorCategory;\n  /** Recovery guidance for users */\n  suggestion?: string;\n  /** Underlying cause of the error */\n  cause?: unknown;\n}>;\n\nfunction formatCause(cause: unknown): string {\n  if (cause instanceof Error) {\n    return cause.stack ?? cause.message;\n  }\n  if (typeof cause === \"string\") {\n    return cause;\n  }\n  if (\n    typeof cause === \"number\" ||\n    typeof cause === \"boolean\" ||\n    typeof cause === \"bigint\"\n  ) {\n    return String(cause);\n  }\n  if (typeof cause === \"symbol\") {\n    return cause.description ?? \"Symbol\";\n  }\n  if (cause === undefined) {\n    return \"Unknown cause\";\n  }\n\n  try {\n    return JSON.stringify(cause);\n  } catch (error) {\n    return `Unserializable cause: ${\n      error instanceof Error ? error.message : \"Unknown error\"\n    }`;\n  }\n}\n\n// ============================================================\n// Base Error\n// ============================================================\n\n/**\n * Base error class for all TypeGraph errors.\n *\n * Provides structured error information for both programmatic handling\n * and user-friendly messages.\n */\nexport class TypeGraphError extends Error {\n  /** Machine-readable error code (e.g., \"VALIDATION_ERROR\") */\n  readonly code: string;\n\n  /** Error category for handling strategies */\n  readonly category: ErrorCategory;\n\n  /** Structured context about the error */\n  readonly details: Readonly<Record<string, unknown>>;\n\n  /** Recovery guidance for users */\n  readonly suggestion?: string;\n\n  constructor(message: string, code: string, options: TypeGraphErrorOptions) {\n    super(message, options.cause ? { cause: options.cause } : undefined);\n    this.name = \"TypeGraphError\";\n    this.code = code;\n    this.category = options.category;\n    this.details = Object.freeze(options.details ?? {});\n    if (options.suggestion !== undefined) {\n      this.suggestion = options.suggestion;\n    }\n  }\n\n  /**\n   * Returns a user-friendly error message with suggestion if available.\n   */\n  toUserMessage(): string {\n    if (this.suggestion) {\n      return `${this.message}\\n\\nSuggestion: ${this.suggestion}`;\n    }\n    return this.message;\n  }\n\n  /**\n   * Returns a detailed string representation for logging.\n   */\n  toLogString(): string {\n    const lines = [\n      `[${this.code}] ${this.message}`,\n      `  Category: ${this.category}`,\n    ];\n\n    if (this.suggestion) {\n      lines.push(`  Suggestion: ${this.suggestion}`);\n    }\n\n    const detailKeys = Object.keys(this.details);\n    if (detailKeys.length > 0) {\n      lines.push(`  Details: ${JSON.stringify(this.details)}`);\n    }\n\n    if (this.cause) {\n      lines.push(`  Cause: ${formatCause(this.cause)}`);\n    }\n\n    return lines.join(\"\\n\");\n  }\n}\n\n// ============================================================\n// Validation Errors (category: \"user\")\n// ============================================================\n\n/**\n * Validation issue from Zod or custom validation.\n */\nexport type ValidationIssue = Readonly<{\n  /** Path to the invalid field (e.g., \"address.city\") */\n  path: string;\n  /** Human-readable error message */\n  message: string;\n  /** Zod error code if from Zod validation */\n  code?: string;\n  /**\n   * The identity assertion the issue is about, carried structurally so\n   * consumers (e.g. interchange import error reporting) never have to parse\n   * the human-readable message for it.\n   */\n  assertionId?: string;\n}>;\n\n/**\n * The stable {@link ValidationIssue.code} every inverted-validity-window\n * refusal carries, so a caller can recognize that specific failure without\n * matching on the message. `ValidationError`'s own code is the family-wide\n * `VALIDATION_ERROR`, so the discriminator lives on the issue — mirroring the\n * identity-import window refusal (`IDENTITY_IMPORT_INVALID_WINDOW`).\n *\n * A write carrying it was refused because `validTo` precedes the row's\n * effective `validFrom`: the row would have stopped being true before it\n * started, observable at no `asOf` coordinate at all. Zero-width windows\n * (`validTo === validFrom`) are legal and never raise it.\n */\nexport const INVERTED_VALIDITY_WINDOW_CODE = \"INVERTED_VALIDITY_WINDOW\";\n\n/**\n * The stable {@link ValidationIssue.code} carried by a refusal to accept a\n * `validFrom` the write cannot apply: the target row is LIVE, and an in-place\n * update never rewrites a live row's lower bound — that bound is history.\n * `ValidationError`'s own code is the family-wide `VALIDATION_ERROR`, so the\n * discriminator lives on the issue — mirroring\n * {@link INVERTED_VALIDITY_WINDOW_CODE}.\n *\n * Only a bound naming a DIFFERENT instant than the row already stores raises it.\n * Restating the stored bound is legal and writes nothing new, and a resurrection\n * — which does rewrite `valid_from` — applies a stated bound rather than\n * refusing it.\n *\n * The message names both instants: the one stated and the one the row stores, so\n * the caller can restate the stored bound without a second read.\n */\nexport const IMMUTABLE_VALIDITY_LOWER_BOUND_CODE =\n  \"IMMUTABLE_VALIDITY_LOWER_BOUND\";\n\n/**\n * Stable {@link ValidationIssue.code} for an edge-id ownership mismatch.\n *\n * Edge ids are graph-global. A collection-scoped write therefore has to prove\n * that the stored row has the collection's kind and, when the caller supplies\n * endpoints, the same immutable endpoints. This refusal prevents a collection\n * from mutating another kind's row and prevents an upsert from silently\n * ignoring an attempted repoint.\n */\nexport const EDGE_IDENTITY_MISMATCH_CODE = \"EDGE_IDENTITY_MISMATCH\";\n\n/**\n * The stable {@link ValidationIssue.code} every \"this id is already taken\"\n * create refusal carries, whichever way the create found out: its own existence\n * probe, or the engine refusing the INSERT. `ValidationError`'s own code is the\n * family-wide `VALIDATION_ERROR`, so the discriminator lives on the issue —\n * mirroring {@link INVERTED_VALIDITY_WINDOW_CODE}.\n *\n * `details.entityType` says whether a node or an edge was refused and\n * `details.kind` names its kind. `details.id` names the taken id, and is absent\n * only when the refused statement inserted MORE THAN ONE row: the engine reports\n * that the statement collided without saying which row did.\n */\nexport const ENTITY_ALREADY_EXISTS_CODE = \"ENTITY_ALREADY_EXISTS\";\n\n/**\n * Details for ValidationError.\n */\nexport type ValidationErrorDetails = Readonly<{\n  /** Type of entity being validated */\n  entityType?: KindEntity;\n  /** Kind/type name of the entity */\n  kind?: string;\n  /** Operation being performed */\n  operation?: \"create\" | \"update\" | \"delete\" | \"hardDelete\";\n  /** Entity ID if updating */\n  id?: string;\n  /** Individual validation issues */\n  issues: readonly ValidationIssue[];\n}>;\n\n/**\n * Thrown when schema validation fails during node or edge operations.\n *\n * @example\n * ```typescript\n * try {\n *   await store.nodes.Person.create({ email: \"invalid\" });\n * } catch (error) {\n *   if (error instanceof ValidationError) {\n *     console.log(error.details.issues);\n *     // [{ path: \"email\", message: \"Invalid email\" }]\n *   }\n * }\n * ```\n */\nexport class ValidationError extends TypeGraphError {\n  declare readonly details: ValidationErrorDetails;\n\n  constructor(\n    message: string,\n    details: ValidationErrorDetails,\n    options?: { cause?: unknown; suggestion?: string },\n  ) {\n    const fieldList =\n      details.issues.length > 0 ?\n        details.issues.map((index) => index.path || \"(root)\").join(\", \")\n      : \"unknown\";\n\n    super(message, \"VALIDATION_ERROR\", {\n      details,\n      category: \"user\",\n      suggestion:\n        options?.suggestion ??\n        `Check the following fields: ${fieldList}. See error.details.issues for specific validation failures.`,\n      cause: options?.cause,\n    });\n    this.name = \"ValidationError\";\n  }\n}\n\n// ============================================================\n// Not Found Errors (category: \"user\")\n// ============================================================\n\n/**\n * Details for NodeNotFoundError.\n */\nexport type NodeNotFoundErrorDetails = Readonly<{\n  kind: string;\n  id: string;\n}>;\n\n/**\n * Thrown when a node is not found.\n *\n * @example\n * ```typescript\n * try {\n *   await store.nodes.Person.get(\"nonexistent-id\");\n * } catch (error) {\n *   if (error instanceof NodeNotFoundError) {\n *     console.log(error.details.kind, error.details.id);\n *   }\n * }\n * ```\n */\nexport class NodeNotFoundError extends TypeGraphError {\n  declare readonly details: NodeNotFoundErrorDetails;\n\n  constructor(kind: string, id: string, options?: { cause?: unknown }) {\n    super(`Node not found: ${kind}/${id}`, \"NODE_NOT_FOUND\", {\n      details: { kind, id },\n      category: \"user\",\n      suggestion: `Verify the node ID \"${id}\" exists and has not been deleted.`,\n      cause: options?.cause,\n    });\n    this.name = \"NodeNotFoundError\";\n  }\n}\n\n/**\n * Details for EdgeNotFoundError.\n */\nexport type EdgeNotFoundErrorDetails = Readonly<{\n  kind: string;\n  id: string;\n}>;\n\n/**\n * Thrown when an edge is not found.\n */\nexport class EdgeNotFoundError extends TypeGraphError {\n  declare readonly details: EdgeNotFoundErrorDetails;\n\n  constructor(kind: string, id: string, options?: { cause?: unknown }) {\n    super(`Edge not found: ${kind}/${id}`, \"EDGE_NOT_FOUND\", {\n      details: { kind, id },\n      category: \"user\",\n      suggestion: `Verify the edge ID \"${id}\" exists and has not been deleted.`,\n      cause: options?.cause,\n    });\n    this.name = \"EdgeNotFoundError\";\n  }\n}\n\n/**\n * Details for KindNotFoundError.\n */\nexport type KindNotFoundErrorDetails = Readonly<{\n  kindName: string;\n  entity: KindEntity;\n  graphId?: string;\n}>;\n\n/**\n * Thrown when an operation references a kind that isn't registered on\n * the graph — `getNodeCollectionOrThrow` against an unknown kind, a\n * `materializeIndexes({ kinds })` filter naming a missing kind, an\n * extension referencing an unresolved endpoint, search facade typos,\n * etc. Carries the offending `kindName` and `entity` plus the host\n * `graphId` so logs are unambiguous when multiple stores share a\n * process.\n */\nexport class KindNotFoundError extends TypeGraphError {\n  declare readonly details: KindNotFoundErrorDetails;\n  readonly kindName: string;\n  readonly entity: KindEntity;\n\n  constructor(\n    kindName: string,\n    entity: KindEntity,\n    options?: Readonly<{\n      graphId?: string;\n      suggestion?: string;\n      cause?: unknown;\n    }>,\n  ) {\n    const where =\n      options?.graphId === undefined ? \"\" : ` on graph \"${options.graphId}\"`;\n    super(\n      `${entity === \"node\" ? \"Node\" : \"Edge\"} kind \"${kindName}\" is not registered${where}.`,\n      \"KIND_NOT_FOUND\",\n      {\n        details: {\n          kindName,\n          entity,\n          ...(options?.graphId === undefined ?\n            {}\n          : { graphId: options.graphId }),\n        },\n        category: \"user\",\n        suggestion:\n          options?.suggestion ??\n          \"Compile-time kinds come from defineGraph; extension kinds appear after store.evolve() returns. Check store.introspect() for the registered set.\",\n        cause: options?.cause,\n      },\n    );\n    this.name = \"KindNotFoundError\";\n    this.kindName = kindName;\n    this.entity = entity;\n  }\n}\n\n/**\n * Details for NodeConstraintNotFoundError.\n */\nexport type NodeConstraintNotFoundErrorDetails = Readonly<{\n  constraintName: string;\n  kind: string;\n}>;\n\n/**\n * Thrown when a uniqueness constraint name is not found on a node kind.\n */\nexport class NodeConstraintNotFoundError extends TypeGraphError {\n  declare readonly details: NodeConstraintNotFoundErrorDetails;\n\n  constructor(\n    constraintName: string,\n    kind: string,\n    options?: { cause?: unknown },\n  ) {\n    super(\n      `Constraint not found: \"${constraintName}\" on node kind \"${kind}\"`,\n      \"CONSTRAINT_NOT_FOUND\",\n      {\n        details: { constraintName, kind },\n        category: \"user\",\n        suggestion: `Verify the constraint name \"${constraintName}\" is defined in the unique constraints for \"${kind}\".`,\n        cause: options?.cause,\n      },\n    );\n    this.name = \"NodeConstraintNotFoundError\";\n  }\n}\n\n/**\n * Details for NodeIndexNotFoundError.\n */\nexport type NodeIndexNotFoundErrorDetails = Readonly<{\n  indexName: string;\n  kind: string;\n}>;\n\n/**\n * Thrown when a declared node index name is not found on a node kind.\n */\nexport class NodeIndexNotFoundError extends TypeGraphError {\n  declare readonly details: NodeIndexNotFoundErrorDetails;\n\n  constructor(indexName: string, kind: string, options?: { cause?: unknown }) {\n    super(\n      `Index not found: \"${indexName}\" on node kind \"${kind}\"`,\n      \"INDEX_NOT_FOUND\",\n      {\n        details: { indexName, kind },\n        category: \"user\",\n        suggestion: `Verify the index name \"${indexName}\" is declared via defineNodeIndex for \"${kind}\" and passed to defineGraph({ indexes }).`,\n        cause: options?.cause,\n      },\n    );\n    this.name = \"NodeIndexNotFoundError\";\n  }\n}\n\n// ============================================================\n// Constraint Errors (category: \"constraint\")\n// ============================================================\n\n/**\n * Details for EndpointNotFoundError.\n */\nexport type EndpointNotFoundErrorDetails = Readonly<{\n  edgeKind: string;\n  endpoint: \"from\" | \"to\";\n  nodeKind: string;\n  nodeId: string;\n}>;\n\n/**\n * Thrown when edge endpoint node does not exist or is deleted.\n */\nexport class EndpointNotFoundError extends TypeGraphError {\n  declare readonly details: EndpointNotFoundErrorDetails;\n\n  constructor(\n    details: EndpointNotFoundErrorDetails,\n    options?: { cause?: unknown },\n  ) {\n    super(\n      `Endpoint node not found for edge \"${details.edgeKind}\": ${details.nodeKind}/${details.nodeId} (${details.endpoint})`,\n      \"ENDPOINT_NOT_FOUND\",\n      {\n        details,\n        category: \"constraint\",\n        suggestion: `Ensure the ${details.endpoint} node exists before creating the edge.`,\n        cause: options?.cause,\n      },\n    );\n    this.name = \"EndpointNotFoundError\";\n  }\n}\n\n/**\n * Details for EndpointError.\n */\nexport type EndpointErrorDetails = Readonly<{\n  edgeKind: string;\n  endpoint: \"from\" | \"to\";\n  actualKind: string;\n  expectedKinds: readonly string[];\n}>;\n\n/**\n * Thrown when edge endpoint has wrong node type.\n */\nexport class EndpointError extends TypeGraphError {\n  declare readonly details: EndpointErrorDetails;\n\n  constructor(details: EndpointErrorDetails, options?: { cause?: unknown }) {\n    const expected = details.expectedKinds.join(\" | \");\n    super(\n      `Invalid ${details.endpoint} endpoint for edge \"${details.edgeKind}\": got \"${details.actualKind}\", expected ${expected}`,\n      \"ENDPOINT_ERROR\",\n      {\n        details,\n        category: \"constraint\",\n        suggestion: `Use a node of type ${expected} as the ${details.endpoint} endpoint.`,\n        cause: options?.cause,\n      },\n    );\n    this.name = \"EndpointError\";\n  }\n}\n\n/**\n * Details for UniquenessError.\n */\nexport type UniquenessErrorDetails = Readonly<{\n  constraintName: string;\n  kind: string;\n  existingId: string;\n  newId: string;\n  fields: readonly string[];\n}>;\n\n/**\n * Thrown when uniqueness constraint is violated.\n */\nexport class UniquenessError extends TypeGraphError {\n  declare readonly details: UniquenessErrorDetails;\n\n  constructor(details: UniquenessErrorDetails, options?: { cause?: unknown }) {\n    const fieldList = details.fields.join(\", \");\n    super(\n      `Uniqueness violation on \"${details.kind}\": constraint \"${details.constraintName}\" (fields: ${fieldList}) conflicts with existing node ${details.existingId}`,\n      \"UNIQUENESS_VIOLATION\",\n      {\n        details,\n        category: \"constraint\",\n        suggestion: `Change the values for fields [${fieldList}] to be unique, or update the existing node ${details.existingId} instead.`,\n        cause: options?.cause,\n      },\n    );\n    this.name = \"UniquenessError\";\n  }\n}\n\n/**\n * Details for CardinalityError.\n */\nexport type CardinalityErrorDetails = Readonly<{\n  edgeKind: string;\n  fromKind: string;\n  fromId: string;\n  cardinality: string;\n  existingCount: number;\n}>;\n\n/**\n * Thrown when cardinality constraint is violated.\n */\nexport class CardinalityError extends TypeGraphError {\n  declare readonly details: CardinalityErrorDetails;\n\n  constructor(details: CardinalityErrorDetails, options?: { cause?: unknown }) {\n    super(\n      `Cardinality violation: \"${details.edgeKind}\" from ${details.fromKind}/${details.fromId} allows \"${details.cardinality}\" but ${details.existingCount} edge(s) already exist`,\n      \"CARDINALITY_ERROR\",\n      {\n        details,\n        category: \"constraint\",\n        suggestion:\n          details.cardinality === \"one\" || details.cardinality === \"unique\" ?\n            `Delete the existing edge before creating a new one, or use cardinality \"many\".`\n          : `Check if the cardinality constraint \"${details.cardinality}\" is correct for your use case.`,\n        cause: options?.cause,\n      },\n    );\n    this.name = \"CardinalityError\";\n  }\n}\n\n/**\n * Details for DisjointError.\n */\nexport type DisjointErrorDetails = Readonly<{\n  nodeId: string;\n  attemptedKind: string;\n  conflictingKind: string;\n}>;\n\n/**\n * Thrown when disjointness constraint is violated.\n *\n * Disjoint types cannot share the same ID - a node cannot be both\n * a Person and an Organization if they are declared disjoint.\n */\nexport class DisjointError extends TypeGraphError {\n  declare readonly details: DisjointErrorDetails;\n\n  constructor(details: DisjointErrorDetails, options?: { cause?: unknown }) {\n    super(\n      `Disjoint constraint violation: cannot create ${details.attemptedKind} with ID \"${details.nodeId}\" - conflicts with existing ${details.conflictingKind}`,\n      \"DISJOINT_ERROR\",\n      {\n        details,\n        category: \"constraint\",\n        suggestion: `Use a different ID for the new ${details.attemptedKind} node, or delete the existing ${details.conflictingKind}/${details.nodeId} first.`,\n        cause: options?.cause,\n      },\n    );\n    this.name = \"DisjointError\";\n  }\n}\n\nexport type IdentityContradictionErrorDetails = Readonly<{\n  /**\n   * The identity write that could not stand. `merge` is the post-write\n   * affected-class assertion a graph merge runs inside its commit\n   * transaction, which names the whole merge rather than a single assertion\n   * because the contradiction is a property of the state the merge would\n   * leave behind.\n   */\n  operation: \"assertSame\" | \"assertDifferent\" | \"fold\" | \"import\" | \"merge\";\n  a: Readonly<{ kind: string; id: string }>;\n  b: Readonly<{ kind: string; id: string }>;\n  reason: \"different-assertion\" | \"same-class\" | \"disjoint-kinds\";\n  conflictingAssertionId?: string;\n  conflictingKinds?: readonly [string, string];\n}>;\n\n/** Thrown when an identity mutation would make the ledger contradictory. */\nexport class IdentityContradictionError extends TypeGraphError {\n  declare readonly details: IdentityContradictionErrorDetails;\n\n  constructor(\n    details: IdentityContradictionErrorDetails,\n    options?: Readonly<{ cause?: unknown }>,\n  ) {\n    super(\n      `Identity contradiction: ${details.a.kind}/${details.a.id} and ${details.b.kind}/${details.b.id} cannot satisfy ${details.operation}.`,\n      \"IDENTITY_CONTRADICTION\",\n      {\n        details,\n        category: \"constraint\",\n        suggestion:\n          \"Retract the conflicting identity assertion or correct the graph ontology before retrying.\",\n        cause: options?.cause,\n      },\n    );\n    this.name = \"IdentityContradictionError\";\n  }\n}\n\nexport type IdentityValidityWindowErrorDetails = Readonly<{\n  reason:\n    | \"future-valid-from\"\n    | \"future-valid-to\"\n    | \"inverted\"\n    | \"overlapping-open-window\";\n  validFrom: string;\n  validTo?: string;\n  operationInstant: string;\n}>;\n\n/** Thrown when an identity assertion validity window cannot be applied. */\nexport class IdentityValidityWindowError extends TypeGraphError {\n  declare readonly details: IdentityValidityWindowErrorDetails;\n\n  constructor(details: IdentityValidityWindowErrorDetails) {\n    const code =\n      details.reason === \"future-valid-from\" ? \"IDENTITY_VALIDITY_FUTURE_START\"\n      : details.reason === \"future-valid-to\" ? \"IDENTITY_VALIDITY_FUTURE_END\"\n      : details.reason === \"inverted\" ? \"IDENTITY_VALIDITY_INVERTED\"\n      : \"IDENTITY_VALIDITY_OPEN_WINDOW_CONFLICT\";\n    super(\n      `Identity assertion validity window cannot be applied: ${details.reason}.`,\n      code,\n      {\n        details,\n        category:\n          details.reason === \"overlapping-open-window\" ? \"constraint\" : \"user\",\n        suggestion:\n          details.reason === \"inverted\" ? \"Pass validFrom at or before validTo.\"\n          : details.reason === \"overlapping-open-window\" ?\n            \"Retract the existing open assertion before creating a different open validity window for the same relation and pair.\"\n          : \"Use a boundary at or before the current operation clock; future-scheduled identity transitions are not supported.\",\n      },\n    );\n    this.name = \"IdentityValidityWindowError\";\n  }\n}\n\nexport type IdentityEndpointValidityErrorDetails = Readonly<{\n  endpoint: Readonly<{ kind: string; id: string }>;\n  assertionWindow: Readonly<{ validFrom: string; validTo?: string }>;\n  endpointWindow: Readonly<{\n    validFrom?: string;\n    validTo?: string;\n    deletedAt?: string;\n  }>;\n}>;\n\n/** Thrown when an identity endpoint does not exist throughout the assertion window. */\nexport class IdentityEndpointValidityError extends TypeGraphError {\n  declare readonly details: IdentityEndpointValidityErrorDetails;\n\n  constructor(details: IdentityEndpointValidityErrorDetails) {\n    super(\n      `Identity endpoint ${details.endpoint.kind}/${details.endpoint.id} does not exist throughout the requested assertion validity window.`,\n      \"IDENTITY_ENDPOINT_VALIDITY\",\n      {\n        details,\n        category: \"constraint\",\n        suggestion:\n          \"Choose an assertion window contained by both endpoint validity windows.\",\n      },\n    );\n    this.name = \"IdentityEndpointValidityError\";\n  }\n}\n\nexport type IdentitySeparationViolationErrorDetails = Readonly<{\n  graphId: string;\n  /**\n   * `\"database\"` when the CHECK constraint on the separation relation aborted\n   * the write — the backstop firing as designed. `\"writer\"` when the write was\n   * accepted, which means the relation was provisioned without its constraint\n   * and only the writer's own re-check caught the contradiction.\n   */\n  enforcedBy: \"database\" | \"writer\";\n  /** The single class key both endpoints collapsed onto. */\n  classKey: string;\n  /** The `different` assertion whose endpoints landed in one class. */\n  assertionId: string;\n  a: Readonly<{ kind: string; id: string }>;\n  b: Readonly<{ kind: string; id: string }>;\n}>;\n\n/**\n * Thrown when the derived separation relation refuses a write that would place\n * both endpoints of a current `different` assertion in one identity class.\n *\n * This is the database-level backstop beneath the plan-time simulation and the\n * applier's validation. Reaching it means an earlier layer let a contradiction\n * through: the transaction is aborted rather than committed, but the layer that\n * should have refused it typed and early is worth investigating.\n */\nexport class IdentitySeparationViolationError extends TypeGraphError {\n  declare readonly details: IdentitySeparationViolationErrorDetails;\n\n  constructor(\n    details: IdentitySeparationViolationErrorDetails,\n    options?: Readonly<{ cause?: unknown }>,\n  ) {\n    super(\n      `Identity separation violated: ${details.a.kind}/${details.a.id} and ${details.b.kind}/${details.b.id} are held apart by assertion ${details.assertionId}, but this write would put both in identity class ${details.classKey}.`,\n      \"IDENTITY_SEPARATION_VIOLATION\",\n      {\n        details,\n        category: \"constraint\",\n        suggestion:\n          \"Retract the conflicting different assertion before merging these identity classes. If no application call requested this merge, the write reached the ledger through a path that skipped identity validation.\",\n        cause: options?.cause,\n      },\n    );\n    this.name = \"IdentitySeparationViolationError\";\n  }\n}\n\n/**\n * Details for RestrictedDeleteError.\n */\nexport type RestrictedDeleteErrorDetails = Readonly<{\n  nodeKind: string;\n  nodeId: string;\n  edgeCount: number;\n  edgeKinds: readonly string[];\n}>;\n\n/**\n * Thrown when deletion is blocked due to existing edges (restrict behavior).\n */\nexport class RestrictedDeleteError extends TypeGraphError {\n  declare readonly details: RestrictedDeleteErrorDetails;\n\n  constructor(\n    details: RestrictedDeleteErrorDetails,\n    options?: { cause?: unknown },\n  ) {\n    const edgeList = details.edgeKinds.join(\", \");\n    super(\n      `Cannot delete ${details.nodeKind}/${details.nodeId}: ${details.edgeCount} connected edge(s) exist (${edgeList})`,\n      \"RESTRICTED_DELETE\",\n      {\n        details,\n        category: \"constraint\",\n        suggestion: `Delete the connected edges first, or change onDelete behavior to \"cascade\" (auto-delete edges) or \"disconnect\" (soft-delete edges).`,\n        cause: options?.cause,\n      },\n    );\n    this.name = \"RestrictedDeleteError\";\n  }\n}\n\n// ============================================================\n// Concurrency Errors (category: \"system\")\n// ============================================================\n\n/**\n * Details for VersionConflictError.\n */\nexport type VersionConflictErrorDetails = Readonly<{\n  kind: string;\n  id: string;\n  expectedVersion: number;\n  actualVersion: number;\n}>;\n\n/**\n * Thrown when optimistic locking detects a concurrent modification.\n *\n * This occurs when two operations try to update the same entity simultaneously.\n * The operation with the stale version fails.\n */\nexport class VersionConflictError extends TypeGraphError {\n  declare readonly details: VersionConflictErrorDetails;\n\n  constructor(\n    details: VersionConflictErrorDetails,\n    options?: { cause?: unknown },\n  ) {\n    super(\n      `Version conflict on ${details.kind}/${details.id}: expected version ${details.expectedVersion}, found ${details.actualVersion}`,\n      \"VERSION_CONFLICT\",\n      {\n        details,\n        category: \"system\",\n        suggestion: `Fetch the latest version of the entity and retry the operation. This error indicates concurrent modification.`,\n        cause: options?.cause,\n      },\n    );\n    this.name = \"VersionConflictError\";\n  }\n}\n\n// ============================================================\n// Schema Errors (category: \"system\")\n// ============================================================\n\n/**\n * Details for SchemaMismatchError.\n */\nexport type SchemaMismatchErrorDetails = Readonly<{\n  graphId: string;\n  expectedHash: string;\n  actualHash: string;\n}>;\n\n/**\n * Thrown when the schema in code doesn't match the schema in the database.\n */\nexport class SchemaMismatchError extends TypeGraphError {\n  declare readonly details: SchemaMismatchErrorDetails;\n\n  constructor(\n    details: SchemaMismatchErrorDetails,\n    options?: { cause?: unknown },\n  ) {\n    super(\n      `Schema mismatch for graph \"${details.graphId}\": code schema differs from database schema`,\n      \"SCHEMA_MISMATCH\",\n      {\n        details,\n        category: \"system\",\n        suggestion: `Run schema migration to update the database, or use createStoreWithSchema() for automatic migration.`,\n        cause: options?.cause,\n      },\n    );\n    this.name = \"SchemaMismatchError\";\n  }\n}\n\n/**\n * Details for MigrationError.\n */\n/**\n * Why a migration operation failed. A stable discriminant so callers can\n * branch on the outcome instead of matching the message text, which is free\n * to be reworded in any release.\n */\nexport const MIGRATION_FAILURE_REASONS = [\n  /**\n   * The persisted schema is behind the code graph. Raised on the\n   * least-privilege runtime path, which cannot run DDL — a privileged\n   * migrator must advance the schema first. Inspect `details.diff`\n   * (`hasBreakingChanges`) to tell an additive change from an incompatible\n   * one.\n   */\n  \"schema-behind\",\n  /** Breaking changes were detected while `throwOnBreaking` was set. */\n  \"breaking-change\",\n  /** No active schema version exists for the graph. */\n  \"no-active-version\",\n  /** The requested schema version does not exist for the graph. */\n  \"version-not-found\",\n  /**\n   * The schema about to be committed drops node or edge kinds that still\n   * hold rows. Committing would make those rows unreachable, and the next\n   * `materializeRemovals()` — which re-derives removals from schema history —\n   * would delete them. Inspect `details.droppedKinds` for the names. Use\n   * `Store.removeKinds()`, the removal path that queues cleanup explicitly,\n   * or pass `discardDroppedKindRows` to `migrateSchema` if losing the rows is\n   * the intent.\n   */\n  \"kind-removal\",\n] as const;\n\nexport type MigrationFailureReason = (typeof MIGRATION_FAILURE_REASONS)[number];\n\n/**\n * Structured context for a {@link MigrationError}, discriminated on `reason`.\n *\n * Modelled as a union rather than one shape with optional fields so the\n * payload a reason promises is the payload it must carry: narrowing on\n * `reason === \"kind-removal\"` gives you a non-optional `droppedKinds`, and the\n * constructor cannot be handed a `kind-removal` without one.\n *\n * The common fields are repeated per member rather than factored into a shared\n * base alias, which would be a hoisted-unexported symbol on the public\n * entrypoint.\n */\nexport type MigrationErrorDetails =\n  | Readonly<{\n      graphId: string;\n      fromVersion: number;\n      toVersion: number;\n      /** Stable discriminant — branch on this, not the message. */\n      reason: \"schema-behind\" | \"breaking-change\";\n      /**\n       * The structured diff behind the failure. Carries per-change `severity`\n       * alongside `hasChanges` / `hasBreakingChanges`, so a caller can decide\n       * \"additive → proceed, incompatible → ask the user\" without re-querying.\n       */\n      diff?: SchemaDiff;\n    }>\n  | Readonly<{\n      graphId: string;\n      fromVersion: number;\n      toVersion: number;\n      reason: \"no-active-version\" | \"version-not-found\";\n    }>\n  | Readonly<{\n      graphId: string;\n      fromVersion: number;\n      toVersion: number;\n      reason: \"kind-removal\";\n      /**\n       * The dropped kinds that still held rows, and so caused the refusal. A\n       * kind the commit drops but that is already empty is permitted and does\n       * NOT appear here. Both lists are sorted; at least one is non-empty.\n       */\n      droppedKinds: Readonly<{\n        nodes: readonly string[];\n        edges: readonly string[];\n      }>;\n    }>;\n\n/**\n * Thrown when schema migration fails.\n */\nexport class MigrationError extends TypeGraphError {\n  declare readonly details: MigrationErrorDetails;\n\n  constructor(\n    message: string,\n    details: MigrationErrorDetails,\n    options?: { cause?: unknown },\n  ) {\n    super(message, \"MIGRATION_ERROR\", {\n      details,\n      category: \"system\",\n      suggestion: `Review the schema changes and ensure they are backwards compatible, or implement a data migration.`,\n      cause: options?.cause,\n    });\n    this.name = \"MigrationError\";\n  }\n}\n\n/**\n * Details for EagerMaterializationError.\n */\nexport type EagerMaterializationErrorDetails = Readonly<{\n  graphId: string;\n  failedIndexNames: readonly string[];\n}>;\n\n/**\n * Thrown by `Store.evolve(extension, { eager })` when the schema\n * commit succeeded but the follow-on `materializeIndexes()` produced\n * one or more failed entries.\n *\n * Recovery: the schema commit is NOT rolled back. The new `Store` is\n * fully constructed and (when `options.ref` was supplied) `ref.current`\n * already points to it — the caller can read the new store via the ref\n * and decide how to handle the failed indexes (retry, skip, alert).\n * The full `MaterializeIndexesResult` is attached as `.materialization`.\n *\n * @example\n * ```ts\n * const ref = { current: store };\n * try {\n *   await store.evolve(extension, { ref, eager: {} });\n * } catch (error) {\n *   if (error instanceof EagerMaterializationError) {\n *     // schema is committed; ref.current is the new store\n *     log.warn(\n *       { failed: error.failedIndexNames },\n *       \"indexes did not materialize; will retry\",\n *     );\n *     await ref.current.materializeIndexes();\n *   } else {\n *     throw error;\n *   }\n * }\n * ```\n */\nexport class EagerMaterializationError extends TypeGraphError {\n  declare readonly details: EagerMaterializationErrorDetails;\n\n  /**\n   * The full materialization result, including successful and failed\n   * entries. Same shape as `Store.materializeIndexes()` returns.\n   */\n  readonly materialization: MaterializeIndexesResult;\n\n  constructor(materialization: MaterializeIndexesResult, graphId: string) {\n    const names = collectFailedIndexNames(materialization);\n    super(\n      `Eager materialization failed for ${names.length} index(es) on graph \"${graphId}\": ${names.join(\", \")}. The schema commit succeeded; the new Store is available via the ref handle (when supplied) and the failed indexes can be retried via store.materializeIndexes().`,\n      \"EAGER_MATERIALIZATION_FAILED\",\n      {\n        details: { graphId, failedIndexNames: names },\n        category: \"system\",\n        suggestion: `Inspect error.materialization for per-index errors. Each failure preserves any prior successful materialization timestamp; the schema is committed regardless.`,\n      },\n    );\n    this.name = \"EagerMaterializationError\";\n    this.materialization = materialization;\n  }\n\n  /**\n   * Names of just the indexes that failed — derived from\n   * `materialization.results` so the two views can never disagree.\n   */\n  get failedIndexNames(): readonly string[] {\n    return collectFailedIndexNames(this.materialization);\n  }\n}\n\nfunction collectFailedIndexNames(\n  materialization: MaterializeIndexesResult,\n): readonly string[] {\n  const names: string[] = [];\n  for (const entry of materialization.results) {\n    if (entry.status === \"failed\") names.push(entry.indexName);\n  }\n  return names;\n}\n\n/**\n * Details for StaleVersionError. `actual` is the active version the rejecting\n * read observed, and is `0` only when the graph genuinely has no active version\n * (an initial-commit race where another writer initialized first, or a graph\n * whose schema rows were removed out of band). A concurrent advance always\n * reports the newly active version, so `0` is a reliable signal of absence\n * rather than of contention.\n */\nexport type StaleVersionErrorDetails = Readonly<{\n  graphId: string;\n  expected: number;\n  actual: number;\n}>;\n\n/**\n * Thrown by `commitSchemaVersion`, `setActiveVersion`, and the schema write\n * fence a schema-managed Store write takes, when the caller's view of the\n * active schema version is out of date — another writer has already advanced\n * it.\n *\n * Recovery: re-read the active version with `getActiveSchema(graphId)`,\n * recompute against the new baseline, and retry. This is a routine\n * concurrency signal, not a bug.\n */\nexport class StaleVersionError extends TypeGraphError {\n  declare readonly details: StaleVersionErrorDetails;\n\n  constructor(\n    details: StaleVersionErrorDetails,\n    options?: { cause?: unknown },\n  ) {\n    super(\n      `Schema version was advanced by another writer for graph \"${details.graphId}\": expected active version ${details.expected}, actual is ${details.actual}`,\n      \"STALE_SCHEMA_VERSION\",\n      {\n        details,\n        category: \"system\",\n        suggestion: `Re-read the active schema version, recompute the new version against that baseline, and retry the commit.`,\n        cause: options?.cause,\n      },\n    );\n    this.name = \"StaleVersionError\";\n  }\n}\n\n/**\n * Details for SchemaContentConflictError.\n */\nexport type SchemaContentConflictErrorDetails = Readonly<{\n  graphId: string;\n  version: number;\n  existingHash: string;\n  incomingHash: string;\n}>;\n\n/**\n * Thrown by `commitSchemaVersion` when a row already exists at the\n * target version with a *different* schema hash — i.e. two writers\n * committed materially different schemas at the same version number.\n *\n * Distinct from `StaleVersionError`: this is not a refetch-and-retry\n * situation, it's a content disagreement that needs operator\n * intervention. Typically caused by inconsistent application\n * deployments writing schemas that hash differently.\n */\nexport class SchemaContentConflictError extends TypeGraphError {\n  declare readonly details: SchemaContentConflictErrorDetails;\n\n  constructor(\n    details: SchemaContentConflictErrorDetails,\n    options?: { cause?: unknown },\n  ) {\n    super(\n      `Schema content conflict for graph \"${details.graphId}\" at version ${details.version}: existing hash ${details.existingHash} differs from incoming hash ${details.incomingHash}`,\n      \"SCHEMA_CONTENT_CONFLICT\",\n      {\n        details,\n        category: \"system\",\n        suggestion: `Two writers committed different schemas at the same version. Reconcile the application deployments so they produce the same canonical schema, then retry.`,\n        cause: options?.cause,\n      },\n    );\n    this.name = \"SchemaContentConflictError\";\n  }\n}\n\n// ============================================================\n// Configuration Errors (category: \"user\")\n// ============================================================\n\n/**\n * Thrown when graph configuration is invalid.\n *\n * This includes invalid schema definitions, ontology conflicts,\n * and other configuration issues detected at graph creation time.\n */\nexport class ConfigurationError extends TypeGraphError {\n  constructor(\n    message: string,\n    details: Record<string, unknown> = {},\n    options?: { cause?: unknown; suggestion?: string },\n  ) {\n    super(message, \"CONFIGURATION_ERROR\", {\n      details,\n      category: \"user\",\n      suggestion:\n        options?.suggestion ?? `Review your graph definition for errors.`,\n      cause: options?.cause,\n    });\n    this.name = \"ConfigurationError\";\n  }\n}\n\n/**\n * Why a destructive contribution rebuild is refused.\n *\n * - `vector-source-unavailable` — the projection is vector storage.\n *   TypeGraph stores caller-supplied embeddings and nothing else: the\n *   vectors exist only in the table a rebuild would drop, so there is no\n *   source to reconstruct them from. Dropping anyway would silently\n *   destroy the embeddings and hand back storage that looks healthy and\n *   returns nothing. `store.reembedVectorField(kind, fieldPath, {\n *   embed })` is the sanctioned destructive path — it takes the callback\n *   that can regenerate what the drop destroys.\n * - `no-drop-ddl` — the active strategy declares no `dropDdl` for the\n *   contribution, so TypeGraph does not know how to tear its storage\n *   down. Synthesizing a `DROP TABLE` from the resolved name would\n *   guess at a teardown the strategy never sanctioned.\n * - `no-schema-fence` — the backend exposes no transactional schema\n *   fence (`schemaWriteTransaction`), so the drop, recreate, refill, and\n *   stamp could not be made atomic. Running them unfenced could leave\n *   storage attested but empty, or a concurrent schema writer\n *   interleaved with the drop.\n * - `shared-storage-in-use` — the contribution's recorded shape is stale,\n *   so only recreating its storage repairs it, but that storage is one\n *   table holding other graphs' rows as well. Their content is derived\n *   from their own nodes through their own schemas, so this process cannot\n *   put it back. A rebuild that dropped anyway would leave every other\n *   graph's search silently empty; one that re-stamped this graph's marker\n *   without the drop would bless a physical shape nothing verified.\n */\nexport type ContributionRebuildRefusal =\n  | \"vector-source-unavailable\"\n  | \"no-drop-ddl\"\n  | \"no-schema-fence\"\n  | \"shared-storage-in-use\";\n\nconst CONTRIBUTION_REBUILD_REFUSAL_MESSAGE: Readonly<\n  Record<ContributionRebuildRefusal, string>\n> = {\n  \"vector-source-unavailable\":\n    \"Vector contributions cannot be rebuilt: TypeGraph stores the vectors \" +\n    \"callers supply and never the inputs that produced them, so the \" +\n    \"embeddings exist only in the storage a rebuild would drop.\",\n  \"no-drop-ddl\":\n    \"The active strategy declares no teardown DDL for this contribution, so \" +\n    \"its storage cannot be dropped and recreated.\",\n  \"no-schema-fence\":\n    \"This backend exposes no transactional schema fence, so a rebuild's \" +\n    \"drop, recreate, refill, and marker stamp cannot be made atomic.\",\n  \"shared-storage-in-use\":\n    \"This contribution's storage is provisioned at a different shape than \" +\n    \"the current declaration, and the only repair — recreating it — would \" +\n    \"destroy fulltext content belonging to other graphs that share the same \" +\n    \"table and can only be rebuilt from their own processes.\",\n};\n\nconst CONTRIBUTION_REBUILD_REFUSAL_SUGGESTION: Readonly<\n  Record<ContributionRebuildRefusal, string>\n> = {\n  \"vector-source-unavailable\":\n    \"Run store.reembedVectorField(kind, fieldPath, { embed }) instead: it \" +\n    \"recreates the field's storage and takes the callback that regenerates \" +\n    \"the embeddings the recreate discards.\",\n  \"no-drop-ddl\":\n    \"Declare dropDdl on the contribution returned from the strategy's \" +\n    \"ownedTables(), or drop and recreate the table out of band and then run \" +\n    \"store.repairContributions() to re-stamp its marker.\",\n  \"no-schema-fence\":\n    \"Use a backend that implements schemaWriteTransaction, or perform the \" +\n    \"drop and recreate out of band during a maintenance window and then run \" +\n    \"store.repairContributions() followed by store.search.rebuildFulltext().\",\n  \"shared-storage-in-use\":\n    \"Recreate the shared table during a maintenance window with every graph \" +\n    \"that uses it offline: drop it out of band, then run \" +\n    'store.rebuildContribution(\"fulltext\") once per graph on this database. ' +\n    \"Each run recreates the table from the current DDL and refills that \" +\n    \"graph's rows from its own nodes.\",\n};\n\n/**\n * Thrown when `store.rebuildContribution()` cannot honor a rebuild.\n *\n * A refusal, never a partial attempt: nothing has been dropped when this\n * throws. The point is that the alternative — proceeding — destroys data\n * that cannot be reconstructed, so the operation declines instead of\n * quietly doing less than its name promises.\n */\nexport class ContributionRebuildUnsupportedError extends TypeGraphError {\n  readonly reason: ContributionRebuildRefusal;\n\n  constructor(\n    reason: ContributionRebuildRefusal,\n    details: Readonly<Record<string, unknown>> = {},\n    options?: { cause?: unknown },\n  ) {\n    super(\n      CONTRIBUTION_REBUILD_REFUSAL_MESSAGE[reason],\n      \"CONTRIBUTION_REBUILD_UNSUPPORTED\",\n      {\n        details: { ...details, reason },\n        category: \"user\",\n        suggestion: CONTRIBUTION_REBUILD_REFUSAL_SUGGESTION[reason],\n        cause: options?.cause,\n      },\n    );\n    this.name = \"ContributionRebuildUnsupportedError\";\n    this.reason = reason;\n  }\n}\n\n/**\n * Thrown when an iterative graph algorithm exhausts its caller-visible round\n * budget before reaching its convergence predicate.\n */\nexport class GraphAlgorithmConvergenceError extends TypeGraphError {\n  constructor(\n    algorithm: string,\n    maxIterations: number,\n    options: Readonly<{ oscillating?: boolean }> = {},\n  ) {\n    const oscillating = options.oscillating === true;\n    super(\n      oscillating ?\n        `${algorithm} entered a periodic label oscillation and can never converge.`\n      : `${algorithm} did not converge within ${maxIterations} iterations.`,\n      \"GRAPH_ALGORITHM_CONVERGENCE_ERROR\",\n      {\n        details: {\n          algorithm,\n          maxIterations,\n          ...(oscillating ? { oscillating } : {}),\n        },\n        category: \"user\",\n        suggestion:\n          oscillating ?\n            'Pass onMaxIterations: \"return\" to accept the fixed-round labeling, or exclude the oscillating component from the selection.'\n          : \"Increase maxIterations or reduce the selected graph before retrying.\",\n      },\n    );\n    this.name = \"GraphAlgorithmConvergenceError\";\n  }\n}\n\n/** Stable reasons a weighted traversal can reject an edge's weight value. */\nexport type InvalidEdgeWeightReason =\n  \"missing\" | \"negative\" | \"non_numeric\" | \"out_of_range\";\n\n/** Details for InvalidEdgeWeightError. */\nexport type InvalidEdgeWeightErrorDetails = Readonly<{\n  /** Id of the first offending edge, in binary-collation order. */\n  edgeId: string;\n  /** Kind of the offending edge. */\n  edgeKind: string;\n  /** The audited weight property. */\n  property: string;\n  /** Why the weight was rejected. */\n  reason: InvalidEdgeWeightReason;\n  /** The offending value, when one was present and renderable. */\n  value?: string;\n}>;\n\nconst EDGE_WEIGHT_REASONS: Readonly<\n  Record<\n    InvalidEdgeWeightReason,\n    Readonly<{ message: string; suggestion: string }>\n  >\n> = {\n  missing: {\n    message: \"has no value for weight property\",\n    suggestion:\n      \"Set the property on every selected edge, or provide defaultWeight for edges without it.\",\n  },\n  negative: {\n    message: \"has a negative value for weight property\",\n    suggestion:\n      \"Weighted traversal requires non-negative weights; repair the edge data before retrying.\",\n  },\n  non_numeric: {\n    message: \"has a non-numeric value for weight property\",\n    suggestion:\n      \"Store the weight property as a JSON number on every selected edge before retrying.\",\n  },\n  out_of_range: {\n    message: \"has a value outside the supported range for weight property\",\n    suggestion:\n      \"Keep weight magnitudes within the range weightedShortestPath documents (large enough to be a normal IEEE 754 double, small enough that path sums cannot overflow).\",\n  },\n};\n\n/**\n * Thrown when a weighted graph algorithm finds an edge whose weight property\n * violates the weighted-traversal contract (missing without a default,\n * non-numeric, or negative). Raised before any traversal rounds run, so a\n * weighted call either observes a fully valid weight domain or fails fast.\n */\nexport class InvalidEdgeWeightError extends TypeGraphError {\n  declare readonly details: InvalidEdgeWeightErrorDetails;\n\n  constructor(details: InvalidEdgeWeightErrorDetails) {\n    super(\n      `Edge '${details.edgeId}' (kind '${details.edgeKind}') ${EDGE_WEIGHT_REASONS[details.reason].message} '${details.property}'${\n        details.value === undefined ? \"\" : ` (value: ${details.value})`\n      }.`,\n      \"INVALID_EDGE_WEIGHT\",\n      {\n        details: { ...details },\n        category: \"user\",\n        suggestion: EDGE_WEIGHT_REASONS[details.reason].suggestion,\n      },\n    );\n    this.name = \"InvalidEdgeWeightError\";\n  }\n}\n\n/** Thrown when an operation requires a backend capability it does not expose. */\nexport class UnsupportedBackendCapabilityError extends TypeGraphError {\n  constructor(\n    operation: string,\n    capability: string,\n    details: Readonly<Record<string, unknown>> = {},\n    suggestion?: string,\n  ) {\n    super(\n      `${operation} requires backend capability '${capability}'.`,\n      \"UNSUPPORTED_BACKEND_CAPABILITY\",\n      {\n        details: { operation, capability, ...details },\n        category: \"user\",\n        suggestion:\n          suggestion ??\n          \"Use a backend that advertises this capability before invoking the operation.\",\n      },\n    );\n    this.name = \"UnsupportedBackendCapabilityError\";\n  }\n}\n\n/** Stable reasons an intentionally trusted initial import can be rejected. */\nexport type TrustedImportErrorReason =\n  | \"backend_unsupported\"\n  | \"database_not_empty\"\n  | \"fulltext_unsupported\"\n  | \"history_unsupported\"\n  | \"identity_unsupported\"\n  | \"invalid_stream\"\n  | \"revision_tracking_unsupported\"\n  | \"uniqueness_unsupported\"\n  | \"vector_unsupported\";\n\n/** Thrown when the trusted initial-import contract is unavailable or violated. */\nexport class TrustedImportError extends TypeGraphError {\n  constructor(\n    message: string,\n    reason: TrustedImportErrorReason,\n    details: Readonly<Record<string, unknown>> = {},\n    options?: Readonly<{ cause?: unknown; suggestion?: string }>,\n  ) {\n    super(message, \"TRUSTED_IMPORT_ERROR\", {\n      details: { ...details, reason },\n      category: \"user\",\n      suggestion:\n        options?.suggestion ??\n        \"Use the validating bulk or interchange import APIs unless every trusted-import precondition is satisfied.\",\n      cause: options?.cause,\n    });\n    this.name = \"TrustedImportError\";\n  }\n}\n\n/**\n * Thrown to a graph export stream's consumer when the caller's `AbortSignal`\n * settled the stream instead of it reaching its end.\n *\n * Raised only after the export has given back everything it took, so receiving\n * it means the connection is already usable again. WHAT it took depends on the\n * backend: an export on one reporting `capabilities.transactions` holds a\n * repeatable-read snapshot (and, on a serialized connection, that connection's\n * stream lease), and both are settled before this is thrown; an export on a\n * backend without transactions holds neither, and its remaining reads are\n * simply abandoned — its already-delivered chunks were never one snapshot to\n * begin with. The message says which case applies. `cause` carries the signal's\n * own `reason` when the caller supplied one.\n */\nexport class ExportStreamCancelledError extends TypeGraphError {\n  constructor(\n    message: string,\n    details: Readonly<Record<string, unknown>> = {},\n    options?: Readonly<{ cause?: unknown; suggestion?: string }>,\n  ) {\n    super(message, \"INTERCHANGE_EXPORT_STREAM_ABORTED\", {\n      details,\n      category: \"user\",\n      suggestion:\n        options?.suggestion ??\n        \"Start a new export; the aborted one released its snapshot transaction and the connection it held.\",\n      cause: options?.cause,\n    });\n    this.name = \"ExportStreamCancelledError\";\n  }\n}\n\n/**\n * Thrown when an export stream's consumer leaves a delivered chunk\n * unacknowledged for longer than its configured idle timeout.\n *\n * The timeout measures consumer idleness only: it starts when a chunk is\n * yielded and stops when the consumer asks for the next one. Receiving this\n * error means the timed-out export has settled its snapshot transaction and\n * released any serialized connection lease it held. `details.idleTimeoutMs`\n * carries the configured bound.\n */\nexport class ExportStreamIdleTimeoutError extends TypeGraphError {\n  constructor(graphId: string, idleTimeoutMs: number, transactional: boolean) {\n    super(\n      transactional ?\n        `The graph export stream consumer did not request its next chunk within ${idleTimeoutMs}ms: its repeatable-read snapshot has been rolled back and the connection it held released.`\n      : `The graph export stream consumer did not request its next chunk within ${idleTimeoutMs}ms: its remaining reads were abandoned. This backend does not support transactions, so the export held no snapshot and no connection.`,\n      \"INTERCHANGE_EXPORT_STREAM_IDLE_TIMEOUT\",\n      {\n        details: { graphId, idleTimeoutMs },\n        category: \"user\",\n        suggestion:\n          transactional ?\n            \"Start a new export and consume each chunk within the configured idle timeout, increase idleTimeoutMs, or cancel explicitly with an AbortSignal.\"\n          : \"Start a new export and consume each chunk within the configured idle timeout, increase idleTimeoutMs, or cancel explicitly with an AbortSignal; discard the partial export unless mutually-inconsistent chunks are acceptable.\",\n      },\n    );\n    this.name = \"ExportStreamIdleTimeoutError\";\n  }\n}\n\n/**\n * The stable `details.code` values raised by the recorded-capture guards on a\n * history- or revision-tracked store. These are the sanctioned branch points\n * for a portable caller that must pick a transaction strategy without\n * substring-matching {@link ConfigurationError} messages.\n *\n * - `RECORDED_CAPTURE_REQUIRES_CALLBACK_TRANSACTION`: `store.withTransaction`\n *   was called on a history-enabled store, which has no flush point before the\n *   caller commits — use `store.withRecordedTransaction` instead.\n * - `RECORDED_CAPTURE_RAW_SQL_DISABLED`: a raw SQL escape (`tx.sql`,\n *   `backend.executeStatement`/`executeDdl`) was reached on a history-enabled\n *   store, where it would bypass recorded-time capture.\n * - `REVISION_TRACKING_RAW_SQL_DISABLED`: the same raw SQL escape on a\n *   revision-tracked store, where it would bypass the revision anchor.\n *\n * @see isRecordedCaptureGuardError\n */\nexport const RECORDED_CAPTURE_GUARD_CODES = [\n  \"RECORDED_CAPTURE_REQUIRES_CALLBACK_TRANSACTION\",\n  \"RECORDED_CAPTURE_RAW_SQL_DISABLED\",\n  \"REVISION_TRACKING_RAW_SQL_DISABLED\",\n] as const;\n\n/** A stable, branchable code raised by a recorded-capture guard. */\nexport type RecordedCaptureGuardCode =\n  (typeof RECORDED_CAPTURE_GUARD_CODES)[number];\n\n/**\n * A {@link ConfigurationError} narrowed to carry a {@link RecordedCaptureGuardCode}\n * in `details.code` — the shape {@link isRecordedCaptureGuardError} guarantees.\n * `C` narrows `details.code` to a single code when the guard was called with a\n * specific one; it defaults to the full union.\n */\nexport type RecordedCaptureGuardError<\n  C extends RecordedCaptureGuardCode = RecordedCaptureGuardCode,\n> = ConfigurationError & Readonly<{ details: Readonly<{ code: C }> }>;\n\nfunction isRecordedCaptureGuardCode(\n  value: unknown,\n): value is RecordedCaptureGuardCode {\n  // Widen the readonly tuple so `includes` accepts an `unknown` needle.\n  return (RECORDED_CAPTURE_GUARD_CODES as readonly unknown[]).includes(value);\n}\n\n/**\n * Type guard for the recorded-capture guard errors, so a portable caller can\n * branch on the invariant a store enforced instead of substring-matching the\n * message. Pass `code` to narrow to a single guard; omit it to match any.\n *\n * Distinguishes \"history capture forbids raw SQL here\" from \"this backend has\n * no transactions\" (the latter carries no guard code — see\n * `TransactionContext.sqlAvailability` for the capability discriminant).\n *\n * Passing `code` also narrows `details.code` to that literal on the guarded\n * branch, so a caller can read the payload without re-checking.\n *\n * @example\n * ```typescript\n * // `withTransaction` is a compile error on a history-enabled store, so widen\n * // to the base Store surface to reach the runtime guard this branches on.\n * const store: Store<typeof graph> = historyStore;\n * try {\n *   store.withTransaction(externalTx);\n * } catch (error) {\n *   if (\n *     isRecordedCaptureGuardError(\n *       error,\n *       \"RECORDED_CAPTURE_REQUIRES_CALLBACK_TRANSACTION\",\n *     )\n *   ) {\n *     // error.details.code is now the literal, not the union.\n *     await historyStore.withRecordedTransaction(externalTx, run);\n *   } else {\n *     throw error;\n *   }\n * }\n * ```\n */\nexport function isRecordedCaptureGuardError<C extends RecordedCaptureGuardCode>(\n  error: unknown,\n  code: C,\n): error is RecordedCaptureGuardError<C>;\nexport function isRecordedCaptureGuardError(\n  error: unknown,\n): error is RecordedCaptureGuardError;\nexport function isRecordedCaptureGuardError(\n  error: unknown,\n  code?: RecordedCaptureGuardCode,\n): error is RecordedCaptureGuardError {\n  if (!(error instanceof ConfigurationError)) return false;\n  const actual = error.details[\"code\"];\n  if (!isRecordedCaptureGuardCode(actual)) return false;\n  return code === undefined || actual === code;\n}\n\n/**\n * Why a store's strategy-owned storage is not usable on the current\n * connection. Drives the {@link StoreNotInitializedError} message and\n * is surfaced in `details.reason` for programmatic handling.\n *\n * - `missing`: no durable materialization marker exists — the database\n *   was never initialized for this graph's runtime contributions.\n * - `stale`: a marker exists but its recorded signature no longer\n *   matches the resolved contribution DDL (strategy swap or DDL drift).\n *   The hot path refuses rather than silently re-materializing.\n * - `failed`: the most recent boot-time materialization attempt\n *   recorded an error. Boot may retry; the hot path refuses.\n */\nexport type StoreNotInitializedReason = \"missing\" | \"stale\" | \"failed\";\n\nconst STORE_NOT_INITIALIZED_REASON_PHRASE: Readonly<\n  Record<StoreNotInitializedReason, string>\n> = {\n  missing: \"is not initialized\",\n  stale: \"is stale (recorded materialization signature no longer matches)\",\n  failed: \"failed its last initialization attempt\",\n};\n\n/**\n * Details for StoreNotInitializedError. `graphId`/`reason` are always\n * present; callers may merge additional context (e.g. `logicalName`) via\n * `options.details`.\n */\nexport type StoreNotInitializedErrorDetails = Readonly<{\n  graphId: string;\n  reason: StoreNotInitializedReason;\n}> &\n  Readonly<Record<string, unknown>>;\n\n/**\n * Thrown when a fulltext- or vector-dependent operation runs against a\n * connection whose strategy-owned storage has not been durably materialized.\n *\n * `createStore()` is a synchronous, zero-I/O attach: it never creates\n * tables, repairs DDL, or writes materialization markers. The durable\n * marker is written exclusively by the async boot path\n * (`createStoreWithSchema`). When a fulltext or embedding read/write — or\n * an adopted/business transaction — observes no valid marker, it refuses\n * loudly here instead of lazily emitting DDL on the hot path.\n */\nexport class StoreNotInitializedError extends TypeGraphError {\n  declare readonly details: StoreNotInitializedErrorDetails;\n\n  // `graphId`/`reason` are positional and required: both are\n  // load-bearing for the message and for programmatic handling via\n  // `details.reason`. Caller `details` merge underneath — spread first\n  // so `graphId`/`reason` win and can't be clobbered by an\n  // accidentally-colliding extra key.\n  constructor(\n    graphId: string,\n    reason: StoreNotInitializedReason,\n    options?: {\n      cause?: unknown;\n      details?: Readonly<Record<string, unknown>> &\n        Readonly<{ graphId?: never; reason?: never }>;\n    },\n  ) {\n    super(\n      `${storageLabelFromLogicalName(options?.details?.[\"logicalName\"])} for ` +\n        `graph \"${graphId}\" ${STORE_NOT_INITIALIZED_REASON_PHRASE[reason]}. ` +\n        storeNotInitializedAction(reason, options?.details?.[\"logicalName\"]),\n      \"STORE_NOT_INITIALIZED\",\n      {\n        details: { ...options?.details, graphId, reason },\n        category: \"user\",\n        suggestion:\n          isStaleVectorSlot(reason, options?.details?.[\"logicalName\"]) ?\n            \"The field's declared shape (e.g. its dimension) changed after \" +\n            \"its storage was provisioned. Run store.reembedVectorField(\" +\n            \"kind, fieldPath) to recreate the storage at the new shape and \" +\n            \"re-embed.\"\n          : \"Call createStoreWithSchema(graph, backend) once at application \" +\n            \"startup. createStore() attaches to an already-initialized \" +\n            \"database and does not materialize storage itself.\",\n        cause: options?.cause,\n      },\n    );\n    this.name = \"StoreNotInitializedError\";\n  }\n}\n\nconst VECTOR_LOGICAL_NAME_PREFIX = \"vector:\";\n\n/**\n * A stale VECTOR slot is its own failure mode: the storage exists but was\n * provisioned at a different shape (the declared dimension changed), and\n * the fix is `store.reembedVectorField`, not a re-run of\n * `createStoreWithSchema` (whose boot pass deliberately skips drifted\n * slots). Drives the action sentence and the suggestion.\n */\nfunction isStaleVectorSlot(\n  reason: StoreNotInitializedReason,\n  logicalName: unknown,\n): boolean {\n  return (\n    reason === \"stale\" &&\n    typeof logicalName === \"string\" &&\n    logicalName.startsWith(VECTOR_LOGICAL_NAME_PREFIX)\n  );\n}\n\n/** The actionable trailing sentence of the error message, per failure mode. */\nfunction storeNotInitializedAction(\n  reason: StoreNotInitializedReason,\n  logicalName: unknown,\n): string {\n  if (isStaleVectorSlot(reason, logicalName)) {\n    return (\n      `The declared shape changed after provisioning — run ` +\n      `store.reembedVectorField(kind, fieldPath) to recreate the storage ` +\n      `at the new shape.`\n    );\n  }\n  return (\n    `Run createStoreWithSchema(graph, backend) during application boot, ` +\n    `outside request handlers and adopted transactions, before using createStore().`\n  );\n}\n\n/** Details for a runtime contribution whose durable marker outlived storage. */\nexport type ContributionUnavailableErrorDetails = Readonly<{\n  graphId: string;\n  logicalName: \"fulltext\";\n  physicalName: string;\n  state: \"physical-storage-missing\";\n}>;\n\n/**\n * Thrown when a gated fulltext operation discovers that materialized storage\n * disappeared after its durable marker recorded successful initialization.\n */\nexport class ContributionUnavailableError extends TypeGraphError {\n  declare readonly details: ContributionUnavailableErrorDetails;\n\n  constructor(\n    graphId: string,\n    physicalName: string,\n    options?: Readonly<{ cause?: unknown }>,\n  ) {\n    const suggestion =\n      'Run store.rebuildContribution(\"fulltext\") to recreate the lost ' +\n      \"storage and repopulate it from the graph's nodes.\";\n    super(\n      `Fulltext storage \"${physicalName}\" for graph \"${graphId}\" ` +\n        `disappeared after initialization. ${suggestion}`,\n      \"CONTRIBUTION_UNAVAILABLE\",\n      {\n        details: {\n          graphId,\n          logicalName: \"fulltext\",\n          physicalName,\n          state: \"physical-storage-missing\",\n        },\n        category: \"user\",\n        suggestion,\n        cause: options?.cause,\n      },\n    );\n    this.name = \"ContributionUnavailableError\";\n  }\n}\n\n/**\n * Human label for the un-materialized storage, derived from the\n * contribution `logicalName`: fulltext keeps \"fulltext storage\"; a vector\n * slot (\"vector:&lt;kind&gt;.&lt;field&gt;\") reads as `vector storage\n * \"&lt;kind&gt;.&lt;field&gt;\"` so the message names the exact embedding\n * field. Falls back to a neutral phrase when no logical name is supplied.\n */\nfunction storageLabelFromLogicalName(logicalName: unknown): string {\n  if (typeof logicalName !== \"string\") return \"runtime storage\";\n  if (logicalName.startsWith(VECTOR_LOGICAL_NAME_PREFIX)) {\n    return `vector storage \"${logicalName.slice(VECTOR_LOGICAL_NAME_PREFIX.length)}\"`;\n  }\n  if (logicalName === \"fulltext\") return \"fulltext storage\";\n  return `\"${logicalName}\" storage`;\n}\n\n// ============================================================\n// Database Errors (category: \"system\")\n// ============================================================\n\n/**\n * Details for DatabaseOperationError.\n */\nexport type DatabaseOperationErrorDetails = Readonly<{\n  operation: string;\n  entity: string;\n  /**\n   * `\"duplicate_key\"` means the engine refused the write because the entity's\n   * identity is already taken — the shape a concurrent create of the same new id\n   * produces on an engine that does not serialize the two writers. It is a\n   * *classified* driver failure, so callers that own a better error for the\n   * condition (the create paths, which report it as \"already exists\") translate\n   * it rather than surfacing it.\n   */\n  reason?: \"no_row_returned\" | \"duplicate_key\";\n  /**\n   * The entities the failed statement tried to insert, carried structurally so a\n   * translating caller never has to parse the driver's message for them. One\n   * element for a single insert; for a batch, every row in the failing chunk —\n   * the engine reports the collision without saying which row lost.\n   */\n  attempted?: readonly Readonly<{ kind: string; id: string }>[];\n}>;\n\n/**\n * Thrown when a database operation fails unexpectedly.\n *\n * This indicates a system-level failure in the database backend,\n * not a user-recoverable error.\n */\nexport class DatabaseOperationError extends TypeGraphError {\n  declare readonly details: DatabaseOperationErrorDetails;\n\n  constructor(\n    message: string,\n    details: DatabaseOperationErrorDetails,\n    options?: { cause?: unknown },\n  ) {\n    super(message, \"DATABASE_OPERATION_ERROR\", {\n      details,\n      category: \"system\",\n      suggestion: `This is a system-level database error. Check the database connection and retry the operation. If the problem persists, investigate the underlying cause.`,\n      cause: options?.cause,\n    });\n    this.name = \"DatabaseOperationError\";\n  }\n}\n\n// ============================================================\n// Vector / Embedding Errors (category: \"user\")\n// ============================================================\n\n/**\n * Details for EmbeddingDimensionChangedError.\n */\nexport type EmbeddingDimensionChangedErrorDetails = Readonly<{\n  kind: string;\n  fieldPath: string;\n  declaredDimensions?: number;\n  storedDimensions?: number;\n}>;\n\n/**\n * Thrown when an embedding field's declared dimension no longer matches the\n * dimension of its materialized per-field storage — i.e. a field's\n * `embedding(N)` was changed to `embedding(M)`. The stored vectors are invalid\n * under the new dimension and cannot be converted, only recomputed, so this is\n * a deliberate app-driven migration: call\n * `store.reembedVectorField(kind, fieldPath, ...)` to recreate the storage at\n * the new dimension and re-embed existing rows.\n */\nexport class EmbeddingDimensionChangedError extends TypeGraphError {\n  declare readonly details: EmbeddingDimensionChangedErrorDetails;\n\n  constructor(\n    message: string,\n    details: EmbeddingDimensionChangedErrorDetails,\n    options?: { cause?: unknown },\n  ) {\n    super(message, \"EMBEDDING_DIMENSION_CHANGED\", {\n      details,\n      category: \"user\",\n      suggestion: `Run store.reembedVectorField(\"${details.kind}\", \"${details.fieldPath}\", { embed }) to recreate the field's storage at the new dimension and re-embed existing rows.`,\n      cause: options?.cause,\n    });\n    this.name = \"EmbeddingDimensionChangedError\";\n  }\n}\n\n// ============================================================\n// Query Errors (category: \"system\")\n// ============================================================\n\n/**\n * Thrown when a query predicate cannot be compiled for the target database.\n */\nexport class UnsupportedPredicateError extends TypeGraphError {\n  constructor(\n    message: string,\n    details: Readonly<Record<string, unknown>> = {},\n    options?: { cause?: unknown; suggestion?: string },\n  ) {\n    super(message, \"UNSUPPORTED_PREDICATE\", {\n      details,\n      category: \"system\",\n      suggestion:\n        options?.suggestion ??\n        `This predicate may not be supported by your database backend. Check the documentation for supported predicates.`,\n      cause: options?.cause,\n    });\n    this.name = \"UnsupportedPredicateError\";\n  }\n}\n\n// ============================================================\n// Compiler Errors (category: \"system\")\n// ============================================================\n\n/**\n * Thrown when a compiler invariant is violated.\n *\n * This indicates a bug in the query compiler — the compiler reached\n * a state that should be unreachable. These errors are not user-recoverable.\n */\nexport class CompilerInvariantError extends TypeGraphError {\n  constructor(\n    message: string,\n    details?: Readonly<Record<string, unknown>>,\n    options?: { cause?: unknown },\n  ) {\n    super(message, \"COMPILER_INVARIANT_ERROR\", {\n      details: details ?? {},\n      category: \"system\",\n      suggestion: `This is an internal compiler error. Please report it as a bug with the query that triggered it.`,\n      cause: options?.cause,\n    });\n    this.name = \"CompilerInvariantError\";\n  }\n}\n\n// ============================================================\n// Lifecycle Errors (category: \"system\")\n// ============================================================\n\n/**\n * Thrown when an operation is attempted on a backend that has been disposed.\n *\n * This typically occurs during runtime teardown — for example, when a\n * Cloudflare Workers test runner resets Durable Object storage while\n * the TypeGraph backend still has queued operations.\n */\nexport class BackendDisposedError extends TypeGraphError {\n  constructor(options?: { cause?: unknown }) {\n    super(\n      \"Backend has been disposed — the underlying database connection is no longer available\",\n      \"BACKEND_DISPOSED\",\n      {\n        category: \"system\",\n        suggestion:\n          \"Ensure all store operations complete before calling backend.close(). \" +\n          \"In test environments, await store teardown before resetting the database.\",\n        cause: options?.cause,\n      },\n    );\n    this.name = \"BackendDisposedError\";\n  }\n}\n\n/**\n * Thrown when a statement is issued on a transaction-scoped backend after\n * its transaction boundary has already returned.\n *\n * The usual source is a callback that lets work escape it. `Promise.all`\n * rejects on its first rejection while its siblings keep running, so\n *\n * ```typescript\n * await store.transaction(async (tx) => {\n *   await Promise.all([tx.nodes.Doc.create(a), tx.nodes.Doc.create(b)]);\n * });\n * ```\n *\n * leaves `b`'s remaining statements in flight when `a` fails. Those\n * statements have nowhere safe to go: the driver is about to emit `ROLLBACK`\n * on the same pinned connection and then hand it back to the pool, where a\n * late arrival would execute inside somebody else's transaction. TypeGraph\n * refuses them here instead.\n *\n * The error is normally invisible — `Promise.all` has already rejected with\n * the original failure, and discards this one.\n */\nexport class TransactionClosedError extends TypeGraphError {\n  constructor(options?: { cause?: unknown }) {\n    super(\n      \"Statement issued on a transaction-scoped backend after its transaction \" +\n        \"boundary returned. The connection has been released; the statement was not run.\",\n      \"TRANSACTION_CLOSED\",\n      {\n        category: \"user\",\n        suggestion:\n          \"Await every write started inside store.transaction(...) before the \" +\n          \"callback returns. Prefer awaiting a Promise.allSettled(...) over a \" +\n          \"Promise.all(...) whose rejection would orphan its siblings.\",\n        cause: options?.cause,\n      },\n    );\n    this.name = \"TransactionClosedError\";\n  }\n}\n\n// ============================================================\n// Utility Functions\n// ============================================================\n\n/**\n * Type guard for TypeGraphError.\n *\n * @example\n * ```typescript\n * try {\n *   await store.nodes.Person.create({});\n * } catch (error) {\n *   if (isTypeGraphError(error)) {\n *     console.log(error.code, error.category);\n *   }\n * }\n * ```\n */\nexport function isTypeGraphError(error: unknown): error is TypeGraphError {\n  return error instanceof TypeGraphError;\n}\n\n/**\n * Check if error is recoverable by user action (user or constraint error).\n *\n * User-recoverable errors can typically be resolved by:\n * - Fixing invalid input data\n * - Using different IDs or values\n * - Deleting conflicting data first\n *\n * @example\n * ```typescript\n * if (isUserRecoverable(error)) {\n *   showErrorToUser(error.toUserMessage());\n * } else {\n *   logAndAlertOps(error);\n * }\n * ```\n */\nexport function isUserRecoverable(error: unknown): boolean {\n  if (!isTypeGraphError(error)) return false;\n  return error.category === \"user\" || error.category === \"constraint\";\n}\n\n/**\n * Check if error indicates a system/infrastructure issue.\n *\n * System errors typically require:\n * - Retry logic (for transient failures)\n * - Investigation (for persistent failures)\n * - Ops team notification\n */\nexport function isSystemError(error: unknown): boolean {\n  return isTypeGraphError(error) && error.category === \"system\";\n}\n\n/**\n * Check if error is a constraint violation.\n */\nexport function isConstraintError(error: unknown): boolean {\n  return isTypeGraphError(error) && error.category === \"constraint\";\n}\n\n/**\n * Extract suggestion from error if available.\n */\nexport function getErrorSuggestion(error: unknown): string | undefined {\n  return isTypeGraphError(error) ? error.suggestion : undefined;\n}\n"]}

package/dist/chunk-NACVVDWB.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/backend/table-names.ts","../src/backend/migrate-recorded-time.ts","../src/backend/repair-validity-windows.ts"],"names":["temporaryTables","finalTables","requireStatements"],"mappings":";;;;;;;;;;AAWA,SAAS,0BACP,QAAA,EACwB;AACxB,EAAA,IAAI,QAAA,KAAa,MAAA,EAAW,OAAO,EAAC;AACpC,EAAA,OAAO,MAAA,CAAO,WAAA;AAAA,IACZ,MAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,CAAE,MAAA,CAAO,CAAC,GAAG,SAAS,CAAA,KAAM,SAAA,KAAc,MAAS;AAAA,GAC5E;AACF;AAYO,SAAS,kBAAA,CACd,SACA,QAAA,EACuB;AACvB,EAAA,OAAO,eAAA,CAAgB;AAAA,IACrB,GAAG,OAAA,CAAQ,UAAA;AAAA,IACX,GAAG,0BAA0B,QAAQ;AAAA,GACtC,CAAA,CAAE,MAAA;AACL;;;ACXA,IAAM,mBAAA,GAAsB,0BAAA;AAC5B,IAAM,gBAAA,GAAmB,yBAAA;AAEzB,IAAM,qBAAA,GAAwB;AAAA,EAC5B,YAAA;AAAA,EACA,UAAA;AAAA,EACA,MAAA;AAAA,EACA,IAAA;AAAA,EACA,OAAA;AAAA,EACA,SAAA;AAAA,EACA,YAAA;AAAA,EACA,UAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,eAAA;AAAA,EACA,aAAA;AAAA,EACA,IAAA;AAAA,EACA,gBAAA;AAAA,EACA,OAAA;AAAA,EACA;AACF,CAAA;AAEA,IAAM,qBAAA,GAAwB;AAAA,EAC5B,YAAA;AAAA,EACA,UAAA;AAAA,EACA,IAAA;AAAA,EACA,MAAA;AAAA,EACA,WAAA;AAAA,EACA,SAAA;AAAA,EACA,SAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,YAAA;AAAA,EACA,UAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,eAAA;AAAA,EACA,aAAA;AAAA,EACA,IAAA;AAAA,EACA,gBAAA;AAAA,EACA,OAAA;AAAA,EACA;AACF,CAAA;AA4DA,SAAS,oBAAoB,KAAA,EAAuB;AAClD,EAAA,IAAI,KAAA,CAAM,MAAA,IAAU,EAAA,EAAI,OAAO,KAAA;AAC/B,EAAA,OAAO,CAAA,EAAG,MAAM,KAAA,CAAM,CAAA,EAAG,EAAE,CAAC,CAAA,CAAA,EAAI,SAAA,CAAU,KAAK,CAAC,CAAA,CAAA;AAClD;AAEA,SAAS,gBAAA,CACP,QACA,QAAA,EACQ;AACR,EAAA,MAAM,YAAY,QAAA,IAAY,CAAA,EAAG,MAAA,CAAO,aAAa,IAAI,gBAAgB,CAAA,CAAA;AACzE,EAAA,OAAO,eAAA,CAAgB;AAAA,IACrB,aAAA,EAAe,oBAAoB,SAAS;AAAA,GAC7C,EAAE,MAAA,CAAO,aAAA;AACZ;AAEA,SAAS,kBAAA,CAAmB,WAAmB,IAAA,EAAsB;AACnE,EAAA,OAAO,oBAAoB,CAAA,KAAA,EAAQ,IAAI,IAAI,SAAA,CAAU,SAAS,CAAC,CAAA,CAAE,CAAA;AACnE;AAEA,SAAS,kBACP,MAAA,EACqD;AACrD,EAAA,IAAI,MAAA,CAAO,qBAAqB,MAAA,EAAW;AACzC,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,4DAAA;AAAA,MACA,EAAE,OAAA,EAAS,MAAA,CAAO,OAAA,EAAQ;AAAA,MAC1B,EAAE,YAAY,8CAAA;AAA+C,KAC/D;AAAA,EACF;AACA,EAAA,OAAO,MAAA,CAAO,gBAAA;AAChB;AAEA,eAAe,gBAAA,CACb,QACA,SAAA,EACe;AACf,EAAA,MAAM,iBAAA,CAAkB,MAAM,CAAA,CAAE,sBAAA,CAAuB,SAAS,CAAC,CAAA;AACnE;AAEA,eAAe,UAAA,CACb,QACA,GAAA,EACe;AACf,EAAA,MAAM,gBAAA,CAAiB,MAAA,EAAQ,GAAA,CAAI,GAAA,CAAI,GAAG,CAAC,CAAA;AAC7C;AAEA,SAAS,uBAAuB,KAAA,EAAwB;AACtD,EAAA,MAAM,SAAA,GAAY,8BAA8B,KAAK,CAAA;AACrD,EAAA,IAAI,cAAc,MAAA,EAAW;AAC3B,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,+DAAA;AAAA,MACA,EAAE,KAAA;AAAM,KACV;AAAA,EACF;AACA,EAAA,OAAO,SAAA;AACT;AAEA,SAAS,aAAa,KAAA,EAAwB;AAC5C,EAAA,MAAM,WACJ,OAAO,KAAA,KAAU,QAAA,GAAW,MAAA,CAAO,KAAK,CAAA,GACtC,OAAO,KAAA,KAAU,QAAA,IAAY,QAAQ,IAAA,CAAK,KAAK,CAAA,GAAI,MAAA,CAAO,KAAK,CAAA,GAC/D,KAAA;AACJ,EAAA,IACE,OAAO,QAAA,KAAa,QAAA,IACpB,CAAC,MAAA,CAAO,aAAA,CAAc,QAAQ,CAAA,IAC9B,QAAA,GAAW,CAAA,IACX,QAAA,IAAY,qBAAA,EACZ;AACA,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,wDAAA;AAAA,MACA,EAAE,KAAA;AAAM,KACV;AAAA,EACF;AACA,EAAA,OAAO,QAAA;AACT;AAEA,eAAe,WAAA,CACb,QACA,SAAA,EAC8B;AAC9B,EAAA,MAAM,IAAA,GACJ,MAAA,CAAO,OAAA,KAAY,QAAA,GACjB,MAAM,MAAA,CAAO,OAAA;AAAA,IACX,kBAAkB,GAAA,CAAA,kBAAA,EAAwB,GAAA,CAAI,UAAA,CAAW,SAAS,CAAC,CAAA,CAAA,CAAG;AAAA,GACxE,GACA,MAAM,MAAA,CAAO,OAAA;AAAA,IACX,iBAAA,CAAkB,GAAA;AAAA;AAAA;AAAA;AAAA,6BAAA,EAIK,SAAS;AAAA,QAAA,CAC/B;AAAA,GACH;AACJ,EAAA,OAAO,IAAI,GAAA;AAAA,IACT,IAAA,CAAK,OAAA,CAAQ,CAAC,GAAA,KAAS,OAAO,GAAA,CAAI,IAAA,KAAS,QAAA,GAAW,CAAC,GAAA,CAAI,IAAI,CAAA,GAAI,EAAG;AAAA,GACxE;AACF;AAEA,eAAe,kBAAA,CACb,QACA,MAAA,EACgC;AAChC,EAAA,MAAM,IAAA,GAAO,MAAM,MAAA,CAAO,OAAA;AAAA,IACxB,iBAAA,CAAkB,GAAA;AAAA;AAAA,WAAA,EAET,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,aAAa,CAAC;AAAA;AAAA;AAAA,WAAA,EAGpC,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,aAAa,CAAC;AAAA,2BAAA,EACpB,mBAAmB;AAAA;AAAA;AAAA,WAAA,EAGnC,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,aAAa,CAAC;AAAA;AAAA;AAAA,WAAA,EAGpC,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,aAAa,CAAC;AAAA,2BAAA,EACpB,mBAAmB;AAAA;AAAA;AAAA,WAAA,EAGnC,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,aAAa,CAAC;AAAA,IAAA,CAC5C;AAAA,GACH;AACA,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ;AACjC,IAAA,IAAI,OAAO,GAAA,CAAI,QAAA,KAAa,QAAA,EAAU;AACpC,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,8DAAA;AAAA,QACA,EAAE,OAAA,EAAS,GAAA,CAAI,QAAA;AAAS,OAC1B;AAAA,IACF;AACA,IAAA,OAAO;AAAA,MACL,SAAS,GAAA,CAAI,QAAA;AAAA,MACb,UAAA,EAAY,sBAAA,CAAuB,GAAA,CAAI,WAAW;AAAA,KACpD;AAAA,EACF,CAAC,CAAA;AACD,EAAA,QAAA,CAAS,IAAA,CAAK,CAAC,IAAA,EAAM,KAAA,KAAU;AAC7B,IAAA,IAAI,IAAA,CAAK,OAAA,GAAU,KAAA,CAAM,OAAA,EAAS,OAAO,EAAA;AACzC,IAAA,IAAI,IAAA,CAAK,OAAA,GAAU,KAAA,CAAM,OAAA,EAAS,OAAO,CAAA;AACzC,IAAA,IAAI,IAAA,CAAK,UAAA,GAAa,KAAA,CAAM,UAAA,EAAY,OAAO,EAAA;AAC/C,IAAA,IAAI,IAAA,CAAK,UAAA,GAAa,KAAA,CAAM,UAAA,EAAY,OAAO,CAAA;AAC/C,IAAA,OAAO,CAAA;AAAA,EACT,CAAC,CAAA;AAED,EAAA,MAAM,UAAwB,EAAC;AAC/B,EAAA,IAAI,OAAA;AACJ,EAAA,IAAI,QAAA,GAAW,CAAA;AACf,EAAA,IAAI,eAAA;AACJ,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,IAAI,OAAA,CAAQ,YAAY,OAAA,EAAS;AAC/B,MAAA,OAAA,GAAU,OAAA,CAAQ,OAAA;AAClB,MAAA,QAAA,GAAW,CAAA;AACX,MAAA,eAAA,GAAkB,MAAA;AAAA,IACpB;AACA,IAAA,IAAI,OAAA,CAAQ,eAAe,eAAA,EAAiB;AAC5C,IAAA,QAAA,IAAY,CAAA;AACZ,IAAA,OAAA,CAAQ,IAAA,CAAK;AAAA,MACX,SAAS,OAAA,CAAQ,OAAA;AAAA,MACjB,kBAAkB,OAAA,CAAQ,UAAA;AAAA,MAC1B,YAAY,OAAA,CAAQ,UAAA;AAAA,MACpB;AAAA,KACD,CAAA;AACD,IAAA,eAAA,GAAkB,OAAA,CAAQ,UAAA;AAAA,EAC5B;AACA,EAAA,OAAO,OAAA;AACT;AAEA,SAAS,eAAA,CACP,SACA,KAAA,EACQ;AACR,EAAA,MAAM,YAAA,GAAe,OAAA,KAAY,UAAA,GAAa,QAAA,GAAW,SAAA;AACzD,EAAA,MAAM,cAAA,GAAiB,OAAA,KAAY,UAAA,GAAa,aAAA,GAAgB,MAAA;AAChE,EAAA,OAAO,+BAA+B,KAAK,CAAA;AAAA;AAAA;AAAA,WAAA,EAGhC,YAAY,CAAA;AAAA,cAAA,EACT,cAAc,CAAA;AAAA;AAAA,EAAA,CAAA;AAG9B;AAEA,eAAe,gBAAA,CACb,MAAA,EACA,SAAA,EACA,IAAA,EACe;AACf,EAAA,MAAM,iBAAiB,MAAA,EAAQ,GAAA,CAAA,YAAA,EAAkB,IAAI,UAAA,CAAW,SAAS,CAAC,CAAA,CAAE,CAAA;AAC5E,EAAA,MAAM,mBAAmB,IAAA,CAAK,GAAA;AAAA,IAC5B,CAAA;AAAA,IACA,KAAK,KAAA,CAAA,CAAO,MAAA,CAAO,YAAA,CAAa,iBAAA,IAAqB,OAAO,CAAC;AAAA,GAC/D;AACA,EAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,KAAA,GAAQ,IAAA,CAAK,MAAA,EAAQ,SAAS,gBAAA,EAAkB;AAClE,IAAA,MAAM,SAAS,IAAA,CACZ,KAAA,CAAM,KAAA,EAAO,KAAA,GAAQ,gBAAgB,CAAA,CACrC,GAAA;AAAA,MACC,CAAC,GAAA,KACC,GAAA,CAAA,CAAA,EAAO,GAAA,CAAI,OAAO,CAAA,EAAA,EAAK,GAAA,CAAI,gBAAgB,CAAA,EAAA,EAAK,GAAA,CAAI,QAAQ,CAAA,EAAA,EAAK,IAAI,UAAU,CAAA,CAAA;AAAA,KACnF;AACF,IAAA,MAAM,gBAAA;AAAA,MACJ,MAAA;AAAA,MACA,GAAA;AAAA,oBAAA,EACgB,GAAA,CAAI,UAAA,CAAW,SAAS,CAAC;AAAA;AAAA,eAAA,EAE9B,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,GAAA,CAAA,EAAA,CAAO,CAAC;AAAA,MAAA;AAAA,KAEtC;AAAA,EACF;AACF;AAEA,SAAS,QAAA,CACP,OAAA,EACA,MAAA,EACA,SAAA,EASC;AACD,EAAA,IAAI,YAAY,QAAA,EAAU;AACxB,IAAA,MAAMA,gBAAAA,GAAkB,mBAAmB,SAAS,CAAA;AACpD,IAAA,MAAMC,YAAAA,GAAc,mBAAmB,MAAM,CAAA;AAC7C,IAAA,MAAM,sBAAA,GAAyB,oBAAoBD,gBAAe,CAAA;AAClE,IAAA,MAAM,kBAAA,GAAqB,oBAAoBC,YAAW,CAAA;AAC1D,IAAA,OAAO,oBAAA,CAAqB,wBAAwB,kBAAkB,CAAA;AAAA,EACxE;AACA,EAAA,MAAM,eAAA,GAAkB,qBAAqB,SAAS,CAAA;AACtD,EAAA,MAAM,WAAA,GAAc,qBAAqB,MAAM,CAAA;AAC/C,EAAA,OAAO,oBAAA;AAAA,IACL,sBAAsB,eAAe,CAAA;AAAA,IACrC,sBAAsB,WAAW;AAAA,GACnC;AACF;AAEA,SAAS,oBAAA,CACP,WAIA,KAAA,EAQC;AACD,EAAA,SAAS,WACP,WAAA,EACmB;AACnB,IAAA,MAAM,eAAe,SAAA,CAAU,IAAA;AAAA,MAC7B,CAAC,KAAA,KAAU,KAAA,CAAM,WAAA,KAAgB;AAAA,KACnC,EAAG,SAAA;AACH,IAAA,MAAM,WAAW,KAAA,CAAM,IAAA;AAAA,MACrB,CAAC,KAAA,KAAU,KAAA,CAAM,WAAA,KAAgB;AAAA,KACnC,EAAG,SAAA;AACH,IAAA,IAAI,YAAA,KAAiB,MAAA,IAAa,QAAA,KAAa,MAAA,EAAW;AACxD,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,wCAAwC,WAAW,CAAA,CAAA;AAAA,OACrD;AAAA,IACF;AACA,IAAA,MAAM,WAAA,GAAc,aAAa,CAAC,CAAA;AAClC,IAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,8CAA8C,WAAW,CAAA,CAAA;AAAA,OAC3D;AAAA,IACF;AACA,IAAA,OAAO,CAAC,WAAA,EAAa,GAAG,QAAA,CAAS,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,EAC3C;AACA,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,WAAW,eAAe,CAAA;AAAA,IACjC,KAAA,EAAO,WAAW,eAAe,CAAA;AAAA,IACjC,KAAA,EAAO,WAAW,eAAe;AAAA,GACnC;AACF;AAEA,SAAS,cAAA,CAAe,QAAgB,WAAA,EAAkC;AACxE,EAAA,IAAI,MAAA,KAAW,iBAAiB,OAAO,GAAA,CAAA,iBAAA,CAAA;AACvC,EAAA,IAAI,WAAW,aAAA,EAAe;AAC5B,IAAA,OAAO,GAAA;AAAA;AAAA,iBAAA,EAEQ,GAAA,CAAI,GAAA,CAAI,WAAW,CAAC,kBAAkB,mBAAmB;AAAA,iBAAA,EACzD,qBAAqB;AAAA;AAAA;AAAA,IAAA,CAAA;AAAA,EAItC;AACA,EAAA,OAAO,GAAA,CAAA,EAAM,IAAI,GAAA,CAAI,WAAW,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,UAAA,CAAW,MAAM,CAAC,CAAA,CAAA;AAC7D;AAEA,SAAS,YAAA,CACP,OAAA,EACA,YAAA,EACA,YAAA,EACa;AACb,EAAA,MAAM,OAAA,GAAU,GAAA,CAAI,GAAA,CAAI,YAAY,CAAA;AACpC,EAAA,MAAM,MAAA,GAAS,GAAA,CAAI,GAAA,CAAI,CAAA,OAAA,EAAU,YAAY,CAAA,CAAE,CAAA;AAC/C,EAAA,OAAO,OAAA,KAAY,UAAA,GACf,GAAA,CAAA,EAAM,OAAO,CAAA,eAAA,EAAkB,MAAM,CAAA,CAAA,GACrC,GAAA,CAAA,EAAM,OAAO,CAAA,sBAAA,EAAyB,MAAM,CAAA,CAAA;AAClD;AAEA,SAAS,mBAAA,CAAoB,OAAgB,WAAA,EAA6B;AACxE,EAAA,MAAM,KAAA,GAAQ,OAAO,KAAK,CAAA;AAC1B,EAAA,IAAI,CAAC,MAAA,CAAO,aAAA,CAAc,KAAK,CAAA,IAAK,QAAQ,CAAA,EAAG;AAC7C,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,oEAAA;AAAA,MACA,EAAE,aAAa,KAAA;AAAM,KACvB;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAEA,eAAe,8BAAA,CACb,QACA,OAAA,EACe;AACf,EAAA,MAAM,SAAA,GAAY,YAAA,CAAa,MAAA,CAAO,OAAA,EAAS,YAAY,eAAe,CAAA;AAC1E,EAAA,MAAM,OAAA,GAAU,YAAA,CAAa,MAAA,CAAO,OAAA,EAAS,UAAU,aAAa,CAAA;AACpE,EAAA,MAAM,IAAA,GAAO,MAAM,MAAA,CAAO,OAAA;AAAA,IACxB,iBAAA,CAAkB,GAAA;AAAA;AAAA,WAAA,EAET,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,WAAW,CAAC,CAAA;AAAA,gBAAA,EAC9B,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,YAAY,CAAC,CAAA;AAAA,mDAAA,EACD,SAAS;AAAA,gBAAA,EAC5C,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,YAAY,CAAC,CAAA;AAAA,iDAAA,EACH,OAAO;AAAA;AAAA;AAAA,iCAAA,EAGvB,mBAAmB;AAAA;AAAA;AAAA,IAAA,CAGjD;AAAA,GACH;AACA,EAAA,MAAM,UAAU,mBAAA,CAAoB,IAAA,CAAK,CAAC,CAAA,EAAG,OAAA,EAAS,QAAQ,WAAW,CAAA;AACzE,EAAA,IAAI,YAAY,CAAA,EAAG;AACnB,EAAA,MAAM,IAAI,kBAAA;AAAA,IACR,8DAAA;AAAA,IACA,EAAE,WAAA,EAAa,OAAA,CAAQ,WAAA,EAAa,aAAa,OAAA,EAAQ;AAAA,IACzD;AAAA,MACE,UAAA,EACE;AAAA;AACJ,GACF;AACF;AAEA,eAAe,2BAAA,CACb,QACA,OAAA,EACe;AACf,EAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,MAAA,CAAO,OAAA,EAAS,cAAc,aAAa,CAAA;AACtE,EAAA,MAAM,IAAA,GAAO,MAAM,MAAA,CAAO,OAAA;AAAA,IACxB,iBAAA,CAAkB,GAAA;AAAA;AAAA,WAAA,EAET,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,WAAW,CAAC,CAAA;AAAA,gBAAA,EAC9B,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,YAAY,CAAC,CAAA;AAAA,qDAAA,EACC,KAAK;AAAA;AAAA,IAAA,CAEvD;AAAA,GACH;AACA,EAAA,MAAM,UAAU,mBAAA,CAAoB,IAAA,CAAK,CAAC,CAAA,EAAG,OAAA,EAAS,QAAQ,WAAW,CAAA;AACzE,EAAA,IAAI,YAAY,CAAA,EAAG;AACnB,EAAA,MAAM,IAAI,kBAAA;AAAA,IACR,2DAAA;AAAA,IACA,EAAE,WAAA,EAAa,OAAA,CAAQ,WAAA,EAAa,aAAa,OAAA,EAAQ;AAAA,IACzD;AAAA,MACE,UAAA,EACE;AAAA;AACJ,GACF;AACF;AAEA,eAAe,oBAAA,CACb,QACA,OAAA,EAMe;AACf,EAAA,MAAM,UAAA,GAAa,QAAQ,OAAA,CAAQ,GAAA,CAAI,CAAC,MAAA,KAAW,GAAA,CAAI,UAAA,CAAW,MAAM,CAAC,CAAA;AACzE,EAAA,MAAM,MAAA,GAAS,QAAQ,OAAA,CAAQ,GAAA;AAAA,IAAI,CAAC,MAAA,KAClC,cAAA,CAAe,MAAA,EAAQ,QAAQ;AAAA,GACjC;AACA,EAAA,MAAM,8BAAA,CAA+B,QAAQ,OAAO,CAAA;AACpD,EAAA,MAAM,SAAA,GAAY,YAAA,CAAa,MAAA,CAAO,OAAA,EAAS,YAAY,eAAe,CAAA;AAC1E,EAAA,MAAM,OAAA,GAAU,YAAA,CAAa,MAAA,CAAO,OAAA,EAAS,UAAU,aAAa,CAAA;AACpE,EAAA,MAAM,gBAAA;AAAA,IACJ,MAAA;AAAA,IACA,GAAA;AAAA,kBAAA,EACgB,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,cAAc,CAAC;AAAA,SAAA,EAC/C,GAAA,CAAI,IAAA,CAAK,UAAA,EAAY,GAAA,CAAA,EAAA,CAAO,CAAC,CAAA;AAAA,aAAA,EACzB,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,GAAA,CAAA,EAAA,CAAO,CAAC;AAAA,WAAA,EAC3B,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,WAAW,CAAC,CAAA;AAAA;AAAA;AAAA,gBAAA,EAG9B,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,YAAY,CAAC,CAAA;AAAA,mDAAA,EACD,SAAS;AAAA,gBAAA,EAC5C,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,YAAY,CAAC,CAAA;AAAA,iDAAA,EACH,OAAO;AAAA,IAAA;AAAA,GAExD;AACF;AAEA,eAAe,iBAAA,CACb,QACA,OAAA,EAKe;AACf,EAAA,MAAM,2BAAA,CAA4B,QAAQ,OAAO,CAAA;AACjD,EAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,MAAA,CAAO,OAAA,EAAS,cAAc,aAAa,CAAA;AACtE,EAAA,MAAM,gBAAA;AAAA,IACJ,MAAA;AAAA,IACA,GAAA;AAAA,kBAAA,EACgB,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,cAAc,CAAC;AAAA;AAAA;AAAA,WAAA,EAG7C,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,WAAW,CAAC,CAAA;AAAA;AAAA,gBAAA,EAE9B,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,YAAY,CAAC,CAAA;AAAA,qDAAA,EACC,KAAK;AAAA,IAAA;AAAA,GAE1D;AACF;AAEA,eAAe,mBAAA,CACb,MAAA,EACA,MAAA,EACA,YAAA,EACe;AACf,EAAA,MAAM,SAAA,GAAY;AAAA,IAChB,aAAA,EAAe,kBAAA,CAAmB,MAAA,CAAO,aAAA,EAAe,IAAI,CAAA;AAAA,IAC5D,aAAA,EAAe,kBAAA,CAAmB,MAAA,CAAO,aAAA,EAAe,IAAI,CAAA;AAAA,IAC5D,aAAA,EAAe,kBAAA,CAAmB,MAAA,CAAO,aAAA,EAAe,IAAI;AAAA,GAC9D;AACA,EAAA,MAAM,GAAA,GAAM,QAAA,CAAS,MAAA,CAAO,OAAA,EAAS,QAAQ,SAAS,CAAA;AACtD,EAAA,KAAA,MAAW,KAAA,IAAS,MAAA,CAAO,MAAA,CAAO,SAAS,CAAA,EAAG;AAC5C,IAAA,MAAM,gBAAA;AAAA,MACJ,MAAA;AAAA,MACA,GAAA,CAAA,qBAAA,EAA2B,GAAA,CAAI,UAAA,CAAW,KAAK,CAAC,CAAA;AAAA,KAClD;AAAA,EACF;AACA,EAAA,MAAM,UAAA,CAAW,MAAA,EAAQ,kBAAA,CAAmB,GAAA,CAAI,KAAK,CAAC,CAAA;AACtD,EAAA,MAAM,UAAA,CAAW,MAAA,EAAQ,kBAAA,CAAmB,GAAA,CAAI,KAAK,CAAC,CAAA;AACtD,EAAA,MAAM,UAAA,CAAW,MAAA,EAAQ,kBAAA,CAAmB,GAAA,CAAI,KAAK,CAAC,CAAA;AACtD,EAAA,MAAM,qBAAqB,MAAA,EAAQ;AAAA,IACjC,OAAA,EAAS,qBAAA;AAAA,IACT,aAAa,MAAA,CAAO,aAAA;AAAA,IACpB,YAAA;AAAA,IACA,gBAAgB,SAAA,CAAU;AAAA,GAC3B,CAAA;AACD,EAAA,MAAM,qBAAqB,MAAA,EAAQ;AAAA,IACjC,OAAA,EAAS,qBAAA;AAAA,IACT,aAAa,MAAA,CAAO,aAAA;AAAA,IACpB,YAAA;AAAA,IACA,gBAAgB,SAAA,CAAU;AAAA,GAC3B,CAAA;AACD,EAAA,MAAM,kBAAkB,MAAA,EAAQ;AAAA,IAC9B,aAAa,MAAA,CAAO,aAAA;AAAA,IACpB,YAAA;AAAA,IACA,gBAAgB,SAAA,CAAU;AAAA,GAC3B,CAAA;AAED,EAAA,MAAM,gBAAA;AAAA,IACJ,MAAA;AAAA,IACA,GAAA,CAAA,WAAA,EAAiB,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,aAAa,CAAC,CAAA;AAAA,GACvD;AACA,EAAA,MAAM,gBAAA;AAAA,IACJ,MAAA;AAAA,IACA,GAAA,CAAA,WAAA,EAAiB,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,aAAa,CAAC,CAAA;AAAA,GACvD;AACA,EAAA,MAAM,gBAAA;AAAA,IACJ,MAAA;AAAA,IACA,GAAA,CAAA,WAAA,EAAiB,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,aAAa,CAAC,CAAA;AAAA,GACvD;AACA,EAAA,MAAM,WAAA,CAAY,MAAA,EAAQ,SAAA,CAAU,aAAA,EAAe,OAAO,aAAa,CAAA;AACvE,EAAA,MAAM,WAAA,CAAY,MAAA,EAAQ,SAAA,CAAU,aAAA,EAAe,OAAO,aAAa,CAAA;AACvE,EAAA,MAAM,WAAA,CAAY,MAAA,EAAQ,SAAA,CAAU,aAAA,EAAe,OAAO,aAAa,CAAA;AACvE,EAAA,MAAM,0BAAA;AAAA,IACJ,MAAA;AAAA,IACA,SAAA,CAAU,aAAA;AAAA,IACV,MAAA,CAAO;AAAA,GACT;AACA,EAAA,MAAM,0BAAA;AAAA,IACJ,MAAA;AAAA,IACA,SAAA,CAAU,aAAA;AAAA,IACV,MAAA,CAAO;AAAA,GACT;AACA,EAAA,MAAM,0BAAA;AAAA,IACJ,MAAA;AAAA,IACA,SAAA,CAAU,aAAA;AAAA,IACV,MAAA,CAAO;AAAA,GACT;AACA,EAAA,KAAA,MAAW,SAAA,IAAa;AAAA,IACtB,GAAG,GAAA,CAAI,KAAA,CAAM,KAAA,CAAM,CAAC,CAAA;AAAA,IACpB,GAAG,GAAA,CAAI,KAAA,CAAM,KAAA,CAAM,CAAC,CAAA;AAAA,IACpB,GAAG,GAAA,CAAI,KAAA,CAAM,KAAA,CAAM,CAAC;AAAA,GACtB,EAAG;AACD,IAAA,MAAM,UAAA,CAAW,QAAQ,SAAS,CAAA;AAAA,EACpC;AACF;AAEA,eAAe,0BAAA,CACb,MAAA,EACA,cAAA,EACA,UAAA,EACe;AACf,EAAA,IAAI,MAAA,CAAO,YAAY,UAAA,EAAY;AACnC,EAAA,MAAM,gBAAA;AAAA,IACJ,MAAA;AAAA,IACA,GAAA;AAAA,kBAAA,EACgB,GAAA,CAAI,UAAA,CAAW,UAAU,CAAC;AAAA,wBAAA,EACpB,GAAA,CAAI,UAAA,CAAW,CAAA,EAAG,cAAc,OAAO,CAAC;AAAA,SAAA,EACvD,IAAI,UAAA,CAAW,mBAAA,CAAoB,GAAG,UAAU,CAAA,KAAA,CAAO,CAAC,CAAC;AAAA,IAAA;AAAA,GAElE;AACF;AAEA,SAAS,mBAAmB,UAAA,EAAuC;AACjE,EAAA,MAAM,SAAA,GAAY,WAAW,CAAC,CAAA;AAC9B,EAAA,IAAI,cAAc,MAAA,EAAW;AAC3B,IAAA,MAAM,IAAI,mBAAmB,yCAAyC,CAAA;AAAA,EACxE;AACA,EAAA,OAAO,SAAA;AACT;AAEA,eAAe,WAAA,CACb,MAAA,EACA,IAAA,EACA,EAAA,EACe;AACf,EAAA,IAAI;AACF,IAAA,MAAM,gBAAA;AAAA,MACJ,MAAA;AAAA,MACA,GAAA,CAAA,YAAA,EAAkB,IAAI,UAAA,CAAW,IAAI,CAAC,CAAA,WAAA,EAAc,GAAA,CAAI,UAAA,CAAW,EAAE,CAAC,CAAA;AAAA,KACxE;AAAA,EACF,SAAS,KAAA,EAAO;AACd,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,kDAAA;AAAA,MACA,EAAE,MAAM,EAAA,EAAG;AAAA,MACX,EAAE,OAAO,KAAA;AAAM,KACjB;AAAA,EACF;AACF;AAUA,eAAsB,0BACpB,OAAA,EAC0C;AAC1C,EAAA,MAAM,MAAA,GAAS,kBAAA,CAAmB,OAAA,CAAQ,OAAA,EAAS,QAAQ,UAAU,CAAA;AACrE,EAAA,MAAM,QAAA,GAAW,gBAAA,CAAiB,MAAA,EAAQ,OAAA,CAAQ,gBAAgB,CAAA;AAClE,EAAA,OAAO,OAAA,CAAQ,OAAA,CAAQ,WAAA,CAAY,OAAO,MAAA,KAAW;AACnD,IAAA,MAAM,YAAA,GAAe,MAAM,WAAA,CAAY,MAAA,EAAQ,OAAO,aAAa,CAAA;AACnE,IAAA,IAAI,YAAA,CAAa,SAAS,CAAA,EAAG;AAC3B,MAAA,OAAO;AAAA,QACL,QAAA,EAAU,KAAA;AAAA,QACV,MAAA,EAAQ,CAAA;AAAA,QACR,OAAA,EAAS,CAAA;AAAA,QACT,gBAAA,EAAkB;AAAA,OACpB;AAAA,IACF;AACA,IAAA,IAAI,YAAA,CAAa,GAAA,CAAI,UAAU,CAAA,EAAG;AAChC,MAAA,MAAM,UAAA,GAAa,MAAM,WAAA,CAAY,MAAA,EAAQ,QAAQ,CAAA;AACrD,MAAA,IAAI,UAAA,CAAW,SAAS,CAAA,EAAG;AACzB,QAAA,OAAO;AAAA,UACL,QAAA,EAAU,KAAA;AAAA,UACV,MAAA,EAAQ,CAAA;AAAA,UACR,OAAA,EAAS,CAAA;AAAA,UACT,gBAAA,EAAkB;AAAA,SACpB;AAAA,MACF;AACA,MAAA,MAAM,IAAA,GAAO,MAAM,MAAA,CAAO,OAAA;AAAA,QACxB,iBAAA,CAAkB,GAAA;AAAA;AAAA,eAAA,EAET,GAAA,CAAI,UAAA,CAAW,QAAQ,CAAC;AAAA,QAAA,CAChC;AAAA,OACH;AACA,MAAA,MAAM,UAAU,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,EAAG,WAAW,CAAC,CAAA;AAC5C,MAAA,MAAM,SAAS,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,EAAG,UAAU,CAAC,CAAA;AAC1C,MAAA,OAAO;AAAA,QACL,QAAA,EAAU,KAAA;AAAA,QACV,MAAA,EAAQ,MAAA,CAAO,aAAA,CAAc,MAAM,IAAI,MAAA,GAAS,CAAA;AAAA,QAChD,OAAA,EAAS,MAAA,CAAO,aAAA,CAAc,OAAO,IAAI,OAAA,GAAU,CAAA;AAAA,QACnD,gBAAA,EAAkB;AAAA,OACpB;AAAA,IACF;AACA,IAAA,MAAM,WAAA,GAAc,MAAM,WAAA,CAAY,MAAA,EAAQ,OAAO,aAAa,CAAA;AAClE,IAAA,MAAM,WAAA,GAAc,MAAM,WAAA,CAAY,MAAA,EAAQ,OAAO,aAAa,CAAA;AAClE,IAAA,IACE,CAAC,YAAY,GAAA,CAAI,eAAe,KAChC,CAAC,WAAA,CAAY,GAAA,CAAI,eAAe,CAAA,EAChC;AACA,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,4CAAA;AAAA,QACA,EAAE,MAAA;AAAO,OACX;AAAA,IACF;AAEA,IAAA,MAAM,WAAW,MAAA,EAAQ,eAAA,CAAgB,MAAA,CAAO,OAAA,EAAS,QAAQ,CAAC,CAAA;AAClE,IAAA,MAAM,OAAA,GAAU,MAAM,kBAAA,CAAmB,MAAA,EAAQ,MAAM,CAAA;AACvD,IAAA,MAAM,gBAAA,CAAiB,MAAA,EAAQ,QAAA,EAAU,OAAO,CAAA;AAChD,IAAA,MAAM,mBAAA,CAAoB,MAAA,EAAQ,MAAA,EAAQ,QAAQ,CAAA;AAClD,IAAA,OAAO;AAAA,MACL,QAAA,EAAU,IAAA;AAAA,MACV,MAAA,EAAQ,IAAI,GAAA,CAAI,OAAA,CAAQ,GAAA,CAAI,CAAC,GAAA,KAAQ,GAAA,CAAI,OAAO,CAAC,CAAA,CAAE,IAAA;AAAA,MACnD,SAAS,OAAA,CAAQ,MAAA;AAAA,MACjB,gBAAA,EAAkB;AAAA,KACpB;AAAA,EACF,CAAC,CAAA;AACH;AAGA,eAAsB,sBACpB,OAAA,EAC0B;AAC1B,EAAA,IAAI;AACF,IAAA,OAAO,iBAAA,CAAkB,QAAQ,MAAM,CAAA;AAAA,EACzC,SAAS,KAAA,EAAO;AACd,IAAA,IAAI,EAAE,KAAA,YAAiB,eAAA,CAAA,EAAkB,MAAM,KAAA;AAAA,EACjD;AACA,EAAA,MAAM,gBAAA,GAAmB,sBAAA,CAAuB,OAAA,CAAQ,MAAM,CAAA;AAC9D,EAAA,MAAM,MAAA,GAAS,kBAAA,CAAmB,OAAA,CAAQ,OAAA,EAAS,QAAQ,UAAU,CAAA;AACrE,EAAA,MAAM,QAAA,GAAW,gBAAA,CAAiB,MAAA,EAAQ,OAAA,CAAQ,gBAAgB,CAAA;AAClE,EAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,OAAA,CAAQ,OAAA;AAAA,IACjC,iBAAA,CAAkB,GAAA;AAAA;AAAA,WAAA,EAET,GAAA,CAAI,UAAA,CAAW,QAAQ,CAAC;AAAA,uBAAA,EACZ,QAAQ,OAAO;AAAA,iCAAA,EACL,gBAAgB;AAAA,IAAA,CAC9C;AAAA,GACH;AACA,EAAA,MAAM,GAAA,GAAM,KAAK,CAAC,CAAA;AAClB,EAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,sEAAA;AAAA,MACA,EAAE,MAAA,EAAQ,OAAA,CAAQ,MAAA,EAAQ,OAAA,EAAS,QAAQ,OAAA,EAAQ;AAAA,MACnD;AAAA,QACE,UAAA,EACE;AAAA;AACJ,KACF;AAAA,EACF;AACA,EAAA,OAAO,qBAAA;AAAA,IACL,YAAA,CAAa,IAAI,QAAQ,CAAA;AAAA,IACzB,sBAAA,CAAuB,IAAI,WAAW;AAAA,GACxC;AACF;AAMA,eAAsB,8BACpB,OAAA,EACe;AACf,EAAA,IAAI,OAAA,CAAQ,OAAA,CAAQ,gBAAA,KAAqB,MAAA,EAAW;AAClD,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,6EAAA;AAAA,MACA,EAAE,OAAA,EAAS,OAAA,CAAQ,OAAA,CAAQ,OAAA;AAAQ,KACrC;AAAA,EACF;AACA,EAAA,MAAM,MAAA,GAAS,kBAAA,CAAmB,OAAA,CAAQ,OAAA,EAAS,QAAQ,UAAU,CAAA;AACrE,EAAA,MAAM,QAAA,GAAW,gBAAA,CAAiB,MAAA,EAAQ,OAAA,CAAQ,gBAAgB,CAAA;AAClE,EAAA,MAAM,OAAA,CAAQ,OAAA,CAAQ,WAAA,CAAY,OAAO,MAAA,KAAW;AAClD,IAAA,MAAM,gBAAA;AAAA,MACJ,MAAA;AAAA,MACA,GAAA;AAAA,oBAAA,EACgB,GAAA,CAAI,UAAA,CAAW,QAAQ,CAAC;AAAA,yBAAA,EACnB,QAAQ,OAAO;AAAA,MAAA;AAAA,KAEtC;AACA,IAAA,IAAI,OAAA,CAAQ,kBAAkB,IAAA,EAAM;AACpC,IAAA,MAAM,IAAA,GAAO,MAAM,MAAA,CAAO,OAAA;AAAA,MACxB,iBAAA,CAAkB,GAAA;AAAA;AAAA,aAAA,EAET,GAAA,CAAI,UAAA,CAAW,QAAQ,CAAC;AAAA,MAAA,CAChC;AAAA,KACH;AACA,IAAA,MAAM,YAAY,mBAAA,CAAoB,IAAA,CAAK,CAAC,CAAA,EAAG,SAAS,QAAQ,CAAA;AAChE,IAAA,IAAI,cAAc,CAAA,EAAG;AACnB,MAAA,MAAM,gBAAA;AAAA,QACJ,MAAA;AAAA,QACA,GAAA,CAAA,WAAA,EAAiB,GAAA,CAAI,UAAA,CAAW,QAAQ,CAAC,CAAA;AAAA,OAC3C;AAAA,IACF;AAAA,EACF,CAAC,CAAA;AACH;;;AC/rBA,IAAM,cAAA,GAAiB;AAAA,EACrB,OAAA;AAAA,EACA;AACF,CAAA;AAEA,IAAM,kBAAA,GAAqB;AAAA,EACzB,eAAA;AAAA,EACA;AACF,CAAA;AAUA,IAAM,sBAAA,GACJ,8FAAA;AAMF,SAAS,gBACP,KAAA,EAC2B;AAC3B,EAAA,OAAO,UAAU,MAAA,GAAS,cAAA,GACtB,CAAC,GAAG,cAAA,EAAgB,GAAG,kBAAkB,CAAA;AAE/C;AAEA,SAAS,aAAA,CACP,QACA,QAAA,EACQ;AACR,EAAA,QAAQ,QAAA;AAAU,IAChB,KAAK,OAAA,EAAS;AACZ,MAAA,OAAO,MAAA,CAAO,KAAA;AAAA,IAChB;AAAA,IACA,KAAK,OAAA,EAAS;AACZ,MAAA,OAAO,MAAA,CAAO,KAAA;AAAA,IAChB;AAAA,IACA,KAAK,eAAA,EAAiB;AACpB,MAAA,OAAO,MAAA,CAAO,aAAA;AAAA,IAChB;AAAA,IACA,KAAK,eAAA,EAAiB;AACpB,MAAA,OAAO,MAAA,CAAO,aAAA;AAAA,IAChB;AAAA;AAEJ;AAEA,SAAS,kBACP,OAAA,EACwB;AACxB,EAAA,OAAO,YAAY,MAAA,GAAY,KAAK,CAAC,GAAA,CAAA,WAAA,EAAiB,OAAO,CAAA,CAAE,CAAA;AACjE;AAEA,SAAS,uBACP,OAAA,EACwB;AACxB,EAAA,IAAI,OAAA,KAAY,QAAA,EAAU,OAAO,EAAC;AAClC,EAAA,OAAO;AAAA,IACL,sBAAsB,sBAAsB,CAAA,CAAA;AAAA,IAC5C,oBAAoB,sBAAsB,CAAA;AAAA,GAC5C;AACF;AAYO,SAAS,gCACd,OAAA,EAIa;AACb,EAAA,OAAO,GAAA,CAAI,IAAA;AAAA,IACT;AAAA,MACE,GAAA,CAAA,sBAAA,CAAA;AAAA,MACA,GAAA,CAAA,oBAAA,CAAA;AAAA,MACA,GAAG,sBAAA,CAAuB,OAAA,CAAQ,OAAO,CAAA;AAAA,MACzC,GAAA,CAAA,qBAAA,CAAA;AAAA,MACA,GAAG,iBAAA,CAAkB,OAAA,CAAQ,OAAO;AAAA,KACtC;AAAA,IACA,GAAA,CAAA,KAAA;AAAA,GACF;AACF;AAOA,SAAS,4BAA4B,OAAA,EAA0C;AAC7E,EAAA,OAAO,GAAA,CAAI,IAAA;AAAA,IACT;AAAA,MACE,GAAA,CAAA,sBAAA,CAAA;AAAA,MACA,GAAA,CAAA,oBAAA,CAAA;AAAA,MACA,GAAA,CAAA,qBAAA,EAA2B,sBAAsB,CAAA,sBAAA,EAAyB,sBAAsB,CAAA,CAAA,CAAA;AAAA,MAChG,GAAG,kBAAkB,OAAO;AAAA,KAC9B;AAAA,IACA,GAAA,CAAA,KAAA;AAAA,GACF;AACF;AAEA,SAAS,SAAA,CAAU,OAAgB,KAAA,EAAuB;AACxD,EAAA,MAAM,KAAA,GAAQ,OAAO,KAAK,CAAA;AAC1B,EAAA,IAAI,CAAC,MAAA,CAAO,aAAA,CAAc,KAAK,CAAA,IAAK,QAAQ,CAAA,EAAG;AAC7C,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,uDAAA;AAAA,MACA,EAAE,OAAO,KAAA;AAAM,KACjB;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAEA,eAAe,aAAA,CACb,MAAA,EACA,KAAA,EACA,SAAA,EACiB;AACjB,EAAA,MAAM,IAAA,GAAO,MAAM,MAAA,CAAO,OAAA;AAAA,IACxB,iBAAA,CAAkB,GAAA;AAAA;AAAA,WAAA,EAET,GAAA,CAAI,UAAA,CAAW,KAAK,CAAC;AAAA,YAAA,EACpB,SAAS;AAAA,IAAA,CAClB;AAAA,GACH;AACA,EAAA,OAAO,SAAA,CAAU,IAAA,CAAK,CAAC,CAAA,EAAG,SAAS,KAAK,CAAA;AAC1C;AAOA,SAASC,mBACP,MAAA,EAC+C;AAC/C,EAAA,IAAI,MAAA,CAAO,qBAAqB,MAAA,EAAW;AACzC,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,wEAAA;AAAA,MACA,EAAE,OAAA,EAAS,MAAA,CAAO,OAAA,EAAS,MAAM,OAAA,EAAQ;AAAA,MACzC;AAAA,QACE,UAAA,EACE;AAAA;AACJ,KACF;AAAA,EACF;AACA,EAAA,OAAO,MAAA,CAAO,gBAAA;AAChB;AAYA,SAAS,yBAAyB,KAAA,EAAyB;AACzD,EAAA,IACE,EAAE,KAAA,YAAiB,kBAAA,CAAA,IACnB,MAAM,OAAA,CAAQ,MAAM,MAAM,mCAAA,EAC1B;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,OAAO,IAAI,kBAAA;AAAA,IACT,qFAAA;AAAA,IACA,EAAE,IAAA,EAAM,mCAAA,EAAqC,IAAA,EAAM,OAAA,EAAQ;AAAA,IAC3D;AAAA,MACE,KAAA,EAAO,KAAA;AAAA,MACP,UAAA,EACE;AAAA;AACJ,GACF;AACF;AAEA,eAAe,cAAA,CACb,MAAA,EACA,KAAA,EACA,SAAA,EACe;AACf,EAAA,IAAI;AACF,IAAA,MAAMA,mBAAkB,MAAM,CAAA;AAAA,MAC5B,sBAAA,CAAuB,GAAA;AAAA,eAAA,EACZ,GAAA,CAAI,UAAA,CAAW,KAAK,CAAC;AAAA;AAAA,cAAA,EAEtB,SAAS;AAAA,MAAA,CAClB;AAAA,KACH;AAAA,EACF,SAAS,KAAA,EAAO;AACd,IAAA,MAAM,yBAAyB,KAAK,CAAA;AAAA,EACtC;AACF;AAEA,SAAS,yBACP,YAAA,EACM;AACN,EAAA,MAAM,YAAA,GAAe,CAAC,GAAG,YAAY,CAAA,CAAE,MAAA,CAAO,CAAC,GAAG,KAAK,CAAA,KAAM,KAAA,GAAQ,CAAC,CAAA;AACtE,EAAA,IAAI,YAAA,CAAa,WAAW,CAAA,EAAG;AAC/B,EAAA,MAAM,IAAI,kBAAA;AAAA,IACR,oFAAA;AAAA,IACA,EAAE,YAAA,EAAc,MAAA,CAAO,WAAA,CAAY,YAAY,CAAA,EAAE;AAAA,IACjD;AAAA,MACE,UAAA,EACE;AAAA;AACJ,GACF;AACF;AAiBA,SAAS,sBACP,IAAA,EAC+C;AAC/C,EAAA,OAAO,IAAA,KAAS,WACZ,EAAE,WAAA,EAAa,EAAE,UAAA,EAAY,WAAA,IAAc,GAC3C,MAAA;AACN;AAEA,SAAS,eACP,MAAA,EACsD;AACtD,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,MAAA,CAAO,GAAA,CAAI,OAAO,CAAA;AAAA,IACzB,KAAA,EAAO,MAAA,CAAO,GAAA,CAAI,OAAO,CAAA;AAAA,IACzB,aAAA,EAAe,MAAA,CAAO,GAAA,CAAI,eAAe,CAAA;AAAA,IACzC,aAAA,EAAe,MAAA,CAAO,GAAA,CAAI,eAAe;AAAA,GAC3C;AACF;AAmCA,eAAsB,8BACpB,OAAA,EACsC;AACtC,EAAA,MAAM,MAAA,GAAS,kBAAA,CAAmB,OAAA,CAAQ,OAAA,EAAS,QAAQ,UAAU,CAAA;AACrE,EAAA,MAAM,SAAA,GAAY,eAAA,CAAgB,OAAA,CAAQ,SAAS,CAAA;AAGnD,EAAA,IAAI,QAAQ,IAAA,KAAS,OAAA,EAASA,kBAAAA,CAAkB,QAAQ,OAAO,CAAA;AAE/D,EAAA,OAAO,0BAAA;AAAA,IACL,OAAA,CAAQ,OAAA;AAAA,IACR,OAAO,QAAQ,SAAA,KAAc;AAC3B,MAAA,MAAM,YAAY,+BAAA,CAAgC;AAAA,QAChD,SAAS,MAAA,CAAO,OAAA;AAAA,QAChB,SAAS,OAAA,CAAQ;AAAA,OAClB,CAAA;AACD,MAAA,MAAM,QAAA,uBAAe,GAAA,EAA4B;AACjD,MAAA,MAAM,YAAA,uBAAmB,GAAA,EAA4B;AACrD,MAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,QAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,MAAA,EAAQ,QAAQ,CAAA;AAC5C,QAAA,YAAA,CAAa,GAAA;AAAA,UACX,QAAA;AAAA,UACA,MAAA,CAAO,OAAA,KAAY,QAAA,GACjB,MAAM,aAAA;AAAA,YACJ,MAAA;AAAA,YACA,KAAA;AAAA,YACA,2BAAA,CAA4B,QAAQ,OAAO;AAAA,WAC7C,GACA;AAAA,SACJ;AACA,QAAA,QAAA,CAAS,IAAI,QAAA,EAAU,MAAM,cAAc,MAAA,EAAQ,KAAA,EAAO,SAAS,CAAC,CAAA;AAAA,MACtE;AAEA,MAAA,IAAI,OAAA,CAAQ,SAAS,OAAA,EAAS;AAC5B,QAAA,wBAAA,CAAyB,YAAY,CAAA;AACrC,QAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,UAAA,MAAM,cAAA;AAAA,YACJ,MAAA;AAAA,YACA,aAAA,CAAc,QAAQ,QAAQ,CAAA;AAAA,YAC9B;AAAA,WACF;AAAA,QACF;AAAA,MACF;AAEA,MAAA,OAAO;AAAA,QACL,WAAW,OAAA,CAAQ,SAAA;AAAA,QACnB,MAAA,EAAQ,eAAe,QAAQ,CAAA;AAAA,QAC/B,YAAA,EAAc,eAAe,YAAY,CAAA;AAAA,QACzC,QAAQ,SAAA,CAAU;AAAA,OACpB;AAAA,IACF,CAAA;AAAA,IACA,qBAAA,CAAsB,QAAQ,IAAI;AAAA,GACpC;AACF","file":"chunk-NACVVDWB.js","sourcesContent":["/**\n * The one owner of \"which physical relations does this offline operation\n * touch?\" for the maintenance entrypoints that accept a `tableNames` override.\n */\nimport {\n  createSqlSchema,\n  type ResolvedSqlTableNames,\n  type SqlTableNames,\n} from \"../query/compiler/schema\";\nimport type { GraphBackend } from \"./types\";\n\nfunction definedTableNameOverrides(\n  override: Partial<SqlTableNames> | undefined,\n): Partial<SqlTableNames> {\n  if (override === undefined) return {};\n  return Object.fromEntries(\n    Object.entries(override).filter(([, tableName]) => tableName !== undefined),\n  );\n}\n\n/**\n * Resolves the relations an offline maintenance call targets.\n *\n * An override is a PATCH over the backend's own names. This matches the\n * `Partial<SqlTableNames>` input contract: naming only `nodes`, for example,\n * must not silently retarget edges and recorded relations to the built-in\n * defaults. `migrateLegacyRecordedTime` and\n * `repairInvertedValidityWindows` share this owner so an offline write can never\n * resolve the same partial override two different ways.\n */\nexport function resolvedTableNames(\n  backend: Pick<GraphBackend, \"tableNames\">,\n  override: Partial<SqlTableNames> | undefined,\n): ResolvedSqlTableNames {\n  return createSqlSchema({\n    ...backend.tableNames,\n    ...definedTableNameOverrides(override),\n  }).tables;\n}\n","/**\n * One-time offline migration from timestamp-only recorded relations to numeric\n * revisions. The durable remap table lets applications translate checkpoints\n * stored outside TypeGraph before deleting the migration metadata.\n */\nimport {\n  asRecordedInstant,\n  createRecordedInstant,\n  RECORDED_MAX_REVISION,\n  type RecordedInstant,\n} from \"../core/temporal\";\nimport { ConfigurationError, ValidationError } from \"../errors\";\nimport {\n  createSqlSchema,\n  type ResolvedSqlTableNames,\n  type SqlTableNames,\n} from \"../query/compiler/schema\";\nimport { shortHash } from \"../query/dialect/vector-strategy\";\nimport { sql, type SqlFragment } from \"../query/sql-fragment\";\nimport { asCompiledRowsSql, asCompiledStatementSql } from \"../query/sql-intent\";\nimport { canonicalizeDatabaseTimestamp } from \"../utils/date\";\nimport { postgresContributions, sqliteContributions } from \"./drizzle/ddl\";\nimport { createPostgresTables } from \"./drizzle/schema/postgres\";\nimport { createSqliteTables } from \"./drizzle/schema/sqlite\";\nimport { resolvedTableNames } from \"./table-names\";\nimport { type GraphBackend, type TransactionBackend } from \"./types\";\n\nconst LEGACY_RECORDED_MAX = \"9999-12-31T23:59:59.999Z\";\nconst MIGRATION_SUFFIX = \"legacy_recorded_anchors\";\n\nconst RECORDED_NODE_COLUMNS = [\n  \"history_id\",\n  \"graph_id\",\n  \"kind\",\n  \"id\",\n  \"props\",\n  \"version\",\n  \"valid_from\",\n  \"valid_to\",\n  \"created_at\",\n  \"updated_at\",\n  \"deleted_at\",\n  \"recorded_from\",\n  \"recorded_to\",\n  \"op\",\n  \"schema_version\",\n  \"tx_id\",\n  \"meta\",\n] as const;\n\nconst RECORDED_EDGE_COLUMNS = [\n  \"history_id\",\n  \"graph_id\",\n  \"id\",\n  \"kind\",\n  \"from_kind\",\n  \"from_id\",\n  \"to_kind\",\n  \"to_id\",\n  \"props\",\n  \"valid_from\",\n  \"valid_to\",\n  \"created_at\",\n  \"updated_at\",\n  \"deleted_at\",\n  \"recorded_from\",\n  \"recorded_to\",\n  \"op\",\n  \"schema_version\",\n  \"tx_id\",\n  \"meta\",\n] as const;\n\ntype LegacyInstantRow = Readonly<{\n  graph_id: unknown;\n  recorded_at: unknown;\n}>;\n\ntype MappingRow = Readonly<{\n  graphId: string;\n  legacyRecordedAt: string;\n  recordedAt: string;\n  revision: number;\n}>;\n\ntype RemapRow = Readonly<{ recorded_at: unknown; revision: unknown }>;\ntype MappingCountRow = Readonly<{ anchors: unknown; graphs: unknown }>;\ntype MissingMappingRow = Readonly<{ missing: unknown }>;\ntype ColumnRow = Readonly<{ name: unknown }>;\n\nexport type MigrateLegacyRecordedTimeOptions = Readonly<{\n  backend: GraphBackend;\n  /** Patch selected backend table names; unstated names remain configured. */\n  tableNames?: Partial<SqlTableNames> | undefined;\n  /** Override the durable legacy-anchor mapping table name. */\n  mappingTableName?: string | undefined;\n}>;\n\nexport type MigrateLegacyRecordedTimeResult = Readonly<{\n  /** `true` when timestamp columns were rewritten during this call. */\n  migrated: boolean;\n  /** Number of graphs represented in the legacy commit order. */\n  graphs: number;\n  /** Number of distinct legacy anchors available for remapping. */\n  anchors: number;\n  /** Physical table retaining the old-anchor → revision mapping. */\n  mappingTableName: string;\n}>;\n\nexport type MigrateRecordedAnchorOptions = Readonly<{\n  backend: Pick<GraphBackend, \"dialect\" | \"execute\" | \"tableNames\">;\n  graphId: string;\n  anchor: string;\n  /** Patch selected backend table names; unstated names remain configured. */\n  tableNames?: Partial<SqlTableNames> | undefined;\n  mappingTableName?: string | undefined;\n}>;\n\nexport type DeleteLegacyRecordedAnchorMapOptions = Readonly<{\n  backend: Pick<\n    GraphBackend,\n    \"dialect\" | \"execute\" | \"executeStatement\" | \"tableNames\" | \"transaction\"\n  >;\n  graphId: string;\n  /** Patch selected backend table names; unstated names remain configured. */\n  tableNames?: Partial<SqlTableNames> | undefined;\n  mappingTableName?: string | undefined;\n  /** Drop the mapping table when this deletion leaves it empty. */\n  dropWhenEmpty?: boolean | undefined;\n}>;\n\nfunction shortenedIdentifier(value: string): string {\n  if (value.length <= 63) return value;\n  return `${value.slice(0, 50)}_${shortHash(value)}`;\n}\n\nfunction mappingTableName(\n  tables: ResolvedSqlTableNames,\n  override: string | undefined,\n): string {\n  const candidate = override ?? `${tables.recordedClock}_${MIGRATION_SUFFIX}`;\n  return createSqlSchema({\n    recordedClock: shortenedIdentifier(candidate),\n  }).tables.recordedClock;\n}\n\nfunction temporaryTableName(tableName: string, role: string): string {\n  return shortenedIdentifier(`__tg_${role}_${shortHash(tableName)}`);\n}\n\nfunction requireStatements(\n  target: Pick<TransactionBackend, \"dialect\" | \"executeStatement\">,\n): NonNullable<TransactionBackend[\"executeStatement\"]> {\n  if (target.executeStatement === undefined) {\n    throw new ConfigurationError(\n      \"Recorded-time migration requires executeStatement support.\",\n      { dialect: target.dialect },\n      { suggestion: \"Use a built-in SQLite or PostgreSQL backend.\" },\n    );\n  }\n  return target.executeStatement;\n}\n\nasync function executeStatement(\n  target: Pick<TransactionBackend, \"dialect\" | \"executeStatement\">,\n  statement: SqlFragment,\n): Promise<void> {\n  await requireStatements(target)(asCompiledStatementSql(statement));\n}\n\nasync function executeDdl(\n  target: Pick<TransactionBackend, \"dialect\" | \"executeStatement\">,\n  ddl: string,\n): Promise<void> {\n  await executeStatement(target, sql.raw(ddl));\n}\n\nfunction canonicalLegacyInstant(value: unknown): string {\n  const canonical = canonicalizeDatabaseTimestamp(value);\n  if (canonical === undefined) {\n    throw new ConfigurationError(\n      \"Legacy recorded-time relation contained an invalid timestamp.\",\n      { value },\n    );\n  }\n  return canonical;\n}\n\nfunction safeRevision(value: unknown): number {\n  const revision =\n    typeof value === \"bigint\" ? Number(value)\n    : typeof value === \"string\" && /^\\d+$/.test(value) ? Number(value)\n    : value;\n  if (\n    typeof revision !== \"number\" ||\n    !Number.isSafeInteger(revision) ||\n    revision < 1 ||\n    revision >= RECORDED_MAX_REVISION\n  ) {\n    throw new ConfigurationError(\n      \"Recorded anchor mapping contained an invalid revision.\",\n      { value },\n    );\n  }\n  return revision;\n}\n\nasync function columnNames(\n  target: TransactionBackend,\n  tableName: string,\n): Promise<ReadonlySet<string>> {\n  const rows =\n    target.dialect === \"sqlite\" ?\n      await target.execute<ColumnRow>(\n        asCompiledRowsSql(sql`PRAGMA table_info(${sql.identifier(tableName)})`),\n      )\n    : await target.execute<ColumnRow>(\n        asCompiledRowsSql(sql`\n          SELECT column_name AS name\n          FROM information_schema.columns\n          WHERE table_schema = current_schema()\n            AND table_name = ${tableName}\n        `),\n      );\n  return new Set(\n    rows.flatMap((row) => (typeof row.name === \"string\" ? [row.name] : [])),\n  );\n}\n\nasync function readLegacyInstants(\n  target: TransactionBackend,\n  tables: ResolvedSqlTableNames,\n): Promise<readonly MappingRow[]> {\n  const rows = await target.execute<LegacyInstantRow>(\n    asCompiledRowsSql(sql`\n      SELECT graph_id, recorded_from AS recorded_at\n      FROM ${sql.identifier(tables.recordedNodes)}\n      UNION\n      SELECT graph_id, recorded_to AS recorded_at\n      FROM ${sql.identifier(tables.recordedNodes)}\n      WHERE recorded_to <> ${LEGACY_RECORDED_MAX}\n      UNION\n      SELECT graph_id, recorded_from AS recorded_at\n      FROM ${sql.identifier(tables.recordedEdges)}\n      UNION\n      SELECT graph_id, recorded_to AS recorded_at\n      FROM ${sql.identifier(tables.recordedEdges)}\n      WHERE recorded_to <> ${LEGACY_RECORDED_MAX}\n      UNION\n      SELECT graph_id, recorded_at\n      FROM ${sql.identifier(tables.recordedClock)}\n    `),\n  );\n  const instants = rows.map((row) => {\n    if (typeof row.graph_id !== \"string\") {\n      throw new ConfigurationError(\n        \"Legacy recorded-time relation contained an invalid graph id.\",\n        { graphId: row.graph_id },\n      );\n    }\n    return {\n      graphId: row.graph_id,\n      recordedAt: canonicalLegacyInstant(row.recorded_at),\n    };\n  });\n  instants.sort((left, right) => {\n    if (left.graphId < right.graphId) return -1;\n    if (left.graphId > right.graphId) return 1;\n    if (left.recordedAt < right.recordedAt) return -1;\n    if (left.recordedAt > right.recordedAt) return 1;\n    return 0;\n  });\n\n  const mapping: MappingRow[] = [];\n  let graphId: string | undefined;\n  let revision = 0;\n  let previousInstant: string | undefined;\n  for (const instant of instants) {\n    if (instant.graphId !== graphId) {\n      graphId = instant.graphId;\n      revision = 0;\n      previousInstant = undefined;\n    }\n    if (instant.recordedAt === previousInstant) continue;\n    revision += 1;\n    mapping.push({\n      graphId: instant.graphId,\n      legacyRecordedAt: instant.recordedAt,\n      recordedAt: instant.recordedAt,\n      revision,\n    });\n    previousInstant = instant.recordedAt;\n  }\n  return mapping;\n}\n\nfunction migrationMapDdl(\n  dialect: GraphBackend[\"dialect\"],\n  table: string,\n): string {\n  const revisionType = dialect === \"postgres\" ? \"BIGINT\" : \"INTEGER\";\n  const recordedAtType = dialect === \"postgres\" ? \"TIMESTAMPTZ\" : \"TEXT\";\n  return `CREATE TABLE IF NOT EXISTS \"${table}\" (\n  graph_id TEXT NOT NULL,\n  legacy_recorded_at TEXT NOT NULL,\n  revision ${revisionType} NOT NULL,\n  recorded_at ${recordedAtType} NOT NULL,\n  PRIMARY KEY (graph_id, legacy_recorded_at)\n);`;\n}\n\nasync function writeMappingRows(\n  target: TransactionBackend,\n  tableName: string,\n  rows: readonly MappingRow[],\n): Promise<void> {\n  await executeStatement(target, sql`DELETE FROM ${sql.identifier(tableName)}`);\n  const rowsPerStatement = Math.max(\n    1,\n    Math.floor((target.capabilities.maxBindParameters ?? 900) / 4),\n  );\n  for (let start = 0; start < rows.length; start += rowsPerStatement) {\n    const values = rows\n      .slice(start, start + rowsPerStatement)\n      .map(\n        (row) =>\n          sql`(${row.graphId}, ${row.legacyRecordedAt}, ${row.revision}, ${row.recordedAt})`,\n      );\n    await executeStatement(\n      target,\n      sql`\n        INSERT INTO ${sql.identifier(tableName)}\n          (graph_id, legacy_recorded_at, revision, recorded_at)\n        VALUES ${sql.join(values, sql`, `)}\n      `,\n    );\n  }\n}\n\nfunction tableDdl(\n  dialect: GraphBackend[\"dialect\"],\n  tables: ResolvedSqlTableNames,\n  temporary: Readonly<{\n    recordedClock: string;\n    recordedEdges: string;\n    recordedNodes: string;\n  }>,\n): Readonly<{\n  clock: readonly string[];\n  edges: readonly string[];\n  nodes: readonly string[];\n}> {\n  if (dialect === \"sqlite\") {\n    const temporaryTables = createSqliteTables(temporary);\n    const finalTables = createSqliteTables(tables);\n    const temporaryContributions = sqliteContributions(temporaryTables);\n    const finalContributions = sqliteContributions(finalTables);\n    return ddlForRecordedTables(temporaryContributions, finalContributions);\n  }\n  const temporaryTables = createPostgresTables(temporary);\n  const finalTables = createPostgresTables(tables);\n  return ddlForRecordedTables(\n    postgresContributions(temporaryTables),\n    postgresContributions(finalTables),\n  );\n}\n\nfunction ddlForRecordedTables(\n  temporary: readonly Readonly<{\n    createDdl: readonly string[];\n    logicalName: string;\n  }>[],\n  final: readonly Readonly<{\n    createDdl: readonly string[];\n    logicalName: string;\n  }>[],\n): Readonly<{\n  clock: readonly string[];\n  edges: readonly string[];\n  nodes: readonly string[];\n}> {\n  function statements(\n    logicalName: \"recordedClock\" | \"recordedEdges\" | \"recordedNodes\",\n  ): readonly string[] {\n    const temporaryDdl = temporary.find(\n      (entry) => entry.logicalName === logicalName,\n    )?.createDdl;\n    const finalDdl = final.find(\n      (entry) => entry.logicalName === logicalName,\n    )?.createDdl;\n    if (temporaryDdl === undefined || finalDdl === undefined) {\n      throw new ConfigurationError(\n        `Could not generate migration DDL for ${logicalName}.`,\n      );\n    }\n    const createTable = temporaryDdl[0];\n    if (createTable === undefined) {\n      throw new ConfigurationError(\n        `Could not generate migration table DDL for ${logicalName}.`,\n      );\n    }\n    return [createTable, ...finalDdl.slice(1)];\n  }\n  return {\n    clock: statements(\"recordedClock\"),\n    edges: statements(\"recordedEdges\"),\n    nodes: statements(\"recordedNodes\"),\n  };\n}\n\nfunction migratedColumn(column: string, legacyAlias: string): SqlFragment {\n  if (column === \"recorded_from\") return sql`from_map.revision`;\n  if (column === \"recorded_to\") {\n    return sql`\n      CASE\n            WHEN ${sql.raw(legacyAlias)}.recorded_to = ${LEGACY_RECORDED_MAX}\n            THEN ${RECORDED_MAX_REVISION}\n            ELSE to_map.revision\n          END\n    `;\n  }\n  return sql`${sql.raw(legacyAlias)}.${sql.identifier(column)}`;\n}\n\nfunction mappingMatch(\n  dialect: GraphBackend[\"dialect\"],\n  mappingAlias: \"anchor_map\" | \"from_map\" | \"to_map\",\n  legacyColumn: \"recorded_at\" | \"recorded_from\" | \"recorded_to\",\n): SqlFragment {\n  const mapping = sql.raw(mappingAlias);\n  const legacy = sql.raw(`legacy.${legacyColumn}`);\n  return dialect === \"postgres\" ?\n      sql`${mapping}.recorded_at = ${legacy}`\n    : sql`${mapping}.legacy_recorded_at = ${legacy}`;\n}\n\nfunction missingMappingCount(value: unknown, legacyTable: string): number {\n  const count = Number(value);\n  if (!Number.isSafeInteger(count) || count < 0) {\n    throw new ConfigurationError(\n      \"Recorded-time migration returned an invalid integrity-check count.\",\n      { legacyTable, value },\n    );\n  }\n  return count;\n}\n\nasync function assertRecordedRelationMappings(\n  target: TransactionBackend,\n  options: Readonly<{ legacyTable: string; mappingTable: string }>,\n): Promise<void> {\n  const fromMatch = mappingMatch(target.dialect, \"from_map\", \"recorded_from\");\n  const toMatch = mappingMatch(target.dialect, \"to_map\", \"recorded_to\");\n  const rows = await target.execute<MissingMappingRow>(\n    asCompiledRowsSql(sql`\n      SELECT COUNT(*) AS missing\n      FROM ${sql.identifier(options.legacyTable)} AS legacy\n      LEFT JOIN ${sql.identifier(options.mappingTable)} AS from_map\n        ON from_map.graph_id = legacy.graph_id AND ${fromMatch}\n      LEFT JOIN ${sql.identifier(options.mappingTable)} AS to_map\n        ON to_map.graph_id = legacy.graph_id AND ${toMatch}\n      WHERE from_map.revision IS NULL\n         OR (\n           legacy.recorded_to <> ${LEGACY_RECORDED_MAX}\n           AND to_map.revision IS NULL\n         )\n    `),\n  );\n  const missing = missingMappingCount(rows[0]?.missing, options.legacyTable);\n  if (missing === 0) return;\n  throw new ConfigurationError(\n    \"Legacy recorded-time boundaries could not be mapped exactly.\",\n    { legacyTable: options.legacyTable, missingRows: missing },\n    {\n      suggestion:\n        \"Ensure every legacy boundary is a valid millisecond-precision timestamp produced by the preview recorded clock before retrying the offline migration.\",\n    },\n  );\n}\n\nasync function assertRecordedClockMappings(\n  target: TransactionBackend,\n  options: Readonly<{ legacyTable: string; mappingTable: string }>,\n): Promise<void> {\n  const match = mappingMatch(target.dialect, \"anchor_map\", \"recorded_at\");\n  const rows = await target.execute<MissingMappingRow>(\n    asCompiledRowsSql(sql`\n      SELECT COUNT(*) AS missing\n      FROM ${sql.identifier(options.legacyTable)} AS legacy\n      LEFT JOIN ${sql.identifier(options.mappingTable)} AS anchor_map\n        ON anchor_map.graph_id = legacy.graph_id AND ${match}\n      WHERE anchor_map.revision IS NULL\n    `),\n  );\n  const missing = missingMappingCount(rows[0]?.missing, options.legacyTable);\n  if (missing === 0) return;\n  throw new ConfigurationError(\n    \"Legacy recorded clock values could not be mapped exactly.\",\n    { legacyTable: options.legacyTable, missingRows: missing },\n    {\n      suggestion:\n        \"Ensure every legacy clock value is a valid millisecond-precision timestamp produced by the preview recorded clock before retrying the offline migration.\",\n    },\n  );\n}\n\nasync function copyRecordedRelation(\n  target: TransactionBackend,\n  options: Readonly<{\n    columns: readonly string[];\n    legacyTable: string;\n    mappingTable: string;\n    temporaryTable: string;\n  }>,\n): Promise<void> {\n  const columnList = options.columns.map((column) => sql.identifier(column));\n  const values = options.columns.map((column) =>\n    migratedColumn(column, \"legacy\"),\n  );\n  await assertRecordedRelationMappings(target, options);\n  const fromMatch = mappingMatch(target.dialect, \"from_map\", \"recorded_from\");\n  const toMatch = mappingMatch(target.dialect, \"to_map\", \"recorded_to\");\n  await executeStatement(\n    target,\n    sql`\n      INSERT INTO ${sql.identifier(options.temporaryTable)}\n        (${sql.join(columnList, sql`, `)})\n      SELECT ${sql.join(values, sql`, `)}\n      FROM ${sql.identifier(options.legacyTable)} AS legacy\n      -- LEFT JOIN is deliberate: a missing mapping reaches the NOT NULL\n      -- revision columns and fails loud instead of silently dropping history.\n      LEFT JOIN ${sql.identifier(options.mappingTable)} AS from_map\n        ON from_map.graph_id = legacy.graph_id AND ${fromMatch}\n      LEFT JOIN ${sql.identifier(options.mappingTable)} AS to_map\n        ON to_map.graph_id = legacy.graph_id AND ${toMatch}\n    `,\n  );\n}\n\nasync function copyRecordedClock(\n  target: TransactionBackend,\n  options: Readonly<{\n    legacyTable: string;\n    mappingTable: string;\n    temporaryTable: string;\n  }>,\n): Promise<void> {\n  await assertRecordedClockMappings(target, options);\n  const match = mappingMatch(target.dialect, \"anchor_map\", \"recorded_at\");\n  await executeStatement(\n    target,\n    sql`\n      INSERT INTO ${sql.identifier(options.temporaryTable)}\n        (graph_id, revision, recorded_at)\n      SELECT legacy.graph_id, anchor_map.revision, legacy.recorded_at\n      FROM ${sql.identifier(options.legacyTable)} AS legacy\n      -- Preserve fail-loud behavior if the preflight invariant changes later.\n      LEFT JOIN ${sql.identifier(options.mappingTable)} AS anchor_map\n        ON anchor_map.graph_id = legacy.graph_id AND ${match}\n    `,\n  );\n}\n\nasync function replaceLegacyTables(\n  target: TransactionBackend,\n  tables: ResolvedSqlTableNames,\n  mappingTable: string,\n): Promise<void> {\n  const temporary = {\n    recordedNodes: temporaryTableName(tables.recordedNodes, \"rn\"),\n    recordedEdges: temporaryTableName(tables.recordedEdges, \"re\"),\n    recordedClock: temporaryTableName(tables.recordedClock, \"rc\"),\n  };\n  const ddl = tableDdl(target.dialect, tables, temporary);\n  for (const table of Object.values(temporary)) {\n    await executeStatement(\n      target,\n      sql`DROP TABLE IF EXISTS ${sql.identifier(table)}`,\n    );\n  }\n  await executeDdl(target, requireCreateTable(ddl.nodes));\n  await executeDdl(target, requireCreateTable(ddl.edges));\n  await executeDdl(target, requireCreateTable(ddl.clock));\n  await copyRecordedRelation(target, {\n    columns: RECORDED_NODE_COLUMNS,\n    legacyTable: tables.recordedNodes,\n    mappingTable,\n    temporaryTable: temporary.recordedNodes,\n  });\n  await copyRecordedRelation(target, {\n    columns: RECORDED_EDGE_COLUMNS,\n    legacyTable: tables.recordedEdges,\n    mappingTable,\n    temporaryTable: temporary.recordedEdges,\n  });\n  await copyRecordedClock(target, {\n    legacyTable: tables.recordedClock,\n    mappingTable,\n    temporaryTable: temporary.recordedClock,\n  });\n\n  await executeStatement(\n    target,\n    sql`DROP TABLE ${sql.identifier(tables.recordedNodes)}`,\n  );\n  await executeStatement(\n    target,\n    sql`DROP TABLE ${sql.identifier(tables.recordedEdges)}`,\n  );\n  await executeStatement(\n    target,\n    sql`DROP TABLE ${sql.identifier(tables.recordedClock)}`,\n  );\n  await renameTable(target, temporary.recordedNodes, tables.recordedNodes);\n  await renameTable(target, temporary.recordedEdges, tables.recordedEdges);\n  await renameTable(target, temporary.recordedClock, tables.recordedClock);\n  await renamePrimaryKeyConstraint(\n    target,\n    temporary.recordedNodes,\n    tables.recordedNodes,\n  );\n  await renamePrimaryKeyConstraint(\n    target,\n    temporary.recordedEdges,\n    tables.recordedEdges,\n  );\n  await renamePrimaryKeyConstraint(\n    target,\n    temporary.recordedClock,\n    tables.recordedClock,\n  );\n  for (const statement of [\n    ...ddl.nodes.slice(1),\n    ...ddl.edges.slice(1),\n    ...ddl.clock.slice(1),\n  ]) {\n    await executeDdl(target, statement);\n  }\n}\n\nasync function renamePrimaryKeyConstraint(\n  target: TransactionBackend,\n  temporaryTable: string,\n  finalTable: string,\n): Promise<void> {\n  if (target.dialect !== \"postgres\") return;\n  await executeStatement(\n    target,\n    sql`\n      ALTER TABLE ${sql.identifier(finalTable)}\n      RENAME CONSTRAINT ${sql.identifier(`${temporaryTable}_pkey`)}\n      TO ${sql.identifier(shortenedIdentifier(`${finalTable}_pkey`))}\n    `,\n  );\n}\n\nfunction requireCreateTable(statements: readonly string[]): string {\n  const statement = statements[0];\n  if (statement === undefined) {\n    throw new ConfigurationError(\"Recorded migration table DDL was empty.\");\n  }\n  return statement;\n}\n\nasync function renameTable(\n  target: TransactionBackend,\n  from: string,\n  to: string,\n): Promise<void> {\n  try {\n    await executeStatement(\n      target,\n      sql`ALTER TABLE ${sql.identifier(from)} RENAME TO ${sql.identifier(to)}`,\n    );\n  } catch (error) {\n    throw new ConfigurationError(\n      \"Could not rename a migrated recorded-time table.\",\n      { from, to },\n      { cause: error },\n    );\n  }\n}\n\n/**\n * Rewrites timestamp-only recorded relations to numeric revisions.\n *\n * Run offline before opening a Store with the new schema. The durable mapping\n * table is retained so external checkpoint stores can call\n * {@link migrateRecordedAnchor}; delete each graph's rows after its downstream\n * checkpoints have been rewritten.\n */\nexport async function migrateLegacyRecordedTime(\n  options: MigrateLegacyRecordedTimeOptions,\n): Promise<MigrateLegacyRecordedTimeResult> {\n  const tables = resolvedTableNames(options.backend, options.tableNames);\n  const mapTable = mappingTableName(tables, options.mappingTableName);\n  return options.backend.transaction(async (target) => {\n    const clockColumns = await columnNames(target, tables.recordedClock);\n    if (clockColumns.size === 0) {\n      return {\n        migrated: false,\n        graphs: 0,\n        anchors: 0,\n        mappingTableName: mapTable,\n      };\n    }\n    if (clockColumns.has(\"revision\")) {\n      const mapColumns = await columnNames(target, mapTable);\n      if (mapColumns.size === 0) {\n        return {\n          migrated: false,\n          graphs: 0,\n          anchors: 0,\n          mappingTableName: mapTable,\n        };\n      }\n      const rows = await target.execute<MappingCountRow>(\n        asCompiledRowsSql(sql`\n          SELECT COUNT(*) AS anchors, COUNT(DISTINCT graph_id) AS graphs\n          FROM ${sql.identifier(mapTable)}\n        `),\n      );\n      const anchors = Number(rows[0]?.anchors ?? 0);\n      const graphs = Number(rows[0]?.graphs ?? 0);\n      return {\n        migrated: false,\n        graphs: Number.isSafeInteger(graphs) ? graphs : 0,\n        anchors: Number.isSafeInteger(anchors) ? anchors : 0,\n        mappingTableName: mapTable,\n      };\n    }\n    const nodeColumns = await columnNames(target, tables.recordedNodes);\n    const edgeColumns = await columnNames(target, tables.recordedEdges);\n    if (\n      !nodeColumns.has(\"recorded_from\") ||\n      !edgeColumns.has(\"recorded_from\")\n    ) {\n      throw new ConfigurationError(\n        \"Legacy recorded-time schema is incomplete.\",\n        { tables },\n      );\n    }\n\n    await executeDdl(target, migrationMapDdl(target.dialect, mapTable));\n    const mapping = await readLegacyInstants(target, tables);\n    await writeMappingRows(target, mapTable, mapping);\n    await replaceLegacyTables(target, tables, mapTable);\n    return {\n      migrated: true,\n      graphs: new Set(mapping.map((row) => row.graphId)).size,\n      anchors: mapping.length,\n      mappingTableName: mapTable,\n    };\n  });\n}\n\n/** Remaps one timestamp-only checkpoint after {@link migrateLegacyRecordedTime}. */\nexport async function migrateRecordedAnchor(\n  options: MigrateRecordedAnchorOptions,\n): Promise<RecordedInstant> {\n  try {\n    return asRecordedInstant(options.anchor);\n  } catch (error) {\n    if (!(error instanceof ValidationError)) throw error;\n  }\n  const legacyRecordedAt = canonicalLegacyInstant(options.anchor);\n  const tables = resolvedTableNames(options.backend, options.tableNames);\n  const mapTable = mappingTableName(tables, options.mappingTableName);\n  const rows = await options.backend.execute<RemapRow>(\n    asCompiledRowsSql(sql`\n      SELECT revision, recorded_at\n      FROM ${sql.identifier(mapTable)}\n      WHERE graph_id = ${options.graphId}\n        AND legacy_recorded_at = ${legacyRecordedAt}\n    `),\n  );\n  const row = rows[0];\n  if (row === undefined) {\n    throw new ConfigurationError(\n      \"No migrated recorded anchor matches this graph and legacy timestamp.\",\n      { anchor: options.anchor, graphId: options.graphId },\n      {\n        suggestion:\n          \"Run migrateLegacyRecordedTime() before deleting its mapping rows, and pass the graph that produced the checkpoint.\",\n      },\n    );\n  }\n  return createRecordedInstant(\n    safeRevision(row.revision),\n    canonicalLegacyInstant(row.recorded_at),\n  );\n}\n\n/**\n * Deletes one graph's legacy remap rows after downstream checkpoints migrate.\n * Set `dropWhenEmpty` to remove the migration table after the final graph.\n */\nexport async function deleteLegacyRecordedAnchorMap(\n  options: DeleteLegacyRecordedAnchorMapOptions,\n): Promise<void> {\n  if (options.backend.executeStatement === undefined) {\n    throw new ConfigurationError(\n      \"Deleting a recorded anchor migration map requires executeStatement support.\",\n      { dialect: options.backend.dialect },\n    );\n  }\n  const tables = resolvedTableNames(options.backend, options.tableNames);\n  const mapTable = mappingTableName(tables, options.mappingTableName);\n  await options.backend.transaction(async (target) => {\n    await executeStatement(\n      target,\n      sql`\n        DELETE FROM ${sql.identifier(mapTable)}\n        WHERE graph_id = ${options.graphId}\n      `,\n    );\n    if (options.dropWhenEmpty !== true) return;\n    const rows = await target.execute<MappingCountRow>(\n      asCompiledRowsSql(sql`\n        SELECT COUNT(*) AS anchors, COUNT(DISTINCT graph_id) AS graphs\n        FROM ${sql.identifier(mapTable)}\n      `),\n    );\n    const remaining = missingMappingCount(rows[0]?.anchors, mapTable);\n    if (remaining === 0) {\n      await executeStatement(\n        target,\n        sql`DROP TABLE ${sql.identifier(mapTable)}`,\n      );\n    }\n  });\n}\n","/**\n * Offline repair for validity windows that older library versions stored\n * inverted (`valid_from > valid_to`).\n *\n * Such a row is readable at no coordinate at all: `asOf(t)` needs\n * `valid_from <= t < valid_to`, and no `t` satisfies both when the bounds are\n * backwards. The library no longer mints them — a write that stamps a lower\n * bound the caller did not state stores no bound rather than an inverting one —\n * but deploying that fix rewrites nothing, so rows written by an older version\n * (or by direct SQL) stay invisible until an operator repairs them.\n *\n * The repair normalizes those rows to \"ended at T, start unknown\"\n * (`valid_from = NULL`), which is the shape the current write paths store. It\n * deliberately does **not** bump `version`, touch `updated_at`, or mint a\n * recorded revision: it normalizes a storage convention for rows that were\n * never observable at any coordinate, so it is not a logical write — and\n * minting a revision would make the pre-repair recorded state re-materialize\n * the inverted shape at `asOfRecorded` coordinates.\n *\n * Operator consequences, all of them stated in the docs as well:\n *\n * 1. **Run `\"apply\"` with writers stopped.** A concurrent window-bearing update\n *    may fence its write on the validity lower bound it read, so a repair that\n *    lands in between can make the peer's first `UPDATE` match no row. Store\n *    node/edge updates re-read and re-judge against the repaired bound; an\n *    interchange update records a per-row target-changed error instead of\n *    claiming the row was written. `\"report\"` needs no quiescing — it scans in\n *    a read-only transaction, so it cannot write.\n * 2. **Repaired rows become visible** at `asOf` coordinates before their end.\n *    That is the point, and it is a read-visibility change to historical\n *    queries.\n * 3. **Outstanding `base@V` merge tokens are invalidated** for repaired rows —\n *    `valid_from` is part of the base content fingerprint. Quiesce merges,\n *    repair, then re-baseline branches.\n * 4. **Prefer `relations: \"live-and-recorded\"`.** Repairing only the live axis\n *    leaves the recorded twin carrying the inverted window, which\n *    re-materializes the invisible row at any `asOfRecorded` coordinate.\n */\nimport { ConfigurationError } from \"../errors\";\nimport type {\n  ResolvedSqlTableNames,\n  SqlTableNames,\n} from \"../query/compiler/schema\";\nimport { sql, type SqlFragment } from \"../query/sql-fragment\";\nimport { asCompiledRowsSql, asCompiledStatementSql } from \"../query/sql-intent\";\nimport { resolvedTableNames } from \"./table-names\";\nimport {\n  type GraphBackend,\n  runOptionallyInTransaction,\n  type RunOptionallyInTransactionOptions,\n  type TransactionBackend,\n} from \"./types\";\n\n/** A relation whose rows carry a validity window this repair can normalize. */\nexport type RepairRelation =\n  \"nodes\" | \"edges\" | \"recordedNodes\" | \"recordedEdges\";\n\n/**\n * Which relations one call scans.\n *\n * `\"live-and-recorded\"` is the recommended scope. `\"live\"` is correct in\n * exactly two cases: the store captures no history and the `recorded_*` tables\n * do not exist, or the operator is deliberately preserving the recorded axis as\n * an audit record of what was stored before the repair — and accepts that\n * historical `asOfRecorded` reads keep returning the invisible shape.\n */\nexport type RepairRelationScope = \"live\" | \"live-and-recorded\";\n\n/** Inputs for detecting or repairing legacy inverted validity windows. */\nexport type RepairInvertedWindowsOptions = Readonly<{\n  backend: GraphBackend;\n  /** Omit to sweep every graph in the database. */\n  graphId?: string | undefined;\n  /** Required: the scope is a decision, not a default. */\n  relations: RepairRelationScope;\n  /**\n   * `\"report\"` counts and writes nothing; `\"apply\"` counts and then normalizes\n   * the rows it counted.\n   */\n  mode: \"report\" | \"apply\";\n  /**\n   * Patch selected backend table names, exactly as migrate-recorded-time does.\n   * Unstated names continue to come from `backend.tableNames`; see\n   * {@link resolvedTableNames}.\n   */\n  tableNames?: Partial<SqlTableNames> | undefined;\n}>;\n\n/** Counts and execution guarantees observed by one repair/report call. */\nexport type RepairInvertedWindowsReport = Readonly<{\n  /** Echoes the scope actually scanned — a count of 0 and \"not scanned\" are different facts. */\n  relations: RepairRelationScope;\n  /**\n   * Rows whose stored window is inverted: found in `\"report\"` mode, repaired in\n   * `\"apply\"` mode. `undefined` means NOT SCANNED, never \"clean\".\n   */\n  counts: Readonly<Record<RepairRelation, number | undefined>>;\n  /**\n   * Rows whose stored bounds are not canonical ISO and were therefore not\n   * classified. SQLite only in substance: on PostgreSQL the columns are\n   * `timestamptz`, so a scanned relation always reports `0` (never `undefined`\n   * — that value is reserved for \"not scanned\", on both dialects).\n   *\n   * `\"apply\"` refuses while any scanned relation reports a non-zero count:\n   * classifying those rows needs a timestamp semantics this repair does not\n   * own, and skipping them silently would be an accepted option ignored.\n   */\n  nonCanonical: Readonly<Record<RepairRelation, number | undefined>>;\n  /**\n   * Whether every statement of this call ran in ONE transaction. `false` on a\n   * backend that reports `capabilities.transactions === false`, where the call\n   * degrades to per-relation statements.\n   *\n   * Reported by the seam, not inferred from backend object identity:\n   * {@link runOptionallyInTransaction} explicitly tells its callback whether it\n   * opened a transaction. \"One snapshot\" and \"four snapshots\" are different\n   * facts about a report, and the report must state which occurred even when a\n   * custom backend passes the same object into its transaction callback.\n   *\n   * When `false`, a `\"report\"`'s counts may come from different snapshots and a\n   * crash mid-`\"apply\"` can leave the live axis repaired and the recorded axis\n   * not. Both are survivable the same way: each relation's statement is\n   * idempotent and convergent, so a re-run finishes the job and a later\n   * `\"report\"` proves it.\n   */\n  atomic: boolean;\n}>;\n\nconst LIVE_RELATIONS = [\n  \"nodes\",\n  \"edges\",\n] as const satisfies readonly RepairRelation[];\n\nconst RECORDED_RELATIONS = [\n  \"recordedNodes\",\n  \"recordedEdges\",\n] as const satisfies readonly RepairRelation[];\n\n/**\n * Canonical fixed-width UTC ISO 8601, as a SQLite `GLOB` pattern.\n *\n * SQLite stores the bounds as `TEXT` and compares them lexicographically, which\n * equals chronological order only for canonical values. This repair exists to\n * clean up rows written by older paths and by direct SQL, so it cannot assume\n * canonicality — it establishes it per row instead.\n */\nconst CANONICAL_INSTANT_GLOB =\n  \"[0-9][0-9][0-9][0-9]-[0-9][0-9]-[0-9][0-9]T[0-9][0-9]:[0-9][0-9]:[0-9][0-9].[0-9][0-9][0-9]Z\";\n\ntype RepairTarget = GraphBackend | TransactionBackend;\n\ntype CountRow = Readonly<{ matches: unknown }>;\n\nfunction scopedRelations(\n  scope: RepairRelationScope,\n): readonly RepairRelation[] {\n  return scope === \"live\" ? LIVE_RELATIONS : (\n      [...LIVE_RELATIONS, ...RECORDED_RELATIONS]\n    );\n}\n\nfunction relationTable(\n  tables: ResolvedSqlTableNames,\n  relation: RepairRelation,\n): string {\n  switch (relation) {\n    case \"nodes\": {\n      return tables.nodes;\n    }\n    case \"edges\": {\n      return tables.edges;\n    }\n    case \"recordedNodes\": {\n      return tables.recordedNodes;\n    }\n    case \"recordedEdges\": {\n      return tables.recordedEdges;\n    }\n  }\n}\n\nfunction graphScopeClauses(\n  graphId: string | undefined,\n): readonly SqlFragment[] {\n  return graphId === undefined ? [] : [sql`graph_id = ${graphId}`];\n}\n\nfunction canonicalBoundsClauses(\n  dialect: GraphBackend[\"dialect\"],\n): readonly SqlFragment[] {\n  if (dialect !== \"sqlite\") return [];\n  return [\n    sql`valid_from GLOB ${CANONICAL_INSTANT_GLOB}`,\n    sql`valid_to GLOB ${CANONICAL_INSTANT_GLOB}`,\n  ];\n}\n\n/**\n * The one spelling of \"this stored window is inverted\".\n *\n * Both modes compile it: `\"report\"` into `SELECT COUNT(*) … WHERE <this>` and\n * `\"apply\"` into `UPDATE … SET valid_from = NULL WHERE <this>`, so the count\n * and the repair cannot disagree about which rows are in scope.\n *\n * The comparison is strict (`>`). A stored zero-width window is a legal shape a\n * caller may have stated in full, and this repair does not second-guess it.\n */\nexport function invertedValidityWindowPredicate(\n  options: Readonly<{\n    dialect: GraphBackend[\"dialect\"];\n    graphId?: string | undefined;\n  }>,\n): SqlFragment {\n  return sql.join(\n    [\n      sql`valid_from IS NOT NULL`,\n      sql`valid_to IS NOT NULL`,\n      ...canonicalBoundsClauses(options.dialect),\n      sql`valid_from > valid_to`,\n      ...graphScopeClauses(options.graphId),\n    ],\n    sql` AND `,\n  );\n}\n\n/**\n * Rows carrying both bounds where either one is not canonical, and which the\n * inverted predicate therefore refuses to classify. SQLite only: PostgreSQL\n * stores `timestamptz`, where every stored value compares chronologically.\n */\nfunction nonCanonicalWindowPredicate(graphId: string | undefined): SqlFragment {\n  return sql.join(\n    [\n      sql`valid_from IS NOT NULL`,\n      sql`valid_to IS NOT NULL`,\n      sql`(valid_from NOT GLOB ${CANONICAL_INSTANT_GLOB} OR valid_to NOT GLOB ${CANONICAL_INSTANT_GLOB})`,\n      ...graphScopeClauses(graphId),\n    ],\n    sql` AND `,\n  );\n}\n\nfunction safeCount(value: unknown, table: string): number {\n  const count = Number(value);\n  if (!Number.isSafeInteger(count) || count < 0) {\n    throw new ConfigurationError(\n      \"Validity-window repair returned an invalid row count.\",\n      { table, value },\n    );\n  }\n  return count;\n}\n\nasync function countMatching(\n  target: RepairTarget,\n  table: string,\n  predicate: SqlFragment,\n): Promise<number> {\n  const rows = await target.execute<CountRow>(\n    asCompiledRowsSql(sql`\n      SELECT COUNT(*) AS matches\n      FROM ${sql.identifier(table)}\n      WHERE ${predicate}\n    `),\n  );\n  return safeCount(rows[0]?.matches, table);\n}\n\n/**\n * `\"apply\"` writes, so it needs the optional non-row-returning statement path.\n * `\"report\"` deliberately does not: `execute` is a required member, so\n * detection stays available on every backend even where repair is not.\n */\nfunction requireStatements(\n  target: Pick<RepairTarget, \"dialect\" | \"executeStatement\">,\n): NonNullable<RepairTarget[\"executeStatement\"]> {\n  if (target.executeStatement === undefined) {\n    throw new ConfigurationError(\n      \"Repairing inverted validity windows requires executeStatement support.\",\n      { dialect: target.dialect, mode: \"apply\" },\n      {\n        suggestion:\n          'Use a built-in SQLite or PostgreSQL backend to apply the repair. Detection needs no such support: call this with mode: \"report\" to count the affected rows on any backend.',\n      },\n    );\n  }\n  return target.executeStatement;\n}\n\n/**\n * Translates the recorded-capture wrapper's refusal instead of swallowing it.\n *\n * A history-enabled store replaces `executeStatement` with a rejecting stub, so\n * `\"apply\"` against that backend fails with a message about raw SQL rather than\n * about this repair. The remedy is specific enough to be worth naming: hand the\n * repair the raw backend the history store was constructed from. Bypassing\n * capture is the intended behavior here, not a workaround — the repair mints no\n * revision by design.\n */\nfunction translatedCaptureRefusal(error: unknown): unknown {\n  if (\n    !(error instanceof ConfigurationError) ||\n    error.details[\"code\"] !== \"RECORDED_CAPTURE_RAW_SQL_DISABLED\"\n  ) {\n    return error;\n  }\n  return new ConfigurationError(\n    \"Repairing inverted validity windows cannot run against a history-capturing backend.\",\n    { code: \"RECORDED_CAPTURE_RAW_SQL_DISABLED\", mode: \"apply\" },\n    {\n      cause: error,\n      suggestion:\n        'Pass the raw backend you constructed the history store from. The repair deliberately mints no revision — it normalizes storage for rows that were never visible at any coordinate — so bypassing recorded-time capture is the intended behavior, not a workaround. mode: \"report\" needs no such care: it runs against the capture-wrapped backend.',\n    },\n  );\n}\n\nasync function repairRelation(\n  target: RepairTarget,\n  table: string,\n  predicate: SqlFragment,\n): Promise<void> {\n  try {\n    await requireStatements(target)(\n      asCompiledStatementSql(sql`\n        UPDATE ${sql.identifier(table)}\n        SET valid_from = NULL\n        WHERE ${predicate}\n      `),\n    );\n  } catch (error) {\n    throw translatedCaptureRefusal(error);\n  }\n}\n\nfunction assertClassifiableBounds(\n  nonCanonical: ReadonlyMap<RepairRelation, number>,\n): void {\n  const unclassified = [...nonCanonical].filter(([, count]) => count > 0);\n  if (unclassified.length === 0) return;\n  throw new ConfigurationError(\n    \"Refusing to repair validity windows: some scanned rows store non-canonical bounds.\",\n    { nonCanonical: Object.fromEntries(unclassified) },\n    {\n      suggestion:\n        'Normalize those bounds to canonical UTC ISO 8601 (YYYY-MM-DDTHH:MM:SS.mmmZ) and re-run, or narrow the call with graphId. Classifying them here would need a timestamp semantics this repair does not own, and skipping them silently would report a repair it did not make. mode: \"report\" still counts them.',\n    },\n  );\n}\n\n/**\n * Declares `\"report\"`'s read-only-ness to the ENGINE rather than only to the\n * reader of this file.\n *\n * The docs send an operator to diagnose against the live store's backend and\n * require quiescing only for `\"apply\"`, so the scan must not behave like a\n * writer: on SQLite a default transaction is `BEGIN IMMEDIATE`, which reserves\n * the single writer slot for the duration of up to four full-table `COUNT(*)`\n * scans and can fail `SQLITE_BUSY` against an active writer; `read_only` issues\n * a plain `BEGIN` instead. On PostgreSQL it issues `BEGIN … READ ONLY`, which\n * makes \"report writes nothing\" enforced by the engine and not merely asserted\n * by a test.\n *\n * `\"apply\"` writes, so it takes the default read-write transaction.\n */\nfunction transactionOptionsFor(\n  mode: RepairInvertedWindowsOptions[\"mode\"],\n): RunOptionallyInTransactionOptions | undefined {\n  return mode === \"report\" ?\n      { transaction: { accessMode: \"read_only\" } }\n    : undefined;\n}\n\nfunction relationRecord(\n  counts: ReadonlyMap<RepairRelation, number>,\n): Readonly<Record<RepairRelation, number | undefined>> {\n  return {\n    nodes: counts.get(\"nodes\"),\n    edges: counts.get(\"edges\"),\n    recordedNodes: counts.get(\"recordedNodes\"),\n    recordedEdges: counts.get(\"recordedEdges\"),\n  };\n}\n\n/**\n * Counts — and, in `\"apply\"` mode, normalizes — rows whose stored validity\n * window is inverted.\n *\n * ```typescript\n * // Diagnose with the store's backend: `report` reads only, so it runs\n * // anywhere, including a capture-wrapped or statement-less backend.\n * const report = await repairInvertedValidityWindows({\n *   backend: anyBackend,\n *   relations: \"live-and-recorded\",\n *   mode: \"report\",\n * });\n *\n * // Repair with the raw one, while writers are stopped.\n * await repairInvertedValidityWindows({\n *   backend: rawBackend,\n *   relations: \"live-and-recorded\",\n *   mode: \"apply\",\n * });\n * ```\n *\n * Idempotent and convergent: a second `\"apply\"` reports zero, because the rows\n * the first one repaired no longer match the predicate.\n *\n * No batching, deliberately. Unlike the recorded-time migration, which rewrites\n * every row, this statement touches only rows the library mis-stored — an empty\n * set on a healthy graph. A deployment that reports a count large enough to\n * worry about should run it per `graphId`.\n *\n * @throws ConfigurationError in `\"apply\"` mode when the backend cannot execute\n *   statements, when the backend is a recorded-capture wrapper, or when any\n *   scanned relation stores non-canonical bounds.\n */\nexport async function repairInvertedValidityWindows(\n  options: RepairInvertedWindowsOptions,\n): Promise<RepairInvertedWindowsReport> {\n  const tables = resolvedTableNames(options.backend, options.tableNames);\n  const relations = scopedRelations(options.relations);\n  // Refuse before opening a transaction: a backend with no statement path can\n  // never apply, whatever the scan finds.\n  if (options.mode === \"apply\") requireStatements(options.backend);\n\n  return runOptionallyInTransaction(\n    options.backend,\n    async (target, execution) => {\n      const predicate = invertedValidityWindowPredicate({\n        dialect: target.dialect,\n        graphId: options.graphId,\n      });\n      const inverted = new Map<RepairRelation, number>();\n      const nonCanonical = new Map<RepairRelation, number>();\n      for (const relation of relations) {\n        const table = relationTable(tables, relation);\n        nonCanonical.set(\n          relation,\n          target.dialect === \"sqlite\" ?\n            await countMatching(\n              target,\n              table,\n              nonCanonicalWindowPredicate(options.graphId),\n            )\n          : 0,\n        );\n        inverted.set(relation, await countMatching(target, table, predicate));\n      }\n\n      if (options.mode === \"apply\") {\n        assertClassifiableBounds(nonCanonical);\n        for (const relation of relations) {\n          await repairRelation(\n            target,\n            relationTable(tables, relation),\n            predicate,\n          );\n        }\n      }\n\n      return {\n        relations: options.relations,\n        counts: relationRecord(inverted),\n        nonCanonical: relationRecord(nonCanonical),\n        atomic: execution.atomic,\n      };\n    },\n    transactionOptionsFor(options.mode),\n  );\n}\n"]}