squish-memory 0.8.2 → 0.9.2

package/dist/core/memory/telemetry.js

@@ -0,0 +1,313 @@
+/**
+ * Retrieval Quality Telemetry
+ * Tracks memory usage patterns (echo/fizzle) to improve retrieval quality
+ * Echo: memory was retrieved and used
+ * Fizzle: memory was retrieved but not used
+ */
+import { eq, desc } from 'drizzle-orm';
+import { getDb } from '../../db/index.js';
+import { getSchema } from '../../db/schema.js';
+import { logger } from '../logger.js';
+// In-memory cache for recent retrieval events (flushed periodically)
+const retrievalEvents = [];
+const MAX_CACHE_SIZE = 1000;
+/**
+ * Record a retrieval event
+ */
+export function recordRetrieval(memoryId, query, position, score, sessionId) {
+    const event = {
+        memoryId,
+        query,
+        position,
+        score,
+        wasUsed: false, // Initially false, updated when echoed
+        sessionId,
+        timestamp: new Date(),
+    };
+    retrievalEvents.push(event);
+    // Flush if cache is full
+    if (retrievalEvents.length >= MAX_CACHE_SIZE) {
+        flushRetrievalEvents().catch(err => {
+            logger.error('Failed to flush retrieval events', err);
+        });
+    }
+}
+/**
+ * Mark a retrieval as "echoed" (memory was actually used)
+ */
+export function recordEcho(memoryId, sessionId) {
+    // Find the most recent retrieval for this memory
+    const recentIndex = retrievalEvents.findIndex((e, i) => e.memoryId === memoryId &&
+        !e.wasUsed &&
+        (sessionId ? e.sessionId === sessionId : true));
+    if (recentIndex !== -1) {
+        retrievalEvents[recentIndex].wasUsed = true;
+    }
+    else {
+        // Add a new echo event if not found in cache
+        retrievalEvents.push({
+            memoryId,
+            query: '',
+            position: 0,
+            score: 0,
+            wasUsed: true,
+            sessionId,
+            timestamp: new Date(),
+        });
+    }
+    // Update memory's echo count directly
+    incrementMemoryEcho(memoryId).catch(err => {
+        logger.debug('Failed to increment echo count', err);
+    });
+}
+/**
+ * Mark retrievals as "fizzled" (memory was not used)
+ * Call this at the end of a session for non-echoed retrievals
+ */
+export function recordFizzle(memoryId, sessionId) {
+    incrementMemoryFizzle(memoryId).catch(err => {
+        logger.debug('Failed to increment fizzle count', err);
+    });
+}
+/**
+ * Flush cached retrieval events to database
+ */
+export async function flushRetrievalEvents() {
+    if (retrievalEvents.length === 0)
+        return;
+    const events = [...retrievalEvents];
+    retrievalEvents.length = 0; // Clear cache
+    try {
+        const db = await getDb();
+        const schema = await getSchema();
+        // Group by memoryId for batch updates
+        const byMemory = new Map();
+        for (const event of events) {
+            const existing = byMemory.get(event.memoryId) || [];
+            existing.push(event);
+            byMemory.set(event.memoryId, existing);
+        }
+        // Update each memory's telemetry
+        for (const [memoryId, memEvents] of byMemory.entries()) {
+            const echoCount = memEvents.filter(e => e.wasUsed).length;
+            const fizzleCount = memEvents.filter(e => !e.wasUsed).length;
+            // Get current stats
+            const memories = await db
+                .select()
+                .from(schema.memories)
+                .where(eq(schema.memories.id, memoryId))
+                .limit(1);
+            if (memories.length > 0) {
+                const current = memories[0];
+                const newEchoCount = (current.echoCount || 0) + echoCount;
+                const newFizzleCount = (current.fizzleCount || 0) + fizzleCount;
+                const newRetrievalCount = (current.retrievalCount || 0) + memEvents.length;
+                await db
+                    .update(schema.memories)
+                    .set({
+                    echoCount: newEchoCount,
+                    fizzleCount: newFizzleCount,
+                    retrievalCount: newRetrievalCount,
+                    lastRetrievedAt: new Date(),
+                    updatedAt: new Date(),
+                })
+                    .where(eq(schema.memories.id, memoryId));
+            }
+        }
+        logger.debug('Flushed retrieval events', { count: events.length });
+    }
+    catch (error) {
+        logger.error('Error flushing retrieval events', error);
+        // Re-add events to cache on failure
+        retrievalEvents.push(...events);
+    }
+}
+/**
+ * Increment memory's echo count directly
+ */
+async function incrementMemoryEcho(memoryId) {
+    try {
+        const db = await getDb();
+        const schema = await getSchema();
+        const memories = await db
+            .select()
+            .from(schema.memories)
+            .where(eq(schema.memories.id, memoryId))
+            .limit(1);
+        if (memories.length > 0) {
+            const current = memories[0];
+            await db
+                .update(schema.memories)
+                .set({
+                echoCount: (current.echoCount || 0) + 1,
+                lastEchoedAt: new Date(),
+                coactivationScore: (current.coactivationScore || 0) + 1,
+                updatedAt: new Date(),
+            })
+                .where(eq(schema.memories.id, memoryId));
+        }
+    }
+    catch (error) {
+        logger.debug('Error incrementing echo count', { error });
+    }
+}
+/**
+ * Increment memory's fizzle count directly
+ */
+async function incrementMemoryFizzle(memoryId) {
+    try {
+        const db = await getDb();
+        const schema = await getSchema();
+        const memories = await db
+            .select()
+            .from(schema.memories)
+            .where(eq(schema.memories.id, memoryId))
+            .limit(1);
+        if (memories.length > 0) {
+            const current = memories[0];
+            await db
+                .update(schema.memories)
+                .set({
+                fizzleCount: (current.fizzleCount || 0) + 1,
+                updatedAt: new Date(),
+            })
+                .where(eq(schema.memories.id, memoryId));
+        }
+    }
+    catch (error) {
+        logger.debug('Error incrementing fizzle count', { error });
+    }
+}
+/**
+ * Get telemetry for a specific memory
+ */
+export async function getMemoryTelemetry(memoryId) {
+    try {
+        const db = await getDb();
+        const schema = await getSchema();
+        const memories = await db
+            .select()
+            .from(schema.memories)
+            .where(eq(schema.memories.id, memoryId))
+            .limit(1);
+        if (memories.length === 0)
+            return null;
+        const m = memories[0];
+        const echoCount = m.echoCount || 0;
+        const fizzleCount = m.fizzleCount || 0;
+        const total = echoCount + fizzleCount;
+        return {
+            memoryId: m.id,
+            retrievalCount: m.retrievalCount || 0,
+            echoCount,
+            fizzleCount,
+            echoRate: total > 0 ? echoCount / total : 0,
+            avgPosition: 0, // Would need to calculate from retrieval events
+            lastRetrieved: m.lastRetrievedAt,
+            lastEchoed: m.lastEchoedAt,
+        };
+    }
+    catch (error) {
+        logger.error('Error getting memory telemetry', error);
+        return null;
+    }
+}
+/**
+ * Get overall retrieval statistics
+ */
+export async function getRetrievalStats(projectId) {
+    try {
+        const db = await getDb();
+        const schema = await getSchema();
+        const whereClause = projectId
+            ? eq(schema.memories.projectId, projectId)
+            : undefined;
+        const memories = await db
+            .select()
+            .from(schema.memories)
+            .where(whereClause)
+            .orderBy(desc(schema.memories.retrievalCount))
+            .limit(1000);
+        let totalRetrievals = 0;
+        let totalEchoes = 0;
+        let totalFizzles = 0;
+        const topMemories = [];
+        const underperforming = [];
+        for (const m of memories) {
+            const echoes = m.echoCount || 0;
+            const fizzles = m.fizzleCount || 0;
+            const retrievals = m.retrievalCount || 0;
+            totalRetrievals += retrievals;
+            totalEchoes += echoes;
+            totalFizzles += fizzles;
+            // Top performers (high echo rate with sufficient data)
+            if (echoes >= 3 && (echoes / (echoes + fizzles)) >= 0.8) {
+                topMemories.push(m.id);
+            }
+            // Underperformers (high fizzle rate with sufficient data)
+            if (fizzles >= 5 && (fizzles / (echoes + fizzles)) >= 0.7) {
+                underperforming.push(m.id);
+            }
+        }
+        const echoRate = (totalEchoes + totalFizzles) > 0
+            ? totalEchoes / (totalEchoes + totalFizzles)
+            : 0;
+        return {
+            totalRetrievals,
+            echoes: totalEchoes,
+            fizzles: totalFizzles,
+            echoRate,
+            avgPosition: 0, // Would need more detailed tracking
+            topMemories: topMemories.slice(0, 10),
+            underperformingMemories: underperforming.slice(0, 10),
+        };
+    }
+    catch (error) {
+        logger.error('Error getting retrieval stats', error);
+        return {
+            totalRetrievals: 0,
+            echoes: 0,
+            fizzles: 0,
+            echoRate: 0,
+            avgPosition: 0,
+            topMemories: [],
+            underperformingMemories: [],
+        };
+    }
+}
+/**
+ * Adjust retrieval boosting based on echo/fizzle history
+ * Returns a boost factor (0.5 - 2.0) for a memory
+ */
+export function calculateTelemetryBoost(telemetry) {
+    if (!telemetry || telemetry.retrievalCount < 3) {
+        return 1.0; // Not enough data
+    }
+    const echoRate = telemetry.echoRate;
+    // High echo rate = boost
+    if (echoRate >= 0.8) {
+        return 1.5;
+    }
+    else if (echoRate >= 0.6) {
+        return 1.2;
+    }
+    else if (echoRate >= 0.4) {
+        return 1.0;
+    }
+    else if (echoRate >= 0.2) {
+        return 0.8;
+    }
+    else {
+        return 0.5; // Low echo rate = penalize
+    }
+}
+/**
+ * Periodic cleanup job for telemetry data
+ */
+export async function cleanupOldTelemetry(daysToKeep = 90) {
+    // This would typically clean up a dedicated telemetry_events table
+    // For now, we just flush the in-memory cache
+    await flushRetrievalEvents();
+    return 0;
+}
+//# sourceMappingURL=telemetry.js.map

