cortex-mcp 1.0.1

package/dist/db/memory-store.js

@@ -0,0 +1,370 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MemoryStore = void 0;
+/**
+ * Memory Store — CRUD for memory_units, edges, and vector search.
+ * Uses JS cosine similarity for M1 (no native extension needed).
+ */
+const uuid_1 = require("uuid");
+class MemoryStore {
+    db;
+    // Prepared statements
+    insertMemoryStmt;
+    updateMemoryStmt;
+    getMemoryStmt;
+    deactivateStmt;
+    touchStmt;
+    insertEdgeStmt;
+    insertVectorStmt;
+    // In-memory vector index (JS fallback for M1)
+    vectors = new Map();
+    constructor(database) {
+        this.db = database.connection;
+        // Create vector table (simple key-value for M1)
+        this.db.exec(`
+      CREATE TABLE IF NOT EXISTS memory_vectors (
+        id TEXT PRIMARY KEY,
+        embedding BLOB NOT NULL
+      )
+    `);
+        // Index for faster filtering by type/status
+        this.db.exec(`CREATE INDEX IF NOT EXISTS idx_memories_type_active ON memory_units(type, is_active);`);
+        this.db.exec(`CREATE INDEX IF NOT EXISTS idx_memories_created ON memory_units(created_at);`);
+        this.insertMemoryStmt = this.db.prepare(`
+      INSERT INTO memory_units (
+        id, type, intent, action, reason, impact, outcome,
+        related_files, code_snippet, tags, timestamp,
+        confidence, importance, access_count, last_accessed,
+        superseded_by, is_active, source_event_id, created_at
+      ) VALUES (
+        @id, @type, @intent, @action, @reason, @impact, @outcome,
+        @relatedFiles, @codeSnippet, @tags, @timestamp,
+        @confidence, @importance, 0, NULL,
+        NULL, 1, @sourceEventId, @createdAt
+      )
+    `);
+        this.updateMemoryStmt = this.db.prepare(`
+      UPDATE memory_units SET
+        intent = @intent, action = @action, reason = @reason,
+        impact = @impact, outcome = @outcome,
+        related_files = @relatedFiles, code_snippet = @codeSnippet,
+        tags = @tags, confidence = @confidence, importance = @importance,
+        timestamp = @timestamp
+      WHERE id = @id
+    `);
+        this.getMemoryStmt = this.db.prepare('SELECT * FROM memory_units WHERE id = ?');
+        this.deactivateStmt = this.db.prepare('UPDATE memory_units SET is_active = 0, superseded_by = @supersededBy WHERE id = @id');
+        this.touchStmt = this.db.prepare('UPDATE memory_units SET access_count = access_count + 1, last_accessed = @lastAccessed WHERE id = @id');
+        this.insertEdgeStmt = this.db.prepare(`
+      INSERT OR REPLACE INTO edges (source_id, target_id, relation, weight, timestamp)
+      VALUES (@sourceId, @targetId, @relation, @weight, @timestamp)
+    `);
+        this.insertVectorStmt = this.db.prepare('INSERT OR REPLACE INTO memory_vectors (id, embedding) VALUES (@id, @embedding)');
+        // Load existing vectors into memory for fast JS cosine search
+        this.loadVectors();
+    }
+    // ═══ MEMORY CRUD ═══
+    /** Create a new memory unit (with deduplication) */
+    add(memory) {
+        // ── Deduplication: skip if very similar memory already exists ──
+        const duplicate = this.findDuplicate(memory.type, memory.intent);
+        if (duplicate) {
+            // Touch the existing memory to refresh its recency
+            this.touch(duplicate.id);
+            return duplicate;
+        }
+        const now = Date.now();
+        const id = memory.id || (0, uuid_1.v4)();
+        const full = {
+            id,
+            type: memory.type,
+            intent: memory.intent,
+            action: memory.action,
+            reason: memory.reason,
+            impact: memory.impact,
+            outcome: memory.outcome || 'unknown',
+            relatedFiles: memory.relatedFiles || [],
+            codeSnippet: memory.codeSnippet,
+            tags: memory.tags || [],
+            timestamp: memory.timestamp || now,
+            confidence: memory.confidence ?? 0.5,
+            importance: memory.importance ?? 0.5,
+            accessCount: 0,
+            lastAccessed: undefined,
+            supersededBy: undefined,
+            isActive: true,
+            sourceEventId: memory.sourceEventId,
+            createdAt: now,
+        };
+        this.insertMemoryStmt.run({
+            id: full.id,
+            type: full.type,
+            intent: full.intent,
+            action: full.action,
+            reason: full.reason || null,
+            impact: full.impact || null,
+            outcome: full.outcome,
+            relatedFiles: JSON.stringify(full.relatedFiles),
+            codeSnippet: full.codeSnippet || null,
+            tags: JSON.stringify(full.tags),
+            timestamp: full.timestamp,
+            confidence: full.confidence,
+            importance: full.importance,
+            sourceEventId: full.sourceEventId || null,
+            createdAt: full.createdAt,
+        });
+        return full;
+    }
+    /**
+     * Find a duplicate memory by type + intent similarity.
+     * Uses word-overlap (Jaccard similarity) — no ML needed.
+     * Returns existing memory if similarity > 0.7, else undefined.
+     */
+    findDuplicate(type, intent) {
+        const candidates = this.db
+            .prepare('SELECT * FROM memory_units WHERE type = ? AND is_active = 1 LIMIT 200')
+            .all(type);
+        const newWords = new Set(this.tokenize(intent));
+        if (newWords.size === 0)
+            return undefined;
+        for (const row of candidates) {
+            const existingWords = new Set(this.tokenize(row.intent));
+            const intersection = [...newWords].filter(w => existingWords.has(w)).length;
+            const union = new Set([...newWords, ...existingWords]).size;
+            const similarity = union > 0 ? intersection / union : 0;
+            if (similarity >= 0.7) {
+                return this.rowToMemory(row);
+            }
+        }
+        return undefined;
+    }
+    /** Tokenize text into lowercase words (stop-word filtered) */
+    tokenize(text) {
+        const STOP_WORDS = new Set(['the', 'a', 'an', 'is', 'are', 'was', 'were', 'to', 'of', 'in', 'for', 'on', 'with', 'at', 'by', 'from', 'use', 'always', 'never', 'should', 'must', 'not', 'do', 'be', 'it', 'this', 'that', 'and', 'or', 'but']);
+        return text
+            .toLowerCase()
+            .replace(/[^a-z0-9\s]/g, ' ')
+            .split(/\s+/)
+            .filter(w => w.length > 2 && !STOP_WORDS.has(w));
+    }
+    /** Update an existing memory */
+    update(id, updates) {
+        const existing = this.get(id);
+        if (!existing)
+            return;
+        this.updateMemoryStmt.run({
+            id,
+            intent: updates.intent || existing.intent,
+            action: updates.action || existing.action,
+            reason: updates.reason ?? existing.reason ?? null,
+            impact: updates.impact ?? existing.impact ?? null,
+            outcome: updates.outcome ?? existing.outcome,
+            relatedFiles: JSON.stringify(updates.relatedFiles || existing.relatedFiles),
+            codeSnippet: updates.codeSnippet ?? existing.codeSnippet ?? null,
+            tags: JSON.stringify(updates.tags || existing.tags),
+            confidence: updates.confidence ?? existing.confidence,
+            importance: updates.importance ?? existing.importance,
+            timestamp: updates.timestamp || existing.timestamp,
+        });
+    }
+    /** Get a memory by ID */
+    get(id) {
+        const row = this.getMemoryStmt.get(id);
+        return row ? this.rowToMemory(row) : undefined;
+    }
+    /** Deactivate a memory (soft delete) */
+    deactivate(id, supersededBy) {
+        this.deactivateStmt.run({ supersededBy: supersededBy || null, id });
+    }
+    /** Record an access (for importance tracking) */
+    touch(id) {
+        this.touchStmt.run({ lastAccessed: Date.now(), id });
+    }
+    /** Get all active memories */
+    getActive(limit = 1000) {
+        const rows = this.db
+            .prepare('SELECT * FROM memory_units WHERE is_active = 1 ORDER BY timestamp DESC LIMIT ?')
+            .all(limit);
+        return rows.map(this.rowToMemory);
+    }
+    /** Get memories by type */
+    getByType(type, limit = 100) {
+        const rows = this.db
+            .prepare('SELECT * FROM memory_units WHERE type = ? AND is_active = 1 ORDER BY timestamp DESC LIMIT ?')
+            .all(type, limit);
+        return rows.map(this.rowToMemory);
+    }
+    /** Get memories related to a file */
+    getByFile(filePath, limit = 50) {
+        // Search in related_files JSON array
+        const rows = this.db
+            .prepare(`SELECT * FROM memory_units WHERE is_active = 1 
+        AND related_files LIKE ? ORDER BY timestamp DESC LIMIT ?`)
+            .all(`%${filePath}%`, limit);
+        return rows.map(this.rowToMemory);
+    }
+    /** Full-text search via FTS5 */
+    searchFTS(query, limit = 20) {
+        const rows = this.db
+            .prepare(`
+        SELECT m.*, fts.rank
+        FROM memory_fts fts
+        JOIN memory_units m ON m.id = fts.id
+        WHERE memory_fts MATCH ? AND m.is_active = 1
+        ORDER BY fts.rank
+        LIMIT ?
+      `)
+            .all(query, limit);
+        return rows.map((row) => ({
+            memory: this.rowToMemory(row),
+            score: -row.rank, // FTS5 rank is negative (lower = better)
+            matchMethod: 'fts',
+        }));
+    }
+    // ═══ VECTOR SEARCH (JS cosine similarity — M1 fallback) ═══
+    /** Store a vector embedding */
+    storeVector(id, embedding) {
+        const buffer = Buffer.from(embedding.buffer);
+        this.insertVectorStmt.run({ id, embedding: buffer });
+        this.vectors.set(id, embedding);
+    }
+    /** Search by vector similarity */
+    searchVector(queryEmbedding, limit = 20) {
+        const results = [];
+        for (const [id, vec] of this.vectors) {
+            const sim = this.cosineSimilarity(queryEmbedding, vec);
+            results.push({ id, score: sim });
+        }
+        results.sort((a, b) => b.score - a.score);
+        return results.slice(0, limit).map((r) => {
+            const memory = this.get(r.id);
+            return {
+                memory: memory,
+                score: r.score,
+                matchMethod: 'vector',
+            };
+        }).filter((r) => r.memory && r.memory.isActive);
+    }
+    cosineSimilarity(a, b) {
+        let dot = 0, magA = 0, magB = 0;
+        for (let i = 0; i < a.length; i++) {
+            dot += a[i] * b[i];
+            magA += a[i] * a[i];
+            magB += b[i] * b[i];
+        }
+        const mag = Math.sqrt(magA) * Math.sqrt(magB);
+        return mag === 0 ? 0 : dot / mag;
+    }
+    loadVectors() {
+        const rows = this.db.prepare('SELECT id, embedding FROM memory_vectors').all();
+        for (const row of rows) {
+            const buffer = row.embedding;
+            const embedding = new Float32Array(buffer.buffer, buffer.byteOffset, buffer.length / 4);
+            this.vectors.set(row.id, embedding);
+        }
+    }
+    // ═══ GRAPH EDGES ═══
+    /** Add an edge between memories */
+    addEdge(edge) {
+        this.insertEdgeStmt.run({
+            sourceId: edge.sourceId,
+            targetId: edge.targetId,
+            relation: edge.relation,
+            weight: edge.weight,
+            timestamp: edge.timestamp,
+        });
+    }
+    /** Get edges from a source memory */
+    getEdgesFrom(sourceId) {
+        return this.db
+            .prepare('SELECT * FROM edges WHERE source_id = ?')
+            .all(sourceId);
+    }
+    /** Get edges to a target memory */
+    getEdgesTo(targetId) {
+        return this.db
+            .prepare('SELECT * FROM edges WHERE target_id = ?')
+            .all(targetId);
+    }
+    /** Graph traversal — find related memories within N hops */
+    getRelated(memoryId, maxHops = 2, limit = 20) {
+        // Recursive CTE for graph traversal
+        const rows = this.db
+            .prepare(`
+        WITH RECURSIVE related(id, depth, path) AS (
+          SELECT target_id, 1, source_id || '→' || target_id
+          FROM edges WHERE source_id = ?
+          UNION ALL
+          SELECT e.target_id, r.depth + 1, r.path || '→' || e.target_id
+          FROM edges e
+          JOIN related r ON e.source_id = r.id
+          WHERE r.depth < ?
+            AND r.path NOT LIKE '%' || e.target_id || '%'
+        )
+        SELECT DISTINCT m.*, r.depth
+        FROM related r
+        JOIN memory_units m ON m.id = r.id
+        WHERE m.is_active = 1
+        ORDER BY r.depth ASC
+        LIMIT ?
+      `)
+            .all(memoryId, maxHops, limit);
+        return rows.map((row) => ({
+            memory: this.rowToMemory(row),
+            score: 1.0 / (row.depth + 1), // closer = higher score
+            matchMethod: 'graph',
+        }));
+    }
+    // ═══ STATS ═══
+    /** Total active memories */
+    activeCount() {
+        const row = this.db
+            .prepare('SELECT COUNT(*) as cnt FROM memory_units WHERE is_active = 1')
+            .get();
+        return row.cnt;
+    }
+    /** Total memories (including inactive) */
+    totalCount() {
+        const row = this.db
+            .prepare('SELECT COUNT(*) as cnt FROM memory_units')
+            .get();
+        return row.cnt;
+    }
+    // ═══ HELPERS ═══
+    rowToMemory(row) {
+        return {
+            id: row.id,
+            type: row.type,
+            intent: row.intent,
+            action: row.action,
+            reason: row.reason || undefined,
+            impact: row.impact || undefined,
+            outcome: row.outcome || 'unknown',
+            relatedFiles: row.related_files ? JSON.parse(row.related_files) : [],
+            codeSnippet: row.code_snippet || undefined,
+            tags: row.tags ? JSON.parse(row.tags) : [],
+            timestamp: row.timestamp,
+            confidence: row.confidence,
+            importance: row.importance,
+            accessCount: row.access_count,
+            lastAccessed: row.last_accessed || undefined,
+            supersededBy: row.superseded_by || undefined,
+            isActive: row.is_active === 1,
+            sourceEventId: row.source_event_id || undefined,
+            createdAt: row.created_at,
+        };
+    }
+    rebuildIndex() {
+        console.log('  [cortex-mcp] Rebuilding FTS5 Search Index...');
+        try {
+            this.db.exec("INSERT INTO memory_fts(memory_fts) VALUES('rebuild');");
+            this.db.exec("VACUUM;");
+            console.log('  [cortex-mcp] Index rebuilt and database optimized.');
+        }
+        catch (err) {
+            console.error('  [ERROR] Rebuild failed:', err.message);
+        }
+    }
+}
+exports.MemoryStore = MemoryStore;
+//# sourceMappingURL=memory-store.js.map

