solve-engine 1.1.1 → 2.0.0

package/dist/chunk-YVKHEAFT.js

@@ -0,0 +1,2 @@
+import {a,c}from'./chunk-IJMNVBIS.js';import {a as a$1}from'./chunk-62LMTO4F.js';import {c as c$1}from'./chunk-MPB7KUN5.js';var o={Lowest:0,Assignment:10,LogicalOr:12,LogicalAnd:14,Conjunction:16,BitwiseOr:18,BitwiseXor:20,BitwiseAnd:22,Conditional:24,Shift:27,Sum:30,Product:40,Uncertainty:45,Exponent:50,Prefix:60,Postfix:70,Call:80};var l={[a.PLUS]:o.Sum,[a.MINUS]:o.Sum,[a.STAR]:o.Product,[a.SLASH]:o.Product,[a.MOD]:o.Product,[a.CARET]:o.Exponent,[a.BIT_OR]:o.BitwiseOr,[a.BIT_XOR]:o.BitwiseXor,[a.BIT_AND]:o.BitwiseAnd,[a.LSHIFT]:o.Shift,[a.RSHIFT]:o.Shift,[a.URSHIFT]:o.Shift,[a.PERCENT]:o.Postfix,[a.OF]:o.Product},m=null;function N(){if(m)return m;let s=0;for(let e of Object.keys(l)){let t=c(e);t>s&&(s=t);}for(let e of Object.values(a)){let t=c(e);t>s&&(s=t);}let n=new Uint8Array(s+1);for(let[e,t]of Object.entries(l)){let u=c(e);n[u]=t;}return m=n,n}function O(){m=null;}var r=255,f=class{constructor(n){this.pluginFunctionIndex=n;this.opcodes=[];this.numbers=[];this.strings=[];this.stringIndex=new Map;this._hasAsync=false;this.userFunctionBodies=[];this.anonymousBodies=[];}get pluginIndexMap(){return this.pluginFunctionIndex}emitPluginCall(n,e){let t=this.pluginFunctionIndex?.get(n);if(t===void 0)throw c$1.execution("UNKNOWN_PLUGIN_FUNCTION",`No registered plugin function named "${n}". A package must declare it in its pluginFunctions record and be registered before an expression using it is parsed.`,{functionName:n});this.emitOpcode(50),this.emitIndex(t),this.emitIndex(e);}emitOpcode(n){this.opcodes.push(n),n===50&&(this._hasAsync=true);}emitNumber(n){let e=this.numbers.length;if(e>r)throw c$1.parsing("TOO_MANY_NUMERIC_CONSTANTS",`Expression has more than ${r+1} numeric literals, exceeding the bytecode constant pool's limit.`,{limit:r+1});this.numbers.push(n),this.opcodes.push(e);}emitString(n){let e=this.stringIndex.get(n);if(e===void 0){if(e=this.strings.length,e>r)throw c$1.parsing("TOO_MANY_STRING_CONSTANTS",`Expression has more than ${r+1} distinct string literals, exceeding the bytecode constant pool's limit.`,{limit:r+1});this.strings.push(n),this.stringIndex.set(n,e);}this.opcodes.push(e);}emitIndex(n){this.opcodes.push(n);}emitByte(n){this.opcodes.push(n);}get currentLength(){return this.opcodes.length}emitUserFunctionBody(n,e,t){let u=this.userFunctionBodies.length;if(u>r)throw c$1.parsing("TOO_MANY_FUNCTION_DEFINITIONS",`More than ${r+1} function definitions on one line, exceeding the bytecode constant pool's limit.`,{limit:r+1});return this.userFunctionBodies.push({name:n,params:e,program:t}),u}emitAnonymousBody(n,e){let t=this.anonymousBodies.length;if(t>r)throw c$1.parsing("TOO_MANY_ANONYMOUS_BODIES",`More than ${r+1} map/reduce transform expressions on one line, exceeding the bytecode constant pool's limit.`,{limit:r+1});return this.anonymousBodies.push({params:n,program:e}),t}patchJump(n,e){this.opcodes[n]=e;}build(){return {opcodes:new Uint8Array(this.opcodes),numbers:new Float64Array(this.numbers),strings:[...this.strings],constants:new Map,hasAsync:this._hasAsync,userFunctionBodies:this.userFunctionBodies.length>0?[...this.userFunctionBodies]:void 0,anonymousBodies:this.anonymousBodies.length>0?[...this.anonymousBodies]:void 0}}buildInto(n){let e=this.opcodes.length,t=this.numbers.length,u=n&&n.opcodes.length>=e,b=n&&n.numbers.length>=t,h=u?new Uint8Array(n.opcodes.buffer,n.opcodes.byteOffset,e):new Uint8Array(e),p=b?new Float64Array(n.numbers.buffer,n.numbers.byteOffset,t):new Float64Array(t);for(let d=0;d<e;d++)h[d]=this.opcodes[d];for(let d=0;d<t;d++)p[d]=this.numbers[d];return {opcodes:h,numbers:p,strings:[...this.strings],constants:new Map,hasAsync:this._hasAsync,userFunctionBodies:this.userFunctionBodies.length>0?[...this.userFunctionBodies]:void 0,anonymousBodies:this.anonymousBodies.length>0?[...this.anonymousBodies]:void 0}}reset(){this.opcodes.length=0,this.numbers.length=0,this.strings.length=0,this.stringIndex.clear(),this._hasAsync=false,this.userFunctionBodies.length=0,this.anonymousBodies.length=0;}};var B=/^\d{1,3}(\.\d{3}){2,}$/,y=/^\d+$/;function U(s,n){let e=s.endsWith("n")?s.slice(0,-1):s;if(y.test(e))return e;let t=B.test(e)?e.split(".").join(""):A(e,n);if(!y.test(t)){let u=e.includes(".")?".":e.includes(",")?",":e;throw c$1.parsing("INVALID_NUMBER_LITERAL",`"${s}" is not a whole number: "${u}" separates decimals in the ${n} locale, and a whole number cannot have a fractional part.`,{raw:s,localeCode:n,separator:u})}return t}function A(s,n){let e=a$1(n).display.thousandsSeparator;return e?s.split(e).join(""):s}export{o as a,N as b,O as c,f as d,U as e};//# sourceMappingURL=chunk-YVKHEAFT.js.map
+//# sourceMappingURL=chunk-YVKHEAFT.js.map