package/dist/core/memory/telemetry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"telemetry.js","sourceRoot":"","sources":["../../../core/memory/telemetry.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,EAAE,EAAO,IAAI,EAAE,MAAM,aAAa,CAAC;AAC5C,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAiCtC,qEAAqE;AACrE,MAAM,eAAe,GAAqB,EAAE,CAAC;AAC7C,MAAM,cAAc,GAAG,IAAI,CAAC;AAE5B;;GAEG;AACH,MAAM,UAAU,eAAe,CAC7B,QAAgB,EAChB,KAAa,EACb,QAAgB,EAChB,KAAa,EACb,SAAkB;IAElB,MAAM,KAAK,GAAmB;QAC5B,QAAQ;QACR,KAAK;QACL,QAAQ;QACR,KAAK;QACL,OAAO,EAAE,KAAK,EAAE,uCAAuC;QACvD,SAAS;QACT,SAAS,EAAE,IAAI,IAAI,EAAE;KACtB,CAAC;IAEF,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAE5B,yBAAyB;IACzB,IAAI,eAAe,CAAC,MAAM,IAAI,cAAc,EAAE,CAAC;QAC7C,oBAAoB,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE;YACjC,MAAM,CAAC,KAAK,CAAC,kCAAkC,EAAE,GAAG,CAAC,CAAC;QACxD,CAAC,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CACxB,QAAgB,EAChB,SAAkB;IAElB,iDAAiD;IACjD,MAAM,WAAW,GAAG,eAAe,CAAC,SAAS,CAC3C,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,CAAC,CAAC,QAAQ,KAAK,QAAQ;QACvB,CAAC,CAAC,CAAC,OAAO;QACV,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CACjD,CAAC;IAEF,IAAI,WAAW,KAAK,CAAC,CAAC,EAAE,CAAC;QACvB,eAAe,CAAC,WAAW,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC;IAC9C,CAAC;SAAM,CAAC;QACN,6CAA6C;QAC7C,eAAe,CAAC,IAAI,CAAC;YACnB,QAAQ;YACR,KAAK,EAAE,EAAE;YACT,QAAQ,EAAE,CAAC;YACX,KAAK,EAAE,CAAC;YACR,OAAO,EAAE,IAAI;YACb,SAAS;YACT,SAAS,EAAE,IAAI,IAAI,EAAE;SACtB,CAAC,CAAC;IACL,CAAC;IAED,sCAAsC;IACtC,mBAAmB,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE;QACxC,MAAM,CAAC,KAAK,CAAC,gCAAgC,EAAE,GAAG,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAC1B,QAAgB,EAChB,SAAkB;IAElB,qBAAqB,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE;QAC1C,MAAM,CAAC,KAAK,CAAC,kCAAkC,EAAE,GAAG,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB;IACxC,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAEzC,MAAM,MAAM,GAAG,CAAC,GAAG,eAAe,CAAC,CAAC;IACpC,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,cAAc;IAE1C,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,MAAM,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;QAEjC,sCAAsC;QACtC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA4B,CAAC;QACrD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YACpD,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACzC,CAAC;QAED,iCAAiC;QACjC,KAAK,MAAM,CAAC,QAAQ,EAAE,SAAS,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;YACvD,MAAM,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;YAC1D,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;YAE7D,oBAAoB;YACpB,MAAM,QAAQ,GAAG,MAAO,EAAU;iBAC/B,MAAM,EAAE;iBACR,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;iBACrB,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;iBACvC,KAAK,CAAC,CAAC,CAAC,CAAC;YAEZ,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC5B,MAAM,YAAY,GAAG,CAAC,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC;gBAC1D,MAAM,cAAc,GAAG,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,CAAC,GAAG,WAAW,CAAC;gBAChE,MAAM,iBAAiB,GAAG,CAAC,OAAO,CAAC,cAAc,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;gBAE3E,MAAO,EAAU;qBACd,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC;qBACvB,GAAG,CAAC;oBACH,SAAS,EAAE,YAAY;oBACvB,WAAW,EAAE,cAAc;oBAC3B,cAAc,EAAE,iBAAiB;oBACjC,eAAe,EAAE,IAAI,IAAI,EAAE;oBAC3B,SAAS,EAAE,IAAI,IAAI,EAAE;iBACtB,CAAC;qBACD,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;QAED,MAAM,CAAC,KAAK,CAAC,0BAA0B,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAErE,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,KAAK,CAAC,iCAAiC,EAAE,KAAK,CAAC,CAAC;QACvD,oCAAoC;QACpC,eAAe,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;IAClC,CAAC;AACH,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,mBAAmB,CAAC,QAAgB;IACjD,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,MAAM,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;QAEjC,MAAM,QAAQ,GAAG,MAAO,EAAU;aAC/B,MAAM,EAAE;aACR,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;aACrB,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;aACvC,KAAK,CAAC,CAAC,CAAC,CAAC;QAEZ,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAO,EAAU;iBACd,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC;iBACvB,GAAG,CAAC;gBACH,SAAS,EAAE,CAAC,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,CAAC;gBACvC,YAAY,EAAE,IAAI,IAAI,EAAE;gBACxB,iBAAiB,EAAE,CAAC,OAAO,CAAC,iBAAiB,IAAI,CAAC,CAAC,GAAG,CAAC;gBACvD,SAAS,EAAE,IAAI,IAAI,EAAE;aACtB,CAAC;iBACD,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,KAAK,CAAC,+BAA+B,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;IAC3D,CAAC;AACH,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,qBAAqB,CAAC,QAAgB;IACnD,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,MAAM,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;QAEjC,MAAM,QAAQ,GAAG,MAAO,EAAU;aAC/B,MAAM,EAAE;aACR,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;aACrB,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;aACvC,KAAK,CAAC,CAAC,CAAC,CAAC;QAEZ,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAO,EAAU;iBACd,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC;iBACvB,GAAG,CAAC;gBACH,WAAW,EAAE,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,CAAC,GAAG,CAAC;gBAC3C,SAAS,EAAE,IAAI,IAAI,EAAE;aACtB,CAAC;iBACD,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,KAAK,CAAC,iCAAiC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;IAC7D,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,QAAgB;IACvD,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,MAAM,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;QAEjC,MAAM,QAAQ,GAAG,MAAO,EAAU;aAC/B,MAAM,EAAE;aACR,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;aACrB,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;aACvC,KAAK,CAAC,CAAC,CAAC,CAAC;QAEZ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAEvC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,SAAS,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC;QACnC,MAAM,WAAW,GAAG,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,SAAS,GAAG,WAAW,CAAC;QAEtC,OAAO;YACL,QAAQ,EAAE,CAAC,CAAC,EAAE;YACd,cAAc,EAAE,CAAC,CAAC,cAAc,IAAI,CAAC;YACrC,SAAS;YACT,WAAW;YACX,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3C,WAAW,EAAE,CAAC,EAAE,gDAAgD;YAChE,aAAa,EAAE,CAAC,CAAC,eAAe;YAChC,UAAU,EAAE,CAAC,CAAC,YAAY;SAC3B,CAAC;IAEJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,KAAK,CAAC,gCAAgC,EAAE,KAAK,CAAC,CAAC;QACtD,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,SAAkB;IACxD,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,MAAM,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;QAEjC,MAAM,WAAW,GAAG,SAAS;YAC3B,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC;YAC1C,CAAC,CAAC,SAAS,CAAC;QAEd,MAAM,QAAQ,GAAG,MAAO,EAAU;aAC/B,MAAM,EAAE;aACR,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;aACrB,KAAK,CAAC,WAAW,CAAC;aAClB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC;aAC7C,KAAK,CAAC,IAAI,CAAC,CAAC;QAEf,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,MAAM,WAAW,GAAa,EAAE,CAAC;QACjC,MAAM,eAAe,GAAa,EAAE,CAAC;QAErC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC;YAChC,MAAM,OAAO,GAAG,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC;YACnC,MAAM,UAAU,GAAG,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC;YAEzC,eAAe,IAAI,UAAU,CAAC;YAC9B,WAAW,IAAI,MAAM,CAAC;YACtB,YAAY,IAAI,OAAO,CAAC;YAExB,uDAAuD;YACvD,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,MAAM,GAAG,OAAO,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;gBACxD,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACzB,CAAC;YAED,0DAA0D;YAC1D,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,MAAM,GAAG,OAAO,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;gBAC1D,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,MAAM,QAAQ,GAAG,CAAC,WAAW,GAAG,YAAY,CAAC,GAAG,CAAC;YAC/C,CAAC,CAAC,WAAW,GAAG,CAAC,WAAW,GAAG,YAAY,CAAC;YAC5C,CAAC,CAAC,CAAC,CAAC;QAEN,OAAO;YACL,eAAe;YACf,MAAM,EAAE,WAAW;YACnB,OAAO,EAAE,YAAY;YACrB,QAAQ;YACR,WAAW,EAAE,CAAC,EAAE,oCAAoC;YACpD,WAAW,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;YACrC,uBAAuB,EAAE,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;SACtD,CAAC;IAEJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,KAAK,CAAC,+BAA+B,EAAE,KAAK,CAAC,CAAC;QACrD,OAAO;YACL,eAAe,EAAE,CAAC;YAClB,MAAM,EAAE,CAAC;YACT,OAAO,EAAE,CAAC;YACV,QAAQ,EAAE,CAAC;YACX,WAAW,EAAE,CAAC;YACd,WAAW,EAAE,EAAE;YACf,uBAAuB,EAAE,EAAE;SAC5B,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CAAC,SAAiC;IACvE,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,cAAc,GAAG,CAAC,EAAE,CAAC;QAC/C,OAAO,GAAG,CAAC,CAAC,kBAAkB;IAChC,CAAC;IAED,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC;IAEpC,yBAAyB;IACzB,IAAI,QAAQ,IAAI,GAAG,EAAE,CAAC;QACpB,OAAO,GAAG,CAAC;IACb,CAAC;SAAM,IAAI,QAAQ,IAAI,GAAG,EAAE,CAAC;QAC3B,OAAO,GAAG,CAAC;IACb,CAAC;SAAM,IAAI,QAAQ,IAAI,GAAG,EAAE,CAAC;QAC3B,OAAO,GAAG,CAAC;IACb,CAAC;SAAM,IAAI,QAAQ,IAAI,GAAG,EAAE,CAAC;QAC3B,OAAO,GAAG,CAAC;IACb,CAAC;SAAM,CAAC;QACN,OAAO,GAAG,CAAC,CAAC,2BAA2B;IACzC,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CAAC,aAAqB,EAAE;IAC/D,mEAAmE;IACnE,6CAA6C;IAC7C,MAAM,oBAAoB,EAAE,CAAC;IAC7B,OAAO,CAAC,CAAC;AACX,CAAC"}

