@tonycasey/lisa 2.25.4 → 2.27.0

package/dist/lib/infrastructure/services/ConsolidationService.js

@@ -1,134 +0,0 @@
-"use strict";
-/**
- * Consolidation Service Implementation.
- *
- * Consolidates duplicate or related memory facts by merging,
- * archiving duplicates, or keeping all unchanged.
- *
- * Creates supersedes relationships when a relationship writer is available.
- *
- * Part of Phase 5C: Curation & Compaction.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.createConsolidationService = createConsolidationService;
-/**
- * Create a ConsolidationService.
- *
- * @param memoryWriter - Memory writer for adding/expiring facts
- * @param memoryReader - Memory reader for loading facts (to find newest)
- * @param relationshipWriter - Optional relationship writer for supersedes links
- */
-function createConsolidationService(memoryWriter, memoryReader, relationshipWriter) {
-    return {
-        async consolidate(groupId, factUuids, action, options) {
-            // Validate: at least 2 UUIDs
-            if (factUuids.length < 2) {
-                throw new Error('Consolidation requires at least 2 fact UUIDs');
-            }
-            // Validate: retainUuid must be in the list
-            if (options?.retainUuid && !factUuids.includes(options.retainUuid)) {
-                throw new Error(`retainUuid "${options.retainUuid}" is not in the provided fact UUIDs`);
-            }
-            if (action === 'keep-all') {
-                return {
-                    action: 'keep-all',
-                    retainedUuid: factUuids[0],
-                    archivedUuids: [],
-                    relationshipsCreated: 0,
-                };
-            }
-            if (action === 'merge') {
-                return await handleMerge(groupId, factUuids, options);
-            }
-            // archive-duplicates
-            return await handleArchiveDuplicates(groupId, factUuids, options);
-        },
-    };
-    /**
-     * Handle the merge action: create new fact, expire originals, link supersedes.
-     */
-    async function handleMerge(groupId, factUuids, options) {
-        // Determine merged text
-        const mergedText = options?.mergedText;
-        if (!mergedText) {
-            throw new Error('merge action requires mergedText in options');
-        }
-        // Add the new merged fact
-        await memoryWriter.addFact(groupId, mergedText);
-        // Find the UUID of the newly created fact by searching recent facts
-        // for the merged text. Load enough to find it deterministically.
-        const recentFacts = await memoryReader.loadFactsDateOrdered([groupId], 20);
-        const newFact = recentFacts.find((fact) => fact.fact === mergedText);
-        if (!newFact?.uuid) {
-            throw new Error('Unable to locate merged fact after creation');
-        }
-        const retainedUuid = newFact.uuid;
-        // Expire all original facts
-        const archivedUuids = [];
-        for (const uuid of factUuids) {
-            await memoryWriter.expireFact(groupId, uuid);
-            archivedUuids.push(uuid);
-        }
-        // Create supersedes relationships
-        let relationshipsCreated = 0;
-        if (relationshipWriter) {
-            for (const uuid of factUuids) {
-                try {
-                    await relationshipWriter.linkFacts(groupId, retainedUuid, uuid, 'supersedes');
-                    relationshipsCreated++;
-                }
-                catch {
-                    // Gracefully skip if relationship creation fails
-                }
-            }
-        }
-        return {
-            action: 'merge',
-            retainedUuid,
-            archivedUuids,
-            relationshipsCreated,
-        };
-    }
-    /**
-     * Handle the archive-duplicates action: keep one, expire rest, link supersedes.
-     */
-    async function handleArchiveDuplicates(groupId, factUuids, options) {
-        let retainUuid = options?.retainUuid;
-        // Default to the newest fact if no retainUuid specified
-        if (!retainUuid) {
-            const facts = await memoryReader.loadFactsDateOrdered([groupId]);
-            // Find the newest fact that's in our UUID list
-            const uuidSet = new Set(factUuids);
-            const newest = facts.find((f) => f.uuid && uuidSet.has(f.uuid));
-            retainUuid = newest?.uuid ?? factUuids[0];
-        }
-        // Expire all facts except the retained one
-        const archivedUuids = [];
-        for (const uuid of factUuids) {
-            if (uuid !== retainUuid) {
-                await memoryWriter.expireFact(groupId, uuid);
-                archivedUuids.push(uuid);
-            }
-        }
-        // Create supersedes relationships
-        let relationshipsCreated = 0;
-        if (relationshipWriter) {
-            for (const uuid of archivedUuids) {
-                try {
-                    await relationshipWriter.linkFacts(groupId, retainUuid, uuid, 'supersedes');
-                    relationshipsCreated++;
-                }
-                catch {
-                    // Gracefully skip if relationship creation fails
-                }
-            }
-        }
-        return {
-            action: 'archive-duplicates',
-            retainedUuid: retainUuid,
-            archivedUuids,
-            relationshipsCreated,
-        };
-    }
-}
-//# sourceMappingURL=ConsolidationService.js.map

