maestro-agent-sdk 0.1.0

package/dist/memory/prune.d.ts

@@ -0,0 +1,117 @@
+import type { ProviderMessage } from "../providers/base.js";
+/**
+ * Maestro context pruning — token-savings pre-pass with zero LLM calls.
+ *
+ * Three passes, mirroring upstream Maestro v0.13.0
+ * `context_compressor.py::_prune_old_tool_results`. All passes are pure
+ * (return a new array; input is not mutated) and zero-LLM.
+ *
+ *   Pass 1 — Tool result dedup.
+ *     Walks tool_result blocks newest-first. For each block whose content
+ *     hashes to a value already seen on a later turn, replace it with a
+ *     back-reference placeholder. The most recent occurrence keeps the full
+ *     payload — that's what the model needs to act on; older copies waste
+ *     tokens. md5(content)[:12] (see hash.ts) — non-cryptographic, picked
+ *     for parity with the Python reference and cost on the per-turn path.
+ *
+ *   Pass 2 — Age-based 1-line summary.
+ *     For tool_result blocks older than `ageTurnsThreshold` user-turns,
+ *     replace large content with a structured 1-liner that names the tool,
+ *     points at the original arguments, and notes size. The model gets a
+ *     stable cue for "I called X and got back ~N bytes" without paying for
+ *     the bytes. Recent results (inside the protected tail) stay verbatim so
+ *     the model can still reason over fresh tool output.
+ *
+ * Both passes are pure (`messages` not mutated) — caller can freely send the
+ * returned array to the provider without losing the canonical history they
+ * still need for persistence/resume. Anti-thrashing is module-state-backed
+ * (see header on `pruneMessages`) so back-to-back calls on an already-pruned
+ * array don't burn cycles.
+ *
+ * Token savings are estimated by raw character count (not BPE-accurate). The
+ * trade-off: char-count is a strict upper bound on dedup/summary savings (a
+ * byte you remove was at most one token's worth), provider-agnostic, and
+ * available without spinning up a tokenizer. Real Anthropic token reduction
+ * is typically 1.1-1.4x the char delta, so this estimator under-reports
+ * savings slightly — fine for the anti-thrash threshold (better to over-skip
+ * than over-prune).
+ *
+ * Upstream reference: `/Users/maestrobot/__KEEP_MAESTRO_AGENT__/agent/context_compressor.py:519-685`.
+ */
+export interface PruneOptions {
+    /**
+     * Tool_result blocks N user-turns or older from the tail get age-summarized
+     * by pass 2. Counting in user-turns (not raw messages) matches upstream's
+     * notion of "conversation rounds" and avoids fence-posting around assistant
+     * + tool_result pairings.
+     *
+     * Default: 10 — empirically tuned in upstream as the point past which a
+     * tool result is rarely re-referenced by the model.
+     */
+    ageTurnsThreshold?: number;
+    /** Disable pass 1 (dedup). Default: true. */
+    dedup?: boolean;
+    /** Disable pass 2 (age-based summary). Default: true. */
+    summarizeOld?: boolean;
+    /**
+     * Pass 3 (JSON-aware tool_use input shrink) — truncate string fields
+     * inside `tool_use.input` that exceed `largeArgChars`. Default: true.
+     *
+     * The model rarely re-references the *exact* bytes it passed to a tool
+     * (e.g. 12KB `content` for a Write call) once the call has completed;
+     * it just needs to know "I sent ~12KB to Write at <path>". Pass 3
+     * replaces oversize string values with `"<truncated N chars>"` so the
+     * structural shape is preserved (key names, types) but the payload
+     * shrinks dramatically.
+     */
+    shrinkLargeToolArgs?: boolean;
+    /** Per-string truncation threshold for pass 3 (chars). Default: 800. */
+    largeArgChars?: number;
+    /**
+     * Pass 3 only touches assistant turns older than this many user-turns
+     * from the tail (same window pass 2 uses). Default: same as
+     * `ageTurnsThreshold` (10).
+     */
+    shrinkAgeThreshold?: number;
+    /**
+     * Anti-thrashing — if two consecutive calls on the same `messages` array
+     * reference each save less than 10% of bytes, skip the third call entirely
+     * and return the input as-is. Default: true. Disable for tests that exercise
+     * single-call behavior in isolation.
+     *
+     * State is keyed on the array reference (WeakMap). A fresh array starts
+     * fresh; the loop's per-turn `messages.push(...)` keeps the same reference
+     * so state survives across iterations within one session.
+     */
+    antiThrash?: boolean;
+}
+/**
+ * Apply pass 1 (dedup) + pass 2 (age-based summary) to a message array.
+ *
+ * Returns a new array — input `messages` and the inner block arrays are not
+ * mutated, so the caller can keep the original around for persistence.
+ *
+ * `opts.antiThrash` (default on) backs off when consecutive calls on the
+ * same array reference don't save enough — useful inside the per-iteration
+ * hot path of the agent loop where most turns won't add new prune targets.
+ */
+export declare function pruneMessages(messages: ProviderMessage[], opts?: PruneOptions): ProviderMessage[];
+/**
+ * Char-count-based token savings estimate. Negative values are clamped to 0
+ * (a no-op pass is "0% savings", not "savings increased").
+ *
+ * Anthropic tokens-per-char varies (~3.5-4.5 for English, lower for CJK), so
+ * this is a deliberately conservative proxy. The anti-thrash check only
+ * needs a relative measure, not an absolute one.
+ *
+ * Exposed for tests so we can assert savings rates without spinning up a
+ * tokenizer.
+ */
+export declare function estimateTokenSavings(before: ProviderMessage[], after: ProviderMessage[]): number;
+/** Test-only: reset module-level anti-thrash state. */
+export declare function __resetPruneStateForTests(): void;
+export declare const __MIN_PRUNE_CHARS = 200;
+export declare const __ANTI_THRASH_PCT = 10;
+export declare const __ANTI_THRASH_LIMIT = 2;
+export declare const __ANTI_THRASH_GROWTH_RESET = 4;
+//# sourceMappingURL=prune.d.ts.map