package/dist/core/memory/temporal-facts.d.ts

@@ -0,0 +1,41 @@
+/**
+ * Temporal Facts Lifecycle
+ * Manages temporal fact validity, supersession, and expiration
+ * Integrates with the memory pipeline to automatically supersede outdated facts
+ */
+export interface TemporalValidityCheck {
+    isValid: boolean;
+    supersededBy?: string;
+    expiresAt?: Date;
+    confidence: number;
+}
+export interface SupersessionResult {
+    supersededCount: number;
+    newValidFrom: Date;
+    newValidTo?: Date;
+}
+/**
+ * Check temporal validity of a memory
+ * Returns whether the memory is still valid based on temporal facts
+ */
+export declare function checkTemporalValidity(memoryId: string): Promise<TemporalValidityCheck>;
+/**
+ * Auto-supersede temporal facts that have been updated
+ * Call this when storing a new memory that may supersede old temporal facts
+ */
+export declare function supersedeOldTemporalFacts(newMemoryId: string, content: string, projectId?: string): Promise<SupersessionResult>;
+/**
+ * Clean up expired temporal facts
+ * Can be run as a background job
+ */
+export declare function cleanupExpiredTemporalFacts(projectId?: string): Promise<number>;
+/**
+ * Get temporal fact statistics for a project
+ */
+export declare function getTemporalFactsStats(projectId?: string): Promise<{
+    totalTemporalFacts: number;
+    validFacts: number;
+    expiredFacts: number;
+    supersededFacts: number;
+}>;
+//# sourceMappingURL=temporal-facts.d.ts.map

