@monoes/memory 1.0.0

package/dist/learning-bridge.js

@@ -0,0 +1,522 @@
+/**
+ * LearningBridge - Connects AutoMemoryBridge to NeuralLearningSystem
+ *
+ * When insights are recorded via AutoMemoryBridge, this module triggers
+ * neural learning trajectories so the system continuously improves from
+ * its own discoveries. The NeuralLearningSystem dependency is optional:
+ * when unavailable, all operations degrade gracefully to no-ops.
+ *
+ * @module @monomind/memory/learning-bridge
+ */
+import { EventEmitter } from 'node:events';
+const DEFAULT_CONFIG = {
+    sonaMode: 'balanced',
+    confidenceDecayRate: 0.005,
+    accessBoostAmount: 0.03,
+    maxConfidence: 1.0,
+    minConfidence: 0.1,
+    ewcLambda: 2000,
+    consolidationThreshold: 5,
+    enabled: true,
+};
+const MS_PER_HOUR = 3_600_000;
+// ===== LearningBridge =====
+/**
+ * Connects AutoMemoryBridge insights to the NeuralLearningSystem.
+ *
+ * @example
+ * ```typescript
+ * const bridge = new LearningBridge(memoryBackend);
+ * await bridge.onInsightRecorded(insight, entryId);
+ * await bridge.onInsightAccessed(entryId);
+ * const result = await bridge.consolidate();
+ * ```
+ */
+export class LearningBridge extends EventEmitter {
+    neural = null;
+    backend;
+    config;
+    activeTrajectories = new Map();
+    stats = {
+        totalTrajectories: 0,
+        completedTrajectories: 0,
+        totalConsolidations: 0,
+        totalDecays: 0,
+        confidenceBoosts: 0,
+        totalBoostAmount: 0,
+    };
+    destroyed = false;
+    neuralInitPromise = null;
+    backfillInProgress = false;
+    constructor(backend, config) {
+        super();
+        this.backend = backend;
+        this.config = { ...DEFAULT_CONFIG, ...config };
+    }
+    // ===== Public API =====
+    /**
+     * Notify the bridge that an insight has been recorded in AgentDB.
+     * Creates a learning trajectory so the neural system can track the
+     * insight's lifecycle.
+     */
+    async onInsightRecorded(insight, entryId) {
+        if (!this.config.enabled || this.destroyed)
+            return;
+        await this.initNeural();
+        if (this.neural) {
+            try {
+                const trajectoryId = this.neural.beginTask(insight.summary, 'general');
+                this.activeTrajectories.set(entryId, trajectoryId);
+                this.stats.totalTrajectories++;
+                // V1: use real embeddings from the memory bridge rather than hash noise
+                const embedding = await this.createEmbedding(insight.summary);
+                this.neural.recordStep(trajectoryId, `record:${insight.category}`, insight.confidence, embedding);
+            }
+            catch {
+                // Neural system failure is non-fatal
+            }
+        }
+        this.emit('insight:learning-started', { entryId, category: insight.category });
+    }
+    /**
+     * Notify the bridge that an insight entry was accessed.
+     * Boosts confidence in the backend and records a step in the
+     * trajectory if one exists.
+     */
+    async onInsightAccessed(entryId) {
+        if (!this.config.enabled || this.destroyed)
+            return;
+        const entry = await this.backend.get(entryId);
+        if (!entry)
+            return;
+        const currentConf = entry.metadata?.confidence ?? 0.5;
+        const newConf = Math.min(this.config.maxConfidence, currentConf + this.config.accessBoostAmount);
+        await this.backend.update(entryId, {
+            metadata: { ...entry.metadata, confidence: newConf },
+        });
+        this.stats.confidenceBoosts++;
+        this.stats.totalBoostAmount += this.config.accessBoostAmount;
+        if (this.neural && this.activeTrajectories.has(entryId)) {
+            try {
+                const trajectoryId = this.activeTrajectories.get(entryId);
+                const accessEmbedding = await this.createEmbedding(`access:${entryId}`);
+                this.neural.recordStep(trajectoryId, 'access', this.config.accessBoostAmount, accessEmbedding);
+            }
+            catch {
+                // Non-fatal
+            }
+        }
+        this.emit('insight:accessed', { entryId, newConfidence: newConf });
+    }
+    /**
+     * Consolidate active trajectories by completing them in the neural system.
+     * Only runs when there are enough active trajectories to justify the cost.
+     */
+    async consolidate() {
+        const startTime = Date.now();
+        const earlyResult = {
+            trajectoriesCompleted: 0,
+            patternsLearned: 0,
+            entriesUpdated: 0,
+            durationMs: 0,
+        };
+        if (!this.config.enabled || this.destroyed) {
+            return earlyResult;
+        }
+        if (!this.neural || this.activeTrajectories.size < this.config.consolidationThreshold) {
+            earlyResult.durationMs = Date.now() - startTime;
+            return earlyResult;
+        }
+        let completed = 0;
+        let patternsLearned = 0;
+        const toRemove = [];
+        const entries = Array.from(this.activeTrajectories.entries());
+        for (const [entryId, trajectoryId] of entries) {
+            try {
+                // V2: use the entry's stored confidence as quality rather than hardcoded 1.0
+                // so the reward signal actually reflects insight importance
+                let quality = 1.0;
+                try {
+                    const entry = await this.backend.get(entryId);
+                    const stored = entry?.metadata?.confidence ?? entry?.importanceScore;
+                    if (Number.isFinite(stored) && stored >= 0 && stored <= 1)
+                        quality = stored;
+                }
+                catch { /* use default */ }
+                await this.neural.completeTask(trajectoryId, quality);
+                completed++;
+                patternsLearned++;
+                toRemove.push(entryId);
+            }
+            catch {
+                // Skip failed completions
+            }
+        }
+        for (const key of toRemove) {
+            this.activeTrajectories.delete(key);
+        }
+        this.stats.completedTrajectories += completed;
+        this.stats.totalConsolidations++;
+        // Pipeline A→B bridge: flush PatternLearner patterns to patterns.json so
+        // intelligence.ts (the routing path) can find patterns learned by the neural
+        // package. This closes the loop between automatic session learning and routing.
+        if (completed > 0 && this.neural && typeof this.neural.getLearnedPatterns === 'function') {
+            void this.flushNeuralPatternsToFile().catch(() => { });
+        }
+        const result = {
+            trajectoriesCompleted: completed,
+            patternsLearned,
+            entriesUpdated: completed,
+            durationMs: Date.now() - startTime,
+        };
+        this.emit('consolidation:completed', result);
+        return result;
+    }
+    /**
+     * Apply time-based confidence decay to entries in the given namespace.
+     * Entries not accessed for more than one hour see their confidence reduced
+     * proportionally to the hours elapsed, down to minConfidence.
+     *
+     * @returns number of entries whose confidence was lowered
+     */
+    async decayConfidences(namespace) {
+        if (!this.config.enabled || this.destroyed)
+            return 0;
+        let entries;
+        try {
+            entries = await this.backend.query({
+                type: 'hybrid',
+                namespace,
+                limit: 1000,
+            });
+        }
+        catch {
+            return 0;
+        }
+        const now = Date.now();
+        let decayed = 0;
+        for (const entry of entries) {
+            const hoursSinceUpdate = (now - entry.updatedAt) / MS_PER_HOUR;
+            if (hoursSinceUpdate < 1)
+                continue;
+            const currentConf = entry.metadata?.confidence ?? 0.5;
+            // FOREVER forgetting curve: exponential decay weighted by importanceScore
+            // Source: https://arxiv.org/html/2601.03938v1
+            const importanceScore = (entry.importanceScore ?? entry.metadata?.importanceScore) ?? currentConf;
+            const newConf = Math.max(this.config.minConfidence, importanceScore * Math.exp(-this.config.confidenceDecayRate * hoursSinceUpdate));
+            if (newConf < currentConf) {
+                try {
+                    await this.backend.update(entry.id, {
+                        metadata: { ...entry.metadata, confidence: newConf },
+                    });
+                    decayed++;
+                }
+                catch {
+                    // Skip failed updates
+                }
+            }
+        }
+        this.stats.totalDecays += decayed;
+        return decayed;
+    }
+    /**
+     * Find patterns similar to the given content using the neural system.
+     * Returns an empty array when the neural system is unavailable.
+     */
+    async findSimilarPatterns(content, k = 5) {
+        if (!this.config.enabled || this.destroyed)
+            return [];
+        await this.initNeural();
+        if (!this.neural)
+            return [];
+        try {
+            const embedding = this.createHashEmbedding(content);
+            const results = await this.neural.findPatterns(embedding, k);
+            if (!Array.isArray(results))
+                return [];
+            return results.map((r) => ({
+                content: r.content ?? r.data ?? '',
+                similarity: r.similarity ?? r.score ?? 0,
+                category: r.category ?? 'unknown',
+                confidence: r.confidence ?? r.reward ?? 0,
+            }));
+        }
+        catch {
+            return [];
+        }
+    }
+    /** Return aggregated learning statistics */
+    getStats() {
+        const avgBoost = this.stats.confidenceBoosts > 0
+            ? this.stats.totalBoostAmount / this.stats.confidenceBoosts
+            : 0;
+        return {
+            totalTrajectories: this.stats.totalTrajectories,
+            completedTrajectories: this.stats.completedTrajectories,
+            activeTrajectories: this.activeTrajectories.size,
+            totalConsolidations: this.stats.totalConsolidations,
+            totalDecays: this.stats.totalDecays,
+            avgConfidenceBoost: avgBoost,
+            neuralAvailable: this.neural !== null,
+        };
+    }
+    /** Tear down the bridge. Subsequent method calls become no-ops. */
+    destroy() {
+        this.destroyed = true;
+        this.activeTrajectories.clear();
+        if (this.neural && typeof this.neural.cleanup === 'function') {
+            try {
+                this.neural.cleanup();
+            }
+            catch {
+                // Best-effort cleanup
+            }
+        }
+        this.neural = null;
+        this.neuralInitPromise = null;
+        this.removeAllListeners();
+    }
+    // ===== Private =====
+    /**
+     * Lazily attempt to load and initialize the NeuralLearningSystem.
+     * The promise is cached so that repeated calls do not re-attempt
+     * after a failure.
+     */
+    async initNeural() {
+        if (this.neural)
+            return;
+        if (this.neuralInitPromise) {
+            await this.neuralInitPromise;
+            return;
+        }
+        this.neuralInitPromise = this.loadNeural();
+        await this.neuralInitPromise;
+    }
+    async loadNeural() {
+        try {
+            if (this.config.neuralLoader) {
+                // Use injected loader (test / custom integrations)
+                this.neural = await this.config.neuralLoader();
+                return;
+            }
+            const mod = await import('@monomind/neural');
+            const NeuralLearningSystem = mod.NeuralLearningSystem ?? mod.default;
+            if (!NeuralLearningSystem)
+                return;
+            const instance = new NeuralLearningSystem(this.config.sonaMode);
+            if (typeof instance.initialize === 'function') {
+                await instance.initialize();
+            }
+            this.neural = instance;
+        }
+        catch {
+            // @monomind/neural not installed or failed to initialize.
+            // This is expected in many environments; degrade silently.
+            this.neural = null;
+        }
+    }
+    /**
+     * Write PatternLearner patterns to .monomind/neural/patterns.json so that
+     * intelligence.ts (Pipeline B) can find them via findSimilarPatterns / getAllPatterns.
+     * This is the Pipeline A→B bridge: automatic session learning → routing.
+     */
+    async flushNeuralPatternsToFile() {
+        const learnedRaw = this.neural.getLearnedPatterns?.() ?? [];
+        if (learnedRaw.length === 0)
+            return;
+        const { writeFileSync, mkdirSync, existsSync, readFileSync, renameSync } = await import('node:fs');
+        const { join } = await import('node:path');
+        const dir = join(process.cwd(), '.monomind', 'neural');
+        if (!existsSync(dir))
+            mkdirSync(dir, { recursive: true });
+        const patternsPath = join(dir, 'patterns.json');
+        let existing = [];
+        try {
+            const raw = readFileSync(patternsPath, 'utf-8');
+            const parsed = JSON.parse(raw);
+            if (Array.isArray(parsed))
+                existing = parsed;
+        }
+        catch { /* start fresh */ }
+        // Map PatternLearner domains to valid monomind agent type strings.
+        // Domain values ('code', 'reasoning', 'general', etc.) are not agent names;
+        // without this mapping every flushed pattern is rejected by the VALID_AGENT_TYPES
+        // filter in suggestAgentsFromIntelligence, making the A→B bridge a no-op.
+        const DOMAIN_TO_AGENT = {
+            code: 'coder',
+            coding: 'coder',
+            reasoning: 'researcher',
+            research: 'researcher',
+            testing: 'tester',
+            review: 'reviewer',
+            security: 'security-architect',
+            performance: 'performance-engineer',
+            architecture: 'architect',
+            creative: 'researcher',
+            math: 'researcher',
+            chat: 'coder',
+            general: 'coder',
+        };
+        const existingIds = new Set(existing.map(p => p['id']));
+        const now = Date.now();
+        const newEntries = learnedRaw
+            .filter(p => !existingIds.has(`neural:${p.id}`) && p.successRate >= 0.3)
+            .map(p => ({
+            id: `neural:${p.id}`,
+            type: DOMAIN_TO_AGENT[p.domain] ?? 'coder',
+            content: p.strategy,
+            confidence: p.successRate,
+            usageCount: p.usageCount,
+            embedding: [],
+            createdAt: now,
+            lastUsedAt: now,
+        }));
+        if (newEntries.length === 0)
+            return;
+        const merged = [...existing, ...newEntries];
+        const tmp = `${patternsPath}.${process.pid}.${now}.tmp`;
+        writeFileSync(tmp, JSON.stringify(merged, null, 2), 'utf-8');
+        renameSync(tmp, patternsPath);
+        void this.backfillEmbeddings(patternsPath).catch(() => { });
+    }
+    /**
+     * Background task: generate embeddings for patterns written with empty
+     * embedding arrays. Runs fire-and-forget after flushNeuralPatternsToFile.
+     * Non-fatal — any error is silently swallowed.
+     */
+    async backfillEmbeddings(patternsPath) {
+        if (this.backfillInProgress)
+            return;
+        this.backfillInProgress = true;
+        try {
+            const { readFileSync, writeFileSync, renameSync } = await import('node:fs');
+            const raw = readFileSync(patternsPath, 'utf-8');
+            const patterns = JSON.parse(raw);
+            if (!Array.isArray(patterns))
+                return;
+            let changed = false;
+            for (const entry of patterns) {
+                const emb = entry['embedding'];
+                if (Array.isArray(emb) && emb.length === 0) {
+                    const content = typeof entry['content'] === 'string' ? entry['content'] : '';
+                    const vec = await this.createEmbedding(content, 768);
+                    entry['embedding'] = Array.from(vec);
+                    changed = true;
+                }
+            }
+            if (!changed)
+                return;
+            // M1: re-read the file just before writing so a concurrent flush that ran
+            // during our embedding computation is not silently overwritten (lost-update).
+            // We merge: apply our computed embeddings onto the freshest on-disk snapshot.
+            let finalPatterns = patterns;
+            try {
+                const freshRaw = readFileSync(patternsPath, 'utf-8');
+                const freshPatterns = JSON.parse(freshRaw);
+                if (Array.isArray(freshPatterns)) {
+                    const embeddingById = new Map(patterns.map(p => [p['id'], p['embedding']]));
+                    finalPatterns = freshPatterns.map(p => {
+                        const backfilledEmb = embeddingById.get(p['id']);
+                        if (backfilledEmb && Array.isArray(backfilledEmb) && backfilledEmb.length > 0) {
+                            return { ...p, embedding: backfilledEmb };
+                        }
+                        return p;
+                    });
+                }
+            }
+            catch { /* use original patterns on re-read failure */ }
+            const now = Date.now();
+            const tmp = `${patternsPath}.backfill.${process.pid}.${now}.tmp`;
+            writeFileSync(tmp, JSON.stringify(finalPatterns, null, 2), 'utf-8');
+            renameSync(tmp, patternsPath);
+        }
+        catch {
+            // Non-fatal: backfill failure does not affect the flush result
+        }
+        finally {
+            this.backfillInProgress = false;
+        }
+    }
+    /**
+     * Generate a real semantic embedding via the memory bridge embedder,
+     * falling back to a deterministic hash embedding when unavailable.
+     * V1: using real embeddings is critical for meaningful LoRA weight updates.
+     */
+    async createEmbedding(text, dimensions = 768) {
+        // Prefer the injected embedder (CLI wires this in via LearningBridgeConfig.embedder)
+        // — no cross-package import needed, clean dependency boundary.
+        const embeddingSource = this.config.embedder;
+        if (embeddingSource) {
+            try {
+                const raw = await embeddingSource(text);
+                if (Array.isArray(raw) && raw.length > 0) {
+                    const arr = new Float32Array(dimensions);
+                    const copyLen = Math.min(raw.length, dimensions);
+                    for (let i = 0; i < copyLen; i++)
+                        arr[i] = raw[i];
+                    let norm = 0;
+                    for (let i = 0; i < dimensions; i++)
+                        norm += arr[i] * arr[i];
+                    norm = Math.sqrt(norm);
+                    if (norm > 0)
+                        for (let i = 0; i < dimensions; i++)
+                            arr[i] /= norm;
+                    return arr;
+                }
+            }
+            catch { /* fall through */ }
+        }
+        // Fallback: try @monomind/cli's memory-bridge when running inside the CLI process
+        try {
+            const bridge = await import('@monomind/cli/src/memory/memory-bridge.js')
+                .catch(() => null);
+            if (bridge?.bridgeGenerateEmbedding) {
+                const result = await bridge.bridgeGenerateEmbedding(text);
+                if (result?.embedding && Array.isArray(result.embedding) && result.embedding.length > 0) {
+                    const arr = new Float32Array(dimensions);
+                    const copyLen = Math.min(result.embedding.length, dimensions);
+                    for (let i = 0; i < copyLen; i++)
+                        arr[i] = result.embedding[i];
+                    let norm = 0;
+                    for (let i = 0; i < dimensions; i++)
+                        norm += arr[i] * arr[i];
+                    norm = Math.sqrt(norm);
+                    if (norm > 0)
+                        for (let i = 0; i < dimensions; i++)
+                            arr[i] /= norm;
+                    return arr;
+                }
+            }
+        }
+        catch { /* fall through to hash */ }
+        return this.createHashEmbedding(text, dimensions);
+    }
+    /**
+     * Deterministic hash-based embedding fallback.
+     * Used only when no real embedder is available.
+     */
+    createHashEmbedding(text, dimensions = 768) {
+        const embedding = new Float32Array(dimensions);
+        const normalized = text.toLowerCase().trim();
+        for (let i = 0; i < dimensions; i++) {
+            let hash = 0;
+            for (let j = 0; j < normalized.length; j++) {
+                hash = ((hash << 5) - hash + normalized.charCodeAt(j) * (i + 1)) | 0;
+            }
+            embedding[i] = (Math.sin(hash) + 1) / 2;
+        }
+        let norm = 0;
+        for (let i = 0; i < dimensions; i++) {
+            norm += embedding[i] * embedding[i];
+        }
+        norm = Math.sqrt(norm);
+        if (norm > 0) {
+            for (let i = 0; i < dimensions; i++) {
+                embedding[i] /= norm;
+            }
+        }
+        return embedding;
+    }
+}
+export default LearningBridge;
+//# sourceMappingURL=learning-bridge.js.map