package/dist/lib/infrastructure/services/ConsolidationService.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ConsolidationService.js","sourceRoot":"","sources":["../../../../src/lib/infrastructure/services/ConsolidationService.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;AAiBH,gEA8IC;AArJD;;;;;;GAMG;AACH,SAAgB,0BAA0B,CACxC,YAA2B,EAC3B,YAA2B,EAC3B,kBAA8C;IAE9C,OAAO;QACL,KAAK,CAAC,WAAW,CACf,OAAe,EACf,SAA4B,EAC5B,MAA2B,EAC3B,OAA+B;YAE/B,6BAA6B;YAC7B,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACzB,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,CAAC;YAClE,CAAC;YAED,2CAA2C;YAC3C,IAAI,OAAO,EAAE,UAAU,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;gBACnE,MAAM,IAAI,KAAK,CAAC,eAAe,OAAO,CAAC,UAAU,qCAAqC,CAAC,CAAC;YAC1F,CAAC;YAED,IAAI,MAAM,KAAK,UAAU,EAAE,CAAC;gBAC1B,OAAO;oBACL,MAAM,EAAE,UAAU;oBAClB,YAAY,EAAE,SAAS,CAAC,CAAC,CAAC;oBAC1B,aAAa,EAAE,EAAE;oBACjB,oBAAoB,EAAE,CAAC;iBACxB,CAAC;YACJ,CAAC;YAED,IAAI,MAAM,KAAK,OAAO,EAAE,CAAC;gBACvB,OAAO,MAAM,WAAW,CAAC,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;YACxD,CAAC;YAED,qBAAqB;YACrB,OAAO,MAAM,uBAAuB,CAAC,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QACpE,CAAC;KACF,CAAC;IAEF;;OAEG;IACH,KAAK,UAAU,WAAW,CACxB,OAAe,EACf,SAA4B,EAC5B,OAA+B;QAE/B,wBAAwB;QACxB,MAAM,UAAU,GAAG,OAAO,EAAE,UAAU,CAAC;QACvC,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;QACjE,CAAC;QAED,0BAA0B;QAC1B,MAAM,YAAY,CAAC,OAAO,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QAEhD,oEAAoE;QACpE,iEAAiE;QACjE,MAAM,WAAW,GAAG,MAAM,YAAY,CAAC,oBAAoB,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC;QAC3E,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;QACrE,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;QACjE,CAAC;QACD,MAAM,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC;QAElC,4BAA4B;QAC5B,MAAM,aAAa,GAAa,EAAE,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,MAAM,YAAY,CAAC,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAC7C,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;QAED,kCAAkC;QAClC,IAAI,oBAAoB,GAAG,CAAC,CAAC;QAC7B,IAAI,kBAAkB,EAAE,CAAC;YACvB,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;gBAC7B,IAAI,CAAC;oBACH,MAAM,kBAAkB,CAAC,SAAS,CAAC,OAAO,EAAE,YAAY,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;oBAC9E,oBAAoB,EAAE,CAAC;gBACzB,CAAC;gBAAC,MAAM,CAAC;oBACP,iDAAiD;gBACnD,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,MAAM,EAAE,OAAO;YACf,YAAY;YACZ,aAAa;YACb,oBAAoB;SACrB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,UAAU,uBAAuB,CACpC,OAAe,EACf,SAA4B,EAC5B,OAA+B;QAE/B,IAAI,UAAU,GAAG,OAAO,EAAE,UAAU,CAAC;QAErC,wDAAwD;QACxD,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,MAAM,KAAK,GAAG,MAAM,YAAY,CAAC,oBAAoB,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YACjE,+CAA+C;YAC/C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;YACnC,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAChE,UAAU,GAAG,MAAM,EAAE,IAAI,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;QAED,2CAA2C;QAC3C,MAAM,aAAa,GAAa,EAAE,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;gBACxB,MAAM,YAAY,CAAC,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;gBAC7C,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,kCAAkC;QAClC,IAAI,oBAAoB,GAAG,CAAC,CAAC;QAC7B,IAAI,kBAAkB,EAAE,CAAC;YACvB,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;gBACjC,IAAI,CAAC;oBACH,MAAM,kBAAkB,CAAC,SAAS,CAAC,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;oBAC5E,oBAAoB,EAAE,CAAC;gBACzB,CAAC;gBAAC,MAAM,CAAC;oBACP,iDAAiD;gBACnD,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,MAAM,EAAE,oBAAoB;YAC5B,YAAY,EAAE,UAAU;YACxB,aAAa;YACb,oBAAoB;SACrB,CAAC;IACJ,CAAC;AACH,CAAC"}