package/dist/core/memory/temporal-facts.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"temporal-facts.d.ts","sourceRoot":"","sources":["../../../core/memory/temporal-facts.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AASH,MAAM,WAAW,qBAAqB;IACpC,OAAO,EAAE,OAAO,CAAC;IACjB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,SAAS,CAAC,EAAE,IAAI,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,kBAAkB;IACjC,eAAe,EAAE,MAAM,CAAC;IACxB,YAAY,EAAE,IAAI,CAAC;IACnB,UAAU,CAAC,EAAE,IAAI,CAAC;CACnB;AAED;;;GAGG;AACH,wBAAsB,qBAAqB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,qBAAqB,CAAC,CA0D5F;AAED;;;GAGG;AACH,wBAAsB,yBAAyB,CAC7C,WAAW,EAAE,MAAM,EACnB,OAAO,EAAE,MAAM,EACf,SAAS,CAAC,EAAE,MAAM,GACjB,OAAO,CAAC,kBAAkB,CAAC,CA8F7B;AAiCD;;;GAGG;AACH,wBAAsB,2BAA2B,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAgDrF;AAED;;GAEG;AACH,wBAAsB,qBAAqB,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;IACvE,kBAAkB,EAAE,MAAM,CAAC;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,eAAe,EAAE,MAAM,CAAC;CACzB,CAAC,CA+CD"}