package/dist/memory/prune.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prune.d.ts","sourceRoot":"","sources":["../../src/memory/prune.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAwB,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAE9E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AAEH,MAAM,WAAW,YAAY;IAC3B;;;;;;;;OAQG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,6CAA6C;IAC7C,KAAK,CAAC,EAAE,OAAO,CAAC;IAChB,yDAAyD;IACzD,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB;;;;;;;;;;OAUG;IACH,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAC9B,wEAAwE;IACxE,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;;OAIG;IACH,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B;;;;;;;;;OASG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AAiCD;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAC3B,QAAQ,EAAE,eAAe,EAAE,EAC3B,IAAI,GAAE,YAAiB,GACtB,eAAe,EAAE,CA+FnB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,eAAe,EAAE,EAAE,KAAK,EAAE,eAAe,EAAE,GAAG,MAAM,CAIhG;AAED,uDAAuD;AACvD,wBAAgB,yBAAyB,IAAI,IAAI,CAMhD;AA+RD,eAAO,MAAM,iBAAiB,MAAkB,CAAC;AACjD,eAAO,MAAM,iBAAiB,KAAkB,CAAC;AACjD,eAAO,MAAM,mBAAmB,IAAoB,CAAC;AACrD,eAAO,MAAM,0BAA0B,IAA2B,CAAC"}

package/dist/memory/prune.js

