@cleocode/core 2026.3.57 → 2026.3.58

package/dist/memory/auto-extract.js

@@ -0,0 +1,143 @@
+/**
+ * Auto-extract structured memory entries from task completions and session ends.
+ *
+ * Best-effort extraction: all functions wrap their logic in try/catch and
+ * must never throw — memory extraction must never block the calling flow.
+ *
+ * @task T-auto-extract
+ * @epic T5149
+ */
+import { storeDecision } from './decisions.js';
+import { storeLearning } from './learnings.js';
+import { storePattern } from './patterns.js';
+/**
+ * Extract and store memory entries when a task is completed.
+ *
+ * - Always stores a learning for the completed task.
+ * - Stores a second learning if the task had dependencies.
+ * - Detects recurring label patterns across recent completed tasks
+ *   and stores a success pattern when any label appears 3+ times.
+ */
+export async function extractTaskCompletionMemory(projectRoot, task, _parentTask) {
+    try {
+        // Always store a learning for this completion
+        await storeLearning(projectRoot, {
+            insight: `Completed: ${task.title} — ${task.description ?? ''}`,
+            source: `task-completion:${task.id}`,
+            confidence: 0.7,
+            actionable: true,
+        });
+        // Dependency chain learning
+        const deps = task.depends ?? [];
+        if (deps.length > 0) {
+            await storeLearning(projectRoot, {
+                insight: `Task ${task.id} depended on ${deps.join(', ')} — dependency chain completed successfully`,
+                source: `task-completion:${task.id}`,
+                confidence: 0.7,
+            });
+        }
+        // Pattern detection: look for recurring labels across recent done tasks
+        const { getAccessor } = await import('../store/data-accessor.js');
+        const accessor = await getAccessor(projectRoot);
+        let doneTasks;
+        try {
+            const { tasks } = await accessor.queryTasks({ status: 'done' });
+            doneTasks = tasks;
+        }
+        finally {
+            await accessor.close();
+        }
+        const recentDone = doneTasks.slice(-50);
+        const labelCounts = new Map();
+        for (const t of recentDone) {
+            for (const label of t.labels ?? []) {
+                const existing = labelCounts.get(label) ?? [];
+                existing.push(t.id);
+                labelCounts.set(label, existing);
+            }
+        }
+        for (const [label, taskIds] of labelCounts.entries()) {
+            if (taskIds.length >= 3) {
+                await storePattern(projectRoot, {
+                    type: 'success',
+                    pattern: `Recurring label "${label}" seen in ${taskIds.length} completed tasks`,
+                    context: `Auto-detected from task completion of ${task.id}`,
+                    impact: 'medium',
+                    examples: taskIds,
+                });
+            }
+        }
+    }
+    catch {
+        // Best-effort: must never throw
+    }
+}
+/**
+ * Extract and store memory entries when a session ends.
+ *
+ * - Stores a process decision summarising the session.
+ * - Stores a per-task learning for each completed task.
+ * - Stores a workflow pattern when 2+ completed tasks share a label.
+ */
+export async function extractSessionEndMemory(projectRoot, sessionData, taskDetails) {
+    try {
+        if (taskDetails.length > 0) {
+            await storeDecision(projectRoot, {
+                type: 'process',
+                decision: `Session ${sessionData.sessionId} completed ${taskDetails.length} tasks: ${taskDetails.map((t) => t.id).join(', ')}`,
+                rationale: `Session scope: ${sessionData.scope}. Duration: ${Math.round(sessionData.duration / 60)} min.`,
+                confidence: 'medium',
+            });
+        }
+        // Per-task learnings
+        for (const t of taskDetails) {
+            await storeLearning(projectRoot, {
+                insight: `Completed: ${t.title} — ${t.description ?? ''}`,
+                source: `session-end:${sessionData.sessionId}`,
+                confidence: 0.7,
+                actionable: true,
+            });
+        }
+        // Workflow pattern when 2+ tasks share a label
+        const labelCounts = new Map();
+        for (const t of taskDetails) {
+            for (const label of t.labels ?? []) {
+                const existing = labelCounts.get(label) ?? [];
+                existing.push(t.id);
+                labelCounts.set(label, existing);
+            }
+        }
+        for (const [label, taskIds] of labelCounts.entries()) {
+            if (taskIds.length >= 2) {
+                await storePattern(projectRoot, {
+                    type: 'workflow',
+                    pattern: `Session ${sessionData.sessionId} completed ${taskIds.length} tasks with label "${label}"`,
+                    context: `Auto-detected from session end: ${sessionData.sessionId}`,
+                    impact: 'medium',
+                    examples: taskIds,
+                });
+            }
+        }
+    }
+    catch {
+        // Best-effort: must never throw
+    }
+}
+/**
+ * Resolve an array of task IDs to their full Task objects.
+ * Tasks that cannot be found are silently excluded.
+ */
+export async function resolveTaskDetails(projectRoot, taskIds) {
+    if (taskIds.length === 0) {
+        return [];
+    }
+    const { getAccessor } = await import('../store/data-accessor.js');
+    const accessor = await getAccessor(projectRoot);
+    try {
+        return await accessor.loadTasks(taskIds);
+    }
+    finally {
+        await accessor.close();
+    }
+}
+//# sourceMappingURL=auto-extract.js.map