package/dist/core/memory/temporal-facts.js

@@ -0,0 +1,262 @@
+/**
+ * Temporal Facts Lifecycle
+ * Manages temporal fact validity, supersession, and expiration
+ * Integrates with the memory pipeline to automatically supersede outdated facts
+ */
+import { eq, and, lt } from 'drizzle-orm';
+import { getDb } from '../../db/index.js';
+import { getSchema } from '../../db/schema.js';
+import { logger } from '../logger.js';
+import { createAssociation } from '../associations.js';
+import { parseTemporalFacts } from './temporal-parser.js';
+/**
+ * Check temporal validity of a memory
+ * Returns whether the memory is still valid based on temporal facts
+ */
+export async function checkTemporalValidity(memoryId) {
+    try {
+        const db = await getDb();
+        const schema = await getSchema();
+        const memories = await db
+            .select()
+            .from(schema.memories)
+            .where(eq(schema.memories.id, memoryId))
+            .limit(1);
+        if (memories.length === 0) {
+            return { isValid: false, confidence: 0 };
+        }
+        const memory = memories[0];
+        const now = new Date();
+        // Check if memory has explicit validity period
+        if (memory.validTo) {
+            const validTo = new Date(memory.validTo);
+            if (validTo < now) {
+                // Find if there's a superseding memory
+                const superseding = await db
+                    .select()
+                    .from(schema.memories)
+                    .where(eq(schema.memories.supersedes, memoryId))
+                    .limit(1);
+                return {
+                    isValid: false,
+                    supersededBy: superseding[0]?.id,
+                    expiresAt: validTo,
+                    confidence: 0.95,
+                };
+            }
+        }
+        // Parse temporal facts from content
+        const temporalFacts = await parseTemporalFacts(memory.content);
+        // Check for expiration indicators
+        for (const fact of temporalFacts) {
+            if (fact.parsed.end && new Date(fact.parsed.end) < now) {
+                return {
+                    isValid: false,
+                    expiresAt: new Date(fact.parsed.end),
+                    confidence: fact.confidence,
+                };
+            }
+        }
+        return { isValid: true, confidence: 1.0 };
+    }
+    catch (error) {
+        logger.error('Error checking temporal validity', error);
+        return { isValid: true, confidence: 0.5 }; // Assume valid on error
+    }
+}
+/**
+ * Auto-supersede temporal facts that have been updated
+ * Call this when storing a new memory that may supersede old temporal facts
+ */
+export async function supersedeOldTemporalFacts(newMemoryId, content, projectId) {
+    const result = {
+        supersededCount: 0,
+        newValidFrom: new Date(),
+    };
+    try {
+        const db = await getDb();
+        const schema = await getSchema();
+        // Parse temporal facts from new content
+        const temporalFacts = await parseTemporalFacts(content);
+        if (temporalFacts.length === 0) {
+            return result;
+        }
+        // Find the earliest date as validFrom
+        const dates = temporalFacts
+            .filter(f => f.parsed.start)
+            .map(f => new Date(f.parsed.start));
+        if (dates.length > 0) {
+            result.newValidFrom = new Date(Math.min(...dates.map(d => d.getTime())));
+        }
+        // Find memories in same project with overlapping temporal scope
+        const whereClause = projectId
+            ? and(eq(schema.memories.projectId, projectId), eq(schema.memories.status, 'active'))
+            : eq(schema.memories.status, 'active');
+        const candidates = await db
+            .select()
+            .from(schema.memories)
+            .where(whereClause)
+            .limit(100);
+        const toSupersede = [];
+        for (const candidate of candidates) {
+            if (candidate.id === newMemoryId)
+                continue;
+            if (candidate.isProtected)
+                continue;
+            // Check for temporal overlap
+            const candidateFacts = await parseTemporalFacts(candidate.content);
+            for (const newFact of temporalFacts) {
+                for (const candidateFact of candidateFacts) {
+                    if (factsOverlap(newFact, candidateFact)) {
+                        // Check if new fact is more recent
+                        if (isMoreRecent(newFact, candidateFact)) {
+                            toSupersede.push(candidate.id);
+                            break;
+                        }
+                    }
+                }
+            }
+        }
+        // Apply supersession
+        if (toSupersede.length > 0) {
+            const now = new Date();
+            await db
+                .update(schema.memories)
+                .set({
+                status: 'superseded',
+                supersededBy: newMemoryId,
+                supersededAt: now,
+                updatedAt: now,
+            })
+                .where(eq(schema.memories.id, toSupersede[0])); // Batch for all
+            // Create associations
+            for (const oldId of toSupersede) {
+                await createAssociation(newMemoryId, oldId, 'supersedes', 0.85);
+            }
+            result.supersededCount = toSupersede.length;
+            logger.info('Superseded temporal facts', {
+                newMemoryId,
+                supersededCount: toSupersede.length,
+            });
+        }
+    }
+    catch (error) {
+        logger.error('Error superseding temporal facts', error);
+    }
+    return result;
+}
+/**
+ * Check if two temporal facts overlap in time
+ */
+function factsOverlap(fact1, fact2) {
+    // Both need start dates to compare
+    if (!fact1.parsed.start || !fact2.parsed.start) {
+        return false;
+    }
+    const start1 = new Date(fact1.parsed.start).getTime();
+    const end1 = fact1.parsed.end ? new Date(fact1.parsed.end).getTime() : Infinity;
+    const start2 = new Date(fact2.parsed.start).getTime();
+    const end2 = fact2.parsed.end ? new Date(fact2.parsed.end).getTime() : Infinity;
+    // Check for overlap
+    return start1 <= end2 && start2 <= end1;
+}
+/**
+ * Check if fact1 is more recent than fact2
+ */
+function isMoreRecent(fact1, fact2) {
+    if (!fact1.parsed.start)
+        return false;
+    if (!fact2.parsed.start)
+        return true;
+    const date1 = new Date(fact1.parsed.start).getTime();
+    const date2 = new Date(fact2.parsed.start).getTime();
+    return date1 > date2;
+}
+/**
+ * Clean up expired temporal facts
+ * Can be run as a background job
+ */
+export async function cleanupExpiredTemporalFacts(projectId) {
+    let expiredCount = 0;
+    try {
+        const db = await getDb();
+        const schema = await getSchema();
+        const now = new Date();
+        const whereClause = projectId
+            ? and(eq(schema.memories.projectId, projectId), eq(schema.memories.status, 'active'), lt(schema.memories.validTo, now))
+            : and(eq(schema.memories.status, 'active'), lt(schema.memories.validTo, now));
+        const expired = await db
+            .select()
+            .from(schema.memories)
+            .where(whereClause);
+        for (const memory of expired) {
+            if (memory.isProtected)
+                continue;
+            await db
+                .update(schema.memories)
+                .set({
+                status: 'expired',
+                expiredAt: now,
+                updatedAt: now,
+            })
+                .where(eq(schema.memories.id, memory.id));
+            expiredCount++;
+        }
+        if (expiredCount > 0) {
+            logger.info('Cleaned up expired temporal facts', { expiredCount });
+        }
+    }
+    catch (error) {
+        logger.error('Error cleaning up expired temporal facts', error);
+    }
+    return expiredCount;
+}
+/**
+ * Get temporal fact statistics for a project
+ */
+export async function getTemporalFactsStats(projectId) {
+    try {
+        const db = await getDb();
+        const schema = await getSchema();
+        const now = new Date();
+        const whereClause = projectId
+            ? eq(schema.memories.projectId, projectId)
+            : undefined;
+        const memories = await db
+            .select()
+            .from(schema.memories)
+            .where(whereClause);
+        let totalTemporalFacts = 0;
+        let validFacts = 0;
+        let expiredFacts = 0;
+        let supersededFacts = 0;
+        for (const memory of memories) {
+            // Check if memory has temporal facts
+            const facts = await parseTemporalFacts(memory.content);
+            if (facts.length > 0) {
+                totalTemporalFacts++;
+                if (memory.status === 'expired') {
+                    expiredFacts++;
+                }
+                else if (memory.status === 'superseded') {
+                    supersededFacts++;
+                }
+                else if (memory.status === 'active') {
+                    // Check if still valid
+                    if (memory.validTo && new Date(memory.validTo) < now) {
+                        expiredFacts++;
+                    }
+                    else {
+                        validFacts++;
+                    }
+                }
+            }
+        }
+        return { totalTemporalFacts, validFacts, expiredFacts, supersededFacts };
+    }
+    catch (error) {
+        logger.error('Error getting temporal facts stats', error);
+        return { totalTemporalFacts: 0, validFacts: 0, expiredFacts: 0, supersededFacts: 0 };
+    }
+}
+//# sourceMappingURL=temporal-facts.js.map

