solve-engine 1.0.0-beta.3 → 1.0.0-beta.5

package/dist/chunk-6GCKCWLB.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/parser/BytecodeBuilder.ts","../src/parser/BindingPower.ts"],"names":[],"mappings":";;;;AAYA,IAAM,uBAAA,GAA0B,GAAA;AAqFzB,IAAM,kBAAN,MAAsB;AAAA,EAAtB,WAAA,GAAA;AACN,IAAA,IAAA,CAAQ,UAAoB,EAAC;AAC7B,IAAA,IAAA,CAAQ,UAAoB,EAAC;AAC7B,IAAA,IAAA,CAAQ,UAAoB,EAAC;AAC7B,IAAA,IAAA,CAAQ,WAAA,uBAAkB,GAAA,EAAoB;AAC9C,IAAA,IAAA,CAAQ,SAAA,GAAY,KAAA;AACpB,IAAA,IAAA,CAAQ,qBAAwC,EAAC;AACjD,IAAA,IAAA,CAAQ,kBAAsC,EAAC;AAAA,EAAA;AAAA;AAAA,EAG/C,WAAW,EAAA,EAAkB;AAC5B,IAAA,IAAA,CAAK,OAAA,CAAQ,KAAK,EAAE,CAAA;AACpB,IAAA,IAAI,EAAA,KAAA,EAAA,oBAA2B;AAC9B,MAAA,IAAA,CAAK,SAAA,GAAY,IAAA;AAAA,IAClB;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,WAAW,CAAA,EAAiB;AAC3B,IAAA,MAAM,GAAA,GAAM,KAAK,OAAA,CAAQ,MAAA;AACzB,IAAA,IAAI,MAAM,uBAAA,EAAyB;AAClC,MAAA,MAAM,YAAA,CAAa,OAAA;AAAA,QAClB,4BAAA;AAAA,QACA,CAAA,yBAAA,EAA4B,0BAA0B,CAAC,CAAA,gEAAA,CAAA;AAAA,QACvD,EAAE,KAAA,EAAO,uBAAA,GAA0B,CAAA;AAAE,OACtC;AAAA,IACD;AACA,IAAA,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAC,CAAA;AACnB,IAAA,IAAA,CAAK,OAAA,CAAQ,KAAK,GAAG,CAAA;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,WAAW,CAAA,EAAiB;AAC3B,IAAA,IAAI,GAAA,GAAM,IAAA,CAAK,WAAA,CAAY,GAAA,CAAI,CAAC,CAAA;AAChC,IAAA,IAAI,QAAQ,MAAA,EAAW;AACtB,MAAA,GAAA,GAAM,KAAK,OAAA,CAAQ,MAAA;AACnB,MAAA,IAAI,MAAM,uBAAA,EAAyB;AAClC,QAAA,MAAM,YAAA,CAAa,OAAA;AAAA,UAClB,2BAAA;AAAA,UACA,CAAA,yBAAA,EAA4B,0BAA0B,CAAC,CAAA,wEAAA,CAAA;AAAA,UACvD,EAAE,KAAA,EAAO,uBAAA,GAA0B,CAAA;AAAE,SACtC;AAAA,MACD;AACA,MAAA,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAC,CAAA;AACnB,MAAA,IAAA,CAAK,WAAA,CAAY,GAAA,CAAI,CAAA,EAAG,GAAG,CAAA;AAAA,IAC5B;AACA,IAAA,IAAA,CAAK,OAAA,CAAQ,KAAK,GAAG,CAAA;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,UAAU,GAAA,EAAmB;AAC5B,IAAA,IAAA,CAAK,OAAA,CAAQ,KAAK,GAAG,CAAA;AAAA,EACtB;AAAA;AAAA,EAGA,SAAS,CAAA,EAAiB;AACzB,IAAA,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAC,CAAA;AAAA,EACpB;AAAA;AAAA,EAGA,IAAI,aAAA,GAAwB;AAC3B,IAAA,OAAO,KAAK,OAAA,CAAQ,MAAA;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,oBAAA,CAAqB,IAAA,EAAc,MAAA,EAAkB,OAAA,EAAkC;AACtF,IAAA,MAAM,GAAA,GAAM,KAAK,kBAAA,CAAmB,MAAA;AACpC,IAAA,IAAI,MAAM,uBAAA,EAAyB;AAClC,MAAA,MAAM,YAAA,CAAa,OAAA;AAAA,QAClB,+BAAA;AAAA,QACA,CAAA,UAAA,EAAa,0BAA0B,CAAC,CAAA,gFAAA,CAAA;AAAA,QACxC,EAAE,KAAA,EAAO,uBAAA,GAA0B,CAAA;AAAE,OACtC;AAAA,IACD;AACA,IAAA,IAAA,CAAK,mBAAmB,IAAA,CAAK,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,CAAA;AACtD,IAAA,OAAO,GAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,iBAAA,CAAkB,QAAkB,OAAA,EAAkC;AACrE,IAAA,MAAM,GAAA,GAAM,KAAK,eAAA,CAAgB,MAAA;AACjC,IAAA,IAAI,MAAM,uBAAA,EAAyB;AAClC,MAAA,MAAM,YAAA,CAAa,OAAA;AAAA,QAClB,2BAAA;AAAA,QACA,CAAA,UAAA,EAAa,0BAA0B,CAAC,CAAA,4FAAA,CAAA;AAAA,QACxC,EAAE,KAAA,EAAO,uBAAA,GAA0B,CAAA;AAAE,OACtC;AAAA,IACD;AACA,IAAA,IAAA,CAAK,eAAA,CAAgB,IAAA,CAAK,EAAE,MAAA,EAAQ,SAAS,CAAA;AAC7C,IAAA,OAAO,GAAA;AAAA,EACR;AAAA;AAAA,EAGA,SAAA,CAAU,UAAkB,MAAA,EAAsB;AACjD,IAAA,IAAA,CAAK,OAAA,CAAQ,QAAQ,CAAA,GAAI,MAAA;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,KAAA,GAAyB;AACxB,IAAA,OAAO;AAAA,MACN,OAAA,EAAS,IAAI,UAAA,CAAW,IAAA,CAAK,OAAO,CAAA;AAAA,MACpC,OAAA,EAAS,IAAI,YAAA,CAAa,IAAA,CAAK,OAAO,CAAA;AAAA;AAAA;AAAA;AAAA,MAItC,OAAA,EAAS,CAAC,GAAG,IAAA,CAAK,OAAO,CAAA;AAAA,MACzB,SAAA,sBAAe,GAAA,EAAI;AAAA,MACnB,UAAU,IAAA,CAAK,SAAA;AAAA,MACf,kBAAA,EAAoB,KAAK,kBAAA,CAAmB,MAAA,GAAS,IAAI,CAAC,GAAG,IAAA,CAAK,kBAAkB,CAAA,GAAI,MAAA;AAAA,MACxF,eAAA,EAAiB,KAAK,eAAA,CAAgB,MAAA,GAAS,IAAI,CAAC,GAAG,IAAA,CAAK,eAAe,CAAA,GAAI;AAAA,KAChF;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,UAAU,GAAA,EAAuE;AAChF,IAAA,MAAM,KAAA,GAAQ,KAAK,OAAA,CAAQ,MAAA;AAC3B,IAAA,MAAM,MAAA,GAAS,KAAK,OAAA,CAAQ,MAAA;AAE5B,IAAA,MAAM,YAAA,GAAe,GAAA,IAAO,GAAA,CAAI,OAAA,CAAQ,MAAA,IAAU,KAAA;AAClD,IAAA,MAAM,YAAA,GAAe,GAAA,IAAO,GAAA,CAAI,OAAA,CAAQ,MAAA,IAAU,MAAA;AAGlD,IAAA,MAAM,OAAA,GAAU,YAAA,GACb,IAAI,UAAA,CAAW,IAAK,OAAA,CAAQ,MAAA,EAAQ,GAAA,CAAK,OAAA,CAAQ,UAAA,EAAY,KAAK,CAAA,GAClE,IAAI,WAAW,KAAK,CAAA;AACvB,IAAA,MAAM,OAAA,GAAU,YAAA,GACb,IAAI,YAAA,CAAa,IAAK,OAAA,CAAQ,MAAA,EAAQ,GAAA,CAAK,OAAA,CAAQ,UAAA,EAAY,MAAM,CAAA,GACrE,IAAI,aAAa,MAAM,CAAA;AAG1B,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,EAAO,CAAA,EAAA,UAAa,CAAC,CAAA,GAAI,IAAA,CAAK,OAAA,CAAQ,CAAC,CAAA;AAC3D,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,EAAQ,CAAA,EAAA,UAAa,CAAC,CAAA,GAAI,IAAA,CAAK,OAAA,CAAQ,CAAC,CAAA;AAE5D,IAAA,OAAO;AAAA,MACN,OAAA;AAAA,MACA,OAAA;AAAA,MACA,OAAA,EAAS,CAAC,GAAG,IAAA,CAAK,OAAO,CAAA;AAAA,MACzB,SAAA,sBAAe,GAAA,EAAI;AAAA,MACnB,UAAU,IAAA,CAAK,SAAA;AAAA,MACf,kBAAA,EAAoB,KAAK,kBAAA,CAAmB,MAAA,GAAS,IAAI,CAAC,GAAG,IAAA,CAAK,kBAAkB,CAAA,GAAI,MAAA;AAAA,MACxF,eAAA,EAAiB,KAAK,eAAA,CAAgB,MAAA,GAAS,IAAI,CAAC,GAAG,IAAA,CAAK,eAAe,CAAA,GAAI;AAAA,KAChF;AAAA,EACD;AAAA,EAEA,KAAA,GAAc;AAIb,IAAA,IAAA,CAAK,QAAQ,MAAA,GAAS,CAAA;AACtB,IAAA,IAAA,CAAK,QAAQ,MAAA,GAAS,CAAA;AACtB,IAAA,IAAA,CAAK,QAAQ,MAAA,GAAS,CAAA;AACtB,IAAA,IAAA,CAAK,YAAY,KAAA,EAAM;AACvB,IAAA,IAAA,CAAK,SAAA,GAAY,KAAA;AACjB,IAAA,IAAA,CAAK,mBAAmB,MAAA,GAAS,CAAA;AACjC,IAAA,IAAA,CAAK,gBAAgB,MAAA,GAAS,CAAA;AAAA,EAC/B;AACD;;;AC7SO,IAAM,YAAA,GAAe;AAAA,EAC1B,MAAA,EAAQ,CAAA;AAAA,EACR,UAAA,EAAY,EAAA;AAAA,EACZ,SAAA,EAAW,EAAA;AAAA;AAAA,EACX,UAAA,EAAY,EAAA;AAAA;AAAA,EACZ,WAAA,EAAa,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMb,WAAA,EAAa,EAAA;AAAA,EACb,GAAA,EAAK,EAAA;AAAA,EACL,UAAA,EAAY,EAAA;AAAA,EACZ,OAAA,EAAS,EAAA;AAAA,EACT,QAAA,EAAU,EAAA;AAAA,EACV,MAAA,EAAQ,EAAA;AAAA,EACR,OAAA,EAAS,EAAA;AAAA,EACT,IAAA,EAAM;AACR;AAiDA,IAAM,gBAAA,GAA2C;AAAA;AAAA,EAE/C,CAAC,UAAA,CAAW,IAAI,GAAO,YAAA,CAAa,GAAA;AAAA,EACpC,CAAC,UAAA,CAAW,KAAK,GAAM,YAAA,CAAa,GAAA;AAAA,EACpC,CAAC,UAAA,CAAW,IAAI,GAAO,YAAA,CAAa,OAAA;AAAA,EACpC,CAAC,UAAA,CAAW,KAAK,GAAM,YAAA,CAAa,OAAA;AAAA,EACpC,CAAC,UAAA,CAAW,GAAG,GAAQ,YAAA,CAAa,OAAA;AAAA;AAAA,EAGpC,CAAC,UAAA,CAAW,KAAK,GAAM,YAAA,CAAa,QAAA;AAAA;AAAA,EAGpC,CAAC,UAAA,CAAW,MAAM,GAAK,YAAA,CAAa,UAAA;AAAA,EACpC,CAAC,UAAA,CAAW,MAAM,GAAK,YAAA,CAAa,UAAA;AAAA,EACpC,CAAC,UAAA,CAAW,OAAO,GAAI,YAAA,CAAa,UAAA;AAAA,EACpC,CAAC,UAAA,CAAW,MAAM,GAAK,YAAA,CAAa,UAAA;AAAA,EACpC,CAAC,UAAA,CAAW,OAAO,GAAI,YAAA,CAAa,UAAA;AAAA;AAAA,EAGpC,CAAC,UAAA,CAAW,OAAO,GAAI,YAAA,CAAa,OAAA;AAAA;AAAA,EAGpC,CAAC,UAAA,CAAW,EAAE,GAAS,YAAA,CAAa;AACtC,CAAA;AAWA,IAAI,QAAA,GAA8B,IAAA;AAS3B,SAAS,sBAAA,GAAqC;AACnD,EAAA,IAAI,UAAU,OAAO,QAAA;AAGrB,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAA,CAAO,IAAA,CAAK,gBAAgB,CAAA,EAAG;AAChD,IAAA,MAAM,EAAA,GAAK,YAAY,IAAI,CAAA;AAC3B,IAAA,IAAI,EAAA,GAAK,OAAO,KAAA,GAAQ,EAAA;AAAA,EAC1B;AAEA,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAA,CAAO,MAAA,CAAO,UAAU,CAAA,EAAG;AAC5C,IAAA,MAAM,EAAA,GAAK,YAAY,IAAI,CAAA;AAC3B,IAAA,IAAI,EAAA,GAAK,OAAO,KAAA,GAAQ,EAAA;AAAA,EAC1B;AAEA,EAAA,MAAM,KAAA,GAAQ,IAAI,UAAA,CAAW,KAAA,GAAQ,CAAC,CAAA;AACtC,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,EAAE,KAAK,MAAA,CAAO,OAAA,CAAQ,gBAAgB,CAAA,EAAG;AACzD,IAAA,MAAM,EAAA,GAAK,YAAY,IAAI,CAAA;AAC3B,IAAA,KAAA,CAAM,EAAE,CAAA,GAAI,EAAA;AAAA,EACd;AAEA,EAAA,QAAA,GAAW,KAAA;AACX,EAAA,OAAO,KAAA;AACT;AAMO,SAAS,2BAAA,GAAoC;AAClD,EAAA,QAAA,GAAW,IAAA;AACb","file":"chunk-6GCKCWLB.js","sourcesContent":["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/** 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 * 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 registering an infix parselet via\n * `IPackageRegistry.registerInfixParselet`. See the built-in packages for\n * examples of picking an appropriate level (e.g. arithmetic `+`/`-` use\n * `Sum`, `*`/`/` 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  Conditional: 20, // comparisons (`==`, `<`, `>=`, ...) — tighter than and/or, looser than arithmetic\n  // The word \"and\" as addition (`AND_CONJ`). One step looser than `Sum` on\n  // purpose: a phrase parselet collecting a list (\"average of X, Y and Z\")\n  // parses each argument at this level, which stops at \"and\" while still\n  // letting a genuine \"+\" inside an argument bind. Level 28 rather than 29 to\n  // leave room, and below Sum rather than above so \"1 and 2 * 3\" stays 7.\n  Conjunction: 28,\n  Sum: 30,\n  BitwiseXor: 35,\n  Product: 40,\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 (infix, left-associative)\n  [TokenTypes.LSHIFT]:   BindingPower.BitwiseXor,\n  [TokenTypes.RSHIFT]:   BindingPower.BitwiseXor,\n  [TokenTypes.BIT_AND]:  BindingPower.BitwiseXor,\n  [TokenTypes.BIT_OR]:   BindingPower.BitwiseXor,\n  [TokenTypes.BIT_XOR]:  BindingPower.BitwiseXor,\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 * Invalidate the cached BP table, call when plugins register new token types\n * that should participate in the built-in fast path.\n */\nexport function invalidateBindingPowerTable(): void {\n  _bpTable = null;\n}\n"]}

