@ai-setting/roy-plugin-task-show 0.8.9 → 0.9.5

package/dist/task-session-store.js

@@ -1,193 +1,153 @@
-/**
- * @fileoverview TaskSessionStore — process-scoped registry of tasks
- * observed through the `task:after.create` hook.
- *
- * v0.8.7 introduced this store so the home page can render an
- * *ancestor chain* (the latest "leaf" task plus the chain of
- * `parent_task_id` links up to the root) instead of the full
- * cross-host task tree. Tracking only this-process tasks also keeps
- * the home page quiet until the plugin actually does work, which
- * makes the visualization a more accurate reflection of what the
- * agent is doing right now.
- *
- * Design notes:
- *   - Pure in-memory; no I/O, no globals. The plugin owns a single
- *     instance and disposes it via {@link TaskSessionStore.clear} when
- *     the plugin is torn down.
- *   - The fetcher for parent tasks is **injected** so tests can mock
- *     the CLI call without spawning a real subprocess.
- *   - The store is tolerant: a broken parent link, a cycle, or a
- *     missing fetcher all degrade gracefully (the chain stops at the
- *     first unverifiable link rather than throwing).
- *   - `buildAncestorChain` always returns tasks in **root-first** order
- *     (`[root, …, leaf]`) so the UI can render the chain linearly
- *     from top to bottom without having to reverse it.
- */
-import { execFile } from "node:child_process";
-import { promisify } from "node:util";
-const execFileAsync = promisify(execFile);
-// ---------------------------------------------------------------------------
-// Store
-// ---------------------------------------------------------------------------
-/**
- * Process-scoped registry of tasks observed via the
- * `task:after.create` hook.
- */
+var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
+    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
+    if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
+    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
+    return c > 3 && r && Object.defineProperty(target, key, r), r;
+};
+import { TracedAs, withTraceSync } from "./tracing/decorator.js";
 export class TaskSessionStore {
-    /** In-memory metadata, keyed by task id. */
-    tasks = new Map();
-    /** Insertion order (Map preserves it). We keep a snapshot for tests. */
-    insertionOrder = [];
+    opts;
+    latestLeafId = null;
+    constructor(opts) {
+        this.opts = {
+            sessionStartedAt: opts.sessionStartedAt,
+            maxAncestors: opts.maxAncestors ?? 32,
+            listTasks: opts.listTasks,
+            taskFetcher: opts.taskFetcher ?? (async () => null),
+        };
+    }
     /**
-     * Record a task. Re-recording an existing id overwrites the cached
-     * metadata (this is the contract: the latest hook payload wins).
+     * Returns the id of the most recently recorded leaf task in this session,
+     * or undefined if no task has been recorded yet. The v0.9.0 home page
+     * highlights this task with a `data-leaf="1"` attribute.
      */
-    record(task) {
-        if (!Number.isFinite(task.id) || task.id <= 0)
-            return;
-        const isNew = !this.tasks.has(task.id);
-        this.tasks.set(task.id, { ...task });
-        if (isNew)
-            this.insertionOrder.push(task.id);
-    }
-    /** Return the most recently recorded task id, or `null` if empty. */
     getLatestLeafId() {
-        if (this.insertionOrder.length === 0)
-            return null;
-        return this.insertionOrder[this.insertionOrder.length - 1] ?? null;
-    }
-    /** Return the cached metadata for `id`, or `null` if unknown. */
-    getRecordedTask(id) {
-        return this.tasks.get(id) ?? null;
-    }
-    /** Return the recorded task ids in insertion order. */
-    getRecordedTaskIds() {
-        return [...this.insertionOrder];
-    }
-    /** Drop everything. Used by tests + on plugin disposal. */
-    clear() {
-        this.tasks.clear();
-        this.insertionOrder.length = 0;
+        return this.latestLeafId ?? undefined;
     }
     /**
-     * Walk `parent_task_id` from `leafId` up to the root, using
-     * `fetcher` to resolve any ancestors not already in the in-memory
-     * cache. Returns the chain in **root-first** order
-     * (`[root, …, leaf]`).
-     *
-     * Guarantees:
-     *   - Always returns at least the leaf task if the leaf is known
-     *     (from cache or via fetcher).
-     *   - Cycle-safe: a task already in the chain stops the walk.
-     *   - Depth-bounded by `options.maxDepth` (default 32).
-     *   - Never throws: a broken parent link just ends the chain early.
+     * Record a leaf task id (called by the host plugin as new tasks appear).
+     * Idempotent — only the most recent call wins.
      */
-    async buildAncestorChain(leafId, fetcher, options = {}) {
-        if (!Number.isFinite(leafId) || leafId <= 0)
-            return [];
-        const maxDepth = Math.max(1, options.maxDepth ?? 32);
-        // Walk leaf → root, then reverse at the end. We collect into an
-        // array in walk order so cycles / missing ancestors are easy to
-        // detect.
-        const walked = [];
-        const seen = new Set();
-        let currentId = leafId;
-        for (let depth = 0; depth < maxDepth; depth++) {
-            if (seen.has(currentId))
-                break;
-            seen.add(currentId);
-            const cached = this.tasks.get(currentId);
-            const task = cached ?? await safeFetch(fetcher, currentId);
-            if (!task)
-                break;
-            walked.push(task);
-            const parentId = task.parent_task_id;
-            if (parentId === null || parentId === undefined)
-                break;
-            if (!Number.isFinite(parentId) || parentId <= 0)
-                break;
-            currentId = parentId;
-        }
-        return walked.reverse();
+    recordLeaf(taskId) {
+        this.latestLeafId = taskId;
     }
-}
-/**
- * Run `fetcher(id)` and swallow any rejection. A failed fetch
- * (network / parse / CLI error) should not crash the chain walk —
- * we just stop at the last known task.
- */
-async function safeFetch(fetcher, id) {
-    try {
-        return await fetcher(id);
-    }
-    catch {
-        return null;
-    }
-}
-// ---------------------------------------------------------------------------
-// Default CLI-backed fetcher
-// ---------------------------------------------------------------------------
-/**
- * Build a {@link TaskMetaFetcher} that shells out to the host's
- * `roy-agent` CLI. Intended for production use; tests should pass a
- * stub.
- *
- *   args:  [cliPath, "tasks", "get", "<id>", "--json"]
- *   stdout: { task: { id, title, status, priority, type,
- *                     parent_task_id, createdAt, updatedAt, tags,
- *                     project_path }, ... }
- *
- * The returned fetcher:
- *   - Spawns the CLI as a discrete arg array (no shell string).
- *   - Enforces a 5-second wall-clock timeout.
- *   - Locates the first `{` in stdout (the CLI prints INFO lines
- *     before the JSON envelope).
- *   - Returns `null` on any failure (non-zero exit, timeout, parse
- *     error, schema mismatch).
- */
-export function makeCliTaskMetaFetcher(cliPath) {
-    return async (id) => {
-        if (!Number.isInteger(id) || id <= 0)
-            return null;
-        const args = [cliPath, "tasks", "get", String(id), "--json"];
-        let stdout = "";
-        try {
-            const result = await execFileAsync(cliPath, args.slice(1), {
-                timeout: 5000,
-                maxBuffer: 4 * 1024 * 1024,
-                windowsHide: true,
-            });
-            stdout = result.stdout ?? "";
+    async buildSessionForest() {
+        const cutoff = Date.parse(this.opts.sessionStartedAt);
+        const raw = await this.opts.listTasks({ sinceIso: this.opts.sessionStartedAt });
+        const tasks = raw.filter((t) => {
+            const ts = Date.parse(t.createdAt);
+            return Number.isFinite(ts) && ts >= cutoff;
+        });
+        const byId = new Map();
+        for (const t of tasks)
+            byId.set(t.id, t);
+        const children = new Map();
+        for (const t of tasks) {
+            if (t.parent_task_id === undefined || t.parent_task_id === null)
+                continue;
+            const arr = children.get(t.parent_task_id) ?? [];
+            arr.push(t);
+            children.set(t.parent_task_id, arr);
         }
-        catch {
-            return null;
+        // v0.9.0: bounded BFS for external ancestors. For every in-session
+        // task whose parent is not in `byId`, BFS up the parent chain,
+        // fetching each ancestor through `taskFetcher` and inserting it
+        // (deduplicated) into `byId` and `children` until we run out of
+        // ancestors or hit `maxAncestors`.
+        const maxAncestors = this.opts.maxAncestors;
+        let fetchedAncestors = 0;
+        // FIFO queue of parent_ids we still need to look up.
+        const queue = [];
+        const queued = new Set();
+        for (const t of tasks) {
+            if (t.parent_task_id === undefined || t.parent_task_id === null)
+                continue;
+            if (byId.has(t.parent_task_id))
+                continue;
+            if (queued.has(t.parent_task_id))
+                continue;
+            queue.push(t.parent_task_id);
+            queued.add(t.parent_task_id);
         }
-        const jsonStart = stdout.indexOf("{");
-        if (jsonStart < 0)
-            return null;
-        const envelopeText = stdout.slice(jsonStart);
-        let envelope;
-        try {
-            envelope = JSON.parse(envelopeText);
+        while (queue.length > 0 && fetchedAncestors < maxAncestors) {
+            const id = queue.shift();
+            const fetched = await this.opts.taskFetcher(id);
+            if (!fetched)
+                continue;
+            byId.set(fetched.id, fetched);
+            fetchedAncestors += 1;
+            // Index as a child of its own parent (so the tree walks correctly).
+            if (fetched.parent_task_id !== undefined && fetched.parent_task_id !== null) {
+                const arr = children.get(fetched.parent_task_id) ?? [];
+                arr.push(fetched);
+                children.set(fetched.parent_task_id, arr);
+                if (!byId.has(fetched.parent_task_id) && !queued.has(fetched.parent_task_id) && fetchedAncestors + queue.length < maxAncestors) {
+                    queue.push(fetched.parent_task_id);
+                    queued.add(fetched.parent_task_id);
+                }
+            }
         }
-        catch {
-            return null;
+        // Assemble roots: any task (in-session or fetched) whose parent is
+        // not present in byId becomes a root.
+        const roots = [];
+        for (const t of byId.values()) {
+            if (t.parent_task_id === undefined || t.parent_task_id === null || !byId.has(t.parent_task_id)) {
+                roots.push(t);
+            }
         }
-        const t = envelope?.task;
-        if (!t || typeof t.id !== "number")
-            return null;
-        return {
-            id: t.id,
-            title: typeof t.title === "string" ? t.title : "",
-            status: typeof t.status === "string" ? t.status : undefined,
-            priority: typeof t.priority === "string" ? t.priority : undefined,
-            type: typeof t.type === "string" ? t.type : undefined,
-            parent_task_id: typeof t.parent_task_id === "number" ? t.parent_task_id : null,
-            createdAt: typeof t.createdAt === "string" ? t.createdAt : undefined,
-            updatedAt: typeof t.updatedAt === "string" ? t.updatedAt : undefined,
-            tags: Array.isArray(t.tags) ? t.tags.filter((x) => typeof x === "string") : undefined,
-            projectPath: typeof t.project_path === "string" ? t.project_path : undefined,
+        const buildChildren = (parentId, depth = 0) => {
+            const arr = children.get(parentId) ?? [];
+            const out = [];
+            for (const t of arr) {
+                if (depth > maxAncestors + 4)
+                    break; // hard ceiling for defensive recursion
+                out.push({ task: t, children: buildChildren(t.id, depth + 1) });
+            }
+            out.sort((a, b) => a.task.id - b.task.id);
+            return out;
         };
+        return roots
+            .sort((a, b) => a.id - b.id)
+            .map((t) => ({ task: t, children: buildChildren(t.id, 0) }));
+    }
+}
+__decorate([
+    TracedAs("session.forest.build", { recordParams: false, recordResult: false })
+], TaskSessionStore.prototype, "buildSessionForest", null);
+function esc(s) {
+    const str = s === undefined || s === null ? "" : String(s);
+    return str.replace(/&/g, "&amp;").replace(/</g, "&lt;").replace(/>/g, "&gt;").replace(/"/g, "&quot;");
+}
+export function renderSessionForestPage(args) {
+    return withTraceSync("html.session-forest.render", () => _renderSessionForestPageImpl(args));
+}
+function _renderSessionForestPageImpl(args) {
+    const rows = [];
+    const walk = (node, depth) => {
+        const t = node.task;
+        const checked = t.id === args.leafTaskId ? ' data-leaf="1"' : "";
+        rows.push(`<li class="session-row" data-depth="${depth}"${checked}>
+  <a class="session-title" href="/task/${t.id}">#${t.id} ${esc(t.title)}</a>
+  <button type="button" class="session-toggle" data-toggle="${t.id}">显示全部栏位</button>
+  <details class="session-details" data-details="${t.id}">
+    <summary>metadata</summary>
+    <dl>
+      <dt>project_path</dt><dd>${esc(t.project_path)}</dd>
+      <dt>context</dt><dd><pre>${esc(t.context)}</pre></dd>
+      <dt>description</dt><dd>${esc(t.description)}</dd>
+      <dt>goals</dt><dd>${esc(t.goals_and_expected_deliverables)}</dd>
+      <dt>tags</dt><dd>${esc((t.tags ?? []).join(", "))}</dd>
+      <dt>createdAt</dt><dd>${esc(t.createdAt)}</dd>
+      <dt>updatedAt</dt><dd>${esc(t.updatedAt)}</dd>
+    </dl>
+  </details>
+  <ul class="session-operations" data-task-operations="${t.id}"></ul>
+</li>`);
+        for (const child of node.children)
+            walk(child, depth + 1);
     };
+    for (const node of args.forest)
+        walk(node, 0);
+    return `<section class="session-forest" data-session-forest="1"><h2>本会话任务</h2><ul>${rows.join("")}</ul></section>`;
 }
 //# sourceMappingURL=task-session-store.js.map

package/dist/task-session-store.js.map

@@ -1 +1 @@
-{"version":3,"file":"task-session-store.js","sourceRoot":"","sources":["../src/task-session-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAEtC,MAAM,aAAa,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;AAoC1C,8EAA8E;AAC9E,QAAQ;AACR,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,OAAO,gBAAgB;IAC3B,4CAA4C;IAC3B,KAAK,GAAG,IAAI,GAAG,EAAwB,CAAC;IACzD,wEAAwE;IACvD,cAAc,GAAa,EAAE,CAAC;IAE/C;;;OAGG;IACH,MAAM,CAAC,IAAkB;QACvB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC;YAAE,OAAO;QACtD,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;QACrC,IAAI,KAAK;YAAE,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC/C,CAAC;IAED,qEAAqE;IACrE,eAAe;QACb,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAClD,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC;IACrE,CAAC;IAED,iEAAiE;IACjE,eAAe,CAAC,EAAU;QACxB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC;IACpC,CAAC;IAED,uDAAuD;IACvD,kBAAkB;QAChB,OAAO,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC;IAClC,CAAC;IAED,2DAA2D;IAC3D,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;IACjC,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,KAAK,CAAC,kBAAkB,CACtB,MAAc,EACd,OAAwB,EACxB,UAAqC,EAAE;QAEvC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,IAAI,CAAC;YAAE,OAAO,EAAE,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC;QAErD,gEAAgE;QAChE,gEAAgE;QAChE,UAAU;QACV,MAAM,MAAM,GAAmB,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,IAAI,SAAS,GAAW,MAAM,CAAC;QAE/B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC;YAC9C,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC;gBAAE,MAAM;YAC/B,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAEpB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACzC,MAAM,IAAI,GAAwB,MAAM,IAAI,MAAM,SAAS,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;YAChF,IAAI,CAAC,IAAI;gBAAE,MAAM;YACjB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAElB,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC;YACrC,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,SAAS;gBAAE,MAAM;YACvD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,QAAQ,IAAI,CAAC;gBAAE,MAAM;YACvD,SAAS,GAAG,QAAQ,CAAC;QACvB,CAAC;QAED,OAAO,MAAM,CAAC,OAAO,EAAE,CAAC;IAC1B,CAAC;CACF;AAED;;;;GAIG;AACH,KAAK,UAAU,SAAS,CAAC,OAAwB,EAAE,EAAU;IAC3D,IAAI,CAAC;QACH,OAAO,MAAM,OAAO,CAAC,EAAE,CAAC,CAAC;IAC3B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,6BAA6B;AAC7B,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,sBAAsB,CAAC,OAAe;IACpD,OAAO,KAAK,EAAE,EAAU,EAAE,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAClD,MAAM,IAAI,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC7D,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;gBACzD,OAAO,EAAE,IAAI;gBACb,SAAS,EAAE,CAAC,GAAG,IAAI,GAAG,IAAI;gBAC1B,WAAW,EAAE,IAAI;aAClB,CAAC,CAAC;YACH,MAAM,GAAG,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC;QAC/B,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACtC,IAAI,SAAS,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QAC/B,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAC7C,IAAI,QAAa,CAAC;QAClB,IAAI,CAAC;YACH,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACtC,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,CAAC,GAAG,QAAQ,EAAE,IAAI,CAAC;QACzB,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,EAAE,KAAK,QAAQ;YAAE,OAAO,IAAI,CAAC;QAChD,OAAO;YACL,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,KAAK,EAAE,OAAO,CAAC,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;YACjD,MAAM,EAAE,OAAO,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;YAC3D,QAAQ,EAAE,OAAO,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS;YACjE,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;YACrD,cAAc,EAAE,OAAO,CAAC,CAAC,cAAc,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI;YAC9E,SAAS,EAAE,OAAO,CAAC,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS;YACpE,SAAS,EAAE,OAAO,CAAC,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS;YACpE,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAU,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS;YAC9F,WAAW,EAAE,OAAO,CAAC,CAAC,YAAY,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS;SAC7E,CAAC;IACJ,CAAC,CAAC;AACJ,CAAC"}
+{"version":3,"file":"task-session-store.js","sourceRoot":"","sources":["../src/task-session-store.ts"],"names":[],"mappings":";;;;;;AAIA,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AA6CjE,MAAM,OAAO,gBAAgB;IACV,IAAI,CAGnB;IACM,YAAY,GAAkB,IAAI,CAAC;IAE3C,YAAY,IAA+B;QACzC,IAAI,CAAC,IAAI,GAAG;YACV,gBAAgB,EAAE,IAAI,CAAC,gBAAgB;YACvC,YAAY,EAAE,IAAI,CAAC,YAAY,IAAI,EAAE;YACrC,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,WAAW,EAAE,IAAI,CAAC,WAAW,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,IAAI,CAAC;SACpD,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,YAAY,IAAI,SAAS,CAAC;IACxC,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,MAAc;QACvB,IAAI,CAAC,YAAY,GAAG,MAAM,CAAC;IAC7B,CAAC;IAGK,AAAN,KAAK,CAAC,kBAAkB;QACtB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QACtD,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC,CAAC;QAChF,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACnC,OAAO,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,MAAM,CAAC;QAC7C,CAAC,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,IAAI,GAAG,EAA6B,CAAC;QAClD,KAAK,MAAM,CAAC,IAAI,KAAK;YAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACzC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA+B,CAAC;QACxD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,CAAC,CAAC,cAAc,KAAK,SAAS,IAAI,CAAC,CAAC,cAAc,KAAK,IAAI;gBAAE,SAAS;YAC1E,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC;YACjD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC;QACtC,CAAC;QACD,mEAAmE;QACnE,+DAA+D;QAC/D,gEAAgE;QAChE,gEAAgE;QAChE,mCAAmC;QACnC,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC;QAC5C,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,qDAAqD;QACrD,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,CAAC,CAAC,cAAc,KAAK,SAAS,IAAI,CAAC,CAAC,cAAc,KAAK,IAAI;gBAAE,SAAS;YAC1E,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC;gBAAE,SAAS;YACzC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC;gBAAE,SAAS;YAC3C,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;YAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,gBAAgB,GAAG,YAAY,EAAE,CAAC;YAC3D,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC1B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;YAChD,IAAI,CAAC,OAAO;gBAAE,SAAS;YACvB,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;YAC9B,gBAAgB,IAAI,CAAC,CAAC;YACtB,oEAAoE;YACpE,IAAI,OAAO,CAAC,cAAc,KAAK,SAAS,IAAI,OAAO,CAAC,cAAc,KAAK,IAAI,EAAE,CAAC;gBAC5E,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC;gBACvD,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAClB,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC;gBAC1C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,cAAc,CAAC,IAAI,gBAAgB,GAAG,KAAK,CAAC,MAAM,GAAG,YAAY,EAAE,CAAC;oBAC/H,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;oBACnC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;gBACrC,CAAC;YACH,CAAC;QACH,CAAC;QACD,mEAAmE;QACnE,sCAAsC;QACtC,MAAM,KAAK,GAAwB,EAAE,CAAC;QACtC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC,CAAC,cAAc,KAAK,SAAS,IAAI,CAAC,CAAC,cAAc,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,EAAE,CAAC;gBAC/F,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QACD,MAAM,aAAa,GAAG,CAAC,QAAgB,EAAE,QAAgB,CAAC,EAAuB,EAAE;YACjF,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YACzC,MAAM,GAAG,GAAwB,EAAE,CAAC;YACpC,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;gBACpB,IAAI,KAAK,GAAG,YAAY,GAAG,CAAC;oBAAE,MAAM,CAAC,uCAAuC;gBAC5E,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;YAClE,CAAC;YACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC1C,OAAO,GAAG,CAAC;QACb,CAAC,CAAC;QACF,OAAO,KAAK;aACT,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;aAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjE,CAAC;CACF;AAxEO;IADL,QAAQ,CAAC,sBAAsB,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,EAAE,KAAK,EAAE,CAAC;0DAwE9E;AAKH,SAAS,GAAG,CAAC,CAAU;IACrB,MAAM,GAAG,GAAG,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC3D,OAAO,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;AACxG,CAAC;AAED,MAAM,UAAU,uBAAuB,CAAC,IAGvC;IACC,OAAO,aAAa,CAAC,4BAA4B,EAAE,GAAG,EAAE,CACtD,4BAA4B,CAAC,IAAI,CAAC,CACnC,CAAC;AACJ,CAAC;AAED,SAAS,4BAA4B,CAAC,IAGrC;IACC,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,IAAI,GAAG,CAAC,IAAuB,EAAE,KAAa,EAAE,EAAE;QACtD,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;QACpB,MAAM,OAAO,GAAG,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;QACjE,IAAI,CAAC,IAAI,CAAC,uCAAuC,KAAK,IAAI,OAAO;yCAC5B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;8DACT,CAAC,CAAC,EAAE;mDACf,CAAC,CAAC,EAAE;;;iCAGtB,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC;iCACnB,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;gCACf,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC;0BACxB,GAAG,CAAC,CAAC,CAAC,+BAA+B,CAAC;yBACvC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;8BACzB,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;8BAChB,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;;;yDAGW,CAAC,CAAC,EAAE;MACvD,CAAC,CAAC;QACJ,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAAE,IAAI,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAC5D,CAAC,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM;QAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC9C,OAAO,6EAA6E,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,iBAAiB,CAAC;AACrH,CAAC"}

package/dist/tasks-tree-cache.d.ts

@@ -10,6 +10,11 @@
  * Cache keys are derived from the `TasksTreeFilter` object via a stable
  * JSON.stringify so functionally-equal filters (e.g. `{ status: undefined,
  * priority: "high" }` vs `{ priority: "high" }`) hit the same entry.
+ *
+ * v0.8.10+: the cache enforces a hard `maxEntries` cap. Without this,
+ * long-lived hosts that page through every filter combination (the
+ * frontend polls with shifting depth/status/priority/tags) leak
+ * entries forever — see Task #2537 (roy-agent 4 GiB OOM).
  */
 import type { TasksTreeEnvelope, TasksTreeFilter, TasksTreeSource } from "./cli-tasks-tree-adapter.js";
 type SourceFn = (filter: TasksTreeFilter) => Promise<TasksTreeEnvelope>;
@@ -17,6 +22,12 @@ export interface TasksTreeCacheOptions {
     source: SourceFn | TasksTreeSource;
     /** Time-to-live in milliseconds. Default 5000. */
     ttlMs?: number;
+    /**
+     * v0.8.10+: hard cap on the number of cached entries (one per unique
+     * filter combination). Past this limit, the cache sweeps the oldest
+     * stale entries before inserting a new one. Default 64.
+     */
+    maxEntries?: number;
     /** Optional: clock for tests. */
     now?: () => number;
 }
@@ -25,6 +36,7 @@ export declare class TasksTreeCache {
     private readonly ttlMs;
     private readonly source;
     private readonly now;
+    private readonly maxEntries;
     constructor(opts: TasksTreeCacheOptions);
     /**
      * Fetch (or read from cache). Concurrent calls for the same filter
@@ -38,6 +50,11 @@ export declare class TasksTreeCache {
     clear(): void;
     /** Number of cached entries (test introspection). */
     size(): number;
+    /**
+     * Sweep entries that are past their TTL once we exceed `maxEntries`.
+     * See OperationsCache.evictStale for the same rationale.
+     */
+    private evictStale;
     private refresh;
 }
 export {};

package/dist/tasks-tree-cache.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"tasks-tree-cache.d.ts","sourceRoot":"","sources":["../src/tasks-tree-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EACV,iBAAiB,EACjB,eAAe,EACf,eAAe,EAChB,MAAM,6BAA6B,CAAC;AAErC,KAAK,QAAQ,GAAG,CAAC,MAAM,EAAE,eAAe,KAAK,OAAO,CAAC,iBAAiB,CAAC,CAAC;AAQxE,MAAM,WAAW,qBAAqB;IACpC,MAAM,EAAE,QAAQ,GAAG,eAAe,CAAC;IACnC,kDAAkD;IAClD,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,iCAAiC;IACjC,GAAG,CAAC,EAAE,MAAM,MAAM,CAAC;CACpB;AAED,qBAAa,cAAc;IACzB,OAAO,CAAC,QAAQ,CAAC,OAAO,CAA4B;IACpD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAS;IAC/B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAW;IAClC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAe;gBAEvB,IAAI,EAAE,qBAAqB;IAavC;;;;OAIG;IACG,GAAG,CACP,MAAM,EAAE,eAAe,EACvB,IAAI,GAAE;QAAE,UAAU,CAAC,EAAE,OAAO,CAAA;KAAO,GAClC,OAAO,CAAC,iBAAiB,CAAC;IAyC7B,wBAAwB;IACxB,KAAK,IAAI,IAAI;IAIb,qDAAqD;IACrD,IAAI,IAAI,MAAM;YAIA,OAAO;CActB"}
+{"version":3,"file":"tasks-tree-cache.d.ts","sourceRoot":"","sources":["../src/tasks-tree-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,KAAK,EACV,iBAAiB,EACjB,eAAe,EACf,eAAe,EAChB,MAAM,6BAA6B,CAAC;AAErC,KAAK,QAAQ,GAAG,CAAC,MAAM,EAAE,eAAe,KAAK,OAAO,CAAC,iBAAiB,CAAC,CAAC;AAQxE,MAAM,WAAW,qBAAqB;IACpC,MAAM,EAAE,QAAQ,GAAG,eAAe,CAAC;IACnC,kDAAkD;IAClD,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,iCAAiC;IACjC,GAAG,CAAC,EAAE,MAAM,MAAM,CAAC;CACpB;AAED,qBAAa,cAAc;IACzB,OAAO,CAAC,QAAQ,CAAC,OAAO,CAA4B;IACpD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAS;IAC/B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAW;IAClC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAe;IACnC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAS;gBAExB,IAAI,EAAE,qBAAqB;IAmBvC;;;;OAIG;IACG,GAAG,CACP,MAAM,EAAE,eAAe,EACvB,IAAI,GAAE;QAAE,UAAU,CAAC,EAAE,OAAO,CAAA;KAAO,GAClC,OAAO,CAAC,iBAAiB,CAAC;IA4C7B,wBAAwB;IACxB,KAAK,IAAI,IAAI;IAIb,qDAAqD;IACrD,IAAI,IAAI,MAAM;IAId;;;OAGG;IACH,OAAO,CAAC,UAAU;YAoBJ,OAAO;CActB"}

package/dist/tasks-tree-cache.js

@@ -10,15 +10,25 @@
  * Cache keys are derived from the `TasksTreeFilter` object via a stable
  * JSON.stringify so functionally-equal filters (e.g. `{ status: undefined,
  * priority: "high" }` vs `{ priority: "high" }`) hit the same entry.
+ *
+ * v0.8.10+: the cache enforces a hard `maxEntries` cap. Without this,
+ * long-lived hosts that page through every filter combination (the
+ * frontend polls with shifting depth/status/priority/tags) leak
+ * entries forever — see Task #2537 (roy-agent 4 GiB OOM).
  */
 export class TasksTreeCache {
     entries = new Map();
     ttlMs;
     source;
     now;
+    maxEntries;
     constructor(opts) {
         this.ttlMs = opts.ttlMs ?? 5000;
         this.now = opts.now ?? (() => Date.now());
+        this.maxEntries = opts.maxEntries ?? 64;
+        if (!Number.isFinite(this.maxEntries) || this.maxEntries < 1) {
+            throw new RangeError(`TasksTreeCache: maxEntries must be a positive finite number, got ${this.maxEntries}`);
+        }
         const src = opts.source;
         if (typeof src === "function") {
             this.source = src;
@@ -41,6 +51,7 @@ export class TasksTreeCache {
         const now = this.now();
         if (existing && existing.fetchedAtMs > 0 && now - existing.fetchedAtMs < this.ttlMs) {
             existing.envelope.stale = false;
+            this.evictStale(now);
             return existing.envelope;
         }
         if (existing && existing.fetchedAtMs > 0 && opts.allowStale) {
@@ -51,11 +62,13 @@ export class TasksTreeCache {
                 });
                 existing.inflight.catch(() => { });
             }
+            this.evictStale(now);
             return existing.envelope;
         }
         if (existing?.inflight) {
             return existing.inflight;
         }
+        this.evictStale(now);
         const entry = existing ?? {
             envelope: {
                 total: 0,
@@ -80,6 +93,32 @@ export class TasksTreeCache {
     size() {
         return this.entries.size;
     }
+    /**
+     * Sweep entries that are past their TTL once we exceed `maxEntries`.
+     * See OperationsCache.evictStale for the same rationale.
+     */
+    evictStale(now) {
+        if (this.entries.size <= this.maxEntries)
+            return;
+        let overflow = this.entries.size - this.maxEntries;
+        for (const [key, entry] of this.entries) {
+            if (overflow <= 0)
+                break;
+            if (entry.fetchedAtMs > 0 && now - entry.fetchedAtMs >= this.ttlMs) {
+                this.entries.delete(key);
+                overflow -= 1;
+            }
+        }
+        if (this.entries.size > this.maxEntries) {
+            overflow = this.entries.size - this.maxEntries;
+            for (const key of this.entries.keys()) {
+                if (overflow <= 0)
+                    break;
+                this.entries.delete(key);
+                overflow -= 1;
+            }
+        }
+    }
     async refresh(filter) {
         const envelope = await this.source(filter);
         const now = this.now();

package/dist/tasks-tree-cache.js.map

@@ -1 +1 @@
-{"version":3,"file":"tasks-tree-cache.js","sourceRoot":"","sources":["../src/tasks-tree-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAwBH,MAAM,OAAO,cAAc;IACR,OAAO,GAAG,IAAI,GAAG,EAAiB,CAAC;IACnC,KAAK,CAAS;IACd,MAAM,CAAW;IACjB,GAAG,CAAe;IAEnC,YAAY,IAA2B;QACrC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC;QAChC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QAC1C,MAAM,GAAG,GAAG,IAAI,CAAC,MAAa,CAAC;QAC/B,IAAI,OAAO,GAAG,KAAK,UAAU,EAAE,CAAC;YAC9B,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;QACpB,CAAC;aAAM,IAAI,GAAG,IAAI,OAAO,GAAG,CAAC,YAAY,KAAK,UAAU,EAAE,CAAC;YACzD,IAAI,CAAC,MAAM,GAAG,CAAC,CAAkB,EAAE,EAAE,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5D,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,SAAS,CAAC,+DAA+D,CAAC,CAAC;QACvF,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,GAAG,CACP,MAAuB,EACvB,OAAiC,EAAE;QAEnC,MAAM,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEvB,IAAI,QAAQ,IAAI,QAAQ,CAAC,WAAW,GAAG,CAAC,IAAI,GAAG,GAAG,QAAQ,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACpF,QAAQ,CAAC,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAC;YAChC,OAAO,QAAQ,CAAC,QAAQ,CAAC;QAC3B,CAAC;QAED,IAAI,QAAQ,IAAI,QAAQ,CAAC,WAAW,GAAG,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAC5D,QAAQ,CAAC,QAAQ,CAAC,KAAK,GAAG,IAAI,CAAC;YAC/B,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC;gBACvB,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE;oBACpD,QAAQ,CAAC,QAAQ,GAAG,SAAS,CAAC;gBAChC,CAAC,CAAC,CAAC;gBACH,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;YACpC,CAAC;YACD,OAAO,QAAQ,CAAC,QAAQ,CAAC;QAC3B,CAAC;QAED,IAAI,QAAQ,EAAE,QAAQ,EAAE,CAAC;YACvB,OAAO,QAAQ,CAAC,QAAQ,CAAC;QAC3B,CAAC;QACD,MAAM,KAAK,GAAU,QAAQ,IAAI;YAC/B,QAAQ,EAAE;gBACR,KAAK,EAAE,CAAC;gBACR,SAAS,EAAE,CAAC;gBACZ,IAAI,EAAE,EAAE;gBACR,SAAS,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE;gBACtC,KAAK,EAAE,KAAK;aACb;YACD,WAAW,EAAE,CAAC;SACf,CAAC;QACF,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE;YACjD,KAAK,CAAC,QAAQ,GAAG,SAAS,CAAC;QAC7B,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC7B,OAAO,KAAK,CAAC,QAAQ,CAAC;IACxB,CAAC;IAED,wBAAwB;IACxB,KAAK;QACH,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IAED,qDAAqD;IACrD,IAAI;QACF,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;IAC3B,CAAC;IAEO,KAAK,CAAC,OAAO,CAAC,MAAuB;QAC3C,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,MAAM,GAAsB;YAChC,GAAG,QAAQ;YACX,SAAS,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE;YACtC,KAAK,EAAE,KAAK;SACb,CAAC;QACF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE;YACjC,QAAQ,EAAE,MAAM;YAChB,WAAW,EAAE,GAAG;SACjB,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAED;;;GAGG;AACH,SAAS,QAAQ,CAAC,MAAuB;IACvC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;SAC7B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAE,MAAc,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC;SAC/C,IAAI,EAAE,CAAC;IACV,MAAM,UAAU,GAA4B,EAAE,CAAC;IAC/C,KAAK,MAAM,CAAC,IAAI,IAAI;QAAE,UAAU,CAAC,CAAC,CAAC,GAAI,MAAc,CAAC,CAAC,CAAC,CAAC;IACzD,OAAO,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;AACpC,CAAC"}
+{"version":3,"file":"tasks-tree-cache.js","sourceRoot":"","sources":["../src/tasks-tree-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AA8BH,MAAM,OAAO,cAAc;IACR,OAAO,GAAG,IAAI,GAAG,EAAiB,CAAC;IACnC,KAAK,CAAS;IACd,MAAM,CAAW;IACjB,GAAG,CAAe;IAClB,UAAU,CAAS;IAEpC,YAAY,IAA2B;QACrC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC;QAChC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QAC1C,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC;QACxC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;YAC7D,MAAM,IAAI,UAAU,CAClB,oEAAoE,IAAI,CAAC,UAAU,EAAE,CACtF,CAAC;QACJ,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,MAAa,CAAC;QAC/B,IAAI,OAAO,GAAG,KAAK,UAAU,EAAE,CAAC;YAC9B,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;QACpB,CAAC;aAAM,IAAI,GAAG,IAAI,OAAO,GAAG,CAAC,YAAY,KAAK,UAAU,EAAE,CAAC;YACzD,IAAI,CAAC,MAAM,GAAG,CAAC,CAAkB,EAAE,EAAE,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5D,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,SAAS,CAAC,+DAA+D,CAAC,CAAC;QACvF,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,GAAG,CACP,MAAuB,EACvB,OAAiC,EAAE;QAEnC,MAAM,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEvB,IAAI,QAAQ,IAAI,QAAQ,CAAC,WAAW,GAAG,CAAC,IAAI,GAAG,GAAG,QAAQ,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACpF,QAAQ,CAAC,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAC;YAChC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;YACrB,OAAO,QAAQ,CAAC,QAAQ,CAAC;QAC3B,CAAC;QAED,IAAI,QAAQ,IAAI,QAAQ,CAAC,WAAW,GAAG,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAC5D,QAAQ,CAAC,QAAQ,CAAC,KAAK,GAAG,IAAI,CAAC;YAC/B,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC;gBACvB,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE;oBACpD,QAAQ,CAAC,QAAQ,GAAG,SAAS,CAAC;gBAChC,CAAC,CAAC,CAAC;gBACH,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;YACpC,CAAC;YACD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;YACrB,OAAO,QAAQ,CAAC,QAAQ,CAAC;QAC3B,CAAC;QAED,IAAI,QAAQ,EAAE,QAAQ,EAAE,CAAC;YACvB,OAAO,QAAQ,CAAC,QAAQ,CAAC;QAC3B,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QACrB,MAAM,KAAK,GAAU,QAAQ,IAAI;YAC/B,QAAQ,EAAE;gBACR,KAAK,EAAE,CAAC;gBACR,SAAS,EAAE,CAAC;gBACZ,IAAI,EAAE,EAAE;gBACR,SAAS,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE;gBACtC,KAAK,EAAE,KAAK;aACb;YACD,WAAW,EAAE,CAAC;SACf,CAAC;QACF,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE;YACjD,KAAK,CAAC,QAAQ,GAAG,SAAS,CAAC;QAC7B,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC7B,OAAO,KAAK,CAAC,QAAQ,CAAC;IACxB,CAAC;IAED,wBAAwB;IACxB,KAAK;QACH,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IAED,qDAAqD;IACrD,IAAI;QACF,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;IAC3B,CAAC;IAED;;;OAGG;IACK,UAAU,CAAC,GAAW;QAC5B,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,UAAU;YAAE,OAAO;QACjD,IAAI,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;QACnD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACxC,IAAI,QAAQ,IAAI,CAAC;gBAAE,MAAM;YACzB,IAAI,KAAK,CAAC,WAAW,GAAG,CAAC,IAAI,GAAG,GAAG,KAAK,CAAC,WAAW,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBACnE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACzB,QAAQ,IAAI,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QACD,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YACxC,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;YAC/C,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;gBACtC,IAAI,QAAQ,IAAI,CAAC;oBAAE,MAAM;gBACzB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACzB,QAAQ,IAAI,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,OAAO,CAAC,MAAuB;QAC3C,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,MAAM,GAAsB;YAChC,GAAG,QAAQ;YACX,SAAS,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE;YACtC,KAAK,EAAE,KAAK;SACb,CAAC;QACF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE;YACjC,QAAQ,EAAE,MAAM;YAChB,WAAW,EAAE,GAAG;SACjB,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAED;;;GAGG;AACH,SAAS,QAAQ,CAAC,MAAuB;IACvC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;SAC7B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAE,MAAc,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC;SAC/C,IAAI,EAAE,CAAC;IACV,MAAM,UAAU,GAA4B,EAAE,CAAC;IAC/C,KAAK,MAAM,CAAC,IAAI,IAAI;QAAE,UAAU,CAAC,CAAC,CAAC,GAAI,MAAc,CAAC,CAAC,CAAC,CAAC;IACzD,OAAO,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;AACpC,CAAC"}

package/dist/tracing/decorator.d.ts

@@ -0,0 +1,48 @@
+export interface TracedAsOptions {
+    recordParams?: boolean;
+    recordResult?: boolean;
+    recordError?: boolean;
+}
+/**
+ * @TracedAs(name, options) decorator factory.
+ *
+ * Usage:
+ *   @TracedAs("server.home.render", { recordParams: false, recordResult: false })
+ *   private async sendIndex(res: http.ServerResponse): Promise<void> { ... }
+ *
+ * If the spans.db is unreachable (no host, no env, schema mismatch),
+ * the decorator becomes a transparent passthrough — the wrapped
+ * function is called with its original `this` and arguments.
+ */
+export declare function TracedAs(name: string, _options?: TracedAsOptions): <T extends (...args: any[]) => any>(_target: any, propertyKey: string, descriptor: TypedPropertyDescriptor<T>) => TypedPropertyDescriptor<T>;
+/**
+ * For tests: reset the module-level db cache so test fixtures
+ * can simulate a fresh host install. Not used in production.
+ */
+export declare function __resetTracedAsCacheForTests(): void;
+/**
+ * For tests: returns the resolved spans.db path or null. Allows
+ * tests to assert the decorator located the host DB.
+ */
+export declare function __getResolvedSpansDbPathForTests(): string | null;
+/**
+ * Ensure the parent dir of a candidate spans.db path exists
+ * (used by tests that point at a temp file). Best-effort.
+ */
+export declare function __ensureSpansDbDirForTests(path: string): void;
+/**
+ * `withTrace(name, fn)` — manual instrumentation helper for free
+ * functions (which TS decorators cannot decorate). Runs `fn` and
+ * records a span around the invocation. Mirrors the @TracedAs
+ * contract: never throws, no-ops when spans.db is unavailable.
+ *
+ * Used by `renderSessionForestPage` and `encodeMermaidLabelText`
+ * (top-level exports that cannot carry a class-method decorator).
+ */
+export declare function withTrace<T>(name: string, fn: () => Promise<T> | T): Promise<T>;
+/**
+ * Synchronous variant of `withTrace`. Used for top-level
+ * non-async exports.
+ */
+export declare function withTraceSync<T>(name: string, fn: () => T): T;
+//# sourceMappingURL=decorator.d.ts.map

package/dist/tracing/decorator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"decorator.d.ts","sourceRoot":"","sources":["../../src/tracing/decorator.ts"],"names":[],"mappings":"AAqDA,MAAM,WAAW,eAAe;IAC9B,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,WAAW,CAAC,EAAE,OAAO,CAAC;CACvB;AA8HD;;;;;;;;;;GAUG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,eAAe,IAC9C,CAAC,SAAS,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,GAAG,EAChD,SAAS,GAAG,EACZ,aAAa,MAAM,EACnB,YAAY,uBAAuB,CAAC,CAAC,CAAC,KACrC,uBAAuB,CAAC,CAAC,CAAC,CAyD9B;AAED;;;GAGG;AACH,wBAAgB,4BAA4B,IAAI,IAAI,CAUnD;AAED;;;GAGG;AACH,wBAAgB,gCAAgC,IAAI,MAAM,GAAG,IAAI,CAEhE;AAED;;;GAGG;AACH,wBAAgB,0BAA0B,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAM7D;AAED;;;;;;;;GAQG;AACH,wBAAsB,SAAS,CAAC,CAAC,EAC/B,IAAI,EAAE,MAAM,EACZ,EAAE,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GACvB,OAAO,CAAC,CAAC,CAAC,CAgBZ;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,CAgB7D"}