package/dist/core/memory/temporal-facts.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"temporal-facts.js","sourceRoot":"","sources":["../../../core/memory/temporal-facts.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAM,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AACtC,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,EAAE,kBAAkB,EAAgB,MAAM,sBAAsB,CAAC;AAexE;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CAAC,QAAgB;IAC1D,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,MAAM,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;QAEjC,MAAM,QAAQ,GAAG,MAAO,EAAU;aAC/B,MAAM,EAAE;aACR,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;aACrB,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;aACvC,KAAK,CAAC,CAAC,CAAC,CAAC;QAEZ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;QAC3C,CAAC;QAED,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;QAEvB,+CAA+C;QAC/C,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACnB,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACzC,IAAI,OAAO,GAAG,GAAG,EAAE,CAAC;gBAClB,uCAAuC;gBACvC,MAAM,WAAW,GAAG,MAAO,EAAU;qBAClC,MAAM,EAAE;qBACR,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;qBACrB,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;qBAC/C,KAAK,CAAC,CAAC,CAAC,CAAC;gBAEZ,OAAO;oBACL,OAAO,EAAE,KAAK;oBACd,YAAY,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE;oBAChC,SAAS,EAAE,OAAO;oBAClB,UAAU,EAAE,IAAI;iBACjB,CAAC;YACJ,CAAC;QACH,CAAC;QAED,oCAAoC;QACpC,MAAM,aAAa,GAAG,MAAM,kBAAkB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAE/D,kCAAkC;QAClC,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC;gBACvD,OAAO;oBACL,OAAO,EAAE,KAAK;oBACd,SAAS,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;oBACpC,UAAU,EAAE,IAAI,CAAC,UAAU;iBAC5B,CAAC;YACJ,CAAC;QACH,CAAC;QAED,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;IAE5C,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,KAAK,CAAC,kCAAkC,EAAE,KAAK,CAAC,CAAC;QACxD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC,wBAAwB;IACrE,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,yBAAyB,CAC7C,WAAmB,EACnB,OAAe,EACf,SAAkB;IAElB,MAAM,MAAM,GAAuB;QACjC,eAAe,EAAE,CAAC;QAClB,YAAY,EAAE,IAAI,IAAI,EAAE;KACzB,CAAC;IAEF,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,MAAM,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;QAEjC,wCAAwC;QACxC,MAAM,aAAa,GAAG,MAAM,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAExD,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,sCAAsC;QACtC,MAAM,KAAK,GAAG,aAAa;aACxB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;aAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAM,CAAC,CAAC,CAAC;QAEvC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,YAAY,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3E,CAAC;QAED,gEAAgE;QAChE,MAAM,WAAW,GAAG,SAAS;YAC3B,CAAC,CAAC,GAAG,CACD,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,EACxC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,CACrC;YACH,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAEzC,MAAM,UAAU,GAAG,MAAO,EAAU;aACjC,MAAM,EAAE;aACR,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;aACrB,KAAK,CAAC,WAAW,CAAC;aAClB,KAAK,CAAC,GAAG,CAAC,CAAC;QAEd,MAAM,WAAW,GAAa,EAAE,CAAC;QAEjC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,IAAI,SAAS,CAAC,EAAE,KAAK,WAAW;gBAAE,SAAS;YAC3C,IAAI,SAAS,CAAC,WAAW;gBAAE,SAAS;YAEpC,6BAA6B;YAC7B,MAAM,cAAc,GAAG,MAAM,kBAAkB,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YAEnE,KAAK,MAAM,OAAO,IAAI,aAAa,EAAE,CAAC;gBACpC,KAAK,MAAM,aAAa,IAAI,cAAc,EAAE,CAAC;oBAC3C,IAAI,YAAY,CAAC,OAAO,EAAE,aAAa,CAAC,EAAE,CAAC;wBACzC,mCAAmC;wBACnC,IAAI,YAAY,CAAC,OAAO,EAAE,aAAa,CAAC,EAAE,CAAC;4BACzC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;4BAC/B,MAAM;wBACR,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,qBAAqB;QACrB,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;YAEvB,MAAO,EAAU;iBACd,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC;iBACvB,GAAG,CAAC;gBACH,MAAM,EAAE,YAAY;gBACpB,YAAY,EAAE,WAAW;gBACzB,YAAY,EAAE,GAAG;gBACjB,SAAS,EAAE,GAAG;aACf,CAAC;iBACD,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,gBAAgB;YAElE,sBAAsB;YACtB,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;gBAChC,MAAM,iBAAiB,CAAC,WAAW,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC;YAClE,CAAC;YAED,MAAM,CAAC,eAAe,GAAG,WAAW,CAAC,MAAM,CAAC;YAE5C,MAAM,CAAC,IAAI,CAAC,2BAA2B,EAAE;gBACvC,WAAW;gBACX,eAAe,EAAE,WAAW,CAAC,MAAM;aACpC,CAAC,CAAC;QACL,CAAC;IAEH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,KAAK,CAAC,kCAAkC,EAAE,KAAK,CAAC,CAAC;IAC1D,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CAAC,KAAmB,EAAE,KAAmB;IAC5D,mCAAmC;IACnC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QAC/C,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;IACtD,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;IAChF,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;IACtD,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;IAEhF,oBAAoB;IACpB,OAAO,MAAM,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,CAAC;AAC1C,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CAAC,KAAmB,EAAE,KAAmB;IAC5D,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK;QAAE,OAAO,KAAK,CAAC;IACtC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IAErC,MAAM,KAAK,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;IACrD,MAAM,KAAK,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;IAErD,OAAO,KAAK,GAAG,KAAK,CAAC;AACvB,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,2BAA2B,CAAC,SAAkB;IAClE,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,MAAM,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;QAEvB,MAAM,WAAW,GAAG,SAAS;YAC3B,CAAC,CAAC,GAAG,CACD,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,EACxC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,EACpC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CACjC;YACH,CAAC,CAAC,GAAG,CACD,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,EACpC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CACjC,CAAC;QAEN,MAAM,OAAO,GAAG,MAAO,EAAU;aAC9B,MAAM,EAAE;aACR,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;aACrB,KAAK,CAAC,WAAW,CAAC,CAAC;QAEtB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,MAAM,CAAC,WAAW;gBAAE,SAAS;YAEjC,MAAO,EAAU;iBACd,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC;iBACvB,GAAG,CAAC;gBACH,MAAM,EAAE,SAAS;gBACjB,SAAS,EAAE,GAAG;gBACd,SAAS,EAAE,GAAG;aACf,CAAC;iBACD,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YAE5C,YAAY,EAAE,CAAC;QACjB,CAAC;QAED,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,IAAI,CAAC,mCAAmC,EAAE,EAAE,YAAY,EAAE,CAAC,CAAC;QACrE,CAAC;IAEH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,KAAK,CAAC,0CAA0C,EAAE,KAAK,CAAC,CAAC;IAClE,CAAC;IAED,OAAO,YAAY,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CAAC,SAAkB;IAM5D,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,MAAM,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;QAEvB,MAAM,WAAW,GAAG,SAAS;YAC3B,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC;YAC1C,CAAC,CAAC,SAAS,CAAC;QAEd,MAAM,QAAQ,GAAG,MAAO,EAAU;aAC/B,MAAM,EAAE;aACR,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;aACrB,KAAK,CAAC,WAAW,CAAC,CAAC;QAEtB,IAAI,kBAAkB,GAAG,CAAC,CAAC;QAC3B,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,eAAe,GAAG,CAAC,CAAC;QAExB,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,qCAAqC;YACrC,MAAM,KAAK,GAAG,MAAM,kBAAkB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACvD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,kBAAkB,EAAE,CAAC;gBAErB,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;oBAChC,YAAY,EAAE,CAAC;gBACjB,CAAC;qBAAM,IAAI,MAAM,CAAC,MAAM,KAAK,YAAY,EAAE,CAAC;oBAC1C,eAAe,EAAE,CAAC;gBACpB,CAAC;qBAAM,IAAI,MAAM,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;oBACtC,uBAAuB;oBACvB,IAAI,MAAM,CAAC,OAAO,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,GAAG,EAAE,CAAC;wBACrD,YAAY,EAAE,CAAC;oBACjB,CAAC;yBAAM,CAAC;wBACN,UAAU,EAAE,CAAC;oBACf,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,kBAAkB,EAAE,UAAU,EAAE,YAAY,EAAE,eAAe,EAAE,CAAC;IAE3E,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,KAAK,CAAC,oCAAoC,EAAE,KAAK,CAAC,CAAC;QAC1D,OAAO,EAAE,kBAAkB,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC;IACvF,CAAC;AACH,CAAC"}

