solve-engine 2.30.0 → 2.31.1

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,GAAAA,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,GAA+B,CAClD,GAAI,CACH,IAAMgE,IAAWjC,CAAAA,CAAgBC,GAAAA,CAAWhC,CAAAA,CAAQ,QAAQ,EAC5D0C,CAAAA,CAAS,IAAIuB,CAAAA,CAAiB,CAC7B,OAAQjE,CAAAA,CAAQ,UAAA,EAAc,IAAA,CAC9B,WAAA,CAAaA,EAAQ,WAAA,EAAe,CAAA,CAAA,CACpC,OAAQA,CAAAA,CAAQ,MAAA,CAChB,SAAAgE,GAAAA,CACA,QAAA,CAAUlF,CAAAA,CAAQ,QACnB,CAAC,CAAA,CAID6D,CAAAA,CAAa7D,CAAAA,CAAQ,QAAA,CAClB,CAAE,GAAIkB,CAAAA,CAAQ,UAAA,EAAckE,CAAAA,CAA8B,SAAUpF,CAAAA,CAAQ,QAAS,EACrFkB,CAAAA,CAAQ,UAAA,CAIX4D,EAAelB,CAAM,CAAA,CACrBM,CAAAA,CAAK,CAAE,KAAM,OAAA,CAAS,EAAA,CAAIhD,CAAAA,CAAQ,EAAG,CAAC,EACvC,CAAA,MAASP,CAAAA,CAAO,CAIfwD,EAAKjD,CAAAA,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":"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"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "solve-engine",
-  "version": "2.30.0",
+  "version": "2.31.1",
   "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",
@@ -198,6 +198,16 @@
         "default": "./dist/worker.cjs"
       }
     },
