shieldcortex 2.0.0

package/dist/memory/consolidate.js

@@ -0,0 +1,511 @@
+/**
+ * Memory Consolidation System
+ *
+ * Like sleep consolidation in human brains, this system:
+ * - Moves worthy short-term memories to long-term storage
+ * - Strengthens frequently accessed memories
+ * - Cleans up decayed/irrelevant memories
+ * - Merges similar memories to reduce redundancy
+ */
+import { getDatabase, withTransaction } from '../database/init.js';
+import { DEFAULT_CONFIG, } from './types.js';
+import { getMemoriesByType, getRecentMemories, promoteMemory, deleteMemory, searchMemories, getMemoryStats, updateDecayScores, } from './store.js';
+import { processDecay, } from './decay.js';
+import { detectContradictions, linkContradictions, } from './contradiction.js';
+import { jaccardSimilarity } from './similarity.js';
+import { pruneActivationCache } from './activation.js';
+/**
+ * Run full consolidation process
+ * This is like the brain's sleep consolidation - should be run periodically
+ */
+export function consolidate(config = DEFAULT_CONFIG) {
+    // Wrap entire consolidation in a transaction for atomicity
+    return withTransaction(() => {
+        const db = getDatabase();
+        let consolidated = 0;
+        let decayed = 0;
+        let deleted = 0;
+        // Get all short-term memories
+        const shortTermMemories = getMemoriesByType('short_term', config.maxShortTermMemories * 2);
+        // Process decay for all memories
+        const { toDelete, toPromote, updated } = processDecay(shortTermMemories, config);
+        // Promote worthy memories
+        for (const id of toPromote) {
+            promoteMemory(id);
+            consolidated++;
+        }
+        // Delete decayed memories (excluding those just promoted)
+        for (const id of toDelete) {
+            if (!toPromote.includes(id)) {
+                deleteMemory(id);
+                deleted++;
+            }
+        }
+        // Update decayed scores in database
+        const updateStmt = db.prepare('UPDATE memories SET salience = ? WHERE id = ?');
+        for (const [id, score] of updated) {
+            if (!toDelete.includes(id)) {
+                updateStmt.run(score, id);
+                decayed++;
+            }
+        }
+        // Enforce memory limits
+        deleted += enforceMemoryLimits(config);
+        // Persist updated decay scores for efficient sorting
+        updateDecayScores();
+        // Evolve salience based on structural importance
+        let salienceEvolved = 0;
+        try {
+            salienceEvolved = evolveSalience(db);
+        }
+        catch (e) {
+            console.error('[shieldcortex] Salience evolution failed:', e);
+        }
+        // ORGANIC FEATURE: Contradiction Detection (Phase 3)
+        // Detect and link contradicting memories during consolidation
+        let contradictionsFound = 0;
+        let contradictionsLinked = 0;
+        try {
+            const contradictions = detectContradictions({ minScore: 0.5, limit: 50 });
+            contradictionsFound = contradictions.length;
+            contradictionsLinked = linkContradictions(contradictions);
+        }
+        catch (e) {
+            console.error('[shieldcortex] Contradiction detection failed:', e);
+        }
+        // Prune activation cache to prevent unbounded growth
+        pruneActivationCache();
+        return { consolidated, decayed, deleted, contradictionsFound, contradictionsLinked, salienceEvolved };
+    });
+}
+/**
+ * Adjust salience based on structural importance (link count, contradiction status).
+ * Called during consolidation.
+ */
+function evolveSalience(db) {
+    let updated = 0;
+    // Boost highly-linked memories (hub bonus)
+    const hubs = db.prepare(`
+    SELECT m.id, m.salience,
+      (SELECT COUNT(*) FROM memory_links WHERE source_id = m.id OR target_id = m.id) as link_count
+    FROM memories m
+    WHERE m.type IN ('long_term', 'episodic')
+  `).all();
+    for (const hub of hubs) {
+        if (hub.link_count < 2)
+            continue;
+        const linkBonus = Math.min(0.1, Math.log2(hub.link_count) * 0.03);
+        const newSalience = Math.min(1.0, hub.salience + linkBonus);
+        if (newSalience > hub.salience) {
+            db.prepare('UPDATE memories SET salience = ? WHERE id = ?').run(newSalience, hub.id);
+            updated++;
+        }
+    }
+    // Penalize contradicted memories slightly (both sides)
+    const contradicted = db.prepare(`
+    SELECT DISTINCT source_id, target_id
+    FROM memory_links
+    WHERE relationship = 'contradicts'
+  `).all();
+    for (const pair of contradicted) {
+        for (const id of [pair.source_id, pair.target_id]) {
+            const mem = db.prepare('SELECT salience FROM memories WHERE id = ?').get(id);
+            if (mem && mem.salience > 0.3) {
+                db.prepare('UPDATE memories SET salience = ? WHERE id = ?')
+                    .run(mem.salience - 0.02, id);
+                updated++;
+            }
+        }
+    }
+    return updated;
+}
+/**
+ * Enforce maximum memory limits
+ * Removes lowest-priority memories when limits are exceeded
+ */
+export function enforceMemoryLimits(config = DEFAULT_CONFIG) {
+    // Note: If called within consolidate(), this is already in a transaction
+    // If called standalone, we wrap it for safety
+    const db = getDatabase();
+    let deleted = 0;
+    // Check short-term memory limit
+    const shortTermCount = db.prepare("SELECT COUNT(*) as count FROM memories WHERE type = 'short_term'").get().count;
+    if (shortTermCount > config.maxShortTermMemories) {
+        const toRemove = shortTermCount - config.maxShortTermMemories;
+        const lowPriority = db.prepare(`
+      SELECT id FROM memories
+      WHERE type = 'short_term'
+      ORDER BY salience ASC, last_accessed ASC
+      LIMIT ?
+    `).all(toRemove);
+        for (const { id } of lowPriority) {
+            deleteMemory(id);
+            deleted++;
+        }
+    }
+    // Check long-term memory limit (more lenient)
+    const longTermCount = db.prepare("SELECT COUNT(*) as count FROM memories WHERE type = 'long_term'").get().count;
+    if (longTermCount > config.maxLongTermMemories) {
+        const toRemove = longTermCount - config.maxLongTermMemories;
+        const lowPriority = db.prepare(`
+      SELECT id FROM memories
+      WHERE type = 'long_term'
+      ORDER BY salience ASC, access_count ASC, last_accessed ASC
+      LIMIT ?
+    `).all(toRemove);
+        for (const { id } of lowPriority) {
+            deleteMemory(id);
+            deleted++;
+        }
+    }
+    return deleted;
+}
+/**
+ * Find and merge similar short-term memories into coherent long-term entries.
+ * Groups memories by project|category, then clusters by Jaccard similarity
+ * on content (0.6 weight) + title (0.4 weight).
+ * Returns count of deleted (merged) memories.
+ */
+export function mergeSimilarMemories(project, similarityThreshold = 0.25) {
+    return withTransaction(() => {
+        const db = getDatabase();
+        let deleted = 0;
+        // Step 1: Get all short-term memories, optionally filtered by project
+        let sql = "SELECT * FROM memories WHERE type = 'short_term'";
+        const params = [];
+        if (project) {
+            sql += ' AND project = ?';
+            params.push(project);
+        }
+        sql += ' ORDER BY created_at ASC';
+        const memories = db.prepare(sql).all(...params);
+        // Step 2: Group by project|category
+        const groups = new Map();
+        for (const mem of memories) {
+            const key = `${mem.project || ''}|${mem.category || ''}`;
+            if (!groups.has(key))
+                groups.set(key, []);
+            groups.get(key).push(mem);
+        }
+        // Step 3: For each group with 2+ members, find clusters
+        for (const [, group] of groups) {
+            if (group.length < 2)
+                continue;
+            // Track which memories have been clustered
+            const clustered = new Set();
+            for (let i = 0; i < group.length; i++) {
+                if (clustered.has(i))
+                    continue;
+                const cluster = [i]; // indices into group
+                const memA = group[i];
+                for (let j = i + 1; j < group.length; j++) {
+                    if (clustered.has(j))
+                        continue;
+                    const memB = group[j];
+                    const contentSim = jaccardSimilarity(memA.content, memB.content);
+                    const titleSim = jaccardSimilarity(memA.title, memB.title);
+                    const combinedSim = contentSim * 0.6 + titleSim * 0.4;
+                    if (combinedSim >= similarityThreshold) {
+                        cluster.push(j);
+                    }
+                }
+                if (cluster.length < 2)
+                    continue;
+                // Mark all as clustered
+                for (const idx of cluster)
+                    clustered.add(idx);
+                // Step 4: Merge cluster
+                // Sort by salience desc, pick highest as base
+                const clusterMems = cluster.map(idx => group[idx]);
+                clusterMems.sort((a, b) => b.salience - a.salience);
+                const base = clusterMems[0];
+                const others = clusterMems.slice(1);
+                // Merge content
+                const bulletPoints = others
+                    .map(m => `- ${m.title}: ${m.content}`)
+                    .join('\n');
+                const mergedContent = `${base.content}\n\nConsolidated context:\n${bulletPoints}`;
+                // Merge tags (union)
+                const allTags = new Set();
+                for (const m of clusterMems) {
+                    try {
+                        const tags = JSON.parse(m.tags || '[]');
+                        for (const t of tags)
+                            allTags.add(t);
+                    }
+                    catch {
+                        // skip invalid tags
+                    }
+                }
+                // Sum access counts
+                const totalAccessCount = clusterMems.reduce((sum, m) => sum + (m.access_count || 0), 0);
+                // New salience: base + 0.1, capped at 1.0
+                const newSalience = Math.min(1.0, base.salience + 0.1);
+                // Update base memory
+                db.prepare(`
+          UPDATE memories
+          SET type = 'long_term',
+              content = ?,
+              tags = ?,
+              salience = ?,
+              access_count = ?
+          WHERE id = ?
+        `).run(mergedContent, JSON.stringify([...allTags]), newSalience, totalAccessCount, base.id);
+                // Delete others
+                for (const other of others) {
+                    deleteMemory(other.id);
+                    deleted++;
+                }
+            }
+        }
+        return deleted;
+    });
+}
+/**
+ * Generate a context summary for session start
+ * Provides a high-level view of relevant memories
+ */
+export async function generateContextSummary(project, config = DEFAULT_CONFIG) {
+    // Get recent memories
+    const recentMemories = getRecentMemories(10, project);
+    // Get key architecture decisions
+    const keyDecisions = (await searchMemories({
+        query: '',
+        project,
+        category: 'architecture',
+        minSalience: 0.6,
+        limit: 5,
+    }, config)).map(r => r.memory);
+    // Get active patterns
+    const activePatterns = (await searchMemories({
+        query: '',
+        project,
+        category: 'pattern',
+        minSalience: 0.5,
+        limit: 5,
+    }, config)).map(r => r.memory);
+    // Get pending items
+    const pendingItems = (await searchMemories({
+        query: '',
+        project,
+        category: 'todo',
+        limit: 10,
+    }, config)).map(r => r.memory);
+    return {
+        project,
+        recentMemories,
+        keyDecisions,
+        activePatterns,
+        pendingItems,
+    };
+}
+/**
+ * Format context summary as a readable string
+ */
+export function formatContextSummary(summary) {
+    const lines = [];
+    if (summary.project) {
+        lines.push(`## Project: ${summary.project}\n`);
+    }
+    if (summary.keyDecisions.length > 0) {
+        lines.push('### Key Decisions');
+        for (const memory of summary.keyDecisions) {
+            lines.push(`- **${memory.title}**: ${memory.content.slice(0, 100)}${memory.content.length > 100 ? '...' : ''}`);
+        }
+        lines.push('');
+    }
+    if (summary.activePatterns.length > 0) {
+        lines.push('### Active Patterns');
+        for (const memory of summary.activePatterns) {
+            lines.push(`- **${memory.title}**: ${memory.content.slice(0, 100)}${memory.content.length > 100 ? '...' : ''}`);
+        }
+        lines.push('');
+    }
+    if (summary.pendingItems.length > 0) {
+        lines.push('### Pending Items');
+        for (const memory of summary.pendingItems) {
+            lines.push(`- [ ] ${memory.title}`);
+        }
+        lines.push('');
+    }
+    if (summary.recentMemories.length > 0) {
+        lines.push('### Recent Context');
+        for (const memory of summary.recentMemories.slice(0, 5)) {
+            lines.push(`- ${memory.title} (${memory.category})`);
+        }
+    }
+    return lines.join('\n');
+}
+/**
+ * Start a new session
+ * Creates a session record and returns relevant context
+ */
+export async function startSession(project) {
+    const db = getDatabase();
+    // Create session record
+    const result = db.prepare(`
+    INSERT INTO sessions (project) VALUES (?)
+  `).run(project || null);
+    const sessionId = result.lastInsertRowid;
+    // Generate context summary
+    const context = await generateContextSummary(project);
+    return { sessionId, context };
+}
+/**
+ * End a session
+ * Updates session record with summary
+ */
+export function endSession(sessionId, summary) {
+    const db = getDatabase();
+    // Get counts from this session
+    const stats = db.prepare(`
+    SELECT
+      (SELECT COUNT(*) FROM memories WHERE created_at >= s.started_at) as created,
+      (SELECT COUNT(*) FROM memories WHERE last_accessed >= s.started_at) as accessed
+    FROM sessions s WHERE s.id = ?
+  `).get(sessionId);
+    db.prepare(`
+    UPDATE sessions
+    SET ended_at = CURRENT_TIMESTAMP,
+        summary = ?,
+        memories_created = ?,
+        memories_accessed = ?
+    WHERE id = ?
+  `).run(summary || null, stats?.created || 0, stats?.accessed || 0, sessionId);
+}
+/**
+ * Get suggested context for the current query
+ * Returns memories that might be relevant to what the user is working on
+ */
+export async function getSuggestedContext(currentContext, project, limit = 5) {
+    // Search for relevant memories based on current context
+    const results = await searchMemories({
+        query: currentContext,
+        project,
+        minSalience: 0.4,
+        limit,
+        includeDecayed: false,
+    });
+    return results.map(r => r.memory);
+}
+/**
+ * Export memories as JSON (for backup/transfer)
+ */
+export function exportMemories(project) {
+    const db = getDatabase();
+    let sql = 'SELECT * FROM memories';
+    const params = [];
+    if (project) {
+        sql += ' WHERE project = ?';
+        params.push(project);
+    }
+    sql += ' ORDER BY created_at ASC';
+    const rows = db.prepare(sql).all(...params);
+    return JSON.stringify(rows, null, 2);
+}
+/**
+ * Import memories from JSON
+ */
+export function importMemories(json) {
+    // Wrap in transaction for atomic import
+    return withTransaction(() => {
+        const db = getDatabase();
+        const memories = JSON.parse(json);
+        const stmt = db.prepare(`
+      INSERT INTO memories (type, category, title, content, project, tags, salience, metadata)
+      VALUES (?, ?, ?, ?, ?, ?, ?, ?)
+    `);
+        let imported = 0;
+        for (const memory of memories) {
+            try {
+                stmt.run(memory.type, memory.category, memory.title, memory.content, memory.project || null, memory.tags || '[]', memory.salience || 0.5, memory.metadata || '{}');
+                imported++;
+            }
+            catch {
+                // Skip duplicates or invalid entries
+            }
+        }
+        return imported;
+    });
+}
+/**
+ * Vacuum database to reclaim space after deletions
+ * Run periodically or after major cleanup operations
+ */
+export function vacuumDatabase() {
+    try {
+        const db = getDatabase();
+        db.exec('VACUUM');
+        return { success: true, message: 'Database vacuumed successfully' };
+    }
+    catch (error) {
+        return { success: false, message: `Vacuum failed: ${error}` };
+    }
+}
+/**
+ * Preview what consolidation would do without actually doing it
+ * Useful for dry-run mode
+ */
+export function previewConsolidation(config = DEFAULT_CONFIG) {
+    const db = getDatabase();
+    // Get all short-term memories
+    const shortTermMemories = getMemoriesByType('short_term', config.maxShortTermMemories * 2);
+    // Get episodic memories too
+    const episodicMemories = getMemoriesByType('episodic', 100);
+    // Process decay to see what would happen
+    const { toDelete: deleteIds, toPromote: promoteIds } = processDecay([...shortTermMemories, ...episodicMemories], config);
+    // Map IDs back to memories
+    const allMemories = [...shortTermMemories, ...episodicMemories];
+    const toPromote = allMemories.filter(m => promoteIds.includes(m.id));
+    const toDelete = allMemories.filter(m => deleteIds.includes(m.id) && !promoteIds.includes(m.id));
+    // Get counts
+    const totalShortTerm = db.prepare("SELECT COUNT(*) as count FROM memories WHERE type = 'short_term'").get().count;
+    const totalLongTerm = db.prepare("SELECT COUNT(*) as count FROM memories WHERE type = 'long_term'").get().count;
+    return { toPromote, toDelete, totalShortTerm, totalLongTerm };
+}
+/**
+ * Check if consolidation should be triggered based on memory state
+ * Returns true if consolidation is recommended
+ */
+export function shouldTriggerConsolidation(config = DEFAULT_CONFIG) {
+    const stats = getMemoryStats();
+    const stmFullness = stats.shortTerm / config.maxShortTermMemories;
+    // Trigger early when approaching capacity
+    if (stmFullness > 0.8) {
+        return {
+            shouldRun: true,
+            reason: `Short-term memory at ${Math.round(stmFullness * 100)}% capacity`,
+        };
+    }
+    // Check if many memories are below threshold
+    const db = getDatabase();
+    const lowScoreCount = db.prepare(`
+    SELECT COUNT(*) as count FROM memories
+    WHERE type = 'short_term' AND decayed_score < ?
+  `).get(config.salienceThreshold).count;
+    if (lowScoreCount > 10) {
+        return {
+            shouldRun: true,
+            reason: `${lowScoreCount} memories below salience threshold`,
+        };
+    }
+    return { shouldRun: false, reason: 'No consolidation needed' };
+}
+/**
+ * Full cleanup: consolidate + vacuum
+ * Best run periodically to keep database healthy
+ */
+export function fullCleanup(config = DEFAULT_CONFIG) {
+    // Run consolidation
+    const consolidation = consolidate(config);
+    // Merge similar memories
+    const merged = mergeSimilarMemories();
+    // Vacuum if we deleted anything
+    let vacuumed = false;
+    if (consolidation.deleted > 0 || merged > 0) {
+        const vacResult = vacuumDatabase();
+        vacuumed = vacResult.success;
+    }
+    return { consolidation, vacuumed, merged };
+}
+//# sourceMappingURL=consolidate.js.map