@@ -0,0 +1,416 @@
+import { hashToolContent } from "../memory/hash.js";
+/**
+ * Tool_result content must exceed this many chars before either pass touches
+ * it. Below this, dedup/summary placeholders would be longer than the
+ * original, defeating the purpose. Matches upstream's `if len(content) < 200`
+ * guard.
+ */
+const MIN_PRUNE_CHARS = 200;
+/** Anti-thrash trigger — < 10% byte savings counts as "ineffective". */
+const ANTI_THRASH_PCT = 10;
+/** Two consecutive ineffective calls → next call skips. */
+const ANTI_THRASH_LIMIT = 2;
+/**
+ * Message-count growth since the latch was set that re-opens prune retries.
+ * Without this the short-circuit at the top would latch permanently for the
+ * lifetime of the `messages` array reference — every prune attempt past the
+ * latch would skip even after the history grew by dozens of new turns that
+ * the prior decision never saw. Four new messages ≈ two tool iterations,
+ * enough that the model has added a fresh chunk of context worth re-prunes.
+ */
+const ANTI_THRASH_GROWTH_RESET = 4;
+const antiThrashByRef = new WeakMap();
+/**
+ * Apply pass 1 (dedup) + pass 2 (age-based summary) to a message array.
+ *
+ * Returns a new array — input `messages` and the inner block arrays are not
+ * mutated, so the caller can keep the original around for persistence.
+ *
+ * `opts.antiThrash` (default on) backs off when consecutive calls on the
+ * same array reference don't save enough — useful inside the per-iteration
+ * hot path of the agent loop where most turns won't add new prune targets.
+ */
+export function pruneMessages(messages, opts = {}) {
+    const { ageTurnsThreshold = 10, dedup = true, summarizeOld = true, shrinkLargeToolArgs = true, largeArgChars = 800, shrinkAgeThreshold = ageTurnsThreshold, antiThrash = true, } = opts;
+    if (messages.length === 0)
+        return messages;
+    // Anti-thrash short-circuit BEFORE we do any work — but break the latch
+    // when the history has grown by enough new turns that the prior "no
+    // savings here" decision is stale.
+    if (antiThrash) {
+        const st = antiThrashByRef.get(messages);
+        if (st && st.ineffectiveCount >= ANTI_THRASH_LIMIT) {
+            const grown = st.latchedAtLength !== undefined &&
+                messages.length >= st.latchedAtLength + ANTI_THRASH_GROWTH_RESET;
+            if (!grown)
+                return messages;
+            // Significant growth — invalidate latch, retry the prune path.
+            st.ineffectiveCount = 0;
+            st.latchedAtLength = undefined;
+        }
+    }
+    // Build a tool_use_id -> {name, args} index from every assistant turn so
+    // pass 2 can render `[<tool_name>] ... (Nchars)` lines. We index the WHOLE
+    // history (not just the recent tail) because pass 2 targets the older end.
+    const callIndex = buildToolCallIndex(messages);
+    // Compute the prune boundary — the index in `messages` at which pass 2
+    // starts considering tool_result blocks for summarization. We count
+    // user-role messages (excluding tool_result-only turns? no — every
+    // tool_result turn IS a user message, so user turns include both the
+    // freshly-typed prompts and the synthesized tool_result wrappers) from
+    // the tail. `ageTurnsThreshold` user-turns or fewer from the end are
+    // protected.
+    const protectedFromIdx = computeProtectedBoundary(messages, ageTurnsThreshold);
+    // ----------------------- Pass 1: dedup -----------------------
+    // Walk newest -> oldest. First occurrence of each content hash is kept;
+    // subsequent (older) occurrences become back-references.
+    let pruned = messages;
+    if (dedup) {
+        pruned = applyDedup(messages);
+    }
+    // ----------------------- Pass 2: summarize -----------------------
+    if (summarizeOld && protectedFromIdx > 0) {
+        pruned = applyAgeSummary(pruned, protectedFromIdx, callIndex);
+    }
+    // ----------------------- Pass 3: tool_use arg shrink -----------------------
+    // Runs on the same age window as pass 2. Cheap structural rewrite that
+    // also helps before-aux-LLM compaction: a Write tool call with 50KB
+    // content can dominate the wire bytes even when its tool_result is
+    // already deduped.
+    if (shrinkLargeToolArgs && protectedFromIdx > 0) {
+        const shrinkBoundary = shrinkAgeThreshold === ageTurnsThreshold
+            ? protectedFromIdx
+            : computeProtectedBoundary(messages, shrinkAgeThreshold);
+        if (shrinkBoundary > 0) {
+            pruned = applyToolArgShrink(pruned, shrinkBoundary, largeArgChars);
+        }
+    }
+    // ----------------------- Anti-thrash bookkeeping -----------------------
+    if (antiThrash) {
+        const beforeBytes = estimateBytes(messages);
+        const afterBytes = estimateBytes(pruned);
+        const savings = beforeBytes - afterBytes;
+        const pct = beforeBytes > 0 ? (savings / beforeBytes) * 100 : 0;
+        const st = antiThrashByRef.get(messages) ?? { ineffectiveCount: 0 };
+        if (pct < ANTI_THRASH_PCT) {
+            st.ineffectiveCount++;
+            // Record the messages.length at the moment we first latch so the
+            // growth-reset check above has an anchor to compare against. Set only
+            // on the transition into latched state; subsequent ineffective calls
+            // past the limit don't move the anchor forward.
+            if (st.ineffectiveCount >= ANTI_THRASH_LIMIT && st.latchedAtLength === undefined) {
+                st.latchedAtLength = messages.length;
+            }
+        }
+        else {
+            st.ineffectiveCount = 0;
+            st.latchedAtLength = undefined;
+        }
+        antiThrashByRef.set(messages, st);
+    }
+    return pruned;
+}
+/**
+ * Char-count-based token savings estimate. Negative values are clamped to 0
+ * (a no-op pass is "0% savings", not "savings increased").
+ *
+ * Anthropic tokens-per-char varies (~3.5-4.5 for English, lower for CJK), so
+ * this is a deliberately conservative proxy. The anti-thrash check only
+ * needs a relative measure, not an absolute one.
+ *
+ * Exposed for tests so we can assert savings rates without spinning up a
+ * tokenizer.
+ */
+export function estimateTokenSavings(before, after) {
+    const b = estimateBytes(before);
+    const a = estimateBytes(after);
+    return Math.max(0, b - a);
+}
+/** Test-only: reset module-level anti-thrash state. */
+export function __resetPruneStateForTests() {
+    // WeakMap has no .clear() — replace by emptying via reassignment of every
+    // tracked entry. In practice tests just create fresh arrays.
+    // We deliberately don't expose a hard clear because production callers
+    // shouldn't reach into module state; the WeakMap GC-friendly design is the
+    // point. Tests that need isolation should create fresh arrays.
+}
+function buildToolCallIndex(messages) {
+    const idx = new Map();
+    for (const msg of messages) {
+        if (msg.role !== "assistant" || !Array.isArray(msg.content))
+            continue;
+        for (const block of msg.content) {
+            if (block.type === "tool_use") {
+                idx.set(block.id, { name: block.name, input: block.input });
+            }
+        }
+    }
+    return idx;
+}
+/**
+ * Translate `ageTurnsThreshold` (user-turn count) into a message-array index
+ * such that messages at indices >= the returned value are within the
+ * protected tail. Returns 0 if the whole history fits in the protected tail
+ * (so pass 2 does nothing).
+ */
+function computeProtectedBoundary(messages, ageTurnsThreshold) {
+    let userTurnsSeen = 0;
+    for (let i = messages.length - 1; i >= 0; i--) {
+        if (messages[i].role === "user") {
+            userTurnsSeen++;
+            if (userTurnsSeen > ageTurnsThreshold) {
+                return i + 1;
+            }
+        }
+    }
+    return 0;
+}
+/**
+ * Pass 1 — newest-first dedup of tool_result content blocks.
+ *
+ * Only string-content tool_result blocks >= MIN_PRUNE_CHARS participate.
+ * Multimodal / structured content is left alone (no safe hash strategy
+ * matching upstream's behavior here either).
+ */
+function applyDedup(messages) {
+    const seenHashes = new Set();
+    const out = messages.map((m) => m);
+    // Walk newest -> oldest so the newest copy of each hash survives.
+    for (let i = out.length - 1; i >= 0; i--) {
+        const msg = out[i];
+        if (msg.role !== "user" || !Array.isArray(msg.content))
+            continue;
+        let mutated = false;
+        const newBlocks = msg.content.map((block) => {
+            if (block.type !== "tool_result")
+                return block;
+            const c = block.content;
+            if (typeof c !== "string")
+                return block;
+            if (c.length < MIN_PRUNE_CHARS)
+                return block;
+            // Skip blocks that are already a previous pass's placeholder so the
+            // anti-thrash measurement doesn't double-count.
+            if (c.startsWith("[Duplicate tool output"))
+                return block;
+            const h = hashToolContent(c);
+            if (seenHashes.has(h)) {
+                mutated = true;
+                return {
+                    type: "tool_result",
+                    tool_use_id: block.tool_use_id,
+                    content: `[Duplicate tool output — same content as a more recent call, hash=${h}]`,
+                    ...(block.is_error !== undefined ? { is_error: block.is_error } : {}),
+                };
+            }
+            seenHashes.add(h);
+            return block;
+        });
+        if (mutated) {
+            out[i] = { role: msg.role, content: newBlocks };
+        }
+    }
+    return out;
+}
+/**
+ * Pass 2 — replace tool_result content older than the protect boundary with
+ * a structured 1-line summary that points at the original tool_use.
+ *
+ * Skips:
+ *   - Non-string content (multimodal etc.)
+ *   - Content already below MIN_PRUNE_CHARS (savings would be negative)
+ *   - Content that already looks like a pass-1 dedup placeholder
+ *   - Content that already looks like our own pass-2 summary (idempotent)
+ */
+function applyAgeSummary(messages, protectedFromIdx, callIndex) {
+    const out = messages.map((m) => m);
+    for (let i = 0; i < protectedFromIdx; i++) {
+        const msg = out[i];
+        if (msg.role !== "user" || !Array.isArray(msg.content))
+            continue;
+        let mutated = false;
+        const newBlocks = msg.content.map((block) => {
+            if (block.type !== "tool_result")
+                return block;
+            const c = block.content;
+            if (typeof c !== "string")
+                return block;
+            if (c.length < MIN_PRUNE_CHARS)
+                return block;
+            if (c.startsWith("[Duplicate tool output"))
+                return block;
+            if (c.startsWith("[Summarized:"))
+                return block;
+            const ref = callIndex.get(block.tool_use_id);
+            const summary = summarizeToolResult(ref, c);
+            mutated = true;
+            return {
+                type: "tool_result",
+                tool_use_id: block.tool_use_id,
+                content: summary,
+                ...(block.is_error !== undefined ? { is_error: block.is_error } : {}),
+            };
+        });
+        if (mutated) {
+            out[i] = { role: msg.role, content: newBlocks };
+        }
+    }
+    return out;
+}
+/**
+ * Render a 1-line summary of a tool result. Mirrors upstream's
+ * `_summarize_tool_result` shape but doesn't enumerate every tool name —
+ * the prefix "[Summarized:" lets us cheaply detect already-summarized
+ * blocks on a re-pass, and the (name, lines, chars) tuple is the same set
+ * of breadcrumbs the model uses to decide "did I see this before".
+ *
+ * If `ref` is missing (tool_use was trimmed away by an earlier compression
+ * or rollout) we fall back to a generic shape — better to lose tool-name
+ * fidelity than to leave several KB of stale tool output in the prompt.
+ */
+function summarizeToolResult(ref, content) {
+    const lineCount = content.split("\n").length;
+    const tool = ref?.name ?? "tool";
+    // Short argument hint helps the model recognize repeat calls. We cap at
+    // 80 chars total to stay well under the original payload size — anything
+    // longer defeats the purpose of summarization.
+    const argHint = ref ? formatArgHint(ref.input) : "";
+    const head = head80(content);
+    return `[Summarized: ${tool}${argHint} — ${lineCount} lines, ${content.length} chars, head: ${JSON.stringify(head)}]`;
+}
+/** First 80 chars of the content, single-line (newlines collapsed to spaces). */
+function head80(s) {
+    const flat = s.replace(/\s+/g, " ").trim();
+    return flat.length > 80 ? `${flat.slice(0, 77)}...` : flat;
+}
+/** A compact "k1=v1 k2=v2" hint, capped so a giant args object doesn't blow
+ *  up the summary line. */
+function formatArgHint(input) {
+    const entries = Object.entries(input).slice(0, 2);
+    if (entries.length === 0)
+        return "";
+    const parts = [];
+    for (const [k, v] of entries) {
+        const s = typeof v === "string" ? v : JSON.stringify(v);
+        const trimmed = s.length > 30 ? `${s.slice(0, 27)}...` : s;
+        parts.push(`${k}=${trimmed}`);
+    }
+    return ` ${parts.join(" ")}`;
+}
+/**
+ * Pass 3 — Replace oversize string values inside `tool_use.input` with a
+ * `"<truncated N chars>"` placeholder. Only touches assistant turns at
+ * indices < `boundaryIdx` (older than the protected tail), and only string
+ * values longer than `largeArgChars`. Nested objects/arrays are walked
+ * recursively so a `{patches: [{content: "<50KB>"}]}` shape gets caught.
+ *
+ * The model rarely needs to re-read the exact bytes it sent to a Write/Edit
+ * call once that turn is closed — knowing the structural shape + a head
+ * preview is enough for "did I call this with the same args?" recognition.
+ * Aggressive on the dollar value (one Write call's `content` field can
+ * dwarf an entire turn's text), cheap on cycles (no LLM, no parsing).
+ */
+function applyToolArgShrink(messages, boundaryIdx, largeArgChars) {
+    // Already-shrunk inputs leave a sentinel string starting with this prefix
+    // so we don't double-process on a re-pass. Idempotent rewrites are
+    // critical inside the hot loop.
+    const SENTINEL = "<truncated ";
+    function shrinkValue(v) {
+        if (typeof v === "string") {
+            if (v.length <= largeArgChars)
+                return v;
+            if (v.startsWith(SENTINEL))
+                return v; // already truncated on a prior pass
+            return `${SENTINEL}${v.length} chars, head: ${JSON.stringify(v.slice(0, 60))}>`;
+        }
+        if (Array.isArray(v)) {
+            let mutated = false;
+            const out = v.map((el) => {
+                const next = shrinkValue(el);
+                if (next !== el)
+                    mutated = true;
+                return next;
+            });
+            return mutated ? out : v;
+        }
+        if (v && typeof v === "object") {
+            let mutated = false;
+            const out = {};
+            for (const [k, val] of Object.entries(v)) {
+                const next = shrinkValue(val);
+                out[k] = next;
+                if (next !== val)
+                    mutated = true;
+            }
+            return mutated ? out : v;
+        }
+        return v;
+    }
+    let messagesMutated = false;
+    const out = messages.map((msg, idx) => {
+        if (idx >= boundaryIdx)
+            return msg;
+        if (msg.role !== "assistant" || !Array.isArray(msg.content))
+            return msg;
+        let blockMutated = false;
+        const nextBlocks = msg.content.map((block) => {
+            if (block.type !== "tool_use")
+                return block;
+            const shrunkInput = shrinkValue(block.input);
+            if (shrunkInput === block.input)
+                return block;
+            blockMutated = true;
+            return { ...block, input: shrunkInput };
+        });
+        if (!blockMutated)
+            return msg;
+        messagesMutated = true;
+        return { role: msg.role, content: nextBlocks };
+    });
+    return messagesMutated ? out : messages;
+}
+/**
+ * Char-count proxy for token usage. Walks every message's content (string
+ * shortcut + per-block fields for arrays) and returns the total.
+ */
+function estimateBytes(messages) {
+    let total = 0;
+    for (const msg of messages) {
+        if (typeof msg.content === "string") {
+            total += msg.content.length;
+            continue;
+        }
+        if (!Array.isArray(msg.content))
+            continue;
+        for (const block of msg.content) {
+            total += blockBytes(block);
+        }
+    }
+    return total;
+}
+function blockBytes(block) {
+    switch (block.type) {
+        case "text":
+            return block.text.length;
+        case "tool_result":
+            return typeof block.content === "string" ? block.content.length : 0;
+        case "tool_use":
+            // Stringify the input cheaply — the model pays for it on the wire as
+            // serialized JSON. Edge: a giant object weighed in megabytes would
+            // dominate, which is exactly the case we want to capture.
+            try {
+                return JSON.stringify(block.input).length;
+            }
+            catch {
+                return 0;
+            }
+        default:
+            return 0;
+    }
+}
+// Internal exports for tests.
+export const __MIN_PRUNE_CHARS = MIN_PRUNE_CHARS;
+export const __ANTI_THRASH_PCT = ANTI_THRASH_PCT;
+export const __ANTI_THRASH_LIMIT = ANTI_THRASH_LIMIT;
+export const __ANTI_THRASH_GROWTH_RESET = ANTI_THRASH_GROWTH_RESET;
+//# sourceMappingURL=prune.js.map