package/dist/chunk-YVKHEAFT.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/parser/BindingPower.ts","../src/parser/BytecodeBuilder.ts","../src/parser/BigIntLiteral.ts"],"names":["BindingPower","BUILTIN_INFIX_BP","TokenTypes","_bpTable","buildBindingPowerTable","maxId","name","id","tokenTypeId","table","bp","invalidateBindingPowerTable","MAX_CONSTANT_POOL_INDEX","BytecodeBuilder","pluginFunctionIndex","argCount","index","ErrorFactory","op","idx","s","b","params","program","position","target","buf","opLen","numLen","reuseOpcodes","reuseNumbers","opcodes","numbers","i","CHAINED_DOT_THOUSANDS_GROUPS","DIGITS_ONLY","bigIntLiteralDigits","raw","localeCode","withoutSuffix","digits","stripLocaleGrouping","separator","text","thousandsSeparator","getLocale"],"mappings":"4HAWO,IAAMA,CAAAA,CAAe,CAC1B,MAAA,CAAQ,CAAA,CACR,WAAY,EAAA,CACZ,SAAA,CAAW,EAAA,CACX,UAAA,CAAY,EAAA,CAaZ,WAAA,CAAa,GAab,SAAA,CAAW,EAAA,CACX,WAAY,EAAA,CACZ,UAAA,CAAY,GACZ,WAAA,CAAa,EAAA,CACb,KAAA,CAAO,EAAA,CACP,GAAA,CAAK,EAAA,CACL,QAAS,EAAA,CAMT,WAAA,CAAa,GAIb,QAAA,CAAU,EAAA,CACV,OAAQ,EAAA,CACR,OAAA,CAAS,EAAA,CACT,IAAA,CAAM,EACR,EAiDA,IAAMC,CAAAA,CAA2C,CAE/C,CAACC,CAAAA,CAAW,IAAI,EAAOF,CAAAA,CAAa,GAAA,CACpC,CAACE,CAAAA,CAAW,KAAK,EAAMF,EAAa,GAAA,CACpC,CAACE,EAAW,IAAI,EAAOF,EAAa,OAAA,CACpC,CAACE,CAAAA,CAAW,KAAK,EAAMF,CAAAA,CAAa,QACpC,CAACE,CAAAA,CAAW,GAAG,EAAQF,CAAAA,CAAa,QAGpC,CAACE,CAAAA,CAAW,KAAK,EAAMF,CAAAA,CAAa,QAAA,CAOpC,CAACE,CAAAA,CAAW,MAAM,EAAKF,CAAAA,CAAa,SAAA,CACpC,CAACE,CAAAA,CAAW,OAAO,EAAIF,CAAAA,CAAa,UAAA,CACpC,CAACE,EAAW,OAAO,EAAIF,EAAa,UAAA,CACpC,CAACE,EAAW,MAAM,EAAKF,CAAAA,CAAa,KAAA,CACpC,CAACE,CAAAA,CAAW,MAAM,EAAKF,CAAAA,CAAa,MACpC,CAACE,CAAAA,CAAW,OAAO,EAAIF,CAAAA,CAAa,KAAA,CAGpC,CAACE,CAAAA,CAAW,OAAO,EAAIF,CAAAA,CAAa,OAAA,CAGpC,CAACE,CAAAA,CAAW,EAAE,EAASF,CAAAA,CAAa,OACtC,CAAA,CAWIG,CAAAA,CAA8B,IAAA,CAS3B,SAASC,GAAqC,CACnD,GAAID,EAAU,OAAOA,CAAAA,CAGrB,IAAIE,CAAAA,CAAQ,CAAA,CACZ,IAAA,IAAWC,CAAAA,IAAQ,MAAA,CAAO,IAAA,CAAKL,CAAgB,CAAA,CAAG,CAChD,IAAMM,CAAAA,CAAKC,CAAAA,CAAYF,CAAI,CAAA,CACvBC,CAAAA,CAAKF,CAAAA,GAAOA,CAAAA,CAAQE,CAAAA,EAC1B,CAEA,QAAWD,CAAAA,IAAQ,MAAA,CAAO,OAAOJ,CAAU,CAAA,CAAG,CAC5C,IAAMK,CAAAA,CAAKC,CAAAA,CAAYF,CAAI,CAAA,CACvBC,CAAAA,CAAKF,IAAOA,CAAAA,CAAQE,CAAAA,EAC1B,CAEA,IAAME,CAAAA,CAAQ,IAAI,UAAA,CAAWJ,CAAAA,CAAQ,CAAC,CAAA,CACtC,IAAA,GAAW,CAACC,EAAMI,CAAE,CAAA,GAAK,OAAO,OAAA,CAAQT,CAAgB,EAAG,CACzD,IAAMM,CAAAA,CAAKC,CAAAA,CAAYF,CAAI,CAAA,CAC3BG,EAAMF,CAAE,CAAA,CAAIG,EACd,CAEA,OAAAP,EAAWM,CAAAA,CACJA,CACT,CAiBO,SAASE,CAAAA,EAAoC,CAClDR,EAAW,KACb,KC5LMS,CAAAA,CAA0B,GAAA,CAqFnBC,EAAN,KAAsB,CAgB5B,WAAA,CAA6BC,CAAAA,CAAmD,CAAnD,IAAA,CAAA,mBAAA,CAAAA,EAf7B,IAAA,CAAQ,OAAA,CAAoB,EAAC,CAC7B,IAAA,CAAQ,QAAoB,EAAC,CAC7B,IAAA,CAAQ,OAAA,CAAoB,EAAC,CAC7B,KAAQ,WAAA,CAAc,IAAI,IAC1B,IAAA,CAAQ,SAAA,CAAY,MACpB,IAAA,CAAQ,kBAAA,CAAwC,EAAC,CACjD,IAAA,CAAQ,eAAA,CAAsC,GASmC,CAGjF,IAAI,cAAA,EAA0D,CAC7D,OAAO,IAAA,CAAK,mBACb,CAQA,cAAA,CAAeR,CAAAA,CAAcS,CAAAA,CAAwB,CACpD,IAAMC,CAAAA,CAAQ,KAAK,mBAAA,EAAqB,GAAA,CAAIV,CAAI,CAAA,CAChD,GAAIU,CAAAA,GAAU,MAAA,CACb,MAAMC,GAAAA,CAAa,UAClB,yBAAA,CACA,CAAA,qCAAA,EAAwCX,CAAI,CAAA,qHAAA,CAAA,CAC5C,CAAE,aAAcA,CAAK,CACtB,CAAA,CAED,IAAA,CAAK,UAAA,CAAA,EAA6B,CAAA,CAClC,KAAK,SAAA,CAAUU,CAAK,EACpB,IAAA,CAAK,SAAA,CAAUD,CAAQ,EACxB,CAGA,UAAA,CAAWG,CAAAA,CAAkB,CAC5B,IAAA,CAAK,QAAQ,IAAA,CAAKA,CAAE,EAChBA,CAAAA,GAAO,EAAA,GACV,KAAK,SAAA,CAAY,IAAA,EAEnB,CAeA,UAAA,CAAW,CAAA,CAAiB,CAC3B,IAAMC,CAAAA,CAAM,IAAA,CAAK,QAAQ,MAAA,CACzB,GAAIA,EAAMP,CAAAA,CACT,MAAMK,GAAAA,CAAa,OAAA,CAClB,4BAAA,CACA,CAAA,yBAAA,EAA4BL,EAA0B,CAAC,CAAA,gEAAA,CAAA,CACvD,CAAE,KAAA,CAAOA,CAAAA,CAA0B,CAAE,CACtC,CAAA,CAED,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,CAAC,EACnB,IAAA,CAAK,OAAA,CAAQ,KAAKO,CAAG,EACtB,CAWA,UAAA,CAAWC,CAAAA,CAAiB,CAC3B,IAAID,CAAAA,CAAM,IAAA,CAAK,YAAY,GAAA,CAAIC,CAAC,EAChC,GAAID,CAAAA,GAAQ,OAAW,CAEtB,GADAA,CAAAA,CAAM,IAAA,CAAK,OAAA,CAAQ,MAAA,CACfA,EAAMP,CAAAA,CACT,MAAMK,IAAa,OAAA,CAClB,2BAAA,CACA,4BAA4BL,CAAAA,CAA0B,CAAC,CAAA,wEAAA,CAAA,CACvD,CAAE,KAAA,CAAOA,CAAAA,CAA0B,CAAE,CACtC,CAAA,CAED,KAAK,OAAA,CAAQ,IAAA,CAAKQ,CAAC,CAAA,CACnB,IAAA,CAAK,WAAA,CAAY,GAAA,CAAIA,CAAAA,CAAGD,CAAG,EAC5B,CACA,IAAA,CAAK,QAAQ,IAAA,CAAKA,CAAG,EACtB,CASA,SAAA,CAAUA,CAAAA,CAAmB,CAC5B,IAAA,CAAK,OAAA,CAAQ,KAAKA,CAAG,EACtB,CAGA,QAAA,CAASE,CAAAA,CAAiB,CACzB,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAKA,CAAC,EACpB,CAGA,IAAI,aAAA,EAAwB,CAC3B,OAAO,IAAA,CAAK,OAAA,CAAQ,MACrB,CAaA,oBAAA,CAAqBf,CAAAA,CAAcgB,CAAAA,CAAkBC,CAAAA,CAAkC,CACtF,IAAMJ,CAAAA,CAAM,IAAA,CAAK,mBAAmB,MAAA,CACpC,GAAIA,EAAMP,CAAAA,CACT,MAAMK,GAAAA,CAAa,OAAA,CAClB,+BAAA,CACA,CAAA,UAAA,EAAaL,EAA0B,CAAC,CAAA,gFAAA,CAAA,CACxC,CAAE,KAAA,CAAOA,CAAAA,CAA0B,CAAE,CACtC,CAAA,CAED,OAAA,IAAA,CAAK,kBAAA,CAAmB,IAAA,CAAK,CAAE,KAAAN,CAAAA,CAAM,MAAA,CAAAgB,EAAQ,OAAA,CAAAC,CAAQ,CAAC,CAAA,CAC/CJ,CACR,CAWA,iBAAA,CAAkBG,CAAAA,CAAkBC,CAAAA,CAAkC,CACrE,IAAMJ,CAAAA,CAAM,KAAK,eAAA,CAAgB,MAAA,CACjC,GAAIA,CAAAA,CAAMP,CAAAA,CACT,MAAMK,GAAAA,CAAa,OAAA,CAClB,2BAAA,CACA,aAAaL,CAAAA,CAA0B,CAAC,+FACxC,CAAE,KAAA,CAAOA,EAA0B,CAAE,CACtC,CAAA,CAED,OAAA,IAAA,CAAK,eAAA,CAAgB,IAAA,CAAK,CAAE,MAAA,CAAAU,CAAAA,CAAQ,QAAAC,CAAQ,CAAC,EACtCJ,CACR,CAGA,SAAA,CAAUK,CAAAA,CAAkBC,CAAAA,CAAsB,CACjD,KAAK,OAAA,CAAQD,CAAQ,EAAIC,EAC1B,CAMA,OAAyB,CACxB,OAAO,CACN,OAAA,CAAS,IAAI,UAAA,CAAW,KAAK,OAAO,CAAA,CACpC,QAAS,IAAI,YAAA,CAAa,KAAK,OAAO,CAAA,CAItC,OAAA,CAAS,CAAC,GAAG,IAAA,CAAK,OAAO,CAAA,CACzB,SAAA,CAAW,IAAI,GAAA,CACf,QAAA,CAAU,KAAK,SAAA,CACf,kBAAA,CAAoB,IAAA,CAAK,kBAAA,CAAmB,MAAA,CAAS,CAAA,CAAI,CAAC,GAAG,IAAA,CAAK,kBAAkB,CAAA,CAAI,MAAA,CACxF,gBAAiB,IAAA,CAAK,eAAA,CAAgB,MAAA,CAAS,CAAA,CAAI,CAAC,GAAG,KAAK,eAAe,CAAA,CAAI,MAChF,CACD,CAeA,UAAUC,CAAAA,CAAuE,CAChF,IAAMC,CAAAA,CAAQ,IAAA,CAAK,OAAA,CAAQ,OACrBC,CAAAA,CAAS,IAAA,CAAK,QAAQ,MAAA,CAEtBC,CAAAA,CAAeH,GAAOA,CAAAA,CAAI,OAAA,CAAQ,MAAA,EAAUC,CAAAA,CAC5CG,CAAAA,CAAeJ,CAAAA,EAAOA,EAAI,OAAA,CAAQ,MAAA,EAAUE,EAG5CG,CAAAA,CAAUF,CAAAA,CACb,IAAI,UAAA,CAAWH,CAAAA,CAAK,OAAA,CAAQ,MAAA,CAAQA,CAAAA,CAAK,OAAA,CAAQ,WAAYC,CAAK,CAAA,CAClE,IAAI,UAAA,CAAWA,CAAK,EACjBK,CAAAA,CAAUF,CAAAA,CACb,IAAI,YAAA,CAAaJ,CAAAA,CAAK,OAAA,CAAQ,OAAQA,CAAAA,CAAK,OAAA,CAAQ,WAAYE,CAAM,CAAA,CACrE,IAAI,YAAA,CAAaA,CAAM,CAAA,CAG1B,IAAA,IAASK,CAAAA,CAAI,CAAA,CAAGA,EAAIN,CAAAA,CAAOM,CAAAA,EAAAA,CAAKF,EAAQE,CAAC,CAAA,CAAI,KAAK,OAAA,CAAQA,CAAC,CAAA,CAC3D,IAAA,IAASA,CAAAA,CAAI,CAAA,CAAGA,EAAIL,CAAAA,CAAQK,CAAAA,EAAAA,CAAKD,EAAQC,CAAC,CAAA,CAAI,KAAK,OAAA,CAAQA,CAAC,CAAA,CAE5D,OAAO,CACN,OAAA,CAAAF,EACA,OAAA,CAAAC,CAAAA,CACA,QAAS,CAAC,GAAG,KAAK,OAAO,CAAA,CACzB,SAAA,CAAW,IAAI,GAAA,CACf,QAAA,CAAU,KAAK,SAAA,CACf,kBAAA,CAAoB,KAAK,kBAAA,CAAmB,MAAA,CAAS,EAAI,CAAC,GAAG,IAAA,CAAK,kBAAkB,CAAA,CAAI,MAAA,CACxF,gBAAiB,IAAA,CAAK,eAAA,CAAgB,OAAS,CAAA,CAAI,CAAC,GAAG,IAAA,CAAK,eAAe,CAAA,CAAI,MAChF,CACD,CAEA,OAAc,CAIb,IAAA,CAAK,QAAQ,MAAA,CAAS,CAAA,CACtB,KAAK,OAAA,CAAQ,MAAA,CAAS,CAAA,CACtB,IAAA,CAAK,OAAA,CAAQ,MAAA,CAAS,EACtB,IAAA,CAAK,WAAA,CAAY,OAAM,CACvB,IAAA,CAAK,UAAY,KAAA,CACjB,IAAA,CAAK,kBAAA,CAAmB,MAAA,CAAS,CAAA,CACjC,IAAA,CAAK,gBAAgB,MAAA,CAAS,EAC/B,CACD,ECrTA,IAAME,EAA+B,wBAAA,CAG/BC,CAAAA,CAAc,OAAA,CAmBb,SAASC,CAAAA,CAAoBC,CAAAA,CAAaC,EAA4B,CAC5E,IAAMC,EAAgBF,CAAAA,CAAI,QAAA,CAAS,GAAG,CAAA,CAAIA,CAAAA,CAAI,KAAA,CAAM,CAAA,CAAG,EAAE,CAAA,CAAIA,EAG7D,GAAIF,CAAAA,CAAY,KAAKI,CAAa,CAAA,CAAG,OAAOA,CAAAA,CAE5C,IAAMC,CAAAA,CAASN,CAAAA,CAA6B,IAAA,CAAKK,CAAa,EAC3DA,CAAAA,CAAc,KAAA,CAAM,GAAG,CAAA,CAAE,IAAA,CAAK,EAAE,CAAA,CAChCE,CAAAA,CAAoBF,CAAAA,CAAeD,CAAU,CAAA,CAEhD,GAAI,CAACH,CAAAA,CAAY,IAAA,CAAKK,CAAM,CAAA,CAAG,CAC9B,IAAME,CAAAA,CAAYH,CAAAA,CAAc,QAAA,CAAS,GAAG,CAAA,CAAI,GAAA,CAAMA,EAAc,QAAA,CAAS,GAAG,EAAI,GAAA,CAAMA,CAAAA,CAC1F,MAAMtB,GAAAA,CAAa,OAAA,CAClB,wBAAA,CACA,CAAA,CAAA,EAAIoB,CAAG,CAAA,0BAAA,EAA6BK,CAAS,CAAA,4BAAA,EAA+BJ,CAAU,6DACtF,CAAE,GAAA,CAAAD,EAAK,UAAA,CAAAC,CAAAA,CAAY,SAAA,CAAAI,CAAU,CAC9B,CACD,CACA,OAAOF,CACR,CASA,SAASC,CAAAA,CAAoBE,EAAcL,CAAAA,CAA4B,CACtE,IAAMM,CAAAA,CAAqBC,GAAAA,CAAUP,CAAU,EAAE,OAAA,CAAQ,kBAAA,CACzD,OAAOM,CAAAA,CAAqBD,CAAAA,CAAK,KAAA,CAAMC,CAAkB,CAAA,CAAE,IAAA,CAAK,EAAE,CAAA,CAAID,CACvE","file":"chunk-YVKHEAFT.js","sourcesContent":["/**\n * Named precedence levels for the Pratt parser, from loosest (`Lowest`) to\n * tightest (`Call`) binding. A custom infix parselet compares its own\n * binding power against the current expression's to decide whether to\n * consume the next operator (higher power binds tighter, e.g. `*` over `+`).\n *\n * Package authors reference these when declaring an infix parselet in a\n * package's `infixParselets`. See the built-in packages for examples of\n * picking an appropriate level (e.g. arithmetic `+`/`-` use `Sum`, `*`/`/`\n * use `Product`).\n */\nexport const BindingPower = {\n  Lowest: 0,\n  Assignment: 10,\n  LogicalOr: 12,   // `or`, `||` — loosest of the boolean-logic operators\n  LogicalAnd: 14,  // `&&` — binds tighter than `or` (\"a or b and c\" = \"a or (b and c)\")\n  // The word \"and\" (`AND_CONJ`), which is both arithmetic addition (\"5 and 3\"\n  // is 8) and boolean conjunction (\"true and false\"). A phrase parselet\n  // collecting a list (\"average of X, Y and Z\") parses each argument at this\n  // level, and an argument stops at any operator whose power is <= the level it\n  // was parsed at, so putting \"and\" here is what makes it end an argument\n  // rather than be consumed as the addition it also is. Everything an argument\n  // should keep binds tighter, including a genuine \"+\" (`Sum`).\n  //\n  // It sits BELOW `Conditional` because the boolean reading needs comparisons\n  // to be its operands: at 28, \"5 > 3 and 2 > 1\" parsed as \"5 > (3 and 2) > 1\"\n  // and answered false. Above `LogicalAnd` so that \"and\" is still the tighter\n  // of the two conjunctions, and two steps off each neighbour to leave room.\n  Conjunction: 16,\n  // The bitwise trio and the shifts, ordered exactly as C and JavaScript order\n  // them, which is the order every language that borrowed these operators from\n  // C uses: `|` looser than `xor`, `xor` looser than `&`, all three looser than\n  // comparison, and the shifts tighter than comparison but looser than `+`.\n  // They used to share one level (35) between `Sum` and `Product`, so\n  // \"1 + 2 << 3\" answered 17 where JavaScript answers 24 and \"4 & 3 + 1\"\n  // answered 1 where JavaScript answers 4. Each has its own level now because\n  // a shared level makes \"4 | 6 & 3\" group left instead of letting `&` win.\n  //\n  // They stay TIGHTER than `Conjunction` so that a phrase argument parsed at\n  // that level (\"average of 5 | 3, 2 and 4\") keeps its bitwise operators\n  // instead of stopping at the first one.\n  BitwiseOr: 18,   // `|`\n  BitwiseXor: 20,  // the `xor` keyword (`BIT_XOR`), not the `^` exponent token\n  BitwiseAnd: 22,  // `&`\n  Conditional: 24, // comparisons (`==`, `<`, `>=`, ...), tighter than the bitwise trio, looser than the shifts\n  Shift: 27,       // `<<`, `>>`, `>>>`\n  Sum: 30,\n  Product: 40,\n  // `±` (the uncertainty operator), tighter than `+ - * /` and looser than `^`,\n  // so the tolerance attaches to its adjacent values: `12.3 ± 0.5 * 4` reads as\n  // `(12.3 ± 0.5) * 4` (the parenthesised headline case), and `2 + 3 ± 0.5` as\n  // `2 + (3 ± 0.5)`. A Tier-2 parselet (packages/uncertainty/), so this level is\n  // read off the parselet rather than the Tier-1 BUILTIN_INFIX_BP table below.\n  Uncertainty: 45,\n  // `^`, RIGHT-associative: \"2 ^ 3 ^ 2\" is 2^(3^2) = 512, as in mathematics,\n  // Python, Ruby and JavaScript's `**`. See PrecedenceParser.parseExpression\n  // and BinaryOpParselet for the two places that associativity is implemented.\n  Exponent: 50,\n  Prefix: 60,\n  Postfix: 70,\n  Call: 80,\n} as const;\n\n/**\n * Set the binding power of a named operator.\n *\n * Binding power is what decides precedence in the Pratt parser: a higher number\n * binds tighter, so `*` outranks `+`. Changing one changes how every existing\n * expression using that operator parses, which is why packages should allocate\n * a new name rather than adjust a built-in.\n *\n * @param name - Operator name.\n * @param power - Higher binds tighter.\n */\nexport function setBindingPower(name: string, power: number): void {\n  (BindingPower as Record<string, number>)[name] = power;\n}\n\n/**\n * Read the binding power of a named operator.\n *\n * @param name - Operator name.\n * @returns Its binding power, or 0 when the name is unknown, which makes an\n * unregistered operator terminate an expression rather than swallow the rest\n * of it.\n */\nexport function getBindingPower(name: string): number {\n  return (BindingPower as Record<string, number>)[name] ?? 0;\n}\n\n// ── Built-in Infix Operator Binding Power Table ──────────────────────────────\n// Pre-computed Uint8Array lookup indexed by token typeId.\n// value > 0  → built-in infix operator with that binding power\n// value = 0  → not a built-in infix, fall through to Tier 2 parselet registry\n//\n// Built at module load via buildBindingPowerTable(). The table is sparse\n// most entries are 0 since only ~15 of 80+ token types are infix operators.\n//\n// Performance: Uint8Array[typeId] is a single typed array load, no Map.get()\n// no string hashing, no property chain. V8 eliminates bounds checks when typeId\n// is known to be within array length.\n\nimport { TokenTypes } from \"@solve-js/lexer/Token\";\nimport { tokenTypeId } from \"@solve-js/lexer/Token\";\n\n/**\n * Mapping of token type names → binding powers for built-in infix operators.\n * Only operators listed here get the Tier 1 fast path in PrecedenceParser.\n * All other infix tokens use the Tier 2 parselet registry fallback.\n */\nconst BUILTIN_INFIX_BP: Record<string, number> = {\n  // Arithmetic (infix, left-associative)\n  [TokenTypes.PLUS]:     BindingPower.Sum,\n  [TokenTypes.MINUS]:    BindingPower.Sum,\n  [TokenTypes.STAR]:     BindingPower.Product,\n  [TokenTypes.SLASH]:    BindingPower.Product,\n  [TokenTypes.MOD]:      BindingPower.Product,\n\n  // Arithmetic (infix, RIGHT-associative, PrecedenceParser handles this specially)\n  [TokenTypes.CARET]:    BindingPower.Exponent,\n\n  // Bitwise and shift (infix, left-associative), one level each, ordered as C\n  // and JavaScript order them. `>>>` used to be missing from this table\n  // entirely, which left it running at its Tier 2 parselet level while `>>`\n  // ran at the Tier 1 one, so \"16 >> 3 & 1\" and \"16 >>> 3 & 1\" grouped\n  // differently and answered 0 and 8.\n  [TokenTypes.BIT_OR]:   BindingPower.BitwiseOr,\n  [TokenTypes.BIT_XOR]:  BindingPower.BitwiseXor,\n  [TokenTypes.BIT_AND]:  BindingPower.BitwiseAnd,\n  [TokenTypes.LSHIFT]:   BindingPower.Shift,\n  [TokenTypes.RSHIFT]:   BindingPower.Shift,\n  [TokenTypes.URSHIFT]:  BindingPower.Shift,\n\n  // Postfix (no right operand, PrecedenceParser handles this specially)\n  [TokenTypes.PERCENT]:  BindingPower.Postfix,\n\n  // Percentage keyword (infix, left-associative: \"50% of 200\" → MUL)\n  [TokenTypes.OF]:       BindingPower.Product,\n};\n\n// Note: These token types are intentionally NOT in the BP_TABLE, they stay in\n// the Tier 2 parselet registry because they require complex handling:\n//   IN, TO    → UoM conversion parselets (peek at target unit token, complex logic)\n//   DOT       → Property access (chained OBJ_GET, needs left-token tracking)\n//   EQUALS    → Assignment (VariableParselet handles :var = expr pattern)\n//   EQUALITY, NEQ, GTE, LTE → Comparison ops (need dedicated VM opcodes, task 2.15a)\n//   COMMA     → Argument separator (function calls, array/object literals)\n\n/** Cached BP_TABLE, built once at module load, immutable thereafter. */\nlet _bpTable: Uint8Array | null = null;\n\n/**\n * Build the Uint8Array binding power table indexed by token typeId.\n * Idempotent, returns cached table on subsequent calls.\n *\n * Must be called after all token types are registered (via registerAllTokenTypes())\n * and after plugin providers have registered their token types.\n */\nexport function buildBindingPowerTable(): Uint8Array {\n  if (_bpTable) return _bpTable;\n\n  // Size to the largest registered typeId + 1\n  let maxId = 0;\n  for (const name of Object.keys(BUILTIN_INFIX_BP)) {\n    const id = tokenTypeId(name);\n    if (id > maxId) maxId = id;\n  }\n  // Also scan all TokenTypes to ensure table covers all registered IDs\n  for (const name of Object.values(TokenTypes)) {\n    const id = tokenTypeId(name);\n    if (id > maxId) maxId = id;\n  }\n\n  const table = new Uint8Array(maxId + 1);\n  for (const [name, bp] of Object.entries(BUILTIN_INFIX_BP)) {\n    const id = tokenTypeId(name);\n    table[id] = bp;\n  }\n\n  _bpTable = table;\n  return table;\n}\n\n/**\n * Drop the cached table, so the next {@link buildBindingPowerTable} call builds\n * a fresh one sized to the token types registered by then.\n *\n * It does NOT add a plugin's operator to the Tier 1 fast path, which is what\n * this comment used to promise. The values in the table come from\n * `BUILTIN_INFIX_BP`, which is module-private and has no registration path, so\n * a rebuilt table holds the same binding powers and a plugin token still reads\n * 0. `PrecedenceParser.BP_TABLE` is a static initialized once at class\n * definition time and never re-read, so it would not see a rebuild anyway.\n *\n * A plugin's infix operator takes the Tier 2 parselet-registry route instead,\n * which is where an operator whose binding power the engine does not already\n * know is meant to live.\n */\nexport function invalidateBindingPowerTable(): void {\n  _bpTable = null;\n}\n","import { OpCode } from \"@solve-js/parser/OpCode\";\nimport { ErrorFactory } from \"@solve-js/errors/UnifiedErrorFramework\";\n\n/**\n * `BytecodeProgram.opcodes` is a `Uint8Array`, every operand written into\n * it (including constant-pool indices from {@link BytecodeBuilder.emitNumber}/\n * {@link BytecodeBuilder.emitString}) is truncated to a single byte on\n * `build()`. Exceeding this silently wraps the index (e.g. entry 300 reads\n * back as entry 44), producing a wrong result with no error. See\n * {@link BytecodeBuilder.emitNumber} for the guard that turns this into a\n * thrown error instead.\n */\nconst MAX_CONSTANT_POOL_INDEX = 255;\n\n/**\n * Compiled bytecode program produced by {@link BytecodeBuilder}.\n * Ready for consumption by {@link executeBytecode} without further processing.\n */\nexport interface BytecodeProgram {\n\topcodes: Uint8Array;\n\tnumbers: Float64Array;\n\tstrings: string[];\n\tconstants?: Map<number, number>;\n\t/**\n\t * Whether the program contains any async opcodes (CALL_PLUGIN, etc.).\n\t * Set during compilation by the BytecodeBuilder. Allows the engine\n\t * to skip the O(n) resolver preflight check in O(1) for purely\n\t * synchronous expressions like `2 + 2`.\n\t */\n\thasAsync: boolean;\n\t/**\n\t * User-defined-function bodies compiled alongside this program (one\n\t * entry per `name(params) = body` definition on this line). See\n\t * {@link BytecodeBuilder.emitUserFunctionBody}. `OpCode.DEFINE_USER_FUNCTION`'s\n\t * operand is an index into this array, resolved at VM-execution time\n\t * (not parse time) so a diagnostic/lookahead parse that never actually\n\t * executes the definition line has no side effect on `vm.userFunctions`.\n\t */\n\tuserFunctionBodies?: UserFunctionDef[];\n\t/**\n\t * Anonymous function bodies compiled alongside this program, one entry\n\t * per `map`/`reduce` inline transform expression (e.g. the `10*x` in\n\t * `map(10*x, [0,1,500])`). See {@link BytecodeBuilder.emitAnonymousBody}.\n\t * Deliberately a SEPARATE side-table from `userFunctionBodies`, not\n\t * routed through `vm.userFunctions` at all: an inline body has no name\n\t * and must never leak into the persistent name-keyed registry the way\n\t * a real `f(x) = ...` definition does.\n\t */\n\tanonymousBodies?: AnonymousBodyDef[];\n}\n\n/**\n * An anonymous transform body for `map`/`reduce`'s inline-expression form\n * (e.g. `10*x` in `map(10*x, [0,1,500])`, or `acc+x` in `reduce(acc+x,\n * [1,2,3])`). Structurally identical to {@link UserFunctionDef} minus the\n * `name`. See `OpCode.MAP_INVOKE`/`REDUCE_INVOKE` and\n * `vm/VM.ts`'s handlers, which build a call frame from `params`/`args`\n * exactly like `CALL_USER_FUNCTION` does, just without ever registering\n * the body in `vm.userFunctions`.\n */\nexport interface AnonymousBodyDef {\n\tparams: string[];\n\tprogram: BytecodeProgram;\n}\n\n/**\n * A user-defined, parameterized, reusable function's compiled form\n * (`f(x) = 2*x + 1`). See `OpCode.DEFINE_USER_FUNCTION`/`CALL_USER_FUNCTION`\n * and `vm/VM.ts`'s `VM.defineUserFunction`/`getUserFunction`.\n *\n * `program` is the body compiled to its OWN independent `BytecodeProgram`,\n * not a fragment of the definition line's own bytecode. Parameter names\n * inside the body compile to ORDINARY `LOAD_VAR <name>` opcodes, no\n * parse-time rewriting, because parameter resolution happens dynamically\n * at the VM level: `CALL_USER_FUNCTION` pushes a name-keyed call frame\n * (`Map<string, Value>`) before re-executing `program`, and `VM.getVar()`\n * checks the innermost call frame before falling back to the flat\n * document-variable store. This is why a `UNIT`-collision parameter name\n * (e.g. `h` in `area(w, h) = w * h`, which lexes as the \"hour\" unit) needs\n * no special handling anywhere, it's just another `LOAD_VAR \"h\"`, resolved\n * the same way as any other name.\n */\nexport interface UserFunctionDef {\n\tname: string;\n\tparams: string[];\n\tprogram: BytecodeProgram;\n}\n\n/**\n * Direct-to-bytecode compiler for the Pratt parser.\n *\n * Accumulates opcodes, numeric constants, and string references during parsing,\n * then produces a {@link BytecodeProgram} for VM execution. Supports:\n * - Standard build via {@link build}\n * - Zero-copy build into pre-allocated buffers via {@link buildInto}\n * - In-place reset for reuse without reallocation\n */\nexport class BytecodeBuilder {\n\tprivate opcodes: number[] = [];\n\tprivate numbers: number[] = [];\n\tprivate strings: string[] = [];\n\tprivate stringIndex = new Map<string, number>();\n\tprivate _hasAsync = false;\n\tprivate userFunctionBodies: UserFunctionDef[] = [];\n\tprivate anonymousBodies: AnonymousBodyDef[] = [];\n\n\t/**\n\t * The per-engine `plugin function name -> registry index` map, wired in by\n\t * the engine so {@link emitPluginCall} can resolve a name at emit time. The\n\t * same object reference is shared with every builder in an engine (the pool\n\t * and each ad-hoc nested-body builder), and the engine populates it as\n\t * packages register, so a parselet never sees the numeric index.\n\t */\n\tconstructor(private readonly pluginFunctionIndex?: ReadonlyMap<string, number>) {}\n\n\t/** The name->index map, so a nested-body builder inherits the same resolution. */\n\tget pluginIndexMap(): ReadonlyMap<string, number> | undefined {\n\t\treturn this.pluginFunctionIndex;\n\t}\n\n\t/**\n\t * Emit a plugin-function call by NAME. The engine assigns each registered\n\t * `pluginFunctions` entry an index at registration; this resolves the name to\n\t * that index and emits `CALL_PLUGIN` + index + argCount. Package authors emit\n\t * through this rather than a hand-allocated index.\n\t */\n\temitPluginCall(name: string, argCount: number): void {\n\t\tconst index = this.pluginFunctionIndex?.get(name);\n\t\tif (index === undefined) {\n\t\t\tthrow ErrorFactory.execution(\n\t\t\t\t\"UNKNOWN_PLUGIN_FUNCTION\",\n\t\t\t\t`No registered plugin function named \"${name}\". A package must declare it in its pluginFunctions record and be registered before an expression using it is parsed.`,\n\t\t\t\t{ functionName: name },\n\t\t\t);\n\t\t}\n\t\tthis.emitOpcode(OpCode.CALL_PLUGIN);\n\t\tthis.emitIndex(index);\n\t\tthis.emitIndex(argCount);\n\t}\n\n\t/** Emit an {@link OpCode} instruction. */\n\temitOpcode(op: OpCode): void {\n\t\tthis.opcodes.push(op);\n\t\tif (op === OpCode.CALL_PLUGIN) {\n\t\t\tthis._hasAsync = true;\n\t\t}\n\t}\n\n\t/**\n\t * Emit a numeric literal: appends `n` to the program's constant pool and\n\t * writes its index into the opcode stream (read back by the VM as e.g.\n\t * `PUSH_NUMBER <idx>`).\n\t *\n\t * Numeric constants are NOT deduplicated (unlike {@link emitString})\n\t * every call appends a new entry, so an expression with more than\n\t * {@link MAX_CONSTANT_POOL_INDEX}+1 distinct numeric-literal occurrences\n\t * throws rather than silently wrapping the index (see\n\t * `MAX_CONSTANT_POOL_INDEX`'s doc for what that would otherwise do).\n\t *\n\t * @throws If the constant pool would exceed 256 entries.\n\t */\n\temitNumber(n: number): void {\n\t\tconst idx = this.numbers.length;\n\t\tif (idx > MAX_CONSTANT_POOL_INDEX) {\n\t\t\tthrow ErrorFactory.parsing(\n\t\t\t\t\"TOO_MANY_NUMERIC_CONSTANTS\",\n\t\t\t\t`Expression has more than ${MAX_CONSTANT_POOL_INDEX + 1} numeric literals, exceeding the bytecode constant pool's limit.`,\n\t\t\t\t{ limit: MAX_CONSTANT_POOL_INDEX + 1 }\n\t\t\t);\n\t\t}\n\t\tthis.numbers.push(n);\n\t\tthis.opcodes.push(idx);\n\t}\n\n\t/**\n\t * Emit a string literal: interns `s` into the program's string pool\n\t * (deduplicated via `stringIndex`) and writes its index into the opcode\n\t * stream. Subject to the same constant-pool bound as {@link emitNumber},\n\t * but since strings ARE deduplicated, only distinct string values count\n\t * against the limit.\n\t *\n\t * @throws If the string pool would exceed 256 distinct entries.\n\t */\n\temitString(s: string): void {\n\t\tlet idx = this.stringIndex.get(s);\n\t\tif (idx === undefined) {\n\t\t\tidx = this.strings.length;\n\t\t\tif (idx > MAX_CONSTANT_POOL_INDEX) {\n\t\t\t\tthrow ErrorFactory.parsing(\n\t\t\t\t\t\"TOO_MANY_STRING_CONSTANTS\",\n\t\t\t\t\t`Expression has more than ${MAX_CONSTANT_POOL_INDEX + 1} distinct string literals, exceeding the bytecode constant pool's limit.`,\n\t\t\t\t\t{ limit: MAX_CONSTANT_POOL_INDEX + 1 }\n\t\t\t\t);\n\t\t\t}\n\t\t\tthis.strings.push(s);\n\t\t\tthis.stringIndex.set(s, idx);\n\t\t}\n\t\tthis.opcodes.push(idx);\n\t}\n\n\t/**\n\t * Emit a raw numeric operand (0-255) following an opcode, e.g. a\n\t * plugin-function index for `CALL_PLUGIN`, or an argument count. Unlike\n\t * {@link emitOpcode}, this does not go through the `OpCode` enum, so\n\t * package authors use this (not an unsafe cast to `OpCode`) to push\n\t * operands their own opcode handler expects to read positionally.\n\t */\n\temitIndex(idx: number): void {\n\t\tthis.opcodes.push(idx);\n\t}\n\n\t/** Emit a raw byte (0-255), used for fixed small operands like argument counts. */\n\temitByte(b: number): void {\n\t\tthis.opcodes.push(b);\n\t}\n\n\t/** Number of opcodes/operands emitted so far, used to compute jump targets before {@link patchJump}. */\n\tget currentLength(): number {\n\t\treturn this.opcodes.length;\n\t}\n\n\t/**\n\t * Register a compiled user-defined-function body, returning its index\n\t * into this program's `userFunctionBodies` side-table, the caller emits\n\t * that index as `DEFINE_USER_FUNCTION`'s operand via {@link emitIndex}.\n\t * Subject to the same {@link MAX_CONSTANT_POOL_INDEX} bound as\n\t * {@link emitNumber}/{@link emitString} (the index itself is a single\n\t * opcode-stream byte), in practice a single line defines at most a\n\t * handful of functions, so this limit is never realistically reached.\n\t *\n\t * @throws If more than 256 function bodies are registered on one program.\n\t */\n\temitUserFunctionBody(name: string, params: string[], program: BytecodeProgram): number {\n\t\tconst idx = this.userFunctionBodies.length;\n\t\tif (idx > MAX_CONSTANT_POOL_INDEX) {\n\t\t\tthrow ErrorFactory.parsing(\n\t\t\t\t\"TOO_MANY_FUNCTION_DEFINITIONS\",\n\t\t\t\t`More than ${MAX_CONSTANT_POOL_INDEX + 1} function definitions on one line, exceeding the bytecode constant pool's limit.`,\n\t\t\t\t{ limit: MAX_CONSTANT_POOL_INDEX + 1 }\n\t\t\t);\n\t\t}\n\t\tthis.userFunctionBodies.push({ name, params, program });\n\t\treturn idx;\n\t}\n\n\t/**\n\t * Register a compiled `map`/`reduce` anonymous transform body, returning\n\t * its index into this program's `anonymousBodies` side-table, the\n\t * caller emits that index as `MAP_INVOKE`/`REDUCE_INVOKE`'s operand via\n\t * {@link emitIndex}. Same {@link MAX_CONSTANT_POOL_INDEX} bound as\n\t * {@link emitUserFunctionBody}.\n\t *\n\t * @throws If more than 256 anonymous bodies are registered on one program.\n\t */\n\temitAnonymousBody(params: string[], program: BytecodeProgram): number {\n\t\tconst idx = this.anonymousBodies.length;\n\t\tif (idx > MAX_CONSTANT_POOL_INDEX) {\n\t\t\tthrow ErrorFactory.parsing(\n\t\t\t\t\"TOO_MANY_ANONYMOUS_BODIES\",\n\t\t\t\t`More than ${MAX_CONSTANT_POOL_INDEX + 1} map/reduce transform expressions on one line, exceeding the bytecode constant pool's limit.`,\n\t\t\t\t{ limit: MAX_CONSTANT_POOL_INDEX + 1 }\n\t\t\t);\n\t\t}\n\t\tthis.anonymousBodies.push({ params, program });\n\t\treturn idx;\n\t}\n\n\t/** Overwrite a previously-emitted placeholder operand at `position` with the real jump `target`, once known. */\n\tpatchJump(position: number, target: number): void {\n\t\tthis.opcodes[position] = target;\n\t}\n\n\t/**\n\t * Build the accumulated opcodes/numbers/strings into a BytecodeProgram.\n\t * Creates new TypedArrays, the builder can be reused after this call.\n\t */\n\tbuild(): BytecodeProgram {\n\t\treturn {\n\t\t\topcodes: new Uint8Array(this.opcodes),\n\t\t\tnumbers: new Float64Array(this.numbers),\n\t\t\t// Defensive copy: .length = 0 in reset() would clear a shared reference.\n\t\t\t// Strings are rare (only UoM/datetime parselets emit them), so the copy\n\t\t\t// cost is negligible.\n\t\t\tstrings: [...this.strings],\n\t\t\tconstants: new Map(),\n\t\t\thasAsync: this._hasAsync,\n\t\t\tuserFunctionBodies: this.userFunctionBodies.length > 0 ? [...this.userFunctionBodies] : undefined,\n\t\t\tanonymousBodies: this.anonymousBodies.length > 0 ? [...this.anonymousBodies] : undefined,\n\t\t};\n\t}\n\n\t/**\n\t * Build directly into a pre-allocated buffer for zero-copy VM consumption.\n\t *\n\t * When `buf` is provided and large enough, writes into it and returns\n\t * subarray **views** (not copies), the returned TypedArrays share the\n\t * buffer's underlying ArrayBuffer. The caller MUST NOT mutate the buffer\n\t * until the returned BytecodeProgram is no longer needed.\n\t *\n\t * If the caller intends to cache the result, they must copy the TypedArrays\n\t * (e.g. `new Uint8Array(program.opcodes)`) before reusing the buffer pool.\n\t *\n\t * When `buf` is omitted or too small, allocates fresh TypedArrays.\n\t */\n\tbuildInto(buf?: { opcodes: Uint8Array; numbers: Float64Array }): BytecodeProgram {\n\t\tconst opLen = this.opcodes.length;\n\t\tconst numLen = this.numbers.length;\n\n\t\tconst reuseOpcodes = buf && buf.opcodes.length >= opLen;\n\t\tconst reuseNumbers = buf && buf.numbers.length >= numLen;\n\n\t\t// Subarray views that share the buffer's ArrayBuffer (zero-copy)\n\t\tconst opcodes = reuseOpcodes\n\t\t\t? new Uint8Array(buf!.opcodes.buffer, buf!.opcodes.byteOffset, opLen)\n\t\t\t: new Uint8Array(opLen);\n\t\tconst numbers = reuseNumbers\n\t\t\t? new Float64Array(buf!.numbers.buffer, buf!.numbers.byteOffset, numLen)\n\t\t\t: new Float64Array(numLen);\n\n\t\t// Write data into the views\n\t\tfor (let i = 0; i < opLen; i++) opcodes[i] = this.opcodes[i];\n\t\tfor (let i = 0; i < numLen; i++) numbers[i] = this.numbers[i];\n\n\t\treturn {\n\t\t\topcodes,\n\t\t\tnumbers,\n\t\t\tstrings: [...this.strings],\n\t\t\tconstants: new Map(),\n\t\t\thasAsync: this._hasAsync,\n\t\t\tuserFunctionBodies: this.userFunctionBodies.length > 0 ? [...this.userFunctionBodies] : undefined,\n\t\t\tanonymousBodies: this.anonymousBodies.length > 0 ? [...this.anonymousBodies] : undefined,\n\t\t};\n\t}\n\n\treset(): void {\n\t\t// Retain backing stores with .length = 0 to avoid reallocation on growth.\n\t\t// = [] discards the ArrayBuffer, forcing V8 to reallocate on every push()\n\t\t// threshold (4→8→16→32...). For a 50-opcode expression, that's 3-4 copies.\n\t\tthis.opcodes.length = 0;\n\t\tthis.numbers.length = 0;\n\t\tthis.strings.length = 0;\n\t\tthis.stringIndex.clear();\n\t\tthis._hasAsync = false;\n\t\tthis.userFunctionBodies.length = 0;\n\t\tthis.anonymousBodies.length = 0;\n\t}\n}\n","/**\n * Turning a `123n` literal's source text into the digits `PUSH_BIGINT` stores.\n *\n * The lexer coalesces thousands groups into the number token it is building,\n * accepting both `,` and `.` as the separator regardless of locale (see\n * `lexer/ExpressionLexer.ts`'s \"Thousands separators\" block). For a NUMBER that\n * is fine, because the separators are stripped again when the text is turned\n * into a double. For a BIGINT nothing stripped them: both consumers took the\n * token text, removed the trailing `n`, and handed the rest straight to\n * `BigInt()`.\n *\n * So `1.000n` reached `BigInt(\"1.000\")`, which throws a raw `SyntaxError` that\n * arrived at the host as UNEXPECTED_ERROR/INTERNAL: the engine reporting its\n * own bug for six characters a user typed. `1.01n` and `1.1n` were fine, which\n * is the tell that the `n` suffix was never the problem, the three-digit\n * thousands group was: a dot followed by exactly three digits is what the lexer\n * swallows, and one followed by one or two digits it leaves alone.\n *\n * Written once here rather than inline at both call sites. There are two\n * (`parser/PrecedenceParser.ts`'s Tier-1 switch and\n * `packages/biginteger/parselets/BigIntNumberParselet.ts`), they already held\n * identical copies of the `n`-stripping, and the two tiers disagreeing about a\n * literal is a bug shape this codebase has had before.\n *\n * @module BigIntLiteral\n */\n\nimport { getLocale } from \"@solve-js/constants/locales\";\nimport { ErrorFactory } from \"@solve-js/errors/UnifiedErrorFramework\";\n\n/**\n * Two or more dot-separated groups of three, e.g. `1.234.567`.\n *\n * Unambiguous in any locale, since no locale writes two decimal points, so this\n * is stripped without consulting one. Same regex and same reasoning as\n * `NumberParselet.ts`'s copy for the NUMBER path.\n */\nconst CHAINED_DOT_THOUSANDS_GROUPS = /^\\d{1,3}(\\.\\d{3}){2,}$/;\n\n/** Digits and nothing else, which is what `BigInt()` can be handed safely. */\nconst DIGITS_ONLY = /^\\d+$/;\n\n/**\n * The digit string behind a bigint literal.\n *\n * A bigint literal has no fractional part by construction: the lexer only emits\n * BIGINT when it saw no decimal point of its own and no exponent, so any `.` or\n * `,` still in the text got there as a thousands group. Which of the two the\n * writer meant is a locale question, and answering it wrongly would silently\n * change the value by three orders of magnitude, so only the separator this\n * locale actually uses for grouping is removed. Anything left over is refused\n * rather than guessed at.\n *\n * @param raw - The token's text, with or without the trailing `n`.\n * @param localeCode - The engine's active locale.\n * @returns A string of digits, ready for `BigInt()`.\n * @throws An `INVALID_NUMBER_LITERAL` parsing error when what is left is not a\n * whole number, e.g. `1.000n` in a locale that writes decimals with a dot.\n */\nexport function bigIntLiteralDigits(raw: string, localeCode: string): string {\n\tconst withoutSuffix = raw.endsWith(\"n\") ? raw.slice(0, -1) : raw;\n\n\t// The common case first: nothing was grouped, so there is nothing to decide.\n\tif (DIGITS_ONLY.test(withoutSuffix)) return withoutSuffix;\n\n\tconst digits = CHAINED_DOT_THOUSANDS_GROUPS.test(withoutSuffix)\n\t\t? withoutSuffix.split(\".\").join(\"\")\n\t\t: stripLocaleGrouping(withoutSuffix, localeCode);\n\n\tif (!DIGITS_ONLY.test(digits)) {\n\t\tconst separator = withoutSuffix.includes(\".\") ? \".\" : withoutSuffix.includes(\",\") ? \",\" : withoutSuffix;\n\t\tthrow ErrorFactory.parsing(\n\t\t\t\"INVALID_NUMBER_LITERAL\",\n\t\t\t`\"${raw}\" is not a whole number: \"${separator}\" separates decimals in the ${localeCode} locale, and a whole number cannot have a fractional part.`,\n\t\t\t{ raw, localeCode, separator },\n\t\t);\n\t}\n\treturn digits;\n}\n\n/**\n * Removes the active locale's own thousands separator and nothing else.\n *\n * @param text - The literal without its `n`.\n * @param localeCode - The engine's active locale.\n * @returns The text with grouping removed, which the caller then re-checks.\n */\nfunction stripLocaleGrouping(text: string, localeCode: string): string {\n\tconst thousandsSeparator = getLocale(localeCode).display.thousandsSeparator;\n\treturn thousandsSeparator ? text.split(thousandsSeparator).join(\"\") : text;\n}\n"]}

package/dist/chunk-ZCNBT44X.cjs

@@ -0,0 +1,2 @@
+'use strict';var n=class{constructor(){this.resolvers=new Map;}register(e){this.resolvers.has(e.namespace)&&(console.warn(`[ResolverRegistry] Namespace "${e.namespace}" already registered. Destroying old resolver and overwriting. Use distinct namespaces (e.g., "${e.namespace}:sub1", "${e.namespace}:sub2") to avoid collisions when a package needs multiple async resolvers.`),this.resolvers.get(e.namespace).destroy()),this.resolvers.set(e.namespace,e);}unregister(e,r){let s=this.resolvers.get(e);s&&(s.destroy(),this.resolvers.delete(e)),r&&r.removeQueries({queryKey:[e]});}preflightAll(e,r,s,i,l){for(let t of this.resolvers.values()){if(!t.preflight)continue;let o=t.preflight(e,r,s,i,l);if(o)return o}return null}get(e){return this.resolvers.get(e)}get size(){return this.resolvers.size}has(e){return this.resolvers.has(e)}clear(){for(let e of this.resolvers.values())e.destroy();this.resolvers.clear();}};exports.a=n;//# sourceMappingURL=chunk-ZCNBT44X.cjs.map
+//# sourceMappingURL=chunk-ZCNBT44X.cjs.map

package/dist/chunk-ZCNBT44X.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/resolvers/ResolverRegistry.ts"],"names":["ResolverRegistry","resolver","namespace","queryClient","tokens","bytecode","packageId","signal","result"],"mappings":"aAuEO,IAAMA,EAAN,KAAuB,CAAvB,WAAA,EAAA,CACN,IAAA,CAAQ,UAAY,IAAI,IAAA,CAWxB,QAAA,CAASC,CAAAA,CAAgC,CAEpC,IAAA,CAAK,SAAA,CAAU,GAAA,CAAIA,CAAAA,CAAS,SAAS,CAAA,GACxC,OAAA,CAAQ,IAAA,CACP,CAAA,8BAAA,EAAiCA,EAAS,SAAS,CAAA,+FAAA,EAExCA,CAAAA,CAAS,SAAS,YAAYA,CAAAA,CAAS,SAAS,CAAA,0EAAA,CAE5D,CAAA,CACA,KAAK,SAAA,CAAU,GAAA,CAAIA,CAAAA,CAAS,SAAS,EAAG,OAAA,EAAQ,CAAA,CAEjD,IAAA,CAAK,SAAA,CAAU,IAAIA,CAAAA,CAAS,SAAA,CAAWA,CAAQ,EAChD,CAMA,UAAA,CAAWC,CAAAA,CAAmBC,CAAAA,CAAiC,CAC9D,IAAMF,CAAAA,CAAW,IAAA,CAAK,SAAA,CAAU,GAAA,CAAIC,CAAS,CAAA,CACzCD,CAAAA,GACHA,CAAAA,CAAS,OAAA,GACT,IAAA,CAAK,SAAA,CAAU,MAAA,CAAOC,CAAS,GAI5BC,CAAAA,EACHA,CAAAA,CAAY,aAAA,CAAc,CAAE,SAAU,CAACD,CAAS,CAAE,CAAC,EAErD,CASA,YAAA,CAAaE,CAAAA,CAAiBC,CAAAA,CAA2BC,EAAmBC,CAAAA,CAAqBJ,CAAAA,CAAmD,CACnJ,IAAA,IAAWF,KAAY,IAAA,CAAK,SAAA,CAAU,MAAA,EAAO,CAAG,CAC/C,GAAI,CAACA,CAAAA,CAAS,SAAA,CAAW,SACzB,IAAMO,CAAAA,CAASP,CAAAA,CAAS,SAAA,CAAUG,EAAQC,CAAAA,CAAUC,CAAAA,CAAWC,CAAAA,CAAQJ,CAAW,EAClF,GAAIK,CAAAA,CAAQ,OAAOA,CACpB,CACA,OAAO,IACR,CAMA,GAAA,CAAIN,EAA+C,CAClD,OAAO,IAAA,CAAK,SAAA,CAAU,IAAIA,CAAS,CACpC,CAGA,IAAI,MAAe,CAClB,OAAO,IAAA,CAAK,SAAA,CAAU,IACvB,CAKA,GAAA,CAAIA,CAAAA,CAA4B,CAC/B,OAAO,IAAA,CAAK,SAAA,CAAU,GAAA,CAAIA,CAAS,CACpC,CAMA,KAAA,EAAc,CACb,IAAA,IAAWD,KAAY,IAAA,CAAK,SAAA,CAAU,MAAA,EAAO,CAC5CA,EAAS,OAAA,EAAQ,CAElB,KAAK,SAAA,CAAU,KAAA,GAChB,CACD","file":"chunk-ZCNBT44X.cjs","sourcesContent":["import type { QueryClient } from \"@tanstack/query-core\";\nimport type { Token } from \"@solve-js/lexer\";\nimport type { BytecodeProgram } from \"@solve-js/parser/BytecodeBuilder\";\nimport type { Value } from \"@solve-js/vm/Value\";\n\n/**\n * Result from a resolver's preflight() check.\n * Returned when async data is needed, the orchestrator uses this\n * to subscribe to the resolver and return a Pending value immediately.\n */\nexport interface AsyncCheckResult {\n\t/** Unique cache key for deduplication (e.g., \"{packageId}:rates:USD:GBP\") */\n\tqueryKey: string;\n\t/** Promise that resolves to the final Value */\n\tresolver: Promise<Value>;\n\t/** Package owning this resolver */\n\tpackageId: string;\n\t/** AbortSignal for stale-data prevention */\n\tsignal: AbortSignal;\n\t/** Optional metadata for diagnostics */\n\tmetadata?: Record<string, unknown>;\n}\n\n/**\n * Interface for async resolvers registered by packages/plugins.\n *\n * Each resolver handles a domain of async data (currency rates,\n * weather, stock prices, etc.). The preflight() method is called\n * BEFORE VM execution to check if all data is cached. If not,\n * it returns an AsyncCheckResult and the engine skips the VM,\n * returning a Pending value instead.\n */\nexport interface IAsyncResolver {\n\t/** Unique namespace for cache key scoping (e.g., \"currency\", \"weather\") */\n\treadonly namespace: string;\n\n\t/**\n\t * Pre-flight check: called BEFORE VM execution.\n\t *\n\t * Returns null if all data for this expression is cached and ready.\n\t * Returns an AsyncCheckResult if async work is needed.\n\t *\n\t * This method is synchronous, it only checks caches, never fetches.\n\t * If data is missing, it creates a Promise and returns immediately.\n\t *\n\t * @param tokens - The lexed tokens for the expression\n\t * @param bytecode - The compiled bytecode program\n\t * @param pluginId - The plugin ID (for cache key scoping)\n\t * @param signal - AbortSignal for the current evaluation\n\t */\n\tpreflight?(tokens: Token[], bytecode: BytecodeProgram, packageId: string, signal: AbortSignal, queryClient: QueryClient): AsyncCheckResult | null;\n\n\t/**\n\t * Called when the resolver's namespace is being unregistered.\n\t * Clean up any in-flight promises, clear caches, unsubscribe.\n\t */\n\tdestroy(): void;\n}\n\n/**\n * Registry of async resolvers, keyed by namespace.\n *\n * Plugins/packages register resolvers alongside their parselets\n * and opcode handlers. The engine calls preflightAll() before\n * VM execution to short-circuit async expressions.\n *\n * Lifecycle:\n * - register(), when a package is loaded\n * - unregister(), when a package is unloaded (clears cache entries)\n * - clear(), on document switch (clears all resolvers)\n */\nexport class ResolverRegistry {\n\tprivate resolvers = new Map<string, IAsyncResolver>();\n\n\t/**\n\t * Register an async resolver.\n\t *\n\t * Each resolver must have a unique `namespace`. If a resolver with the\n\t * same namespace is already registered, the old one is destroyed and\n\t * replaced (with a console warning). Packages that need multiple async\n\t * operations should use `asyncResolvers: [...]` with distinct namespaces\n\t * (e.g., `\"weather:current\"`, `\"weather:forecast\"`).\n\t */\n\tregister(resolver: IAsyncResolver): void {\n\t\t// Clean up previous resolver with same namespace if any\n\t\tif (this.resolvers.has(resolver.namespace)) {\n\t\t\tconsole.warn(\n\t\t\t\t`[ResolverRegistry] Namespace \"${resolver.namespace}\" already registered. ` +\n\t\t\t\t`Destroying old resolver and overwriting. Use distinct namespaces ` +\n\t\t\t\t`(e.g., \"${resolver.namespace}:sub1\", \"${resolver.namespace}:sub2\") ` +\n\t\t\t\t`to avoid collisions when a package needs multiple async resolvers.`,\n\t\t\t);\n\t\t\tthis.resolvers.get(resolver.namespace)!.destroy();\n\t\t}\n\t\tthis.resolvers.set(resolver.namespace, resolver);\n\t}\n\n\t/**\n\t * Unregister a resolver by namespace.\n\t * Calls destroy() and clears all cache entries with that namespace prefix.\n\t */\n\tunregister(namespace: string, queryClient?: QueryClient): void {\n\t\tconst resolver = this.resolvers.get(namespace);\n\t\tif (resolver) {\n\t\t\tresolver.destroy();\n\t\t\tthis.resolvers.delete(namespace);\n\t\t}\n\t\t// Clear all cache entries for this namespace via TanStack Query\n\t\t// Hierarchical keys: [\"osrs\"] clears all [\"osrs\", ...] queries\n\t\tif (queryClient) {\n\t\t\tqueryClient.removeQueries({ queryKey: [namespace] });\n\t\t}\n\t}\n\n\t/**\n\t * Run all registered resolvers' preflight checks against compiled bytecode.\n\t *\n\t * Returns the first AsyncCheckResult found, or null if all data is ready.\n\t * Short-circuits on first pending, subsequent pending ops will be\n\t * discovered on re-evaluation when the first resolves.\n\t */\n\tpreflightAll(tokens: Token[], bytecode: BytecodeProgram, packageId: string, signal: AbortSignal, queryClient: QueryClient): AsyncCheckResult | null {\n\t\tfor (const resolver of this.resolvers.values()) {\n\t\t\tif (!resolver.preflight) continue;\n\t\t\tconst result = resolver.preflight(tokens, bytecode, packageId, signal, queryClient);\n\t\t\tif (result) return result;\n\t\t}\n\t\treturn null;\n\t}\n\n\t/**\n\t * Get a resolver by namespace.\n\t * Returns undefined if no resolver is registered for that namespace.\n\t */\n\tget(namespace: string): IAsyncResolver | undefined {\n\t\treturn this.resolvers.get(namespace);\n\t}\n\n\t/** Number of registered resolvers. */\n\tget size(): number {\n\t\treturn this.resolvers.size;\n\t}\n\n\t/**\n\t * Check if a resolver is registered for the given namespace.\n\t */\n\thas(namespace: string): boolean {\n\t\treturn this.resolvers.has(namespace);\n\t}\n\n\t/**\n\t * Clear all resolvers (document switch, engine reset).\n\t * Calls destroy() on each resolver and clears the map.\n\t */\n\tclear(): void {\n\t\tfor (const resolver of this.resolvers.values()) {\n\t\t\tresolver.destroy();\n\t\t}\n\t\tthis.resolvers.clear();\n\t}\n}\n"]}