package/dist/memory/consolidate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"consolidate.js","sourceRoot":"","sources":["../../src/memory/consolidate.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AACnE,OAAO,EAGL,cAAc,GAGf,MAAM,YAAY,CAAC;AACpB,OAAO,EACL,iBAAiB,EACjB,iBAAiB,EAEjB,aAAa,EACb,YAAY,EACZ,cAAc,EACd,cAAc,EACd,iBAAiB,GAClB,MAAM,YAAY,CAAC;AACpB,OAAO,EAKL,YAAY,GACb,MAAM,YAAY,CAAC;AACpB,OAAO,EACL,oBAAoB,EACpB,kBAAkB,GACnB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AACpD,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AAEvD;;;GAGG;AACH,MAAM,UAAU,WAAW,CACzB,SAAuB,cAAc;IAErC,2DAA2D;IAC3D,OAAO,eAAe,CAAC,GAAG,EAAE;QAC1B,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,8BAA8B;QAC9B,MAAM,iBAAiB,GAAG,iBAAiB,CAAC,YAAY,EAAE,MAAM,CAAC,oBAAoB,GAAG,CAAC,CAAC,CAAC;QAE3F,iCAAiC;QACjC,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,YAAY,CAAC,iBAAiB,EAAE,MAAM,CAAC,CAAC;QAEjF,0BAA0B;QAC1B,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;YAC3B,aAAa,CAAC,EAAE,CAAC,CAAC;YAClB,YAAY,EAAE,CAAC;QACjB,CAAC;QAED,0DAA0D;QAC1D,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC5B,YAAY,CAAC,EAAE,CAAC,CAAC;gBACjB,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,oCAAoC;QACpC,MAAM,UAAU,GAAG,EAAE,CAAC,OAAO,CAAC,+CAA+C,CAAC,CAAC;QAC/E,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;YAClC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC3B,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;gBAC1B,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,wBAAwB;QACxB,OAAO,IAAI,mBAAmB,CAAC,MAAM,CAAC,CAAC;QAEvC,qDAAqD;QACrD,iBAAiB,EAAE,CAAC;QAEpB,iDAAiD;QACjD,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC;YACH,eAAe,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC;QACvC,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,OAAO,CAAC,KAAK,CAAC,2CAA2C,EAAE,CAAC,CAAC,CAAC;QAChE,CAAC;QAED,qDAAqD;QACrD,8DAA8D;QAC9D,IAAI,mBAAmB,GAAG,CAAC,CAAC;QAC5B,IAAI,oBAAoB,GAAG,CAAC,CAAC;QAE7B,IAAI,CAAC;YACH,MAAM,cAAc,GAAG,oBAAoB,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;YAC1E,mBAAmB,GAAG,cAAc,CAAC,MAAM,CAAC;YAC5C,oBAAoB,GAAG,kBAAkB,CAAC,cAAc,CAAC,CAAC;QAC5D,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,OAAO,CAAC,KAAK,CAAC,gDAAgD,EAAE,CAAC,CAAC,CAAC;QACrE,CAAC;QAED,qDAAqD;QACrD,oBAAoB,EAAE,CAAC;QAEvB,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,OAAO,EAAE,mBAAmB,EAAE,oBAAoB,EAAE,eAAe,EAAE,CAAC;IACxG,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CAAC,EAAO;IAC7B,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,2CAA2C;IAC3C,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;GAKvB,CAAC,CAAC,GAAG,EAA4D,CAAC;IAEnE,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,GAAG,CAAC,UAAU,GAAG,CAAC;YAAE,SAAS;QACjC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,CAAC;QAClE,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC;QAC5D,IAAI,WAAW,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC/B,EAAE,CAAC,OAAO,CAAC,+CAA+C,CAAC,CAAC,GAAG,CAAC,WAAW,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YACrF,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,uDAAuD;IACvD,MAAM,YAAY,GAAG,EAAE,CAAC,OAAO,CAAC;;;;GAI/B,CAAC,CAAC,GAAG,EAAgD,CAAC;IAEvD,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,KAAK,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;YAClD,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,4CAA4C,CAAC,CAAC,GAAG,CAAC,EAAE,CAAQ,CAAC;YACpF,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ,GAAG,GAAG,EAAE,CAAC;gBAC9B,EAAE,CAAC,OAAO,CAAC,+CAA+C,CAAC;qBACxD,GAAG,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,EAAE,EAAE,CAAC,CAAC;gBAChC,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,SAAuB,cAAc;IACvE,yEAAyE;IACzE,8CAA8C;IAC9C,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;IACzB,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,gCAAgC;IAChC,MAAM,cAAc,GAAI,EAAE,CAAC,OAAO,CAChC,kEAAkE,CACnE,CAAC,GAAG,EAAwB,CAAC,KAAK,CAAC;IAEpC,IAAI,cAAc,GAAG,MAAM,CAAC,oBAAoB,EAAE,CAAC;QACjD,MAAM,QAAQ,GAAG,cAAc,GAAG,MAAM,CAAC,oBAAoB,CAAC;QAC9D,MAAM,WAAW,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;KAK9B,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAqB,CAAC;QAErC,KAAK,MAAM,EAAE,EAAE,EAAE,IAAI,WAAW,EAAE,CAAC;YACjC,YAAY,CAAC,EAAE,CAAC,CAAC;YACjB,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,8CAA8C;IAC9C,MAAM,aAAa,GAAI,EAAE,CAAC,OAAO,CAC/B,iEAAiE,CAClE,CAAC,GAAG,EAAwB,CAAC,KAAK,CAAC;IAEpC,IAAI,aAAa,GAAG,MAAM,CAAC,mBAAmB,EAAE,CAAC;QAC/C,MAAM,QAAQ,GAAG,aAAa,GAAG,MAAM,CAAC,mBAAmB,CAAC;QAC5D,MAAM,WAAW,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;KAK9B,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAqB,CAAC;QAErC,KAAK,MAAM,EAAE,EAAE,EAAE,IAAI,WAAW,EAAE,CAAC;YACjC,YAAY,CAAC,EAAE,CAAC,CAAC;YACjB,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAClC,OAAgB,EAChB,sBAA8B,IAAI;IAElC,OAAO,eAAe,CAAC,GAAG,EAAE;QAC1B,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,sEAAsE;QACtE,IAAI,GAAG,GAAG,kDAAkD,CAAC;QAC7D,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,IAAI,OAAO,EAAE,CAAC;YACZ,GAAG,IAAI,kBAAkB,CAAC;YAC1B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvB,CAAC;QACD,GAAG,IAAI,0BAA0B,CAAC;QAElC,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAA8B,CAAC;QAE7E,oCAAoC;QACpC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAqC,CAAC;QAC5D,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,OAAO,IAAI,EAAE,IAAI,GAAG,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAC;YACzD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YAC1C,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7B,CAAC;QAED,wDAAwD;QACxD,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;YAC/B,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YAE/B,2CAA2C;YAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;YAEpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAE/B,MAAM,OAAO,GAAa,CAAC,CAAC,CAAC,CAAC,CAAC,qBAAqB;gBACpD,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBAEtB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC1C,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;wBAAE,SAAS;oBAE/B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBACtB,MAAM,UAAU,GAAG,iBAAiB,CAClC,IAAI,CAAC,OAAiB,EACtB,IAAI,CAAC,OAAiB,CACvB,CAAC;oBACF,MAAM,QAAQ,GAAG,iBAAiB,CAChC,IAAI,CAAC,KAAe,EACpB,IAAI,CAAC,KAAe,CACrB,CAAC;oBACF,MAAM,WAAW,GAAG,UAAU,GAAG,GAAG,GAAG,QAAQ,GAAG,GAAG,CAAC;oBAEtD,IAAI,WAAW,IAAI,mBAAmB,EAAE,CAAC;wBACvC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAClB,CAAC;gBACH,CAAC;gBAED,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;oBAAE,SAAS;gBAEjC,wBAAwB;gBACxB,KAAK,MAAM,GAAG,IAAI,OAAO;oBAAE,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAE9C,wBAAwB;gBACxB,8CAA8C;gBAC9C,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;gBACnD,WAAW,CAAC,IAAI,CACd,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAE,CAAC,CAAC,QAAmB,GAAI,CAAC,CAAC,QAAmB,CAC1D,CAAC;gBAEF,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;gBAC5B,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAEpC,gBAAgB;gBAChB,MAAM,YAAY,GAAG,MAAM;qBACxB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAM,CAAC,CAAC,KAAgB,KAAM,CAAC,CAAC,OAAkB,EAAE,CAAC;qBAC9D,IAAI,CAAC,IAAI,CAAC,CAAC;gBACd,MAAM,aAAa,GAAG,GAAG,IAAI,CAAC,OAAiB,8BAA8B,YAAY,EAAE,CAAC;gBAE5F,qBAAqB;gBACrB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;gBAClC,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;oBAC5B,IAAI,CAAC;wBACH,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAE,CAAC,CAAC,IAAe,IAAI,IAAI,CAAa,CAAC;wBAChE,KAAK,MAAM,CAAC,IAAI,IAAI;4BAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACvC,CAAC;oBAAC,MAAM,CAAC;wBACP,oBAAoB;oBACtB,CAAC;gBACH,CAAC;gBAED,oBAAoB;gBACpB,MAAM,gBAAgB,GAAG,WAAW,CAAC,MAAM,CACzC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAE,CAAC,CAAC,YAAuB,IAAI,CAAC,CAAC,EACnD,CAAC,CACF,CAAC;gBAEF,0CAA0C;gBAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAG,IAAI,CAAC,QAAmB,GAAG,GAAG,CAAC,CAAC;gBAEnE,qBAAqB;gBACrB,EAAE,CAAC,OAAO,CAAC;;;;;;;;SAQV,CAAC,CAAC,GAAG,CACJ,aAAa,EACb,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAC5B,WAAW,EACX,gBAAgB,EAChB,IAAI,CAAC,EAAY,CAClB,CAAC;gBAEF,gBAAgB;gBAChB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;oBAC3B,YAAY,CAAC,KAAK,CAAC,EAAY,CAAC,CAAC;oBACjC,OAAO,EAAE,CAAC;gBACZ,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,OAAgB,EAChB,SAAuB,cAAc;IAErC,sBAAsB;IACtB,MAAM,cAAc,GAAG,iBAAiB,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAEtD,iCAAiC;IACjC,MAAM,YAAY,GAAG,CAAC,MAAM,cAAc,CAAC;QACzC,KAAK,EAAE,EAAE;QACT,OAAO;QACP,QAAQ,EAAE,cAAc;QACxB,WAAW,EAAE,GAAG;QAChB,KAAK,EAAE,CAAC;KACT,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAE/B,sBAAsB;IACtB,MAAM,cAAc,GAAG,CAAC,MAAM,cAAc,CAAC;QAC3C,KAAK,EAAE,EAAE;QACT,OAAO;QACP,QAAQ,EAAE,SAAS;QACnB,WAAW,EAAE,GAAG;QAChB,KAAK,EAAE,CAAC;KACT,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAE/B,oBAAoB;IACpB,MAAM,YAAY,GAAG,CAAC,MAAM,cAAc,CAAC;QACzC,KAAK,EAAE,EAAE;QACT,OAAO;QACP,QAAQ,EAAE,MAAM;QAChB,KAAK,EAAE,EAAE;KACV,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAE/B,OAAO;QACL,OAAO;QACP,cAAc;QACd,YAAY;QACZ,cAAc;QACd,YAAY;KACb,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,OAAuB;IAC1D,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;QACpB,KAAK,CAAC,IAAI,CAAC,eAAe,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC;IACjD,CAAC;IAED,IAAI,OAAO,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpC,KAAK,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;QAChC,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;YAC1C,KAAK,CAAC,IAAI,CAAC,OAAO,MAAM,CAAC,KAAK,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAClH,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,IAAI,OAAO,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtC,KAAK,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;QAClC,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,cAAc,EAAE,CAAC;YAC5C,KAAK,CAAC,IAAI,CAAC,OAAO,MAAM,CAAC,KAAK,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAClH,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,IAAI,OAAO,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpC,KAAK,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;QAChC,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;YAC1C,KAAK,CAAC,IAAI,CAAC,SAAS,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;QACtC,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,IAAI,OAAO,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtC,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;QACjC,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACxD,KAAK,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC,KAAK,KAAK,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAAC,OAAgB;IAIjD,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;IAEzB,wBAAwB;IACxB,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CAAC;;GAEzB,CAAC,CAAC,GAAG,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC;IAExB,MAAM,SAAS,GAAG,MAAM,CAAC,eAAyB,CAAC;IAEnD,2BAA2B;IAC3B,MAAM,OAAO,GAAG,MAAM,sBAAsB,CAAC,OAAO,CAAC,CAAC;IAEtD,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;AAChC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CACxB,SAAiB,EACjB,OAAgB;IAEhB,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;IAEzB,+BAA+B;IAC/B,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;GAKxB,CAAC,CAAC,GAAG,CAAC,SAAS,CAAsD,CAAC;IAEvE,EAAE,CAAC,OAAO,CAAC;;;;;;;GAOV,CAAC,CAAC,GAAG,CACJ,OAAO,IAAI,IAAI,EACf,KAAK,EAAE,OAAO,IAAI,CAAC,EACnB,KAAK,EAAE,QAAQ,IAAI,CAAC,EACpB,SAAS,CACV,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,cAAsB,EACtB,OAAgB,EAChB,QAAgB,CAAC;IAEjB,wDAAwD;IACxD,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC;QACnC,KAAK,EAAE,cAAc;QACrB,OAAO;QACP,WAAW,EAAE,GAAG;QAChB,KAAK;QACL,cAAc,EAAE,KAAK;KACtB,CAAC,CAAC;IAEH,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AACpC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,OAAgB;IAC7C,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;IAEzB,IAAI,GAAG,GAAG,wBAAwB,CAAC;IACnC,MAAM,MAAM,GAAc,EAAE,CAAC;IAC7B,IAAI,OAAO,EAAE,CAAC;QACZ,GAAG,IAAI,oBAAoB,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACvB,CAAC;IACD,GAAG,IAAI,0BAA0B,CAAC;IAElC,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;IAC5C,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;AACvC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,IAAY;IACzC,wCAAwC;IACxC,OAAO,eAAe,CAAC,GAAG,EAAE;QAC1B,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAA8B,CAAC;QAE/D,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;KAGvB,CAAC,CAAC;QAEH,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,IAAI,CAAC;gBACH,IAAI,CAAC,GAAG,CACN,MAAM,CAAC,IAAI,EACX,MAAM,CAAC,QAAQ,EACf,MAAM,CAAC,KAAK,EACZ,MAAM,CAAC,OAAO,EACd,MAAM,CAAC,OAAO,IAAI,IAAI,EACtB,MAAM,CAAC,IAAI,IAAI,IAAI,EACnB,MAAM,CAAC,QAAQ,IAAI,GAAG,EACtB,MAAM,CAAC,QAAQ,IAAI,IAAI,CACxB,CAAC;gBACF,QAAQ,EAAE,CAAC;YACb,CAAC;YAAC,MAAM,CAAC;gBACP,qCAAqC;YACvC,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc;IAC5B,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAClB,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,gCAAgC,EAAE,CAAC;IACtE,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,kBAAkB,KAAK,EAAE,EAAE,CAAC;IAChE,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAClC,SAAuB,cAAc;IAOrC,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;IAEzB,8BAA8B;IAC9B,MAAM,iBAAiB,GAAG,iBAAiB,CAAC,YAAY,EAAE,MAAM,CAAC,oBAAoB,GAAG,CAAC,CAAC,CAAC;IAE3F,4BAA4B;IAC5B,MAAM,gBAAgB,GAAG,iBAAiB,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;IAE5D,yCAAyC;IACzC,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,GAAG,YAAY,CACjE,CAAC,GAAG,iBAAiB,EAAE,GAAG,gBAAgB,CAAC,EAC3C,MAAM,CACP,CAAC;IAEF,2BAA2B;IAC3B,MAAM,WAAW,GAAG,CAAC,GAAG,iBAAiB,EAAE,GAAG,gBAAgB,CAAC,CAAC;IAChE,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrE,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEjG,aAAa;IACb,MAAM,cAAc,GAAI,EAAE,CAAC,OAAO,CAChC,kEAAkE,CACnE,CAAC,GAAG,EAAwB,CAAC,KAAK,CAAC;IAEpC,MAAM,aAAa,GAAI,EAAE,CAAC,OAAO,CAC/B,iEAAiE,CAClE,CAAC,GAAG,EAAwB,CAAC,KAAK,CAAC;IAEpC,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,cAAc,EAAE,aAAa,EAAE,CAAC;AAChE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,0BAA0B,CACxC,SAAuB,cAAc;IAErC,MAAM,KAAK,GAAG,cAAc,EAAE,CAAC;IAC/B,MAAM,WAAW,GAAG,KAAK,CAAC,SAAS,GAAG,MAAM,CAAC,oBAAoB,CAAC;IAElE,0CAA0C;IAC1C,IAAI,WAAW,GAAG,GAAG,EAAE,CAAC;QACtB,OAAO;YACL,SAAS,EAAE,IAAI;YACf,MAAM,EAAE,wBAAwB,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,GAAG,CAAC,YAAY;SAC1E,CAAC;IACJ,CAAC;IAED,6CAA6C;IAC7C,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;IACzB,MAAM,aAAa,GAAI,EAAE,CAAC,OAAO,CAAC;;;GAGjC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,iBAAiB,CAAuB,CAAC,KAAK,CAAC;IAE7D,IAAI,aAAa,GAAG,EAAE,EAAE,CAAC;QACvB,OAAO;YACL,SAAS,EAAE,IAAI;YACf,MAAM,EAAE,GAAG,aAAa,oCAAoC;SAC7D,CAAC;IACJ,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,yBAAyB,EAAE,CAAC;AACjE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CACzB,SAAuB,cAAc;IAErC,oBAAoB;IACpB,MAAM,aAAa,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IAE1C,yBAAyB;IACzB,MAAM,MAAM,GAAG,oBAAoB,EAAE,CAAC;IAEtC,gCAAgC;IAChC,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,aAAa,CAAC,OAAO,GAAG,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5C,MAAM,SAAS,GAAG,cAAc,EAAE,CAAC;QACnC,QAAQ,GAAG,SAAS,CAAC,OAAO,CAAC;IAC/B,CAAC;IAED,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;AAC7C,CAAC"}

