openalgo-script 0.1.0-alpha.1 → 0.2.0

package/dist/core/engine/budget.js

@@ -0,0 +1,188 @@
+import { raise } from './errors.js';
+/**
+ * What an engine allows when a host says nothing.
+ *
+ * The ceilings that have a catalogue code are set; the clock is off, because a
+ * default wall clock would make the same script pass on a fast machine and fail
+ * on a slow one with nobody having asked for that trade.
+ *
+ * **`arrayElements` is the one number here the language fixes.** `language.md`
+ * 14.1 states it, so it is not a host's choice and a host lowering it refuses a
+ * script that a conforming engine runs. `scripts/check-limits.mjs` compares it
+ * against that sentence on every build, which is the only reason this file may
+ * write the number at all. Every other ceiling below is the host's, because the
+ * specification leaves it open.
+ */
+export const DEFAULT_LIMITS = {
+    steps: null,
+    ms: null,
+    arrayElements: 1_000_000,
+    stringLength: 100_000,
+    drawingObjects: 10_000,
+    frames: 64,
+    loops: null,
+    history: null,
+    instructions: null,
+    states: null,
+    requests: null,
+    clockEvery: 4096,
+};
+export function limitsWith(given) {
+    return given === undefined ? DEFAULT_LIMITS : { ...DEFAULT_LIMITS, ...given };
+}
+/**
+ * The most instructions one bar of this program can possibly execute.
+ *
+ * Verification proves three things that together bound a bar: the target of
+ * every backward jump is a `TICK` (3.5 check 6), so no cycle runs without
+ * charging the loop budget; recursion is an error, so the call graph is acyclic
+ * and each call site's body runs at most once per acyclic segment; and the
+ * instruction lists are finite. So a segment between two `TICK` executions
+ * costs at most the program's whole instruction count once, and there are at
+ * most `limits.loops` such segments plus the one that ends at `HALT`.
+ *
+ * The number is generous by design. It is not a performance budget: it is the
+ * proof that a bar terminates, turned into a counter so that a program which
+ * somehow exceeds its own static bound stops instead of running forever.
+ */
+export function stepBound(program) {
+    let acyclic = program.code.length;
+    for (const site of program.callSites) {
+        acyclic += program.functions[site.fn]?.code.length ?? 0;
+    }
+    const segments = Math.max(program.limits.loops, 0) + 1;
+    return Math.max(acyclic, 1) * segments + acyclic;
+}
+/**
+ * The per-bar counters.
+ *
+ * One object per engine, reset at step 3 of every execution of a bar, so a long
+ * dataset is never itself a reason to fail.
+ */
+export class Budget {
+    loops = 0;
+    steps = 0;
+    started = 0;
+    nextClockAt = 0;
+    bar = 0;
+    limits;
+    stepCeiling;
+    loopCeiling;
+    clock;
+    constructor(limits, stepCeiling, loopCeiling, clock) {
+        this.limits = limits;
+        this.stepCeiling = stepCeiling;
+        this.loopCeiling = loopCeiling;
+        this.clock = clock;
+    }
+    /** Step 3: the counters start again for this execution of this bar. */
+    begin(bar) {
+        this.bar = bar;
+        this.loops = 0;
+        this.steps = 0;
+        this.nextClockAt = this.limits.clockEvery;
+        this.started = this.limits.ms !== null && this.clock !== undefined ? this.clock() : 0;
+    }
+    /**
+     * One instruction executed.
+     *
+     * Returns whether a budget is spent, rather than raising, so the dispatch
+     * loop does the check inline and the cost is one comparison on the path every
+     * instruction takes.
+     */
+    step() {
+        this.steps += 1;
+        if (this.steps > this.stepCeiling)
+            return true;
+        if (this.steps >= this.nextClockAt) {
+            this.nextClockAt = this.steps + this.limits.clockEvery;
+            if (this.clock !== undefined && this.limits.ms !== null) {
+                return this.clock() - this.started > this.limits.ms;
+            }
+        }
+        return false;
+    }
+    /** Which budget the last `step` ran out of, and the diagnostic for it. */
+    overrun(span, loopLine) {
+        const max = this.limits.ms;
+        if (this.steps <= this.stepCeiling && max !== null && this.clock !== undefined) {
+            raise('OS5007', span, { bar: this.bar, ms: this.clock() - this.started, max });
+        }
+        // The step ceiling is the static bound of `stepBound`, and a loop is the
+        // only construct that can approach it, so the loop that was running is the
+        // one to name. A bar that passes it with no loop running contradicts what
+        // verification proved about the program, which is OS6018's case.
+        this.spentLoops(span, loopLine);
+    }
+    /** Step 5.5: one iteration of loop `l` charged to the per-bar budget. */
+    tick(span, line) {
+        this.loops += 1;
+        if (this.loops > this.loopCeiling)
+            this.spentLoops(span, line);
+    }
+    spentLoops(span, line) {
+        if (line === undefined) {
+            raise('OS6018', span, {
+                location: `step ${this.steps}`,
+                reason: 'the bar executed more instructions than the program can reach without a loop, ' +
+                    'so the instruction list is not the one verification walked',
+            });
+        }
+        raise('OS5001', span, {
+            budget: this.loopCeiling,
+            line,
+            suggested: suggestBudget(this.loopCeiling),
+        });
+    }
+    /**
+     * The drawing object ceiling, OS5010, charged before the object is built.
+     *
+     * `held` is what the script holds now, so the object about to be created is
+     * number `held + 1` and the refusal names that number. Checked before
+     * building rather than after, because an engine that allocates first and
+     * complains second has already spent the memory it is refusing to spend.
+     */
+    checkDrawing(span, held) {
+        if (held >= this.limits.drawingObjects) {
+            raise('OS5010', span, { max: this.limits.drawingObjects, found: held + 1 });
+        }
+    }
+    /** The array ceiling, OS5002. */
+    checkArray(span, name, size) {
+        if (size > this.limits.arrayElements) {
+            raise('OS5002', span, { max: this.limits.arrayElements, name, size });
+        }
+    }
+    /** The string ceiling, OS5008, counted in code points as 3.1 requires. */
+    checkString(span, text) {
+        this.checkLength(span, [...text].length);
+        return text;
+    }
+    /**
+     * The same ceiling against a length that has not been built yet.
+     *
+     * `str.repeat` is where a string ceiling is actually reached, and building
+     * the string first to measure it is how an engine runs out of memory instead
+     * of reporting that it would have.
+     */
+    checkLength(span, length) {
+        if (length > this.limits.stringLength) {
+            raise('OS5008', span, { max: this.limits.stringLength, found: length });
+        }
+    }
+}
+/**
+ * A budget with room to spare, for OS5001's fix line.
+ *
+ * The catalogue asks for a budget that would have completed the bar, and the
+ * engine cannot know one: it stopped the loop rather than finishing it. Twice
+ * the budget, rounded to one significant figure so the number reads like
+ * something a person would type, is the nearest honest thing, and the message
+ * beside it says the first fix is the exit condition.
+ */
+function suggestBudget(budget) {
+    const doubled = Math.max(budget * 2, 1000);
+    const magnitude = Math.pow(10, Math.floor(Math.log10(doubled)));
+    return Math.ceil(doubled / magnitude) * magnitude;
+}
+//# sourceMappingURL=budget.js.map

