solve-engine 1.1.1 → 2.0.0

package/dist/chunk-CKQMXMHR.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/format/FormattingSettings.ts","../src/format/FormatEngine.ts"],"names":["formatted","autoFormatIntegerOrFloat","CURRENCY_DISPLAY","decimalToFixed","formatSymbolic","columnMajorToRowMajor","getLocale","formatColour"],"mappings":";;;;;;;;AAyBO,IAAM,2BAAA,GAAkD;AAAA,EAC7D,WAAA,EAAa;AAAA,IACX,aAAA,EAAe,CAAA;AAAA,IACf,eAAA,EAAiB;AAAA,GACnB;AAAA,EACA,YAAA,EAAc;AAAA,IACZ,sBAAA,EAAwB;AAAA,GAC1B;AAAA,EACA,SAAA,EAAW;AAAA,IACT,aAAA,EAAe,KAAA;AAAA,IACf,YAAA,EAAc;AAAA,GAChB;AAAA,EACA,uBAAA,EAAyB;AAAA,IACvB,aAAA,EAAe;AAAA,GACjB;AAAA,EACA,gBAAA,EAAkB;AAAA,IAChB,aAAA,EAAe;AAAA;AAEnB;;;ACjCA,SAAS,YAAA,CAAa,KAAA,EAAe,MAAA,EAAiB,QAAA,EAA8B,aAAA,EAAgC;AAClH,EAAA,MAAM,GAAA,GAAM,SAAS,WAAA,CAAY,eAAA;AACjC,EAAA,MAAM,GAAA,GAAM,SAAS,YAAA,CAAa,sBAAA;AAMlC,EAAA,IAAI,aAAA,KAAkB,MAAA,IAAa,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,EAAG;AACzD,IAAA,MAAMA,UAAAA,GAAY,KAAA,CAAM,cAAA,CAAe,GAAA,IAAO,OAAA,EAAS;AAAA,MACrD,qBAAA,EAAuB,aAAA;AAAA,MACvB,qBAAA,EAAuB,aAAA;AAAA,MACvB,WAAA,EAAa;AAAA,KACd,CAAA;AACD,IAAA,OAAO,CAAA,EAAG,MAAA,CAAO,OAAA,CAAQ,YAAY,GAAGA,UAAS,CAAA,CAAA;AAAA,EACnD;AACA,EAAA,MAAM,EAAA,GAAK,SAAS,WAAA,CAAY,aAAA;AAChC,EAAA,MAAM,SAAA,GAAYC,0CAAA,CAAyB,KAAA,EAAO,EAAA,EAAI,KAAK,GAAG,CAAA;AAC9D,EAAA,OAAO,CAAA,EAAG,MAAA,CAAO,OAAA,CAAQ,YAAY,GAAG,SAAS,CAAA,CAAA;AACnD;AAkBA,SAAS,eAAA,CAAgB,MAAA,EAAgB,WAAA,EAAqB,MAAA,EAAiB,QAAA,EAAsC;AACnH,EAAA,MAAM,EAAA,GAAK,SAAS,WAAA,CAAY,aAAA;AAChC,EAAA,MAAM,WAAA,GAAc,SAAS,WAAA,CAAY,eAAA;AACzC,EAAA,MAAM,GAAA,GAAM,QAAA,CAAS,YAAA,CAAa,sBAAA,IAA0B,OAAA;AAG5D,EAAA,MAAM,SAAA,GAAY,IAAA,CAAK,GAAA,CAAI,EAAA,EAAI,CAAC,CAAA;AAChC,EAAA,MAAM,UAAA,GAAa,MAAA,CAAO,cAAA,CAAe,GAAA,EAAK,EAAE,aAAa,qBAAA,EAAuB,CAAA,EAAG,qBAAA,EAAuB,EAAA,EAAI,CAAA;AAClH,EAAA,MAAM,UAAA,GAAa,IAAA,CAAK,GAAA,CAAI,WAAW,CAAA,CAAE,cAAA,CAAe,GAAA,EAAK,EAAE,WAAA,EAAa,qBAAA,EAAuB,CAAA,EAAG,qBAAA,EAAuB,WAAW,CAAA;AACxI,EAAA,OAAO,GAAG,MAAA,CAAO,OAAA,CAAQ,YAAY,CAAA,EAAG,UAAU,SAAM,UAAU,CAAA,CAAA;AACpE;AAUA,SAAS,SAAA,CAAU,KAAA,EAAwB,QAAA,EAA8B,IAAA,EAAuB;AAI9F,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,CAAC,MAAA,CAAO,SAAS,KAAK,CAAA,EAAG,OAAO,CAAA,EAAA,EAAK,KAAK,CAAA,CAAA;AAY3E,EAAA,MAAM,WAAW,OAAO,KAAA,KAAU,QAAA,GAAW,KAAA,GAAQ,KAAK,KAAA,GAAQ,CAAA;AAClE,EAAA,MAAM,IAAA,GAAO,WAAW,GAAA,GAAM,EAAA;AAC9B,EAAA,MAAM,MAAA,GAAS,CAAC,KAAA,KACd,OAAO,UAAU,QAAA,GAAA,CACZ,QAAA,GAAW,CAAC,KAAA,GAAQ,KAAA,EAAO,SAAS,KAAK,CAAA,GAC1C,KAAK,GAAA,CAAI,IAAA,CAAK,MAAM,KAAK,CAAC,CAAA,CAAE,QAAA,CAAS,KAAK,CAAA;AAEhD,EAAA,IAAI,IAAA,KAAS,OAAO,OAAO,CAAA,EAAA,EAAK,IAAI,CAAA,EAAA,EAAK,MAAA,CAAO,CAAC,CAAC,CAAA,CAAA;AAClD,EAAA,IAAI,IAAA,KAAS,OAAO,OAAO,CAAA,EAAA,EAAK,IAAI,CAAA,EAAA,EAAK,MAAA,CAAO,CAAC,CAAC,CAAA,CAAA;AAClD,EAAA,MAAM,UAAU,QAAA,CAAS,SAAA,CAAU,aAAA,GAAgB,QAAA,CAAS,UAAU,YAAA,GAAe,CAAA;AACrF,EAAA,MAAM,GAAA,GAAM,OAAO,EAAE,CAAA,CAAE,aAAY,CAAE,QAAA,CAAS,SAAS,GAAG,CAAA;AAC1D,EAAA,OAAO,CAAA,EAAA,EAAK,IAAI,CAAA,EAAA,EAAK,GAAG,CAAA,CAAA;AAC1B;AAUA,IAAM,2BAAA,GAA8B,GAAA;AAoBpC,SAAS,aAAa,KAAA,EAAuB;AAC3C,EAAA,MAAM,SAAA,GAAY,KAAA,GAAQ,EAAA,GAAK,CAAC,KAAA,GAAQ,KAAA;AAIxC,EAAA,IAAI,MAAA,CAAO,SAAS,MAAA,CAAO,SAAS,CAAC,CAAA,EAAG,OAAO,KAAK,KAAK,CAAA,CAAA;AACzD,EAAA,MAAM,IAAA,GAAO,SAAA,CAAU,QAAA,CAAS,EAAE,EAAE,MAAA,GAAS,CAAA;AAC7C,EAAA,IAAI,IAAA,GAAO,KAAK,GAAA,GAAM,IAAA,CAAK,QAAQ,2BAAA,EAA6B,OAAO,KAAK,KAAK,CAAA,CAAA;AACjF,EAAA,MAAM,KAAA,GAAQ,IAAA,GAAO,IAAA,CAAK,GAAA,GAAM,IAAA,CAAK,IAAA;AACrC,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA;AACjC,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,GAAA,CAAI,EAAA,EAAI,QAAQ,QAAQ,CAAA;AAC9C,EAAA,MAAM,IAAA,GAAO,KAAA,GAAQ,EAAA,GAAK,GAAA,GAAM,EAAA;AAChC,EAAA,OAAO,CAAA,EAAA,EAAK,IAAI,CAAA,CAAA,EAAI,QAAA,CAAS,QAAQ,CAAC,CAAC,CAAA,EAAA,EAAK,QAAQ,CAAA,4BAAA,EAAA,CAAgC,QAAA,GAAW,CAAA,EAAG,cAAA,CAAe,OAAO,CAAC,CAAA,4BAAA,CAAA;AAC3H;AAEA,SAAS,aAAa,KAAA,EAAuB;AAC3C,EAAA,OAAO,KAAK,KAAK,CAAA,CAAA;AACnB;AAEA,SAAS,cAAc,KAAA,EAAwB;AAC7C,EAAA,OAAO,KAAK,KAAK,CAAA,CAAA;AACnB;AAqBA,SAAS,cAAA,CAAe,OAAe,MAAA,EAAyB;AAC9D,EAAA,MAAM,CAAA,GAAI,IAAI,IAAA,CAAK,KAAK,CAAA;AACxB,EAAA,MAAM,OAAA,GAAU,CAAA,CAAE,kBAAA,CAAmB,MAAA,CAAO,MAAM,EAAE,OAAA,EAAS,MAAA,EAAQ,IAAA,EAAM,SAAA,EAAW,KAAA,EAAO,MAAA,EAAQ,GAAA,EAAK,WAAW,CAAA;AACrH,EAAA,MAAM,UAAA,GAAa,CAAA,CAAE,QAAA,EAAS,KAAM,KAAK,CAAA,CAAE,UAAA,EAAW,KAAM,CAAA,IAAK,EAAE,UAAA,EAAW,KAAM,CAAA,IAAK,CAAA,CAAE,iBAAgB,KAAM,CAAA;AACjH,EAAA,IAAI,UAAA,EAAY,OAAO,CAAA,EAAA,EAAK,OAAO,CAAA,CAAA;AACnC,EAAA,OAAO,KAAK,OAAO,CAAA,EAAA,EAAK,EAAE,kBAAA,CAAmB,MAAA,CAAO,IAAI,CAAC,CAAA,CAAA;AAC3D;AAUA,SAAS,iBAAiB,EAAA,EAAoB;AAC5C,EAAA,MAAM,IAAA,GAAO,EAAA,GAAK,CAAA,GAAI,GAAA,GAAM,EAAA;AAC5B,EAAA,MAAM,eAAe,IAAA,CAAK,KAAA,CAAM,KAAK,GAAA,CAAI,EAAE,IAAI,GAAI,CAAA;AACnD,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,YAAA,GAAe,IAAI,CAAA;AAC5C,EAAA,MAAM,OAAA,GAAU,IAAA,CAAK,KAAA,CAAO,YAAA,GAAe,OAAQ,EAAE,CAAA;AACrD,EAAA,MAAM,UAAU,YAAA,GAAe,EAAA;AAC/B,EAAA,MAAM,KAAK,MAAA,CAAO,OAAO,CAAA,CAAE,QAAA,CAAS,GAAG,GAAG,CAAA;AAC1C,EAAA,IAAI,OAAA,KAAY,GAAG,OAAO,CAAA,EAAG,IAAI,CAAA,EAAG,KAAK,IAAI,EAAE,CAAA,CAAA;AAC/C,EAAA,MAAM,KAAK,MAAA,CAAO,OAAO,CAAA,CAAE,QAAA,CAAS,GAAG,GAAG,CAAA;AAC1C,EAAA,OAAO,GAAG,IAAI,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,EAAE,IAAI,EAAE,CAAA,CAAA;AACpC;AAEA,SAAS,SAAA,CAAU,KAAA,EAAe,IAAA,EAA0B,MAAA,EAAiB,UAA8B,KAAA,EAA6B;AACtI,EAAA,IAAI,SAAS,IAAA,EAAM,OAAO,CAAA,EAAA,EAAK,gBAAA,CAAiB,KAAK,CAAC,CAAA,CAAA;AAEtD,EAAA,MAAM,EAAA,GAAK,SAAS,uBAAA,CAAwB,aAAA;AAG5C,EAAA,MAAM,aAAA,GAAgB,CAAC,MAAA,EAAQ,OAAA,EAAS,OAAA,EAAS,SAAA,EAAW,SAAA,EAAW,KAAA,EAAO,MAAA,EAAQ,MAAA,EAAQ,QAAA,EAAU,QAAQ,CAAA;AAChH,EAAA,MAAM,UAAA,GAAa,IAAA,IAAQ,aAAA,CAAc,QAAA,CAAS,IAAI,CAAA;AAEtD,EAAA,IAAI,SAAA;AACJ,EAAA,IAAI,UAAA,IAAc,KAAA,KAAU,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA,EAAG;AAE7C,IAAA,SAAA,GAAY,MAAM,QAAA,EAAS;AAAA,EAC7B,CAAA,MAAO;AAEL,IAAA,SAAA,GAAY,KAAA,CAAM,QAAQ,EAAE,CAAA;AAAA,EAC9B;AASA,EAAA,MAAM,kBAAkB,IAAA,GAAOC,kCAAA,CAAiB,IAAA,CAAK,WAAA,EAAa,CAAA,GAAI,MAAA;AACtE,EAAA,IAAI,eAAA,EAAiB;AAMnB,IAAA,MAAM,SAAA,GAAY,KAAA,GAAQC,gCAAA,CAAe,KAAA,EAAO,EAAE,CAAA,GAAI,SAAA;AACtD,IAAA,MAAM,GAAA,GAAM,eAAA,CAAgB,MAAA,GAAS,GAAA,GAAM,EAAA;AAC3C,IAAA,MAAM,aAAa,eAAA,CAAgB,QAAA,KAAa,WAC5C,CAAA,EAAG,eAAA,CAAgB,MAAM,CAAA,EAAG,GAAG,CAAA,EAAG,SAAS,KAC3C,CAAA,EAAG,SAAS,GAAG,GAAG,CAAA,EAAG,gBAAgB,MAAM,CAAA,CAAA;AAC/C,IAAA,OAAO,KAAK,UAAU,CAAA,CAAA;AAAA,EACxB;AAiBA,EAAA,MAAM,WAAA,GAAc,KAAA,GAAQA,gCAAA,CAAe,KAAA,EAAO,EAAE,CAAA,GAAI,SAAA;AACxD,EAAA,OAAO,KAAK,WAAW,CAAA,CAAA,EAAI,IAAA,IAAQ,EAAE,GAAG,IAAA,EAAK;AAC/C;AAEA,SAAS,iBAAA,CAAkB,OAAoB,QAAA,EAAsC;AACnF,EAAA,IAAI,OAAO,KAAA,KAAU,SAAA,EAAW,OAAO,QAAQ,MAAA,GAAS,OAAA;AACxD,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,UAAU,IAAA,EAAM,OAAOC,iCAAe,KAAK,CAAA;AAC5E,EAAA,MAAM,EAAA,GAAK,SAAS,WAAA,CAAY,aAAA;AAChC,EAAA,MAAM,GAAA,GAAM,SAAS,WAAA,CAAY,eAAA;AACjC,EAAA,MAAM,GAAA,GAAM,SAAS,YAAA,CAAa,sBAAA;AAClC,EAAA,OAAOH,0CAAA,CAAyB,KAAA,EAAO,EAAA,EAAI,GAAA,EAAK,GAAG,CAAA;AACrD;AASA,SAAS,YAAA,CAAa,CAAA,EAAe,MAAA,EAAiB,QAAA,EAAsC;AAC1F,EAAA,MAAM,QAAA,GAAWI,wCAAsB,CAAC,CAAA;AACxC,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,MAAM,CAAA,EAAA,EAAK;AAC/B,IAAA,MAAM,QAAkB,EAAC;AACzB,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,MAAM,CAAA,EAAA,EAAK;AAC/B,MAAA,KAAA,CAAM,IAAA,CAAK,kBAAkB,QAAA,CAAS,CAAA,GAAI,EAAE,IAAA,GAAO,CAAC,CAAA,EAAG,QAAQ,CAAC,CAAA;AAAA,IAClE;AACA,IAAA,IAAA,CAAK,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,EAC5B;AACA,EAAA,OAAO,CAAA,EAAG,OAAO,OAAA,CAAQ,YAAY,IAAI,IAAA,CAAK,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAC1D;AAiBO,SAAS,mBAAA,CAAoB,GAAe,QAAA,EAAuC;AACxF,EAAA,MAAM,KAAK,QAAA,IAAY,2BAAA;AACvB,EAAA,MAAM,QAAA,GAAWA,wCAAsB,CAAC,CAAA;AACxC,EAAA,MAAM,QAAoB,EAAC;AAC3B,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,MAAM,CAAA,EAAA,EAAK;AAC/B,IAAA,MAAM,MAAgB,EAAC;AACvB,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,MAAM,CAAA,EAAA,EAAK;AAC/B,MAAA,GAAA,CAAI,IAAA,CAAK,kBAAkB,QAAA,CAAS,CAAA,GAAI,EAAE,IAAA,GAAO,CAAC,CAAA,EAAG,EAAE,CAAC,CAAA;AAAA,IAC1D;AACA,IAAA,KAAA,CAAM,KAAK,GAAG,CAAA;AAAA,EAChB;AACA,EAAA,MAAM,WAAqB,EAAC;AAC5B,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,MAAM,CAAA,EAAA,EAAK;AAC/B,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,MAAM,CAAA,EAAA,EAAK,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,OAAO,KAAA,CAAM,CAAC,CAAA,CAAE,CAAC,EAAE,MAAM,CAAA;AAC3E,IAAA,QAAA,CAAS,KAAK,KAAK,CAAA;AAAA,EACrB;AACA,EAAA,OAAO,KAAA,CACJ,IAAI,CAAC,GAAA,KAAQ,KAAK,GAAA,CAAI,GAAA,CAAI,CAAC,IAAA,EAAM,CAAA,KAAM,IAAA,CAAK,SAAS,QAAA,CAAS,CAAC,CAAC,CAAC,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,EAAA,CAAI,CAAA,CACjF,IAAA,CAAK,IAAI,CAAA;AACd;AAEA,SAAS,WAAA,CAAY,GAAA,EAAa,GAAA,EAAa,MAAA,EAAyB;AACtE,EAAA,OAAO,GAAG,MAAA,CAAO,OAAA,CAAQ,YAAY,CAAA,EAAG,GAAG,IAAI,GAAG,CAAA,CAAA;AACpD;AAEA,SAAS,gBAAA,CAAiB,KAAA,EAAe,MAAA,EAAiB,QAAA,EAAsC;AAM9F,EAAA,MAAM,EAAA,GAAK,SAAS,gBAAA,CAAiB,aAAA;AACrC,EAAA,MAAM,SAAA,GAAA,CAAa,KAAA,GAAQ,GAAA,EAAK,OAAA,CAAQ,EAAE,CAAA;AAC1C,EAAA,OAAO,CAAA,EAAA,EAAK,SAAS,CAAA,EAAG,MAAA,CAAO,QAAQ,gBAAgB,CAAA,CAAA;AACzD;AAEA,SAAS,UAAA,CAAW,OAAe,IAAA,EAAkC;AACnE,EAAA,OAAO,KAAK,KAAK,CAAA,CAAA,EAAI,IAAA,IAAQ,EAAE,GAAG,IAAA,EAAK;AACzC;AAqBO,SAAS,WAAA,CAAY,OAAc,QAAA,EAAuC;AAC/E,EAAA,MAAM,KAAK,QAAA,IAAY,2BAAA;AACvB,EAAA,MAAM,UAAA,GAAa,EAAA,CAAG,YAAA,CAAa,sBAAA,IAA0B,IAAA;AAC7D,EAAA,MAAM,MAAA,GAASC,4BAAU,UAAU,CAAA;AAEnC,EAAA,QAAQ,MAAM,IAAA;AAAM,IAClB,KAAA,CAAA;AAGE,MAAA,IAAI,KAAA,CAAM,gBAAgB,MAAA,EAAW;AACnC,QAAA,OAAO,gBAAgB,KAAA,CAAM,KAAA,EAAiB,KAAA,CAAM,WAAA,EAAa,QAAQ,EAAE,CAAA;AAAA,MAC7E;AACA,MAAA,OAAO,aAAa,KAAA,CAAM,KAAA,EAAiB,MAAA,EAAQ,EAAA,EAAI,MAAM,aAAa,CAAA;AAAA,IAC5E,KAAA,CAAA;AACE,MAAA,OAAO,SAAA,CAAU,KAAA,CAAM,KAAA,EAA0B,EAAA,EAAI,MAAM,IAAI,CAAA;AAAA,IACjE,KAAA,CAAA;AACE,MAAA,OAAO,YAAA,CAAa,MAAM,KAAe,CAAA;AAAA,IAC3C,KAAA,CAAA;AACE,MAAA,OAAO,YAAA,CAAa,MAAM,KAAe,CAAA;AAAA,IAC3C,KAAA,EAAA;AACE,MAAA,OAAO,aAAA,CAAc,MAAM,KAAgB,CAAA;AAAA,IAC7C,KAAA,CAAA;AACE,MAAA,OAAO,cAAA,CAAe,KAAA,CAAM,KAAA,EAAiB,MAAM,CAAA;AAAA,IACrD,KAAA,CAAA;AACE,MAAA,OAAO,SAAA,CAAU,MAAM,KAAA,EAAiB,KAAA,CAAM,MAAM,MAAA,EAAQ,EAAA,EAAI,MAAM,KAAK,CAAA;AAAA,IAC7E,KAAA,CAAA;AACE,MAAA,OAAO,YAAA,CAAa,KAAA,CAAM,KAAA,EAAqB,MAAA,EAAQ,EAAE,CAAA;AAAA,IAC3D,KAAA,CAAA,cAAsB;AACpB,MAAA,MAAM,IAAI,KAAA,CAAM,KAAA;AAChB,MAAA,OAAO,WAAA,CAAY,CAAA,CAAE,GAAA,EAAK,CAAA,CAAE,KAAK,MAAM,CAAA;AAAA,IACzC;AAAA,IACA,KAAA,EAAA;AACE,MAAA,OAAO,CAAA,EAAG,OAAO,OAAA,CAAQ,YAAY,GAAGC,8BAAA,CAAa,KAAA,CAAM,KAAmB,CAAC,CAAA,CAAA;AAAA,IACjF,KAAA,CAAA;AACE,MAAA,OAAOH,gCAAA,CAAe,MAAM,KAAqB,CAAA;AAAA,IACnD,KAAA,CAAA;AACE,MAAA,OAAO,gBAAA,CAAiB,KAAA,CAAM,KAAA,EAAiB,MAAA,EAAQ,EAAE,CAAA;AAAA,IAC3D,KAAA,EAAA;AACE,MAAA,OAAO,UAAA,CAAW,KAAA,CAAM,KAAA,EAAiB,KAAA,CAAM,IAAI,CAAA;AAAA,IACrD,KAAA,EAAA;AAKE,MAAA,OAAO,KAAA,CAAM,IAAA,IAAQ,MAAA,CAAO,KAAA,CAAM,KAAK,CAAA;AAAA,IACzC;AACE,MAAA,OAAO,CAAA,EAAA,EAAK,MAAA,CAAO,KAAA,CAAM,KAAK,CAAC,CAAA,CAAA;AAAA;AAErC","file":"chunk-CKQMXMHR.cjs","sourcesContent":["/**\n * Minimal formatting settings interface for the engine\n * This allows the engine to format values without depending on app-specific settings\n */\nexport interface FormattingSettings {\n  floatResult: {\n    decimalPlaces: number;\n    enableSeperator: boolean;\n  };\n  numberResult: {\n    decimalSeparatorLocale: string;\n  };\n  hexResult: {\n    enablePadding: boolean;\n    paddingZeros: number;\n  };\n  unitOfMeasurementResult: {\n    decimalPlaces: number;\n  };\n  percentageResult: {\n    decimalPlaces: number;\n  };\n}\n\n/** Formatting used when a host supplies none. */\nexport const DEFAULT_FORMATTING_SETTINGS: FormattingSettings = {\n  floatResult: {\n    decimalPlaces: 2,\n    enableSeperator: true,\n  },\n  numberResult: {\n    decimalSeparatorLocale: \"en-US\",\n  },\n  hexResult: {\n    enablePadding: false,\n    paddingZeros: 0,\n  },\n  unitOfMeasurementResult: {\n    decimalPlaces: 2,\n  },\n  percentageResult: {\n    decimalPlaces: 2,\n  },\n};\n","import { Value, ValueType, type MatrixData, type MatrixEntry, type RangeData, type ColourData } from \"@solve-js/vm/Value\";\nimport { formatColour } from \"@solve-js/packages/colour/ColourMath\";\nimport { decimalToFixed, type DecimalData } from \"@solve-js/decimal\";\nimport { getLocale, type ILocale } from \"@solve-js/constants/locales\";\nimport { autoFormatIntegerOrFloat } from \"@solve-js/utilities/Number\";\nimport { FormattingSettings, DEFAULT_FORMATTING_SETTINGS } from \"./FormattingSettings\";\nimport { CURRENCY_DISPLAY } from \"@solve-js/uom/CurrencyAliases\";\nimport { columnMajorToRowMajor } from \"@solve-js/vm/MatrixOps\";\nimport { formatSymbolic, type SymbolicNode } from \"@solve-js/symbolic\";\n\nfunction formatNumber(value: number, locale: ILocale, settings: FormattingSettings, decimalPlaces?: number): string {\n  const sep = settings.floatResult.enableSeperator;\n  const loc = settings.numberResult.decimalSeparatorLocale;\n  // An explicit precision (`3.14159 to 4 dp`, `round(1.5, 2)`) shows EXACTLY that\n  // many places with trailing zeros kept, where the default trims them and shows\n  // an integer with none. The value was already rounded to this precision when\n  // it was set (see VMBuiltins' roundToPlaces, exact where an exact decimal was\n  // there), so rendering it to the same place count reproduces that rounding.\n  if (decimalPlaces !== undefined && Number.isFinite(value)) {\n    const formatted = value.toLocaleString(loc || \"en-US\", {\n      minimumFractionDigits: decimalPlaces,\n      maximumFractionDigits: decimalPlaces,\n      useGrouping: sep,\n    });\n    return `${locale.display.resultPrefix}${formatted}`;\n  }\n  const dp = settings.floatResult.decimalPlaces;\n  const formatted = autoFormatIntegerOrFloat(value, dp, sep, loc);\n  return `${locale.display.resultPrefix}${formatted}`;\n}\n\n/**\n * Renders a measurement that carries a one-sigma uncertainty as\n * `center ± spread`, e.g. `49.2 ± 2.0`.\n *\n * The center is shown the way any number is, whole numbers as integers and\n * trailing zeros trimmed, so a tolerance-free-looking center still reads\n * cleanly (\"30 ± 2.24\", not \"30.00 ± 2.24\"). The spread is shown to the same\n * decimal-place budget but always keeps at least one fractional digit, which is\n * what distinguishes it as a tolerance and gives \"± 2.0\" rather than \"± 2\".\n * Both use `Intl` with `maximumFractionDigits`, so the trailing-zero trimming is\n * locale-correct (a comma-decimal locale is not string-sliced on \".\").\n *\n * The symbol is always the `±` glyph on output, even when the input was the\n * ASCII `+/-`, since the glyph is the conventional notation and unambiguous to\n * read back.\n */\nfunction formatUncertain(center: number, uncertainty: number, locale: ILocale, settings: FormattingSettings): string {\n  const dp = settings.floatResult.decimalPlaces;\n  const useGrouping = settings.floatResult.enableSeperator;\n  const loc = settings.numberResult.decimalSeparatorLocale || \"en-US\";\n  // The spread needs room for at least one fractional digit, so a zero-decimal\n  // budget cannot leave minimumFractionDigits above maximumFractionDigits.\n  const spreadMax = Math.max(dp, 1);\n  const centerText = center.toLocaleString(loc, { useGrouping, minimumFractionDigits: 0, maximumFractionDigits: dp });\n  const spreadText = Math.abs(uncertainty).toLocaleString(loc, { useGrouping, minimumFractionDigits: 1, maximumFractionDigits: spreadMax });\n  return `${locale.display.resultPrefix}${centerText} ± ${spreadText}`;\n}\n\n/**\n * Renders a number in whichever base it is tagged with.\n *\n * The zero padding is a hexadecimal setting and stays one. Applying it to a\n * binary rendering would pad `0b101` out to the same digit count as a hex\n * value, which is a different quantity of zeros and not what the setting asks\n * for.\n */\nfunction formatHex(value: number | bigint, settings: FormattingSettings, base?: string): string {\n  // An infinity or a NaN has no digits in any base, and asking for them\n  // produced `0xINFINITY`, a literal that reads back as nothing at all. Render\n  // the value itself, which is what every other non-finite result shows.\n  if (typeof value === \"number\" && !Number.isFinite(value)) return `= ${value}`;\n\n  // Truncate and take the sign off before converting. `Number.toString(radix)`\n  // does neither: it renders -255 as \"-ff\", which lands the minus inside the\n  // literal as `0x-FF`, and it renders 255.7 as \"ff.b3333333333\", inventing\n  // fractional hex digits for a notation that has no use for them. Both were\n  // visible on `as hex` until the builtins started sharing this path.\n  //\n  // A bigint needs neither truncation nor a Math call, and must not be routed\n  // through one: passing it to Math.trunc() throws, and converting it to a\n  // double first is exactly the precision loss it is carried as a bigint to\n  // avoid.\n  const negative = typeof value === \"bigint\" ? value < 0n : value < 0;\n  const sign = negative ? \"-\" : \"\";\n  const digits = (radix: number): string =>\n    typeof value === \"bigint\"\n      ? (negative ? -value : value).toString(radix)\n      : Math.abs(Math.trunc(value)).toString(radix);\n\n  if (base === \"bin\") return `= ${sign}0b${digits(2)}`;\n  if (base === \"oct\") return `= ${sign}0o${digits(8)}`;\n  const padding = settings.hexResult.enablePadding ? settings.hexResult.paddingZeros : 0;\n  const hex = digits(16).toUpperCase().padStart(padding, \"0\");\n  return `= ${sign}0x${hex}`;\n}\n\n/**\n * How many decimal digits of an exact integer this will render in full.\n *\n * A little above the ~19,729 digits of the largest bigint the VM will build\n * (`vm/VM.ts`'s MAX_EXACT_POW_BITS / MAX_EXACT_SHIFT_BITS, 65,536 bits), so\n * every value the engine can produce through `^` or `<<` still prints exactly\n * and this ceiling only ever meets a value that came from somewhere else.\n */\nconst MAX_DISPLAYED_BIGINT_DIGITS = 20000;\n\n/**\n * Renders an exact integer, or describes it when writing it out is itself the\n * expensive operation.\n *\n * This used to be a bare `= ${value}` template, which renders whatever it is\n * handed: `1n << 100000000` took 8.5 seconds here turning a 12.5MB integer\n * into a thirty-million-character string, and a host has no way to opt out,\n * since displaying the answer is what it asked the engine for. The VM's own\n * ceiling on `<<` and `^` now stops that value existing, so this is the\n * backstop for every other way a large bigint can arrive (repeated `x * x`,\n * a Value a host built itself), and it costs one comparison for every value\n * that is not absurd.\n *\n * The digit count is estimated from the bit length rather than measured, since\n * measuring means doing the conversion this exists to avoid. Bit length comes\n * off the hexadecimal form, which is linear in the size of the value where the\n * decimal form is not.\n */\nfunction formatBigInt(value: bigint): string {\n  const magnitude = value < 0n ? -value : value;\n  // Every bigint a person actually reads takes this line and nothing else:\n  // anything a double can hold is at most 309 digits, so it is printable\n  // without measuring it at all.\n  if (Number.isFinite(Number(magnitude))) return `= ${value}`;\n  const bits = magnitude.toString(16).length * 4;\n  if (bits * Math.LN2 / Math.LN10 <= MAX_DISPLAYED_BIGINT_DIGITS) return `= ${value}`;\n  const log10 = bits * Math.LN2 / Math.LN10;\n  const exponent = Math.floor(log10);\n  const mantissa = Math.pow(10, log10 - exponent);\n  const sign = value < 0n ? \"-\" : \"\";\n  return `= ${sign}~${mantissa.toFixed(3)}e+${exponent} (an exact integer of about ${(exponent + 1).toLocaleString(\"en-US\")} digits, too large to print)`;\n}\n\nfunction formatString(value: string): string {\n  return `= ${value}`;\n}\n\nfunction formatBoolean(value: boolean): string {\n  return `= ${value}`;\n}\n\n/**\n * Renders a Datetime value locale-aware, the previous implementation\n * called `d.toLocaleString()` with no arguments, which always uses the JS\n * runtime's own default locale and never actually consulted `locale.code`\n * despite receiving it as a parameter (both branches of its old\n * `dateFormat === \"default\"` check were byte-for-byte identical, dead\n * groundwork for a distinction that was never implemented). Concretely,\n * this meant every configured locale (including the shipped German one)\n * always displayed weekday/month names in English. See GitHub issue #77.\n *\n * Uses `weekday`/`month`: \"long\" for a spelled-out date (\"Monday,\n * November 17, 2025\" / \"lundi 17 novembre 2025\") since that's what a\n * literal weekday name is for; a bare numeric date doesn't need\n * localizing beyond the decimal/thousands separators `formatNumber()`\n * already handles. The time-of-day portion is only appended when it's\n * not exactly local midnight, bare date literals (\"today\", \"17/11/2025\")\n * always anchor to local midnight, and showing \"00:00:00\" on every one of\n * those would be noise, not information.\n */\nfunction formatDatetime(value: number, locale: ILocale): string {\n  const d = new Date(value);\n  const dateStr = d.toLocaleDateString(locale.code, { weekday: \"long\", year: \"numeric\", month: \"long\", day: \"numeric\" });\n  const isMidnight = d.getHours() === 0 && d.getMinutes() === 0 && d.getSeconds() === 0 && d.getMilliseconds() === 0;\n  if (isMidnight) return `= ${dateStr}`;\n  return `= ${dateStr}, ${d.toLocaleTimeString(locale.code)}`;\n}\n\n/**\n * Renders a millisecond duration as clock-style `H:MM` (or `H:MM:SS` when\n * there's a non-zero seconds component). `ms` is never a user-typeable\n * unit (confirmed: it appears nowhere in `lexer/units.ts`), it's only\n * ever produced by subtracting two clock times/datetimes (`9:30 - 8:30`,\n * `VM.ts`'s Datetime SUB case), so this is a safe, narrow special case,\n * not a general change to how durations display.\n */\nfunction formatMsDuration(ms: number): string {\n  const sign = ms < 0 ? \"-\" : \"\";\n  const totalSeconds = Math.round(Math.abs(ms) / 1000);\n  const hours = Math.floor(totalSeconds / 3600);\n  const minutes = Math.floor((totalSeconds % 3600) / 60);\n  const seconds = totalSeconds % 60;\n  const mm = String(minutes).padStart(2, \"0\");\n  if (seconds === 0) return `${sign}${hours}:${mm}`;\n  const ss = String(seconds).padStart(2, \"0\");\n  return `${sign}${hours}:${mm}:${ss}`;\n}\n\nfunction formatUom(value: number, unit: string | undefined, locale: ILocale, settings: FormattingSettings, exact?: DecimalData): string {\n  if (unit === \"ms\") return `= ${formatMsDuration(value)}`;\n\n  const dp = settings.unitOfMeasurementResult.decimalPlaces;\n\n  // For TimeSpan values (days, weeks, hours, etc.), format as integer if the value is a whole number\n  const timeSpanUnits = [\"days\", \"weeks\", \"hours\", \"minutes\", \"seconds\", \"day\", \"week\", \"hour\", \"minute\", \"second\"];\n  const isTimeSpan = unit && timeSpanUnits.includes(unit);\n\n  let formatted: string;\n  if (isTimeSpan && value === Math.floor(value)) {\n    // For whole number TimeSpan values, format as integer\n    formatted = value.toString();\n  } else {\n    // For other values, use the configured decimal places\n    formatted = value.toFixed(dp);\n  }\n\n  // Currency display: symbol + culturally-conventional placement (e.g.\n  // \"$100.00\" prefix vs \"100.00 kr\" suffix) instead of the generic\n  // \"amount CODE\" fallback below. See uom/CurrencyAliases.ts's\n  // CURRENCY_DISPLAY table for the exact set covered and the reasoning\n  // behind each placement choice. Any currency code NOT in that table\n  // (most of the ~150 `CurrencyExchange.isCurrency()` recognizes) falls\n  // through to the unchanged \"amount CODE\" format below.\n  const currencyDisplay = unit ? CURRENCY_DISPLAY[unit.toUpperCase()] : undefined;\n  if (currencyDisplay) {\n    // An exact money amount rounds from its decimal, not from the double: a\n    // half-cent like \"$1.005\" reads as \"$1.01\" here, where \"(1.005).toFixed(2)\"\n    // answers \"1.00\" because the double it is handed already sits below the\n    // value the user typed. Amounts with no exact decimal (a currency\n    // conversion, whose rate is a double) keep the toFixed rendering above.\n    const moneyText = exact ? decimalToFixed(exact, dp) : formatted;\n    const sep = currencyDisplay.spaced ? \" \" : \"\";\n    const withSymbol = currencyDisplay.position === \"prefix\"\n      ? `${currencyDisplay.symbol}${sep}${moneyText}`\n      : `${moneyText}${sep}${currencyDisplay.symbol}`;\n    return `= ${withSymbol}`;\n  }\n\n  // The unit is written as the symbol the value carries. There used to be a\n  // `unitOfMeasurementResult.unitNames` setting here whose two branches were\n  // the same expression, so it never changed anything, and it was removed\n  // rather than implemented: the engine has no unit-name data to render from.\n  // The generated unit table maps a spelling to [measure, ratio] only, and\n  // names cannot be recovered from it, because units that differ by an OFFSET\n  // share a ratio, so \"20 C\" would come back as \"20 kelvins\". A real\n  // implementation needs a hand-authored name per unit plus pluralization and\n  // per-locale spelling (metre against meter), which is a feature rather than\n  // the repair of a dead ternary.\n  //\n  // An exact currency with no symbol in the display table above (one of the\n  // less common ISO codes) still rounds from its decimal here, so \"1.005 UYW\"\n  // reads the same way \"$1.005\" does. Non-currency Uoms never carry an exact,\n  // so this leaves \"1.50 kg\" exactly as it was.\n  const genericText = exact ? decimalToFixed(exact, dp) : formatted;\n  return `= ${genericText} ${unit || \"\"}`.trim();\n}\n\nfunction formatMatrixEntry(entry: MatrixEntry, settings: FormattingSettings): string {\n  if (typeof entry === \"boolean\") return entry ? \"true\" : \"false\";\n  if (typeof entry === \"object\" && entry !== null) return formatSymbolic(entry);\n  const dp = settings.floatResult.decimalPlaces;\n  const sep = settings.floatResult.enableSeperator;\n  const loc = settings.numberResult.decimalSeparatorLocale;\n  return autoFormatIntegerOrFloat(entry, dp, sep, loc);\n}\n\n/**\n * Renders a Matrix matching its own literal syntax: a single row (1xN,\n * including plain vectors) as `[a, b, c]`, a single column (Nx1) as\n * `[a; b; c]`, and a general shape as `[r0c0, r0c1; r1c0, r1c1]`, row-major\n * textual output read back out of the column-major storage\n * (`columnMajorToRowMajor()`), matching how `[1,2;3,4]` is written.\n */\nfunction formatMatrix(m: MatrixData, locale: ILocale, settings: FormattingSettings): string {\n  const rowMajor = columnMajorToRowMajor(m);\n  const rows: string[] = [];\n  for (let r = 0; r < m.rows; r++) {\n    const cells: string[] = [];\n    for (let c = 0; c < m.cols; c++) {\n      cells.push(formatMatrixEntry(rowMajor[r * m.cols + c], settings));\n    }\n    rows.push(cells.join(\", \"));\n  }\n  return `${locale.display.resultPrefix}[${rows.join(\"; \")}]`;\n}\n\n/**\n * Render a matrix as a multi-line, column-aligned block: one row per line (the\n * newline is where {@link formatValue}'s compact form writes `;`), each column\n * right-padded to its widest cell, and every row wrapped in `[ ... ]`. For\n * display where a grid reads better than a line, e.g. a docs notepad or a REPL:\n *\n * ```text\n * [  1   2 ]\n * [ 30   4 ]\n * ```\n *\n * This is deliberately separate from {@link formatValue}, whose single-line\n * matrix form stays the stable, assertable text the API and the worker DTO use.\n * A 1xN row vector is one line; an Nx1 column vector is N lines.\n */\nexport function formatMatrixAligned(m: MatrixData, settings?: FormattingSettings): string {\n  const us = settings || DEFAULT_FORMATTING_SETTINGS;\n  const rowMajor = columnMajorToRowMajor(m);\n  const cells: string[][] = [];\n  for (let r = 0; r < m.rows; r++) {\n    const row: string[] = [];\n    for (let c = 0; c < m.cols; c++) {\n      row.push(formatMatrixEntry(rowMajor[r * m.cols + c], us));\n    }\n    cells.push(row);\n  }\n  const colWidth: number[] = [];\n  for (let c = 0; c < m.cols; c++) {\n    let width = 0;\n    for (let r = 0; r < m.rows; r++) width = Math.max(width, cells[r][c].length);\n    colWidth.push(width);\n  }\n  return cells\n    .map((row) => `[ ${row.map((cell, c) => cell.padStart(colWidth[c])).join(\"  \")} ]`)\n    .join(\"\\n\");\n}\n\nfunction formatRange(min: number, max: number, locale: ILocale): string {\n  return `${locale.display.resultPrefix}${min}:${max}`;\n}\n\nfunction formatPercentage(value: number, locale: ILocale, settings: FormattingSettings): string {\n  // ValueType.Percentage stores a fraction (0.25 for 25%). See Value.ts's\n  // documented contract and the sole producer, VM.ts's TO_PERCENTAGE opcode\n  // (`right/left - 1`, e.g. 0.25 for \"800 to 1000\"). Multiply by 100 before\n  // formatting; without this every percentage-change result displayed as\n  // e.g. \"0.25%\" instead of \"25.00%\".\n  const dp = settings.percentageResult.decimalPlaces;\n  const formatted = (value * 100).toFixed(dp);\n  return `= ${formatted}${locale.display.percentageSuffix}`;\n}\n\nfunction formatUnit(value: number, unit: string | undefined): string {\n  return `= ${value} ${unit || \"\"}`.trim();\n}\n\n/**\n * Render an evaluated {@link Value} as a display string, dispatching on\n * `value.type` to the type-specific formatter (number, hex, datetime, unit\n * of measurement, matrix, range, percentage, ...).\n *\n * Most branches produce a `\"= \"`-prefixed result string (matching the\n * plugin's inline-result convention); `ValueType.Error` is the one\n * exception, it returns the human-readable error message directly\n * (stored in `value.unit`), not an `\"= \"`-prefixed string.\n *\n * @param value - The evaluated value to format.\n * @param settings - Locale/precision/separator options; defaults to\n *   {@link DEFAULT_FORMATTING_SETTINGS} when omitted.\n * @example\n * ```typescript\n * const [value] = engine.evaluateExpression(\"10 USD to GBP\");\n * formatValue(value); // \"= £7.85\" (exact output depends on live exchange rates)\n * ```\n */\nexport function formatValue(value: Value, settings?: FormattingSettings): string {\n  const us = settings || DEFAULT_FORMATTING_SETTINGS;\n  const localeCode = us.numberResult.decimalSeparatorLocale || \"en\";\n  const locale = getLocale(localeCode);\n\n  switch (value.type) {\n    case ValueType.Number:\n      // A measurement with a tolerance renders as \"center ± spread\"; every\n      // other number is unchanged, so a plain value is byte-for-byte what it was.\n      if (value.uncertainty !== undefined) {\n        return formatUncertain(value.value as number, value.uncertainty, locale, us);\n      }\n      return formatNumber(value.value as number, locale, us, value.decimalPlaces);\n    case ValueType.Hex:\n      return formatHex(value.value as number | bigint, us, value.unit);\n    case ValueType.BigInt:\n      return formatBigInt(value.value as bigint);\n    case ValueType.String:\n      return formatString(value.value as string);\n    case ValueType.Boolean:\n      return formatBoolean(value.value as boolean);\n    case ValueType.Datetime:\n      return formatDatetime(value.value as number, locale);\n    case ValueType.Uom:\n      return formatUom(value.value as number, value.unit, locale, us, value.exact);\n    case ValueType.Matrix:\n      return formatMatrix(value.value as MatrixData, locale, us);\n    case ValueType.Range: {\n      const r = value.value as RangeData;\n      return formatRange(r.min, r.max, locale);\n    }\n    case ValueType.Colour:\n      return `${locale.display.resultPrefix}${formatColour(value.value as ColourData)}`;\n    case ValueType.Symbolic:\n      return formatSymbolic(value.value as SymbolicNode);\n    case ValueType.Percentage:\n      return formatPercentage(value.value as number, locale, us);\n    case ValueType.Unit:\n      return formatUnit(value.value as number, value.unit);\n    case ValueType.Error:\n      // errorValue(code, message) stores the human-readable message in\n      // `.unit` (code goes in `.value`), falling through to the default\n      // case here previously displayed the raw code (e.g.\n      // \"CURRENCY_RATE_UNAVAILABLE\") instead of the actual message.\n      return value.unit ?? String(value.value);\n    default:\n      return `= ${String(value.value)}`;\n  }\n}\n"]}