package/dist/memory/auto-extract.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"auto-extract.js","sourceRoot":"","sources":["../../src/memory/auto-extract.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAE7C;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,2BAA2B,CAC/C,WAAmB,EACnB,IAAU,EACV,WAAkB;IAElB,IAAI,CAAC;QACH,8CAA8C;QAC9C,MAAM,aAAa,CAAC,WAAW,EAAE;YAC/B,OAAO,EAAE,cAAc,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,WAAW,IAAI,EAAE,EAAE;YAC/D,MAAM,EAAE,mBAAmB,IAAI,CAAC,EAAE,EAAE;YACpC,UAAU,EAAE,GAAG;YACf,UAAU,EAAE,IAAI;SACjB,CAAC,CAAC;QAEH,4BAA4B;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC;QAChC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpB,MAAM,aAAa,CAAC,WAAW,EAAE;gBAC/B,OAAO,EAAE,QAAQ,IAAI,CAAC,EAAE,gBAAgB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,4CAA4C;gBACnG,MAAM,EAAE,mBAAmB,IAAI,CAAC,EAAE,EAAE;gBACpC,UAAU,EAAE,GAAG;aAChB,CAAC,CAAC;QACL,CAAC;QAED,wEAAwE;QACxE,MAAM,EAAE,WAAW,EAAE,GAAG,MAAM,MAAM,CAAC,2BAA2B,CAAC,CAAC;QAClE,MAAM,QAAQ,GAAG,MAAM,WAAW,CAAC,WAAW,CAAC,CAAC;QAChD,IAAI,SAAiB,CAAC;QACtB,IAAI,CAAC;YACH,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;YAChE,SAAS,GAAG,KAAK,CAAC;QACpB,CAAC;gBAAS,CAAC;YACT,MAAM,QAAQ,CAAC,KAAK,EAAE,CAAC;QACzB,CAAC;QAED,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;QAExC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAoB,CAAC;QAChD,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;gBACnC,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;gBAC9C,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACpB,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;QAED,KAAK,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;YACrD,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBACxB,MAAM,YAAY,CAAC,WAAW,EAAE;oBAC9B,IAAI,EAAE,SAAS;oBACf,OAAO,EAAE,oBAAoB,KAAK,aAAa,OAAO,CAAC,MAAM,kBAAkB;oBAC/E,OAAO,EAAE,yCAAyC,IAAI,CAAC,EAAE,EAAE;oBAC3D,MAAM,EAAE,QAAQ;oBAChB,QAAQ,EAAE,OAAO;iBAClB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,gCAAgC;IAClC,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,uBAAuB,CAC3C,WAAmB,EACnB,WAA8B,EAC9B,WAAmB;IAEnB,IAAI,CAAC;QACH,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,aAAa,CAAC,WAAW,EAAE;gBAC/B,IAAI,EAAE,SAAS;gBACf,QAAQ,EAAE,WAAW,WAAW,CAAC,SAAS,cAAc,WAAW,CAAC,MAAM,WAAW,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;gBAC9H,SAAS,EAAE,kBAAkB,WAAW,CAAC,KAAK,eAAe,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,GAAG,EAAE,CAAC,OAAO;gBACzG,UAAU,EAAE,QAAQ;aACrB,CAAC,CAAC;QACL,CAAC;QAED,qBAAqB;QACrB,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;YAC5B,MAAM,aAAa,CAAC,WAAW,EAAE;gBAC/B,OAAO,EAAE,cAAc,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,WAAW,IAAI,EAAE,EAAE;gBACzD,MAAM,EAAE,eAAe,WAAW,CAAC,SAAS,EAAE;gBAC9C,UAAU,EAAE,GAAG;gBACf,UAAU,EAAE,IAAI;aACjB,CAAC,CAAC;QACL,CAAC;QAED,+CAA+C;QAC/C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAoB,CAAC;QAChD,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;YAC5B,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;gBACnC,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;gBAC9C,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACpB,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;QAED,KAAK,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;YACrD,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBACxB,MAAM,YAAY,CAAC,WAAW,EAAE;oBAC9B,IAAI,EAAE,UAAU;oBAChB,OAAO,EAAE,WAAW,WAAW,CAAC,SAAS,cAAc,OAAO,CAAC,MAAM,sBAAsB,KAAK,GAAG;oBACnG,OAAO,EAAE,mCAAmC,WAAW,CAAC,SAAS,EAAE;oBACnE,MAAM,EAAE,QAAQ;oBAChB,QAAQ,EAAE,OAAO;iBAClB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,gCAAgC;IAClC,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,WAAmB,EAAE,OAAiB;IAC7E,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,EAAE,WAAW,EAAE,GAAG,MAAM,MAAM,CAAC,2BAA2B,CAAC,CAAC;IAClE,MAAM,QAAQ,GAAG,MAAM,WAAW,CAAC,WAAW,CAAC,CAAC;IAChD,IAAI,CAAC;QACH,OAAO,MAAM,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IAC3C,CAAC;YAAS,CAAC;QACT,MAAM,QAAQ,CAAC,KAAK,EAAE,CAAC;IACzB,CAAC;AACH,CAAC"}

