solve-engine 2.31.1 → 2.33.0

package/dist/{Parselet-Dgymjxzd.d.ts → Parselet-CQjcHOKw.d.ts}

@@ -1,6 +1,6 @@
 import { B as BytecodeBuilder } from './BytecodeBuilder-DSWKZi4f.js';
 import { T as Token } from './Token-D8f7yaz1.js';
-import { D as DiagnosticPipeline } from './pipeline-Cl7KW8CB.js';
+import { D as DiagnosticPipeline } from './pipeline-DOo3KHaq.js';
 import { C as CalendarBackend } from './CalendarBackend-MdS3Bb4P.js';
 
 /**
@@ -77,16 +77,15 @@ declare class ParseletRegistry {
      * one higher. That is the standard encoding for a left-associative
      * operator, and it is what the parser itself does, see
      * `PrecedenceParser.parseExpression()`'s `bp + 1` for the right operand.
-     * Every operator is reported that way, `^` included. Associativity is not
-     * something a parselet declares, it is a property of how each one calls
-     * `parseExpression`, so this API cannot report it without a new field on
-     * the interface. See {@link ParseletBindingPowers} for why scraping a
-     * plausible-looking one off the parselet is worse than not reporting it.
+     * An operator that declares `rightAssociative` (`^`) is reported with the
+     * right power one BELOW the left, which is how it parses its right operand
+     * (see `parseRightOperand`), and `associativity` says which in words.
      */
     getAllInfix(): Array<{
         tokenType: string;
         leftBindingPower: number;
         rightBindingPower: number;
+        associativity: "left" | "right";
         category?: string;
     }>;
     /** Number of registered prefix parselets. */
@@ -363,6 +362,14 @@ interface InfixParselet {
     readonly category: string;
     /** Binding power (precedence), property access avoids vtable dispatch in hot loop */
     readonly bindingPower: number;
+    /**
+     * Whether the operator groups from the right (`2 ^ 3 ^ 2` is `2 ^ (3 ^ 2)`).
+     * Absent means left, which is what every operator but exponentiation
+     * wants. Read by {@link parseRightOperand}, and reported by
+     * `ParseletRegistry.getAllInfix` so a precedence table built from the
+     * registry says what the parser does.
+     */
+    readonly rightAssociative?: boolean;
     parse(parser: PrecedenceParser, left: Token, token: Token, builder: BytecodeBuilder): void;
 }
 

package/dist/{Parselet-DF3864la.d.cts → Parselet-s1sRRn8H.d.cts}

@@ -1,6 +1,6 @@
 import { B as BytecodeBuilder } from './BytecodeBuilder-DSWKZi4f.cjs';
 import { T as Token } from './Token-D8f7yaz1.cjs';
-import { D as DiagnosticPipeline } from './pipeline-BYkKNpql.cjs';
+import { D as DiagnosticPipeline } from './pipeline-Bum6y1B9.cjs';
 import { C as CalendarBackend } from './CalendarBackend-MdS3Bb4P.cjs';
 
 /**
@@ -77,16 +77,15 @@ declare class ParseletRegistry {
      * one higher. That is the standard encoding for a left-associative
      * operator, and it is what the parser itself does, see
      * `PrecedenceParser.parseExpression()`'s `bp + 1` for the right operand.
-     * Every operator is reported that way, `^` included. Associativity is not
-     * something a parselet declares, it is a property of how each one calls
-     * `parseExpression`, so this API cannot report it without a new field on
-     * the interface. See {@link ParseletBindingPowers} for why scraping a
-     * plausible-looking one off the parselet is worse than not reporting it.
+     * An operator that declares `rightAssociative` (`^`) is reported with the
+     * right power one BELOW the left, which is how it parses its right operand
+     * (see `parseRightOperand`), and `associativity` says which in words.
      */
     getAllInfix(): Array<{
         tokenType: string;
         leftBindingPower: number;
         rightBindingPower: number;
+        associativity: "left" | "right";
         category?: string;
     }>;
     /** Number of registered prefix parselets. */
@@ -363,6 +362,14 @@ interface InfixParselet {
     readonly category: string;
     /** Binding power (precedence), property access avoids vtable dispatch in hot loop */
     readonly bindingPower: number;
+    /**
+     * Whether the operator groups from the right (`2 ^ 3 ^ 2` is `2 ^ (3 ^ 2)`).
+     * Absent means left, which is what every operator but exponentiation
+     * wants. Read by {@link parseRightOperand}, and reported by
+     * `ParseletRegistry.getAllInfix` so a precedence table built from the
+     * registry says what the parser does.
+     */
+    readonly rightAssociative?: boolean;
     parse(parser: PrecedenceParser, left: Token, token: Token, builder: BytecodeBuilder): void;
 }
 

package/dist/{TokenNormalizer-Pe3_390t.d.cts → TokenNormalizer-D382VSYh.d.cts}

@@ -605,7 +605,10 @@ declare class TokenNormalizer {
      * @param tokens   - Raw tokens from the lexer
      * @param onFusion - Optional fusion callback (overrides {@link NormalizerOptions.onFusion})
      * @returns Normalized tokens ready for parsing
-     * @throws {Error} If the normalized token count exceeds maxTokens
+     * @throws {Error} If the normalized token count exceeds maxTokens, or the
+     *   stream is still changing after maxPasses passes (a rule chain that never
+     *   settles): NORMALIZER_PASS_LIMIT_EXCEEDED, rather than a stream that is
+     *   quietly whatever the last pass left.
      */
     normalize(tokens: Token[], onFusion?: (fusion: TokenFusion) => void): Token[];
 }

package/dist/{TokenNormalizer-IF7nPRMp.d.ts → TokenNormalizer-DAzPp-j1.d.ts}

@@ -605,7 +605,10 @@ declare class TokenNormalizer {
      * @param tokens   - Raw tokens from the lexer
      * @param onFusion - Optional fusion callback (overrides {@link NormalizerOptions.onFusion})
      * @returns Normalized tokens ready for parsing
-     * @throws {Error} If the normalized token count exceeds maxTokens
+     * @throws {Error} If the normalized token count exceeds maxTokens, or the
+     *   stream is still changing after maxPasses passes (a rule chain that never
+     *   settles): NORMALIZER_PASS_LIMIT_EXCEEDED, rather than a stream that is
+     *   quietly whatever the last pass left.
      */
     normalize(tokens: Token[], onFusion?: (fusion: TokenFusion) => void): Token[];
 }

package/dist/{VMBuiltins-BkKzhj6C.d.cts → VMBuiltins-JCavlQUj.d.cts}

@@ -1,8 +1,8 @@
-import { V as Value } from './Value-BYHw-x7q.cjs';
+import { V as Value } from './Value-2TIKi-YL.cjs';
 import { U as UserFunctionDef, A as AnonymousBodyDef, a as BytecodeProgram } from './BytecodeBuilder-DSWKZi4f.cjs';
 import { C as CalendarBackend } from './CalendarBackend-MdS3Bb4P.cjs';
-import { E as EngineError } from './EngineError-CqGtaT_v.cjs';
-import { D as DiagnosticPipeline } from './pipeline-BYkKNpql.cjs';
+import { E as EngineError } from './EngineError-Bm4OYmw8.cjs';
+import { D as DiagnosticPipeline } from './pipeline-Bum6y1B9.cjs';
 
 /**
  * Create a new VM instance with the given opcode registry and configurable limits.
@@ -13,7 +13,11 @@ import { D as DiagnosticPipeline } from './pipeline-BYkKNpql.cjs';
  * - An instruction counter (bounded by `maxInstructions`)
  * - An AbortSignal for async cancellation
  *
- * @param registry - Opcode handler registry for plugin-extensible opcodes
+ * @param registry - Never consulted, and kept only so the parameter list a
+ *   host already calls with keeps working. The dispatch loop refuses any
+ *   opcode it has no arm for, whatever a registry claims about it; a package
+ *   reaches the VM through `pluginFunctions` and `CALL_PLUGIN`. See
+ *   `OpRegistry.ts`, and the deprecation there.
  * @param maxStackDepth - Maximum stack slots (default 200)
  * @param maxInstructions - Maximum opcodes per expression (default 50000)
  * @param maxFunctionRecursionDepth - Maximum nested user-defined-function
@@ -176,9 +180,12 @@ type EvalResult = {
  *   switches (OpCode values 0–200) into a jump table with O(1) dispatch.
  *   All handler code is inlined directly in the switch cases, allowing
  *   TurboFan to optimize across opcode boundaries.
- * - ADD/SUB/MUL have an inlined numeric fast path that skips the `binaryOp()`
- *   function call + closure allocation when both operands are plain numbers
- *   (>90% of arithmetic ops).
+ * - ADD/SUB/MUL/DIV and the six comparisons open with an inlined plain-number
+ *   branch: two Numbers carrying no rational or uncertainty sidecar (>90% of
+ *   arithmetic ops) are answered before any helper (fault propagation,
+ *   percentage, rate period, money, unit, `binaryOp()`) is called. The
+ *   sidecar checks are what keep the branch honest: an exact fraction or a
+ *   measurement takes the ladder below it, exactly as before.
  * - Tracing uses a boolean guard (`shouldTrace`) that the JIT eliminates
  *   entirely when diagnostics are disabled. No function call overhead.
  * - `Value.toNumber()` caches its result, computed once, read thereafter.
@@ -346,26 +353,44 @@ interface ScalarEquationDef {
     rhsProgram: BytecodeProgram;
 }
 /**
- * Handler function for plugin-registered opcodes via CALL_PLUGIN (opcode 50).
- * No longer dispatched directly from the VM switch, plugins register
- * functions in pluginFunctionRegistry instead.
+ * Handler function for a custom opcode, in the shape the VM never calls.
  *
- * @deprecated Use CALL_PLUGIN + pluginFunctionRegistry for plugin functionality.
- *   OpRegistry remains for the VM interface contract only.
+ * @deprecated Nothing dispatches to a handler of this type. A package reaches
+ *   the VM through `IEnginePackage.pluginFunctions`, which `CALL_PLUGIN`
+ *   resolves per engine. Removed in the next major with {@link OpRegistry}.
  */
 type OpcodeHandler = (vm: VM, opcodes: Uint8Array, ip: number, numbers: Float64Array, strings: string[]) => number;