package/dist/db/memory-store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-store.js","sourceRoot":"","sources":["../../src/db/memory-store.ts"],"names":[],"mappings":";;;AAAA;;;GAGG;AACH,+BAAoC;AAUpC,MAAa,WAAW;IACZ,EAAE,CAAiB;IAE3B,sBAAsB;IACd,gBAAgB,CAAwC;IACxD,gBAAgB,CAAwC;IACxD,aAAa,CAAwC;IACrD,cAAc,CAAwC;IACtD,SAAS,CAAwC;IACjD,cAAc,CAAwC;IACtD,gBAAgB,CAAwC;IAEhE,8CAA8C;IACtC,OAAO,GAA8B,IAAI,GAAG,EAAE,CAAC;IAEvD,YAAY,QAA2B;QACnC,IAAI,CAAC,EAAE,GAAG,QAAQ,CAAC,UAAU,CAAC;QAE9B,gDAAgD;QAChD,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;;;;KAKhB,CAAC,CAAC;QAEC,4CAA4C;QAC5C,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,uFAAuF,CAAC,CAAC;QACtG,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,8EAA8E,CAAC,CAAC;QAE7F,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;;;KAY3C,CAAC,CAAC;QAEC,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;;KAQ3C,CAAC,CAAC;QAEC,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAChC,yCAAyC,CAC5C,CAAC;QAEF,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CACjC,qFAAqF,CACxF,CAAC;QAEF,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC5B,uGAAuG,CAC1G,CAAC;QAEF,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;KAGzC,CAAC,CAAC;QAEC,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CACnC,gFAAgF,CACnF,CAAC;QAEF,8DAA8D;QAC9D,IAAI,CAAC,WAAW,EAAE,CAAC;IACvB,CAAC;IAED,sBAAsB;IAEtB,oDAAoD;IACpD,GAAG,CAAC,MAAkF;QAClF,kEAAkE;QAClE,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QACjE,IAAI,SAAS,EAAE,CAAC;YACZ,mDAAmD;YACnD,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YACzB,OAAO,SAAS,CAAC;QACrB,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,IAAI,IAAA,SAAM,GAAE,CAAC;QAEjC,MAAM,IAAI,GAAe;YACrB,EAAE;YACF,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,OAAO,EAAE,MAAM,CAAC,OAAO,IAAI,SAAS;YACpC,YAAY,EAAE,MAAM,CAAC,YAAY,IAAI,EAAE;YACvC,WAAW,EAAE,MAAM,CAAC,WAAW;YAC/B,IAAI,EAAE,MAAM,CAAC,IAAI,IAAI,EAAE;YACvB,SAAS,EAAE,MAAM,CAAC,SAAS,IAAI,GAAG;YAClC,UAAU,EAAE,MAAM,CAAC,UAAU,IAAI,GAAG;YACpC,UAAU,EAAE,MAAM,CAAC,UAAU,IAAI,GAAG;YACpC,WAAW,EAAE,CAAC;YACd,YAAY,EAAE,SAAS;YACvB,YAAY,EAAE,SAAS;YACvB,QAAQ,EAAE,IAAI;YACd,aAAa,EAAE,MAAM,CAAC,aAAa;YACnC,SAAS,EAAE,GAAG;SACjB,CAAC;QAEF,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC;YACtB,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,IAAI;YAC3B,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,IAAI;YAC3B,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,YAAY,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC;YAC/C,WAAW,EAAE,IAAI,CAAC,WAAW,IAAI,IAAI;YACrC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;YAC/B,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,aAAa,EAAE,IAAI,CAAC,aAAa,IAAI,IAAI;YACzC,SAAS,EAAE,IAAI,CAAC,SAAS;SAC5B,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACK,aAAa,CAAC,IAAgB,EAAE,MAAc;QAClD,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE;aACrB,OAAO,CAAC,uEAAuE,CAAC;aAChF,GAAG,CAAC,IAAI,CAAU,CAAC;QAExB,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;QAChD,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAE1C,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC3B,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;YACzD,MAAM,YAAY,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YAC5E,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC;YAC5D,MAAM,UAAU,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACxD,IAAI,UAAU,IAAI,GAAG,EAAE,CAAC;gBACpB,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;YACjC,CAAC;QACL,CAAC;QACD,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,8DAA8D;IACtD,QAAQ,CAAC,IAAY;QACzB,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;QAC/O,OAAO,IAAI;aACN,WAAW,EAAE;aACb,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC;aAC5B,KAAK,CAAC,KAAK,CAAC;aACZ,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IAGD,gCAAgC;IAChC,MAAM,CAAC,EAAU,EAAE,OAA4B;QAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC9B,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEtB,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC;YACtB,EAAE;YACF,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM;YACzC,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM;YACzC,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM,IAAI,IAAI;YACjD,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM,IAAI,IAAI;YACjD,OAAO,EAAE,OAAO,CAAC,OAAO,IAAI,QAAQ,CAAC,OAAO;YAC5C,YAAY,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,YAAY,IAAI,QAAQ,CAAC,YAAY,CAAC;YAC3E,WAAW,EAAE,OAAO,CAAC,WAAW,IAAI,QAAQ,CAAC,WAAW,IAAI,IAAI;YAChE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,IAAI,QAAQ,CAAC,IAAI,CAAC;YACnD,UAAU,EAAE,OAAO,CAAC,UAAU,IAAI,QAAQ,CAAC,UAAU;YACrD,UAAU,EAAE,OAAO,CAAC,UAAU,IAAI,QAAQ,CAAC,UAAU;YACrD,SAAS,EAAE,OAAO,CAAC,SAAS,IAAI,QAAQ,CAAC,SAAS;SACrD,CAAC,CAAC;IACP,CAAC;IAED,yBAAyB;IACzB,GAAG,CAAC,EAAU;QACV,MAAM,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAQ,CAAC;QAC9C,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACnD,CAAC;IAED,wCAAwC;IACxC,UAAU,CAAC,EAAU,EAAE,YAAqB;QACxC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,YAAY,EAAE,YAAY,IAAI,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;IACxE,CAAC;IAED,iDAAiD;IACjD,KAAK,CAAC,EAAU;QACZ,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IACzD,CAAC;IAED,8BAA8B;IAC9B,SAAS,CAAC,QAAgB,IAAI;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACf,OAAO,CAAC,gFAAgF,CAAC;aACzF,GAAG,CAAC,KAAK,CAAU,CAAC;QACzB,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACtC,CAAC;IAED,2BAA2B;IAC3B,SAAS,CAAC,IAAgB,EAAE,QAAgB,GAAG;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACf,OAAO,CAAC,6FAA6F,CAAC;aACtG,GAAG,CAAC,IAAI,EAAE,KAAK,CAAU,CAAC;QAC/B,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACtC,CAAC;IAED,qCAAqC;IACrC,SAAS,CAAC,QAAgB,EAAE,QAAgB,EAAE;QAC1C,qCAAqC;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACf,OAAO,CAAC;iEAC4C,CAAC;aACrD,GAAG,CAAC,IAAI,QAAQ,GAAG,EAAE,KAAK,CAAU,CAAC;QAC1C,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACtC,CAAC;IAED,gCAAgC;IAChC,SAAS,CAAC,KAAa,EAAE,QAAgB,EAAE;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACf,OAAO,CAAC;;;;;;;OAOd,CAAC;aACK,GAAG,CAAC,KAAK,EAAE,KAAK,CAAU,CAAC;QAEhC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YACtB,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;YAC7B,KAAK,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,yCAAyC;YAC3D,WAAW,EAAE,KAAK;SACrB,CAAC,CAAC,CAAC;IACR,CAAC;IAED,6DAA6D;IAE7D,+BAA+B;IAC/B,WAAW,CAAC,EAAU,EAAE,SAAuB;QAC3C,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC;QACrD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;IACpC,CAAC;IAED,kCAAkC;IAClC,YAAY,CAAC,cAA4B,EAAE,QAAgB,EAAE;QACzD,MAAM,OAAO,GAAyC,EAAE,CAAC;QAEzD,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACnC,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC;YACvD,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;QACrC,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAE1C,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACrC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC9B,OAAO;gBACH,MAAM,EAAE,MAAO;gBACf,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,WAAW,EAAE,QAAQ;aACxB,CAAC;QACN,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACpD,CAAC;IAEO,gBAAgB,CAAC,CAAe,EAAE,CAAe;QACrD,IAAI,GAAG,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC;IACrC,CAAC;IAEO,WAAW;QACf,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,0CAA0C,CAAC,CAAC,GAAG,EAAW,CAAC;QACxF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACrB,MAAM,MAAM,GAAG,GAAG,CAAC,SAAmB,CAAC;YACvC,MAAM,SAAS,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACxF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QACxC,CAAC;IACL,CAAC;IAED,sBAAsB;IAEtB,mCAAmC;IACnC,OAAO,CAAC,IAAe;QACnB,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC;YACpB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,SAAS,EAAE,IAAI,CAAC,SAAS;SAC5B,CAAC,CAAC;IACP,CAAC;IAED,qCAAqC;IACrC,YAAY,CAAC,QAAgB;QACzB,OAAO,IAAI,CAAC,EAAE;aACT,OAAO,CAAC,yCAAyC,CAAC;aAClD,GAAG,CAAC,QAAQ,CAAU,CAAC;IAChC,CAAC;IAED,mCAAmC;IACnC,UAAU,CAAC,QAAgB;QACvB,OAAO,IAAI,CAAC,EAAE;aACT,OAAO,CAAC,yCAAyC,CAAC;aAClD,GAAG,CAAC,QAAQ,CAAU,CAAC;IAChC,CAAC;IAED,4DAA4D;IAC5D,UAAU,CAAC,QAAgB,EAAE,UAAkB,CAAC,EAAE,QAAgB,EAAE;QAChE,oCAAoC;QACpC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACf,OAAO,CAAC;;;;;;;;;;;;;;;;;OAiBd,CAAC;aACK,GAAG,CAAC,QAAQ,EAAE,OAAO,EAAE,KAAK,CAAU,CAAC;QAE5C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YACtB,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;YAC7B,KAAK,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,wBAAwB;YACtD,WAAW,EAAE,OAAO;SACvB,CAAC,CAAC,CAAC;IACR,CAAC;IAED,gBAAgB;IAEhB,4BAA4B;IAC5B,WAAW;QACP,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE;aACd,OAAO,CAAC,8DAA8D,CAAC;aACvE,GAAG,EAAqB,CAAC;QAC9B,OAAO,GAAG,CAAC,GAAG,CAAC;IACnB,CAAC;IAED,0CAA0C;IAC1C,UAAU;QACN,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE;aACd,OAAO,CAAC,0CAA0C,CAAC;aACnD,GAAG,EAAqB,CAAC;QAC9B,OAAO,GAAG,CAAC,GAAG,CAAC;IACnB,CAAC;IAED,kBAAkB;IAEV,WAAW,CAAC,GAAQ;QACxB,OAAO;YACH,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,MAAM,EAAE,GAAG,CAAC,MAAM,IAAI,SAAS;YAC/B,MAAM,EAAE,GAAG,CAAC,MAAM,IAAI,SAAS;YAC/B,OAAO,EAAE,GAAG,CAAC,OAAO,IAAI,SAAS;YACjC,YAAY,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE;YACpE,WAAW,EAAE,GAAG,CAAC,YAAY,IAAI,SAAS;YAC1C,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;YAC1C,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,WAAW,EAAE,GAAG,CAAC,YAAY;YAC7B,YAAY,EAAE,GAAG,CAAC,aAAa,IAAI,SAAS;YAC5C,YAAY,EAAE,GAAG,CAAC,aAAa,IAAI,SAAS;YAC5C,QAAQ,EAAE,GAAG,CAAC,SAAS,KAAK,CAAC;YAC7B,aAAa,EAAE,GAAG,CAAC,eAAe,IAAI,SAAS;YAC/C,SAAS,EAAE,GAAG,CAAC,UAAU;SAC5B,CAAC;IACN,CAAC;IAEM,YAAY;QACf,OAAO,CAAC,GAAG,CAAC,gDAAgD,CAAC,CAAC;QAC9D,IAAI,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,uDAAuD,CAAC,CAAC;YACtE,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACxB,OAAO,CAAC,GAAG,CAAC,sDAAsD,CAAC,CAAC;QACxE,CAAC;QAAC,OAAO,GAAQ,EAAE,CAAC;YAChB,OAAO,CAAC,KAAK,CAAC,2BAA2B,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;QAC5D,CAAC;IACL,CAAC;CACJ;AAlaD,kCAkaC"}