package/dist/memory/brain-embedding.js

@@ -0,0 +1,49 @@
+/**
+ * Brain Embedding System
+ *
+ * Provides text-to-vector embedding for semantic search in brain.db.
+ * Uses a pluggable provider interface — real model integration
+ * (e.g. @huggingface/transformers with all-MiniLM-L6-v2) is separate
+ * from the embedding pipeline. When no provider is set, the system
+ * falls back to FTS5-only search gracefully.
+ *
+ * @epic T5149
+ * @task T5386
+ */
+/** Matches the brain_embeddings vec0 table: FLOAT[384]. */
+export const EMBEDDING_DIMENSIONS = 384;
+let currentProvider = null;
+/**
+ * Register an embedding provider for the brain system.
+ * Validates that the provider's dimensions match the vec0 table.
+ *
+ * @throws Error if provider dimensions do not match EMBEDDING_DIMENSIONS
+ */
+export function setEmbeddingProvider(provider) {
+    if (provider.dimensions !== EMBEDDING_DIMENSIONS) {
+        throw new Error(`Embedding provider dimensions (${provider.dimensions}) do not match vec0 table (${EMBEDDING_DIMENSIONS})`);
+    }
+    currentProvider = provider;
+}
+/** Get the currently registered embedding provider, or null. */
+export function getEmbeddingProvider() {
+    return currentProvider;
+}
+/** Clear the current embedding provider (useful for testing). */
+export function clearEmbeddingProvider() {
+    currentProvider = null;
+}
+/**
+ * Embed text into a float vector using the registered provider.
+ * Returns null when no provider is set or not available (FTS5-only fallback).
+ */
+export async function embedText(text) {
+    if (!currentProvider || !currentProvider.isAvailable())
+        return null;
+    return currentProvider.embed(text);
+}
+/** Check whether embedding is currently available. */
+export function isEmbeddingAvailable() {
+    return currentProvider?.isAvailable() ?? false;
+}
+//# sourceMappingURL=brain-embedding.js.map

package/dist/memory/brain-embedding.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"brain-embedding.js","sourceRoot":"","sources":["../../src/memory/brain-embedding.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAYH,2DAA2D;AAC3D,MAAM,CAAC,MAAM,oBAAoB,GAAG,GAAG,CAAC;AAExC,IAAI,eAAe,GAA6B,IAAI,CAAC;AAErD;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAC,QAA2B;IAC9D,IAAI,QAAQ,CAAC,UAAU,KAAK,oBAAoB,EAAE,CAAC;QACjD,MAAM,IAAI,KAAK,CACb,kCAAkC,QAAQ,CAAC,UAAU,8BAA8B,oBAAoB,GAAG,CAC3G,CAAC;IACJ,CAAC;IACD,eAAe,GAAG,QAAQ,CAAC;AAC7B,CAAC;AAED,gEAAgE;AAChE,MAAM,UAAU,oBAAoB;IAClC,OAAO,eAAe,CAAC;AACzB,CAAC;AAED,iEAAiE;AACjE,MAAM,UAAU,sBAAsB;IACpC,eAAe,GAAG,IAAI,CAAC;AACzB,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,IAAY;IAC1C,IAAI,CAAC,eAAe,IAAI,CAAC,eAAe,CAAC,WAAW,EAAE;QAAE,OAAO,IAAI,CAAC;IACpE,OAAO,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;AACrC,CAAC;AAED,sDAAsD;AACtD,MAAM,UAAU,oBAAoB;IAClC,OAAO,eAAe,EAAE,WAAW,EAAE,IAAI,KAAK,CAAC;AACjD,CAAC"}

package/dist/memory/brain-lifecycle.js