+    "./engine-worker": {
+      "import": {
+        "types": "./dist/engine.worker.d.ts",
+        "default": "./dist/engine.worker.js"
+      },
+      "require": {
+        "types": "./dist/engine.worker.d.cts",
+        "default": "./dist/engine.worker.cjs"
+      }
+    },
     "./testing": {
       "import": {
         "types": "./dist/testing.d.ts",

package/dist/chunk-4CNYGIND.js

@@ -1,2 +0,0 @@
-import {a,b as b$1,f as f$1,e,d,c as c$1}from'./chunk-PRSXXDTA.js';var y=new Map(Object.entries(a)),I=new Map(Object.entries(b$1));function c(n){return y.get(n)}function b(n,e,t){let r=y.get(e);if(r===void 0)throw new RangeError(`${e} is not a valid unit`);let i=y.get(t);if(i===void 0)throw new RangeError(`${t} is not a valid unit`);return M(n,e,t,r,i)}function M(n,e,t,r,i){let s=r,o=i;if(s[0]!==o[0])throw new RangeError(`Cannot convert between different measures: ${e} and ${t}`);let u=s[1],a=o[1],l=I.get(e),g=I.get(t);return l!==void 0?g!==void 0?(n+l)*(u/a)-g:(n+l)*(u/a):g!==void 0?n*(u/a)-g:n*(u/a)}function O(n,e){let t=y.get(e);if(t===void 0)throw new RangeError(`${e} is not a valid unit`);let r=c$1[t[0]],i=r[0][0],s=i,o=b(n,e,i),u=o<0?-o:o;for(let a=0;a<r.length;a++){let l=r[a];if(u>=l[1])s=l[0];else break}return {quantity:b(n,e,s),unit:s}}var k=new Set(["workday","workdays"]),S=7/5;function m(n){return typeof n=="string"&&k.has(n)}function P(n){return n}function f(n){if(m(n))return f("day");let e$1=f$1[n];if(e$1)return e$1.measure;let t=c(n);if(t!==void 0)return e[t[0]]}function Y(n,e){if(n===e)return  true;if(m(n)||m(e)){let o=f(n),u=f(e);return !!o&&o===u}let t=c(n),r=c(e);if(t!==void 0&&r!==void 0)return t[0]===r[0];let i=f$1[n],s=f$1[e];return i!==void 0&&s!==void 0?i.measure===s.measure:U(n,e)||U(e,n)}function U(n,e$1){let t=f$1[n];if(t===void 0)return  false;let r=c(e$1);return r===void 0?false:e[r[0]]===t.measure}function p(n,e,t){if(e===t)return n;let r=c(e),i=c(t);if(r!==void 0&&i!==void 0)return M(n,e,t,r,i);if(m(e)&&m(t))return n;if(m(e)){let u=n*S;return t==="day"?u:p(u,"day",t)}if(m(t))return (e==="day"?n:p(n,e,"day"))/S;let s=f$1[e],o=f$1[t];return s!==void 0&&o!==void 0?n*(s.toBase/o.toBase):s!==void 0&&U(e,t)?b(n*s.toBase,A(t),t):o!==void 0&&U(t,e)?b(n,e,A(e))/o.toBase:b(n,e,t)}function A(n){let e=c(n);if(e===void 0)return n;for(let t of Object.keys(a)){let r=a[t];if(r[0]===e[0]&&r[1]===1)return t}return n}function j(n){let e=n,t=c(e);if(t===void 0)return [];let r=d[t[0]];return r?r.filter(i=>i!==e):[]}function W(n){return m(n)||f$1[n]?true:c(n)!==void 0}function Q(n,e){let t=e;try{let r=O(n,t);return {value:r.quantity,unit:r.unit}}catch{return {value:n,unit:t}}}var D={mpg:{numerator:"km",denominator:"l",factor:1.609344/3.785411784},kmpl:{numerator:"km",denominator:"l",factor:1},l100km:{numerator:"l",denominator:"km",factor:.01}};function N(n,e){let t=D[e];if(t!==void 0)return {value:n*t.factor,numerator:t.numerator,denominator:t.denominator};let r=e.indexOf("/");if(r>=0)return {value:n,numerator:e.slice(0,r),denominator:e.slice(r+1)};let i=f$1[e];return i!==void 0&&i.measure==="speed"?{value:n*i.toBase,numerator:"m",denominator:"s"}:i!==void 0&&i.measure==="dataRate"?{value:n*i.toBase,numerator:"b",denominator:"s"}:null}function q(n){if(n===void 0)return  false;let e=N(1,n);if(e===null||f(e.denominator)!=="time")return  false;let t=f(e.numerator);return t==="length"||t==="data"}function X(n,e,t,r){let i=N(t,r);if(i===null||f(i.denominator)!=="time"||f(e)!==f(i.numerator))return null;let o=p(n,e,i.numerator)/i.value;return p(o,i.denominator,"s")}function R(n,e){if(n===e)return 1;if(n===""||e==="")return null;let t=f(n),r=f(e);return t===void 0||r===void 0||t!==r?null:p(1,n,e)}function z(n,e,t){let r=N(n,e);if(r===null)return null;let i,s,o,u=D[t],a=t.indexOf("/");if(u!==void 0)i=u.numerator,s=u.denominator,o=u.factor;else if(a>=0)i=t.slice(0,a),s=t.slice(a+1),o=1;else {let x=f$1[t];if(x===void 0||x.measure!=="speed")return null;i="m",s="s",o=x.toBase;}let l=R(r.numerator,i),g=R(r.denominator,s);if(l!==null&&g!==null)return r.value*l/g/o;let _=R(r.denominator,i),v=R(r.numerator,s);return _!==null&&v!==null&&r.value!==0?_/v/r.value/o:null}export{m as a,P as b,f as c,Y as d,p as e,j as f,W as g,Q as h,q as i,X as j,z as k};//# sourceMappingURL=chunk-4CNYGIND.js.map
-//# sourceMappingURL=chunk-4CNYGIND.js.map

package/dist/chunk-4CNYGIND.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/uom/UnitConversion.ts","../src/uom/UomConverter.ts"],"names":["UNIT_LOOKUP","UNIT_TABLE","DIFFERENCE_LOOKUP","UNIT_DIFFERENCES","lookupUnit","unit","convertRaw","quantity","from","to","parsedFrom","parsedTo","convertResolved","fromEntry","toEntry","fromRatio","toRatio","fromDifference","toDifference","convertToBestMetric","best","BEST_UNITS_METRIC","smallestUnit","bestUnit","baseQuantity","absQuantity","i","bestEntry","WORKDAY_UNIT_NAMES","WORKDAY_TO_DAY_FACTOR","isWorkdayUnit","resolveUnit","getMeasure","extended","EXTENDED_UNITS","entry","MEASURE_KIND_NAMES","canConvert","fromMeasure","toMeasure","fromExtended","toExtended","bridgesToBaseMeasure","extendedUnit","baseUnit","base","convertUnit","value","days","fExt","tExt","baseUnitFor","symbol","candidate","getConvertiblePossibilities","resolved","symbols","MEASURE_SYMBOLS","s","isConvertibleUnit","getBestUnit","u","result","FUEL_RATE_UNITS","expandUnitToRate","fuel","slash","ext","isPhysicalTimeRate","rate","numeratorMeasure","quantityAtRateSeconds","quantityUnit","rateValue","rateUnit","timeInDenominator","rateAxisFactor","convertRate","source","targetNumerator","targetDenominator","targetScale","fuelTarget","numeratorFactor","denominatorFactor","crossNumerator","crossDenominator"],"mappings":"mEAmCA,IAAMA,CAAAA,CAA8C,IAAI,GAAA,CAAI,MAAA,CAAO,OAAA,CAAQC,CAAU,CAAC,CAAA,CAShFC,CAAAA,CAAiD,IAAI,GAAA,CAAI,MAAA,CAAO,OAAA,CAAQC,GAAgB,CAAC,CAAA,CAgBxF,SAASC,CAAAA,CAAWC,CAAAA,CAAqC,CAC9D,OAAOL,CAAAA,CAAY,GAAA,CAAIK,CAAI,CAC7B,CAWO,SAASC,CAAAA,CAAWC,CAAAA,CAAkBC,CAAAA,CAAcC,CAAAA,CAAoB,CAC7E,IAAMC,CAAAA,CAAaV,CAAAA,CAAY,GAAA,CAAIQ,CAAI,CAAA,CACvC,GAAIE,CAAAA,GAAe,MAAA,CACjB,MAAM,IAAI,UAAA,CAAW,CAAA,EAAGF,CAAI,CAAA,oBAAA,CAAsB,CAAA,CAGpD,IAAMG,CAAAA,CAAWX,CAAAA,CAAY,GAAA,CAAIS,CAAE,CAAA,CACnC,GAAIE,CAAAA,GAAa,MAAA,CACf,MAAM,IAAI,UAAA,CAAW,GAAGF,CAAE,CAAA,oBAAA,CAAsB,CAAA,CAGlD,OAAOG,CAAAA,CAAgBL,CAAAA,CAAUC,CAAAA,CAAMC,CAAAA,CAAIC,CAAAA,CAAYC,CAAQ,CACjE,CAWO,SAASC,CAAAA,CACdL,CAAAA,CACAC,CAAAA,CACAC,CAAAA,CACAI,CAAAA,CACAC,CAAAA,CACQ,CACR,IAAMJ,CAAAA,CAAaG,CAAAA,CACbF,CAAAA,CAAWG,CAAAA,CAEjB,GAAIJ,CAAAA,CAAW,CAAC,CAAA,GAAMC,CAAAA,CAAS,CAAC,CAAA,CAW9B,MAAM,IAAI,UAAA,CAAW,CAAA,2CAAA,EAA8CH,CAAI,CAAA,KAAA,EAAQC,CAAE,CAAA,CAAE,CAAA,CAGrF,IAAMM,CAAAA,CAAYL,CAAAA,CAAW,CAAC,CAAA,CACxBM,CAAAA,CAAUL,CAAAA,CAAS,CAAC,CAAA,CAKpBM,CAAAA,CAAiBf,CAAAA,CAAkB,GAAA,CAAIM,CAAI,CAAA,CAC3CU,CAAAA,CAAehB,CAAAA,CAAkB,GAAA,CAAIO,CAAE,CAAA,CAK7C,OAAIQ,CAAAA,GAAmB,MAAA,CACjBC,CAAAA,GAAiB,MAAA,CAAA,CACXX,EAAWU,CAAAA,GAAmBF,CAAAA,CAAYC,CAAAA,CAAAA,CAAWE,CAAAA,CAAAA,CAEvDX,CAAAA,CAAWU,CAAAA,GAAmBF,CAAAA,CAAYC,CAAAA,CAAAA,CAGhDE,CAAAA,GAAiB,MAAA,CACZX,CAAAA,EAAYQ,CAAAA,CAAYC,CAAAA,CAAAA,CAAWE,CAAAA,CAGrCX,CAAAA,EAAYQ,CAAAA,CAAYC,CAAAA,CACjC,CAUO,SAASG,CAAAA,CACdZ,CAAAA,CACAC,CAAAA,CACoC,CACpC,IAAME,CAAAA,CAAaV,CAAAA,CAAY,GAAA,CAAIQ,CAAI,CAAA,CACvC,GAAIE,CAAAA,GAAe,MAAA,CACjB,MAAM,IAAI,UAAA,CAAW,CAAA,EAAGF,CAAI,CAAA,oBAAA,CAAsB,CAAA,CAGpD,IAAMY,CAAAA,CAAOC,GAAAA,CAAkBX,CAAAA,CAAW,CAAC,CAAC,CAAA,CACtCY,CAAAA,CAAeF,CAAAA,CAAK,CAAC,CAAA,CAAE,CAAC,CAAA,CAC1BG,CAAAA,CAAWD,CAAAA,CAETE,CAAAA,CAAelB,CAAAA,CAAWC,CAAAA,CAAUC,CAAAA,CAAMc,CAAY,CAAA,CACtDG,CAAAA,CAAcD,CAAAA,CAAe,CAAA,CAAI,CAACA,CAAAA,CAAeA,EAKvD,IAAA,IAASE,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIN,CAAAA,CAAK,MAAA,CAAQM,CAAAA,EAAAA,CAAK,CACpC,IAAMC,CAAAA,CAAYP,CAAAA,CAAKM,CAAC,CAAA,CACxB,GAAID,CAAAA,EAAeE,CAAAA,CAAU,CAAC,CAAA,CAC5BJ,CAAAA,CAAWI,CAAAA,CAAU,CAAC,CAAA,CAAA,KAEtB,KAEJ,CAEA,OAAO,CAAE,QAAA,CAAUrB,CAAAA,CAAWC,CAAAA,CAAUC,CAAAA,CAAMe,CAAQ,CAAA,CAAG,KAAMA,CAAS,CAC1E,CC/IA,IAAMK,CAAAA,CAAqB,IAAI,GAAA,CAAI,CAAC,SAAA,CAAW,UAAU,CAAC,CAAA,CACpDC,CAAAA,CAAwB,CAAA,CAAI,CAAA,CAG3B,SAASC,CAAAA,CAAczB,CAAAA,CAA0C,CACtE,OAAO,OAAOA,CAAAA,EAAS,QAAA,EAAYuB,CAAAA,CAAmB,GAAA,CAAIvB,CAAI,CAChE,CAqBO,SAAS0B,CAAAA,CAAY1B,CAAAA,CAAsB,CAChD,OAAOA,CACT,CAcO,SAAS2B,CAAAA,CAAW3B,CAAAA,CAAkC,CAI3D,GAAIyB,CAAAA,CAAczB,CAAI,CAAA,CAAG,OAAO2B,CAAAA,CAAW,KAAK,CAAA,CAIhD,IAAMC,GAAAA,CAAWC,GAAAA,CAAe7B,CAAI,CAAA,CACpC,GAAI4B,GAAAA,CAAU,OAAOA,GAAAA,CAAS,OAAA,CAE9B,IAAME,CAAAA,CAAQ/B,CAAAA,CAAWC,CAAI,CAAA,CAC7B,GAAI8B,CAAAA,GAAU,MAAA,CAEd,OAAOC,CAAAA,CAAmBD,CAAAA,CAAM,CAAC,CAAC,CACpC,CAOO,SAASE,CAAAA,CAAW7B,CAAAA,CAAcC,CAAAA,CAAqB,CAC5D,GAAID,CAAAA,GAASC,CAAAA,CAAI,OAAO,KAAA,CACxB,GAAIqB,CAAAA,CAActB,CAAI,CAAA,EAAKsB,CAAAA,CAAcrB,CAAE,CAAA,CAAG,CAC5C,IAAM6B,CAAAA,CAAcN,CAAAA,CAAWxB,CAAI,CAAA,CAC7B+B,CAAAA,CAAYP,CAAAA,CAAWvB,CAAE,EAC/B,OAAO,CAAC,CAAC6B,CAAAA,EAAeA,CAAAA,GAAgBC,CAC1C,CAKA,IAAM1B,CAAAA,CAAYT,CAAAA,CAAWI,CAAI,CAAA,CAC3BM,CAAAA,CAAUV,CAAAA,CAAWK,CAAE,CAAA,CAC7B,GAAII,CAAAA,GAAc,MAAA,EAAaC,CAAAA,GAAY,MAAA,CACzC,OAAOD,CAAAA,CAAU,CAAC,CAAA,GAAMC,CAAAA,CAAQ,CAAC,CAAA,CAKnC,IAAM0B,CAAAA,CAAeN,GAAAA,CAAe1B,CAAI,EAClCiC,CAAAA,CAAaP,GAAAA,CAAezB,CAAE,CAAA,CACpC,OAAI+B,CAAAA,GAAiB,MAAA,EAAaC,CAAAA,GAAe,MAAA,CACxCD,CAAAA,CAAa,OAAA,GAAYC,CAAAA,CAAW,OAAA,CAQtCC,CAAAA,CAAqBlC,CAAAA,CAAMC,CAAE,CAAA,EAAKiC,CAAAA,CAAqBjC,CAAAA,CAAID,CAAI,CACxE,CAgBA,SAASkC,CAAAA,CAAqBC,CAAAA,CAAsBC,GAAAA,CAA2B,CAC7E,IAAMX,CAAAA,CAAWC,GAAAA,CAAeS,CAAY,CAAA,CAC5C,GAAIV,CAAAA,GAAa,MAAA,CAAW,OAAO,MAAA,CAEnC,IAAMY,CAAAA,CAAOzC,CAAAA,CAAuBwC,GAAS,CAAA,CAC7C,OAAIC,CAAAA,GAAS,MAAA,CAAkB,KAAA,CAExBT,CAAAA,CAAmBS,CAAAA,CAAK,CAAC,CAAC,CAAA,GAAMZ,CAAAA,CAAS,OAClD,CAqBO,SAASa,CAAAA,CAAYC,CAAAA,CAAevC,CAAAA,CAAcC,CAAAA,CAAoB,CAC3E,GAAID,CAAAA,GAASC,CAAAA,CAAI,OAAOsC,CAAAA,CAQxB,IAAMlC,CAAAA,CAAYT,CAAAA,CAAWI,CAAI,CAAA,CAC3BM,CAAAA,CAAUV,CAAAA,CAAWK,CAAE,CAAA,CAC7B,GAAII,CAAAA,GAAc,MAAA,EAAaC,CAAAA,GAAY,MAAA,CACzC,OAAOF,CAAAA,CAAgBmC,CAAAA,CAAOvC,CAAAA,CAAMC,CAAAA,CAAII,CAAAA,CAAWC,CAAO,CAAA,CAK5D,GAAIgB,CAAAA,CAActB,CAAI,CAAA,EAAKsB,CAAAA,CAAcrB,CAAE,CAAA,CAAG,OAAOsC,CAAAA,CACrD,GAAIjB,CAAAA,CAActB,CAAI,CAAA,CAAG,CACvB,IAAMwC,CAAAA,CAAOD,CAAAA,CAAQlB,CAAAA,CACrB,OAAOpB,CAAAA,GAAO,KAAA,CAAQuC,CAAAA,CAAOF,CAAAA,CAAYE,CAAAA,CAAM,KAAA,CAAOvC,CAAE,CAC1D,CACA,GAAIqB,CAAAA,CAAcrB,CAAE,CAAA,CAElB,OAAA,CADaD,CAAAA,GAAS,KAAA,CAAQuC,CAAAA,CAAQD,CAAAA,CAAYC,CAAAA,CAAOvC,CAAAA,CAAM,KAAK,CAAA,EACtDqB,CAAAA,CAQhB,IAAMoB,CAAAA,CAAOf,IAAe1B,CAAI,CAAA,CAC1B0C,CAAAA,CAAOhB,GAAAA,CAAezB,CAAE,CAAA,CAC9B,OAAIwC,CAAAA,GAAS,MAAA,EAAaC,CAAAA,GAAS,MAAA,CAC1BH,CAAAA,EAASE,CAAAA,CAAK,MAAA,CAASC,CAAAA,CAAK,MAAA,CAAA,CAOjCD,CAAAA,GAAS,MAAA,EAAaP,CAAAA,CAAqBlC,CAAAA,CAAMC,CAAE,CAAA,CAC9CH,CAAAA,CAAWyC,CAAAA,CAAQE,CAAAA,CAAK,MAAA,CAAQE,CAAAA,CAAY1C,CAAE,CAAA,CAAGA,CAAE,CAAA,CAExDyC,CAAAA,GAAS,QAAaR,CAAAA,CAAqBjC,CAAAA,CAAID,CAAI,CAAA,CAC9CF,CAAAA,CAAWyC,CAAAA,CAAOvC,CAAAA,CAAM2C,CAAAA,CAAY3C,CAAI,CAAC,CAAA,CAAI0C,CAAAA,CAAK,MAAA,CAKpD5C,CAAAA,CAAWyC,CAAAA,CAAOvC,CAAAA,CAAMC,CAAE,CACnC,CASA,SAAS0C,CAAAA,CAAY9C,CAAAA,CAAsB,CACzC,IAAM8B,CAAAA,CAAQ/B,CAAAA,CAAuBC,CAAK,CAAA,CAC1C,GAAI8B,CAAAA,GAAU,MAAA,CAAW,OAAO9B,CAAAA,CAEhC,IAAA,IAAW+C,CAAAA,IAAU,MAAA,CAAO,IAAA,CAAKnD,CAAU,CAAA,CAAG,CAC5C,IAAMoD,CAAAA,CAAYpD,CAAAA,CAAWmD,CAAM,CAAA,CACnC,GAAIC,CAAAA,CAAU,CAAC,CAAA,GAAMlB,CAAAA,CAAM,CAAC,CAAA,EAAKkB,CAAAA,CAAU,CAAC,CAAA,GAAM,CAAA,CAAG,OAAOD,CAC9D,CACA,OAAO/C,CACT,CAeO,SAASiD,CAAAA,CAA4BjD,EAAwB,CAClE,IAAMkD,CAAAA,CAAuBlD,CAAAA,CACvB8B,CAAAA,CAAQ/B,CAAAA,CAAWmD,CAAQ,CAAA,CACjC,GAAIpB,CAAAA,GAAU,MAAA,CAAW,OAAO,EAAC,CACjC,IAAMqB,CAAAA,CAAUC,CAAAA,CAAgBtB,CAAAA,CAAM,CAAC,CAAC,CAAA,CACxC,OAAKqB,CAAAA,CACEA,CAAAA,CAAQ,MAAA,CAAQE,CAAAA,EAAMA,CAAAA,GAAMH,CAAQ,CAAA,CADtB,EAEvB,CAGO,SAASI,CAAAA,CAAkBtD,CAAAA,CAAuB,CAEvD,OADIyB,CAAAA,CAAczB,CAAI,CAAA,EAClB6B,GAAAA,CAAe7B,CAAI,CAAA,CAAU,IAAA,CAC1BD,CAAAA,CAAuBC,CAAK,CAAA,GAAM,MAC3C,CAWO,SAASuD,CAAAA,CAAYb,CAAAA,CAAe1C,CAAAA,CAA+C,CACxF,IAAMwD,CAAAA,CAAgBxD,CAAAA,CACtB,GAAI,CACF,IAAMyD,CAAAA,CAAS3C,CAAAA,CAAoB4B,CAAAA,CAAOc,CAAC,CAAA,CAC3C,OAAO,CAAE,KAAA,CAAOC,CAAAA,CAAO,QAAA,CAAU,IAAA,CAAMA,CAAAA,CAAO,IAAK,CACrD,CAAA,KAAQ,CACN,OAAO,CAAE,KAAA,CAAAf,CAAAA,CAAO,IAAA,CAAMc,CAAE,CAC1B,CACF,CAoCA,IAAME,CAAAA,CAA8F,CAClG,GAAA,CAAK,CAAE,SAAA,CAAW,IAAA,CAAM,WAAA,CAAa,GAAA,CAAK,MAAA,CAAQ,QAAA,CAAW,WAAY,CAAA,CACzE,KAAM,CAAE,SAAA,CAAW,IAAA,CAAM,WAAA,CAAa,GAAA,CAAK,MAAA,CAAQ,CAAE,CAAA,CACrD,MAAA,CAAQ,CAAE,SAAA,CAAW,GAAA,CAAK,WAAA,CAAa,IAAA,CAAM,MAAA,CAAQ,GAAK,CAC5D,CAAA,CAEA,SAASC,CAAAA,CAAiBjB,CAAAA,CAAe1C,CAAAA,CAA+B,CACtE,IAAM4D,CAAAA,CAAOF,CAAAA,CAAgB1D,CAAI,CAAA,CACjC,GAAI4D,CAAAA,GAAS,MAAA,CACX,OAAO,CAAE,KAAA,CAAOlB,CAAAA,CAAQkB,CAAAA,CAAK,MAAA,CAAQ,SAAA,CAAWA,CAAAA,CAAK,SAAA,CAAW,WAAA,CAAaA,CAAAA,CAAK,WAAY,CAAA,CAEhG,IAAMC,CAAAA,CAAQ7D,CAAAA,CAAK,OAAA,CAAQ,GAAG,CAAA,CAC9B,GAAI6D,CAAAA,EAAS,CAAA,CACX,OAAO,CAAE,KAAA,CAAAnB,CAAAA,CAAO,SAAA,CAAW1C,CAAAA,CAAK,KAAA,CAAM,CAAA,CAAG6D,CAAK,CAAA,CAAG,WAAA,CAAa7D,CAAAA,CAAK,MAAM6D,CAAAA,CAAQ,CAAC,CAAE,CAAA,CAEtF,IAAMC,CAAAA,CAAMjC,GAAAA,CAAe7B,CAAI,CAAA,CAC/B,OAAI8D,CAAAA,GAAQ,MAAA,EAAaA,CAAAA,CAAI,OAAA,GAAY,OAAA,CAEhC,CAAE,KAAA,CAAOpB,CAAAA,CAAQoB,CAAAA,CAAI,MAAA,CAAQ,SAAA,CAAW,GAAA,CAAK,WAAA,CAAa,GAAI,CAAA,CAEnEA,CAAAA,GAAQ,MAAA,EAAaA,CAAAA,CAAI,OAAA,GAAY,UAAA,CAEhC,CAAE,KAAA,CAAOpB,EAAQoB,CAAAA,CAAI,MAAA,CAAQ,SAAA,CAAW,GAAA,CAAK,WAAA,CAAa,GAAI,CAAA,CAEhE,IACT,CAYO,SAASC,CAAAA,CAAmB/D,CAAAA,CAAmC,CACpE,GAAIA,CAAAA,GAAS,MAAA,CAAW,OAAO,MAAA,CAC/B,IAAMgE,CAAAA,CAAOL,CAAAA,CAAiB,CAAA,CAAG3D,CAAI,CAAA,CACrC,GAAIgE,CAAAA,GAAS,IAAA,EAAQrC,CAAAA,CAAWqC,CAAAA,CAAK,WAAW,CAAA,GAAM,MAAA,CAAQ,OAAO,MAAA,CACrE,IAAMC,CAAAA,CAAmBtC,CAAAA,CAAWqC,CAAAA,CAAK,SAAS,CAAA,CAClD,OAAOC,CAAAA,GAAqB,QAAA,EAAYA,CAAAA,GAAqB,MAC/D,CAQO,SAASC,CAAAA,CACdhE,CAAAA,CACAiE,CAAAA,CACAC,CAAAA,CACAC,CAAAA,CACe,CACf,IAAML,CAAAA,CAAOL,CAAAA,CAAiBS,CAAAA,CAAWC,CAAQ,CAAA,CAEjD,GADIL,CAAAA,GAAS,IAAA,EAAQrC,CAAAA,CAAWqC,CAAAA,CAAK,WAAW,IAAM,MAAA,EAClDrC,CAAAA,CAAWwC,CAAY,CAAA,GAAMxC,CAAAA,CAAWqC,CAAAA,CAAK,SAAS,CAAA,CAAG,OAAO,IAAA,CAEpE,IAAMM,CAAAA,CADsB7B,CAAAA,CAAYvC,CAAAA,CAAUiE,CAAAA,CAAcH,CAAAA,CAAK,SAAS,CAAA,CAC9BA,CAAAA,CAAK,KAAA,CACrD,OAAOvB,CAAAA,CAAY6B,CAAAA,CAAmBN,CAAAA,CAAK,WAAA,CAAa,GAAG,CAC7D,CAWA,SAASO,CAAAA,CAAepE,CAAAA,CAAcC,CAAAA,CAA2B,CAC/D,GAAID,CAAAA,GAASC,CAAAA,CAAI,OAAO,CAAA,CACxB,GAAID,CAAAA,GAAS,EAAA,EAAMC,CAAAA,GAAO,EAAA,CAAI,OAAO,IAAA,CACrC,IAAM6B,CAAAA,CAAcN,CAAAA,CAAWxB,CAAI,CAAA,CAC7B+B,CAAAA,CAAYP,CAAAA,CAAWvB,CAAE,CAAA,CAC/B,OAAI6B,CAAAA,GAAgB,MAAA,EAAaC,CAAAA,GAAc,MAAA,EAAaD,CAAAA,GAAgBC,CAAAA,CACnE,IAAA,CAEFO,CAAAA,CAAY,CAAA,CAAGtC,CAAAA,CAAMC,CAAE,CAChC,CAiBO,SAASoE,CAAAA,CAAY9B,CAAAA,CAAevC,CAAAA,CAAcC,CAAAA,CAA2B,CAClF,IAAMqE,CAAAA,CAASd,CAAAA,CAAiBjB,CAAAA,CAAOvC,CAAI,CAAA,CAC3C,GAAIsE,CAAAA,GAAW,IAAA,CAAM,OAAO,IAAA,CAK5B,IAAIC,CAAAA,CACAC,CAAAA,CACAC,CAAAA,CACEC,CAAAA,CAAanB,CAAAA,CAAgBtD,CAAE,CAAA,CAC/ByD,CAAAA,CAAQzD,CAAAA,CAAG,OAAA,CAAQ,GAAG,CAAA,CAC5B,GAAIyE,CAAAA,GAAe,MAAA,CAGjBH,CAAAA,CAAkBG,CAAAA,CAAW,SAAA,CAC7BF,CAAAA,CAAoBE,CAAAA,CAAW,WAAA,CAC/BD,CAAAA,CAAcC,CAAAA,CAAW,MAAA,CAAA,KAAA,GAChBhB,CAAAA,EAAS,CAAA,CAClBa,CAAAA,CAAkBtE,CAAAA,CAAG,KAAA,CAAM,CAAA,CAAGyD,CAAK,CAAA,CACnCc,CAAAA,CAAoBvE,CAAAA,CAAG,KAAA,CAAMyD,CAAAA,CAAQ,CAAC,CAAA,CACtCe,CAAAA,CAAc,CAAA,CAAA,KACT,CACL,IAAMd,CAAAA,CAAMjC,GAAAA,CAAezB,CAAE,EAC7B,GAAI0D,CAAAA,GAAQ,MAAA,EAAaA,CAAAA,CAAI,OAAA,GAAY,OAAA,CAAS,OAAO,IAAA,CACzDY,CAAAA,CAAkB,GAAA,CAClBC,CAAAA,CAAoB,GAAA,CACpBC,CAAAA,CAAcd,CAAAA,CAAI,OACpB,CAEA,IAAMgB,CAAAA,CAAkBP,CAAAA,CAAeE,CAAAA,CAAO,SAAA,CAAWC,CAAe,CAAA,CAClEK,CAAAA,CAAoBR,CAAAA,CAAeE,CAAAA,CAAO,WAAA,CAAaE,CAAiB,CAAA,CAC9E,GAAIG,CAAAA,GAAoB,IAAA,EAAQC,IAAsB,IAAA,CACpD,OAAQN,CAAAA,CAAO,KAAA,CAAQK,CAAAA,CAAmBC,CAAAA,CAAoBH,CAAAA,CAWhE,IAAMI,CAAAA,CAAiBT,CAAAA,CAAeE,CAAAA,CAAO,WAAA,CAAaC,CAAe,CAAA,CACnEO,CAAAA,CAAmBV,CAAAA,CAAeE,CAAAA,CAAO,SAAA,CAAWE,CAAiB,CAAA,CAC3E,OAAIK,CAAAA,GAAmB,IAAA,EAAQC,CAAAA,GAAqB,IAAA,EAAQR,CAAAA,CAAO,KAAA,GAAU,CAAA,CACnEO,CAAAA,CAAiBC,CAAAA,CAAmBR,CAAAA,CAAO,KAAA,CAASG,EAGvD,IACT","file":"chunk-4CNYGIND.js","sourcesContent":["/**\n * The unit conversion algorithm, ported from the `convert` npm package v7.0.2\n * alongside its tables (see `generated/UnitTable.generated.ts` and\n * THIRD-PARTY-NOTICES.md).\n *\n * Transliterated expression for expression rather than rewritten. Floating\n * point is not associative, so `(q + d) * (a / b) - d2` and any algebraically\n * equal rearrangement disagree in the last bits. Those bits are observable:\n * `0.5 l` best-converts to `500.00000000000006 mL` today, and the test suite\n * pins several conversions to ten decimal places.\n *\n * This module is deliberately unaware of the engine's own additions. Workdays,\n * extended units, currency and the caches all live in `UomConverter.ts`, which\n * layers them on top of these three functions.\n */\n\nimport {\n  UNIT_TABLE,\n  UNIT_DIFFERENCES,\n  BEST_UNITS_METRIC,\n  type UnitEntry,\n} from \"./generated/UnitTable.generated\";\n\n/**\n * The generated tables re-keyed into Maps once at module load.\n *\n * Not a micro-optimization. A 1456-key object literal lands in V8's dictionary\n * mode, and guarding a read on it against inherited names (`constructor`,\n * `toString`) costs about 123ns per call with either `hasOwnProperty.call` or\n * `Object.hasOwn`, measured. `Map.get` is about 6ns and needs no guard at all,\n * because a Map has no prototype chain to fall through to. That is a 20x\n * difference on the single hottest operation in the unit system: `convertRaw`\n * performs two of these per call, and `LanguageService` sweeps all 1456 keys\n * to build completions.\n */\nconst UNIT_LOOKUP: ReadonlyMap<string, UnitEntry> = new Map(Object.entries(UNIT_TABLE));\n\n/**\n * Temperature offsets, as a Map for the same reason.\n *\n * Also removes a latent hazard: the upstream code tests membership with `in`,\n * and `\"toString\" in UNIT_DIFFERENCES` is true, so an inherited name reaching\n * that branch would add a function to a number.\n */\nconst DIFFERENCE_LOOKUP: ReadonlyMap<string, number> = new Map(Object.entries(UNIT_DIFFERENCES));\n\n/**\n * Looks up a unit spelling.\n *\n * @returns its `[kind, ratio]` entry, or `undefined` if the spelling is not a\n * unit. Case-sensitive: no normalization or aliasing happens anywhere in this\n * module.\n *\n * The one deliberate deviation from upstream. `convert` tests membership with\n * `in` and reads the property directly, so inherited names like \"constructor\"\n * and \"toString\" reach its measure comparison and fail there with \"Cannot\n * convert between different measures\" instead of \"is not a valid unit\". Both\n * throw a RangeError and both report no measure, so nothing downstream can\n * tell the difference, and naming the real problem is the better message.\n */\nexport function lookupUnit(unit: string): UnitEntry | undefined {\n  return UNIT_LOOKUP.get(unit);\n}\n\n/**\n * Converts `quantity` from one unit to another.\n *\n * THROWS a `RangeError` for an unknown unit or a pair in different measures.\n * Callers depend on that: `VM.ts`'s `extractDurationMs()` calls this with an\n * arbitrary unit inside a bare try/catch and treats the throw as \"not a\n * duration, contribute zero\". Returning NaN or the input unchanged instead\n * would turn `<date> + 5 kg` into an Invalid Date rather than a no-op.\n */\nexport function convertRaw(quantity: number, from: string, to: string): number {\n  const parsedFrom = UNIT_LOOKUP.get(from);\n  if (parsedFrom === undefined) {\n    throw new RangeError(`${from} is not a valid unit`);\n  }\n\n  const parsedTo = UNIT_LOOKUP.get(to);\n  if (parsedTo === undefined) {\n    throw new RangeError(`${to} is not a valid unit`);\n  }\n\n  return convertResolved(quantity, from, to, parsedFrom, parsedTo);\n}\n\n/**\n * The conversion arithmetic, for callers that have already looked both units\n * up and want to skip doing it twice.\n *\n * Split out for `UomConverter.convertUnit()`, which has to check whether\n * either side is a workday or an extended unit before it can dispatch, and\n * would otherwise resolve each unit once to decide and again to convert. The\n * entries MUST be the ones this module returned for these exact spellings.\n */\nexport function convertResolved(\n  quantity: number,\n  from: string,\n  to: string,\n  fromEntry: UnitEntry,\n  toEntry: UnitEntry\n): number {\n  const parsedFrom = fromEntry;\n  const parsedTo = toEntry;\n\n  if (parsedFrom[0] !== parsedTo[0]) {\n    // DELIBERATE DEVIATION from the ported original, which silently reinterpreted\n    // \"m\" as minutes whenever the other side was a time unit. That is a guess,\n    // and this project's stated position is that refusing to guess is the safer\n    // default for a tool doing arithmetic on someone's real numbers (see\n    // docs/architecture/design-decisions.md). The guess was not harmless: it\n    // reached `<date> + <duration>` through VM.ts's extractDurationMs(), where\n    // `today + 5 m` silently added five MINUTES for someone who wrote metres.\n    //\n    // Minutes are spelled \"min\", \"minute\" or \"minutes\", all of which the table\n    // has always accepted.\n    throw new RangeError(`Cannot convert between different measures: ${from} and ${to}`);\n  }\n\n  const fromRatio = parsedFrom[1];\n  const toRatio = parsedTo[1];\n\n  // Only six units in the whole table carry an offset, so the common path is\n  // both misses. Reading the Map once per side and reusing the value beats\n  // testing membership and then reading it again.\n  const fromDifference = DIFFERENCE_LOOKUP.get(from);\n  const toDifference = DIFFERENCE_LOOKUP.get(to);\n\n  // Scales that do not share an origin (temperature) need the offset applied\n  // around the ratio. Do not refactor the four branches into one expression:\n  // the grouping is what makes the result bit-identical to the original.\n  if (fromDifference !== undefined) {\n    if (toDifference !== undefined) {\n      return (quantity + fromDifference) * (fromRatio / toRatio) - toDifference;\n    }\n    return (quantity + fromDifference) * (fromRatio / toRatio);\n  }\n\n  if (toDifference !== undefined) {\n    return quantity * (fromRatio / toRatio) - toDifference;\n  }\n\n  return quantity * (fromRatio / toRatio);\n}\n\n/**\n * Picks the most readable metric unit for a magnitude and converts to it.\n *\n * Only the metric lists are ported; nothing has ever requested the imperial\n * ones. Note the final conversion goes from the ORIGINAL unit to the chosen\n * one directly rather than via the smallest unit, which is what keeps the\n * result exact.\n */\nexport function convertToBestMetric(\n  quantity: number,\n  from: string\n): { quantity: number; unit: string } {\n  const parsedFrom = UNIT_LOOKUP.get(from);\n  if (parsedFrom === undefined) {\n    throw new RangeError(`${from} is not a valid unit`);\n  }\n\n  const best = BEST_UNITS_METRIC[parsedFrom[0]];\n  const smallestUnit = best[0][0];\n  let bestUnit = smallestUnit;\n\n  const baseQuantity = convertRaw(quantity, from, smallestUnit);\n  const absQuantity = baseQuantity < 0 ? -baseQuantity : baseQuantity;\n\n  // Thresholds are expressed in the smallest unit and ascend, so the last one\n  // the magnitude reaches wins. Breaking early rather than scanning the whole\n  // list matters for zero and for negatives, which stay on the smallest unit.\n  for (let i = 0; i < best.length; i++) {\n    const bestEntry = best[i];\n    if (absQuantity >= bestEntry[1]) {\n      bestUnit = bestEntry[0];\n    } else {\n      break;\n    }\n  }\n\n  return { quantity: convertRaw(quantity, from, bestUnit), unit: bestUnit };\n}\n","/**\n * UoM Converter, built on the in-house unit tables in `UnitConversion.ts` and\n * `generated/UnitTable.generated.ts` (ported from the `convert` npm package\n * v7.0.2 so the engine ships with no runtime dependencies).\n *\n * Units are strictly case-sensitive and are looked up without aliasing. No unit\n * remapping, what you type is what you get.\n * e.g. 'C' = Celsius, 'c' = cup; 'MB' = megabytes, 'mb' = millibits.\n *\n * This file owns everything the base tables do not: the workday shim, the\n * extended (custom-measure) units, and the two caches.\n */\n\nimport { lookupUnit, convertRaw, convertResolved, convertToBestMetric } from \"@solve-js/uom/UnitConversion\";\nimport { MEASURE_KIND_NAMES, MEASURE_SYMBOLS, UNIT_TABLE } from \"@solve-js/uom/generated/UnitTable.generated\";\nimport { EXTENDED_UNITS } from \"@solve-js/uom/ExtendedUnits\";\n\n// ── \"workday\", a synthetic unit with no entry in the base table ───────────\n//\n// A business day (Mon-Fri) backing the datetime package's `<date> + N\n// workdays` arithmetic and `$X/workday` Rate literals\n// (packages/datetime/). NOT a real physical unit, a business day has no\n// fixed duration, since it depends on which calendar dates are weekends\n// so the ported base table has no concept of it and can't be\n// taught one without monkey-patching its internal unit table.\n//\n// For RATE-MATH purposes only (e.g. \"$500/workday x 4 weeks\" needs a\n// workday count to multiply by), a workday is treated as a FIXED 7/5 of a\n// calendar day: 5 workdays span exactly 7 calendar days in a whole week,\n// so this ratio is exact for whole-week spans and a reasonable linear\n// approximation otherwise. This is deliberately NOT the same\n// calendar-aware, weekend-skipping logic real \"<date> + N workdays\" date\n// arithmetic needs (see vm/VM.ts's addBusinessDays()), that can't be\n// reduced to a fixed ratio, since the exact skip pattern depends on which\n// day of the week the calculation actually starts from.\n//\n// Handled here as a thin pre/post layer in front of the normal\n// base-table path (rather than inside the tables themselves) so every\n// caller of getMeasure()/convertUnit()/canConvert() automatically gets\n// workday support for free.\nconst WORKDAY_UNIT_NAMES = new Set([\"workday\", \"workdays\"]);\nconst WORKDAY_TO_DAY_FACTOR = 7 / 5; // 1 workday == 1.4 calendar days\n\n/** Whether `unit` is the synthetic \"workday\" unit (see module note above). */\nexport function isWorkdayUnit(unit: string | undefined): unit is string {\n  return typeof unit === \"string\" && WORKDAY_UNIT_NAMES.has(unit);\n}\n\n/**\n * Validate `unit` against the known unit table.\n *\n * @returns `unit` unchanged in all cases. This does NOT normalize casing\n *   or aliasing (units are strictly case-sensitive, see the module note\n *   above). A unit the table doesn't recognize is still\n *   returned as-is (not thrown), so callers must not assume a returned\n *   string is actually convertible, check with {@link isConvertibleUnit}\n *   or {@link canConvert} first if that matters.\n *\n * Kept as an identity function purely for API compatibility. It used to guard\n * a validity cache, which existed because validating a unit meant a\n * throw/catch round trip through the old dependency. Validation is now a Map\n * lookup, so the cache cost more than it saved: worse, it was capped at 1000\n * entries against a 1456-unit table, so any sweep over the full vocabulary\n * (which is exactly what LanguageService does to build completions) evicted\n * on almost every call. That one change took the full-table sweep from 7.7ms\n * to under 20us.\n */\nexport function resolveUnit(unit: string): string {\n  return unit;\n}\n\n// MEASURE_KIND_NAMES now comes from the generated table (it is derived data,\n// so the generator emits it rather than it being retyped here). The reason it\n// is a module-level constant has not changed: getMeasure() runs at least twice\n// per conversion, and this used to be reallocated on every call.\n\n/**\n * Get the measure/dimension kind for `unit` (e.g. `\"length\"`, `\"mass\"`,\n * `\"temperature\"`), used to check whether two units are even in the same\n * dimension before attempting a conversion.\n *\n * @returns `undefined` if `unit` isn't recognized, rather than throwing.\n */\nexport function getMeasure(unit: string): string | undefined {\n  // Workday is a Time-measure unit by convention (see isWorkdayUnit's doc\n  // comment) and is not in the base table, so resolve its measure via \"day\"\n  // instead of attempting the real lookup below.\n  if (isWorkdayUnit(unit)) return getMeasure(\"day\");\n\n  // Extended (custom) categories the base table has no measure kind for,\n  // see ExtendedUnits.ts.\n  const extended = EXTENDED_UNITS[unit];\n  if (extended) return extended.measure;\n\n  const entry = lookupUnit(unit);\n  if (entry === undefined) return undefined;\n\n  return MEASURE_KIND_NAMES[entry[0]];\n}\n\n/**\n * Check whether `from` can be converted to `to`. Same unit, or same\n * measure kind (length, mass, ...) and the underlying tables accept the pair.\n * Never throws; returns `false` on any failure.\n */\nexport function canConvert(from: string, to: string): boolean {\n  if (from === to) return true;\n  if (isWorkdayUnit(from) || isWorkdayUnit(to)) {\n    const fromMeasure = getMeasure(from);\n    const toMeasure = getMeasure(to);\n    return !!fromMeasure && fromMeasure === toMeasure;\n  }\n  // One table read per side, comparing numeric kind ids. The old shape called\n  // getMeasure() on each side (two more reads) purely to compare the resulting\n  // STRINGS, then did a throwaway conversion to confirm what the kind check had\n  // already established.\n  const fromEntry = lookupUnit(from);\n  const toEntry = lookupUnit(to);\n  if (fromEntry !== undefined && toEntry !== undefined) {\n    return fromEntry[0] === toEntry[0];\n  }\n\n  // Extended (custom) categories aren't in the base table at all, so they are\n  // compared on their own measure names instead.\n  const fromExtended = EXTENDED_UNITS[from];\n  const toExtended = EXTENDED_UNITS[to];\n  if (fromExtended !== undefined && toExtended !== undefined) {\n    return fromExtended.measure === toExtended.measure;\n  }\n\n  // Mixed: one side is in the base table and the other is extended. That used\n  // to be refused outright, on the grounds that the two measure spaces are\n  // disjoint. They are not, once an extended unit names a measure the base\n  // table also has: `furlong` is a length and so is `m`, and the ratio between\n  // them is exactly what both tables already record.\n  return bridgesToBaseMeasure(from, to) || bridgesToBaseMeasure(to, from);\n}\n\n/**\n * Whether `extendedUnit` extends a measure the base table also knows, so a\n * value in it can reach `baseUnit`.\n *\n * The bridge works because both tables express a unit as a ratio to the same\n * physical base: the generated table's length ratios are metres and its mass\n * ratios are grams, and an extended unit declaring `measure: \"length\"` states\n * its `toBase` in the same metres. Composing the two ratios is then ordinary\n * arithmetic rather than a second conversion system.\n *\n * A measure the base table has no concept of, such as pace, still fails here,\n * which is the behaviour this replaced and the reason the check is by measure\n * name rather than by presence in the extended table.\n */\nfunction bridgesToBaseMeasure(extendedUnit: string, baseUnit: string): boolean {\n  const extended = EXTENDED_UNITS[extendedUnit];\n  if (extended === undefined) return false;\n\n  const base = lookupUnit(resolveUnit(baseUnit));\n  if (base === undefined) return false;\n\n  return MEASURE_KIND_NAMES[base[0]] === extended.measure;\n}\n\n/**\n * Convert `value` from unit `from` to unit `to`.\n *\n * Does not validate that the conversion is possible, callers should check\n * with {@link canConvert} first if `from`/`to` aren't already known-good.\n *\n * THROWS a RangeError for an unknown unit or a cross-measure pair. `VM.ts`'s\n * `extractDurationMs()` depends on that, see {@link convertRaw}.\n *\n * This used to memoize a per-pair conversion factor in an LFU cache. The cache\n * is gone: computing the factor is now two Map reads, while the cache cost a\n * template-string key allocation on every call plus the LFU's own frequency\n * bookkeeping, so it was slower than the work it avoided. Removing it is\n * bit-exact, not merely close: the cache stored `convertRaw(1, f, t)`, which is\n * exactly `fromRatio / toRatio`, and then multiplied, which is the identical\n * expression `convertRaw(value, f, t)` evaluates. It also deleted the special\n * case that existed only to keep offset-based temperature pairs out of a\n * factor cache.\n */\nexport function convertUnit(value: number, from: string, to: string): number {\n  if (from === to) return value;\n\n  // Fast path first: two ordinary units, which is nearly every call. Resolving\n  // both here and handing the entries to convertResolved() avoids looking them\n  // up again inside convertRaw(). Neither workdays nor extended units appear in\n  // the base table, so they always fall through to the branches below and this\n  // ordering cannot steal a case from them. UnitVocabulary.spec.ts pins that\n  // the two vocabularies stay disjoint.\n  const fromEntry = lookupUnit(from);\n  const toEntry = lookupUnit(to);\n  if (fromEntry !== undefined && toEntry !== undefined) {\n    return convertResolved(value, from, to, fromEntry, toEntry);\n  }\n\n  // Workday <-> any other Time-measure unit: pivot through \"day\" using the\n  // fixed 7/5 ratio (see isWorkdayUnit's doc comment above).\n  if (isWorkdayUnit(from) && isWorkdayUnit(to)) return value; // \"workday\" <-> \"workdays\" alias\n  if (isWorkdayUnit(from)) {\n    const days = value * WORKDAY_TO_DAY_FACTOR;\n    return to === \"day\" ? days : convertUnit(days, \"day\", to);\n  }\n  if (isWorkdayUnit(to)) {\n    const days = from === \"day\" ? value : convertUnit(value, from, \"day\");\n    return days / WORKDAY_TO_DAY_FACTOR;\n  }\n\n  // Extended (custom) categories the base table has no measure kind for\n  // (see ExtendedUnits.ts), compute the ratio directly from each unit's\n  // factor-to-base value instead of calling convertRaw(), which would throw\n  // on an unrecognized unit string. Every extended category is a pure linear\n  // ratio scale (no Temperature-style offset), so this is always safe.\n  const fExt = EXTENDED_UNITS[from];\n  const tExt = EXTENDED_UNITS[to];\n  if (fExt !== undefined && tExt !== undefined) {\n    return value * (fExt.toBase / tExt.toBase);\n  }\n\n  // One side extended, the other in the base table, sharing a measure. Convert\n  // through the measure's base unit, which both tables state their ratios\n  // against: an extended length declares its `toBase` in metres, and the\n  // generated table's length ratios are metres too.\n  if (fExt !== undefined && bridgesToBaseMeasure(from, to)) {\n    return convertRaw(value * fExt.toBase, baseUnitFor(to), to);\n  }\n  if (tExt !== undefined && bridgesToBaseMeasure(to, from)) {\n    return convertRaw(value, from, baseUnitFor(from)) / tExt.toBase;\n  }\n\n  // Offsets, cross-measure rejection and the unknown-unit throw all live in\n  // convertRaw. Nothing is layered on top here any more.\n  return convertRaw(value, from, to);\n}\n\n/**\n * The unit a measure states its ratios against, found from any unit in it.\n *\n * Read out of the table rather than hard-coded, so it cannot drift from the\n * ratios it has to agree with: the base is whichever unit of that measure has\n * a ratio of exactly one.\n */\nfunction baseUnitFor(unit: string): string {\n  const entry = lookupUnit(resolveUnit(unit));\n  if (entry === undefined) return unit;\n\n  for (const symbol of Object.keys(UNIT_TABLE)) {\n    const candidate = UNIT_TABLE[symbol];\n    if (candidate[0] === entry[0] && candidate[1] === 1) return symbol;\n  }\n  return unit;\n}\n\n/**\n * List every unit symbol in the same measure/dimension as `unit` (wiki:\n * Units-Of-Measurement, \"Conversion Possibilities\", `sourceUnit to ?`\n * e.g. `cm to ?\"` → every Length unit). Excludes `unit` itself.\n *\n * Reads MEASURE_SYMBOLS, which is a curated symbols-only vocabulary and\n * deliberately NOT the keys of the unit table filtered by kind. The two\n * differ: Volume's symbols include `c` and `pt` but not `cup`/`cups`, and\n * Time's include `wk` and `mo` but not `week`/`month`. Deriving this list\n * from the unit table instead would roughly quadruple every answer.\n *\n * @returns `[]` if `unit` isn't recognized, rather than throwing.\n */\nexport function getConvertiblePossibilities(unit: string): string[] {\n  const resolved = resolveUnit(unit);\n  const entry = lookupUnit(resolved);\n  if (entry === undefined) return [];\n  const symbols = MEASURE_SYMBOLS[entry[0]];\n  if (!symbols) return [];\n  return symbols.filter((s) => s !== resolved);\n}\n\n/** Check whether `unit` is a unit the conversion tables recognize. Never throws. */\nexport function isConvertibleUnit(unit: string): boolean {\n  if (isWorkdayUnit(unit)) return true;\n  if (EXTENDED_UNITS[unit]) return true;\n  return lookupUnit(resolveUnit(unit)) !== undefined;\n}\n\n/**\n * Convert `value` (in `unit`) to whichever unit of the same measure gives\n * the most human-readable magnitude, e.g. 1500 metres becomes 1.5 km. Falls\n * back to returning `value`/`unit` unchanged if `unit` isn't recognized,\n * which is what every extended unit and workday does.\n *\n * Note the chosen unit is drawn from the best-unit lists, which are not\n * restricted to spellings the lexer accepts: 0.5 l reports \"mL\".\n */\nexport function getBestUnit(value: number, unit: string): { value: number; unit: string } {\n  const u = resolveUnit(unit);\n  try {\n    const result = convertToBestMetric(value, u);\n    return { value: result.quantity, unit: result.unit };\n  } catch {\n    return { value, unit: u };\n  }\n}\n\n// ── Rate and derived-unit conversion ───────────────────────────────────────\n//\n// A rate value carries a compound unit spelled \"numerator/denominator\" (e.g.\n// \"km/h\", \"m/s\"), see vm/Value.ts's rateValue(). Plain convertUnit() cannot\n// touch one, because neither half is the whole unit and getMeasure(\"km/h\") is\n// undefined. This section converts a rate to another rate, and bridges a rate\n// to the single-token speed spellings (mph, kph, mps, ...) that ExtendedUnits.ts\n// already carries, so \"100 km/h in mph\" and \"60 mph in km/h\" resolve instead of\n// reporting incompatible units.\n\n/** A rate reduced to a numerator unit over a denominator unit. */\ninterface RateForm {\n  /** Magnitude, scaled so `value numerator/denominator` is the physical quantity. */\n  value: number;\n  /** Numerator unit spelling, or `\"\"` for a countless rate such as `30/week`. */\n  numerator: string;\n  /** Denominator unit spelling. */\n  denominator: string;\n}\n\n/**\n * Express `value unit` as a numerator/denominator rate, or `null` when `unit`\n * is neither a compound rate spelling nor a single-token speed alias.\n *\n * A speed alias (mph, kph, ...) is one unit standing for a length/time rate, so\n * it expands to the base pair `m`/`s` with its value scaled by the alias's\n * metres-per-second factor. That collapses both inputs to one shape, so a\n * single routine handles rate/rate and rate/alias without a second code path.\n */\n/**\n * The single-token fuel-economy units, each as the `numerator/denominator` rate\n * it stands for and the factor that turns one of it into that rate's base. `mpg`\n * is `km/l` scaled, `l/100km` is `l/km` scaled by a hundredth (issue #190).\n */\nconst FUEL_RATE_UNITS: Record<string, { numerator: string; denominator: string; factor: number }> = {\n  mpg: { numerator: \"km\", denominator: \"l\", factor: 1.609344 / 3.785411784 },\n  kmpl: { numerator: \"km\", denominator: \"l\", factor: 1 },\n  l100km: { numerator: \"l\", denominator: \"km\", factor: 0.01 },\n};\n\nfunction expandUnitToRate(value: number, unit: string): RateForm | null {\n  const fuel = FUEL_RATE_UNITS[unit];\n  if (fuel !== undefined) {\n    return { value: value * fuel.factor, numerator: fuel.numerator, denominator: fuel.denominator };\n  }\n  const slash = unit.indexOf(\"/\");\n  if (slash >= 0) {\n    return { value, numerator: unit.slice(0, slash), denominator: unit.slice(slash + 1) };\n  }\n  const ext = EXTENDED_UNITS[unit];\n  if (ext !== undefined && ext.measure === \"speed\") {\n    // 1 alias == ext.toBase m/s, so `value alias` is `value * toBase` m/s.\n    return { value: value * ext.toBase, numerator: \"m\", denominator: \"s\" };\n  }\n  if (ext !== undefined && ext.measure === \"dataRate\") {\n    // 1 alias == ext.toBase bits/s, so `value alias` is `value * toBase` b/s.\n    return { value: value * ext.toBase, numerator: \"b\", denominator: \"s\" };\n  }\n  return null;\n}\n\n/**\n * Whether `unit` is a *physical* rate over time, one whose numerator is a length\n * or a data size, so `<quantity> at <unit>` means dividing that quantity by the\n * rate to get a duration: `250 miles at 60 mph`, `4 GB at 50 Mbps`.\n *\n * Deliberately NOT true for a price rate like `$/hour`: those are handled by the\n * existing at-rate builtin, which multiplies or divides against the currency,\n * and must keep their own answer (`$500 at $20/hour` is `25 hours`, formatted\n * that way). The numerator-measure check is what tells the two apart.\n */\nexport function isPhysicalTimeRate(unit: string | undefined): boolean {\n  if (unit === undefined) return false;\n  const rate = expandUnitToRate(1, unit);\n  if (rate === null || getMeasure(rate.denominator) !== \"time\") return false;\n  const numeratorMeasure = getMeasure(rate.numerator);\n  return numeratorMeasure === \"length\" || numeratorMeasure === \"data\";\n}\n\n/**\n * `<quantity> at <rate>` where `rate` is a {@link isPhysicalTimeRate}, in\n * seconds. The quantity's measure must match the rate's numerator (a distance at\n * a speed, a data size at a bandwidth); otherwise the pair does not line up and\n * this returns null for the caller to report.\n */\nexport function quantityAtRateSeconds(\n  quantity: number,\n  quantityUnit: string,\n  rateValue: number,\n  rateUnit: string,\n): number | null {\n  const rate = expandUnitToRate(rateValue, rateUnit);\n  if (rate === null || getMeasure(rate.denominator) !== \"time\") return null;\n  if (getMeasure(quantityUnit) !== getMeasure(rate.numerator)) return null;\n  const quantityInNumerator = convertUnit(quantity, quantityUnit, rate.numerator);\n  const timeInDenominator = quantityInNumerator / rate.value;\n  return convertUnit(timeInDenominator, rate.denominator, \"s\");\n}\n\n/**\n * The factor that turns one `from` into `to` along a single rate axis, or\n * `null` when the two cannot line up.\n *\n * Same spelling needs no conversion. A countless axis (`\"\"`) only lines up with\n * another countless one, never with a real unit. Otherwise both sides must name\n * the same measure, which is what keeps a length numerator from pairing with a\n * mass one.\n */\nfunction rateAxisFactor(from: string, to: string): number | null {\n  if (from === to) return 1;\n  if (from === \"\" || to === \"\") return null;\n  const fromMeasure = getMeasure(from);\n  const toMeasure = getMeasure(to);\n  if (fromMeasure === undefined || toMeasure === undefined || fromMeasure !== toMeasure) {\n    return null;\n  }\n  return convertUnit(1, from, to);\n}\n\n/**\n * Convert `value` from a rate/speed unit `from` to a rate/speed unit `to`,\n * returning the converted magnitude, or `null` when the pair is not\n * rate-convertible (so the caller falls back to its own incompatible-units\n * handling).\n *\n * Handles rate to rate (`10 m/s in km/h`), rate to speed alias\n * (`100 km/h in mph`) and speed alias to rate (`60 mph in km/h`). Plain\n * same-measure pairs (`kph in mph`, `km in miles`) never reach here, they are\n * resolved by {@link convertUnit} first.\n *\n * The rule is the ordinary one for a quotient of quantities: convert the\n * numerator and the denominator each on their own, so `A/B -> C/D` scales by\n * `(A->C) / (B->D)`.\n */\nexport function convertRate(value: number, from: string, to: string): number | null {\n  const source = expandUnitToRate(value, from);\n  if (source === null) return null;\n\n  // The target is either a rate spelling or a single-token speed alias. An\n  // alias expands to the base m/s pair, and `targetScale` is what the base-form\n  // magnitude is divided by to read out in the alias itself.\n  let targetNumerator: string;\n  let targetDenominator: string;\n  let targetScale: number;\n  const fuelTarget = FUEL_RATE_UNITS[to];\n  const slash = to.indexOf(\"/\");\n  if (fuelTarget !== undefined) {\n    // The base-pair magnitude divided by the fuel unit's own factor reads out in\n    // that unit (so a l/km magnitude becomes a l/100km figure).\n    targetNumerator = fuelTarget.numerator;\n    targetDenominator = fuelTarget.denominator;\n    targetScale = fuelTarget.factor;\n  } else if (slash >= 0) {\n    targetNumerator = to.slice(0, slash);\n    targetDenominator = to.slice(slash + 1);\n    targetScale = 1;\n  } else {\n    const ext = EXTENDED_UNITS[to];\n    if (ext === undefined || ext.measure !== \"speed\") return null;\n    targetNumerator = \"m\";\n    targetDenominator = \"s\";\n    targetScale = ext.toBase;\n  }\n\n  const numeratorFactor = rateAxisFactor(source.numerator, targetNumerator);\n  const denominatorFactor = rateAxisFactor(source.denominator, targetDenominator);\n  if (numeratorFactor !== null && denominatorFactor !== null) {\n    return (source.value * numeratorFactor) / denominatorFactor / targetScale;\n  }\n\n  // A reciprocal pairing: distance-per-volume against volume-per-distance, the\n  // fuel-economy case (miles per gallon to litres per kilometre). The two rates\n  // measure the same thing upside down, so the source's numerator lines up with\n  // the target's denominator and its denominator with the target's numerator,\n  // and the magnitude is inverted. `40 miles/gallon` becomes `0.0588 l/km`:\n  // one over forty, scaled gallon-to-litre over mile-to-kilometre. See issue\n  // #190; this is why fuel economy needs its own route and is not a rescale of\n  // each axis like `mph` to `km/h`.\n  const crossNumerator = rateAxisFactor(source.denominator, targetNumerator);\n  const crossDenominator = rateAxisFactor(source.numerator, targetDenominator);\n  if (crossNumerator !== null && crossDenominator !== null && source.value !== 0) {\n    return (crossNumerator / crossDenominator / source.value) / targetScale;\n  }\n\n  return null;\n}\n"]}