package/dist/core/engine/budget.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"budget.js","sourceRoot":"","sources":["../../../src/core/engine/budget.ts"],"names":[],"mappings":"AA2BA,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAiDpC;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,cAAc,GAAiB;IAC1C,KAAK,EAAE,IAAI;IACX,EAAE,EAAE,IAAI;IACR,aAAa,EAAE,SAAS;IACxB,YAAY,EAAE,OAAO;IACrB,cAAc,EAAE,MAAM;IACtB,MAAM,EAAE,EAAE;IACV,KAAK,EAAE,IAAI;IACX,OAAO,EAAE,IAAI;IACb,YAAY,EAAE,IAAI;IAClB,MAAM,EAAE,IAAI;IACZ,QAAQ,EAAE,IAAI;IACd,UAAU,EAAE,IAAI;CACjB,CAAC;AAEF,MAAM,UAAU,UAAU,CAAC,KAAwC;IACjE,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,cAAc,EAAE,GAAG,KAAK,EAAE,CAAC;AAChF,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,SAAS,CAAC,OAAwB;IAChD,IAAI,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;IAClC,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;QACrC,OAAO,IAAI,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;IAC1D,CAAC;IACD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IACvD,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,QAAQ,GAAG,OAAO,CAAC;AACnD,CAAC;AAKD;;;;;GAKG;AACH,MAAM,OAAO,MAAM;IACT,KAAK,GAAG,CAAC,CAAC;IACV,KAAK,GAAG,CAAC,CAAC;IACV,OAAO,GAAG,CAAC,CAAC;IACZ,WAAW,GAAG,CAAC,CAAC;IAChB,GAAG,GAAG,CAAC,CAAC;IAEC,MAAM,CAAe;IACrB,WAAW,CAAS;IACpB,WAAW,CAAS;IACpB,KAAK,CAAoB;IAE1C,YACE,MAAoB,EACpB,WAAmB,EACnB,WAAmB,EACnB,KAAwB;QAExB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED,uEAAuE;IACvE,KAAK,CAAC,GAAW;QACf,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC;QAC1C,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxF,CAAC;IAED;;;;;;OAMG;IACH,IAAI;QACF,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QAChB,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,WAAW;YAAE,OAAO,IAAI,CAAC;QAC/C,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACnC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC;YACvD,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC;gBACxD,OAAO,IAAI,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACtD,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,0EAA0E;IAC1E,OAAO,CAAC,IAAU,EAAE,QAA4B;QAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,WAAW,IAAI,GAAG,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC/E,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC;QACjF,CAAC;QACD,yEAAyE;QACzE,2EAA2E;QAC3E,0EAA0E;QAC1E,iEAAiE;QACjE,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAClC,CAAC;IAED,yEAAyE;IACzE,IAAI,CAAC,IAAU,EAAE,IAAY;QAC3B,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QAChB,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,WAAW;YAAE,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACjE,CAAC;IAEO,UAAU,CAAC,IAAU,EAAE,IAAwB;QACrD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE;gBACpB,QAAQ,EAAE,QAAQ,IAAI,CAAC,KAAK,EAAE;gBAC9B,MAAM,EACJ,gFAAgF;oBAChF,4DAA4D;aAC/D,CAAC,CAAC;QACL,CAAC;QACD,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE;YACpB,MAAM,EAAE,IAAI,CAAC,WAAW;YACxB,IAAI;YACJ,SAAS,EAAE,aAAa,CAAC,IAAI,CAAC,WAAW,CAAC;SAC3C,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;OAOG;IACH,YAAY,CAAC,IAAU,EAAE,IAAY;QACnC,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;YACvC,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,KAAK,EAAE,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC;QAC9E,CAAC;IACH,CAAC;IAED,iCAAiC;IACjC,UAAU,CAAC,IAAU,EAAE,IAAY,EAAE,IAAY;QAC/C,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;YACrC,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;IAED,0EAA0E;IAC1E,WAAW,CAAC,IAAU,EAAE,IAAY;QAClC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACH,WAAW,CAAC,IAAU,EAAE,MAAc;QACpC,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YACtC,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QAC1E,CAAC;IACH,CAAC;CACF;AAED;;;;;;;;GAQG;AACH,SAAS,aAAa,CAAC,MAAc;IACnC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAChE,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC,GAAG,SAAS,CAAC;AACpD,CAAC"}

