solve-engine 2.32.0 → 2.34.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-IJE4AEDX.js → chunk-24OW3AAU.js}

@@ -1,3 +1,3 @@
-import {a}from'./chunk-RAF57WYO.js';import {m,n,h as h$1}from'./chunk-7ODHPWQC.js';import {b as b$1}from'./chunk-76F3LCIL.js';import {J as J$1,K}from'./chunk-OE2DBN4K.js';import {h,i,P as P$1}from'./chunk-X5K72MBV.js';import {b}from'./chunk-TSJ4RQLZ.js';import {c as c$1}from'./chunk-CDE2ZUGG.js';import {c,b as b$2}from'./chunk-RELMEWY6.js';var P=class{constructor(){this.root=null;}get length(){return this.root?this.root.size:0}get isEmpty(){return this.root===null}getAt(e){if(!(e<0||e>=(this.root?.size??0)))return this.nodeAt(this.root,e).lineId}insertAt(e,n){let[t,r]=I(this.root,e);this.root=S(S(t,te(n)),r);}deleteAt(e){if(e<0||e>=(this.root?.size??0))return;let[n,t]=I(this.root,e),[r,s]=I(t,1),i=r?r.lineId:void 0;return this.root=S(n,s),i}spliceAt(e,n,t){let r=Math.max(0,e),s=Math.min(Math.max(0,n),(this.root?.size??0)-r),[i,a]=I(this.root,r),[l,o]=I(a,s),c=ne(l),d=B(t,0,t.length);return this.root=S(S(i,d),o),c}replaceAll(e){this.root=B(e,0,e.length);}getRange(e,n){let t=Math.max(0,e),r=Math.min((this.root?.size??0)-1,n);if(t>r)return [];let s=[];return this.collectRange(this.root,t,r,0,s),s}clear(){this.root=null;}*[Symbol.iterator](){yield*this.inOrder(this.root);}*inOrder(e){e&&(yield*this.inOrder(e.left),yield e.lineId,yield*this.inOrder(e.right));}nodeAt(e,n){let t=e.left?e.left.size:0;return n<t?this.nodeAt(e.left,n):n===t?e:this.nodeAt(e.right,n-t-1)}collectRange(e,n,t,r,s){if(!e)return;let i=e.left?e.left.size:0,a=r+i;a>n&&e.left&&this.collectRange(e.left,n,t,r,s),a>=n&&a<=t&&s.push(e.lineId),a<t&&e.right&&this.collectRange(e.right,n,t,a+1,s);}};function te(u){return {lineId:u,size:1,priority:Math.random(),left:null,right:null}}function T(u){u.size=1+(u.left?u.left.size:0)+(u.right?u.right.size:0);}function S(u,e){return u?e?u.priority>e.priority?(u.right=S(u.right,e),T(u),u):(e.left=S(u,e.left),T(e),e):u:e}function I(u,e){if(!u)return [null,null];let n=u.left?u.left.size:0;if(e<=n){let[t,r]=I(u.left,e);return u.left=r,T(u),[t,u]}else {let[t,r]=I(u.right,e-n-1);return u.right=t,T(u),[u,r]}}function ne(u){let e=[];return F(u,e),e}function F(u,e){u&&(F(u.left,e),e.push(u.lineId),F(u.right,e));}function B(u,e,n){if(e>=n)return null;let t=Math.floor((e+n)/2),r=re(t);return {lineId:u[t],size:n-e,priority:r,left:B(u,e,t),right:B(u,t+1,n)}}function re(u){let e=u;return e=(e>>16^e)*73244475,e=(e>>16^e)*73244475,e=e>>16^e,e/4294967295}var R=class{constructor(e=b.performance.maxDocumentLines){this.lines=new Map;this.orderTree=new P;this.nextLineId=1;this._positionCache=null;this.dirtyLineIds=new Set;this.maxLines=e;}setDocument(e){if(b$1(e,this.maxLines)>this.maxLines)throw c.execution("DOCUMENT_TOO_LARGE",`This document has more than ${this.maxLines.toLocaleString("en-US")} lines, which is the most the engine will hold at once`,{maxLines:this.maxLines});this.lines.clear(),this.orderTree.clear(),this._positionCache=null,this.dirtyLineIds.clear(),this.nextLineId=1;let t=e.split(`
-`),r=new Array(t.length);for(let s=0;s<t.length;s++){let i=this.nextLineId++;r[s]=i,this.lines.set(i,{lineId:i,textHash:a(t[s]),text:t[s],expressions:[],bytecodes:[],reads:[],writes:[],results:[],result:null,dirty:true,isVariableDef:false,isEmpty:t[s].trim().length===0,inlineSolveCount:0});}this.orderTree.replaceAll(r);for(let s of r)this.dirtyLineIds.add(s);}applyChanges(e){let n=[],t=[],r=[...e].sort((s,i)=>i.startLine-s.startLine);for(let s of r){let i=s.startLine-1,a$1=[];for(let o of s.insertLines){let c=this.nextLineId++;a$1.push(c),n.push(c),this.lines.set(c,{lineId:c,textHash:a(o),text:o,expressions:[],bytecodes:[],reads:[],writes:[],results:[],result:null,dirty:true,isVariableDef:false,isEmpty:o.trim().length===0,inlineSolveCount:0});}for(let o of a$1)this.dirtyLineIds.add(o);let l=this.orderTree.spliceAt(i,s.deleteCount,a$1);for(let o of l)t.push(o),this.lines.delete(o),this.dirtyLineIds.delete(o);}return this._positionCache=null,{inserted:n,removed:t}}insertLines(e,n){let t={startLine:e,deleteCount:0,insertLines:n};return this.applyChanges([t]).inserted}deleteLines(e,n){let t={startLine:e,deleteCount:n-e+1,insertLines:[]};return this.applyChanges([t]).removed}editLine(e,n){let t=this.getLineAt(e);if(!t)return  false;let r=a(n);return r===t.textHash?false:(t.text=n,t.textHash=r,t.expressions=[],t.bytecodes=[],t.results=[],t.result=null,t.inlineSolveCount=0,t.dirty=true,this.dirtyLineIds.add(t.lineId),t.isEmpty=n.trim().length===0,true)}getLineAt(e){let n=e-1,t=this.orderTree.getAt(n);if(t!==void 0)return this.lines.get(t)}getLinePosition(e){if(this._positionCache)return this._positionCache.get(e)??-1;this._positionCache=new Map;let n=1;for(let t of this.orderTree)this._positionCache.set(t,n++);return this._positionCache.get(e)??-1}getVisibleLines(e,n){let t=this.orderTree.getRange(e-1,n-1),r=[];for(let s of t){let i=this.lines.get(s);i&&r.push(i);}return r}getAllLines(){return this.getVisibleLines(1,this.lineCount)}getLineById(e){return this.lines.get(e)}getDirtyLines(){let e=[];for(let n of this.lines.values())n.dirty&&e.push(n);return e}hasAnyDirtyLineBefore(e){for(let n of this.dirtyLineIds){let t=this.getLinePosition(n);if(t>=1&&t<e)return  true}return  false}hasAnyDirtyVariableDefLineBefore(e){for(let n of this.dirtyLineIds){let t=this.lines.get(n);if(!t||!t.isVariableDef)continue;let r=this.getLinePosition(n);if(r>=1&&r<e)return  true}return  false}get dirtyCount(){return this.dirtyLineIds.size}isBytecodeValid(e,n){let t=this.lines.get(e);return t!==void 0&&t.textHash===n}markClean(e){let n=this.lines.get(e);n&&(n.dirty=false,this.dirtyLineIds.delete(e));}markDirtyByLineNumber(e){let n=this.getLineAt(e);n&&(n.dirty=true,this.dirtyLineIds.add(n.lineId));}markDirty(e){let n=this.lines.get(e);n&&(n.dirty=true,this.dirtyLineIds.add(e));}invalidateAll(){for(let e of this.lines.values())e.dirty=true;this.dirtyLineIds=new Set(this.lines.keys());}updateLineResult(e,n,t,r,s,i,a,l=0){let o=this.lines.get(e);o&&(o.results=n,o.result=n[0]?.[0]??null,o.bytecodes=t,o.expressions=r,o.reads=s,o.writes=i,o.isVariableDef=a,o.inlineSolveCount=l,o.dirty=false,this.dirtyLineIds.delete(e));}updateLineCompiled(e,n,t,r,s,i,a=0){let l=this.lines.get(e);l&&(l.expressions=n,l.bytecodes=t,l.reads=r,l.writes=s,l.isVariableDef=i,l.inlineSolveCount=a);}get lineCount(){return this.orderTree.length}get isEmpty(){return this.orderTree.isEmpty}*[Symbol.iterator](){for(let e of this.orderTree){let n=this.lines.get(e);n&&(yield n);}}clear(){this.lines.clear(),this.orderTree.clear(),this._positionCache=null,this.nextLineId=1;}toJSON(){return {lineCount:this.lineCount,lines:this.getAllLines().map(e=>({lineId:e.lineId,text:e.text.substring(0,80),textHash:e.textHash,dirty:e.dirty,isVariableDef:e.isVariableDef,isEmpty:e.isEmpty,hasBytecode:e.bytecodes.length>0,hasResult:e.results.length>0,inlineSolveCount:e.inlineSolveCount,reads:e.reads,writes:e.writes}))}}};var A=class{constructor(){this.worker=null;this.nextId=1;this.pending=new Map;}ensureWorker(){if(this.worker)return this.worker;let e=h$1();if(e===null)throw new Error("no engine worker factory registered, so compilation stays on the main thread");return this.worker=e(),this.worker.onmessage=n=>{let t=n.data;if(!t||t.type!=="COMPILE_RESULT")return;let r=this.pending.get(t.id);if(!r)return;this.pending.delete(t.id);let s=[];for(let i of t.results)s.push(this.reconstructResult(i));r.resolve(s);},this.worker.onerror=n=>{for(let[t,r]of this.pending)r.reject(new Error(`Compilation worker error: ${n.message}`)),this.pending.delete(t);},this.worker}async compileBatch(e){if(e.length===0)return [];let n=this.ensureWorker(),t=this.nextId++;return new Promise((r,s)=>{this.pending.set(t,{resolve:r,reject:s}),n.postMessage({type:"COMPILE_BATCH",id:t,items:e});})}storeResults(e,n){let t=new Map;for(let i of e){if(i.error)continue;let a=n.getLineById(i.lineId);if(!a||a.textHash!==i.compiledAgainstHash)continue;let l=t.get(i.lineId);l||(l={bytecodes:[],reads:new Set,writes:new Set,isVariableDef:false,expressions:a.expressions.length>0?[...a.expressions]:[],textHash:i.compiledAgainstHash},t.set(i.lineId,l)),l.bytecodes.push(i.program);for(let o of i.reads)l.reads.add(o);for(let o of i.writes)l.writes.add(o);i.isVariableDef&&(l.isVariableDef=true);}let s=0;for(let[i,a]of t){if(a.bytecodes.length===0)continue;let o=n.getLineById(i)?.inlineSolveCount??0;n.updateLineCompiled(i,a.expressions,a.bytecodes,[...a.reads],[...a.writes],a.isVariableDef,o),s+=a.bytecodes.length;}return s}terminate(){this.worker&&(this.worker.terminate(),this.worker=null,this.pending.clear());}get isActive(){return this.worker!==null}reconstructResult(e){if(e.error)return {lineId:e.lineId,compiledAgainstHash:e.compiledAgainstHash,program:{opcodes:new Uint8Array(0),numbers:new Float64Array(0),strings:[],hasAsync:false},reads:[],writes:[],isVariableDef:false,error:e.error};let n=e.opcodesLength>0?new Uint8Array(e.opcodesBuffer,0,e.opcodesLength):new Uint8Array(0),t=e.numbersLength>0?new Float64Array(e.numbersBuffer,0,e.numbersLength):new Float64Array(0),r={opcodes:n,numbers:t,strings:e.strings,hasAsync:false};return {lineId:e.lineId,compiledAgainstHash:e.compiledAgainstHash,program:r,reads:e.reads,writes:e.writes,isVariableDef:e.isVariableDef,error:null}}};var U=128,k=3,J=6,Q=2,X=k,H=class u{constructor(){this.lastViewportStart=null;this.savedDirection=null;this.pageAccess=new Map;this.accessSeq=0;}static pageForLine(e){return Math.floor((e-1)/U)}static pageRange(e,n){return {startLine:e*U+1,endLine:Math.min((e+1)*U,n)}}detectDirection(e){return this.lastViewportStart===null?null:e.startLine>this.lastViewportStart?"down":e.startLine<this.lastViewportStart?"up":null}maintainAfterEval(e,n){this.savedDirection=this.detectDirection(e),this.lastViewportStart=e.startLine;let t=n.lineCount,r=u.pageForLine(e.startLine),s=u.pageForLine(e.endLine),i=u.pageForLine(t),a=Math.max(0,r-k),l=Math.min(i,s+k),o=Math.max(0,r-J),c=Math.min(i,s+J);for(let h=a;h<=l;h++)this.touchPage(h);for(let h=o;h<=c;h++)h>=a&&h<=l||this.evictPageResults(h,n,t);let d=o-1,p=Math.max(0,d-X+1);for(let h=p;h<=d;h++)this.evictPageBytecode(h,n,t);let f=c+1,g=Math.min(i,f+X-1);for(let h=f;h<=g;h++)this.evictPageBytecode(h,n,t);}getPreloadTargets(e,n){let t=this.savedDirection;if(!t)return [];let r=[],s=u.pageForLine(e.endLine),i=u.pageForLine(e.startLine),a=u.pageForLine(n.lineCount),l=[];if(t==="down"){let o=s+k+1,c=Math.min(o+Q-1,a);for(let d=o;d<=c&&d<=a;d++)l.push(d);}else {let o=i-k-1;for(let c=o;c>o-Q&&c>=0;c--)l.push(c);}for(let o of l){let c=u.pageRange(o,n.lineCount);for(let d=c.startLine;d<=c.endLine;d++){let p=n.getLineAt(d);if(p&&p.dirty&&!(p.bytecodes.length>0&&!p.isVariableDef)&&!p.isEmpty)if(p.expressions.length>0)for(let f of p.expressions)f.trim()&&r.push({lineId:p.lineId,expression:f,textHash:p.textHash});else {let f=c$1.findInlineSolves(p.text);if(f.length>0)for(let g of f)g.expression.trim()&&r.push({lineId:p.lineId,expression:g.expression,textHash:p.textHash});else {let g=p.text.trim();g&&r.push({lineId:p.lineId,expression:g,textHash:p.textHash});}}}}return r}clear(){this.pageAccess.clear(),this.accessSeq=0,this.lastViewportStart=null,this.savedDirection=null;}touchPage(e){this.pageAccess.set(e,++this.accessSeq);}evictPageResults(e,n,t){let r=u.pageRange(e,t);for(let s=r.startLine;s<=r.endLine;s++){let i=n.getLineAt(s);i&&!i.isVariableDef&&i.results.length>0&&(i.results=[],i.result=null);}}evictPageBytecode(e,n,t){let r=u.pageRange(e,t);for(let s=r.startLine;s<=r.endLine;s++){let i=n.getLineAt(s);!i||i.isVariableDef||(i.bytecodes.length>0||i.results.length>0)&&(i.bytecodes=[],i.results=[],i.result=null,n.markDirty(i.lineId));}}};var Y=(r=>(r[r.Tier1=1]="Tier1",r[r.Tier2=2]="Tier2",r[r.Tier3=3]="Tier3",r[r.Skipped=0]="Skipped",r))(Y||{}),w=class{constructor(e,n,t){this.compilationWorker=null;this.globalUnsubscribe=null;this.doc=e,this.engine=n,this.dag=n.getDag(),this.checkpointer=t??null,this.pageManager=new H,this.engine.setDocumentModel(this.doc),this.globalUnsubscribe=J$1.subscribe(r=>{for(let s of this.dag.getAffectedLines(K(r)))this.doc.markDirtyByLineNumber(s);});}evaluate(e,n){this.engine.setKeystrokeSignal(n??null),h();try{this.reseedAccumulators();let t=[],r=new Map,s={tier1:0,tier2:0,tier3:0,skipped:0},i=this.doc.lineCount,a=Math.min(e.endLine,i);for(let l=1;l<=a;l++){let o=this.doc.getLineAt(l);if(!o){s.skipped++;continue}let c=l>=e.startLine&&l<=e.endLine,d=this.evaluateSingleLine(o,l,c);t.push(d),d.tier===1?s.tier1++:d.tier===2?s.tier2++:d.tier===3?s.tier3++:s.skipped++,d.results&&c&&r.set(l,d.results.flat());}return this.pageManager.maintainAfterEval(e,this.doc),{lines:t,resultMap:r,tierCounts:s}}finally{this.engine.setKeystrokeSignal(null),i();}}backgroundCompile(e){let n=[],t=this.doc.lineCount,r=e.endLine+1;for(let s=r;s<=t;s++){let i=this.doc.getLineAt(s);if(!i||!i.dirty||i.bytecodes.length>0&&!i.isVariableDef)continue;let a=this.evaluateSingleLine(i,s,false);n.push(a);}return n}dispatchBackgroundCompiles(e){let n=this.collectInvisibleCompileTargets(e);n.length!==0&&(this.compilationWorker||(this.compilationWorker=new A),this.compilationWorker.compileBatch(n).then(t=>{this.compilationWorker.storeResults(t,this.doc);}).catch(t=>{}));}terminateWorker(){this.compilationWorker&&(this.compilationWorker.terminate(),this.compilationWorker=null),this.globalUnsubscribe&&(this.globalUnsubscribe(),this.globalUnsubscribe=null);}getDoc(){return this.doc}evaluateAll(e){let n={startLine:1,endLine:this.doc.lineCount};return this.evaluate(n,e)}setViewport(e,n){if(this.engine.setKeystrokeSignal(n??null),e.startLine>1&&this.hasDirtyLinesBefore(e.startLine))return this.checkpointer?.clear(),this.evaluate(e,n);this.pageManager.maintainAfterEval(e,this.doc),this.preloadNextPages(e),this.restoreTo(e.startLine-1),h();try{return this.collectEvalResults(e.startLine,e.endLine)}finally{this.engine.setKeystrokeSignal(null),i();}}applyTransaction(e){let n=new Set;for(let s of e)for(let i=0;i<s.deleteCount;i++){let a=s.startLine+i,l=this.dag.getWrites(a);for(let o of l)n.add(o);this.dag.removeLine(a),this.engine.getLineCache().removeAllForLine(a);}let t=new Set;for(let s of n){let i=this.dag.getAffectedLines(s);for(let a of i){let l=this.doc.getLineAt(a);l&&t.add(l.lineId);}}let r=this.doc.applyChanges(e);this.checkpointer?.clear();for(let s of t)this.doc.markDirty(s);return this.dag.clear(),{inserted:r.inserted,removed:r.removed}}reseedAccumulators(){let e=this.engine.resetAccumulators();if(e.size===0)return;let n=this.doc.lineCount;for(let t=1;t<=n;t++){let r=this.dag.getWrites(t);if(r.size!==0){for(let s of r)if(e.has(s)){this.doc.markDirtyByLineNumber(t);break}}}}collectEvalResults(e,n){let t=[],r=new Map,s={tier1:0,tier2:0,tier3:0,skipped:0},i=this.doc.lineCount,a=Math.min(n,i);for(let l=e;l<=a;l++){let o=this.doc.getLineAt(l);if(!o)continue;let c=this.evaluateSingleLine(o,l,true);t.push(c),c.tier===1?s.tier1++:c.tier===2?s.tier2++:c.tier===3?s.tier3++:s.skipped++,c.results&&r.set(l,c.results.flat());}return {lines:t,resultMap:r,tierCounts:s}}hasDirtyLinesBefore(e){return this.doc.hasAnyDirtyVariableDefLineBefore(e)}evaluateSingleLine(e,n,t){let r={lineId:e.lineId,lineNumber:n};if(e.isEmpty||m(e.text))return e.isEmpty=true,this.doc.markClean(e.lineId),{...r,tier:0,result:null,error:null};let{expressions:s,inlineSolveCount:i}=this.extractExpressions(e);return s.length===0?(e.isEmpty=true,this.doc.markClean(e.lineId),{...r,tier:0,result:null,error:null}):e.dirty?t?this.evaluateTier1(e,n,s,i,r):e.bytecodes.length>0&&e.bytecodes.length===s.length&&!e.isVariableDef?{...r,tier:0,result:null,error:null}:this.evaluateTier3(e,n,s,i,r):t&&e.bytecodes.length>0?this.evaluateTier2(e,n,r):{...r,tier:0,result:null,error:null}}evaluateTier1(e,n,t,r,s){let i=[],a=[],l=new Set,o=new Set,c=false,d=null,p=null,f=false,g=false;for(let y of t){if(!y.trim())continue;let b=null,L;try{let m=this.engine.evaluateLine(n,y);b=[m],d=m,L=this.engine.getLineCache().get(n,y);}catch(m){let x=m instanceof Error?m.message:String(m);p||(p=x),f=true,b=null;}if(b&&b.some(m=>m.type===12)&&(g=true),b?i.push(b):i.push([P$1("eval_failed",p??"unknown error")]),L){a.push(L.bytecode);for(let m of L.readVariables)l.add(m);L.writeVariable&&(o.add(L.writeVariable),c=true);}else try{let{program:m,reads:x,writes:E}=this.engine.compileExpression(y);a.push(m);for(let C of x)l.add(C);for(let C of E)o.add(C);E.length>0&&(c=!0);}catch(m){if(a.push({opcodes:new Uint8Array(0),numbers:new Float64Array(0),strings:[],hasAsync:false}),m instanceof b$2&&m.context){let x=m.context.reads,E=m.context.writes;if(Array.isArray(x))for(let C of x)l.add(C);if(Array.isArray(E))for(let C of E)o.add(C);}}}let h=[...l],v=[...o];return f||g?(this.doc.updateLineCompiled(e.lineId,t,a,h,v,c,r),e.results=i,e.result=i[0]?.[0]??null,e.inlineSolveCount=r,e.expressions=t):this.doc.updateLineResult(e.lineId,i,a,t,h,v,c,r),this.dag.registerLine(n,h,v),this.checkpointer&&v.length>0&&!f&&!g&&this.checkpointer.snapshot(n,e.lineId,v),{...s,tier:1,result:d,results:i,error:p}}evaluateTier2(e,n,t){if(e.bytecodes.length===0)return {...t,tier:0,result:null,error:null};let r=[],s=null,i=null,a=false;for(let l of e.bytecodes)if(l.opcodes.length!==0)try{let o=this.engine.executeCached(l,n);s=o,r.push([o]);}catch(o){let c=o instanceof Error?o.message:String(o);i||(i=c),a=true,r.push([P$1("exec_failed",c)]);}return this.dag.registerLine(n,e.reads,e.writes),e.results=r,e.result=r[0]?.[0]??null,a&&this.doc.markDirty(e.lineId),{...t,tier:2,result:s,results:r,error:i}}evaluateTier3(e,n,t,r,s){let i=[],a=new Set,l=new Set,o=false,c=null,d=null,p=false,f=false;for(let v of t)if(v.trim())try{let{program:y,reads:b,writes:L}=this.engine.compileExpression(v);i.push(y);for(let m of b)a.add(m);for(let m of L)l.add(m);L.length>0&&(o=!0),L.length>0&&y.opcodes.length>0&&(c=this.engine.executeCached(y,n),c&&c.type===12&&(f=!0));}catch(y){let b=y instanceof Error?y.message:String(y);d||(d=b),p=true,i.push({opcodes:new Uint8Array(0),numbers:new Float64Array(0),strings:[],hasAsync:false});}let g=[...a],h=[...l];return this.doc.updateLineCompiled(e.lineId,t,i,g,h,o,r),this.dag.registerLine(n,g,h),o&&c&&!p&&!f&&(e.results=[[c]],e.result=c,this.doc.markClean(e.lineId),this.checkpointer&&this.checkpointer.snapshot(n,e.lineId,h)),{...s,tier:3,result:c,results:o&&c&&!p&&!f?[[c]]:void 0,error:d}}restoreTo(e){this.checkpointer&&this.checkpointer.restoreTo(e);}getCheckpointer(){return this.checkpointer}getPageManager(){return this.pageManager}preloadNextPages(e){let n=this.pageManager.getPreloadTargets(e,this.doc);n.length!==0&&(this.compilationWorker||(this.compilationWorker=new A),this.compilationWorker.compileBatch(n).then(t=>{this.compilationWorker.storeResults(t,this.doc);}).catch(t=>{}));}collectInvisibleCompileTargets(e){let n=[],t=this.doc.lineCount,r=e.endLine+1;for(let s=r;s<=t;s++){let i=this.doc.getLineAt(s);if(!i||!i.dirty||i.bytecodes.length>0&&!i.isVariableDef||i.isEmpty||m(i.text))continue;let{expressions:a}=this.extractExpressions(i);if(a.length!==0)for(let l of a)l.trim()&&n.push({lineId:i.lineId,expression:l,textHash:i.textHash});}return n}extractExpressions(e){if(e.expressions.length>0)return {expressions:e.expressions,inlineSolveCount:e.inlineSolveCount};let n=e.text.trim();if(n.length===0)return {expressions:[],inlineSolveCount:0};let t=c$1.findInlineSolves(e.text);return t.length>0?{expressions:t.map(r=>r.expression),inlineSolveCount:t.length}:{expressions:[n],inlineSolveCount:0}}};function ee(u){return typeof u.unit=="string"?u.unit:String(u.value)}function ie(u,e,n$1={inputType:"markdown"}){let t=u.getDocumentModel(),r=new R;r.setDocument(e);let s=new w(r,u);try{let i=r.lineCount;s.evaluate({startLine:1,endLine:i});let a=[],l=[],o=0;for(let c=1;c<=i;c++){let d=r.getLineAt(c),p=d.text,f=o,g=o+p.length;o=g+1;let h=d.inlineSolveCount>0,v=[],y=null,b=null;d.isEmpty||(h?v=n(p,c).map((L,m)=>{let x=d.results[m]?.[0]??null;if(x&&x.type===13){let E=ee(x);return l.push(`Line ${c}: ${E}`),{...L,result:null,error:E}}return {...L,result:x,error:null}}):(y=d.expressions[0]??null,b=d.result??null,b&&b.type===13&&l.push(`Line ${c}: ${ee(b)}`))),a.push({lineNumber:c,text:p,startPosition:f,endPosition:g,isEmpty:d.isEmpty,hasInlineSolves:h,inlineSolves:v,expression:y,error:null,result:b});}return {lines:a,totalLines:i,errors:l}}finally{s.terminateWorker(),u.setDocumentModel(t);}}export{R as a,Y as b,w as c,ie as d};//# sourceMappingURL=chunk-IJE4AEDX.js.map
-//# sourceMappingURL=chunk-IJE4AEDX.js.map
+import {a}from'./chunk-RAF57WYO.js';import {m,n,h as h$1}from'./chunk-ITH2RLRG.js';import {b as b$1}from'./chunk-76F3LCIL.js';import {J as J$1,K}from'./chunk-INMJ7ZXL.js';import {h,i,P as P$1}from'./chunk-O7HF345B.js';import {b}from'./chunk-AENL3Z66.js';import {c as c$1}from'./chunk-6NL7RBAG.js';import {c,b as b$2}from'./chunk-6G2NES2I.js';var P=class{constructor(){this.root=null;}get length(){return this.root?this.root.size:0}get isEmpty(){return this.root===null}getAt(e){if(!(e<0||e>=(this.root?.size??0)))return this.nodeAt(this.root,e).lineId}insertAt(e,n){let[t,r]=I(this.root,e);this.root=S(S(t,te(n)),r);}deleteAt(e){if(e<0||e>=(this.root?.size??0))return;let[n,t]=I(this.root,e),[r,s]=I(t,1),i=r?r.lineId:void 0;return this.root=S(n,s),i}spliceAt(e,n,t){let r=Math.max(0,e),s=Math.min(Math.max(0,n),(this.root?.size??0)-r),[i,a]=I(this.root,r),[l,o]=I(a,s),c=ne(l),d=B(t,0,t.length);return this.root=S(S(i,d),o),c}replaceAll(e){this.root=B(e,0,e.length);}getRange(e,n){let t=Math.max(0,e),r=Math.min((this.root?.size??0)-1,n);if(t>r)return [];let s=[];return this.collectRange(this.root,t,r,0,s),s}clear(){this.root=null;}*[Symbol.iterator](){yield*this.inOrder(this.root);}*inOrder(e){e&&(yield*this.inOrder(e.left),yield e.lineId,yield*this.inOrder(e.right));}nodeAt(e,n){let t=e.left?e.left.size:0;return n<t?this.nodeAt(e.left,n):n===t?e:this.nodeAt(e.right,n-t-1)}collectRange(e,n,t,r,s){if(!e)return;let i=e.left?e.left.size:0,a=r+i;a>n&&e.left&&this.collectRange(e.left,n,t,r,s),a>=n&&a<=t&&s.push(e.lineId),a<t&&e.right&&this.collectRange(e.right,n,t,a+1,s);}};function te(u){return {lineId:u,size:1,priority:Math.random(),left:null,right:null}}function T(u){u.size=1+(u.left?u.left.size:0)+(u.right?u.right.size:0);}function S(u,e){return u?e?u.priority>e.priority?(u.right=S(u.right,e),T(u),u):(e.left=S(u,e.left),T(e),e):u:e}function I(u,e){if(!u)return [null,null];let n=u.left?u.left.size:0;if(e<=n){let[t,r]=I(u.left,e);return u.left=r,T(u),[t,u]}else {let[t,r]=I(u.right,e-n-1);return u.right=t,T(u),[u,r]}}function ne(u){let e=[];return F(u,e),e}function F(u,e){u&&(F(u.left,e),e.push(u.lineId),F(u.right,e));}function B(u,e,n){if(e>=n)return null;let t=Math.floor((e+n)/2),r=re(t);return {lineId:u[t],size:n-e,priority:r,left:B(u,e,t),right:B(u,t+1,n)}}function re(u){let e=u;return e=(e>>16^e)*73244475,e=(e>>16^e)*73244475,e=e>>16^e,e/4294967295}var R=class{constructor(e=b.performance.maxDocumentLines){this.lines=new Map;this.orderTree=new P;this.nextLineId=1;this._positionCache=null;this.dirtyLineIds=new Set;this.maxLines=e;}setDocument(e){if(b$1(e,this.maxLines)>this.maxLines)throw c.execution("DOCUMENT_TOO_LARGE",`This document has more than ${this.maxLines.toLocaleString("en-US")} lines, which is the most the engine will hold at once`,{maxLines:this.maxLines});this.lines.clear(),this.orderTree.clear(),this._positionCache=null,this.dirtyLineIds.clear(),this.nextLineId=1;let t=e.split(`
+`),r=new Array(t.length);for(let s=0;s<t.length;s++){let i=this.nextLineId++;r[s]=i,this.lines.set(i,{lineId:i,textHash:a(t[s]),text:t[s],expressions:[],bytecodes:[],reads:[],writes:[],results:[],result:null,dirty:true,isVariableDef:false,isEmpty:t[s].trim().length===0,inlineSolveCount:0});}this.orderTree.replaceAll(r);for(let s of r)this.dirtyLineIds.add(s);}applyChanges(e){let n=[],t=[],r=[...e].sort((s,i)=>i.startLine-s.startLine);for(let s of r){let i=s.startLine-1,a$1=[];for(let o of s.insertLines){let c=this.nextLineId++;a$1.push(c),n.push(c),this.lines.set(c,{lineId:c,textHash:a(o),text:o,expressions:[],bytecodes:[],reads:[],writes:[],results:[],result:null,dirty:true,isVariableDef:false,isEmpty:o.trim().length===0,inlineSolveCount:0});}for(let o of a$1)this.dirtyLineIds.add(o);let l=this.orderTree.spliceAt(i,s.deleteCount,a$1);for(let o of l)t.push(o),this.lines.delete(o),this.dirtyLineIds.delete(o);}return this._positionCache=null,{inserted:n,removed:t}}insertLines(e,n){let t={startLine:e,deleteCount:0,insertLines:n};return this.applyChanges([t]).inserted}deleteLines(e,n){let t={startLine:e,deleteCount:n-e+1,insertLines:[]};return this.applyChanges([t]).removed}editLine(e,n){let t=this.getLineAt(e);if(!t)return  false;let r=a(n);return r===t.textHash?false:(t.text=n,t.textHash=r,t.expressions=[],t.bytecodes=[],t.results=[],t.result=null,t.inlineSolveCount=0,t.dirty=true,this.dirtyLineIds.add(t.lineId),t.isEmpty=n.trim().length===0,true)}getLineAt(e){let n=e-1,t=this.orderTree.getAt(n);if(t!==void 0)return this.lines.get(t)}getLinePosition(e){if(this._positionCache)return this._positionCache.get(e)??-1;this._positionCache=new Map;let n=1;for(let t of this.orderTree)this._positionCache.set(t,n++);return this._positionCache.get(e)??-1}getVisibleLines(e,n){let t=this.orderTree.getRange(e-1,n-1),r=[];for(let s of t){let i=this.lines.get(s);i&&r.push(i);}return r}getAllLines(){return this.getVisibleLines(1,this.lineCount)}getLineById(e){return this.lines.get(e)}getDirtyLines(){let e=[];for(let n of this.lines.values())n.dirty&&e.push(n);return e}hasAnyDirtyLineBefore(e){for(let n of this.dirtyLineIds){let t=this.getLinePosition(n);if(t>=1&&t<e)return  true}return  false}hasAnyDirtyVariableDefLineBefore(e){for(let n of this.dirtyLineIds){let t=this.lines.get(n);if(!t||!t.isVariableDef)continue;let r=this.getLinePosition(n);if(r>=1&&r<e)return  true}return  false}get dirtyCount(){return this.dirtyLineIds.size}isBytecodeValid(e,n){let t=this.lines.get(e);return t!==void 0&&t.textHash===n}markClean(e){let n=this.lines.get(e);n&&(n.dirty=false,this.dirtyLineIds.delete(e));}markDirtyByLineNumber(e){let n=this.getLineAt(e);n&&(n.dirty=true,this.dirtyLineIds.add(n.lineId));}markDirty(e){let n=this.lines.get(e);n&&(n.dirty=true,this.dirtyLineIds.add(e));}invalidateAll(){for(let e of this.lines.values())e.dirty=true;this.dirtyLineIds=new Set(this.lines.keys());}updateLineResult(e,n,t,r,s,i,a,l=0){let o=this.lines.get(e);o&&(o.results=n,o.result=n[0]?.[0]??null,o.bytecodes=t,o.expressions=r,o.reads=s,o.writes=i,o.isVariableDef=a,o.inlineSolveCount=l,o.dirty=false,this.dirtyLineIds.delete(e));}updateLineCompiled(e,n,t,r,s,i,a=0){let l=this.lines.get(e);l&&(l.expressions=n,l.bytecodes=t,l.reads=r,l.writes=s,l.isVariableDef=i,l.inlineSolveCount=a);}get lineCount(){return this.orderTree.length}get isEmpty(){return this.orderTree.isEmpty}*[Symbol.iterator](){for(let e of this.orderTree){let n=this.lines.get(e);n&&(yield n);}}clear(){this.lines.clear(),this.orderTree.clear(),this._positionCache=null,this.nextLineId=1;}toJSON(){return {lineCount:this.lineCount,lines:this.getAllLines().map(e=>({lineId:e.lineId,text:e.text.substring(0,80),textHash:e.textHash,dirty:e.dirty,isVariableDef:e.isVariableDef,isEmpty:e.isEmpty,hasBytecode:e.bytecodes.length>0,hasResult:e.results.length>0,inlineSolveCount:e.inlineSolveCount,reads:e.reads,writes:e.writes}))}}};var A=class{constructor(){this.worker=null;this.nextId=1;this.pending=new Map;}ensureWorker(){if(this.worker)return this.worker;let e=h$1();if(e===null)throw new Error("no engine worker factory registered, so compilation stays on the main thread");return this.worker=e(),this.worker.onmessage=n=>{let t=n.data;if(!t||t.type!=="COMPILE_RESULT")return;let r=this.pending.get(t.id);if(!r)return;this.pending.delete(t.id);let s=[];for(let i of t.results)s.push(this.reconstructResult(i));r.resolve(s);},this.worker.onerror=n=>{for(let[t,r]of this.pending)r.reject(new Error(`Compilation worker error: ${n.message}`)),this.pending.delete(t);},this.worker}async compileBatch(e){if(e.length===0)return [];let n=this.ensureWorker(),t=this.nextId++;return new Promise((r,s)=>{this.pending.set(t,{resolve:r,reject:s}),n.postMessage({type:"COMPILE_BATCH",id:t,items:e});})}storeResults(e,n){let t=new Map;for(let i of e){if(i.error)continue;let a=n.getLineById(i.lineId);if(!a||a.textHash!==i.compiledAgainstHash)continue;let l=t.get(i.lineId);l||(l={bytecodes:[],reads:new Set,writes:new Set,isVariableDef:false,expressions:a.expressions.length>0?[...a.expressions]:[],textHash:i.compiledAgainstHash},t.set(i.lineId,l)),l.bytecodes.push(i.program);for(let o of i.reads)l.reads.add(o);for(let o of i.writes)l.writes.add(o);i.isVariableDef&&(l.isVariableDef=true);}let s=0;for(let[i,a]of t){if(a.bytecodes.length===0)continue;let o=n.getLineById(i)?.inlineSolveCount??0;n.updateLineCompiled(i,a.expressions,a.bytecodes,[...a.reads],[...a.writes],a.isVariableDef,o),s+=a.bytecodes.length;}return s}terminate(){this.worker&&(this.worker.terminate(),this.worker=null,this.pending.clear());}get isActive(){return this.worker!==null}reconstructResult(e){if(e.error)return {lineId:e.lineId,compiledAgainstHash:e.compiledAgainstHash,program:{opcodes:new Uint8Array(0),numbers:new Float64Array(0),strings:[],hasAsync:false},reads:[],writes:[],isVariableDef:false,error:e.error};let n=e.opcodesLength>0?new Uint8Array(e.opcodesBuffer,0,e.opcodesLength):new Uint8Array(0),t=e.numbersLength>0?new Float64Array(e.numbersBuffer,0,e.numbersLength):new Float64Array(0),r={opcodes:n,numbers:t,strings:e.strings,hasAsync:false};return {lineId:e.lineId,compiledAgainstHash:e.compiledAgainstHash,program:r,reads:e.reads,writes:e.writes,isVariableDef:e.isVariableDef,error:null}}};var U=128,k=3,J=6,Q=2,X=k,H=class u{constructor(){this.lastViewportStart=null;this.savedDirection=null;this.pageAccess=new Map;this.accessSeq=0;}static pageForLine(e){return Math.floor((e-1)/U)}static pageRange(e,n){return {startLine:e*U+1,endLine:Math.min((e+1)*U,n)}}detectDirection(e){return this.lastViewportStart===null?null:e.startLine>this.lastViewportStart?"down":e.startLine<this.lastViewportStart?"up":null}maintainAfterEval(e,n){this.savedDirection=this.detectDirection(e),this.lastViewportStart=e.startLine;let t=n.lineCount,r=u.pageForLine(e.startLine),s=u.pageForLine(e.endLine),i=u.pageForLine(t),a=Math.max(0,r-k),l=Math.min(i,s+k),o=Math.max(0,r-J),c=Math.min(i,s+J);for(let h=a;h<=l;h++)this.touchPage(h);for(let h=o;h<=c;h++)h>=a&&h<=l||this.evictPageResults(h,n,t);let d=o-1,p=Math.max(0,d-X+1);for(let h=p;h<=d;h++)this.evictPageBytecode(h,n,t);let f=c+1,g=Math.min(i,f+X-1);for(let h=f;h<=g;h++)this.evictPageBytecode(h,n,t);}getPreloadTargets(e,n){let t=this.savedDirection;if(!t)return [];let r=[],s=u.pageForLine(e.endLine),i=u.pageForLine(e.startLine),a=u.pageForLine(n.lineCount),l=[];if(t==="down"){let o=s+k+1,c=Math.min(o+Q-1,a);for(let d=o;d<=c&&d<=a;d++)l.push(d);}else {let o=i-k-1;for(let c=o;c>o-Q&&c>=0;c--)l.push(c);}for(let o of l){let c=u.pageRange(o,n.lineCount);for(let d=c.startLine;d<=c.endLine;d++){let p=n.getLineAt(d);if(p&&p.dirty&&!(p.bytecodes.length>0&&!p.isVariableDef)&&!p.isEmpty)if(p.expressions.length>0)for(let f of p.expressions)f.trim()&&r.push({lineId:p.lineId,expression:f,textHash:p.textHash});else {let f=c$1.findInlineSolves(p.text);if(f.length>0)for(let g of f)g.expression.trim()&&r.push({lineId:p.lineId,expression:g.expression,textHash:p.textHash});else {let g=p.text.trim();g&&r.push({lineId:p.lineId,expression:g,textHash:p.textHash});}}}}return r}clear(){this.pageAccess.clear(),this.accessSeq=0,this.lastViewportStart=null,this.savedDirection=null;}touchPage(e){this.pageAccess.set(e,++this.accessSeq);}evictPageResults(e,n,t){let r=u.pageRange(e,t);for(let s=r.startLine;s<=r.endLine;s++){let i=n.getLineAt(s);i&&!i.isVariableDef&&i.results.length>0&&(i.results=[],i.result=null);}}evictPageBytecode(e,n,t){let r=u.pageRange(e,t);for(let s=r.startLine;s<=r.endLine;s++){let i=n.getLineAt(s);!i||i.isVariableDef||(i.bytecodes.length>0||i.results.length>0)&&(i.bytecodes=[],i.results=[],i.result=null,n.markDirty(i.lineId));}}};var Y=(r=>(r[r.Tier1=1]="Tier1",r[r.Tier2=2]="Tier2",r[r.Tier3=3]="Tier3",r[r.Skipped=0]="Skipped",r))(Y||{}),w=class{constructor(e,n,t){this.compilationWorker=null;this.globalUnsubscribe=null;this.doc=e,this.engine=n,this.dag=n.getDag(),this.checkpointer=t??null,this.pageManager=new H,this.engine.setDocumentModel(this.doc),this.globalUnsubscribe=J$1.subscribe(r=>{for(let s of this.dag.getAffectedLines(K(r)))this.doc.markDirtyByLineNumber(s);});}evaluate(e,n){this.engine.setKeystrokeSignal(n??null),h();try{this.reseedAccumulators();let t=[],r=new Map,s={tier1:0,tier2:0,tier3:0,skipped:0},i=this.doc.lineCount,a=Math.min(e.endLine,i);for(let l=1;l<=a;l++){let o=this.doc.getLineAt(l);if(!o){s.skipped++;continue}let c=l>=e.startLine&&l<=e.endLine,d=this.evaluateSingleLine(o,l,c);t.push(d),d.tier===1?s.tier1++:d.tier===2?s.tier2++:d.tier===3?s.tier3++:s.skipped++,d.results&&c&&r.set(l,d.results.flat());}return this.pageManager.maintainAfterEval(e,this.doc),{lines:t,resultMap:r,tierCounts:s}}finally{this.engine.setKeystrokeSignal(null),i();}}backgroundCompile(e){let n=[],t=this.doc.lineCount,r=e.endLine+1;for(let s=r;s<=t;s++){let i=this.doc.getLineAt(s);if(!i||!i.dirty||i.bytecodes.length>0&&!i.isVariableDef)continue;let a=this.evaluateSingleLine(i,s,false);n.push(a);}return n}dispatchBackgroundCompiles(e){let n=this.collectInvisibleCompileTargets(e);n.length!==0&&(this.compilationWorker||(this.compilationWorker=new A),this.compilationWorker.compileBatch(n).then(t=>{this.compilationWorker.storeResults(t,this.doc);}).catch(t=>{}));}terminateWorker(){this.compilationWorker&&(this.compilationWorker.terminate(),this.compilationWorker=null),this.globalUnsubscribe&&(this.globalUnsubscribe(),this.globalUnsubscribe=null);}getDoc(){return this.doc}evaluateAll(e){let n={startLine:1,endLine:this.doc.lineCount};return this.evaluate(n,e)}setViewport(e,n){if(this.engine.setKeystrokeSignal(n??null),e.startLine>1&&this.hasDirtyLinesBefore(e.startLine))return this.checkpointer?.clear(),this.evaluate(e,n);this.pageManager.maintainAfterEval(e,this.doc),this.preloadNextPages(e),this.restoreTo(e.startLine-1),h();try{return this.collectEvalResults(e.startLine,e.endLine)}finally{this.engine.setKeystrokeSignal(null),i();}}applyTransaction(e){let n=new Set;for(let s of e)for(let i=0;i<s.deleteCount;i++){let a=s.startLine+i,l=this.dag.getWrites(a);for(let o of l)n.add(o);this.dag.removeLine(a),this.engine.getLineCache().removeAllForLine(a);}let t=new Set;for(let s of n){let i=this.dag.getAffectedLines(s);for(let a of i){let l=this.doc.getLineAt(a);l&&t.add(l.lineId);}}let r=this.doc.applyChanges(e);this.checkpointer?.clear();for(let s of t)this.doc.markDirty(s);return this.dag.clear(),{inserted:r.inserted,removed:r.removed}}reseedAccumulators(){let e=this.engine.resetAccumulators();if(e.size===0)return;let n=this.doc.lineCount;for(let t=1;t<=n;t++){let r=this.dag.getWrites(t);if(r.size!==0){for(let s of r)if(e.has(s)){this.doc.markDirtyByLineNumber(t);break}}}}collectEvalResults(e,n){let t=[],r=new Map,s={tier1:0,tier2:0,tier3:0,skipped:0},i=this.doc.lineCount,a=Math.min(n,i);for(let l=e;l<=a;l++){let o=this.doc.getLineAt(l);if(!o)continue;let c=this.evaluateSingleLine(o,l,true);t.push(c),c.tier===1?s.tier1++:c.tier===2?s.tier2++:c.tier===3?s.tier3++:s.skipped++,c.results&&r.set(l,c.results.flat());}return {lines:t,resultMap:r,tierCounts:s}}hasDirtyLinesBefore(e){return this.doc.hasAnyDirtyVariableDefLineBefore(e)}evaluateSingleLine(e,n,t){let r={lineId:e.lineId,lineNumber:n};if(e.isEmpty||m(e.text))return e.isEmpty=true,this.doc.markClean(e.lineId),{...r,tier:0,result:null,error:null};let{expressions:s,inlineSolveCount:i}=this.extractExpressions(e);return s.length===0?(e.isEmpty=true,this.doc.markClean(e.lineId),{...r,tier:0,result:null,error:null}):e.dirty?t?this.evaluateTier1(e,n,s,i,r):e.bytecodes.length>0&&e.bytecodes.length===s.length&&!e.isVariableDef?{...r,tier:0,result:null,error:null}:this.evaluateTier3(e,n,s,i,r):t&&e.bytecodes.length>0?this.evaluateTier2(e,n,r):{...r,tier:0,result:null,error:null}}evaluateTier1(e,n,t,r,s){let i=[],a=[],l=new Set,o=new Set,c=false,d=null,p=null,f=false,g=false;for(let y of t){if(!y.trim())continue;let b=null,L;try{let m=this.engine.evaluateLine(n,y);b=[m],d=m,L=this.engine.getLineCache().get(n,y);}catch(m){let x=m instanceof Error?m.message:String(m);p||(p=x),f=true,b=null;}if(b&&b.some(m=>m.type===12)&&(g=true),b?i.push(b):i.push([P$1("eval_failed",p??"unknown error")]),L){a.push(L.bytecode);for(let m of L.readVariables)l.add(m);L.writeVariable&&(o.add(L.writeVariable),c=true);}else try{let{program:m,reads:x,writes:E}=this.engine.compileExpression(y);a.push(m);for(let C of x)l.add(C);for(let C of E)o.add(C);E.length>0&&(c=!0);}catch(m){if(a.push({opcodes:new Uint8Array(0),numbers:new Float64Array(0),strings:[],hasAsync:false}),m instanceof b$2&&m.context){let x=m.context.reads,E=m.context.writes;if(Array.isArray(x))for(let C of x)l.add(C);if(Array.isArray(E))for(let C of E)o.add(C);}}}let h=[...l],v=[...o];return f||g?(this.doc.updateLineCompiled(e.lineId,t,a,h,v,c,r),e.results=i,e.result=i[0]?.[0]??null,e.inlineSolveCount=r,e.expressions=t):this.doc.updateLineResult(e.lineId,i,a,t,h,v,c,r),this.dag.registerLine(n,h,v),this.checkpointer&&v.length>0&&!f&&!g&&this.checkpointer.snapshot(n,e.lineId,v),{...s,tier:1,result:d,results:i,error:p}}evaluateTier2(e,n,t){if(e.bytecodes.length===0)return {...t,tier:0,result:null,error:null};let r=[],s=null,i=null,a=false;for(let l of e.bytecodes)if(l.opcodes.length!==0)try{let o=this.engine.executeCached(l,n);s=o,r.push([o]);}catch(o){let c=o instanceof Error?o.message:String(o);i||(i=c),a=true,r.push([P$1("exec_failed",c)]);}return this.dag.registerLine(n,e.reads,e.writes),e.results=r,e.result=r[0]?.[0]??null,a&&this.doc.markDirty(e.lineId),{...t,tier:2,result:s,results:r,error:i}}evaluateTier3(e,n,t,r,s){let i=[],a=new Set,l=new Set,o=false,c=null,d=null,p=false,f=false;for(let v of t)if(v.trim())try{let{program:y,reads:b,writes:L}=this.engine.compileExpression(v);i.push(y);for(let m of b)a.add(m);for(let m of L)l.add(m);L.length>0&&(o=!0),L.length>0&&y.opcodes.length>0&&(c=this.engine.executeCached(y,n),c&&c.type===12&&(f=!0));}catch(y){let b=y instanceof Error?y.message:String(y);d||(d=b),p=true,i.push({opcodes:new Uint8Array(0),numbers:new Float64Array(0),strings:[],hasAsync:false});}let g=[...a],h=[...l];return this.doc.updateLineCompiled(e.lineId,t,i,g,h,o,r),this.dag.registerLine(n,g,h),o&&c&&!p&&!f&&(e.results=[[c]],e.result=c,this.doc.markClean(e.lineId),this.checkpointer&&this.checkpointer.snapshot(n,e.lineId,h)),{...s,tier:3,result:c,results:o&&c&&!p&&!f?[[c]]:void 0,error:d}}restoreTo(e){this.checkpointer&&this.checkpointer.restoreTo(e);}getCheckpointer(){return this.checkpointer}getPageManager(){return this.pageManager}preloadNextPages(e){let n=this.pageManager.getPreloadTargets(e,this.doc);n.length!==0&&(this.compilationWorker||(this.compilationWorker=new A),this.compilationWorker.compileBatch(n).then(t=>{this.compilationWorker.storeResults(t,this.doc);}).catch(t=>{}));}collectInvisibleCompileTargets(e){let n=[],t=this.doc.lineCount,r=e.endLine+1;for(let s=r;s<=t;s++){let i=this.doc.getLineAt(s);if(!i||!i.dirty||i.bytecodes.length>0&&!i.isVariableDef||i.isEmpty||m(i.text))continue;let{expressions:a}=this.extractExpressions(i);if(a.length!==0)for(let l of a)l.trim()&&n.push({lineId:i.lineId,expression:l,textHash:i.textHash});}return n}extractExpressions(e){if(e.expressions.length>0)return {expressions:e.expressions,inlineSolveCount:e.inlineSolveCount};let n=e.text.trim();if(n.length===0)return {expressions:[],inlineSolveCount:0};let t=c$1.findInlineSolves(e.text);return t.length>0?{expressions:t.map(r=>r.expression),inlineSolveCount:t.length}:{expressions:[n],inlineSolveCount:0}}};function ee(u){return typeof u.unit=="string"?u.unit:String(u.value)}function ie(u,e,n$1={inputType:"markdown"}){let t=u.getDocumentModel(),r=new R;r.setDocument(e);let s=new w(r,u);try{let i=r.lineCount;s.evaluate({startLine:1,endLine:i});let a=[],l=[],o=0;for(let c=1;c<=i;c++){let d=r.getLineAt(c),p=d.text,f=o,g=o+p.length;o=g+1;let h=d.inlineSolveCount>0,v=[],y=null,b=null;d.isEmpty||(h?v=n(p,c).map((L,m)=>{let x=d.results[m]?.[0]??null;if(x&&x.type===13){let E=ee(x);return l.push(`Line ${c}: ${E}`),{...L,result:null,error:E}}return {...L,result:x,error:null}}):(y=d.expressions[0]??null,b=d.result??null,b&&b.type===13&&l.push(`Line ${c}: ${ee(b)}`))),a.push({lineNumber:c,text:p,startPosition:f,endPosition:g,isEmpty:d.isEmpty,hasInlineSolves:h,inlineSolves:v,expression:y,error:null,result:b});}return {lines:a,totalLines:i,errors:l}}finally{s.terminateWorker(),u.setDocumentModel(t);}}export{R as a,Y as b,w as c,ie as d};//# sourceMappingURL=chunk-24OW3AAU.js.map
+//# sourceMappingURL=chunk-24OW3AAU.js.map