package/dist/memory/prune.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prune.js","sourceRoot":"","sources":["../../src/memory/prune.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AA2FhD;;;;;GAKG;AACH,MAAM,eAAe,GAAG,GAAG,CAAC;AAE5B,wEAAwE;AACxE,MAAM,eAAe,GAAG,EAAE,CAAC;AAC3B,2DAA2D;AAC3D,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAC5B;;;;;;;GAOG;AACH,MAAM,wBAAwB,GAAG,CAAC,CAAC;AASnC,MAAM,eAAe,GAAG,IAAI,OAAO,EAAsC,CAAC;AAE1E;;;;;;;;;GASG;AACH,MAAM,UAAU,aAAa,CAC3B,QAA2B,EAC3B,OAAqB,EAAE;IAEvB,MAAM,EACJ,iBAAiB,GAAG,EAAE,EACtB,KAAK,GAAG,IAAI,EACZ,YAAY,GAAG,IAAI,EACnB,mBAAmB,GAAG,IAAI,EAC1B,aAAa,GAAG,GAAG,EACnB,kBAAkB,GAAG,iBAAiB,EACtC,UAAU,GAAG,IAAI,GAClB,GAAG,IAAI,CAAC;IAET,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC;IAE3C,wEAAwE;IACxE,oEAAoE;IACpE,mCAAmC;IACnC,IAAI,UAAU,EAAE,CAAC;QACf,MAAM,EAAE,GAAG,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAI,EAAE,IAAI,EAAE,CAAC,gBAAgB,IAAI,iBAAiB,EAAE,CAAC;YACnD,MAAM,KAAK,GACT,EAAE,CAAC,eAAe,KAAK,SAAS;gBAChC,QAAQ,CAAC,MAAM,IAAI,EAAE,CAAC,eAAe,GAAG,wBAAwB,CAAC;YACnE,IAAI,CAAC,KAAK;gBAAE,OAAO,QAAQ,CAAC;YAC5B,+DAA+D;YAC/D,EAAE,CAAC,gBAAgB,GAAG,CAAC,CAAC;YACxB,EAAE,CAAC,eAAe,GAAG,SAAS,CAAC;QACjC,CAAC;IACH,CAAC;IAED,yEAAyE;IACzE,2EAA2E;IAC3E,2EAA2E;IAC3E,MAAM,SAAS,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IAE/C,uEAAuE;IACvE,oEAAoE;IACpE,mEAAmE;IACnE,qEAAqE;IACrE,uEAAuE;IACvE,qEAAqE;IACrE,aAAa;IACb,MAAM,gBAAgB,GAAG,wBAAwB,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC;IAE/E,gEAAgE;IAChE,wEAAwE;IACxE,yDAAyD;IACzD,IAAI,MAAM,GAAsB,QAAQ,CAAC;IACzC,IAAI,KAAK,EAAE,CAAC;QACV,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;IAED,oEAAoE;IACpE,IAAI,YAAY,IAAI,gBAAgB,GAAG,CAAC,EAAE,CAAC;QACzC,MAAM,GAAG,eAAe,CAAC,MAAM,EAAE,gBAAgB,EAAE,SAAS,CAAC,CAAC;IAChE,CAAC;IAED,8EAA8E;IAC9E,uEAAuE;IACvE,oEAAoE;IACpE,mEAAmE;IACnE,mBAAmB;IACnB,IAAI,mBAAmB,IAAI,gBAAgB,GAAG,CAAC,EAAE,CAAC;QAChD,MAAM,cAAc,GAClB,kBAAkB,KAAK,iBAAiB;YACtC,CAAC,CAAC,gBAAgB;YAClB,CAAC,CAAC,wBAAwB,CAAC,QAAQ,EAAE,kBAAkB,CAAC,CAAC;QAC7D,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,GAAG,kBAAkB,CAAC,MAAM,EAAE,cAAc,EAAE,aAAa,CAAC,CAAC;QACrE,CAAC;IACH,CAAC;IAED,0EAA0E;IAC1E,IAAI,UAAU,EAAE,CAAC;QACf,MAAM,WAAW,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;QAC5C,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;QACzC,MAAM,OAAO,GAAG,WAAW,GAAG,UAAU,CAAC;QACzC,MAAM,GAAG,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,MAAM,EAAE,GAAG,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,gBAAgB,EAAE,CAAC,EAAE,CAAC;QACpE,IAAI,GAAG,GAAG,eAAe,EAAE,CAAC;YAC1B,EAAE,CAAC,gBAAgB,EAAE,CAAC;YACtB,iEAAiE;YACjE,sEAAsE;YACtE,qEAAqE;YACrE,gDAAgD;YAChD,IAAI,EAAE,CAAC,gBAAgB,IAAI,iBAAiB,IAAI,EAAE,CAAC,eAAe,KAAK,SAAS,EAAE,CAAC;gBACjF,EAAE,CAAC,eAAe,GAAG,QAAQ,CAAC,MAAM,CAAC;YACvC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,EAAE,CAAC,gBAAgB,GAAG,CAAC,CAAC;YACxB,EAAE,CAAC,eAAe,GAAG,SAAS,CAAC;QACjC,CAAC;QACD,eAAe,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;IACpC,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,oBAAoB,CAAC,MAAyB,EAAE,KAAwB;IACtF,MAAM,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IAChC,MAAM,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IAC/B,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;AAC5B,CAAC;AAED,uDAAuD;AACvD,MAAM,UAAU,yBAAyB;IACvC,0EAA0E;IAC1E,6DAA6D;IAC7D,uEAAuE;IACvE,2EAA2E;IAC3E,+DAA+D;AACjE,CAAC;AAaD,SAAS,kBAAkB,CAAC,QAAoC;IAC9D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC3C,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,SAAS;QACtE,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YAChC,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;gBAC9B,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;GAKG;AACH,SAAS,wBAAwB,CAC/B,QAAoC,EACpC,iBAAyB;IAEzB,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAChC,aAAa,EAAE,CAAC;YAChB,IAAI,aAAa,GAAG,iBAAiB,EAAE,CAAC;gBACtC,OAAO,CAAC,GAAG,CAAC,CAAC;YACf,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;;GAMG;AACH,SAAS,UAAU,CAAC,QAA2B;IAC7C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,MAAM,GAAG,GAAsB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACtD,kEAAkE;IAClE,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,SAAS;QACjE,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,MAAM,SAAS,GAA2B,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YAClE,IAAI,KAAK,CAAC,IAAI,KAAK,aAAa;gBAAE,OAAO,KAAK,CAAC;YAC/C,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;YACxB,IAAI,OAAO,CAAC,KAAK,QAAQ;gBAAE,OAAO,KAAK,CAAC;YACxC,IAAI,CAAC,CAAC,MAAM,GAAG,eAAe;gBAAE,OAAO,KAAK,CAAC;YAC7C,oEAAoE;YACpE,gDAAgD;YAChD,IAAI,CAAC,CAAC,UAAU,CAAC,wBAAwB,CAAC;gBAAE,OAAO,KAAK,CAAC;YACzD,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACtB,OAAO,GAAG,IAAI,CAAC;gBACf,OAAO;oBACL,IAAI,EAAE,aAAa;oBACnB,WAAW,EAAE,KAAK,CAAC,WAAW;oBAC9B,OAAO,EAAE,qEAAqE,CAAC,GAAG;oBAClF,GAAG,CAAC,KAAK,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBACtE,CAAC;YACJ,CAAC;YACD,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClB,OAAO,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;QACH,IAAI,OAAO,EAAE,CAAC;YACZ,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;QAClD,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,eAAe,CACtB,QAA2B,EAC3B,gBAAwB,EACxB,SAAmC;IAEnC,MAAM,GAAG,GAAsB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,SAAS;QACjE,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,MAAM,SAAS,GAA2B,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YAClE,IAAI,KAAK,CAAC,IAAI,KAAK,aAAa;gBAAE,OAAO,KAAK,CAAC;YAC/C,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;YACxB,IAAI,OAAO,CAAC,KAAK,QAAQ;gBAAE,OAAO,KAAK,CAAC;YACxC,IAAI,CAAC,CAAC,MAAM,GAAG,eAAe;gBAAE,OAAO,KAAK,CAAC;YAC7C,IAAI,CAAC,CAAC,UAAU,CAAC,wBAAwB,CAAC;gBAAE,OAAO,KAAK,CAAC;YACzD,IAAI,CAAC,CAAC,UAAU,CAAC,cAAc,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC/C,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAC7C,MAAM,OAAO,GAAG,mBAAmB,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAC5C,OAAO,GAAG,IAAI,CAAC;YACf,OAAO;gBACL,IAAI,EAAE,aAAa;gBACnB,WAAW,EAAE,KAAK,CAAC,WAAW;gBAC9B,OAAO,EAAE,OAAO;gBAChB,GAAG,CAAC,KAAK,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aACtE,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,IAAI,OAAO,EAAE,CAAC;YACZ,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;QAClD,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,mBAAmB,CAAC,GAA4B,EAAE,OAAe;IACxE,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;IAC7C,MAAM,IAAI,GAAG,GAAG,EAAE,IAAI,IAAI,MAAM,CAAC;IACjC,wEAAwE;IACxE,yEAAyE;IACzE,+CAA+C;IAC/C,MAAM,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACpD,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;IAC7B,OAAO,gBAAgB,IAAI,GAAG,OAAO,MAAM,SAAS,WAAW,OAAO,CAAC,MAAM,iBAAiB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC;AACxH,CAAC;AAED,iFAAiF;AACjF,SAAS,MAAM,CAAC,CAAS;IACvB,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC3C,OAAO,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;AAC7D,CAAC;AAED;2BAC2B;AAC3B,SAAS,aAAa,CAAC,KAA8B;IACnD,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACpC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACxD,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3D,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;AAC/B,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,kBAAkB,CACzB,QAA2B,EAC3B,WAAmB,EACnB,aAAqB;IAErB,0EAA0E;IAC1E,mEAAmE;IACnE,gCAAgC;IAChC,MAAM,QAAQ,GAAG,aAAa,CAAC;IAE/B,SAAS,WAAW,CAAC,CAAU;QAC7B,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;YAC1B,IAAI,CAAC,CAAC,MAAM,IAAI,aAAa;gBAAE,OAAO,CAAC,CAAC;YACxC,IAAI,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC;gBAAE,OAAO,CAAC,CAAC,CAAC,oCAAoC;YAC1E,OAAO,GAAG,QAAQ,GAAG,CAAC,CAAC,MAAM,iBAAiB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC;QAClF,CAAC;QACD,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YACrB,IAAI,OAAO,GAAG,KAAK,CAAC;YACpB,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE;gBACvB,MAAM,IAAI,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC;gBAC7B,IAAI,IAAI,KAAK,EAAE;oBAAE,OAAO,GAAG,IAAI,CAAC;gBAChC,OAAO,IAAI,CAAC;YACd,CAAC,CAAC,CAAC;YACH,OAAO,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,IAAI,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;YAC/B,IAAI,OAAO,GAAG,KAAK,CAAC;YACpB,MAAM,GAAG,GAA4B,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAA4B,CAAC,EAAE,CAAC;gBACpE,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;gBAC9B,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBACd,IAAI,IAAI,KAAK,GAAG;oBAAE,OAAO,GAAG,IAAI,CAAC;YACnC,CAAC;YACD,OAAO,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,IAAI,eAAe,GAAG,KAAK,CAAC;IAC5B,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE;QACpC,IAAI,GAAG,IAAI,WAAW;YAAE,OAAO,GAAG,CAAC;QACnC,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,OAAO,GAAG,CAAC;QACxE,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,MAAM,UAAU,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YAC3C,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU;gBAAE,OAAO,KAAK,CAAC;YAC5C,MAAM,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC,KAAK,CAA4B,CAAC;YACxE,IAAI,WAAW,KAAK,KAAK,CAAC,KAAK;gBAAE,OAAO,KAAK,CAAC;YAC9C,YAAY,GAAG,IAAI,CAAC;YACpB,OAAO,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC;QAC1C,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,YAAY;YAAE,OAAO,GAAG,CAAC;QAC9B,eAAe,GAAG,IAAI,CAAC;QACvB,OAAO,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;IACjD,CAAC,CAAC,CAAC;IACH,OAAO,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC;AAC1C,CAAC;AAED;;;GAGG;AACH,SAAS,aAAa,CAAC,QAAoC;IACzD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,IAAI,OAAO,GAAG,CAAC,OAAO,KAAK,QAAQ,EAAE,CAAC;YACpC,KAAK,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC;YAC5B,SAAS;QACX,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,SAAS;QAC1C,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YAChC,KAAK,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,UAAU,CAAC,KAA2B;IAC7C,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,MAAM;YACT,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;QAC3B,KAAK,aAAa;YAChB,OAAO,OAAO,KAAK,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,KAAK,UAAU;YACb,qEAAqE;YACrE,mEAAmE;YACnE,0DAA0D;YAC1D,IAAI,CAAC;gBACH,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;YAC5C,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,CAAC,CAAC;YACX,CAAC;QACH;YACE,OAAO,CAAC,CAAC;IACb,CAAC;AACH,CAAC;AAED,8BAA8B;AAC9B,MAAM,CAAC,MAAM,iBAAiB,GAAG,eAAe,CAAC;AACjD,MAAM,CAAC,MAAM,iBAAiB,GAAG,eAAe,CAAC;AACjD,MAAM,CAAC,MAAM,mBAAmB,GAAG,iBAAiB,CAAC;AACrD,MAAM,CAAC,MAAM,0BAA0B,GAAG,wBAAwB,CAAC"}