package/dist/lib/infrastructure/services/DeduplicationService.d.ts

@@ -1,21 +0,0 @@
-/**
- * Deduplication Detection Service.
- *
- * Infrastructure wrapper around the domain-level deduplication algorithm.
- * Loads facts and conflict groups from repositories, then delegates
- * to the pure detection functions in domain/utils/deduplication.
- *
- * Detection only — no mutations. Consolidation is handled separately.
- */
-import type { IDeduplicationService } from '../../domain/interfaces/IDeduplicationService';
-import type { IMemoryServiceWithQuality } from '../../domain/interfaces/IMemoryService';
-import type { ILlmDeduplicationEnhancer } from './LlmDeduplicationEnhancer';
-export { normalizeText, extractWords, jaccardSimilarity, detectDuplicatesFromFacts, } from '../../domain/utils/deduplication';
-/**
- * Create a DeduplicationService.
- *
- * @param memoryService - Memory service with quality reader (for loading facts and conflicts)
- * @param llmEnhancer - Optional LLM deduplication enhancer for semantic 4th pass
- */
-export declare function createDeduplicationService(memoryService: IMemoryServiceWithQuality, llmEnhancer?: ILlmDeduplicationEnhancer): IDeduplicationService;
-//# sourceMappingURL=DeduplicationService.d.ts.map

package/dist/lib/infrastructure/services/DeduplicationService.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"DeduplicationService.d.ts","sourceRoot":"","sources":["../../../../src/lib/infrastructure/services/DeduplicationService.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,KAAK,EACV,qBAAqB,EAItB,MAAM,+CAA+C,CAAC;AACvD,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,wCAAwC,CAAC;AACxF,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,4BAA4B,CAAC;AAG5E,OAAO,EACL,aAAa,EACb,YAAY,EACZ,iBAAiB,EACjB,yBAAyB,GAC1B,MAAM,kCAAkC,CAAC;AAY1C;;;;;GAKG;AACH,wBAAgB,0BAA0B,CACxC,aAAa,EAAE,yBAAyB,EACxC,WAAW,CAAC,EAAE,yBAAyB,GACtC,qBAAqB,CAwDvB"}

package/dist/lib/infrastructure/services/DeduplicationService.js