package/dist/core/engine/channels.d.ts

@@ -0,0 +1,106 @@
+/**
+ * Channels and the two things step 8 and step 9 do with them.
+ *
+ * A channel holds at most one value per bar and `EMIT` is the only way to write
+ * one. One instruction and one flat table cover plots, levels, markers, alert
+ * conditions, alert messages, bar colouring and pane background; a surface is a
+ * declaration in `outputs` that points at a channel, and is not machinery.
+ *
+ * **Publishing and applying are two different steps, and the split is the whole
+ * of what a script may do on a moving bar.** Step 8 writes every channel into
+ * the bar's output column, absence included, so the drawing is recomputed from
+ * scratch on every update and published every time. Step 9 applies the channels
+ * declared `defer` and the pending effects, and only when the bar is confirmed
+ * or `meta.onUnconfirmed` is true: a signal, an alert or an order waits for the
+ * bar to close.
+ *
+ * **A bar that was not decided reads back absent on its deferred channels.**
+ * Step 9 discards them rather than delivering them (5.1, and 12.7's held
+ * marker), and a reader of the columns is where that discarding has to be
+ * visible: a marker whose text stayed in the buffer would be drawn on the
+ * moving bar by whoever read the column, which is the one thing the deferral
+ * exists to prevent. The value is kept rather than erased, because the next
+ * execution of that bar may be the one that confirms it.
+ *
+ * A second write on the same bar replaces the first, so the last write wins and
+ * no surface needs a rule of its own.
+ */
+import type { Span } from '../span/index.js';
+import type { Effect } from './library/index.js';
+import type { Channel } from './types.js';
+import type { Value } from './values/index.js';
+/** A library call with an effect, held until the bar is decided. */
+export interface PendingEffect {
+    /** The index into `lib.functions`, which is what 5.4 says a record holds. */
+    readonly fn: number;
+    readonly name: string;
+    readonly effect: Effect;
+    /** The argument values as they stood when the call executed. */
+    readonly args: readonly Value[];
+    /**
+     * The names those values arrived under, from the engine's own manifest.
+     *
+     * Carried so that step 9 can name an argument without counting one. The
+     * ledger reads an order call by position and has to report it by name, and a
+     * table of names beside the table of positions is the same signature written
+     * out twice.
+     */
+    readonly params: readonly string[];
+    /**
+     * Where the call is written.
+     *
+     * Carried on the record rather than looked up later, because step 9 runs
+     * after the machine has finished and the position of an instruction is
+     * knowable only while it is executing. A refusal that could not name a line
+     * would point a reader at the file and not at the call.
+     */
+    readonly at: Span;
+}
+export declare class Channels {
+    private readonly current;
+    private readonly deferred;
+    /** One column per channel: the value published for each bar. */
+    private readonly columns;
+    /** Whether step 9 applied the deferred channels for each bar. */
+    private readonly decided;
+    private pending;
+    /** Whether any channel at all is deferred, so the common case costs nothing. */
+    private readonly anyDeferred;
+    constructor(channels: readonly Channel[]);
+    count(): number;
+    /** Step 3: every channel and the pending effect list start empty. */
+    clear(): void;
+    /** `EMIT`: the last write on a bar is the one that counts. */
+    write(channel: number, value: Value): void;
+    read(channel: number): Value;
+    /** 5.4: a call with an effect records itself and pushes absent. */
+    defer(record: PendingEffect): void;
+    /** Step 8: the columns, absence included, whatever the bar's state. */
+    publish(bar: number): void;
+    /**
+     * Step 9: the deferred channels and the effects, or neither.
+     *
+     * Returns the effects to apply, and nothing when the bar is still moving. The
+     * consequence is the one `language.md` 7.5 promises: a condition that was
+     * true halfway through a bar and false when it closed never places an order,
+     * because the execution that produced the record was thrown away.
+     */
+    decide(bar: number, apply: boolean): readonly PendingEffect[];
+    /** Whether a channel's value is held back on a bar that is still moving. */
+    isDeferred(channel: number): boolean;
+    /** The value published for one channel on one bar, absent where nothing wrote. */
+    at(channel: number, bar: number): Value;
+    /** One channel's whole column, for a host building a plotted series. */
+    column(channel: number, bars: number): readonly Value[];
+    /** Every channel's value on one bar, which is what a bar's result carries. */
+    row(bar: number): readonly Value[];
+    /**
+     * Whether a channel's value for a bar is one step 9 discarded.
+     *
+     * A channel that is not deferred is never withheld, and a bar step 9 applied
+     * withholds nothing, so this is false for every channel of every confirmed
+     * bar and for every plot column ever.
+     */
+    private withheld;
+}
+//# sourceMappingURL=channels.d.ts.map

