@aman_asmuei/amem 0.19.0 → 0.20.0

package/dist/memory.js

@@ -1,432 +0,0 @@
-import { cosineSimilarity, rerankWithCrossEncoder } from "./embeddings.js";
-import { expandQuery } from "./query-expand.js";
-import { VectorIndex } from "./ann.js";
-export const MemoryType = {
-    CORRECTION: "correction",
-    DECISION: "decision",
-    PATTERN: "pattern",
-    PREFERENCE: "preference",
-    TOPOLOGY: "topology",
-    FACT: "fact",
-};
-export const IMPORTANCE_WEIGHTS = {
-    correction: 1.0,
-    decision: 0.85,
-    pattern: 0.7,
-    preference: 0.7,
-    topology: 0.5,
-    fact: 0.4,
-};
-export function computeScore(input) {
-    const hoursSinceAccess = (input.now - input.lastAccessed) / (1000 * 60 * 60);
-    const recency = Math.pow(0.995, Math.max(0, hoursSinceAccess));
-    return (input.relevance * 0.45 +
-        recency * 0.2 +
-        input.confidence * 0.2 +
-        input.importance * 0.15);
-}
-export function detectConflict(newContent, existingContent, similarity) {
-    if (newContent === existingContent) {
-        return { isConflict: false, similarity };
-    }
-    return {
-        isConflict: similarity > 0.85,
-        similarity,
-    };
-}
-export function recallMemories(db, options) {
-    const { query, queryEmbedding, limit, type, tag, minConfidence, scope, explain, filterExpired = true, tier } = options;
-    const now = Date.now();
-    let candidates;
-    if (type) {
-        candidates = db.searchByType(type);
-        if (scope) {
-            candidates = candidates.filter(m => m.scope === "global" || m.scope === scope);
-        }
-    }
-    else if (tag) {
-        candidates = db.searchByTag(tag);
-        if (scope) {
-            candidates = candidates.filter(m => m.scope === "global" || m.scope === scope);
-        }
-    }
-    else if (scope) {
-        candidates = db.getAllForProject(scope);
-    }
-    else {
-        candidates = db.getAll();
-    }
-    // Filter out expired memories (temporal validity)
-    if (filterExpired) {
-        candidates = candidates.filter(m => m.validUntil === null || m.validUntil > now);
-    }
-    // Filter by tier
-    if (tier) {
-        candidates = candidates.filter(m => m.tier === tier);
-    }
-    if (minConfidence) {
-        candidates = candidates.filter((m) => m.confidence >= minConfidence);
-    }
-    // When query exists but no embeddings, filter to keyword matches only
-    if (query && !queryEmbedding) {
-        const expanded = expandQuery(query);
-        const keywordMatches = candidates.filter((m) => {
-            const lower = m.content.toLowerCase();
-            const tagStr = m.tags.join(" ").toLowerCase();
-            return expanded.some(term => lower.includes(term) || tagStr.includes(term));
-        });
-        if (keywordMatches.length > 0) {
-            candidates = keywordMatches;
-        }
-        // If no keyword matches, keep all candidates (broad fallback)
-    }
-    const scored = candidates.map((memory) => {
-        let relevance = 0.5;
-        let relevanceSource = "default";
-        if (queryEmbedding && memory.embedding) {
-            relevance = Math.max(0, cosineSimilarity(queryEmbedding, memory.embedding));
-            relevanceSource = "semantic";
-        }
-        else if (query && memory.content.toLowerCase().includes(query.toLowerCase())) {
-            relevance = 0.75;
-            relevanceSource = "keyword";
-        }
-        const importance = IMPORTANCE_WEIGHTS[memory.type] ?? 0.4;
-        const hoursSinceAccess = (now - memory.lastAccessed) / (1000 * 60 * 60);
-        const recency = Math.pow(0.995, Math.max(0, hoursSinceAccess));
-        const score = computeScore({
-            relevance,
-            confidence: memory.confidence,
-            lastAccessed: memory.lastAccessed,
-            importance,
-            now,
-        });
-        if (explain) {
-            return {
-                ...memory,
-                score,
-                explanation: {
-                    relevance,
-                    relevanceSource,
-                    recency: Number(recency.toFixed(4)),
-                    hoursSinceAccess: Number(hoursSinceAccess.toFixed(1)),
-                    confidence: memory.confidence,
-                    importance,
-                    importanceLabel: memory.type,
-                    finalScore: Number(score.toFixed(4)),
-                },
-            };
-        }
-        return { ...memory, score };
-    });
-    scored.sort((a, b) => b.score - a.score);
-    return scored.slice(0, limit);
-}
-export function consolidateMemories(db, cosineSim, options) {
-    const now = Date.now();
-    const msPerDay = 1000 * 60 * 60 * 24;
-    const allMemories = db.getAllWithEmbeddings();
-    const all = db.getAll();
-    const beforeTotal = all.length;
-    const actions = [];
-    const toDelete = new Set();
-    let promoted = 0;
-    // 1. MERGE: find near-duplicate pairs (>0.85 similarity)
-    // Batch by type to reduce O(n²) — only compare within same type, skip corrections.
-    // Sort by recency and cap group size to keep O(n²) bounded.
-    const MAX_MERGE_GROUP = 500;
-    const byType = new Map();
-    for (const mem of allMemories) {
-        if (!mem.embedding)
-            continue;
-        if (mem.type === "correction")
-            continue;
-        const group = byType.get(mem.type) ?? [];
-        group.push(mem);
-        byType.set(mem.type, group);
-    }
-    for (const [, group] of byType) {
-        // Sort most recently accessed first — duplicates are most likely among recent memories
-        group.sort((a, b) => b.lastAccessed - a.lastAccessed);
-        const capped = group.slice(0, MAX_MERGE_GROUP);
-        for (let i = 0; i < capped.length; i++) {
-            if (toDelete.has(capped[i].id))
-                continue;
-            for (let j = i + 1; j < capped.length; j++) {
-                if (toDelete.has(capped[j].id))
-                    continue;
-                const sim = cosineSim(capped[i].embedding, capped[j].embedding);
-                if (sim > 0.85) {
-                    const [keep, discard] = capped[i].confidence >= capped[j].confidence
-                        ? [capped[i], capped[j]]
-                        : [capped[j], capped[i]];
-                    toDelete.add(discard.id);
-                    actions.push({
-                        action: "merged",
-                        memoryIds: [keep.id, discard.id],
-                        description: `Merged "${discard.content}" into "${keep.content}" (${(sim * 100).toFixed(0)}% similar)`,
-                    });
-                }
-            }
-        }
-    }
-    // 2. PRUNE: stale, low-confidence, rarely-accessed (NEVER corrections)
-    for (const mem of all) {
-        if (toDelete.has(mem.id))
-            continue;
-        if (mem.type === "correction")
-            continue;
-        const daysSinceAccess = (now - mem.lastAccessed) / msPerDay;
-        if (daysSinceAccess > options.maxStaleDays &&
-            mem.confidence < options.minConfidence &&
-            mem.accessCount < options.minAccessCount) {
-            toDelete.add(mem.id);
-            actions.push({
-                action: "pruned",
-                memoryIds: [mem.id],
-                description: `Pruned "${mem.content}" (${daysSinceAccess.toFixed(0)}d stale, ${(mem.confidence * 100).toFixed(0)}% confidence, ${mem.accessCount} accesses)`,
-            });
-        }
-    }
-    // 3. PROMOTE: frequently-accessed memories with low confidence
-    const toPromote = [];
-    for (const mem of all) {
-        if (toDelete.has(mem.id))
-            continue;
-        if (mem.accessCount >= 5 && mem.confidence < 0.8) {
-            toPromote.push({ id: mem.id });
-            promoted++;
-            actions.push({
-                action: "promoted",
-                memoryIds: [mem.id],
-                description: `Promoted "${mem.content}" to 90% confidence (accessed ${mem.accessCount} times)`,
-            });
-        }
-    }
-    // 4. DECAY: gradually reduce confidence of stale, non-correction memories
-    let decayed = 0;
-    const toDecay = [];
-    if (options.enableDecay) {
-        const factor = options.decayFactor ?? 0.95;
-        for (const mem of all) {
-            if (toDelete.has(mem.id))
-                continue;
-            if (mem.type === "correction")
-                continue;
-            const daysSinceAccess = (now - mem.lastAccessed) / msPerDay;
-            if (daysSinceAccess > 30 && mem.confidence > 0.3) {
-                const newConf = Number((mem.confidence * factor).toFixed(3));
-                if (newConf < mem.confidence) {
-                    toDecay.push({ id: mem.id, newConfidence: Math.max(0.1, newConf) });
-                    decayed++;
-                    actions.push({
-                        action: "decayed",
-                        memoryIds: [mem.id],
-                        description: `Decayed "${mem.content}" from ${(mem.confidence * 100).toFixed(0)}% to ${(newConf * 100).toFixed(0)}% confidence (${daysSinceAccess.toFixed(0)}d idle)`,
-                    });
-                }
-            }
-        }
-    }
-    // Apply all mutations inside a single transaction for atomicity
-    if (!options.dryRun) {
-        db.transaction(() => {
-            for (const action of actions) {
-                if (action.action === "merged") {
-                    const keepId = action.memoryIds[0];
-                    const discardId = action.memoryIds[1];
-                    const keep = allMemories.find(m => m.id === keepId) ?? all.find(m => m.id === keepId);
-                    if (keep) {
-                        db.updateConfidence(keepId, Math.min(1.0, keep.confidence + 0.1));
-                    }
-                    db.deleteMemory(discardId);
-                }
-                else if (action.action === "pruned") {
-                    db.deleteMemory(action.memoryIds[0]);
-                }
-            }
-            for (const { id } of toPromote) {
-                db.updateConfidence(id, 0.9);
-            }
-            for (const d of toDecay) {
-                db.updateConfidence(d.id, d.newConfidence);
-            }
-        });
-    }
-    const afterTotal = beforeTotal - toDelete.size;
-    const signalCount = all.filter(m => !toDelete.has(m.id) && (m.confidence >= 0.8 || m.type === "correction")).length;
-    const healthScore = afterTotal === 0 ? 100 : Math.round((signalCount / afterTotal) * 100);
-    return {
-        merged: actions.filter(a => a.action === "merged").length,
-        pruned: actions.filter(a => a.action === "pruned").length,
-        promoted,
-        decayed,
-        actions,
-        healthScore,
-        before: { total: beforeTotal },
-        after: { total: afterTotal },
-    };
-}
-// ── Vector Index ─────────────────────────────────────
-let vectorIndex = null;
-export function buildVectorIndex(db) {
-    const index = new VectorIndex(384);
-    const memories = db.getAllWithEmbeddings();
-    index.buildFrom(memories
-        .filter(m => m.embedding !== null)
-        .map(m => ({ id: m.id, embedding: m.embedding })));
-    vectorIndex = index;
-    return index;
-}
-export function getVectorIndex() {
-    return vectorIndex;
-}
-/**
- * Multi-strategy retrieval: combines semantic search, FTS5, knowledge graph traversal,
- * and temporal recency into a unified ranking. Each strategy votes independently,
- * then scores are merged with configurable weights.
- */
-export async function multiStrategyRecall(db, options) {
-    const { query, queryEmbedding, limit, scope } = options;
-    const weights = options.weights ?? { semantic: 0.4, fts: 0.3, graph: 0.15, temporal: 0.15 };
-    const now = Date.now();
-    const scoreMap = new Map();
-    const initEntry = (m) => {
-        if (!scoreMap.has(m.id)) {
-            scoreMap.set(m.id, { memory: m, scores: { semantic: 0, fts: 0, graph: 0, temporal: 0 } });
-        }
-        return scoreMap.get(m.id);
-    };
-    // Strategy 1: Semantic search via vector index (or full scan fallback)
-    if (queryEmbedding) {
-        const index = getVectorIndex();
-        if (index && index.size() > 0) {
-            // Fast path: in-memory vector index lookup
-            const vectorResults = index.search(queryEmbedding, limit * 3, 0.2);
-            for (const r of vectorResults) {
-                const mem = db.getById(r.id);
-                if (!mem)
-                    continue;
-                if (mem.validUntil !== null && mem.validUntil <= now)
-                    continue;
-                if (scope && mem.scope !== "global" && mem.scope !== scope)
-                    continue;
-                const entry = initEntry(mem);
-                entry.scores.semantic = r.similarity;
-            }
-        }
-        else {
-            // Fallback: full scan when index isn't built yet
-            const candidates = scope ? db.getAllForProject(scope) : db.getAll();
-            const validCandidates = candidates.filter(m => m.validUntil === null || m.validUntil > now);
-            for (const m of validCandidates) {
-                if (!m.embedding)
-                    continue;
-                const sim = Math.max(0, cosineSimilarity(queryEmbedding, m.embedding));
-                if (sim > 0.2) {
-                    const entry = initEntry(m);
-                    entry.scores.semantic = sim;
-                }
-            }
-        }
-    }
-    // Strategy 2: Full-text search (FTS5 exact matching)
-    try {
-        const ftsResults = db.fullTextSearch(query, limit * 2, scope);
-        const validFts = ftsResults.filter(m => m.validUntil === null || m.validUntil > now);
-        for (let i = 0; i < validFts.length; i++) {
-            const m = validFts[i];
-            const entry = initEntry(m);
-            // FTS rank: highest rank for first result, decaying
-            entry.scores.fts = Math.max(entry.scores.fts, 1.0 - (i / validFts.length) * 0.5);
-        }
-    }
-    catch {
-        // FTS may fail — skip this strategy
-    }
-    // Strategy 3: Knowledge graph traversal
-    // Find memories that are related to high-scoring candidates
-    const topSemanticIds = [...scoreMap.entries()]
-        .sort((a, b) => b[1].scores.semantic - a[1].scores.semantic)
-        .slice(0, 10)
-        .map(([id]) => id);
-    for (const id of topSemanticIds) {
-        const related = db.getRelatedMemories(id);
-        for (const m of related) {
-            if (m.validUntil !== null && m.validUntil <= now)
-                continue;
-            const entry = initEntry(m);
-            const parentScore = scoreMap.get(id)?.scores.semantic ?? 0;
-            // Graph neighbors get a fraction of the parent's score
-            entry.scores.graph = Math.max(entry.scores.graph, parentScore * 0.6);
-        }
-    }
-    // Strategy 4: Temporal boost (recently accessed/created memories score higher)
-    for (const [, entry] of scoreMap) {
-        const hoursSinceAccess = (now - entry.memory.lastAccessed) / (1000 * 60 * 60);
-        entry.scores.temporal = Math.pow(0.995, Math.max(0, hoursSinceAccess));
-    }
-    // Merge scores with weights
-    const results = [];
-    for (const [, entry] of scoreMap) {
-        const { semantic, fts, graph, temporal } = entry.scores;
-        const importance = IMPORTANCE_WEIGHTS[entry.memory.type] ?? 0.4;
-        const combined = (semantic * weights.semantic +
-            fts * weights.fts +
-            graph * weights.graph +
-            temporal * weights.temporal) * entry.memory.confidence * importance;
-        results.push({ ...entry.memory, score: combined });
-    }
-    results.sort((a, b) => b.score - a.score);
-    // Optional cross-encoder reranking — the final pass for highest accuracy
-    const shouldRerank = options.rerank ?? false;
-    if (shouldRerank && results.length > 1) {
-        const rerankerTopK = options.rerankerTopK ?? 20;
-        const candidatesForRerank = results.slice(0, rerankerTopK);
-        const reranked = await rerankWithCrossEncoder(query, candidatesForRerank.map(r => ({ id: r.id, content: r.content, score: r.score })), limit);
-        // Map reranked scores back to full RecalledMemory objects
-        const rerankedMap = new Map(reranked.map(r => [r.id, r.score]));
-        const finalResults = [];
-        for (const r of candidatesForRerank) {
-            const newScore = rerankedMap.get(r.id);
-            if (newScore !== undefined) {
-                finalResults.push({ ...r, score: newScore });
-            }
-        }
-        finalResults.sort((a, b) => b.score - a.score);
-        return finalResults.slice(0, limit);
-    }
-    return results.slice(0, limit);
-}
-// ── Auto-expire contradictions ─────────────────────────
-/**
- * When storing a new memory that contradicts an existing one,
- * auto-expire the old memory instead of requiring manual consolidation.
- */
-export function autoExpireContradictions(db, newContent, newEmbedding, newType) {
-    if (!newEmbedding)
-        return { expired: [], reason: "no embedding" };
-    const existing = db.getRecentWithEmbeddings(50000);
-    const expired = [];
-    for (const mem of existing) {
-        if (!mem.embedding)
-            continue;
-        if (mem.type !== newType)
-            continue; // Only expire same-type memories
-        if (mem.validUntil !== null)
-            continue; // Already expired
-        const sim = cosineSimilarity(newEmbedding, mem.embedding);
-        if (sim > 0.75 && sim < 0.95) {
-            // High similarity but not exact match = likely contradicting/superseding
-            const conflict = detectConflict(newContent, mem.content, sim);
-            if (conflict.isConflict) {
-                db.expireMemory(mem.id);
-                expired.push(mem.id);
-            }
-        }
-    }
-    return { expired, reason: expired.length > 0 ? `auto-expired ${expired.length} contradicting memories` : "no contradictions" };
-}
-// ── Privacy helper (re-exported for tools) ─────────────
-export { sanitizeContent } from "./config.js";
-//# sourceMappingURL=memory.js.map