package/dist/embedding-worker.d.ts

@@ -0,0 +1,3 @@
+#!/usr/bin/env node
+export {};
+//# sourceMappingURL=embedding-worker.d.ts.map

package/dist/embedding-worker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"embedding-worker.d.ts","sourceRoot":"","sources":["../src/embedding-worker.ts"],"names":[],"mappings":""}

package/dist/embedding-worker.js

@@ -0,0 +1,94 @@
+#!/usr/bin/env node
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Embedding Worker Thread — Runs MiniLM in a separate thread.
+ *
+ * Never blocks the main event loop. Main thread sends text,
+ * worker returns Float32Array embeddings asynchronously.
+ */
+// SILENCE WORKER THREAD (prevent protocol corruption)
+console.log = () => { };
+console.warn = () => { };
+console.error = () => { };
+const worker_threads_1 = require("worker_threads");
+let pipeline = null;
+let modelReady = false;
+async function loadModel() {
+    try {
+        const { pipeline: createPipeline } = await Promise.resolve().then(() => __importStar(require('@xenova/transformers')));
+        pipeline = await createPipeline('feature-extraction', 'Xenova/all-MiniLM-L6-v2', {
+            quantized: true,
+            progress_callback: (x) => { }, // SILENCE PROGRESS BARS
+        });
+        modelReady = true;
+        worker_threads_1.parentPort?.postMessage({ type: 'ready' });
+    }
+    catch (err) {
+        worker_threads_1.parentPort?.postMessage({ type: 'error', id: '__init__', message: err.message });
+    }
+}
+worker_threads_1.parentPort?.on('message', async (msg) => {
+    if (msg.type !== 'embed')
+        return;
+    if (!modelReady) {
+        worker_threads_1.parentPort?.postMessage({
+            type: 'error',
+            id: msg.id,
+            message: 'Model not ready yet',
+        });
+        return;
+    }
+    try {
+        const output = await pipeline(msg.text, { pooling: 'mean', normalize: true });
+        const vector = Array.from(output.data);
+        worker_threads_1.parentPort?.postMessage({
+            type: 'result',
+            id: msg.id,
+            vector,
+        });
+    }
+    catch (err) {
+        worker_threads_1.parentPort?.postMessage({
+            type: 'error',
+            id: msg.id,
+            message: err.message,
+        });
+    }
+});
+// Start loading immediately
+loadModel();
+//# sourceMappingURL=embedding-worker.js.map

