solve-engine 2.38.26 → 2.38.28

package/dist/{PackageCompatibility-C7ILySsH.d.ts → PackageCompatibility-BfRpqwmD.d.ts}

@@ -1,4 +1,4 @@
-import { I as IEnginePackage } from './PackageRegistry-D7_B0mxv.js';
+import { I as IEnginePackage } from './PackageRegistry-ClAKDDOP.js';
 
 /**
  * Package load-time compatibility checking, the "detect overlapping

package/dist/{PackageCompatibility-CzDzOIg9.d.cts → PackageCompatibility-CcfNMlWN.d.cts}

@@ -1,4 +1,4 @@
-import { I as IEnginePackage } from './PackageRegistry-Bd8ErpwZ.cjs';
+import { I as IEnginePackage } from './PackageRegistry-DLLVZW0S.cjs';
 
 /**
  * Package load-time compatibility checking, the "detect overlapping

package/dist/{PackageRegistry-D7_B0mxv.d.ts → PackageRegistry-ClAKDDOP.d.ts}

@@ -1,14 +1,14 @@
-import { a as PrecedenceParser, b as PrefixParselet, I as InfixParselet } from './Parselet-Br1tHash.js';
+import { a as PrecedenceParser, b as PrefixParselet, I as InfixParselet } from './Parselet-DkAFnfU2.js';
 import { M as MarkdownLineType, L as Lexer, e as TokenCategory, c as LexerVocabulary } from './Lexer-DPn5dfCH.js';
 import { IAsyncResolver } from './resolvers.js';
 import { T as TokenFusion, c as TokenNormalizer, a as NormalizerRule } from './TokenNormalizer-DAzPp-j1.js';
-import { b as VMCheckpointer, D as DependencyGraph, V as VM, h as DagSnapshot, i as EngineContext, S as ScopeManager, P as PluginFunctionHandler, A as AsConverter } from './VMBuiltins-BqkoJtHt.js';
-import { V as Value, b as ValueType, D as DatetimeGrain } from './Value-B55Hvn3e.js';
+import { b as VMCheckpointer, D as DependencyGraph, V as VM, h as DagSnapshot, i as EngineContext, S as ScopeManager, P as PluginFunctionHandler, A as AsConverter } from './VMBuiltins-Bk8TQNF1.js';
+import { V as Value, b as ValueType, D as DatetimeGrain } from './Value-wMuCzPn0.js';
 import { a as BytecodeProgram } from './BytecodeBuilder-DSWKZi4f.js';
 import { C as CalendarBackend } from './CalendarBackend-MdS3Bb4P.js';
 import { QueryClient } from '@tanstack/query-core';
 import { E as EngineError } from './EngineError-Bm4OYmw8.js';
-import { a as DiagnosticReportJSON, D as DiagnosticPipeline } from './pipeline-CADMN2D1.js';
+import { a as DiagnosticReportJSON, D as DiagnosticPipeline } from './pipeline-CLegjVrf.js';
 import { T as Token } from './Token-D8f7yaz1.js';
 import { D as DateAmbiguity, E as EngineConfigOverride, a as EngineConfig } from './Configuration-BxriK9Kw.js';
 
@@ -248,6 +248,21 @@ declare class DocumentModel {
      * Built on first `getLinePosition()` call, invalidated on structural edits.
      */
     private _positionCache;
+    /**
+     * Lazy order cache: 0-based position → lineId, the reverse of
+     * {@link _positionCache} and the order the tree holds.
+     *
+     * `getLineAt(position)` walked the order tree on every call, an O(log n)
+     * recursion. The cross-line forms lean on it hard: `total above`, a line
+     * range and each boundary check turn a position into a line this way, once
+     * per line they scan, every pass, so in an editing session, where the
+     * positions do not move between structural edits, it was the single largest
+     * cost in the evaluator (about a quarter of an edit's re-evaluation). This
+     * turns the lookup into an array index. Built in the same pass as
+     * {@link _positionCache} and invalidated with it, so an edit that only
+     * changes a line's text (the common keystroke) leaves it standing.
+     */
+    private _orderedIds;
     /**
      * Line IDs currently marked dirty, maintained alongside every
      * `state.dirty` mutation (in this class and in every other module that
@@ -362,6 +377,12 @@ declare class DocumentModel {
      * Get the LineState at the given 1-based line position. O(1).
      */
     getLineAt(position: number): LineState | undefined;