-/** Registration payload for an opcode handler. Binds an OpCode to its handler function with plugin attribution. */
+/**
+ * Registration payload for an opcode handler.
+ *
+ * @deprecated See {@link OpcodeHandler}. Removed in the next major.
+ */
 interface IOpcodeHandlerRegistration {
     opcode: number;
     handler: OpcodeHandler;
     pluginName: string;
 }
 /**
- * Legacy opcode registry, retained for the VM interface contract.
+ * A table of custom opcode handlers the virtual machine never reads.
  *
- * Previously dispatched custom opcodes (>= 200) from the VM switch-default
- * branch. Now plugins should use CALL_PLUGIN (opcode 50) via
- * pluginFunctionRegistry instead.
+ * This once described an extension point: a package allocated an opcode from
+ * the dynamic range (201 to 254), registered a handler for it, and the VM's
+ * dispatch switch was meant to call that handler from its default arm. The
+ * switch never consulted the registry, and until recently had no default arm
+ * at all, so a registered opcode ran as a no-op and the program failed some
+ * instructions later with a misleading STACK_UNDERFLOW. The dispatch loop now
+ * refuses any opcode it has no arm for, at that instruction, with
+ * `MALFORMED_BYTECODE_UNKNOWN_OPCODE`, whatever a registry claims about it.
+ *
+ * The class, the {@link sharedOpRegistry} singleton, the `registry` field on
+ * {@link VM} and the first parameter of `createVM()` are kept so the calls a
+ * host already makes keep compiling and running; every one of them is
+ * deprecated and goes in the next major. A package that wants the VM to run
+ * its code declares `IEnginePackage.pluginFunctions`, which `CALL_PLUGIN`
+ * resolves through the engine's own context, one table per engine.
+ *
+ * @deprecated Never consulted by the VM. Use `IEnginePackage.pluginFunctions`.
+ *   Removed in the next major.
  */
 declare class OpRegistry {
     private handlers;
@@ -435,6 +460,11 @@ interface VM {
     popString(): string;
     peek(): Value;
     getStack(): Value[];
+    /**
+     * The registry this machine was built with, which it never reads.
+     *
+     * @deprecated See {@link OpRegistry}. Removed in the next major.
+     */
     registry: OpRegistry;
     /**
      * Read a variable by name, checks the INNERMOST active user-defined-
@@ -550,7 +580,12 @@ interface VM {
      */
     context: EngineContext;
 }
-/** Shared singleton OpRegistry, used when no custom opcodes are needed. */
+/**
+ * The registry every `createVM()` call without one of its own is handed.
+ *
+ * @deprecated See {@link OpRegistry}: the VM never reads it. Removed in the
+ *   next major, together with `createVM()`'s first parameter.
+ */
 declare const sharedOpRegistry: OpRegistry;
 
 /** Serialized snapshot of the dependency graph for diagnostic rendering. */

package/dist/{VMBuiltins-Du9y8sEo.d.ts → VMBuiltins-qgzA6qGi.d.ts}

@@ -1,8 +1,8 @@
-import { V as Value } from './Value-BYHw-x7q.js';
+import { V as Value } from './Value-2TIKi-YL.js';
 import { U as UserFunctionDef, A as AnonymousBodyDef, a as BytecodeProgram } from './BytecodeBuilder-DSWKZi4f.js';
 import { C as CalendarBackend } from './CalendarBackend-MdS3Bb4P.js';
-import { E as EngineError } from './EngineError-CqGtaT_v.js';
-import { D as DiagnosticPipeline } from './pipeline-Cl7KW8CB.js';
+import { E as EngineError } from './EngineError-Bm4OYmw8.js';
+import { D as DiagnosticPipeline } from './pipeline-DOo3KHaq.js';
 
 /**
  * Create a new VM instance with the given opcode registry and configurable limits.
@@ -13,7 +13,11 @@ import { D as DiagnosticPipeline } from './pipeline-Cl7KW8CB.js';
  * - An instruction counter (bounded by `maxInstructions`)
  * - An AbortSignal for async cancellation
  *
- * @param registry - Opcode handler registry for plugin-extensible opcodes
+ * @param registry - Never consulted, and kept only so the parameter list a
+ *   host already calls with keeps working. The dispatch loop refuses any
+ *   opcode it has no arm for, whatever a registry claims about it; a package
+ *   reaches the VM through `pluginFunctions` and `CALL_PLUGIN`. See
+ *   `OpRegistry.ts`, and the deprecation there.
  * @param maxStackDepth - Maximum stack slots (default 200)
  * @param maxInstructions - Maximum opcodes per expression (default 50000)
  * @param maxFunctionRecursionDepth - Maximum nested user-defined-function
@@ -176,9 +180,12 @@ type EvalResult = {
  *   switches (OpCode values 0–200) into a jump table with O(1) dispatch.
  *   All handler code is inlined directly in the switch cases, allowing
  *   TurboFan to optimize across opcode boundaries.
- * - ADD/SUB/MUL have an inlined numeric fast path that skips the `binaryOp()`
- *   function call + closure allocation when both operands are plain numbers
- *   (>90% of arithmetic ops).
+ * - ADD/SUB/MUL/DIV and the six comparisons open with an inlined plain-number
+ *   branch: two Numbers carrying no rational or uncertainty sidecar (>90% of
+ *   arithmetic ops) are answered before any helper (fault propagation,
+ *   percentage, rate period, money, unit, `binaryOp()`) is called. The
+ *   sidecar checks are what keep the branch honest: an exact fraction or a
+ *   measurement takes the ladder below it, exactly as before.
  * - Tracing uses a boolean guard (`shouldTrace`) that the JIT eliminates
  *   entirely when diagnostics are disabled. No function call overhead.
  * - `Value.toNumber()` caches its result, computed once, read thereafter.
@@ -346,26 +353,44 @@ interface ScalarEquationDef {
     rhsProgram: BytecodeProgram;
 }
 /**
- * Handler function for plugin-registered opcodes via CALL_PLUGIN (opcode 50).
- * No longer dispatched directly from the VM switch, plugins register
- * functions in pluginFunctionRegistry instead.
+ * Handler function for a custom opcode, in the shape the VM never calls.
  *
- * @deprecated Use CALL_PLUGIN + pluginFunctionRegistry for plugin functionality.
- *   OpRegistry remains for the VM interface contract only.
+ * @deprecated Nothing dispatches to a handler of this type. A package reaches
+ *   the VM through `IEnginePackage.pluginFunctions`, which `CALL_PLUGIN`
+ *   resolves per engine. Removed in the next major with {@link OpRegistry}.
  */
 type OpcodeHandler = (vm: VM, opcodes: Uint8Array, ip: number, numbers: Float64Array, strings: string[]) => number;
-/** Registration payload for an opcode handler. Binds an OpCode to its handler function with plugin attribution. */
+/**
+ * Registration payload for an opcode handler.
+ *
+ * @deprecated See {@link OpcodeHandler}. Removed in the next major.
+ */
 interface IOpcodeHandlerRegistration {
     opcode: number;
     handler: OpcodeHandler;
     pluginName: string;
 }
 /**
- * Legacy opcode registry, retained for the VM interface contract.
+ * A table of custom opcode handlers the virtual machine never reads.
  *
- * Previously dispatched custom opcodes (>= 200) from the VM switch-default
- * branch. Now plugins should use CALL_PLUGIN (opcode 50) via
- * pluginFunctionRegistry instead.
+ * This once described an extension point: a package allocated an opcode from
+ * the dynamic range (201 to 254), registered a handler for it, and the VM's
+ * dispatch switch was meant to call that handler from its default arm. The
+ * switch never consulted the registry, and until recently had no default arm
+ * at all, so a registered opcode ran as a no-op and the program failed some
+ * instructions later with a misleading STACK_UNDERFLOW. The dispatch loop now
+ * refuses any opcode it has no arm for, at that instruction, with
+ * `MALFORMED_BYTECODE_UNKNOWN_OPCODE`, whatever a registry claims about it.
+ *
+ * The class, the {@link sharedOpRegistry} singleton, the `registry` field on
+ * {@link VM} and the first parameter of `createVM()` are kept so the calls a
+ * host already makes keep compiling and running; every one of them is
+ * deprecated and goes in the next major. A package that wants the VM to run
+ * its code declares `IEnginePackage.pluginFunctions`, which `CALL_PLUGIN`
+ * resolves through the engine's own context, one table per engine.
+ *
+ * @deprecated Never consulted by the VM. Use `IEnginePackage.pluginFunctions`.
+ *   Removed in the next major.
  */
 declare class OpRegistry {
     private handlers;
@@ -435,6 +460,11 @@ interface VM {
     popString(): string;
     peek(): Value;
     getStack(): Value[];
+    /**
+     * The registry this machine was built with, which it never reads.
+     *
+     * @deprecated See {@link OpRegistry}. Removed in the next major.
+     */
     registry: OpRegistry;
     /**
      * Read a variable by name, checks the INNERMOST active user-defined-
@@ -550,7 +580,12 @@ interface VM {
      */
     context: EngineContext;
 }
-/** Shared singleton OpRegistry, used when no custom opcodes are needed. */
+/**
+ * The registry every `createVM()` call without one of its own is handed.
+ *
+ * @deprecated See {@link OpRegistry}: the VM never reads it. Removed in the
+ *   next major, together with `createVM()`'s first parameter.
+ */
 declare const sharedOpRegistry: OpRegistry;
 
 /** Serialized snapshot of the dependency graph for diagnostic rendering. */

package/dist/{VMCheckpoints-WdUQrdc9.d.cts → VMCheckpoints-BxPzmdu0.d.cts}

@@ -1,5 +1,5 @@
-import { V as Value } from './Value-BYHw-x7q.cjs';
-import { V as VM } from './VMBuiltins-BkKzhj6C.cjs';
+import { V as Value } from './Value-2TIKi-YL.cjs';
+import { V as VM } from './VMBuiltins-JCavlQUj.cjs';
 import { U as UserFunctionDef } from './BytecodeBuilder-DSWKZi4f.cjs';
 
 /**

package/dist/{VMCheckpoints-gvy_yxYh.d.ts → VMCheckpoints-DjjE92mf.d.ts}

@@ -1,5 +1,5 @@
-import { V as Value } from './Value-BYHw-x7q.js';
-import { V as VM } from './VMBuiltins-Du9y8sEo.js';
+import { V as Value } from './Value-2TIKi-YL.js';
+import { V as VM } from './VMBuiltins-qgzA6qGi.js';
 import { U as UserFunctionDef } from './BytecodeBuilder-DSWKZi4f.js';
 
 /**

package/dist/{Value-BYHw-x7q.d.cts → Value-2TIKi-YL.d.cts}

@@ -469,6 +469,25 @@ declare class Value {
      * Called by ValueArena.acquire(), zero allocation, just field assignment.
      */
     recycle(type: ValueType, value: number | bigint | string | boolean | MatrixData | RangeData | ColourData | SplitData | ChartData | IpCidrData | SymbolicNode, unit?: string): void;
+    /**
+     * A fresh Value carrying everything this one does: the payload, the unit,
+     * the cached number and every sidecar, present or future.
+     *
+     * The inverse of {@link recycle}, and written as a whole-object copy rather
+     * than a list of fields on purpose. `persistentValue()` used to name the
+     * sidecars it copied, and the two it did not name (`decimalPlaces`,
+     * `timedOut`) were silently dropped by every viewport evaluation, so
+     * `3.14159 to 4 dp` displayed as 3.14 there and as 3.1416 on a single line.
+     * A sidecar added later is carried here without this method knowing its
+     * name, which closes that class of bug rather than the one instance.
+     *
+     * Shallow, as the old copy was: a matrix, a chart or a symbolic tree is
+     * shared with the original, which is fine because a Value's payload is
+     * treated as immutable everywhere outside the arena's own `recycle()`.
+     *
+     * @returns A new Value equal to this one in every field.
+     */
+    clone(): Value;
     isNumber(): this is Value & {
         value: number;
     };

package/dist/{Value-BYHw-x7q.d.ts → Value-2TIKi-YL.d.ts}

@@ -469,6 +469,25 @@ declare class Value {
      * Called by ValueArena.acquire(), zero allocation, just field assignment.
      */
     recycle(type: ValueType, value: number | bigint | string | boolean | MatrixData | RangeData | ColourData | SplitData | ChartData | IpCidrData | SymbolicNode, unit?: string): void;
+    /**
+     * A fresh Value carrying everything this one does: the payload, the unit,
+     * the cached number and every sidecar, present or future.
+     *
+     * The inverse of {@link recycle}, and written as a whole-object copy rather
+     * than a list of fields on purpose. `persistentValue()` used to name the
+     * sidecars it copied, and the two it did not name (`decimalPlaces`,
+     * `timedOut`) were silently dropped by every viewport evaluation, so
+     * `3.14159 to 4 dp` displayed as 3.14 there and as 3.1416 on a single line.
+     * A sidecar added later is carried here without this method knowing its
+     * name, which closes that class of bug rather than the one instance.
+     *
+     * Shallow, as the old copy was: a matrix, a chart or a symbolic tree is
+     * shared with the original, which is fine because a Value's payload is
+     * treated as immutable everywhere outside the arena's own `recycle()`.
+     *
+     * @returns A new Value equal to this one in every field.
+     */
+    clone(): Value;
     isNumber(): this is Value & {
         value: number;
     };

package/dist/{WorkerError-DTrl3Jag.d.ts → WorkerError-BaN8_eok.d.ts}

@@ -1,4 +1,4 @@
-import { c as ErrorCategory, S as SourceSpan, E as EngineError } from './EngineError-CqGtaT_v.js';
+import { c as ErrorCategory, S as SourceSpan, E as EngineError } from './EngineError-Bm4OYmw8.js';
 
 /**
  * Structured errors for the off-main-thread worker harness, and the pair of

package/dist/{WorkerError-CRoM8Ju1.d.cts → WorkerError-CexHHmbb.d.cts}

@@ -1,4 +1,4 @@
-import { c as ErrorCategory, S as SourceSpan, E as EngineError } from './EngineError-CqGtaT_v.cjs';
+import { c as ErrorCategory, S as SourceSpan, E as EngineError } from './EngineError-Bm4OYmw8.cjs';
 
 /**
  * Structured errors for the off-main-thread worker harness, and the pair of

package/dist/{chunk-AGCNMEP2.cjs → chunk-3MG7VIPL.cjs}

@@ -1,2 +1,2 @@
-'use strict';var chunkY7O4D3BJ_cjs=require('./chunk-Y7O4D3BJ.cjs'),chunkWU7SBKVU_cjs=require('./chunk-WU7SBKVU.cjs'),chunkSUAGBRQ7_cjs=require('./chunk-SUAGBRQ7.cjs');var h=(s=>(s.Main="main",s.Inline="inline",s.String="string",s))(h||{});var n=class{constructor(e="en",t){this.currentState="main";this.hasPeeked=false;this.tokens=[];this.tokenIdx=0;this.expressionLexer=new chunkWU7SBKVU_cjs.b(e);}reset(e,t){let s=t??"main";if(this.currentState=s,this.hasPeeked=false,this.peekedToken=void 0,s==="main"){if(this.expressionLexer.classifyLine(e).skip){this.tokens=[],this.tokenIdx=0;return}this.expressionLexer.reset(e),this.tokens=this.expressionLexer.tokenizeAll(),this.tokenIdx=0;}else this.expressionLexer.reset(e),this.tokens=this.expressionLexer.tokenizeAll(),this.tokenIdx=0;}classifyLine(e){return this.expressionLexer.classifyLine(e)}findInlineSolves(e){return this.expressionLexer.findInlineSolves(e)}getKeywords(){return this.expressionLexer.getKeywords()}next(){if(this.hasPeeked)return this.hasPeeked=false,this.peekedToken;if(this.tokenIdx<this.tokens.length)return this.tokens[this.tokenIdx++]}peek(){return this.hasPeeked?this.peekedToken:(this.peekedToken=this.next(),this.hasPeeked=true,this.peekedToken)}[Symbol.iterator](){return this.tokens[Symbol.iterator]()}registerVocabulary(e){this.expressionLexer.registerVocabulary(e);}unregisterVocabulary(e){this.expressionLexer.unregisterVocabulary(e);}resetExpression(e){this.currentState="main",this.hasPeeked=false,this.peekedToken=void 0,this.expressionLexer.reset(e),this.tokens=this.expressionLexer.tokenizeAll(),this.tokenIdx=0;}scanDocument(e){return this.expressionLexer.scanDocument(e)}getState(){return this.currentState}setState(e){this.currentState=e;}getHighlightTokens(e){let t=this.expressionLexer.classifyLine(e);return t.skip&&e.startsWith("> ")?this.collectHighlightTokens(e.slice(2)):t.skip?[]:this.collectHighlightTokens(e)}getHighlightTokenObjects(e){let t=this.expressionLexer.classifyLine(e);return t.skip&&e.startsWith("> ")?this.collectTokenObjects(e.slice(2)):t.skip?[]:this.collectTokenObjects(e)}collectTokenObjects(e){this.currentState="main",this.hasPeeked=false,this.peekedToken=void 0,this.expressionLexer.reset(e);let t=[];try{this.expressionLexer.tokenizeInto(t);}catch(i){if(!(i instanceof chunkSUAGBRQ7_cjs.b))throw i}let s=[];for(let i of t)i.type==="WS"||i.type==="NEWLINE"||i.type.startsWith("MD_")||i.type==="INLINE_SOLVE_START"||i.type==="BACKTICK_CLOSE"||s.push(i);return this.tokens=s,this.tokenIdx=0,s}collectHighlightTokens(e){return this.collectTokenObjects(e).map(t=>({type:t.type,value:t.value,offset:t.offset,col:t.col,length:t.text.length,category:chunkY7O4D3BJ_cjs.d(t.type)}))}},d=new n("en",void 0);exports.a=h;exports.b=n;exports.c=d;//# sourceMappingURL=chunk-AGCNMEP2.cjs.map
-//# sourceMappingURL=chunk-AGCNMEP2.cjs.map
+'use strict';var chunkY7O4D3BJ_cjs=require('./chunk-Y7O4D3BJ.cjs'),chunk72J5V7SN_cjs=require('./chunk-72J5V7SN.cjs'),chunk6SYU4MH7_cjs=require('./chunk-6SYU4MH7.cjs');var h=(s=>(s.Main="main",s.Inline="inline",s.String="string",s))(h||{});var n=class{constructor(e="en",t){this.currentState="main";this.hasPeeked=false;this.tokens=[];this.tokenIdx=0;this.expressionLexer=new chunk72J5V7SN_cjs.b(e);}reset(e,t){let s=t??"main";if(this.currentState=s,this.hasPeeked=false,this.peekedToken=void 0,s==="main"){if(this.expressionLexer.classifyLine(e).skip){this.tokens=[],this.tokenIdx=0;return}this.expressionLexer.reset(e),this.tokens=this.expressionLexer.tokenizeAll(),this.tokenIdx=0;}else this.expressionLexer.reset(e),this.tokens=this.expressionLexer.tokenizeAll(),this.tokenIdx=0;}classifyLine(e){return this.expressionLexer.classifyLine(e)}findInlineSolves(e){return this.expressionLexer.findInlineSolves(e)}getKeywords(){return this.expressionLexer.getKeywords()}next(){if(this.hasPeeked)return this.hasPeeked=false,this.peekedToken;if(this.tokenIdx<this.tokens.length)return this.tokens[this.tokenIdx++]}peek(){return this.hasPeeked?this.peekedToken:(this.peekedToken=this.next(),this.hasPeeked=true,this.peekedToken)}[Symbol.iterator](){return this.tokens[Symbol.iterator]()}registerVocabulary(e){this.expressionLexer.registerVocabulary(e);}unregisterVocabulary(e){this.expressionLexer.unregisterVocabulary(e);}resetExpression(e){this.currentState="main",this.hasPeeked=false,this.peekedToken=void 0,this.expressionLexer.reset(e),this.tokens=this.expressionLexer.tokenizeAll(),this.tokenIdx=0;}scanDocument(e){return this.expressionLexer.scanDocument(e)}getState(){return this.currentState}setState(e){this.currentState=e;}getHighlightTokens(e){let t=this.expressionLexer.classifyLine(e);return t.skip&&e.startsWith("> ")?this.collectHighlightTokens(e.slice(2)):t.skip?[]:this.collectHighlightTokens(e)}getHighlightTokenObjects(e){let t=this.expressionLexer.classifyLine(e);return t.skip&&e.startsWith("> ")?this.collectTokenObjects(e.slice(2)):t.skip?[]:this.collectTokenObjects(e)}collectTokenObjects(e){this.currentState="main",this.hasPeeked=false,this.peekedToken=void 0,this.expressionLexer.reset(e);let t=[];try{this.expressionLexer.tokenizeInto(t);}catch(i){if(!(i instanceof chunk6SYU4MH7_cjs.b))throw i}let s=[];for(let i of t)i.type==="WS"||i.type==="NEWLINE"||i.type.startsWith("MD_")||i.type==="INLINE_SOLVE_START"||i.type==="BACKTICK_CLOSE"||s.push(i);return this.tokens=s,this.tokenIdx=0,s}collectHighlightTokens(e){return this.collectTokenObjects(e).map(t=>({type:t.type,value:t.value,offset:t.offset,col:t.col,length:t.text.length,category:chunkY7O4D3BJ_cjs.d(t.type)}))}},d=new n("en",void 0);exports.a=h;exports.b=n;exports.c=d;//# sourceMappingURL=chunk-3MG7VIPL.cjs.map
+//# sourceMappingURL=chunk-3MG7VIPL.cjs.map

package/dist/{chunk-AGCNMEP2.cjs.map → chunk-3MG7VIPL.cjs.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/lexer/LexerState.ts","../src/lexer/Lexer.ts"],"names":["LexerState","Lexer","localeCode","_tokenLookup","ExpressionLexer","input","state","newState","lineText","plugin","text","classification","raw","thrown","EngineError","result","token","getTokenCategory","sharedLexer"],"mappings":"uKAMO,IAAKA,CAAAA,CAAAA,CAAAA,CAAAA,GACXA,EAAA,IAAA,CAAO,MAAA,CACPA,EAAA,MAAA,CAAS,QAAA,CACTA,CAAAA,CAAA,MAAA,CAAS,QAAA,CAHEA,CAAAA,CAAAA,EAAAA,CAAAA,EAAA,ICcL,IAAMC,CAAAA,CAAN,KAAY,CAkBjB,WAAA,CAAYC,CAAAA,CAAa,KAAMC,CAAAA,CAA4B,CAf3D,IAAA,CAAQ,YAAA,CAA2B,MAAA,CAEnC,IAAA,CAAQ,UAAY,KAAA,CAIpB,IAAA,CAAQ,MAAA,CAAkB,EAAC,CAC3B,IAAA,CAAQ,SAAmB,CAAA,CASzB,IAAA,CAAK,eAAA,CAAkB,IAAIC,mBAAAA,CAAgBF,CAAU,EACvD,CAEA,KAAA,CAAMG,CAAAA,CAAeC,CAAAA,CAA0B,CAC7C,IAAMC,EAAWD,CAAAA,EAAS,MAAA,CAQ1B,GAPA,IAAA,CAAK,YAAA,CAAeC,CAAAA,CACpB,KAAK,SAAA,CAAY,KAAA,CACjB,KAAK,WAAA,CAAc,MAAA,CAKfA,IAAa,MAAA,CAAiB,CAEhC,GADuB,IAAA,CAAK,eAAA,CAAgB,YAAA,CAAaF,CAAK,CAAA,CAC3C,IAAA,CAAM,CACvB,IAAA,CAAK,MAAA,CAAS,GACd,IAAA,CAAK,QAAA,CAAW,CAAA,CAChB,MACF,CAEA,IAAA,CAAK,gBAAgB,KAAA,CAAMA,CAAK,CAAA,CAChC,IAAA,CAAK,MAAA,CAAS,IAAA,CAAK,gBAAgB,WAAA,EAAY,CAC/C,IAAA,CAAK,QAAA,CAAW,EAClB,CAAA,KAEE,KAAK,eAAA,CAAgB,KAAA,CAAMA,CAAK,CAAA,CAChC,IAAA,CAAK,MAAA,CAAS,KAAK,eAAA,CAAgB,WAAA,EAAY,CAC/C,IAAA,CAAK,QAAA,CAAW,EAEpB,CAMA,YAAA,CAAaG,CAAAA,CAAsC,CACjD,OAAO,IAAA,CAAK,gBAAgB,YAAA,CAAaA,CAAQ,CACnD,CAMA,gBAAA,CAAiBA,CAAAA,CAAkB,CACjC,OAAO,IAAA,CAAK,eAAA,CAAgB,gBAAA,CAAiBA,CAAQ,CACvD,CAMA,WAAA,EAAsC,CACpC,OAAO,IAAA,CAAK,eAAA,CAAgB,WAAA,EAC9B,CAEA,IAAA,EAA0B,CACxB,GAAI,IAAA,CAAK,SAAA,CACP,YAAK,SAAA,CAAY,KAAA,CACV,IAAA,CAAK,WAAA,CAGd,GAAI,IAAA,CAAK,SAAW,IAAA,CAAK,MAAA,CAAO,MAAA,CAC9B,OAAO,IAAA,CAAK,MAAA,CAAO,KAAK,QAAA,EAAU,CAGtC,CAEA,IAAA,EAA0B,CACxB,OAAI,KAAK,SAAA,CAAkB,IAAA,CAAK,WAAA,EAChC,IAAA,CAAK,WAAA,CAAc,IAAA,CAAK,MAAK,CAC7B,IAAA,CAAK,SAAA,CAAY,IAAA,CACV,IAAA,CAAK,WAAA,CACd,CAEA,CAAC,MAAA,CAAO,QAAQ,CAAA,EAAqB,CACnC,OAAO,KAAK,MAAA,CAAO,MAAA,CAAO,QAAQ,CAAA,EACpC,CAQA,mBAAmBC,CAAAA,CAA+B,CAChD,IAAA,CAAK,eAAA,CAAgB,kBAAA,CAAmBA,CAAM,EAChD,CAMA,oBAAA,CAAqBA,CAAAA,CAA+B,CAClD,IAAA,CAAK,eAAA,CAAgB,qBAAqBA,CAAM,EAClD,CAOA,eAAA,CAAgBJ,CAAAA,CAAqB,CACnC,KAAK,YAAA,CAAe,MAAA,CACpB,IAAA,CAAK,SAAA,CAAY,KAAA,CACjB,IAAA,CAAK,YAAc,MAAA,CACnB,IAAA,CAAK,gBAAgB,KAAA,CAAMA,CAAK,EAChC,IAAA,CAAK,MAAA,CAAS,IAAA,CAAK,eAAA,CAAgB,WAAA,EAAY,CAC/C,KAAK,QAAA,CAAW,EAClB,CAQA,YAAA,CAAaK,CAAAA,CAAgC,CAC3C,OAAO,IAAA,CAAK,eAAA,CAAgB,YAAA,CAAaA,CAAI,CAC/C,CAEA,UAAuB,CACrB,OAAO,IAAA,CAAK,YACd,CAEA,QAAA,CAASJ,EAAyB,CAChC,IAAA,CAAK,YAAA,CAAeA,EACtB,CAEA,kBAAA,CAAmBE,EAAqI,CACtJ,IAAMG,CAAAA,CAAiB,IAAA,CAAK,eAAA,CAAgB,YAAA,CAAaH,CAAQ,CAAA,CAKjE,OAAIG,CAAAA,CAAe,IAAA,EAAQH,CAAAA,CAAS,UAAA,CAAW,IAAI,CAAA,CAC1C,IAAA,CAAK,sBAAA,CAAuBA,CAAAA,CAAS,KAAA,CAAM,CAAC,CAAC,CAAA,CAGlDG,CAAAA,CAAe,IAAA,CACV,EAAC,CAGH,IAAA,CAAK,uBAAuBH,CAAQ,CAC7C,CAYA,wBAAA,CAAyBA,CAAAA,CAA2B,CAClD,IAAMG,CAAAA,CAAiB,IAAA,CAAK,eAAA,CAAgB,YAAA,CAAaH,CAAQ,CAAA,CACjE,OAAIG,CAAAA,CAAe,IAAA,EAAQH,CAAAA,CAAS,UAAA,CAAW,IAAI,CAAA,CAC1C,KAAK,mBAAA,CAAoBA,CAAAA,CAAS,KAAA,CAAM,CAAC,CAAC,CAAA,CAE/CG,EAAe,IAAA,CAAa,EAAC,CAC1B,IAAA,CAAK,mBAAA,CAAoBH,CAAQ,CAC1C,CAEQ,mBAAA,CAAoBA,CAAAA,CAA2B,CAOrD,IAAA,CAAK,YAAA,CAAe,OACpB,IAAA,CAAK,SAAA,CAAY,MACjB,IAAA,CAAK,WAAA,CAAc,OACnB,IAAA,CAAK,eAAA,CAAgB,KAAA,CAAMA,CAAQ,CAAA,CACnC,IAAMI,EAAe,EAAC,CACtB,GAAI,CACF,IAAA,CAAK,eAAA,CAAgB,aAAaA,CAAG,EACvC,CAAA,MAASC,CAAAA,CAAQ,CACf,GAAI,EAAEA,CAAAA,YAAkBC,mBAAAA,CAAAA,CAAc,MAAMD,CAC9C,CACA,IAAME,EAAkB,EAAC,CACzB,IAAA,IAAWC,CAAAA,IAASJ,CAAAA,CACdI,CAAAA,CAAM,OAAS,IAAA,EAAQA,CAAAA,CAAM,IAAA,GAAS,SAAA,EACtCA,CAAAA,CAAM,IAAA,CAAK,WAAW,KAAK,CAAA,EAC3BA,CAAAA,CAAM,IAAA,GAAS,oBAAA,EAAwBA,CAAAA,CAAM,OAAS,gBAAA,EAC1DD,CAAAA,CAAO,IAAA,CAAKC,CAAK,CAAA,CAEnB,OAAA,IAAA,CAAK,OAASD,CAAAA,CACd,IAAA,CAAK,QAAA,CAAW,CAAA,CACTA,CACT,CAEQ,uBAAuBP,CAAAA,CAAqI,CAClK,OAAO,IAAA,CAAK,mBAAA,CAAoBA,CAAQ,EAAE,GAAA,CAAIQ,CAAAA,GAAU,CACtD,IAAA,CAAMA,CAAAA,CAAM,IAAA,CACZ,MAAOA,CAAAA,CAAM,KAAA,CACb,MAAA,CAAQA,CAAAA,CAAM,MAAA,CACd,GAAA,CAAKA,EAAM,GAAA,CAIX,MAAA,CAAQA,CAAAA,CAAM,IAAA,CAAK,MAAA,CACnB,QAAA,CAAUC,oBAAiBD,CAAAA,CAAM,IAAI,CACvC,CAAA,CAAE,CACJ,CACF,EAcaE,CAAAA,CAAc,IAAIjB,CAAAA,CAAM,IAAA,CAAM,MAAS","file":"chunk-AGCNMEP2.cjs","sourcesContent":["/**\n * Lexer state machine modes.\n * - Main: document-level scanning with markdown classification\n * - Inline: expression embedded in markdown inline solve (`s\\`...\\``)\n * - String: inside a double-quoted string literal\n */\nexport enum LexerState {\n\tMain = \"main\",\n\tInline = \"inline\",\n\tString = \"string\",\n}\n","import { ExpressionLexer, LineClassification, LexerVocabulary, type ScanLineResult } from \"./ExpressionLexer\";\nimport { Token } from \"@solve-js/lexer/Token\";\nimport { EngineError } from \"@solve-js/errors/UnifiedErrorFramework\";\nimport { LexerState } from \"@solve-js/lexer/LexerState\";\nimport { getTokenCategory } from \"@solve-js/language/TokenCategoryMap\";\nimport type { TokenCategory } from \"@solve-js/language/TokenCategory\";\nimport type { TokenLookup } from \"@solve-js/lexer/TokenClassRegistry\";\n\n/**\n * Public tokenizer wrapper around {@link ExpressionLexer}.\n *\n * `ExpressionLexer` does the actual character-by-character scanning;\n * `Lexer` adds a materialized-token-array streaming interface\n * (`next()`/`peek()`) plus line-classification state (`reset()`) so\n * callers can iterate a line's tokens without re-scanning on each peek.\n *\n * Each `ExpressionEngine` instance owns its own `Lexer`, and packages\n * extend it via {@link registerVocabulary} (keywords, operators, units)\n * see `IEnginePackage.lexerVocabulary`.\n */\nexport class Lexer {\n  /** Expression-mode lexer (Phase A: V8-optimized, replaces moo) */\n  private expressionLexer: ExpressionLexer;\n  private currentState: LexerState = LexerState.Main;\n  private peekedToken: Token | undefined;\n  private hasPeeked = false;\n\n  // Materialized token array from the last reset() call, used for\n  // next()/peek() streaming access.\n  private tokens: Token[] = [];\n  private tokenIdx: number = 0;\n\n  /**\n   * @param localeCode - Locale code (e.g., \"en\", \"de\"). Defaults to \"en\".\n   * @param _tokenLookup - Ignored. The lexer never read the lookup it was\n   *   handed; the parameter stays so existing callers compile.\n   *   @deprecated Removed in 3.0.\n   */\n  constructor(localeCode = \"en\", _tokenLookup?: TokenLookup) {\n    this.expressionLexer = new ExpressionLexer(localeCode);\n  }\n\n  reset(input: string, state?: LexerState): void {\n    const newState = state ?? LexerState.Main;\n    this.currentState = newState;\n    this.hasPeeked = false;\n    this.peekedToken = undefined;\n\n    // Phase B: Main state classifies the line with the markdown scanner.\n    // Skip lines (headings, fences, HRs, etc.) produce empty token arrays.\n    // Expression lines and lines with inline solves are tokenized normally.\n    if (newState === LexerState.Main) {\n      const classification = this.expressionLexer.classifyLine(input);\n      if (classification.skip) {\n        this.tokens = [];\n        this.tokenIdx = 0;\n        return;\n      }\n      // Expression line or markdown line with inline solves, tokenize.\n      this.expressionLexer.reset(input);\n      this.tokens = this.expressionLexer.tokenizeAll();\n      this.tokenIdx = 0;\n    } else {\n      // Non-main states (Inline, String), expression tokenization.\n      this.expressionLexer.reset(input);\n      this.tokens = this.expressionLexer.tokenizeAll();\n      this.tokenIdx = 0;\n    }\n  }\n\n  /**\n   * Classify a single line of markdown text (Phase B).\n   * Delegates to the ExpressionLexer's character-by-character scanner.\n   */\n  classifyLine(lineText: string): LineClassification {\n    return this.expressionLexer.classifyLine(lineText);\n  }\n\n  /**\n   * Find all inline solve markers in a line (Phase B).\n   * Delegates to the ExpressionLexer's character-by-character scanner.\n   */\n  findInlineSolves(lineText: string) {\n    return this.expressionLexer.findInlineSolves(lineText);\n  }\n\n  /**\n   * Every keyword this lexer currently recognizes (locale + plugin-contributed),\n   * mapped to the token type it lexes to. Delegates to the ExpressionLexer.\n   */\n  getKeywords(): Record<string, string> {\n    return this.expressionLexer.getKeywords();\n  }\n\n  next(): Token | undefined {\n    if (this.hasPeeked) {\n      this.hasPeeked = false;\n      return this.peekedToken;\n    }\n    // Materialized token array (ExpressionLexer path).\n    if (this.tokenIdx < this.tokens.length) {\n      return this.tokens[this.tokenIdx++];\n    }\n    return undefined;\n  }\n\n  peek(): Token | undefined {\n    if (this.hasPeeked) return this.peekedToken;\n    this.peekedToken = this.next();\n    this.hasPeeked = true;\n    return this.peekedToken;\n  }\n\n  [Symbol.iterator](): Iterator<Token> {\n    return this.tokens[Symbol.iterator]();\n  }\n\n  /**\n   * Register a plugin to extend the lexer with custom tokens.\n   * Delegates to the underlying ExpressionLexer.\n   *\n   * @see LexerVocabulary for the supported extension points.\n   */\n  registerVocabulary(plugin: LexerVocabulary): void {\n    this.expressionLexer.registerVocabulary(plugin);\n  }\n\n  /**\n   * Unregister a plugin, removing its custom tokens from the lexer.\n   * Delegates to the underlying ExpressionLexer.\n   */\n  unregisterVocabulary(plugin: LexerVocabulary): void {\n    this.expressionLexer.unregisterVocabulary(plugin);\n  }\n\n  /**\n   * Reset the lexer for expression-only text, skips the classifyLine()\n   * overhead in reset() for callers that already know the input is an\n   * evaluable expression (e.g., after isEmptyLine() confirmed non-skip).\n   */\n  resetExpression(input: string): void {\n    this.currentState = LexerState.Main;\n    this.hasPeeked = false;\n    this.peekedToken = undefined;\n    this.expressionLexer.reset(input);\n    this.tokens = this.expressionLexer.tokenizeAll();\n    this.tokenIdx = 0;\n  }\n\n  /**\n   * Scan a full document in one pass, classifying each line and\n   * tokenizing non-skipped lines. Delegates to ExpressionLexer.\n   *\n   * @returns ScanLineResult[], one per line, with classification + tokens.\n   */\n  scanDocument(text: string): ScanLineResult[] {\n    return this.expressionLexer.scanDocument(text);\n  }\n\n  getState(): LexerState {\n    return this.currentState;\n  }\n\n  setState(state: LexerState): void {\n    this.currentState = state;\n  }\n\n  getHighlightTokens(lineText: string): {type: string; value: string; offset: number; col: number; length: number; category: TokenCategory | undefined}[] {\n    const classification = this.expressionLexer.classifyLine(lineText);\n\n    // For blockquote lines, strip the \"> \" prefix and tokenize the expression content.\n    // This lets expressions inside blockquotes (e.g., \"> 1 + 2\") get syntax highlighted\n    // while pure structural lines (headings, code fences) remain unhighlighted.\n    if (classification.skip && lineText.startsWith(\"> \")) {\n      return this.collectHighlightTokens(lineText.slice(2));\n    }\n\n    if (classification.skip) {\n      return [];\n    }\n\n    return this.collectHighlightTokens(lineText);\n  }\n\n  /**\n   * The same tokens {@link getHighlightTokens} reduces, before reduction.\n   *\n   * Exists because normalization operates on tokens, not on the flattened\n   * shape, and a consumer that wants phrase-fused highlighting has to run the\n   * normalizer between the two. See `LanguageService.getSemanticTokens`.\n   *\n   * @param lineText - One line of source.\n   * @returns Every token on the line that is worth painting, unreduced.\n   */\n  getHighlightTokenObjects(lineText: string): Token[] {\n    const classification = this.expressionLexer.classifyLine(lineText);\n    if (classification.skip && lineText.startsWith(\"> \")) {\n      return this.collectTokenObjects(lineText.slice(2));\n    }\n    if (classification.skip) return [];\n    return this.collectTokenObjects(lineText);\n  }\n\n  private collectTokenObjects(lineText: string): Token[] {\n    // Scanned into an array this method owns rather than through\n    // resetExpression(), which has nothing to hand back when the line faults\n    // part way. Highlighting is painted while the line is still being typed,\n    // and an unterminated string is what a line looks like between the\n    // opening quote and the closing one: the tokens read before the fault are\n    // the right thing to paint, and letting the throw escape blanked the line.\n    this.currentState = LexerState.Main;\n    this.hasPeeked = false;\n    this.peekedToken = undefined;\n    this.expressionLexer.reset(lineText);\n    const raw: Token[] = [];\n    try {\n      this.expressionLexer.tokenizeInto(raw);\n    } catch (thrown) {\n      if (!(thrown instanceof EngineError)) throw thrown;\n    }\n    const result: Token[] = [];\n    for (const token of raw) {\n      if (token.type === \"WS\" || token.type === \"NEWLINE\") continue;\n      if (token.type.startsWith(\"MD_\")) continue;\n      if (token.type === \"INLINE_SOLVE_START\" || token.type === \"BACKTICK_CLOSE\") continue;\n      result.push(token);\n    }\n    this.tokens = result;\n    this.tokenIdx = 0;\n    return result;\n  }\n\n  private collectHighlightTokens(lineText: string): {type: string; value: string; offset: number; col: number; length: number; category: TokenCategory | undefined}[] {\n    return this.collectTokenObjects(lineText).map(token => ({\n      type: token.type,\n      value: token.value,\n      offset: token.offset,\n      col: token.col,\n      // `text`, not `value`: this is a span into the source, and the two\n      // differ for a string literal, whose value is the payload while its\n      // text still carries the quote characters the reader typed.\n      length: token.text.length,\n      category: getTokenCategory(token.type),\n    }));\n  }\n}\n\n/**\n * A lexer for operations that do not depend on registered vocabulary.\n *\n * Line classification and inline-solve detection read characters looking for\n * headings, comment markers, fences and backtick spans, and never consult the\n * keyword, unit or operator tables. Every lexer therefore returns the same\n * answer, so the callers that have no engine to ask can use this one. Checked\n * by `__tests__/lexer/LineClassificationIsVocabularyIndependent.spec.ts`.\n *\n * Do not tokenize with this. An engine's own lexer carries the vocabulary its\n * packages registered; this one carries none.\n */\nexport const sharedLexer = new Lexer(\"en\", undefined);"]}
+{"version":3,"sources":["../src/lexer/LexerState.ts","../src/lexer/Lexer.ts"],"names":["LexerState","Lexer","localeCode","_tokenLookup","ExpressionLexer","input","state","newState","lineText","plugin","text","classification","raw","thrown","EngineError","result","token","getTokenCategory","sharedLexer"],"mappings":"uKAMO,IAAKA,CAAAA,CAAAA,CAAAA,CAAAA,GACXA,EAAA,IAAA,CAAO,MAAA,CACPA,EAAA,MAAA,CAAS,QAAA,CACTA,CAAAA,CAAA,MAAA,CAAS,QAAA,CAHEA,CAAAA,CAAAA,EAAAA,CAAAA,EAAA,ICcL,IAAMC,CAAAA,CAAN,KAAY,CAkBjB,WAAA,CAAYC,CAAAA,CAAa,KAAMC,CAAAA,CAA4B,CAf3D,IAAA,CAAQ,YAAA,CAA2B,MAAA,CAEnC,IAAA,CAAQ,UAAY,KAAA,CAIpB,IAAA,CAAQ,MAAA,CAAkB,EAAC,CAC3B,IAAA,CAAQ,SAAmB,CAAA,CASzB,IAAA,CAAK,eAAA,CAAkB,IAAIC,mBAAAA,CAAgBF,CAAU,EACvD,CAEA,KAAA,CAAMG,CAAAA,CAAeC,CAAAA,CAA0B,CAC7C,IAAMC,EAAWD,CAAAA,EAAS,MAAA,CAQ1B,GAPA,IAAA,CAAK,YAAA,CAAeC,CAAAA,CACpB,KAAK,SAAA,CAAY,KAAA,CACjB,KAAK,WAAA,CAAc,MAAA,CAKfA,IAAa,MAAA,CAAiB,CAEhC,GADuB,IAAA,CAAK,eAAA,CAAgB,YAAA,CAAaF,CAAK,CAAA,CAC3C,IAAA,CAAM,CACvB,IAAA,CAAK,MAAA,CAAS,GACd,IAAA,CAAK,QAAA,CAAW,CAAA,CAChB,MACF,CAEA,IAAA,CAAK,gBAAgB,KAAA,CAAMA,CAAK,CAAA,CAChC,IAAA,CAAK,MAAA,CAAS,IAAA,CAAK,gBAAgB,WAAA,EAAY,CAC/C,IAAA,CAAK,QAAA,CAAW,EAClB,CAAA,KAEE,KAAK,eAAA,CAAgB,KAAA,CAAMA,CAAK,CAAA,CAChC,IAAA,CAAK,MAAA,CAAS,KAAK,eAAA,CAAgB,WAAA,EAAY,CAC/C,IAAA,CAAK,QAAA,CAAW,EAEpB,CAMA,YAAA,CAAaG,CAAAA,CAAsC,CACjD,OAAO,IAAA,CAAK,gBAAgB,YAAA,CAAaA,CAAQ,CACnD,CAMA,gBAAA,CAAiBA,CAAAA,CAAkB,CACjC,OAAO,IAAA,CAAK,eAAA,CAAgB,gBAAA,CAAiBA,CAAQ,CACvD,CAMA,WAAA,EAAsC,CACpC,OAAO,IAAA,CAAK,eAAA,CAAgB,WAAA,EAC9B,CAEA,IAAA,EAA0B,CACxB,GAAI,IAAA,CAAK,SAAA,CACP,YAAK,SAAA,CAAY,KAAA,CACV,IAAA,CAAK,WAAA,CAGd,GAAI,IAAA,CAAK,SAAW,IAAA,CAAK,MAAA,CAAO,MAAA,CAC9B,OAAO,IAAA,CAAK,MAAA,CAAO,KAAK,QAAA,EAAU,CAGtC,CAEA,IAAA,EAA0B,CACxB,OAAI,KAAK,SAAA,CAAkB,IAAA,CAAK,WAAA,EAChC,IAAA,CAAK,WAAA,CAAc,IAAA,CAAK,MAAK,CAC7B,IAAA,CAAK,SAAA,CAAY,IAAA,CACV,IAAA,CAAK,WAAA,CACd,CAEA,CAAC,MAAA,CAAO,QAAQ,CAAA,EAAqB,CACnC,OAAO,KAAK,MAAA,CAAO,MAAA,CAAO,QAAQ,CAAA,EACpC,CAQA,mBAAmBC,CAAAA,CAA+B,CAChD,IAAA,CAAK,eAAA,CAAgB,kBAAA,CAAmBA,CAAM,EAChD,CAMA,oBAAA,CAAqBA,CAAAA,CAA+B,CAClD,IAAA,CAAK,eAAA,CAAgB,qBAAqBA,CAAM,EAClD,CAOA,eAAA,CAAgBJ,CAAAA,CAAqB,CACnC,KAAK,YAAA,CAAe,MAAA,CACpB,IAAA,CAAK,SAAA,CAAY,KAAA,CACjB,IAAA,CAAK,YAAc,MAAA,CACnB,IAAA,CAAK,gBAAgB,KAAA,CAAMA,CAAK,EAChC,IAAA,CAAK,MAAA,CAAS,IAAA,CAAK,eAAA,CAAgB,WAAA,EAAY,CAC/C,KAAK,QAAA,CAAW,EAClB,CAQA,YAAA,CAAaK,CAAAA,CAAgC,CAC3C,OAAO,IAAA,CAAK,eAAA,CAAgB,YAAA,CAAaA,CAAI,CAC/C,CAEA,UAAuB,CACrB,OAAO,IAAA,CAAK,YACd,CAEA,QAAA,CAASJ,EAAyB,CAChC,IAAA,CAAK,YAAA,CAAeA,EACtB,CAEA,kBAAA,CAAmBE,EAAqI,CACtJ,IAAMG,CAAAA,CAAiB,IAAA,CAAK,eAAA,CAAgB,YAAA,CAAaH,CAAQ,CAAA,CAKjE,OAAIG,CAAAA,CAAe,IAAA,EAAQH,CAAAA,CAAS,UAAA,CAAW,IAAI,CAAA,CAC1C,IAAA,CAAK,sBAAA,CAAuBA,CAAAA,CAAS,KAAA,CAAM,CAAC,CAAC,CAAA,CAGlDG,CAAAA,CAAe,IAAA,CACV,EAAC,CAGH,IAAA,CAAK,uBAAuBH,CAAQ,CAC7C,CAYA,wBAAA,CAAyBA,CAAAA,CAA2B,CAClD,IAAMG,CAAAA,CAAiB,IAAA,CAAK,eAAA,CAAgB,YAAA,CAAaH,CAAQ,CAAA,CACjE,OAAIG,CAAAA,CAAe,IAAA,EAAQH,CAAAA,CAAS,UAAA,CAAW,IAAI,CAAA,CAC1C,KAAK,mBAAA,CAAoBA,CAAAA,CAAS,KAAA,CAAM,CAAC,CAAC,CAAA,CAE/CG,EAAe,IAAA,CAAa,EAAC,CAC1B,IAAA,CAAK,mBAAA,CAAoBH,CAAQ,CAC1C,CAEQ,mBAAA,CAAoBA,CAAAA,CAA2B,CAOrD,IAAA,CAAK,YAAA,CAAe,OACpB,IAAA,CAAK,SAAA,CAAY,MACjB,IAAA,CAAK,WAAA,CAAc,OACnB,IAAA,CAAK,eAAA,CAAgB,KAAA,CAAMA,CAAQ,CAAA,CACnC,IAAMI,EAAe,EAAC,CACtB,GAAI,CACF,IAAA,CAAK,eAAA,CAAgB,aAAaA,CAAG,EACvC,CAAA,MAASC,CAAAA,CAAQ,CACf,GAAI,EAAEA,CAAAA,YAAkBC,mBAAAA,CAAAA,CAAc,MAAMD,CAC9C,CACA,IAAME,EAAkB,EAAC,CACzB,IAAA,IAAWC,CAAAA,IAASJ,CAAAA,CACdI,CAAAA,CAAM,OAAS,IAAA,EAAQA,CAAAA,CAAM,IAAA,GAAS,SAAA,EACtCA,CAAAA,CAAM,IAAA,CAAK,WAAW,KAAK,CAAA,EAC3BA,CAAAA,CAAM,IAAA,GAAS,oBAAA,EAAwBA,CAAAA,CAAM,OAAS,gBAAA,EAC1DD,CAAAA,CAAO,IAAA,CAAKC,CAAK,CAAA,CAEnB,OAAA,IAAA,CAAK,OAASD,CAAAA,CACd,IAAA,CAAK,QAAA,CAAW,CAAA,CACTA,CACT,CAEQ,uBAAuBP,CAAAA,CAAqI,CAClK,OAAO,IAAA,CAAK,mBAAA,CAAoBA,CAAQ,EAAE,GAAA,CAAIQ,CAAAA,GAAU,CACtD,IAAA,CAAMA,CAAAA,CAAM,IAAA,CACZ,MAAOA,CAAAA,CAAM,KAAA,CACb,MAAA,CAAQA,CAAAA,CAAM,MAAA,CACd,GAAA,CAAKA,EAAM,GAAA,CAIX,MAAA,CAAQA,CAAAA,CAAM,IAAA,CAAK,MAAA,CACnB,QAAA,CAAUC,oBAAiBD,CAAAA,CAAM,IAAI,CACvC,CAAA,CAAE,CACJ,CACF,EAcaE,CAAAA,CAAc,IAAIjB,CAAAA,CAAM,IAAA,CAAM,MAAS","file":"chunk-3MG7VIPL.cjs","sourcesContent":["/**\n * Lexer state machine modes.\n * - Main: document-level scanning with markdown classification\n * - Inline: expression embedded in markdown inline solve (`s\\`...\\``)\n * - String: inside a double-quoted string literal\n */\nexport enum LexerState {\n\tMain = \"main\",\n\tInline = \"inline\",\n\tString = \"string\",\n}\n","import { ExpressionLexer, LineClassification, LexerVocabulary, type ScanLineResult } from \"./ExpressionLexer\";\nimport { Token } from \"@solve-js/lexer/Token\";\nimport { EngineError } from \"@solve-js/errors/UnifiedErrorFramework\";\nimport { LexerState } from \"@solve-js/lexer/LexerState\";\nimport { getTokenCategory } from \"@solve-js/language/TokenCategoryMap\";\nimport type { TokenCategory } from \"@solve-js/language/TokenCategory\";\nimport type { TokenLookup } from \"@solve-js/lexer/TokenClassRegistry\";\n\n/**\n * Public tokenizer wrapper around {@link ExpressionLexer}.\n *\n * `ExpressionLexer` does the actual character-by-character scanning;\n * `Lexer` adds a materialized-token-array streaming interface\n * (`next()`/`peek()`) plus line-classification state (`reset()`) so\n * callers can iterate a line's tokens without re-scanning on each peek.\n *\n * Each `ExpressionEngine` instance owns its own `Lexer`, and packages\n * extend it via {@link registerVocabulary} (keywords, operators, units)\n * see `IEnginePackage.lexerVocabulary`.\n */\nexport class Lexer {\n  /** Expression-mode lexer (Phase A: V8-optimized, replaces moo) */\n  private expressionLexer: ExpressionLexer;\n  private currentState: LexerState = LexerState.Main;\n  private peekedToken: Token | undefined;\n  private hasPeeked = false;\n\n  // Materialized token array from the last reset() call, used for\n  // next()/peek() streaming access.\n  private tokens: Token[] = [];\n  private tokenIdx: number = 0;\n\n  /**\n   * @param localeCode - Locale code (e.g., \"en\", \"de\"). Defaults to \"en\".\n   * @param _tokenLookup - Ignored. The lexer never read the lookup it was\n   *   handed; the parameter stays so existing callers compile.\n   *   @deprecated Removed in 3.0.\n   */\n  constructor(localeCode = \"en\", _tokenLookup?: TokenLookup) {\n    this.expressionLexer = new ExpressionLexer(localeCode);\n  }\n\n  reset(input: string, state?: LexerState): void {\n    const newState = state ?? LexerState.Main;\n    this.currentState = newState;\n    this.hasPeeked = false;\n    this.peekedToken = undefined;\n\n    // Phase B: Main state classifies the line with the markdown scanner.\n    // Skip lines (headings, fences, HRs, etc.) produce empty token arrays.\n    // Expression lines and lines with inline solves are tokenized normally.\n    if (newState === LexerState.Main) {\n      const classification = this.expressionLexer.classifyLine(input);\n      if (classification.skip) {\n        this.tokens = [];\n        this.tokenIdx = 0;\n        return;\n      }\n      // Expression line or markdown line with inline solves, tokenize.\n      this.expressionLexer.reset(input);\n      this.tokens = this.expressionLexer.tokenizeAll();\n      this.tokenIdx = 0;\n    } else {\n      // Non-main states (Inline, String), expression tokenization.\n      this.expressionLexer.reset(input);\n      this.tokens = this.expressionLexer.tokenizeAll();\n      this.tokenIdx = 0;\n    }\n  }\n\n  /**\n   * Classify a single line of markdown text (Phase B).\n   * Delegates to the ExpressionLexer's character-by-character scanner.\n   */\n  classifyLine(lineText: string): LineClassification {\n    return this.expressionLexer.classifyLine(lineText);\n  }\n\n  /**\n   * Find all inline solve markers in a line (Phase B).\n   * Delegates to the ExpressionLexer's character-by-character scanner.\n   */\n  findInlineSolves(lineText: string) {\n    return this.expressionLexer.findInlineSolves(lineText);\n  }\n\n  /**\n   * Every keyword this lexer currently recognizes (locale + plugin-contributed),\n   * mapped to the token type it lexes to. Delegates to the ExpressionLexer.\n   */\n  getKeywords(): Record<string, string> {\n    return this.expressionLexer.getKeywords();\n  }\n\n  next(): Token | undefined {\n    if (this.hasPeeked) {\n      this.hasPeeked = false;\n      return this.peekedToken;\n    }\n    // Materialized token array (ExpressionLexer path).\n    if (this.tokenIdx < this.tokens.length) {\n      return this.tokens[this.tokenIdx++];\n    }\n    return undefined;\n  }\n\n  peek(): Token | undefined {\n    if (this.hasPeeked) return this.peekedToken;\n    this.peekedToken = this.next();\n    this.hasPeeked = true;\n    return this.peekedToken;\n  }\n\n  [Symbol.iterator](): Iterator<Token> {\n    return this.tokens[Symbol.iterator]();\n  }\n\n  /**\n   * Register a plugin to extend the lexer with custom tokens.\n   * Delegates to the underlying ExpressionLexer.\n   *\n   * @see LexerVocabulary for the supported extension points.\n   */\n  registerVocabulary(plugin: LexerVocabulary): void {\n    this.expressionLexer.registerVocabulary(plugin);\n  }\n\n  /**\n   * Unregister a plugin, removing its custom tokens from the lexer.\n   * Delegates to the underlying ExpressionLexer.\n   */\n  unregisterVocabulary(plugin: LexerVocabulary): void {\n    this.expressionLexer.unregisterVocabulary(plugin);\n  }\n\n  /**\n   * Reset the lexer for expression-only text, skips the classifyLine()\n   * overhead in reset() for callers that already know the input is an\n   * evaluable expression (e.g., after isEmptyLine() confirmed non-skip).\n   */\n  resetExpression(input: string): void {\n    this.currentState = LexerState.Main;\n    this.hasPeeked = false;\n    this.peekedToken = undefined;\n    this.expressionLexer.reset(input);\n    this.tokens = this.expressionLexer.tokenizeAll();\n    this.tokenIdx = 0;\n  }\n\n  /**\n   * Scan a full document in one pass, classifying each line and\n   * tokenizing non-skipped lines. Delegates to ExpressionLexer.\n   *\n   * @returns ScanLineResult[], one per line, with classification + tokens.\n   */\n  scanDocument(text: string): ScanLineResult[] {\n    return this.expressionLexer.scanDocument(text);\n  }\n\n  getState(): LexerState {\n    return this.currentState;\n  }\n\n  setState(state: LexerState): void {\n    this.currentState = state;\n  }\n\n  getHighlightTokens(lineText: string): {type: string; value: string; offset: number; col: number; length: number; category: TokenCategory | undefined}[] {\n    const classification = this.expressionLexer.classifyLine(lineText);\n\n    // For blockquote lines, strip the \"> \" prefix and tokenize the expression content.\n    // This lets expressions inside blockquotes (e.g., \"> 1 + 2\") get syntax highlighted\n    // while pure structural lines (headings, code fences) remain unhighlighted.\n    if (classification.skip && lineText.startsWith(\"> \")) {\n      return this.collectHighlightTokens(lineText.slice(2));\n    }\n\n    if (classification.skip) {\n      return [];\n    }\n\n    return this.collectHighlightTokens(lineText);\n  }\n\n  /**\n   * The same tokens {@link getHighlightTokens} reduces, before reduction.\n   *\n   * Exists because normalization operates on tokens, not on the flattened\n   * shape, and a consumer that wants phrase-fused highlighting has to run the\n   * normalizer between the two. See `LanguageService.getSemanticTokens`.\n   *\n   * @param lineText - One line of source.\n   * @returns Every token on the line that is worth painting, unreduced.\n   */\n  getHighlightTokenObjects(lineText: string): Token[] {\n    const classification = this.expressionLexer.classifyLine(lineText);\n    if (classification.skip && lineText.startsWith(\"> \")) {\n      return this.collectTokenObjects(lineText.slice(2));\n    }\n    if (classification.skip) return [];\n    return this.collectTokenObjects(lineText);\n  }\n\n  private collectTokenObjects(lineText: string): Token[] {\n    // Scanned into an array this method owns rather than through\n    // resetExpression(), which has nothing to hand back when the line faults\n    // part way. Highlighting is painted while the line is still being typed,\n    // and an unterminated string is what a line looks like between the\n    // opening quote and the closing one: the tokens read before the fault are\n    // the right thing to paint, and letting the throw escape blanked the line.\n    this.currentState = LexerState.Main;\n    this.hasPeeked = false;\n    this.peekedToken = undefined;\n    this.expressionLexer.reset(lineText);\n    const raw: Token[] = [];\n    try {\n      this.expressionLexer.tokenizeInto(raw);\n    } catch (thrown) {\n      if (!(thrown instanceof EngineError)) throw thrown;\n    }\n    const result: Token[] = [];\n    for (const token of raw) {\n      if (token.type === \"WS\" || token.type === \"NEWLINE\") continue;\n      if (token.type.startsWith(\"MD_\")) continue;\n      if (token.type === \"INLINE_SOLVE_START\" || token.type === \"BACKTICK_CLOSE\") continue;\n      result.push(token);\n    }\n    this.tokens = result;\n    this.tokenIdx = 0;\n    return result;\n  }\n\n  private collectHighlightTokens(lineText: string): {type: string; value: string; offset: number; col: number; length: number; category: TokenCategory | undefined}[] {\n    return this.collectTokenObjects(lineText).map(token => ({\n      type: token.type,\n      value: token.value,\n      offset: token.offset,\n      col: token.col,\n      // `text`, not `value`: this is a span into the source, and the two\n      // differ for a string literal, whose value is the payload while its\n      // text still carries the quote characters the reader typed.\n      length: token.text.length,\n      category: getTokenCategory(token.type),\n    }));\n  }\n}\n\n/**\n * A lexer for operations that do not depend on registered vocabulary.\n *\n * Line classification and inline-solve detection read characters looking for\n * headings, comment markers, fences and backtick spans, and never consult the\n * keyword, unit or operator tables. Every lexer therefore returns the same\n * answer, so the callers that have no engine to ask can use this one. Checked\n * by `__tests__/lexer/LineClassificationIsVocabularyIndependent.spec.ts`.\n *\n * Do not tokenize with this. An engine's own lexer carries the vocabulary its\n * packages registered; this one carries none.\n */\nexport const sharedLexer = new Lexer(\"en\", undefined);"]}