package/dist/embedding-worker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"embedding-worker.js","sourceRoot":"","sources":["../src/embedding-worker.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AACA;;;;;GAKG;AACH,sDAAsD;AACtD,OAAO,CAAC,GAAG,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC;AACxB,OAAO,CAAC,IAAI,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC;AACzB,OAAO,CAAC,KAAK,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC;AAE1B,mDAA4C;AAE5C,IAAI,QAAQ,GAAQ,IAAI,CAAC;AACzB,IAAI,UAAU,GAAG,KAAK,CAAC;AAwBvB,KAAK,UAAU,SAAS;IACpB,IAAI,CAAC;QACD,MAAM,EAAE,QAAQ,EAAE,cAAc,EAAE,GAAG,wDAAa,sBAAsB,GAAC,CAAC;QAE1E,QAAQ,GAAG,MAAM,cAAc,CAAC,oBAAoB,EAAE,yBAAyB,EAAE;YAC7E,SAAS,EAAE,IAAI;YACf,iBAAiB,EAAE,CAAC,CAAM,EAAE,EAAE,GAAG,CAAC,EAAE,wBAAwB;SAC/D,CAAC,CAAC;QACH,UAAU,GAAG,IAAI,CAAC;QAClB,2BAAU,EAAE,WAAW,CAAC,EAAE,IAAI,EAAE,OAAO,EAAmB,CAAC,CAAC;IAChE,CAAC;IAAC,OAAO,GAAQ,EAAE,CAAC;QAChB,2BAAU,EAAE,WAAW,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,UAAU,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAmB,CAAC,CAAC;IACtG,CAAC;AACL,CAAC;AAED,2BAAU,EAAE,EAAE,CAAC,SAAS,EAAE,KAAK,EAAE,GAAiB,EAAE,EAAE;IAClD,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO;QAAE,OAAO;IAEjC,IAAI,CAAC,UAAU,EAAE,CAAC;QACd,2BAAU,EAAE,WAAW,CAAC;YACpB,IAAI,EAAE,OAAO;YACb,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,OAAO,EAAE,qBAAqB;SAChB,CAAC,CAAC;QACpB,OAAO;IACX,CAAC;IAED,IAAI,CAAC;QACD,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC9E,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAoB,CAAC,CAAC;QACvD,2BAAU,EAAE,WAAW,CAAC;YACpB,IAAI,EAAE,QAAQ;YACd,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,MAAM;SACQ,CAAC,CAAC;IACxB,CAAC;IAAC,OAAO,GAAQ,EAAE,CAAC;QAChB,2BAAU,EAAE,WAAW,CAAC;YACpB,IAAI,EAAE,OAAO;YACb,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,OAAO,EAAE,GAAG,CAAC,OAAO;SACN,CAAC,CAAC;IACxB,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,4BAA4B;AAC5B,SAAS,EAAE,CAAC"}