package/dist/{chunk-PG2K5BL6.cjs → chunk-73GSBGUU.cjs}

@@ -1,20 +1,20 @@
 'use strict';
 
-var chunkZH2PCJ4V_cjs = require('./chunk-ZH2PCJ4V.cjs');
+var chunkMTX2KVU7_cjs = require('./chunk-MTX2KVU7.cjs');
 var chunkX6K3HUOY_cjs = require('./chunk-X6K3HUOY.cjs');
 var chunk5X2PTP6F_cjs = require('./chunk-5X2PTP6F.cjs');
-var chunk6NTVRDQV_cjs = require('./chunk-6NTVRDQV.cjs');
+var chunkQDMPOAI7_cjs = require('./chunk-QDMPOAI7.cjs');
 var chunk47LRVGOT_cjs = require('./chunk-47LRVGOT.cjs');
-var chunkBOAVE4FC_cjs = require('./chunk-BOAVE4FC.cjs');
-var chunkEEJSQEHC_cjs = require('./chunk-EEJSQEHC.cjs');
-var chunkCGIDYRAX_cjs = require('./chunk-CGIDYRAX.cjs');
+var chunkCSG5XVNJ_cjs = require('./chunk-CSG5XVNJ.cjs');
+var chunkNZFKROS7_cjs = require('./chunk-NZFKROS7.cjs');
+var chunkAHCLWAM5_cjs = require('./chunk-AHCLWAM5.cjs');
 var chunkZ2XP767T_cjs = require('./chunk-Z2XP767T.cjs');