package/dist/memory/contradiction.d.ts

@@ -0,0 +1,69 @@
+/**
+ * Contradiction Detection System
+ *
+ * Detects potentially contradictory memories based on:
+ * - Opposite statements about the same topic
+ * - Different solutions to the same problem
+ * - Conflicting preferences or decisions
+ *
+ * Phase 3 Organic Brain Feature
+ */
+import { Memory } from './types.js';
+/**
+ * Result of checking two memories for contradiction
+ */
+export interface ContradictionResult {
+    memoryA: Memory;
+    memoryB: Memory;
+    score: number;
+    reason: string;
+    sharedTopics: string[];
+}
+/**
+ * Check if two memories might contradict each other
+ *
+ * @param memoryA - First memory to compare
+ * @param memoryB - Second memory to compare
+ * @returns ContradictionResult if contradiction detected, null otherwise
+ */
+export declare function checkContradiction(memoryA: Memory, memoryB: Memory): ContradictionResult | null;
+/**
+ * Options for detecting contradictions
+ */
+export interface DetectContradictionsOptions {
+    project?: string;
+    category?: string;
+    minScore?: number;
+    limit?: number;
+}
+/**
+ * Detect contradictions across all memories matching the filter
+ *
+ * @param options - Filtering and limit options
+ * @returns Array of ContradictionResults sorted by score
+ */
+export declare function detectContradictions(options?: DetectContradictionsOptions): ContradictionResult[];
+/**
+ * Create 'contradicts' links between memories
+ * Called during consolidation to persist detected contradictions
+ *
+ * @param contradictions - Array of detected contradictions
+ * @returns Number of links created
+ */
+export declare function linkContradictions(contradictions: ContradictionResult[]): number;
+/**
+ * Get all contradictions for a specific memory
+ *
+ * @param memoryId - ID of the memory to check
+ * @returns Array of ContradictionResults
+ */
+export declare function getContradictionsFor(memoryId: number): ContradictionResult[];
+/**
+ * Check if a contradiction link already exists between two memories
+ *
+ * @param memoryAId - First memory ID
+ * @param memoryBId - Second memory ID
+ * @returns True if a contradiction link exists
+ */
+export declare function hasContradictionLink(memoryAId: number, memoryBId: number): boolean;
+//# sourceMappingURL=contradiction.d.ts.map

package/dist/memory/contradiction.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"contradiction.d.ts","sourceRoot":"","sources":["../../src/memory/contradiction.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,OAAO,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAuDpC;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB;AAgFD;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,GACd,mBAAmB,GAAG,IAAI,CA8D5B;AAED;;GAEG;AACH,MAAM,WAAW,2BAA2B;IAC1C,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAClC,OAAO,GAAE,2BAAgC,GACxC,mBAAmB,EAAE,CAwCvB;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,cAAc,EAAE,mBAAmB,EAAE,GAAG,MAAM,CAchF;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAAC,QAAQ,EAAE,MAAM,GAAG,mBAAmB,EAAE,CAoB5E;AAED;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAUlF"}