package/dist/chunk-ZLRJ7TDP.cjs

@@ -0,0 +1,2 @@
+'use strict';var queryCore=require('@tanstack/query-core');var t=null;function i(e){t=e;}function l(){return t}function u(){return new queryCore.QueryClient({defaultOptions:{queries:{staleTime:300*1e3,gcTime:600*1e3,retry:3,retryDelay:e=>Math.min(500*2**e,5e3),refetchOnWindowFocus:false,refetchOnReconnect:false}}})}exports.a=i;exports.b=l;exports.c=u;//# sourceMappingURL=chunk-ZLRJ7TDP.cjs.map
+//# sourceMappingURL=chunk-ZLRJ7TDP.cjs.map

package/dist/chunk-ZLRJ7TDP.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/services/DataQueryService.ts"],"names":["_activeQueryClient","setActiveQueryClient","qc","getActiveQueryClient","createQueryClient","QueryClient","attempt"],"mappings":"2DA2BA,IAAIA,CAAAA,CAAyC,KAGtC,SAASC,CAAAA,CAAqBC,CAAAA,CAA8B,CACjEF,CAAAA,CAAqBE,EACvB,CAGO,SAASC,CAAAA,EAA2C,CACzD,OAAOH,CACT,CAMO,SAASI,CAAAA,EAAiC,CAC/C,OAAO,IAAIC,qBAAAA,CAAY,CACrB,cAAA,CAAgB,CACd,OAAA,CAAS,CACP,SAAA,CAAW,GAAA,CAAS,GAAA,CACpB,MAAA,CAAQ,IAAU,GAAA,CAClB,KAAA,CAAO,CAAA,CACP,UAAA,CAAaC,CAAAA,EAAY,IAAA,CAAK,IAAI,GAAA,CAAM,CAAA,EAAKA,CAAAA,CAAS,GAAI,CAAA,CAC1D,oBAAA,CAAsB,KAAA,CACtB,kBAAA,CAAoB,KACtB,CACF,CACF,CAAC,CACH","file":"chunk-ZLRJ7TDP.cjs","sourcesContent":["/**\n * QueryClient factory for the solve-js engine.\n *\n * Creates a TanStack Query QueryClient with sensible defaults for\n * stale-while-revalidate, garbage collection, and retry behavior.\n * The QueryClient is injected into resolvers via the engine, so\n * no global singleton is needed.\n *\n * Removed in this refactor:\n * - DataQueryWorker (worker thread), doesn't solve anything in Obsidian's single-threaded env\n * - localCache (raw Map), replaced by TanStack Query's built-in cache\n * - pendingQueries (manual promise plumbing), TanStack Query handles dedup\n * - DataSourceHandle, registerDataSource, unregisterDataSource, no longer needed\n * - cleanupCache timer, TanStack Query's gc does this automatically\n * - cacheUpdateListeners / errorListeners, TanStack Query has its own observer API\n */\n\nimport { QueryClient } from \"@tanstack/query-core\";\n\n// ── Active query client (execution context) ───────────────────────────────\n// Synchronous VM plugin functions (dispatched via CALL_PLUGIN) can't receive\n// the engine's QueryClient through their (args) => Value ABI, so the engine\n// publishes the client here before each execution and package handlers read\n// it back. This module is the package-agnostic home for that hand-off\n// the engine must not import from a specific package (e.g. packages/osrs)\n// to wire it.\n\nlet _activeQueryClient: QueryClient | null = null;\n\n/** Publish the QueryClient for the execution about to run. Set by the engine. */\nexport function setActiveQueryClient(qc: QueryClient | null): void {\n  _activeQueryClient = qc;\n}\n\n/** Read the QueryClient of the currently executing engine, if any. */\nexport function getActiveQueryClient(): QueryClient | null {\n  return _activeQueryClient;\n}\n\n/**\n * Create a new TanStack Query QueryClient with project defaults.\n * Each engine instance gets its own client for isolation.\n */\nexport function createQueryClient(): QueryClient {\n  return new QueryClient({\n    defaultOptions: {\n      queries: {\n        staleTime: 5 * 60 * 1000,       // 5 minutes\n        gcTime: 10 * 60 * 1000,          // 10 minutes\n        retry: 3,\n        retryDelay: (attempt) => Math.min(500 * 2 ** attempt, 5000),\n        refetchOnWindowFocus: false,\n        refetchOnReconnect: false,       // Not relevant in Obsidian plugin context\n      },\n    },\n  });\n}\n"]}

