solve-engine 2.32.0 → 2.33.0

package/dist/worker.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/worker/client.ts","../src/worker/serialize.ts","../src/worker/runtime.ts","../src/worker/transport.ts"],"names":["resolveDateOrderForWorker","config","date","resolveDateOrderPolicy","DEFAULT_CONFIG","WorkerEngineClient","transport","raw","options","id","resolve","reject","input","signal","parsing","parseOptions","lines","expression","listener","error","workerTerminatedError","entry","method","args","workerCancelledError","onAbort","message","value","deserializeEngineError","apply","createWorkerEngine","client","nonFiniteTag","n","serializeMatrix","m","cells","cell","formatSymbolic","serializeValue","settings","reading","dto","formatValue","r","c","toHexString","formatColour","pt","ip","serializeMaybe","serializeInlineSolve","solve","serializeParsedLine","line","serializeParsingResult","result","resolvePackages","available","names","byName","pkg","resolved","name","ErrorFactory","WorkerErrorCodes","startWorkerRuntime","BUILTIN_PACKAGES","engine","formatting","inFlight","retainedLines","documentController","stopEventPump","post","fail","serializeEngineError","normalizeUnknownError","retainLines","map","text","index","handleAsyncEvent","eng","event","lineNumber","startEventPump","reader","done","handleInit","packages","ExpressionEngine","DEFAULT_FORMATTING_SETTINGS","runMethod","handleRequest","controller","cloneMessage","createLinkedTransports","clientHandler","hostHandler","alive","deliver","target","cloned","handler","eventTargetTransport","messagePortTransport","port"],"mappings":"4oCA8IA,SAASA,CAAAA,CAA0BC,CAAAA,CAA4E,CAC9G,GAAIA,CAAAA,EAAQ,IAAA,EAAM,UAAA,GAAe,QAAA,CAAU,OAAOA,CAAAA,CAClD,IAAMC,CAAAA,CAAO,CAAE,GAAGD,CAAAA,CAAO,IAAA,CAAM,UAAA,CAAYE,CAAAA,CAAuB,CAAE,GAAGC,GAAAA,CAAe,IAAA,CAAM,GAAGH,CAAAA,CAAO,IAAK,CAAC,CAAA,CAAE,KAAM,CAAA,CACpH,cAAOC,CAAAA,CAAK,WAAA,CACL,CAAE,GAAGD,CAAAA,CAAQ,IAAA,CAAAC,CAAK,CAC1B,CAEA,IAAMG,CAAAA,CAAN,KAAiD,CAWhD,WAAA,CAAYC,CAAAA,CAA4B,CATxC,KAAQ,MAAA,CAAS,CAAA,CACjB,IAAA,CAAiB,OAAA,CAAU,IAAI,GAAA,CAI/B,IAAA,CAAiB,iBAAA,CAAoB,IAAI,GAAA,CACzC,IAAA,CAAiB,mBAAA,CAAsB,IAAI,GAAA,CAC3C,IAAA,CAAQ,UAAA,CAAa,KAAA,CAGpB,KAAK,SAAA,CAAYA,CAAAA,CACjB,IAAA,CAAK,SAAA,CAAU,SAAA,CAAWC,CAAAA,EAAQ,IAAA,CAAK,SAAA,CAAUA,CAAG,CAAC,EACtD,CAGA,IAAA,CAAKC,CAAAA,CAA6C,CACjD,IAAMC,EAAK,IAAA,CAAK,MAAA,EAAA,CAChB,OAAO,IAAI,OAAA,CAAc,CAACC,CAAAA,CAASC,CAAAA,GAAW,CAC7C,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAIF,CAAAA,CAAI,CAAE,OAAA,CAAS,IAAMC,CAAAA,GAAW,MAAA,CAAAC,CAAO,CAAC,CAAA,CACzD,IAAA,CAAK,SAAA,CAAU,WAAA,CAAY,CAC1B,IAAA,CAAM,MAAA,CACN,EAAA,CAAAF,CAAAA,CACA,UAAA,CAAYD,CAAAA,CAAQ,UAAA,CACpB,WAAA,CAAaA,EAAQ,WAAA,CACrB,MAAA,CAAQR,CAAAA,CAA0BQ,CAAAA,CAAQ,MAAM,CAAA,CAChD,QAAA,CAAUA,CAAAA,CAAQ,SAClB,UAAA,CAAYA,CAAAA,CAAQ,UACrB,CAAC,EACF,CAAC,CACF,CAEA,cACCI,CAAAA,CACAJ,CAAAA,CACmC,CAGnC,GAAM,CAAE,MAAA,CAAAK,CAAAA,CAAQ,GAAGC,CAAQ,CAAA,CAAIN,CAAAA,EAAW,EAAC,CACrCO,CAAAA,CAAe,MAAA,CAAO,IAAA,CAAKD,CAAO,CAAA,CAAE,MAAA,CAAS,CAAA,CAAKA,CAAAA,CAAoC,MAAA,CAC5F,OAAO,IAAA,CAAK,IAAA,CAA8B,gBAAiB,CAACF,CAAAA,CAAOG,CAAY,CAAA,CAAGF,CAAM,CACzF,CAEA,aAAA,CAAcG,EAAiBR,CAAAA,CAA8D,CAC5F,OAAO,IAAA,CAAK,IAAA,CAA6B,eAAA,CAAiB,CAACQ,CAAK,CAAA,CAAGR,CAAAA,EAAS,MAAM,CACnF,CAEA,kBAAA,CAAmBS,CAAAA,CAAoBT,CAAAA,CAA6D,CACnG,OAAO,IAAA,CAAK,IAAA,CAA4B,oBAAA,CAAsB,CAACS,CAAU,CAAA,CAAGT,CAAAA,EAAS,MAAM,CAC5F,CAEA,UAAA,CAAWU,CAAAA,CAA4D,CACtE,OAAA,IAAA,CAAK,iBAAA,CAAkB,GAAA,CAAIA,CAAQ,CAAA,CAC5B,IAAM,IAAA,CAAK,iBAAA,CAAkB,MAAA,CAAOA,CAAQ,CACpD,CAEA,YAAA,CAAaA,CAAAA,CAAyD,CACrE,OAAA,IAAA,CAAK,mBAAA,CAAoB,GAAA,CAAIA,CAAQ,CAAA,CAC9B,IAAM,IAAA,CAAK,mBAAA,CAAoB,MAAA,CAAOA,CAAQ,CACtD,CAEA,SAAA,EAAkB,CACjB,GAAI,IAAA,CAAK,UAAA,CAAY,OACrB,IAAA,CAAK,UAAA,CAAa,IAAA,CAClB,IAAMC,CAAAA,CAAQC,GAAsB,CACpC,IAAA,IAAWC,CAAAA,IAAS,IAAA,CAAK,OAAA,CAAQ,MAAA,EAAO,CACvC,IAAA,CAAK,MAAA,CAAOA,CAAK,CAAA,CACjBA,CAAAA,CAAM,MAAA,CAAOF,CAAK,CAAA,CAEnB,IAAA,CAAK,QAAQ,KAAA,EAAM,CAGnB,IAAA,CAAK,iBAAA,CAAkB,KAAA,EAAM,CAC7B,IAAA,CAAK,mBAAA,CAAoB,OAAM,CAC/B,IAAA,CAAK,SAAA,CAAU,SAAA,GAChB,CAGQ,IAAA,CAAQG,CAAAA,CAAsBC,EAAyBV,CAAAA,CAAkC,CAChG,GAAI,IAAA,CAAK,UAAA,CAAY,OAAO,OAAA,CAAQ,MAAA,CAAOO,CAAAA,EAAuB,CAAA,CAClE,GAAIP,CAAAA,EAAQ,OAAA,CAAS,OAAO,OAAA,CAAQ,OAAOW,CAAAA,CAAqBF,CAAM,CAAC,CAAA,CAEvE,IAAMb,CAAAA,CAAK,IAAA,CAAK,MAAA,EAAA,CAChB,OAAO,IAAI,OAAA,CAAW,CAACC,CAAAA,CAASC,CAAAA,GAAW,CAC1C,IAAMU,CAAAA,CAAwB,CAAE,OAAA,CAASX,CAAAA,CAAqC,MAAA,CAAAC,CAAO,CAAA,CAErF,GAAIE,CAAAA,CAAQ,CACX,IAAMY,CAAAA,CAAU,IAAY,CAEtB,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAIhB,CAAE,IACxB,IAAA,CAAK,OAAA,CAAQ,MAAA,CAAOA,CAAE,CAAA,CACtB,IAAA,CAAK,SAAA,CAAU,WAAA,CAAY,CAAE,IAAA,CAAM,QAAA,CAAU,EAAA,CAAAA,CAAG,CAAC,CAAA,CACjDE,CAAAA,CAAOa,CAAAA,CAAqBF,CAAM,CAAC,CAAA,EACpC,CAAA,CACAD,CAAAA,CAAM,MAAA,CAASR,CAAAA,CACfQ,CAAAA,CAAM,OAAA,CAAUI,CAAAA,CAChBZ,CAAAA,CAAO,gBAAA,CAAiB,OAAA,CAASY,CAAAA,CAAS,CAAE,IAAA,CAAM,IAAK,CAAC,EACzD,CAEA,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAIhB,CAAAA,CAAIY,CAAK,CAAA,CAC1B,KAAK,SAAA,CAAU,WAAA,CAAY,CAAE,IAAA,CAAM,SAAA,CAAW,EAAA,CAAAZ,CAAAA,CAAI,MAAA,CAAAa,EAAQ,IAAA,CAAAC,CAAK,CAAC,EACjE,CAAC,CACF,CAGQ,SAAA,CAAUhB,CAAAA,CAAoB,CACrC,IAAMmB,CAAAA,CAAUnB,CAAAA,CAChB,OAAQmB,CAAAA,CAAQ,IAAA,EACf,KAAK,OAAA,CACL,KAAK,QAAA,CAAU,CACd,IAAMC,CAAAA,CAAQD,CAAAA,CAAQ,OAAS,QAAA,CAAWA,CAAAA,CAAQ,KAAA,CAAQ,MAAA,CAC1D,IAAA,CAAK,MAAA,CAAOA,CAAAA,CAAQ,EAAA,CAAKL,GAAUA,CAAAA,CAAM,OAAA,CAAQM,CAAK,CAAC,CAAA,CACvD,KACD,CACA,KAAK,OAAA,CACJ,IAAA,CAAK,MAAA,CAAOD,CAAAA,CAAQ,EAAA,CAAKL,CAAAA,EAAUA,CAAAA,CAAM,MAAA,CAAOO,IAAuBF,CAAAA,CAAQ,KAAK,CAAC,CAAC,CAAA,CACtF,MACD,KAAK,cAAA,CAIJ,QAAWR,CAAAA,IAAY,CAAC,GAAG,IAAA,CAAK,iBAAiB,CAAA,CAAGA,CAAAA,CAASQ,CAAAA,CAAQ,KAAK,CAAA,CAC1E,MACD,KAAK,aAAA,CACJ,IAAA,IAAWR,CAAAA,IAAY,CAAC,GAAG,IAAA,CAAK,mBAAmB,CAAA,CAClDA,CAAAA,CAAS,CACR,QAAA,CAAUQ,CAAAA,CAAQ,QAAA,CAClB,UAAWA,CAAAA,CAAQ,SAAA,CACnB,KAAA,CAAOE,GAAAA,CAAuBF,CAAAA,CAAQ,KAAK,CAC5C,CAAC,EAEF,KACF,CACD,CAGQ,MAAA,CAAOjB,CAAAA,CAAYoB,CAAAA,CAA8C,CACxE,IAAMR,EAAQ,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAIZ,CAAE,CAAA,CAC5BY,CAAAA,GACL,IAAA,CAAK,OAAA,CAAQ,MAAA,CAAOZ,CAAE,CAAA,CACtB,IAAA,CAAK,MAAA,CAAOY,CAAK,CAAA,CACjBQ,CAAAA,CAAMR,CAAK,CAAA,EACZ,CAGQ,MAAA,CAAOA,CAAAA,CAA6B,CACvCA,CAAAA,CAAM,MAAA,EAAUA,CAAAA,CAAM,SAASA,CAAAA,CAAM,MAAA,CAAO,mBAAA,CAAoB,OAAA,CAASA,CAAAA,CAAM,OAAO,EAC3F,CACD,EAeA,eAAsBS,CAAAA,CAAmBtB,CAAAA,CAAqD,CAC7F,IAAMuB,CAAAA,CAAS,IAAI1B,CAAAA,CAAmBG,CAAAA,CAAQ,SAAS,CAAA,CACvD,OAAA,MAAMuB,CAAAA,CAAO,IAAA,CAAKvB,CAAO,CAAA,CAClBuB,CACR,CC/RA,SAASC,CAAAA,CAAaC,CAAAA,CAA6C,CAClE,OAAOA,CAAAA,CAAI,CAAA,CAAI,WAAaA,CAAAA,CAAI,CAAA,CAAI,WAAA,CAAc,KACnD,CAGA,SAASC,CAAAA,CAAgBC,CAAAA,CAAiC,CACzD,IAAMC,CAAAA,CAAQD,CAAAA,CAAE,IAAA,CAAK,GAAA,CAAKE,CAAAA,EAOrB,OAAOA,CAAAA,EAAS,QAAA,EAAYA,CAAAA,GAAS,IAAA,CAAaC,GAAAA,CAAeD,CAAI,CAAA,CACrE,OAAOA,CAAAA,EAAS,UAAY,CAAC,MAAA,CAAO,QAAA,CAASA,CAAI,CAAA,CAAUL,CAAAA,CAAaK,CAAI,CAAA,CACzEA,CACP,CAAA,CACD,OAAO,CAAE,IAAA,CAAMF,CAAAA,CAAE,IAAA,CAAM,IAAA,CAAMA,EAAE,IAAA,CAAM,KAAA,CAAAC,CAAAA,CAAO,WAAA,CAAaD,CAAAA,CAAE,WAAY,CACxE,CAUO,SAASI,CAAAA,CAAeZ,CAAAA,CAAca,CAAAA,CAAsD,CAClG,IAAMC,CAAAA,CAAUd,CAAAA,CAAM,UAAS,CACzBe,CAAAA,CAA6B,CAClC,IAAA,CAAMf,CAAAA,CAAM,IAAA,CACZ,IAAA,CAAMgB,CAAAA,CAAYhB,EAAOa,CAAQ,CAAA,CAIjC,MAAA,CAAQ,MAAA,CAAO,QAAA,CAASC,CAAO,CAAA,CAAIA,CAAAA,CAAU,CAC9C,CAAA,CACK,MAAA,CAAO,QAAA,CAASA,CAAO,CAAA,GAC3BC,CAAAA,CAAI,SAAA,CAAYV,CAAAA,CAAaS,CAAO,CAAA,CAAA,CAGjCd,CAAAA,CAAM,IAAA,GAAS,MAAA,GAAWe,CAAAA,CAAI,IAAA,CAAOf,CAAAA,CAAM,MAC3CA,CAAAA,CAAM,QAAA,GAAa,MAAA,GAAWe,CAAAA,CAAI,QAAA,CAAWf,CAAAA,CAAM,QAAA,CAAA,CAInDA,CAAAA,CAAM,QAAU,MAAA,GAAWe,CAAAA,CAAI,KAAA,CAAQf,CAAAA,CAAM,KAAA,CAAA,CAC7CA,CAAAA,CAAM,IAAA,GAAS,MAAA,GAAWe,EAAI,IAAA,CAAOf,CAAAA,CAAM,IAAA,CAAA,CAE/C,IAAMpB,CAAAA,CAAMoB,CAAAA,CAAM,KAAA,CAClB,GAAI,OAAOpB,CAAAA,EAAQ,QAAA,CAIlBmC,CAAAA,CAAI,MAAA,CAASnC,CAAAA,CAAI,QAAA,EAAS,CAAA,KAAA,GAChBoB,EAAM,IAAA,GAAS,CAAA,CACzBe,CAAAA,CAAI,MAAA,CAASR,CAAAA,CAAgB3B,CAAiB,CAAA,CAAA,KAAA,GACpCoB,CAAAA,CAAM,OAAS,CAAA,CAAiB,CAC1C,IAAMiB,CAAAA,CAAIrC,CAAAA,CACVmC,CAAAA,CAAI,KAAA,CAAQ,CAAE,IAAKE,CAAAA,CAAE,GAAA,CAAK,GAAA,CAAKA,CAAAA,CAAE,GAAI,EACtC,CAAA,KAAA,GAAWjB,CAAAA,CAAM,IAAA,GAAS,EAAA,CAAkB,CAC3C,IAAMkB,CAAAA,CAAItC,CAAAA,CACVmC,CAAAA,CAAI,MAAA,CAAS,CAAE,GAAA,CAAKI,CAAAA,CAAYD,CAAC,CAAA,CAAG,CAAA,CAAGA,CAAAA,CAAE,CAAA,CAAG,CAAA,CAAGA,EAAE,CAAA,CAAG,CAAA,CAAGA,CAAAA,CAAE,CAAA,CAAG,CAAA,CAAGA,CAAAA,CAAE,CAAA,CAAG,MAAA,CAAQA,EAAE,MAAA,CAAQ,GAAA,CAAKE,CAAAA,CAAaF,CAAC,CAAE,EAC5G,CAAA,KAAA,GAAWlB,CAAAA,CAAM,IAAA,GAAS,EAAA,CAAiB,CAC1C,IAAMkB,CAAAA,CAAItC,CAAAA,CACVmC,CAAAA,CAAI,KAAA,CAAQ,CACX,IAAA,CAAMG,CAAAA,CAAE,IAAA,CACR,MAAA,CAAQA,CAAAA,CAAE,MAAA,CAAO,GAAA,CAAKG,CAAAA,EAAO,CAACA,CAAAA,CAAG,CAAC,CAAA,CAAGA,CAAAA,CAAG,CAAC,CAAC,CAAC,CAAA,CAC3C,MAAOH,CAAAA,CAAE,KAAA,CACT,MAAA,CAAQ,CAACA,CAAAA,CAAE,MAAA,CAAO,CAAC,CAAA,CAAGA,CAAAA,CAAE,MAAA,CAAO,CAAC,CAAC,CAAA,CACjC,KAAA,CAAO,CAACA,CAAAA,CAAE,MAAM,CAAC,CAAA,CAAGA,CAAAA,CAAE,KAAA,CAAM,CAAC,CAAC,CAAA,CAC9B,GAAIA,EAAE,IAAA,GAAS,MAAA,CAAY,CAAE,IAAA,CAAMA,CAAAA,CAAE,IAAK,CAAA,CAAI,EAC/C,EACD,CAAA,KAAA,GAAWlB,CAAAA,CAAM,IAAA,GAAS,EAAA,CAAkB,CAC3C,IAAMsB,CAAAA,CAAK1C,CAAAA,CACXmC,CAAAA,CAAI,MAAA,CAAS,CACZ,GAAIO,CAAAA,CAAG,IAAA,GAAS,MAAA,CAAY,CAAE,IAAA,CAAMA,CAAAA,CAAG,IAAK,CAAA,CAAI,EAAC,CACjD,GAAIA,CAAAA,CAAG,SAAW,MAAA,CAAY,CAAE,MAAA,CAAQA,CAAAA,CAAG,MAAO,CAAA,CAAI,EAAC,CACvD,KAAMN,CAAAA,CAAYhB,CAAK,CAAA,CAAE,OAAA,CAAQ,OAAA,CAAS,EAAE,CAC7C,EACD,CAEA,OAAOe,CACR,CAGA,SAASQ,CAAAA,CAAevB,CAAAA,CAAiCa,CAAAA,CAA6D,CACrH,OAAOb,CAAAA,CAAQY,CAAAA,CAAeZ,CAAAA,CAAOa,CAAQ,CAAA,CAAI,IAClD,CAGA,SAASW,CAAAA,CAAqBC,CAAAA,CAA4BZ,CAAAA,CAAsD,CAC/G,OAAO,CACN,KAAA,CAAOY,CAAAA,CAAM,MACb,GAAA,CAAKA,CAAAA,CAAM,GAAA,CACX,UAAA,CAAYA,CAAAA,CAAM,UAAA,CAClB,UAAA,CAAYA,CAAAA,CAAM,UAAA,CAClB,YAAA,CAAcA,CAAAA,CAAM,YAAA,CACpB,MAAA,CAAQF,CAAAA,CAAeE,CAAAA,CAAM,MAAA,CAAQZ,CAAQ,CAAA,CAC7C,KAAA,CAAOY,CAAAA,CAAM,KAAA,EAAS,IACvB,CACD,CAGO,SAASC,EAAoBC,CAAAA,CAAkBd,CAAAA,CAAqD,CAC1G,OAAO,CACN,UAAA,CAAYc,CAAAA,CAAK,UAAA,CACjB,KAAMA,CAAAA,CAAK,IAAA,CACX,aAAA,CAAeA,CAAAA,CAAK,aAAA,CACpB,WAAA,CAAaA,CAAAA,CAAK,WAAA,CAClB,OAAA,CAASA,CAAAA,CAAK,OAAA,CACd,eAAA,CAAiBA,CAAAA,CAAK,eAAA,CACtB,YAAA,CAAcA,CAAAA,CAAK,aAAa,GAAA,CAAKF,CAAAA,EAAUD,CAAAA,CAAqBC,CAAAA,CAAOZ,CAAQ,CAAC,CAAA,CACpF,UAAA,CAAYc,EAAK,UAAA,CACjB,MAAA,CAAQJ,CAAAA,CAAeI,CAAAA,CAAK,MAAA,CAAQd,CAAQ,CAAA,CAC5C,KAAA,CAAOc,EAAK,KACb,CACD,CAGO,SAASC,CAAAA,CAAuBC,CAAAA,CAAuBhB,CAAAA,CAAwD,CACrH,IAAME,CAAAA,CAA+B,CACpC,KAAA,CAAOc,CAAAA,CAAO,KAAA,CAAM,GAAA,CAAKF,CAAAA,EAASD,EAAoBC,CAAAA,CAAMd,CAAQ,CAAC,CAAA,CACrE,UAAA,CAAYgB,CAAAA,CAAO,UAAA,CACnB,MAAA,CAAQ,CAAC,GAAGA,CAAAA,CAAO,MAAM,CAC1B,CAAA,CAGA,OAAIA,CAAAA,CAAO,WAAA,GAAgB,SAAWd,CAAAA,CAAI,WAAA,CAAcc,CAAAA,CAAO,WAAA,CAAA,CACxDd,CACR,CCjGA,SAASe,CAAAA,CAAgBC,CAAAA,CAA6BC,CAAAA,CAA+C,CACpG,GAAIA,CAAAA,GAAU,MAAA,CAAW,OAAOD,CAAAA,CAChC,IAAME,CAAAA,CAAS,IAAI,GAAA,CAAIF,CAAAA,CAAU,GAAA,CAAKG,CAAAA,EAAQ,CAACA,CAAAA,CAAI,KAAMA,CAAG,CAAC,CAAC,CAAA,CACxDC,CAAAA,CAA6B,EAAC,CACpC,IAAA,IAAWC,KAAQJ,CAAAA,CAAO,CACzB,IAAME,CAAAA,CAAMD,CAAAA,CAAO,GAAA,CAAIG,CAAI,CAAA,CAC3B,GAAI,CAACF,CAAAA,CACJ,MAAMG,GAAAA,CAAa,MAAA,CAClBC,GAAAA,CAAiB,sBAAA,CACjB,qBAAqBF,CAAI,CAAA,qCAAA,CAAA,CACzB,CAAE,IAAA,CAAAA,CAAAA,CAAM,SAAA,CAAW,CAAC,GAAGH,EAAO,IAAA,EAAM,CAAE,CACvC,CAAA,CAEDE,CAAAA,CAAS,IAAA,CAAKD,CAAG,EAClB,CACA,OAAOC,CACR,CAQO,SAASI,CAAAA,CAAmB5D,CAAAA,CAA4BE,CAAAA,CAAgC,EAAC,CAAe,CAC9G,IAAMkD,CAAAA,CAAYlD,CAAAA,CAAQ,QAAA,EAAY2D,CAAAA,CAElCC,EAAkC,IAAA,CAClCC,CAAAA,CAGEC,CAAAA,CAAW,IAAI,GAAA,CAMjBC,CAAAA,CAAgB,IAAI,GAAA,CAQpBC,EAA6C,IAAA,CAG7CC,CAAAA,CAAqC,IAAA,CAEnCC,CAAAA,CAAQhD,CAAAA,EAAuCpB,CAAAA,CAAU,WAAA,CAAYoB,CAAO,EAE5EiD,CAAAA,CAAO,CAAClE,CAAAA,CAAYU,CAAAA,GAAyB,CAClDuD,CAAAA,CAAK,CAAE,IAAA,CAAM,OAAA,CAAS,EAAA,CAAAjE,CAAAA,CAAI,KAAA,CAAOmE,CAAAA,CAAqBC,GAAAA,CAAsB1D,CAAK,CAAC,CAAE,CAAC,EACtF,CAAA,CAQM2D,CAAAA,CAAepD,CAAAA,EAAiD,CACrE,IAAMqD,CAAAA,CAAM,IAAI,GAAA,CAChB,OAAIrD,CAAAA,CAAQ,MAAA,GAAW,eAAA,CACrBA,CAAAA,CAAQ,IAAA,CAAK,CAAC,EAAa,KAAA,CAAM;AAAA,CAAI,EAAE,OAAA,CAAQ,CAACsD,CAAAA,CAAMC,CAAAA,GAAUF,EAAI,GAAA,CAAIE,CAAAA,CAAQ,CAAA,CAAGD,CAAI,CAAC,CAAA,CAC/EtD,CAAAA,CAAQ,MAAA,GAAW,eAAA,CAC5BA,EAAQ,IAAA,CAAK,CAAC,CAAA,CAAe,OAAA,CAAQ,CAACsD,CAAAA,CAAMC,CAAAA,GAAUF,CAAAA,CAAI,GAAA,CAAIE,EAAQ,CAAA,CAAGD,CAAI,CAAC,CAAA,CAE/ED,EAAI,GAAA,CAAI,EAAA,CAAIrD,EAAQ,IAAA,CAAK,CAAC,CAAW,CAAA,CAE/BqD,CACR,CAAA,CAYMG,CAAAA,CAAmB,CAACC,CAAAA,CAAuBC,CAAAA,GAAsC,CACtF,GAAIA,EAAM,IAAA,GAAS,OAAA,CAAS,CAC3BV,CAAAA,CAAK,CACJ,IAAA,CAAM,aAAA,CACN,SAAUU,CAAAA,CAAM,QAAA,CAChB,UAAWA,CAAAA,CAAM,SAAA,CACjB,KAAA,CAAOR,CAAAA,CAAqBC,IAAsBO,CAAAA,CAAM,KAAK,CAAC,CAC/D,CAAC,CAAA,CACD,MACD,CAEA,IAAMpE,EAA6B,EAAC,CACpC,QAAWqE,CAAAA,IAAcD,CAAAA,CAAM,YAAa,CAC3C,IAAMJ,CAAAA,CAAOT,CAAAA,CAAc,IAAIc,CAAU,CAAA,CACzC,GAAIL,CAAAA,GAAS,OACb,GAAI,CACH,IAAMrD,CAAAA,CAAQwD,EAAI,YAAA,CAAaE,CAAAA,CAAYL,CAAI,CAAA,CAC3CrD,CAAAA,EAAOX,EAAM,IAAA,CAAK,CAAE,UAAA,CAAAqE,CAAAA,CAAY,MAAO9C,CAAAA,CAAeZ,CAAAA,CAAO0C,CAAU,CAAE,CAAC,EAC/E,CAAA,KAAQ,CAKR,CACD,CACIrD,CAAAA,CAAM,MAAA,CAAS,GAAG0D,CAAAA,CAAK,CAAE,KAAM,cAAA,CAAgB,KAAA,CAAA1D,CAAM,CAAC,EAC3D,CAAA,CAQMsE,CAAAA,CAAkBH,CAAAA,EAAgC,CACvDV,KAAgB,CAChB,IAAMc,CAAAA,CAASJ,CAAAA,CAAI,gBAAe,CAAE,SAAA,GACpCV,CAAAA,CAAgB,IAAG,CAAQc,CAAAA,CAAO,MAAA,GAAO,CAAA,CAAA,CACnC,SAAY,CACjB,GAAI,CACH,OAAS,CACR,GAAM,CAAE,IAAA,CAAAC,CAAAA,CAAM,KAAA,CAAA7D,CAAM,CAAA,CAAI,MAAM4D,EAAO,IAAA,EAAK,CAC1C,GAAIC,CAAAA,CAAM,OACVN,CAAAA,CAAiBC,CAAAA,CAAKxD,CAAK,EAC5B,CACD,CAAA,KAAQ,CAER,CACD,CAAA,IACD,CAAA,CAEM8D,CAAAA,CAAc/D,KAA+B,CAClD,GAAI,CACH,IAAMgE,IAAWjC,CAAAA,CAAgBC,CAAAA,CAAWhC,GAAAA,CAAQ,QAAQ,EAC5D0C,CAAAA,CAAS,IAAIuB,CAAAA,CAAiB,CAC7B,OAAQjE,GAAAA,CAAQ,UAAA,EAAc,IAAA,CAC9B,WAAA,CAAaA,IAAQ,WAAA,EAAe,CAAA,CAAA,CACpC,OAAQA,GAAAA,CAAQ,MAAA,CAChB,SAAAgE,GAAAA,CACA,QAAA,CAAUlF,CAAAA,CAAQ,QACnB,CAAC,CAAA,CAID6D,CAAAA,CAAa7D,CAAAA,CAAQ,QAAA,CAClB,CAAE,GAAIkB,GAAAA,CAAQ,UAAA,EAAckE,CAAAA,CAA8B,SAAUpF,CAAAA,CAAQ,QAAS,EACrFkB,GAAAA,CAAQ,UAAA,CAIX4D,EAAelB,CAAM,CAAA,CACrBM,CAAAA,CAAK,CAAE,KAAM,OAAA,CAAS,EAAA,CAAIhD,GAAAA,CAAQ,EAAG,CAAC,EACvC,CAAA,MAASP,CAAAA,CAAO,CAIfwD,EAAKjD,GAAAA,CAAQ,EAAA,CAAIP,CAAK,EACvB,CACD,EAEM0E,CAAAA,CAAY,CAACV,CAAAA,CAAuBzD,CAAAA,GAAqC,CAC9E,GAAM,CAAE,MAAA,CAAAJ,CAAAA,CAAQ,KAAAC,CAAK,CAAA,CAAIG,CAAAA,CACzB,OAAQJ,GACP,KAAK,gBACJ,OAAOiC,CAAAA,CAAuB4B,EAAI,aAAA,CAAc5D,CAAAA,CAAK,CAAC,CAAA,CAAaA,EAAK,CAAC,CAAU,CAAA,CAAG8C,CAAU,EACjG,KAAK,eAAA,CACJ,OAAOc,CAAAA,CAAI,cAAc5D,CAAAA,CAAK,CAAC,CAAa,CAAA,CAAE,GAAA,CAAK+B,GAASD,CAAAA,CAAoBC,CAAAA,CAAMe,CAAU,CAAC,EAClG,KAAK,oBAAA,CAGJ,OAAO9B,CAAAA,CAAe4C,EAAI,kBAAA,CAAmB5D,CAAAA,CAAK,CAAC,CAAW,EAAG8C,CAAU,CAAA,CAC5E,QACC,MAAML,GAAAA,CAAa,UAClBC,GAAAA,CAAiB,qBAAA,CACjB,CAAA,wCAAA,EAA2C,MAAA,CAAO3C,CAAM,CAAC,CAAA,CAAA,CAAA,CACzD,CAAE,MAAA,CAAAA,CAAO,CACV,CACF,CACD,CAAA,CAEMwE,EAAiBpE,CAAAA,EAAkC,CACxD,IAAMyD,CAAAA,CAAMf,CAAAA,CACZ,GAAI,CAACe,CAAAA,CAAK,CACTR,CAAAA,CACCjD,EAAQ,EAAA,CACRsC,GAAAA,CAAa,SAAA,CACZC,GAAAA,CAAiB,uBACjB,uEACD,CACD,CAAA,CACA,MACD,CAOAO,CAAAA,EAAoB,KAAA,EAAM,CAO1B,IAAMuB,EAAa,IAAI,eAAA,CACvBvB,CAAAA,CAAqBuB,CAAAA,CACrBxB,EAAgBO,CAAAA,CAAYpD,CAAO,CAAA,CACnC4C,CAAAA,CAAS,IAAI5C,CAAAA,CAAQ,EAAA,CAAIqE,CAAU,CAAA,CACnCZ,EAAI,kBAAA,CAAmBY,CAAAA,CAAW,MAAM,CAAA,CAExC,GAAI,CACH,IAAMpE,CAAAA,CAAQkE,CAAAA,CAAUV,CAAAA,CAAKzD,CAAO,CAAA,CACpCgD,CAAAA,CAAK,CAAE,IAAA,CAAM,SAAU,EAAA,CAAIhD,CAAAA,CAAQ,EAAA,CAAI,KAAA,CAAAC,CAAM,CAAC,EAC/C,OAASR,CAAAA,CAAO,CACfwD,EAAKjD,CAAAA,CAAQ,EAAA,CAAIP,CAAK,EACvB,QAAE,CACDmD,CAAAA,CAAS,MAAA,CAAO5C,CAAAA,CAAQ,EAAE,CAAA,CAC1ByD,CAAAA,CAAI,kBAAA,CAAmB,IAAI,EAC5B,CACD,CAAA,CAEA,OAAA7E,CAAAA,CAAU,SAAA,CAAWC,GAAQ,CAC5B,IAAMmB,CAAAA,CAAUnB,CAAAA,CAChB,OAAQmB,CAAAA,CAAQ,IAAA,EACf,KAAK,OACJ+D,CAAAA,CAAW/D,CAAO,CAAA,CAClB,MACD,KAAK,SAAA,CACJoE,CAAAA,CAAcpE,CAAO,CAAA,CACrB,MACD,KAAK,QAAA,CAIJ4C,CAAAA,CAAS,GAAA,CAAI5C,CAAAA,CAAQ,EAAE,CAAA,EAAG,KAAA,EAAM,CAChC,KACF,CACD,CAAC,CAAA,CAEM,IAAM,CACZ+C,KAAgB,CAChBA,CAAAA,CAAgB,KAChBD,CAAAA,EAAoB,KAAA,GACpBA,CAAAA,CAAqB,IAAA,CACrBD,CAAAA,CAAgB,IAAI,IACpB,IAAA,IAAWwB,CAAAA,IAAczB,CAAAA,CAAS,MAAA,GAAUyB,CAAAA,CAAW,KAAA,EAAM,CAC7DzB,CAAAA,CAAS,OAAM,CACfF,CAAAA,EAAQ,OAAM,CACdA,CAAAA,CAAS,KACT9D,CAAAA,CAAU,SAAA,GACX,CACD,CCvRA,SAAS0F,CAAAA,CAAgBrE,CAAAA,CAAa,CACrC,OAAO,OAAO,UAAA,CAAW,eAAA,EAAoB,UAAA,CAC1C,WAAW,eAAA,CAAgBA,CAAK,EAChC,IAAA,CAAK,KAAA,CAAM,KAAK,SAAA,CAAUA,CAAK,CAAC,CACpC,CAaO,SAASsE,CAAAA,EAA6E,CAC5F,IAAIC,EAAqD,IAAA,CACrDC,CAAAA,CAAmD,IAAA,CACnDC,CAAAA,CAAQ,KAINC,CAAAA,CAAU,CAACC,EAAmD5E,CAAAA,GAA2B,CAC9F,IAAM6E,CAAAA,CAASP,CAAAA,CAAatE,CAAO,CAAA,CACnC,eAAe,IAAM,CACf0E,CAAAA,EACLE,CAAAA,KAAWC,CAAM,EAClB,CAAC,EACF,EAsBA,OAAO,CAAE,OApBuB,CAC/B,WAAA,CAAc7E,GAAY2E,CAAAA,CAAQ,IAAMF,CAAAA,CAAazE,CAAO,EAC5D,SAAA,CAAY8E,CAAAA,EAAY,CACvBN,CAAAA,CAAgBM,EACjB,CAAA,CACA,SAAA,CAAW,IAAM,CAChBJ,EAAQ,MACT,CACD,EAYiB,IAAA,CAVa,CAC7B,YAAc1E,CAAAA,EAAY2E,CAAAA,CAAQ,IAAMH,CAAAA,CAAexE,CAAO,CAAA,CAC9D,SAAA,CAAY8E,CAAAA,EAAY,CACvBL,EAAcK,EACf,CAAA,CACA,SAAA,CAAW,IAAM,CAChBJ,CAAAA,CAAQ,MACT,CACD,CAEsB,CACvB,CAqBO,SAASK,CAAAA,CAAqBH,CAAAA,CAA0C,CAC9E,OAAO,CACN,WAAA,CAAc5E,CAAAA,EAAY4E,CAAAA,CAAO,YAAY5E,CAAO,CAAA,CACpD,SAAA,CAAY8E,CAAAA,EAAY,CACvB,IAAMtF,CAAAA,CAAYkE,GAAmCoB,CAAAA,CAAQpB,CAAAA,CAAM,IAAI,CAAA,CACnE,OAAOkB,CAAAA,CAAO,gBAAA,EAAqB,WACtCA,CAAAA,CAAO,gBAAA,CAAiB,SAAA,CAAWpF,CAAQ,EAE3CoF,CAAAA,CAAO,SAAA,CAAYpF,CAAAA,CAEpBoF,CAAAA,CAAO,UACR,CAAA,CAGA,UAAW,IAAM,CAChBA,EAAO,SAAA,IAAY,CACnBA,CAAAA,CAAO,KAAA,KACR,CACD,CACD,CAmBO,SAASI,GAAqBC,CAAAA,CAAwC,CAC5E,OAAO,CACN,YAAcjF,CAAAA,EAAYiF,CAAAA,CAAK,YAAYjF,CAAO,CAAA,CAClD,UAAY8E,CAAAA,EAAY,CACvBG,CAAAA,CAAK,EAAA,CAAG,UAAYjF,CAAAA,EAAY8E,CAAAA,CAAQ9E,CAAO,CAAC,EACjD,CAAA,CACA,SAAA,CAAW,IAAM,CAChBiF,EAAK,SAAA,IAAY,CACjBA,EAAK,KAAA,KACN,CACD,CACD","file":"worker.js","sourcesContent":["/**\n * The main-side half of the harness: an async proxy of the core evaluate\n * methods.\n *\n * {@link createWorkerEngine} performs the init handshake and resolves once the\n * worker's engine is built, so the returned {@link WorkerEngine} is ready to\n * call. Each call stamps a request id, tracks the pending promise, and settles\n * it when the matching answer arrives, so several requests can be outstanding at\n * once. An `AbortSignal` rejects the local promise and posts a `cancel` for the\n * same id, mapping keystroke-level cancellation onto the boundary rather than\n * re-inventing it.\n */\n\nimport { DEFAULT_CONFIG, type EngineConfigOverride } from \"@solve-js/constants/Configuration\";\nimport { resolveDateOrderPolicy } from \"@solve-js/packages/datetime/DateReading\";\nimport type { UnifiedParsingOptions } from \"@solve-js/types/ParsingResult\";\nimport type { FormattingSettings } from \"@solve-js/format/FormattingSettings\";\nimport type { EngineError } from \"@solve-js/errors\";\nimport {\n\tdeserializeEngineError,\n\tworkerCancelledError,\n\tworkerTerminatedError,\n} from \"@solve-js/errors\";\nimport type { WorkerTransport } from \"./transport\";\nimport type {\n\tWorkerMethod,\n\tWorkerRequestArgs,\n\tWorkerToMainMessage,\n} from \"./protocol\";\nimport type {\n\tSerializedWorkerValue,\n\tSerializedParsedLine,\n\tSerializedParsingResult,\n} from \"./dto\";\n\n/** Configuration for {@link createWorkerEngine}. */\nexport interface WorkerEngineOptions {\n\t/** The channel to the worker runtime. See `worker/transport.ts` for adapters. */\n\ttransport: WorkerTransport;\n\t/** Locale for keywords and number formatting; defaults to English worker-side. */\n\tlocaleCode?: string;\n\t/** Whether the worker builds its engine with diagnostics enabled. */\n\tdiagnostics?: boolean;\n\t/** Config overrides, merged per section over the defaults worker-side. */\n\tconfig?: EngineConfigOverride;\n\t/**\n\t * Names of built-in packages the worker should register. Omitted registers\n\t * them all. Names rather than the packages themselves, since a package\n\t * carries functions that cannot cross a `postMessage` boundary; a host with\n\t * a custom package bakes it into its own worker entry and selects it here by\n\t * name.\n\t */\n\tpackages?: string[];\n\t/** Formatting settings the worker uses when it renders a DTO's display text. */\n\tformatting?: FormattingSettings;\n}\n\n/** Per-call options common to every proxied method. */\nexport interface WorkerCallOptions {\n\t/** Abort the request. Rejects the returned promise and cancels the work worker-side. */\n\tsignal?: AbortSignal;\n}\n\n/**\n * One line whose result changed after a live value resolved worker-side, carried\n * as its freshly re-evaluated {@link SerializedWorkerValue}. The value the host renders\n * against `lineNumber`, recovered worker-side so the main thread needs no further\n * round-trip to display it.\n */\nexport interface WorkerAsyncUpdate {\n\tlineNumber: number;\n\tvalue: SerializedWorkerValue;\n}\n\n/**\n * A live-data resolution that failed worker-side. `error` is the same structured\n * {@link EngineError} an in-process resolver failure would surface, rebuilt from\n * its transported form, so a host branches on `code`/`category` as it always has.\n */\nexport interface WorkerAsyncError {\n\tqueryKey: string;\n\tpackageId: string;\n\terror: EngineError;\n}\n\n/**\n * An async proxy of {@link ExpressionEngine}'s core evaluate methods.\n *\n * Each method mirrors its synchronous counterpart but returns a Promise of the\n * serialisable DTO rather than a live `Value`, and accepts an `AbortSignal`.\n */\nexport interface WorkerEngine {\n\t/** Parse a whole document off-thread. Mirrors `ExpressionEngine.parseDocument`. */\n\tparseDocument(input: string, options?: UnifiedParsingOptions & WorkerCallOptions): Promise<SerializedParsingResult>;\n\t/** Evaluate an array of lines off-thread. Mirrors `ExpressionEngine.evaluateLines`. */\n\tevaluateLines(lines: string[], options?: WorkerCallOptions): Promise<SerializedParsedLine[]>;\n\t/** Evaluate a single expression off-thread. Mirrors `ExpressionEngine.evaluateExpression`. */\n\tevaluateExpression(expression: string, options?: WorkerCallOptions): Promise<SerializedWorkerValue>;\n\t/**\n\t * Subscribe to live-data resolutions that land after a request already\n\t * answered.\n\t *\n\t * A currency, weather or historical-rate value resolves inside the worker some\n\t * time after `parseDocument` returned its pending result. When it does, the\n\t * affected lines are re-evaluated worker-side and their fresh values arrive\n\t * here as one batch. This is a subscription rather than a per-request promise\n\t * because a resolution is tied to no single request: it belongs to whichever\n\t * document is current when the value lands. Returns an unsubscribe function.\n\t */\n\tonResolved(listener: (lines: WorkerAsyncUpdate[]) => void): () => void;\n\t/**\n\t * Subscribe to live-data resolutions that failed. Returns an unsubscribe\n\t * function. See {@link onResolved}; this is its failure channel.\n\t */\n\tonAsyncError(listener: (error: WorkerAsyncError) => void): () => void;\n\t/** Reject every in-flight request and tear the transport down. Idempotent. */\n\tterminate(): void;\n}\n\n/** A promise awaiting one worker answer, plus the abort wiring to unhook when it settles. */\ninterface PendingRequest {\n\tresolve: (value: unknown) => void;\n\treject: (error: unknown) => void;\n\tsignal?: AbortSignal;\n\tonAbort?: () => void;\n}\n\n/**\n * Replaces `date.inputOrder: 'locale'` with the order this side resolves it\n * to, before the config crosses to the worker.\n *\n * `'locale'` means \"ask the reader's machine\", and the reader's machine is\n * this one. A worker re-inferring it would be asking a different environment\n * the same question: a worker thread can carry different `Intl` data (a\n * bundler-provided shim, a small-ICU runtime), so the same document could be\n * read day-first on the main thread and month-first in the worker with nothing\n * to show for it. The resolved order crosses instead, so both sides read the\n * document the same way, and `date.inputLocale` is dropped with it because it\n * has already done its work.\n *\n * Anything else passes through untouched, including an absent config.\n */\nfunction resolveDateOrderForWorker(config: EngineConfigOverride | undefined): EngineConfigOverride | undefined {\n\tif (config?.date?.inputOrder !== \"locale\") return config;\n\tconst date = { ...config.date, inputOrder: resolveDateOrderPolicy({ ...DEFAULT_CONFIG.date, ...config.date }).order };\n\tdelete date.inputLocale;\n\treturn { ...config, date };\n}\n\nclass WorkerEngineClient implements WorkerEngine {\n\tprivate readonly transport: WorkerTransport;\n\tprivate nextId = 1;\n\tprivate readonly pending = new Map<number, PendingRequest>();\n\t// Broadcast subscribers for async resolutions. Sets, not one callback each, so\n\t// several views can watch the same worker; a resolution is not tied to a\n\t// request id, so these live outside `pending`.\n\tprivate readonly resolvedListeners = new Set<(lines: WorkerAsyncUpdate[]) => void>();\n\tprivate readonly asyncErrorListeners = new Set<(error: WorkerAsyncError) => void>();\n\tprivate terminated = false;\n\n\tconstructor(transport: WorkerTransport) {\n\t\tthis.transport = transport;\n\t\tthis.transport.onMessage((raw) => this.onMessage(raw));\n\t}\n\n\t/** Perform the init handshake, resolving once the worker posts `ready`. */\n\tinit(options: WorkerEngineOptions): Promise<void> {\n\t\tconst id = this.nextId++;\n\t\treturn new Promise<void>((resolve, reject) => {\n\t\t\tthis.pending.set(id, { resolve: () => resolve(), reject });\n\t\t\tthis.transport.postMessage({\n\t\t\t\tkind: \"init\",\n\t\t\t\tid,\n\t\t\t\tlocaleCode: options.localeCode,\n\t\t\t\tdiagnostics: options.diagnostics,\n\t\t\t\tconfig: resolveDateOrderForWorker(options.config),\n\t\t\t\tpackages: options.packages,\n\t\t\t\tformatting: options.formatting,\n\t\t\t});\n\t\t});\n\t}\n\n\tparseDocument(\n\t\tinput: string,\n\t\toptions?: UnifiedParsingOptions & WorkerCallOptions,\n\t): Promise<SerializedParsingResult> {\n\t\t// The signal stays main-side and drives a `cancel`; only the parsing\n\t\t// options cross, so an AbortSignal never reaches `postMessage`.\n\t\tconst { signal, ...parsing } = options ?? {};\n\t\tconst parseOptions = Object.keys(parsing).length > 0 ? (parsing as UnifiedParsingOptions) : undefined;\n\t\treturn this.call<SerializedParsingResult>(\"parseDocument\", [input, parseOptions], signal);\n\t}\n\n\tevaluateLines(lines: string[], options?: WorkerCallOptions): Promise<SerializedParsedLine[]> {\n\t\treturn this.call<SerializedParsedLine[]>(\"evaluateLines\", [lines], options?.signal);\n\t}\n\n\tevaluateExpression(expression: string, options?: WorkerCallOptions): Promise<SerializedWorkerValue> {\n\t\treturn this.call<SerializedWorkerValue>(\"evaluateExpression\", [expression], options?.signal);\n\t}\n\n\tonResolved(listener: (lines: WorkerAsyncUpdate[]) => void): () => void {\n\t\tthis.resolvedListeners.add(listener);\n\t\treturn () => this.resolvedListeners.delete(listener);\n\t}\n\n\tonAsyncError(listener: (error: WorkerAsyncError) => void): () => void {\n\t\tthis.asyncErrorListeners.add(listener);\n\t\treturn () => this.asyncErrorListeners.delete(listener);\n\t}\n\n\tterminate(): void {\n\t\tif (this.terminated) return;\n\t\tthis.terminated = true;\n\t\tconst error = workerTerminatedError();\n\t\tfor (const entry of this.pending.values()) {\n\t\t\tthis.unhook(entry);\n\t\t\tentry.reject(error);\n\t\t}\n\t\tthis.pending.clear();\n\t\t// No more resolutions can arrive across a torn-down transport, so drop the\n\t\t// subscribers rather than leaving them referenced for the client's lifetime.\n\t\tthis.resolvedListeners.clear();\n\t\tthis.asyncErrorListeners.clear();\n\t\tthis.transport.terminate();\n\t}\n\n\t/** Dispatch one request and return the promise that settles on its answer. */\n\tprivate call<T>(method: WorkerMethod, args: WorkerRequestArgs, signal?: AbortSignal): Promise<T> {\n\t\tif (this.terminated) return Promise.reject(workerTerminatedError());\n\t\tif (signal?.aborted) return Promise.reject(workerCancelledError(method));\n\n\t\tconst id = this.nextId++;\n\t\treturn new Promise<T>((resolve, reject) => {\n\t\t\tconst entry: PendingRequest = { resolve: resolve as (value: unknown) => void, reject };\n\n\t\t\tif (signal) {\n\t\t\t\tconst onAbort = (): void => {\n\t\t\t\t\t// Nothing to do if the answer already arrived and settled this id.\n\t\t\t\t\tif (!this.pending.has(id)) return;\n\t\t\t\t\tthis.pending.delete(id);\n\t\t\t\t\tthis.transport.postMessage({ kind: \"cancel\", id });\n\t\t\t\t\treject(workerCancelledError(method));\n\t\t\t\t};\n\t\t\t\tentry.signal = signal;\n\t\t\t\tentry.onAbort = onAbort;\n\t\t\t\tsignal.addEventListener(\"abort\", onAbort, { once: true });\n\t\t\t}\n\n\t\t\tthis.pending.set(id, entry);\n\t\t\tthis.transport.postMessage({ kind: \"request\", id, method, args });\n\t\t});\n\t}\n\n\t/** Route one incoming message to the request that is waiting on its id. */\n\tprivate onMessage(raw: unknown): void {\n\t\tconst message = raw as WorkerToMainMessage;\n\t\tswitch (message.kind) {\n\t\t\tcase \"ready\":\n\t\t\tcase \"result\": {\n\t\t\t\tconst value = message.kind === \"result\" ? message.value : undefined;\n\t\t\t\tthis.settle(message.id, (entry) => entry.resolve(value));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase \"error\":\n\t\t\t\tthis.settle(message.id, (entry) => entry.reject(deserializeEngineError(message.error)));\n\t\t\t\tbreak;\n\t\t\tcase \"async-update\":\n\t\t\t\t// A broadcast, not an answer to a request: fan it out to every\n\t\t\t\t// subscriber. A copy of the listener set is iterated so a listener\n\t\t\t\t// that unsubscribes itself mid-callback cannot disturb the walk.\n\t\t\t\tfor (const listener of [...this.resolvedListeners]) listener(message.lines);\n\t\t\t\tbreak;\n\t\t\tcase \"async-error\":\n\t\t\t\tfor (const listener of [...this.asyncErrorListeners]) {\n\t\t\t\t\tlistener({\n\t\t\t\t\t\tqueryKey: message.queryKey,\n\t\t\t\t\t\tpackageId: message.packageId,\n\t\t\t\t\t\terror: deserializeEngineError(message.error),\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t}\n\t}\n\n\t/** Remove a pending request by id and run the settle callback, if it is still pending. */\n\tprivate settle(id: number, apply: (entry: PendingRequest) => void): void {\n\t\tconst entry = this.pending.get(id);\n\t\tif (!entry) return;\n\t\tthis.pending.delete(id);\n\t\tthis.unhook(entry);\n\t\tapply(entry);\n\t}\n\n\t/** Detach an entry's abort listener so a settled request leaves nothing on the signal. */\n\tprivate unhook(entry: PendingRequest): void {\n\t\tif (entry.signal && entry.onAbort) entry.signal.removeEventListener(\"abort\", entry.onAbort);\n\t}\n}\n\n/**\n * Build a worker-backed engine and wait for it to be ready.\n *\n * ```ts\n * const { client, host } = createLinkedTransports();\n * startWorkerRuntime(host);\n * const engine = await createWorkerEngine({ transport: client });\n * const result = await engine.parseDocument(text);\n * ```\n *\n * In production `client` wraps a real `Worker` (see `eventTargetTransport` /\n * `messagePortTransport`), and `startWorkerRuntime` runs inside that worker.\n */\nexport async function createWorkerEngine(options: WorkerEngineOptions): Promise<WorkerEngine> {\n\tconst client = new WorkerEngineClient(options.transport);\n\tawait client.init(options);\n\treturn client;\n}\n","/**\n * Turn live engine results into the clone-safe DTOs the worker harness posts.\n *\n * These functions run on the worker side, just before a result crosses the\n * boundary, and are also what the main side re-runs on a synchronous result to\n * compare the two paths in tests. They are pure and deterministic given the\n * same {@link FormattingSettings}, so a value serialised on either side is\n * byte-for-byte the same DTO.\n */\n\nimport { Value, ValueType, type MatrixData, type MatrixEntry, type RangeData, type ColourData, type ChartData, type IpCidrData } from \"@solve-js/vm/Value\";\nimport { formatValue } from \"@solve-js/format/FormatEngine\";\nimport { toHexString, formatColour } from \"@solve-js/packages/colour/ColourMath\";\nimport type { FormattingSettings } from \"@solve-js/format/FormattingSettings\";\nimport { formatSymbolic } from \"@solve-js/symbolic\";\nimport type { ParsedLine, InlineSolvePosition, ParsingResult } from \"@solve-js/types/ParsingResult\";\nimport type {\n\tSerializedWorkerValue,\n\tSerializedMatrix,\n\tSerializedParsedLine,\n\tSerializedInlineSolve,\n\tSerializedParsingResult,\n} from \"./dto\";\n\n/**\n * The JSON-safe string tag for a non-finite reading. `Infinity`/`-Infinity`/`NaN`\n * cannot cross `JSON` (which turns each into `null`), so this one string form is\n * what survives both `structuredClone` and `JSON`, and a host recovers the value\n * with `Number(tag)`. Shared by the scalar `nonFinite` field and matrix cells.\n */\nfunction nonFiniteTag(n: number): \"Infinity\" | \"-Infinity\" | \"NaN\" {\n\treturn n > 0 ? \"Infinity\" : n < 0 ? \"-Infinity\" : \"NaN\";\n}\n\n/** Project a matrix onto clone-safe cells: finite primitives pass through, symbolic cells and non-finite numbers become strings. */\nfunction serializeMatrix(m: MatrixData): SerializedMatrix {\n\tconst cells = m.data.map((cell: MatrixEntry): number | boolean | string => {\n\t\t// A `SymbolicNode` (the object-typed cell variant) flattens to its display\n\t\t// string. A non-finite number (a `[1/0, 2]` cell) cannot cross JSON any\n\t\t// more than a scalar reading can, so it takes the same string tag rather\n\t\t// than being passed through raw and turned into `null` by `JSON.stringify`\n\t\t// (which would diverge from the `structuredClone` path). A finite number\n\t\t// or a boolean is already clone-safe and passes through.\n\t\tif (typeof cell === \"object\" && cell !== null) return formatSymbolic(cell);\n\t\tif (typeof cell === \"number\" && !Number.isFinite(cell)) return nonFiniteTag(cell);\n\t\treturn cell;\n\t});\n\treturn { rows: m.rows, cols: m.cols, cells, hasSymbolic: m.hasSymbolic };\n}\n\n/**\n * Project a {@link Value} onto a {@link SerializedWorkerValue}.\n *\n * `text` and `number` are set for every value; the type-specific fields are\n * added only where the payload needs them, so the DTO stays minimal and a\n * deep-equal between the two evaluation paths does not trip on a property one\n * side left `undefined`.\n */\nexport function serializeValue(value: Value, settings?: FormattingSettings): SerializedWorkerValue {\n\tconst reading = value.toNumber();\n\tconst dto: SerializedWorkerValue = {\n\t\ttype: value.type,\n\t\ttext: formatValue(value, settings),\n\t\t// A non-finite reading (1/0, 0/0, an overflow) cannot cross JSON, which\n\t\t// turns it into null and breaks the round-trip the DTO guarantees. Keep\n\t\t// `number` finite and name the real value in `nonFinite` instead.\n\t\tnumber: Number.isFinite(reading) ? reading : 0,\n\t};\n\tif (!Number.isFinite(reading)) {\n\t\tdto.nonFinite = nonFiniteTag(reading);\n\t}\n\n\tif (value.unit !== undefined) dto.unit = value.unit;\n\tif (value.timedOut !== undefined) dto.timedOut = value.timedOut;\n\t// The two datetime sidecars cross as themselves: both are plain JSON\n\t// scalars, so the clone guarantee is untouched, and a worker result that\n\t// dropped them would answer a different question from the synchronous one.\n\tif (value.grain !== undefined) dto.grain = value.grain;\n\tif (value.zone !== undefined) dto.zone = value.zone;\n\n\tconst raw = value.value;\n\tif (typeof raw === \"bigint\") {\n\t\t// Covers BigInt values and a Hex value that carries a bigint magnitude:\n\t\t// a base-ten string is the one representation that neither loses\n\t\t// precision nor breaks JSON.\n\t\tdto.bigint = raw.toString();\n\t} else if (value.type === ValueType.Matrix) {\n\t\tdto.matrix = serializeMatrix(raw as MatrixData);\n\t} else if (value.type === ValueType.Range) {\n\t\tconst r = raw as RangeData;\n\t\tdto.range = { min: r.min, max: r.max };\n\t} else if (value.type === ValueType.Colour) {\n\t\tconst c = raw as ColourData;\n\t\tdto.colour = { hex: toHexString(c), r: c.r, g: c.g, b: c.b, a: c.a, format: c.format, css: formatColour(c) };\n\t} else if (value.type === ValueType.Chart) {\n\t\tconst c = raw as ChartData;\n\t\tdto.chart = {\n\t\t\tkind: c.kind,\n\t\t\tpoints: c.points.map((pt) => [pt[0], pt[1]]),\n\t\t\tlabel: c.label,\n\t\t\tdomain: [c.domain[0], c.domain[1]],\n\t\t\trange: [c.range[0], c.range[1]],\n\t\t\t...(c.expr !== undefined ? { expr: c.expr } : {}),\n\t\t};\n\t} else if (value.type === ValueType.IpCidr) {\n\t\tconst ip = raw as IpCidrData;\n\t\tdto.ipCidr = {\n\t\t\t...(ip.addr !== undefined ? { addr: ip.addr } : {}),\n\t\t\t...(ip.prefix !== undefined ? { prefix: ip.prefix } : {}),\n\t\t\ttext: formatValue(value).replace(/^=\\s*/, \"\"),\n\t\t};\n\t}\n\n\treturn dto;\n}\n\n/** Serialise a nullable value, the shape both `result` fields carry. */\nfunction serializeMaybe(value: Value | null | undefined, settings?: FormattingSettings): SerializedWorkerValue | null {\n\treturn value ? serializeValue(value, settings) : null;\n}\n\n/** Project an inline solve onto its DTO, serialising its result. */\nfunction serializeInlineSolve(solve: InlineSolvePosition, settings?: FormattingSettings): SerializedInlineSolve {\n\treturn {\n\t\tstart: solve.start,\n\t\tend: solve.end,\n\t\texpression: solve.expression,\n\t\tlineNumber: solve.lineNumber,\n\t\tcolumnNumber: solve.columnNumber,\n\t\tresult: serializeMaybe(solve.result, settings),\n\t\terror: solve.error ?? null,\n\t};\n}\n\n/** Project a parsed line onto its DTO, serialising its result and every inline solve. */\nexport function serializeParsedLine(line: ParsedLine, settings?: FormattingSettings): SerializedParsedLine {\n\treturn {\n\t\tlineNumber: line.lineNumber,\n\t\ttext: line.text,\n\t\tstartPosition: line.startPosition,\n\t\tendPosition: line.endPosition,\n\t\tisEmpty: line.isEmpty,\n\t\thasInlineSolves: line.hasInlineSolves,\n\t\tinlineSolves: line.inlineSolves.map((solve) => serializeInlineSolve(solve, settings)),\n\t\texpression: line.expression,\n\t\tresult: serializeMaybe(line.result, settings),\n\t\terror: line.error,\n\t};\n}\n\n/** Project a whole parsing result onto its DTO. */\nexport function serializeParsingResult(result: ParsingResult, settings?: FormattingSettings): SerializedParsingResult {\n\tconst dto: SerializedParsingResult = {\n\t\tlines: result.lines.map((line) => serializeParsedLine(line, settings)),\n\t\ttotalLines: result.totalLines,\n\t\terrors: [...result.errors],\n\t};\n\t// The diagnostics report is already the engine's own JSON form, so it\n\t// crosses unchanged; present only when the host asked for it.\n\tif (result.diagnostics !== undefined) dto.diagnostics = result.diagnostics;\n\treturn dto;\n}\n","/**\n * The worker-side half of the harness: it owns an {@link ExpressionEngine} and\n * answers the protocol.\n *\n * {@link startWorkerRuntime} is transport-agnostic, so the same function runs\n * behind a browser `Worker`, a Node `worker_threads` port, or an in-process\n * link. A host's worker entry file is two lines: adapt the environment onto a\n * {@link WorkerTransport} and call this.\n *\n * The runtime never posts a raw {@link Value}. Every result is projected onto a\n * DTO first (`worker/serialize.ts`), and every failure is caught and flattened\n * into a structured error, so a worker-side throw reaches the caller as an\n * `EngineError` rather than a lost promise.\n */\n\nimport { ExpressionEngine } from \"@solve-js/engine/ExpressionEngine\";\nimport type { AsyncResolutionEvent } from \"@solve-js/engine/AsyncResolutionBatcher\";\nimport type { IEnginePackage } from \"@solve-js/api/PackageRegistry\";\nimport { BUILTIN_PACKAGES } from \"@solve-js/packages/builtins\";\nimport { DEFAULT_FORMATTING_SETTINGS, type FormattingSettings } from \"@solve-js/format/FormattingSettings\";\nimport type { CalendarBackend } from \"@solve-js/calendar/CalendarBackend\";\nimport {\n\tErrorFactory,\n\tnormalizeUnknownError,\n\tserializeEngineError,\n\tWorkerErrorCodes,\n} from \"@solve-js/errors\";\nimport { serializeParsingResult, serializeParsedLine, serializeValue } from \"./serialize\";\nimport type { WorkerTransport } from \"./transport\";\nimport type {\n\tMainToWorkerMessage,\n\tInitMessage,\n\tRequestMessage,\n\tWorkerToMainMessage,\n\tAsyncResolvedLine,\n} from \"./protocol\";\n\n/** Options a host bakes into its own worker entry: its custom packages, and its calendar backend. */\nexport interface WorkerRuntimeOptions {\n\t/**\n\t * The packages available to register, defaulting to {@link BUILTIN_PACKAGES}.\n\t * A host with its own package authors a worker entry that passes them here,\n\t * then selects among them by name from the main side. This is how a\n\t * function-carrying package reaches the worker: baked into its bundle, never\n\t * posted across the boundary.\n\t */\n\tpackages?: IEnginePackage[];\n\t/**\n\t * The calendar backend the worker's engine computes dates with, and writes\n\t * them out with, as the engine's own `calendar` option. Defaults to the\n\t * built-in `Date` backend. Baked in here for the same reason a package is:\n\t * a backend is an object of functions and cannot be posted across the\n\t * boundary, so the main side's formatting settings never carry one.\n\t */\n\tcalendar?: CalendarBackend;\n}\n\n/**\n * Resolve the requested package names against the available set.\n *\n * Undefined names means \"all of them\". A name with no match is a configuration\n * failure the caller must see, not a silent omission that would leave a feature\n * quietly missing from every result.\n */\nfunction resolvePackages(available: IEnginePackage[], names: string[] | undefined): IEnginePackage[] {\n\tif (names === undefined) return available;\n\tconst byName = new Map(available.map((pkg) => [pkg.name, pkg]));\n\tconst resolved: IEnginePackage[] = [];\n\tfor (const name of names) {\n\t\tconst pkg = byName.get(name);\n\t\tif (!pkg) {\n\t\t\tthrow ErrorFactory.config(\n\t\t\t\tWorkerErrorCodes.WORKER_UNKNOWN_PACKAGE,\n\t\t\t\t`No package named \"${name}\" is available in this worker runtime`,\n\t\t\t\t{ name, available: [...byName.keys()] },\n\t\t\t);\n\t\t}\n\t\tresolved.push(pkg);\n\t}\n\treturn resolved;\n}\n\n/**\n * Attach the runtime to a transport and start serving.\n *\n * Returns a teardown function that clears the engine and detaches, for a host\n * that reuses a transport or shuts a worker down cleanly.\n */\nexport function startWorkerRuntime(transport: WorkerTransport, options: WorkerRuntimeOptions = {}): () => void {\n\tconst available = options.packages ?? BUILTIN_PACKAGES;\n\n\tlet engine: ExpressionEngine | null = null;\n\tlet formatting: FormattingSettings | undefined;\n\t// One AbortController per in-flight request, so a `cancel` can map onto the\n\t// engine's keystroke signal for exactly the request the caller aborted.\n\tconst inFlight = new Map<number, AbortController>();\n\n\t// The line texts of the current document, keyed by the line number the engine\n\t// evaluates them under (1-based for a document, -1 for a lone expression). An\n\t// async resolution names the lines whose result changed but not the new value,\n\t// so this is what the event pump re-reads a line from to recover it.\n\tlet retainedLines = new Map<number, string>();\n\n\t// The current document's abort controller, kept alive past the request that\n\t// created it so this document's async resolutions can still land. Aborted when\n\t// a new document supersedes it: aborting drops the old document's in-flight\n\t// resolutions at the engine's own staleness guard (an aborted signal is\n\t// discarded before it reaches the batcher), so a stale value never reaches the\n\t// host as if it were current. See {@link handleRequest}.\n\tlet documentController: AbortController | null = null;\n\n\t// Cancels the event-stream reader on teardown. Null until the pump starts.\n\tlet stopEventPump: (() => void) | null = null;\n\n\tconst post = (message: WorkerToMainMessage): void => transport.postMessage(message);\n\n\tconst fail = (id: number, error: unknown): void => {\n\t\tpost({ kind: \"error\", id, error: serializeEngineError(normalizeUnknownError(error)) });\n\t};\n\n\t/**\n\t * Record the line texts a request evaluates, so a later async resolution can\n\t * re-read exactly the lines it names. A whole document splits into 1-based\n\t * lines; a lone `evaluateExpression` maps onto the engine's `-1` sentinel, the\n\t * same line number the engine registers and later reports for it.\n\t */\n\tconst retainLines = (message: RequestMessage): Map<number, string> => {\n\t\tconst map = new Map<number, string>();\n\t\tif (message.method === \"parseDocument\") {\n\t\t\t(message.args[0] as string).split(\"\\n\").forEach((text, index) => map.set(index + 1, text));\n\t\t} else if (message.method === \"evaluateLines\") {\n\t\t\t(message.args[0] as string[]).forEach((text, index) => map.set(index + 1, text));\n\t\t} else {\n\t\t\tmap.set(-1, message.args[0] as string);\n\t\t}\n\t\treturn map;\n\t};\n\n\t/**\n\t * Turn one async resolution event into a message home.\n\t *\n\t * A `lines-updated` event names the lines whose result changed; the resolved\n\t * value lives in the engine's cache, so each named line is re-evaluated (which\n\t * now reads the settled value from that cache rather than starting a fresh\n\t * fetch) and serialised. A line the current document no longer retains belongs\n\t * to a superseded document and is skipped. An `error` event carries the failed\n\t * query straight across as a structured error.\n\t */\n\tconst handleAsyncEvent = (eng: ExpressionEngine, event: AsyncResolutionEvent): void => {\n\t\tif (event.type === \"error\") {\n\t\t\tpost({\n\t\t\t\tkind: \"async-error\",\n\t\t\t\tqueryKey: event.queryKey,\n\t\t\t\tpackageId: event.packageId,\n\t\t\t\terror: serializeEngineError(normalizeUnknownError(event.error)),\n\t\t\t});\n\t\t\treturn;\n\t\t}\n\n\t\tconst lines: AsyncResolvedLine[] = [];\n\t\tfor (const lineNumber of event.lineNumbers) {\n\t\t\tconst text = retainedLines.get(lineNumber);\n\t\t\tif (text === undefined) continue;\n\t\t\ttry {\n\t\t\t\tconst value = eng.evaluateLine(lineNumber, text);\n\t\t\t\tif (value) lines.push({ lineNumber, value: serializeValue(value, formatting) });\n\t\t\t} catch {\n\t\t\t\t// A line that resolved into an error re-throws on re-evaluation; the\n\t\t\t\t// batcher's own `error` event is the channel for that, so this keeps\n\t\t\t\t// the update to the lines that produced a value rather than posting a\n\t\t\t\t// second, half-formed failure here.\n\t\t\t}\n\t\t}\n\t\tif (lines.length > 0) post({ kind: \"async-update\", lines });\n\t};\n\n\t/**\n\t * Drain the engine's async-resolution event stream for the life of the\n\t * runtime, posting each event home. Started once the engine exists; the reader\n\t * loop ends when the stream closes (engine cleared) or the returned canceller\n\t * runs at teardown.\n\t */\n\tconst startEventPump = (eng: ExpressionEngine): void => {\n\t\tstopEventPump?.();\n\t\tconst reader = eng.getEventStream().getReader();\n\t\tstopEventPump = () => void reader.cancel();\n\t\tvoid (async () => {\n\t\t\ttry {\n\t\t\t\tfor (;;) {\n\t\t\t\t\tconst { done, value } = await reader.read();\n\t\t\t\t\tif (done) return;\n\t\t\t\t\thandleAsyncEvent(eng, value);\n\t\t\t\t}\n\t\t\t} catch {\n\t\t\t\t// The stream errored or was cancelled (teardown); the loop is done.\n\t\t\t}\n\t\t})();\n\t};\n\n\tconst handleInit = (message: InitMessage): void => {\n\t\ttry {\n\t\t\tconst packages = resolvePackages(available, message.packages);\n\t\t\tengine = new ExpressionEngine({\n\t\t\t\tlocale: message.localeCode ?? \"en\",\n\t\t\t\tdiagnostics: message.diagnostics ?? false,\n\t\t\t\tconfig: message.config,\n\t\t\t\tpackages,\n\t\t\t\tcalendar: options.calendar,\n\t\t\t});\n\t\t\t// The display reads the same backend the engine computes with, so a\n\t\t\t// date in a DTO names the day it was computed on; the main side's\n\t\t\t// settings cannot carry the backend, so it is joined here.\n\t\t\tformatting = options.calendar\n\t\t\t\t? { ...(message.formatting ?? DEFAULT_FORMATTING_SETTINGS), calendar: options.calendar }\n\t\t\t\t: message.formatting;\n\t\t\t// Drain live-data resolutions for the engine's whole lifetime, so a\n\t\t\t// value that settles after a request already answered still reaches the\n\t\t\t// host. Started here, after the engine exists, and torn down with it.\n\t\t\tstartEventPump(engine);\n\t\t\tpost({ kind: \"ready\", id: message.id });\n\t\t} catch (error) {\n\t\t\t// A build failure leaves no engine; the caller's `createWorkerEngine`\n\t\t\t// promise rejects with this rather than hanging on a `ready` that\n\t\t\t// never comes.\n\t\t\tfail(message.id, error);\n\t\t}\n\t};\n\n\tconst runMethod = (eng: ExpressionEngine, message: RequestMessage): unknown => {\n\t\tconst { method, args } = message;\n\t\tswitch (method) {\n\t\t\tcase \"parseDocument\":\n\t\t\t\treturn serializeParsingResult(eng.parseDocument(args[0] as string, args[1] as never), formatting);\n\t\t\tcase \"evaluateLines\":\n\t\t\t\treturn eng.evaluateLines(args[0] as string[]).map((line) => serializeParsedLine(line, formatting));\n\t\t\tcase \"evaluateExpression\":\n\t\t\t\t// Mirrors ExpressionEngine.evaluateExpression: a single Value in,\n\t\t\t\t// a single serialized Value out.\n\t\t\t\treturn serializeValue(eng.evaluateExpression(args[0] as string), formatting);\n\t\t\tdefault:\n\t\t\t\tthrow ErrorFactory.execution(\n\t\t\t\t\tWorkerErrorCodes.WORKER_UNKNOWN_METHOD,\n\t\t\t\t\t`The worker runtime has no method named \"${String(method)}\"`,\n\t\t\t\t\t{ method },\n\t\t\t\t);\n\t\t}\n\t};\n\n\tconst handleRequest = (message: RequestMessage): void => {\n\t\tconst eng = engine;\n\t\tif (!eng) {\n\t\t\tfail(\n\t\t\t\tmessage.id,\n\t\t\t\tErrorFactory.execution(\n\t\t\t\t\tWorkerErrorCodes.WORKER_NOT_INITIALISED,\n\t\t\t\t\t\"The worker received a request before its engine finished initialising\",\n\t\t\t\t),\n\t\t\t);\n\t\t\treturn;\n\t\t}\n\n\t\t// Supersede the previous document: abort its controller so any resolution\n\t\t// still in flight for it is dropped at the engine's staleness guard rather\n\t\t// than posted home as if it belonged to this request's document. The old\n\t\t// retained lines go with it. Every evaluate call shares one engine and one\n\t\t// document context, so the most recent call is the live one.\n\t\tdocumentController?.abort();\n\n\t\t// This request's controller doubles as the document controller: wired in as\n\t\t// the keystroke signal so a later `cancel` (or the next supersede) aborts\n\t\t// the async work this evaluation fires, the same mechanism a host uses on\n\t\t// the main thread. It is deliberately NOT aborted when the request settles,\n\t\t// so this document's live values can still resolve and stream back.\n\t\tconst controller = new AbortController();\n\t\tdocumentController = controller;\n\t\tretainedLines = retainLines(message);\n\t\tinFlight.set(message.id, controller);\n\t\teng.setKeystrokeSignal(controller.signal);\n\n\t\ttry {\n\t\t\tconst value = runMethod(eng, message);\n\t\t\tpost({ kind: \"result\", id: message.id, value });\n\t\t} catch (error) {\n\t\t\tfail(message.id, error);\n\t\t} finally {\n\t\t\tinFlight.delete(message.id);\n\t\t\teng.setKeystrokeSignal(null);\n\t\t}\n\t};\n\n\ttransport.onMessage((raw) => {\n\t\tconst message = raw as MainToWorkerMessage;\n\t\tswitch (message.kind) {\n\t\t\tcase \"init\":\n\t\t\t\thandleInit(message);\n\t\t\t\tbreak;\n\t\t\tcase \"request\":\n\t\t\t\thandleRequest(message);\n\t\t\t\tbreak;\n\t\t\tcase \"cancel\":\n\t\t\t\t// Abort maps onto the keystroke signal for the named request; a\n\t\t\t\t// cancel that arrives after the request already settled finds no\n\t\t\t\t// controller and is a harmless no-op.\n\t\t\t\tinFlight.get(message.id)?.abort();\n\t\t\t\tbreak;\n\t\t}\n\t});\n\n\treturn () => {\n\t\tstopEventPump?.();\n\t\tstopEventPump = null;\n\t\tdocumentController?.abort();\n\t\tdocumentController = null;\n\t\tretainedLines = new Map();\n\t\tfor (const controller of inFlight.values()) controller.abort();\n\t\tinFlight.clear();\n\t\tengine?.clear();\n\t\tengine = null;\n\t\ttransport.terminate();\n\t};\n}\n","/**\n * The seam between the harness and whatever actually carries messages.\n *\n * Both the client (`worker/client.ts`) and the runtime (`worker/runtime.ts`)\n * talk to a {@link WorkerTransport} and nothing more, so the same code drives a\n * browser `Worker`, a Node `worker_threads` port, or an in-process pair. The\n * three factory functions below adapt each of those onto the interface; a host\n * with a transport this file does not cover can implement the three methods\n * directly.\n */\n\n/**\n * A bidirectional message channel with a single receive handler.\n *\n * `onMessage` registers the one handler the harness needs; calling it again\n * replaces the previous handler. `terminate` tears the channel down and is safe\n * to call more than once.\n */\nexport interface WorkerTransport {\n\t/** Send one message to the other end. The message must be clone-safe. */\n\tpostMessage(message: unknown): void;\n\t/** Register the handler that receives messages from the other end. */\n\tonMessage(handler: (message: unknown) => void): void;\n\t/** Tear the channel down. Idempotent. */\n\tterminate(): void;\n}\n\n/**\n * Clone a message the way `postMessage` would, so an in-process transport has\n * the same value semantics as a real one.\n *\n * The harness protocol is clone-safe by construction, so the `JSON` fallback\n * (for a runtime without a global `structuredClone`) is lossless here; the\n * structured-clone path is preferred because it is what a real worker uses and\n * because it throws loudly if a non-clone-safe value ever reaches it, which is\n * exactly the mistake the DTO layer exists to prevent.\n *\n * A function, not a module-level const, so this module does no work at load\n * time and stays deletable under the package's `sideEffects: false` claim; the\n * `typeof` probe runs once per message, which is free next to the clone itself.\n */\nfunction cloneMessage<T>(value: T): T {\n\treturn typeof globalThis.structuredClone === \"function\"\n\t\t? globalThis.structuredClone(value)\n\t\t: JSON.parse(JSON.stringify(value));\n}\n\n/**\n * A pair of linked in-process transports.\n *\n * `client` and `host` are two ends of one channel: a message posted on either\n * is cloned at post time and delivered to the other on a microtask, so delivery\n * is asynchronous (as a real worker's is) but deterministic (no timers, no I/O).\n * Wire `client` into {@link createWorkerEngine} and `host` into\n * {@link startWorkerRuntime} to run the whole protocol, DTO serialisation and\n * cancellation included, without a second thread. This is the transport tests\n * use, and a fit for a host that wants the message-passing shape on one thread.\n */\nexport function createLinkedTransports(): { client: WorkerTransport; host: WorkerTransport } {\n\tlet clientHandler: ((message: unknown) => void) | null = null;\n\tlet hostHandler: ((message: unknown) => void) | null = null;\n\tlet alive = true;\n\n\t// The handler is read at delivery time rather than post time so setup order\n\t// (post before the other end has registered) cannot drop a message.\n\tconst deliver = (target: () => ((message: unknown) => void) | null, message: unknown): void => {\n\t\tconst cloned = cloneMessage(message);\n\t\tqueueMicrotask(() => {\n\t\t\tif (!alive) return;\n\t\t\ttarget()?.(cloned);\n\t\t});\n\t};\n\n\tconst client: WorkerTransport = {\n\t\tpostMessage: (message) => deliver(() => hostHandler, message),\n\t\tonMessage: (handler) => {\n\t\t\tclientHandler = handler;\n\t\t},\n\t\tterminate: () => {\n\t\t\talive = false;\n\t\t},\n\t};\n\n\tconst host: WorkerTransport = {\n\t\tpostMessage: (message) => deliver(() => clientHandler, message),\n\t\tonMessage: (handler) => {\n\t\t\thostHandler = handler;\n\t\t},\n\t\tterminate: () => {\n\t\t\talive = false;\n\t\t},\n\t};\n\n\treturn { client, host };\n}\n\n/** The `postMessage`/`onmessage`/event-listener shape a browser `Worker`, a worker's `self`, or a DOM `MessagePort` presents. */\ninterface EventTargetLike {\n\tpostMessage(message: unknown): void;\n\taddEventListener?(type: \"message\", handler: (event: { data: unknown }) => void): void;\n\tonmessage?: ((event: { data: unknown }) => void) | null;\n\tterminate?(): void;\n\tclose?(): void;\n\tstart?(): void;\n}\n\n/**\n * Adapt a browser-style message target onto a {@link WorkerTransport}.\n *\n * Covers the main-side `Worker`, the worker global `self`, and a DOM\n * `MessagePort`: each posts with `postMessage` and receives a `MessageEvent`\n * whose `data` is the payload. A `MessagePort` is `start`ed here so it begins\n * dispatching. On the main side pass a `Worker`; inside a browser worker pass\n * `self`.\n */\nexport function eventTargetTransport(target: EventTargetLike): WorkerTransport {\n\treturn {\n\t\tpostMessage: (message) => target.postMessage(message),\n\t\tonMessage: (handler) => {\n\t\t\tconst listener = (event: { data: unknown }): void => handler(event.data);\n\t\t\tif (typeof target.addEventListener === \"function\") {\n\t\t\t\ttarget.addEventListener(\"message\", listener);\n\t\t\t} else {\n\t\t\t\ttarget.onmessage = listener;\n\t\t\t}\n\t\t\ttarget.start?.();\n\t\t},\n\t\t// A main-side Worker terminates; a worker's own `self` closes. Calling\n\t\t// whichever exists keeps one adapter usable from both ends.\n\t\tterminate: () => {\n\t\t\ttarget.terminate?.();\n\t\t\ttarget.close?.();\n\t\t},\n\t};\n}\n\n/** The `postMessage`/`on(\"message\")` shape a Node `worker_threads` `Worker`, `parentPort`, or `MessagePort` presents. */\ninterface MessagePortLike {\n\tpostMessage(message: unknown): void;\n\ton(event: \"message\", handler: (message: unknown) => void): void;\n\tterminate?(): void;\n\tclose?(): void;\n}\n\n/**\n * Adapt a Node `worker_threads` port onto a {@link WorkerTransport}.\n *\n * Covers the main-side `Worker`, the worker's `parentPort`, and a\n * `worker_threads` `MessagePort`: each posts with `postMessage` and emits a\n * `\"message\"` event whose argument IS the payload (no `.data` wrapper, unlike\n * the DOM). On the main side pass the `Worker`; inside the worker pass\n * `parentPort`.\n */\nexport function messagePortTransport(port: MessagePortLike): WorkerTransport {\n\treturn {\n\t\tpostMessage: (message) => port.postMessage(message),\n\t\tonMessage: (handler) => {\n\t\t\tport.on(\"message\", (message) => handler(message));\n\t\t},\n\t\tterminate: () => {\n\t\t\tport.terminate?.();\n\t\t\tport.close?.();\n\t\t},\n\t};\n}\n"]}
+{"version":3,"sources":["../src/worker/client.ts","../src/worker/serialize.ts","../src/worker/runtime.ts","../src/worker/transport.ts"],"names":["resolveDateOrderForWorker","config","date","resolveDateOrderPolicy","DEFAULT_CONFIG","WorkerEngineClient","transport","raw","options","id","resolve","reject","input","signal","parsing","parseOptions","lines","expression","listener","error","workerTerminatedError","entry","method","args","workerCancelledError","onAbort","message","value","deserializeEngineError","apply","createWorkerEngine","client","nonFiniteTag","n","serializeMatrix","m","cells","cell","formatSymbolic","serializeValue","settings","reading","dto","formatValue","r","c","toHexString","formatColour","pt","ip","serializeMaybe","serializeInlineSolve","solve","serializeParsedLine","line","serializeParsingResult","result","resolvePackages","available","names","byName","pkg","resolved","name","ErrorFactory","WorkerErrorCodes","startWorkerRuntime","BUILTIN_PACKAGES","engine","formatting","inFlight","retainedLines","documentController","stopEventPump","post","fail","serializeEngineError","normalizeUnknownError","retainLines","map","text","index","handleAsyncEvent","eng","event","lineNumber","startEventPump","reader","done","handleInit","packages","ExpressionEngine","DEFAULT_FORMATTING_SETTINGS","runMethod","handleRequest","controller","cloneMessage","createLinkedTransports","clientHandler","hostHandler","alive","deliver","target","cloned","handler","eventTargetTransport","messagePortTransport","port"],"mappings":"wqCA8IA,SAASA,CAAAA,CAA0BC,CAAAA,CAA4E,CAC9G,GAAIA,CAAAA,EAAQ,IAAA,EAAM,UAAA,GAAe,QAAA,CAAU,OAAOA,CAAAA,CAClD,IAAMC,CAAAA,CAAO,CAAE,GAAGD,CAAAA,CAAO,IAAA,CAAM,UAAA,CAAYE,CAAAA,CAAuB,CAAE,GAAGC,GAAAA,CAAe,IAAA,CAAM,GAAGH,CAAAA,CAAO,IAAK,CAAC,CAAA,CAAE,KAAM,CAAA,CACpH,cAAOC,CAAAA,CAAK,WAAA,CACL,CAAE,GAAGD,CAAAA,CAAQ,IAAA,CAAAC,CAAK,CAC1B,CAEA,IAAMG,CAAAA,CAAN,KAAiD,CAWhD,WAAA,CAAYC,CAAAA,CAA4B,CATxC,KAAQ,MAAA,CAAS,CAAA,CACjB,IAAA,CAAiB,OAAA,CAAU,IAAI,GAAA,CAI/B,IAAA,CAAiB,iBAAA,CAAoB,IAAI,GAAA,CACzC,IAAA,CAAiB,mBAAA,CAAsB,IAAI,GAAA,CAC3C,IAAA,CAAQ,UAAA,CAAa,KAAA,CAGpB,KAAK,SAAA,CAAYA,CAAAA,CACjB,IAAA,CAAK,SAAA,CAAU,SAAA,CAAWC,CAAAA,EAAQ,IAAA,CAAK,SAAA,CAAUA,CAAG,CAAC,EACtD,CAGA,IAAA,CAAKC,CAAAA,CAA6C,CACjD,IAAMC,EAAK,IAAA,CAAK,MAAA,EAAA,CAChB,OAAO,IAAI,OAAA,CAAc,CAACC,CAAAA,CAASC,CAAAA,GAAW,CAC7C,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAIF,CAAAA,CAAI,CAAE,OAAA,CAAS,IAAMC,CAAAA,GAAW,MAAA,CAAAC,CAAO,CAAC,CAAA,CACzD,IAAA,CAAK,SAAA,CAAU,WAAA,CAAY,CAC1B,IAAA,CAAM,MAAA,CACN,EAAA,CAAAF,CAAAA,CACA,UAAA,CAAYD,CAAAA,CAAQ,UAAA,CACpB,WAAA,CAAaA,EAAQ,WAAA,CACrB,MAAA,CAAQR,CAAAA,CAA0BQ,CAAAA,CAAQ,MAAM,CAAA,CAChD,QAAA,CAAUA,CAAAA,CAAQ,SAClB,UAAA,CAAYA,CAAAA,CAAQ,UACrB,CAAC,EACF,CAAC,CACF,CAEA,cACCI,CAAAA,CACAJ,CAAAA,CACmC,CAGnC,GAAM,CAAE,MAAA,CAAAK,CAAAA,CAAQ,GAAGC,CAAQ,CAAA,CAAIN,CAAAA,EAAW,EAAC,CACrCO,CAAAA,CAAe,MAAA,CAAO,IAAA,CAAKD,CAAO,CAAA,CAAE,MAAA,CAAS,CAAA,CAAKA,CAAAA,CAAoC,MAAA,CAC5F,OAAO,IAAA,CAAK,IAAA,CAA8B,gBAAiB,CAACF,CAAAA,CAAOG,CAAY,CAAA,CAAGF,CAAM,CACzF,CAEA,aAAA,CAAcG,EAAiBR,CAAAA,CAA8D,CAC5F,OAAO,IAAA,CAAK,IAAA,CAA6B,eAAA,CAAiB,CAACQ,CAAK,CAAA,CAAGR,CAAAA,EAAS,MAAM,CACnF,CAEA,kBAAA,CAAmBS,CAAAA,CAAoBT,CAAAA,CAA6D,CACnG,OAAO,IAAA,CAAK,IAAA,CAA4B,oBAAA,CAAsB,CAACS,CAAU,CAAA,CAAGT,CAAAA,EAAS,MAAM,CAC5F,CAEA,UAAA,CAAWU,CAAAA,CAA4D,CACtE,OAAA,IAAA,CAAK,iBAAA,CAAkB,GAAA,CAAIA,CAAQ,CAAA,CAC5B,IAAM,IAAA,CAAK,iBAAA,CAAkB,MAAA,CAAOA,CAAQ,CACpD,CAEA,YAAA,CAAaA,CAAAA,CAAyD,CACrE,OAAA,IAAA,CAAK,mBAAA,CAAoB,GAAA,CAAIA,CAAQ,CAAA,CAC9B,IAAM,IAAA,CAAK,mBAAA,CAAoB,MAAA,CAAOA,CAAQ,CACtD,CAEA,SAAA,EAAkB,CACjB,GAAI,IAAA,CAAK,UAAA,CAAY,OACrB,IAAA,CAAK,UAAA,CAAa,IAAA,CAClB,IAAMC,CAAAA,CAAQC,GAAsB,CACpC,IAAA,IAAWC,CAAAA,IAAS,IAAA,CAAK,OAAA,CAAQ,MAAA,EAAO,CACvC,IAAA,CAAK,MAAA,CAAOA,CAAK,CAAA,CACjBA,CAAAA,CAAM,MAAA,CAAOF,CAAK,CAAA,CAEnB,IAAA,CAAK,QAAQ,KAAA,EAAM,CAGnB,IAAA,CAAK,iBAAA,CAAkB,KAAA,EAAM,CAC7B,IAAA,CAAK,mBAAA,CAAoB,OAAM,CAC/B,IAAA,CAAK,SAAA,CAAU,SAAA,GAChB,CAGQ,IAAA,CAAQG,CAAAA,CAAsBC,EAAyBV,CAAAA,CAAkC,CAChG,GAAI,IAAA,CAAK,UAAA,CAAY,OAAO,OAAA,CAAQ,MAAA,CAAOO,CAAAA,EAAuB,CAAA,CAClE,GAAIP,CAAAA,EAAQ,OAAA,CAAS,OAAO,OAAA,CAAQ,OAAOW,CAAAA,CAAqBF,CAAM,CAAC,CAAA,CAEvE,IAAMb,CAAAA,CAAK,IAAA,CAAK,MAAA,EAAA,CAChB,OAAO,IAAI,OAAA,CAAW,CAACC,CAAAA,CAASC,CAAAA,GAAW,CAC1C,IAAMU,CAAAA,CAAwB,CAAE,OAAA,CAASX,CAAAA,CAAqC,MAAA,CAAAC,CAAO,CAAA,CAErF,GAAIE,CAAAA,CAAQ,CACX,IAAMY,CAAAA,CAAU,IAAY,CAEtB,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAIhB,CAAE,IACxB,IAAA,CAAK,OAAA,CAAQ,MAAA,CAAOA,CAAE,CAAA,CACtB,IAAA,CAAK,SAAA,CAAU,WAAA,CAAY,CAAE,IAAA,CAAM,QAAA,CAAU,EAAA,CAAAA,CAAG,CAAC,CAAA,CACjDE,CAAAA,CAAOa,CAAAA,CAAqBF,CAAM,CAAC,CAAA,EACpC,CAAA,CACAD,CAAAA,CAAM,MAAA,CAASR,CAAAA,CACfQ,CAAAA,CAAM,OAAA,CAAUI,CAAAA,CAChBZ,CAAAA,CAAO,gBAAA,CAAiB,OAAA,CAASY,CAAAA,CAAS,CAAE,IAAA,CAAM,IAAK,CAAC,EACzD,CAEA,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAIhB,CAAAA,CAAIY,CAAK,CAAA,CAC1B,KAAK,SAAA,CAAU,WAAA,CAAY,CAAE,IAAA,CAAM,SAAA,CAAW,EAAA,CAAAZ,CAAAA,CAAI,MAAA,CAAAa,EAAQ,IAAA,CAAAC,CAAK,CAAC,EACjE,CAAC,CACF,CAGQ,SAAA,CAAUhB,CAAAA,CAAoB,CACrC,IAAMmB,CAAAA,CAAUnB,CAAAA,CAChB,OAAQmB,CAAAA,CAAQ,IAAA,EACf,KAAK,OAAA,CACL,KAAK,QAAA,CAAU,CACd,IAAMC,CAAAA,CAAQD,CAAAA,CAAQ,OAAS,QAAA,CAAWA,CAAAA,CAAQ,KAAA,CAAQ,MAAA,CAC1D,IAAA,CAAK,MAAA,CAAOA,CAAAA,CAAQ,EAAA,CAAKL,GAAUA,CAAAA,CAAM,OAAA,CAAQM,CAAK,CAAC,CAAA,CACvD,KACD,CACA,KAAK,OAAA,CACJ,IAAA,CAAK,MAAA,CAAOD,CAAAA,CAAQ,EAAA,CAAKL,CAAAA,EAAUA,CAAAA,CAAM,MAAA,CAAOO,IAAuBF,CAAAA,CAAQ,KAAK,CAAC,CAAC,CAAA,CACtF,MACD,KAAK,cAAA,CAIJ,QAAWR,CAAAA,IAAY,CAAC,GAAG,IAAA,CAAK,iBAAiB,CAAA,CAAGA,CAAAA,CAASQ,CAAAA,CAAQ,KAAK,CAAA,CAC1E,MACD,KAAK,aAAA,CACJ,IAAA,IAAWR,CAAAA,IAAY,CAAC,GAAG,IAAA,CAAK,mBAAmB,CAAA,CAClDA,CAAAA,CAAS,CACR,QAAA,CAAUQ,CAAAA,CAAQ,QAAA,CAClB,UAAWA,CAAAA,CAAQ,SAAA,CACnB,KAAA,CAAOE,GAAAA,CAAuBF,CAAAA,CAAQ,KAAK,CAC5C,CAAC,EAEF,KACF,CACD,CAGQ,MAAA,CAAOjB,CAAAA,CAAYoB,CAAAA,CAA8C,CACxE,IAAMR,EAAQ,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAIZ,CAAE,CAAA,CAC5BY,CAAAA,GACL,IAAA,CAAK,OAAA,CAAQ,MAAA,CAAOZ,CAAE,CAAA,CACtB,IAAA,CAAK,MAAA,CAAOY,CAAK,CAAA,CACjBQ,CAAAA,CAAMR,CAAK,CAAA,EACZ,CAGQ,MAAA,CAAOA,CAAAA,CAA6B,CACvCA,CAAAA,CAAM,MAAA,EAAUA,CAAAA,CAAM,SAASA,CAAAA,CAAM,MAAA,CAAO,mBAAA,CAAoB,OAAA,CAASA,CAAAA,CAAM,OAAO,EAC3F,CACD,EAeA,eAAsBS,CAAAA,CAAmBtB,CAAAA,CAAqD,CAC7F,IAAMuB,CAAAA,CAAS,IAAI1B,CAAAA,CAAmBG,CAAAA,CAAQ,SAAS,CAAA,CACvD,OAAA,MAAMuB,CAAAA,CAAO,IAAA,CAAKvB,CAAO,CAAA,CAClBuB,CACR,CC/RA,SAASC,CAAAA,CAAaC,CAAAA,CAA6C,CAClE,OAAOA,CAAAA,CAAI,CAAA,CAAI,WAAaA,CAAAA,CAAI,CAAA,CAAI,WAAA,CAAc,KACnD,CAGA,SAASC,CAAAA,CAAgBC,CAAAA,CAAiC,CACzD,IAAMC,CAAAA,CAAQD,CAAAA,CAAE,IAAA,CAAK,GAAA,CAAKE,CAAAA,EAOrB,OAAOA,CAAAA,EAAS,QAAA,EAAYA,CAAAA,GAAS,IAAA,CAAaC,GAAAA,CAAeD,CAAI,CAAA,CACrE,OAAOA,CAAAA,EAAS,UAAY,CAAC,MAAA,CAAO,QAAA,CAASA,CAAI,CAAA,CAAUL,CAAAA,CAAaK,CAAI,CAAA,CACzEA,CACP,CAAA,CACD,OAAO,CAAE,IAAA,CAAMF,CAAAA,CAAE,IAAA,CAAM,IAAA,CAAMA,EAAE,IAAA,CAAM,KAAA,CAAAC,CAAAA,CAAO,WAAA,CAAaD,CAAAA,CAAE,WAAY,CACxE,CAUO,SAASI,CAAAA,CAAeZ,CAAAA,CAAca,CAAAA,CAAsD,CAClG,IAAMC,CAAAA,CAAUd,CAAAA,CAAM,UAAS,CACzBe,CAAAA,CAA6B,CAClC,IAAA,CAAMf,CAAAA,CAAM,IAAA,CACZ,IAAA,CAAMgB,CAAAA,CAAYhB,EAAOa,CAAQ,CAAA,CAIjC,MAAA,CAAQ,MAAA,CAAO,QAAA,CAASC,CAAO,CAAA,CAAIA,CAAAA,CAAU,CAC9C,CAAA,CACK,MAAA,CAAO,QAAA,CAASA,CAAO,CAAA,GAC3BC,CAAAA,CAAI,SAAA,CAAYV,CAAAA,CAAaS,CAAO,CAAA,CAAA,CAGjCd,CAAAA,CAAM,IAAA,GAAS,MAAA,GAAWe,CAAAA,CAAI,IAAA,CAAOf,CAAAA,CAAM,MAC3CA,CAAAA,CAAM,QAAA,GAAa,MAAA,GAAWe,CAAAA,CAAI,QAAA,CAAWf,CAAAA,CAAM,QAAA,CAAA,CAInDA,CAAAA,CAAM,QAAU,MAAA,GAAWe,CAAAA,CAAI,KAAA,CAAQf,CAAAA,CAAM,KAAA,CAAA,CAC7CA,CAAAA,CAAM,IAAA,GAAS,MAAA,GAAWe,EAAI,IAAA,CAAOf,CAAAA,CAAM,IAAA,CAAA,CAE/C,IAAMpB,CAAAA,CAAMoB,CAAAA,CAAM,KAAA,CAClB,GAAI,OAAOpB,CAAAA,EAAQ,QAAA,CAIlBmC,CAAAA,CAAI,MAAA,CAASnC,CAAAA,CAAI,QAAA,EAAS,CAAA,KAAA,GAChBoB,EAAM,IAAA,GAAS,CAAA,CACzBe,CAAAA,CAAI,MAAA,CAASR,CAAAA,CAAgB3B,CAAiB,CAAA,CAAA,KAAA,GACpCoB,CAAAA,CAAM,OAAS,CAAA,CAAiB,CAC1C,IAAMiB,CAAAA,CAAIrC,CAAAA,CACVmC,CAAAA,CAAI,KAAA,CAAQ,CAAE,IAAKE,CAAAA,CAAE,GAAA,CAAK,GAAA,CAAKA,CAAAA,CAAE,GAAI,EACtC,CAAA,KAAA,GAAWjB,CAAAA,CAAM,IAAA,GAAS,EAAA,CAAkB,CAC3C,IAAMkB,CAAAA,CAAItC,CAAAA,CACVmC,CAAAA,CAAI,MAAA,CAAS,CAAE,GAAA,CAAKI,CAAAA,CAAYD,CAAC,CAAA,CAAG,CAAA,CAAGA,CAAAA,CAAE,CAAA,CAAG,CAAA,CAAGA,EAAE,CAAA,CAAG,CAAA,CAAGA,CAAAA,CAAE,CAAA,CAAG,CAAA,CAAGA,CAAAA,CAAE,CAAA,CAAG,MAAA,CAAQA,EAAE,MAAA,CAAQ,GAAA,CAAKE,CAAAA,CAAaF,CAAC,CAAE,EAC5G,CAAA,KAAA,GAAWlB,CAAAA,CAAM,IAAA,GAAS,EAAA,CAAiB,CAC1C,IAAMkB,CAAAA,CAAItC,CAAAA,CACVmC,CAAAA,CAAI,KAAA,CAAQ,CACX,IAAA,CAAMG,CAAAA,CAAE,IAAA,CACR,MAAA,CAAQA,CAAAA,CAAE,MAAA,CAAO,GAAA,CAAKG,CAAAA,EAAO,CAACA,CAAAA,CAAG,CAAC,CAAA,CAAGA,CAAAA,CAAG,CAAC,CAAC,CAAC,CAAA,CAC3C,MAAOH,CAAAA,CAAE,KAAA,CACT,MAAA,CAAQ,CAACA,CAAAA,CAAE,MAAA,CAAO,CAAC,CAAA,CAAGA,CAAAA,CAAE,MAAA,CAAO,CAAC,CAAC,CAAA,CACjC,KAAA,CAAO,CAACA,CAAAA,CAAE,MAAM,CAAC,CAAA,CAAGA,CAAAA,CAAE,KAAA,CAAM,CAAC,CAAC,CAAA,CAC9B,GAAIA,EAAE,IAAA,GAAS,MAAA,CAAY,CAAE,IAAA,CAAMA,CAAAA,CAAE,IAAK,CAAA,CAAI,EAC/C,EACD,CAAA,KAAA,GAAWlB,CAAAA,CAAM,IAAA,GAAS,EAAA,CAAkB,CAC3C,IAAMsB,CAAAA,CAAK1C,CAAAA,CACXmC,CAAAA,CAAI,MAAA,CAAS,CACZ,GAAIO,CAAAA,CAAG,IAAA,GAAS,MAAA,CAAY,CAAE,IAAA,CAAMA,CAAAA,CAAG,IAAK,CAAA,CAAI,EAAC,CACjD,GAAIA,CAAAA,CAAG,SAAW,MAAA,CAAY,CAAE,MAAA,CAAQA,CAAAA,CAAG,MAAO,CAAA,CAAI,EAAC,CACvD,KAAMN,CAAAA,CAAYhB,CAAK,CAAA,CAAE,OAAA,CAAQ,OAAA,CAAS,EAAE,CAC7C,EACD,CAEA,OAAOe,CACR,CAGA,SAASQ,CAAAA,CAAevB,CAAAA,CAAiCa,CAAAA,CAA6D,CACrH,OAAOb,CAAAA,CAAQY,CAAAA,CAAeZ,CAAAA,CAAOa,CAAQ,CAAA,CAAI,IAClD,CAGA,SAASW,CAAAA,CAAqBC,CAAAA,CAA4BZ,CAAAA,CAAsD,CAC/G,OAAO,CACN,KAAA,CAAOY,CAAAA,CAAM,MACb,GAAA,CAAKA,CAAAA,CAAM,GAAA,CACX,UAAA,CAAYA,CAAAA,CAAM,UAAA,CAClB,UAAA,CAAYA,CAAAA,CAAM,UAAA,CAClB,YAAA,CAAcA,CAAAA,CAAM,YAAA,CACpB,MAAA,CAAQF,CAAAA,CAAeE,CAAAA,CAAM,MAAA,CAAQZ,CAAQ,CAAA,CAC7C,KAAA,CAAOY,CAAAA,CAAM,KAAA,EAAS,IACvB,CACD,CAGO,SAASC,EAAoBC,CAAAA,CAAkBd,CAAAA,CAAqD,CAC1G,OAAO,CACN,UAAA,CAAYc,CAAAA,CAAK,UAAA,CACjB,KAAMA,CAAAA,CAAK,IAAA,CACX,aAAA,CAAeA,CAAAA,CAAK,aAAA,CACpB,WAAA,CAAaA,CAAAA,CAAK,WAAA,CAClB,OAAA,CAASA,CAAAA,CAAK,OAAA,CACd,eAAA,CAAiBA,CAAAA,CAAK,eAAA,CACtB,YAAA,CAAcA,CAAAA,CAAK,aAAa,GAAA,CAAKF,CAAAA,EAAUD,CAAAA,CAAqBC,CAAAA,CAAOZ,CAAQ,CAAC,CAAA,CACpF,UAAA,CAAYc,EAAK,UAAA,CACjB,MAAA,CAAQJ,CAAAA,CAAeI,CAAAA,CAAK,MAAA,CAAQd,CAAQ,CAAA,CAC5C,KAAA,CAAOc,EAAK,KACb,CACD,CAGO,SAASC,CAAAA,CAAuBC,CAAAA,CAAuBhB,CAAAA,CAAwD,CACrH,IAAME,CAAAA,CAA+B,CACpC,KAAA,CAAOc,CAAAA,CAAO,KAAA,CAAM,GAAA,CAAKF,CAAAA,EAASD,EAAoBC,CAAAA,CAAMd,CAAQ,CAAC,CAAA,CACrE,UAAA,CAAYgB,CAAAA,CAAO,UAAA,CACnB,MAAA,CAAQ,CAAC,GAAGA,CAAAA,CAAO,MAAM,CAC1B,CAAA,CAGA,OAAIA,CAAAA,CAAO,WAAA,GAAgB,SAAWd,CAAAA,CAAI,WAAA,CAAcc,CAAAA,CAAO,WAAA,CAAA,CACxDd,CACR,CCjGA,SAASe,CAAAA,CAAgBC,CAAAA,CAA6BC,CAAAA,CAA+C,CACpG,GAAIA,CAAAA,GAAU,MAAA,CAAW,OAAOD,CAAAA,CAChC,IAAME,CAAAA,CAAS,IAAI,GAAA,CAAIF,CAAAA,CAAU,GAAA,CAAKG,CAAAA,EAAQ,CAACA,CAAAA,CAAI,KAAMA,CAAG,CAAC,CAAC,CAAA,CACxDC,CAAAA,CAA6B,EAAC,CACpC,IAAA,IAAWC,KAAQJ,CAAAA,CAAO,CACzB,IAAME,CAAAA,CAAMD,CAAAA,CAAO,GAAA,CAAIG,CAAI,CAAA,CAC3B,GAAI,CAACF,CAAAA,CACJ,MAAMG,GAAAA,CAAa,MAAA,CAClBC,GAAAA,CAAiB,sBAAA,CACjB,qBAAqBF,CAAI,CAAA,qCAAA,CAAA,CACzB,CAAE,IAAA,CAAAA,CAAAA,CAAM,SAAA,CAAW,CAAC,GAAGH,EAAO,IAAA,EAAM,CAAE,CACvC,CAAA,CAEDE,CAAAA,CAAS,IAAA,CAAKD,CAAG,EAClB,CACA,OAAOC,CACR,CAQO,SAASI,CAAAA,CAAmB5D,CAAAA,CAA4BE,CAAAA,CAAgC,EAAC,CAAe,CAC9G,IAAMkD,CAAAA,CAAYlD,CAAAA,CAAQ,QAAA,EAAY2D,CAAAA,CAElCC,EAAkC,IAAA,CAClCC,CAAAA,CAGEC,CAAAA,CAAW,IAAI,GAAA,CAMjBC,CAAAA,CAAgB,IAAI,GAAA,CAQpBC,EAA6C,IAAA,CAG7CC,CAAAA,CAAqC,IAAA,CAEnCC,CAAAA,CAAQhD,CAAAA,EAAuCpB,CAAAA,CAAU,WAAA,CAAYoB,CAAO,EAE5EiD,CAAAA,CAAO,CAAClE,CAAAA,CAAYU,CAAAA,GAAyB,CAClDuD,CAAAA,CAAK,CAAE,IAAA,CAAM,OAAA,CAAS,EAAA,CAAAjE,CAAAA,CAAI,KAAA,CAAOmE,CAAAA,CAAqBC,GAAAA,CAAsB1D,CAAK,CAAC,CAAE,CAAC,EACtF,CAAA,CAQM2D,CAAAA,CAAepD,CAAAA,EAAiD,CACrE,IAAMqD,CAAAA,CAAM,IAAI,GAAA,CAChB,OAAIrD,CAAAA,CAAQ,MAAA,GAAW,eAAA,CACrBA,CAAAA,CAAQ,IAAA,CAAK,CAAC,EAAa,KAAA,CAAM;AAAA,CAAI,EAAE,OAAA,CAAQ,CAACsD,CAAAA,CAAMC,CAAAA,GAAUF,EAAI,GAAA,CAAIE,CAAAA,CAAQ,CAAA,CAAGD,CAAI,CAAC,CAAA,CAC/EtD,CAAAA,CAAQ,MAAA,GAAW,eAAA,CAC5BA,EAAQ,IAAA,CAAK,CAAC,CAAA,CAAe,OAAA,CAAQ,CAACsD,CAAAA,CAAMC,CAAAA,GAAUF,CAAAA,CAAI,GAAA,CAAIE,EAAQ,CAAA,CAAGD,CAAI,CAAC,CAAA,CAE/ED,EAAI,GAAA,CAAI,EAAA,CAAIrD,EAAQ,IAAA,CAAK,CAAC,CAAW,CAAA,CAE/BqD,CACR,CAAA,CAYMG,CAAAA,CAAmB,CAACC,CAAAA,CAAuBC,CAAAA,GAAsC,CACtF,GAAIA,EAAM,IAAA,GAAS,OAAA,CAAS,CAC3BV,CAAAA,CAAK,CACJ,IAAA,CAAM,aAAA,CACN,SAAUU,CAAAA,CAAM,QAAA,CAChB,UAAWA,CAAAA,CAAM,SAAA,CACjB,KAAA,CAAOR,CAAAA,CAAqBC,IAAsBO,CAAAA,CAAM,KAAK,CAAC,CAC/D,CAAC,CAAA,CACD,MACD,CAEA,IAAMpE,EAA6B,EAAC,CACpC,QAAWqE,CAAAA,IAAcD,CAAAA,CAAM,YAAa,CAC3C,IAAMJ,CAAAA,CAAOT,CAAAA,CAAc,IAAIc,CAAU,CAAA,CACzC,GAAIL,CAAAA,GAAS,OACb,GAAI,CACH,IAAMrD,CAAAA,CAAQwD,EAAI,YAAA,CAAaE,CAAAA,CAAYL,CAAI,CAAA,CAC3CrD,CAAAA,EAAOX,EAAM,IAAA,CAAK,CAAE,UAAA,CAAAqE,CAAAA,CAAY,MAAO9C,CAAAA,CAAeZ,CAAAA,CAAO0C,CAAU,CAAE,CAAC,EAC/E,CAAA,KAAQ,CAKR,CACD,CACIrD,CAAAA,CAAM,MAAA,CAAS,GAAG0D,CAAAA,CAAK,CAAE,KAAM,cAAA,CAAgB,KAAA,CAAA1D,CAAM,CAAC,EAC3D,CAAA,CAQMsE,CAAAA,CAAkBH,CAAAA,EAAgC,CACvDV,KAAgB,CAChB,IAAMc,CAAAA,CAASJ,CAAAA,CAAI,gBAAe,CAAE,SAAA,GACpCV,CAAAA,CAAgB,IAAG,CAAQc,CAAAA,CAAO,MAAA,GAAO,CAAA,CAAA,CACnC,SAAY,CACjB,GAAI,CACH,OAAS,CACR,GAAM,CAAE,IAAA,CAAAC,CAAAA,CAAM,KAAA,CAAA7D,CAAM,CAAA,CAAI,MAAM4D,EAAO,IAAA,EAAK,CAC1C,GAAIC,CAAAA,CAAM,OACVN,CAAAA,CAAiBC,CAAAA,CAAKxD,CAAK,EAC5B,CACD,CAAA,KAAQ,CAER,CACD,CAAA,IACD,CAAA,CAEM8D,CAAAA,CAAc/D,KAA+B,CAClD,GAAI,CACH,IAAMgE,IAAWjC,CAAAA,CAAgBC,CAAAA,CAAWhC,GAAAA,CAAQ,QAAQ,EAC5D0C,CAAAA,CAAS,IAAIuB,CAAAA,CAAiB,CAC7B,OAAQjE,GAAAA,CAAQ,UAAA,EAAc,IAAA,CAC9B,WAAA,CAAaA,IAAQ,WAAA,EAAe,CAAA,CAAA,CACpC,OAAQA,GAAAA,CAAQ,MAAA,CAChB,SAAAgE,GAAAA,CACA,QAAA,CAAUlF,CAAAA,CAAQ,QACnB,CAAC,CAAA,CAID6D,CAAAA,CAAa7D,CAAAA,CAAQ,QAAA,CAClB,CAAE,GAAIkB,GAAAA,CAAQ,UAAA,EAAckE,CAAAA,CAA8B,SAAUpF,CAAAA,CAAQ,QAAS,EACrFkB,GAAAA,CAAQ,UAAA,CAIX4D,EAAelB,CAAM,CAAA,CACrBM,CAAAA,CAAK,CAAE,KAAM,OAAA,CAAS,EAAA,CAAIhD,GAAAA,CAAQ,EAAG,CAAC,EACvC,CAAA,MAASP,CAAAA,CAAO,CAIfwD,EAAKjD,GAAAA,CAAQ,EAAA,CAAIP,CAAK,EACvB,CACD,EAEM0E,CAAAA,CAAY,CAACV,CAAAA,CAAuBzD,CAAAA,GAAqC,CAC9E,GAAM,CAAE,MAAA,CAAAJ,CAAAA,CAAQ,KAAAC,CAAK,CAAA,CAAIG,CAAAA,CACzB,OAAQJ,GACP,KAAK,gBACJ,OAAOiC,CAAAA,CAAuB4B,EAAI,aAAA,CAAc5D,CAAAA,CAAK,CAAC,CAAA,CAAaA,EAAK,CAAC,CAAU,CAAA,CAAG8C,CAAU,EACjG,KAAK,eAAA,CACJ,OAAOc,CAAAA,CAAI,cAAc5D,CAAAA,CAAK,CAAC,CAAa,CAAA,CAAE,GAAA,CAAK+B,GAASD,CAAAA,CAAoBC,CAAAA,CAAMe,CAAU,CAAC,EAClG,KAAK,oBAAA,CAGJ,OAAO9B,CAAAA,CAAe4C,EAAI,kBAAA,CAAmB5D,CAAAA,CAAK,CAAC,CAAW,EAAG8C,CAAU,CAAA,CAC5E,QACC,MAAML,GAAAA,CAAa,UAClBC,GAAAA,CAAiB,qBAAA,CACjB,CAAA,wCAAA,EAA2C,MAAA,CAAO3C,CAAM,CAAC,CAAA,CAAA,CAAA,CACzD,CAAE,MAAA,CAAAA,CAAO,CACV,CACF,CACD,CAAA,CAEMwE,EAAiBpE,CAAAA,EAAkC,CACxD,IAAMyD,CAAAA,CAAMf,CAAAA,CACZ,GAAI,CAACe,CAAAA,CAAK,CACTR,CAAAA,CACCjD,EAAQ,EAAA,CACRsC,GAAAA,CAAa,SAAA,CACZC,GAAAA,CAAiB,uBACjB,uEACD,CACD,CAAA,CACA,MACD,CAOAO,CAAAA,EAAoB,KAAA,EAAM,CAO1B,IAAMuB,EAAa,IAAI,eAAA,CACvBvB,CAAAA,CAAqBuB,CAAAA,CACrBxB,EAAgBO,CAAAA,CAAYpD,CAAO,CAAA,CACnC4C,CAAAA,CAAS,IAAI5C,CAAAA,CAAQ,EAAA,CAAIqE,CAAU,CAAA,CACnCZ,EAAI,kBAAA,CAAmBY,CAAAA,CAAW,MAAM,CAAA,CAExC,GAAI,CACH,IAAMpE,CAAAA,CAAQkE,CAAAA,CAAUV,CAAAA,CAAKzD,CAAO,CAAA,CACpCgD,CAAAA,CAAK,CAAE,IAAA,CAAM,SAAU,EAAA,CAAIhD,CAAAA,CAAQ,EAAA,CAAI,KAAA,CAAAC,CAAM,CAAC,EAC/C,OAASR,CAAAA,CAAO,CACfwD,EAAKjD,CAAAA,CAAQ,EAAA,CAAIP,CAAK,EACvB,QAAE,CACDmD,CAAAA,CAAS,MAAA,CAAO5C,CAAAA,CAAQ,EAAE,CAAA,CAC1ByD,CAAAA,CAAI,kBAAA,CAAmB,IAAI,EAC5B,CACD,CAAA,CAEA,OAAA7E,CAAAA,CAAU,SAAA,CAAWC,GAAQ,CAC5B,IAAMmB,CAAAA,CAAUnB,CAAAA,CAChB,OAAQmB,CAAAA,CAAQ,IAAA,EACf,KAAK,OACJ+D,CAAAA,CAAW/D,CAAO,CAAA,CAClB,MACD,KAAK,SAAA,CACJoE,CAAAA,CAAcpE,CAAO,CAAA,CACrB,MACD,KAAK,QAAA,CAIJ4C,CAAAA,CAAS,GAAA,CAAI5C,CAAAA,CAAQ,EAAE,CAAA,EAAG,KAAA,EAAM,CAChC,KACF,CACD,CAAC,CAAA,CAEM,IAAM,CACZ+C,KAAgB,CAChBA,CAAAA,CAAgB,KAChBD,CAAAA,EAAoB,KAAA,GACpBA,CAAAA,CAAqB,IAAA,CACrBD,CAAAA,CAAgB,IAAI,IACpB,IAAA,IAAWwB,CAAAA,IAAczB,CAAAA,CAAS,MAAA,GAAUyB,CAAAA,CAAW,KAAA,EAAM,CAC7DzB,CAAAA,CAAS,OAAM,CACfF,CAAAA,EAAQ,OAAM,CACdA,CAAAA,CAAS,KACT9D,CAAAA,CAAU,SAAA,GACX,CACD,CCvRA,SAAS0F,CAAAA,CAAgBrE,CAAAA,CAAa,CACrC,OAAO,OAAO,UAAA,CAAW,eAAA,EAAoB,UAAA,CAC1C,WAAW,eAAA,CAAgBA,CAAK,EAChC,IAAA,CAAK,KAAA,CAAM,KAAK,SAAA,CAAUA,CAAK,CAAC,CACpC,CAaO,SAASsE,CAAAA,EAA6E,CAC5F,IAAIC,EAAqD,IAAA,CACrDC,CAAAA,CAAmD,IAAA,CACnDC,CAAAA,CAAQ,KAINC,CAAAA,CAAU,CAACC,EAAmD5E,CAAAA,GAA2B,CAC9F,IAAM6E,CAAAA,CAASP,CAAAA,CAAatE,CAAO,CAAA,CACnC,eAAe,IAAM,CACf0E,CAAAA,EACLE,CAAAA,KAAWC,CAAM,EAClB,CAAC,EACF,EAsBA,OAAO,CAAE,OApBuB,CAC/B,WAAA,CAAc7E,GAAY2E,CAAAA,CAAQ,IAAMF,CAAAA,CAAazE,CAAO,EAC5D,SAAA,CAAY8E,CAAAA,EAAY,CACvBN,CAAAA,CAAgBM,EACjB,CAAA,CACA,SAAA,CAAW,IAAM,CAChBJ,EAAQ,MACT,CACD,EAYiB,IAAA,CAVa,CAC7B,YAAc1E,CAAAA,EAAY2E,CAAAA,CAAQ,IAAMH,CAAAA,CAAexE,CAAO,CAAA,CAC9D,SAAA,CAAY8E,CAAAA,EAAY,CACvBL,EAAcK,EACf,CAAA,CACA,SAAA,CAAW,IAAM,CAChBJ,CAAAA,CAAQ,MACT,CACD,CAEsB,CACvB,CAqBO,SAASK,CAAAA,CAAqBH,CAAAA,CAA0C,CAC9E,OAAO,CACN,WAAA,CAAc5E,CAAAA,EAAY4E,CAAAA,CAAO,YAAY5E,CAAO,CAAA,CACpD,SAAA,CAAY8E,CAAAA,EAAY,CACvB,IAAMtF,CAAAA,CAAYkE,GAAmCoB,CAAAA,CAAQpB,CAAAA,CAAM,IAAI,CAAA,CACnE,OAAOkB,CAAAA,CAAO,gBAAA,EAAqB,WACtCA,CAAAA,CAAO,gBAAA,CAAiB,SAAA,CAAWpF,CAAQ,EAE3CoF,CAAAA,CAAO,SAAA,CAAYpF,CAAAA,CAEpBoF,CAAAA,CAAO,UACR,CAAA,CAGA,UAAW,IAAM,CAChBA,EAAO,SAAA,IAAY,CACnBA,CAAAA,CAAO,KAAA,KACR,CACD,CACD,CAmBO,SAASI,GAAqBC,CAAAA,CAAwC,CAC5E,OAAO,CACN,YAAcjF,CAAAA,EAAYiF,CAAAA,CAAK,YAAYjF,CAAO,CAAA,CAClD,UAAY8E,CAAAA,EAAY,CACvBG,CAAAA,CAAK,EAAA,CAAG,UAAYjF,CAAAA,EAAY8E,CAAAA,CAAQ9E,CAAO,CAAC,EACjD,CAAA,CACA,SAAA,CAAW,IAAM,CAChBiF,EAAK,SAAA,IAAY,CACjBA,EAAK,KAAA,KACN,CACD,CACD","file":"worker.js","sourcesContent":["/**\n * The main-side half of the harness: an async proxy of the core evaluate\n * methods.\n *\n * {@link createWorkerEngine} performs the init handshake and resolves once the\n * worker's engine is built, so the returned {@link WorkerEngine} is ready to\n * call. Each call stamps a request id, tracks the pending promise, and settles\n * it when the matching answer arrives, so several requests can be outstanding at\n * once. An `AbortSignal` rejects the local promise and posts a `cancel` for the\n * same id, mapping keystroke-level cancellation onto the boundary rather than\n * re-inventing it.\n */\n\nimport { DEFAULT_CONFIG, type EngineConfigOverride } from \"@solve-js/constants/Configuration\";\nimport { resolveDateOrderPolicy } from \"@solve-js/packages/datetime/DateReading\";\nimport type { UnifiedParsingOptions } from \"@solve-js/types/ParsingResult\";\nimport type { FormattingSettings } from \"@solve-js/format/FormattingSettings\";\nimport type { EngineError } from \"@solve-js/errors\";\nimport {\n\tdeserializeEngineError,\n\tworkerCancelledError,\n\tworkerTerminatedError,\n} from \"@solve-js/errors\";\nimport type { WorkerTransport } from \"./transport\";\nimport type {\n\tWorkerMethod,\n\tWorkerRequestArgs,\n\tWorkerToMainMessage,\n} from \"./protocol\";\nimport type {\n\tSerializedWorkerValue,\n\tSerializedParsedLine,\n\tSerializedParsingResult,\n} from \"./dto\";\n\n/** Configuration for {@link createWorkerEngine}. */\nexport interface WorkerEngineOptions {\n\t/** The channel to the worker runtime. See `worker/transport.ts` for adapters. */\n\ttransport: WorkerTransport;\n\t/** Locale for keywords and number formatting; defaults to English worker-side. */\n\tlocaleCode?: string;\n\t/** Whether the worker builds its engine with diagnostics enabled. */\n\tdiagnostics?: boolean;\n\t/** Config overrides, merged per section over the defaults worker-side. */\n\tconfig?: EngineConfigOverride;\n\t/**\n\t * Names of built-in packages the worker should register. Omitted registers\n\t * them all. Names rather than the packages themselves, since a package\n\t * carries functions that cannot cross a `postMessage` boundary; a host with\n\t * a custom package bakes it into its own worker entry and selects it here by\n\t * name.\n\t */\n\tpackages?: string[];\n\t/** Formatting settings the worker uses when it renders a DTO's display text. */\n\tformatting?: FormattingSettings;\n}\n\n/** Per-call options common to every proxied method. */\nexport interface WorkerCallOptions {\n\t/** Abort the request. Rejects the returned promise and cancels the work worker-side. */\n\tsignal?: AbortSignal;\n}\n\n/**\n * One line whose result changed after a live value resolved worker-side, carried\n * as its freshly re-evaluated {@link SerializedWorkerValue}. The value the host renders\n * against `lineNumber`, recovered worker-side so the main thread needs no further\n * round-trip to display it.\n */\nexport interface WorkerAsyncUpdate {\n\tlineNumber: number;\n\tvalue: SerializedWorkerValue;\n}\n\n/**\n * A live-data resolution that failed worker-side. `error` is the same structured\n * {@link EngineError} an in-process resolver failure would surface, rebuilt from\n * its transported form, so a host branches on `code`/`category` as it always has.\n */\nexport interface WorkerAsyncError {\n\tqueryKey: string;\n\tpackageId: string;\n\terror: EngineError;\n}\n\n/**\n * An async proxy of {@link ExpressionEngine}'s core evaluate methods.\n *\n * Each method mirrors its synchronous counterpart but returns a Promise of the\n * serialisable DTO rather than a live `Value`, and accepts an `AbortSignal`.\n */\nexport interface WorkerEngine {\n\t/** Parse a whole document off-thread. Mirrors `ExpressionEngine.parseDocument`. */\n\tparseDocument(input: string, options?: UnifiedParsingOptions & WorkerCallOptions): Promise<SerializedParsingResult>;\n\t/** Evaluate an array of lines off-thread. Mirrors `ExpressionEngine.evaluateLines`. */\n\tevaluateLines(lines: string[], options?: WorkerCallOptions): Promise<SerializedParsedLine[]>;\n\t/** Evaluate a single expression off-thread. Mirrors `ExpressionEngine.evaluateExpression`. */\n\tevaluateExpression(expression: string, options?: WorkerCallOptions): Promise<SerializedWorkerValue>;\n\t/**\n\t * Subscribe to live-data resolutions that land after a request already\n\t * answered.\n\t *\n\t * A currency, weather or historical-rate value resolves inside the worker some\n\t * time after `parseDocument` returned its pending result. When it does, the\n\t * affected lines are re-evaluated worker-side and their fresh values arrive\n\t * here as one batch. This is a subscription rather than a per-request promise\n\t * because a resolution is tied to no single request: it belongs to whichever\n\t * document is current when the value lands. Returns an unsubscribe function.\n\t */\n\tonResolved(listener: (lines: WorkerAsyncUpdate[]) => void): () => void;\n\t/**\n\t * Subscribe to live-data resolutions that failed. Returns an unsubscribe\n\t * function. See {@link onResolved}; this is its failure channel.\n\t */\n\tonAsyncError(listener: (error: WorkerAsyncError) => void): () => void;\n\t/** Reject every in-flight request and tear the transport down. Idempotent. */\n\tterminate(): void;\n}\n\n/** A promise awaiting one worker answer, plus the abort wiring to unhook when it settles. */\ninterface PendingRequest {\n\tresolve: (value: unknown) => void;\n\treject: (error: unknown) => void;\n\tsignal?: AbortSignal;\n\tonAbort?: () => void;\n}\n\n/**\n * Replaces `date.inputOrder: 'locale'` with the order this side resolves it\n * to, before the config crosses to the worker.\n *\n * `'locale'` means \"ask the reader's machine\", and the reader's machine is\n * this one. A worker re-inferring it would be asking a different environment\n * the same question: a worker thread can carry different `Intl` data (a\n * bundler-provided shim, a small-ICU runtime), so the same document could be\n * read day-first on the main thread and month-first in the worker with nothing\n * to show for it. The resolved order crosses instead, so both sides read the\n * document the same way, and `date.inputLocale` is dropped with it because it\n * has already done its work.\n *\n * Anything else passes through untouched, including an absent config.\n */\nfunction resolveDateOrderForWorker(config: EngineConfigOverride | undefined): EngineConfigOverride | undefined {\n\tif (config?.date?.inputOrder !== \"locale\") return config;\n\tconst date = { ...config.date, inputOrder: resolveDateOrderPolicy({ ...DEFAULT_CONFIG.date, ...config.date }).order };\n\tdelete date.inputLocale;\n\treturn { ...config, date };\n}\n\nclass WorkerEngineClient implements WorkerEngine {\n\tprivate readonly transport: WorkerTransport;\n\tprivate nextId = 1;\n\tprivate readonly pending = new Map<number, PendingRequest>();\n\t// Broadcast subscribers for async resolutions. Sets, not one callback each, so\n\t// several views can watch the same worker; a resolution is not tied to a\n\t// request id, so these live outside `pending`.\n\tprivate readonly resolvedListeners = new Set<(lines: WorkerAsyncUpdate[]) => void>();\n\tprivate readonly asyncErrorListeners = new Set<(error: WorkerAsyncError) => void>();\n\tprivate terminated = false;\n\n\tconstructor(transport: WorkerTransport) {\n\t\tthis.transport = transport;\n\t\tthis.transport.onMessage((raw) => this.onMessage(raw));\n\t}\n\n\t/** Perform the init handshake, resolving once the worker posts `ready`. */\n\tinit(options: WorkerEngineOptions): Promise<void> {\n\t\tconst id = this.nextId++;\n\t\treturn new Promise<void>((resolve, reject) => {\n\t\t\tthis.pending.set(id, { resolve: () => resolve(), reject });\n\t\t\tthis.transport.postMessage({\n\t\t\t\tkind: \"init\",\n\t\t\t\tid,\n\t\t\t\tlocaleCode: options.localeCode,\n\t\t\t\tdiagnostics: options.diagnostics,\n\t\t\t\tconfig: resolveDateOrderForWorker(options.config),\n\t\t\t\tpackages: options.packages,\n\t\t\t\tformatting: options.formatting,\n\t\t\t});\n\t\t});\n\t}\n\n\tparseDocument(\n\t\tinput: string,\n\t\toptions?: UnifiedParsingOptions & WorkerCallOptions,\n\t): Promise<SerializedParsingResult> {\n\t\t// The signal stays main-side and drives a `cancel`; only the parsing\n\t\t// options cross, so an AbortSignal never reaches `postMessage`.\n\t\tconst { signal, ...parsing } = options ?? {};\n\t\tconst parseOptions = Object.keys(parsing).length > 0 ? (parsing as UnifiedParsingOptions) : undefined;\n\t\treturn this.call<SerializedParsingResult>(\"parseDocument\", [input, parseOptions], signal);\n\t}\n\n\tevaluateLines(lines: string[], options?: WorkerCallOptions): Promise<SerializedParsedLine[]> {\n\t\treturn this.call<SerializedParsedLine[]>(\"evaluateLines\", [lines], options?.signal);\n\t}\n\n\tevaluateExpression(expression: string, options?: WorkerCallOptions): Promise<SerializedWorkerValue> {\n\t\treturn this.call<SerializedWorkerValue>(\"evaluateExpression\", [expression], options?.signal);\n\t}\n\n\tonResolved(listener: (lines: WorkerAsyncUpdate[]) => void): () => void {\n\t\tthis.resolvedListeners.add(listener);\n\t\treturn () => this.resolvedListeners.delete(listener);\n\t}\n\n\tonAsyncError(listener: (error: WorkerAsyncError) => void): () => void {\n\t\tthis.asyncErrorListeners.add(listener);\n\t\treturn () => this.asyncErrorListeners.delete(listener);\n\t}\n\n\tterminate(): void {\n\t\tif (this.terminated) return;\n\t\tthis.terminated = true;\n\t\tconst error = workerTerminatedError();\n\t\tfor (const entry of this.pending.values()) {\n\t\t\tthis.unhook(entry);\n\t\t\tentry.reject(error);\n\t\t}\n\t\tthis.pending.clear();\n\t\t// No more resolutions can arrive across a torn-down transport, so drop the\n\t\t// subscribers rather than leaving them referenced for the client's lifetime.\n\t\tthis.resolvedListeners.clear();\n\t\tthis.asyncErrorListeners.clear();\n\t\tthis.transport.terminate();\n\t}\n\n\t/** Dispatch one request and return the promise that settles on its answer. */\n\tprivate call<T>(method: WorkerMethod, args: WorkerRequestArgs, signal?: AbortSignal): Promise<T> {\n\t\tif (this.terminated) return Promise.reject(workerTerminatedError());\n\t\tif (signal?.aborted) return Promise.reject(workerCancelledError(method));\n\n\t\tconst id = this.nextId++;\n\t\treturn new Promise<T>((resolve, reject) => {\n\t\t\tconst entry: PendingRequest = { resolve: resolve as (value: unknown) => void, reject };\n\n\t\t\tif (signal) {\n\t\t\t\tconst onAbort = (): void => {\n\t\t\t\t\t// Nothing to do if the answer already arrived and settled this id.\n\t\t\t\t\tif (!this.pending.has(id)) return;\n\t\t\t\t\tthis.pending.delete(id);\n\t\t\t\t\tthis.transport.postMessage({ kind: \"cancel\", id });\n\t\t\t\t\treject(workerCancelledError(method));\n\t\t\t\t};\n\t\t\t\tentry.signal = signal;\n\t\t\t\tentry.onAbort = onAbort;\n\t\t\t\tsignal.addEventListener(\"abort\", onAbort, { once: true });\n\t\t\t}\n\n\t\t\tthis.pending.set(id, entry);\n\t\t\tthis.transport.postMessage({ kind: \"request\", id, method, args });\n\t\t});\n\t}\n\n\t/** Route one incoming message to the request that is waiting on its id. */\n\tprivate onMessage(raw: unknown): void {\n\t\tconst message = raw as WorkerToMainMessage;\n\t\tswitch (message.kind) {\n\t\t\tcase \"ready\":\n\t\t\tcase \"result\": {\n\t\t\t\tconst value = message.kind === \"result\" ? message.value : undefined;\n\t\t\t\tthis.settle(message.id, (entry) => entry.resolve(value));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase \"error\":\n\t\t\t\tthis.settle(message.id, (entry) => entry.reject(deserializeEngineError(message.error)));\n\t\t\t\tbreak;\n\t\t\tcase \"async-update\":\n\t\t\t\t// A broadcast, not an answer to a request: fan it out to every\n\t\t\t\t// subscriber. A copy of the listener set is iterated so a listener\n\t\t\t\t// that unsubscribes itself mid-callback cannot disturb the walk.\n\t\t\t\tfor (const listener of [...this.resolvedListeners]) listener(message.lines);\n\t\t\t\tbreak;\n\t\t\tcase \"async-error\":\n\t\t\t\tfor (const listener of [...this.asyncErrorListeners]) {\n\t\t\t\t\tlistener({\n\t\t\t\t\t\tqueryKey: message.queryKey,\n\t\t\t\t\t\tpackageId: message.packageId,\n\t\t\t\t\t\terror: deserializeEngineError(message.error),\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t}\n\t}\n\n\t/** Remove a pending request by id and run the settle callback, if it is still pending. */\n\tprivate settle(id: number, apply: (entry: PendingRequest) => void): void {\n\t\tconst entry = this.pending.get(id);\n\t\tif (!entry) return;\n\t\tthis.pending.delete(id);\n\t\tthis.unhook(entry);\n\t\tapply(entry);\n\t}\n\n\t/** Detach an entry's abort listener so a settled request leaves nothing on the signal. */\n\tprivate unhook(entry: PendingRequest): void {\n\t\tif (entry.signal && entry.onAbort) entry.signal.removeEventListener(\"abort\", entry.onAbort);\n\t}\n}\n\n/**\n * Build a worker-backed engine and wait for it to be ready.\n *\n * ```ts\n * const { client, host } = createLinkedTransports();\n * startWorkerRuntime(host);\n * const engine = await createWorkerEngine({ transport: client });\n * const result = await engine.parseDocument(text);\n * ```\n *\n * In production `client` wraps a real `Worker` (see `eventTargetTransport` /\n * `messagePortTransport`), and `startWorkerRuntime` runs inside that worker.\n */\nexport async function createWorkerEngine(options: WorkerEngineOptions): Promise<WorkerEngine> {\n\tconst client = new WorkerEngineClient(options.transport);\n\tawait client.init(options);\n\treturn client;\n}\n","/**\n * Turn live engine results into the clone-safe DTOs the worker harness posts.\n *\n * These functions run on the worker side, just before a result crosses the\n * boundary, and are also what the main side re-runs on a synchronous result to\n * compare the two paths in tests. They are pure and deterministic given the\n * same {@link FormattingSettings}, so a value serialised on either side is\n * byte-for-byte the same DTO.\n */\n\nimport { Value, ValueType, type MatrixData, type MatrixEntry, type RangeData, type ColourData, type ChartData, type IpCidrData } from \"@solve-js/vm/Value\";\nimport { formatValue } from \"@solve-js/format/FormatEngine\";\nimport { toHexString, formatColour } from \"@solve-js/packages/colour/ColourMath\";\nimport type { FormattingSettings } from \"@solve-js/format/FormattingSettings\";\nimport { formatSymbolic } from \"@solve-js/symbolic\";\nimport type { ParsedLine, InlineSolvePosition, ParsingResult } from \"@solve-js/types/ParsingResult\";\nimport type {\n\tSerializedWorkerValue,\n\tSerializedMatrix,\n\tSerializedParsedLine,\n\tSerializedInlineSolve,\n\tSerializedParsingResult,\n} from \"./dto\";\n\n/**\n * The JSON-safe string tag for a non-finite reading. `Infinity`/`-Infinity`/`NaN`\n * cannot cross `JSON` (which turns each into `null`), so this one string form is\n * what survives both `structuredClone` and `JSON`, and a host recovers the value\n * with `Number(tag)`. Shared by the scalar `nonFinite` field and matrix cells.\n */\nfunction nonFiniteTag(n: number): \"Infinity\" | \"-Infinity\" | \"NaN\" {\n\treturn n > 0 ? \"Infinity\" : n < 0 ? \"-Infinity\" : \"NaN\";\n}\n\n/** Project a matrix onto clone-safe cells: finite primitives pass through, symbolic cells and non-finite numbers become strings. */\nfunction serializeMatrix(m: MatrixData): SerializedMatrix {\n\tconst cells = m.data.map((cell: MatrixEntry): number | boolean | string => {\n\t\t// A `SymbolicNode` (the object-typed cell variant) flattens to its display\n\t\t// string. A non-finite number (a `[1/0, 2]` cell) cannot cross JSON any\n\t\t// more than a scalar reading can, so it takes the same string tag rather\n\t\t// than being passed through raw and turned into `null` by `JSON.stringify`\n\t\t// (which would diverge from the `structuredClone` path). A finite number\n\t\t// or a boolean is already clone-safe and passes through.\n\t\tif (typeof cell === \"object\" && cell !== null) return formatSymbolic(cell);\n\t\tif (typeof cell === \"number\" && !Number.isFinite(cell)) return nonFiniteTag(cell);\n\t\treturn cell;\n\t});\n\treturn { rows: m.rows, cols: m.cols, cells, hasSymbolic: m.hasSymbolic };\n}\n\n/**\n * Project a {@link Value} onto a {@link SerializedWorkerValue}.\n *\n * `text` and `number` are set for every value; the type-specific fields are\n * added only where the payload needs them, so the DTO stays minimal and a\n * deep-equal between the two evaluation paths does not trip on a property one\n * side left `undefined`.\n */\nexport function serializeValue(value: Value, settings?: FormattingSettings): SerializedWorkerValue {\n\tconst reading = value.toNumber();\n\tconst dto: SerializedWorkerValue = {\n\t\ttype: value.type,\n\t\ttext: formatValue(value, settings),\n\t\t// A non-finite reading (1/0, 0/0, an overflow) cannot cross JSON, which\n\t\t// turns it into null and breaks the round-trip the DTO guarantees. Keep\n\t\t// `number` finite and name the real value in `nonFinite` instead.\n\t\tnumber: Number.isFinite(reading) ? reading : 0,\n\t};\n\tif (!Number.isFinite(reading)) {\n\t\tdto.nonFinite = nonFiniteTag(reading);\n\t}\n\n\tif (value.unit !== undefined) dto.unit = value.unit;\n\tif (value.timedOut !== undefined) dto.timedOut = value.timedOut;\n\t// The two datetime sidecars cross as themselves: both are plain JSON\n\t// scalars, so the clone guarantee is untouched, and a worker result that\n\t// dropped them would answer a different question from the synchronous one.\n\tif (value.grain !== undefined) dto.grain = value.grain;\n\tif (value.zone !== undefined) dto.zone = value.zone;\n\n\tconst raw = value.value;\n\tif (typeof raw === \"bigint\") {\n\t\t// Covers BigInt values and a Hex value that carries a bigint magnitude:\n\t\t// a base-ten string is the one representation that neither loses\n\t\t// precision nor breaks JSON.\n\t\tdto.bigint = raw.toString();\n\t} else if (value.type === ValueType.Matrix) {\n\t\tdto.matrix = serializeMatrix(raw as MatrixData);\n\t} else if (value.type === ValueType.Range) {\n\t\tconst r = raw as RangeData;\n\t\tdto.range = { min: r.min, max: r.max };\n\t} else if (value.type === ValueType.Colour) {\n\t\tconst c = raw as ColourData;\n\t\tdto.colour = { hex: toHexString(c), r: c.r, g: c.g, b: c.b, a: c.a, format: c.format, css: formatColour(c) };\n\t} else if (value.type === ValueType.Chart) {\n\t\tconst c = raw as ChartData;\n\t\tdto.chart = {\n\t\t\tkind: c.kind,\n\t\t\tpoints: c.points.map((pt) => [pt[0], pt[1]]),\n\t\t\tlabel: c.label,\n\t\t\tdomain: [c.domain[0], c.domain[1]],\n\t\t\trange: [c.range[0], c.range[1]],\n\t\t\t...(c.expr !== undefined ? { expr: c.expr } : {}),\n\t\t};\n\t} else if (value.type === ValueType.IpCidr) {\n\t\tconst ip = raw as IpCidrData;\n\t\tdto.ipCidr = {\n\t\t\t...(ip.addr !== undefined ? { addr: ip.addr } : {}),\n\t\t\t...(ip.prefix !== undefined ? { prefix: ip.prefix } : {}),\n\t\t\ttext: formatValue(value).replace(/^=\\s*/, \"\"),\n\t\t};\n\t}\n\n\treturn dto;\n}\n\n/** Serialise a nullable value, the shape both `result` fields carry. */\nfunction serializeMaybe(value: Value | null | undefined, settings?: FormattingSettings): SerializedWorkerValue | null {\n\treturn value ? serializeValue(value, settings) : null;\n}\n\n/** Project an inline solve onto its DTO, serialising its result. */\nfunction serializeInlineSolve(solve: InlineSolvePosition, settings?: FormattingSettings): SerializedInlineSolve {\n\treturn {\n\t\tstart: solve.start,\n\t\tend: solve.end,\n\t\texpression: solve.expression,\n\t\tlineNumber: solve.lineNumber,\n\t\tcolumnNumber: solve.columnNumber,\n\t\tresult: serializeMaybe(solve.result, settings),\n\t\terror: solve.error ?? null,\n\t};\n}\n\n/** Project a parsed line onto its DTO, serialising its result and every inline solve. */\nexport function serializeParsedLine(line: ParsedLine, settings?: FormattingSettings): SerializedParsedLine {\n\treturn {\n\t\tlineNumber: line.lineNumber,\n\t\ttext: line.text,\n\t\tstartPosition: line.startPosition,\n\t\tendPosition: line.endPosition,\n\t\tisEmpty: line.isEmpty,\n\t\thasInlineSolves: line.hasInlineSolves,\n\t\tinlineSolves: line.inlineSolves.map((solve) => serializeInlineSolve(solve, settings)),\n\t\texpression: line.expression,\n\t\tresult: serializeMaybe(line.result, settings),\n\t\terror: line.error,\n\t};\n}\n\n/** Project a whole parsing result onto its DTO. */\nexport function serializeParsingResult(result: ParsingResult, settings?: FormattingSettings): SerializedParsingResult {\n\tconst dto: SerializedParsingResult = {\n\t\tlines: result.lines.map((line) => serializeParsedLine(line, settings)),\n\t\ttotalLines: result.totalLines,\n\t\terrors: [...result.errors],\n\t};\n\t// The diagnostics report is already the engine's own JSON form, so it\n\t// crosses unchanged; present only when the host asked for it.\n\tif (result.diagnostics !== undefined) dto.diagnostics = result.diagnostics;\n\treturn dto;\n}\n","/**\n * The worker-side half of the harness: it owns an {@link ExpressionEngine} and\n * answers the protocol.\n *\n * {@link startWorkerRuntime} is transport-agnostic, so the same function runs\n * behind a browser `Worker`, a Node `worker_threads` port, or an in-process\n * link. A host's worker entry file is two lines: adapt the environment onto a\n * {@link WorkerTransport} and call this.\n *\n * The runtime never posts a raw {@link Value}. Every result is projected onto a\n * DTO first (`worker/serialize.ts`), and every failure is caught and flattened\n * into a structured error, so a worker-side throw reaches the caller as an\n * `EngineError` rather than a lost promise.\n */\n\nimport { ExpressionEngine } from \"@solve-js/engine/ExpressionEngine\";\nimport type { AsyncResolutionEvent } from \"@solve-js/engine/AsyncResolutionBatcher\";\nimport type { IEnginePackage } from \"@solve-js/api/PackageRegistry\";\nimport { BUILTIN_PACKAGES } from \"@solve-js/packages/builtins\";\nimport { DEFAULT_FORMATTING_SETTINGS, type FormattingSettings } from \"@solve-js/format/FormattingSettings\";\nimport type { CalendarBackend } from \"@solve-js/calendar/CalendarBackend\";\nimport {\n\tErrorFactory,\n\tnormalizeUnknownError,\n\tserializeEngineError,\n\tWorkerErrorCodes,\n} from \"@solve-js/errors\";\nimport { serializeParsingResult, serializeParsedLine, serializeValue } from \"./serialize\";\nimport type { WorkerTransport } from \"./transport\";\nimport type {\n\tMainToWorkerMessage,\n\tInitMessage,\n\tRequestMessage,\n\tWorkerToMainMessage,\n\tAsyncResolvedLine,\n} from \"./protocol\";\n\n/** Options a host bakes into its own worker entry: its custom packages, and its calendar backend. */\nexport interface WorkerRuntimeOptions {\n\t/**\n\t * The packages available to register, defaulting to {@link BUILTIN_PACKAGES}.\n\t * A host with its own package authors a worker entry that passes them here,\n\t * then selects among them by name from the main side. This is how a\n\t * function-carrying package reaches the worker: baked into its bundle, never\n\t * posted across the boundary.\n\t */\n\tpackages?: IEnginePackage[];\n\t/**\n\t * The calendar backend the worker's engine computes dates with, and writes\n\t * them out with, as the engine's own `calendar` option. Defaults to the\n\t * built-in `Date` backend. Baked in here for the same reason a package is:\n\t * a backend is an object of functions and cannot be posted across the\n\t * boundary, so the main side's formatting settings never carry one.\n\t */\n\tcalendar?: CalendarBackend;\n}\n\n/**\n * Resolve the requested package names against the available set.\n *\n * Undefined names means \"all of them\". A name with no match is a configuration\n * failure the caller must see, not a silent omission that would leave a feature\n * quietly missing from every result.\n */\nfunction resolvePackages(available: IEnginePackage[], names: string[] | undefined): IEnginePackage[] {\n\tif (names === undefined) return available;\n\tconst byName = new Map(available.map((pkg) => [pkg.name, pkg]));\n\tconst resolved: IEnginePackage[] = [];\n\tfor (const name of names) {\n\t\tconst pkg = byName.get(name);\n\t\tif (!pkg) {\n\t\t\tthrow ErrorFactory.config(\n\t\t\t\tWorkerErrorCodes.WORKER_UNKNOWN_PACKAGE,\n\t\t\t\t`No package named \"${name}\" is available in this worker runtime`,\n\t\t\t\t{ name, available: [...byName.keys()] },\n\t\t\t);\n\t\t}\n\t\tresolved.push(pkg);\n\t}\n\treturn resolved;\n}\n\n/**\n * Attach the runtime to a transport and start serving.\n *\n * Returns a teardown function that clears the engine and detaches, for a host\n * that reuses a transport or shuts a worker down cleanly.\n */\nexport function startWorkerRuntime(transport: WorkerTransport, options: WorkerRuntimeOptions = {}): () => void {\n\tconst available = options.packages ?? BUILTIN_PACKAGES;\n\n\tlet engine: ExpressionEngine | null = null;\n\tlet formatting: FormattingSettings | undefined;\n\t// One AbortController per in-flight request, so a `cancel` can map onto the\n\t// engine's keystroke signal for exactly the request the caller aborted.\n\tconst inFlight = new Map<number, AbortController>();\n\n\t// The line texts of the current document, keyed by the line number the engine\n\t// evaluates them under (1-based for a document, -1 for a lone expression). An\n\t// async resolution names the lines whose result changed but not the new value,\n\t// so this is what the event pump re-reads a line from to recover it.\n\tlet retainedLines = new Map<number, string>();\n\n\t// The current document's abort controller, kept alive past the request that\n\t// created it so this document's async resolutions can still land. Aborted when\n\t// a new document supersedes it: aborting drops the old document's in-flight\n\t// resolutions at the engine's own staleness guard (an aborted signal is\n\t// discarded before it reaches the batcher), so a stale value never reaches the\n\t// host as if it were current. See {@link handleRequest}.\n\tlet documentController: AbortController | null = null;\n\n\t// Cancels the event-stream reader on teardown. Null until the pump starts.\n\tlet stopEventPump: (() => void) | null = null;\n\n\tconst post = (message: WorkerToMainMessage): void => transport.postMessage(message);\n\n\tconst fail = (id: number, error: unknown): void => {\n\t\tpost({ kind: \"error\", id, error: serializeEngineError(normalizeUnknownError(error)) });\n\t};\n\n\t/**\n\t * Record the line texts a request evaluates, so a later async resolution can\n\t * re-read exactly the lines it names. A whole document splits into 1-based\n\t * lines; a lone `evaluateExpression` maps onto the engine's `-1` sentinel, the\n\t * same line number the engine registers and later reports for it.\n\t */\n\tconst retainLines = (message: RequestMessage): Map<number, string> => {\n\t\tconst map = new Map<number, string>();\n\t\tif (message.method === \"parseDocument\") {\n\t\t\t(message.args[0] as string).split(\"\\n\").forEach((text, index) => map.set(index + 1, text));\n\t\t} else if (message.method === \"evaluateLines\") {\n\t\t\t(message.args[0] as string[]).forEach((text, index) => map.set(index + 1, text));\n\t\t} else {\n\t\t\tmap.set(-1, message.args[0] as string);\n\t\t}\n\t\treturn map;\n\t};\n\n\t/**\n\t * Turn one async resolution event into a message home.\n\t *\n\t * A `lines-updated` event names the lines whose result changed; the resolved\n\t * value lives in the engine's cache, so each named line is re-evaluated (which\n\t * now reads the settled value from that cache rather than starting a fresh\n\t * fetch) and serialised. A line the current document no longer retains belongs\n\t * to a superseded document and is skipped. An `error` event carries the failed\n\t * query straight across as a structured error.\n\t */\n\tconst handleAsyncEvent = (eng: ExpressionEngine, event: AsyncResolutionEvent): void => {\n\t\tif (event.type === \"error\") {\n\t\t\tpost({\n\t\t\t\tkind: \"async-error\",\n\t\t\t\tqueryKey: event.queryKey,\n\t\t\t\tpackageId: event.packageId,\n\t\t\t\terror: serializeEngineError(normalizeUnknownError(event.error)),\n\t\t\t});\n\t\t\treturn;\n\t\t}\n\n\t\tconst lines: AsyncResolvedLine[] = [];\n\t\tfor (const lineNumber of event.lineNumbers) {\n\t\t\tconst text = retainedLines.get(lineNumber);\n\t\t\tif (text === undefined) continue;\n\t\t\ttry {\n\t\t\t\tconst value = eng.evaluateLine(lineNumber, text);\n\t\t\t\tif (value) lines.push({ lineNumber, value: serializeValue(value, formatting) });\n\t\t\t} catch {\n\t\t\t\t// A line that resolved into an error re-throws on re-evaluation; the\n\t\t\t\t// batcher's own `error` event is the channel for that, so this keeps\n\t\t\t\t// the update to the lines that produced a value rather than posting a\n\t\t\t\t// second, half-formed failure here.\n\t\t\t}\n\t\t}\n\t\tif (lines.length > 0) post({ kind: \"async-update\", lines });\n\t};\n\n\t/**\n\t * Drain the engine's async-resolution event stream for the life of the\n\t * runtime, posting each event home. Started once the engine exists; the reader\n\t * loop ends when the stream closes (engine cleared) or the returned canceller\n\t * runs at teardown.\n\t */\n\tconst startEventPump = (eng: ExpressionEngine): void => {\n\t\tstopEventPump?.();\n\t\tconst reader = eng.getEventStream().getReader();\n\t\tstopEventPump = () => void reader.cancel();\n\t\tvoid (async () => {\n\t\t\ttry {\n\t\t\t\tfor (;;) {\n\t\t\t\t\tconst { done, value } = await reader.read();\n\t\t\t\t\tif (done) return;\n\t\t\t\t\thandleAsyncEvent(eng, value);\n\t\t\t\t}\n\t\t\t} catch {\n\t\t\t\t// The stream errored or was cancelled (teardown); the loop is done.\n\t\t\t}\n\t\t})();\n\t};\n\n\tconst handleInit = (message: InitMessage): void => {\n\t\ttry {\n\t\t\tconst packages = resolvePackages(available, message.packages);\n\t\t\tengine = new ExpressionEngine({\n\t\t\t\tlocale: message.localeCode ?? \"en\",\n\t\t\t\tdiagnostics: message.diagnostics ?? false,\n\t\t\t\tconfig: message.config,\n\t\t\t\tpackages,\n\t\t\t\tcalendar: options.calendar,\n\t\t\t});\n\t\t\t// The display reads the same backend the engine computes with, so a\n\t\t\t// date in a DTO names the day it was computed on; the main side's\n\t\t\t// settings cannot carry the backend, so it is joined here.\n\t\t\tformatting = options.calendar\n\t\t\t\t? { ...(message.formatting ?? DEFAULT_FORMATTING_SETTINGS), calendar: options.calendar }\n\t\t\t\t: message.formatting;\n\t\t\t// Drain live-data resolutions for the engine's whole lifetime, so a\n\t\t\t// value that settles after a request already answered still reaches the\n\t\t\t// host. Started here, after the engine exists, and torn down with it.\n\t\t\tstartEventPump(engine);\n\t\t\tpost({ kind: \"ready\", id: message.id });\n\t\t} catch (error) {\n\t\t\t// A build failure leaves no engine; the caller's `createWorkerEngine`\n\t\t\t// promise rejects with this rather than hanging on a `ready` that\n\t\t\t// never comes.\n\t\t\tfail(message.id, error);\n\t\t}\n\t};\n\n\tconst runMethod = (eng: ExpressionEngine, message: RequestMessage): unknown => {\n\t\tconst { method, args } = message;\n\t\tswitch (method) {\n\t\t\tcase \"parseDocument\":\n\t\t\t\treturn serializeParsingResult(eng.parseDocument(args[0] as string, args[1] as never), formatting);\n\t\t\tcase \"evaluateLines\":\n\t\t\t\treturn eng.evaluateLines(args[0] as string[]).map((line) => serializeParsedLine(line, formatting));\n\t\t\tcase \"evaluateExpression\":\n\t\t\t\t// Mirrors ExpressionEngine.evaluateExpression: a single Value in,\n\t\t\t\t// a single serialized Value out.\n\t\t\t\treturn serializeValue(eng.evaluateExpression(args[0] as string), formatting);\n\t\t\tdefault:\n\t\t\t\tthrow ErrorFactory.execution(\n\t\t\t\t\tWorkerErrorCodes.WORKER_UNKNOWN_METHOD,\n\t\t\t\t\t`The worker runtime has no method named \"${String(method)}\"`,\n\t\t\t\t\t{ method },\n\t\t\t\t);\n\t\t}\n\t};\n\n\tconst handleRequest = (message: RequestMessage): void => {\n\t\tconst eng = engine;\n\t\tif (!eng) {\n\t\t\tfail(\n\t\t\t\tmessage.id,\n\t\t\t\tErrorFactory.execution(\n\t\t\t\t\tWorkerErrorCodes.WORKER_NOT_INITIALISED,\n\t\t\t\t\t\"The worker received a request before its engine finished initialising\",\n\t\t\t\t),\n\t\t\t);\n\t\t\treturn;\n\t\t}\n\n\t\t// Supersede the previous document: abort its controller so any resolution\n\t\t// still in flight for it is dropped at the engine's staleness guard rather\n\t\t// than posted home as if it belonged to this request's document. The old\n\t\t// retained lines go with it. Every evaluate call shares one engine and one\n\t\t// document context, so the most recent call is the live one.\n\t\tdocumentController?.abort();\n\n\t\t// This request's controller doubles as the document controller: wired in as\n\t\t// the keystroke signal so a later `cancel` (or the next supersede) aborts\n\t\t// the async work this evaluation fires, the same mechanism a host uses on\n\t\t// the main thread. It is deliberately NOT aborted when the request settles,\n\t\t// so this document's live values can still resolve and stream back.\n\t\tconst controller = new AbortController();\n\t\tdocumentController = controller;\n\t\tretainedLines = retainLines(message);\n\t\tinFlight.set(message.id, controller);\n\t\teng.setKeystrokeSignal(controller.signal);\n\n\t\ttry {\n\t\t\tconst value = runMethod(eng, message);\n\t\t\tpost({ kind: \"result\", id: message.id, value });\n\t\t} catch (error) {\n\t\t\tfail(message.id, error);\n\t\t} finally {\n\t\t\tinFlight.delete(message.id);\n\t\t\teng.setKeystrokeSignal(null);\n\t\t}\n\t};\n\n\ttransport.onMessage((raw) => {\n\t\tconst message = raw as MainToWorkerMessage;\n\t\tswitch (message.kind) {\n\t\t\tcase \"init\":\n\t\t\t\thandleInit(message);\n\t\t\t\tbreak;\n\t\t\tcase \"request\":\n\t\t\t\thandleRequest(message);\n\t\t\t\tbreak;\n\t\t\tcase \"cancel\":\n\t\t\t\t// Abort maps onto the keystroke signal for the named request; a\n\t\t\t\t// cancel that arrives after the request already settled finds no\n\t\t\t\t// controller and is a harmless no-op.\n\t\t\t\tinFlight.get(message.id)?.abort();\n\t\t\t\tbreak;\n\t\t}\n\t});\n\n\treturn () => {\n\t\tstopEventPump?.();\n\t\tstopEventPump = null;\n\t\tdocumentController?.abort();\n\t\tdocumentController = null;\n\t\tretainedLines = new Map();\n\t\tfor (const controller of inFlight.values()) controller.abort();\n\t\tinFlight.clear();\n\t\tengine?.clear();\n\t\tengine = null;\n\t\ttransport.terminate();\n\t};\n}\n","/**\n * The seam between the harness and whatever actually carries messages.\n *\n * Both the client (`worker/client.ts`) and the runtime (`worker/runtime.ts`)\n * talk to a {@link WorkerTransport} and nothing more, so the same code drives a\n * browser `Worker`, a Node `worker_threads` port, or an in-process pair. The\n * three factory functions below adapt each of those onto the interface; a host\n * with a transport this file does not cover can implement the three methods\n * directly.\n */\n\n/**\n * A bidirectional message channel with a single receive handler.\n *\n * `onMessage` registers the one handler the harness needs; calling it again\n * replaces the previous handler. `terminate` tears the channel down and is safe\n * to call more than once.\n */\nexport interface WorkerTransport {\n\t/** Send one message to the other end. The message must be clone-safe. */\n\tpostMessage(message: unknown): void;\n\t/** Register the handler that receives messages from the other end. */\n\tonMessage(handler: (message: unknown) => void): void;\n\t/** Tear the channel down. Idempotent. */\n\tterminate(): void;\n}\n\n/**\n * Clone a message the way `postMessage` would, so an in-process transport has\n * the same value semantics as a real one.\n *\n * The harness protocol is clone-safe by construction, so the `JSON` fallback\n * (for a runtime without a global `structuredClone`) is lossless here; the\n * structured-clone path is preferred because it is what a real worker uses and\n * because it throws loudly if a non-clone-safe value ever reaches it, which is\n * exactly the mistake the DTO layer exists to prevent.\n *\n * A function, not a module-level const, so this module does no work at load\n * time and stays deletable under the package's `sideEffects: false` claim; the\n * `typeof` probe runs once per message, which is free next to the clone itself.\n */\nfunction cloneMessage<T>(value: T): T {\n\treturn typeof globalThis.structuredClone === \"function\"\n\t\t? globalThis.structuredClone(value)\n\t\t: JSON.parse(JSON.stringify(value));\n}\n\n/**\n * A pair of linked in-process transports.\n *\n * `client` and `host` are two ends of one channel: a message posted on either\n * is cloned at post time and delivered to the other on a microtask, so delivery\n * is asynchronous (as a real worker's is) but deterministic (no timers, no I/O).\n * Wire `client` into {@link createWorkerEngine} and `host` into\n * {@link startWorkerRuntime} to run the whole protocol, DTO serialisation and\n * cancellation included, without a second thread. This is the transport tests\n * use, and a fit for a host that wants the message-passing shape on one thread.\n */\nexport function createLinkedTransports(): { client: WorkerTransport; host: WorkerTransport } {\n\tlet clientHandler: ((message: unknown) => void) | null = null;\n\tlet hostHandler: ((message: unknown) => void) | null = null;\n\tlet alive = true;\n\n\t// The handler is read at delivery time rather than post time so setup order\n\t// (post before the other end has registered) cannot drop a message.\n\tconst deliver = (target: () => ((message: unknown) => void) | null, message: unknown): void => {\n\t\tconst cloned = cloneMessage(message);\n\t\tqueueMicrotask(() => {\n\t\t\tif (!alive) return;\n\t\t\ttarget()?.(cloned);\n\t\t});\n\t};\n\n\tconst client: WorkerTransport = {\n\t\tpostMessage: (message) => deliver(() => hostHandler, message),\n\t\tonMessage: (handler) => {\n\t\t\tclientHandler = handler;\n\t\t},\n\t\tterminate: () => {\n\t\t\talive = false;\n\t\t},\n\t};\n\n\tconst host: WorkerTransport = {\n\t\tpostMessage: (message) => deliver(() => clientHandler, message),\n\t\tonMessage: (handler) => {\n\t\t\thostHandler = handler;\n\t\t},\n\t\tterminate: () => {\n\t\t\talive = false;\n\t\t},\n\t};\n\n\treturn { client, host };\n}\n\n/** The `postMessage`/`onmessage`/event-listener shape a browser `Worker`, a worker's `self`, or a DOM `MessagePort` presents. */\ninterface EventTargetLike {\n\tpostMessage(message: unknown): void;\n\taddEventListener?(type: \"message\", handler: (event: { data: unknown }) => void): void;\n\tonmessage?: ((event: { data: unknown }) => void) | null;\n\tterminate?(): void;\n\tclose?(): void;\n\tstart?(): void;\n}\n\n/**\n * Adapt a browser-style message target onto a {@link WorkerTransport}.\n *\n * Covers the main-side `Worker`, the worker global `self`, and a DOM\n * `MessagePort`: each posts with `postMessage` and receives a `MessageEvent`\n * whose `data` is the payload. A `MessagePort` is `start`ed here so it begins\n * dispatching. On the main side pass a `Worker`; inside a browser worker pass\n * `self`.\n */\nexport function eventTargetTransport(target: EventTargetLike): WorkerTransport {\n\treturn {\n\t\tpostMessage: (message) => target.postMessage(message),\n\t\tonMessage: (handler) => {\n\t\t\tconst listener = (event: { data: unknown }): void => handler(event.data);\n\t\t\tif (typeof target.addEventListener === \"function\") {\n\t\t\t\ttarget.addEventListener(\"message\", listener);\n\t\t\t} else {\n\t\t\t\ttarget.onmessage = listener;\n\t\t\t}\n\t\t\ttarget.start?.();\n\t\t},\n\t\t// A main-side Worker terminates; a worker's own `self` closes. Calling\n\t\t// whichever exists keeps one adapter usable from both ends.\n\t\tterminate: () => {\n\t\t\ttarget.terminate?.();\n\t\t\ttarget.close?.();\n\t\t},\n\t};\n}\n\n/** The `postMessage`/`on(\"message\")` shape a Node `worker_threads` `Worker`, `parentPort`, or `MessagePort` presents. */\ninterface MessagePortLike {\n\tpostMessage(message: unknown): void;\n\ton(event: \"message\", handler: (message: unknown) => void): void;\n\tterminate?(): void;\n\tclose?(): void;\n}\n\n/**\n * Adapt a Node `worker_threads` port onto a {@link WorkerTransport}.\n *\n * Covers the main-side `Worker`, the worker's `parentPort`, and a\n * `worker_threads` `MessagePort`: each posts with `postMessage` and emits a\n * `\"message\"` event whose argument IS the payload (no `.data` wrapper, unlike\n * the DOM). On the main side pass the `Worker`; inside the worker pass\n * `parentPort`.\n */\nexport function messagePortTransport(port: MessagePortLike): WorkerTransport {\n\treturn {\n\t\tpostMessage: (message) => port.postMessage(message),\n\t\tonMessage: (handler) => {\n\t\t\tport.on(\"message\", (message) => handler(message));\n\t\t},\n\t\tterminate: () => {\n\t\t\tport.terminate?.();\n\t\t\tport.close?.();\n\t\t},\n\t};\n}\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "solve-engine",
-  "version": "2.32.0",
+  "version": "2.33.0",
   "description": "An embeddable expression engine for natural-language calculations: units, currencies, percentages, dates and matrices, with the parsing and evaluation plumbing already built.",
   "keywords": [
     "expression-evaluator",

package/dist/chunk-4DR5RBHQ.cjs

@@ -1,2 +0,0 @@
-'use strict';var chunkWU7SBKVU_cjs=require('./chunk-WU7SBKVU.cjs'),chunkYBQOQTVL_cjs=require('./chunk-YBQOQTVL.cjs'),chunkSUAGBRQ7_cjs=require('./chunk-SUAGBRQ7.cjs');var N=32,L=2;function v(a){return a.shape!==void 0?a.shape:a.startTokenTypes!==void 0?[{types:a.startTokenTypes}]:[]}var x=class{constructor(e){this.rules=e;let r=e.length,t=Math.max(1,Math.ceil(r/N));this.words=t,this.scratch=new Uint32Array(t);let s=e.map(v),n=0;for(let l of s)for(let c of l)for(let f of c.types??[])n=Math.max(n,chunkYBQOQTVL_cjs.c(f));this.typeRows=n+1;let i=0;for(let l of s)i=Math.max(i,l.length);i=Math.min(i,L),this.allRules=new Uint32Array(t);for(let l=0;l<r;l++)this.allRules[l/N|0]|=1<<l%N;let u=[];for(let l=0;l<i;l++)u.push(this.buildPlane(s,l,t));this.planes=u;}buildPlane(e,r,t){let s={byType:new Uint32Array(this.typeRows*t),typeAny:new Uint32Array(t),atEnd:new Uint32Array(t),typeHasValues:new Uint8Array(this.typeRows),byValue:new Map,valueAny:new Uint32Array(t)};for(let n=0;n<e.length;n++){let i=e[n][r],u=n/N|0,l=1<<n%N,c=i?.types;if(c===void 0)s.typeAny[u]|=l,s.atEnd[u]|=l;else for(let p of c)s.byType[chunkYBQOQTVL_cjs.c(p)*t+u]|=l;let f=i?.values;if(f===void 0)s.valueAny[u]|=l;else {for(let p of f){let h=p.toLowerCase(),o=s.byValue.get(h);o===void 0&&(o=new Uint32Array(t),s.byValue.set(h,o)),o[u]|=l;}if(c===void 0)s.typeHasValues.fill(1);else for(let p of c){let h=chunkYBQOQTVL_cjs.c(p);h<this.typeRows&&(s.typeHasValues[h]=1);}}}return s}get size(){return this.rules.length}get depth(){return this.planes.length}candidates(e,r){let t=this.words,s=this.scratch,n=this.planes,i=e.length;if(n.length===0)return s.set(this.allRules),s;for(let u=0;u<n.length;u++){let l=n[u],c=r+u;if(c>=i){if(u===0)s.set(l.atEnd);else for(let o=0;o<t;o++)s[o]&=l.atEnd[o];continue}let f=e[c],p=f.typeId,h=p>=0&&p<this.typeRows?p*t:-1;if(u===0)if(h>=0)for(let o=0;o<t;o++)s[o]=l.byType[h+o]|l.typeAny[o];else s.set(l.typeAny);else if(h>=0)for(let o=0;o<t;o++)s[o]&=l.byType[h+o]|l.typeAny[o];else for(let o=0;o<t;o++)s[o]&=l.typeAny[o];if(h>=0&&l.typeHasValues[p]===1){let o=f.value,R=O(o)?o.toLowerCase():o,g=l.byValue.get(R);for(let T=0;T<t;T++)s[T]&=(g===void 0?0:g[T])|l.valueAny[T];}if(S(s))return s}return s}};function S(a){for(let e=0;e<a.length;e++)if(a[e]!==0)return  false;return  true}function O(a){for(let e=0;e<a.length;e++){let r=a.charCodeAt(e);if(r>=65&&r<=90)return  true}return  false}var B={maxPasses:100,maxTokens:1e4,onFusion:()=>{},ignoreRuleIndex:false};function C(a,e,r){let t=r[0],s=r[r.length-1],n=new chunkWU7SBKVU_cjs.a(a,chunkYBQOQTVL_cjs.c(a),e,e,t.offset,t.lineBreaks??0,t.line,t.col);return n.sourceEnd=s.sourceEnd??s.offset+s.text.length,n}function z(a,e){let r=e[e.length-1];r&&(a.sourceEnd=r.sourceEnd??r.offset+r.text.length);}var _=["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"],M=(()=>{let a=_.map(t=>chunkYBQOQTVL_cjs.c(t)),e=Math.max(...a)+1,r=new Uint8Array(e);for(let t of a)r[t]=1;return r})(),P=new Set;function D(a){a.shape!==void 0&&a.shape.length>0||a.startTokenTypes===void 0&&a.unshapedReason===void 0&&(P.has(a.name)||(P.add(a.name),console.warn(`[TokenNormalizer] Rule "${a.name}" declares no \`shape\`, so it is tried at every token of every line and slows down documents that never use it. Declare the tokens it can start at, e.g. shape: [{ types: ["IDENT"], values: ["myword"] }, { types: ["LPAREN"] }]. If it genuinely cannot be described that way, set \`unshapedReason\` to say why and this warning will stop.`)));}var U=class{constructor(e={}){this.rules=[];this.sortedRulesCache=null;this.rulesByTokenType=new Map;this.ruleIndexCache=null;this.candidateBuffer=[];this.normalizeCalls=0;this.phraseTrie=new w;this.ruleShapesCache=null;this.options={...B,...e};}register(e){D(e),this.rules.push(e),this.sortedRulesCache=null,this.rulesByTokenType.clear(),this.ruleIndexCache=null,this.ruleShapesCache=null;}unregister(e){this.rules=this.rules.filter(r=>r.name!==e),this.sortedRulesCache=null,this.rulesByTokenType.clear(),this.ruleIndexCache=null,this.ruleShapesCache=null;}clear(){this.rules=[],this.sortedRulesCache=null,this.rulesByTokenType.clear(),this.ruleIndexCache=null,this.ruleShapesCache=null,this.phraseTrie=new w;}getSortedRules(){return this.sortedRulesCache===null&&(this.sortedRulesCache=[...this.rules].sort((e,r)=>r.priority-e.priority)),this.sortedRulesCache}getRuleIndex(){return this.ruleIndexCache===null&&(this.ruleIndexCache=new x(this.getSortedRules())),this.ruleIndexCache}rulesAt(e,r){if(e===null)return this.options.ignoreRuleIndex?this.getSortedRules():this.rulesForTokenType(r);let t=this.candidateBuffer;t.length=0;let s=this.getRuleIndex().rules;for(let n=0;n<e.length;n++){let i=e[n]>>>0,u=n*32;for(;i!==0;)(i&1)!==0&&t.push(s[u]),i>>>=1,u++;}return t}rulesForTokenType(e){let r=this.rulesByTokenType.get(e);return r===void 0&&(r=this.getSortedRules().filter(t=>{let s=v(t)[0];return s?.types===void 0||s.types.includes(e)}),this.rulesByTokenType.set(e,r)),r}get ruleCount(){return this.rules.length}getRuleShapes(){if(this.ruleShapesCache!==null)return this.ruleShapesCache;let e=this.getRuleIndex();return this.ruleShapesCache=this.getSortedRules().map(r=>{let t=v(r);return {name:r.name,priority:r.priority,shape:t,unshapedReason:r.unshapedReason,indexedSlots:Math.min(t.length,e.depth)}}),this.ruleShapesCache}getCandidateCounts(e){let r=this.getRuleIndex(),t=[];for(let s=0;s<e.length;s++){let n=r.candidates(e,s),i=0;for(let u=0;u<n.length;u++){let l=n[u]>>>0;for(;l!==0;)i+=l&1,l>>>=1;}t.push(i);}return t}addPhrase(e,r){this.phraseTrie.addPhrase(e,r);}getPhrases(){return this.phraseTrie.getAllPhrases()}canStartPhrase(e){return this.phraseTrie.canStart(e)}normalize(e,r){if(e.length===0)return e;let t=r??this.options.onFusion,s=this.options.maxPasses,n=this.options.maxTokens,i=this.normalizeCalls>0;i||(this.normalizeCalls=1);let u=i&&!this.options.ignoreRuleIndex,l=u?this.getRuleIndex():null,c=e,f=true,p=0;for(;f&&p<s;){f=false,p++;let h=null,o=0;for(;o<c.length;){let g=false,T=c[o].typeId;if(T>=M.length||M[T]===0){let m=this.phraseTrie.matchAt(c,o);if(m){let d=c.slice(o,o+m.consumed);h===null&&(h=c.slice(0,o));for(let A of m.replacement)h.push(A);m.consumed>1&&m.replacement.length===1&&(z(m.replacement[0],d),t({rule:m.ruleName??"phrase-trie",sourceTokens:d,fusedToken:m.replacement[0]})),o+=m.consumed,f=true;continue}}let I=u?l.candidates(c,o):null;if(I!==null&&S(I)){h!==null&&h.push(c[o]),o++;continue}for(let m of this.rulesAt(I,c[o].type)){let d=m.match(c,o);if(d){let A=c.slice(o,o+d.consumed);h===null&&(h=c.slice(0,o));for(let b of d.replacement)h.push(b);if(d.consumed>1&&d.replacement.length===1)z(d.replacement[0],A),t({rule:m.name,sourceTokens:A,fusedToken:d.replacement[0]});else if(d.consumed>1&&d.replacement.length<d.consumed)for(let b of d.replacement)t({rule:m.name,sourceTokens:A,fusedToken:b});o+=d.consumed,f=true,g=true;break}}g||(h!==null&&h.push(c[o]),o++);}if(h===null)break;let R=h;if(R.length>n)throw chunkSUAGBRQ7_cjs.c.validation("NORMALIZED_TOKEN_LIMIT_EXCEEDED",`Normalized token count (${R.length}) exceeds safety limit (${n})`,{tokenCount:R.length,maxTokens:n});c=R;}return c}};var w=class{constructor(){this.startWords=new Set;this.root=new Map;}addPhrase(e,r){let t=e.toLowerCase().trim().split(/\s+/);if(t.length===0||t[0]==="")return;this.startWords.add(t[0]);let s=t[0],n;if(this.root.has(s)?n=this.root.get(s):(n={children:new Map,terminal:null},this.root.set(s,n)),t.length===1){n.terminal={tokenType:r,phrase:e,consumed:1};return}for(let i=1;i<t.length;i++){let u=t[i];n.children.has(u)||n.children.set(u,{children:new Map,terminal:null}),n=n.children.get(u);}n.terminal={tokenType:r,phrase:e,consumed:t.length};}matchAt(e,r){if(r>=e.length)return null;let t=e[r].type;if(t==="TAG"||t.startsWith("TAG_"))return null;let s=e[r].value.toLowerCase();if(!this.startWords.has(s))return null;let n=this.root.get(s);if(!n)return null;let i=null,u=1;if(n.terminal){let l=e.slice(r,r+1);i={consumed:1,replacement:[C(n.terminal.tokenType,n.terminal.phrase,l)],ruleName:n.terminal.phrase};}for(let l=r+1;l<e.length&&n?.children;l++){let c=e[l].type;if(c==="TAG"||c.startsWith("TAG_"))break;let f=e[l].value.toLowerCase();if(n=n.children.get(f),!n)break;if(u++,n.terminal){let p=e.slice(r,r+u);i={consumed:u,replacement:[C(n.terminal.tokenType,n.terminal.phrase,p)],ruleName:n.terminal.phrase};}}return i}get size(){return this.root.size}getAllPhrases(){let e={},r=(t,s)=>{t.terminal&&(e[s.join(" ")]=t.terminal.tokenType);for(let[n,i]of t.children)r(i,[...s,n]);};for(let[t,s]of this.root)r(s,[t]);return e}canStart(e){return this.startWords.has(e.toLowerCase())}};var F=new Set(["per","a","an","each","every"]),W=new Set(["to","power","increase","decrease","times","multiply","divide","by"]);function H(a=50,e){let r=e??(t=>W.has(t.toLowerCase()));return {name:"implicit:multiply",priority:a,shape:[{types:["NUMBER","RPAREN"]},{types:["IDENT","LPAREN","PI","E"]}],match(t,s){if(s+1>=t.length)return null;let n=t[s],i=t[s+1];if(!((n.type==="NUMBER"||n.type==="RPAREN")&&(i.type==="IDENT"||i.type==="LPAREN"||i.type==="PI"||i.type==="E")))return null;let l=i.value.toLowerCase();if(r(l)||F.has(l)&&t[s+2]?.type==="UNIT")return null;let c=new chunkWU7SBKVU_cjs.a("STAR",chunkYBQOQTVL_cjs.c("STAR"),"*","*",i.offset,0,i.line,i.col);return {consumed:1,replacement:[n,c]}}}}function ne(a,e){let r=[];for(let t=0;t<e;t++){let s=a[t];if(s.type==="LBRACKET")r.push(true);else if(s.type==="LPAREN"){let n=a[t-1],i=!!n&&(n.type==="MAP"||n.type==="REDUCE"||n.type==="SUM_FN"||n.type==="PROD_FN"||n.type==="IDENT"&&(n.value.toLowerCase()==="map"||n.value.toLowerCase()==="reduce"||n.value.toLowerCase()==="sum"||n.value.toLowerCase()==="prod"));r.push(i);}else (s.type==="RBRACKET"||s.type==="RPAREN")&&r.pop();}return r.length>0&&r[r.length-1]}function re(){return [H()]}exports.a=w;exports.b=C;exports.c=U;exports.d=H;exports.e=ne;exports.f=re;//# sourceMappingURL=chunk-4DR5RBHQ.cjs.map
-//# sourceMappingURL=chunk-4DR5RBHQ.cjs.map

package/dist/chunk-4DR5RBHQ.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/normalizer/RuleIndex.ts","../src/normalizer/TokenNormalizer.ts","../src/normalizer/PhraseTrie.ts","../src/normalizer/BuiltinNormalizerRules.ts"],"names":["WORD_BITS","MAX_PLANES","effectiveShape","rule","RuleIndex","sortedRules","n","w","shapes","maxTypeId","shape","slot","t","tokenTypeId","depth","i","planes","k","plane","word","bit","types","values","raw","value","mask","id","tokens","pos","scratch","len","at","token","typeId","base","lowered","hasUpper","named","isEmptyMask","c","DEFAULT_OPTIONS","createFusedToken","type","text","sourceTokens","first","last","LexerToken","recordSourceSpan","fused","NON_WORD_NAMES","NON_WORD_TABLE","ids","table","warnedUnshapedRules","warnIfUnshaped","TokenNormalizer","options","PhraseTrie","ruleName","a","b","buffer","rules","bits","index","list","counts","phrase","tokenType","onFusion","fusionHandler","maxPasses","maxTokens","warmedUp","useIndex","ruleIndex","current","changed","passCount","result","matched","tid","trieMatch","rt","candidates","match","passResult","ErrorFactory","words","firstWord","node","startType","best","contType","collect","path","child","RATE_DENOMINATOR_WORDS","PHRASE_START_WORDS","implicitMultiplyRule","priority","canStart","phraseGuard","next","nextValue","starToken","isInsideRangeContext","safeStack","prev","opensMapReduceCall","createBuiltinNormalizerRules"],"mappings":"uKAiEA,IAAMA,CAAAA,CAAY,EAAA,CAeZC,CAAAA,CAAa,CAAA,CASZ,SAASC,CAAAA,CAAeC,CAAAA,CAA2C,CACzE,OAAIA,CAAAA,CAAK,KAAA,GAAU,MAAA,CAAkBA,EAAK,KAAA,CACtCA,CAAAA,CAAK,eAAA,GAAoB,MAAA,CAAkB,CAAC,CAAE,KAAA,CAAOA,CAAAA,CAAK,eAAgB,CAAC,CAAA,CACxE,EACR,CA8BO,IAAMC,CAAAA,CAAN,KAAgB,CA2BtB,WAAA,CAAYC,CAAAA,CAAwC,CACnD,IAAA,CAAK,KAAA,CAAQA,CAAAA,CACb,IAAMC,CAAAA,CAAID,CAAAA,CAAY,MAAA,CAChBE,CAAAA,CAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAG,IAAA,CAAK,KAAKD,CAAAA,CAAIN,CAAS,CAAC,CAAA,CAC9C,IAAA,CAAK,KAAA,CAAQO,CAAAA,CACb,IAAA,CAAK,QAAU,IAAI,WAAA,CAAYA,CAAC,CAAA,CAEhC,IAAMC,CAAAA,CAASH,CAAAA,CAAY,GAAA,CAAIH,CAAc,CAAA,CAOzCO,CAAAA,CAAY,CAAA,CAChB,IAAA,IAAWC,CAAAA,IAASF,CAAAA,CACnB,IAAA,IAAWG,CAAAA,IAAQD,CAAAA,CAClB,IAAA,IAAWE,CAAAA,IAAKD,CAAAA,CAAK,KAAA,EAAS,EAAC,CAAGF,CAAAA,CAAY,KAAK,GAAA,CAAIA,CAAAA,CAAWI,mBAAAA,CAAYD,CAAC,CAAC,CAAA,CAGlF,IAAA,CAAK,QAAA,CAAWH,CAAAA,CAAY,CAAA,CAE5B,IAAIK,CAAAA,CAAQ,CAAA,CACZ,IAAA,IAAWJ,CAAAA,IAASF,CAAAA,CAAQM,EAAQ,IAAA,CAAK,GAAA,CAAIA,CAAAA,CAAOJ,CAAAA,CAAM,MAAM,CAAA,CAChEI,CAAAA,CAAQ,IAAA,CAAK,GAAA,CAAIA,CAAAA,CAAOb,CAAU,CAAA,CAElC,IAAA,CAAK,QAAA,CAAW,IAAI,WAAA,CAAYM,CAAC,CAAA,CACjC,IAAA,IAASQ,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIT,CAAAA,CAAGS,CAAAA,EAAAA,CACtB,IAAA,CAAK,SAAUA,CAAAA,CAAIf,CAAAA,CAAa,CAAC,CAAA,EAAK,CAAA,EAAMe,CAAAA,CAAIf,CAAAA,CAGjD,IAAMgB,EAAkB,EAAC,CACzB,IAAA,IAASC,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIH,CAAAA,CAAOG,CAAAA,EAAAA,CAC1BD,CAAAA,CAAO,IAAA,CAAK,IAAA,CAAK,UAAA,CAAWR,CAAAA,CAAQS,CAAAA,CAAGV,CAAC,CAAC,EAE1C,IAAA,CAAK,MAAA,CAASS,EACf,CAGQ,UAAA,CAAWR,CAAAA,CAA0CS,CAAAA,CAAWV,CAAAA,CAAkB,CACzF,IAAMW,CAAAA,CAAe,CACpB,MAAA,CAAQ,IAAI,WAAA,CAAY,IAAA,CAAK,SAAWX,CAAC,CAAA,CACzC,OAAA,CAAS,IAAI,WAAA,CAAYA,CAAC,CAAA,CAC1B,KAAA,CAAO,IAAI,WAAA,CAAYA,CAAC,CAAA,CACxB,aAAA,CAAe,IAAI,UAAA,CAAW,IAAA,CAAK,QAAQ,CAAA,CAC3C,OAAA,CAAS,IAAI,GAAA,CACb,QAAA,CAAU,IAAI,WAAA,CAAYA,CAAC,CAC5B,CAAA,CAEA,IAAA,IAASQ,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIP,CAAAA,CAAO,MAAA,CAAQO,CAAAA,EAAAA,CAAK,CACvC,IAAMJ,CAAAA,CAA6BH,CAAAA,CAAOO,CAAC,CAAA,CAAEE,CAAC,CAAA,CACxCE,CAAAA,CAAQJ,CAAAA,CAAIf,CAAAA,CAAa,CAAA,CACzBoB,CAAAA,CAAM,CAAA,EAAML,CAAAA,CAAIf,CAAAA,CAGhBqB,CAAAA,CAAQV,GAAM,KAAA,CACpB,GAAIU,CAAAA,GAAU,MAAA,CAWbH,CAAAA,CAAM,OAAA,CAAQC,CAAI,CAAA,EAAKC,EACvBF,CAAAA,CAAM,KAAA,CAAMC,CAAI,CAAA,EAAKC,CAAAA,CAAAA,KAErB,IAAA,IAAWR,CAAAA,IAAKS,CAAAA,CAAOH,EAAM,MAAA,CAAOL,mBAAAA,CAAYD,CAAC,CAAA,CAAIL,CAAAA,CAAIY,CAAI,CAAA,EAAKC,CAAAA,CAInE,IAAME,CAAAA,CAASX,CAAAA,EAAM,MAAA,CACrB,GAAIW,CAAAA,GAAW,MAAA,CACdJ,CAAAA,CAAM,SAASC,CAAI,CAAA,EAAKC,CAAAA,CAAAA,KAClB,CACN,IAAA,IAAWG,CAAAA,IAAOD,CAAAA,CAAQ,CACzB,IAAME,CAAAA,CAAQD,CAAAA,CAAI,WAAA,EAAY,CAC1BE,CAAAA,CAAOP,CAAAA,CAAM,OAAA,CAAQ,GAAA,CAAIM,CAAK,CAAA,CAC9BC,CAAAA,GAAS,MAAA,GACZA,CAAAA,CAAO,IAAI,WAAA,CAAYlB,CAAC,CAAA,CACxBW,CAAAA,CAAM,OAAA,CAAQ,GAAA,CAAIM,CAAAA,CAAOC,CAAI,CAAA,CAAA,CAE9BA,CAAAA,CAAKN,CAAI,GAAKC,EACf,CAGA,GAAIC,CAAAA,GAAU,MAAA,CACbH,CAAAA,CAAM,aAAA,CAAc,IAAA,CAAK,CAAC,CAAA,CAAA,KAE1B,IAAA,IAAWN,CAAAA,IAAKS,CAAAA,CAAO,CACtB,IAAMK,CAAAA,CAAKb,oBAAYD,CAAC,CAAA,CACpBc,CAAAA,CAAK,IAAA,CAAK,QAAA,GAAUR,CAAAA,CAAM,aAAA,CAAcQ,CAAE,CAAA,CAAI,CAAA,EACnD,CAEF,CACD,CAEA,OAAOR,CACR,CAGA,IAAI,IAAA,EAAe,CAAE,OAAO,IAAA,CAAK,KAAA,CAAM,MAAQ,CAG/C,IAAI,OAAgB,CAAE,OAAO,IAAA,CAAK,MAAA,CAAO,MAAQ,CAWjD,UAAA,CAAWS,CAAAA,CAAsDC,EAA0B,CAC1F,IAAMrB,CAAAA,CAAI,IAAA,CAAK,KAAA,CACTsB,CAAAA,CAAU,IAAA,CAAK,OAAA,CACfb,CAAAA,CAAS,IAAA,CAAK,MAAA,CACdc,CAAAA,CAAMH,CAAAA,CAAO,MAAA,CAEnB,GAAIX,CAAAA,CAAO,SAAW,CAAA,CACrB,OAAAa,CAAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,QAAQ,CAAA,CAClBA,CAAAA,CAGR,QAASZ,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAID,CAAAA,CAAO,MAAA,CAAQC,CAAAA,EAAAA,CAAK,CACvC,IAAMC,EAAQF,CAAAA,CAAOC,CAAC,CAAA,CAChBc,CAAAA,CAAKH,CAAAA,CAAMX,CAAAA,CAEjB,GAAIc,CAAAA,EAAMD,CAAAA,CAAK,CAGd,GAAIb,CAAAA,GAAM,CAAA,CAAKY,CAAAA,CAAQ,GAAA,CAAIX,CAAAA,CAAM,KAAK,CAAA,CAAA,KAC/B,IAAA,IAASH,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIR,CAAAA,CAAGQ,CAAAA,EAAAA,CAAKc,CAAAA,CAAQd,CAAC,CAAA,EAAKG,CAAAA,CAAM,KAAA,CAAMH,CAAC,CAAA,CAC9D,QACD,CAEA,IAAMiB,EAAQL,CAAAA,CAAOI,CAAE,CAAA,CACjBE,CAAAA,CAASD,CAAAA,CAAM,MAAA,CACfE,CAAAA,CAAOD,CAAAA,EAAU,CAAA,EAAKA,CAAAA,CAAS,IAAA,CAAK,QAAA,CAAWA,CAAAA,CAAS1B,CAAAA,CAAI,EAAA,CAIlE,GAAIU,IAAM,CAAA,CACT,GAAIiB,CAAAA,EAAQ,CAAA,CAAK,IAAA,IAASnB,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIR,CAAAA,CAAGQ,CAAAA,EAAAA,CAAKc,CAAAA,CAAQd,CAAC,CAAA,CAAIG,CAAAA,CAAM,MAAA,CAAOgB,CAAAA,CAAOnB,CAAC,CAAA,CAAIG,CAAAA,CAAM,OAAA,CAAQH,CAAC,CAAA,CAAA,KAC3Fc,CAAAA,CAAQ,GAAA,CAAIX,CAAAA,CAAM,OAAO,CAAA,CAAA,KAAA,GAE5BgB,CAAAA,EAAQ,CAAA,CAAK,IAAA,IAASnB,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIR,EAAGQ,CAAAA,EAAAA,CAAKc,CAAAA,CAAQd,CAAC,CAAA,EAAKG,CAAAA,CAAM,MAAA,CAAOgB,CAAAA,CAAOnB,CAAC,EAAIG,CAAAA,CAAM,OAAA,CAAQH,CAAC,CAAA,CAAA,KAC5F,IAAA,IAASA,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIR,EAAGQ,CAAAA,EAAAA,CAAKc,CAAAA,CAAQd,CAAC,CAAA,EAAKG,CAAAA,CAAM,OAAA,CAAQH,CAAC,CAAA,CAKjE,GAAImB,CAAAA,EAAQ,CAAA,EAAKhB,CAAAA,CAAM,aAAA,CAAce,CAAM,CAAA,GAAM,CAAA,CAAG,CACnD,IAAMT,CAAAA,CAAQQ,CAAAA,CAAM,KAAA,CACdG,CAAAA,CAAUC,CAAAA,CAASZ,CAAK,CAAA,CAAIA,EAAM,WAAA,EAAY,CAAIA,CAAAA,CAClDa,CAAAA,CAAQnB,CAAAA,CAAM,OAAA,CAAQ,GAAA,CAAIiB,CAAO,EACvC,IAAA,IAASpB,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIR,CAAAA,CAAGQ,CAAAA,EAAAA,CACtBc,CAAAA,CAAQd,CAAC,CAAA,EAAA,CAAMsB,CAAAA,GAAU,MAAA,CAAY,CAAA,CAAIA,CAAAA,CAAMtB,CAAC,CAAA,EAAKG,CAAAA,CAAM,SAASH,CAAC,EAEvE,CAEA,GAAIuB,CAAAA,CAAYT,CAAO,CAAA,CAAG,OAAOA,CAClC,CAEA,OAAOA,CACR,CACD,CAAA,CAGO,SAASS,CAAAA,CAAYb,CAAAA,CAA4B,CACvD,IAAA,IAASV,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIU,CAAAA,CAAK,MAAA,CAAQV,CAAAA,EAAAA,CAAK,GAAIU,CAAAA,CAAKV,CAAC,CAAA,GAAM,CAAA,CAAG,OAAO,MAAA,CAChE,OAAO,KACR,CASA,SAASqB,CAAAA,CAASZ,CAAAA,CAAwB,CACzC,IAAA,IAAST,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIS,CAAAA,CAAM,MAAA,CAAQT,CAAAA,EAAAA,CAAK,CACtC,IAAMwB,CAAAA,CAAIf,CAAAA,CAAM,UAAA,CAAWT,CAAC,CAAA,CAC5B,GAAIwB,CAAAA,EAAK,EAAA,EAAMA,CAAAA,EAAK,EAAA,CAAI,OAAO,KAChC,CACA,OAAO,MACR,CC1PA,IAAMC,CAAAA,CAA+C,CACnD,SAAA,CAAW,IACX,SAAA,CAAW,GAAA,CACX,QAAA,CAAU,IAAM,CAAC,CAAA,CACjB,eAAA,CAAiB,KACnB,EAwBO,SAASC,CAAAA,CACdC,CAAAA,CACAC,CAAAA,CACAC,CAAAA,CACO,CACP,IAAMC,CAAAA,CAAQD,EAAa,CAAC,CAAA,CACtBE,CAAAA,CAAOF,CAAAA,CAAaA,CAAAA,CAAa,MAAA,CAAS,CAAC,CAAA,CAC3CZ,CAAAA,CAAQ,IAAIe,mBAAAA,CAChBL,CAAAA,CACA7B,mBAAAA,CAAY6B,CAAI,CAAA,CAChBC,CAAAA,CACAA,EACAE,CAAAA,CAAM,MAAA,CACNA,CAAAA,CAAM,UAAA,EAAc,CAAA,CACpBA,CAAAA,CAAM,IAAA,CACNA,CAAAA,CAAM,GACR,CAAA,CAGA,OAAAb,CAAAA,CAAM,SAAA,CAAYc,CAAAA,CAAK,SAAA,EAAaA,CAAAA,CAAK,OAASA,CAAAA,CAAK,IAAA,CAAK,MAAA,CACrDd,CACT,CAkBA,SAASgB,CAAAA,CAAiBC,CAAAA,CAAcL,CAAAA,CAA6B,CACnE,IAAME,CAAAA,CAAOF,CAAAA,CAAaA,CAAAA,CAAa,MAAA,CAAS,CAAC,EAC5CE,CAAAA,GACLG,CAAAA,CAAM,SAAA,CAAYH,CAAAA,CAAK,SAAA,EAAaA,CAAAA,CAAK,MAAA,CAASA,CAAAA,CAAK,KAAK,MAAA,EAC9D,CAiCO,IAAMI,CAAAA,CAAiB,CAC7B,QAAA,CAAU,KAAA,CAAO,QAAA,CAAU,QAC3B,QAAA,CAAU,QAAA,CAAU,SAAA,CAAW,QAAA,CAAU,SAAA,CACzC,QAAA,CAAU,QAAA,CAAU,UAAA,CAAY,UAAA,CAChC,OAAA,CAAS,OAAA,CAAS,QAAA,CAAU,WAAA,CAAa,MAAA,CAAQ,WAAA,CAAa,IAAA,CAC9D,YAAa,UAAA,CAAY,aAAA,CACzB,KAAA,CAAO,IAAA,CAAM,SACd,CAAA,CAQaC,CAAAA,CAAAA,CAA8B,IAAM,CAEhD,IAAMC,CAAAA,CAAMF,CAAAA,CAAe,GAAA,CAAI5C,CAAAA,EAAKO,mBAAAA,CAAYP,CAAC,CAAC,CAAA,CAE5CwB,CAAAA,CAAM,IAAA,CAAK,GAAA,CAAI,GAAGsB,CAAG,CAAA,CAAI,CAAA,CACzBC,CAAAA,CAAQ,IAAI,UAAA,CAAWvB,CAAG,CAAA,CAEhC,IAAA,IAAWJ,CAAAA,IAAM0B,CAAAA,CAAKC,EAAM3B,CAAE,CAAA,CAAI,CAAA,CAClC,OAAO2B,CACR,CAAA,GAAG,CASGC,CAAAA,CAAsB,IAAI,GAAA,CAgBhC,SAASC,CAAAA,CAAepD,CAAAA,CAA4B,CAC9CA,CAAAA,CAAK,KAAA,GAAU,MAAA,EAAaA,EAAK,KAAA,CAAM,MAAA,CAAS,CAAA,EAChDA,CAAAA,CAAK,eAAA,GAAoB,MAAA,EACzBA,CAAAA,CAAK,cAAA,GAAmB,MAAA,GACxBmD,CAAAA,CAAoB,GAAA,CAAInD,CAAAA,CAAK,IAAI,CAAA,GACrCmD,CAAAA,CAAoB,GAAA,CAAInD,EAAK,IAAI,CAAA,CACjC,OAAA,CAAQ,IAAA,CACN,CAAA,wBAAA,EAA2BA,CAAAA,CAAK,IAAI,CAAA,+UAAA,CAKtC,IACF,CA0BO,IAAMqD,CAAAA,CAAN,KAAsB,CAsE3B,WAAA,CAAYC,CAAAA,CAA6B,GAAI,CApE7C,IAAA,CAAQ,KAAA,CAA0B,EAAC,CAanC,IAAA,CAAQ,gBAAA,CAA4C,IAAA,CAUpD,IAAA,CAAQ,gBAAA,CAAmB,IAAI,GAAA,CAU/B,IAAA,CAAQ,cAAA,CAAmC,IAAA,CAG3C,IAAA,CAAQ,gBAAoC,EAAC,CAe7C,IAAA,CAAQ,cAAA,CAAiB,CAAA,CAOzB,IAAA,CAAQ,UAAA,CAAa,IAAIC,EAuLzB,IAAA,CAAQ,eAAA,CAMI,IAAA,CAlLV,IAAA,CAAK,OAAA,CAAU,CAAE,GAAGlB,CAAAA,CAAiB,GAAGiB,CAAQ,EAClD,CAaA,QAAA,CAAStD,CAAAA,CAA4B,CACnCoD,CAAAA,CAAepD,CAAI,CAAA,CACnB,IAAA,CAAK,KAAA,CAAM,IAAA,CAAKA,CAAI,CAAA,CACpB,IAAA,CAAK,gBAAA,CAAmB,KACxB,IAAA,CAAK,gBAAA,CAAiB,KAAA,EAAM,CAC5B,IAAA,CAAK,cAAA,CAAiB,IAAA,CACtB,IAAA,CAAK,eAAA,CAAkB,KACzB,CAUA,UAAA,CAAWwD,CAAAA,CAAwB,CACjC,IAAA,CAAK,KAAA,CAAQ,KAAK,KAAA,CAAM,MAAA,CAAO,CAAA,EAAK,CAAA,CAAE,IAAA,GAASA,CAAQ,CAAA,CACvD,IAAA,CAAK,gBAAA,CAAmB,IAAA,CACxB,IAAA,CAAK,gBAAA,CAAiB,KAAA,EAAM,CAC5B,IAAA,CAAK,cAAA,CAAiB,KACtB,IAAA,CAAK,eAAA,CAAkB,KACzB,CAMA,KAAA,EAAc,CACZ,IAAA,CAAK,KAAA,CAAQ,EAAC,CACd,IAAA,CAAK,gBAAA,CAAmB,IAAA,CACxB,IAAA,CAAK,gBAAA,CAAiB,KAAA,EAAM,CAC5B,KAAK,cAAA,CAAiB,IAAA,CACtB,IAAA,CAAK,eAAA,CAAkB,IAAA,CACvB,IAAA,CAAK,UAAA,CAAa,IAAID,EACxB,CAOQ,cAAA,EAAmC,CACzC,OAAI,IAAA,CAAK,gBAAA,GAAqB,IAAA,GAC5B,KAAK,gBAAA,CAAmB,CAAC,GAAG,IAAA,CAAK,KAAK,CAAA,CAAE,IAAA,CAAK,CAACE,EAAGC,CAAAA,GAAMA,CAAAA,CAAE,QAAA,CAAWD,CAAAA,CAAE,QAAQ,CAAA,CAAA,CAEzE,IAAA,CAAK,gBACd,CAMQ,YAAA,EAA0B,CAChC,OAAI,IAAA,CAAK,cAAA,GAAmB,IAAA,GAC1B,IAAA,CAAK,cAAA,CAAiB,IAAIxD,CAAAA,CAAU,IAAA,CAAK,cAAA,EAAgB,CAAA,CAAA,CAEpD,IAAA,CAAK,cACd,CA+BQ,OAAA,CAAQqB,CAAAA,CAA0BiB,CAAAA,CAAyC,CACjF,GAAIjB,CAAAA,GAAS,IAAA,CACX,OAAO,KAAK,OAAA,CAAQ,eAAA,CAAkB,IAAA,CAAK,cAAA,EAAe,CAAI,IAAA,CAAK,iBAAA,CAAkBiB,CAAI,EAG3F,IAAMoB,CAAAA,CAAS,IAAA,CAAK,eAAA,CACpBA,CAAAA,CAAO,MAAA,CAAS,CAAA,CAChB,IAAMC,CAAAA,CAAQ,IAAA,CAAK,YAAA,EAAa,CAAE,KAAA,CAClC,IAAA,IAASxD,CAAAA,CAAI,CAAA,CAAGA,EAAIkB,CAAAA,CAAK,MAAA,CAAQlB,CAAAA,EAAAA,CAAK,CACpC,IAAIyD,CAAAA,CAAOvC,CAAAA,CAAKlB,CAAC,CAAA,GAAM,CAAA,CACnB0D,CAAAA,CAAQ1D,CAAAA,CAAI,EAAA,CAChB,KAAOyD,CAAAA,GAAS,CAAA,EAAA,CACTA,EAAO,CAAA,IAAO,CAAA,EAAGF,CAAAA,CAAO,IAAA,CAAKC,CAAAA,CAAME,CAAK,CAAC,CAAA,CAC9CD,CAAAA,IAAU,CAAA,CACVC,CAAAA,GAEJ,CACA,OAAOH,CACT,CAkBQ,iBAAA,CAAkBpB,EAAgC,CACxD,IAAIwB,CAAAA,CAAO,IAAA,CAAK,gBAAA,CAAiB,GAAA,CAAIxB,CAAI,CAAA,CACzC,OAAIwB,CAAAA,GAAS,MAAA,GACXA,CAAAA,CAAO,IAAA,CAAK,cAAA,EAAe,CAAE,MAAA,CAAQ/D,CAAAA,EAAS,CAC5C,IAAM0C,CAAAA,CAAQ3C,CAAAA,CAAeC,CAAI,CAAA,CAAE,CAAC,CAAA,CACpC,OAAO0C,CAAAA,EAAO,KAAA,GAAU,MAAA,EAAaA,CAAAA,CAAM,KAAA,CAAM,QAAA,CAASH,CAAI,CAChE,CAAC,CAAA,CACD,IAAA,CAAK,gBAAA,CAAiB,GAAA,CAAIA,CAAAA,CAAMwB,CAAI,CAAA,CAAA,CAE/BA,CACT,CAKA,IAAI,SAAA,EAAoB,CACtB,OAAO,IAAA,CAAK,KAAA,CAAM,MACpB,CAuBA,eAMG,CAID,GAAI,IAAA,CAAK,eAAA,GAAoB,IAAA,CAAM,OAAO,IAAA,CAAK,eAAA,CAC/C,IAAMD,CAAAA,CAAQ,IAAA,CAAK,YAAA,EAAa,CAChC,OAAA,IAAA,CAAK,eAAA,CAAkB,IAAA,CAAK,gBAAe,CAAE,GAAA,CAAK9D,CAAAA,EAAS,CACzD,IAAMO,CAAAA,CAAQR,CAAAA,CAAeC,CAAI,EACjC,OAAO,CACL,IAAA,CAAMA,CAAAA,CAAK,IAAA,CACX,QAAA,CAAUA,CAAAA,CAAK,QAAA,CACf,MAAAO,CAAAA,CACA,cAAA,CAAgBP,CAAAA,CAAK,cAAA,CACrB,YAAA,CAAc,IAAA,CAAK,GAAA,CAAIO,CAAAA,CAAM,MAAA,CAAQuD,CAAAA,CAAM,KAAK,CAClD,CACF,CAAC,CAAA,CACM,IAAA,CAAK,eACd,CAQA,kBAAA,CAAmBtC,CAAAA,CAA2B,CAC5C,IAAMsC,CAAAA,CAAQ,IAAA,CAAK,YAAA,EAAa,CAC1BE,CAAAA,CAAmB,EAAC,CAC1B,IAAA,IAASvC,CAAAA,CAAM,CAAA,CAAGA,CAAAA,CAAMD,EAAO,MAAA,CAAQC,CAAAA,EAAAA,CAAO,CAC5C,IAAMH,CAAAA,CAAOwC,CAAAA,CAAM,UAAA,CAAWtC,CAAAA,CAAQC,CAAG,CAAA,CACrCtB,CAAAA,CAAI,CAAA,CACR,IAAA,IAASC,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIkB,EAAK,MAAA,CAAQlB,CAAAA,EAAAA,CAAK,CACpC,IAAIyD,CAAAA,CAAOvC,CAAAA,CAAKlB,CAAC,CAAA,GAAM,EACvB,KAAOyD,CAAAA,GAAS,CAAA,EAAK1D,CAAAA,EAAK0D,CAAAA,CAAO,CAAA,CAAGA,CAAAA,IAAU,EAChD,CACAG,CAAAA,CAAO,IAAA,CAAK7D,CAAC,EACf,CACA,OAAO6D,CACT,CAcA,SAAA,CAAUC,CAAAA,CAAgBC,CAAAA,CAAyB,CACjD,IAAA,CAAK,UAAA,CAAW,SAAA,CAAUD,CAAAA,CAAQC,CAAS,EAC7C,CAgBA,UAAA,EAAqC,CACnC,OAAO,IAAA,CAAK,UAAA,CAAW,aAAA,EACzB,CAEA,cAAA,CAAelD,CAAAA,CAAuB,CACpC,OAAO,IAAA,CAAK,UAAA,CAAW,SAASA,CAAI,CACtC,CA8BA,SAAA,CAAUQ,CAAAA,CAAiB2C,CAAAA,CAAmD,CAE5E,GAAI3C,CAAAA,CAAO,MAAA,GAAW,CAAA,CAAG,OAAOA,CAAAA,CAKhC,IAAM4C,CAAAA,CAAgBD,CAAAA,EAAY,KAAK,OAAA,CAAQ,QAAA,CACzCE,CAAAA,CAAY,IAAA,CAAK,OAAA,CAAQ,SAAA,CACzBC,CAAAA,CAAY,IAAA,CAAK,QAAQ,SAAA,CAIzBC,CAAAA,CAAW,IAAA,CAAK,cAAA,CAAiB,CAAA,CAClCA,CAAAA,GAAU,IAAA,CAAK,cAAA,CAAiB,GACrC,IAAMC,CAAAA,CAAWD,CAAAA,EAAY,CAAC,IAAA,CAAK,OAAA,CAAQ,eAAA,CACrCE,CAAAA,CAAYD,CAAAA,CAAW,IAAA,CAAK,YAAA,EAAa,CAAI,IAAA,CAE/CE,CAAAA,CAAUlD,CAAAA,CACVmD,CAAAA,CAAU,KACVC,CAAAA,CAAY,CAAA,CAGhB,KAAOD,CAAAA,EAAWC,CAAAA,CAAYP,CAAAA,EAAW,CACvCM,CAAAA,CAAU,KAAA,CACVC,CAAAA,EAAAA,CAQA,IAAIC,CAAAA,CAAyB,IAAA,CACzBpD,CAAAA,CAAM,CAAA,CAGV,KAAOA,EAAMiD,CAAAA,CAAQ,MAAA,EAAQ,CAC3B,IAAII,CAAAA,CAAU,KAAA,CAKRC,CAAAA,CAAML,CAAAA,CAAQjD,CAAG,CAAA,CAAE,MAAA,CACzB,GAAIsD,CAAAA,EAAO/B,CAAAA,CAAe,MAAA,EAAUA,CAAAA,CAAe+B,CAAG,CAAA,GAAM,CAAA,CAAG,CAC7D,IAAMC,CAAAA,CAAY,IAAA,CAAK,UAAA,CAAW,OAAA,CAAQN,EAASjD,CAAG,CAAA,CACtD,GAAIuD,CAAAA,CAAW,CACb,IAAMvC,CAAAA,CAAeiC,CAAAA,CAAQ,MAAMjD,CAAAA,CAAKA,CAAAA,CAAMuD,CAAAA,CAAU,QAAQ,CAAA,CAC5DH,CAAAA,GAAW,IAAA,GAAMA,CAAAA,CAASH,CAAAA,CAAQ,KAAA,CAAM,CAAA,CAAGjD,CAAG,CAAA,CAAA,CAClD,IAAA,IAAWwD,CAAAA,IAAMD,CAAAA,CAAU,YACzBH,CAAAA,CAAO,IAAA,CAAKI,CAAE,CAAA,CAEZD,CAAAA,CAAU,QAAA,CAAW,CAAA,EAAKA,CAAAA,CAAU,YAAY,MAAA,GAAW,CAAA,GAC7DnC,CAAAA,CAAiBmC,CAAAA,CAAU,WAAA,CAAY,CAAC,CAAA,CAAGvC,CAAY,EACvD2B,CAAAA,CAAc,CACZ,IAAA,CAAMY,CAAAA,CAAU,QAAA,EAAY,aAAA,CAC5B,YAAA,CAAAvC,CAAAA,CACA,UAAA,CAAYuC,CAAAA,CAAU,WAAA,CAAY,CAAC,CACrC,CAAC,CAAA,CAAA,CAEHvD,CAAAA,EAAOuD,EAAU,QAAA,CACjBL,CAAAA,CAAU,IAAA,CACV,QACF,CACF,CAOA,IAAMO,CAAAA,CAAaV,EACfC,CAAAA,CAAW,UAAA,CAAWC,CAAAA,CAASjD,CAAG,CAAA,CAClC,IAAA,CACJ,GAAIyD,CAAAA,GAAe,MAAQ/C,CAAAA,CAAY+C,CAAU,CAAA,CAAG,CAI9CL,CAAAA,GAAW,IAAA,EAAMA,CAAAA,CAAO,IAAA,CAAKH,CAAAA,CAAQjD,CAAG,CAAC,CAAA,CAC7CA,CAAAA,EAAAA,CACA,QACF,CACA,IAAA,IAAWzB,KAAQ,IAAA,CAAK,OAAA,CAAQkF,CAAAA,CAAYR,CAAAA,CAAQjD,CAAG,CAAA,CAAE,IAAI,CAAA,CAAG,CAC9D,IAAM0D,CAAAA,CAAQnF,CAAAA,CAAK,KAAA,CAAM0E,CAAAA,CAASjD,CAAG,CAAA,CACrC,GAAI0D,CAAAA,CAAO,CAET,IAAM1C,CAAAA,CAAeiC,CAAAA,CAAQ,KAAA,CAAMjD,CAAAA,CAAKA,CAAAA,CAAM0D,CAAAA,CAAM,QAAQ,CAAA,CAGxDN,CAAAA,GAAW,IAAA,GAAMA,CAAAA,CAASH,CAAAA,CAAQ,KAAA,CAAM,EAAGjD,CAAG,CAAA,CAAA,CAClD,IAAA,IAAWwD,CAAAA,IAAME,CAAAA,CAAM,WAAA,CACrBN,CAAAA,CAAO,IAAA,CAAKI,CAAE,CAAA,CAMhB,GAAIE,CAAAA,CAAM,QAAA,CAAW,CAAA,EAAKA,CAAAA,CAAM,WAAA,CAAY,MAAA,GAAW,EACrDtC,CAAAA,CAAiBsC,CAAAA,CAAM,WAAA,CAAY,CAAC,CAAA,CAAG1C,CAAY,CAAA,CACnD2B,CAAAA,CAAc,CACZ,IAAA,CAAMpE,CAAAA,CAAK,IAAA,CACX,YAAA,CAAAyC,CAAAA,CACA,UAAA,CAAY0C,CAAAA,CAAM,YAAY,CAAC,CACjC,CAAC,CAAA,CAAA,KAAA,GACQA,CAAAA,CAAM,QAAA,CAAW,CAAA,EAAKA,CAAAA,CAAM,YAAY,MAAA,CAASA,CAAAA,CAAM,QAAA,CAChE,IAAA,IAAWF,CAAAA,IAAME,CAAAA,CAAM,WAAA,CACrBf,CAAAA,CAAc,CACZ,IAAA,CAAMpE,CAAAA,CAAK,IAAA,CACX,YAAA,CAAAyC,CAAAA,CACA,UAAA,CAAYwC,CACd,CAAC,CAAA,CAKLxD,CAAAA,EAAO0D,CAAAA,CAAM,QAAA,CACbR,CAAAA,CAAU,IAAA,CACVG,CAAAA,CAAU,IAAA,CACV,KACF,CACF,CAEKA,CAAAA,GAGCD,CAAAA,GAAW,IAAA,EAAMA,CAAAA,CAAO,IAAA,CAAKH,CAAAA,CAAQjD,CAAG,CAAC,CAAA,CAC7CA,CAAAA,EAAAA,EAEJ,CAIA,GAAIoD,CAAAA,GAAW,IAAA,CAAM,MACrB,IAAMO,CAAAA,CAAsBP,CAAAA,CAG5B,GAAIO,CAAAA,CAAW,MAAA,CAASd,CAAAA,CAKtB,MAAMe,mBAAAA,CAAa,UAAA,CACjB,iCAAA,CACA,CAAA,wBAAA,EAA2BD,CAAAA,CAAW,MAAM,CAAA,wBAAA,EAA2Bd,CAAS,CAAA,CAAA,CAAA,CAChF,CAAE,UAAA,CAAYc,CAAAA,CAAW,MAAA,CAAQ,SAAA,CAAAd,CAAU,CAC7C,CAAA,CAGFI,CAAAA,CAAUU,EACZ,CAEA,OAAOV,CACT,CACF,ECtsBO,IAAMnB,CAAAA,CAAN,KAAiB,CAAjB,WAAA,EAAA,CAMN,IAAA,CAAQ,UAAA,CAAa,IAAI,GAAA,CAMzB,IAAA,CAAQ,IAAA,CAAO,IAAI,IAAA,CAUnB,SAAA,CAAUU,CAAAA,CAAgBC,CAAAA,CAAyB,CAClD,IAAMoB,CAAAA,CAAQrB,EAAO,WAAA,EAAY,CAAE,IAAA,EAAK,CAAE,KAAA,CAAM,KAAK,CAAA,CACrD,GAAIqB,EAAM,MAAA,GAAW,CAAA,EAAKA,CAAAA,CAAM,CAAC,CAAA,GAAM,EAAA,CAAI,OAE3C,IAAA,CAAK,WAAW,GAAA,CAAIA,CAAAA,CAAM,CAAC,CAAC,CAAA,CAE5B,IAAMC,CAAAA,CAAYD,CAAAA,CAAM,CAAC,CAAA,CACrBE,CAAAA,CAUJ,GARI,IAAA,CAAK,IAAA,CAAK,GAAA,CAAID,CAAS,EAC1BC,CAAAA,CAAO,IAAA,CAAK,IAAA,CAAK,GAAA,CAAID,CAAS,CAAA,EAE9BC,CAAAA,CAAO,CAAE,SAAU,IAAI,GAAA,CAAO,QAAA,CAAU,IAAK,CAAA,CAC7C,IAAA,CAAK,IAAA,CAAK,GAAA,CAAID,EAAWC,CAAI,CAAA,CAAA,CAI1BF,CAAAA,CAAM,MAAA,GAAW,CAAA,CAAG,CACvBE,CAAAA,CAAK,QAAA,CAAW,CAAE,SAAA,CAAAtB,CAAAA,CAAW,MAAA,CAAAD,CAAAA,CAAQ,QAAA,CAAU,CAAE,CAAA,CACjD,MACD,CAGA,IAAA,IAAS,CAAA,CAAI,CAAA,CAAG,CAAA,CAAIqB,CAAAA,CAAM,MAAA,CAAQ,CAAA,EAAA,CAAK,CACtC,IAAMtE,CAAAA,CAAOsE,CAAAA,CAAM,CAAC,CAAA,CACfE,CAAAA,CAAK,QAAA,CAAS,GAAA,CAAIxE,CAAI,CAAA,EAC1BwE,CAAAA,CAAK,QAAA,CAAS,GAAA,CAAIxE,CAAAA,CAAM,CAAE,QAAA,CAAU,IAAI,GAAA,CAAO,QAAA,CAAU,IAAK,CAAC,CAAA,CAEhEwE,CAAAA,CAAOA,CAAAA,CAAK,QAAA,CAAS,IAAIxE,CAAI,EAC9B,CAEAwE,CAAAA,CAAK,QAAA,CAAW,CAAE,SAAA,CAAAtB,CAAAA,CAAW,MAAA,CAAAD,CAAAA,CAAQ,QAAA,CAAUqB,CAAAA,CAAM,MAAO,EAC7D,CAeA,OAAA,CAAQ9D,EAAiBC,CAAAA,CAAqC,CAE7D,GAAIA,CAAAA,EAAOD,CAAAA,CAAO,MAAA,CAAQ,OAAO,IAAA,CAejC,IAAMiE,CAAAA,CAAYjE,CAAAA,CAAOC,CAAG,CAAA,CAAE,IAAA,CAC9B,GAAIgE,CAAAA,GAAc,OAASA,CAAAA,CAAU,UAAA,CAAW,MAAM,CAAA,CAAG,OAAO,IAAA,CAGhE,IAAMF,CAAAA,CAAY/D,EAAOC,CAAG,CAAA,CAAE,KAAA,CAAM,WAAA,EAAY,CAChD,GAAI,CAAC,IAAA,CAAK,WAAW,GAAA,CAAI8D,CAAS,CAAA,CAAG,OAAO,IAAA,CAG5C,IAAIC,CAAAA,CAA6B,IAAA,CAAK,IAAA,CAAK,GAAA,CAAID,CAAS,CAAA,CACxD,GAAI,CAACC,CAAAA,CAAM,OAAO,KAElB,IAAIE,CAAAA,CAA+B,IAAA,CAC/B/E,CAAAA,CAAQ,CAAA,CAGZ,GAAI6E,CAAAA,CAAK,QAAA,CAAU,CAClB,IAAM/C,CAAAA,CAAejB,CAAAA,CAAO,KAAA,CAAMC,CAAAA,CAAKA,CAAAA,CAAM,CAAC,EAC9CiE,CAAAA,CAAO,CACN,QAAA,CAAU,CAAA,CACV,WAAA,CAAa,CAACpD,CAAAA,CAAiBkD,CAAAA,CAAK,QAAA,CAAS,SAAA,CAAWA,CAAAA,CAAK,QAAA,CAAS,MAAA,CAAQ/C,CAAY,CAAC,CAAA,CAC3F,SAAU+C,CAAAA,CAAK,QAAA,CAAS,MACzB,EACD,CAGA,IAAA,IAAS5E,CAAAA,CAAIa,CAAAA,CAAM,EAAGb,CAAAA,CAAIY,CAAAA,CAAO,MAAA,EAAUgE,CAAAA,EAAM,QAAA,CAAU5E,CAAAA,EAAAA,CAAK,CAC/D,IAAM+E,EAAWnE,CAAAA,CAAOZ,CAAC,CAAA,CAAE,IAAA,CAC3B,GAAI+E,CAAAA,GAAa,KAAA,EAASA,CAAAA,CAAS,UAAA,CAAW,MAAM,CAAA,CAAG,MACvD,IAAM3E,CAAAA,CAAOQ,CAAAA,CAAOZ,CAAC,EAAE,KAAA,CAAM,WAAA,EAAY,CAEzC,GADA4E,CAAAA,CAAOA,CAAAA,CAAK,QAAA,CAAS,GAAA,CAAIxE,CAAI,CAAA,CACzB,CAACwE,CAAAA,CAAM,MAGX,GAFA7E,CAAAA,EAAAA,CAEI6E,CAAAA,CAAK,SAAU,CAElB,IAAM/C,CAAAA,CAAejB,CAAAA,CAAO,KAAA,CAAMC,CAAAA,CAAKA,CAAAA,CAAMd,CAAK,CAAA,CAClD+E,CAAAA,CAAO,CACN,QAAA,CAAU/E,CAAAA,CACV,WAAA,CAAa,CACZ2B,CAAAA,CAAiBkD,EAAK,QAAA,CAAS,SAAA,CAAWA,CAAAA,CAAK,QAAA,CAAS,MAAA,CAAQ/C,CAAY,CAC7E,CAAA,CACA,SAAU+C,CAAAA,CAAK,QAAA,CAAS,MACzB,EACD,CACD,CAEA,OAAOE,CACR,CAKA,IAAI,IAAA,EAAe,CAClB,OAAO,IAAA,CAAK,IAAA,CAAK,IAClB,CASA,aAAA,EAAwC,CACvC,IAAMb,CAAAA,CAAiC,EAAC,CAElCe,CAAAA,CAAU,CAACJ,EAAgBK,CAAAA,GAAyB,CACrDL,CAAAA,CAAK,QAAA,GACRX,CAAAA,CAAOgB,CAAAA,CAAK,IAAA,CAAK,GAAG,CAAC,CAAA,CAAIL,CAAAA,CAAK,QAAA,CAAS,SAAA,CAAA,CAExC,IAAA,GAAW,CAACxE,CAAAA,CAAM8E,CAAK,IAAKN,CAAAA,CAAK,QAAA,CAChCI,CAAAA,CAAQE,CAAAA,CAAO,CAAC,GAAGD,CAAAA,CAAM7E,CAAI,CAAC,EAEhC,CAAA,CAEA,IAAA,GAAW,CAACuE,CAAAA,CAAWC,CAAI,CAAA,GAAK,KAAK,IAAA,CACpCI,CAAAA,CAAQJ,CAAAA,CAAM,CAACD,CAAS,CAAC,CAAA,CAG1B,OAAOV,CACR,CAGA,QAAA,CAAS7D,CAAAA,CAAuB,CAC/B,OAAO,IAAA,CAAK,UAAA,CAAW,GAAA,CAAIA,EAAK,WAAA,EAAa,CAC9C,CACD,EC/NA,IAAM+E,CAAAA,CAAyB,IAAI,GAAA,CAAI,CAAC,KAAA,CAAO,GAAA,CAAK,IAAA,CAAM,MAAA,CAAQ,OAAO,CAAC,EAEpEC,CAAAA,CAAqB,IAAI,GAAA,CAAI,CACjC,IAAA,CAAM,OAAA,CAAS,UAAA,CAAY,UAAA,CAAY,OAAA,CAAS,UAAA,CAAY,QAAA,CAAU,IACxE,CAAC,CAAA,CA2BM,SAASC,CAAAA,CACfC,EAAmB,EAAA,CACnBC,CAAAA,CACiB,CACjB,IAAMC,CAAAA,CAAcD,CAAAA,GAAcnF,CAAAA,EAAiBgF,CAAAA,CAAmB,GAAA,CAAIhF,CAAAA,CAAK,WAAA,EAAa,CAAA,CAAA,CAE5F,OAAO,CACJ,IAAA,CAAM,oBACN,QAAA,CAAAkF,CAAAA,CAIA,KAAA,CAAO,CACL,CAAE,KAAA,CAAO,CAAC,QAAA,CAAU,QAAQ,CAAE,CAAA,CAC9B,CAAE,KAAA,CAAO,CAAC,OAAA,CAAS,QAAA,CAAU,IAAA,CAAM,GAAG,CAAE,CAC1C,CAAA,CACA,KAAA,CAAM1E,CAAAA,CAAiBC,CAAAA,CAAqC,CAE1D,GAAIA,CAAAA,CAAM,CAAA,EAAKD,CAAAA,CAAO,MAAA,CAAQ,OAAO,IAAA,CAErC,IAAMf,CAAAA,CAAIe,EAAOC,CAAG,CAAA,CACd4E,CAAAA,CAAO7E,CAAAA,CAAOC,CAAAA,CAAM,CAAC,CAAA,CAa3B,GAAI,GAHDhB,CAAAA,CAAE,IAAA,GAAS,QAAA,EAAYA,CAAAA,CAAE,IAAA,GAAS,QAAA,IAClC4F,CAAAA,CAAK,IAAA,GAAS,SAAWA,CAAAA,CAAK,IAAA,GAAS,QAAA,EAAYA,CAAAA,CAAK,IAAA,GAAS,IAAA,EAAQA,CAAAA,CAAK,IAAA,GAAS,GAAA,CAAA,CAAA,CAE3E,OAAO,IAAA,CAKtB,IAAMC,CAAAA,CAAYD,CAAAA,CAAK,KAAA,CAAM,WAAA,GAU7B,GATID,CAAAA,CAAYE,CAAS,CAAA,EASrBP,CAAAA,CAAuB,GAAA,CAAIO,CAAS,CAAA,EAAK9E,EAAOC,CAAAA,CAAM,CAAC,CAAA,EAAG,IAAA,GAAS,MAAA,CAAQ,OAAO,IAAA,CAGtF,IAAM8E,EAAY,IAAI3D,mBAAAA,CACpB,MAAA,CAAQlC,mBAAAA,CAAY,MAAM,CAAA,CAAG,GAAA,CAAK,GAAA,CAClC2F,CAAAA,CAAK,MAAA,CAAQ,CAAA,CAAGA,CAAAA,CAAK,IAAA,CAAMA,CAAAA,CAAK,GAClC,CAAA,CAIA,OAAO,CAAE,QAAA,CAAU,CAAA,CAAG,WAAA,CAAa,CAAC5F,CAAAA,CAAG8F,CAAS,CAAE,CACpD,CACF,CACF,CA2CO,SAASC,EAAAA,CAAqBhF,CAAAA,CAAiBC,CAAAA,CAAsB,CAC1E,IAAMgF,CAAAA,CAAuB,EAAC,CAC9B,IAAA,IAAS7F,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIa,CAAAA,CAAKb,CAAAA,EAAAA,CAAK,CAC5B,IAAMH,CAAAA,CAAIe,CAAAA,CAAOZ,CAAC,CAAA,CAClB,GAAIH,CAAAA,CAAE,IAAA,GAAS,UAAA,CACbgG,CAAAA,CAAU,IAAA,CAAK,IAAI,CAAA,CAAA,KAAA,GACVhG,CAAAA,CAAE,OAAS,QAAA,CAAU,CAC9B,IAAMiG,CAAAA,CAAOlF,CAAAA,CAAOZ,CAAAA,CAAI,CAAC,CAAA,CACnB+F,EAAqB,CAAC,CAACD,CAAAA,GAC3BA,CAAAA,CAAK,IAAA,GAAS,KAAA,EAASA,CAAAA,CAAK,IAAA,GAAS,QAAA,EAAYA,CAAAA,CAAK,IAAA,GAAS,QAAA,EAAYA,CAAAA,CAAK,IAAA,GAAS,SAAA,EACxFA,CAAAA,CAAK,OAAS,OAAA,GAAYA,CAAAA,CAAK,KAAA,CAAM,WAAA,EAAY,GAAM,KAAA,EAASA,CAAAA,CAAK,KAAA,CAAM,aAAY,GAAM,QAAA,EAAYA,CAAAA,CAAK,KAAA,CAAM,WAAA,EAAY,GAAM,KAAA,EAASA,CAAAA,CAAK,MAAM,WAAA,EAAY,GAAM,MAAA,CAAA,CAAA,CAE/KD,CAAAA,CAAU,IAAA,CAAKE,CAAkB,EACnC,CAAA,KAAA,CAAWlG,CAAAA,CAAE,IAAA,GAAS,UAAA,EAAcA,CAAAA,CAAE,IAAA,GAAS,QAAA,GAC7CgG,CAAAA,CAAU,GAAA,GAEd,CACA,OAAOA,CAAAA,CAAU,MAAA,CAAS,CAAA,EAAKA,CAAAA,CAAUA,CAAAA,CAAU,MAAA,CAAS,CAAC,CAC/D,CAoBO,SAASG,EAAAA,EAAiD,CAC/D,OAAO,CAELX,CAAAA,EACF,CACF","file":"chunk-4DR5RBHQ.cjs","sourcesContent":["//#region ─── Module Overview ───────────────────────────────────────────────────\n\n/**\n * RuleIndex, a conjunctive bitmask prefilter over the normalizer's rules.\n *\n * ## Problem\n * The normalizer tries every rule eligible at a position, at every position.\n * The `startTokenTypes` hint buckets rules by the type of the token they start\n * at, which helps only where that type is selective. It is not: the thirteen\n * call-fusion rules all declare `[\"IDENT\"]`, the commonest token in prose, and\n * the rules firing on a bare `NUMBER` all share that one type too. Measured\n * against the built-in package set, the `IDENT` bucket held 53 of 57 rules and\n * the `NUMBER` bucket 45, because a rule declaring no hint has to be tried\n * everywhere.\n *\n * ## Solution\n * Rules discriminate on different things, so no single axis separates them.\n * A rule declares its leading {@link RuleSlot} shape, and this builds one\n * lookup plane per slot: a flat `Uint32Array` of rule bitmasks indexed by token\n * type id, so a lookup is an array load rather than a hash. A position ANDs the\n * planes together and iterates only the surviving bits, which for most\n * positions is none at all.\n *\n * Rejecting a position therefore costs a few loads and ANDs instead of\n * forty-odd closure calls, and one AND tests 32 rules at once. That the common\n * answer is \"no rule can fire here\" is the point.\n *\n * ## Why planes rather than a fingerprint\n * A superimposed code (OR the hashed types of a window into one word, AND\n * against a per-rule required fingerprint) looks like the cheaper way to reach\n * depth, but it is a per-RULE test with no way to invert it into a lookup, so\n * it stays O(rules) per position. These planes are the same conjunctive test\n * done exactly, at O(rules / 32) and with no false positives. Token types\n * number a couple of hundred, small enough to table, so there is nothing to\n * gain by approximating.\n *\n * ## Ordering\n * Bit `i` is the rule at index `i` of the priority-sorted rule list, so\n * iterating bits from low to high visits rules in exactly the order the\n * unindexed scan did. Ties keep registration order, because the sort is stable.\n * This is what makes the index a pure filter rather than a behaviour change,\n * and `NormalizerIndexFidelity.spec` pins it.\n *\n * ## Safety\n * The contract runs one way: a slot admitting MORE than the rule can match\n * costs a `match()` that returns null, which is what happens today; a slot\n * admitting LESS makes the rule unreachable, a silent bug. So indexing fewer\n * planes than were declared is always safe, which is why {@link MAX_PLANES}\n * can be tuned on evidence rather than being a correctness decision. Only\n * over-narrow declarations are dangerous, and those are what the fidelity spec\n * hunts for.\n *\n * @module RuleIndex\n */\n\n//#endregion\n//#region ─── Imports ──────────────────────────────────────────────────────────\n\nimport type { NormalizerRule, RuleSlot } from \"./NormalizerRule\";\nimport { tokenTypeId } from \"@solve-js/lexer/Token\";\n\n//#endregion\n//#region ─── Constants ────────────────────────────────────────────────────────\n\n/** Bits per word in the masks below. */\nconst WORD_BITS = 32;\n\n/**\n * How many leading slots are indexed, however many a rule declares.\n *\n * Each plane costs a load and an AND at every position, unconditionally, while\n * only positions surviving the earlier planes can benefit from a later one.\n * After two planes most positions have no candidates left, so a third would tax\n * every token to save a couple of `match()` calls on the few that reach it.\n *\n * Two is a measured default, not a limit of the design: raising it is a\n * one-line change, and lowering it can never break a rule (see this module's\n * Safety note). Rules may declare deeper shapes freely; the extra slots simply\n * go unindexed and are checked by `match()` as before.\n */\nconst MAX_PLANES = 2;\n\n//#endregion\n//#region ─── Shape normalisation ──────────────────────────────────────────────\n\n/**\n * A rule's effective shape, folding the older {@link NormalizerRule.startTokenTypes}\n * into the general form. `shape` wins when both are present.\n */\nexport function effectiveShape(rule: NormalizerRule): readonly RuleSlot[] {\n\tif (rule.shape !== undefined) return rule.shape;\n\tif (rule.startTokenTypes !== undefined) return [{ types: rule.startTokenTypes }];\n\treturn [];\n}\n\n//#endregion\n//#region ─── RuleIndex ────────────────────────────────────────────────────────\n\n/** One indexed slot position: the type plane, plus the value axis for it. */\ninterface Plane {\n\t/** `[typeId * words + w]`, rules whose slot admits `typeId`. */\n\treadonly byType: Uint32Array;\n\t/** Rules constraining no type here, admitted at a type with no row. */\n\treadonly typeAny: Uint32Array;\n\t/**\n\t * Rules constraining no type here, and so the only ones still admissible\n\t * when the stream ends before this slot.\n\t */\n\treadonly atEnd: Uint32Array;\n\t/** `[typeId]`, 1 when a value-constraining rule admits this type here. */\n\treadonly typeHasValues: Uint8Array;\n\t/** Lower-cased word to the rules naming it at this slot. */\n\treadonly byValue: Map<string, Uint32Array>;\n\t/** Rules constraining no value here. */\n\treadonly valueAny: Uint32Array;\n}\n\n/**\n * A conjunctive bitmask prefilter over a priority-sorted rule list.\n *\n * Built once per rule-set mutation (registration time), then read only. See\n * this module's overview for the shape and the ordering guarantee.\n */\nexport class RuleIndex {\n\t/** The priority-sorted rules. Bit `i` of every mask refers to `rules[i]`. */\n\treadonly rules: readonly NormalizerRule[];\n\n\t/** Words per mask, `ceil(rules.length / 32)`. */\n\treadonly words: number;\n\n\t/** Number of token type ids with their own row, exclusive upper bound. */\n\tprivate readonly typeRows: number;\n\n\t/** One per indexed slot, at most {@link MAX_PLANES}. */\n\tprivate readonly planes: readonly Plane[];\n\n\t/** Reused across positions so the hot path allocates nothing. */\n\tprivate readonly scratch: Uint32Array;\n\n\t/**\n\t * Every rule's bit set.\n\t *\n\t * Returned when there are no planes at all, which happens when no rule\n\t * declares a shape. Without it {@link candidates} would hand back an\n\t * unwritten scratch buffer, i.e. \"no rule can fire anywhere\", and every\n\t * rule would silently stop running. The all-admitted answer is the correct\n\t * one: a rule that constrains nothing can match anywhere.\n\t */\n\tprivate readonly allRules: Uint32Array;\n\n\tconstructor(sortedRules: readonly NormalizerRule[]) {\n\t\tthis.rules = sortedRules;\n\t\tconst n = sortedRules.length;\n\t\tconst w = Math.max(1, Math.ceil(n / WORD_BITS));\n\t\tthis.words = w;\n\t\tthis.scratch = new Uint32Array(w);\n\n\t\tconst shapes = sortedRules.map(effectiveShape);\n\n\t\t// Size the type-indexed rows to cover every type any rule names. A token\n\t\t// whose id lands past this (a plugin type minted after the index was\n\t\t// built, say) falls back to the \"constrains nothing\" masks, which is\n\t\t// correct rather than merely safe: a rule naming types cannot match a\n\t\t// type it did not name, and a rule naming none can match anywhere.\n\t\tlet maxTypeId = 0;\n\t\tfor (const shape of shapes) {\n\t\t\tfor (const slot of shape) {\n\t\t\t\tfor (const t of slot.types ?? []) maxTypeId = Math.max(maxTypeId, tokenTypeId(t));\n\t\t\t}\n\t\t}\n\t\tthis.typeRows = maxTypeId + 1;\n\n\t\tlet depth = 0;\n\t\tfor (const shape of shapes) depth = Math.max(depth, shape.length);\n\t\tdepth = Math.min(depth, MAX_PLANES);\n\n\t\tthis.allRules = new Uint32Array(w);\n\t\tfor (let i = 0; i < n; i++) {\n\t\t\tthis.allRules[(i / WORD_BITS) | 0] |= 1 << (i % WORD_BITS);\n\t\t}\n\n\t\tconst planes: Plane[] = [];\n\t\tfor (let k = 0; k < depth; k++) {\n\t\t\tplanes.push(this.buildPlane(shapes, k, w));\n\t\t}\n\t\tthis.planes = planes;\n\t}\n\n\t/** Build the lookup plane for slot `k`. */\n\tprivate buildPlane(shapes: readonly (readonly RuleSlot[])[], k: number, w: number): Plane {\n\t\tconst plane: Plane = {\n\t\t\tbyType: new Uint32Array(this.typeRows * w),\n\t\t\ttypeAny: new Uint32Array(w),\n\t\t\tatEnd: new Uint32Array(w),\n\t\t\ttypeHasValues: new Uint8Array(this.typeRows),\n\t\t\tbyValue: new Map<string, Uint32Array>(),\n\t\t\tvalueAny: new Uint32Array(w),\n\t\t};\n\n\t\tfor (let i = 0; i < shapes.length; i++) {\n\t\t\tconst slot: RuleSlot | undefined = shapes[i][k];\n\t\t\tconst word = (i / WORD_BITS) | 0;\n\t\t\tconst bit = 1 << (i % WORD_BITS);\n\n\t\t\t// ── Types ──\n\t\t\tconst types = slot?.types;\n\t\t\tif (types === undefined) {\n\t\t\t\t// Constrains nothing here, so admitted at every type, at a type\n\t\t\t\t// with no row, and past the end of the stream.\n\t\t\t\t//\n\t\t\t\t// Deliberately NOT written into every row of `byType`. Doing that\n\t\t\t\t// made construction O(rules x tokenTypes), tens of thousands of\n\t\t\t\t// writes for a table most of which is the same bit, and the\n\t\t\t\t// engine builds an index per instance: a cold parse of a short\n\t\t\t\t// document paid for it without ever amortising it. The lookup\n\t\t\t\t// ORs `typeAny` in instead, which is one extra operation per word\n\t\t\t\t// on a path that already does several.\n\t\t\t\tplane.typeAny[word] |= bit;\n\t\t\t\tplane.atEnd[word] |= bit;\n\t\t\t} else {\n\t\t\t\tfor (const t of types) plane.byType[tokenTypeId(t) * w + word] |= bit;\n\t\t\t}\n\n\t\t\t// ── Values ──\n\t\t\tconst values = slot?.values;\n\t\t\tif (values === undefined) {\n\t\t\t\tplane.valueAny[word] |= bit;\n\t\t\t} else {\n\t\t\t\tfor (const raw of values) {\n\t\t\t\t\tconst value = raw.toLowerCase();\n\t\t\t\t\tlet mask = plane.byValue.get(value);\n\t\t\t\t\tif (mask === undefined) {\n\t\t\t\t\t\tmask = new Uint32Array(w);\n\t\t\t\t\t\tplane.byValue.set(value, mask);\n\t\t\t\t\t}\n\t\t\t\t\tmask[word] |= bit;\n\t\t\t\t}\n\t\t\t\t// The value axis is only worth a map lookup at a type some\n\t\t\t\t// value-constraining rule admits here.\n\t\t\t\tif (types === undefined) {\n\t\t\t\t\tplane.typeHasValues.fill(1);\n\t\t\t\t} else {\n\t\t\t\t\tfor (const t of types) {\n\t\t\t\t\t\tconst id = tokenTypeId(t);\n\t\t\t\t\t\tif (id < this.typeRows) plane.typeHasValues[id] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn plane;\n\t}\n\n\t/** Number of indexed rules. */\n\tget size(): number { return this.rules.length; }\n\n\t/** How many slot positions are indexed. */\n\tget depth(): number { return this.planes.length; }\n\n\t/**\n\t * The candidate mask for a position, written into a reused scratch buffer\n\t * and returned. Bits are rule indices, ascending bit order being descending\n\t * priority. The buffer is overwritten by the next call, so read it before\n\t * calling again.\n\t *\n\t * @param tokens - The stream being walked\n\t * @param pos    - The position to test\n\t */\n\tcandidates(tokens: readonly { typeId: number; value: string }[], pos: number): Uint32Array {\n\t\tconst w = this.words;\n\t\tconst scratch = this.scratch;\n\t\tconst planes = this.planes;\n\t\tconst len = tokens.length;\n\n\t\tif (planes.length === 0) {\n\t\t\tscratch.set(this.allRules);\n\t\t\treturn scratch;\n\t\t}\n\n\t\tfor (let k = 0; k < planes.length; k++) {\n\t\t\tconst plane = planes[k];\n\t\t\tconst at = pos + k;\n\n\t\t\tif (at >= len) {\n\t\t\t\t// The stream ends before this slot, so only rules that constrain\n\t\t\t\t// nothing here remain admissible.\n\t\t\t\tif (k === 0) { scratch.set(plane.atEnd); }\n\t\t\t\telse { for (let i = 0; i < w; i++) scratch[i] &= plane.atEnd[i]; }\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tconst token = tokens[at];\n\t\t\tconst typeId = token.typeId;\n\t\t\tconst base = typeId >= 0 && typeId < this.typeRows ? typeId * w : -1;\n\n\t\t\t// `typeAny` holds the rules that constrain no type at this slot, so\n\t\t\t// they are admitted whatever the token is; see the construction note.\n\t\t\tif (k === 0) {\n\t\t\t\tif (base >= 0) { for (let i = 0; i < w; i++) scratch[i] = plane.byType[base + i] | plane.typeAny[i]; }\n\t\t\t\telse { scratch.set(plane.typeAny); }\n\t\t\t} else {\n\t\t\t\tif (base >= 0) { for (let i = 0; i < w; i++) scratch[i] &= plane.byType[base + i] | plane.typeAny[i]; }\n\t\t\t\telse { for (let i = 0; i < w; i++) scratch[i] &= plane.typeAny[i]; }\n\t\t\t}\n\n\t\t\t// The value axis costs a map lookup and possibly a lower-casing, so\n\t\t\t// it is consulted only at a type some value-constraining rule names.\n\t\t\tif (base >= 0 && plane.typeHasValues[typeId] === 1) {\n\t\t\t\tconst value = token.value;\n\t\t\t\tconst lowered = hasUpper(value) ? value.toLowerCase() : value;\n\t\t\t\tconst named = plane.byValue.get(lowered);\n\t\t\t\tfor (let i = 0; i < w; i++) {\n\t\t\t\t\tscratch[i] &= (named === undefined ? 0 : named[i]) | plane.valueAny[i];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (isEmptyMask(scratch)) return scratch;\n\t\t}\n\n\t\treturn scratch;\n\t}\n}\n\n/** Whether every bit of a mask returned by {@link RuleIndex.candidates} is clear. */\nexport function isEmptyMask(mask: Uint32Array): boolean {\n\tfor (let i = 0; i < mask.length; i++) if (mask[i] !== 0) return false;\n\treturn true;\n}\n\n/**\n * Whether a string contains an ASCII upper-case letter.\n *\n * `toLowerCase()` allocates even when it changes nothing, and identifiers in\n * running prose are overwhelmingly already lower case, so this scan pays for\n * itself by skipping the allocation in the common case.\n */\nfunction hasUpper(value: string): boolean {\n\tfor (let i = 0; i < value.length; i++) {\n\t\tconst c = value.charCodeAt(i);\n\t\tif (c >= 65 && c <= 90) return true;\n\t}\n\treturn false;\n}\n\n//#endregion\n","//#region ─── Module Overview ───────────────────────────────────────────────────\n\n/**\n * TokenNormalizer, post-lexer token normalization pass.\n *\n * ## Purpose\n * Applies domain-specific {@link NormalizerRule | NormalizerRules} to the raw\n * token stream produced by the {@link ExpressionLexer}. This keeps the lexer\n * slim and focused on single-token production, while multi-token pattern\n * matching (phrases, implicit operators, domain merges) lives here.\n *\n * ## What rules can do\n * - **Phrase fusion**: Merge consecutive words into compound tokens\n *   (e.g., `IDENT + ... + IDENT` → `CARET`)\n * - **Implicit operator insertion**: Insert missing operators between tokens\n *   (e.g., `NUMBER IDENT` → `NUMBER STAR IDENT`)\n * - **Domain-specific transformations**: Coalesce item names, currency pairs,\n *   percentage syntax, etc.\n *\n * ## Architecture\n * Providers register NormalizerRules alongside Parselets and OpCode handlers\n * via {@link IEnginePackage.normalizerRules}. The normalizer applies them\n * greedily left-to-right in multiple passes with safety limits.\n *\n * @module TokenNormalizer\n */\n\n//#endregion\n//#region ─── Imports ──────────────────────────────────────────────────────────\n\nimport type { Token } from \"@solve-js/lexer/Token\";\nimport { tokenTypeId } from \"@solve-js/lexer/Token\";\nimport { LexerToken } from \"@solve-js/lexer/ExpressionLexer\";\nimport type { NormalizerRule, RuleSlot, TokenFusion } from \"./NormalizerRule\";\nimport { PhraseTrie } from \"./PhraseTrie\";\nimport { RuleIndex, isEmptyMask, effectiveShape } from \"./RuleIndex\";\nimport { ErrorFactory } from \"@solve-js/errors/UnifiedErrorFramework\";\n\n//#endregion\n//#region ─── NormalizerOptions, Configuration ────────────────────────────────\n\n/**\n * Configuration options for the normalization pass.\n *\n * These control safety limits and diagnostic callbacks. The defaults\n * are chosen to be generous enough for any realistic expression while\n * preventing runaway token expansion from recursive rules.\n */\nexport interface NormalizerOptions {\n  /**\n   * Maximum number of full passes over the token stream before bailing out.\n   * Prevents infinite loops from recursive rule chains.\n   * @default 100\n   */\n  maxPasses?: number;\n\n  /**\n   * Maximum number of tokens allowed after normalization.\n   * If exceeded, an Error is thrown rather than passing a bloated stream\n   * to the parser.\n   * @default 10000\n   */\n  maxTokens?: number;\n\n  /**\n   * Callback invoked for each fusion event during normalization.\n   * Used by diagnostic mode to populate {@link NormalizerOutput.fusions}.\n   * When `undefined`, fusions are still tracked internally but no callbacks fire.\n   */\n  onFusion?: (fusion: TokenFusion) => void;\n\n  /**\n   * Try every registered rule at every position, ignoring both the shape\n   * index and the first-token buckets the first call uses.\n   *\n   * Diagnostic only, and much slower. It exists so the filtered walks can be\n   * compared against the exhaustive one over a corpus: each filter is pure,\n   * so all of them must agree token for token, and a rule whose declared\n   * {@link NormalizerRule.shape} is too narrow shows up as a difference rather\n   * than as a feature that quietly stopped working.\n   * `NormalizerIndexFidelity.spec` and `RuleHintsMatchGuards.spec` are the\n   * consumers.\n   *\n   * @default false\n   */\n  ignoreRuleIndex?: boolean;\n}\n\n//#endregion\n//#region ─── Default Options ──────────────────────────────────────────────────\n\n/** Sensible defaults that catch infinite loops without limiting real expressions. */\nconst DEFAULT_OPTIONS: Required<NormalizerOptions> = {\n  maxPasses: 100,\n  maxTokens: 10000,\n  onFusion: () => {},\n  ignoreRuleIndex: false,\n};\n\n//#endregion\n//#region ─── createFusedToken, Token Factory ──────────────────────────────────\n\n/**\n * Creates a new normalized token from fused source tokens.\n *\n * The fused token inherits position information (offset, line, column)\n * from the first source token, which preserves source-map accuracy\n * for error messages and diagnostic highlighting.\n *\n * It also records where the source text ENDS, on `sourceEnd`. The start alone\n * is not enough to describe the span a fusion covers, because `text` is the\n * replacement rather than the original: `10 frames` fuses into a FRAME_COUNT\n * whose text is `10`, and a timecode fuses into a token whose text is a\n * comma-separated tuple that appears nowhere in the line. Anything painting the\n * line needs both ends, and only this function is in a position to know them.\n *\n * @param type         - The new token type (e.g., \"CARET\", \"TIMES_BY\")\n * @param text         - The combined text representation (e.g., \"to the power of\")\n * @param sourceTokens - The original tokens being fused (at least 2)\n * @returns A new {@link LexerToken} with the fused type and combined text\n */\nexport function createFusedToken(\n  type: string,\n  text: string,\n  sourceTokens: Token[]\n): Token {\n  const first = sourceTokens[0];\n  const last = sourceTokens[sourceTokens.length - 1];\n  const token = new LexerToken(\n    type,\n    tokenTypeId(type),\n    text,\n    text,\n    first.offset,\n    first.lineBreaks ?? 0,\n    first.line,\n    first.col,\n  );\n  // `text`, not `value`: this is where the SOURCE ended, and the two differ\n  // for a string literal, whose value is the payload without its quotes.\n  token.sourceEnd = last.sourceEnd ?? last.offset + last.text.length;\n  return token;\n}\n\n/**\n * Record, on a token that replaced several, where its source text ended.\n *\n * Called centrally rather than left to each rule. A rule that builds its\n * replacement by hand rather than through {@link createFusedToken} is doing\n * nothing wrong, and several do: the date-literal rule needs a token whose\n * value is an epoch and whose text is the source, which that factory cannot\n * express. Stamping here means every fusion carries its span, including ones\n * written after this was.\n *\n * Reads `sourceEnd` off the last source token when it has one, so a fusion of\n * a fusion still describes the original text rather than the intermediate.\n *\n * @param fused - The single token the rule produced.\n * @param sourceTokens - The tokens it consumed.\n */\nfunction recordSourceSpan(fused: Token, sourceTokens: Token[]): void {\n  const last = sourceTokens[sourceTokens.length - 1];\n  if (!last) return;\n  fused.sourceEnd = last.sourceEnd ?? last.offset + last.text.length;\n}\n\n//#endregion\n//#region ─── NON_WORD_TOKEN_TYPES, Type-guard skip set ────────────────────────\n\n/**\n * Token types that can NEVER start a multi-word phrase.\n *\n * Used by {@link normalize} to skip the PhraseTrie walk entirely at\n * positions where the token type makes phrase matching impossible.\n * This avoids even the O(1) {@link PhraseTrie.canStart} check.\n *\n * Types NOT in this set (IDENT, KEYWORD, FUNC, UNIT, and any custom\n * types registered by packages) still pass through to the trie for\n * a full match attempt.\n */\n// ── Non-word type ID lookup table (flat Uint8Array, true O(1) array index) ──\n//\n// Index = token typeId, value = 1 if non-word (skip trie), 0 otherwise.\n// Array indexing avoids ALL hashing: no Set.has(), no Map.get(), no string ops.\n//\n// Custom types from packages get IDs beyond the table length, so the bounds\n// check `tid < TABLE.length` safely passes them through to the trie.\n//\n// Arithmetic operators (PLUS, MINUS, STAR, SLASH, CARET, MOD, PERCENT) are\n// intentionally excluded: in keyword locales the lexer maps \"times\"→STAR,\n// \"divide\"→SLASH etc., and those tokens CAN start phrases like \"times by\".\n/**\n * Token type names that can NEVER start a multi-word phrase.\n *\n * Exported for testing only, consumers should use the type-guard behavior\n * of {@link TokenNormalizer.normalize} rather than this list directly.\n */\nexport const NON_WORD_NAMES = [\n\t\"NUMBER\", \"HEX\", \"BIGINT\", \"FLOAT\",\n\t\"LSHIFT\", \"RSHIFT\", \"BIT_AND\", \"BIT_OR\", \"BIT_XOR\",\n\t\"LPAREN\", \"RPAREN\", \"LBRACKET\", \"RBRACKET\",\n\t\"COMMA\", \"COLON\", \"EQUALS\", \"THEREFORE\", \"PIPE\", \"AMPERSAND\", \"AT\",\n\t\"SEMICOLON\", \"QUESTION\", \"EXCLAMATION\",\n\t\"EOF\", \"WS\", \"NEWLINE\",\n] as const;\n\n/**\n * Flat Uint8Array lookup table: index = token typeId, value = 1 if non-word.\n *\n * Exported for testing only, consumers should not depend on the internal\n * table layout, as the set of non-word types may change.\n */\nexport const NON_WORD_TABLE: Uint8Array = (() => {\n\t// Resolve all non-word type names to their numeric IDs\n\tconst ids = NON_WORD_NAMES.map(n => tokenTypeId(n));\n\t// Size the table to cover the largest ID + 1\n\tconst len = Math.max(...ids) + 1;\n\tconst table = new Uint8Array(len);\n\t// Mark non-word type positions\n\tfor (const id of ids) table[id] = 1;\n\treturn table;\n})();\n\n//#endregion\n//#region ─── TokenNormalizer Class ─────────────────────────────────────────────\n\n/**\n * Rule names already warned about, so a rule registered into many engines\n * says it once rather than once per engine.\n */\nconst warnedUnshapedRules = new Set<string>();\n\n/**\n * Warn when a rule declares neither a shape nor a reason for not having one.\n *\n * An unshaped rule is tried at every position of every line, so its cost is\n * paid by every document rather than only by the feature it implements. The\n * warning names the rule and points at the two ways out, and it fires once per\n * rule name per process: a warning a package author sees on every engine they\n * construct is one they learn to filter out, which would make it worse than\n * useless.\n *\n * Deliberately not an error. A rule without a shape is correct, only slower,\n * and refusing to register it would break every package written before the\n * field existed.\n */\nfunction warnIfUnshaped(rule: NormalizerRule): void {\n  if (rule.shape !== undefined && rule.shape.length > 0) return;\n  if (rule.startTokenTypes !== undefined) return;\n  if (rule.unshapedReason !== undefined) return;\n  if (warnedUnshapedRules.has(rule.name)) return;\n  warnedUnshapedRules.add(rule.name);\n  console.warn(\n    `[TokenNormalizer] Rule \"${rule.name}\" declares no \\`shape\\`, so it is tried at every ` +\n    `token of every line and slows down documents that never use it. Declare the tokens it ` +\n    `can start at, e.g. shape: [{ types: [\"IDENT\"], values: [\"myword\"] }, { types: [\"LPAREN\"] }]. ` +\n    `If it genuinely cannot be described that way, set \\`unshapedReason\\` to say why and this ` +\n    `warning will stop.`,\n  );\n}\n\n/**\n * Token normalizer: applies {@link NormalizerRule | NormalizerRules} to a token stream.\n *\n * ## Lifecycle\n * 1. **Registration**: Rules are added via {@link register} and sorted by priority\n * 2. **Normalization**: {@link normalize} applies rules greedily left-to-right\n * 3. **Cleanup**: {@link clear} or {@link unregister} removes rules\n *\n * ## Normalization algorithm\n * The normalizer uses a greedy left-to-right multi-pass algorithm:\n * - At each token position, rules are tried in priority order (highest first)\n * - When a rule matches, matched tokens are consumed and replaced\n * - Processing continues from the replacement position\n * - Multiple passes handle cascading matches (one rule's output triggers another)\n * - Safety limits ({@link NormalizerOptions.maxPasses}) prevent infinite loops\n *\n * @example\n * ```ts\n * const normalizer = new TokenNormalizer();\n * normalizer.register(phraseRule);       // \"to the power of\" → CARET\n * normalizer.register(implicitMultRule); // \"2 x\" → \"2 * x\"\n * const normalized = normalizer.normalize(rawTokens);\n * ```\n */\nexport class TokenNormalizer {\n  /** Registered rules, unsorted, the source of truth. */\n  private rules: NormalizerRule[] = [];\n\n  /**\n   * Priority-sorted copy of {@link rules}, rebuilt lazily on the next\n   * {@link normalize} call after a mutation. Rules are registered once at\n   * engine/package-registration time and essentially never change during a\n   * session, but normalize() runs on every keystroke-driven evaluation, an\n   * earlier version re-sorted a fresh copy of `rules` on every single call,\n   * which meant every keystroke paid for an allocation + sort of a list that\n   * had usually not changed since the last one. `null` means \"stale, rebuild\n   * on next use\"; {@link register}/{@link unregister}/{@link clear} all\n   * invalidate it.\n   */\n  private sortedRulesCache: NormalizerRule[] | null = null;\n\n  /**\n   * Per-token-type view of the priority-sorted rules, for the one\n   * {@link normalize} call that runs before the index exists: for a token\n   * type, the rules whose first declared slot admits it (or constrains no\n   * type at all), in the same priority order {@link getSortedRules} produces.\n   * See {@link rulesForTokenType}. Built once per distinct type and cached,\n   * invalidated alongside {@link sortedRulesCache}.\n   */\n  private rulesByTokenType = new Map<string, NormalizerRule[]>();\n\n  /**\n   * Shape index over the priority-sorted rules, rebuilt alongside\n   * {@link sortedRulesCache}. `null` means \"stale, rebuild on next use\".\n   *\n   * This is what turns the per-position scan from \"try every rule that could\n   * fire on this token type\" into \"AND a few lookup planes and try what\n   * survives\", which is usually nothing. See {@link RuleIndex}.\n   */\n  private ruleIndexCache: RuleIndex | null = null;\n\n  /** Reused by {@link rulesAt} so a position's candidate list costs no allocation. */\n  private candidateBuffer: NormalizerRule[] = [];\n\n  /**\n   * How many times {@link normalize} has run, capped once the index is in use.\n   *\n   * The index costs a few tens of microseconds to build and pays that back\n   * within a line or two, but an engine that normalises exactly once, which is\n   * what evaluating a single expression on a fresh engine does, would never\n   * reach the payback. Skipping the build on the first call keeps that case at\n   * the cost it had before the index existed, and a document reaches line two\n   * immediately. The first call is not unfiltered, though: it reads the same\n   * first-slot types the index would, through {@link rulesForTokenType}, so a\n   * single expression still skips every rule that could not start at its\n   * tokens.\n   */\n  private normalizeCalls = 0;\n\n  /**\n   * Phrase trie for single-pass multi-word phrase fusion.\n   * Tried at each token position BEFORE other rules, the trie walk\n   * is O(depth) vs O(R × W) for separate rule matching.\n   */\n  private phraseTrie = new PhraseTrie();\n\n  /** Merged options with defaults applied. */\n  private options: Required<NormalizerOptions>;\n\n  // ── Constructor ──────────────────────────────────────────────────────────\n\n  /**\n   * @param options - Configuration overrides for safety limits and diagnostic callbacks\n   */\n  constructor(options: NormalizerOptions = {}) {\n    this.options = { ...DEFAULT_OPTIONS, ...options };\n  }\n\n  // ── Rule Management ──────────────────────────────────────────────────────\n\n  /**\n   * Register a normalization rule.\n   *\n   * Rules are sorted by priority (descending) on each {@link normalize} call.\n   * Multiple rules can share the same priority, they are tried in registration\n   * order when priorities are equal.\n   *\n   * @param rule - The rule to register\n   */\n  register(rule: NormalizerRule): void {\n    warnIfUnshaped(rule);\n    this.rules.push(rule);\n    this.sortedRulesCache = null;\n    this.rulesByTokenType.clear();\n    this.ruleIndexCache = null;\n    this.ruleShapesCache = null;\n  }\n\n  /**\n   * Unregister a normalization rule by its {@link NormalizerRule.name | name}.\n   *\n   * If multiple rules share the same name, all are removed. This is safe to\n   * call with a name that doesn't match any rule, it simply has no effect.\n   *\n   * @param ruleName - The name of the rule to remove\n   */\n  unregister(ruleName: string): void {\n    this.rules = this.rules.filter(r => r.name !== ruleName);\n    this.sortedRulesCache = null;\n    this.rulesByTokenType.clear();\n    this.ruleIndexCache = null;\n    this.ruleShapesCache = null;\n  }\n\n  /**\n   * Remove all registered rules, resetting the normalizer to its initial state.\n   * Also clears the phrase trie.\n   */\n  clear(): void {\n    this.rules = [];\n    this.sortedRulesCache = null;\n    this.rulesByTokenType.clear();\n    this.ruleIndexCache = null;\n    this.ruleShapesCache = null;\n    this.phraseTrie = new PhraseTrie();\n  }\n\n  /**\n   * Priority-sorted view of {@link rules} (descending priority; registration\n   * order preserved for ties, since {@link Array.prototype.sort} is stable).\n   * Cached until the next mutation. See {@link sortedRulesCache}.\n   */\n  private getSortedRules(): NormalizerRule[] {\n    if (this.sortedRulesCache === null) {\n      this.sortedRulesCache = [...this.rules].sort((a, b) => b.priority - a.priority);\n    }\n    return this.sortedRulesCache;\n  }\n\n  /**\n   * The shape index over the priority-sorted rules, built on first use after\n   * a mutation and cached. See {@link RuleIndex}.\n   */\n  private getRuleIndex(): RuleIndex {\n    if (this.ruleIndexCache === null) {\n      this.ruleIndexCache = new RuleIndex(this.getSortedRules());\n    }\n    return this.ruleIndexCache;\n  }\n\n  /**\n   * The rules to try at a position, in priority order.\n   *\n   * With a candidate mask, walks its set bits low to high, which is descending\n   * priority because bit `i` is the rule at index `i` of the priority-sorted\n   * list.\n   *\n   * The walk shifts a bit at a time rather than jumping to the next set bit\n   * with `Math.clz32(bits & -bits)`, which is the idiomatic form and was 36x\n   * SLOWER here: 45us per line against 1.2us, measured over the built-in rule\n   * set. `clz32` is specified on uint32 and the masks come out of a\n   * `Uint32Array` as doubles above 2^31, so every call pays a conversion that\n   * swamps the handful of iterations it saves. A de Bruijn table matched the\n   * shift scan to within noise and needs a magic constant, so the plain shift\n   * wins on both counts. Worst case is 32 iterations per word of pure integer\n   * work.\n   *\n   * With `null` there is no index to consult, for one of two reasons: this is\n   * the first call, which reads the first-token bucket from\n   * {@link rulesForTokenType}, or {@link NormalizerOptions.ignoreRuleIndex} is\n   * set, which is the exhaustive scan every filter is measured against. Both\n   * hand back a cached list directly, since the caller only reads it.\n   *\n   * With a mask, returns a buffer reused across positions, so the caller must\n   * finish with it before calling again. Copying the surviving rules out here\n   * rather than yielding them lazily is deliberate twice over: it keeps the\n   * mask's own scratch buffer from being read after the next position\n   * overwrites it, and it avoids a generator on the hottest loop in the pass.\n   */\n  private rulesAt(mask: Uint32Array | null, type: string): readonly NormalizerRule[] {\n    if (mask === null) {\n      return this.options.ignoreRuleIndex ? this.getSortedRules() : this.rulesForTokenType(type);\n    }\n\n    const buffer = this.candidateBuffer;\n    buffer.length = 0;\n    const rules = this.getRuleIndex().rules;\n    for (let w = 0; w < mask.length; w++) {\n      let bits = mask[w] >>> 0;\n      let index = w * 32;\n      while (bits !== 0) {\n        if ((bits & 1) !== 0) buffer.push(rules[index]);\n        bits >>>= 1;\n        index++;\n      }\n    }\n    return buffer;\n  }\n\n  /**\n   * The priority-sorted rules that could start at a token of `type`, for the\n   * first {@link normalize} call, which runs before the index is built.\n   *\n   * The filter is the first slot of each rule's {@link effectiveShape}: a rule\n   * naming types there is bucketed under exactly those, and one naming none is\n   * in every bucket. That is the same declaration the index reads at its first\n   * plane, only without the value axis, so a rule the bucket omits is one the\n   * index would omit too, and one that would have returned null here anyway.\n   * An earlier version read only the older `startTokenTypes` hint, which most\n   * rules had by then replaced with a `shape`, so the first call tried nearly\n   * every rule at every position and a fresh engine evaluating one expression\n   * paid several times the rule calls of the second line of a document.\n   *\n   * Built once per distinct type and cached until the rule set changes.\n   */\n  private rulesForTokenType(type: string): NormalizerRule[] {\n    let list = this.rulesByTokenType.get(type);\n    if (list === undefined) {\n      list = this.getSortedRules().filter((rule) => {\n        const first = effectiveShape(rule)[0];\n        return first?.types === undefined || first.types.includes(type);\n      });\n      this.rulesByTokenType.set(type, list);\n    }\n    return list;\n  }\n\n  /**\n   * Get the number of currently registered rules (excludes phrase trie entries).\n   */\n  get ruleCount(): number {\n    return this.rules.length;\n  }\n\n  /**\n   * Every registered rule with the shape it declared, for diagnostic display.\n   *\n   * Exposes what the index is actually working with: a rule that declares a\n   * shape is only tried where that shape can match, and one that declares none\n   * is tried at every position of every line. Which is which is invisible from\n   * the outside otherwise, and it is the difference between a package that\n   * costs the documents that use it and one that costs all of them, so the\n   * playground draws it.\n   *\n   * Returned in priority order, highest first, which is the order the\n   * normalizer tries them in.\n   */\n  private ruleShapesCache: Array<{\n    name: string;\n    priority: number;\n    shape: readonly RuleSlot[];\n    unshapedReason?: string;\n    indexedSlots: number;\n  }> | null = null;\n\n  getRuleShapes(): Array<{\n    name: string;\n    priority: number;\n    shape: readonly RuleSlot[];\n    unshapedReason?: string;\n    indexedSlots: number;\n  }> {\n    // Memoised: the answer depends only on the rule set, but the diagnostic\n    // pipeline builds a stage per LINE, so recomputing it there made a\n    // 25-line document walk every rule 25 times to produce 25 identical lists.\n    if (this.ruleShapesCache !== null) return this.ruleShapesCache;\n    const index = this.getRuleIndex();\n    this.ruleShapesCache = this.getSortedRules().map((rule) => {\n      const shape = effectiveShape(rule);\n      return {\n        name: rule.name,\n        priority: rule.priority,\n        shape,\n        unshapedReason: rule.unshapedReason,\n        indexedSlots: Math.min(shape.length, index.depth),\n      };\n    });\n    return this.ruleShapesCache;\n  }\n\n  /**\n   * How many rules could fire at each position of `tokens`, against the total.\n   *\n   * The point of the index is that most positions admit no rule at all, and\n   * this is what makes that visible rather than asserted.\n   */\n  getCandidateCounts(tokens: Token[]): number[] {\n    const index = this.getRuleIndex();\n    const counts: number[] = [];\n    for (let pos = 0; pos < tokens.length; pos++) {\n      const mask = index.candidates(tokens, pos);\n      let n = 0;\n      for (let w = 0; w < mask.length; w++) {\n        let bits = mask[w] >>> 0;\n        while (bits !== 0) { n += bits & 1; bits >>>= 1; }\n      }\n      counts.push(n);\n    }\n    return counts;\n  }\n\n  // ── Phrase Registration ────────────────────────────────────────────────\n\n  /**\n   * Register a multi-word phrase for fusion into a single compound token.\n   *\n   * This is the preferred way to add phrase patterns. It inserts into the\n   * internal {@link PhraseTrie}, which collapses all phrase rules into a\n   * single O(depth) trie walk per position, no separate rule scanning.\n   *\n   * @param phrase    - Multi-word phrase (e.g., \"to the power of\", \"abyssal whip\")\n   * @param tokenType - Target token type after fusion (e.g., \"CARET\", \"ITEM\")\n   */\n  addPhrase(phrase: string, tokenType: string): void {\n    this.phraseTrie.addPhrase(phrase, tokenType);\n  }\n\n  /**\n   * Check whether a word can start any registered phrase.\n   *\n   * Used by {@link implicitMultiplyRule} to suppress `*` insertion\n   * before phrase-starting identifiers (e.g., \"2 power of 3\" → `2 ^ 3`,\n   * not `2 * power of 3`). Delegates to {@link PhraseTrie.canStart}.\n   */\n  /**\n   * Get all registered phrases and their target token types.\n   *\n   * Exposes the full phrase trie structure for diagnostic rendering\n   * in the playground's NormalizerTab. Returns ALL registered phrases,\n   * not just the ones that matched in the last evaluation.\n   */\n  getPhrases(): Record<string, string> {\n    return this.phraseTrie.getAllPhrases();\n  }\n\n  canStartPhrase(word: string): boolean {\n    return this.phraseTrie.canStart(word);\n  }\n\n  // ── Normalization ────────────────────────────────────────────────────────\n\n  /**\n   * Normalize a token stream by applying all registered rules.\n   *\n   * ## Algorithm\n   * Applies rules greedily left-to-right in multiple passes:\n   * 1. Sort rules by priority (descending)\n   * 2. Walk the token stream left to right\n   * 3. At each position, try rules in priority order\n   * 4. On match: consume matched tokens, insert replacements, restart from insert point\n   * 5. On no match: pass token through unchanged\n   * 6. Repeat until a full pass produces no changes, or maxPasses is reached\n   *\n   * ## Fusion tracking\n   * When a rule consumes more tokens than it produces, the normalizer calls\n   * `onFusion` with a {@link TokenFusion} record for diagnostic collection.\n   * This populates {@link NormalizerOutput.fusions} in the playground pipeline view.\n   *\n   * ## Safety\n   * If the normalized token count exceeds {@link NormalizerOptions.maxTokens},\n   * an Error is thrown to prevent memory exhaustion from runaway rule expansion.\n   *\n   * @param tokens   - Raw tokens from the lexer\n   * @param onFusion - Optional fusion callback (overrides {@link NormalizerOptions.onFusion})\n   * @returns Normalized tokens ready for parsing\n   * @throws {Error} If the normalized token count exceeds maxTokens\n   */\n  normalize(tokens: Token[], onFusion?: (fusion: TokenFusion) => void): Token[] {\n    // ── Early exit: nothing to normalize ──\n    if (tokens.length === 0) return tokens;\n\n    // Rules reach a position through one of three filters, resolved once\n    // below: the shape index, the first-token buckets on the very first call,\n    // or no filter at all under `ignoreRuleIndex`. See rulesAt().\n    const fusionHandler = onFusion ?? this.options.onFusion;\n    const maxPasses = this.options.maxPasses;\n    const maxTokens = this.options.maxTokens;\n\n    // Hoisted out of the pass loop: the rule set cannot change mid-normalize,\n    // so the index is resolved once rather than per position.\n    const warmedUp = this.normalizeCalls > 0;\n    if (!warmedUp) this.normalizeCalls = 1;\n    const useIndex = warmedUp && !this.options.ignoreRuleIndex;\n    const ruleIndex = useIndex ? this.getRuleIndex() : null;\n\n    let current = tokens;\n    let changed = true;\n    let passCount = 0;\n\n    // Multi-pass loop: rules may trigger cascading matches across passes\n    while (changed && passCount < maxPasses) {\n      changed = false;\n      passCount++;\n\n      // Built lazily: a pass that changes nothing must not allocate an array\n      // and copy every token into it only to throw the copy away. `null` means\n      // \"nothing has changed yet, `current` is still the answer\"; the first\n      // rule to fire calls ensureResult() to materialise it. A document whose\n      // lines mostly normalise to themselves is the common case, and it now\n      // costs no allocation at all.\n      let result: Token[] | null = null;\n      let pos = 0;\n\n      // Single-pass left-to-right greedy walk\n      while (pos < current.length) {\n        let matched = false;\n\n        // ── Fast path: phrase trie (O(depth) single walk vs O(R × W) per rule) ──\n        // O(1) type-guard: skip trie entirely for tokens that can't start phrases.\n        // Flat Uint8Array indexed by typeId, no hashing, no Set lookup, true O(1).\n        const tid = current[pos].typeId;\n        if (tid >= NON_WORD_TABLE.length || NON_WORD_TABLE[tid] === 0) {\n          const trieMatch = this.phraseTrie.matchAt(current, pos);\n          if (trieMatch) {\n            const sourceTokens = current.slice(pos, pos + trieMatch.consumed);\n            if (result === null) result = current.slice(0, pos);\n            for (const rt of trieMatch.replacement) {\n              result.push(rt);\n            }\n            if (trieMatch.consumed > 1 && trieMatch.replacement.length === 1) {\n              recordSourceSpan(trieMatch.replacement[0], sourceTokens);\n              fusionHandler({\n                rule: trieMatch.ruleName ?? \"phrase-trie\",\n                sourceTokens,\n                fusedToken: trieMatch.replacement[0],\n              });\n            }\n            pos += trieMatch.consumed;\n            changed = true;\n            continue; // trie matched — skip other rules at this position (no need to set matched)\n          }\n        }\n\n        // Try, in priority order, only the rules whose declared shape admits\n        // this position. The index is a pure filter: bit order is priority\n        // order, and a rule it excludes would have returned null here anyway\n        // (see RuleIndex). `ignoreRuleIndex` restores the exhaustive scan so\n        // the two can be compared.\n        const candidates = useIndex\n          ? ruleIndex!.candidates(current, pos)\n          : null;\n        if (candidates !== null && isEmptyMask(candidates)) {\n          // Nothing can fire here. This is the common case in running prose,\n          // and reaching it costs a few array loads rather than one call per\n          // registered rule.\n          if (result !== null) result.push(current[pos]);\n          pos++;\n          continue;\n        }\n        for (const rule of this.rulesAt(candidates, current[pos].type)) {\n          const match = rule.match(current, pos);\n          if (match) {\n            // Collect source tokens for fusion tracking\n            const sourceTokens = current.slice(pos, pos + match.consumed);\n\n            // Insert replacement tokens into result\n            if (result === null) result = current.slice(0, pos);\n            for (const rt of match.replacement) {\n              result.push(rt);\n            }\n\n            // Track fusion events for diagnostics:\n            // - Multiple tokens → single token: classic fusion\n            // - Multiple tokens → fewer tokens: partial fusion\n            if (match.consumed > 1 && match.replacement.length === 1) {\n              recordSourceSpan(match.replacement[0], sourceTokens);\n              fusionHandler({\n                rule: rule.name,\n                sourceTokens,\n                fusedToken: match.replacement[0],\n              });\n            } else if (match.consumed > 1 && match.replacement.length < match.consumed) {\n              for (const rt of match.replacement) {\n                fusionHandler({\n                  rule: rule.name,\n                  sourceTokens,\n                  fusedToken: rt,\n                });\n              }\n            }\n\n            // Advance position past consumed tokens\n            pos += match.consumed;\n            changed = true;\n            matched = true;\n            break; // Rule matched — restart at new position with highest-priority rules\n          }\n        }\n\n        if (!matched) {\n          // No rule matched at this position, pass token through unchanged.\n          // Only copied when an earlier position already forced the array.\n          if (result !== null) result.push(current[pos]);\n          pos++;\n        }\n      }\n\n      // Nothing fired anywhere in this pass, so the stream is already its own\n      // normal form and `changed` is false; the loop is about to end.\n      if (result === null) break;\n      const passResult: Token[] = result;\n\n      // Safety: bail if token count explodes (runaway rule expansion)\n      if (passResult.length > maxTokens) {\n        // A raw Error here would bypass ThreeTierEvaluator's DAG-preservation\n        // enrichment on compile failure (it specifically checks for\n        // EngineError). Same reasoning as ExpressionEngineSafety.ts's\n        // complexity/length checks, which this mirrors.\n        throw ErrorFactory.validation(\n          \"NORMALIZED_TOKEN_LIMIT_EXCEEDED\",\n          `Normalized token count (${passResult.length}) exceeds safety limit (${maxTokens})`,\n          { tokenCount: passResult.length, maxTokens }\n        );\n      }\n\n      current = passResult;\n    }\n\n    return current;\n  }\n}\n\n//#endregion\n","//#region ─── Module Overview ───────────────────────────────────────────────────\n\n/**\n * PhraseTrie, optimized word-level trie for multi-word phrase fusion.\n *\n * ## Problem\n * The normalizer previously applied N separate `phraseFusionRule` instances,\n * each scanning forward from the current token position. For R phrase rules\n * and W average phrase length, this cost O(N × R × W) per pass.\n *\n * ## Solution\n * A single trie walk per position collapses all phrase rules into O(D)\n * where D ≤ longest phrase depth (typically ≤ 5 words). The trie tracks\n * the deepest terminal node reached, implementing longest-match-wins\n * without priority sorting.\n *\n * ## Optimizations\n * 1. **Set<string> quick-reject**, the `startWords` set contains the first\n *    word of every registered phrase. At each position, if the token's\n *    lowercase value isn't in the set, we bail in O(1) without touching\n *    the trie. ~80% of tokens (numbers, operators) hit this fast path.\n * 2. **Longest-match-wins**, the `matchAt()` walk continues past terminal\n *    nodes, tracking the deepest one. Shorter overlapping phrases (e.g.,\n *    \"power of\") don't need lower priority, the trie naturally prefers\n *    the longer match.\n * 3. **Map-based children**, `Map<string, TrieNode>` gives O(1) amortized\n *    child lookup per word, faster than array scanning for sparse branches.\n *\n * ## Package integration\n * Packages add phrases via {@link TokenNormalizer.addPhrase} (public API)\n * or the {@link IEnginePackage.phrases} declarative field. Each call to\n * `addPhrase()` inserts the phrase into this trie and updates `startWords`.\n *\n * @module PhraseTrie\n */\n\n//#endregion\n//#region ─── Imports ──────────────────────────────────────────────────────────\n\nimport type { Token } from \"@solve-js/lexer/Token\";\nimport type { NormalizerMatch } from \"./NormalizerRule\";\nimport { createFusedToken } from \"./TokenNormalizer\";\n\n//#endregion\n//#region ─── TrieNode ─────────────────────────────────────────────────────────\n\n/**\n * Internal trie node.\n *\n * Each node represents a matched word in a phrase. The path from root\n * to a node spells out a partial or complete phrase.\n */\ninterface TrieNode {\n\t/** Child nodes keyed by next word (all lowercase). */\n\tchildren: Map<string, TrieNode>;\n\t/**\n\t * If this node completes a phrase, the terminal metadata.\n\t * A node can be both terminal AND have children. This handles\n\t * overlapping phrases like \"power of\" and \"to the power of\".\n\t */\n\tterminal: TrieTerminal | null;\n}\n\n/** Metadata stored at terminal nodes for deferred token creation. */\ninterface TrieTerminal {\n\t/** The target token type after fusion (e.g., \"CARET\", \"TIMES_BY\"). */\n\ttokenType: string;\n\t/** The original phrase string (e.g., \"to the power of\"). */\n\tphrase: string;\n\t/** Number of tokens consumed by this phrase. */\n\tconsumed: number;\n}\n\n//#endregion\n//#region ─── PhraseTrie ─────────────────────────────────────────────────────\n\n/**\n * Word-level trie for single-pass multi-word phrase matching.\n *\n * @example\n * ```ts\n * const trie = new PhraseTrie();\n * trie.addPhrase(\"to the power of\", \"CARET\");\n * trie.addPhrase(\"power of\", \"CARET\");\n * trie.addPhrase(\"abyssal whip\", \"ITEM\");\n *\n * // At position 0 with tokens [\"to\",\"the\",\"power\",\"of\",\"3\"]\n * const match = trie.matchAt(tokens, 0);\n * // → { consumed: 4, replacement: [CARET(\"to the power of\")] }\n * ```\n */\nexport class PhraseTrie {\n\t/**\n\t * First words that can start any registered phrase (all lowercase).\n\t * O(1) quick-reject: if `tokens[pos].value.toLowerCase()` isn't here,\n\t * no phrase can match at this position.\n\t */\n\tprivate startWords = new Set<string>();\n\n\t/**\n\t * Root maps first word → child node.\n\t * Two-level root avoids an unnecessary intermediate TrieNode.\n\t */\n\tprivate root = new Map<string, TrieNode>();\n\n\t// ── Registration ──────────────────────────────────────────────────────\n\n\t/**\n\t * Register a phrase for fusion into a single compound token.\n\t *\n\t * @param phrase    - Multi-word phrase (e.g., \"to the power of\")\n\t * @param tokenType - Target token type after fusion (e.g., \"CARET\")\n\t */\n\taddPhrase(phrase: string, tokenType: string): void {\n\t\tconst words = phrase.toLowerCase().trim().split(/\\s+/);\n\t\tif (words.length === 0 || words[0] === \"\") return;\n\n\t\tthis.startWords.add(words[0]);\n\n\t\tconst firstWord = words[0];\n\t\tlet node: TrieNode;\n\n\t\tif (this.root.has(firstWord)) {\n\t\t\tnode = this.root.get(firstWord)!;\n\t\t} else {\n\t\t\tnode = { children: new Map(), terminal: null };\n\t\t\tthis.root.set(firstWord, node);\n\t\t}\n\n\t\t// Single-word phrase: terminal at root's child\n\t\tif (words.length === 1) {\n\t\t\tnode.terminal = { tokenType, phrase, consumed: 1 };\n\t\t\treturn;\n\t\t}\n\n\t\t// Walk/insert remaining words\n\t\tfor (let i = 1; i < words.length; i++) {\n\t\t\tconst word = words[i];\n\t\t\tif (!node.children.has(word)) {\n\t\t\t\tnode.children.set(word, { children: new Map(), terminal: null });\n\t\t\t}\n\t\t\tnode = node.children.get(word)!;\n\t\t}\n\n\t\tnode.terminal = { tokenType, phrase, consumed: words.length };\n\t}\n\n\t// ── Matching ──────────────────────────────────────────────────────────\n\n\t/**\n\t * Attempt to match a phrase starting at `pos` in the token stream.\n\t *\n\t * Walks the trie one token at a time, tracking the deepest terminal\n\t * node reached. Returns the longest match found, or `null` if no\n\t * phrase starts at this position.\n\t *\n\t * @param tokens - The current token stream\n\t * @param pos    - Position to attempt matching from\n\t * @returns The longest {@link NormalizerMatch}, or `null` on no match\n\t */\n\tmatchAt(tokens: Token[], pos: number): NormalizerMatch | null {\n\t\t// ── Bounds guard ──\n\t\tif (pos >= tokens.length) return null;\n\n\t\t// ── A tag token never takes part in phrase fusion (#197, #213) ──\n\t\t// A `#tag` is a typed token, not a bare word, so it must not start or\n\t\t// complete a phrase. The trie matches on written value alone, so without\n\t\t// this guard a tag whose name equals a phrase or a phrase-continuation\n\t\t// word (`1200 #assuming`, `total of #column`) is fused into that grammar\n\t\t// before the category-tag rules ever run, and the tag is lost.\n\t\t//\n\t\t// The guard also covers the fused aggregate tokens the tags package emits\n\t\t// (`TAG_SUM` / `TAG_COUNT` / `TAG_AVERAGE`), whose value is the tag NAME:\n\t\t// otherwise `total of #assuming` fuses correctly to TAG_SUM(\"assuming\"),\n\t\t// then the trie re-reads that value on the next pass and turns it back\n\t\t// into the finance ASSUMING keyword (#213). The whole `TAG` / `TAG_*`\n\t\t// namespace belongs to the tags package.\n\t\tconst startType = tokens[pos].type;\n\t\tif (startType === \"TAG\" || startType.startsWith(\"TAG_\")) return null;\n\n\t\t// ── O(1) quick-reject: first word not a phrase starter ──\n\t\tconst firstWord = tokens[pos].value.toLowerCase();\n\t\tif (!this.startWords.has(firstWord)) return null;\n\n\t\t// ── Walk trie, tracking deepest terminal ──\n\t\tlet node: TrieNode | undefined = this.root.get(firstWord);\n\t\tif (!node) return null;\n\n\t\tlet best: NormalizerMatch | null = null;\n\t\tlet depth = 1;\n\n\t\t// Check single-word phrase at first node\n\t\tif (node.terminal) {\n\t\t\tconst sourceTokens = tokens.slice(pos, pos + 1);\n\t\t\tbest = {\n\t\t\t\tconsumed: 1,\n\t\t\t\treplacement: [createFusedToken(node.terminal.tokenType, node.terminal.phrase, sourceTokens)],\n\t\t\t\truleName: node.terminal.phrase,\n\t\t\t};\n\t\t}\n\n\t\t// Walk deeper for multi-word phrases\n\t\tfor (let i = pos + 1; i < tokens.length && node?.children; i++) {\n\t\t\tconst contType = tokens[i].type;\n\t\t\tif (contType === \"TAG\" || contType.startsWith(\"TAG_\")) break; // a tag token can't continue a phrase (#197, #213)\n\t\t\tconst word = tokens[i].value.toLowerCase();\n\t\t\tnode = node.children.get(word);\n\t\t\tif (!node) break; // dead end\n\t\t\tdepth++;\n\n\t\t\tif (node.terminal) {\n\t\t\t\t// Deferred fused-token creation, only on deepest match found\n\t\t\t\tconst sourceTokens = tokens.slice(pos, pos + depth);\n\t\t\t\tbest = {\n\t\t\t\t\tconsumed: depth,\n\t\t\t\t\treplacement: [\n\t\t\t\t\t\tcreateFusedToken(node.terminal.tokenType, node.terminal.phrase, sourceTokens),\n\t\t\t\t\t],\n\t\t\t\t\truleName: node.terminal.phrase,\n\t\t\t\t};\n\t\t\t}\n\t\t}\n\n\t\treturn best;\n\t}\n\n\t// ── Introspection ─────────────────────────────────────────────────────\n\n\t/** Number of unique first words (not total phrases). */\n\tget size(): number {\n\t\treturn this.root.size;\n\t}\n\n\t/**\n\t * Return all registered phrases and their target token types.\n\t *\n\t * Used by diagnostic mode to expose the complete trie structure to the\n\t * playground's NormalizerTab for rendering ALL registered phrases\n\t * (not just the ones that matched in this evaluation).\n\t */\n\tgetAllPhrases(): Record<string, string> {\n\t\tconst result: Record<string, string> = {};\n\n\t\tconst collect = (node: TrieNode, path: string[]): void => {\n\t\t\tif (node.terminal) {\n\t\t\t\tresult[path.join(' ')] = node.terminal.tokenType;\n\t\t\t}\n\t\t\tfor (const [word, child] of node.children) {\n\t\t\t\tcollect(child, [...path, word]);\n\t\t\t}\n\t\t};\n\n\t\tfor (const [firstWord, node] of this.root) {\n\t\t\tcollect(node, [firstWord]);\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t/** Check if any phrase starts with this word (case-insensitive). */\n\tcanStart(word: string): boolean {\n\t\treturn this.startWords.has(word.toLowerCase());\n\t}\n}\n\n//#endregion\n","//#region ─── Module Overview ───────────────────────────────────────────────────\n\n/**\n * Built-in normalization rules for the {@link TokenNormalizer}.\n *\n * These rules handle common expression patterns that span multiple tokens.\n * Phrase fusion (e.g., \"to the power of\" → CARET) is handled by the\n * internal {@link PhraseTrie}. See {@link TokenNormalizer.addPhrase}.\n * This module only exports non-phrase rules like {@link implicitMultiplyRule}.\n *\n * @module BuiltinNormalizerRules\n */\n\n//#endregion\n//#region ─── Imports ──────────────────────────────────────────────────────────\n\nimport type { Token } from \"@solve-js/lexer/Token\";\nimport { tokenTypeId } from \"@solve-js/lexer/Token\";\nimport { LexerToken } from \"@solve-js/lexer/ExpressionLexer\";\nimport type { NormalizerRule, NormalizerMatch } from \"./NormalizerRule\";\n\n//#endregion\n//#region ─── PHRASE_START_WORDS, Implicit Multiply Guard ─────────────────────\n\n/**\n * Words that can start multi-word phrases, hardcoded fallback.\n *\n * This is ONLY used as the default fallback in {@link implicitMultiplyRule}\n * when no `canStart` predicate is provided. In the recommended pattern,\n * the {@link PhraseTrie}'s live `canStart()` set is passed instead, keeping\n * the guard in sync with package-registered phrases.\n *\n * @see {@link TokenNormalizer.canStartPhrase}\n */\n/**\n * Words that introduce a rate denominator when a unit follows.\n *\n * Kept next to the implicit-multiplication rule because that is the only\n * thing they change here; the rate itself is built in the uom package.\n */\nconst RATE_DENOMINATOR_WORDS = new Set([\"per\", \"a\", \"an\", \"each\", \"every\"]);\n\nconst PHRASE_START_WORDS = new Set([\n  \"to\", \"power\", \"increase\", \"decrease\", \"times\", \"multiply\", \"divide\", \"by\",\n]);\n\n//#endregion\n//#region ─── implicitMultiplyRule, Implicit Operator Insertion ────────────────\n\n/**\n * Creates a normalization rule that inserts an implicit multiplication operator\n * between adjacent tokens where multiplication is implied.\n *\n * ## When it fires\n * Inserts a STAR token between:\n * - `NUMBER IDENT` (e.g., \"2 x\" → \"2 * x\")\n * - `RPAREN IDENT` (e.g., \"(x+1)y\" → \"(x+1) * y\")\n * - `NUMBER LPAREN` (e.g., \"2(x+1)\" → \"2 * (x+1)\")\n * - `NUMBER PI` / `NUMBER E` (e.g., \"2π\" → \"2 * π\")\n *\n * ## When it doesn't fire\n * - When the following identifier starts a multi-word phrase\n *   (checked against {@link PHRASE_START_WORDS})\n * - When the following token is not an identifier or parenthesized expression\n *\n * ## Priority\n * Default priority is 50, below phrase fusion so phrases match first.\n *\n * @param priority - Rule priority (default 50)\n * @returns A {@link NormalizerRule} that inserts implicit multiply operators\n */\nexport function implicitMultiplyRule(\n\tpriority: number = 50,\n\tcanStart?: (word: string) => boolean\n): NormalizerRule {\n\tconst phraseGuard = canStart ?? ((word: string) => PHRASE_START_WORDS.has(word.toLowerCase()));\n\n\treturn {\n    name: \"implicit:multiply\",\n    priority,\n    // Both slots are exactly the `triggers` test below, which is the whole\n    // condition: a value or closing bracket, then something a multiplication\n    // could apply to.\n    shape: [\n      { types: [\"NUMBER\", \"RPAREN\"] },\n      { types: [\"IDENT\", \"LPAREN\", \"PI\", \"E\"] },\n    ],\n    match(tokens: Token[], pos: number): NormalizerMatch | null {\n      // ── Need at least one token after the current position ──\n      if (pos + 1 >= tokens.length) return null;\n\n      const t = tokens[pos];\n      const next = tokens[pos + 1];\n\n      // ── Check trigger conditions ──\n      // Ordered FIRST deliberately. The two guards below only ever suppress a\n      // match, so testing them after the trigger cannot change any result, and\n      // the first of them allocates a lower-cased copy of the next token's\n      // value. Running that ahead of a pair of type comparisons meant every\n      // position in the document paid a string allocation and a set lookup to\n      // reach a test that rejects nearly all of them.\n      const triggers =\n        (t.type === \"NUMBER\" || t.type === \"RPAREN\") &&\n        (next.type === \"IDENT\" || next.type === \"LPAREN\" || next.type === \"PI\" || next.type === \"E\");\n\n      if (!triggers) return null;\n\n      // ── Guard: suppress if the next identifier starts a phrase ──\n      // Uses the trie's canStart when available, falls back to hardcoded set.\n      // This prevents \"2 power of 3\" from becoming \"2 * power of 3\".\n      const nextValue = next.value.toLowerCase();\n      if (phraseGuard(nextValue)) return null;\n\n      // ── Guard: a rate denominator, not a multiplication ──\n      // \"99 per week\" is ninety-nine a week, not ninety-nine times something\n      // called per. The trie guard above cannot cover this, because these are\n      // not registered phrases; they are recognised by the uom package's\n      // bare-denominator rule, which runs after this one and then finds its\n      // fused token stranded in operand position. The slash spelling never had\n      // the problem, which is what made it hard to see.\n      if (RATE_DENOMINATOR_WORDS.has(nextValue) && tokens[pos + 2]?.type === \"UNIT\") return null;\n\n      // ── Insert a STAR token at the next token's position ──\n      const starToken = new LexerToken(\n        \"STAR\", tokenTypeId(\"STAR\"), \"*\", \"*\",\n        next.offset, 0, next.line, next.col,\n      );\n\n      // consumed = 1: only the current token is replaced with [current, STAR]\n      // The next token is NOT consumed, it stays for the next iteration\n      return { consumed: 1, replacement: [t, starToken] };\n    },\n  };\n}\n\n//#endregion\n//#region ─── isInsideRangeContext, Bracket/Call-Paren Context Guard ───────────\n\n/**\n * Whether token `pos` sits inside a context where a bare `NUMBER:NUMBER`\n * sequence means a Range, not a clock-time/laptime/video-timecode literal:\n * a matrix literal/index/slice (`[1,2,3]`, `a[0:3]`), OR a `map`/`reduce`/\n * `sum`/`prod` call's own argument-list parens (`map(f, 0:3)`, these\n * accept a bare Range argument directly, per the Calca spec's own\n * example). Scans backward from `pos` over the CURRENT pass's token array,\n * tracking `[`/`(` nesting depth, the same \"positional guard via\n * backward scan\" idiom already used elsewhere in this normalizer layer\n * (e.g. `LineRefNormalizerRule`'s previous-token check), generalized to\n * depth-tracking. An `LBRACKET` is unconditionally a range-safe opener; an\n * `LPAREN` is range-safe ONLY when immediately preceded by MAP/REDUCE/\n * SUM_FN/PROD_FN, an ordinary grouping/function-call paren is NOT, so\n * `(9:00) + 5` still means a clock time, not a range.\n *\n * Needed because the clock-time/laptime/video-timecode rules each match a\n * bare `NUMBER COLON NUMBER...` shape with ZERO context-awareness, a real\n * collision discovered when adding Range support, since e.g. \"0:3\" is\n * valid input to BOTH features. These contexts have no legitimate use for\n * a clock-time/laptime/timecode literal, so the carve-out costs the time\n * features nothing.\n *\n * IMPORTANT cross-pass-timing gotcha (a real bug found and fixed here,\n * not a hypothetical): the `LPAREN`-opener check deliberately tests the\n * RAW word text (`prev.value.toLowerCase()`), not `prev.type ===\n * \"MAP\"/\"REDUCE\"/...`. The normalizer's multi-pass loop hands every rule\n * the SAME frozen `tokens` snapshot for an entire pass, a rule scanning\n * a LATER position in that pass cannot see a fusion `mapReduceCallNormalizerRule`\n * performs at an EARLIER position in that SAME pass (fusion results only\n * become visible to other rules starting the NEXT pass). Checking the\n * fused token type here would miss exactly the case that matters most\n * `map(f, 0:3)` on its very first normalization pass, silently letting\n * `0:3` fuse into a clock time before `map(`'s own fusion ever lands.\n * Testing the raw word is immune to this: it's true from the very first\n * pass, regardless of whether `mapReduceCallNormalizerRule` has run yet.\n * (`LBRACKET` above has no equivalent issue, it's a genuine lexer token\n * from the start, never itself the product of a fusion.)\n */\nexport function isInsideRangeContext(tokens: Token[], pos: number): boolean {\n  const safeStack: boolean[] = [];\n  for (let i = 0; i < pos; i++) {\n    const t = tokens[i];\n    if (t.type === \"LBRACKET\") {\n      safeStack.push(true);\n    } else if (t.type === \"LPAREN\") {\n      const prev = tokens[i - 1];\n      const opensMapReduceCall = !!prev && (\n        prev.type === \"MAP\" || prev.type === \"REDUCE\" || prev.type === \"SUM_FN\" || prev.type === \"PROD_FN\" ||\n        (prev.type === \"IDENT\" && (prev.value.toLowerCase() === \"map\" || prev.value.toLowerCase() === \"reduce\" || prev.value.toLowerCase() === \"sum\" || prev.value.toLowerCase() === \"prod\"))\n      );\n      safeStack.push(opensMapReduceCall);\n    } else if (t.type === \"RBRACKET\" || t.type === \"RPAREN\") {\n      safeStack.pop();\n    }\n  }\n  return safeStack.length > 0 && safeStack[safeStack.length - 1];\n}\n\n//#endregion\n//#region ─── createBuiltinNormalizerRules, All Built-in Rules ─────────────────\n\n/**\n * Creates built-in non-phrase normalization rules.\n *\n * Returns implicit multiply insertion (priority 50).\n *\n * **Prefer** calling {@link implicitMultiplyRule} directly with a\n * `canStart` predicate wired to the normalizer's phrase trie:\n * ```ts\n * normalizer.register(implicitMultiplyRule(50, (w) => normalizer.canStartPhrase(w)));\n * ```\n * Without the predicate, this function falls back to a hardcoded\n * {@link PHRASE_START_WORDS} set that won't reflect package-registered phrases.\n *\n * @returns An array of {@link NormalizerRule} instances ready for registration\n */\nexport function createBuiltinNormalizerRules(): NormalizerRule[] {\n  return [\n    // ── Implicit operator insertion (priority 50) ──\n    implicitMultiplyRule(),\n  ];\n}\n\n/**\n * Built-in phrase → tokenType mappings.\n *\n * These are registered into the engine's {@link PhraseTrie} during\n * construction. Tests that create a standalone {@link TokenNormalizer}\n * should register these via {@link TokenNormalizer.addPhrase}. The table\n * itself lives in `lexer/BuiltinPhrases.ts`, shared with the lexer's token\n * lookup, and is re-exported here so existing imports keep working.\n */\nexport { BUILTIN_PHRASES } from \"@solve-js/lexer/BuiltinPhrases\";\n\n//#endregion\n"]}