@@ -0,0 +1,298 @@
+/**
+ * BRAIN lifecycle operations — temporal decay and memory consolidation.
+ *
+ * Reduces confidence of stale learnings based on age, following an
+ * exponential decay model: new_confidence = confidence * (decayRate ^ daysSinceUpdate).
+ *
+ * Consolidation groups old observations by keyword overlap and merges
+ * clusters into summary observations, archiving the originals.
+ *
+ * @task T5394 T5395
+ * @epic T5149
+ */
+import { createHash } from 'node:crypto';
+import { getBrainAccessor } from '../store/brain-accessor.js';
+import { typedAll } from '../store/typed-query.js';
+/**
+ * Apply temporal decay to brain_learnings confidence values.
+ *
+ * Entries older than `olderThanDays` have their confidence reduced
+ * by an exponential decay factor based on the number of days since
+ * their last update (or creation if never updated).
+ *
+ * Formula: new_confidence = confidence * (decayRate ^ daysSinceUpdate)
+ *
+ * @param projectRoot - Project root directory for brain.db resolution
+ * @param options - Decay configuration
+ * @returns Count of updated rows and tables processed
+ */
+export async function applyTemporalDecay(projectRoot, options) {
+    const decayRate = options?.decayRate ?? 0.995;
+    const olderThanDays = options?.olderThanDays ?? 30;
+    // Ensure brain.db is initialized
+    const { getBrainDb, getBrainNativeDb } = await import('../store/brain-sqlite.js');
+    await getBrainDb(projectRoot);
+    const nativeDb = getBrainNativeDb();
+    if (!nativeDb) {
+        return { updated: 0, tablesProcessed: [] };
+    }
+    // Calculate the cutoff date
+    const cutoffDate = new Date(Date.now() - olderThanDays * 24 * 60 * 60 * 1000)
+        .toISOString()
+        .replace('T', ' ')
+        .slice(0, 19);
+    // Update learnings: reduce confidence based on age since last update (or creation).
+    // SQLite's julianday function computes the difference in days.
+    // We use COALESCE to prefer updated_at over created_at for the age calculation.
+    const stmt = nativeDb.prepare(`
+    UPDATE brain_learnings
+    SET confidence = confidence * POWER(?, julianday('now') - julianday(COALESCE(updated_at, created_at))),
+        updated_at = datetime('now')
+    WHERE COALESCE(updated_at, created_at) < ?
+      AND confidence > 0.01
+  `);
+    const result = stmt.run(decayRate, cutoffDate);
+    const updated = typeof result.changes === 'number' ? result.changes : 0;
+    return {
+        updated,
+        tablesProcessed: ['brain_learnings'],
+    };
+}
+/** Stop words excluded from keyword extraction. */
+const STOP_WORDS = new Set([
+    'the',
+    'a',
+    'an',
+    'is',
+    'are',
+    'was',
+    'were',
+    'be',
+    'been',
+    'being',
+    'have',
+    'has',
+    'had',
+    'do',
+    'does',
+    'did',
+    'will',
+    'would',
+    'could',
+    'should',
+    'may',
+    'might',
+    'shall',
+    'can',
+    'need',
+    'dare',
+    'ought',
+    'used',
+    'to',
+    'of',
+    'in',
+    'for',
+    'on',
+    'with',
+    'at',
+    'by',
+    'from',
+    'as',
+    'into',
+    'through',
+    'during',
+    'before',
+    'after',
+    'above',
+    'below',
+    'between',
+    'out',
+    'off',
+    'over',
+    'under',
+    'again',
+    'further',
+    'then',
+    'once',
+    'and',
+    'but',
+    'or',
+    'nor',
+    'not',
+    'so',
+    'yet',
+    'both',
+    'either',
+    'neither',
+    'each',
+    'every',
+    'all',
+    'any',
+    'few',
+    'more',
+    'most',
+    'other',
+    'some',
+    'such',
+    'no',
+    'only',
+    'own',
+    'same',
+    'than',
+    'too',
+    'very',
+    'just',
+    'because',
+    'until',
+    'while',
+    'about',
+    'against',
+    'this',
+    'that',
+    'these',
+    'those',
+    'it',
+    'its',
+]);
+/**
+ * Extract significant keywords from text for grouping.
+ * Filters stop words and short tokens, returns lowercase words.
+ */
+function extractKeywords(text) {
+    const words = text
+        .toLowerCase()
+        .replace(/[^a-z0-9\s-]/g, '')
+        .split(/\s+/);
+    const keywords = new Set();
+    for (const w of words) {
+        if (w.length >= 4 && !STOP_WORDS.has(w)) {
+            keywords.add(w);
+        }
+    }
+    return keywords;
+}
+/**
+ * Calculate keyword overlap ratio between two sets.
+ * Returns the Jaccard similarity coefficient.
+ */
+function keywordOverlap(a, b) {
+    if (a.size === 0 || b.size === 0)
+        return 0;
+    let intersection = 0;
+    for (const w of a) {
+        if (b.has(w))
+            intersection++;
+    }
+    const union = a.size + b.size - intersection;
+    return union > 0 ? intersection / union : 0;
+}
+/**
+ * Consolidate old observations by keyword similarity.
+ *
+ * Groups observations older than `olderThanDays` by FTS5 keyword overlap.
+ * For groups with at least `minClusterSize` entries, creates one summary
+ * observation and marks originals as archived (updated_at set, narrative
+ * prefixed with [ARCHIVED]).
+ *
+ * @param projectRoot - Project root directory for brain.db resolution
+ * @param options - Consolidation configuration
+ * @returns Counts of grouped, merged, and archived observations
+ */
+export async function consolidateMemories(projectRoot, options) {
+    const olderThanDays = options?.olderThanDays ?? 90;
+    const minClusterSize = options?.minClusterSize ?? 3;
+    const { getBrainDb, getBrainNativeDb } = await import('../store/brain-sqlite.js');
+    await getBrainDb(projectRoot);
+    const nativeDb = getBrainNativeDb();
+    if (!nativeDb) {
+        return { grouped: 0, merged: 0, archived: 0 };
+    }
+    const cutoffDate = new Date(Date.now() - olderThanDays * 24 * 60 * 60 * 1000)
+        .toISOString()
+        .replace('T', ' ')
+        .slice(0, 19);
+    // Fetch old observations that are not already archived
+    const stmt = nativeDb.prepare(`
+    SELECT id, type, title, narrative, project, created_at
+    FROM brain_observations
+    WHERE created_at < ?
+      AND narrative NOT LIKE '[ARCHIVED]%'
+    ORDER BY created_at DESC
+  `);
+    const oldObservations = typedAll(stmt, cutoffDate);
+    if (oldObservations.length < minClusterSize) {
+        return { grouped: 0, merged: 0, archived: 0 };
+    }
+    // Extract keywords for each observation
+    const entries = oldObservations.map((obs) => ({
+        ...obs,
+        keywords: extractKeywords(`${obs.title} ${obs.narrative ?? ''}`),
+        clustered: false,
+    }));
+    // Greedy clustering: group by keyword overlap >= 0.3
+    const clusters = [];
+    const overlapThreshold = 0.3;
+    for (let i = 0; i < entries.length; i++) {
+        if (entries[i].clustered)
+            continue;
+        const cluster = [entries[i]];
+        entries[i].clustered = true;
+        for (let j = i + 1; j < entries.length; j++) {
+            if (entries[j].clustered)
+                continue;
+            if (entries[i].type !== entries[j].type)
+                continue;
+            const overlap = keywordOverlap(entries[i].keywords, entries[j].keywords);
+            if (overlap >= overlapThreshold) {
+                cluster.push(entries[j]);
+                entries[j].clustered = true;
+            }
+        }
+        if (cluster.length >= minClusterSize) {
+            clusters.push(cluster);
+        }
+    }
+    let grouped = 0;
+    let merged = 0;
+    let archived = 0;
+    const accessor = await getBrainAccessor(projectRoot);
+    const now = new Date().toISOString().replace('T', ' ').slice(0, 19);
+    for (const cluster of clusters) {
+        grouped += cluster.length;
+        // Create summary observation from cluster
+        const titles = cluster.map((c) => c.title).join('; ');
+        const summaryTitle = `Consolidated: ${cluster[0].type} observations (${cluster.length} entries)`;
+        const summaryNarrative = `Merged from ${cluster.length} observations: ${titles.slice(0, 500)}`;
+        const contentHash = createHash('sha256')
+            .update(summaryTitle + summaryNarrative)
+            .digest('hex')
+            .slice(0, 16);
+        const id = `O-${Date.now().toString(36)}`;
+        await accessor.addObservation({
+            id,
+            type: cluster[0]
+                .type,
+            title: summaryTitle,
+            narrative: summaryNarrative,
+            contentHash,
+            project: cluster[0].project ?? null,
+            sourceType: 'agent',
+            createdAt: now,
+        });
+        merged++;
+        // Archive originals by prefixing narrative
+        for (const obs of cluster) {
+            nativeDb
+                .prepare(`
+        UPDATE brain_observations
+        SET narrative = '[ARCHIVED] ' || COALESCE(narrative, ''),
+            updated_at = ?
+        WHERE id = ?
+      `)
+                .run(now, obs.id);
+            archived++;
+        }
+    }
+    return { grouped, merged, archived };
+}
+//# sourceMappingURL=brain-lifecycle.js.map