package/dist/memory.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory.js","sourceRoot":"","sources":["../src/memory.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,gBAAgB,EAAE,sBAAsB,EAAE,MAAM,iBAAiB,CAAC;AAC3E,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AAEvC,MAAM,CAAC,MAAM,UAAU,GAAG;IACxB,UAAU,EAAE,YAAY;IACxB,QAAQ,EAAE,UAAU;IACpB,OAAO,EAAE,SAAS;IAClB,UAAU,EAAE,YAAY;IACxB,QAAQ,EAAE,UAAU;IACpB,IAAI,EAAE,MAAM;CACJ,CAAC;AAIX,MAAM,CAAC,MAAM,kBAAkB,GAAoC;IACjE,UAAU,EAAE,GAAG;IACf,QAAQ,EAAE,IAAI;IACd,OAAO,EAAE,GAAG;IACZ,UAAU,EAAE,GAAG;IACf,QAAQ,EAAE,GAAG;IACb,IAAI,EAAE,GAAG;CACV,CAAC;AA4BF,MAAM,UAAU,YAAY,CAAC,KAAiB;IAC5C,MAAM,gBAAgB,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAC7E,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC;IAC/D,OAAO,CACL,KAAK,CAAC,SAAS,GAAG,IAAI;QACtB,OAAO,GAAG,GAAG;QACb,KAAK,CAAC,UAAU,GAAG,GAAG;QACtB,KAAK,CAAC,UAAU,GAAG,IAAI,CACxB,CAAC;AACJ,CAAC;AAOD,MAAM,UAAU,cAAc,CAC5B,UAAkB,EAClB,eAAuB,EACvB,UAAkB;IAElB,IAAI,UAAU,KAAK,eAAe,EAAE,CAAC;QACnC,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;IAC3C,CAAC;IACD,OAAO;QACL,UAAU,EAAE,UAAU,GAAG,IAAI;QAC7B,UAAU;KACX,CAAC;AACJ,CAAC;AAoCD,MAAM,UAAU,cAAc,CAC5B,EAAgB,EAChB,OAAsB;IAEtB,MAAM,EAAE,KAAK,EAAE,cAAc,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE,KAAK,EAAE,OAAO,EAAE,aAAa,GAAG,IAAI,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC;IACvH,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAEvB,IAAI,UAAoB,CAAC;IACzB,IAAI,IAAI,EAAE,CAAC;QACT,UAAU,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,KAAK,EAAE,CAAC;YACV,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC;QACjF,CAAC;IACH,CAAC;SAAM,IAAI,GAAG,EAAE,CAAC;QACf,UAAU,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,KAAK,EAAE,CAAC;YACV,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC;QACjF,CAAC;IACH,CAAC;SAAM,IAAI,KAAK,EAAE,CAAC;QACjB,UAAU,GAAG,EAAE,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;SAAM,CAAC;QACN,UAAU,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,CAAC;IAED,kDAAkD;IAClD,IAAI,aAAa,EAAE,CAAC;QAClB,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,IAAI,IAAI,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC;IACnF,CAAC;IAED,iBAAiB;IACjB,IAAI,IAAI,EAAE,CAAC;QACT,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IACvD,CAAC;IAED,IAAI,aAAa,EAAE,CAAC;QAClB,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,aAAa,CAAC,CAAC;IACvE,CAAC;IAED,sEAAsE;IACtE,IAAI,KAAK,IAAI,CAAC,cAAc,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;QACpC,MAAM,cAAc,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YAC7C,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;YACtC,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;YAC9C,OAAO,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QAC9E,CAAC,CAAC,CAAC;QACH,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9B,UAAU,GAAG,cAAc,CAAC;QAC9B,CAAC;QACD,8DAA8D;IAChE,CAAC;IAED,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;QACvC,IAAI,SAAS,GAAG,GAAG,CAAC;QACpB,IAAI,eAAe,GAAwC,SAAS,CAAC;QACrE,IAAI,cAAc,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;YACvC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,gBAAgB,CAAC,cAAc,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;YAC5E,eAAe,GAAG,UAAU,CAAC;QAC/B,CAAC;aAAM,IAAI,KAAK,IAAI,MAAM,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC;YAC/E,SAAS,GAAG,IAAI,CAAC;YACjB,eAAe,GAAG,SAAS,CAAC;QAC9B,CAAC;QAED,MAAM,UAAU,GAAG,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC;QAC1D,MAAM,gBAAgB,GAAG,CAAC,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QACxE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC;QAC/D,MAAM,KAAK,GAAG,YAAY,CAAC;YACzB,SAAS;YACT,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,YAAY,EAAE,MAAM,CAAC,YAAY;YACjC,UAAU;YACV,GAAG;SACJ,CAAC,CAAC;QAEH,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO;gBACL,GAAG,MAAM;gBACT,KAAK;gBACL,WAAW,EAAE;oBACX,SAAS;oBACT,eAAe;oBACf,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBACnC,gBAAgB,EAAE,MAAM,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBACrD,UAAU,EAAE,MAAM,CAAC,UAAU;oBAC7B,UAAU;oBACV,eAAe,EAAE,MAAM,CAAC,IAAI;oBAC5B,UAAU,EAAE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;iBACrC;aACiB,CAAC;QACvB,CAAC;QAED,OAAO,EAAE,GAAG,MAAM,EAAE,KAAK,EAAoB,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACzC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AAChC,CAAC;AA4BD,MAAM,UAAU,mBAAmB,CACjC,EAAgB,EAChB,SAAuD,EACvD,OAA6B;IAE7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACvB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACrC,MAAM,WAAW,GAAG,EAAE,CAAC,oBAAoB,EAAE,CAAC;IAC9C,MAAM,GAAG,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC;IACxB,MAAM,WAAW,GAAG,GAAG,CAAC,MAAM,CAAC;IAE/B,MAAM,OAAO,GAA0B,EAAE,CAAC;IAC1C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,yDAAyD;IACzD,mFAAmF;IACnF,4DAA4D;IAC5D,MAAM,eAAe,GAAG,GAAG,CAAC;IAC5B,MAAM,MAAM,GAAG,IAAI,GAAG,EAA8B,CAAC;IACrD,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QAC9B,IAAI,CAAC,GAAG,CAAC,SAAS;YAAE,SAAS;QAC7B,IAAI,GAAG,CAAC,IAAI,KAAK,YAAY;YAAE,SAAS;QACxC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACzC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QAC/B,uFAAuF;QACvF,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC;QACtD,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC;QAE/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,SAAS;YAEzC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAEzC,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAU,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAU,CAAC,CAAC;gBAClE,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC;oBACf,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU;wBAClE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;wBACxB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBAE3B,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;oBACzB,OAAO,CAAC,IAAI,CAAC;wBACX,MAAM,EAAE,QAAQ;wBAChB,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,CAAC;wBAChC,WAAW,EAAE,WAAW,OAAO,CAAC,OAAO,WAAW,IAAI,CAAC,OAAO,MAAM,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY;qBACvG,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,uEAAuE;IACvE,KAAK,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACtB,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QACnC,IAAI,GAAG,CAAC,IAAI,KAAK,YAAY;YAAE,SAAS;QAExC,MAAM,eAAe,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,YAAY,CAAC,GAAG,QAAQ,CAAC;QAC5D,IACE,eAAe,GAAG,OAAO,CAAC,YAAY;YACtC,GAAG,CAAC,UAAU,GAAG,OAAO,CAAC,aAAa;YACtC,GAAG,CAAC,WAAW,GAAG,OAAO,CAAC,cAAc,EACxC,CAAC;YACD,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACrB,OAAO,CAAC,IAAI,CAAC;gBACX,MAAM,EAAE,QAAQ;gBAChB,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,WAAW,EAAE,WAAW,GAAG,CAAC,OAAO,MAAM,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB,GAAG,CAAC,WAAW,YAAY;aAC7J,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,+DAA+D;IAC/D,MAAM,SAAS,GAAqB,EAAE,CAAC;IACvC,KAAK,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACtB,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QACnC,IAAI,GAAG,CAAC,WAAW,IAAI,CAAC,IAAI,GAAG,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC;YACjD,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;YAC/B,QAAQ,EAAE,CAAC;YACX,OAAO,CAAC,IAAI,CAAC;gBACX,MAAM,EAAE,UAAU;gBAClB,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,WAAW,EAAE,aAAa,GAAG,CAAC,OAAO,iCAAiC,GAAG,CAAC,WAAW,SAAS;aAC/F,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,0EAA0E;IAC1E,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,MAAM,OAAO,GAA4C,EAAE,CAAC;IAC5D,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;QACxB,MAAM,MAAM,GAAG,OAAO,CAAC,WAAW,IAAI,IAAI,CAAC;QAC3C,KAAK,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;YACtB,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YACnC,IAAI,GAAG,CAAC,IAAI,KAAK,YAAY;gBAAE,SAAS;YACxC,MAAM,eAAe,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,YAAY,CAAC,GAAG,QAAQ,CAAC;YAC5D,IAAI,eAAe,GAAG,EAAE,IAAI,GAAG,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC;gBACjD,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,UAAU,GAAG,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC7D,IAAI,OAAO,GAAG,GAAG,CAAC,UAAU,EAAE,CAAC;oBAC7B,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,aAAa,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;oBACpE,OAAO,EAAE,CAAC;oBACV,OAAO,CAAC,IAAI,CAAC;wBACX,MAAM,EAAE,SAAS;wBACjB,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;wBACnB,WAAW,EAAE,YAAY,GAAG,CAAC,OAAO,UAAU,CAAC,GAAG,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;qBACtK,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,gEAAgE;IAChE,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;QACpB,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;YAClB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,MAAM,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;oBAC/B,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;oBACnC,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;oBACtC,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;oBACtF,IAAI,IAAI,EAAE,CAAC;wBACT,EAAE,CAAC,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,CAAC;oBACpE,CAAC;oBACD,EAAE,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;gBAC7B,CAAC;qBAAM,IAAI,MAAM,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;oBACtC,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;YACD,KAAK,MAAM,EAAE,EAAE,EAAE,IAAI,SAAS,EAAE,CAAC;gBAC/B,EAAE,CAAC,gBAAgB,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YAC/B,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;gBACxB,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED,MAAM,UAAU,GAAG,WAAW,GAAG,QAAQ,CAAC,IAAI,CAAC;IAC/C,MAAM,WAAW,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,IAAI,GAAG,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC;IACpH,MAAM,WAAW,GAAG,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,WAAW,GAAG,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC;IAE1F,OAAO;QACL,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,MAAM;QACzD,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,MAAM;QACzD,QAAQ;QACR,OAAO;QACP,OAAO;QACP,WAAW;QACX,MAAM,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE;QAC9B,KAAK,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE;KAC7B,CAAC;AACJ,CAAC;AAED,wDAAwD;AAExD,IAAI,WAAW,GAAuB,IAAI,CAAC;AAE3C,MAAM,UAAU,gBAAgB,CAAC,EAAgB;IAC/C,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC;IACnC,MAAM,QAAQ,GAAG,EAAE,CAAC,oBAAoB,EAAE,CAAC;IAC3C,KAAK,CAAC,SAAS,CACb,QAAQ;SACL,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,IAAI,CAAC;SACjC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,SAAU,EAAE,CAAC,CAAC,CACrD,CAAC;IACF,WAAW,GAAG,KAAK,CAAC;IACpB,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,cAAc;IAC5B,OAAO,WAAW,CAAC;AACrB,CAAC;AAqBD;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,EAAgB,EAChB,OAA6B;IAE7B,MAAM,EAAE,KAAK,EAAE,cAAc,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC;IACxD,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;IAC5F,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAEvB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA0G,CAAC;IAEnI,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,EAAE;QAC9B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YACxB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5F,CAAC;QACD,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;IAC7B,CAAC,CAAC;IAEF,uEAAuE;IACvE,IAAI,cAAc,EAAE,CAAC;QACnB,MAAM,KAAK,GAAG,cAAc,EAAE,CAAC;QAC/B,IAAI,KAAK,IAAI,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YAC9B,2CAA2C;YAC3C,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,cAAc,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;YACnE,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;gBAC9B,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC7B,IAAI,CAAC,GAAG;oBAAE,SAAS;gBACnB,IAAI,GAAG,CAAC,UAAU,KAAK,IAAI,IAAI,GAAG,CAAC,UAAU,IAAI,GAAG;oBAAE,SAAS;gBAC/D,IAAI,KAAK,IAAI,GAAG,CAAC,KAAK,KAAK,QAAQ,IAAI,GAAG,CAAC,KAAK,KAAK,KAAK;oBAAE,SAAS;gBACrE,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;gBAC7B,KAAK,CAAC,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,UAAU,CAAC;YACvC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,iDAAiD;YACjD,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC;YACpE,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,IAAI,IAAI,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC;YAC5F,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE,CAAC;gBAChC,IAAI,CAAC,CAAC,CAAC,SAAS;oBAAE,SAAS;gBAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,gBAAgB,CAAC,cAAc,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;gBACvE,IAAI,GAAG,GAAG,GAAG,EAAE,CAAC;oBACd,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;oBAC3B,KAAK,CAAC,MAAM,CAAC,QAAQ,GAAG,GAAG,CAAC;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,qDAAqD;IACrD,IAAI,CAAC;QACH,MAAM,UAAU,GAAG,EAAE,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;QAC9D,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,IAAI,IAAI,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC;QACrF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YAC3B,oDAAoD;YACpD,KAAK,CAAC,MAAM,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC;QACnF,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,oCAAoC;IACtC,CAAC;IAED,wCAAwC;IACxC,4DAA4D;IAC5D,MAAM,cAAc,GAAG,CAAC,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC;SAC3C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;SAC3D,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;SACZ,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IAErB,KAAK,MAAM,EAAE,IAAI,cAAc,EAAE,CAAC;QAChC,MAAM,OAAO,GAAG,EAAE,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;QAC1C,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAI,CAAC,CAAC,UAAU,KAAK,IAAI,IAAI,CAAC,CAAC,UAAU,IAAI,GAAG;gBAAE,SAAS;YAC3D,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,QAAQ,IAAI,CAAC,CAAC;YAC3D,uDAAuD;YACvD,KAAK,CAAC,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,WAAW,GAAG,GAAG,CAAC,CAAC;QACvE,CAAC;IACH,CAAC;IAED,+EAA+E;IAC/E,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;QACjC,MAAM,gBAAgB,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAC9E,KAAK,CAAC,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC;IACzE,CAAC;IAED,4BAA4B;IAC5B,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;QACjC,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;QACxD,MAAM,UAAU,GAAG,kBAAkB,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC;QAChE,MAAM,QAAQ,GAAG,CACf,QAAQ,GAAG,OAAO,CAAC,QAAQ;YAC3B,GAAG,GAAG,OAAO,CAAC,GAAG;YACjB,KAAK,GAAG,OAAO,CAAC,KAAK;YACrB,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAC5B,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,GAAG,UAAU,CAAC;QAEzC,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;IACrD,CAAC;IAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAE1C,yEAAyE;IACzE,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,IAAI,KAAK,CAAC;IAC7C,IAAI,YAAY,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvC,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,EAAE,CAAC;QAChD,MAAM,mBAAmB,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;QAC3D,MAAM,QAAQ,GAAG,MAAM,sBAAsB,CAC3C,KAAK,EACL,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,EAChF,KAAK,CACN,CAAC;QAEF,0DAA0D;QAC1D,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAChE,MAAM,YAAY,GAAqB,EAAE,CAAC;QAC1C,KAAK,MAAM,CAAC,IAAI,mBAAmB,EAAE,CAAC;YACpC,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACvC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,YAAY,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QACD,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC/C,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IAED,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACjC,CAAC;AAED,0DAA0D;AAE1D;;;GAGG;AACH,MAAM,UAAU,wBAAwB,CACtC,EAAgB,EAChB,UAAkB,EAClB,YAAiC,EACjC,OAAwB;IAExB,IAAI,CAAC,YAAY;QAAE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC;IAElE,MAAM,QAAQ,GAAG,EAAE,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC;IACnD,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,SAAS;YAAE,SAAS;QAC7B,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO;YAAE,SAAS,CAAC,iCAAiC;QACrE,IAAI,GAAG,CAAC,UAAU,KAAK,IAAI;YAAE,SAAS,CAAC,kBAAkB;QAEzD,MAAM,GAAG,GAAG,gBAAgB,CAAC,YAAY,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;QAC1D,IAAI,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC;YAC7B,yEAAyE;YACzE,MAAM,QAAQ,GAAG,cAAc,CAAC,UAAU,EAAE,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;YAC9D,IAAI,QAAQ,CAAC,UAAU,EAAE,CAAC;gBACxB,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACxB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,OAAO,CAAC,MAAM,yBAAyB,CAAC,CAAC,CAAC,mBAAmB,EAAE,CAAC;AACjI,CAAC;AAED,0DAA0D;AAE1D,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC"}

