@miller-tech/uap 1.8.1 → 1.10.0

package/dist/memory/correction-propagator.js

@@ -52,12 +52,14 @@ export function propagateCorrection(dbPath, searchContent, correctedContent, rea
     const searchLower = searchContent.toLowerCase();
     try {
         // 1. Search in memories (working memory / L1)
-        const memRows = db.prepare(`
+        const memRows = db
+            .prepare(`
       SELECT id, content FROM memories
       WHERE LOWER(content) LIKE ?
       ORDER BY id DESC
       LIMIT 5
-    `).all(`%${searchLower}%`);
+    `)
+            .all(`%${searchLower}%`);
         for (const row of memRows) {
             result.originalFound = true;
             result.originalId = result.originalId || row.id;
@@ -77,12 +79,14 @@ export function propagateCorrection(dbPath, searchContent, correctedContent, rea
             result.tiersUpdated.push('memories');
         }
         // 2. Search in session_memories (L2)
-        const sessRows = db.prepare(`
+        const sessRows = db
+            .prepare(`
       SELECT id, content FROM session_memories
       WHERE LOWER(content) LIKE ?
       ORDER BY id DESC
       LIMIT 5
-    `).all(`%${searchLower}%`);
+    `)
+            .all(`%${searchLower}%`);
         for (const row of sessRows) {
             result.originalFound = true;
             db.prepare(`
@@ -104,21 +108,15 @@ export function propagateCorrection(dbPath, searchContent, correctedContent, rea
     `).run(today, now, `[CORRECTION] ${reason}: ${correctedContent}`);
         result.tiersUpdated.push('daily_log');
         // 4. Write corrected version as new working memory entry
-        const insertResult = db.prepare(`
+        const insertResult = db
+            .prepare(`
       INSERT INTO memories (timestamp, type, content, project_id, importance)
       VALUES (?, 'observation', ?, 'default', 8)
-    `).run(now, correctedContent);
+    `)
+            .run(now, correctedContent);
         result.correctedEntryId = Number(insertResult.lastInsertRowid);
-        // Update FTS if available
-        try {
-            db.prepare(`
-        INSERT INTO memories_fts(rowid, content, type)
-        VALUES (?, ?, 'observation')
-      `).run(result.correctedEntryId, correctedContent);
-        }
-        catch {
-            // FTS not available
-        }
+        // FTS5 index is automatically updated via AFTER INSERT trigger in schema.ts
+        // (no manual insert needed — the trigger handles synchronization)
     }
     finally {
         db.close();
@@ -134,13 +132,15 @@ export function getSupersededHistory(dbPath, limit = 20) {
     const db = new Database(dbPath);
     ensureSupersededSchema(db);
     try {
-        const rows = db.prepare(`
+        const rows = db
+            .prepare(`
       SELECT id, tier, original_entry_id, original_content, superseded_date, reason
       FROM superseded_entries
       ORDER BY id DESC
       LIMIT ?
-    `).all(limit);
-        return rows.map(r => ({
+    `)
+            .all(limit);
+        return rows.map((r) => ({
             id: r.id,
             tier: r.tier,
             originalContent: r.original_content,

package/dist/memory/correction-propagator.js.map

@@ -1 +1 @@
-{"version":3,"file":"correction-propagator.js","sourceRoot":"","sources":["../../src/memory/correction-propagator.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AACtC,OAAO,EAAE,UAAU,EAAE,MAAM,IAAI,CAAC;AAChC,OAAO,EAAE,oBAAoB,EAAE,MAAM,gBAAgB,CAAC;AAoBtD;;GAEG;AACH,MAAM,UAAU,sBAAsB,CAAC,EAAqB;IAC1D,EAAE,CAAC,IAAI,CAAC;;;;;;;;;;;GAWP,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CACjC,MAAc,EACd,aAAqB,EACrB,gBAAwB,EACxB,SAAiB,iBAAiB;IAElC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,YAAY,EAAE,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC;IACxE,CAAC;IAED,MAAM,EAAE,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;IAChC,sBAAsB,CAAC,EAAE,CAAC,CAAC;IAC3B,oBAAoB,CAAC,EAAE,CAAC,CAAC;IAEzB,MAAM,MAAM,GAAqB;QAC/B,aAAa,EAAE,KAAK;QACpB,YAAY,EAAE,EAAE;QAChB,eAAe,EAAE,CAAC;KACnB,CAAC;IAEF,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAChC,MAAM,WAAW,GAAG,aAAa,CAAC,WAAW,EAAE,CAAC;IAEhD,IAAI,CAAC;QACH,8CAA8C;QAC9C,MAAM,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;KAK1B,CAAC,CAAC,GAAG,CAAC,IAAI,WAAW,GAAG,CAA2C,CAAC;QAErE,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,MAAM,CAAC,aAAa,GAAG,IAAI,CAAC;YAC5B,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,IAAI,GAAG,CAAC,EAAE,CAAC;YAChD,MAAM,CAAC,eAAe,GAAG,MAAM,CAAC,eAAe,IAAI,GAAG,CAAC,OAAO,CAAC;YAE/D,0BAA0B;YAC1B,EAAE,CAAC,OAAO,CAAC;;;OAGV,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,OAAO,EAAE,gBAAgB,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;YAE3D,0DAA0D;YAC1D,EAAE,CAAC,OAAO,CAAC;;OAEV,CAAC,CAAC,GAAG,CAAC,cAAc,KAAK,KAAK,gBAAgB,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YAE3D,MAAM,CAAC,eAAe,EAAE,CAAC;QAC3B,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvC,CAAC;QAED,qCAAqC;QACrC,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;KAK3B,CAAC,CAAC,GAAG,CAAC,IAAI,WAAW,GAAG,CAA2C,CAAC;QAErE,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,CAAC,aAAa,GAAG,IAAI,CAAC;YAE5B,EAAE,CAAC,OAAO,CAAC;;;OAGV,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,OAAO,EAAE,gBAAgB,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;YAE3D,EAAE,CAAC,OAAO,CAAC;;OAEV,CAAC,CAAC,GAAG,CAAC,cAAc,KAAK,KAAK,gBAAgB,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YAE3D,MAAM,CAAC,eAAe,EAAE,CAAC;QAC3B,CAAC;QACD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QAC/C,CAAC;QAED,kDAAkD;QAClD,EAAE,CAAC,OAAO,CAAC;;;KAGV,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,EAAE,gBAAgB,MAAM,KAAK,gBAAgB,EAAE,CAAC,CAAC;QAClE,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAEtC,yDAAyD;QACzD,MAAM,YAAY,GAAG,EAAE,CAAC,OAAO,CAAC;;;KAG/B,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,gBAAgB,CAAC,CAAC;QAC9B,MAAM,CAAC,gBAAgB,GAAG,MAAM,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC;QAE/D,0BAA0B;QAC1B,IAAI,CAAC;YACH,EAAE,CAAC,OAAO,CAAC;;;OAGV,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,gBAAgB,EAAE,gBAAgB,CAAC,CAAC;QACpD,CAAC;QAAC,MAAM,CAAC;YACP,oBAAoB;QACtB,CAAC;IACH,CAAC;YAAS,CAAC;QACT,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAc,EACd,QAAgB,EAAE;IAElB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAAE,OAAO,EAAE,CAAC;IAEnC,MAAM,EAAE,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;IAChC,sBAAsB,CAAC,EAAE,CAAC,CAAC;IAE3B,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;KAKvB,CAAC,CAAC,GAAG,CAAC,KAAK,CAOV,CAAC;QAEH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACpB,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,eAAe,EAAE,CAAC,CAAC,gBAAgB;YACnC,cAAc,EAAE,CAAC,CAAC,eAAe;YACjC,YAAY,EAAE,EAAE,EAAE,4CAA4C;YAC9D,MAAM,EAAE,CAAC,CAAC,MAAM;SACjB,CAAC,CAAC,CAAC;IACN,CAAC;YAAS,CAAC;QACT,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC;AACH,CAAC"}
+{"version":3,"file":"correction-propagator.js","sourceRoot":"","sources":["../../src/memory/correction-propagator.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AACtC,OAAO,EAAE,UAAU,EAAE,MAAM,IAAI,CAAC;AAChC,OAAO,EAAE,oBAAoB,EAAE,MAAM,gBAAgB,CAAC;AAoBtD;;GAEG;AACH,MAAM,UAAU,sBAAsB,CAAC,EAAqB;IAC1D,EAAE,CAAC,IAAI,CAAC;;;;;;;;;;;GAWP,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CACjC,MAAc,EACd,aAAqB,EACrB,gBAAwB,EACxB,SAAiB,iBAAiB;IAElC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,YAAY,EAAE,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC;IACxE,CAAC;IAED,MAAM,EAAE,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;IAChC,sBAAsB,CAAC,EAAE,CAAC,CAAC;IAC3B,oBAAoB,CAAC,EAAE,CAAC,CAAC;IAEzB,MAAM,MAAM,GAAqB;QAC/B,aAAa,EAAE,KAAK;QACpB,YAAY,EAAE,EAAE;QAChB,eAAe,EAAE,CAAC;KACnB,CAAC;IAEF,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAChC,MAAM,WAAW,GAAG,aAAa,CAAC,WAAW,EAAE,CAAC;IAEhD,IAAI,CAAC;QACH,8CAA8C;QAC9C,MAAM,OAAO,GAAG,EAAE;aACf,OAAO,CACN;;;;;KAKH,CACE;aACA,GAAG,CAAC,IAAI,WAAW,GAAG,CAA2C,CAAC;QAErE,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,MAAM,CAAC,aAAa,GAAG,IAAI,CAAC;YAC5B,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,IAAI,GAAG,CAAC,EAAE,CAAC;YAChD,MAAM,CAAC,eAAe,GAAG,MAAM,CAAC,eAAe,IAAI,GAAG,CAAC,OAAO,CAAC;YAE/D,0BAA0B;YAC1B,EAAE,CAAC,OAAO,CACR;;;OAGD,CACA,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,OAAO,EAAE,gBAAgB,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;YAE1D,0DAA0D;YAC1D,EAAE,CAAC,OAAO,CACR;;OAED,CACA,CAAC,GAAG,CAAC,cAAc,KAAK,KAAK,gBAAgB,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YAE1D,MAAM,CAAC,eAAe,EAAE,CAAC;QAC3B,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvC,CAAC;QAED,qCAAqC;QACrC,MAAM,QAAQ,GAAG,EAAE;aAChB,OAAO,CACN;;;;;KAKH,CACE;aACA,GAAG,CAAC,IAAI,WAAW,GAAG,CAA2C,CAAC;QAErE,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,CAAC,aAAa,GAAG,IAAI,CAAC;YAE5B,EAAE,CAAC,OAAO,CACR;;;OAGD,CACA,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,OAAO,EAAE,gBAAgB,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;YAE1D,EAAE,CAAC,OAAO,CACR;;OAED,CACA,CAAC,GAAG,CAAC,cAAc,KAAK,KAAK,gBAAgB,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YAE1D,MAAM,CAAC,eAAe,EAAE,CAAC;QAC3B,CAAC;QACD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QAC/C,CAAC;QAED,kDAAkD;QAClD,EAAE,CAAC,OAAO,CACR;;;KAGD,CACA,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,EAAE,gBAAgB,MAAM,KAAK,gBAAgB,EAAE,CAAC,CAAC;QACjE,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAEtC,yDAAyD;QACzD,MAAM,YAAY,GAAG,EAAE;aACpB,OAAO,CACN;;;KAGH,CACE;aACA,GAAG,CAAC,GAAG,EAAE,gBAAgB,CAAC,CAAC;QAC9B,MAAM,CAAC,gBAAgB,GAAG,MAAM,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC;QAE/D,4EAA4E;QAC5E,kEAAkE;IACpE,CAAC;YAAS,CAAC;QACT,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,MAAc,EAAE,QAAgB,EAAE;IACrE,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAAE,OAAO,EAAE,CAAC;IAEnC,MAAM,EAAE,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;IAChC,sBAAsB,CAAC,EAAE,CAAC,CAAC;IAE3B,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,EAAE;aACZ,OAAO,CACN;;;;;KAKH,CACE;aACA,GAAG,CAAC,KAAK,CAOV,CAAC;QAEH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACtB,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,eAAe,EAAE,CAAC,CAAC,gBAAgB;YACnC,cAAc,EAAE,CAAC,CAAC,eAAe;YACjC,YAAY,EAAE,EAAE,EAAE,4CAA4C;YAC9D,MAAM,EAAE,CAAC,CAAC,MAAM;SACjB,CAAC,CAAC,CAAC;IACN,CAAC;YAAS,CAAC;QACT,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC;AACH,CAAC"}

package/dist/memory/dynamic-retrieval.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"dynamic-retrieval.d.ts","sourceRoot":"","sources":["../../src/memory/dynamic-retrieval.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAKH,OAAO,EAIL,KAAK,kBAAkB,EACxB,MAAM,sBAAsB,CAAC;AAG9B,OAAO,EAGL,KAAK,eAAe,EACpB,KAAK,YAAY,EAClB,MAAM,uBAAuB,CAAC;AAO/B,OAAO,EAGL,KAAK,eAAe,EACrB,MAAM,yBAAyB,CAAC;AAYjC;;GAEG;AACH,MAAM,MAAM,eAAe,GAAG,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;AAEhE;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,MAAM,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;IACtF,QAAQ,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;IACxF,OAAO,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;CACxF;AAQD;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,MAAM,GAAG,eAAe,CAmDrE;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC/B,UAAU,EAAE,eAAe,EAC3B,MAAM,GAAE,oBAA+C,GACtD;IAAE,SAAS,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAE/E;AAED,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,CAAC;IAC9D,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,oBAAoB;IACnC,cAAc,EAAE,kBAAkB,CAAC;IACnC,gBAAgB,EAAE,eAAe,EAAE,CAAC;IACpC,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,cAAc,EAAE,MAAM,CAAC;IACvB,gBAAgB,EAAE,MAAM,CAAC;IACzB,eAAe,EAAE,eAAe,CAAC;IACjC,WAAW,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAChE,gBAAgB,CAAC,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,CAAC;QAAC,gBAAgB,EAAE,MAAM,CAAA;KAAE,CAAC;IACrF,eAAe,CAAC,EAAE,eAAe,CAAC;IAClC,SAAS,CAAC,EAAE,eAAe,CAAC;CAC7B;AAED;;;GAGG;AACH,wBAAsB,4BAA4B,CAChD,eAAe,EAAE,MAAM,EACvB,WAAW,GAAE,MAAsB,EACnC,OAAO,GAAE;IACP,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sBAAsB,CAAC,EAAE,OAAO,CAAC;IACjC,YAAY,CAAC,EAAE,YAAY,CAAC;CACxB,GACL,OAAO,CAAC,oBAAoB,CAAC,CA0O/B;AAivBD;;;;;;;;;;GAUG;AACH,MAAM,WAAW,WAAW;IAC1B,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,OAAO,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,WAAW,GAAG,IAAI,CAmC7D"}
+{"version":3,"file":"dynamic-retrieval.d.ts","sourceRoot":"","sources":["../../src/memory/dynamic-retrieval.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAKH,OAAO,EAIL,KAAK,kBAAkB,EACxB,MAAM,sBAAsB,CAAC;AAG9B,OAAO,EAGL,KAAK,eAAe,EACpB,KAAK,YAAY,EAClB,MAAM,uBAAuB,CAAC;AAO/B,OAAO,EAGL,KAAK,eAAe,EACrB,MAAM,yBAAyB,CAAC;AA2EjC;;GAEG;AACH,MAAM,MAAM,eAAe,GAAG,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;AAEhE;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,MAAM,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;IACtF,QAAQ,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;IACxF,OAAO,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;CACxF;AAQD;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,MAAM,GAAG,eAAe,CAmDrE;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC/B,UAAU,EAAE,eAAe,EAC3B,MAAM,GAAE,oBAA+C,GACtD;IAAE,SAAS,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAE/E;AAED,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,CAAC;IAC9D,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,oBAAoB;IACnC,cAAc,EAAE,kBAAkB,CAAC;IACnC,gBAAgB,EAAE,eAAe,EAAE,CAAC;IACpC,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,cAAc,EAAE,MAAM,CAAC;IACvB,gBAAgB,EAAE,MAAM,CAAC;IACzB,eAAe,EAAE,eAAe,CAAC;IACjC,WAAW,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAChE,gBAAgB,CAAC,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,CAAC;QAAC,gBAAgB,EAAE,MAAM,CAAA;KAAE,CAAC;IACrF,eAAe,CAAC,EAAE,eAAe,CAAC;IAClC,SAAS,CAAC,EAAE,eAAe,CAAC;CAC7B;AAED;;;GAGG;AACH,wBAAsB,4BAA4B,CAChD,eAAe,EAAE,MAAM,EACvB,WAAW,GAAE,MAAsB,EACnC,OAAO,GAAE;IACP,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sBAAsB,CAAC,EAAE,OAAO,CAAC;IACjC,YAAY,CAAC,EAAE,YAAY,CAAC;CACxB,GACL,OAAO,CAAC,oBAAoB,CAAC,CAmV/B;AAiuBD;;;;;;;;;;GAUG;AACH,MAAM,WAAW,WAAW;IAC1B,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,OAAO,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,WAAW,GAAG,IAAI,CAmC7D"}

package/dist/memory/dynamic-retrieval.js

@@ -13,7 +13,7 @@ import { existsSync, readFileSync, statSync } from 'fs';
 import { join } from 'path';
 import Database from 'better-sqlite3';
 import { classifyTask, extractTaskEntities, getSuggestedMemoryQueries, } from './task-classifier.js';
-import { ContextBudget } from './context-compressor.js';
+import { ContextBudget, DynamicCompressor, estimateTokens } from './context-compressor.js';
 import { compressToSemanticUnits } from './semantic-compression.js';
 import { decideContextLevel, recordOutcome, } from './adaptive-context.js';
 import { getRelevantKnowledge, recordKnowledgeOutcome } from './terminal-bench-knowledge.js';
@@ -23,8 +23,70 @@ import { getSpeculativeCache } from './speculative-cache.js';
 import { contentHash, jaccardSimilarity } from '../utils/string-similarity.js';
 import { getPerformanceMonitor } from '../utils/performance-monitor.js';
 import { detectAmbiguity, formatAmbiguityForContext, } from './ambiguity-detector.js';
+import { getMemoryConsolidator } from './memory-consolidator.js';
+import { KnowledgeGraph } from './knowledge-graph.js';
+// Singleton KnowledgeGraph to avoid open/close per retrieval call
+let _knowledgeGraph = null;
+let _knowledgeGraphPath = null;
+function getOrCreateKnowledgeGraph(dbPath) {
+    if (!_knowledgeGraph || _knowledgeGraphPath !== dbPath) {
+        if (_knowledgeGraph)
+            try {
+                _knowledgeGraph.close();
+            }
+            catch {
+                /* ignore */
+            }
+        _knowledgeGraph = new KnowledgeGraph(dbPath);
+        _knowledgeGraphPath = dbPath;
+    }
+    return _knowledgeGraph;
+}
 const FILE_CACHE_TTL = 60_000; // 1 minute TTL
+const FILE_CACHE_MAX = 20; // Maximum cached files (prevents unbounded growth)
+// eslint-disable-next-line @typescript-eslint/no-explicit-any
 const fileReadCache = new Map();
+// Evict oldest entries if cache exceeds max size (runs on cleanup interval)
+function trimFileCache() {
+    while (fileReadCache.size > FILE_CACHE_MAX) {
+        const firstKey = fileReadCache.keys().next().value;
+        if (firstKey)
+            fileReadCache.delete(firstKey);
+        else
+            break;
+    }
+}
+// ── Shared readonly DB connection pool (avoids N+1 connection opens per retrieval) ──
+const readonlyDbPool = new Map();
+const DB_POOL_TTL = 30_000; // Close idle connections after 30s
+function getReadonlyDb(dbPath) {
+    const existing = readonlyDbPool.get(dbPath);
+    if (existing) {
+        existing.lastUsed = Date.now();
+        return existing.db;
+    }
+    const db = new Database(dbPath, { readonly: true });
+    readonlyDbPool.set(dbPath, { db, lastUsed: Date.now() });
+    return db;
+}
+// Periodic cleanup of idle connections (runs every 60s, unref'd so it doesn't block exit)
+const dbPoolCleanupInterval = setInterval(() => {
+    const now = Date.now();
+    for (const [path, entry] of readonlyDbPool) {
+        if (now - entry.lastUsed > DB_POOL_TTL) {
+            try {
+                entry.db.close();
+            }
+            catch {
+                /* ignore */
+            }
+            readonlyDbPool.delete(path);
+        }
+    }
+    // Also trim file cache
+    trimFileCache();
+}, 60_000);
+dbPoolCleanupInterval.unref();
 const DEFAULT_RETRIEVAL_DEPTHS = {
     simple: { shortTerm: 3, sessionMem: 2, longTerm: 5, patterns: 3 },
     moderate: { shortTerm: 6, sessionMem: 5, longTerm: 8, patterns: 5 },
@@ -96,15 +158,11 @@ export async function retrieveDynamicMemoryContext(taskInstruction, projectRoot
     // T5: Read token budget from config if available, fall back to parameter or default
     let configMaxTokens = 2000;
     try {
-        const { existsSync: fsExists, readFileSync: fsRead } = await import('fs');
-        const { join: pathJoin } = await import('path');
-        const configPath = pathJoin(projectRoot, '.uap.json');
-        if (fsExists(configPath)) {
-            const config = JSON.parse(fsRead(configPath, 'utf-8'));
-            const budgetFromConfig = config?.costOptimization?.tokenBudget?.maxContextTokens;
-            if (typeof budgetFromConfig === 'number' && budgetFromConfig > 0) {
-                configMaxTokens = budgetFromConfig;
-            }
+        const { loadUapConfig: loadCfg } = await import('../utils/config-loader.js');
+        const cfg = loadCfg(projectRoot);
+        const budgetFromConfig = cfg?.costOptimization?.tokenBudget?.maxContextTokens;
+        if (typeof budgetFromConfig === 'number' && budgetFromConfig > 0) {
+            configMaxTokens = budgetFromConfig;
         }
     }
     catch {
@@ -140,6 +198,39 @@ export async function retrieveDynamicMemoryContext(taskInstruction, projectRoot
     const budget = new ContextBudget(effectiveMaxTokens);
     // Step 4: Extract entities from task
     const entities = extractTaskEntities(taskInstruction);
+    // Step 4b: Enrich entities with knowledge graph relationships
+    // Uses a singleton KnowledgeGraph to avoid open/close per retrieval call
+    try {
+        const kgDbPath = join(projectRoot, 'agents/data/memory/short_term.db');
+        if (existsSync(kgDbPath)) {
+            const kg = getOrCreateKnowledgeGraph(kgDbPath);
+            // Query knowledge graph for each extracted entity to find related concepts
+            for (const tech of entities.technologies.slice(0, 3)) {
+                const result = kg.queryEntityGraph('technology', tech);
+                if (result) {
+                    for (const rel of result.relationships.slice(0, 3)) {
+                        if (!entities.technologies.includes(rel.relatedEntity.name)) {
+                            entities.technologies.push(rel.relatedEntity.name);
+                        }
+                    }
+                }
+            }
+            for (const file of entities.files.slice(0, 2)) {
+                const result = kg.queryEntityGraph('file', file);
+                if (result) {
+                    for (const rel of result.relationships.slice(0, 2)) {
+                        if (!entities.files.includes(rel.relatedEntity.name)) {
+                            entities.files.push(rel.relatedEntity.name);
+                        }
+                    }
+                }
+            }
+            // Don't close — singleton is reused across calls
+        }
+    }
+    catch {
+        // Knowledge graph enrichment is non-fatal
+    }
     // Step 5: Get suggested memory queries (enhanced with predictive prefetch)
     const suggestedQueries = getSuggestedMemoryQueries(classification);
     // Step 5b: Predictive memory prefetch - predict additional queries based on task history
@@ -216,7 +307,23 @@ export async function retrieveDynamicMemoryContext(taskInstruction, projectRoot
             })));
         }
     }
-    // Step 7b: Prune memories to fit token budget using ContextPruner
+    // Step 7b: Apply budget-aware dynamic compression to individual memories
+    // Track consumed tokens so each memory sees a decreasing budget
+    let compressorConsumedTokens = 0;
+    try {
+        const dynamicCompressor = new DynamicCompressor();
+        processedMemories = processedMemories.map((m) => {
+            const budgetRemaining = Math.max(0, budget.remaining() - compressorConsumedTokens);
+            const { compressed } = dynamicCompressor.compressDynamic(m.content, budgetRemaining, effectiveMaxTokens);
+            compressorConsumedTokens += estimateTokens(compressed);
+            return { ...m, content: compressed };
+        });
+    }
+    catch {
+        // DynamicCompressor failure is non-fatal
+    }
+    // Step 7c: Prune memories to fit token budget using ContextPruner
+    // Subtract tokens already consumed by compression from the available budget
     try {
         const pruner = new ContextPruner();
         const prunableMemories = processedMemories.map((m, i) => ({
@@ -225,7 +332,8 @@ export async function retrieveDynamicMemoryContext(taskInstruction, projectRoot
             age: i, // Use index as age proxy (older = higher index)
             accessCount: 1,
         }));
-        const pruned = pruner.prune(prunableMemories, budget.remaining());
+        const adjustedBudget = Math.max(0, budget.remaining() - compressorConsumedTokens);
+        const pruned = pruner.prune(prunableMemories, adjustedBudget);
         if (pruned.length < processedMemories.length) {
             // Map pruned back to processed memories by content match
             const prunedContents = new Set(pruned.map((p) => p.content));
@@ -263,11 +371,67 @@ export async function retrieveDynamicMemoryContext(taskInstruction, projectRoot
     // Record access for predictive memory learning
     try {
         const predictive = getPredictiveMemoryService();
-        predictive.recordAccess(taskInstruction, processedMemories.map(m => m.source).filter((v, i, a) => a.indexOf(v) === i));
+        predictive.recordAccess(taskInstruction, processedMemories.map((m) => m.source).filter((v, i, a) => a.indexOf(v) === i));
     }
     catch {
         // Non-fatal
     }
+    // Record memory access for quality scoring (enables access-pattern learning)
+    try {
+        const consolidator = getMemoryConsolidator();
+        for (const mem of processedMemories) {
+            // Use content hash as memory ID for quality tracking
+            const memId = contentHash(mem.content);
+            consolidator.recordAccess(memId);
+        }
+    }
+    catch {
+        // Non-fatal — quality scoring is an optimization, not a requirement
+    }
+    // Pre-warm speculative cache for predicted next queries (async, non-blocking)
+    try {
+        const speculativeCache = getSpeculativeCache();
+        // Fire-and-forget: pre-warm cache with a real fetcher that queries short-term memory
+        void speculativeCache.preWarm(taskInstruction, async (query) => {
+            const stDbPath = join(projectRoot, 'agents/data/memory/short_term.db');
+            if (!existsSync(stDbPath))
+                return [];
+            try {
+                const db = getReadonlyDb(stDbPath);
+                const rows = db
+                    .prepare(`
+          SELECT type, content FROM memories
+          WHERE content LIKE ?
+          ORDER BY id DESC LIMIT 5
+        `)
+                    .all(`%${query.slice(0, 50)}%`);
+                return rows;
+            }
+            catch {
+                return [];
+            }
+        });
+    }
+    catch {
+        // Non-fatal
+    }
+    // Periodically persist learned data (fire-and-forget, every ~10th call)
+    if (Math.random() < 0.1) {
+        try {
+            const predictive = getPredictiveMemoryService();
+            predictive.saveToDb('./agents/data/memory/predictive.db');
+        }
+        catch {
+            /* non-fatal */
+        }
+        try {
+            const { saveHierarchicalMemory } = await import('./hierarchical-memory.js');
+            saveHierarchicalMemory(join(projectRoot, 'agents/data/memory/hierarchical.db'));
+        }
+        catch {
+            /* non-fatal */
+        }
+    }
     return {
         classification,
         relevantMemories: processedMemories,
@@ -296,12 +460,38 @@ export async function retrieveDynamicMemoryContext(taskInstruction, projectRoot
  */
 async function queryAllMemorySources(taskInstruction, classification, entities, suggestedQueries, projectRoot, depth, maxTokens) {
     const memories = [];
-    // Source 1: Short-term SQLite memory (limited by depth)
-    const shortTermMemories = await queryShortTermMemory(classification, entities, projectRoot, depth.shortTerm);
-    memories.push(...shortTermMemories);
-    // Source 2: Session memories (limited by depth)
-    const sessionMemories = await querySessionMemory(taskInstruction, projectRoot, depth.sessionMem);
-    memories.push(...sessionMemories);
+    // Source 1+2: Hierarchical tiered memory (replaces flat short-term + session queries)
+    // Uses hot/warm/cold tiering with automatic promotion/demotion and semantic search
+    try {
+        const { getHierarchicalMemoryManager } = await import('./hierarchical-memory.js');
+        const stDbPath = join(projectRoot, 'agents/data/memory/short_term.db');
+        const hmm = getHierarchicalMemoryManager(undefined, existsSync(stDbPath) ? stDbPath : undefined);
+        // Run tier maintenance periodically (~every 5th retrieval)
+        if (Math.random() < 0.2) {
+            hmm.pruneStale();
+            hmm.enforceTokenBudget();
+        }
+        const tieredResults = await hmm.query(taskInstruction, depth.shortTerm + depth.sessionMem);
+        for (const entry of tieredResults) {
+            memories.push({
+                content: entry.compressed || entry.content,
+                type: entry.type === 'observation'
+                    ? 'lesson'
+                    : entry.type === 'action' || entry.type === 'goal'
+                        ? 'context'
+                        : 'pattern',
+                relevance: Math.min(0.95, entry.importance / 10 + (entry.tier === 'hot' ? 0.2 : entry.tier === 'warm' ? 0.1 : 0)),
+                source: `hierarchical-${entry.tier}`,
+            });
+        }
+    }
+    catch {
+        // Fallback to flat queries if hierarchical memory fails
+        const shortTermMemories = await queryShortTermMemory(classification, entities, projectRoot, depth.shortTerm);
+        memories.push(...shortTermMemories);
+        const sessionMemories = await querySessionMemory(taskInstruction, projectRoot, depth.sessionMem);
+        memories.push(...sessionMemories);
+    }
     // Source 3: Long-term prepopulated memory (limited by depth)
     const longTermMemories = await queryLongTermMemory(suggestedQueries, projectRoot, depth.longTerm);
     memories.push(...longTermMemories);
@@ -331,7 +521,7 @@ async function queryAllMemorySources(taskInstruction, classification, entities,
     const budgeted = [];
     let usedTokens = 0;
     for (const mem of uniqueMemories) {
-        const memTokens = Math.ceil(mem.content.length / 4);
+        const memTokens = estimateTokens(mem.content);
         if (usedTokens + memTokens > effectiveBudget && budgeted.length > 0)
             break;
         budgeted.push(mem);
@@ -349,9 +539,8 @@ async function queryShortTermMemory(classification, entities, projectRoot, limit
         return [];
     const memories = [];
     const perKeywordLimit = Math.max(1, Math.ceil(limit / 3));
-    let db = null;
     try {
-        db = new Database(dbPath, { readonly: true });
+        const db = getReadonlyDb(dbPath);
         // Check if FTS5 index exists
         const hasFts = db
             .prepare("SELECT name FROM sqlite_master WHERE type='table' AND name='memories_fts'")
@@ -452,140 +641,82 @@ async function queryShortTermMemory(classification, entities, projectRoot, limit
         }
     }
     catch {
-        // Ignore query errors
-    }
-    finally {
-        db?.close();
+        // Ignore query errors — pooled connection stays open for reuse
     }
     return memories;
 }
 /**
- * Query session memories for recent decisions using parameterized queries (secure)
+ * Query session memories for recent decisions using parameterized queries (secure).
+ * Uses FTS5 full-text search when a task instruction is provided for content-aware recall,
+ * falling back to importance-based recency query.
  */
-async function querySessionMemory(_taskInstruction, projectRoot, limit = 5) {
+async function querySessionMemory(taskInstruction, projectRoot, limit = 5) {
     const dbPath = join(projectRoot, 'agents/data/memory/short_term.db');
     if (!existsSync(dbPath))
         return [];
     const memories = [];
-    let db = null;
     try {
-        db = new Database(dbPath, { readonly: true });
-        const stmt = db.prepare(`
-      SELECT type, content FROM session_memories 
-      WHERE importance >= 7 
-      ORDER BY id DESC 
-      LIMIT ?
-    `);
-        const rows = stmt.all(limit);
+        const db = getReadonlyDb(dbPath);
+        // Try FTS5 content-aware search first if we have a task instruction
+        let rows = [];
+        if (taskInstruction && taskInstruction.trim().length > 3) {
+            try {
+                // Extract key terms from task instruction for FTS5 query
+                // Quote each word to prevent FTS5 reserved words (AND, OR, NOT, NEAR) from being
+                // interpreted as operators — matches the sanitization pattern in sqlite.ts:186-194
+                const FTS5_RESERVED = new Set(['and', 'or', 'not', 'near']);
+                const ftsQuery = taskInstruction
+                    .replace(/[^\w\s]/g, ' ')
+                    .split(/\s+/)
+                    .filter((w) => w.length > 2 && !FTS5_RESERVED.has(w.toLowerCase()))
+                    .slice(0, 8)
+                    .map((w) => '"' + w.replace(/"/g, '""') + '"')
+                    .join(' OR ');
+                if (ftsQuery.length > 0) {
+                    const ftsStmt = db.prepare(`
+            SELECT sm.type, sm.content, fts.rank
+            FROM session_memories_fts fts
+            JOIN session_memories sm ON sm.id = fts.rowid
+            WHERE session_memories_fts MATCH ?
+            ORDER BY fts.rank
+            LIMIT ?
+          `);
+                    rows = ftsStmt.all(ftsQuery, limit);
+                }
+            }
+            catch {
+                // FTS5 table may not exist yet or query may fail — fall through to fallback
+                rows = [];
+            }
+        }
+        // Fallback: importance-based recency query
+        if (rows.length === 0) {
+            const stmt = db.prepare(`
+        SELECT type, content FROM session_memories 
+        WHERE importance >= 7 
+        ORDER BY id DESC 
+        LIMIT ?
+      `);
+            rows = stmt.all(limit);
+        }
         for (const row of rows) {
             if (row.content) {
                 memories.push({
                     content: row.content.slice(0, 500),
                     type: row.type === 'lesson' ? 'lesson' : row.type === 'decision' ? 'context' : 'pattern',
-                    relevance: 0.8,
+                    relevance: row.rank ? Math.min(0.95, 0.8 + Math.abs(row.rank) * 0.01) : 0.8,
                     source: 'session-memory',
                 });
             }
         }
     }
     catch {
-        // Ignore query errors
-    }
-    finally {
-        db?.close();
+        // Ignore query errors — pooled connection stays open for reuse
     }
     return memories;
 }
-// OPTIMIZATION 9: Stopwords to filter from long-term memory queries
-// These words match nearly everything and reduce query precision
-const QUERY_STOPWORDS = new Set([
-    'a',
-    'an',
-    'the',
-    'is',
-    'are',
-    'was',
-    'were',
-    'be',
-    'been',
-    'being',
-    'have',
-    'has',
-    'had',
-    'do',
-    'does',
-    'did',
-    'will',
-    'would',
-    'could',
-    'should',
-    'may',
-    'might',
-    'shall',
-    'can',
-    'need',
-    'must',
-    'to',
-    'of',
-    'in',
-    'for',
-    'on',
-    'with',
-    'at',
-    'by',
-    'from',
-    'as',
-    'into',
-    'through',
-    'during',
-    'before',
-    'after',
-    'above',
-    'below',
-    'and',
-    'but',
-    'or',
-    'nor',
-    'not',
-    'so',
-    'yet',
-    'both',
-    'either',
-    'this',
-    'that',
-    'these',
-    'those',
-    'it',
-    'its',
-    'best',
-    'most',
-    'very',
-    'good',
-    'great',
-    'well',
-    'new',
-    'more',
-    'common',
-    'general',
-    'basic',
-    'simple',
-    'all',
-    'any',
-    'some',
-    'how',
-    'what',
-    'when',
-    'where',
-    'which',
-    'who',
-    'why',
-    'practices',
-    'tips',
-    'implementation',
-    'gotchas',
-    'mistakes',
-    'patterns',
-]);
+// OPTIMIZATION 9: Stopwords from shared utility (replaces 88-line inline set)
+import { QUERY_STOPWORDS } from '../utils/stopwords.js';
 /**
  * Query long-term prepopulated memory
  * OPTIMIZATION 9: Added stopword filtering for better query precision