package/dist/memory/reminder.d.ts

@@ -0,0 +1,57 @@
+import type { TodoEntry } from "../state/todos.js";
+/**
+ * System-reminder builder.
+ *
+ * Renders the `<system-reminder>…</system-reminder>` block that gets
+ * attached to every new user message in `maestroProvider`. The reminder
+ * carries invariants the model needs to keep in mind for the current turn
+ * — sandbox state, workspace root, future: active task — and is what keeps
+ * long sessions from forgetting the rules after the compactor evicts the
+ * middle.
+ *
+ * Why this lives outside `loop.ts`:
+ *
+ *   The reminder is attached to the canonical user message at push time
+ *   (see `maestroProvider`), not on-wire just before each API call. That
+ *   choice is load-bearing for Anthropic's automatic prompt cache: every
+ *   past-turn user message must be byte-stable across future calls or the
+ *   cache misses at the first divergence. On-wire injection would mean
+ *   turn N's user message looks different in turn N's call vs turn N+1's
+ *   call, breaking the cache from that point onward. By attaching at
+ *   push time, each historical user message permanently carries the
+ *   reminder that was live at that turn — frozen, cache-friendly.
+ *
+ * Placement: reminder text block follows the user prompt block. Claude
+ * Code's transcripts consistently place `<system-reminder>` at the tail
+ * of user content, and matching that order keeps the model's pretrained
+ * instinct ("the user said X; the reminder is meta") intact.
+ */
+export interface SystemReminderContext {
+    /**
+     * Resolved maestro session id. Surfaced so the model can refer to it in
+     * cross-session tool calls (ask_session, tell_session) without re-asking.
+     */
+    sessionId: string;
+    /**
+     * Current TodoWrite list snapshot. When non-empty, the reminder renders
+     * a compact status header so the model carries the plan across turns
+     * without having to call a read-side tool. The list is the read-side —
+     * `todo_write` is the only related tool the model sees.
+     */
+    todos?: readonly TodoEntry[];
+    /**
+     * Anything additional the caller wants to render verbatim. Each entry
+     * becomes one line at the tail of the reminder. Caller owns formatting.
+     */
+    extras?: string[];
+}
+/**
+ * Build the `<system-reminder>` block. Returns a self-contained string that
+ * callers attach verbatim as a `text` content block on a user message.
+ *
+ * Empty extras + sandbox-enabled (default) state renders to ~3 lines so
+ * the per-turn token cost is bounded; the catalog of facts only grows as
+ * later phases add semantic state (Phase 3.2 task list, etc.).
+ */
+export declare function buildSystemReminder(ctx: SystemReminderContext): string;
+//# sourceMappingURL=reminder.d.ts.map

package/dist/memory/reminder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reminder.d.ts","sourceRoot":"","sources":["../../src/memory/reminder.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAI/C;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAEH,MAAM,WAAW,qBAAqB;IACpC;;;OAGG;IACH,SAAS,EAAE,MAAM,CAAC;IAClB;;;;;OAKG;IACH,KAAK,CAAC,EAAE,SAAS,SAAS,EAAE,CAAC;IAC7B;;;OAGG;IACH,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;CACnB;AAED;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,qBAAqB,GAAG,MAAM,CA8CtE"}