package/dist/chunk-CUR2WLI4.cjs

@@ -1,507 +0,0 @@
-'use strict';
-
-var chunkZMW6NU2K_cjs = require('./chunk-ZMW6NU2K.cjs');
-var chunkQFTDTX6K_cjs = require('./chunk-QFTDTX6K.cjs');
-var chunkB4HBEFTB_cjs = require('./chunk-B4HBEFTB.cjs');
-
-// src/normalizer/TokenNormalizer.ts
-var DEFAULT_OPTIONS = {
-  maxPasses: 100,
-  maxTokens: 1e4,
-  onFusion: () => {
-  }
-};
-function createFusedToken(type, text, sourceTokens) {
-  const first = sourceTokens[0];
-  const last = sourceTokens[sourceTokens.length - 1];
-  const token = new chunkZMW6NU2K_cjs.LexerToken(
-    type,
-    chunkQFTDTX6K_cjs.tokenTypeId(type),
-    text,
-    text,
-    first.offset,
-    first.lineBreaks ?? 0,
-    first.line,
-    first.col
-  );
-  token.sourceEnd = last.sourceEnd ?? last.offset + last.text.length;
-  return token;
-}
-function recordSourceSpan(fused, sourceTokens) {
-  const last = sourceTokens[sourceTokens.length - 1];
-  if (!last) return;
-  fused.sourceEnd = last.sourceEnd ?? last.offset + last.text.length;
-}
-var NON_WORD_NAMES = [
-  "NUMBER",
-  "HEX",
-  "BIGINT",
-  "FLOAT",
-  "LSHIFT",
-  "RSHIFT",
-  "BIT_AND",
-  "BIT_OR",
-  "BIT_XOR",
-  "LPAREN",
-  "RPAREN",
-  "LBRACKET",
-  "RBRACKET",
-  "COMMA",
-  "COLON",
-  "EQUALS",
-  "THEREFORE",
-  "PIPE",
-  "AMPERSAND",
-  "AT",
-  "SEMICOLON",
-  "QUESTION",
-  "EXCLAMATION",
-  "EOF",
-  "WS",
-  "NEWLINE"
-];
-var NON_WORD_TABLE = (() => {
-  const ids = NON_WORD_NAMES.map((n) => chunkQFTDTX6K_cjs.tokenTypeId(n));
-  const len = Math.max(...ids) + 1;
-  const table = new Uint8Array(len);
-  for (const id of ids) table[id] = 1;
-  return table;
-})();
-var TokenNormalizer = class {
-  // ── Constructor ──────────────────────────────────────────────────────────
-  /**
-   * @param options - Configuration overrides for safety limits and diagnostic callbacks
-   */
-  constructor(options = {}) {
-    /** Registered rules, unsorted, the source of truth. */
-    this.rules = [];
-    /**
-     * Priority-sorted copy of {@link rules}, rebuilt lazily on the next
-     * {@link normalize} call after a mutation. Rules are registered once at
-     * engine/package-registration time and essentially never change during a
-     * session, but normalize() runs on every keystroke-driven evaluation, an
-     * earlier version re-sorted a fresh copy of `rules` on every single call,
-     * which meant every keystroke paid for an allocation + sort of a list that
-     * had usually not changed since the last one. `null` means "stale, rebuild
-     * on next use"; {@link register}/{@link unregister}/{@link clear} all
-     * invalidate it.
-     */
-    this.sortedRulesCache = null;
-    /**
-     * Phrase trie for single-pass multi-word phrase fusion.
-     * Tried at each token position BEFORE other rules, the trie walk
-     * is O(depth) vs O(R × W) for separate rule matching.
-     */
-    this.phraseTrie = new PhraseTrie();
-    this.options = { ...DEFAULT_OPTIONS, ...options };
-  }
-  // ── Rule Management ──────────────────────────────────────────────────────
-  /**
-   * Register a normalization rule.
-   *
-   * Rules are sorted by priority (descending) on each {@link normalize} call.
-   * Multiple rules can share the same priority, they are tried in registration
-   * order when priorities are equal.
-   *
-   * @param rule - The rule to register
-   */
-  register(rule) {
-    this.rules.push(rule);
-    this.sortedRulesCache = null;
-  }
-  /**
-   * Unregister a normalization rule by its {@link NormalizerRule.name | name}.
-   *
-   * If multiple rules share the same name, all are removed. This is safe to
-   * call with a name that doesn't match any rule, it simply has no effect.
-   *
-   * @param ruleName - The name of the rule to remove
-   */
-  unregister(ruleName) {
-    this.rules = this.rules.filter((r) => r.name !== ruleName);
-    this.sortedRulesCache = null;
-  }
-  /**
-   * Remove all registered rules, resetting the normalizer to its initial state.
-   * Also clears the phrase trie.
-   */
-  clear() {
-    this.rules = [];
-    this.sortedRulesCache = null;
-    this.phraseTrie = new PhraseTrie();
-  }
-  /**
-   * Priority-sorted view of {@link rules} (descending priority; registration
-   * order preserved for ties, since {@link Array.prototype.sort} is stable).
-   * Cached until the next mutation. See {@link sortedRulesCache}.
-   */
-  getSortedRules() {
-    if (this.sortedRulesCache === null) {
-      this.sortedRulesCache = [...this.rules].sort((a, b) => b.priority - a.priority);
-    }
-    return this.sortedRulesCache;
-  }
-  /**
-   * Get the number of currently registered rules (excludes phrase trie entries).
-   */
-  get ruleCount() {
-    return this.rules.length;
-  }
-  // ── Phrase Registration ────────────────────────────────────────────────
-  /**
-   * Register a multi-word phrase for fusion into a single compound token.
-   *
-   * This is the preferred way to add phrase patterns. It inserts into the
-   * internal {@link PhraseTrie}, which collapses all phrase rules into a
-   * single O(depth) trie walk per position, no separate rule scanning.
-   *
-   * @param phrase    - Multi-word phrase (e.g., "to the power of", "abyssal whip")
-   * @param tokenType - Target token type after fusion (e.g., "CARET", "ITEM")
-   */
-  addPhrase(phrase, tokenType) {
-    this.phraseTrie.addPhrase(phrase, tokenType);
-  }
-  /**
-   * Check whether a word can start any registered phrase.
-   *
-   * Used by {@link implicitMultiplyRule} to suppress `*` insertion
-   * before phrase-starting identifiers (e.g., "2 power of 3" → `2 ^ 3`,
-   * not `2 * power of 3`). Delegates to {@link PhraseTrie.canStart}.
-   */
-  /**
-   * Get all registered phrases and their target token types.
-   *
-   * Exposes the full phrase trie structure for diagnostic rendering
-   * in the playground's NormalizerTab. Returns ALL registered phrases,
-   * not just the ones that matched in the last evaluation.
-   */
-  getPhrases() {
-    return this.phraseTrie.getAllPhrases();
-  }
-  canStartPhrase(word) {
-    return this.phraseTrie.canStart(word);
-  }
-  // ── Normalization ────────────────────────────────────────────────────────
-  /**
-   * Normalize a token stream by applying all registered rules.
-   *
-   * ## Algorithm
-   * Applies rules greedily left-to-right in multiple passes:
-   * 1. Sort rules by priority (descending)
-   * 2. Walk the token stream left to right
-   * 3. At each position, try rules in priority order
-   * 4. On match: consume matched tokens, insert replacements, restart from insert point
-   * 5. On no match: pass token through unchanged
-   * 6. Repeat until a full pass produces no changes, or maxPasses is reached
-   *
-   * ## Fusion tracking
-   * When a rule consumes more tokens than it produces, the normalizer calls
-   * `onFusion` with a {@link TokenFusion} record for diagnostic collection.
-   * This populates {@link NormalizerOutput.fusions} in the playground pipeline view.
-   *
-   * ## Safety
-   * If the normalized token count exceeds {@link NormalizerOptions.maxTokens},
-   * an Error is thrown to prevent memory exhaustion from runaway rule expansion.
-   *
-   * @param tokens   - Raw tokens from the lexer
-   * @param onFusion - Optional fusion callback (overrides {@link NormalizerOptions.onFusion})
-   * @returns Normalized tokens ready for parsing
-   * @throws {Error} If the normalized token count exceeds maxTokens
-   */
-  normalize(tokens, onFusion) {
-    if (tokens.length === 0) return tokens;
-    const sorted = this.getSortedRules();
-    const fusionHandler = onFusion ?? this.options.onFusion;
-    const maxPasses = this.options.maxPasses;
-    const maxTokens = this.options.maxTokens;
-    let current = tokens;
-    let changed = true;
-    let passCount = 0;
-    while (changed && passCount < maxPasses) {
-      changed = false;
-      passCount++;
-      const result = [];
-      let pos = 0;
-      while (pos < current.length) {
-        let matched = false;
-        const tid = current[pos].typeId;
-        if (tid >= NON_WORD_TABLE.length || NON_WORD_TABLE[tid] === 0) {
-          const trieMatch = this.phraseTrie.matchAt(current, pos);
-          if (trieMatch) {
-            const sourceTokens = current.slice(pos, pos + trieMatch.consumed);
-            for (const rt of trieMatch.replacement) {
-              result.push(rt);
-            }
-            if (trieMatch.consumed > 1 && trieMatch.replacement.length === 1) {
-              recordSourceSpan(trieMatch.replacement[0], sourceTokens);
-              fusionHandler({
-                rule: trieMatch.ruleName ?? "phrase-trie",
-                sourceTokens,
-                fusedToken: trieMatch.replacement[0]
-              });
-            }
-            pos += trieMatch.consumed;
-            changed = true;
-            continue;
-          }
-        }
-        for (const rule of sorted) {
-          const match = rule.match(current, pos);
-          if (match) {
-            const sourceTokens = current.slice(pos, pos + match.consumed);
-            for (const rt of match.replacement) {
-              result.push(rt);
-            }
-            if (match.consumed > 1 && match.replacement.length === 1) {
-              recordSourceSpan(match.replacement[0], sourceTokens);
-              fusionHandler({
-                rule: rule.name,
-                sourceTokens,
-                fusedToken: match.replacement[0]
-              });
-            } else if (match.consumed > 1 && match.replacement.length < match.consumed) {
-              for (const rt of match.replacement) {
-                fusionHandler({
-                  rule: rule.name,
-                  sourceTokens,
-                  fusedToken: rt
-                });
-              }
-            }
-            pos += match.consumed;
-            changed = true;
-            matched = true;
-            break;
-          }
-        }
-        if (!matched) {
-          result.push(current[pos]);
-          pos++;
-        }
-      }
-      if (result.length > maxTokens) {
-        throw chunkB4HBEFTB_cjs.ErrorFactory.validation(
-          "NORMALIZED_TOKEN_LIMIT_EXCEEDED",
-          `Normalized token count (${result.length}) exceeds safety limit (${maxTokens})`,
-          { tokenCount: result.length, maxTokens }
-        );
-      }
-      current = result;
-    }
-    return current;
-  }
-};
-
-// src/normalizer/PhraseTrie.ts
-var PhraseTrie = class {
-  constructor() {
-    /**
-     * First words that can start any registered phrase (all lowercase).
-     * O(1) quick-reject: if `tokens[pos].value.toLowerCase()` isn't here,
-     * no phrase can match at this position.
-     */
-    this.startWords = /* @__PURE__ */ new Set();
-    /**
-     * Root maps first word → child node.
-     * Two-level root avoids an unnecessary intermediate TrieNode.
-     */
-    this.root = /* @__PURE__ */ new Map();
-  }
-  // ── Registration ──────────────────────────────────────────────────────
-  /**
-   * Register a phrase for fusion into a single compound token.
-   *
-   * @param phrase    - Multi-word phrase (e.g., "to the power of")
-   * @param tokenType - Target token type after fusion (e.g., "CARET")
-   */
-  addPhrase(phrase, tokenType) {
-    const words = phrase.toLowerCase().trim().split(/\s+/);
-    if (words.length === 0 || words[0] === "") return;
-    this.startWords.add(words[0]);
-    const firstWord = words[0];
-    let node;
-    if (this.root.has(firstWord)) {
-      node = this.root.get(firstWord);
-    } else {
-      node = { children: /* @__PURE__ */ new Map(), terminal: null };
-      this.root.set(firstWord, node);
-    }
-    if (words.length === 1) {
-      node.terminal = { tokenType, phrase, consumed: 1 };
-      return;
-    }
-    for (let i = 1; i < words.length; i++) {
-      const word = words[i];
-      if (!node.children.has(word)) {
-        node.children.set(word, { children: /* @__PURE__ */ new Map(), terminal: null });
-      }
-      node = node.children.get(word);
-    }
-    node.terminal = { tokenType, phrase, consumed: words.length };
-  }
-  // ── Matching ──────────────────────────────────────────────────────────
-  /**
-   * Attempt to match a phrase starting at `pos` in the token stream.
-   *
-   * Walks the trie one token at a time, tracking the deepest terminal
-   * node reached. Returns the longest match found, or `null` if no
-   * phrase starts at this position.
-   *
-   * @param tokens - The current token stream
-   * @param pos    - Position to attempt matching from
-   * @returns The longest {@link NormalizerMatch}, or `null` on no match
-   */
-  matchAt(tokens, pos) {
-    if (pos >= tokens.length) return null;
-    const firstWord = tokens[pos].value.toLowerCase();
-    if (!this.startWords.has(firstWord)) return null;
-    let node = this.root.get(firstWord);
-    if (!node) return null;
-    let best = null;
-    let depth = 1;
-    if (node.terminal) {
-      const sourceTokens = tokens.slice(pos, pos + 1);
-      best = {
-        consumed: 1,
-        replacement: [createFusedToken(node.terminal.tokenType, node.terminal.phrase, sourceTokens)],
-        ruleName: node.terminal.phrase
-      };
-    }
-    for (let i = pos + 1; i < tokens.length && node?.children; i++) {
-      const word = tokens[i].value.toLowerCase();
-      node = node.children.get(word);
-      if (!node) break;
-      depth++;
-      if (node.terminal) {
-        const sourceTokens = tokens.slice(pos, pos + depth);
-        best = {
-          consumed: depth,
-          replacement: [
-            createFusedToken(node.terminal.tokenType, node.terminal.phrase, sourceTokens)
-          ],
-          ruleName: node.terminal.phrase
-        };
-      }
-    }
-    return best;
-  }
-  // ── Introspection ─────────────────────────────────────────────────────
-  /** Number of unique first words (not total phrases). */
-  get size() {
-    return this.root.size;
-  }
-  /**
-   * Return all registered phrases and their target token types.
-   *
-   * Used by diagnostic mode to expose the complete trie structure to the
-   * playground's NormalizerTab for rendering ALL registered phrases
-   * (not just the ones that matched in this evaluation).
-   */
-  getAllPhrases() {
-    const result = {};
-    const collect = (node, path) => {
-      if (node.terminal) {
-        result[path.join(" ")] = node.terminal.tokenType;
-      }
-      for (const [word, child] of node.children) {
-        collect(child, [...path, word]);
-      }
-    };
-    for (const [firstWord, node] of this.root) {
-      collect(node, [firstWord]);
-    }
-    return result;
-  }
-  /** Check if any phrase starts with this word (case-insensitive). */
-  canStart(word) {
-    return this.startWords.has(word.toLowerCase());
-  }
-};
-
-// src/normalizer/BuiltinNormalizerRules.ts
-var RATE_DENOMINATOR_WORDS = /* @__PURE__ */ new Set(["per", "a", "an", "each", "every"]);
-var PHRASE_START_WORDS = /* @__PURE__ */ new Set([
-  "to",
-  "power",
-  "increase",
-  "decrease",
-  "times",
-  "multiply",
-  "divide",
-  "by"
-]);
-function implicitMultiplyRule(priority = 50, canStart) {
-  const phraseGuard = canStart ?? ((word) => PHRASE_START_WORDS.has(word.toLowerCase()));
-  return {
-    name: "implicit:multiply",
-    priority,
-    match(tokens, pos) {
-      if (pos + 1 >= tokens.length) return null;
-      const t = tokens[pos];
-      const next = tokens[pos + 1];
-      const nextValue = next.value.toLowerCase();
-      if (phraseGuard(nextValue)) return null;
-      if (RATE_DENOMINATOR_WORDS.has(nextValue) && tokens[pos + 2]?.type === "UNIT") return null;
-      const triggers = (t.type === "NUMBER" || t.type === "RPAREN") && (next.type === "IDENT" || next.type === "LPAREN" || next.type === "PI" || next.type === "E");
-      if (!triggers) return null;
-      const starToken = new chunkZMW6NU2K_cjs.LexerToken(
-        "STAR",
-        chunkQFTDTX6K_cjs.tokenTypeId("STAR"),
-        "*",
-        "*",
-        next.offset,
-        0,
-        next.line,
-        next.col
-      );
-      return { consumed: 1, replacement: [t, starToken] };
-    }
-  };
-}
-function isInsideRangeContext(tokens, pos) {
-  const safeStack = [];
-  for (let i = 0; i < pos; i++) {
-    const t = tokens[i];
-    if (t.type === "LBRACKET") {
-      safeStack.push(true);
-    } else if (t.type === "LPAREN") {
-      const prev = tokens[i - 1];
-      const opensMapReduceCall = !!prev && (prev.type === "MAP" || prev.type === "REDUCE" || prev.type === "SUM_FN" || prev.type === "PROD_FN" || prev.type === "IDENT" && (prev.value.toLowerCase() === "map" || prev.value.toLowerCase() === "reduce" || prev.value.toLowerCase() === "sum" || prev.value.toLowerCase() === "prod"));
-      safeStack.push(opensMapReduceCall);
-    } else if (t.type === "RBRACKET" || t.type === "RPAREN") {
-      safeStack.pop();
-    }
-  }
-  return safeStack.length > 0 && safeStack[safeStack.length - 1];
-}
-function createBuiltinNormalizerRules() {
-  return [
-    // ── Implicit operator insertion (priority 50) ──
-    implicitMultiplyRule()
-  ];
-}
-var BUILTIN_PHRASES = {
-  "to the power of": "CARET",
-  "power of": "CARET",
-  "increase by": "INCREASE_BY",
-  "decrease by": "DECREASE_BY",
-  "times by": "TIMES_BY",
-  "multiply by": "MULTIPLY_BY",
-  "divide by": "DIVIDE_BY",
-  // The past-tense spellings, which is how the operation is usually written
-  // out: "3 multiplied by 4". Same tokens, so no new parselets. Both this
-  // branch and the parity branch added "multiplied by" independently; the
-  // merge kept both copies and the locale table rejected the duplicate key.
-  "multiplied by": "MULTIPLY_BY",
-  "divided by": "DIVIDE_BY"
-};
-
-exports.BUILTIN_PHRASES = BUILTIN_PHRASES;
-exports.PhraseTrie = PhraseTrie;
-exports.TokenNormalizer = TokenNormalizer;
-exports.createBuiltinNormalizerRules = createBuiltinNormalizerRules;
-exports.createFusedToken = createFusedToken;
-exports.implicitMultiplyRule = implicitMultiplyRule;
-exports.isInsideRangeContext = isInsideRangeContext;
-//# sourceMappingURL=chunk-CUR2WLI4.cjs.map
-//# sourceMappingURL=chunk-CUR2WLI4.cjs.map