package/dist/constants.cjs

@@ -1,22 +1,2 @@
-'use strict';
-
-var chunkE23GZEWL_cjs = require('./chunk-E23GZEWL.cjs');
-require('./chunk-B4HBEFTB.cjs');
-require('./chunk-B7LXJ6LC.cjs');
-
-
-
-Object.defineProperty(exports, "ConfigManager", {
-  enumerable: true,
-  get: function () { return chunkE23GZEWL_cjs.ConfigManager; }
-});
-Object.defineProperty(exports, "DEFAULT_CONFIG", {
-  enumerable: true,
-  get: function () { return chunkE23GZEWL_cjs.DEFAULT_CONFIG; }
-});
-Object.defineProperty(exports, "ENGINE_VERSION", {
-  enumerable: true,
-  get: function () { return chunkE23GZEWL_cjs.ENGINE_VERSION; }
-});
-//# sourceMappingURL=constants.cjs.map
+'use strict';var chunkUDQ57ZRX_cjs=require('./chunk-UDQ57ZRX.cjs');require('./chunk-SOMGSIO4.cjs');Object.defineProperty(exports,"ConfigManager",{enumerable:true,get:function(){return chunkUDQ57ZRX_cjs.d}});Object.defineProperty(exports,"DEFAULT_CONFIG",{enumerable:true,get:function(){return chunkUDQ57ZRX_cjs.b}});Object.defineProperty(exports,"ENGINE_VERSION",{enumerable:true,get:function(){return chunkUDQ57ZRX_cjs.a}});//# sourceMappingURL=constants.cjs.map
 //# sourceMappingURL=constants.cjs.map