package/dist/memory/brain-lifecycle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"brain-lifecycle.js","sourceRoot":"","sources":["../../src/memory/brain-lifecycle.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAC9D,OAAO,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AASnD;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,WAAmB,EACnB,OAAwD;IAExD,MAAM,SAAS,GAAG,OAAO,EAAE,SAAS,IAAI,KAAK,CAAC;IAC9C,MAAM,aAAa,GAAG,OAAO,EAAE,aAAa,IAAI,EAAE,CAAC;IAEnD,iCAAiC;IACjC,MAAM,EAAE,UAAU,EAAE,gBAAgB,EAAE,GAAG,MAAM,MAAM,CAAC,0BAA0B,CAAC,CAAC;IAClF,MAAM,UAAU,CAAC,WAAW,CAAC,CAAC;IAC9B,MAAM,QAAQ,GAAG,gBAAgB,EAAE,CAAC;IAEpC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,eAAe,EAAE,EAAE,EAAE,CAAC;IAC7C,CAAC;IAED,4BAA4B;IAC5B,MAAM,UAAU,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,aAAa,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;SAC1E,WAAW,EAAE;SACb,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC;SACjB,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAEhB,oFAAoF;IACpF,+DAA+D;IAC/D,gFAAgF;IAChF,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC;;;;;;GAM7B,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;IAC/C,MAAM,OAAO,GAAG,OAAO,MAAM,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAExE,OAAO;QACL,OAAO;QACP,eAAe,EAAE,CAAC,iBAAiB,CAAC;KACrC,CAAC;AACJ,CAAC;AAaD,mDAAmD;AACnD,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;IACzB,KAAK;IACL,GAAG;IACH,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,KAAK;IACL,MAAM;IACN,IAAI;IACJ,MAAM;IACN,OAAO;IACP,MAAM;IACN,KAAK;IACL,KAAK;IACL,IAAI;IACJ,MAAM;IACN,KAAK;IACL,MAAM;IACN,OAAO;IACP,OAAO;IACP,QAAQ;IACR,KAAK;IACL,OAAO;IACP,OAAO;IACP,KAAK;IACL,MAAM;IACN,MAAM;IACN,OAAO;IACP,MAAM;IACN,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,MAAM;IACN,IAAI;IACJ,IAAI;IACJ,MAAM;IACN,IAAI;IACJ,MAAM;IACN,SAAS;IACT,QAAQ;IACR,QAAQ;IACR,OAAO;IACP,OAAO;IACP,OAAO;IACP,SAAS;IACT,KAAK;IACL,KAAK;IACL,MAAM;IACN,OAAO;IACP,OAAO;IACP,SAAS;IACT,MAAM;IACN,MAAM;IACN,KAAK;IACL,KAAK;IACL,IAAI;IACJ,KAAK;IACL,KAAK;IACL,IAAI;IACJ,KAAK;IACL,MAAM;IACN,QAAQ;IACR,SAAS;IACT,MAAM;IACN,OAAO;IACP,KAAK;IACL,KAAK;IACL,KAAK;IACL,MAAM;IACN,MAAM;IACN,OAAO;IACP,MAAM;IACN,MAAM;IACN,IAAI;IACJ,MAAM;IACN,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;IACT,OAAO;IACP,OAAO;IACP,OAAO;IACP,SAAS;IACT,MAAM;IACN,MAAM;IACN,OAAO;IACP,OAAO;IACP,IAAI;IACJ,KAAK;CACN,CAAC,CAAC;AAEH;;;GAGG;AACH,SAAS,eAAe,CAAC,IAAY;IACnC,MAAM,KAAK,GAAG,IAAI;SACf,WAAW,EAAE;SACb,OAAO,CAAC,eAAe,EAAE,EAAE,CAAC;SAC5B,KAAK,CAAC,KAAK,CAAC,CAAC;IAChB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACxC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CAAC,CAAc,EAAE,CAAc;IACpD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QAClB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,YAAY,EAAE,CAAC;IAC/B,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,YAAY,CAAC;IAC7C,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAC9C,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,WAAmB,EACnB,OAA6D;IAE7D,MAAM,aAAa,GAAG,OAAO,EAAE,aAAa,IAAI,EAAE,CAAC;IACnD,MAAM,cAAc,GAAG,OAAO,EAAE,cAAc,IAAI,CAAC,CAAC;IAEpD,MAAM,EAAE,UAAU,EAAE,gBAAgB,EAAE,GAAG,MAAM,MAAM,CAAC,0BAA0B,CAAC,CAAC;IAClF,MAAM,UAAU,CAAC,WAAW,CAAC,CAAC;IAC9B,MAAM,QAAQ,GAAG,gBAAgB,EAAE,CAAC;IAEpC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;IAChD,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,aAAa,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;SAC1E,WAAW,EAAE;SACb,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC;SACjB,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAEhB,uDAAuD;IACvD,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC;;;;;;GAM7B,CAAC,CAAC;IACH,MAAM,eAAe,GAAG,QAAQ,CAAmC,IAAI,EAAE,UAAU,CAAC,CAAC;IAErF,IAAI,eAAe,CAAC,MAAM,GAAG,cAAc,EAAE,CAAC;QAC5C,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;IAChD,CAAC;IAED,wCAAwC;IACxC,MAAM,OAAO,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAC5C,GAAG,GAAG;QACN,QAAQ,EAAE,eAAe,CAAC,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;QAChE,SAAS,EAAE,KAAK;KACjB,CAAC,CAAC,CAAC;IAEJ,qDAAqD;IACrD,MAAM,QAAQ,GAA0B,EAAE,CAAC;IAC3C,MAAM,gBAAgB,GAAG,GAAG,CAAC;IAE7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,IAAI,OAAO,CAAC,CAAC,CAAE,CAAC,SAAS;YAAE,SAAS;QAEpC,MAAM,OAAO,GAAG,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC;QAC9B,OAAO,CAAC,CAAC,CAAE,CAAC,SAAS,GAAG,IAAI,CAAC;QAE7B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,IAAI,OAAO,CAAC,CAAC,CAAE,CAAC,SAAS;gBAAE,SAAS;YACpC,IAAI,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI;gBAAE,SAAS;YAEpD,MAAM,OAAO,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC;YAC3E,IAAI,OAAO,IAAI,gBAAgB,EAAE,CAAC;gBAChC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC;gBAC1B,OAAO,CAAC,CAAC,CAAE,CAAC,SAAS,GAAG,IAAI,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,IAAI,OAAO,CAAC,MAAM,IAAI,cAAc,EAAE,CAAC;YACrC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IAED,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAAC,WAAW,CAAC,CAAC;IACrD,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAEpE,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,OAAO,IAAI,OAAO,CAAC,MAAM,CAAC;QAE1B,0CAA0C;QAC1C,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtD,MAAM,YAAY,GAAG,iBAAiB,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,kBAAkB,OAAO,CAAC,MAAM,WAAW,CAAC;QAClG,MAAM,gBAAgB,GAAG,eAAe,OAAO,CAAC,MAAM,kBAAkB,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;QAC/F,MAAM,WAAW,GAAG,UAAU,CAAC,QAAQ,CAAC;aACrC,MAAM,CAAC,YAAY,GAAG,gBAAgB,CAAC;aACvC,MAAM,CAAC,KAAK,CAAC;aACb,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAChB,MAAM,EAAE,GAAG,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;QAE1C,MAAM,QAAQ,CAAC,cAAc,CAAC;YAC5B,EAAE;YACF,IAAI,EAAE,OAAO,CAAC,CAAC,CAAE;iBACd,IAAiF;YACpF,KAAK,EAAE,YAAY;YACnB,SAAS,EAAE,gBAAgB;YAC3B,WAAW;YACX,OAAO,EAAE,OAAO,CAAC,CAAC,CAAE,CAAC,OAAO,IAAI,IAAI;YACpC,UAAU,EAAE,OAAO;YACnB,SAAS,EAAE,GAAG;SACf,CAAC,CAAC;QACH,MAAM,EAAE,CAAC;QAET,2CAA2C;QAC3C,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,QAAQ;iBACL,OAAO,CAAC;;;;;OAKV,CAAC;iBACC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YACpB,QAAQ,EAAE,CAAC;QACb,CAAC;IACH,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;AACvC,CAAC"}