package/dist/core/engine/channels.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"channels.d.ts","sourceRoot":"","sources":["../../../src/core/engine/channels.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AACjD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAC1C,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAG/C,oEAAoE;AACpE,MAAM,WAAW,aAAa;IAC5B,6EAA6E;IAC7E,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,gEAAgE;IAChE,QAAQ,CAAC,IAAI,EAAE,SAAS,KAAK,EAAE,CAAC;IAChC;;;;;;;OAOG;IACH,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC;;;;;;;OAOG;IACH,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC;CACnB;AAED,qBAAa,QAAQ;IACnB,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAU;IAClC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAY;IACrC,gEAAgE;IAChE,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAY;IACpC,iEAAiE;IACjE,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAiB;IACzC,OAAO,CAAC,OAAO,CAAuB;IACtC,gFAAgF;IAChF,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAU;gBAE1B,QAAQ,EAAE,SAAS,OAAO,EAAE;IAOxC,KAAK,IAAI,MAAM;IAIf,qEAAqE;IACrE,KAAK,IAAI,IAAI;IAKb,8DAA8D;IAC9D,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI;IAI1C,IAAI,CAAC,OAAO,EAAE,MAAM,GAAG,KAAK;IAI5B,mEAAmE;IACnE,KAAK,CAAC,MAAM,EAAE,aAAa,GAAG,IAAI;IAIlC,uEAAuE;IACvE,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAQ1B;;;;;;;OAOG;IACH,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,SAAS,aAAa,EAAE;IAW7D,4EAA4E;IAC5E,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO;IAIpC,kFAAkF;IAClF,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,KAAK;IAKvC,wEAAwE;IACxE,MAAM,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,KAAK,EAAE;IAUvD,8EAA8E;IAC9E,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS,KAAK,EAAE;IAMlC;;;;;;OAMG;IACH,OAAO,CAAC,QAAQ;CAGjB"}