+    /**
+     * Build both order caches in one walk of the tree, and return the ordered
+     * ids. The two are kept in lock-step: either both are current or both are
+     * rebuilt, so {@link getLineAt} and {@link getLinePosition} never disagree.
+     */
+    private buildOrderCaches;
     /**
      * Get the 1-based position of a line by its persistent ID.
      * Returns -1 if the line ID is not in the document.

package/dist/{PackageRegistry-Bd8ErpwZ.d.cts → PackageRegistry-DLLVZW0S.d.cts}

@@ -1,14 +1,14 @@
-import { a as PrecedenceParser, b as PrefixParselet, I as InfixParselet } from './Parselet-DmMY2s9Y.cjs';
+import { a as PrecedenceParser, b as PrefixParselet, I as InfixParselet } from './Parselet-ClR3Blwp.cjs';
 import { M as MarkdownLineType, L as Lexer, e as TokenCategory, c as LexerVocabulary } from './Lexer-DaWkCu84.cjs';
 import { IAsyncResolver } from './resolvers.cjs';
 import { T as TokenFusion, c as TokenNormalizer, a as NormalizerRule } from './TokenNormalizer-D382VSYh.cjs';
-import { b as VMCheckpointer, D as DependencyGraph, V as VM, h as DagSnapshot, i as EngineContext, S as ScopeManager, P as PluginFunctionHandler, A as AsConverter } from './VMBuiltins-Baa90D2v.cjs';
-import { V as Value, b as ValueType, D as DatetimeGrain } from './Value-B55Hvn3e.cjs';
+import { b as VMCheckpointer, D as DependencyGraph, V as VM, h as DagSnapshot, i as EngineContext, S as ScopeManager, P as PluginFunctionHandler, A as AsConverter } from './VMBuiltins-ClXnXk9K.cjs';
+import { V as Value, b as ValueType, D as DatetimeGrain } from './Value-wMuCzPn0.cjs';
 import { a as BytecodeProgram } from './BytecodeBuilder-DSWKZi4f.cjs';
 import { C as CalendarBackend } from './CalendarBackend-MdS3Bb4P.cjs';
 import { QueryClient } from '@tanstack/query-core';
 import { E as EngineError } from './EngineError-Bm4OYmw8.cjs';
-import { a as DiagnosticReportJSON, D as DiagnosticPipeline } from './pipeline-C1-CJnFJ.cjs';
+import { a as DiagnosticReportJSON, D as DiagnosticPipeline } from './pipeline-DKNPr6s8.cjs';
 import { T as Token } from './Token-D8f7yaz1.cjs';
 import { D as DateAmbiguity, E as EngineConfigOverride, a as EngineConfig } from './Configuration-BxriK9Kw.cjs';
 
@@ -248,6 +248,21 @@ declare class DocumentModel {
      * Built on first `getLinePosition()` call, invalidated on structural edits.
      */
     private _positionCache;
+    /**
+     * Lazy order cache: 0-based position → lineId, the reverse of
+     * {@link _positionCache} and the order the tree holds.
+     *
+     * `getLineAt(position)` walked the order tree on every call, an O(log n)
+     * recursion. The cross-line forms lean on it hard: `total above`, a line
+     * range and each boundary check turn a position into a line this way, once
+     * per line they scan, every pass, so in an editing session, where the
+     * positions do not move between structural edits, it was the single largest
+     * cost in the evaluator (about a quarter of an edit's re-evaluation). This
+     * turns the lookup into an array index. Built in the same pass as
+     * {@link _positionCache} and invalidated with it, so an edit that only
+     * changes a line's text (the common keystroke) leaves it standing.
+     */
+    private _orderedIds;
     /**
      * Line IDs currently marked dirty, maintained alongside every
      * `state.dirty` mutation (in this class and in every other module that
@@ -362,6 +377,12 @@ declare class DocumentModel {
      * Get the LineState at the given 1-based line position. O(1).
      */
     getLineAt(position: number): LineState | undefined;