package/dist/memory/brain-links.js

@@ -0,0 +1,148 @@
+/**
+ * Cross-reference management between BRAIN memory entries and tasks.
+ *
+ * Provides linking/unlinking and query functions for relationships
+ * between decisions, patterns, learnings and CLEO tasks.
+ *
+ * @task T5156
+ * @epic T5149
+ */
+import { getBrainAccessor } from '../store/brain-accessor.js';
+/**
+ * Link a memory entry to a task.
+ *
+ * @task T5156
+ */
+export async function linkMemoryToTask(projectRoot, memoryType, memoryId, taskId, linkType) {
+    if (!memoryId || !taskId) {
+        throw new Error('memoryId and taskId are required');
+    }
+    const accessor = await getBrainAccessor(projectRoot);
+    // Check if link already exists
+    const existingLinks = await accessor.getLinksForMemory(memoryType, memoryId);
+    const duplicate = existingLinks.find((l) => l.taskId === taskId && l.linkType === linkType);
+    if (duplicate) {
+        return duplicate;
+    }
+    await accessor.addLink({
+        memoryType,
+        memoryId,
+        taskId,
+        linkType,
+    });
+    // Return the created link
+    const links = await accessor.getLinksForMemory(memoryType, memoryId);
+    return links.find((l) => l.taskId === taskId && l.linkType === linkType);
+}
+/**
+ * Remove a link between a memory entry and a task.
+ *
+ * @task T5156
+ */
+export async function unlinkMemoryFromTask(projectRoot, memoryType, memoryId, taskId, linkType) {
+    const accessor = await getBrainAccessor(projectRoot);
+    await accessor.removeLink(memoryType, memoryId, taskId, linkType);
+}
+/**
+ * Get all memory entries linked to a specific task.
+ *
+ * @task T5156
+ */
+export async function getTaskLinks(projectRoot, taskId) {
+    const accessor = await getBrainAccessor(projectRoot);
+    return accessor.getLinksForTask(taskId);
+}
+/**
+ * Get all tasks linked to a specific memory entry.
+ *
+ * @task T5156
+ */
+export async function getMemoryLinks(projectRoot, memoryType, memoryId) {
+    const accessor = await getBrainAccessor(projectRoot);
+    return accessor.getLinksForMemory(memoryType, memoryId);
+}
+/**
+ * Batch create multiple links at once.
+ *
+ * @task T5156
+ */
+export async function bulkLink(projectRoot, links) {
+    const accessor = await getBrainAccessor(projectRoot);
+    let created = 0;
+    let skipped = 0;
+    for (const link of links) {
+        // Check for duplicate
+        const existing = await accessor.getLinksForMemory(link.memoryType, link.memoryId);
+        const duplicate = existing.find((l) => l.taskId === link.taskId && l.linkType === link.linkType);
+        if (duplicate) {
+            skipped++;
+            continue;
+        }
+        await accessor.addLink({
+            memoryType: link.memoryType,
+            memoryId: link.memoryId,
+            taskId: link.taskId,
+            linkType: link.linkType,
+        });
+        created++;
+    }
+    return { created, skipped };
+}
+/**
+ * Get all decisions linked to a task.
+ * Convenience method that fetches full decision rows.
+ *
+ * @task T5156
+ */
+export async function getLinkedDecisions(projectRoot, taskId) {
+    const accessor = await getBrainAccessor(projectRoot);
+    const links = await accessor.getLinksForTask(taskId);
+    const decisionLinks = links.filter((l) => l.memoryType === 'decision');
+    const decisions = [];
+    for (const link of decisionLinks) {
+        const decision = await accessor.getDecision(link.memoryId);
+        if (decision) {
+            decisions.push(decision);
+        }
+    }
+    return decisions;
+}
+/**
+ * Get all patterns linked to a task.
+ * Convenience method that fetches full pattern rows.
+ *
+ * @task T5156
+ */
+export async function getLinkedPatterns(projectRoot, taskId) {
+    const accessor = await getBrainAccessor(projectRoot);
+    const links = await accessor.getLinksForTask(taskId);
+    const patternLinks = links.filter((l) => l.memoryType === 'pattern');
+    const patterns = [];
+    for (const link of patternLinks) {
+        const pattern = await accessor.getPattern(link.memoryId);
+        if (pattern) {
+            patterns.push(pattern);
+        }
+    }
+    return patterns;
+}
+/**
+ * Get all learnings linked to a task.
+ * Convenience method that fetches full learning rows.
+ *
+ * @task T5156
+ */
+export async function getLinkedLearnings(projectRoot, taskId) {
+    const accessor = await getBrainAccessor(projectRoot);
+    const links = await accessor.getLinksForTask(taskId);
+    const learningLinks = links.filter((l) => l.memoryType === 'learning');
+    const learnings = [];
+    for (const link of learningLinks) {
+        const learning = await accessor.getLearning(link.memoryId);
+        if (learning) {
+            learnings.push(learning);
+        }
+    }
+    return learnings;
+}
+//# sourceMappingURL=brain-links.js.map