@@ -1,111 +0,0 @@
-"use strict";
-/**
- * Deduplication Detection Service.
- *
- * Infrastructure wrapper around the domain-level deduplication algorithm.
- * Loads facts and conflict groups from repositories, then delegates
- * to the pure detection functions in domain/utils/deduplication.
- *
- * Detection only — no mutations. Consolidation is handled separately.
- */
-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 });
-exports.detectDuplicatesFromFacts = exports.jaccardSimilarity = exports.extractWords = exports.normalizeText = void 0;
-exports.createDeduplicationService = createDeduplicationService;
-// Re-export pure algorithm functions from domain utils for backward compatibility
-var deduplication_1 = require("../../domain/utils/deduplication");
-Object.defineProperty(exports, "normalizeText", { enumerable: true, get: function () { return deduplication_1.normalizeText; } });
-Object.defineProperty(exports, "extractWords", { enumerable: true, get: function () { return deduplication_1.extractWords; } });
-Object.defineProperty(exports, "jaccardSimilarity", { enumerable: true, get: function () { return deduplication_1.jaccardSimilarity; } });
-Object.defineProperty(exports, "detectDuplicatesFromFacts", { enumerable: true, get: function () { return deduplication_1.detectDuplicatesFromFacts; } });
-/**
- * Default options for deduplication.
- */
-const DEDUP_DEFAULTS = {
-    minSimilarity: 0.6,
-    limit: 10,
-    since: new Date(0), // epoch — no filter
-    aiAssist: false,
-};
-/**
- * Create a DeduplicationService.
- *
- * @param memoryService - Memory service with quality reader (for loading facts and conflicts)
- * @param llmEnhancer - Optional LLM deduplication enhancer for semantic 4th pass
- */
-function createDeduplicationService(memoryService, llmEnhancer) {
-    return {
-        async detectDuplicates(groupId, options) {
-            const { detectDuplicatesFromFacts } = await Promise.resolve().then(() => __importStar(require('../../domain/utils/deduplication')));
-            const opts = { ...DEDUP_DEFAULTS, ...options };
-            // Load facts (up to 500)
-            const dateOptions = opts.since.getTime() > 0 ? { since: opts.since } : undefined;
-            const facts = await memoryService.loadFactsDateOrdered([groupId], 500, dateOptions);
-            // Load conflict groups for tag overlap pass
-            let conflictGroups = [];
-            try {
-                conflictGroups = await memoryService.findConflicts([groupId]);
-            }
-            catch {
-                // findConflicts may not be available (e.g., no Neo4j); skip Pass 2
-            }
-            // Passes 1-3: algorithmic deduplication
-            const algorithmicGroups = detectDuplicatesFromFacts(facts, conflictGroups, opts);
-            // Pass 4: optional LLM semantic deduplication
-            let allGroups = algorithmicGroups;
-            if (llmEnhancer && opts.aiAssist) {
-                try {
-                    const llmGroups = await llmEnhancer.findSemanticDuplicates(facts, algorithmicGroups);
-                    if (llmGroups.length > 0) {
-                        allGroups = [...algorithmicGroups, ...llmGroups];
-                    }
-                }
-                catch (_error) {
-                    // LLM enhancer failed; proceed with algorithmic results only
-                    // The enhancer logs its own failures; this is a fallback safety net
-                }
-            }
-            // Re-sort by similarity descending and apply limit
-            const sorted = [...allGroups].sort((a, b) => b.similarity - a.similarity);
-            const limited = sorted.slice(0, opts.limit);
-            return {
-                totalFactsScanned: facts.length,
-                duplicateGroups: limited,
-                totalDuplicates: limited.reduce((sum, g) => sum + g.facts.length, 0),
-            };
-        },
-    };
-}
-//# sourceMappingURL=DeduplicationService.js.map

package/dist/lib/infrastructure/services/DeduplicationService.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"DeduplicationService.js","sourceRoot":"","sources":["../../../../src/lib/infrastructure/services/DeduplicationService.ts"],"names":[],"mappings":";AAAA;;;;;;;;GAQG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCH,gEA2DC;AAnFD,kFAAkF;AAClF,kEAK0C;AAJxC,8GAAA,aAAa,OAAA;AACb,6GAAA,YAAY,OAAA;AACZ,kHAAA,iBAAiB,OAAA;AACjB,0HAAA,yBAAyB,OAAA;AAG3B;;GAEG;AACH,MAAM,cAAc,GAAoC;IACtD,aAAa,EAAE,GAAG;IAClB,KAAK,EAAE,EAAE;IACT,KAAK,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,oBAAoB;IACxC,QAAQ,EAAE,KAAK;CAChB,CAAC;AAEF;;;;;GAKG;AACH,SAAgB,0BAA0B,CACxC,aAAwC,EACxC,WAAuC;IAEvC,OAAO;QACL,KAAK,CAAC,gBAAgB,CACpB,OAAe,EACf,OAA+B;YAE/B,MAAM,EAAE,yBAAyB,EAAE,GAAG,wDAAa,kCAAkC,GAAC,CAAC;YACvF,MAAM,IAAI,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,OAAO,EAAE,CAAC;YAE/C,yBAAyB;YACzB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;YACjF,MAAM,KAAK,GAAG,MAAM,aAAa,CAAC,oBAAoB,CACpD,CAAC,OAAO,CAAC,EACT,GAAG,EACH,WAAW,CACZ,CAAC;YAEF,4CAA4C;YAC5C,IAAI,cAAc,GAA8B,EAAE,CAAC;YACnD,IAAI,CAAC;gBACH,cAAc,GAAG,MAAM,aAAa,CAAC,aAAa,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YAChE,CAAC;YAAC,MAAM,CAAC;gBACP,mEAAmE;YACrE,CAAC;YAED,wCAAwC;YACxC,MAAM,iBAAiB,GAAG,yBAAyB,CAAC,KAAK,EAAE,cAAc,EAAE,IAAI,CAAC,CAAC;YAEjF,8CAA8C;YAC9C,IAAI,SAAS,GAA+B,iBAAiB,CAAC;YAC9D,IAAI,WAAW,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACjC,IAAI,CAAC;oBACH,MAAM,SAAS,GAAG,MAAM,WAAW,CAAC,sBAAsB,CACxD,KAAK,EACL,iBAAiB,CAClB,CAAC;oBACF,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACzB,SAAS,GAAG,CAAC,GAAG,iBAAiB,EAAE,GAAG,SAAS,CAAC,CAAC;oBACnD,CAAC;gBACH,CAAC;gBAAC,OAAO,MAAM,EAAE,CAAC;oBAChB,6DAA6D;oBAC7D,oEAAoE;gBACtE,CAAC;YACH,CAAC;YAED,mDAAmD;YACnD,MAAM,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;YAC1E,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YAE5C,OAAO;gBACL,iBAAiB,EAAE,KAAK,CAAC,MAAM;gBAC/B,eAAe,EAAE,OAAO;gBACxB,eAAe,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;aACrE,CAAC;QACJ,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/lib/infrastructure/services/MemoryService.d.ts

