contextos-mcp 0.4.0

package/dist/labs/episodic-memory.js

@@ -0,0 +1,391 @@
+/**
+ * Episodic memory — persists successful thread strategies to disk.
+ *
+ * Records episodes after successful thread completions:
+ *   - Task pattern (normalized keywords)
+ *   - Agent + model used
+ *   - Result quality (success, duration, cost, files changed)
+ *   - Task slot + complexity classification
+ *
+ * Recall: given a new task, find similar past episodes and return
+ * the strategies that worked. Used to inform agent/model selection
+ * and provide context hints to the orchestrator.
+ *
+ * Storage: JSON files in ~/.swarm/memory/episodes/ indexed by
+ * task similarity hash (trigram-based).
+ */
+import { createHash } from "node:crypto";
+import * as fs from "node:fs";
+import * as path from "node:path";
+import { redactSecrets } from "../security/secret-filter.js";
+// ── Helpers ────────────────────────────────────────────────────────────────
+/** Stop words to filter from task keywords. */
+const STOP_WORDS = new Set([
+    "the",
+    "a",
+    "an",
+    "is",
+    "are",
+    "was",
+    "were",
+    "be",
+    "been",
+    "being",
+    "have",
+    "has",
+    "had",
+    "do",
+    "does",
+    "did",
+    "will",
+    "would",
+    "could",
+    "should",
+    "may",
+    "might",
+    "shall",
+    "can",
+    "to",
+    "of",
+    "in",
+    "for",
+    "on",
+    "with",
+    "at",
+    "by",
+    "from",
+    "as",
+    "into",
+    "through",
+    "during",
+    "before",
+    "after",
+    "above",
+    "below",
+    "between",
+    "and",
+    "but",
+    "or",
+    "not",
+    "no",
+    "all",
+    "each",
+    "every",
+    "both",
+    "few",
+    "more",
+    "most",
+    "other",
+    "some",
+    "such",
+    "than",
+    "too",
+    "very",
+    "just",
+    "about",
+    "this",
+    "that",
+    "these",
+    "those",
+    "it",
+    "its",
+    "my",
+    "your",
+    "our",
+]);
+/** Extract normalized keywords from a task string. */
+function extractKeywords(task) {
+    return task
+        .toLowerCase()
+        .replace(/[^a-z0-9\s-_./]/g, " ")
+        .split(/\s+/)
+        .filter((w) => w.length > 2 && !STOP_WORDS.has(w))
+        .sort();
+}
+/** Generate trigrams from a string for fuzzy matching. */
+function trigrams(s) {
+    const padded = `  ${s.toLowerCase()}  `;
+    const result = new Set();
+    for (let i = 0; i < padded.length - 2; i++) {
+        result.add(padded.slice(i, i + 3));
+    }
+    return result;
+}
+/** Compute Jaccard similarity between two trigram sets. */
+function trigramSimilarity(a, b) {
+    if (a.size === 0 && b.size === 0)
+        return 1;
+    let intersection = 0;
+    for (const t of a) {
+        if (b.has(t))
+            intersection++;
+    }
+    const union = a.size + b.size - intersection;
+    return union === 0 ? 0 : intersection / union;
+}
+/** Generate a deterministic episode ID. */
+function episodeId(task, timestamp) {
+    return createHash("sha256").update(`${task}:${timestamp}`).digest("hex").slice(0, 16);
+}
+// ── Episodic Memory Store ──────────────────────────────────────────────────
+export class EpisodicMemory {
+    memoryDir;
+    episodes = [];
+    loaded = false;
+    maxEpisodes;
+    constructor(memoryDir, maxEpisodes = 500) {
+        this.memoryDir = path.join(memoryDir, "episodes");
+        this.maxEpisodes = maxEpisodes;
+    }
+    /** Initialize — create directory and load existing episodes. */
+    async init() {
+        fs.mkdirSync(this.memoryDir, { recursive: true });
+        await this.loadAll();
+    }
+    /** Record a new episode from a completed thread. */
+    async record(params) {
+        // Only record successful episodes — failures don't teach useful strategies
+        if (!params.success) {
+            return {
+                id: "",
+                taskKeywords: [],
+                filesChangedCount: params.filesChanged.length,
+                timestamp: Date.now(),
+                ...params,
+            };
+        }
+        const timestamp = Date.now();
+        const episode = {
+            id: episodeId(params.task, timestamp),
+            task: params.task,
+            taskKeywords: extractKeywords(params.task),
+            agent: params.agent,
+            model: params.model,
+            slot: params.slot,
+            complexity: params.complexity,
+            success: params.success,
+            durationMs: params.durationMs,
+            estimatedCostUsd: params.estimatedCostUsd,
+            filesChangedCount: params.filesChanged.length,
+            filesChanged: params.filesChanged,
+            summary: redactSecrets(params.summary.slice(0, 2000)), // Cap stored summary + redact secrets
+            timestamp,
+        };
+        this.episodes.push(episode);
+        // Evict oldest if over capacity
+        if (this.episodes.length > this.maxEpisodes) {
+            const removed = this.episodes.shift();
+            this.deleteFile(removed.id);
+        }
+        // Persist to disk
+        await this.saveEpisode(episode);
+        return episode;
+    }
+    /**
+     * Recall similar past episodes for a given task.
+     * Returns episodes sorted by similarity (highest first).
+     */
+    recall(task, maxResults = 5, minSimilarity = 0.15) {
+        if (this.episodes.length === 0)
+            return [];
+        const taskTrigrams = trigrams(task);
+        const taskKeywords = new Set(extractKeywords(task));
+        const scored = [];
+        for (const episode of this.episodes) {
+            if (!episode.success)
+                continue;
+            // Trigram similarity on full task string
+            const triSim = trigramSimilarity(taskTrigrams, trigrams(episode.task));
+            // Keyword overlap bonus
+            const epKeywords = new Set(episode.taskKeywords);
+            let keywordOverlap = 0;
+            for (const kw of taskKeywords) {
+                if (epKeywords.has(kw))
+                    keywordOverlap++;
+            }
+            const maxKeywords = Math.max(taskKeywords.size, epKeywords.size);
+            const kwSim = maxKeywords > 0 ? keywordOverlap / maxKeywords : 0;
+            // Combined similarity (weighted: trigrams 60%, keywords 40%)
+            const similarity = triSim * 0.6 + kwSim * 0.4;
+            if (similarity >= minSimilarity) {
+                scored.push({ episode, similarity });
+            }
+        }
+        return scored.sort((a, b) => b.similarity - a.similarity).slice(0, maxResults);
+    }
+    /**
+     * Get strategy recommendations based on past episodes.
+     * Returns a formatted string for inclusion in orchestrator context.
+     */
+    getStrategyHints(task) {
+        const recalls = this.recall(task, 3, 0.2);
+        if (recalls.length === 0)
+            return null;
+        const lines = ["Past successful strategies for similar tasks:"];
+        for (const { episode, similarity } of recalls) {
+            const sim = (similarity * 100).toFixed(0);
+            const cost = episode.estimatedCostUsd.toFixed(4);
+            const duration = (episode.durationMs / 1000).toFixed(1);
+            lines.push(`  - [${sim}% match] "${episode.task.slice(0, 80)}" → ` +
+                `${episode.agent}/${episode.model} (${episode.slot}, ${duration}s, $${cost}, ` +
+                `${episode.filesChangedCount} files)`);
+        }
+        return lines.join("\n");
+    }
+    /**
+     * Get the best agent/model recommendation for a task based on past episodes.
+     * Returns null if no relevant episodes found.
+     */
+    recommendStrategy(task) {
+        const recalls = this.recall(task, 5, 0.25);
+        if (recalls.length === 0)
+            return null;
+        // Score agent+model pairs as composite keys to avoid mismatched combos
+        const pairScores = new Map();
+        for (const { episode, similarity } of recalls) {
+            const quality = 1 / (1 + episode.estimatedCostUsd * 10 + episode.durationMs / 60000);
+            const score = similarity * quality;
+            const pairKey = `${episode.agent}::${episode.model}`;
+            const existing = pairScores.get(pairKey);
+            if (existing) {
+                existing.score += score;
+            }
+            else {
+                pairScores.set(pairKey, { agent: episode.agent, model: episode.model, score });
+            }
+        }
+        // Pick highest-scoring agent+model pair
+        let bestPair = null;
+        for (const pair of pairScores.values()) {
+            if (!bestPair || pair.score > bestPair.score) {
+                bestPair = pair;
+            }
+        }
+        if (!bestPair)
+            return null;
+        return {
+            agent: bestPair.agent,
+            model: bestPair.model,
+            confidence: Math.min(1, recalls[0].similarity),
+        };
+    }
+    /**
+     * Get aggregate statistics across all episodes, grouped by agent.
+     *
+     * Returns per-agent success rates, average costs/durations, slot distributions,
+     * and a file-extension-to-agent mapping. Used by the model router as a fallback
+     * when no high-confidence episodic match exists.
+     *
+     * Returns null if no episodes are loaded (graceful degradation).
+     */
+    getAggregateStats() {
+        if (this.episodes.length === 0)
+            return null;
+        const perAgent = new Map();
+        const fileExtensions = new Map();
+        for (const episode of this.episodes) {
+            if (!episode.success)
+                continue;
+            // Initialize agent stats if needed
+            let stats = perAgent.get(episode.agent);
+            if (!stats) {
+                stats = {
+                    totalEpisodes: 0,
+                    avgDurationMs: 0,
+                    avgCostUsd: 0,
+                    slotCounts: new Map(),
+                    fileExtensions: new Set(),
+                };
+                perAgent.set(episode.agent, stats);
+            }
+            // Running average: update incrementally
+            const n = stats.totalEpisodes;
+            stats.avgDurationMs = (stats.avgDurationMs * n + episode.durationMs) / (n + 1);
+            stats.avgCostUsd = (stats.avgCostUsd * n + episode.estimatedCostUsd) / (n + 1);
+            stats.totalEpisodes++;
+            // Slot counts
+            if (episode.slot) {
+                stats.slotCounts.set(episode.slot, (stats.slotCounts.get(episode.slot) || 0) + 1);
+            }
+            // Extract file extensions from changed files
+            for (const filePath of episode.filesChanged) {
+                const dotIdx = filePath.lastIndexOf(".");
+                if (dotIdx !== -1 && dotIdx < filePath.length - 1) {
+                    const ext = filePath.slice(dotIdx).toLowerCase();
+                    stats.fileExtensions.add(ext);
+                    // Update global file extension → agent mapping
+                    let agentMap = fileExtensions.get(ext);
+                    if (!agentMap) {
+                        agentMap = new Map();
+                        fileExtensions.set(ext, agentMap);
+                    }
+                    agentMap.set(episode.agent, (agentMap.get(episode.agent) || 0) + 1);
+                }
+            }
+        }
+        return { perAgent, fileExtensions };
+    }
+    /** Get total episode count. */
+    get size() {
+        return this.episodes.length;
+    }
+    /** Get all episodes (for viewer). */
+    getAll() {
+        return [...this.episodes];
+    }
+    // ── Persistence ──────────────────────────────────────────────────────────
+    async loadAll() {
+        if (this.loaded)
+            return;
+        this.loaded = true;
+        if (!fs.existsSync(this.memoryDir))
+            return;
+        let files;
+        try {
+            files = fs.readdirSync(this.memoryDir).filter((f) => f.endsWith(".json"));
+        }
+        catch {
+            return;
+        }
+        for (const file of files) {
+            try {
+                const raw = fs.readFileSync(path.join(this.memoryDir, file), "utf-8");
+                const episode = JSON.parse(raw);
+                if (episode.id && episode.task) {
+                    this.episodes.push(episode);
+                }
+            }
+            catch {
+                // Skip corrupt files
+            }
+        }
+        // Sort by timestamp (oldest first for consistent eviction)
+        this.episodes.sort((a, b) => a.timestamp - b.timestamp);
+        // Trim to max
+        while (this.episodes.length > this.maxEpisodes) {
+            const removed = this.episodes.shift();
+            this.deleteFile(removed.id);
+        }
+    }
+    async saveEpisode(episode) {
+        try {
+            const filePath = path.join(this.memoryDir, `${episode.id}.json`);
+            fs.writeFileSync(filePath, JSON.stringify(episode, null, 2), "utf-8");
+        }
+        catch {
+            // Non-fatal — memory is best-effort
+        }
+    }
+    deleteFile(id) {
+        try {
+            const filePath = path.join(this.memoryDir, `${id}.json`);
+            if (fs.existsSync(filePath)) {
+                fs.unlinkSync(filePath);
+            }
+        }
+        catch {
+            // Non-fatal
+        }
+    }
+}
+//# sourceMappingURL=episodic-memory.js.map