package/dist/memory/brain-links.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"brain-links.js","sourceRoot":"","sources":["../../src/memory/brain-links.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAqB9D;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,WAAmB,EACnB,UAAsB,EACtB,QAAgB,EAChB,MAAc,EACd,QAAkB;IAElB,IAAI,CAAC,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;IACtD,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAAC,WAAW,CAAC,CAAC;IAErD,+BAA+B;IAC/B,MAAM,aAAa,GAAG,MAAM,QAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;IAC7E,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC;IAE5F,IAAI,SAAS,EAAE,CAAC;QACd,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,QAAQ,CAAC,OAAO,CAAC;QACrB,UAAU;QACV,QAAQ;QACR,MAAM;QACN,QAAQ;KACT,CAAC,CAAC;IAEH,0BAA0B;IAC1B,MAAM,KAAK,GAAG,MAAM,QAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;IACrE,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAE,CAAC;AAC5E,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,WAAmB,EACnB,UAAsB,EACtB,QAAgB,EAChB,MAAc,EACd,QAAkB;IAElB,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAAC,WAAW,CAAC,CAAC;IACrD,MAAM,QAAQ,CAAC,UAAU,CAAC,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;AACpE,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,WAAmB,EACnB,MAAc;IAEd,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAAC,WAAW,CAAC,CAAC;IACrD,OAAO,QAAQ,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;AAC1C,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,WAAmB,EACnB,UAAsB,EACtB,QAAgB;IAEhB,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAAC,WAAW,CAAC,CAAC;IACrD,OAAO,QAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;AAC1D,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,QAAQ,CAC5B,WAAmB,EACnB,KAAsB;IAEtB,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAAC,WAAW,CAAC,CAAC;IACrD,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,sBAAsB;QACtB,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAClF,MAAM,SAAS,GAAG,QAAQ,CAAC,IAAI,CAC7B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,CAChE,CAAC;QAEF,IAAI,SAAS,EAAE,CAAC;YACd,OAAO,EAAE,CAAC;YACV,SAAS;QACX,CAAC;QAED,MAAM,QAAQ,CAAC,OAAO,CAAC;YACrB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,QAAQ,EAAE,IAAI,CAAC,QAAQ;SACxB,CAAC,CAAC;QACH,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;AAC9B,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,WAAmB,EACnB,MAAc;IAEd,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAAC,WAAW,CAAC,CAAC;IACrD,MAAM,KAAK,GAAG,MAAM,QAAQ,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;IACrD,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,UAAU,CAAC,CAAC;IAEvE,MAAM,SAAS,GAAuB,EAAE,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC3D,IAAI,QAAQ,EAAE,CAAC;YACb,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,WAAmB,EACnB,MAAc;IAEd,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAAC,WAAW,CAAC,CAAC;IACrD,MAAM,KAAK,GAAG,MAAM,QAAQ,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;IACrD,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC;IAErE,MAAM,QAAQ,GAAsB,EAAE,CAAC;IACvC,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzD,IAAI,OAAO,EAAE,CAAC;YACZ,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,WAAmB,EACnB,MAAc;IAEd,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAAC,WAAW,CAAC,CAAC;IACrD,MAAM,KAAK,GAAG,MAAM,QAAQ,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;IACrD,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,UAAU,CAAC,CAAC;IAEvE,MAAM,SAAS,GAAuB,EAAE,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC3D,IAAI,QAAQ,EAAE,CAAC;YACb,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC"}