package/dist/chunk-CIC2YO2M.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../package.json","../src/constants/version.ts","../src/constants/Configuration.ts"],"names":["version","ENGINE_VERSION","DEFAULT_CONFIG","mergeEngineConfig","base","override","ConfigManager","config","path","keys","current","key","ErrorFactory","value","section","property","sectionConfig","errors"],"mappings":"2CAEE,IAAAA,EAAW,QAAA,CCcN,IAAMC,EAAyBD,ECgb/B,IAAME,EAA+B,CACzC,IAAA,CAAM,CAIJ,cAAA,CAAgB,GAAA,CAChB,eAAgB,IAAA,CAChB,aAAA,CAAe,aACf,UAAA,CAAY,MAAA,CAIZ,YAAa,QACf,CAAA,CACA,YAAa,CAIX,gBAAA,CAAkB,IAalB,gBAAA,CAAkB,GACpB,EACC,UAAA,CAAY,CACV,oBAAqB,GAAA,CACrB,aAAA,CAAe,IACf,eAAA,CAAiB,EAAA,CACjB,kBAAmB,KACrB,CAAA,CACA,GAAI,CACF,aAAA,CAAe,IACf,eAAA,CAAiB,GAAA,CAKjB,iBAAA,CAAmB,GAAA,CAInB,qBAAsB,GAAA,CAMtB,gBAAA,CAAkB,IAMlB,qBAAA,CAAuB,GACzB,EACA,MAAA,CAAQ,CACN,qBAAsB,CAAA,CACtB,aAAA,CAAe,IACf,UAAA,CAAY,CAAA,CACZ,cAAe,GACjB,CAAA,CACA,WAAY,CACV,OAAA,CAAS,MACT,cAAA,CAAgB,KAClB,EACA,iBAAA,CAAmB,CACjB,QAAS,KACX,CAAA,CACA,QAAS,CAGP,OAAA,CAAS,IACX,CACF,EAiBK,SAASC,CAAAA,CACdC,CAAAA,CACAC,EACc,CACd,OAAO,CACL,IAAA,CAAM,CAAE,GAAGD,CAAAA,CAAK,KAAM,GAAGC,CAAAA,CAAS,IAAK,CAAA,CACvC,WAAA,CAAa,CAAE,GAAGD,CAAAA,CAAK,YAAa,GAAGC,CAAAA,CAAS,WAAY,CAAA,CAC5D,UAAA,CAAY,CAAE,GAAGD,CAAAA,CAAK,WAAY,GAAGC,CAAAA,CAAS,UAAW,CAAA,CACzD,EAAA,CAAI,CAAE,GAAGD,CAAAA,CAAK,GAAI,GAAGC,CAAAA,CAAS,EAAG,CAAA,CACjC,MAAA,CAAQ,CAAE,GAAGD,CAAAA,CAAK,OAAQ,GAAGC,CAAAA,CAAS,MAAO,CAAA,CAC7C,UAAA,CAAY,CAAE,GAAGD,CAAAA,CAAK,UAAA,CAAY,GAAGC,EAAS,UAAW,CAAA,CACzD,kBAAmB,CAAE,GAAGD,EAAK,iBAAA,CAAmB,GAAGC,EAAS,iBAAkB,CAAA,CAC9E,QAAS,CAAE,GAAGD,EAAK,OAAA,CAAS,GAAGC,EAAS,OAAQ,CAClD,CACF,CAYO,IAAMC,EAAN,KAAoB,CAGzB,YAAYC,CAAAA,CAAgC,GAAI,CAC9C,IAAA,CAAK,OAASJ,CAAAA,CAAkBD,CAAAA,CAAgBK,CAAM,EACxD,CAQA,IAAOC,CAAAA,CAAiB,CACtB,IAAMC,CAAAA,CAAOD,CAAAA,CAAK,KAAA,CAAM,GAAG,EACvBE,CAAAA,CAAmB,IAAA,CAAK,OAE5B,IAAA,IAAWC,CAAAA,IAAOF,EAChB,GAAIC,CAAAA,EAAW,OAAOA,CAAAA,EAAY,QAAA,EAAYC,KAAOD,CAAAA,CACnDA,CAAAA,CAAWA,EAAoCC,CAAG,CAAA,CAAA,WAE5CC,GAAAA,CAAa,MAAA,CACjB,wBACA,CAAA,8BAAA,EAAiCJ,CAAI,GACrC,CAAE,IAAA,CAAAA,CAAK,CACT,CAAA,CAIJ,OAAOE,CACT,CAQA,IAAOF,CAAAA,CAAcK,CAAAA,CAAgB,CACnC,IAAMJ,CAAAA,CAAOD,EAAK,KAAA,CAAM,GAAG,EAC3B,GAAIC,CAAAA,CAAK,MAAA,CAAS,CAAA,CAChB,MAAMG,GAAAA,CAAa,MAAA,CACjB,sBACA,CAAA,cAAA,EAAiBJ,CAAI,yCACrB,CAAE,IAAA,CAAAA,CAAK,CACT,CAAA,CAGF,IAAMM,CAAAA,CAAUL,CAAAA,CAAK,CAAC,CAAA,CAChBM,CAAAA,CAAWN,EAAK,CAAC,CAAA,CAEvB,GAAI,EAAEK,CAAAA,IAAW,KAAK,MAAA,CAAA,CACpB,MAAMF,IAAa,MAAA,CACjB,0BAAA,CACA,oCAAoCE,CAAO,CAAA,CAAA,CAC3C,CAAE,OAAA,CAAAA,CAAAA,CAAS,KAAAN,CAAK,CAClB,EAGF,IAAMQ,CAAAA,CAAgB,KAAK,MAAA,CAAOF,CAA6B,CAAA,CAC/D,GAAIE,GAAiB,OAAOA,CAAAA,EAAkB,SAC3CA,CAAAA,CAAqDD,CAAQ,EAAIF,CAAAA,CAAAA,KAElE,MAAMD,IAAa,MAAA,CACjB,2BAAA,CACA,qCAAqCJ,CAAI,CAAA,CAAA,CACzC,CAAE,IAAA,CAAAA,CAAK,CACT,CAEJ,CAUA,WAA0B,CACxB,OAAOL,EAAkB,IAAA,CAAK,MAAA,CAAQ,EAAE,CAC1C,CAKA,MAAA,CAAOI,CAAAA,CAAqC,CAC1C,IAAA,CAAK,MAAA,CAASJ,EAAkB,IAAA,CAAK,MAAA,CAAQI,CAAM,EACrD,CAcA,OAAc,CACZ,IAAA,CAAK,OAASJ,CAAAA,CAAkBD,CAAAA,CAAgB,EAAE,EACpD,CAKA,QAAA,EAA6B,CAC3B,IAAMe,CAAAA,CAAmB,GAGzB,OAAI,IAAA,CAAK,OAAO,WAAA,CAAY,gBAAA,CAAmB,KAC7CA,CAAAA,CAAO,IAAA,CAAK,wCAAwC,CAAA,CAIlD,IAAA,CAAK,OAAO,IAAA,CAAK,cAAA,CAAiB,KACpCA,CAAAA,CAAO,IAAA,CAAK,mCAAmC,CAAA,CAG1C,CACL,MAAOA,CAAAA,CAAO,MAAA,GAAW,EACzB,KAAA,CAAOA,CAAAA,CAAO,KAAK,IAAI,CAAA,CACvB,SAAU,EACZ,CACF,CACF","file":"chunk-CIC2YO2M.js","sourcesContent":["{\n  \"name\": \"solve-engine\",\n  \"version\": \"2.30.0\",\n  \"description\": \"An embeddable expression engine for natural-language calculations: units, currencies, percentages, dates and matrices, with the parsing and evaluation plumbing already built.\",\n  \"keywords\": [\n    \"expression-evaluator\",\n    \"calculator\",\n    \"bytecode-vm\",\n    \"parser\",\n    \"lexer\",\n    \"dsl\",\n    \"markdown\",\n    \"obsidian\"\n  ],\n  \"license\": \"MIT\",\n  \"author\": \"Liam Riddell\",\n  \"homepage\": \"https://liamriddell.github.io/solve-engine/\",\n  \"repository\": {\n    \"type\": \"git\",\n    \"url\": \"git+https://github.com/LiamRiddell/solve-engine.git\",\n    \"directory\": \"packages/engine\"\n  },\n  \"bugs\": {\n    \"url\": \"https://github.com/LiamRiddell/solve-engine/issues\"\n  },\n  \"publishConfig\": {\n    \"access\": \"public\"\n  },\n  \"type\": \"module\",\n  \"engines\": {\n    \"node\": \">=22\"\n  },\n  \"files\": [\n    \"dist\",\n    \"LICENSE\"\n  ],\n  \"main\": \"./dist/index.cjs\",\n  \"module\": \"./dist/index.js\",\n  \"types\": \"./dist/index.d.ts\",\n  \"exports\": {\n    \".\": {\n      \"import\": {\n        \"types\": \"./dist/index.d.ts\",\n        \"default\": \"./dist/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/index.d.cts\",\n        \"default\": \"./dist/index.cjs\"\n      }\n    },\n    \"./engine\": {\n      \"import\": {\n        \"types\": \"./dist/engine.d.ts\",\n        \"default\": \"./dist/engine.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/engine.d.cts\",\n        \"default\": \"./dist/engine.cjs\"\n      }\n    },\n    \"./vm\": {\n      \"import\": {\n        \"types\": \"./dist/vm.d.ts\",\n        \"default\": \"./dist/vm.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/vm.d.cts\",\n        \"default\": \"./dist/vm.cjs\"\n      }\n    },\n    \"./format\": {\n      \"import\": {\n        \"types\": \"./dist/format.d.ts\",\n        \"default\": \"./dist/format.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/format.d.cts\",\n        \"default\": \"./dist/format.cjs\"\n      }\n    },\n    \"./language\": {\n      \"import\": {\n        \"types\": \"./dist/language.d.ts\",\n        \"default\": \"./dist/language.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/language.d.cts\",\n        \"default\": \"./dist/language.cjs\"\n      }\n    },\n    \"./packages\": {\n      \"import\": {\n        \"types\": \"./dist/packages.d.ts\",\n        \"default\": \"./dist/packages.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/packages.d.cts\",\n        \"default\": \"./dist/packages.cjs\"\n      }\n    },\n    \"./constants\": {\n      \"import\": {\n        \"types\": \"./dist/constants.d.ts\",\n        \"default\": \"./dist/constants.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/constants.d.cts\",\n        \"default\": \"./dist/constants.cjs\"\n      }\n    },\n    \"./lexer\": {\n      \"import\": {\n        \"types\": \"./dist/lexer.d.ts\",\n        \"default\": \"./dist/lexer.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/lexer.d.cts\",\n        \"default\": \"./dist/lexer.cjs\"\n      }\n    },\n    \"./parser\": {\n      \"import\": {\n        \"types\": \"./dist/parser.d.ts\",\n        \"default\": \"./dist/parser.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/parser.d.cts\",\n        \"default\": \"./dist/parser.cjs\"\n      }\n    },\n    \"./normalizer\": {\n      \"import\": {\n        \"types\": \"./dist/normalizer.d.ts\",\n        \"default\": \"./dist/normalizer.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/normalizer.d.cts\",\n        \"default\": \"./dist/normalizer.cjs\"\n      }\n    },\n    \"./resolvers\": {\n      \"import\": {\n        \"types\": \"./dist/resolvers.d.ts\",\n        \"default\": \"./dist/resolvers.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/resolvers.d.cts\",\n        \"default\": \"./dist/resolvers.cjs\"\n      }\n    },\n    \"./errors\": {\n      \"import\": {\n        \"types\": \"./dist/errors.d.ts\",\n        \"default\": \"./dist/errors.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/errors.d.cts\",\n        \"default\": \"./dist/errors.cjs\"\n      }\n    },\n    \"./utilities\": {\n      \"import\": {\n        \"types\": \"./dist/utilities.d.ts\",\n        \"default\": \"./dist/utilities.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/utilities.d.cts\",\n        \"default\": \"./dist/utilities.cjs\"\n      }\n    },\n    \"./uom\": {\n      \"import\": {\n        \"types\": \"./dist/uom.d.ts\",\n        \"default\": \"./dist/uom.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/uom.d.cts\",\n        \"default\": \"./dist/uom.cjs\"\n      }\n    },\n    \"./services\": {\n      \"import\": {\n        \"types\": \"./dist/services.d.ts\",\n        \"default\": \"./dist/services.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/services.d.cts\",\n        \"default\": \"./dist/services.cjs\"\n      }\n    },\n    \"./worker\": {\n      \"import\": {\n        \"types\": \"./dist/worker.d.ts\",\n        \"default\": \"./dist/worker.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/worker.d.cts\",\n        \"default\": \"./dist/worker.cjs\"\n      }\n    },\n    \"./testing\": {\n      \"import\": {\n        \"types\": \"./dist/testing.d.ts\",\n        \"default\": \"./dist/testing.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/testing.d.cts\",\n        \"default\": \"./dist/testing.cjs\"\n      }\n    },\n    \"./temporal\": {\n      \"import\": {\n        \"types\": \"./dist/temporal.d.ts\",\n        \"default\": \"./dist/temporal.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/temporal.d.cts\",\n        \"default\": \"./dist/temporal.cjs\"\n      }\n    }\n  },\n  \"scripts\": {\n    \"build\": \"tsup\",\n    \"prepublishOnly\": \"npm run build && node ../../scripts/assert-publishable.mjs .\",\n    \"dev\": \"tsup --watch\",\n    \"test\": \"jest --config jest.config.cjs --no-coverage\",\n    \"typecheck\": \"tsgo --noEmit --skipLibCheck\",\n    \"typecheck:tsc\": \"tsc --noEmit --skipLibCheck\"\n  },\n  \"dependencies\": {\n    \"@tanstack/query-core\": \"^5.102.8\"\n  },\n  \"devDependencies\": {\n    \"@jest/globals\": \"^30.5.0\",\n    \"@types/node\": \"^26.4.0\",\n    \"convert\": \"^7.0.0\",\n    \"jest\": \"^30.5.0\",\n    \"temporal-polyfill\": \"1.0.4\",\n    \"ts-jest\": \"^29.4.12\",\n    \"tsup\": \"8.5.1\",\n    \"typescript\": \"5.9.3\"\n  },\n  \"//sideEffects\": \"Load-bearing claim, not boilerplate. tsup's splitting emits bare chunk imports at the top of dist/index.js, and this field tells Rollup, webpack and Vite they may delete them, which esbuild reports as [ignored-bare-import] once per import during `npm run size`. The engine does have module-level work to lose: registerAllTokenTypes(), _PrecedenceParser.BP_TABLE and its cached token ids, and several process-wide registries. It is safe because every chunk doing that work is also imported for its bindings somewhere, so no bundler can drop it. That is a property of how tsup currently splits the code rather than a design guarantee, so `npm run smoke:bundled` (scripts/check-tree-shaking.mjs) proves it on every run of `npm run verify` instead of assuming it, and its header explains the two fixes if it ever stops holding.\",\n  \"sideEffects\": false\n}\n","/**\n * The running engine's own semver version, sourced directly from this\n * package's package.json so it can never drift from what's actually\n * published. Exists so IEnginePackage.engineVersion range checks\n * (api/EngineVersionCompatibility.ts) have something real to check\n * against.\n */\nimport { version } from \"../../package.json\";\n\n/**\n * The running engine's version, taken from package.json.\n *\n * What a package's `engineVersion` range is checked against at registration.\n * A prerelease is compared by its coerced release version, so a 1.0.0 beta\n * satisfies `^1.0.0`. See `api/EngineVersionCompatibility.ts`.\n */\nexport const ENGINE_VERSION: string = version;\n","/**\n * Configuration Module for solve-js Engine\n * \n * This module provides the **single source of truth** for all engine configuration.\n * Every configurable aspect of the engine, from safety limits and performance\n * budgets to VM constraints and worker pool sizing, is defined here.\n * \n * ### Design principles\n * \n * 1. **Engine owns its config.** The engine defines its own config shape and defaults.\n *    Consumers (e.g., the Obsidian plugin) pass partial overrides; all unspecified\n *    fields fall back to `DEFAULT_CONFIG`.\n * \n * 2. **Self-documenting.** Every interface and field has descriptive JSDoc so the\n *    config is understandable at a glance, whether you're using the engine as an\n *    npm package or reading the source.\n * \n * 3. **Minimal consumer knowledge.** Consumers only need to pass `Partial<EngineConfig>`.\n *    They don't need to replicate the full config shape, just the fields they\n *    want to override.\n * \n * @module Configuration\n */\n\nimport { ErrorFactory } from \"@solve-js/errors/UnifiedErrorFramework\";\n\n/**\n * A host's test for whether a calendar date is a public holiday, given the\n * `Date` for that day at local midnight. Return `true` to exclude it from\n * working-day arithmetic.\n */\nexport type HolidayPredicate = (date: Date) => boolean;\n\n/**\n * The host-supplied public-holiday calendar, in the same \"bring your own data\"\n * shape the stocks and weather packages already use for a host callback (see\n * `packages/stocks/StocksPackage.ts`): weekends are decidable from the date\n * alone, holidays are not, so they come from the host or not at all.\n *\n * Either a {@link HolidayPredicate}, for a host that computes holidays itself\n * (an existing library, a region rule), or an iterable of specific dates as\n * `YYYY-MM-DD` strings, epoch-millisecond numbers or `Date` objects, for a host\n * that just has a list. Resolved to one internal predicate by\n * `vm/HolidayCalendar.ts`'s `resolveHolidayPredicate()`.\n *\n * Left unset, working-day arithmetic skips weekends only, which is the honest\n * default: the engine excludes exactly the days it can prove are non-working.\n */\nexport type HolidayCalendar = HolidayPredicate | Iterable<string | number | Date>;\n\n/**\n * Date-related configuration.\n * Controls the bounds and formatting for date/time expression evaluation\n * (e.g., `today + 20 days`, `last monday`).\n */\n/**\n * How an ambiguous all-numeric date literal is read.\n *\n * - `'auto'`: by separator, the historic behaviour. A slash date is\n *   day-first (`25/12/2023`), a hyphen date is month-first (`12-25-2023`)\n *   unless its first group is four digits, which makes it ISO (`2023-12-25`).\n * - `'DMY'` / `'MDY'` / `'YMD'`: a fixed order for every numeric separator, so\n *   a host can match its readers' locale. `'MDY'` is what lets a US reader's\n *   `12/25/2023` parse, which `'auto'` refuses because the slash defaults to\n *   day-first.\n * - `'locale'`: the order the reader's own machine writes dates in, asked of\n *   `Intl` once per engine (see `calendar/HostLocale.ts`). Where that cannot\n *   be answered, the engine reads dates exactly as `'auto'` does and reports\n *   the fact through `ExpressionEngine.getDateReading()`, rather than guessing.\n *   A host that is not the reader (a server rendering someone else's document)\n *   names the reader instead, through {@link DateConfig.inputLocale}.\n *\n * Only ambiguous literals are affected. A spelled-out month (`March 9, 2024`)\n * is never ambiguous; nor is a hyphen literal with a four-digit leading group\n * (`2024-03-09`), which has no reading but year-month-day and is read as ISO\n * under every order, timestamp or not.\n */\nexport type DateInputOrder = 'auto' | 'locale' | 'DMY' | 'MDY' | 'YMD';\n\n/**\n * What a date-shaped numeric run the configured order cannot read does: report\n * the problem, or fall through to the arithmetic it is spelled like. See\n * {@link DateConfig.onAmbiguous}.\n */\nexport type DateAmbiguity = 'refuse' | 'arithmetic';\n\n/** Date-related engine configuration: offset limits, input order, holidays. */\nexport interface DateConfig {\n  /**\n   * The order an ambiguous all-numeric date literal is read in. Defaults to\n   * `'auto'` (by separator, the historic behaviour). See {@link DateInputOrder}.\n   */\n  readonly inputOrder: DateInputOrder;\n  /**\n   * The BCP-47 tag `'locale'` reads the order from, `\"en-US\"` or `\"de-DE\"`.\n   * Unset, the host machine is asked.\n   *\n   * Read ONLY when {@link inputOrder} is `'locale'`. Setting it beside any\n   * other order changes no result: a field that quietly switched inference on\n   * would make the predictable mistake a wrong reading rather than no change.\n   * Its shape is checked wherever it is set, though, and a tag `Intl` refuses\n   * (`\"en_US\"`, with an underscore) raises `DATE_INPUT_LOCALE_INVALID` at\n   * construction, because a locale silently ignored is a date order silently\n   * wrong.\n   *\n   * Deliberately separate from the engine's `locale` option, which is a\n   * language (`'en' | 'de' | 'fr'`) and carries no region. Day/month order is a\n   * region question: a bare `en` probes as month-first while a UK machine\n   * resolves to `en-GB` and probes as day-first, so wiring the two together\n   * would flip every existing British engine to month-first.\n   */\n  readonly inputLocale?: string;\n  /**\n   * What a date-shaped numeric run the resolved order cannot read does.\n   * Defaults to `'refuse'`.\n   *\n   * - `'refuse'`: the line reports a structured Error value naming the\n   *   problem, DATE_ORDER_MISMATCH when another order would have read it and\n   *   DATE_NOT_A_CALENDAR_DAY when no order names a real day. `12/25/2026` on\n   *   a day-first engine says there is no month 25, rather than answering\n   *   0.00.\n   * - `'arithmetic'`: the run falls through to the division or subtraction it\n   *   is spelled like, which is what every version before this one did.\n   *   `12/25/2026` is 0.00 again, and `2026-02-29` is 1,995.\n   *\n   * The refusal is scoped to runs nobody writes as arithmetic: a two-step\n   * chain ending in a four-digit denominator (`03/04/2026` as division is\n   * 0.0004), and an ISO-shaped hyphen run. A four-digit LEADING group is\n   * ordinary arithmetic (`1000/10/5` is 20, `1024/8/2` is 64) and is never\n   * refused, and neither is a run whose groups are all one or two digits\n   * (`12/13/14` stays 0.07), because a two-digit year is too weak a signal to\n   * hang a refusal on.\n   *\n   * The one refusal this setting does not restore is the dot form\n   * (`25.12.2026` under a month-first order): its only other outcome is a\n   * parse error, and an error is not an answer.\n   */\n  readonly onAmbiguous: DateAmbiguity;\n  /**\n   * How far forward a date offset whose COST grows with the offset may reach,\n   * in years. Enforced by `vm/VM.ts`'s `addBusinessDays()`.\n   *\n   * Bounds the walk, not the calendar. Every other date offset in the engine\n   * is arithmetic on a Date field, so `today + 100000 days` costs exactly what\n   * one day costs and needs no ceiling; workdays are the one offset that has\n   * to step day by day, because which days are skipped depends on where each\n   * step lands. `today + 100000000 workdays` therefore froze the host for\n   * thirteen seconds inside a single ADD opcode (where `vm.maxInstructions`\n   * cannot see it) and then answered \"Invalid Date\", and a trillion never\n   * returned at all.\n   *\n   * Release hardening: this field was declared, documented as a \"safety\n   * limit\", and read nowhere, so it bounded nothing. A limit a host can\n   * configure and the engine ignores is worse than no limit, because it reads\n   * as protection that is not there.\n   */\n  readonly maxOffsetYears: number;\n  /** How far BACK the same walk may reach, in years, as a negative number. See {@link maxOffsetYears}. */\n  readonly minOffsetYears: number;\n  /** Default date string format for display (moment.js format string) */\n  readonly defaultFormat: string;\n  /**\n   * Public-holiday calendar for working-day arithmetic (`N working days after\n   * <date>`, `working days between <date> and <date>`, `<date> + N workdays`).\n   * See {@link HolidayCalendar}.\n   *\n   * Optional and unset by default: with no calendar, working-day arithmetic\n   * skips weekends only. A host that wants holidays excluded too supplies one\n   * here (`new ExpressionEngine({ config: { date: { holidays } } })`), the\n   * same way stocks and weather take a host data source. Threaded into the VM\n   * by `engine/ExpressionEngine.ts` exactly as {@link maxOffsetYears} is,\n   * because working-day math is a VM operation several grammar forms share, so\n   * the calendar has to be one source the VM owns rather than per-package state\n   * the VM cannot see.\n   */\n  readonly holidays?: HolidayCalendar;\n}\n\n/**\n * Performance-related configuration.\n * Controls caching, timeouts, and processing limits to prevent runaway\n * resource consumption on large documents.\n */\nexport interface PerformanceConfig {\n  /**\n   * Maximum number of entries in {@link ExpressionEngine}'s bytecode cache\n   * (per-instance, keyed by expression text) before the oldest entry is\n   * evicted. Raise this for documents with many distinct expressions if\n   * repeated re-evaluation (e.g. scrolling) is re-parsing instead of\n   * hitting cache, bug fix (release hardening pass): this field used to\n   * be read nowhere; the cache size was a hardcoded, unconfigurable\n   * constant. Note this does NOT bound {@link LineCache}, which has no\n   * size limit of its own.\n   */\n  readonly defaultCacheSize: number;\n  /**\n   * Maximum lines a document may have for the engine to process it in one\n   * pass. Enforced by `ExpressionEngine.parseDocument()` and by\n   * `engine/DocumentModel.ts`'s `setDocument()`, the two entry points that\n   * take a whole document.\n   *\n   * A document costs memory per line whatever each line says: a parsed line\n   * record, a cache entry, a dependency-graph node. Two hundred thousand\n   * lines of `1 + 1` therefore exhausted the heap and aborted the process\n   * before any per-line limit had anything to object to, which is the same\n   * shape of hole as an unbounded expression and needs the same kind of\n   * ceiling. Refusing the document names the limit; a host that genuinely has\n   * a larger one raises this field.\n   *\n   * Release hardening: declared and read nowhere until now.\n   */\n  readonly maxDocumentLines: number;\n}\n\n/**\n * Validation / safety-limit configuration.\n * Protects against runaway expressions that could cause excessive memory use\n * or stack overflow. These limits are checked during lexing and parsing.\n */\n/** Bounds on untrusted input: expression length and nesting depth. */\nexport interface ValidationConfig {\n  /** Maximum expression length in characters. Prevents excessively long strings from entering the pipeline. */\n  readonly maxExpressionLength: number;\n  /** Maximum expression complexity score (`tokens + functionCalls×5 + nestingDepth×10`). Protects against deeply nested or combinatorially complex expressions. */\n  readonly maxComplexity: number;\n  /** Maximum parentheses nesting depth. Prevents stack overflow in the recursive-descent parser. */\n  readonly maxNestingDepth: number;\n  /**\n   * Auto-balance unmatched parentheses by appending missing closing parens\n   * or prepending missing opening parens. When disabled, unbalanced expressions\n   * cause parse errors instead of being silently corrected.\n   *\n   * Disabled by default for strict parsing. Enable for forgiving user input\n   * (e.g., chat-style calculators where users often omit closing parens).\n   * Has zero overhead when disabled, the O(n) paren-count scan is skipped.\n   */\n  readonly autoBalanceParens: boolean;\n}\n\n/**\n * Worker pool configuration.\n * Controls the parallel execution workers used for batch evaluation.\n */\nexport interface WorkerConfig {\n  /** Maximum number of concurrent Web Workers allowed */\n  readonly maxConcurrentWorkers: number;\n  /** Time (ms) a worker stays alive while idle before being terminated */\n  readonly idleTimeoutMs: number;\n  /** Maximum retry attempts for a failed worker operation */\n  readonly maxRetries: number;\n  /** Base backoff delay (ms) between retries (exponential backoff applied on top) */\n  readonly baseBackoffMs: number;\n}  /**\n   * Diagnostic / telemetry configuration.\n   * Controls the diagnostic event pipeline for profiling and debugging.\n   * All diagnostics are disabled by default for maximum production performance.\n   */\n  export interface DiagnosticConfig {\n    /** Master switch: enable the diagnostic pipeline (collectors receive events for all pipeline stages) */\n    readonly enabled: boolean;\n    /** Enable VM trace mode, emits per-opcode execution events (very verbose; disables some optimizations) */\n    readonly vmTraceEnabled: boolean;\n  }\n\n  /**\n   * Proactive background refresh of live async values.\n   *\n   * Off by default. When a live value (a stock quote, an FX rate) has gone\n   * stale, today it only refetches on the next re-evaluation (a keystroke), so a\n   * note left open silently ages. With this enabled, the engine drives a refetch\n   * on each such value's own cadence (the resolver's `refetchIntervalMs`) for the\n   * values currently on screen, and pushes the fresh result to the host through\n   * the same event stream the pull path uses. It needs timers and a live editor\n   * consuming that stream, so a headless or batch host leaves it off.\n   */\n  export interface BackgroundRefreshConfig {\n    /** Master switch. When false, no timers run and every value refreshes only on re-evaluation. */\n    readonly enabled: boolean;\n  }\n\n  /**\n   * Whether the engine may reach the network at all.\n   *\n   * On by default, which is the historic behaviour: a city name or a currency\n   * pair in a line fetches live data from a public endpoint as soon as the\n   * line evaluates. A host embedding the engine somewhere that must not make\n   * outbound requests (an offline document, a sandboxed evaluation, a tenant\n   * with egress rules) switches it off here and gets the same engine with no\n   * egress: every live-data form answers with a `NETWORK_DISABLED` error\n   * naming the setting, instead of a request.\n   *\n   * The gate closes before any request is made. It stops every async\n   * resolver a package registers (weather, currency, stocks, crypto,\n   * knowledge, and any host-supplied one) unless the resolver declares\n   * itself `local` (it reads engine state, never a network; the engine's own\n   * global-variable resolver is the one built-in case). It also refuses the\n   * result of a plugin function that returns a promise. That last case is a\n   * boundary rather than a guarantee: such a function has already run by the\n   * time the engine sees the promise, so a package that fetches inside a\n   * plugin function rather than through an async resolver may still have\n   * started its request. The documented shape for live data is the resolver\n   * (`createQueryResolver`), which this gate stops cold.\n   *\n   * Rates a host primes by hand (`currencyExchangeService.primeRates`) keep\n   * working with the network off, which is what an offline host with its own\n   * rate table wants.\n   */\n  export interface NetworkConfig {\n    /** Master switch. When false, no async resolver runs and no live value is fetched. */\n    readonly enabled: boolean;\n  }\n\n  /**\n   * Virtual Machine configuration.\n   * Controls the internal bytecode VM that executes compiled expressions.\n   */\n  export interface VMConfig {\n    /** Maximum stack depth (value slots) for VM execution, prevents stack overflow in recursive/pratt-parser generated bytecode */\n    readonly maxStackDepth: number;\n    /** Maximum opcodes executed per expression, halts runaway infinite loops */\n    readonly maxInstructions: number;\n    /**\n     * Maximum elements a collection may be expanded to before `map`/`reduce`/\n     * `sum`/`prod` will iterate it.\n     *\n     * A Range is stored as its two bounds and costs nothing until something\n     * materializes it, at which point it becomes one Value per element. Twenty\n     * characters (`sum(x, 1:100000000)`) therefore asked for a hundred million\n     * of them, and neither `maxInstructions` nor `maxStackDepth` could see it:\n     * the expansion happens inside a single opcode, so the instruction counter\n     * is never consulted while it runs, and the elements never reach the value\n     * stack. V8 aborted the whole process with \"Reached heap limit\", which a\n     * host embedding the engine cannot catch.\n     */\n    readonly maxCollectionSize: number;\n    /**\n     * Maximum elements (collection Values, matrix cells) one evaluation may\n     * materialize in total.\n     *\n     * `maxCollectionSize` above bounds a single collection. This bounds the sum\n     * of everything an expression asks for, which is a different question and\n     * the one that actually protects the host: two collections that are\n     * individually legal are legal together, and an operation whose result is\n     * the PRODUCT of two legal operands is bounded by neither of them. A matrix\n     * multiply is exactly that shape, so three lines within every other limit\n     * (`:a = map(1*x, 0:20000)`, `:b = transpose(a)`, `b * a`) asked for four\n     * hundred million cells and aborted the process.\n     *\n     * Counted in elements rather than bytes, because a count is what a call\n     * site has before it allocates. An element is 8 bytes as a numeric matrix\n     * cell and closer to a hundred as a full Value, so the default is worth\n     * roughly 16 MB of matrix or 200 MB of expanded collection: far past any\n     * document and far short of what an editor cannot survive.\n     */\n    readonly maxAllocatedElements: number;\n    /**\n     * Maximum user-defined-function calls one evaluation may make in TOTAL,\n     * however deeply or widely they nest.\n     *\n     * `maxFunctionRecursionDepth` bounds how DEEP calls nest and cannot see\n     * how MANY there are, and those are different numbers. Twenty-two lines of\n     * `f(n)(v) = f(n-1)(v) + f(n-1)(v)` reach a depth of only 22 against a\n     * limit of 50, and make 2,097,152 calls doing it: a fatal heap abort in\n     * under a second. `maxInstructions` cannot bound it either, because\n     * `executeBytecode()` re-enters itself per call and each reentrant call\n     * gets its OWN instruction count, so recursion refreshes its allowance on\n     * the way in. This is the tally that does not refresh; see\n     * `vm/AllocationBudget.ts`, which holds it for the same reason it holds\n     * the element tally.\n     *\n     * Counted in calls rather than in the instructions they run, because the\n     * call is the thing that multiplies: every call allocates a frame, its\n     * arguments and its result whatever its body says.\n     */\n    readonly maxFunctionCalls: number;\n    /**\n     * Hard ceiling on how many bisection steps goal seek (`solve line N for\n     * <var> = <target>`, see `packages/goalseek/`) may take before it gives up\n     * with a structured error rather than continuing.\n     *\n     * Goal seek re-evaluates the target line's expression once per step while\n     * narrowing an interval, and an untrusted document must never be able to\n     * make that loop spin. `maxInstructions` bounds each individual\n     * re-evaluation, but not how many of them the search performs, so this is\n     * the tally that bounds the search itself, the same reason `maxFunctionCalls`\n     * exists alongside `maxInstructions`. Bisection halves the interval every\n     * step, so a hundred steps resolves an input to roughly one part in 2^100:\n     * far past any precision a document needs, and a definite stop either way.\n     */\n    readonly maxGoalSeekIterations: number;\n  }\n\n/**\n * Complete engine configuration.\n *\n * Every field has a default in `DEFAULT_CONFIG`. To customize, pass a\n * `Partial<EngineConfig>` when constructing `ExpressionEngine`. Only the\n * sections/fields you supply are overridden; all others use their defaults.\n *\n * @example\n * ```typescript\n * import { ExpressionEngine } from \"solve-js\";\n *\n * const engine = new ExpressionEngine({ config: {\n *   validation: {\n *     maxExpressionLength: 1000,\n *     maxComplexity: 200,\n *   },\n *   // date, performance, vm, worker, diagnostic all use defaults\n * } });\n * ```\n */\nexport interface EngineConfig {\n    /** Date/time expression evaluation bounds and formatting */\n    readonly date: DateConfig;\n    /** Performance budgets and cache sizing */\n    readonly performance: PerformanceConfig;\n    /** Safety limits for expression complexity */\n    readonly validation: ValidationConfig;\n    /** Internal bytecode VM configuration */\n    readonly vm: VMConfig;\n    /** Parallel worker pool configuration */\n    readonly worker: WorkerConfig;\n    /** Diagnostic pipeline configuration */\n    readonly diagnostic: DiagnosticConfig;\n    /** Proactive background refresh of live async values */\n    readonly backgroundRefresh: BackgroundRefreshConfig;\n    /** Whether live data may be fetched at all. See {@link NetworkConfig}. */\n    readonly network: NetworkConfig;\n  }\n\n/**\n * A partial {@link EngineConfig} override, one section at a time.\n *\n * Overrides are merged per section over {@link DEFAULT_CONFIG}, so you can set a\n * single field of one section (`{ validation: { maxExpressionLength: 1000 } }`)\n * and keep every other default in that section. A plain `Partial<EngineConfig>`\n * cannot express that, it demands a whole section object, which is why the\n * documented overrides never typechecked against it. This is the type the\n * constructor and {@link createEngine} accept.\n */\nexport type EngineConfigOverride = {\n  readonly [K in keyof EngineConfig]?: Partial<EngineConfig[K]>;\n};\n\n/**\n * Default configuration values\n */\nexport const DEFAULT_CONFIG: EngineConfig = {\n   date: {\n     // A century of workdays is about 26,000 steps, which is microseconds,\n     // and past any offset a person means. The walk is what these bound; see\n     // DateConfig above for why no other date offset needs a ceiling.\n     maxOffsetYears: 100,\n     minOffsetYears: -100,\n     defaultFormat: 'YYYY-MM-DD',\n     inputOrder: 'auto',\n     // A date-shaped run no order can read reports the problem rather than\n     // answering the fraction it is spelled like. See DateConfig.onAmbiguous\n     // for the shapes this covers and the ones it deliberately does not.\n     onAmbiguous: 'refuse',\n   },\n   performance: {\n     // Preserves the effective cache size the hardcoded (now-removed)\n     // BYTECODE_CACHE_MAX_ENTRIES constant had, so wiring this field up\n     // doesn't silently shrink the default cache for existing consumers.\n     defaultCacheSize: 2000,\n     // Raised from the 10,000 this field was declared with, which was never\n     // enforced and turned out to be under what this engine already supports:\n     // its paging design is tested against a 20,000-line document\n     // (`engine/PageManager.ts` and its spec) and its throughput benchmark\n     // parses a 50,000-line one. Twice the largest of those, and the same\n     // number `ConfigManager.validate()` already refuses to go above.\n     //\n     // Measured under a 256MB heap: setting a 100,000-line document costs\n     // 64MB, evaluating every line of a 20,000-line one costs 106MB, and\n     // 200,000 lines aborts the process before a single expression is looked\n     // at. A host with a small heap should lower this; the ceiling is here to\n     // stop the size that cannot work anywhere.\n     maxDocumentLines: 100000,\n   },\n    validation: {\n      maxExpressionLength: 2000,\n      maxComplexity: 500,\n      maxNestingDepth: 50,\n      autoBalanceParens: false,\n    },\n    vm: {\n      maxStackDepth: 200,\n      maxInstructions: 50000,\n      // Two orders of magnitude above anything a person types by hand (the\n      // longest range in the test suite is 1000 elements) and small enough\n      // that expanding it is measured in milliseconds rather than in whether\n      // the host survives.\n      maxCollectionSize: 100000,\n      // Twenty times the single-collection ceiling above, so an expression may\n      // legitimately handle a number of large collections, and two hundred\n      // times below the allocation that took the process down.\n      maxAllocatedElements: 2000000,\n      // Six hundred times the largest call count any test or example makes\n      // (five levels of composition is sixteen calls), and small enough that\n      // the calls it does allow cost single-digit megabytes rather than the\n      // heap. A document that needs more than ten thousand calls on one line\n      // is doing something a calculator was not built for.\n      maxFunctionCalls: 10000,\n      // A hundred bisection steps resolve an input to one part in 2^100, far\n      // finer than any document needs and a firm stop for an untrusted one. A\n      // continuous, monotonic relationship converges in tens of steps, well\n      // under this; hitting it means the target is unreachable or the\n      // relationship is not the smooth one goal seek assumes.\n      maxGoalSeekIterations: 100,\n    },\n    worker: {\n      maxConcurrentWorkers: 4,\n      idleTimeoutMs: 30000,\n      maxRetries: 3,\n      baseBackoffMs: 1000,\n    },\n    diagnostic: {\n      enabled: false,\n      vmTraceEnabled: false,\n    },\n    backgroundRefresh: {\n      enabled: false,\n    },\n    network: {\n      // On, because it is what every existing consumer gets today. A host that\n      // must not make outbound requests turns it off; see NetworkConfig.\n      enabled: true,\n    },\n  };\n\n/**\n * Merge a partial config override onto a base `EngineConfig`, section by\n * section, `{ ...base.section, ...override.section }` for each of the 8\n * top-level sections, not a single top-level spread.\n *\n * A shallow `{ ...base, ...override }` at the TOP level replaces an entire\n * section wholesale the moment a caller overrides even one field in it\n * (e.g. `{ performance: { defaultCacheSize: 500 } }` would silently drop\n * every other `performance.*` field back to `undefined`, not to its\n * default). This function exists specifically so every config consumer\n * shares one correct merge instead of each hand-rolling (and risking) its\n * own. `ConfigManager` and `ExpressionEngine` both call this rather than\n * either duplicating the section list or instantiating a whole\n * `ConfigManager` just to reuse its private merge logic.\n */\nexport function mergeEngineConfig(\n  base: EngineConfig,\n  override: EngineConfigOverride\n): EngineConfig {\n  return {\n    date: { ...base.date, ...override.date },\n    performance: { ...base.performance, ...override.performance },\n    validation: { ...base.validation, ...override.validation },\n    vm: { ...base.vm, ...override.vm },\n    worker: { ...base.worker, ...override.worker },\n    diagnostic: { ...base.diagnostic, ...override.diagnostic },\n    backgroundRefresh: { ...base.backgroundRefresh, ...override.backgroundRefresh },\n    network: { ...base.network, ...override.network },\n  };\n}\n\n/**\n * Configuration manager for engine settings\n *\n * @example\n * ```typescript\n * const configManager = new ConfigManager();\n * configManager.set('performance.defaultCacheSize', 2000);\n * const cacheSize = configManager.get('performance.defaultCacheSize');\n * ```\n */\nexport class ConfigManager {\n  private config: EngineConfig;\n\n  constructor(config: Partial<EngineConfig> = {}) {\n    this.config = mergeEngineConfig(DEFAULT_CONFIG, config);\n  }\n\n  /**\n   * Get configuration value by path\n   * \n   * @param path - Dot-notation path to config value\n   * @returns Configuration value\n   */\n  get<T>(path: string): T {\n    const keys = path.split('.');\n    let current: unknown = this.config;\n\n    for (const key of keys) {\n      if (current && typeof current === 'object' && key in current) {\n        current = (current as Record<string, unknown>)[key];\n      } else {\n        throw ErrorFactory.config(\n          \"CONFIG_PATH_NOT_FOUND\",\n          `Configuration path not found: ${path}`,\n          { path }\n        );\n      }\n    }\n\n    return current as T;\n  }\n\n  /**\n   * Set configuration value by path\n   * \n   * @param path - Dot-notation path to config value\n   * @param value - New value\n   */\n  set<T>(path: string, value: T): void {\n    const keys = path.split('.');\n    if (keys.length < 2) {\n      throw ErrorFactory.config(\n        \"INVALID_CONFIG_PATH\",\n        `Invalid path: ${path}. Must be in format 'section.property'`,\n        { path }\n      );\n    }\n    \n    const section = keys[0];\n    const property = keys[1];\n    \n    if (!(section in this.config)) {\n      throw ErrorFactory.config(\n        \"CONFIG_SECTION_NOT_FOUND\",\n        `Configuration section not found: ${section}`,\n        { section, path }\n      );\n    }\n    \n    const sectionConfig = this.config[section as keyof EngineConfig];\n    if (sectionConfig && typeof sectionConfig === 'object') {\n      (sectionConfig as unknown as Record<string, unknown>)[property] = value;\n    } else {\n      throw ErrorFactory.config(\n        \"CONFIG_PROPERTY_NOT_FOUND\",\n        `Configuration property not found: ${path}`,\n        { path }\n      );\n    }\n  }\n\n  /**\n   * Get complete configuration.\n   *\n   * A detached copy, section objects included. A top-level spread would hand\n   * the caller this manager's own section objects, so `getConfig().vm.x = 1`\n   * would be an undeclared back door into {@link set}, bypassing its path\n   * validation and reaching every later {@link get}.\n   */\n  getConfig(): EngineConfig {\n    return mergeEngineConfig(this.config, {});\n  }\n\n  /**\n   * Update multiple configuration values\n   */\n  update(config: Partial<EngineConfig>): void {\n    this.config = mergeEngineConfig(this.config, config);\n  }\n\n  /**\n   * Reset to default configuration.\n   *\n   * Goes through {@link mergeEngineConfig} for the same reason the constructor\n   * does. A top-level `{ ...DEFAULT_CONFIG }` copies the six section\n   * references, not the sections, so after a reset this manager's\n   * `performance` object WAS `DEFAULT_CONFIG.performance` and the next\n   * `set('performance.x', ...)` wrote into the module constant. That constant\n   * is what every `ExpressionEngine` is built from, so one manager's reset\n   * could change the cache size, instruction ceiling or allocation budget of\n   * every engine constructed later in the process.\n   */\n  reset(): void {\n    this.config = mergeEngineConfig(DEFAULT_CONFIG, {});\n  }\n\n  /**\n   * Validate configuration values\n   */\n  validate(): ValidationResult {\n    const errors: string[] = [];\n\n    // Validate performance config\n    if (this.config.performance.maxDocumentLines > 100000) {\n      errors.push('maxDocumentLines cannot exceed 100,000');\n    }\n\n    // Validate date config\n    if (this.config.date.maxOffsetYears > 1000) {\n      errors.push('maxOffsetYears cannot exceed 1000');\n    }\n\n    return {\n      valid: errors.length === 0,\n      error: errors.join('; '),\n      warnings: []\n    };\n  }\n}\n\n/**\n * Result type for {@link ConfigManager.validate}.\n */\nexport interface ValidationResult {\n  valid: boolean;\n  error?: string;\n  warnings?: string[];\n}\n\n"]}