solve-engine 2.38.5 → 2.38.7

package/dist/{PackageCompatibility-CuUVgjBW.d.cts → PackageCompatibility-rJfOPkuE.d.cts}

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

package/dist/{PackageCompatibility-DscVGabN.d.ts → PackageCompatibility-th5IHCuQ.d.ts}

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

package/dist/{PackageRegistry-G6qyHROU.d.cts → PackageRegistry-CDZch8VI.d.cts}

@@ -2,7 +2,7 @@ import { a as PrecedenceParser, b as PrefixParselet, I as InfixParselet } from '
 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 { D as DependencyGraph, V as VM, f as DagSnapshot, g as EngineContext, S as ScopeManager, P as PluginFunctionHandler, A as AsConverter } from './VMBuiltins-RpmR0yHh.cjs';
+import { D as DependencyGraph, V as VM, f as DagSnapshot, g as EngineContext, S as ScopeManager, P as PluginFunctionHandler, A as AsConverter } from './VMBuiltins-DR0PyI_g.cjs';
 import { V as Value, b as ValueType, D as DatetimeGrain } from './Value-B55Hvn3e.cjs';
 import { a as BytecodeProgram } from './BytecodeBuilder-DSWKZi4f.cjs';
 import { C as CalendarBackend } from './CalendarBackend-MdS3Bb4P.cjs';