package/dist/memory.test.d.ts

@@ -1 +0,0 @@
-export {};

package/dist/memory.test.js

@@ -1,172 +0,0 @@
-import { describe, it, expect, beforeEach, afterEach } from "vitest";
-import { MemoryType, IMPORTANCE_WEIGHTS, computeScore, detectConflict, recallMemories, } from "./memory.js";
-import { createDatabase } from "./database.js";
-describe("MemoryType constants", () => {
-    it("has the expected types", () => {
-        expect(MemoryType.CORRECTION).toBe("correction");
-        expect(MemoryType.DECISION).toBe("decision");
-        expect(MemoryType.PATTERN).toBe("pattern");
-        expect(MemoryType.PREFERENCE).toBe("preference");
-        expect(MemoryType.TOPOLOGY).toBe("topology");
-        expect(MemoryType.FACT).toBe("fact");
-    });
-});
-describe("IMPORTANCE_WEIGHTS", () => {
-    it("correction has highest weight (1.0)", () => {
-        expect(IMPORTANCE_WEIGHTS.correction).toBe(1.0);
-    });
-    it("decision has weight 0.85", () => {
-        expect(IMPORTANCE_WEIGHTS.decision).toBe(0.85);
-    });
-    it("pattern and preference have weight 0.7", () => {
-        expect(IMPORTANCE_WEIGHTS.pattern).toBe(0.7);
-        expect(IMPORTANCE_WEIGHTS.preference).toBe(0.7);
-    });
-    it("topology has weight 0.5", () => {
-        expect(IMPORTANCE_WEIGHTS.topology).toBe(0.5);
-    });
-    it("fact has lowest weight (0.4)", () => {
-        expect(IMPORTANCE_WEIGHTS.fact).toBe(0.4);
-    });
-    it("weights are ordered: correction > decision > pattern = preference > topology > fact", () => {
-        expect(IMPORTANCE_WEIGHTS.correction).toBeGreaterThan(IMPORTANCE_WEIGHTS.decision);
-        expect(IMPORTANCE_WEIGHTS.decision).toBeGreaterThan(IMPORTANCE_WEIGHTS.pattern);
-        expect(IMPORTANCE_WEIGHTS.pattern).toBe(IMPORTANCE_WEIGHTS.preference);
-        expect(IMPORTANCE_WEIGHTS.preference).toBeGreaterThan(IMPORTANCE_WEIGHTS.topology);
-        expect(IMPORTANCE_WEIGHTS.topology).toBeGreaterThan(IMPORTANCE_WEIGHTS.fact);
-    });
-});
-describe("computeScore", () => {
-    it("returns higher score for recently accessed memories", () => {
-        const now = Date.now();
-        const recentScore = computeScore({
-            relevance: 0.8,
-            confidence: 0.9,
-            lastAccessed: now - 1000 * 60 * 60, // 1 hour ago
-            importance: 1.0,
-            now,
-        });
-        const oldScore = computeScore({
-            relevance: 0.8,
-            confidence: 0.9,
-            lastAccessed: now - 1000 * 60 * 60 * 24 * 30, // 30 days ago
-            importance: 1.0,
-            now,
-        });
-        expect(recentScore).toBeGreaterThan(oldScore);
-    });
-    it("returns higher score for higher confidence", () => {
-        const now = Date.now();
-        const highConf = computeScore({ relevance: 0.8, confidence: 1.0, lastAccessed: now, importance: 1.0, now });
-        const lowConf = computeScore({ relevance: 0.8, confidence: 0.3, lastAccessed: now, importance: 1.0, now });
-        expect(highConf).toBeGreaterThan(lowConf);
-    });
-    it("returns higher score for higher importance", () => {
-        const now = Date.now();
-        const highImp = computeScore({ relevance: 0.8, confidence: 0.9, lastAccessed: now, importance: 1.0, now });
-        const lowImp = computeScore({ relevance: 0.8, confidence: 0.9, lastAccessed: now, importance: 0.4, now });
-        expect(highImp).toBeGreaterThan(lowImp);
-    });
-    it("returns higher score for higher relevance", () => {
-        const now = Date.now();
-        const highRel = computeScore({ relevance: 1.0, confidence: 0.9, lastAccessed: now, importance: 1.0, now });
-        const lowRel = computeScore({ relevance: 0.2, confidence: 0.9, lastAccessed: now, importance: 1.0, now });
-        expect(highRel).toBeGreaterThan(lowRel);
-    });
-    it("returns low score when relevance is 0", () => {
-        const now = Date.now();
-        const score = computeScore({ relevance: 0, confidence: 1.0, lastAccessed: now, importance: 1.0, now });
-        // With additive scoring, zero relevance still gets recency+confidence+importance contributions
-        expect(score).toBeCloseTo(0.55, 1);
-    });
-});
-describe("detectConflict", () => {
-    it("detects conflict when similarity > 0.85 and content differs", () => {
-        const result = detectConflict("Use pnpm", "Use npm", 0.9);
-        expect(result.isConflict).toBe(true);
-        expect(result.similarity).toBe(0.9);
-    });
-    it("no conflict when similarity <= 0.85", () => {
-        const result = detectConflict("Use pnpm", "Use npm", 0.7);
-        expect(result.isConflict).toBe(false);
-    });
-    it("no conflict when content is identical (even with high similarity)", () => {
-        const result = detectConflict("same text", "same text", 1.0);
-        expect(result.isConflict).toBe(false);
-    });
-    it("conflict at boundary (0.86)", () => {
-        const result = detectConflict("a", "b", 0.86);
-        expect(result.isConflict).toBe(true);
-    });
-    it("no conflict at boundary (0.85)", () => {
-        const result = detectConflict("a", "b", 0.85);
-        expect(result.isConflict).toBe(false);
-    });
-});
-describe("recallMemories", () => {
-    let db;
-    beforeEach(() => {
-        db = createDatabase(":memory:");
-    });
-    afterEach(() => {
-        db.close();
-    });
-    it("returns all memories ranked by score when no filter", () => {
-        db.insertMemory({ content: "fact one", type: "fact", tags: [], confidence: 0.5, source: "t", embedding: null, scope: "global" });
-        db.insertMemory({ content: "correction one", type: "correction", tags: [], confidence: 1.0, source: "t", embedding: null, scope: "global" });
-        const results = recallMemories(db, { query: null, limit: 10 });
-        expect(results).toHaveLength(2);
-        // Correction should score higher due to higher importance + confidence
-        expect(results[0].type).toBe("correction");
-    });
-    it("filters by type", () => {
-        db.insertMemory({ content: "a", type: "fact", tags: [], confidence: 0.5, source: "t", embedding: null, scope: "global" });
-        db.insertMemory({ content: "b", type: "decision", tags: [], confidence: 0.9, source: "t", embedding: null, scope: "global" });
-        const results = recallMemories(db, { query: null, limit: 10, type: "decision" });
-        expect(results).toHaveLength(1);
-        expect(results[0].type).toBe("decision");
-    });
-    it("filters by tag", () => {
-        db.insertMemory({ content: "ts thing", type: "fact", tags: ["typescript"], confidence: 0.5, source: "t", embedding: null, scope: "global" });
-        db.insertMemory({ content: "rust thing", type: "fact", tags: ["rust"], confidence: 0.5, source: "t", embedding: null, scope: "global" });
-        const results = recallMemories(db, { query: null, limit: 10, tag: "typescript" });
-        expect(results).toHaveLength(1);
-        expect(results[0].content).toBe("ts thing");
-    });
-    it("filters by minConfidence", () => {
-        db.insertMemory({ content: "low", type: "fact", tags: [], confidence: 0.2, source: "t", embedding: null, scope: "global" });
-        db.insertMemory({ content: "high", type: "fact", tags: [], confidence: 0.9, source: "t", embedding: null, scope: "global" });
-        const results = recallMemories(db, { query: null, limit: 10, minConfidence: 0.5 });
-        expect(results).toHaveLength(1);
-        expect(results[0].content).toBe("high");
-    });
-    it("respects limit", () => {
-        for (let i = 0; i < 5; i++) {
-            db.insertMemory({ content: `mem ${i}`, type: "fact", tags: [], confidence: 0.5, source: "t", embedding: null, scope: "global" });
-        }
-        const results = recallMemories(db, { query: null, limit: 3 });
-        expect(results).toHaveLength(3);
-    });
-    it("keyword matching narrows results to matches and boosts relevance", () => {
-        db.insertMemory({ content: "TypeScript compiler config", type: "fact", tags: [], confidence: 0.8, source: "t", embedding: null, scope: "global" });
-        db.insertMemory({ content: "Rust build system", type: "fact", tags: [], confidence: 0.8, source: "t", embedding: null, scope: "global" });
-        const results = recallMemories(db, { query: "TypeScript", limit: 10 });
-        // Only the TypeScript memory should match when using keyword-only (no embeddings)
-        expect(results).toHaveLength(1);
-        expect(results[0].content).toContain("TypeScript");
-        // Keyword match gives relevance of 0.75 (higher than default 0.5)
-        expect(results[0].score).toBeGreaterThan(0);
-    });
-    it("filters by scope", () => {
-        db.insertMemory({ content: "global mem", type: "fact", tags: [], confidence: 0.5, source: "t", embedding: null, scope: "global" });
-        db.insertMemory({ content: "project mem", type: "fact", tags: [], confidence: 0.5, source: "t", embedding: null, scope: "project:foo" });
-        db.insertMemory({ content: "other project", type: "fact", tags: [], confidence: 0.5, source: "t", embedding: null, scope: "project:bar" });
-        const results = recallMemories(db, { query: null, limit: 10, scope: "project:foo" });
-        // Should include global + project:foo, but not project:bar
-        const scopes = results.map(r => r.scope);
-        expect(scopes).toContain("global");
-        expect(scopes).toContain("project:foo");
-        expect(scopes).not.toContain("project:bar");
-    });
-});
-//# sourceMappingURL=memory.test.js.map