package/dist/learning-bridge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"learning-bridge.js","sourceRoot":"","sources":["../src/learning-bridge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAgF3C,MAAM,cAAc,GAAmB;IACrC,QAAQ,EAAE,UAAU;IACpB,mBAAmB,EAAE,KAAK;IAC1B,iBAAiB,EAAE,IAAI;IACvB,aAAa,EAAE,GAAG;IAClB,aAAa,EAAE,GAAG;IAClB,SAAS,EAAE,IAAI;IACf,sBAAsB,EAAE,CAAC;IACzB,OAAO,EAAE,IAAI;CACd,CAAC;AAEF,MAAM,WAAW,GAAG,SAAS,CAAC;AAE9B,6BAA6B;AAE7B;;;;;;;;;;GAUG;AACH,MAAM,OAAO,cAAe,SAAQ,YAAY;IACtC,MAAM,GAAe,IAAI,CAAC;IAC1B,OAAO,CAAiB;IACxB,MAAM,CAAiB;IACvB,kBAAkB,GAAwB,IAAI,GAAG,EAAE,CAAC;IACpD,KAAK,GAAG;QACd,iBAAiB,EAAE,CAAC;QACpB,qBAAqB,EAAE,CAAC;QACxB,mBAAmB,EAAE,CAAC;QACtB,WAAW,EAAE,CAAC;QACd,gBAAgB,EAAE,CAAC;QACnB,gBAAgB,EAAE,CAAC;KACpB,CAAC;IACM,SAAS,GAAG,KAAK,CAAC;IAClB,iBAAiB,GAAyB,IAAI,CAAC;IAC/C,kBAAkB,GAAG,KAAK,CAAC;IAEnC,YAAY,OAAuB,EAAE,MAA6B;QAChE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IACjD,CAAC;IAED,yBAAyB;IAEzB;;;;OAIG;IACH,KAAK,CAAC,iBAAiB,CAAC,OAAsB,EAAE,OAAe;QAC7D,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,IAAI,CAAC,SAAS;YAAE,OAAO;QAEnD,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAExB,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,IAAI,CAAC;gBACH,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;gBACvE,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;gBACnD,IAAI,CAAC,KAAK,CAAC,iBAAiB,EAAE,CAAC;gBAE/B,wEAAwE;gBACxE,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;gBAC9D,IAAI,CAAC,MAAM,CAAC,UAAU,CACpB,YAAY,EACZ,UAAU,OAAO,CAAC,QAAQ,EAAE,EAC5B,OAAO,CAAC,UAAU,EAClB,SAAS,CACV,CAAC;YACJ,CAAC;YAAC,MAAM,CAAC;gBACP,qCAAqC;YACvC,CAAC;QACH,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,0BAA0B,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC;IACjF,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,iBAAiB,CAAC,OAAe;QACrC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,IAAI,CAAC,SAAS;YAAE,OAAO;QAEnD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC9C,IAAI,CAAC,KAAK;YAAE,OAAO;QAEnB,MAAM,WAAW,GAAI,KAAK,CAAC,QAAQ,EAAE,UAAqB,IAAI,GAAG,CAAC;QAClE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CACtB,IAAI,CAAC,MAAM,CAAC,aAAa,EACzB,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAC5C,CAAC;QAEF,MAAM,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE;YACjC,QAAQ,EAAE,EAAE,GAAG,KAAK,CAAC,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE;SACrD,CAAC,CAAC;QAEH,IAAI,CAAC,KAAK,CAAC,gBAAgB,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,gBAAgB,IAAI,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC;QAE7D,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YACxD,IAAI,CAAC;gBACH,MAAM,YAAY,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;gBAC3D,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,UAAU,OAAO,EAAE,CAAC,CAAC;gBACxE,IAAI,CAAC,MAAM,CAAC,UAAU,CACpB,YAAY,EACZ,QAAQ,EACR,IAAI,CAAC,MAAM,CAAC,iBAAiB,EAC7B,eAAe,CAChB,CAAC;YACJ,CAAC;YAAC,MAAM,CAAC;gBACP,YAAY;YACd,CAAC;QACH,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,kBAAkB,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC,CAAC;IACrE,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,WAAW;QACf,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,WAAW,GAAsB;YACrC,qBAAqB,EAAE,CAAC;YACxB,eAAe,EAAE,CAAC;YAClB,cAAc,EAAE,CAAC;YACjB,UAAU,EAAE,CAAC;SACd,CAAC;QAEF,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC3C,OAAO,WAAW,CAAC;QACrB,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,kBAAkB,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,sBAAsB,EAAE,CAAC;YACtF,WAAW,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YAChD,OAAO,WAAW,CAAC;QACrB,CAAC;QAED,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,CAAC,CAAC;QAC9D,KAAK,MAAM,CAAC,OAAO,EAAE,YAAY,CAAC,IAAI,OAAO,EAAE,CAAC;YAC9C,IAAI,CAAC;gBACH,6EAA6E;gBAC7E,4DAA4D;gBAC5D,IAAI,OAAO,GAAG,GAAG,CAAC;gBAClB,IAAI,CAAC;oBACH,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;oBAC9C,MAAM,MAAM,GAAI,KAAK,EAAE,QAAQ,EAAE,UAAqB,IAAK,KAAK,EAAE,eAA0B,CAAC;oBAC7F,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC;wBAAE,OAAO,GAAG,MAAM,CAAC;gBAC9E,CAAC;gBAAC,MAAM,CAAC,CAAC,iBAAiB,CAAC,CAAC;gBAE7B,MAAM,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;gBACtD,SAAS,EAAE,CAAC;gBACZ,eAAe,EAAE,CAAC;gBAClB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACzB,CAAC;YAAC,MAAM,CAAC;gBACP,0BAA0B;YAC5B,CAAC;QACH,CAAC;QAED,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACtC,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,qBAAqB,IAAI,SAAS,CAAC;QAC9C,IAAI,CAAC,KAAK,CAAC,mBAAmB,EAAE,CAAC;QAEjC,yEAAyE;QACzE,6EAA6E;QAC7E,gFAAgF;QAChF,IAAI,SAAS,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,IAAI,OAAQ,IAAI,CAAC,MAAc,CAAC,kBAAkB,KAAK,UAAU,EAAE,CAAC;YAClG,KAAK,IAAI,CAAC,yBAAyB,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;QACxD,CAAC;QAED,MAAM,MAAM,GAAsB;YAChC,qBAAqB,EAAE,SAAS;YAChC,eAAe;YACf,cAAc,EAAE,SAAS;YACzB,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SACnC,CAAC;QAEF,IAAI,CAAC,IAAI,CAAC,yBAAyB,EAAE,MAAM,CAAC,CAAC;QAC7C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,gBAAgB,CAAC,SAAiB;QACtC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,IAAI,CAAC,SAAS;YAAE,OAAO,CAAC,CAAC;QAErD,IAAI,OAAsB,CAAC;QAC3B,IAAI,CAAC;YACH,OAAO,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;gBACjC,IAAI,EAAE,QAAQ;gBACd,SAAS;gBACT,KAAK,EAAE,IAAI;aACZ,CAAC,CAAC;QACL,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,CAAC,CAAC;QACX,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,gBAAgB,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,WAAW,CAAC;YAC/D,IAAI,gBAAgB,GAAG,CAAC;gBAAE,SAAS;YAEnC,MAAM,WAAW,GAAI,KAAK,CAAC,QAAQ,EAAE,UAAqB,IAAI,GAAG,CAAC;YAClE,0EAA0E;YAC1E,8CAA8C;YAC9C,MAAM,eAAe,GAAG,CAAC,KAAK,CAAC,eAAe,IAAI,KAAK,CAAC,QAAQ,EAAE,eAAyB,CAAC,IAAI,WAAW,CAAC;YAC5G,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CACtB,IAAI,CAAC,MAAM,CAAC,aAAa,EACzB,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,mBAAmB,GAAG,gBAAgB,CAAC,CAChF,CAAC;YAEF,IAAI,OAAO,GAAG,WAAW,EAAE,CAAC;gBAC1B,IAAI,CAAC;oBACH,MAAM,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE;wBAClC,QAAQ,EAAE,EAAE,GAAG,KAAK,CAAC,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE;qBACrD,CAAC,CAAC;oBACH,OAAO,EAAE,CAAC;gBACZ,CAAC;gBAAC,MAAM,CAAC;oBACP,sBAAsB;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,WAAW,IAAI,OAAO,CAAC;QAClC,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,mBAAmB,CAAC,OAAe,EAAE,IAAY,CAAC;QACtD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,IAAI,CAAC,SAAS;YAAE,OAAO,EAAE,CAAC;QAEtD,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAExB,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,OAAO,EAAE,CAAC;QAE5B,IAAI,CAAC;YACH,MAAM,SAAS,GAAG,IAAI,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC;YACpD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;YAE7D,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;gBAAE,OAAO,EAAE,CAAC;YAEvC,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC;gBAC9B,OAAO,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,IAAI,IAAI,EAAE;gBAClC,UAAU,EAAE,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC;gBACxC,QAAQ,EAAE,CAAC,CAAC,QAAQ,IAAI,SAAS;gBACjC,UAAU,EAAE,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC;aAC1C,CAAC,CAAC,CAAC;QACN,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,4CAA4C;IAC5C,QAAQ;QACN,MAAM,QAAQ,GACZ,IAAI,CAAC,KAAK,CAAC,gBAAgB,GAAG,CAAC;YAC7B,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB;YAC3D,CAAC,CAAC,CAAC,CAAC;QAER,OAAO;YACL,iBAAiB,EAAE,IAAI,CAAC,KAAK,CAAC,iBAAiB;YAC/C,qBAAqB,EAAE,IAAI,CAAC,KAAK,CAAC,qBAAqB;YACvD,kBAAkB,EAAE,IAAI,CAAC,kBAAkB,CAAC,IAAI;YAChD,mBAAmB,EAAE,IAAI,CAAC,KAAK,CAAC,mBAAmB;YACnD,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW;YACnC,kBAAkB,EAAE,QAAQ;YAC5B,eAAe,EAAE,IAAI,CAAC,MAAM,KAAK,IAAI;SACtC,CAAC;IACJ,CAAC;IAED,mEAAmE;IACnE,OAAO;QACL,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QACtB,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,CAAC;QAEhC,IAAI,IAAI,CAAC,MAAM,IAAI,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,KAAK,UAAU,EAAE,CAAC;YAC7D,IAAI,CAAC;gBACH,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACxB,CAAC;YAAC,MAAM,CAAC;gBACP,sBAAsB;YACxB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACnB,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC;QAC9B,IAAI,CAAC,kBAAkB,EAAE,CAAC;IAC5B,CAAC;IAED,sBAAsB;IAEtB;;;;OAIG;IACK,KAAK,CAAC,UAAU;QACtB,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO;QACxB,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YAC3B,MAAM,IAAI,CAAC,iBAAiB,CAAC;YAC7B,OAAO;QACT,CAAC;QAED,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAC3C,MAAM,IAAI,CAAC,iBAAiB,CAAC;IAC/B,CAAC;IAEO,KAAK,CAAC,UAAU;QACtB,IAAI,CAAC;YACH,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;gBAC7B,mDAAmD;gBACnD,IAAI,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;gBAC/C,OAAO;YACT,CAAC;YAED,MAAM,GAAG,GAAG,MAAM,MAAM,CAAC,kBAA4B,CAAC,CAAC;YACvD,MAAM,oBAAoB,GAAG,GAAG,CAAC,oBAAoB,IAAI,GAAG,CAAC,OAAO,CAAC;YACrE,IAAI,CAAC,oBAAoB;gBAAE,OAAO;YAElC,MAAM,QAAQ,GAAG,IAAI,oBAAoB,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAEhE,IAAI,OAAO,QAAQ,CAAC,UAAU,KAAK,UAAU,EAAE,CAAC;gBAC9C,MAAM,QAAQ,CAAC,UAAU,EAAE,CAAC;YAC9B,CAAC;YAED,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC;QACzB,CAAC;QAAC,MAAM,CAAC;YACP,0DAA0D;YAC1D,2DAA2D;YAC3D,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACrB,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,yBAAyB;QACrC,MAAM,UAAU,GACX,IAAI,CAAC,MAAc,CAAC,kBAAkB,EAAE,EAAE,IAAI,EAAE,CAAC;QACtD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAEpC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,UAAU,EAAE,YAAY,EAAE,UAAU,EAAE,GAAG,MAAM,MAAM,CAAC,SAAS,CAAC,CAAC;QACnG,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,MAAM,CAAC,WAAW,CAAC,CAAC;QAE3C,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;QACvD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC1D,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,eAAe,CAAC,CAAC;QAEhD,IAAI,QAAQ,GAAmC,EAAE,CAAC;QAClD,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,YAAY,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;YAChD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC/B,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;gBAAE,QAAQ,GAAG,MAAM,CAAC;QAC/C,CAAC;QAAC,MAAM,CAAC,CAAC,iBAAiB,CAAC,CAAC;QAE7B,mEAAmE;QACnE,4EAA4E;QAC5E,kFAAkF;QAClF,0EAA0E;QAC1E,MAAM,eAAe,GAA2B;YAC9C,IAAI,EAAE,OAAO;YACb,MAAM,EAAE,OAAO;YACf,SAAS,EAAE,YAAY;YACvB,QAAQ,EAAE,YAAY;YACtB,OAAO,EAAE,QAAQ;YACjB,MAAM,EAAE,UAAU;YAClB,QAAQ,EAAE,oBAAoB;YAC9B,WAAW,EAAE,sBAAsB;YACnC,YAAY,EAAE,WAAW;YACzB,QAAQ,EAAE,YAAY;YACtB,IAAI,EAAE,YAAY;YAClB,IAAI,EAAE,OAAO;YACb,OAAO,EAAE,OAAO;SACjB,CAAC;QAEF,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,UAAU,GAAG,UAAU;aAC1B,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,WAAW,IAAI,GAAG,CAAC;aACvE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACT,EAAE,EAAE,UAAU,CAAC,CAAC,EAAE,EAAE;YACpB,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,OAAO;YAC1C,OAAO,EAAE,CAAC,CAAC,QAAQ;YACnB,UAAU,EAAE,CAAC,CAAC,WAAW;YACzB,UAAU,EAAE,CAAC,CAAC,UAAU;YACxB,SAAS,EAAE,EAAc;YACzB,SAAS,EAAE,GAAG;YACd,UAAU,EAAE,GAAG;SAChB,CAAC,CAAC,CAAC;QAEN,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAEpC,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,EAAE,GAAG,UAAU,CAAC,CAAC;QAC5C,MAAM,GAAG,GAAG,GAAG,YAAY,IAAI,OAAO,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;QACxD,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QAC7D,UAAU,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;QAE9B,KAAK,IAAI,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,kBAAkB,CAAC,YAAoB;QACnD,IAAI,IAAI,CAAC,kBAAkB;YAAE,OAAO;QACpC,IAAI,CAAC,kBAAkB,GAAG,IAAI,CAAC;QAC/B,IAAI,CAAC;YACH,MAAM,EAAE,YAAY,EAAE,aAAa,EAAE,UAAU,EAAE,GAAG,MAAM,MAAM,CAAC,SAAS,CAAC,CAAC;YAE5E,MAAM,GAAG,GAAG,YAAY,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;YAChD,MAAM,QAAQ,GAAmC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACjE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;gBAAE,OAAO;YAErC,IAAI,OAAO,GAAG,KAAK,CAAC;YACpB,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;gBAC7B,MAAM,GAAG,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC;gBAC/B,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC3C,MAAM,OAAO,GAAG,OAAO,KAAK,CAAC,SAAS,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC7E,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;oBACrD,KAAK,CAAC,WAAW,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACrC,OAAO,GAAG,IAAI,CAAC;gBACjB,CAAC;YACH,CAAC;YAED,IAAI,CAAC,OAAO;gBAAE,OAAO;YAErB,0EAA0E;YAC1E,8EAA8E;YAC9E,8EAA8E;YAC9E,IAAI,aAAa,GAAG,QAAQ,CAAC;YAC7B,IAAI,CAAC;gBACH,MAAM,QAAQ,GAAG,YAAY,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;gBACrD,MAAM,aAAa,GAAmC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBAC3E,IAAI,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;oBACjC,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC5E,aAAa,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;wBACpC,MAAM,aAAa,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;wBACjD,IAAI,aAAa,IAAI,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;4BAC9E,OAAO,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,aAAa,EAAE,CAAC;wBAC5C,CAAC;wBACD,OAAO,CAAC,CAAC;oBACX,CAAC,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAAC,MAAM,CAAC,CAAC,8CAA8C,CAAC,CAAC;YAE1D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,GAAG,YAAY,aAAa,OAAO,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;YACjE,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YACpE,UAAU,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;QAChC,CAAC;QAAC,MAAM,CAAC;YACP,+DAA+D;QACjE,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,kBAAkB,GAAG,KAAK,CAAC;QAClC,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,eAAe,CAAC,IAAY,EAAE,aAAqB,GAAG;QAClE,qFAAqF;QACrF,+DAA+D;QAC/D,MAAM,eAAe,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;QAC7C,IAAI,eAAe,EAAE,CAAC;YACpB,IAAI,CAAC;gBACH,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC,IAAI,CAAC,CAAC;gBACxC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACzC,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,UAAU,CAAC,CAAC;oBACzC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;oBACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;wBAAE,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;oBAClD,IAAI,IAAI,GAAG,CAAC,CAAC;oBACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE;wBAAE,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC7D,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,IAAI,IAAI,GAAG,CAAC;wBAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE;4BAAE,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;oBAClE,OAAO,GAAG,CAAC;gBACb,CAAC;YACH,CAAC;YAAC,MAAM,CAAC,CAAC,kBAAkB,CAAC,CAAC;QAChC,CAAC;QAED,kFAAkF;QAClF,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,2CAAqD,CAAC;iBAC/E,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;YACrB,IAAI,MAAM,EAAE,uBAAuB,EAAE,CAAC;gBACpC,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC;gBAC1D,IAAI,MAAM,EAAE,SAAS,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,MAAM,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACxF,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,UAAU,CAAC,CAAC;oBACzC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;oBAC9D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;wBAAE,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;oBAC/D,IAAI,IAAI,GAAG,CAAC,CAAC;oBACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE;wBAAE,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC7D,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,IAAI,IAAI,GAAG,CAAC;wBAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE;4BAAE,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;oBAClE,OAAO,GAAG,CAAC;gBACb,CAAC;YACH,CAAC;QACH,CAAC;QAAC,MAAM,CAAC,CAAC,0BAA0B,CAAC,CAAC;QAEtC,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IACpD,CAAC;IAED;;;OAGG;IACK,mBAAmB,CAAC,IAAY,EAAE,aAAqB,GAAG;QAChE,MAAM,SAAS,GAAG,IAAI,YAAY,CAAC,UAAU,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;QAE7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACvE,CAAC;YACD,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,IAAI,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEvB,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;YACvB,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAED,eAAe,cAAc,CAAC"}

