@simpleapps-com/augur-hooks 2026.11.3 → 2026.11.4

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -1 +0,0 @@
1
- {"version":3,"sources":["/Users/stuartjackson/Projects/simpleapps/atlas/repo/packages/augur-hooks/dist/chunk-BWBJPKLV.cjs","../src/stores/cart-store.ts","../../foundation/src/duration.ts","../../utils/src/strings.ts","../../utils/src/lists.ts","../src/rules.ts","../src/hooks/use-checkout-persistence.ts","../src/hooks/use-payment-flow.ts","../src/hooks/use-order-readiness.ts","../src/hooks/use-latest.ts"],"names":["toMillis","useRef","useEffect","setupId","useState"],"mappings":"AAAA;ACAA,kCAAuB;AACvB,gDAAyB;ADEzB;AACA;AEwBO,SAAS,OAAA,CAAQ,CAAA,EAAoB;AAK1C,EAAA,OAAO,CAAA;AACT;AA2DO,SAAS,QAAA,CAAS,CAAA,EAAoB;AAI3C,EAAA,OAAQ,EAAA,EAAI,GAAA;AACd;AFvFA;AACA;AGkBO,SAAS,MAAA,CAAO,CAAA,EAAW,CAAA,EAAmB;AAInD,EAAA,OAAO,EAAA,GAAK,EAAA,GAAK,EAAA,EAAI,CAAA,CAAE,OAAA,EAAS,CAAA,CAAE,UAAA,CAAW,CAAC,EAAA,EAAI,CAAA,CAAA;AACpD;AA6NO,SAAS,WAAA,CAAY,CAAA,EAAW,IAAA,EAAc,IAAA,EAAsB;AASzE,EAAA,MAAM,EAAA,EAAI,MAAA,CAAO,CAAA,EAAG,IAAI,CAAA;AACxB,EAAA,GAAA,CAAI,EAAA,IAAM,IAAA,EAAM,OAAO,IAAA;AACvB,EAAA,GAAA,CAAI,EAAA,IAAM,CAAA,CAAA,EAAI,OAAO,CAAA,CAAA;AACrB,EAAA,OAAO,WAAA,CAAY,CAAA,EAAG,IAAA,EAAM,KAAA,EAAO,CAAC,CAAA;AACtC;AHvPA;AACA;AIXO,SAAS,QAAA,CAAS,EAAA,EAAc,GAAA,EAAa,CAAA,EAAmB;AAQrE,EAAA,GAAA,CAAI,EAAA,GAAK,EAAA,CAAG,MAAA,EAAQ,OAAO,EAAA;AAC3B,EAAA,OAAO,SAAA,CAAU,EAAA,EAAI,GAAA,EAAK,CAAA,EAAG,EAAA,CAAG,MAAM,CAAA;AACxC;AAQA,SAAS,SAAA,CAAU,EAAA,EAAc,GAAA,EAAa,EAAA,EAAY,EAAA,EAAoB;AAO5E,EAAA,GAAA,CAAI,GAAA,EAAK,GAAA,IAAO,CAAA,EAAG,OAAO,EAAA,CAAG,EAAE,CAAA;AAC/B,EAAA,MAAM,IAAA,EAAM,GAAA,EAAK,IAAA,CAAK,KAAA,CAAA,CAAO,GAAA,EAAK,EAAA,EAAA,EAAM,CAAC,CAAA;AACzC,EAAA,OAAO,SAAA,CAAU,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,GAAG,EAAA,EAAI,IAAA,EAAM,SAAA,CAAU,EAAA,EAAI,GAAA,EAAK,GAAA,EAAK,EAAE,CAAA;AACvE;AA2DO,SAAS,aAAA,CAAc,EAAA,EAAc,CAAA,EAAW,CAAA,EAAoB;AAMzE,EAAA,GAAA,CAAI,EAAA,IAAM,EAAA,CAAG,MAAA,EAAQ,OAAO,KAAA;AAC5B,EAAA,GAAA,CAAK,EAAA,CAAG,CAAC,EAAA,IAAiB,CAAA,EAAG,OAAO,IAAA;AACpC,EAAA,OAAO,aAAA,CAAc,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,CAAC,CAAA;AACnC;AJtEA;AACA;AKtBO,SAAS,iBAAA,CAAkB,UAAA,EAAsB,CAAA,EAAW,GAAA,EAAqB;AAOtF,EAAA,GAAA,CAAI,EAAA,IAAM,UAAA,CAAW,MAAA,EAAQ,OAAO,GAAA;AACpC,EAAA,OAAO,iBAAA,CAAkB,UAAA,EAAY,EAAA,EAAI,CAAA,EAAG,IAAA,EAAO,UAAA,CAAW,CAAC,CAAY,CAAA;AAC7E;AAOO,SAAS,SAAA,CAAU,CAAA,EAA0B;AAIlD,EAAA,GAAA,CAAI,EAAA,IAAM,IAAA,EAAM,OAAO,CAAA;AACvB,EAAA,OAAO,CAAA;AACT;AAOO,SAAS,cAAA,CAAe,IAAA,EAAgB,GAAA,EAAa,CAAA,EAAmB;AAQ7E,EAAA,GAAA,CAAI,EAAA,IAAM,IAAA,CAAK,MAAA,EAAQ,OAAO,CAAA,CAAA;AAC9B,EAAA,GAAA,CAAK,IAAA,CAAK,CAAC,EAAA,IAAiB,GAAA,EAAK,OAAO,CAAA;AACxC,EAAA,OAAO,cAAA,CAAe,IAAA,EAAM,GAAA,EAAK,EAAA,EAAI,CAAC,CAAA;AACxC;AAOO,SAAS,iBAAA,CAAkB,OAAA,EAAwB,CAAA,EAAoB;AAG5E,EAAA,OAAO,SAAA,CAAU,OAAO,EAAA,EAAI,EAAA,EAAI,CAAA;AAClC;AAOO,SAAS,eAAA,CAAgB,GAAA,EAAwC;AAKtE,EAAA,GAAA,CAAI,IAAA,IAAQ,KAAA,CAAA,EAAW,OAAO,IAAA;AAC9B,EAAA,GAAA,CAAI,IAAA,IAAQ,CAAA,EAAG,OAAO,IAAA;AACtB,EAAA,OAAO,GAAA;AACT;AAOO,SAAS,eAAA,CAAgB,GAAA,EAAiC;AAI/D,EAAA,GAAA,CAAI,IAAA,IAAQ,KAAA,CAAA,EAAW,OAAO,CAAA;AAC9B,EAAA,OAAO,GAAA;AACT;AAQO,SAAS,sBAAA,CACd,QAAA,EACA,YAAA,EACQ;AAKR,EAAA,GAAA,CAAI,SAAA,IAAa,KAAA,EAAA,GAAa,SAAA,IAAa,EAAA,EAAI,OAAO,QAAA;AACtD,EAAA,OAAO,aAAA,EAAe,cAAA,EAAgB,SAAA;AACxC;AA4BO,SAAS,YAAA,CAAa,CAAA,EAA4B;AAGvD,EAAA,OAAO,WAAA,CAAY,CAAC,EAAA,GAAK,eAAA,CAAgB,CAAC,EAAA,GAAK,cAAA,CAAe,CAAC,CAAA;AACjE;AAOA,SAAS,WAAA,CAAY,CAAA,EAA4B;AAG/C,EAAA,OACE,CAAC,CAAA,CAAE,iBAAA,GACH,CAAC,CAAA,CAAE,oBAAA,GACH,CAAC,CAAA,CAAE,gBAAA,GACH,CAAC,CAAA,CAAE,OAAA,GACH,CAAC,CAAA,CAAE,UAAA;AAEP;AAOA,SAAS,eAAA,CAAgB,CAAA,EAA4B;AAGnD,EAAA,OACE,CAAA,CAAE,WAAA,GACF,CAAA,CAAE,mBAAA,GACF,CAAA,CAAE,kBAAA,GACF,CAAA,CAAE,YAAA,GACF,CAAA,CAAE,kBAAA;AAEN;AAOA,SAAS,cAAA,CAAe,CAAA,EAA4B;AAGlD,EAAA,OAAA,CACG,CAAC,CAAA,CAAE,aAAA,GAAiB,CAAA,CAAE,aAAA,GAAgB,CAAA,CAAE,iBAAA,EAAA,GAAA,CACxC,CAAA,CAAE,eAAA,GAAkB,CAAA,CAAE,cAAA,CAAA;AAE3B;AAOO,SAAS,YAAA,CAAa,MAAA,EAA6B,KAAA,EAAyB;AAIjF,EAAA,GAAA,CAAI,OAAA,IAAW,KAAA,CAAA,EAAW,OAAO,MAAA;AACjC,EAAA,OAAO,KAAA;AACT;AAYO,SAAS,gBAAA,CACd,aAAA,EACA,iBAAA,EACA,kBAAA,EACW;AAMX,EAAA,GAAA,CAAI,cAAA,IAAkB,KAAA,EAAA,GAAa,cAAA,IAAkB,EAAA,EAAI;AACvD,IAAA,OAAO,EAAE,IAAA,EAAM,SAAA,EAAW,OAAA,EAAS,cAAc,CAAA;AAAA,EACnD;AACA,EAAA,GAAA,CAAI,iBAAA,EAAmB,OAAO,EAAE,IAAA,EAAM,YAAY,CAAA;AAClD,EAAA,GAAA,CAAI,CAAC,kBAAA,EAAoB,OAAO,EAAE,IAAA,EAAM,SAAA,EAAW,OAAA,EAAS,gCAAgC,CAAA;AAC5F,EAAA,OAAO,EAAE,IAAA,EAAM,KAAK,CAAA;AACtB;AAQO,SAAS,iBAAA,CAAkB,CAAA,EAAmB;AAKnD,EAAA,MAAM,EAAA,EAAI,WAAA,CAAY,CAAA,EAAG,EAAA,EAAI,CAAC,CAAA;AAC9B,EAAA,GAAA,CAAI,EAAA,EAAI,CAAA,EAAG,OAAO,EAAA;AAClB,EAAA,MAAM,EAAA,EAAI,WAAA,CAAY,CAAA,EAAG,EAAA,EAAI,EAAA,EAAI,CAAC,CAAA;AAClC,EAAA,GAAA,CAAI,EAAA,EAAI,CAAA,EAAG,OAAO,CAAA,CAAE,KAAA,CAAM,EAAA,EAAI,CAAC,CAAA;AAC/B,EAAA,OAAO,CAAA,CAAE,KAAA,CAAM,EAAA,EAAI,CAAA,EAAG,CAAC,CAAA;AACzB;AAQO,SAAS,SAAA,CAAU,GAAA,EAAa,OAAA,EAAiB,GAAA,EAAsB;AAG5E,EAAA,OAAO,IAAA,EAAM,QAAA,EAAU,GAAA;AACzB;AAOO,SAAS,eAAA,CAAgB,OAAA,EAAkB,SAAA,EAAoB,MAAA,EAA0B;AAG9F,EAAA,OAAO,QAAA,GAAW,UAAA,GAAa,MAAA;AACjC;AAwBO,SAAS,eAAA,CAAgB,YAAA,EAA8B;AAQ5D,EAAA,GAAA,CAAI,aAAA,GAAgB,CAAA,EAAG,OAAO,QAAA,CAAS,OAAA,CAAQ,EAAE,CAAC,CAAA;AAClD,EAAA,GAAA,CAAI,aAAA,IAAiB,CAAA,EAAG,OAAO,QAAA,CAAS,OAAA,CAAQ,CAAC,CAAC,CAAA;AAClD,EAAA,GAAA,CAAI,aAAA,IAAiB,CAAA,EAAG,OAAO,QAAA,CAAS,OAAA,CAAQ,CAAC,CAAC,CAAA;AAClD,EAAA,GAAA,CAAI,aAAA,IAAiB,CAAA,EAAG,OAAO,QAAA,CAAS,OAAA,CAAQ,CAAC,CAAC,CAAA;AAClD,EAAA,OAAO,QAAA,CAAS,OAAA,CAAQ,CAAC,CAAC,CAAA;AAC5B;AAOO,SAAS,YAAA,CAAa,OAAA,EAA8B,MAAA,EAA0B;AAGnF,EAAA,OAAA,CAAQ,QAAA,IAAY,KAAA,EAAA,GAAa,QAAA,IAAY,IAAA,EAAA,GAAS,MAAA;AACxD;AASO,SAAS,gBAAA,CAAiB,MAAA,EAAmB,CAAA,EAAmB;AAMrE,EAAA,GAAA,CAAI,EAAA,GAAK,MAAA,CAAO,OAAA,GAAU,CAAC,MAAA,CAAO,CAAC,CAAA,EAAG,OAAO,CAAA;AAC7C,EAAA,OAAO,EAAA,EAAI,gBAAA,CAAiB,MAAA,EAAQ,EAAA,EAAI,CAAC,CAAA;AAC3C;AAQO,SAAS,WAAA,CAAY,KAAA,EAAiB,CAAA,EAAmB;AAK9D,EAAA,OAAO,QAAA,CAAS,KAAA,CAAM,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA,EAAG,GAAA,EAAK,CAAC,CAAA;AAC3C;ALxOA;AACA;ACrGO,IAAM,aAAA,EAAe,6BAAA,CAAkB;AAAA,EAC5C,kCAAA;AAAA,IACE,CAAC,GAAA,EAAA,GAAA,CAAS;AAAA,MACR,UAAA,EAAY,KAAA,CAAA;AAAA,MACZ,SAAA,EAAW,CAAC,CAAA;AAAA,MACZ,iBAAA,EAAmB,CAAA;AAAA,MACnB,aAAA,EAAe,CAAA;AAAA,MAEf,aAAA,EAAe,CAAC,UAAA,EAAA,GAAe,GAAA,CAAI,EAAE,WAAW,CAAA,EAAG,KAAA,EAAO,eAAe,CAAA;AAAA,MAEzE,YAAA,EAAc,CAAC,SAAA,EAAA,GAAc;AAC3B,QAAA,MAAM,WAAA,EAAa,SAAA,CAAU,GAAA,CAAI,CAAC,IAAA,EAAA,GAAS,IAAA,CAAK,SAAA,GAAY,CAAC,CAAA;AAC7D,QAAA,MAAM,kBAAA,EAAoB,iBAAA,CAAkB,UAAA,EAAY,CAAA,EAAG,CAAC,CAAA;AAC5D,QAAA,MAAM,cAAA,EAAgB,SAAA,CAAU,MAAA;AAChC,QAAA,GAAA,CAAI,EAAE,SAAA,EAAW,iBAAA,EAAmB,cAAc,CAAA,EAAG,KAAA,EAAO,cAAc,CAAA;AAAA,MAC5E,CAAA;AAAA,MAEA,SAAA,EAAW,CAAA,EAAA,GACT,GAAA;AAAA,QACE,EAAE,UAAA,EAAY,KAAA,CAAA,EAAW,SAAA,EAAW,CAAC,CAAA,EAAG,iBAAA,EAAmB,CAAA,EAAG,aAAA,EAAe,EAAE,CAAA;AAAA,QAC/E,KAAA;AAAA,QACA;AAAA,MACF;AAAA,IACJ,CAAA,CAAA;AAAA,IACA,EAAE,IAAA,EAAM,WAAA,EAAa,OAAA,EAAS,OAAA,CAAQ,GAAA,CAAI,UAAU,EAAA,IAAM,cAAc;AAAA,EAC1E;AACF,CAAA;AAKO,IAAM,cAAA,EAAgB,CAAA,EAAA,GAAM,YAAA,CAAa,CAAC,CAAA,EAAA,GAAM,CAAA,CAAE,UAAU,CAAA;AAE5D,IAAM,aAAA,EAAe,CAAA,EAAA,GAAmB,YAAA,CAAa,CAAC,CAAA,EAAA,GAAM,CAAA,CAAE,SAAS,CAAA;AAEvE,IAAM,qBAAA,EAAuB,CAAA,EAAA,GAAM,YAAA,CAAa,CAAC,CAAA,EAAA,GAAM,CAAA,CAAE,iBAAiB,CAAA;AAE1E,IAAM,iBAAA,EAAmB,CAAA,EAAA,GAAM,YAAA,CAAa,CAAC,CAAA,EAAA,GAAM,CAAA,CAAE,aAAa,CAAA;AAElE,IAAM,iBAAA,EAAmB,CAAA,EAAA,GAAM,YAAA,CAAa,CAAC,CAAA,EAAA,GAAM,CAAA,CAAE,aAAa,CAAA;AAElE,IAAM,gBAAA,EAAkB,CAAA,EAAA,GAAM,YAAA,CAAa,CAAC,CAAA,EAAA,GAAM,CAAA,CAAE,YAAY,CAAA;AAEhE,IAAM,aAAA,EAAe,CAAA,EAAA,GAAM,YAAA,CAAa,CAAC,CAAA,EAAA,GAAM,CAAA,CAAE,SAAS,CAAA;ADyFjE;AACA;AM1JA,yDAAoD;AACpD,8BAAkC;AAqBlC,IAAM,YAAA,EAAcA,kCAAAA,iCAAS,EAAU,CAAC,CAAA;AAOjC,SAAS,aAAA,CAAc,GAAA,EAAa,KAAA,EAAsB;AAC/D,EAAA,IAAI;AACF,IAAA,MAAM,MAAA,EAAsB,EAAE,KAAA,EAAO,OAAA,EAAS,gCAAA,IAAO,CAAK,GAAA,CAAI,CAAC,EAAE,CAAA;AACjE,IAAA,cAAA,CAAe,OAAA,CAAQ,GAAA,EAAK,IAAA,CAAK,SAAA,CAAU,KAAK,CAAC,CAAA;AAAA,EACnD,EAAA,UAAQ;AAAA,EAER;AACF;AAQO,SAAS,eAAA,CACd,GAAA,EACA,IAAA,EAAc,WAAA,EACd,QAAA,EACU;AACV,EAAA,IAAI;AACF,IAAA,MAAM,IAAA,EAAM,cAAA,CAAe,OAAA,CAAQ,GAAG,CAAA;AACtC,IAAA,GAAA,CAAI,CAAC,GAAA,EAAK,OAAO,IAAA;AAEjB,IAAA,MAAM,MAAA,EAAQ,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAE5B,IAAA,MAAM,QAAA,mBAAU,kCAAA,KAAS,CAAM,OAAO,CAAA,UAAK,gCAAA,CAAQ,GAAA;AACnD,IAAA,GAAA,CAAI,SAAA,CAAU,gCAAA,IAAO,CAAK,GAAA,CAAI,CAAC,CAAA,EAAG,OAAA,EAAS,GAAG,CAAA,EAAG;AAC/C,MAAA,cAAA,CAAe,UAAA,CAAW,GAAG,CAAA;AAC7B,MAAA,OAAO,IAAA;AAAA,IACT;AAEA,IAAA,GAAA,CAAI,QAAA,EAAU;AACZ,MAAA,OAAO,QAAA,CAAS,KAAA,CAAM,KAAK,CAAA;AAAA,IAC7B;AACA,IAAA,OAAO,KAAA,CAAM,KAAA;AAAA,EACf,EAAA,WAAQ;AACN,IAAA,cAAA,CAAe,UAAA,CAAW,GAAG,CAAA;AAC7B,IAAA,OAAO,IAAA;AAAA,EACT;AACF;AAGO,SAAS,gBAAA,CAAiB,GAAA,EAAmB;AAClD,EAAA,IAAI;AACF,IAAA,cAAA,CAAe,UAAA,CAAW,GAAG,CAAA;AAAA,EAC/B,EAAA,WAAQ;AAAA,EAER;AACF;AASO,SAAS,sBAAA,CAAuB,MAAA,EAA+C;AAEpF,EAAA,MAAM,UAAA,EAAY,2BAAA,MAAa,CAAA;AAC/B,EAAA,SAAA,CAAU,QAAA,EAAU,MAAA;AAEpB,EAAA,8BAAA,CAAU,EAAA,GAAM;AACd,IAAA,IAAA,CAAA,MAAW,MAAA,GAAS,SAAA,CAAU,OAAA,EAAS;AACrC,MAAA,MAAM,SAAA,EAAW,eAAA,CAAgB,KAAA,CAAM,GAAA,mBAAK,KAAA,CAAM,GAAA,UAAO,aAAA,EAAa,KAAA,CAAM,QAAQ,CAAA;AACpF,MAAA,GAAA,CAAI,SAAA,IAAa,IAAA,EAAM;AACrB,QAAA,KAAA,CAAM,GAAA,CAAI,QAAQ,CAAA;AAAA,MACpB;AAAA,IACF;AAAA,EACF,CAAA,EAAG,CAAC,CAAC,CAAA;AAIL,EAAA,MAAM,WAAA,EAAa,IAAA,CAAK,SAAA,CAAU,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,EAAA,GAAM,CAAC,CAAA,CAAE,GAAA,EAAK,CAAA,CAAE,KAAK,CAAC,CAAC,CAAA;AACrE,EAAA,8BAAA,CAAU,EAAA,GAAM;AACd,IAAA,IAAA,CAAA,MAAW,MAAA,GAAS,SAAA,CAAU,OAAA,EAAS;AACrC,MAAA,GAAA,CAAI,KAAA,CAAM,MAAA,IAAU,KAAA,EAAA,GAAa,KAAA,CAAM,MAAA,IAAU,IAAA,EAAM;AACrD,QAAA,aAAA,CAAc,KAAA,CAAM,GAAA,EAAK,KAAA,CAAM,KAAK,CAAA;AAAA,MACtC;AAAA,IACF;AAAA,EACF,CAAA,EAAG,CAAC,UAAU,CAAC,CAAA;AACjB;AAOO,SAAS,wBAAA,CAAyB,IAAA,EAAsB;AAC7D,EAAA,IAAA,CAAA,MAAW,IAAA,GAAO,IAAA,EAAM;AACtB,IAAA,gBAAA,CAAiB,GAAG,CAAA;AAAA,EACtB;AACF;AN6FA;AACA;AO1NA;AA8DO,IAAM,oBAAA,EAAsB,kBAAA;AAwBnC,SAAS,UAAA,CAAW,SAAA,EAAiC,OAAA,EAAuB;AAC1E,kBAAA,SAAA,mBAAU,KAAA,6BAAO,KAAA,0BAAA,CAAQ,OAAO,GAAA;AAClC;AAGA,SAAS,eAAA,CAAgB,OAAA,EAAwB,WAAA,EAA2C;AAC1F,EAAA,OAAO,YAAA,GAAe,CAAC,OAAA,CAAQ,IAAA,EAAM,EAAE,GAAG,OAAA,EAAS,GAAA,EAAK,YAAY,EAAA,EAAI,OAAA;AAC1E;AAGA,SAAS,gBAAA,CACP,kBAAA,EACA,UAAA,EACA,OAAA,EACA,cAAA,EACyB;AACzB,EAAA,GAAA,CAAI,CAAC,eAAA,GAAkB,CAAC,OAAA,CAAQ,gBAAA,EAAkB,OAAO,IAAA;AACzD,EAAA,OAAO;AAAA,IACL,kBAAA;AAAA,IACA,UAAA;AAAA,IACA,gBAAA,EAAkB,OAAA,CAAQ;AAAA,EAC5B,CAAA;AACF;AAGA,SAAS,YAAA,CAAa,KAAA,EAAuE;AAC3F,EAAA,OAAO,OAAA,iBAAQ,KAAA,6BAAO,qBAAA,GAAsB,KAAA,CAAM,WAAA,GAAc,KAAA,CAAM,gBAAgB,CAAA;AACxF;AAuBO,SAAS,cAAA,CAAe;AAAA,EAC7B,SAAA;AAAA,EACA,UAAA;AAAA,EACA,cAAA;AAAA,EACA,aAAA;AAAA,EACA,gBAAA;AAAA,EACA;AACF,CAAA,EAAsC;AACpC,EAAA,MAAM,CAAC,MAAA,EAAQ,SAAS,EAAA,EAAI,6BAAA,KAAc,CAAA;AAC1C,EAAA,MAAM,CAAC,OAAA,EAAS,UAAU,EAAA,EAAI,6BAAA,IAAuC,CAAA;AACrE,EAAA,MAAM,CAAC,SAAA,EAAW,YAAY,EAAA,EAAI,6BAAA,IAA+B,CAAA;AACjE,EAAA,MAAM,CAAC,eAAA,EAAiB,kBAAkB,EAAA,EAAI,6BAAA,KAAc,CAAA;AAC5D,EAAA,MAAM,CAAC,cAAA,EAAgB,iBAAiB,EAAA,EAAI,6BAAA,KAAc,CAAA;AAC1D,EAAA,MAAM,CAAC,cAAA,EAAgB,iBAAiB,EAAA,EAAI,6BAAA,IAAmC,CAAA;AAC/E,EAAA,MAAM,CAAC,WAAA,EAAa,cAAc,EAAA,EAAI,6BAAA,IAA4B,CAAA;AAClE,EAAA,MAAM,CAAC,MAAA,EAAQ,SAAS,EAAA,EAAI,6BAAA,KAAc,CAAA;AAE1C,EAAA,MAAM,iBAAA,EAAmB,gCAAA,CAAa,GAAA,EAAA,GAAgB;AACpD,IAAA,cAAA,CAAe,GAAG,CAAA;AAAA,EACpB,CAAA,EAAG,CAAC,CAAC,CAAA;AAIL,EAAA,MAAM,cAAA,EAAgBC,2BAAAA,UAAiB,CAAA;AACvC,EAAA,aAAA,CAAc,QAAA,EAAU,UAAA;AASxB,EAAA,MAAM,eAAA,EAAiBA,2BAAAA,IAA0B,CAAA;AAGjD,EAAA,MAAM,YAAA,EAAc,gCAAA,MAAY,CAAA,EAAA,GAAY;AAC1C,IAAA,GAAA,CAAI,CAAC,aAAA,CAAc,OAAA,EAAS,MAAA;AAC5B,IAAA,IAAI;AACF,MAAA,MAAM,OAAA,EAAS,MAAM,SAAA,CAAU,gBAAA,CAAiB;AAAA,QAC9C,UAAA,EAAY,MAAA,CAAO,aAAA,CAAc,OAAO;AAAA,MAC1C,CAAC,CAAA;AACD,MAAA,GAAA,CAAI,CAAC,MAAA,EAAQ;AACX,QAAA,UAAA,CAAW,SAAA,EAAW,iDAAiD,CAAA;AACvE,QAAA,MAAA;AAAA,MACF;AACA,MAAA,UAAA,CAAW,MAAM,CAAA;AAAA,IACnB,EAAA,MAAA,CAAS,KAAA,EAAO;AACd,MAAA,OAAA,CAAQ,KAAA,CAAM,0BAAA,EAA4B,KAAK,CAAA;AAC/C,MAAA,UAAA,CAAW,SAAA,EAAW,iDAAiD,CAAA;AAAA,IACzE;AAAA,EACF,CAAA,EAAG,CAAC,SAAS,CAAC,CAAA;AAGd,EAAA,MAAM,YAAA,EAAc,gCAAA;AAAA,IAClB,MAAA,CAAO,kBAAA,EAAA,GAA+B;AACpC,MAAA,IAAI;AACF,QAAA,MAAM,OAAA,EAAS,MAAM,SAAA,CAAU,QAAA,CAAS,EAAE,mBAAmB,CAAC,CAAA;AAC9D,QAAA,GAAA,CAAI,CAAC,MAAA,EAAQ;AACX,UAAA,UAAA,CAAW,SAAA,EAAW,kDAAkD,CAAA;AACxE,UAAA,MAAA;AAAA,QACF;AACA,QAAA,YAAA,CAAa,MAAM,CAAA;AAAA,MACrB,EAAA,MAAA,CAAS,KAAA,EAAO;AACd,QAAA,OAAA,CAAQ,KAAA,CAAM,kBAAA,EAAoB,KAAK,CAAA;AACvC,QAAA,UAAA,CAAW,SAAA,EAAW,kDAAkD,CAAA;AAAA,MAC1E;AAAA,IACF,CAAA;AAAA,IACA,CAAC,SAAS;AAAA,EACZ,CAAA;AAGA,EAAA,MAAM,cAAA,EAAgB,gCAAA,MAAY,CAAA,EAAA,GAAY;AAC5C,IAAA,MAAM,mBAAA,kBAAqB,OAAA,6BAAS,oBAAA;AACpC,IAAA,GAAA,CAAI,CAAC,mBAAA,GAAsB,CAAC,aAAA,CAAc,OAAA,EAAS,MAAA;AACnD,IAAA,IAAI;AACF,MAAA,MAAM,OAAA,EAAS,MAAM,SAAA,CAAU,eAAA,CAAgB;AAAA,QAC7C,kBAAA;AAAA,QACA,UAAA,EAAY,MAAA,CAAO,aAAA,CAAc,OAAO;AAAA,MAC1C,CAAC,CAAA;AACD,MAAA,GAAA,CAAI,OAAA,IAAW,KAAA,CAAA,EAAW;AACxB,QAAA,UAAA,CAAW,SAAA,EAAW,gDAAgD,CAAA;AACtE,QAAA,MAAA;AAAA,MACF;AACA,MAAA,kBAAA,CAAmB,MAAM,CAAA;AACzB,MAAA,GAAA,CAAI,MAAA,EAAQ;AACV,QAAA,MAAM,WAAA,CAAY,kBAAkB,CAAA;AAAA,MACtC;AAAA,IACF,EAAA,MAAA,CAAS,KAAA,EAAO;AACd,MAAA,OAAA,CAAQ,KAAA,CAAM,yBAAA,EAA2B,KAAK,CAAA;AAC9C,MAAA,UAAA,CAAW,SAAA,EAAW,gDAAgD,CAAA;AAAA,IACxE;AAAA,EACF,CAAA,EAAG,CAAC,OAAA,EAAS,WAAA,EAAa,SAAS,CAAC,CAAA;AAGpC,EAAA,MAAM,kBAAA,EAAoB,gCAAA,MAAY,CAAA,EAAA,GAAY;AAChD,IAAA,GAAA,CAAI,iBAAC,OAAA,6BAAS,qBAAA,GAAsB,CAAC,aAAA,CAAc,OAAA,EAAS,MAAA;AAC5D,IAAA,IAAI;AACF,MAAA,MAAM,OAAA,EAAS,MAAM,SAAA,CAAU,YAAA,CAAa;AAAA,QAC1C,kBAAA,EAAoB,OAAA,CAAQ,kBAAA;AAAA,QAC5B,UAAA,EAAY,MAAA,CAAO,aAAA,CAAc,OAAO;AAAA,MAC1C,CAAC,CAAA;AACD,MAAA,GAAA,CAAI,CAAC,MAAA,EAAQ;AACX,QAAA,UAAA,CAAW,SAAA,EAAW,uDAAuD,CAAA;AAC7E,QAAA,MAAA;AAAA,MACF;AACA,MAAA,iBAAA,CAAkB,eAAA,CAAgB,MAAA,EAAQ,WAAW,CAAC,CAAA;AACtD,MAAA,MAAM,UAAA,EAAY,gBAAA;AAAA,QAChB,OAAA,CAAQ,kBAAA;AAAA,QACR,OAAA,CAAQ,UAAA;AAAA,QACR,MAAA;AAAA,QACA;AAAA,MACF,CAAA;AACA,MAAA,GAAA,CAAI,SAAA,EAAW,aAAA,CAAc,mBAAA,EAAqB,SAAS,CAAA;AAAA,IAC7D,EAAA,MAAA,CAAS,KAAA,EAAO;AACd,MAAA,OAAA,CAAQ,KAAA,CAAM,sBAAA,EAAwB,KAAK,CAAA;AAC3C,MAAA,UAAA,CAAW,SAAA,EAAW,uDAAuD,CAAA;AAAA,IAC/E;AAAA,EACF,CAAA,EAAG,CAAC,OAAA,EAAS,WAAA,EAAa,SAAA,EAAW,cAAc,CAAC,CAAA;AAGpD,EAAA,MAAM,qBAAA,EAAuB,gCAAA;AAAA,IAC3B,MAAA,CAAO,kBAAA,EAA4B,OAAA,EAAA,GAAmC;AACpE,MAAA,IAAI;AACF,QAAA,MAAM,OAAA,EAAS,MAAM,SAAA,CAAU,aAAA,CAAc;AAAA,UAC3C,kBAAA;AAAA,UACA,QAAA,EAAU,OAAA,CAAQ,QAAA;AAAA,UAClB,QAAA,EAAU,OAAA,CAAQ,QAAA;AAAA,UAClB,IAAA,EAAM,OAAA,CAAQ,IAAA;AAAA,UACd,KAAA,EAAO,OAAA,CAAQ,KAAA;AAAA,UACf,GAAA,EAAK,OAAA,CAAQ;AAAA,QACf,CAAC,CAAA;AACD,QAAA,GAAA,CAAI,CAAC,MAAA,EAAQ;AACX,UAAA,UAAA,CAAW,SAAA,EAAW,0CAA0C,CAAA;AAChE,UAAA,MAAA;AAAA,QACF;AACA,QAAA,iBAAA,CAAkB,IAAI,CAAA;AACtB,QAAA,KAAK,iBAAA,CAAkB,CAAA;AAAA,MACzB,EAAA,MAAA,CAAS,KAAA,EAAO;AACd,QAAA,OAAA,CAAQ,KAAA,CAAM,uBAAA,EAAyB,KAAK,CAAA;AAC5C,QAAA,UAAA,CAAW,SAAA,EAAW,0CAA0C,CAAA;AAAA,MAClE;AAAA,IACF,CAAA;AAAA,IACA,CAAC,iBAAA,EAAmB,SAAS;AAAA,EAC/B,CAAA;AAGA,EAAAC,8BAAAA,CAAU,EAAA,GAAM;AACd,IAAA,GAAA,CAAI,OAAA,GAAA,CAAW,CAAC,iBAAA,GAAoB,cAAA,IAAkB,aAAA,CAAA,EAAgB;AACpE,MAAA,SAAA,CAAU,KAAK,CAAA;AAAA,IACjB;AAAA,EACF,CAAA,EAAG,CAAC,MAAA,EAAQ,gBAAA,EAAkB,aAAa,CAAC,CAAA;AAG5C,EAAAA,8BAAAA,CAAU,EAAA,GAAM;AACd,IAAA,GAAA,CAAI,OAAA,GAAU,iBAAA,GAAoB,cAAA,IAAkB,cAAA,GAAiB,QAAA,IAAY,IAAA,EAAM;AACrF,MAAA,KAAK,WAAA,CAAY,CAAA;AAAA,IACnB;AAAA,EACF,CAAA,EAAG,CAAC,MAAA,EAAQ,gBAAA,EAAkB,aAAA,EAAe,OAAA,EAAS,WAAW,CAAC,CAAA;AAKlE,EAAAA,8BAAAA,CAAU,EAAA,GAAM;AACd,IAAA,MAAMC,SAAAA,kBAAU,OAAA,6BAAS,oBAAA;AACzB,IAAA,GAAA,CAAI,CAAC,OAAA,GAAUA,SAAAA,GAAW,iBAAA,GAAoB,cAAA,IAAkB,aAAA,EAAe;AAC7E,MAAA,GAAA,CAAI,cAAA,CAAe,QAAA,IAAYA,QAAAA,EAAS,MAAA;AACxC,MAAA,cAAA,CAAe,QAAA,EAAUA,QAAAA;AACzB,MAAA,KAAK,aAAA,CAAc,CAAA;AAAA,IACrB;AAAA,EACF,CAAA,EAAG,CAAC,MAAA,EAAQ,OAAA,EAAS,gBAAA,EAAkB,aAAA,EAAe,aAAa,CAAC,CAAA;AAIpE,EAAA,MAAM,QAAA,kBAAU,OAAA,6BAAS,oBAAA;AACzB,EAAAD,8BAAAA,CAAU,EAAA,GAAM;AACd,IAAA,GAAA,CACE,gBAAA,GACA,eAAA,IAAmB,KAAA,EAAA,mBACnB,SAAA,6BAAW,qBAAA,GACX,cAAA,IAAkB,cAAA,GAClB,OAAA,EACA;AACA,MAAA,KAAK,oBAAA,CAAqB,OAAA,EAAS,cAAc,CAAA;AAAA,IACnD;AAAA,EACF,CAAA,EAAG;AAAA,IACD,eAAA;AAAA,IACA,cAAA;AAAA,oBACA,SAAA,+BAAW,oBAAA;AAAA,IACX,oBAAA;AAAA,IACA,aAAA;AAAA,IACA;AAAA,EACF,CAAC,CAAA;AAGD,EAAAA,8BAAAA,CAAU,EAAA,GAAM;AACd,IAAA,GAAA,CAAI,MAAA,EAAQ;AACV,MAAA,SAAA,CAAU,IAAI,CAAA;AACd,MAAA,UAAA,CAAW,IAAI,CAAA;AACf,MAAA,YAAA,CAAa,IAAI,CAAA;AACjB,MAAA,iBAAA,CAAkB,IAAI,CAAA;AACtB,MAAA,iBAAA,CAAkB,KAAK,CAAA;AACvB,MAAA,kBAAA,CAAmB,KAAK,CAAA;AACxB,MAAA,cAAA,CAAe,IAAI,CAAA;AACnB,MAAA,cAAA,CAAe,QAAA,EAAU,IAAA;AACzB,MAAA,GAAA,CAAI,cAAA,EAAgB;AAClB,QAAA,gBAAA,CAAiB,mBAAmB,CAAA;AAAA,MACtC;AAAA,IACF;AAAA,EACF,CAAA,EAAG,CAAC,MAAA,EAAQ,cAAc,CAAC,CAAA;AAG3B,EAAA,MAAM,eAAA,EAAiB,gCAAA,MAAY,CAAA,EAAA,GAAY;AAC7C,IAAA,GAAA,CAAI,CAAC,aAAA,CAAc,OAAA,EAAS,MAAA;AAE5B,IAAA,MAAM,MAAA,EAAQ,eAAA,CAAkC,mBAAmB,CAAA;AACnE,IAAA,GAAA,CAAI,CAAC,YAAA,CAAa,KAAK,CAAA,EAAG,MAAA;AAE1B,IAAA,MAAM,EAAE,kBAAA,EAAoB,WAAW,EAAA,EAAI,KAAA;AAC3C,IAAA,IAAI;AACF,MAAA,MAAM,QAAA,EAAU,MAAM,SAAA,CAAU,YAAA,CAAa;AAAA,QAC3C,kBAAA;AAAA,QACA,UAAA,EAAY,MAAA,CAAO,aAAA,CAAc,OAAO;AAAA,MAC1C,CAAC,CAAA;AACD,MAAA,GAAA,CAAI,iBAAC,OAAA,+BAAS,kBAAA,EAAkB;AAC9B,QAAA,gBAAA,CAAiB,mBAAmB,CAAA;AACpC,QAAA,MAAA;AAAA,MACF;AAGA,MAAA,cAAA,CAAe,QAAA,EAAU,kBAAA;AACzB,MAAA,UAAA,CAAW,EAAE,kBAAA,EAAoB,WAAW,CAAC,CAAA;AAC7C,MAAA,iBAAA,CAAkB,OAAO,CAAA;AACzB,MAAA,kBAAA,CAAmB,IAAI,CAAA;AACvB,MAAA,iBAAA,CAAkB,IAAI,CAAA;AACtB,MAAA,MAAM,KAAA,EAAO,MAAM,SAAA,CAAU,QAAA,CAAS,EAAE,mBAAmB,CAAC,CAAA;AAC5D,MAAA,GAAA,CAAI,IAAA,EAAM,YAAA,CAAa,IAAI,CAAA;AAAA,IAC7B,EAAA,WAAQ;AACN,MAAA,gBAAA,CAAiB,mBAAmB,CAAA;AAAA,IACtC;AAAA,EACF,CAAA,EAAG,CAAC,SAAS,CAAC,CAAA;AAId,EAAA,MAAM,kBAAA,EAAoBD,2BAAAA,cAAqB,CAAA;AAC/C,EAAA,iBAAA,CAAkB,QAAA,EAAU,cAAA;AAC5B,EAAAC,8BAAAA,CAAU,EAAA,GAAM;AACd,IAAA,GAAA,CAAI,cAAA,EAAgB;AAClB,MAAA,KAAK,iBAAA,CAAkB,OAAA,CAAQ,CAAA;AAAA,IACjC;AAAA,EACF,CAAA,EAAG,CAAC,cAAc,CAAC,CAAA;AAEnB,EAAA,OAAO;AAAA,IACL,MAAA;AAAA,IACA,SAAA;AAAA,IACA,MAAA;AAAA,IACA,SAAA;AAAA,IACA,OAAA;AAAA,IACA,SAAA;AAAA,IACA,eAAA;AAAA,IACA,cAAA;AAAA,IACA,cAAA;AAAA,IACA,WAAA;AAAA,IACA;AAAA,EACF,CAAA;AACF;APoDA;AACA;AQpcA;ARscA;AACA;ASzcA;AAQO,SAAS,SAAA,CAAa,KAAA,EAAwB;AACnD,EAAA,MAAM,IAAA,EAAMD,2BAAAA,KAAY,CAAA;AACxB,EAAA,GAAA,CAAI,QAAA,EAAU,KAAA;AACd,EAAA,OAAO,GAAA;AACT;ATocA;AACA;AQxaO,SAAS,uBAAA,CAAwB,MAAA,EAAuC;AAC7E,EAAA,OAAO,YAAA,iBAAa,MAAA,uBAAO,oBAAA,4BAAA,CAAuB,MAAM,GAAA,EAAG,YAAA,CAAa,cAAA,CAAe,MAAM,CAAC,CAAC,CAAA;AACjG;AAGA,SAAS,cAAA,CAAe,MAAA,EAA8C;AACpE,EAAA,OAAO;AAAA,IACL,UAAA,EAAY,CAAC,CAAC,MAAA,CAAO,UAAA;AAAA,IACrB,gBAAA,EAAkB,MAAA,CAAO,kBAAA;AAAA,IACzB,mBAAA,EAAqB,MAAA,CAAO,qBAAA;AAAA,IAC5B,eAAA,EAAiB,MAAA,CAAO,iBAAA;AAAA,IACxB,MAAA,EAAQ,MAAA,CAAO,MAAA;AAAA,IACf,kBAAA,EAAoB,MAAA,CAAO,gBAAA,IAAoB,KAAA,CAAA;AAAA,IAC/C,iBAAA,EAAmB,MAAA,CAAO,eAAA,IAAmB,KAAA,CAAA;AAAA,IAC7C,WAAA,EAAa,MAAA,CAAO,mBAAA;AAAA,IACpB,kBAAA,EAAoB,MAAA,CAAO,sBAAA;AAAA,IAC3B,UAAA,EAAY,MAAA,CAAO,eAAA;AAAA,IACnB,YAAA,EAAc,MAAA,CAAO,cAAA,IAAkB,aAAA;AAAA,IACvC,YAAA,EAAc,CAAC,CAAC,MAAA,CAAO,uBAAA;AAAA,IACvB,iBAAA,EAAmB,MAAA,CAAO,cAAA;AAAA,IAC1B,cAAA,EAAgB,MAAA,CAAO,cAAA;AAAA,IACvB,cAAA,EAAgB,MAAA,CAAO,YAAA,IAAgB,KAAA;AAAA,EACzC,CAAA;AACF;AASO,SAAS,iBAAA,CAAkB,MAAA,EAA8B;AAC9D,EAAA,MAAM,CAAC,qBAAA,EAAuB,wBAAwB,EAAA,EAAIG,6BAAAA,KAAc,CAAA;AACxE,EAAA,MAAM,CAAC,oBAAA,EAAsB,uBAAuB,EAAA,EAAIA,6BAAAA,KAAc,CAAA;AAItE,EAAA,MAAM,UAAA,EAAY,SAAA,CAAU,MAAM,CAAA;AAClC,EAAAF,8BAAAA,CAAU,EAAA,GAAM;AACd,IAAA,uBAAA,CAAwB,IAAI,CAAA;AAE5B,IAAA,MAAM,QAAA,EAAU,SAAA,CAAU,OAAA;AAC1B,IAAA,MAAM,UAAA,EAAY,UAAA,CAAW,CAAA,EAAA,GAAM;AACjC,MAAA,MAAM,MAAA,EAAQ,uBAAA,CAAwB,OAAO,CAAA;AAC7C,MAAA,wBAAA,CAAyB,KAAK,CAAA;AAC9B,MAAA,uBAAA,CAAwB,KAAK,CAAA;AAAA,IAC/B,CAAA,EAAG,GAAG,CAAA;AAEN,IAAA,OAAO,CAAA,EAAA,GAAM,YAAA,CAAa,SAAS,CAAA;AAAA,EACrC,CAAA,EAAG;AAAA,IACD,SAAA;AAAA,IACA,MAAA,CAAO,cAAA;AAAA,IACP,MAAA,CAAO,eAAA;AAAA,IACP,MAAA,CAAO,kBAAA;AAAA,IACP,MAAA,CAAO,qBAAA;AAAA,IACP,MAAA,CAAO,iBAAA;AAAA,IACP,MAAA,CAAO,MAAA;AAAA,IACP,MAAA,CAAO,cAAA;AAAA,IACP,MAAA,CAAO,uBAAA;AAAA,IACP,MAAA,CAAO,cAAA;AAAA,IACP,MAAA,CAAO,aAAA;AAAA,IACP,MAAA,CAAO,eAAA;AAAA,IACP,MAAA,CAAO,SAAA;AAAA,IACP,MAAA,CAAO,WAAA;AAAA,IACP,MAAA,CAAO,mBAAA;AAAA,IACP,MAAA,CAAO,sBAAA;AAAA,IACP,MAAA,CAAO;AAAA,EACT,CAAC,CAAA;AAED,EAAA,OAAO,EAAE,qBAAA,EAAuB,qBAAqB,CAAA;AACvD;AR0ZA;AACA;AACE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACF,63CAAC","file":"/Users/stuartjackson/Projects/simpleapps/atlas/repo/packages/augur-hooks/dist/chunk-BWBJPKLV.cjs","sourcesContent":[null,"import { create } from \"zustand\";\nimport { devtools } from \"zustand/middleware\";\nimport type { TCartLine } from \"@simpleapps-com/augur-utils\";\nimport { quantityTotalFrom } from \"../rules\";\n\n/** Internal state shape for the cart Zustand store. */\ninterface CartState {\n /** P21 cart header UID; `undefined` when no cart exists. */\n cartHdrUid: number | string | undefined;\n /** Current line items in the cart. */\n cartLines: TCartLine[];\n /** Sum of `quantity` across all cart lines (auto-computed by `setCartLines`). */\n cartQuantityTotal: number;\n /** Number of distinct line items (auto-computed by `setCartLines`). */\n cartLineCount: number;\n setCartHdrUid: (cartHdrUid: number | string | undefined) => void;\n /** Replace all cart lines. Auto-recomputes `cartQuantityTotal` and `cartLineCount`. */\n setCartLines: (cartLines: TCartLine[]) => void;\n /** Reset the cart to its empty initial state. */\n clearCart: () => void;\n}\n\n/** Zustand store for cart state. Prefer the individual selector hooks below for optimal re-renders. */\nexport const useCartStore = create<CartState>()(\n devtools(\n (set) => ({\n cartHdrUid: undefined,\n cartLines: [],\n cartQuantityTotal: 0,\n cartLineCount: 0,\n\n setCartHdrUid: (cartHdrUid) => set({ cartHdrUid }, false, \"setCartHdrUid\"),\n\n setCartLines: (cartLines) => {\n const quantities = cartLines.map((line) => line.quantity || 0);\n const cartQuantityTotal = quantityTotalFrom(quantities, 0, 0);\n const cartLineCount = cartLines.length;\n set({ cartLines, cartQuantityTotal, cartLineCount }, false, \"setCartLines\");\n },\n\n clearCart: () =>\n set(\n { cartHdrUid: undefined, cartLines: [], cartQuantityTotal: 0, cartLineCount: 0 },\n false,\n \"clearCart\",\n ),\n }),\n { name: \"CartStore\", enabled: process.env[\"NODE_ENV\"] === \"development\" },\n ),\n);\n\n// Selector hooks -- only re-render when specific state changes\n\n/** Select the current cart header UID. */\nexport const useCartHdrUid = () => useCartStore((s) => s.cartHdrUid);\n/** Select the current cart line items array. */\nexport const useCartLines = (): TCartLine[] => useCartStore((s) => s.cartLines);\n/** Select the total quantity summed across all cart lines. */\nexport const useCartQuantityTotal = () => useCartStore((s) => s.cartQuantityTotal);\n/** Select the number of distinct line items in the cart. */\nexport const useCartLineCount = () => useCartStore((s) => s.cartLineCount);\n/** Get the `setCartHdrUid` action (stable reference). */\nexport const useSetCartHdrUid = () => useCartStore((s) => s.setCartHdrUid);\n/** Get the `setCartLines` action (stable reference). Also recomputes totals. */\nexport const useSetCartLines = () => useCartStore((s) => s.setCartLines);\n/** Get the `clearCart` action (stable reference). */\nexport const useClearCart = () => useCartStore((s) => s.clearCart);\n","//@ backend dafny\n\n/* Seconds and milliseconds as two types (2026-11-08). Verified with LemmaScript → Dafny\n (`pnpm proofs`; model: models/Durations.dfy, where they are two datatypes; link:\n models/links/foundation-duration.dfy).\n\n Both are branded: a plain `number` is neither, and a `Seconds` is not a `Millis`, so a TTL in\n seconds can't be passed where milliseconds are meant (augur-core's `staleTime` vs\n `redisTtl`), and a JWT `exp` can't be compared with `Date.now()` unconverted. Write a\n duration in the unit people think in (`minutes(15)`) and convert with `toMillis`; read a\n clock or a millisecond count back with `floorSeconds`. Values enter through the guards\n `secondsOf` / `millisOf` (an env value, a JSON `expires_in`); the clock is `millis(Date.now())`\n (the platform's time value is a whole, non-negative number of milliseconds).\n lsc writes both aliases as `nat` (no refinement, models/LSC-GAPS.md). */\n\n/** A whole number of seconds, made only by the builders and guards below. */\n//@ type nat\nexport type Seconds = number & { readonly __seconds: true };\n\n/** A whole number of milliseconds, made only by the builders and guards below. */\n//@ type nat\nexport type Millis = number & { readonly __millis: true };\n\n/**\n * `n` seconds.\n *\n * @ensures exactly the model's Seconds(n)\n */\nexport function seconds(n: number): Seconds {\n //@ verify\n //@ type n nat\n //@ requires n >= 0\n //@ ensures \\result === n\n return n as Seconds;\n}\n\n/**\n * `n` minutes, in seconds.\n *\n * @ensures exactly the model's Minutes\n */\nexport function minutes(n: number): Seconds {\n //@ verify\n //@ type n nat\n //@ requires n >= 0\n //@ ensures \\result === n * 60\n return (n * 60) as Seconds;\n}\n\n/**\n * `n` hours, in seconds.\n *\n * @ensures exactly the model's Hours\n */\nexport function hours(n: number): Seconds {\n //@ verify\n //@ type n nat\n //@ requires n >= 0\n //@ ensures \\result === n * 3600\n return (n * 3600) as Seconds;\n}\n\n/**\n * `n` days, in seconds.\n *\n * @ensures exactly the model's Days\n */\nexport function days(n: number): Seconds {\n //@ verify\n //@ type n nat\n //@ requires n >= 0\n //@ ensures \\result === n * 86400\n return (n * 86400) as Seconds;\n}\n\n/**\n * `n` milliseconds: for a duration under a second (a retry backoff, a debounce).\n *\n * @ensures exactly the model's Millis(n)\n */\nexport function millis(n: number): Millis {\n //@ verify\n //@ type n nat\n //@ requires n >= 0\n //@ ensures \\result === n\n return n as Millis;\n}\n\n/**\n * Seconds as milliseconds, exactly.\n *\n * @ensures exactly the model's ToMillis\n */\nexport function toMillis(d: Seconds): Millis {\n //@ verify\n //@ requires d >= 0\n //@ ensures \\result === d * 1000\n return (d * 1000) as Millis;\n}\n\n/**\n * Milliseconds as whole seconds, rounded down (a JWT `exp` or `iat` from a clock).\n *\n * @ensures exactly the model's FloorSeconds\n */\nexport function floorSeconds(m: Millis): Seconds {\n //@ verify\n //@ type m nat\n //@ requires m >= 0\n //@ ensures \\result === Math.floor(m / 1000)\n return Math.floor(m / 1000) as Seconds;\n}\n\n/**\n * A clock reading plus a duration, both `Millis`: when something expires (`addMillis(now,\n * toMillis(minutes(15)))`).\n *\n * @ensures exactly the model's AddMillis\n */\nexport function addMillis(a: Millis, b: Millis): Millis {\n //@ verify\n //@ requires a >= 0 && b >= 0\n //@ ensures \\result === a + b\n return (a + b) as Millis;\n}\n\n/**\n * A reading less a duration, never below 0 (a token used until a minute before it expires). An\n * expiry clamped to 0 is no more live than the negative one it stands for (the model's\n * MinusMillisKeepsLiveness).\n *\n * @ensures exactly the model's MinusMillis\n */\nexport function minusMillis(a: Millis, b: Millis): Millis {\n //@ verify\n //@ requires a >= 0 && b >= 0\n //@ ensures \\result === (a >= b ? a - b : 0)\n return a >= b ? ((a - b) as Millis) : millis(0);\n}\n\n/**\n * `n` as `Seconds`, or null when it is not a safe integer at least 0: a fraction, NaN, a\n * negative, an infinity, or past `Number.MAX_SAFE_INTEGER`. Where a number of seconds enters.\n *\n * @ensures exactly the model's AcceptedAsDuration, and the value is kept\n */\nexport function secondsOf(n: number): Seconds | null {\n //@ verify\n //@ ensures (\\result !== null) <==> (n >= 0 && n <= 9007199254740991)\n //@ ensures \\result !== null ==> \\result === n\n return Math.floor(n) === n && n >= 0 && n <= 9007199254740991 ? (n as Seconds) : null;\n}\n\n/**\n * An outside count of seconds (a token's `expires_in`, a JWT's `exp`) as `Seconds`: rounded\n * down, and 0 when it is then no safe integer at least 0 (a negative, NaN, an infinity), so a\n * bad lifetime is no lifetime and a bad expiry is already past.\n *\n * @ensures exactly the model's WholeSeconds (the proof reads a number as an integer)\n */\nexport function wholeSeconds(n: number): Seconds {\n //@ verify\n //@ ensures (n >= 0 && n <= 9007199254740991) ==> \\result === n\n //@ ensures !(n >= 0 && n <= 9007199254740991) ==> \\result === 0\n const whole = secondsOf(Math.floor(n));\n return whole === null ? seconds(0) : whole;\n}\n\n/**\n * `n` as `Millis`, or null when it is not a safe integer at least 0 (the same rule as\n * `secondsOf`). Where a number of milliseconds enters.\n *\n * @ensures exactly the model's AcceptedAsDuration, and the value is kept\n */\nexport function millisOf(n: number): Millis | null {\n //@ verify\n //@ ensures (\\result !== null) <==> (n >= 0 && n <= 9007199254740991)\n //@ ensures \\result !== null ==> \\result === n\n return Math.floor(n) === n && n >= 0 && n <= 9007199254740991 ? (n as Millis) : null;\n}\n","//@ backend dafny\nimport {\n isAlnumChar,\n isBase64UrlChar,\n isDigit,\n isHexChar,\n isJsSpace,\n isLineTerminator,\n isLowerHexChar,\n isSnakeChar,\n isWordChar,\n lowerCode,\n} from \"@atlas/foundation/chars\";\n\n/* String scans and slices, verified with LemmaScript → Dafny (hand lemmas in strings.dfy;\n model: models/Utils.dfy; link: models/links/utils-strings.dfy). Recursive and\n expression-bodied so specs can use them, and each contract pins the result exactly, so\n an importer (which sees only the contract) knows what it returns. Two of them stand in\n for constructs lsc mistranslates: `prefix` for an unclamped `slice`, and the code-unit\n scans for \"\\r\" / \"\\n\" literals. */\n\n/**\n * The code unit at `i`, or -1 when `i` is outside `s`. JS `charCodeAt` gives NaN there,\n * which no code equals, so a scan's own bounds test would change no result and no test\n * could tell it from none (an equivalent mutant); with the bound here once, the boundary is\n * observable (tests pin -1) and the scans that use it carry no bound of their own. A code\n * unit is never negative, so -1 matches no `code` a caller passes (`requires code >= 0`).\n *\n * @ensures 0 ≤ i < |s| ⟹ result = s[i]; otherwise result = -1\n */\nexport function codeAt(s: string, i: number): number {\n //@ verify\n //@ ensures (i >= 0 && i < s.length) ==> \\result === s.charCodeAt(i)\n //@ ensures !(i >= 0 && i < s.length) ==> \\result === -1\n return i >= 0 && i < s.length ? s.charCodeAt(i) : -1;\n}\n\n/**\n * Every character of `s` from index `i` on is base64url.\n *\n * @ensures result ⟺ ∀ k ∈ [i, |s|). isBase64UrlChar(s[k])\n */\nexport function base64UrlFrom(s: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases s.length - i\n //@ ensures \\result <==> forall(k: nat, (i <= k && k < s.length) ==> isBase64UrlChar(s.charCodeAt(k)))\n return i >= s.length || (isBase64UrlChar(s.charCodeAt(i)) && base64UrlFrom(s, i + 1));\n}\n\n/**\n * The base64url digit for `v` (RFC 4648 §5): A-Z a-z 0-9 - _.\n *\n * @ensures exactly the model's Base64UrlDigit\n */\nexport function base64UrlDigit(v: number): string {\n //@ verify\n //@ type v nat\n //@ requires v >= 0 && v < 64\n //@ ensures \\result === \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_\".slice(v, v + 1)\n return \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_\".slice(v, v + 1);\n}\n\n/**\n * Bytes from `i` on as unpadded base64url: each three as four digits, a last one or two as two or\n * three (JS `btoa` with `+/` as `-_` and the `=` dropped). One frame per three bytes: a JWT part\n * is a few hundred.\n *\n * @ensures exactly the model's Base64UrlFrom (links/utils-strings.dfy)\n */\nexport function encodeBase64UrlFrom(b: number[], i: number): string {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && forall(k: nat, k < b.length ==> (b[k] >= 0 && b[k] < 256))\n //@ decreases b.length - i\n //@ ensures i >= b.length ==> \\result === \"\"\n if (i >= b.length) return \"\";\n const x = b[i] as number;\n const first = base64UrlDigit(Math.floor(x / 4));\n if (i + 1 === b.length) return first + base64UrlDigit((x % 4) * 16);\n const y = b[i + 1] as number;\n const second = base64UrlDigit((x % 4) * 16 + Math.floor(y / 16));\n if (i + 2 === b.length) return first + second + base64UrlDigit((y % 16) * 4);\n const z = b[i + 2] as number;\n return (\n first +\n second +\n base64UrlDigit((y % 16) * 4 + Math.floor(z / 64)) +\n base64UrlDigit(z % 64) +\n encodeBase64UrlFrom(b, i + 3)\n );\n}\n\n/**\n * Every character of `s` from index `i` on is lowercase hex.\n *\n * @ensures result ⟺ ∀ k ∈ [i, |s|). isLowerHexChar(s[k])\n */\nexport function lowerHexFrom(s: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases s.length - i\n //@ ensures \\result <==> forall(k: nat, (i <= k && k < s.length) ==> isLowerHexChar(s.charCodeAt(k)))\n return i >= s.length || (isLowerHexChar(s.charCodeAt(i)) && lowerHexFrom(s, i + 1));\n}\n\n/**\n * Every character of `s` from index `i` on is hex, either case.\n *\n * @ensures result ⟺ ∀ k ∈ [i, |s|). isHexChar(s[k])\n */\nexport function hexFrom(s: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases s.length - i\n //@ ensures \\result <==> forall(k: nat, (i <= k && k < s.length) ==> isHexChar(s.charCodeAt(k)))\n return i >= s.length || (isHexChar(s.charCodeAt(i)) && hexFrom(s, i + 1));\n}\n\n/**\n * Every character of `s` from index `i` on is an ASCII digit (`\\d` without the `u` flag).\n *\n * @ensures result ⟺ ∀ k ∈ [i, |s|). isDigit(s[k])\n */\nexport function digitsFrom(s: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases s.length - i\n //@ ensures \\result <==> forall(k: nat, (i <= k && k < s.length) ==> isDigit(s.charCodeAt(k)))\n return i >= s.length || (isDigit(s.charCodeAt(i)) && digitsFrom(s, i + 1));\n}\n\n/**\n * Every character of `s` from index `i` on is a word character (`\\w`: `[A-Za-z0-9_]`).\n *\n * @ensures result ⟺ ∀ k ∈ [i, |s|). isWordChar(s[k])\n */\nexport function wordCharsFrom(s: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases s.length - i\n //@ ensures \\result <==> forall(k: nat, (i <= k && k < s.length) ==> isWordChar(s.charCodeAt(k)))\n return i >= s.length || (isWordChar(s.charCodeAt(i)) && wordCharsFrom(s, i + 1));\n}\n\n/**\n * Every character of `s` from index `i` on is a snake_case character (`[a-z0-9_]`).\n *\n * @ensures result ⟺ ∀ k ∈ [i, |s|). isSnakeChar(s[k])\n */\nexport function snakeCharsFrom(s: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases s.length - i\n //@ ensures \\result <==> forall(k: nat, (i <= k && k < s.length) ==> isSnakeChar(s.charCodeAt(k)))\n return i >= s.length || (isSnakeChar(s.charCodeAt(i)) && snakeCharsFrom(s, i + 1));\n}\n\n/**\n * Every character of `s` from index `i` on is an ASCII letter or digit (`[A-Za-z0-9]`).\n *\n * @ensures result ⟺ ∀ k ∈ [i, |s|). isAlnumChar(s[k])\n */\nexport function alnumFrom(s: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases s.length - i\n //@ ensures \\result <==> forall(k: nat, (i <= k && k < s.length) ==> isAlnumChar(s.charCodeAt(k)))\n return i >= s.length || (isAlnumChar(s.charCodeAt(i)) && alnumFrom(s, i + 1));\n}\n\n/**\n * Every character of `s` from index `i` on is an ASCII letter, digit or `-` (`[A-Za-z0-9-]`):\n * a domain label's tail, a service name's tail.\n *\n * @ensures result ⟺ ∀ k ∈ [i, |s|). isAlnumChar(s[k]) ∨ s[k] = \"-\" — the model's AlnumDashFrom\n */\nexport function alnumDashFrom(s: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases s.length - i\n //@ ensures \\result <==> forall(k: nat, (i <= k && k < s.length) ==> (isAlnumChar(s.charCodeAt(k)) || s.charCodeAt(k) === 45))\n if (i >= s.length) return true;\n const c = s.charCodeAt(i);\n return (isAlnumChar(c) || c === 45) && alnumDashFrom(s, i + 1);\n}\n\n/**\n * The last index before `end` holding `code`, or -1 (JS `s.lastIndexOf(c)` at end = |s|).\n *\n * @ensures result = -1 ∨ (0 ≤ result < end ∧ s[result] = code ∧ no `code` in (result, end))\n */\nexport function lastIndexOfCode(s: string, code: number, end: number): number {\n //@ verify\n //@ type end nat\n //@ requires 0 <= end && end <= s.length\n //@ decreases end\n //@ ensures \\result === -1 || (0 <= \\result && \\result < end)\n //@ ensures \\result >= 0 ==> s.charCodeAt(\\result) === code\n //@ ensures \\result >= 0 ==> forall(k: nat, (\\result < k && k < end) ==> s.charCodeAt(k) !== code)\n //@ ensures \\result === -1 ==> forall(k: nat, k < end ==> s.charCodeAt(k) !== code)\n if (end === 0) return -1;\n if (s.charCodeAt(end - 1) === code) return end - 1;\n return lastIndexOfCode(s, code, end - 1);\n}\n\n/**\n * No character of `s` from index `i` on is `code`.\n *\n * @ensures result ⟺ ∀ k ∈ [i, |s|). s[k] ≠ code\n */\nexport function lacksCode(s: string, code: number, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires 0 <= i && i <= s.length\n //@ decreases s.length - i\n //@ ensures \\result <==> forall(k: nat, (i <= k && k < s.length) ==> s.charCodeAt(k) !== code)\n // `===`, not `>=`: past the end a read is NaN !== code, so `>=` vs `>` would be equivalent\n return i === s.length || (s.charCodeAt(i) !== code && lacksCode(s, code, i + 1));\n}\n\n/**\n * The end of the run of `code` starting at `i`: the first index ≥ i that isn't `code`\n * (skip spaces: `codeRunEnd(header, 32, i)`).\n *\n * @requires i ≤ |s|\n * @ensures i ≤ result ≤ |s| ∧ ∀ k ∈ [i, result). s[k] = code ∧ (result < |s| ⟹ s[result] ≠ code)\n * — exactly the run's end\n */\nexport function codeRunEnd(s: string, code: number, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires 0 <= i && i <= s.length\n //@ requires code >= 0\n //@ decreases s.length - i\n //@ ensures i <= \\result && \\result <= s.length\n //@ ensures forall(k: nat, (i <= k && k < \\result) ==> s.charCodeAt(k) === code)\n //@ ensures \\result < s.length ==> s.charCodeAt(\\result) !== code\n return codeAt(s, i) === code ? codeRunEnd(s, code, i + 1) : i;\n}\n\n/**\n * The first index ≥ `from` holding `code`, or -1 (`indexOf` for one code unit, so \"\\n\" is\n * passed as 10, never as a literal).\n *\n * @ensures result = -1 ∨ (from ≤ result < |s| ∧ s[result] = code), with no `code` in\n * [from, result) — the first one; result = -1 ⟹ none from `from` on\n */\nexport function indexOfCode(s: string, code: number, from: number): number {\n //@ verify\n //@ type from nat\n //@ requires code >= 0 && from >= 0\n //@ decreases s.length - from\n //@ ensures \\result === -1 || (from <= \\result && \\result < s.length)\n //@ ensures \\result >= 0 ==> s.charCodeAt(\\result) === code\n //@ ensures \\result >= 0 ==> forall(k: nat, (from <= k && k < \\result) ==> s.charCodeAt(k) !== code)\n //@ ensures \\result === -1 ==> forall(k: nat, (from <= k && k < s.length) ==> s.charCodeAt(k) !== code)\n const c = codeAt(s, from);\n if (c === code) return from;\n if (c === -1) return -1;\n return indexOfCode(s, code, from + 1);\n}\n\n/**\n * The first index ≥ `i` holding `a` or `b`, or |s| (a run either code ends: a path segment's\n * run to \"/\" or \"?\"). One scan: the lesser of two `indexOfCode` ends is the same index, but\n * its two sides are equal only when both are |s|, a boundary no test can observe.\n *\n * @requires i ≤ |s|\n * @ensures i ≤ result ≤ |s| ∧ ∀ k ∈ [i, result). s[k] ∉ {a, b} ∧ (result < |s| ⟹ s[result] ∈ {a, b})\n * — exactly the first such index\n */\nexport function eitherCodeEnd(s: string, a: number, b: number, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires 0 <= i && i <= s.length\n //@ requires a >= 0 && b >= 0\n //@ decreases s.length - i\n //@ ensures i <= \\result && \\result <= s.length\n //@ ensures forall(k: nat, (i <= k && k < \\result) ==> (s.charCodeAt(k) !== a && s.charCodeAt(k) !== b))\n //@ ensures \\result < s.length ==> (s.charCodeAt(\\result) === a || s.charCodeAt(\\result) === b)\n const c = codeAt(s, i);\n if (c === -1 || c === a || c === b) return i;\n return eitherCodeEnd(s, a, b, i + 1);\n}\n\n/**\n * `s` without one trailing `code` (\"\\r\" before a \"\\n\", say); unchanged otherwise.\n *\n * @ensures s ends with code ⟹ result = s[0, |s| − 1)\n * @ensures otherwise result = s\n */\nexport function dropLast(s: string, code: number): string {\n //@ verify\n //@ requires code >= 0\n //@ ensures (s.length > 0 && s.charCodeAt(s.length - 1) === code) ==> \\result === s.slice(0, s.length - 1)\n //@ ensures !(s.length > 0 && s.charCodeAt(s.length - 1) === code) ==> \\result === s\n return codeAt(s, s.length - 1) === code ? s.slice(0, s.length - 1) : s;\n}\n\n/**\n * `s` without its leading `code` units (every one of them).\n *\n * @ensures exactly the model's LStripCode\n */\nexport function lStripCode(s: string, code: number): string {\n //@ verify\n //@ requires code >= 0\n //@ decreases s.length\n //@ ensures \\result.length <= s.length\n if (codeAt(s, 0) === code) return lStripCode(s.slice(1), code);\n return s;\n}\n\n/**\n * `s` without its trailing `code` units (every one of them).\n *\n * @ensures exactly the model's RStripCode\n */\nexport function rStripCode(s: string, code: number): string {\n //@ verify\n //@ requires code >= 0\n //@ decreases s.length\n //@ ensures \\result.length <= s.length\n if (codeAt(s, s.length - 1) === code) {\n return rStripCode(s.slice(0, s.length - 1), code);\n }\n return s;\n}\n\n/**\n * `s` without its leading and trailing `code` units, the middle kept (`/a/b/` with `/` →\n * `a/b`).\n *\n * @ensures exactly the model's StripCode — neither end is `code` (StripCodeTrims)\n */\nexport function stripCode(s: string, code: number): string {\n //@ verify\n //@ requires code >= 0\n //@ ensures \\result === rStripCode(lStripCode(s, code), code)\n return rStripCode(lStripCode(s, code), code);\n}\n\n/**\n * JS `s.startsWith(x, pos)`, which lsc mistranslates (it drops `pos`). Like JS, a `pos`\n * past the end counts as the end, so the empty string matches anywhere.\n *\n * @ensures pos ≤ |s| ⟹ (result ⟺ pos + |x| ≤ |s| ∧ s[pos, pos + |x|) = x) — so a true\n * result also gives the bounds for slicing after the match\n * @ensures pos > |s| ⟹ (result ⟺ x = \"\")\n */\nexport function startsWithAt(s: string, x: string, pos: number): boolean {\n //@ verify\n //@ type pos nat\n //@ requires pos >= 0\n //@ ensures pos <= s.length ==> (\\result <==> (pos + x.length <= s.length && s.slice(pos, pos + x.length) === x))\n //@ ensures pos > s.length ==> (\\result <==> x.length === 0)\n // Math.min, not a ternary: at pos = |s| both branches agree, so `<` vs `<=` is equivalent\n const at = Math.min(pos, s.length);\n // The slice is clamped to the end, so a too-long x differs by length: no separate fit test\n // (JS slice clamps too, which made one unobservable)\n return s.slice(at, Math.min(at + x.length, s.length)) === x;\n}\n\n/**\n * `s` with A-Z lowercased and every other character kept: what lsc's proofs take\n * `toLowerCase()` to be. JS's `toLowerCase()` also maps non-ASCII letters, some onto ASCII\n * (the Kelvin sign K, U+212A, becomes \"k\") or onto two characters (İ, U+0130), so a proved\n * function that lowercases MUST use this, or the runtime does what the proof says it\n * doesn't.\n *\n * @ensures |result| = |s| ∧ ∀ k < |s|. result[k] = (s[k] ∈ A-Z ? s[k] + 32 : s[k]) — A-Z\n * lowered, every other code unit unchanged; true in JS (a contract `=== s.toLowerCase()` held\n * only in lsc's ASCII model of the built-in, Fable review 2026-11-06). Helper-free, since an\n * importer is given only the helpers its own body calls; exactly the model's LowerAscii in\n * the link\n */\nexport function lowerAscii(s: string): string {\n //@ verify\n //@ decreases s.length\n //@ ensures \\result.length === s.length\n //@ ensures forall(k: nat, k < s.length ==> \\result.charCodeAt(k) === ((s.charCodeAt(k) >= 65 && s.charCodeAt(k) <= 90) ? s.charCodeAt(k) + 32 : s.charCodeAt(k)))\n if (s.length === 0) return \"\";\n const c = s.charCodeAt(0);\n const head =\n c >= 65 && c <= 90 ? \"abcdefghijklmnopqrstuvwxyz\".slice(c - 65, c - 64) : s.slice(0, 1);\n return head + lowerAscii(s.slice(1));\n}\n\n/**\n * `lowerAscii` as a loop: a constant stack depth (and linear time) on long text, where the\n * recursive spec takes a frame and a slice per character.\n *\n * @ensures result = lowerAscii(s)\n */\nexport function lowerAsciiText(s: string): string {\n //@ verify\n //@ ensures \\result === lowerAscii(s)\n let out = \"\";\n let i = 0;\n while (i !== s.length) {\n //@ invariant 0 <= i && i <= s.length\n //@ invariant out + lowerAscii(s.slice(i)) === lowerAscii(s)\n //@ decreases s.length - i\n const c = s.charCodeAt(i);\n out =\n out +\n (c >= 65 && c <= 90 ? \"abcdefghijklmnopqrstuvwxyz\".slice(c - 65, c - 64) : s.slice(i, i + 1));\n i = i + 1;\n }\n return out;\n}\n\n/**\n * Whether `x` from index `k` matches `s` from `pos + k`, code by code, ASCII-lowered. A code\n * past the end of `s` is -1 (`codeAt`), which no code of `x` is, so there is no bound to\n * check (a `pos + |x| ≤ |s|` guard before a slice never changed the answer at runtime, where\n * `slice` clamps: an equivalent mutant, 2026-11-02).\n *\n * @ensures exactly the model's CaselessFrom\n */\nexport function caselessFrom(s: string, x: string, pos: number, k: number): boolean {\n //@ verify\n //@ type pos nat\n //@ type k nat\n //@ requires pos >= 0 && k >= 0 && k <= x.length\n //@ decreases x.length - k\n //@ ensures k === x.length ==> \\result\n if (k === x.length) return true;\n return lowerCode(codeAt(s, pos + k)) === x.charCodeAt(k) && caselessFrom(s, x, pos, k + 1);\n}\n\n/**\n * Whether the text of `s` at `pos`, ASCII-lowered, is `x` (`x` given lowercase): a case-free\n * `startsWith`; callers carry no length guard of their own. Only `pos ≤ |s|` is checked: it\n * decides an empty `x` past the end, the one case the code-by-code test can't see.\n *\n * @ensures result ⟺ pos + |x| ≤ |s| ∧ ∀ j < |x|. lowered(s[pos + j]) = x[j] — the text at pos,\n * ASCII-lowered (A-Z + 32), is x; helper-free; exactly the model's StartsWithCaseless in the link\n */\nexport function startsWithCaseless(s: string, x: string, pos: number): boolean {\n //@ verify\n //@ type pos nat\n //@ requires pos >= 0\n //@ ensures \\result <==> (pos + x.length <= s.length && forall(j: nat, j < x.length ==> ((s.charCodeAt(pos + j) >= 65 && s.charCodeAt(pos + j) <= 90) ? s.charCodeAt(pos + j) + 32 : s.charCodeAt(pos + j)) === x.charCodeAt(j)))\n return pos <= s.length && caselessFrom(s, x, pos, 0);\n}\n\n/**\n * Whether `s` ends with `suffix` (JS one-argument `endsWith`, which lsc reads as its\n * two-argument form; moved from the augur-api generator 2026-11-01).\n *\n * @ensures result ⟺ |s| ≥ |suffix| ∧ s[|s| − |suffix|, |s|) = suffix — exactly the model's EndsWith\n */\nexport function endsWith(s: string, suffix: string): boolean {\n //@ verify\n //@ ensures \\result <==> (s.length >= suffix.length && s.slice(s.length - suffix.length) === suffix)\n // No length test: from max(|s| − |suffix|, 0), a too-long suffix compares unequal by length\n return s.slice(Math.max(s.length - suffix.length, 0)) === suffix;\n}\n\n/**\n * The order of `a` and `b` by UTF-16 code unit from index `i`, as a recursive spec: -1, 0\n * or 1 (JS `<` on strings; a proper prefix comes first). Locale-free, unlike `localeCompare`.\n *\n * @ensures result ∈ {-1, 0, 1} — exactly the model's CompareFrom\n */\nexport function compareFrom(a: string, b: string, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases a.length - i\n //@ ensures \\result === -1 || \\result === 0 || \\result === 1\n if (i >= a.length) return i >= b.length ? 0 : -1;\n if (i >= b.length) return 1;\n const x = a.charCodeAt(i);\n const y = b.charCodeAt(i);\n if (x < y) return -1;\n if (x > y) return 1;\n return compareFrom(a, b, i + 1);\n}\n\n/**\n * The order of two strings by UTF-16 code unit, for `sort` (what the default `sort` uses on\n * strings), so sorted output never depends on locale.\n *\n * @ensures result = compareFrom(a, b, 0)\n */\nexport function compareCodeUnits(a: string, b: string): number {\n //@ verify\n //@ ensures \\result === compareFrom(a, b, 0)\n return compareFrom(a, b, 0);\n}\n\n/**\n * JS `s.slice(0, n)`: at most `n` characters, clamped to the length. lsc reads a bare\n * `slice(0, n)` without JS's clamp, so use this instead.\n *\n * @ensures result = s[0, min(n, |s|))\n */\nexport function prefix(s: string, n: number): string {\n //@ verify\n //@ type n nat\n //@ requires n >= 0\n //@ ensures n < s.length ==> \\result === s.slice(0, n)\n //@ ensures n >= s.length ==> \\result === s\n // Math.min, not a ternary: JS slice already clamps, so a ternary's branch is unobservable\n return s.slice(0, Math.min(n, s.length));\n}\n\n/**\n * The end of the JS-whitespace (`\\s`) run starting at `i`: the first index ≥ i that is not\n * whitespace, or |s|.\n *\n * @ensures i ≤ result ≤ |s| ∧ s[i, result) all whitespace ∧ (result = |s| ∨ ¬space(s[result]))\n */\nexport function spaceRunEnd(s: string, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires 0 <= i && i <= s.length\n //@ decreases s.length - i\n //@ ensures i <= \\result && \\result <= s.length\n //@ ensures forall(k: nat, (i <= k && k < \\result) ==> isJsSpace(s.charCodeAt(k)))\n //@ ensures \\result < s.length ==> !isJsSpace(s.charCodeAt(\\result))\n // codeAt is -1 at the end, which is no space: the bound needs no test of its own here\n if (!isJsSpace(codeAt(s, i))) return i;\n return spaceRunEnd(s, i + 1);\n}\n\n/**\n * The end of the ASCII-digit run starting at `i` (a regex's `\\d+`, from `i`): the first index\n * ≥ i that is not 0-9, or |s|.\n *\n * @ensures i ≤ result ≤ |s| ∧ s[i, result) all digits ∧ (result = |s| ∨ ¬digit(s[result])) —\n * exactly the model's DigitRunEnd\n */\nexport function digitRunEnd(s: string, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires 0 <= i && i <= s.length\n //@ decreases s.length - i\n //@ ensures i <= \\result && \\result <= s.length\n //@ ensures forall(k: nat, (i <= k && k < \\result) ==> (s.charCodeAt(k) >= 48 && s.charCodeAt(k) <= 57))\n //@ ensures \\result < s.length ==> !(s.charCodeAt(\\result) >= 48 && s.charCodeAt(\\result) <= 57)\n // codeAt is -1 at the end, which is no digit\n if (!isDigit(codeAt(s, i))) return i;\n return digitRunEnd(s, i + 1);\n}\n\n/**\n * A natural number written canonically (`^(0|[1-9][0-9]*)$`): the keys JS objects move\n * first, ahead of their source order.\n *\n * @ensures exactly the model's CanonicalNat, stated over the codes themselves so an importer\n * can use it (a contract naming `digitsFrom` can't be resolved there, models/LSC-GAPS.md)\n */\nexport function isCanonicalNat(s: string): boolean {\n //@ verify\n //@ ensures \\result <==> (s === \"0\" || (s.length > 0 && s.charCodeAt(0) >= 49 && s.charCodeAt(0) <= 57 && forall(k: nat, (1 <= k && k < s.length) ==> (s.charCodeAt(k) >= 48 && s.charCodeAt(k) <= 57))))\n if (s === \"0\") return true;\n const first = codeAt(s, 0);\n return first >= 49 && first <= 57 && digitsFrom(s, 1);\n}\n\n/**\n * The value of a run of decimal digits, most significant first (\"\" is 0).\n *\n * @requires ∀ k ∈ [0, |s|). isDigit(s[k])\n * @ensures exactly the model's DigitsValue (proved in links/utils-strings.dfy)\n */\nexport function digitsValue(s: string): number {\n //@ verify\n //@ requires forall(k: nat, k < s.length ==> (s.charCodeAt(k) >= 48 && s.charCodeAt(k) <= 57))\n //@ decreases s.length\n //@ ensures \\result >= 0\n if (s.length === 0) return 0;\n return digitsValue(s.slice(0, s.length - 1)) * 10 + (s.charCodeAt(s.length - 1) - 48);\n}\n\n/**\n * What a number from the environment means (owner 2026-11-04: a bad one fails at start):\n * \"default\" when unset (\"\": the wrapper reads a missing variable as \"\"), \"value\" when it is\n * a canonical natural number at least `min` (its value is `digitsValue(raw)`), and \"bad\"\n * otherwise: a sign, a space, a fraction, an exponent, hex, text, or below `min`.\n *\n * @ensures exactly the model's EnvNumberOf (proved in links/utils-strings.dfy)\n */\nexport function envNumberKind(raw: string, min: number): string {\n //@ verify\n //@ type min nat\n //@ ensures raw === \"\" ==> \\result === \"default\"\n //@ ensures (raw !== \"\" && !isCanonicalNat(raw)) ==> \\result === \"bad\"\n if (raw === \"\") return \"default\";\n if (!isCanonicalNat(raw)) return \"bad\";\n return digitsValue(raw) < min ? \"bad\" : \"value\";\n}\n\n/**\n * A canonical natural number's value, 0 for any other text (a count written as JSON).\n *\n * @ensures exactly the model's CanonicalNatValue (in the link: `digitsValue` needs the digits\n * isCanonicalNat's contract gives, which a contract can't call for); 0 for other text\n */\nexport function canonicalNatValue(s: string): number {\n //@ verify\n //@ ensures \\result >= 0\n //@ ensures !isCanonicalNat(s) ==> \\result === 0\n if (!isCanonicalNat(s)) return 0;\n return digitsValue(s);\n}\n\n/**\n * The first index ≥ `i` holding a line terminator, or |s|: where a regex `.+` started at `i`\n * stops.\n *\n * @ensures i ≤ result ≤ |s| ∧ no terminator in s[i, result) ∧ (result = |s| ∨ terminator at result)\n */\nexport function lineEnd(s: string, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires 0 <= i && i <= s.length\n //@ decreases s.length - i\n //@ ensures i <= \\result && \\result <= s.length\n //@ ensures forall(k: nat, (i <= k && k < \\result) ==> !isLineTerminator(s.charCodeAt(k)))\n //@ ensures \\result < s.length ==> isLineTerminator(s.charCodeAt(\\result))\n if (i === s.length || isLineTerminator(s.charCodeAt(i))) return i;\n return lineEnd(s, i + 1);\n}\n\n/**\n * The largest p with lo ≤ p < hi whose character is not a line terminator, or -1: where a\n * backtracking regex `.` can start.\n *\n * @ensures result = -1 ∨ (lo ≤ result < hi ∧ ¬terminator(s[result]) ∧ only terminators in (result, hi))\n */\nexport function lastLineCharBelow(s: string, hi: number, lo: number): number {\n //@ verify\n //@ type hi nat\n //@ type lo nat\n //@ requires 0 <= lo && 0 <= hi && hi <= s.length\n //@ decreases hi\n //@ ensures \\result === -1 || (lo <= \\result && \\result < hi)\n //@ ensures \\result >= 0 ==> !isLineTerminator(s.charCodeAt(\\result))\n //@ ensures \\result >= 0 ==> forall(k: nat, (\\result < k && k < hi) ==> isLineTerminator(s.charCodeAt(k)))\n //@ ensures \\result === -1 ==> forall(k: nat, (lo <= k && k < hi) ==> isLineTerminator(s.charCodeAt(k)))\n if (hi <= lo) return -1;\n if (!isLineTerminator(s.charCodeAt(hi - 1))) return hi - 1;\n return lastLineCharBelow(s, hi - 1, lo);\n}\n\n/**\n * Nothing but JS whitespace (`s.trim() === \"\"`).\n *\n * @ensures exactly the model's Blank\n */\nexport function isBlank(s: string): boolean {\n //@ verify\n //@ ensures \\result <==> s.trim() === \"\"\n return s.trim() === \"\";\n}\n\n/**\n * The first index ≥ `i` where `x` occurs in `s`, or -1 (JS `s.indexOf(x, i)` for i ≤ |s|).\n *\n * @ensures result = -1 ∨ (i ≤ result ∧ s[result, result + |x|) = x) — and the first such\n * index: links/utils-strings.dfy proves it is exactly the model's IndexOfFrom (lsc can't\n * give the \"no earlier match\" quantifier a trigger)\n */\nexport function indexOfFrom(s: string, x: string, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= s.length\n //@ decreases s.length - i\n //@ ensures \\result === -1 || (i <= \\result && \\result + x.length <= s.length)\n //@ ensures \\result >= 0 ==> s.slice(\\result, \\result + x.length) === x\n // A match here, else the end, else the next index: stopping at `i === |s|` (not \"x no\n // longer fits\") leaves no bound whose slip a later, harmless step would hide\n if (startsWithAt(s, x, i)) return i;\n if (i === s.length) return -1;\n return indexOfFrom(s, x, i + 1);\n}\n\n/**\n * `indexOfFrom` as a loop: the same answer at a constant stack depth, for text long enough that\n * one frame per character would overflow the stack (a rendered page, 50–60 KB with its inlined\n * stylesheet). Specs and links use `indexOfFrom`; runtime scans over long text use this.\n *\n * @ensures result = indexOfFrom(s, x, i)\n */\nexport function findFrom(s: string, x: string, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= s.length\n //@ ensures \\result === indexOfFrom(s, x, i)\n let k = i;\n while (k !== s.length) {\n //@ invariant i <= k && k <= s.length\n //@ invariant indexOfFrom(s, x, k) === indexOfFrom(s, x, i)\n //@ decreases s.length - k\n if (startsWithAt(s, x, k)) return k;\n k = k + 1;\n }\n return startsWithAt(s, x, k) ? k : -1;\n}\n\n/**\n * `indexOfCode` as a loop: the same answer at a constant stack depth (see `findFrom`).\n *\n * @ensures result = indexOfCode(s, code, from)\n */\nexport function findCodeFrom(s: string, code: number, from: number): number {\n //@ verify\n //@ type from nat\n //@ requires code >= 0 && from >= 0\n //@ ensures \\result === indexOfCode(s, code, from)\n let k = from;\n while (k < s.length) {\n //@ invariant from <= k\n //@ invariant indexOfCode(s, code, k) === indexOfCode(s, code, from)\n //@ decreases s.length - k\n if (s.charCodeAt(k) === code) return k;\n k = k + 1;\n }\n return -1;\n}\n\n/**\n * How many times `x` occurs in `s` from `i` on, left to right without overlaps (repeated JS\n * `s.indexOf(x, at + x.length)`).\n *\n * @requires |x| > 0\n * @ensures result ≥ 0 — exactly the model's CountFrom (links/utils-strings.dfy)\n */\nexport function countFrom(s: string, x: string, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires x.length > 0 && i >= 0 && i <= s.length\n //@ decreases s.length - i\n //@ ensures \\result >= 0\n const at = indexOfFrom(s, x, i);\n if (at === -1) return 0;\n return 1 + countFrom(s, x, at + x.length);\n}\n\n/**\n * `countFrom(s, x, 0)` as a loop: a constant stack depth on long text (see `findFrom`).\n *\n * @requires |x| > 0\n * @ensures result = countFrom(s, x, 0)\n */\nexport function countOf(s: string, x: string): number {\n //@ verify\n //@ requires x.length > 0\n //@ ensures \\result === countFrom(s, x, 0)\n let n = 0;\n let i = 0;\n let at = findFrom(s, x, 0);\n while (at !== -1) {\n //@ invariant 0 <= i && i <= s.length\n //@ invariant at === indexOfFrom(s, x, i)\n //@ invariant n + countFrom(s, x, i) === countFrom(s, x, 0)\n //@ decreases s.length - i\n n = n + 1;\n i = at + x.length;\n at = findFrom(s, x, i);\n }\n return n;\n}\n\n/**\n * The text before the first `code`, or all of it when there is none (JS `s.split(c)[0]`).\n *\n * @ensures result = s[0, first code) when s holds one, else s — the model's UntilCode\n */\nexport function untilCode(s: string, code: number): string {\n //@ verify\n //@ requires code >= 0\n //@ ensures \\result === (indexOfCode(s, code, 0) >= 0 && indexOfCode(s, code, 0) <= s.length ? s.slice(0, indexOfCode(s, code, 0)) : s)\n const k = indexOfCode(s, code, 0);\n return k >= 0 ? s.slice(0, k) : s;\n}\n\n/**\n * `s` from `i` on split at every `code` (JS `s.split(c)` at i = 0, for a one-character\n * separator): always at least one part.\n *\n * @ensures |result| ≥ 1 — exactly the model's SplitCodeFrom (links/utils-strings.dfy)\n */\nexport function splitCodeFrom(s: string, code: number, i: number): string[] {\n //@ verify\n //@ type i nat\n //@ requires code >= 0 && i >= 0 && i <= s.length\n //@ decreases s.length - i\n //@ ensures \\result.length > 0\n const k = indexOfCode(s, code, i);\n if (k === -1) return [s.slice(i)];\n return [s.slice(i, k), ...splitCodeFrom(s, code, k + 1)];\n}\n\n/**\n * Every run of JS whitespace in `s` from `i` on as one space (JS `s.replace(/\\s+/g, \" \")` at\n * i = 0).\n *\n * @ensures |result| ≤ |s| − i — exactly the model's CollapseSpacesFrom (links/utils-strings.dfy)\n */\nexport function collapseSpacesFrom(s: string, i: number): string {\n //@ verify\n //@ type i nat\n //@ requires 0 <= i && i <= s.length\n //@ decreases s.length - i\n //@ ensures \\result.length <= s.length - i\n if (i === s.length) return \"\";\n if (isJsSpace(s.charCodeAt(i))) return \" \" + collapseSpacesFrom(s, spaceRunEnd(s, i));\n return s.slice(i, i + 1) + collapseSpacesFrom(s, i + 1);\n}\n\n/**\n * `collapseSpacesFrom(s, 0)` at a constant stack depth (a page's text is tens of KB).\n *\n * @ensures result = collapseSpacesFrom(s, 0)\n */\nexport function collapseSpaces(s: string): string {\n //@ verify\n //@ ensures \\result === collapseSpacesFrom(s, 0)\n let out = \"\";\n let i = 0;\n while (i < s.length) {\n //@ invariant 0 <= i && i <= s.length\n //@ invariant out + collapseSpacesFrom(s, i) === collapseSpacesFrom(s, 0)\n //@ decreases s.length - i\n if (isJsSpace(s.charCodeAt(i))) {\n out = out + \" \";\n // the run's end as a loop too: spaceRunEnd takes a frame per space (Fable review 2026-11-06)\n let e = i + 1;\n while (e !== s.length && isJsSpace(s.charCodeAt(e))) {\n //@ invariant i < e && e <= s.length\n //@ invariant forall(k: nat, (i <= k && k < e) ==> isJsSpace(s.charCodeAt(k)))\n //@ decreases s.length - e\n e = e + 1;\n }\n i = e;\n } else {\n out = out + s.slice(i, i + 1);\n i = i + 1;\n }\n }\n return out;\n}\n\n/**\n * `n` spaces.\n *\n * @ensures result = \" \" repeated n times — the model's Spaces\n */\nexport function spaces(n: number): string {\n //@ verify\n //@ type n nat\n //@ requires n >= 0\n //@ decreases n\n //@ ensures \\result.length === n\n //@ ensures forall(k: nat, k < n ==> \\result.charCodeAt(k) === 32)\n // `<= 0`, not `=== 0`: the same for a nat, and a fraction a caller slips in (outside the\n // contract) ends instead of recursing forever (Fable review 2026-11-06: spaces(0.5))\n if (n <= 0) return \"\";\n return \" \" + spaces(n - 1);\n}\n\n/**\n * A line feed, `\"\\n\"`, for proved text that spans lines: lsc emits a `\"\\n\"` escape raw, which\n * Dafny cannot parse (models/LSC-GAPS.md), so the contract pins it by code unit and the body is\n * a template literal holding the line break itself.\n *\n * @ensures result = \"\\n\" — one code unit, 10\n */\nexport function lineFeed(): string {\n //@ verify\n //@ ensures \\result.length === 1 && \\result.charCodeAt(0) === 10\n return `\n`;\n}\n\n/**\n * `s` padded on the left with spaces to `width` (JS `s.padStart(width)`).\n *\n * @ensures result = Spaces(width − |s|) + s when width > |s|, else s\n */\nexport function padLeft(s: string, width: number): string {\n //@ verify\n //@ ensures width <= s.length ==> \\result === s\n // width > |s| ⟹ spaces(width − |s|) + s: a hand ensures in strings.dfy, so importers'\n // axioms name no helper (models/LSC-GAPS.md). Math.max, not a ternary: at width = |s|\n // both branches agree (spaces(0) is \"\"), so `>` vs `>=` would be equivalent.\n return spaces(Math.max(width - s.length, 0)) + s;\n}\n\n/**\n * `s` padded on the right with spaces to `width` (JS `s.padEnd(width)`).\n *\n * @ensures result = s + Spaces(width − |s|) when width > |s|, else s\n */\nexport function padRight(s: string, width: number): string {\n //@ verify\n //@ ensures width <= s.length ==> \\result === s\n // width > |s| ⟹ s + spaces(width − |s|): a hand ensures in strings.dfy, as padLeft's.\n return s + spaces(Math.max(width - s.length, 0));\n}\n\n/**\n * An optional part of a key: `tag` then `text`, or nothing when `text` is empty, so an absent\n * part never leaves a bare tag.\n *\n * @ensures result = \"\" when text = \"\", else tag + text — exactly the model's KeyPart\n */\nexport function keyPart(tag: string, text: string): string {\n //@ verify\n //@ ensures \\result === (text === \"\" ? \"\" : tag + text)\n return text === \"\" ? \"\" : tag + text;\n}\n\n/**\n * Two texts joined by one space: the one rule behind a loader key's `<column> <direction>`, a\n * sync line's `METHOD /path` and a field's description then note.\n *\n * @ensures result = a + \" \" + b — exactly the model's SpaceJoined\n */\nexport function spaceJoined(a: string, b: string): string {\n //@ verify\n //@ ensures \\result === a + \" \" + b\n return a + \" \" + b;\n}\n\n/**\n * The first code point of `w` as text: a surrogate pair whole, else the first code unit, or \"\"\n * (Fable review 2026-11-06: an astral initial was a lone surrogate).\n *\n * @ensures exactly the model's FirstChar\n */\nexport function firstCodePoint(w: string): string {\n //@ verify\n //@ ensures \\result === ((w.length >= 2 && w.charCodeAt(0) >= 55296 && w.charCodeAt(0) <= 56319 && w.charCodeAt(1) >= 56320 && w.charCodeAt(1) <= 57343) ? w.slice(0, 2) : (w.length > 0 ? w.slice(0, 1) : \"\"))\n if (w.length >= 2) {\n const hi = w.charCodeAt(0);\n const lo = w.charCodeAt(1);\n if (hi >= 55296 && hi <= 56319 && lo >= 56320 && lo <= 57343) return w.slice(0, 2);\n }\n return w.length > 0 ? w.slice(0, 1) : \"\";\n}\n\n/**\n * An ASCII letter (A-Z, a-z) somewhere in `w` from `i` on (moved from readability.ts\n * 2026-11-06, so `readableWords`' contract can name it and importers resolve it).\n *\n * @ensures result ⟺ ∃ k ∈ [i, |w|). w[k] ∈ A-Z ∪ a-z — at i = 0 exactly the model's HasAsciiLetter\n */\nexport function hasAsciiLetterFrom(w: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases w.length - i\n //@ ensures \\result <==> exists(k: nat, i <= k && k < w.length && ((w.charCodeAt(k) >= 65 && w.charCodeAt(k) <= 90) || (w.charCodeAt(k) >= 97 && w.charCodeAt(k) <= 122)))\n if (i >= w.length) return false;\n const c = w.charCodeAt(i);\n if ((c >= 65 && c <= 90) || (c >= 97 && c <= 122)) return true;\n return hasAsciiLetterFrom(w, i + 1);\n}\n\n/**\n * `s` with a-z uppercased and every other character kept, the mirror of `lowerAscii`: JS's\n * `toUpperCase()` also maps non-ASCII letters (ß becomes \"SS\").\n *\n * @ensures |result| = |s| ∧ ∀ k < |s|. result[k] = (s[k] ∈ a-z ? s[k] − 32 : s[k]) — a-z\n * raised, every other code unit unchanged; exactly the model's UpperAscii in the link\n */\nexport function upperAscii(s: string): string {\n //@ verify\n //@ decreases s.length\n //@ ensures \\result.length === s.length\n //@ ensures forall(k: nat, k < s.length ==> \\result.charCodeAt(k) === ((s.charCodeAt(k) >= 97 && s.charCodeAt(k) <= 122) ? s.charCodeAt(k) - 32 : s.charCodeAt(k)))\n if (s.length === 0) return \"\";\n const c = s.charCodeAt(0);\n const head =\n c >= 97 && c <= 122 ? \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\".slice(c - 97, c - 96) : s.slice(0, 1);\n return head + upperAscii(s.slice(1));\n}\n","//@ backend dafny\nimport { includesFrom } from \"./includes\";\nimport { compareFrom, endsWith } from \"./strings\";\n\n/* Pure list helpers, verified with LemmaScript → Dafny (model: models/Utils.dfy; link:\n models/links/utils-lists.dfy). */\n\n/**\n * The items from index `i` joined by `sep` (JS `xs.join(sep)` at i = 0).\n *\n * @ensures exactly the model's JoinFrom\n */\nexport function joinFrom(xs: string[], sep: string, i: number): string {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases xs.length - i\n //@ ensures i >= xs.length ==> \\result === \"\"\n //@ ensures i + 1 === xs.length ==> \\result === xs[i]\n //@ ensures i + 1 < xs.length ==> (\\result.length >= xs[i].length + sep.length && \\result.slice(0, xs[i].length + sep.length) === xs[i] + sep)\n if (i >= xs.length) return \"\";\n return joinRange(xs, sep, i, xs.length);\n}\n\n/**\n * The items from `lo` up to `hi` (at least one) joined by `sep`, by halves: a list of n items\n * recurses log n deep, so a generated file of many thousand lines fits the stack.\n *\n * @ensures = the model's JoinFrom(xs[..hi], sep, lo) (links/utils-lists.dfy, by JoinFromSplits)\n */\nfunction joinRange(xs: string[], sep: string, lo: number, hi: number): string {\n //@ verify\n //@ type lo nat\n //@ type hi nat\n //@ requires lo < hi && hi <= xs.length\n //@ decreases hi - lo\n //@ ensures hi === lo + 1 ==> \\result === xs[lo]\n if (hi - lo === 1) return xs[lo] as string;\n const mid = lo + Math.floor((hi - lo) / 2);\n return joinRange(xs, sep, lo, mid) + sep + joinRange(xs, sep, mid, hi);\n}\n\n/**\n * The first index ≥ `i` holding `x`, or -1 (JS `xs.indexOf(x, i)`): how a table of parallel\n * lists is read.\n *\n * @ensures result = -1 ∨ (i ≤ result < |xs| ∧ xs[result] = x) — and the first such index: the\n * model's ItemIndexFrom (links/utils-lists.dfy)\n */\nexport function itemIndexFrom(xs: string[], x: string, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases xs.length - i\n //@ ensures \\result === -1 || (i <= \\result && \\result < xs.length && xs[\\result] === x)\n //@ ensures \\result === -1 ==> forall(k: nat, (i <= k && k < xs.length) ==> xs[k] !== x)\n //@ ensures \\result >= 0 ==> forall(k: nat, (i <= k && k < \\result) ==> xs[k] !== x)\n if (i >= xs.length) return -1;\n return (xs[i] as string) === x ? i : itemIndexFrom(xs, x, i + 1);\n}\n\n/**\n * The sum of `xs[i..]`, 0 past the end (JS `xs.slice(i).reduce((a, b) => a + b, 0)`).\n *\n * @ensures result = Σ xs[i..] — exactly the model's SumFrom\n */\nexport function sumFrom(xs: number[], i: number): number {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases xs.length - i\n //@ ensures \\result === (i >= xs.length ? 0 : xs[i] + sumFrom(xs, i + 1))\n if (i >= xs.length) return 0;\n return (xs[i] as number) + sumFrom(xs, i + 1);\n}\n\n/**\n * Whether `x` is one of `xs` from index `i` on (JS `xs.includes(x)` at i = 0).\n *\n * @ensures result ⟺ ∃ k. i ≤ k < |xs| ∧ xs[k] = x — exactly the model's HasItemFrom\n */\nexport function hasItemFrom(xs: string[], x: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= xs.length\n //@ decreases xs.length - i\n //@ ensures \\result <==> exists(k: nat, i <= k && k < xs.length && xs[k] === x)\n // `===`, not `>=`: past the end xs[i] is undefined, never x, so `>=` vs `>` is equivalent\n if (i === xs.length) return false;\n if ((xs[i] as string) === x) return true;\n return hasItemFrom(xs, x, i + 1);\n}\n\n/**\n * Whether the number `x` is one of `xs` from index `i` on (JS `xs.includes(x)` at i = 0, for\n * numbers).\n *\n * @ensures result ⟺ ∃ k. i ≤ k < |xs| ∧ xs[k] = x — exactly the model's HasNumberFrom\n */\nexport function hasNumberFrom(xs: number[], x: number, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= xs.length\n //@ decreases xs.length - i\n //@ ensures \\result <==> exists(k: nat, i <= k && k < xs.length && xs[k] === x)\n if (i === xs.length) return false;\n if ((xs[i] as number) === x) return true;\n return hasNumberFrom(xs, x, i + 1);\n}\n\n/**\n * Whether `s` ends with one of `xs` from index `i` on (a regex `(a|b|…)$` at i = 0).\n *\n * @ensures exactly the model's EndsWithAnyFrom\n */\nexport function endsWithAnyFrom(s: string, xs: string[], i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= xs.length\n //@ decreases xs.length - i\n //@ ensures \\result <==> exists(k: nat, i <= k && k < xs.length && endsWith(s, xs[k]))\n if (i === xs.length) return false;\n if (endsWith(s, xs[i] as string)) return true;\n return endsWithAnyFrom(s, xs, i + 1);\n}\n\n/**\n * Whether one of `xs` from index `i` on occurs in `s` (a regex `(a|b|…)` at i = 0).\n *\n * @ensures exactly the model's IncludesAnyFrom\n */\nexport function includesAnyFrom(s: string, xs: string[], i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= xs.length\n //@ decreases xs.length - i\n //@ ensures \\result <==> exists(k: nat, i <= k && k < xs.length && includesFrom(s, xs[k], 0))\n if (i === xs.length) return false;\n if (includesFrom(s, xs[i] as string, 0)) return true;\n return includesAnyFrom(s, xs, i + 1);\n}\n\n/**\n * The items of `xs` from index `i` that `allowed` doesn't hold, in order (JS\n * `xs.filter((x) => !allowed.includes(x))` at i = 0).\n *\n * @ensures exactly the model's NotInFrom (NotInFromIsTheUnknown: the unknown ones, all of them)\n */\nexport function notInFrom(xs: string[], allowed: string[], i: number): string[] {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases xs.length - i\n //@ ensures i >= xs.length ==> \\result.length === 0\n if (i >= xs.length) return [];\n const rest = notInFrom(xs, allowed, i + 1);\n return hasItemFrom(allowed, xs[i] as string, 0) ? rest : [xs[i] as string, ...rest];\n}\n\n/**\n * Whether `x` is one of the first `k` items of `xs` (JS `xs.slice(0, k).includes(x)`).\n *\n * @ensures result ⟺ ∃ j < k. xs[j] = x — exactly the model's HasItemBelow\n */\nexport function hasItemBelow(xs: string[], x: string, k: number): boolean {\n //@ verify\n //@ type k nat\n //@ requires k >= 0 && k <= xs.length\n //@ decreases k\n //@ ensures \\result <==> exists(j: nat, j < k && xs[j] === x)\n if (k === 0) return false;\n if ((xs[k - 1] as string) === x) return true;\n return hasItemBelow(xs, x, k - 1);\n}\n\n/**\n * The items of `xs` from index `i` that repeat an earlier item, in order (at i = 0, every\n * duplicate after its first; none ⟺ the items are unique).\n *\n * @ensures exactly the model's RepeatsFrom (RepeatsFromEmpty: none exactly when unique)\n */\nexport function repeatsFrom(xs: string[], i: number): string[] {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases xs.length - i\n //@ ensures i >= xs.length ==> \\result.length === 0\n if (i >= xs.length) return [];\n const rest = repeatsFrom(xs, i + 1);\n return hasItemBelow(xs, xs[i] as string, i) ? [xs[i] as string, ...rest] : rest;\n}\n\n/**\n * The items of `xs` from index `i` that no earlier item repeats, in order (at i = 0, JS\n * `[...new Set(xs)]`: each item once, first occurrence kept).\n *\n * @ensures exactly the model's FirstsFrom\n */\nexport function firstsFrom(xs: string[], i: number): string[] {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases xs.length - i\n //@ ensures i >= xs.length ==> \\result.length === 0\n //@ ensures forall(j: nat, forall(k: nat, (j < k && k < \\result.length) ==> \\result[j] !== \\result[k]))\n if (i >= xs.length) return [];\n const rest = firstsFrom(xs, i + 1);\n return hasItemBelow(xs, xs[i] as string, i) ? rest : [xs[i] as string, ...rest];\n}\n\n/**\n * At most the first `n` items (JS `xs.slice(0, n)` for n ≥ 0).\n *\n * @ensures exactly the model's TakeAtMost\n */\nexport function takeAtMost(xs: string[], n: number): string[] {\n //@ verify\n //@ type n nat\n //@ requires n >= 0\n //@ ensures \\result === (n < xs.length ? xs.slice(0, n) : xs)\n return n < xs.length ? xs.slice(0, n) : xs;\n}\n\n/**\n * Whether two number lists are equal from index `i` on (the whole lists at i = 0).\n *\n * @ensures result ⟺ |a| = |b| ∧ ∀ k ∈ [i, |a|). a[k] = b[k] — exactly the model's\n * SameNumbersFrom\n */\nexport function sameNumbersFrom(a: number[], b: number[], i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= a.length\n //@ decreases a.length - i\n //@ ensures \\result <==> (a.length === b.length && forall(k: nat, i <= k && k < a.length ==> a[k] === b[k]))\n if (a.length !== b.length) return false;\n if (i === a.length) return true;\n return (a[i] as number) === (b[i] as number) && sameNumbersFrom(a, b, i + 1);\n}\n\n/**\n * Whether two text lists are equal from index `i` on (the whole lists at i = 0, as their\n * `JSON.stringify` texts compare).\n *\n * @ensures result ⟺ |a| = |b| ∧ ∀ k ∈ [i, |a|). a[k] = b[k] — exactly the model's\n * SameTextsFrom\n */\nexport function sameTextsFrom(a: string[], b: string[], i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= a.length\n //@ decreases a.length - i\n //@ ensures \\result <==> (a.length === b.length && forall(k: nat, i <= k && k < a.length ==> a[k] === b[k]))\n if (a.length !== b.length) return false;\n if (i === a.length) return true;\n return (a[i] as string) === (b[i] as string) && sameTextsFrom(a, b, i + 1);\n}\n\n/**\n * The texts in code-unit order (JS's default `sort`, stable: of two equal texts the earlier\n * stays first).\n *\n * @ensures exactly the model's SortedTexts (in the link); the same length\n */\nexport function sortedTexts(xs: string[]): string[] {\n //@ verify\n //@ ensures \\result.length === xs.length\n if (xs.length === 0) return [];\n return insertText(xs[0] as string, sortedTexts(xs.slice(1)));\n}\n\n/**\n * `x` placed into sorted texts before the first it doesn't sort after.\n *\n * @ensures exactly the model's InsertText (in the link); one longer\n */\nexport function insertText(x: string, sorted: string[]): string[] {\n //@ verify\n //@ ensures \\result.length === sorted.length + 1\n if (sorted.length === 0) return [x];\n const first = sorted[0] as string;\n if (compareFrom(x, first, 0) <= 0) return [x, ...sorted];\n return [first, ...insertText(x, sorted.slice(1))];\n}\n","//@ backend dafny\nimport { seconds, toMillis } from \"@atlas/foundation/duration\";\nimport { joinFrom } from \"@atlas/utils/lists\";\nimport { indexOfCode } from \"@atlas/utils/strings\";\nimport type { Millis } from \"./duration\";\n\n/* The hooks' decisions, as pure functions verified with LemmaScript → Dafny (model:\n models/AugurHooks.dfy; link: models/links/augur-hooks-rules.dfy). The hooks keep the React\n state, timers and storage; a NaN or string uid is turned into a number or `undefined` by the\n caller before it gets here. */\n\n/**\n * The cart's quantity total: `acc` plus each quantity from index `i` on, added left to right as\n * `reduce` does (each line's quantity, null or NaN as 0, already taken by the caller).\n *\n * @ensures result = acc + Σ_{k ≥ i} quantities[k], the model's QuantityTotal at acc = i = 0\n */\nexport function quantityTotalFrom(quantities: number[], i: number, acc: number): number {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= quantities.length\n //@ decreases quantities.length - i\n //@ ensures i === quantities.length ==> \\result === acc\n //@ ensures i < quantities.length ==> \\result === quantityTotalFrom(quantities, i + 1, acc + quantities[i])\n if (i === quantities.length) return acc;\n return quantityTotalFrom(quantities, i + 1, acc + (quantities[i] as number));\n}\n\n/**\n * A cart line's quantity with null as 0.\n *\n * @ensures result = q ?? 0, the model's QtyOrZero\n */\nexport function qtyOrZero(q: number | null): number {\n //@ verify\n //@ ensures q === null ==> \\result === 0\n //@ ensures q !== null ==> \\result === q\n if (q === null) return 0;\n return q;\n}\n\n/**\n * The first index from `i` whose item uid is `uid`, or −1 (JS `findIndex` at i = 0).\n *\n * @ensures exactly the model's IndexOfUid\n */\nexport function indexOfUidFrom(uids: number[], uid: number, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= uids.length\n //@ decreases uids.length - i\n //@ ensures i === uids.length ==> \\result === -1\n //@ ensures i < uids.length && uids[i] === uid ==> \\result === i\n //@ ensures i < uids.length && uids[i] !== uid ==> \\result === indexOfUidFrom(uids, uid, i + 1)\n if (i === uids.length) return -1;\n if ((uids[i] as number) === uid) return i;\n return indexOfUidFrom(uids, uid, i + 1);\n}\n\n/**\n * Reversing an add keeps a matched line only while something is left of it.\n *\n * @ensures result ⟺ (current ?? 0) − q > 0, the model's ReverseAdd keep rule\n */\nexport function keepsAfterReverse(current: number | null, q: number): boolean {\n //@ verify\n //@ ensures \\result === (qtyOrZero(current) - q > 0)\n return qtyOrZero(current) - q > 0;\n}\n\n/**\n * requireCartUid: a missing or 0 uid refuses (null); the hooks throw on it.\n *\n * @ensures result = null ⟺ uid ∈ {undefined, 0}; otherwise result = uid\n */\nexport function requiredCartUid(uid: number | undefined): number | null {\n //@ verify\n //@ ensures uid === undefined ==> \\result === null\n //@ ensures uid !== undefined && uid === 0 ==> \\result === null\n //@ ensures uid !== undefined && uid !== 0 ==> \\result === uid\n if (uid === undefined) return null;\n if (uid === 0) return null;\n return uid;\n}\n\n/**\n * resolveCartHdrUid (checkout): a missing uid is 0; any other passes unchanged.\n *\n * @ensures result = uid ?? 0\n */\nexport function checkoutCartUid(uid: number | undefined): number {\n //@ verify\n //@ ensures uid === undefined ==> \\result === 0\n //@ ensures uid !== undefined ==> \\result === uid\n if (uid === undefined) return 0;\n return uid;\n}\n\n/**\n * The initial payment method: the site hook's non-empty answer, else credit card when payments\n * are configured, else invoice.\n *\n * @ensures exactly the model's DefaultPaymentMethod\n */\nexport function defaultPaymentMethodOf(\n fromHook: string | undefined,\n hasCallbacks: boolean,\n): string {\n //@ verify\n //@ ensures fromHook !== undefined && fromHook !== \"\" ==> \\result === fromHook\n //@ ensures (fromHook === undefined || fromHook === \"\") && hasCallbacks ==> \\result === \"credit-card\"\n //@ ensures (fromHook === undefined || fromHook === \"\") && !hasCallbacks ==> \\result === \"invoice\"\n if (fromHook !== undefined && fromHook !== \"\") return fromHook;\n return hasCallbacks ? \"credit-card\" : \"invoice\";\n}\n\n/** The default order gates' inputs, each already reduced to a flag by the caller. */\nexport interface ReadinessFlags {\n cartUidSet: boolean;\n editShippingInfo: boolean;\n editShippingMethods: boolean;\n editBillingInfo: boolean;\n editCc: boolean;\n hasShippingAddress: boolean;\n hasBillingAddress: boolean;\n methodSaved: boolean;\n showBillingSummary: boolean;\n processing: boolean;\n isCreditCard: boolean;\n hasAccountId: boolean;\n hasUnifiedBilling: boolean;\n isFreeShipping: boolean;\n hasShippingFee: boolean;\n}\n\n/**\n * The default gates: a cart, nothing being edited, both addresses, a saved method, the billing\n * summary shown, not processing, a completed card flow for credit card, and a fee unless\n * shipping is free.\n *\n * @ensures exactly the model's DefaultReady\n */\nexport function defaultReady(r: ReadinessFlags): boolean {\n //@ verify\n //@ ensures \\result === (nothingBusy(r) && detailsComplete(r) && paymentSettled(r))\n return nothingBusy(r) && detailsComplete(r) && paymentSettled(r);\n}\n\n/**\n * No section is being edited and no order is processing.\n *\n * @ensures result ⟺ ¬edit* ∧ ¬processing\n */\nfunction nothingBusy(r: ReadinessFlags): boolean {\n //@ verify\n //@ ensures \\result === (!r.editShippingInfo && !r.editShippingMethods && !r.editBillingInfo && !r.editCc && !r.processing)\n return (\n !r.editShippingInfo &&\n !r.editShippingMethods &&\n !r.editBillingInfo &&\n !r.editCc &&\n !r.processing\n );\n}\n\n/**\n * A cart, both addresses, a saved method and the billing summary shown.\n *\n * @ensures result ⟺ the cart and checkout details are all present\n */\nfunction detailsComplete(r: ReadinessFlags): boolean {\n //@ verify\n //@ ensures \\result === (r.cartUidSet && r.hasShippingAddress && r.hasBillingAddress && r.methodSaved && r.showBillingSummary)\n return (\n r.cartUidSet &&\n r.hasShippingAddress &&\n r.hasBillingAddress &&\n r.methodSaved &&\n r.showBillingSummary\n );\n}\n\n/**\n * A completed card flow for credit card, and a fee unless shipping is free.\n *\n * @ensures result ⟺ (card ⟹ account ∧ unified) ∧ (free ∨ fee)\n */\nfunction paymentSettled(r: ReadinessFlags): boolean {\n //@ verify\n //@ ensures \\result === ((!r.isCreditCard || (r.hasAccountId && r.hasUnifiedBilling)) && (r.isFreeShipping || r.hasShippingFee))\n return (\n (!r.isCreditCard || (r.hasAccountId && r.hasUnifiedBilling)) &&\n (r.isFreeShipping || r.hasShippingFee)\n );\n}\n\n/**\n * A site's own readiness answer wins; undefined defers to the default gates.\n *\n * @ensures result = custom ?? defaultReady\n */\nexport function orderReadyOf(custom: boolean | undefined, ready: boolean): boolean {\n //@ verify\n //@ ensures custom !== undefined ==> \\result === custom\n //@ ensures custom === undefined ==> \\result === ready\n if (custom !== undefined) return custom;\n return ready;\n}\n\n/** The pre-submit outcome: go ahead, the site cancelled it, or refused with a message. */\nexport type PreSubmit =\n { kind: \"ok\" } | { kind: \"cancelled\" } | { kind: \"refused\"; message: string };\n\n/**\n * runPreSubmitChecks: the site's validation error first (an empty one is no error), then its\n * beforeSubmit veto, then a missing shipping address.\n *\n * @ensures exactly the model's PreSubmitOutcome (an empty validation error as None)\n */\nexport function preSubmitOutcome(\n validateError: string | undefined,\n beforeSubmitFalse: boolean,\n hasShippingAddress: boolean,\n): PreSubmit {\n //@ verify\n //@ ensures validateError !== undefined && validateError !== \"\" ==> \\result.kind === \"refused\" && \\result.message === validateError\n //@ ensures (validateError === undefined || validateError === \"\") && beforeSubmitFalse ==> \\result.kind === \"cancelled\"\n //@ ensures (validateError === undefined || validateError === \"\") && !beforeSubmitFalse && !hasShippingAddress ==> \\result.kind === \"refused\" && \\result.message === \"Shipping address is required.\"\n //@ ensures (validateError === undefined || validateError === \"\") && !beforeSubmitFalse && hasShippingAddress ==> \\result.kind === \"ok\"\n if (validateError !== undefined && validateError !== \"\") {\n return { kind: \"refused\", message: validateError };\n }\n if (beforeSubmitFalse) return { kind: \"cancelled\" };\n if (!hasShippingAddress) return { kind: \"refused\", message: \"Shipping address is required.\" };\n return { kind: \"ok\" };\n}\n\n/**\n * A cookie entry's `split(\"=\")[1]`: the text between the first and second \"=\" (to the end with\n * no second), or \"\" with no \"=\". A token holding \"=\" is cut at it, as before.\n *\n * @ensures exactly the model's SecondEqualsField\n */\nexport function secondEqualsField(s: string): string {\n //@ verify\n //@ ensures indexOfCode(s, 61, 0) < 0 ==> \\result === \"\"\n //@ ensures indexOfCode(s, 61, 0) >= 0 && indexOfCode(s, 61, indexOfCode(s, 61, 0) + 1) < 0 ==> \\result === s.slice(indexOfCode(s, 61, 0) + 1)\n //@ ensures indexOfCode(s, 61, 0) >= 0 && indexOfCode(s, 61, indexOfCode(s, 61, 0) + 1) >= 0 ==> \\result === s.slice(indexOfCode(s, 61, 0) + 1, indexOfCode(s, 61, indexOfCode(s, 61, 0) + 1))\n const k = indexOfCode(s, 61, 0);\n if (k < 0) return \"\";\n const j = indexOfCode(s, 61, k + 1);\n if (j < 0) return s.slice(k + 1);\n return s.slice(k + 1, j);\n}\n\n/**\n * A saved checkout entry is expired once more than `ttl` has passed since it was saved (all\n * three `Millis`: the clock, the saved-at reading, the duration).\n *\n * @ensures result ⟺ now − savedAt > ttl\n */\nexport function isExpired(now: Millis, savedAt: Millis, ttl: Millis): boolean {\n //@ verify\n //@ ensures \\result === (now - savedAt > ttl)\n return now - savedAt > ttl;\n}\n\n/**\n * A query is persisted iff it has a string head that is listed and it succeeded.\n *\n * @ensures exactly the model's ShouldPersist, with the listing already looked up\n */\nexport function shouldPersistOf(hasHead: boolean, succeeded: boolean, listed: boolean): boolean {\n //@ verify\n //@ ensures \\result === (hasHead && succeeded && listed)\n return hasHead && succeeded && listed;\n}\n\n/**\n * 2ⁿ.\n *\n * @ensures result = 2ⁿ, the model's Pow2\n */\nexport function pow2(n: number): number {\n //@ verify\n //@ type n nat\n //@ requires n >= 0\n //@ decreases n\n //@ ensures n === 0 ==> \\result === 1\n //@ ensures n > 0 ==> \\result === 2 * pow2(n - 1)\n if (n === 0) return 1;\n return 2 * pow2(n - 1);\n}\n\n/**\n * A stock fetch's retry delay: 2ⁿ seconds, at most 10 s (n ≥ 4 is always the cap), as\n * React Query's `Millis`.\n *\n * @ensures exactly the model's StockRetryDelay\n */\nexport function stockRetryDelay(attemptIndex: number): Millis {\n //@ verify\n //@ type attemptIndex nat\n //@ requires attemptIndex >= 0\n //@ ensures 1000 * pow2(attemptIndex) < 10000 ==> \\result === 1000 * pow2(attemptIndex)\n //@ ensures 1000 * pow2(attemptIndex) >= 10000 ==> \\result === 10000\n // The cap first (2⁴ s already exceeds it), then 2ⁿ s written out: inside the function the\n // prover can't see that the recursive pow2 is never negative, which `seconds` needs.\n if (attemptIndex >= 4) return toMillis(seconds(10));\n if (attemptIndex === 3) return toMillis(seconds(8));\n if (attemptIndex === 2) return toMillis(seconds(4));\n if (attemptIndex === 1) return toMillis(seconds(2));\n return toMillis(seconds(1));\n}\n\n/**\n * useStock fetches only when enabled (default true) and given a uid.\n *\n * @ensures exactly the model's StockEnabled\n */\nexport function stockEnabled(enabled: boolean | undefined, uidSet: boolean): boolean {\n //@ verify\n //@ ensures \\result === ((enabled === undefined || enabled === true) && uidSet)\n return (enabled === undefined || enabled === true) && uidSet;\n}\n\n/**\n * How many of a React Query key's segments from `i` on are text, up to the first that isn't (the\n * key is the method path's segments, then the call's arguments: augur-core `buildQueryKey`), so\n * the leading ones are its path (atlas#102, `clearUserReadsOnWrite`).\n *\n * @ensures exactly the model's LeadingTextsFrom\n */\nexport function leadingTextsFrom(isText: boolean[], i: number): number {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases isText.length - i\n //@ ensures \\result >= 0\n if (i >= isText.length || !isText[i]) return 0;\n return 1 + leadingTextsFrom(isText, i + 1);\n}\n\n/**\n * A query key's method path: its first `n` segments (the leading text ones,\n * `leadingTextsFrom`) joined by \".\" (utils' proved joinFrom).\n *\n * @ensures exactly the model's KeyPathFrom\n */\nexport function keyPathFrom(texts: string[], n: number): string {\n //@ verify\n //@ type n nat\n //@ requires n >= 0 && n <= texts.length\n //@ ensures \\result === joinFrom(texts.slice(0, n), \".\", 0)\n return joinFrom(texts.slice(0, n), \".\", 0);\n}\n","\"use client\";\n\nimport { millis, millisOf, minutes, toMillis } from \"@simpleapps-com/augur-utils\";\nimport { useEffect, useRef } from \"react\";\nimport type { Millis } from \"../duration\";\nimport { isExpired } from \"../rules\";\n\n/** A single persisted field with its storage key and optional TTL. */\nexport interface CheckoutPersistField<T> {\n key: string;\n value: T;\n set: (value: T) => void;\n /** Valibot or custom validator. Return the parsed value or throw to reject. */\n validate?: (raw: unknown) => T;\n /** TTL (e.g. `toMillis(minutes(30))`). Default: 30 minutes. */\n ttl?: Millis;\n}\n\ninterface StorageEntry {\n value: unknown;\n /** The clock when saved; read back from storage, so checked by `millisOf`. */\n savedAt: number;\n}\n\nconst DEFAULT_TTL = toMillis(minutes(30));\n\n/**\n * Saves a value to sessionStorage with a timestamp for TTL expiration.\n *\n * Fails silently on storage errors (private browsing, quota exceeded).\n */\nexport function saveToSession(key: string, value: unknown): void {\n try {\n const entry: StorageEntry = { value, savedAt: millis(Date.now()) };\n sessionStorage.setItem(key, JSON.stringify(entry));\n } catch {\n // sessionStorage unavailable (private browsing, quota)\n }\n}\n\n/**\n * Loads a value from sessionStorage, checking TTL and optionally validating.\n *\n * Returns null if missing, expired, invalid, or storage is unavailable.\n * Cleans up expired entries automatically.\n */\nexport function loadFromSession<T>(\n key: string,\n ttl: Millis = DEFAULT_TTL,\n validate?: (raw: unknown) => T,\n): T | null {\n try {\n const raw = sessionStorage.getItem(key);\n if (!raw) return null;\n\n const entry = JSON.parse(raw) as StorageEntry;\n // A savedAt that is no clock reading (edited or corrupt storage) counts as the epoch: expired\n const savedAt = millisOf(entry.savedAt) ?? millis(0);\n if (isExpired(millis(Date.now()), savedAt, ttl)) {\n sessionStorage.removeItem(key);\n return null;\n }\n\n if (validate) {\n return validate(entry.value);\n }\n return entry.value as T;\n } catch {\n sessionStorage.removeItem(key);\n return null;\n }\n}\n\n/** Removes a checkout persistence key from sessionStorage. */\nexport function clearFromSession(key: string): void {\n try {\n sessionStorage.removeItem(key);\n } catch {\n // ignore\n }\n}\n\n/**\n * Hook that persists checkout state fields to sessionStorage and restores on mount.\n *\n * Each field is saved when its value changes and restored once on initial mount.\n * Validates restored values against an optional schema to guard against\n * corrupted or stale storage. Expired entries (past TTL) are discarded.\n */\nexport function useCheckoutPersistence(fields: CheckoutPersistField<unknown>[]): void {\n // Restore on mount (once). Capture fields in a ref so the effect has no deps.\n const fieldsRef = useRef(fields);\n fieldsRef.current = fields;\n\n useEffect(() => {\n for (const field of fieldsRef.current) {\n const restored = loadFromSession(field.key, field.ttl ?? DEFAULT_TTL, field.validate);\n if (restored !== null) {\n field.set(restored);\n }\n }\n }, []);\n\n // Save on change -- serialized values as dependency to avoid dynamic dep arrays; the\n // fields themselves are read through the ref (this render's array)\n const serialized = JSON.stringify(fields.map((f) => [f.key, f.value]));\n useEffect(() => {\n for (const field of fieldsRef.current) {\n if (field.value !== undefined && field.value !== null) {\n saveToSession(field.key, field.value);\n }\n }\n }, [serialized]);\n}\n\n/**\n * Clears all checkout persistence keys from sessionStorage.\n *\n * Call after successful order submission to prevent stale data on next checkout.\n */\nexport function clearCheckoutPersistence(keys: string[]): void {\n for (const key of keys) {\n clearFromSession(key);\n }\n}\n","import { useCallback, useEffect, useRef, useState } from \"react\";\nimport type { Dispatch, SetStateAction } from \"react\";\nimport type {\n TTransactionSetup,\n TCardInfo,\n TPaymentValidation,\n TAccountQuery,\n TBillingUpdate,\n} from \"@simpleapps-com/augur-utils\";\nimport { saveToSession, loadFromSession, clearFromSession } from \"./use-checkout-persistence\";\n\n/** Site-specific payment action callbacks injected into usePaymentFlow. */\nexport interface PaymentFlowCallbacks {\n /** Initialize a payment session. Returns transaction setup or undefined on failure. */\n transactionSetup: (params: { customerId: string }) => Promise<TTransactionSetup | undefined>;\n /** Retrieve card details after iframe entry. */\n cardInfo: (params: { transactionSetupId: string }) => Promise<TCardInfo | undefined>;\n /** Verify card is valid. */\n validatePayment: (params: {\n transactionSetupId: string;\n customerId: string;\n }) => Promise<TPaymentValidation | undefined>;\n /** Get payment account ID. */\n accountQuery: (params: {\n transactionSetupId: string;\n customerId: string;\n }) => Promise<TAccountQuery | undefined>;\n /** Send billing address to payment processor. */\n billingUpdate: (params: {\n transactionSetupId: string;\n address1: string;\n address2?: string;\n city: string;\n state: string;\n zip: string;\n }) => Promise<TBillingUpdate | undefined>;\n /** Optional toast notification callback. */\n toast?: {\n error?: (message: string) => void;\n };\n}\n\n/** Billing address shape accepted by the payment flow. */\nexport interface PaymentBillingAddress {\n address1: string;\n address2?: string;\n city: string;\n state: string;\n postalCode: string;\n}\n\ninterface UsePaymentFlowParams {\n callbacks: PaymentFlowCallbacks;\n customerId: string | number | undefined;\n billingAddress: PaymentBillingAddress | undefined;\n paymentMethod: string;\n shippingAccepted: boolean;\n /** Persist payment tokens to sessionStorage for cross-navigation recovery. */\n persistPayment?: boolean;\n}\n\n/** sessionStorage key for persisted payment tokens. */\nexport const PAYMENT_STORAGE_KEY = \"checkout:payment\";\n\n/** Shape of persisted payment data. Only token IDs, never card data (PCI-DSS). */\ninterface PersistedPayment {\n transactionSetupId: string;\n uiEndpoint: string;\n paymentAccountId: string;\n}\n\n/** State and setters returned by usePaymentFlow. */\ninterface PaymentFlow {\n isOpen: boolean;\n setIsOpen: Dispatch<SetStateAction<boolean>>;\n editCc: boolean;\n setEditCc: Dispatch<SetStateAction<boolean>>;\n unified: TTransactionSetup | null;\n unifiedCc: TCardInfo | null;\n unifiedResponse: boolean;\n unifiedBilling: boolean;\n unifiedPayment: TAccountQuery | null;\n capturedBin: string | null;\n handleBinCapture: (bin: string) => void;\n}\n\nfunction toastError(callbacks: PaymentFlowCallbacks, message: string): void {\n callbacks.toast?.error?.(message);\n}\n\n/** The account with the BIN captured from the iframe when the processor sent none. */\nfunction withCapturedBin(account: TAccountQuery, capturedBin: string | null): TAccountQuery {\n return capturedBin && !account.Bin ? { ...account, Bin: capturedBin } : account;\n}\n\n/** The tokens to persist: only when persisting is on and the processor returned an account ID. */\nfunction paymentToPersist(\n transactionSetupId: string,\n uiEndpoint: TTransactionSetup[\"uiEndpoint\"],\n account: TAccountQuery,\n persistPayment: boolean | undefined,\n): PersistedPayment | null {\n if (!persistPayment || !account.PaymentAccountID) return null;\n return {\n transactionSetupId,\n uiEndpoint,\n paymentAccountId: account.PaymentAccountID,\n };\n}\n\n/** A saved payment is restorable when all three tokens are present. */\nfunction isRestorable(saved: PersistedPayment | null | undefined): saved is PersistedPayment {\n return Boolean(saved?.transactionSetupId && saved.uiEndpoint && saved.paymentAccountId);\n}\n\n/**\n * Manages the full Element/Unified payment lifecycle:\n * transactionSetup -> cardInfo -> validatePayment -> accountQuery -> billingUpdate\n *\n * Accepts site-specific server action callbacks so the hook has no dependency\n * on any particular server action implementation.\n *\n * @example\n * ```tsx\n * import { usePaymentFlow } from \"@simpleapps-com/augur-hooks\";\n * import { transactionSetup, cardInfo, validatePayment, accountQuery, billingUpdate } from \"@/lib/actions/payments\";\n *\n * const payment = usePaymentFlow({\n * callbacks: { transactionSetup, cardInfo, validatePayment, accountQuery, billingUpdate },\n * customerId,\n * billingAddress,\n * paymentMethod: \"credit-card\",\n * shippingAccepted: true,\n * });\n * ```\n */\nexport function usePaymentFlow({\n callbacks,\n customerId,\n billingAddress,\n paymentMethod,\n shippingAccepted,\n persistPayment,\n}: UsePaymentFlowParams): PaymentFlow {\n const [isOpen, setIsOpen] = useState(false);\n const [unified, setUnified] = useState<TTransactionSetup | null>(null);\n const [unifiedCc, setUnifiedCc] = useState<TCardInfo | null>(null);\n const [unifiedResponse, setUnifiedResponse] = useState(false);\n const [unifiedBilling, setUnifiedBilling] = useState(false);\n const [unifiedPayment, setUnifiedPayment] = useState<TAccountQuery | null>(null);\n const [capturedBin, setCapturedBin] = useState<string | null>(null);\n const [editCc, setEditCc] = useState(false);\n\n const handleBinCapture = useCallback((bin: string) => {\n setCapturedBin(bin);\n }, []);\n\n // Ref ensures callbacks always read the latest customerId, avoiding stale\n // closures when React batches state updates (e.g., modal close + verify).\n const customerIdRef = useRef(customerId);\n customerIdRef.current = customerId;\n\n // @invariant verifyUnified runs at most once per transactionSetupId\n // (hasVerifiedRef.current ∈ {null} ∪ {setupId already verified}; a fresh\n // setupId ⇒ exactly one verify). Without this, the post-close verify effect\n // re-fires whenever the consumer's inline `callbacks` prop changes identity\n // (every parent render), spraying redundant validatePayment/cardInfo calls\n // at the payment gateway. Keyed by setupId, not a boolean, so a new setup\n // (edit-card) re-verifies while a restored setup is treated as done.\n const hasVerifiedRef = useRef<string | null>(null);\n\n // Step 1: Initialize payment session\n const postUnified = useCallback(async () => {\n if (!customerIdRef.current) return;\n try {\n const result = await callbacks.transactionSetup({\n customerId: String(customerIdRef.current),\n });\n if (!result) {\n toastError(callbacks, \"Unable to initialize payment. Please try again.\");\n return;\n }\n setUnified(result);\n } catch (error) {\n console.error(\"transactionSetup failed:\", error);\n toastError(callbacks, \"Unable to initialize payment. Please try again.\");\n }\n }, [callbacks]);\n\n // Step 2: Get card info after iframe entry (called by verifyUnified with its setup ID)\n const getCardInfo = useCallback(\n async (transactionSetupId: string) => {\n try {\n const result = await callbacks.cardInfo({ transactionSetupId });\n if (!result) {\n toastError(callbacks, \"Unable to verify card details. Please try again.\");\n return;\n }\n setUnifiedCc(result);\n } catch (error) {\n console.error(\"cardInfo failed:\", error);\n toastError(callbacks, \"Unable to verify card details. Please try again.\");\n }\n },\n [callbacks],\n );\n\n // Step 3: Validate payment\n const verifyUnified = useCallback(async () => {\n const transactionSetupId = unified?.transactionSetupId;\n if (!transactionSetupId || !customerIdRef.current) return;\n try {\n const result = await callbacks.validatePayment({\n transactionSetupId,\n customerId: String(customerIdRef.current),\n });\n if (result === undefined) {\n toastError(callbacks, \"Payment verification failed. Please try again.\");\n return;\n }\n setUnifiedResponse(result);\n if (result) {\n await getCardInfo(transactionSetupId);\n }\n } catch (error) {\n console.error(\"validatePayment failed:\", error);\n toastError(callbacks, \"Payment verification failed. Please try again.\");\n }\n }, [unified, getCardInfo, callbacks]);\n\n // Step 4: Get payment account info\n const getUnifiedPayment = useCallback(async () => {\n if (!unified?.transactionSetupId || !customerIdRef.current) return;\n try {\n const result = await callbacks.accountQuery({\n transactionSetupId: unified.transactionSetupId,\n customerId: String(customerIdRef.current),\n });\n if (!result) {\n toastError(callbacks, \"Unable to retrieve payment account. Please try again.\");\n return;\n }\n setUnifiedPayment(withCapturedBin(result, capturedBin));\n const toPersist = paymentToPersist(\n unified.transactionSetupId,\n unified.uiEndpoint,\n result,\n persistPayment,\n );\n if (toPersist) saveToSession(PAYMENT_STORAGE_KEY, toPersist);\n } catch (error) {\n console.error(\"accountQuery failed:\", error);\n toastError(callbacks, \"Unable to retrieve payment account. Please try again.\");\n }\n }, [unified, capturedBin, callbacks, persistPayment]);\n\n // Step 5: Update billing info (called by the billing effect with the setup ID and address)\n const updateUnifiedBilling = useCallback(\n async (transactionSetupId: string, address: PaymentBillingAddress) => {\n try {\n const result = await callbacks.billingUpdate({\n transactionSetupId,\n address1: address.address1,\n address2: address.address2,\n city: address.city,\n state: address.state,\n zip: address.postalCode,\n });\n if (!result) {\n toastError(callbacks, \"Billing update failed. Please try again.\");\n return;\n }\n setUnifiedBilling(true);\n void getUnifiedPayment();\n } catch (error) {\n console.error(\"billingUpdate failed:\", error);\n toastError(callbacks, \"Billing update failed. Please try again.\");\n }\n },\n [getUnifiedPayment, callbacks],\n );\n\n // Close payment modal if preconditions are lost\n useEffect(() => {\n if (isOpen && (!shippingAccepted || paymentMethod !== \"credit-card\")) {\n setIsOpen(false);\n }\n }, [isOpen, shippingAccepted, paymentMethod]);\n\n // Initialize payment setup when modal opens with no transaction\n useEffect(() => {\n if (isOpen && shippingAccepted && paymentMethod === \"credit-card\" && unified === null) {\n void postUnified();\n }\n }, [isOpen, shippingAccepted, paymentMethod, unified, postUnified]);\n\n // Verify payment after modal closes. Guard by transactionSetupId so the\n // effect verifies once per setup instead of re-firing on every parent render\n // (the consumer's inline `callbacks` prop churns verifyUnified's identity).\n useEffect(() => {\n const setupId = unified?.transactionSetupId;\n if (!isOpen && setupId && shippingAccepted && paymentMethod === \"credit-card\") {\n if (hasVerifiedRef.current === setupId) return;\n hasVerifiedRef.current = setupId;\n void verifyUnified();\n }\n }, [isOpen, unified, shippingAccepted, paymentMethod, verifyUnified]);\n\n // Trigger billing update when card verified + billing address ready (against the current\n // setup; there is nothing to update without one)\n const setupId = unified?.transactionSetupId;\n useEffect(() => {\n if (\n unifiedResponse &&\n billingAddress !== undefined &&\n unifiedCc?.transactionSetupId &&\n paymentMethod === \"credit-card\" &&\n setupId\n ) {\n void updateUnifiedBilling(setupId, billingAddress);\n }\n }, [\n unifiedResponse,\n billingAddress,\n unifiedCc?.transactionSetupId,\n updateUnifiedBilling,\n paymentMethod,\n setupId,\n ]);\n\n // Reset all payment state when editing CC\n useEffect(() => {\n if (editCc) {\n setIsOpen(true);\n setUnified(null);\n setUnifiedCc(null);\n setUnifiedPayment(null);\n setUnifiedBilling(false);\n setUnifiedResponse(false);\n setCapturedBin(null);\n hasVerifiedRef.current = null;\n if (persistPayment) {\n clearFromSession(PAYMENT_STORAGE_KEY);\n }\n }\n }, [editCc, persistPayment]);\n\n // Restore persisted payment tokens on mount\n const restorePayment = useCallback(async () => {\n if (!customerIdRef.current) return;\n\n const saved = loadFromSession<PersistedPayment>(PAYMENT_STORAGE_KEY);\n if (!isRestorable(saved)) return;\n\n const { transactionSetupId, uiEndpoint } = saved;\n try {\n const account = await callbacks.accountQuery({\n transactionSetupId,\n customerId: String(customerIdRef.current),\n });\n if (!account?.PaymentAccountID) {\n clearFromSession(PAYMENT_STORAGE_KEY);\n return;\n }\n // Restore already proved this setup valid (accountQuery succeeded);\n // mark it verified so the post-close effect does not re-validate it.\n hasVerifiedRef.current = transactionSetupId;\n setUnified({ transactionSetupId, uiEndpoint });\n setUnifiedPayment(account);\n setUnifiedResponse(true);\n setUnifiedBilling(true);\n const card = await callbacks.cardInfo({ transactionSetupId });\n if (card) setUnifiedCc(card);\n } catch {\n clearFromSession(PAYMENT_STORAGE_KEY);\n }\n }, [callbacks]);\n\n // Restore runs when persistPayment turns on (and on mount), not each time the consumer's\n // inline `callbacks` change identity: the effect reads the latest restorePayment through a ref.\n const restorePaymentRef = useRef(restorePayment);\n restorePaymentRef.current = restorePayment;\n useEffect(() => {\n if (persistPayment) {\n void restorePaymentRef.current();\n }\n }, [persistPayment]);\n\n return {\n isOpen,\n setIsOpen,\n editCc,\n setEditCc,\n unified,\n unifiedCc,\n unifiedResponse,\n unifiedBilling,\n unifiedPayment,\n capturedBin,\n handleBinCapture,\n };\n}\n","\"use client\";\n\nimport { useEffect, useState } from \"react\";\nimport { defaultReady, orderReadyOf, type ReadinessFlags } from \"../rules\";\nimport { useLatest } from \"./use-latest\";\n\n/** Parameters for order readiness validation. */\nexport interface OrderReadinessParams {\n cartHdrUid: string | number | undefined;\n shippingAddress: unknown;\n billingAddress: unknown;\n shippingMethodSaved: boolean;\n showBillingInfoSummary: boolean;\n processingOrder: boolean;\n paymentMethod: string;\n unifiedPaymentAccountId: string | undefined;\n unifiedBilling: boolean;\n isFreeShipping: boolean;\n carrierId: string;\n shippingFee: number | undefined;\n isEditShippingInfo: boolean;\n isEditShippingMethods: boolean;\n isEditBillingInfo: boolean;\n editCc: boolean;\n /**\n * Site-provided function to check if the order is ready.\n *\n * Return `true` or `false` to override the default gates. Return\n * `undefined` to defer to the default logic (useful when the override\n * only applies to specific order flows — e.g. sample-only or pickup).\n */\n customReadinessCheck?: (params: OrderReadinessParams) => boolean | undefined;\n}\n\n/**\n * Pure function that determines if an order is ready to submit.\n *\n * Checks all gates: cart exists, addresses present, shipping method saved,\n * billing shown, payment complete (for credit card), shipping fee present\n * (for non-free, non-pickup orders), and no sections being edited.\n */\nexport function determineOrderReadiness(params: OrderReadinessParams): boolean {\n return orderReadyOf(params.customReadinessCheck?.(params), defaultReady(readinessFlags(params)));\n}\n\n/** The params reduced to the flags `defaultReady` gates on. */\nfunction readinessFlags(params: OrderReadinessParams): ReadinessFlags {\n return {\n cartUidSet: !!params.cartHdrUid,\n editShippingInfo: params.isEditShippingInfo,\n editShippingMethods: params.isEditShippingMethods,\n editBillingInfo: params.isEditBillingInfo,\n editCc: params.editCc,\n hasShippingAddress: params.shippingAddress !== undefined,\n hasBillingAddress: params.billingAddress !== undefined,\n methodSaved: params.shippingMethodSaved,\n showBillingSummary: params.showBillingInfoSummary,\n processing: params.processingOrder,\n isCreditCard: params.paymentMethod === \"credit-card\",\n hasAccountId: !!params.unifiedPaymentAccountId,\n hasUnifiedBilling: params.unifiedBilling,\n isFreeShipping: params.isFreeShipping,\n hasShippingFee: params.shippingFee !== undefined,\n };\n}\n\n/**\n * Debounced order readiness hook.\n *\n * Recomputes readiness 300ms after any dependency changes to avoid\n * excessive re-renders during rapid state transitions (e.g., typing\n * in address fields).\n */\nexport function useOrderReadiness(params: OrderReadinessParams) {\n const [enableProcessOrderBtn, setEnableProcessOrderBtn] = useState(false);\n const [processingValidation, setProcessingValidation] = useState(false);\n\n // Re-checked when one of the listed inputs changes; the params (with the site's\n // customReadinessCheck, a new function each render) are read as of that render.\n const paramsRef = useLatest(params);\n useEffect(() => {\n setProcessingValidation(true);\n\n const current = paramsRef.current;\n const timeoutId = setTimeout(() => {\n const ready = determineOrderReadiness(current);\n setEnableProcessOrderBtn(ready);\n setProcessingValidation(false);\n }, 300);\n\n return () => clearTimeout(timeoutId);\n }, [\n paramsRef,\n params.billingAddress,\n params.shippingAddress,\n params.isEditShippingInfo,\n params.isEditShippingMethods,\n params.isEditBillingInfo,\n params.editCc,\n params.isFreeShipping,\n params.unifiedPaymentAccountId,\n params.unifiedBilling,\n params.paymentMethod,\n params.processingOrder,\n params.carrierId,\n params.shippingFee,\n params.shippingMethodSaved,\n params.showBillingInfoSummary,\n params.cartHdrUid,\n ]);\n\n return { enableProcessOrderBtn, processingValidation };\n}\n","import { useRef } from \"react\";\nimport type { RefObject } from \"react\";\n\n/**\n * A ref holding this render's `value`. An effect that MUST NOT re-run when the value changes\n * (a consumer's inline callback, data read only when another input changes) reads it through\n * the ref, so it sees the latest value without listing it as a dependency.\n */\nexport function useLatest<T>(value: T): RefObject<T> {\n const ref = useRef(value);\n ref.current = value;\n return ref;\n}\n"]}
@@ -1 +0,0 @@
1
- {"version":3,"sources":["../src/query-action-registry.ts","../src/queries/batch-query.ts"],"sourcesContent":["/**\n * Lightweight registry for a query action function.\n *\n * augur-server/hooks.ts registers its queryAction as a side effect when\n * imported. augur-hooks consumers (useCartPricing, useStock, the provider)\n * read from this registry to route data through server actions automatically.\n *\n * No circular dependency: augur-server depends on augur-hooks and writes here.\n * augur-hooks reads from its own module.\n */\n\ntype QueryActionFn = (methodPath: string, ...args: unknown[]) => Promise<unknown>;\n\nlet _queryAction: QueryActionFn | null = null;\n\n/** Register a query action function (called by augur-server/hooks.ts on import). */\nexport function registerQueryAction(fn: QueryActionFn): void {\n _queryAction = fn;\n}\n\n/** Returns the registered query action, or null if none registered. */\nexport function getRegisteredQueryAction(): QueryActionFn | null {\n return _queryAction;\n}\n\n/** Clears the registered query action. Used in tests only. @internal */\nexport function clearRegisteredQueryAction(): void {\n _queryAction = null;\n}\n","import type { QueryClient } from \"@tanstack/react-query\";\n\nexport interface BatchQueryConfig<TParam, TData> {\n params: TParam[];\n queryClient: QueryClient;\n /** Build individual cache key for a single param. */\n getItemKey: (param: TParam) => readonly unknown[];\n /** Build the string key for the result Record from a param. */\n getResultKey: (param: TParam) => string;\n /** Fetch only uncached items, return keyed Record. */\n fetchItems: (uncached: TParam[]) => Promise<Record<string, TData>>;\n /** Extract individual cache key from a fetched result entry (for seeding). */\n getSeedKey: (resultKey: string, data: TData) => readonly unknown[];\n}\n\n/**\n * Generic batch query executor.\n *\n * 1. Checks queryClient cache for each param\n * 2. Fetches only uncached items in a single batch call\n * 3. Seeds individual cache entries from the response\n * 4. Returns merged cached + fetched record\n */\nexport async function executeBatchQuery<TParam, TData>(\n config: BatchQueryConfig<TParam, TData>,\n): Promise<Record<string, TData>> {\n const { params, queryClient, getItemKey, getResultKey, fetchItems, getSeedKey } = config;\n\n if (params.length === 0) {\n return {};\n }\n\n const cached: Record<string, TData> = {};\n const uncached: TParam[] = [];\n\n for (const param of params) {\n const existing = queryClient.getQueryData<TData>(getItemKey(param));\n if (existing !== undefined) {\n cached[getResultKey(param)] = existing;\n } else {\n uncached.push(param);\n }\n }\n\n if (uncached.length === 0) {\n return cached;\n }\n\n const fetched = await fetchItems(uncached);\n\n for (const [key, data] of Object.entries(fetched)) {\n queryClient.setQueryData(getSeedKey(key, data as TData), data);\n }\n\n return { ...cached, ...fetched };\n}\n"],"mappings":";AAaA,IAAI,eAAqC;AAGlC,SAAS,oBAAoB,IAAyB;AAC3D,iBAAe;AACjB;AAGO,SAAS,2BAAiD;AAC/D,SAAO;AACT;;;ACAA,eAAsB,kBACpB,QACgC;AAChC,QAAM,EAAE,QAAQ,aAAa,YAAY,cAAc,YAAY,WAAW,IAAI;AAElF,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,SAAgC,CAAC;AACvC,QAAM,WAAqB,CAAC;AAE5B,aAAW,SAAS,QAAQ;AAC1B,UAAM,WAAW,YAAY,aAAoB,WAAW,KAAK,CAAC;AAClE,QAAI,aAAa,QAAW;AAC1B,aAAO,aAAa,KAAK,CAAC,IAAI;AAAA,IAChC,OAAO;AACL,eAAS,KAAK,KAAK;AAAA,IACrB;AAAA,EACF;AAEA,MAAI,SAAS,WAAW,GAAG;AACzB,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,MAAM,WAAW,QAAQ;AAEzC,aAAW,CAAC,KAAK,IAAI,KAAK,OAAO,QAAQ,OAAO,GAAG;AACjD,gBAAY,aAAa,WAAW,KAAK,IAAa,GAAG,IAAI;AAAA,EAC/D;AAEA,SAAO,EAAE,GAAG,QAAQ,GAAG,QAAQ;AACjC;","names":[]}