-var chunkJ73SJHR3_cjs = require('./chunk-J73SJHR3.cjs');
-var chunkHTXVVJRA_cjs = require('./chunk-HTXVVJRA.cjs');
+var chunkBXKJLM5R_cjs = require('./chunk-BXKJLM5R.cjs');
+var chunk4CVLFLOB_cjs = require('./chunk-4CVLFLOB.cjs');
 var chunkOC6LTXYS_cjs = require('./chunk-OC6LTXYS.cjs');
-var chunkF7G7ZFIZ_cjs = require('./chunk-F7G7ZFIZ.cjs');
-var chunk7J2Q77OH_cjs = require('./chunk-7J2Q77OH.cjs');
-var chunk6BKTCEUP_cjs = require('./chunk-6BKTCEUP.cjs');
+var chunkAZUA3F4I_cjs = require('./chunk-AZUA3F4I.cjs');
+var chunkWWOLFXTX_cjs = require('./chunk-WWOLFXTX.cjs');
+var chunkTY3TLZAW_cjs = require('./chunk-TY3TLZAW.cjs');
 var chunkM4N5GA5Z_cjs = require('./chunk-M4N5GA5Z.cjs');
 var chunkB7LXJ6LC_cjs = require('./chunk-B7LXJ6LC.cjs');
 