package/dist/hooks/cortex-run.d.ts

@@ -0,0 +1,15 @@
+#!/usr/bin/env node
+/**
+ * Cortex Run — Wraps any command and captures errors as memories.
+ *
+ * Usage:
+ *   cortex-run npm test
+ *   cortex-run npm run build
+ *   cortex-run python main.py
+ *
+ * If the command fails, captures the error output as a BUG_FIX memory
+ * so the AI knows about it in future conversations.
+ * If the command succeeds, captures a brief success note.
+ */
+export {};
+//# sourceMappingURL=cortex-run.d.ts.map

package/dist/hooks/cortex-run.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cortex-run.d.ts","sourceRoot":"","sources":["../../src/hooks/cortex-run.ts"],"names":[],"mappings":";AACA;;;;;;;;;;;GAWG"}

package/dist/hooks/cortex-run.js

@@ -0,0 +1,148 @@
+#!/usr/bin/env node
+"use strict";
+/**
+ * Cortex Run — Wraps any command and captures errors as memories.
+ *
+ * Usage:
+ *   cortex-run npm test
+ *   cortex-run npm run build
+ *   cortex-run python main.py
+ *
+ * If the command fails, captures the error output as a BUG_FIX memory
+ * so the AI knows about it in future conversations.
+ * If the command succeeds, captures a brief success note.
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+const child_process_1 = require("child_process");
+const path = __importStar(require("path"));
+const fs = __importStar(require("fs"));
+function generateId() {
+    return `cr_${Date.now().toString(36)}_${Math.random().toString(36).slice(2, 10)}`;
+}
+function findDbPath() {
+    let dir = process.cwd();
+    // Walk up to find .ai/brain-data/cortex.db
+    for (let i = 0; i < 10; i++) {
+        const dbPath = path.join(dir, '.ai', 'brain-data', 'cortex.db');
+        if (fs.existsSync(dbPath))
+            return dbPath;
+        const parent = path.dirname(dir);
+        if (parent === dir)
+            break;
+        dir = parent;
+    }
+    return null;
+}
+function extractErrorSummary(output) {
+    const lines = output.split('\n').filter(l => l.trim());
+    // Look for common error patterns
+    const errorLines = lines.filter(l => /error|Error|ERROR|fail|FAIL|exception|Exception|TypeError|ReferenceError|SyntaxError/i.test(l));
+    if (errorLines.length > 0) {
+        return errorLines.slice(0, 5).join('\n');
+    }
+    // Return last 10 lines if no specific error found
+    return lines.slice(-10).join('\n');
+}
+function storeMemory(dbPath, type, intent, action, tags) {
+    try {
+        const Database = require('better-sqlite3');
+        const db = new Database(dbPath);
+        db.pragma('journal_mode = WAL');
+        db.prepare(`
+            INSERT INTO memory_units (id, type, intent, action, reason, tags, timestamp, confidence, importance, is_active)
+            VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, 1)
+        `).run(generateId(), type, intent, action, 'Auto-captured from cortex-run', JSON.stringify(tags), Date.now(), 0.7, 0.6);
+        // Try FTS insert
+        try {
+            db.prepare(`INSERT INTO memory_fts (rowid, intent, action, tags) VALUES (
+                (SELECT rowid FROM memory_units WHERE id = (SELECT id FROM memory_units ORDER BY timestamp DESC LIMIT 1)), ?, ?, ?
+            )`).run(intent, action, tags.join(' '));
+        }
+        catch { }
+        db.close();
+    }
+    catch { }
+}
+function main() {
+    const args = process.argv.slice(2);
+    if (args.length === 0) {
+        console.log('Usage: cortex-run <command> [args...]');
+        console.log('Example: cortex-run npm test');
+        console.log('         cortex-run npm run build');
+        process.exit(1);
+    }
+    const command = args.join(' ');
+    const dbPath = findDbPath();
+    const startTime = Date.now();
+    try {
+        // Run the command, inheriting stdio for real-time output
+        (0, child_process_1.execSync)(command, {
+            stdio: 'inherit',
+            cwd: process.cwd(),
+            env: process.env,
+        });
+        const duration = ((Date.now() - startTime) / 1000).toFixed(1);
+        // Success — store a brief note
+        if (dbPath) {
+            storeMemory(dbPath, 'INSIGHT', `[OK] Command succeeded: ${command} (${duration}s)`, `Successfully ran "${command}" in ${duration} seconds`, ['cortex-run', 'success', command.split(' ')[0]]);
+        }
+    }
+    catch (err) {
+        const duration = ((Date.now() - startTime) / 1000).toFixed(1);
+        // Failure — capture error details
+        if (dbPath) {
+            let errorOutput = '';
+            try {
+                // Re-run to capture output
+                (0, child_process_1.execSync)(command, {
+                    cwd: process.cwd(),
+                    env: process.env,
+                    encoding: 'utf-8',
+                    stdio: ['pipe', 'pipe', 'pipe'],
+                });
+            }
+            catch (e) {
+                errorOutput = (e.stderr || e.stdout || e.message || '').toString();
+            }
+            const errorSummary = extractErrorSummary(errorOutput);
+            storeMemory(dbPath, 'BUG_FIX', `[FAIL] Command failed: ${command}`, `Failed after ${duration}s.\n\nError:\n${errorSummary.slice(0, 500)}`, ['cortex-run', 'error', command.split(' ')[0], 'needs-fix']);
+        }
+        // Exit with the same error code
+        process.exit(err.status || 1);
+    }
+}
+main();
+//# sourceMappingURL=cortex-run.js.map