@@ -1,96 +0,0 @@
-import type { IMemoryService, IMcpClient, IMemoryResult, IMemoryItem, ILogger, IMemorySaveOptions, IMemoryQualityReader } from '../../domain';
-import type { ConfidenceLevel } from '../../domain/interfaces/types/IMemoryQuality';
-import type { IConflictGroup, IQueryOptions } from '../../domain/interfaces/dal/types';
-import type { IRepositoryRouter } from '../../domain/interfaces/dal';
-/**
- * Memory service implementation.
- * Supports both direct MCP and DAL router backends.
- *
- * When a router is provided, it will:
- * - Use Neo4j for date-ordered listing (if available)
- * - Use MCP for semantic search
- * - Use MCP for writes
- *
- * When only MCP is provided, falls back to MCP for all operations.
- */
-export declare class MemoryService implements IMemoryService, IMemoryQualityReader {
-    private readonly mcp;
-    private readonly router?;
-    private readonly logger;
-    private readonly structuredLogger;
-    constructor(mcp: IMcpClient, router?: IRepositoryRouter | undefined, logger?: ILogger);
-    /**
-     * Create log context for memory operations.
-     */
-    private createLogContext;
-    /**
-     * Load memory for a group, querying hierarchically.
-     *
-     * Uses AbortController-based cancellation to ensure no mutations
-     * occur after timeout and resources are properly cleaned up.
-     *
-     * Note: Session ID management is handled internally by McpClient.
-     * Callers do not need to track session IDs.
-     *
-     * @param groupIds - Hierarchical group IDs to query
-     * @param aliases - Project aliases for additional queries
-     * @param branch - Current git branch (optional)
-     * @param timeoutMs - Timeout in milliseconds (default: 5000)
-     * @param signal - External abort signal for cancellation (optional)
-     */
-    loadMemory(groupIds: readonly string[], aliases: readonly string[], branch: string | null, timeoutMs?: number, signal?: AbortSignal): Promise<IMemoryResult>;
-    /**
-     * Save facts to memory.
-     */
-    saveMemory(groupId: string, facts: readonly string[]): Promise<void>;
-    /**
-     * Add a single fact to memory.
-     */
-    addFact(groupId: string, fact: string, tags?: readonly string[]): Promise<void>;
-    /**
-     * Add a fact with lifecycle metadata.
-     * Enriches tags with lifecycle:<tier> tag and delegates to addFact.
-     */
-    addFactWithLifecycle(groupId: string, fact: string, options: IMemorySaveOptions): Promise<void>;
-    /**
-     * Expire a single fact by UUID.
-     * Routes to a repository that supports expiration.
-     */
-    expireFact(groupId: string, uuid: string): Promise<void>;
-    /**
-     * Clean up expired facts based on lifecycle TTL defaults.
-     * Expires session facts older than 24h and ephemeral facts older than 1h.
-     */
-    cleanupExpired(groupId: string): Promise<number>;
-    /**
-     * Load facts using DAL router with date ordering.
-     * This is an optimized path for simple listing without aliases.
-     *
-     * @param groupIds - Group IDs to query
-     * @param limit - Maximum number of facts to return
-     * @param options - Optional date filtering options
-     */
-    loadFactsDateOrdered(groupIds: readonly string[], limit?: number, options?: {
-        since?: Date;
-        until?: Date;
-    }): Promise<IMemoryItem[]>;
-    /**
-     * Semantic search using DAL router.
-     *
-     * @param groupIds - Group IDs to search
-     * @param query - Search query
-     * @param limit - Maximum number of results
-     */
-    searchFacts(groupIds: readonly string[], query: string, limit?: number): Promise<IMemoryItem[]>;
-    /**
-     * Find facts at or above a minimum confidence level.
-     * Routes to Neo4j repository for tag-based confidence filtering.
-     */
-    findByMinConfidence(groupIds: readonly string[], minLevel: ConfidenceLevel, options?: IQueryOptions): Promise<IMemoryItem[]>;
-    /**
-     * Find groups of potentially conflicting facts.
-     * Routes to Neo4j repository for conflict detection.
-     */
-    findConflicts(groupIds: readonly string[], topic?: string): Promise<readonly IConflictGroup[]>;
-}
-//# sourceMappingURL=MemoryService.d.ts.map