@@ -2203,7 +2203,7 @@ function checkPackageCompatibility(candidate, existing) {
 
 // src/api/EngineVersionCompatibility.ts
 var import_semver = chunkB7LXJ6LC_cjs.__toESM(require_semver2(), 1);
-function checkEngineVersionCompatibility(pkg, engineVersion = chunkF7G7ZFIZ_cjs.ENGINE_VERSION) {
+function checkEngineVersionCompatibility(pkg, engineVersion = chunkAZUA3F4I_cjs.ENGINE_VERSION) {
   if (!pkg.engineVersion) return { compatible: true };
   if ((0, import_semver.validRange)(pkg.engineVersion) === null) {
     return { compatible: false, reason: "invalid-range", declaredRange: pkg.engineVersion, engineVersion };
@@ -2214,7 +2214,7 @@ function checkEngineVersionCompatibility(pkg, engineVersion = chunkF7G7ZFIZ_cjs.
   }
   return { compatible: true };
 }
-function assertEngineVersionCompatible(pkg, engineVersion = chunkF7G7ZFIZ_cjs.ENGINE_VERSION) {
+function assertEngineVersionCompatible(pkg, engineVersion = chunkAZUA3F4I_cjs.ENGINE_VERSION) {
   const result = checkEngineVersionCompatibility(pkg, engineVersion);
   if (result.compatible) return;
   if (result.reason === "invalid-range") {
@@ -2251,7 +2251,7 @@ function getCompileEngine() {
 var executeVm = null;
 function getExecuteVm() {
   if (!executeVm) {
-    executeVm = chunk6NTVRDQV_cjs.createVM(chunkJ73SJHR3_cjs.sharedOpRegistry, 200, 5e4);
+    executeVm = chunkQDMPOAI7_cjs.createVM(chunkBXKJLM5R_cjs.sharedOpRegistry, 200, 5e4);
   }
   return executeVm;
 }
@@ -2323,7 +2323,7 @@ function executeOne(item) {
   const numbers = new Float64Array(item.numbersBuffer, 0, item.numbersLength);
   const bytecode = { opcodes, numbers, strings: item.strings };
   try {
-    const result = chunk6NTVRDQV_cjs.executeBytecode(bytecode, vmm);
+    const result = chunkQDMPOAI7_cjs.executeBytecode(bytecode, vmm);
     if (result.type === "pending") {
       return {
         lineNumber: item.lineNumber,
@@ -2987,7 +2987,7 @@ var _AsyncResolutionBatcher = class _AsyncResolutionBatcher {
       if (!entry || entry.bytecode.opcodes.length === 0) continue;
       const stackBefore = this.vm.getStack().length;
       try {
-        const result = chunk6NTVRDQV_cjs.executeBytecode(entry.bytecode, this.vm);
+        const result = chunkQDMPOAI7_cjs.executeBytecode(entry.bytecode, this.vm);
         while (this.vm.getStack().length > stackBefore) {
           this.vm.pop();
         }
@@ -3293,7 +3293,7 @@ function extractReadsAndWrites(tokens) {
     const t = tokens[i];
     if (t.type === "GLOBAL") {
       if (i + 2 < tokens.length && tokens[i + 1].type === "COLON" && isVarName(tokens[i + 2])) {
-        const key = chunkJ73SJHR3_cjs.globalDagKey(tokens[i + 2].value);
+        const key = chunkBXKJLM5R_cjs.globalDagKey(tokens[i + 2].value);
         reads.push(key);
         if (i + 3 < tokens.length && tokens[i + 3].type === "EQUALS") {
           writes.push(key);
@@ -3332,11 +3332,11 @@ function extractReadsAndWrites(tokens) {
   return { reads, writes };
 }
 function isEmptyLine(lineText) {
-  const classification = chunk7J2Q77OH_cjs.sharedLexer.classifyLine(lineText);
+  const classification = chunkWWOLFXTX_cjs.sharedLexer.classifyLine(lineText);
   return classification.skip;
 }
 function findInlineSolvesInLine(lineText, lineNumber) {
-  const spans = chunk7J2Q77OH_cjs.sharedLexer.findInlineSolves(lineText);
+  const spans = chunkWWOLFXTX_cjs.sharedLexer.findInlineSolves(lineText);
   return spans.map((s) => ({
     start: s.start,
     end: s.end,
@@ -3352,9 +3352,9 @@ var ExpressionEngine = class {
   //#region Constructor
   constructor(localeCode = "en", diagnosticMode = false, config, diagnosticPipeline, packages) {
     //#region Private Properties
-    this.dag = new chunk6NTVRDQV_cjs.DependencyGraph();
+    this.dag = new chunkQDMPOAI7_cjs.DependencyGraph();
     this.lineCache = new LineCache();
-    this.scopeManager = new chunk6NTVRDQV_cjs.ScopeManager();
+    this.scopeManager = new chunkQDMPOAI7_cjs.ScopeManager();
     /** Registry of async resolvers from registered packages. */
     this.resolverRegistry = new chunkX6K3HUOY_cjs.ResolverRegistry();
     /**
@@ -3410,20 +3410,20 @@ var ExpressionEngine = class {
     this.bytecodeCache = /* @__PURE__ */ new Map();
     // Pre-allocated BytecodeBuilder pool
     this.builderPool = [
-      new chunkEEJSQEHC_cjs.BytecodeBuilder(),
-      new chunkEEJSQEHC_cjs.BytecodeBuilder(),
-      new chunkEEJSQEHC_cjs.BytecodeBuilder(),
-      new chunkEEJSQEHC_cjs.BytecodeBuilder()
+      new chunkNZFKROS7_cjs.BytecodeBuilder(),
+      new chunkNZFKROS7_cjs.BytecodeBuilder(),
+      new chunkNZFKROS7_cjs.BytecodeBuilder(),
+      new chunkNZFKROS7_cjs.BytecodeBuilder()
     ];
     // Index into the builder pool, incremented modulo pool size.
     this.builderPoolIndex = 0;
     // Most recent pipeline telemetry, populated when AllocationTracker.isEnabled().
     this.lastTelemetry = null;
     this.localeCode = localeCode;
-    this.config = chunkF7G7ZFIZ_cjs.mergeEngineConfig(chunkF7G7ZFIZ_cjs.DEFAULT_CONFIG, config ?? {});
-    this.lexer = new chunk7J2Q77OH_cjs.Lexer(localeCode, chunk7J2Q77OH_cjs.buildTokenLookup(localeCode));
-    this.registry = new chunkZH2PCJ4V_cjs.ParseletRegistry();
-    this.context = chunkJ73SJHR3_cjs.createEngineContext();
+    this.config = chunkAZUA3F4I_cjs.mergeEngineConfig(chunkAZUA3F4I_cjs.DEFAULT_CONFIG, config ?? {});
+    this.lexer = new chunkWWOLFXTX_cjs.Lexer(localeCode, chunkWWOLFXTX_cjs.buildTokenLookup(localeCode));
+    this.registry = new chunkMTX2KVU7_cjs.ParseletRegistry();
+    this.context = chunkBXKJLM5R_cjs.createEngineContext();
     if (diagnosticPipeline) {
       this.diagnosticPipeline = diagnosticPipeline;
     } else if (diagnosticMode) {
@@ -3433,15 +3433,15 @@ var ExpressionEngine = class {
     } else {
       this.diagnosticPipeline = new chunk47LRVGOT_cjs.DiagnosticPipeline();
     }
-    this.normalizer = new chunkCGIDYRAX_cjs.TokenNormalizer();
-    for (const [phrase, tokenType] of Object.entries(chunkCGIDYRAX_cjs.BUILTIN_PHRASES)) {
+    this.normalizer = new chunkAHCLWAM5_cjs.TokenNormalizer();
+    for (const [phrase, tokenType] of Object.entries(chunkAHCLWAM5_cjs.BUILTIN_PHRASES)) {
       this.normalizer.addPhrase(phrase, tokenType);
     }
-    this.normalizer.register(chunkCGIDYRAX_cjs.implicitMultiplyRule(
+    this.normalizer.register(chunkAHCLWAM5_cjs.implicitMultiplyRule(
       50,
       (word) => this.normalizer.canStartPhrase(word)
     ));
-    const pkgList = packages ?? chunkBOAVE4FC_cjs.BUILTIN_PACKAGES;
+    const pkgList = packages ?? chunkCSG5XVNJ_cjs.BUILTIN_PACKAGES;
     for (const pkg of pkgList) {
       try {
         this.registerPackage(pkg);
@@ -3452,8 +3452,8 @@ var ExpressionEngine = class {
         );
       }
     }
-    this.parser = new chunkZH2PCJ4V_cjs.PrecedenceParser(this.registry, this.config.validation.maxNestingDepth, localeCode);
-    this.vm = chunk6NTVRDQV_cjs.createVM(
+    this.parser = new chunkMTX2KVU7_cjs.PrecedenceParser(this.registry, this.config.validation.maxNestingDepth, localeCode);
+    this.vm = chunkQDMPOAI7_cjs.createVM(
       this.context.opRegistry,
       this.config.vm.maxStackDepth,
       this.config.vm.maxInstructions,
@@ -3624,7 +3624,7 @@ var ExpressionEngine = class {
     }
     if (pkg.tokenCategories) {
       for (const [tokenType, category] of Object.entries(pkg.tokenCategories)) {
-        chunk6BKTCEUP_cjs.registerTokenCategory(tokenType, category);
+        chunkTY3TLZAW_cjs.registerTokenCategory(tokenType, category);
         contribution.tokenCategories.push(tokenType);
       }
     }
@@ -3633,7 +3633,7 @@ var ExpressionEngine = class {
     }
     if (pkg.asConverters) {
       for (const [name, handler] of Object.entries(pkg.asConverters)) {
-        chunkJ73SJHR3_cjs.registerAsConverter(name, handler);
+        chunkBXKJLM5R_cjs.registerAsConverter(name, handler);
         contribution.asConverterNames.push(name);
       }
     }
@@ -3677,13 +3677,13 @@ var ExpressionEngine = class {
       this.resolverRegistry.unregister(namespace);
     }
     for (const tokenType of contribution.tokenCategories) {
-      chunk6BKTCEUP_cjs.unregisterTokenCategory(tokenType);
+      chunkTY3TLZAW_cjs.unregisterTokenCategory(tokenType);
     }
     if (contribution.lexerVocabulary) {
       this.lexer.unregisterVocabulary(contribution.lexerVocabulary);
     }
     for (const name of contribution.asConverterNames) {
-      chunkJ73SJHR3_cjs.unregisterAsConverter(name);
+      chunkBXKJLM5R_cjs.unregisterAsConverter(name);
     }
     this.packageCompletionItems.delete(packageName);
     this.packageContributions.delete(packageName);
@@ -3755,7 +3755,7 @@ var ExpressionEngine = class {
       controller.abort();
     };
     chunkZ2XP767T_cjs.setActiveQueryClient(this.queryClient);
-    const result = chunk6NTVRDQV_cjs.executeBytecode(program, this.vm, tracePipeline, traceExpression, this.makeLineContext(lineNumber));
+    const result = chunkQDMPOAI7_cjs.executeBytecode(program, this.vm, tracePipeline, traceExpression, this.makeLineContext(lineNumber));
     while (this.vm.getStack().length > stackBefore) {
       this.vm.pop();
     }
@@ -3806,7 +3806,7 @@ var ExpressionEngine = class {
       controller.abort();
     };
     chunkZ2XP767T_cjs.setActiveQueryClient(this.queryClient);
-    const result = chunk6NTVRDQV_cjs.executeBytecode(program, this.vm, void 0, void 0, this.makeLineContext(lineNumber));
+    const result = chunkQDMPOAI7_cjs.executeBytecode(program, this.vm, void 0, void 0, this.makeLineContext(lineNumber));
     while (this.vm.getStack().length > stackBefore) {
       this.vm.pop();
     }
@@ -4048,7 +4048,7 @@ var ExpressionEngine = class {
    * (this grammar is rare, a per-call allocation here is a non-issue).
    */
   compileAdHoc(tokens) {
-    const builder = new chunkEEJSQEHC_cjs.BytecodeBuilder();
+    const builder = new chunkNZFKROS7_cjs.BytecodeBuilder();
     this.parseExpression(builder, tokens);
     return builder.build();
   }
@@ -4063,7 +4063,7 @@ var ExpressionEngine = class {
    * names, which ordinary evaluation deliberately never allows.
    */
   executeSymbolicTolerant(program) {
-    const result = chunk6NTVRDQV_cjs.executeBytecode(program, this.vm, void 0, void 0, void 0, true);
+    const result = chunkQDMPOAI7_cjs.executeBytecode(program, this.vm, void 0, void 0, void 0, true);
     if (result.type === "error") throw result.error;
     if (result.type === "pending") {
       throw chunkM4N5GA5Z_cjs.ErrorFactory.execution(
@@ -4140,11 +4140,11 @@ var ExpressionEngine = class {
     }
     let combined = factorValues[0].value;
     for (let i = 1; i < factorValues.length; i++) {
-      const product = chunkHTXVVJRA_cjs.matrixMultiply(combined, factorValues[i].value);
+      const product = chunk4CVLFLOB_cjs.matrixMultiply(combined, factorValues[i].value);
       if (product.type === 13 /* Error */) return product;
       combined = product.value;
     }
-    const inv = chunkHTXVVJRA_cjs.inverse(combined);
+    const inv = chunk4CVLFLOB_cjs.inverse(combined);
     if (inv.type === 13 /* Error */) return inv;
     const rhsValue = this.executeSymbolicTolerant(equation.rhsProgram);
     if (rhsValue.type !== 7 /* Matrix */) {
@@ -4153,7 +4153,7 @@ var ExpressionEngine = class {
         `Cannot solve for "${equation.variable}": the right-hand side must be a Matrix.`
       );
     }
-    return chunkHTXVVJRA_cjs.matrixMultiply(inv.value, rhsValue.value);
+    return chunk4CVLFLOB_cjs.matrixMultiply(inv.value, rhsValue.value);
   }
   /**
    * Detects and handles this session's two new symbolic-algebra grammar
@@ -4209,7 +4209,7 @@ var ExpressionEngine = class {
       }
       return this.simplifySymbolically(beforeTokens);
     }
-    if (chunkBOAVE4FC_cjs.containsSymbolicCall(normalizedTokens)) {
+    if (chunkCSG5XVNJ_cjs.containsSymbolicCall(normalizedTokens)) {
       return this.simplifySymbolically(normalizedTokens);
     }
     if (normalizedTokens[0].type === "COLON" || normalizedTokens[0].type === "GLOBAL") return null;
@@ -4310,7 +4310,7 @@ var ExpressionEngine = class {
   solveScalarEquation(equation) {
     const lhs = this.executeSymbolicTolerant(equation.lhsProgram);
     const rhs = this.executeSymbolicTolerant(equation.rhsProgram);
-    return chunkJ73SJHR3_cjs.solveEquationValues(lhs, rhs, equation.variable);
+    return chunkBXKJLM5R_cjs.solveEquationValues(lhs, rhs, equation.variable);
   }
   //#endregion
   /**
@@ -6692,7 +6692,7 @@ var PageManager = class _PageManager {
             });
           }
         } else {
-          const inlineSpans = chunk7J2Q77OH_cjs.sharedLexer.findInlineSolves(state.text);
+          const inlineSpans = chunkWWOLFXTX_cjs.sharedLexer.findInlineSolves(state.text);
           if (inlineSpans.length > 0) {
             for (const span of inlineSpans) {
               if (!span.expression.trim()) continue;
@@ -6798,8 +6798,8 @@ var ThreeTierEvaluator = class {
     this.checkpointer = checkpointer ?? null;
     this.pageManager = new PageManager();
     this.engine.setDocumentModel(this.doc);
-    this.globalUnsubscribe = chunkJ73SJHR3_cjs.sharedGlobalVariableStore.subscribe((name) => {
-      for (const lineNumber of this.dag.getAffectedLines(chunkJ73SJHR3_cjs.globalDagKey(name))) {
+    this.globalUnsubscribe = chunkBXKJLM5R_cjs.sharedGlobalVariableStore.subscribe((name) => {
+      for (const lineNumber of this.dag.getAffectedLines(chunkBXKJLM5R_cjs.globalDagKey(name))) {
         this.doc.markDirtyByLineNumber(lineNumber);
       }
     });
@@ -7458,7 +7458,7 @@ var ThreeTierEvaluator = class {
     }
     const trimmed = state.text.trim();
     if (trimmed.length === 0) return { expressions: [], inlineSolveCount: 0 };
-    const inlineSpans = chunk7J2Q77OH_cjs.sharedLexer.findInlineSolves(state.text);
+    const inlineSpans = chunkWWOLFXTX_cjs.sharedLexer.findInlineSolves(state.text);
     if (inlineSpans.length > 0) {
       return {
         expressions: inlineSpans.map((s) => s.expression),
@@ -7482,5 +7482,5 @@ exports.checkPackageCompatibility = checkPackageCompatibility;
 exports.extractReadsAndWrites = extractReadsAndWrites;
 exports.findInlineSolvesInLine = findInlineSolvesInLine;
 exports.isEmptyLine = isEmptyLine;
-//# sourceMappingURL=chunk-PG2K5BL6.cjs.map
-//# sourceMappingURL=chunk-PG2K5BL6.cjs.map
+//# sourceMappingURL=chunk-73GSBGUU.cjs.map
+//# sourceMappingURL=chunk-73GSBGUU.cjs.map