@@ -261,6 +261,23 @@ declare class DocumentModel {
      * bottom of a 20k-line document before this fix.
      */
     private dirtyLineIds;
+    /**
+     * Lower-cased category tag to the ids of the lines carrying it, or `null`
+     * while nothing has asked.
+     *
+     * `total of #food` used to walk the whole document looking for `#food`, so a
+     * document of members and totals cost one walk per total: D aggregates over
+     * N lines is D x N, and a notepad of a few thousand tagged lines took
+     * minutes. This turns an aggregate into a lookup of its own members.
+     *
+     * Built on the first query rather than with the document, so a document with
+     * no tags in it, which is most of them, never scans for any. Once built it is
+     * kept in step by the four places that change a line's text: {@link setDocument},
+     * {@link applyChanges}, {@link editLine} and {@link clear}. Keyed by line id
+     * rather than position, so inserting or deleting a line above a tagged one
+     * does not touch it.
+     */
+    private tagIndex;
     /**
      * Most lines this model will hold. See `constants/Configuration.ts`'s
      * `performance.maxDocumentLines`, which is where the default comes from and
@@ -320,6 +337,27 @@ declare class DocumentModel {
      * Returns true if the text actually changed (hash mismatch).
      */
     editLine(lineNumber: number, newText: string): boolean;
+    /**
+     * The 1-based positions of the lines carrying `#tag`, in document order.
+     *
+     * What `total of #tag` reads. Case-insensitive, matching how a tag is read
+     * on a line, and it names membership only: a line that merely asks about the
+     * group (`total of #tag`) is not in it, and neither is a `#heading`.
+     *
+     * Ascending, because an aggregate reports the first line it cannot read and
+     * the line it names has to be the first one in the document, not whichever
+     * happened to be indexed first.
+     *
+     * @param tag - The tag name without its `#`.
+     * @returns Its lines' positions, ascending; empty when no line carries it.
+     */
+    linesCarryingTag(tag: string): number[];
+    /** The tag index, built over every line the first time one is asked for. */
+    private ensureTagIndex;
+    /** Records `lineId` as a member of every group its text joins. */
+    private indexTags;
+    /** Drops `lineId` from every group the text it used to hold joined. */
+    private unindexTags;
     /**
      * Get the LineState at the given 1-based line position. O(1).
      */
@@ -1960,6 +1998,16 @@ declare class ExpressionEngine {
      */
     private batchScanResults;
     private batchParsedLines;
+    /**
+     * Lower-cased category tag to the 1-based lines carrying it, for the batch
+     * pass, or `null` before anything has asked.
+     *
+     * The batch path has no document model to hold this, and the scan it does
+     * have lives only for the pass, so the index does too: built over the scan
+     * on the first aggregate and dropped with it. A document with no aggregate
+     * in it never builds one.
+     */
+    private batchTagIndex;
     /**
      * The context handed to every line of the current pass, its line number
      * set by mutation before each execution. The closures inside read only
@@ -2378,6 +2426,23 @@ declare class ExpressionEngine {
      * still cancels it), or null when nothing was linked.
      */
     private armCancellation;
+    /**
+     * Register a line's edges, including the groups its text joins and asks about.
+     *
+     * A category tag is an edge like any other: a line carrying `#food` writes
+     * that group, and `total of #food` reads it. Registering them here is what
+     * lets an edit to a tagged line dirty only the aggregates over that tag.
+     *
+     * Membership is a property of the text rather than of the bytecode, so it
+     * comes from the same scanner the aggregate itself reads with, which is what
+     * keeps the two from ever disagreeing about what is in a group.
+     *
+     * @param lineNumber - 1-based line the edges belong to.
+     * @param text - The line's expression, which is where its tags are.
+     * @param reads - Variable keys the line reads.
+     * @param writes - Variable keys the line writes.
+     */
+    private registerLineWithTags;
     /**
      * Execute bytecode and handle the result.
      *
@@ -2455,6 +2520,19 @@ declare class ExpressionEngine {
      * bypassing the split→join roundtrip that this method performs.
      */
     evaluateLines(lines: string[]): ParsedLine[];
+    /**
+     * The lines of the batch pass's scan carrying `#tag`, ascending.
+     *
+     * The batch counterpart of `DocumentModel.linesCarryingTag`, over the scan
+     * this pass is walking rather than over a document model. Built once and
+     * read by every aggregate in the pass, which is what makes the pass linear
+     * in the document rather than linear per aggregate.
+     *
+     * @param scan - The pass's scanned lines, indexed from 0 for line 1.
+     * @param tag - The tag name without its `#`.
+     * @returns Its lines' 1-based positions, ascending; empty when none carry it.
+     */
+    private batchLinesCarryingTag;
     /**
      * Process pre-scanned line results into ParsedLine objects.
      *

package/dist/{PackageRegistry-DJekaRdM.d.ts → PackageRegistry-yDMyorr3.d.ts}

@@ -2,7 +2,7 @@ import { a as PrecedenceParser, b as PrefixParselet, I as InfixParselet } from '
 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 { D as DependencyGraph, V as VM, f as DagSnapshot, g as EngineContext, S as ScopeManager, P as PluginFunctionHandler, A as AsConverter } from './VMBuiltins-BnE1KdV5.js';
+import { D as DependencyGraph, V as VM, f as DagSnapshot, g as EngineContext, S as ScopeManager, P as PluginFunctionHandler, A as AsConverter } from './VMBuiltins-CjuRXAOD.js';
 import { V as Value, b as ValueType, D as DatetimeGrain } from './Value-B55Hvn3e.js';
 import { a as BytecodeProgram } from './BytecodeBuilder-DSWKZi4f.js';
 import { C as CalendarBackend } from './CalendarBackend-MdS3Bb4P.js';
@@ -261,6 +261,23 @@ declare class DocumentModel {
      * bottom of a 20k-line document before this fix.
      */
     private dirtyLineIds;
+    /**
+     * Lower-cased category tag to the ids of the lines carrying it, or `null`
+     * while nothing has asked.
+     *
+     * `total of #food` used to walk the whole document looking for `#food`, so a
+     * document of members and totals cost one walk per total: D aggregates over
+     * N lines is D x N, and a notepad of a few thousand tagged lines took
+     * minutes. This turns an aggregate into a lookup of its own members.
+     *
+     * Built on the first query rather than with the document, so a document with
+     * no tags in it, which is most of them, never scans for any. Once built it is
+     * kept in step by the four places that change a line's text: {@link setDocument},
+     * {@link applyChanges}, {@link editLine} and {@link clear}. Keyed by line id
+     * rather than position, so inserting or deleting a line above a tagged one
+     * does not touch it.
+     */
+    private tagIndex;
     /**
      * Most lines this model will hold. See `constants/Configuration.ts`'s
      * `performance.maxDocumentLines`, which is where the default comes from and
@@ -320,6 +337,27 @@ declare class DocumentModel {
      * Returns true if the text actually changed (hash mismatch).
      */
     editLine(lineNumber: number, newText: string): boolean;
+    /**
+     * The 1-based positions of the lines carrying `#tag`, in document order.
+     *
+     * What `total of #tag` reads. Case-insensitive, matching how a tag is read
+     * on a line, and it names membership only: a line that merely asks about the
+     * group (`total of #tag`) is not in it, and neither is a `#heading`.
+     *
+     * Ascending, because an aggregate reports the first line it cannot read and
+     * the line it names has to be the first one in the document, not whichever
+     * happened to be indexed first.
+     *
+     * @param tag - The tag name without its `#`.
+     * @returns Its lines' positions, ascending; empty when no line carries it.
+     */
+    linesCarryingTag(tag: string): number[];
+    /** The tag index, built over every line the first time one is asked for. */
+    private ensureTagIndex;
+    /** Records `lineId` as a member of every group its text joins. */
+    private indexTags;
+    /** Drops `lineId` from every group the text it used to hold joined. */
+    private unindexTags;
     /**
      * Get the LineState at the given 1-based line position. O(1).
      */
@@ -1960,6 +1998,16 @@ declare class ExpressionEngine {
      */
     private batchScanResults;
     private batchParsedLines;
+    /**
+     * Lower-cased category tag to the 1-based lines carrying it, for the batch
+     * pass, or `null` before anything has asked.
+     *
+     * The batch path has no document model to hold this, and the scan it does
+     * have lives only for the pass, so the index does too: built over the scan
+     * on the first aggregate and dropped with it. A document with no aggregate
+     * in it never builds one.
+     */
+    private batchTagIndex;
     /**
      * The context handed to every line of the current pass, its line number
      * set by mutation before each execution. The closures inside read only
@@ -2378,6 +2426,23 @@ declare class ExpressionEngine {
      * still cancels it), or null when nothing was linked.
      */
     private armCancellation;
+    /**
+     * Register a line's edges, including the groups its text joins and asks about.
+     *
+     * A category tag is an edge like any other: a line carrying `#food` writes
+     * that group, and `total of #food` reads it. Registering them here is what
+     * lets an edit to a tagged line dirty only the aggregates over that tag.
+     *
+     * Membership is a property of the text rather than of the bytecode, so it
+     * comes from the same scanner the aggregate itself reads with, which is what
+     * keeps the two from ever disagreeing about what is in a group.
+     *
+     * @param lineNumber - 1-based line the edges belong to.
+     * @param text - The line's expression, which is where its tags are.
+     * @param reads - Variable keys the line reads.
+     * @param writes - Variable keys the line writes.
+     */
+    private registerLineWithTags;
     /**
      * Execute bytecode and handle the result.
      *
@@ -2455,6 +2520,19 @@ declare class ExpressionEngine {
      * bypassing the split→join roundtrip that this method performs.
      */
     evaluateLines(lines: string[]): ParsedLine[];
+    /**
+     * The lines of the batch pass's scan carrying `#tag`, ascending.
+     *
+     * The batch counterpart of `DocumentModel.linesCarryingTag`, over the scan
+     * this pass is walking rather than over a document model. Built once and
+     * read by every aggregate in the pass, which is what makes the pass linear
+     * in the document rather than linear per aggregate.
+     *
+     * @param scan - The pass's scanned lines, indexed from 0 for line 1.
+     * @param tag - The tag name without its `#`.
+     * @returns Its lines' 1-based positions, ascending; empty when none carry it.
+     */
+    private batchLinesCarryingTag;
     /**
      * Process pre-scanned line results into ParsedLine objects.
      *

package/dist/{VMBuiltins-BnE1KdV5.d.ts → VMBuiltins-CjuRXAOD.d.ts}

@@ -98,6 +98,16 @@ interface LineExecutionContext {
     calendar?: CalendarBackend;
     /** Look up another line's cached result by 1-based line number. `undefined` = not evaluated yet (or out of range), distinct from a line that evaluated to an actual `undefined`-like Value, which can't happen (every Value type has a concrete representation). */
     getLineResult?: (lineNumber: number) => Value | undefined;
+    /**
+     * The 1-based positions of the lines carrying `#tag`, ascending, or
+     * `undefined` when this path keeps no index and the caller should walk the
+     * document itself.
+     *
+     * `total of #tag` used to look at every line of the document, so a notepad
+     * of tagged amounts and totals cost aggregates x lines per pass. Both
+     * document paths maintain an index instead, and answer from it here.
+     */
+    getTaggedLines?: (tag: string) => readonly number[] | undefined;
     /** Whether line `lineNumber` is a blank line or a `#` heading, the stopping condition for "total above"/"sum above"/"average above" aggregation. */
     isLineBoundary?: (lineNumber: number) => boolean;
     /**
@@ -591,6 +601,8 @@ declare const sharedOpRegistry: OpRegistry;
 /** Serialized snapshot of the dependency graph for diagnostic rendering. */
 interface DagSnapshot {
     consumers: Record<string, number[]>;
+    /** key -> the lines that write it, the mirror of `consumers`. */
+    producers: Record<string, number[]>;
     writes: Record<number, string[]>;
     reads: Record<number, string[]>;
     dataSourceDeps: Record<number, string[]>;
@@ -607,12 +619,36 @@ interface DagSnapshot {
  * - Efficient removal of deleted lines (removeLine)
  */
 declare class DependencyGraph {
+    /** key -> the lines that READ it. Answers "what does an edit to this affect". */
     private consumers;
+    /**
+     * key -> the lines that WRITE it. Answers "what is in this group".
+     *
+     * The half that was missing. `consumers` alone can say which lines ask about
+     * `#food`; only this can say which lines are *in* it, which is what a
+     * category-tag aggregate needs and why it used to walk the whole document
+     * instead of asking.
+     */
+    private producers;
     private dependencies;
     private writes;
     private lineReads;
-    private dataSourceDependencies;
-    private dataSourceConsumers;
+    /**
+     * line -> the keys it reads that {@link registerLine} must not replace.
+     *
+     * Variable and tag edges are recovered from the line's text every time it is
+     * registered, so registering replaces them. A data-source edge is discovered
+     * at run time, after that registration, so replacing would drop it. Both live
+     * in the same {@link consumers} index; only the bookkeeping differs.
+     */
+    private pinnedReads;
+    /**
+     * Whether this line already carries exactly these edges.
+     *
+     * Reads are compared against the stored set minus its pinned keys, since a
+     * pinned key (a data source) is not part of what a caller passes.
+     */
+    private hasSameEdges;
     /**
      * Register a line's variable reads and writes in the dependency graph.
      *
@@ -668,7 +704,7 @@ declare class DependencyGraph {
      * @param queryKey - The query key that was updated
      * @returns Set of line numbers that need re-evaluation
      */
-    getAffectedLinesByDataSource(dataSourceId: string, queryKey: string[]): Set<number>;
+    getAffectedLinesByDataSource(dataSourceId: string, queryKey: string[]): ReadonlySet<number>;
     /**
      * Remove a line from the dependency graph (e.g., when a line is deleted from the document).
      *
@@ -684,21 +720,33 @@ declare class DependencyGraph {
      * @param variable - The variable name
      * @returns Set of line numbers that read this variable, or empty set if none
      */
-    getConsumers(variable: string): Set<number>;
+    getConsumers(variable: string): ReadonlySet<number>;
+    /**
+     * Get all line numbers that produce (write) a given key.
+     *
+     * The mirror of {@link getConsumers}, and the reason the producer index
+     * exists: for a category tag it is the group's membership, so an aggregate
+     * over `#food` costs the size of the group rather than the size of the
+     * document.
+     *
+     * @param key - The key, from {@link edgeKey}
+     * @returns Set of line numbers that write this key, or empty set if none
+     */
+    getProducers(key: string): ReadonlySet<number>;
     /**
      * Get all variables that a line depends on (reads).
      *
      * @param lineNumber - The line number to query
      * @returns Set of variable names this line reads, or empty set if none
      */
-    getDependencies(lineNumber: number): Set<string>;
+    getDependencies(lineNumber: number): ReadonlySet<string>;
     /**
      * Get all variables that a line writes (assigns to).
      *
      * @param lineNumber - The line number to query
      * @returns Set of variable names this line writes, or empty set if none
      */
-    getWrites(lineNumber: number): Set<string>;
+    getWrites(lineNumber: number): ReadonlySet<string>;
     /**
      * Get a serializable snapshot of the entire dependency graph for diagnostics.
      *

package/dist/{VMBuiltins-RpmR0yHh.d.cts → VMBuiltins-DR0PyI_g.d.cts}

@@ -98,6 +98,16 @@ interface LineExecutionContext {
     calendar?: CalendarBackend;
     /** Look up another line's cached result by 1-based line number. `undefined` = not evaluated yet (or out of range), distinct from a line that evaluated to an actual `undefined`-like Value, which can't happen (every Value type has a concrete representation). */
     getLineResult?: (lineNumber: number) => Value | undefined;
+    /**
+     * The 1-based positions of the lines carrying `#tag`, ascending, or
+     * `undefined` when this path keeps no index and the caller should walk the
+     * document itself.
+     *
+     * `total of #tag` used to look at every line of the document, so a notepad
+     * of tagged amounts and totals cost aggregates x lines per pass. Both
+     * document paths maintain an index instead, and answer from it here.
+     */
+    getTaggedLines?: (tag: string) => readonly number[] | undefined;
     /** Whether line `lineNumber` is a blank line or a `#` heading, the stopping condition for "total above"/"sum above"/"average above" aggregation. */
     isLineBoundary?: (lineNumber: number) => boolean;
     /**
@@ -591,6 +601,8 @@ declare const sharedOpRegistry: OpRegistry;
 /** Serialized snapshot of the dependency graph for diagnostic rendering. */
 interface DagSnapshot {
     consumers: Record<string, number[]>;
+    /** key -> the lines that write it, the mirror of `consumers`. */
+    producers: Record<string, number[]>;
     writes: Record<number, string[]>;
     reads: Record<number, string[]>;
     dataSourceDeps: Record<number, string[]>;
@@ -607,12 +619,36 @@ interface DagSnapshot {
  * - Efficient removal of deleted lines (removeLine)
  */
 declare class DependencyGraph {
+    /** key -> the lines that READ it. Answers "what does an edit to this affect". */
     private consumers;
+    /**
+     * key -> the lines that WRITE it. Answers "what is in this group".
+     *
+     * The half that was missing. `consumers` alone can say which lines ask about
+     * `#food`; only this can say which lines are *in* it, which is what a
+     * category-tag aggregate needs and why it used to walk the whole document
+     * instead of asking.
+     */
+    private producers;
     private dependencies;
     private writes;
     private lineReads;
-    private dataSourceDependencies;
-    private dataSourceConsumers;
+    /**
+     * line -> the keys it reads that {@link registerLine} must not replace.
+     *
+     * Variable and tag edges are recovered from the line's text every time it is
+     * registered, so registering replaces them. A data-source edge is discovered
+     * at run time, after that registration, so replacing would drop it. Both live
+     * in the same {@link consumers} index; only the bookkeeping differs.
+     */
+    private pinnedReads;
+    /**
+     * Whether this line already carries exactly these edges.
+     *
+     * Reads are compared against the stored set minus its pinned keys, since a
+     * pinned key (a data source) is not part of what a caller passes.
+     */
+    private hasSameEdges;
     /**
      * Register a line's variable reads and writes in the dependency graph.
      *
@@ -668,7 +704,7 @@ declare class DependencyGraph {
      * @param queryKey - The query key that was updated
      * @returns Set of line numbers that need re-evaluation
      */
-    getAffectedLinesByDataSource(dataSourceId: string, queryKey: string[]): Set<number>;
+    getAffectedLinesByDataSource(dataSourceId: string, queryKey: string[]): ReadonlySet<number>;
     /**
      * Remove a line from the dependency graph (e.g., when a line is deleted from the document).
      *
@@ -684,21 +720,33 @@ declare class DependencyGraph {
      * @param variable - The variable name
      * @returns Set of line numbers that read this variable, or empty set if none
      */
-    getConsumers(variable: string): Set<number>;
+    getConsumers(variable: string): ReadonlySet<number>;
+    /**
+     * Get all line numbers that produce (write) a given key.
+     *
+     * The mirror of {@link getConsumers}, and the reason the producer index
+     * exists: for a category tag it is the group's membership, so an aggregate
+     * over `#food` costs the size of the group rather than the size of the
+     * document.
+     *
+     * @param key - The key, from {@link edgeKey}
+     * @returns Set of line numbers that write this key, or empty set if none
+     */
+    getProducers(key: string): ReadonlySet<number>;
     /**
      * Get all variables that a line depends on (reads).
      *
      * @param lineNumber - The line number to query
      * @returns Set of variable names this line reads, or empty set if none
      */
-    getDependencies(lineNumber: number): Set<string>;
+    getDependencies(lineNumber: number): ReadonlySet<string>;
     /**
      * Get all variables that a line writes (assigns to).
      *
      * @param lineNumber - The line number to query
      * @returns Set of variable names this line writes, or empty set if none
      */
-    getWrites(lineNumber: number): Set<string>;
+    getWrites(lineNumber: number): ReadonlySet<string>;
     /**
      * Get a serializable snapshot of the entire dependency graph for diagnostics.
      *

package/dist/{VMCheckpoints-DpHlGjJ3.d.ts → VMCheckpoints-C2REEAxr.d.ts}

@@ -1,5 +1,5 @@
 import { V as Value } from './Value-B55Hvn3e.js';
-import { V as VM } from './VMBuiltins-BnE1KdV5.js';
+import { V as VM } from './VMBuiltins-CjuRXAOD.js';
 import { U as UserFunctionDef } from './BytecodeBuilder-DSWKZi4f.js';
 
 /**

package/dist/{VMCheckpoints-D0_5-IIa.d.cts → VMCheckpoints-Ch3ElC4X.d.cts}

@@ -1,5 +1,5 @@
 import { V as Value } from './Value-B55Hvn3e.cjs';
-import { V as VM } from './VMBuiltins-RpmR0yHh.cjs';
+import { V as VM } from './VMBuiltins-DR0PyI_g.cjs';
 import { U as UserFunctionDef } from './BytecodeBuilder-DSWKZi4f.cjs';
 
 /**