package/dist/lib/infrastructure/services/MemoryService.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"MemoryService.d.ts","sourceRoot":"","sources":["../../../../src/lib/infrastructure/services/MemoryService.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,cAAc,EACd,UAAU,EACV,aAAa,EACb,WAAW,EACX,OAAO,EAIP,kBAAkB,EAClB,oBAAoB,EACrB,MAAM,cAAc,CAAC;AACtB,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,8CAA8C,CAAC;AACpF,OAAO,KAAK,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAWvF,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,6BAA6B,CAAC;AAerE;;;;;;;;;;GAUG;AACH,qBAAa,aAAc,YAAW,cAAc,EAAE,oBAAoB;IAKtE,OAAO,CAAC,QAAQ,CAAC,GAAG;IACpB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC;IAL1B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAU;IACjC,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAoB;gBAGlC,GAAG,EAAE,UAAU,EACf,MAAM,CAAC,EAAE,iBAAiB,YAAA,EAC3C,MAAM,CAAC,EAAE,OAAO;IAUlB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAQxB;;;;;;;;;;;;;;OAcG;IACG,UAAU,CACd,QAAQ,EAAE,SAAS,MAAM,EAAE,EAC3B,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,MAAM,EAAE,MAAM,GAAG,IAAI,EACrB,SAAS,GAAE,MAA+B,EAC1C,MAAM,CAAC,EAAE,WAAW,GACnB,OAAO,CAAC,aAAa,CAAC;IA0MzB;;OAEG;IACG,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAM1E;;OAEG;IACG,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,GAAE,SAAS,MAAM,EAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IAmCzF;;;OAGG;IACG,oBAAoB,CACxB,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE,kBAAkB,GAC1B,OAAO,CAAC,IAAI,CAAC;IAahB;;;OAGG;IACG,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAY9D;;;OAGG;IACG,cAAc,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAqCtD;;;;;;;OAOG;IACG,oBAAoB,CACxB,QAAQ,EAAE,SAAS,MAAM,EAAE,EAC3B,KAAK,GAAE,MAAW,EAClB,OAAO,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,IAAI,CAAC;QAAC,KAAK,CAAC,EAAE,IAAI,CAAA;KAAE,GACvC,OAAO,CAAC,WAAW,EAAE,CAAC;IAmFzB;;;;;;OAMG;IACG,WAAW,CACf,QAAQ,EAAE,SAAS,MAAM,EAAE,EAC3B,KAAK,EAAE,MAAM,EACb,KAAK,GAAE,MAAW,GACjB,OAAO,CAAC,WAAW,EAAE,CAAC;IAkCzB;;;OAGG;IACG,mBAAmB,CACvB,QAAQ,EAAE,SAAS,MAAM,EAAE,EAC3B,QAAQ,EAAE,eAAe,EACzB,OAAO,CAAC,EAAE,aAAa,GACtB,OAAO,CAAC,WAAW,EAAE,CAAC;IAkBzB;;;OAGG;IACG,aAAa,CACjB,QAAQ,EAAE,SAAS,MAAM,EAAE,EAC3B,KAAK,CAAC,EAAE,MAAM,GACb,OAAO,CAAC,SAAS,cAAc,EAAE,CAAC;CAetC"}