package/dist/memory-graph.d.ts

@@ -0,0 +1,123 @@
+/**
+ * Knowledge Graph Module for @monomind/memory
+ *
+ * Builds a graph from MemoryEntry.references, computes PageRank,
+ * detects communities via label propagation, and provides
+ * graph-aware ranking for search results.
+ *
+ * Pure TypeScript - no external graph libraries.
+ * @module v1/memory/memory-graph
+ */
+import { EventEmitter } from 'node:events';
+import type { IMemoryBackend, MemoryEntry, SearchResult } from './types.js';
+export type EdgeType = 'reference' | 'similar' | 'temporal' | 'co-accessed' | 'causal';
+export interface MemoryGraphConfig {
+    similarityThreshold?: number;
+    pageRankDamping?: number;
+    pageRankIterations?: number;
+    pageRankConvergence?: number;
+    maxNodes?: number;
+    enableAutoEdges?: boolean;
+    communityAlgorithm?: 'louvain' | 'label-propagation';
+}
+export interface GraphNode {
+    id: string;
+    category: string;
+    confidence: number;
+    accessCount: number;
+    createdAt: number;
+}
+export interface GraphEdge {
+    targetId: string;
+    type: EdgeType;
+    weight: number;
+}
+export interface RankedResult {
+    entry: MemoryEntry;
+    score: number;
+    pageRank: number;
+    combinedScore: number;
+    community?: string;
+}
+export interface GraphStats {
+    nodeCount: number;
+    edgeCount: number;
+    avgDegree: number;
+    communityCount: number;
+    pageRankComputed: boolean;
+    maxPageRank: number;
+    minPageRank: number;
+}
+/**
+ * Knowledge graph built from memory entry references.
+ * Supports PageRank, community detection (label propagation),
+ * and graph-aware result ranking blending vector similarity with structural importance.
+ */
+export declare class MemoryGraph extends EventEmitter {
+    private nodes;
+    private edges;
+    private reverseEdges;
+    private pageRanks;
+    private communities;
+    private config;
+    private dirty;
+    constructor(config?: MemoryGraphConfig);
+    /** Build graph from all entries in a backend. Creates nodes and reference edges. */
+    buildFromBackend(backend: IMemoryBackend, namespace?: string): Promise<void>;
+    /** Add a node from a MemoryEntry. Skips silently at maxNodes capacity. */
+    addNode(entry: MemoryEntry): void;
+    /** Add a directed edge. Skips if either node missing. Updates weight to max if exists. */
+    addEdge(sourceId: string, targetId: string, type: EdgeType, weight?: number): void;
+    /** Remove a node and all associated edges (both directions). */
+    removeNode(id: string): void;
+    /** Add similarity edges by searching backend. Returns count of edges added. */
+    addSimilarityEdges(backend: IMemoryBackend, entryId: string): Promise<number>;
+    /**
+     * Compute PageRank via power iteration with dangling node redistribution.
+     * Returns map of node ID to PageRank score.
+     */
+    computePageRank(): Map<string, number>;
+    /** Detect communities using label propagation. Returns map of nodeId to communityId. */
+    detectCommunities(): Map<string, string>;
+    /**
+     * Rank search results blending vector similarity and PageRank.
+     * @param alpha - Weight for vector score (default 0.7). PageRank weight is (1 - alpha).
+     */
+    rankWithGraph(searchResults: SearchResult[], alpha?: number): RankedResult[];
+    /** Get top N nodes by PageRank score. */
+    getTopNodes(n: number): Array<{
+        id: string;
+        pageRank: number;
+        community: string;
+    }>;
+    /** BFS neighbors from a node up to given depth. Excludes the start node. */
+    getNeighbors(id: string, depth?: number): Set<string>;
+    /**
+     * HippoRAG-style PPR re-ranking: expand one hop via MemoryEntry.references and
+     * boost scores of reachable neighbors.
+     *
+     * Starting from each HNSW result, walk one hop through the `references` graph.
+     * Neighbors receive a propagated score of (parent_score × damping × edge_weight).
+     * Final scores are merged using max-of-contributions per node.
+     *
+     * Source: https://arxiv.org/abs/2405.14831 (HippoRAG 2 — NeurIPS 2024)
+     */
+    pprRerank(searchResults: SearchResult[], backend: IMemoryBackend, damping?: number): Promise<RankedResult[]>;
+    /**
+     * GraphRAG community retrieval: return top-k community summary descriptors.
+     * These can be prepended to semantic search results for global thematic reasoning.
+     *
+     * Source: https://arxiv.org/abs/2404.16130 (GraphRAG — Microsoft)
+     */
+    getCommunitySummaries(topK?: number): Array<{
+        communityId: string;
+        nodeCount: number;
+        topNodeIds: string[];
+        avgPageRank: number;
+    }>;
+    /** Get statistics about the current graph state. */
+    getStats(): GraphStats;
+    private hasEdge;
+    private shuffleArray;
+}
+//# sourceMappingURL=memory-graph.d.ts.map