package/dist/labs/episodic-memory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"episodic-memory.js","sourceRoot":"","sources":["../../src/labs/episodic-memory.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;AAC9B,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAC;AAkE7D,8EAA8E;AAE9E,+CAA+C;AAC/C,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;IAC1B,KAAK;IACL,GAAG;IACH,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,KAAK;IACL,MAAM;IACN,IAAI;IACJ,MAAM;IACN,OAAO;IACP,MAAM;IACN,KAAK;IACL,KAAK;IACL,IAAI;IACJ,MAAM;IACN,KAAK;IACL,MAAM;IACN,OAAO;IACP,OAAO;IACP,QAAQ;IACR,KAAK;IACL,OAAO;IACP,OAAO;IACP,KAAK;IACL,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,MAAM;IACN,IAAI;IACJ,IAAI;IACJ,MAAM;IACN,IAAI;IACJ,MAAM;IACN,SAAS;IACT,QAAQ;IACR,QAAQ;IACR,OAAO;IACP,OAAO;IACP,OAAO;IACP,SAAS;IACT,KAAK;IACL,KAAK;IACL,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,KAAK;IACL,MAAM;IACN,OAAO;IACP,MAAM;IACN,KAAK;IACL,MAAM;IACN,MAAM;IACN,OAAO;IACP,MAAM;IACN,MAAM;IACN,MAAM;IACN,KAAK;IACL,MAAM;IACN,MAAM;IACN,OAAO;IACP,MAAM;IACN,MAAM;IACN,OAAO;IACP,OAAO;IACP,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,MAAM;IACN,KAAK;CACL,CAAC,CAAC;AAEH,sDAAsD;AACtD,SAAS,eAAe,CAAC,IAAY;IACpC,OAAO,IAAI;SACT,WAAW,EAAE;SACb,OAAO,CAAC,kBAAkB,EAAE,GAAG,CAAC;SAChC,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SACjD,IAAI,EAAE,CAAC;AACV,CAAC;AAED,0DAA0D;AAC1D,SAAS,QAAQ,CAAC,CAAS;IAC1B,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,WAAW,EAAE,IAAI,CAAC;IACxC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,2DAA2D;AAC3D,SAAS,iBAAiB,CAAC,CAAc,EAAE,CAAc;IACxD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,YAAY,EAAE,CAAC;IAC9B,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,YAAY,CAAC;IAC7C,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC;AAC/C,CAAC;AAED,2CAA2C;AAC3C,SAAS,SAAS,CAAC,IAAY,EAAE,SAAiB;IACjD,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,GAAG,IAAI,IAAI,SAAS,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AACvF,CAAC;AAED,8EAA8E;AAE9E,MAAM,OAAO,cAAc;IAClB,SAAS,CAAS;IAClB,QAAQ,GAAc,EAAE,CAAC;IACzB,MAAM,GAAY,KAAK,CAAC;IACxB,WAAW,CAAS;IAE5B,YAAY,SAAiB,EAAE,cAAsB,GAAG;QACvD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;QAClD,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IAChC,CAAC;IAED,gEAAgE;IAChE,KAAK,CAAC,IAAI;QACT,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAClD,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;IACtB,CAAC;IAED,oDAAoD;IACpD,KAAK,CAAC,MAAM,CAAC,MAWZ;QACA,2EAA2E;QAC3E,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACrB,OAAO;gBACN,EAAE,EAAE,EAAE;gBACN,YAAY,EAAE,EAAE;gBAChB,iBAAiB,EAAE,MAAM,CAAC,YAAY,CAAC,MAAM;gBAC7C,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;gBACrB,GAAG,MAAM;aACT,CAAC;QACH,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAY;YACxB,EAAE,EAAE,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC;YACrC,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,YAAY,EAAE,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC;YAC1C,KAAK,EAAE,MAAM,CAAC,KAAK;YACnB,KAAK,EAAE,MAAM,CAAC,KAAK;YACnB,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,gBAAgB,EAAE,MAAM,CAAC,gBAAgB;YACzC,iBAAiB,EAAE,MAAM,CAAC,YAAY,CAAC,MAAM;YAC7C,YAAY,EAAE,MAAM,CAAC,YAAY;YACjC,OAAO,EAAE,aAAa,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,sCAAsC;YAC7F,SAAS;SACT,CAAC;QAEF,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAE5B,gCAAgC;QAChC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAG,CAAC;YACvC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC7B,CAAC;QAED,kBAAkB;QAClB,MAAM,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAEhC,OAAO,OAAO,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,IAAY,EAAE,aAAqB,CAAC,EAAE,gBAAwB,IAAI;QACxE,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAE1C,MAAM,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;QAEpD,MAAM,MAAM,GAAoB,EAAE,CAAC;QAEnC,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACrC,IAAI,CAAC,OAAO,CAAC,OAAO;gBAAE,SAAS;YAE/B,yCAAyC;YACzC,MAAM,MAAM,GAAG,iBAAiB,CAAC,YAAY,EAAE,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YAEvE,wBAAwB;YACxB,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;YACjD,IAAI,cAAc,GAAG,CAAC,CAAC;YACvB,KAAK,MAAM,EAAE,IAAI,YAAY,EAAE,CAAC;gBAC/B,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,cAAc,EAAE,CAAC;YAC1C,CAAC;YACD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC;YACjE,MAAM,KAAK,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;YAEjE,6DAA6D;YAC7D,MAAM,UAAU,GAAG,MAAM,GAAG,GAAG,GAAG,KAAK,GAAG,GAAG,CAAC;YAE9C,IAAI,UAAU,IAAI,aAAa,EAAE,CAAC;gBACjC,MAAM,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,CAAC;YACtC,CAAC;QACF,CAAC;QAED,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAChF,CAAC;IAED;;;OAGG;IACH,gBAAgB,CAAC,IAAY;QAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;QAC1C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAEtC,MAAM,KAAK,GAAa,CAAC,+CAA+C,CAAC,CAAC;QAC1E,KAAK,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,IAAI,OAAO,EAAE,CAAC;YAC/C,MAAM,GAAG,GAAG,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC1C,MAAM,IAAI,GAAG,OAAO,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACjD,MAAM,QAAQ,GAAG,CAAC,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACxD,KAAK,CAAC,IAAI,CACT,QAAQ,GAAG,aAAa,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM;gBACtD,GAAG,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,KAAK,OAAO,CAAC,IAAI,KAAK,QAAQ,OAAO,IAAI,IAAI;gBAC9E,GAAG,OAAO,CAAC,iBAAiB,SAAS,CACtC,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED;;;OAGG;IACH,iBAAiB,CAAC,IAAY;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QAC3C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAEtC,uEAAuE;QACvE,MAAM,UAAU,GAAiE,IAAI,GAAG,EAAE,CAAC;QAE3F,KAAK,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,IAAI,OAAO,EAAE,CAAC;YAC/C,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,gBAAgB,GAAG,EAAE,GAAG,OAAO,CAAC,UAAU,GAAG,KAAK,CAAC,CAAC;YACrF,MAAM,KAAK,GAAG,UAAU,GAAG,OAAO,CAAC;YAEnC,MAAM,OAAO,GAAG,GAAG,OAAO,CAAC,KAAK,KAAK,OAAO,CAAC,KAAK,EAAE,CAAC;YACrD,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACzC,IAAI,QAAQ,EAAE,CAAC;gBACd,QAAQ,CAAC,KAAK,IAAI,KAAK,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACP,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;YAChF,CAAC;QACF,CAAC;QAED,wCAAwC;QACxC,IAAI,QAAQ,GAA2D,IAAI,CAAC;QAC5E,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;YACxC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;gBAC9C,QAAQ,GAAG,IAAI,CAAC;YACjB,CAAC;QACF,CAAC;QAED,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC;QAE3B,OAAO;YACN,KAAK,EAAE,QAAQ,CAAC,KAAK;YACrB,KAAK,EAAE,QAAQ,CAAC,KAAK;YACrB,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;SAC9C,CAAC;IACH,CAAC;IAED;;;;;;;;OAQG;IACH,iBAAiB;QAChB,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAE5C,MAAM,QAAQ,GAAqC,IAAI,GAAG,EAAE,CAAC;QAC7D,MAAM,cAAc,GAAqC,IAAI,GAAG,EAAE,CAAC;QAEnE,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACrC,IAAI,CAAC,OAAO,CAAC,OAAO;gBAAE,SAAS;YAE/B,mCAAmC;YACnC,IAAI,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACxC,IAAI,CAAC,KAAK,EAAE,CAAC;gBACZ,KAAK,GAAG;oBACP,aAAa,EAAE,CAAC;oBAChB,aAAa,EAAE,CAAC;oBAChB,UAAU,EAAE,CAAC;oBACb,UAAU,EAAE,IAAI,GAAG,EAAE;oBACrB,cAAc,EAAE,IAAI,GAAG,EAAE;iBACzB,CAAC;gBACF,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YACpC,CAAC;YAED,wCAAwC;YACxC,MAAM,CAAC,GAAG,KAAK,CAAC,aAAa,CAAC;YAC9B,KAAK,CAAC,aAAa,GAAG,CAAC,KAAK,CAAC,aAAa,GAAG,CAAC,GAAG,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/E,KAAK,CAAC,UAAU,GAAG,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,GAAG,OAAO,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/E,KAAK,CAAC,aAAa,EAAE,CAAC;YAEtB,cAAc;YACd,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC;gBAClB,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACnF,CAAC;YAED,6CAA6C;YAC7C,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;gBAC7C,MAAM,MAAM,GAAG,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;gBACzC,IAAI,MAAM,KAAK,CAAC,CAAC,IAAI,MAAM,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACnD,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC;oBACjD,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAE9B,+CAA+C;oBAC/C,IAAI,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACvC,IAAI,CAAC,QAAQ,EAAE,CAAC;wBACf,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;wBACrB,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;oBACnC,CAAC;oBACD,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrE,CAAC;YACF,CAAC;QACF,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC;IACrC,CAAC;IAED,+BAA+B;IAC/B,IAAI,IAAI;QACP,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC7B,CAAC;IAED,qCAAqC;IACrC,MAAM;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC3B,CAAC;IAED,4EAA4E;IAEpE,KAAK,CAAC,OAAO;QACpB,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO;QACxB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QAEnB,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC;YAAE,OAAO;QAE3C,IAAI,KAAe,CAAC;QACpB,IAAI,CAAC;YACJ,KAAK,GAAG,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC;QAC3E,CAAC;QAAC,MAAM,CAAC;YACR,OAAO;QACR,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YAC1B,IAAI,CAAC;gBACJ,MAAM,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE,OAAO,CAAC,CAAC;gBACtE,MAAM,OAAO,GAAY,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACzC,IAAI,OAAO,CAAC,EAAE,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC;oBAChC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAC7B,CAAC;YACF,CAAC;YAAC,MAAM,CAAC;gBACR,qBAAqB;YACtB,CAAC;QACF,CAAC;QAED,2DAA2D;QAC3D,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;QAExD,cAAc;QACd,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAChD,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAG,CAAC;YACvC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC7B,CAAC;IACF,CAAC;IAEO,KAAK,CAAC,WAAW,CAAC,OAAgB;QACzC,IAAI,CAAC;YACJ,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;YACjE,EAAE,CAAC,aAAa,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QACvE,CAAC;QAAC,MAAM,CAAC;YACR,oCAAoC;QACrC,CAAC;IACF,CAAC;IAEO,UAAU,CAAC,EAAU;QAC5B,IAAI,CAAC;YACJ,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;YACzD,IAAI,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC7B,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YACzB,CAAC;QACF,CAAC;QAAC,MAAM,CAAC;YACR,YAAY;QACb,CAAC;IACF,CAAC;CACD"}

package/dist/labs/interactive-swarm.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Interactive swarm REPL — a persistent session for follow-up tasks,
+ * thread inspection, manual merge/reject, and live DAG visualization.
+ *
+ * Usage: swarm --dir ./project   (no query argument enters interactive mode)
+ *
+ * Commands:
+ *   <task>          Run a task through the RLM orchestrator
+ *   /threads (/t)   List all threads with status, cost, duration
+ *   /thread <id>    Show detailed info for a specific thread
+ *   /merge [id...]  Merge specific thread branches (or all if no args)
+ *   /reject <id>    Discard a thread's worktree and branch
+ *   /dag            Show thread dependency DAG with status indicators
+ *   /budget         Show budget state
+ *   /status         Overall session status
+ *   /help           Show available commands
+ *   /quit (/exit)   Cleanup and exit
+ */
+import "./env.js";
+export declare function runInteractiveSwarm(rawArgs: string[]): Promise<void>;