package/dist/core/engine/channels.js

@@ -0,0 +1,99 @@
+import { ABSENT } from './values/index.js';
+export class Channels {
+    current;
+    deferred;
+    /** One column per channel: the value published for each bar. */
+    columns;
+    /** Whether step 9 applied the deferred channels for each bar. */
+    decided = [];
+    pending = [];
+    /** Whether any channel at all is deferred, so the common case costs nothing. */
+    anyDeferred;
+    constructor(channels) {
+        this.current = new Array(channels.length).fill(ABSENT);
+        this.deferred = channels.map((one) => one.defer);
+        this.anyDeferred = this.deferred.some((one) => one);
+        this.columns = channels.map(() => []);
+    }
+    count() {
+        return this.current.length;
+    }
+    /** Step 3: every channel and the pending effect list start empty. */
+    clear() {
+        this.current.fill(ABSENT);
+        this.pending = [];
+    }
+    /** `EMIT`: the last write on a bar is the one that counts. */
+    write(channel, value) {
+        this.current[channel] = value;
+    }
+    read(channel) {
+        return this.current[channel] ?? ABSENT;
+    }
+    /** 5.4: a call with an effect records itself and pushes absent. */
+    defer(record) {
+        this.pending.push(record);
+    }
+    /** Step 8: the columns, absence included, whatever the bar's state. */
+    publish(bar) {
+        for (let c = 0; c < this.columns.length; c += 1) {
+            const column = this.columns[c];
+            if (column === undefined)
+                continue;
+            column[bar] = this.current[c] ?? ABSENT;
+        }
+    }
+    /**
+     * Step 9: the deferred channels and the effects, or neither.
+     *
+     * Returns the effects to apply, and nothing when the bar is still moving. The
+     * consequence is the one `language.md` 7.5 promises: a condition that was
+     * true halfway through a bar and false when it closed never places an order,
+     * because the execution that produced the record was thrown away.
+     */
+    decide(bar, apply) {
+        this.decided[bar] = apply;
+        if (!apply) {
+            this.pending = [];
+            return [];
+        }
+        const effects = this.pending;
+        this.pending = [];
+        return effects;
+    }
+    /** Whether a channel's value is held back on a bar that is still moving. */
+    isDeferred(channel) {
+        return this.deferred[channel] === true;
+    }
+    /** The value published for one channel on one bar, absent where nothing wrote. */
+    at(channel, bar) {
+        if (this.withheld(channel, bar))
+            return ABSENT;
+        return this.columns[channel]?.[bar] ?? ABSENT;
+    }
+    /** One channel's whole column, for a host building a plotted series. */
+    column(channel, bars) {
+        const held = this.columns[channel] ?? [];
+        const deferred = this.anyDeferred && this.deferred[channel] === true;
+        const out = [];
+        for (let bar = 0; bar < bars; bar += 1) {
+            out.push(deferred && this.decided[bar] !== true ? ABSENT : held[bar] ?? ABSENT);
+        }
+        return out;
+    }
+    /** Every channel's value on one bar, which is what a bar's result carries. */
+    row(bar) {
+        return this.columns.map((column, channel) => this.withheld(channel, bar) ? ABSENT : column[bar] ?? ABSENT);
+    }
+    /**
+     * Whether a channel's value for a bar is one step 9 discarded.
+     *
+     * A channel that is not deferred is never withheld, and a bar step 9 applied
+     * withholds nothing, so this is false for every channel of every confirmed
+     * bar and for every plot column ever.
+     */
+    withheld(channel, bar) {
+        return this.anyDeferred && this.deferred[channel] === true && this.decided[bar] !== true;
+    }
+}
+//# sourceMappingURL=channels.js.map