package/dist/core/memory/trigger-detector.d.ts

@@ -0,0 +1,14 @@
+export interface MemorySignals {
+    explicitTriggers: string[];
+    implicit: {
+        decision: boolean;
+        correction: boolean;
+        preference: boolean;
+        workflowRule: boolean;
+        lesson: boolean;
+    };
+    suggestedType: 'observation' | 'fact' | 'decision' | 'context' | 'preference';
+    priority: 'normal' | 'high';
+}
+export declare function detectMemorySignals(content: string): MemorySignals;
+//# sourceMappingURL=trigger-detector.d.ts.map

package/dist/core/memory/trigger-detector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"trigger-detector.d.ts","sourceRoot":"","sources":["../../../core/memory/trigger-detector.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,aAAa;IAC5B,gBAAgB,EAAE,MAAM,EAAE,CAAC;IAC3B,QAAQ,EAAE;QACR,QAAQ,EAAE,OAAO,CAAC;QAClB,UAAU,EAAE,OAAO,CAAC;QACpB,UAAU,EAAE,OAAO,CAAC;QACpB,YAAY,EAAE,OAAO,CAAC;QACtB,MAAM,EAAE,OAAO,CAAC;KACjB,CAAC;IACF,aAAa,EAAE,aAAa,GAAG,MAAM,GAAG,UAAU,GAAG,SAAS,GAAG,YAAY,CAAC;IAC9E,QAAQ,EAAE,QAAQ,GAAG,MAAM,CAAC;CAC7B;AAcD,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,MAAM,GAAG,aAAa,CAiClE"}