package/dist/constants.d.cts

@@ -1,4 +1,4 @@
-export { C as ConfigManager, D as DEFAULT_CONFIG, a as DateConfig, b as DiagnosticConfig, E as EngineConfig, H as HolidayCalendar, c as HolidayPredicate, P as PerformanceConfig, V as VMConfig, d as ValidationConfig, e as ValidationResult, W as WorkerConfig } from './Configuration-C9W8tJv_.cjs';
+export { C as ConfigManager, D as DEFAULT_CONFIG, b as DateConfig, c as DiagnosticConfig, a as EngineConfig, E as EngineConfigOverride, H as HolidayCalendar, d as HolidayPredicate, P as PerformanceConfig, V as VMConfig, e as ValidationConfig, f as ValidationResult, W as WorkerConfig } from './Configuration-B6W0-T67.cjs';
 
 /**
  * The running engine's version, taken from package.json.

package/dist/constants.d.ts

@@ -1,4 +1,4 @@
-export { C as ConfigManager, D as DEFAULT_CONFIG, a as DateConfig, b as DiagnosticConfig, E as EngineConfig, H as HolidayCalendar, c as HolidayPredicate, P as PerformanceConfig, V as VMConfig, d as ValidationConfig, e as ValidationResult, W as WorkerConfig } from './Configuration-C9W8tJv_.js';
+export { C as ConfigManager, D as DEFAULT_CONFIG, b as DateConfig, c as DiagnosticConfig, a as EngineConfig, E as EngineConfigOverride, H as HolidayCalendar, d as HolidayPredicate, P as PerformanceConfig, V as VMConfig, e as ValidationConfig, f as ValidationResult, W as WorkerConfig } from './Configuration-B6W0-T67.js';
 
 /**
  * The running engine's version, taken from package.json.

package/dist/constants.js

@@ -1,5 +1,2 @@
-export { ConfigManager, DEFAULT_CONFIG, ENGINE_VERSION } from './chunk-GLA4JXBO.js';
-import './chunk-ERCOHGXD.js';
-import './chunk-YLJ4XMA6.js';
-//# sourceMappingURL=constants.js.map
+export{d as ConfigManager,b as DEFAULT_CONFIG,a as ENGINE_VERSION}from'./chunk-L3FPQSGN.js';import'./chunk-MPB7KUN5.js';//# sourceMappingURL=constants.js.map
 //# sourceMappingURL=constants.js.map

package/dist/engine.cjs

@@ -1,95 +1,2 @@
-'use strict';
-
-var chunkYRIKITGF_cjs = require('./chunk-YRIKITGF.cjs');
-var chunkT6ZYQJ63_cjs = require('./chunk-T6ZYQJ63.cjs');
-require('./chunk-HVRVSI2Z.cjs');
-require('./chunk-NGBBNL4K.cjs');
-require('./chunk-X6K3HUOY.cjs');
-require('./chunk-L2TE7PMO.cjs');
-require('./chunk-ENRIK36Q.cjs');
-require('./chunk-SRGQ72IR.cjs');
-require('./chunk-XA4CKRML.cjs');
-require('./chunk-CKQMXMHR.cjs');
-require('./chunk-N7FNVFXW.cjs');
-require('./chunk-MN3LHRGV.cjs');
-require('./chunk-J45BCEZ4.cjs');
-require('./chunk-CUR2WLI4.cjs');
-require('./chunk-ADBA3XBE.cjs');
-require('./chunk-SSV46KFA.cjs');
-require('./chunk-Z2XP767T.cjs');
-require('./chunk-7ZX6B7SY.cjs');
-require('./chunk-FEAIOR7N.cjs');
-require('./chunk-ZVTWQLK4.cjs');
-require('./chunk-XIYYHA65.cjs');
-require('./chunk-VEKIWQ3F.cjs');
-require('./chunk-ALYRJ72W.cjs');
-require('./chunk-HIQ5HSZL.cjs');
-require('./chunk-2TZKENDH.cjs');
-require('./chunk-EJ3ILXX6.cjs');
-require('./chunk-E23GZEWL.cjs');
-require('./chunk-N5NNW4VG.cjs');
-require('./chunk-536WPM2V.cjs');
-require('./chunk-ZMW6NU2K.cjs');
-require('./chunk-QFTDTX6K.cjs');
-require('./chunk-OUHT5Z36.cjs');
-require('./chunk-AQNHHJMJ.cjs');
-require('./chunk-AMOJYLG2.cjs');
-require('./chunk-B4HBEFTB.cjs');
-require('./chunk-B7LXJ6LC.cjs');
-
-
-
-Object.defineProperty(exports, "DocumentModel", {
-  enumerable: true,
-  get: function () { return chunkYRIKITGF_cjs.DocumentModel; }
-});
-Object.defineProperty(exports, "EvalTier", {
-  enumerable: true,
-  get: function () { return chunkYRIKITGF_cjs.EvalTier; }
-});
-Object.defineProperty(exports, "ThreeTierEvaluator", {
-  enumerable: true,
-  get: function () { return chunkYRIKITGF_cjs.ThreeTierEvaluator; }
-});
-Object.defineProperty(exports, "AsyncResolutionBatcher", {
-  enumerable: true,
-  get: function () { return chunkT6ZYQJ63_cjs.AsyncResolutionBatcher; }
-});
-Object.defineProperty(exports, "ExpressionEngine", {
-  enumerable: true,
-  get: function () { return chunkT6ZYQJ63_cjs.ExpressionEngine; }
-});
-Object.defineProperty(exports, "SNAPSHOT_FORMAT", {
-  enumerable: true,
-  get: function () { return chunkT6ZYQJ63_cjs.SNAPSHOT_FORMAT; }
-});
-Object.defineProperty(exports, "SNAPSHOT_VERSION", {
-  enumerable: true,
-  get: function () { return chunkT6ZYQJ63_cjs.SNAPSHOT_VERSION; }
-});
-Object.defineProperty(exports, "SnapshotErrorCodes", {
-  enumerable: true,
-  get: function () { return chunkT6ZYQJ63_cjs.SnapshotErrorCodes; }
-});
-Object.defineProperty(exports, "checkExpressionComplexity", {
-  enumerable: true,
-  get: function () { return chunkT6ZYQJ63_cjs.checkExpressionComplexity; }
-});
-Object.defineProperty(exports, "checkExpressionLength", {
-  enumerable: true,
-  get: function () { return chunkT6ZYQJ63_cjs.checkExpressionLength; }
-});
-Object.defineProperty(exports, "extractReadsAndWrites", {
-  enumerable: true,
-  get: function () { return chunkT6ZYQJ63_cjs.extractReadsAndWrites; }
-});
-Object.defineProperty(exports, "findInlineSolvesInLine", {
-  enumerable: true,
-  get: function () { return chunkT6ZYQJ63_cjs.findInlineSolvesInLine; }
-});
-Object.defineProperty(exports, "isEmptyLine", {
-  enumerable: true,
-  get: function () { return chunkT6ZYQJ63_cjs.isEmptyLine; }
-});
-//# sourceMappingURL=engine.cjs.map
+'use strict';var chunkWN5CMP4T_cjs=require('./chunk-WN5CMP4T.cjs');require('./chunk-EFJCC6FJ.cjs');var chunk4J7XZSZJ_cjs=require('./chunk-4J7XZSZJ.cjs');require('./chunk-FDE5HWDI.cjs'),require('./chunk-NGBBNL4K.cjs'),require('./chunk-ZCNBT44X.cjs'),require('./chunk-TTFO4YDP.cjs'),require('./chunk-SYYE3QAX.cjs'),require('./chunk-AXMQG5TS.cjs'),require('./chunk-HLBYHXQD.cjs'),require('./chunk-R2SZFJTT.cjs'),require('./chunk-SZGK6RIP.cjs'),require('./chunk-4QVBSG6B.cjs'),require('./chunk-APN442VD.cjs'),require('./chunk-UURM7P3P.cjs'),require('./chunk-ZLRJ7TDP.cjs'),require('./chunk-JAK3RAFA.cjs'),require('./chunk-4BZIYU7S.cjs'),require('./chunk-JFAJN3C2.cjs'),require('./chunk-TLG7VZRX.cjs'),require('./chunk-ESUN2THE.cjs'),require('./chunk-N7N7MPMK.cjs'),require('./chunk-PS272DZJ.cjs'),require('./chunk-IANAMBJQ.cjs'),require('./chunk-UDQ57ZRX.cjs'),require('./chunk-LR4E4A4W.cjs'),require('./chunk-Y7O4D3BJ.cjs'),require('./chunk-6KFVG6UY.cjs'),require('./chunk-5IJD5L3O.cjs'),require('./chunk-MSYX32PF.cjs'),require('./chunk-FWW3M36J.cjs'),require('./chunk-CIQOK7Q4.cjs'),require('./chunk-SOMGSIO4.cjs');Object.defineProperty(exports,"DocumentModel",{enumerable:true,get:function(){return chunkWN5CMP4T_cjs.a}});Object.defineProperty(exports,"EvalTier",{enumerable:true,get:function(){return chunkWN5CMP4T_cjs.b}});Object.defineProperty(exports,"ThreeTierEvaluator",{enumerable:true,get:function(){return chunkWN5CMP4T_cjs.c}});Object.defineProperty(exports,"AsyncResolutionBatcher",{enumerable:true,get:function(){return chunk4J7XZSZJ_cjs.h}});Object.defineProperty(exports,"ExpressionEngine",{enumerable:true,get:function(){return chunk4J7XZSZJ_cjs.n}});Object.defineProperty(exports,"SNAPSHOT_FORMAT",{enumerable:true,get:function(){return chunk4J7XZSZJ_cjs.d}});Object.defineProperty(exports,"SNAPSHOT_VERSION",{enumerable:true,get:function(){return chunk4J7XZSZJ_cjs.e}});Object.defineProperty(exports,"SnapshotErrorCodes",{enumerable:true,get:function(){return chunk4J7XZSZJ_cjs.f}});Object.defineProperty(exports,"checkExpressionComplexity",{enumerable:true,get:function(){return chunk4J7XZSZJ_cjs.j}});Object.defineProperty(exports,"checkExpressionLength",{enumerable:true,get:function(){return chunk4J7XZSZJ_cjs.i}});Object.defineProperty(exports,"extractReadsAndWrites",{enumerable:true,get:function(){return chunk4J7XZSZJ_cjs.k}});Object.defineProperty(exports,"findInlineSolvesInLine",{enumerable:true,get:function(){return chunk4J7XZSZJ_cjs.m}});Object.defineProperty(exports,"isEmptyLine",{enumerable:true,get:function(){return chunk4J7XZSZJ_cjs.l}});//# sourceMappingURL=engine.cjs.map
 //# sourceMappingURL=engine.cjs.map

package/dist/engine.d.cts

@@ -1,19 +1,18 @@
-import { D as DocumentModel, E as ExpressionEngine, V as ViewportRange, r as LineChange, s as InlineSolvePosition } from './PackageRegistry-BHWJP83F.cjs';
-export { A as ApplyChangesResult, t as AsyncCachePackageInfo, u as AsyncErrorEvent, v as AsyncResolutionBatcher, w as AsyncResolutionEvent, B as BatcherMetrics, x as BytecodeCacheEntry, C as CacheSnapshot, y as CheckpointSnapshot, a as EngineRestoreOptions, b as EngineSnapshot, c as EvalResults, d as Explanation, e as ExplanationStep, z as LineCacheEntryInfo, L as LineEvaluation, F as LineState, G as LinesUpdatedEvent, S as SNAPSHOT_FORMAT, g as SNAPSHOT_VERSION, h as SerializedAnonymousBody, i as SerializedBytecode, j as SerializedDecimal, k as SerializedLineCacheEntry, l as SerializedNumber, m as SerializedRational, n as SerializedUserFunction, o as SerializedValue, p as SnapshotErrorCodes } from './PackageRegistry-BHWJP83F.cjs';
-import { V as Value } from './Value-BUi1RA3S.cjs';
-import { V as VMCheckpointer } from './VMCheckpoints-ELYqITdF.cjs';
-import { T as Token } from './Token-B1hdkedD.cjs';
-import { E as EngineError } from './EngineError-B61GS1jp.cjs';
-import { a as BytecodeProgram } from './BytecodeBuilder-Bp9xeTmX.cjs';
-export { D as DagSnapshot } from './ScopeManager-8vf02dwj.cjs';
-import './Parselet-BHcgK9S7.cjs';
-import './pipeline-CtfJtPQc.cjs';
-import './variables.cjs';
-import './Lexer-BOs7euZe.cjs';
+import { D as DocumentModel, E as ExpressionEngine, V as ViewportRange, L as LineChange, p as InlineSolvePosition } from './PackageRegistry-dpdurBVO.cjs';
+export { A as ApplyChangesResult, q as AsyncCachePackageInfo, r as AsyncErrorEvent, s as AsyncResolutionBatcher, t as AsyncResolutionEvent, B as BatcherMetrics, u as BytecodeCacheEntry, C as CacheSnapshot, v as CheckpointSnapshot, a as EngineOptions, b as EngineRestoreOptions, c as EngineSnapshot, d as Explanation, e as ExplanationStep, w as LineCacheEntryInfo, x as LineState, y as LinesUpdatedEvent, S as SNAPSHOT_FORMAT, f as SNAPSHOT_VERSION, g as SerializedAnonymousBody, h as SerializedBytecode, i as SerializedDecimal, j as SerializedLineCacheEntry, k as SerializedNumber, l as SerializedRational, m as SerializedUserFunction, n as SerializedValue, o as SnapshotErrorCodes } from './PackageRegistry-dpdurBVO.cjs';
+import { V as Value } from './Value-CCi_Eecs.cjs';
+import { V as VMCheckpointer } from './VMCheckpoints-I9jg3jWR.cjs';
+import { T as Token } from './Token-CbP_OutD.cjs';
+import { E as EngineError } from './EngineError-Ce1lPkjZ.cjs';
+import { a as BytecodeProgram } from './BytecodeBuilder-DGGeByAP.cjs';
+export { D as DagSnapshot } from './ScopeManager-D7uMXbhS.cjs';
+import './Parselet-C4Wu055_.cjs';
+import './pipeline-DCQicwWX.cjs';
+import './Lexer-B4C1qHXu.cjs';
 import './resolvers.cjs';
 import '@tanstack/query-core';
-import './TokenNormalizer-DRc1Js1V.cjs';
-import './Configuration-C9W8tJv_.cjs';
+import './TokenNormalizer-DnlL7_8c.cjs';
+import './Configuration-B6W0-T67.cjs';
 
 /**
  * PageManager, page-based LRU eviction + directional preloading.
@@ -338,6 +337,22 @@ declare class ThreeTierEvaluator {
         inserted: number[];
         removed: number[];
     };
+    /**
+     * Reset running-total accumulators and mark the lines that touch them
+     * dirty, so the from-line-1 pass in {@link evaluate} recomputes each total
+     * from its seed instead of reading its own previous evaluation's value.
+     *
+     * A `total += 5` line compiles to no bytecode (it rides the symbolic
+     * channel), so a clean one would be skipped by the tier dispatch rather
+     * than re-run. It must re-run to re-apply its delta over the freshly-reset
+     * base, so every line that WRITES an accumulator name is forced dirty (the
+     * DAG drops a self-writing line from its own variable's consumers, so
+     * getAffectedLines can't surface them). Pure readers of the total keep
+     * their real bytecode and re-run via Tier 2 once the total is correct, so
+     * they need no special handling. Cheap: a no-op unless the document
+     * actually uses `+=`/`-=`, and accumulators are rare.
+     */
+    private reseedAccumulators;
     /**
      * Collect evaluation results for a contiguous range of lines.
      *

package/dist/engine.d.ts

@@ -1,19 +1,18 @@
-import { D as DocumentModel, E as ExpressionEngine, V as ViewportRange, r as LineChange, s as InlineSolvePosition } from './PackageRegistry-_8rDlvxI.js';
-export { A as ApplyChangesResult, t as AsyncCachePackageInfo, u as AsyncErrorEvent, v as AsyncResolutionBatcher, w as AsyncResolutionEvent, B as BatcherMetrics, x as BytecodeCacheEntry, C as CacheSnapshot, y as CheckpointSnapshot, a as EngineRestoreOptions, b as EngineSnapshot, c as EvalResults, d as Explanation, e as ExplanationStep, z as LineCacheEntryInfo, L as LineEvaluation, F as LineState, G as LinesUpdatedEvent, S as SNAPSHOT_FORMAT, g as SNAPSHOT_VERSION, h as SerializedAnonymousBody, i as SerializedBytecode, j as SerializedDecimal, k as SerializedLineCacheEntry, l as SerializedNumber, m as SerializedRational, n as SerializedUserFunction, o as SerializedValue, p as SnapshotErrorCodes } from './PackageRegistry-_8rDlvxI.js';
-import { V as Value } from './Value-BUi1RA3S.js';
-import { V as VMCheckpointer } from './VMCheckpoints-MK--EBH2.js';
-import { T as Token } from './Token-B1hdkedD.js';
-import { E as EngineError } from './EngineError-B61GS1jp.js';
-import { a as BytecodeProgram } from './BytecodeBuilder-Bp9xeTmX.js';
-export { D as DagSnapshot } from './ScopeManager-CxA24W5n.js';
-import './Parselet-BBT8riYh.js';
-import './pipeline-DCd5M6Gk.js';
-import './variables.js';
-import './Lexer-CSI_lwbW.js';
+import { D as DocumentModel, E as ExpressionEngine, V as ViewportRange, L as LineChange, p as InlineSolvePosition } from './PackageRegistry-DzeiWcv4.js';
+export { A as ApplyChangesResult, q as AsyncCachePackageInfo, r as AsyncErrorEvent, s as AsyncResolutionBatcher, t as AsyncResolutionEvent, B as BatcherMetrics, u as BytecodeCacheEntry, C as CacheSnapshot, v as CheckpointSnapshot, a as EngineOptions, b as EngineRestoreOptions, c as EngineSnapshot, d as Explanation, e as ExplanationStep, w as LineCacheEntryInfo, x as LineState, y as LinesUpdatedEvent, S as SNAPSHOT_FORMAT, f as SNAPSHOT_VERSION, g as SerializedAnonymousBody, h as SerializedBytecode, i as SerializedDecimal, j as SerializedLineCacheEntry, k as SerializedNumber, l as SerializedRational, m as SerializedUserFunction, n as SerializedValue, o as SnapshotErrorCodes } from './PackageRegistry-DzeiWcv4.js';
+import { V as Value } from './Value-CCi_Eecs.js';
+import { V as VMCheckpointer } from './VMCheckpoints-CGyFhivM.js';
+import { T as Token } from './Token-CbP_OutD.js';
+import { E as EngineError } from './EngineError-Ce1lPkjZ.js';
+import { a as BytecodeProgram } from './BytecodeBuilder-DGGeByAP.js';
+export { D as DagSnapshot } from './ScopeManager-C2LDOrDx.js';
+import './Parselet-B-zoPrTa.js';
+import './pipeline-72QmQlGx.js';
+import './Lexer-DKMlj7Sy.js';
 import './resolvers.js';
 import '@tanstack/query-core';
-import './TokenNormalizer-C6VzZgHa.js';
-import './Configuration-C9W8tJv_.js';
+import './TokenNormalizer-DCWdZjGz.js';
+import './Configuration-B6W0-T67.js';
 
 /**
  * PageManager, page-based LRU eviction + directional preloading.
@@ -338,6 +337,22 @@ declare class ThreeTierEvaluator {
         inserted: number[];
         removed: number[];
     };
+    /**
+     * Reset running-total accumulators and mark the lines that touch them
+     * dirty, so the from-line-1 pass in {@link evaluate} recomputes each total
+     * from its seed instead of reading its own previous evaluation's value.
+     *
+     * A `total += 5` line compiles to no bytecode (it rides the symbolic
+     * channel), so a clean one would be skipped by the tier dispatch rather
+     * than re-run. It must re-run to re-apply its delta over the freshly-reset
+     * base, so every line that WRITES an accumulator name is forced dirty (the
+     * DAG drops a self-writing line from its own variable's consumers, so
+     * getAffectedLines can't surface them). Pure readers of the total keep
+     * their real bytecode and re-run via Tier 2 once the total is correct, so
+     * they need no special handling. Cheap: a no-op unless the document
+     * actually uses `+=`/`-=`, and accumulators are rare.
+     */
+    private reseedAccumulators;
     /**
      * Collect evaluation results for a contiguous range of lines.
      *

package/dist/engine.js

@@ -1,38 +1,2 @@
-export { DocumentModel, EvalTier, ThreeTierEvaluator } from './chunk-LHZ6VOA7.js';
-export { AsyncResolutionBatcher, ExpressionEngine, SNAPSHOT_FORMAT, SNAPSHOT_VERSION, SnapshotErrorCodes, checkExpressionComplexity, checkExpressionLength, extractReadsAndWrites, findInlineSolvesInLine, isEmptyLine } from './chunk-NNZAEUDW.js';
-import './chunk-I4GAWIPW.js';
-import './chunk-2RWAXT6O.js';
-import './chunk-3VGDNEE3.js';
-import './chunk-5ON7PUAZ.js';
-import './chunk-FD5ZZHEU.js';
-import './chunk-WXEHD6TT.js';
-import './chunk-CCBZZQAE.js';
-import './chunk-3OWCDIPN.js';
-import './chunk-UKQHXPGW.js';
-import './chunk-4HQKTMWG.js';
-import './chunk-ENKKJYD3.js';
-import './chunk-BYJBUL7U.js';
-import './chunk-3BOK2LDK.js';
-import './chunk-7KYSUDQO.js';
-import './chunk-NLNDMWZC.js';
-import './chunk-NKW7LKYU.js';
-import './chunk-GCM5JHMX.js';
-import './chunk-Z7XGGLI2.js';
-import './chunk-BLI4NIQY.js';
-import './chunk-Z4X2RWOF.js';
-import './chunk-5HRB36DK.js';
-import './chunk-NNQ2TYDF.js';
-import './chunk-267JPOTF.js';
-import './chunk-MVTOCRV2.js';
-import './chunk-GLA4JXBO.js';
-import './chunk-DLEBSLF4.js';
-import './chunk-UO6BUV6K.js';
-import './chunk-JG6ZJ2WU.js';
-import './chunk-4D6NIHE2.js';
-import './chunk-XBTEO4OB.js';
-import './chunk-SBUFNJVE.js';
-import './chunk-V4XG5QF6.js';
-import './chunk-ERCOHGXD.js';
-import './chunk-YLJ4XMA6.js';
-//# sourceMappingURL=engine.js.map
+export{a as DocumentModel,b as EvalTier,c as ThreeTierEvaluator}from'./chunk-JSPKKNPQ.js';import'./chunk-RAF57WYO.js';export{h as AsyncResolutionBatcher,n as ExpressionEngine,d as SNAPSHOT_FORMAT,e as SNAPSHOT_VERSION,f as SnapshotErrorCodes,j as checkExpressionComplexity,i as checkExpressionLength,k as extractReadsAndWrites,m as findInlineSolvesInLine,l as isEmptyLine}from'./chunk-XR7HEC7B.js';import'./chunk-XNIWQHXY.js';import'./chunk-2RWAXT6O.js';import'./chunk-7GK3XEZF.js';import'./chunk-MIQBJGGR.js';import'./chunk-YJ2OPULK.js';import'./chunk-TWC7K3ZX.js';import'./chunk-J4LZD4ZY.js';import'./chunk-XEIDV5JP.js';import'./chunk-6CY44ZPG.js';import'./chunk-YVKHEAFT.js';import'./chunk-QXQE7X4S.js';import'./chunk-76F3LCIL.js';import'./chunk-TCZSPH4A.js';import'./chunk-W2JAR233.js';import'./chunk-YAYBVVG2.js';import'./chunk-E6Z4NQAS.js';import'./chunk-HFKDWQUL.js';import'./chunk-R2ENWQ76.js';import'./chunk-RSF25YSJ.js';import'./chunk-EVAOPEO4.js';import'./chunk-WGZ3FNHI.js';import'./chunk-L3FPQSGN.js';import'./chunk-GOIQYUWV.js';import'./chunk-JPFCXLJV.js';import'./chunk-UI6IFGBT.js';import'./chunk-IJMNVBIS.js';import'./chunk-62LMTO4F.js';import'./chunk-TRBXW6HW.js';import'./chunk-2JMFUQZH.js';import'./chunk-MPB7KUN5.js';//# sourceMappingURL=engine.js.map
 //# sourceMappingURL=engine.js.map

package/dist/errors.cjs

@@ -1,106 +1,2 @@
-'use strict';
-
-var chunkB7NLZMQ3_cjs = require('./chunk-B7NLZMQ3.cjs');
-var chunkB4HBEFTB_cjs = require('./chunk-B4HBEFTB.cjs');
-require('./chunk-B7LXJ6LC.cjs');
-
-
-
-Object.defineProperty(exports, "WorkerErrorCodes", {
-  enumerable: true,
-  get: function () { return chunkB7NLZMQ3_cjs.WorkerErrorCodes; }
-});
-Object.defineProperty(exports, "deserializeEngineError", {
-  enumerable: true,
-  get: function () { return chunkB7NLZMQ3_cjs.deserializeEngineError; }
-});
-Object.defineProperty(exports, "serializeEngineError", {
-  enumerable: true,
-  get: function () { return chunkB7NLZMQ3_cjs.serializeEngineError; }
-});
-Object.defineProperty(exports, "workerCancelledError", {
-  enumerable: true,
-  get: function () { return chunkB7NLZMQ3_cjs.workerCancelledError; }
-});
-Object.defineProperty(exports, "workerTerminatedError", {
-  enumerable: true,
-  get: function () { return chunkB7NLZMQ3_cjs.workerTerminatedError; }
-});
-Object.defineProperty(exports, "workerTransportError", {
-  enumerable: true,
-  get: function () { return chunkB7NLZMQ3_cjs.workerTransportError; }
-});
-Object.defineProperty(exports, "CoreErrorCodes", {
-  enumerable: true,
-  get: function () { return chunkB4HBEFTB_cjs.CoreErrorCodes; }
-});
-Object.defineProperty(exports, "EngineError", {
-  enumerable: true,
-  get: function () { return chunkB4HBEFTB_cjs.EngineError; }
-});
-Object.defineProperty(exports, "ErrorCategory", {
-  enumerable: true,
-  get: function () { return chunkB4HBEFTB_cjs.ErrorCategory; }
-});
-Object.defineProperty(exports, "ErrorFactory", {
-  enumerable: true,
-  get: function () { return chunkB4HBEFTB_cjs.ErrorFactory; }
-});
-Object.defineProperty(exports, "andThen", {
-  enumerable: true,
-  get: function () { return chunkB4HBEFTB_cjs.andThen; }
-});
-Object.defineProperty(exports, "combine", {
-  enumerable: true,
-  get: function () { return chunkB4HBEFTB_cjs.combine; }
-});
-Object.defineProperty(exports, "err", {
-  enumerable: true,
-  get: function () { return chunkB4HBEFTB_cjs.err; }
-});
-Object.defineProperty(exports, "isErr", {
-  enumerable: true,
-  get: function () { return chunkB4HBEFTB_cjs.isErr; }
-});
-Object.defineProperty(exports, "isOk", {
-  enumerable: true,
-  get: function () { return chunkB4HBEFTB_cjs.isOk; }
-});
-Object.defineProperty(exports, "map", {
-  enumerable: true,
-  get: function () { return chunkB4HBEFTB_cjs.map; }
-});
-Object.defineProperty(exports, "mapErr", {
-  enumerable: true,
-  get: function () { return chunkB4HBEFTB_cjs.mapErr; }
-});
-Object.defineProperty(exports, "match", {
-  enumerable: true,
-  get: function () { return chunkB4HBEFTB_cjs.match; }
-});
-Object.defineProperty(exports, "normalizeUnknownError", {
-  enumerable: true,
-  get: function () { return chunkB4HBEFTB_cjs.normalizeUnknownError; }
-});
-Object.defineProperty(exports, "ok", {
-  enumerable: true,
-  get: function () { return chunkB4HBEFTB_cjs.ok; }
-});
-Object.defineProperty(exports, "throwIfErr", {
-  enumerable: true,
-  get: function () { return chunkB4HBEFTB_cjs.throwIfErr; }
-});
-Object.defineProperty(exports, "tryCatch", {
-  enumerable: true,
-  get: function () { return chunkB4HBEFTB_cjs.tryCatch; }
-});
-Object.defineProperty(exports, "tryCatchAsync", {
-  enumerable: true,
-  get: function () { return chunkB4HBEFTB_cjs.tryCatchAsync; }
-});
-Object.defineProperty(exports, "unwrapOr", {
-  enumerable: true,
-  get: function () { return chunkB4HBEFTB_cjs.unwrapOr; }
-});
-//# sourceMappingURL=errors.cjs.map
+'use strict';var chunkP6WPEUAJ_cjs=require('./chunk-P6WPEUAJ.cjs'),chunkSOMGSIO4_cjs=require('./chunk-SOMGSIO4.cjs');Object.defineProperty(exports,"WorkerErrorCodes",{enumerable:true,get:function(){return chunkP6WPEUAJ_cjs.a}});Object.defineProperty(exports,"deserializeEngineError",{enumerable:true,get:function(){return chunkP6WPEUAJ_cjs.c}});Object.defineProperty(exports,"serializeEngineError",{enumerable:true,get:function(){return chunkP6WPEUAJ_cjs.b}});Object.defineProperty(exports,"workerCancelledError",{enumerable:true,get:function(){return chunkP6WPEUAJ_cjs.d}});Object.defineProperty(exports,"workerTerminatedError",{enumerable:true,get:function(){return chunkP6WPEUAJ_cjs.e}});Object.defineProperty(exports,"workerTransportError",{enumerable:true,get:function(){return chunkP6WPEUAJ_cjs.f}});Object.defineProperty(exports,"CoreErrorCodes",{enumerable:true,get:function(){return chunkSOMGSIO4_cjs.r}});Object.defineProperty(exports,"EngineError",{enumerable:true,get:function(){return chunkSOMGSIO4_cjs.b}});Object.defineProperty(exports,"ErrorCategory",{enumerable:true,get:function(){return chunkSOMGSIO4_cjs.a}});Object.defineProperty(exports,"ErrorFactory",{enumerable:true,get:function(){return chunkSOMGSIO4_cjs.c}});Object.defineProperty(exports,"andThen",{enumerable:true,get:function(){return chunkSOMGSIO4_cjs.k}});Object.defineProperty(exports,"combine",{enumerable:true,get:function(){return chunkSOMGSIO4_cjs.n}});Object.defineProperty(exports,"err",{enumerable:true,get:function(){return chunkSOMGSIO4_cjs.f}});Object.defineProperty(exports,"isErr",{enumerable:true,get:function(){return chunkSOMGSIO4_cjs.h}});Object.defineProperty(exports,"isOk",{enumerable:true,get:function(){return chunkSOMGSIO4_cjs.g}});Object.defineProperty(exports,"map",{enumerable:true,get:function(){return chunkSOMGSIO4_cjs.i}});Object.defineProperty(exports,"mapErr",{enumerable:true,get:function(){return chunkSOMGSIO4_cjs.j}});Object.defineProperty(exports,"match",{enumerable:true,get:function(){return chunkSOMGSIO4_cjs.m}});Object.defineProperty(exports,"normalizeUnknownError",{enumerable:true,get:function(){return chunkSOMGSIO4_cjs.d}});Object.defineProperty(exports,"ok",{enumerable:true,get:function(){return chunkSOMGSIO4_cjs.e}});Object.defineProperty(exports,"throwIfErr",{enumerable:true,get:function(){return chunkSOMGSIO4_cjs.o}});Object.defineProperty(exports,"tryCatch",{enumerable:true,get:function(){return chunkSOMGSIO4_cjs.p}});Object.defineProperty(exports,"tryCatchAsync",{enumerable:true,get:function(){return chunkSOMGSIO4_cjs.q}});Object.defineProperty(exports,"unwrapOr",{enumerable:true,get:function(){return chunkSOMGSIO4_cjs.l}});//# sourceMappingURL=errors.cjs.map
 //# sourceMappingURL=errors.cjs.map

package/dist/errors.d.cts

@@ -1,6 +1,6 @@
-import { E as EngineError } from './EngineError-B61GS1jp.cjs';
-export { C as CoreErrorCode, a as CoreErrorCodes, b as EngineErrorInit, c as ErrorCategory, d as ErrorCode, e as ErrorFactory, S as SourceSpan, n as normalizeUnknownError } from './EngineError-B61GS1jp.cjs';
-export { S as SerializedEngineError, W as WorkerErrorCodes, d as deserializeEngineError, s as serializeEngineError, w as workerCancelledError, a as workerTerminatedError, b as workerTransportError } from './WorkerError-gzmaopj2.cjs';
+import { E as EngineError } from './EngineError-Ce1lPkjZ.cjs';
+export { C as CoreErrorCode, a as CoreErrorCodes, b as EngineErrorInit, c as ErrorCategory, d as ErrorCode, e as ErrorFactory, S as SourceSpan, n as normalizeUnknownError } from './EngineError-Ce1lPkjZ.cjs';
+export { S as SerializedEngineError, W as WorkerErrorCodes, d as deserializeEngineError, s as serializeEngineError, w as workerCancelledError, a as workerTerminatedError, b as workerTransportError } from './WorkerError-B4p6PNfx.cjs';
 
 /**
  * A Rust-style `Result<T, E>`, the value half of this engine's error-handling

package/dist/errors.d.ts

@@ -1,6 +1,6 @@
-import { E as EngineError } from './EngineError-B61GS1jp.js';
-export { C as CoreErrorCode, a as CoreErrorCodes, b as EngineErrorInit, c as ErrorCategory, d as ErrorCode, e as ErrorFactory, S as SourceSpan, n as normalizeUnknownError } from './EngineError-B61GS1jp.js';
-export { S as SerializedEngineError, W as WorkerErrorCodes, d as deserializeEngineError, s as serializeEngineError, w as workerCancelledError, a as workerTerminatedError, b as workerTransportError } from './WorkerError-_-RkoQ5P.js';
+import { E as EngineError } from './EngineError-Ce1lPkjZ.js';
+export { C as CoreErrorCode, a as CoreErrorCodes, b as EngineErrorInit, c as ErrorCategory, d as ErrorCode, e as ErrorFactory, S as SourceSpan, n as normalizeUnknownError } from './EngineError-Ce1lPkjZ.js';
+export { S as SerializedEngineError, W as WorkerErrorCodes, d as deserializeEngineError, s as serializeEngineError, w as workerCancelledError, a as workerTerminatedError, b as workerTransportError } from './WorkerError-Dhj9BQ_A.js';
 
 /**
  * A Rust-style `Result<T, E>`, the value half of this engine's error-handling

package/dist/errors.js

@@ -1,5 +1,2 @@
-export { WorkerErrorCodes, deserializeEngineError, serializeEngineError, workerCancelledError, workerTerminatedError, workerTransportError } from './chunk-WWQEY7BV.js';
-export { CoreErrorCodes, EngineError, ErrorCategory, ErrorFactory, andThen, combine, err, isErr, isOk, map, mapErr, match, normalizeUnknownError, ok, throwIfErr, tryCatch, tryCatchAsync, unwrapOr } from './chunk-ERCOHGXD.js';
-import './chunk-YLJ4XMA6.js';
-//# sourceMappingURL=errors.js.map
+export{a as WorkerErrorCodes,c as deserializeEngineError,b as serializeEngineError,d as workerCancelledError,e as workerTerminatedError,f as workerTransportError}from'./chunk-MVZUTETT.js';export{r as CoreErrorCodes,b as EngineError,a as ErrorCategory,c as ErrorFactory,k as andThen,n as combine,f as err,h as isErr,g as isOk,i as map,j as mapErr,m as match,d as normalizeUnknownError,e as ok,o as throwIfErr,p as tryCatch,q as tryCatchAsync,l as unwrapOr}from'./chunk-MPB7KUN5.js';//# sourceMappingURL=errors.js.map
 //# sourceMappingURL=errors.js.map