package/dist/core/engine/channels.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"channels.js","sourceRoot":"","sources":["../../../src/core/engine/channels.ts"],"names":[],"mappings":"AA+BA,OAAO,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AA8B3C,MAAM,OAAO,QAAQ;IACF,OAAO,CAAU;IACjB,QAAQ,CAAY;IACrC,gEAAgE;IAC/C,OAAO,CAAY;IACpC,iEAAiE;IAChD,OAAO,GAAc,EAAE,CAAC;IACjC,OAAO,GAAoB,EAAE,CAAC;IACtC,gFAAgF;IAC/D,WAAW,CAAU;IAEtC,YAAY,QAA4B;QACtC,IAAI,CAAC,OAAO,GAAG,IAAI,KAAK,CAAQ,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9D,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACjD,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QACpD,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IACxC,CAAC;IAED,KAAK;QACH,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC7B,CAAC;IAED,qEAAqE;IACrE,KAAK;QACH,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC1B,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;IACpB,CAAC;IAED,8DAA8D;IAC9D,KAAK,CAAC,OAAe,EAAE,KAAY;QACjC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC;IAChC,CAAC;IAED,IAAI,CAAC,OAAe;QAClB,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC;IACzC,CAAC;IAED,mEAAmE;IACnE,KAAK,CAAC,MAAqB;QACzB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5B,CAAC;IAED,uEAAuE;IACvE,OAAO,CAAC,GAAW;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAChD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,MAAM,KAAK,SAAS;gBAAE,SAAS;YACnC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC;QAC1C,CAAC;IACH,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,GAAW,EAAE,KAAc;QAChC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QAC1B,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;YAClB,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,4EAA4E;IAC5E,UAAU,CAAC,OAAe;QACxB,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,IAAI,CAAC;IACzC,CAAC;IAED,kFAAkF;IAClF,EAAE,CAAC,OAAe,EAAE,GAAW;QAC7B,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC;YAAE,OAAO,MAAM,CAAC;QAC/C,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC;IAChD,CAAC;IAED,wEAAwE;IACxE,MAAM,CAAC,OAAe,EAAE,IAAY;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,IAAI,CAAC;QACrE,MAAM,GAAG,GAAY,EAAE,CAAC;QACxB,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;YACvC,GAAG,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC;QAClF,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,8EAA8E;IAC9E,GAAG,CAAC,GAAW;QACb,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,CAC1C,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,MAAM,CAC7D,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACK,QAAQ,CAAC,OAAe,EAAE,GAAW;QAC3C,OAAO,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC;IAC3F,CAAC;CACF"}