+    /**
+     * Build both order caches in one walk of the tree, and return the ordered
+     * ids. The two are kept in lock-step: either both are current or both are
+     * rebuilt, so {@link getLineAt} and {@link getLinePosition} never disagree.
+     */
+    private buildOrderCaches;
     /**
      * Get the 1-based position of a line by its persistent ID.
      * Returns -1 if the line ID is not in the document.

package/dist/{Parselet-DmMY2s9Y.d.cts → Parselet-ClR3Blwp.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-C1-CJnFJ.cjs';
+import { D as DiagnosticPipeline } from './pipeline-DKNPr6s8.cjs';
 import { C as CalendarBackend } from './CalendarBackend-MdS3Bb4P.cjs';
 
 /**

package/dist/{Parselet-Br1tHash.d.ts → Parselet-DkAFnfU2.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-CADMN2D1.js';
+import { D as DiagnosticPipeline } from './pipeline-CLegjVrf.js';
 import { C as CalendarBackend } from './CalendarBackend-MdS3Bb4P.js';
 
 /**

package/dist/{VMBuiltins-BqkoJtHt.d.ts → VMBuiltins-Bk8TQNF1.d.ts}

@@ -1,8 +1,8 @@
-import { V as Value } from './Value-B55Hvn3e.js';
+import { V as Value } from './Value-wMuCzPn0.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-Bm4OYmw8.js';
-import { D as DiagnosticPipeline } from './pipeline-CADMN2D1.js';
+import { D as DiagnosticPipeline } from './pipeline-CLegjVrf.js';
 
 /**
  * Create a new VM instance with the given opcode registry and configurable limits.

package/dist/{VMBuiltins-Baa90D2v.d.cts → VMBuiltins-ClXnXk9K.d.cts}

@@ -1,8 +1,8 @@
-import { V as Value } from './Value-B55Hvn3e.cjs';
+import { V as Value } from './Value-wMuCzPn0.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-Bm4OYmw8.cjs';
-import { D as DiagnosticPipeline } from './pipeline-C1-CJnFJ.cjs';
+import { D as DiagnosticPipeline } from './pipeline-DKNPr6s8.cjs';
 
 /**
  * Create a new VM instance with the given opcode registry and configurable limits.

package/dist/{Value-B55Hvn3e.d.cts → Value-wMuCzPn0.d.cts}

@@ -606,9 +606,25 @@ type DisplayBase = "hex" | "bin" | "oct";
  * `unit` slot, which is free for this type.
  */
 declare function hexValue(n: number | bigint, base?: DisplayBase): Value;
-/** Create a BigInt-typed Value (arbitrary-precision integer). */
+/**
+ * Create a BigInt-typed Value (arbitrary-precision integer).
+ *
+ * Charged on birth by its byte size, so a doubling chain like `b(n) = n * n`
+ * nested deep trips the allocation budget (the running tally accumulates each
+ * product) rather than building a multi-megabyte integer. The `^` and `<<`
+ * operators refuse past their own bit ceiling before they reach here; multiply,
+ * which has no such ceiling, is bounded by this charge.
+ */
 declare function bigIntValue(n: bigint): Value;
-/** Create a String-typed Value. */
+/**
+ * Create a String-typed Value.
+ *
+ * Charged on birth by its length, the one place every string is born, so a
+ * doubling chain like `d(s) = s + s` nested deep trips the allocation budget
+ * rather than building a near-gigabyte string. The charge is a no-op outside an
+ * evaluation (the formatter, snapshot restore and host callers), exactly like
+ * {@link matrixValue}.
+ */
 declare function stringValue(s: string): Value;
 /** Create a Unit-of-Measurement Value (typed number with unit annotation). */
 declare function uomValue(n: number, unit: string): Value;

package/dist/{Value-B55Hvn3e.d.ts → Value-wMuCzPn0.d.ts}

@@ -606,9 +606,25 @@ type DisplayBase = "hex" | "bin" | "oct";
  * `unit` slot, which is free for this type.
  */
 declare function hexValue(n: number | bigint, base?: DisplayBase): Value;
-/** Create a BigInt-typed Value (arbitrary-precision integer). */
+/**
+ * Create a BigInt-typed Value (arbitrary-precision integer).
+ *
+ * Charged on birth by its byte size, so a doubling chain like `b(n) = n * n`
+ * nested deep trips the allocation budget (the running tally accumulates each
+ * product) rather than building a multi-megabyte integer. The `^` and `<<`
+ * operators refuse past their own bit ceiling before they reach here; multiply,
+ * which has no such ceiling, is bounded by this charge.
+ */
 declare function bigIntValue(n: bigint): Value;
-/** Create a String-typed Value. */
+/**
+ * Create a String-typed Value.
+ *
+ * Charged on birth by its length, the one place every string is born, so a
+ * doubling chain like `d(s) = s + s` nested deep trips the allocation budget
+ * rather than building a near-gigabyte string. The charge is a no-op outside an
+ * evaluation (the formatter, snapshot restore and host callers), exactly like
+ * {@link matrixValue}.
+ */
 declare function stringValue(s: string): Value;
 /** Create a Unit-of-Measurement Value (typed number with unit annotation). */
 declare function uomValue(n: number, unit: string): Value;