package/dist/core/engine/drawings.d.ts

@@ -0,0 +1,64 @@
+/**
+ * The drawing objects a host reads, as facts rather than as heap contents.
+ *
+ * The heap is the engine's own representation: a polyline's path is a
+ * reference into it, a handle is an integer, and neither means anything to
+ * whoever is drawing. This is the door between the two. A host is handed one
+ * record per live object, in creation order, with every value resolved, and it
+ * never dereferences anything.
+ *
+ * **An anchor is a time and a price.** That is the whole of where an object
+ * sits, and it is why an object survives what happens to the view: a zoom
+ * changes pixels and nothing here, loading more history renumbers every bar and
+ * nothing here, and an anchor past the newest bar is carried through as it was
+ * written so a projection reaches into the margin instead of being clamped to
+ * the last bar. Turning either number into a coordinate is the host's job and
+ * needs the host's scales, which is exactly why the engine does not attempt it.
+ *
+ * **Absence is a gap.** An anchor with no time or no price, and a style value a
+ * script left absent, are handed over absent. `language.md` 6.7 fixes what that
+ * means on a drawing surface: nothing is drawn there, and nothing is invented
+ * to fill it.
+ *
+ * **A host reads this after every execution, re-executions of a moving bar
+ * included.** The set is rebuilt from what the bar left behind, which the
+ * rollback has already restored, so a host that draws whatever it is given here
+ * needs no rule of its own for a chart that ticks.
+ */
+import type { DrawingObject, Heap, Value } from './values/index.js';
+export type DrawingKind = DrawingObject['kind'];
+/** Where one point of an object sits, in the two units a chart never loses. */
+export interface Anchor {
+    readonly time: number | null;
+    readonly price: number | null;
+}
+/** One live object, as the surface holding it needs to see it. */
+export interface Drawing {
+    /** Stable while the object lives, so a host can hold its own view of it. */
+    readonly id: number;
+    readonly kind: DrawingKind;
+    /**
+     * The object's points, in order.
+     *
+     * A line and a box have two, a label has one, and a polyline has as many as
+     * its path. A host that knows the kind knows what the points mean, and one
+     * that does not can still draw the extent of it.
+     */
+    readonly anchors: readonly Anchor[];
+    /**
+     * Everything that is not a point: colours, text, width, line style, the
+     * extend flags, the fill opacity and the tooltip, under the names
+     * `stdlib.md` 14.4 gives them.
+     */
+    readonly style: Readonly<Record<string, Value>>;
+}
+/**
+ * Every object the script holds, oldest first.
+ *
+ * Creation order rather than any other, because it is the order the script
+ * wrote and therefore the order a reader expects one drawing to sit over
+ * another. Deleted objects are not here at all: an object lives until the
+ * script deletes it, and then it is gone rather than hidden.
+ */
+export declare function drawingsIn(heap: Heap): readonly Drawing[];
+//# sourceMappingURL=drawings.d.ts.map

package/dist/core/engine/drawings.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"drawings.d.ts","sourceRoot":"","sources":["../../../src/core/engine/drawings.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,OAAO,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAGpE,MAAM,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;AAEhD,+EAA+E;AAC/E,MAAM,WAAW,MAAM;IACrB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;CAC/B;AAED,kEAAkE;AAClE,MAAM,WAAW,OAAO;IACtB,4EAA4E;IAC5E,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAC3B;;;;;;OAMG;IACH,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC;;;;OAIG;IACH,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;CACjD;AAsDD;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,IAAI,GAAG,SAAS,OAAO,EAAE,CAOzD"}

package/dist/core/engine/drawings.js

@@ -0,0 +1,67 @@
+import { isNumber } from './values/index.js';
+/** The property pairs each kind anchors itself with, in order. */
+const ANCHORS = {
+    line: [
+        ['t1', 'p1'],
+        ['t2', 'p2'],
+    ],
+    box: [
+        ['t1', 'p1'],
+        ['t2', 'p2'],
+    ],
+    label: [['t', 'p']],
+    polyline: [],
+};
+function numberOf(value) {
+    return value !== undefined && isNumber(value) ? value : null;
+}
+/** A polyline's path, from the two arrays the object copied at the call. */
+function pathOf(heap, object) {
+    const times = heap.deref(object.props['times'] ?? null);
+    const prices = heap.deref(object.props['prices'] ?? null);
+    const timeItems = times !== undefined && times.kind === 'array' ? times.items : [];
+    const priceItems = prices !== undefined && prices.kind === 'array' ? prices.items : [];
+    const out = [];
+    for (let i = 0; i < Math.max(timeItems.length, priceItems.length); i += 1) {
+        out.push({ time: numberOf(timeItems[i]), price: numberOf(priceItems[i]) });
+    }
+    return out;
+}
+function anchorsOf(heap, object) {
+    if (object.kind === 'polyline')
+        return pathOf(heap, object);
+    return ANCHORS[object.kind].map(([time, price]) => ({
+        time: numberOf(object.props[time]),
+        price: numberOf(object.props[price]),
+    }));
+}
+function styleOf(object) {
+    const anchored = new Set(['times', 'prices']);
+    for (const [time, price] of ANCHORS[object.kind]) {
+        anchored.add(time);
+        anchored.add(price);
+    }
+    const out = {};
+    for (const key of Object.keys(object.props)) {
+        if (!anchored.has(key))
+            out[key] = object.props[key] ?? null;
+    }
+    return out;
+}
+/**
+ * Every object the script holds, oldest first.
+ *
+ * Creation order rather than any other, because it is the order the script
+ * wrote and therefore the order a reader expects one drawing to sit over
+ * another. Deleted objects are not here at all: an object lives until the
+ * script deletes it, and then it is gone rather than hidden.
+ */
+export function drawingsIn(heap) {
+    return heap.drawings().map(({ id, object }) => ({
+        id,
+        kind: object.kind,
+        anchors: anchorsOf(heap, object),
+        style: styleOf(object),
+    }));
+}
+//# sourceMappingURL=drawings.js.map

package/dist/core/engine/drawings.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"drawings.js","sourceRoot":"","sources":["../../../src/core/engine/drawings.ts"],"names":[],"mappings":"AA4BA,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AA+B7C,kEAAkE;AAClE,MAAM,OAAO,GAA0E;IACrF,IAAI,EAAE;QACJ,CAAC,IAAI,EAAE,IAAI,CAAC;QACZ,CAAC,IAAI,EAAE,IAAI,CAAC;KACb;IACD,GAAG,EAAE;QACH,CAAC,IAAI,EAAE,IAAI,CAAC;QACZ,CAAC,IAAI,EAAE,IAAI,CAAC;KACb;IACD,KAAK,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACnB,QAAQ,EAAE,EAAE;CACb,CAAC;AAEF,SAAS,QAAQ,CAAC,KAAwB;IACxC,OAAO,KAAK,KAAK,SAAS,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;AAC/D,CAAC;AAED,4EAA4E;AAC5E,SAAS,MAAM,CAAC,IAAU,EAAE,MAAqB;IAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,CAAC;IACxD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,CAAC;IAC1D,MAAM,SAAS,GAAG,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IACnF,MAAM,UAAU,GAAG,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IACvF,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1E,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC7E,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,SAAS,CAAC,IAAU,EAAE,MAAqB;IAClD,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU;QAAE,OAAO,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC5D,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;QAClD,IAAI,EAAE,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAClC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;KACrC,CAAC,CAAC,CAAC;AACN,CAAC;AAED,SAAS,OAAO,CAAC,MAAqB;IACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAS,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC;IACtD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QACjD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnB,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACtB,CAAC;IACD,MAAM,GAAG,GAA0B,EAAE,CAAC;IACtC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;QAC5C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;IAC/D,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,UAAU,CAAC,IAAU;IACnC,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9C,EAAE;QACF,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,OAAO,EAAE,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC;QAChC,KAAK,EAAE,OAAO,CAAC,MAAM,CAAC;KACvB,CAAC,CAAC,CAAC;AACN,CAAC"}