specmem-hardwicksoftware 3.5.99

package/dist/memory/humanLikeMemory.js

@@ -0,0 +1,603 @@
+/**
+ * humanLikeMemory.ts - HUMAN-LIKE MEMORY EVOLUTION SYSTEM
+ *
+ * This module implements human-inspired memory patterns:
+ * 1. Forgetting curves (Ebbinghaus-inspired decay)
+ * 2. Associative recall (memories trigger related memories)
+ * 3. Memory chains (sequential reasoning paths)
+ * 4. Memory strength (reinforced by access)
+ * 5. Consolidation during "sleep" (background processing)
+ *
+ * The goal is to make 's memory more natural and intelligent,
+ * not just a flat database but a living, evolving knowledge store.
+ */
+import { v4 as uuidv4 } from 'uuid';
+import { logger } from '../utils/logger.js';
+import { getDimensionService } from '../services/DimensionService.js';
+import { getProjectContext } from '../services/ProjectContext.js';
+/**
+ * HumanLikeMemorySystem - The brain of SpecMem
+ *
+ * This system makes memory more intelligent by:
+ * 1. Tracking memory strength and decay
+ * 2. Building associative networks
+ * 3. Preserving reasoning chains
+ * 4. Adapting context based on relevance
+ */
+export class HumanLikeMemorySystem {
+    db;
+    embeddingProvider;
+    // Cache for frequently accessed strength data
+    strengthCache = new Map();
+    cacheTimeout = 5 * 60 * 1000; // 5 minutes
+    constructor(db, embeddingProvider) {
+        this.db = db;
+        this.embeddingProvider = embeddingProvider;
+    }
+    // ============================================================
+    // FORGETTING CURVE IMPLEMENTATION
+    // ============================================================
+    /**
+     * Calculate current retrievability based on Ebbinghaus curve
+     *
+     * R(t) = e^(-t/S) where:
+     * - R is retrievability (0-1)
+     * - t is time since last review (days)
+     * - S is stability (higher = slower decay)
+     */
+    calculateRetrievability(lastReview, stability, importance) {
+        const now = new Date();
+        const daysSinceReview = (now.getTime() - lastReview.getTime()) / (1000 * 60 * 60 * 24);
+        // Importance modifier (critical memories decay slower)
+        const importanceMultiplier = {
+            critical: 2.0,
+            high: 1.5,
+            medium: 1.0,
+            low: 0.7,
+            trivial: 0.4
+        }[importance];
+        const effectiveStability = stability * importanceMultiplier;
+        // Ebbinghaus formula
+        const retrievability = Math.exp(-daysSinceReview / effectiveStability);
+        return Math.max(0, Math.min(1, retrievability));
+    }
+    /**
+     * Update memory strength after access (spaced repetition)
+     *
+     * When a memory is accessed:
+     * 1. Retrievability is reset to 1.0
+     * 2. Stability increases based on interval
+     * 3. Next optimal interval is calculated
+     */
+    async updateMemoryStrength(memoryId, wasSuccessfulRecall, importance) {
+        // Get existing strength or create new
+        let strength = await this.getMemoryStrength(memoryId);
+        if (!strength) {
+            strength = this.createInitialStrength(memoryId, importance);
+        }
+        const now = new Date();
+        const daysSinceReview = (now.getTime() - strength.lastReview.getTime()) / (1000 * 60 * 60 * 24);
+        if (wasSuccessfulRecall) {
+            // Successful recall increases stability (SM-2 inspired)
+            strength.easeFactor = Math.max(1.3, strength.easeFactor + 0.1);
+            // Stability increases more for longer intervals
+            const intervalBonus = Math.log2(Math.max(1, daysSinceReview) + 1);
+            strength.stability = Math.min(100, strength.stability + (5 * intervalBonus));
+            // Calculate next optimal interval
+            strength.intervalDays = Math.max(1, strength.intervalDays * strength.easeFactor);
+        }
+        else {
+            // Failed recall decreases stability
+            strength.easeFactor = Math.max(1.3, strength.easeFactor - 0.2);
+            strength.stability = Math.max(1, strength.stability * 0.8);
+            strength.intervalDays = 1; // Reset to minimum
+        }
+        strength.lastReview = now;
+        strength.reviewCount++;
+        strength.retrievability = 1.0; // Reset after access
+        // Persist to database
+        await this.saveMemoryStrength(strength);
+        // Update cache
+        this.strengthCache.set(memoryId, strength);
+        return strength;
+    }
+    /**
+     * Create initial strength for new memory
+     */
+    createInitialStrength(memoryId, importance) {
+        // Initial stability based on importance
+        const baseStability = {
+            critical: 30,
+            high: 20,
+            medium: 10,
+            low: 5,
+            trivial: 2
+        }[importance];
+        return {
+            memoryId,
+            stability: baseStability,
+            retrievability: 1.0,
+            lastReview: new Date(),
+            reviewCount: 1,
+            intervalDays: 1,
+            easeFactor: 2.0 // Medium ease
+        };
+    }
+    /**
+     * Get memories that are "fading" (low retrievability)
+     * These should be reviewed or consolidated
+     */
+    async getFadingMemories(threshold = 0.3, limit = 50) {
+        // PROJECT NAMESPACING: Filter by current project
+        const projectPath = getProjectContext().getProjectPath();
+        const query = `
+      SELECT
+        m.*,
+        ms.stability,
+        ms.retrievability,
+        ms.last_review,
+        ms.review_count,
+        ms.interval_days,
+        ms.ease_factor
+      FROM memories m
+      LEFT JOIN memory_strength ms ON m.id = ms.memory_id
+      WHERE
+        (ms.retrievability IS NULL OR ms.retrievability < $1)
+        AND (m.expires_at IS NULL OR m.expires_at > NOW())
+        AND m.importance IN ('critical', 'high', 'medium')
+        AND m.project_path = $3
+      ORDER BY
+        COALESCE(ms.retrievability, 0) ASC,
+        m.importance DESC
+      LIMIT $2
+    `;
+        const result = await this.db.query(query, [threshold, limit, projectPath]);
+        return result.rows.map((row) => ({
+            memory: this.rowToMemory(row),
+            strength: row.stability ? {
+                memoryId: row.id,
+                stability: row.stability,
+                retrievability: row.retrievability,
+                lastReview: row.last_review,
+                reviewCount: row.review_count,
+                intervalDays: row.interval_days,
+                easeFactor: row.ease_factor
+            } : this.createInitialStrength(row.id, row.importance)
+        }));
+    }
+    // ============================================================
+    // ASSOCIATIVE RECALL IMPLEMENTATION
+    // ============================================================
+    /**
+     * Build associative links when memories are accessed together
+     *
+     * When memory A is accessed in context of memory B:
+     * - Create or strengthen A -> B link
+     * - Co-activation count increases
+     * - Link strength increases
+     */
+    async recordCoActivation(memoryIds, linkType = 'contextual') {
+        if (memoryIds.length < 2)
+            return;
+        const now = new Date();
+        // Create links between all pairs
+        for (let i = 0; i < memoryIds.length; i++) {
+            for (let j = i + 1; j < memoryIds.length; j++) {
+                await this.strengthenLink(memoryIds[i], memoryIds[j], linkType, now);
+            }
+        }
+    }
+    /**
+     * Strengthen (or create) an associative link
+     */
+    async strengthenLink(sourceId, targetId, linkType, timestamp) {
+        // Use UPSERT to create or update
+        const query = `
+      INSERT INTO memory_associations (
+        source_id, target_id, link_type, strength,
+        co_activation_count, last_co_activation, decay_rate
+      ) VALUES ($1, $2, $3, 0.3, 1, $4, 0.1)
+      ON CONFLICT (source_id, target_id)
+      DO UPDATE SET
+        strength = LEAST(1.0, memory_associations.strength + 0.1),
+        co_activation_count = memory_associations.co_activation_count + 1,
+        last_co_activation = $4
+      RETURNING *
+    `;
+        try {
+            await this.db.query(query, [sourceId, targetId, linkType, timestamp]);
+        }
+        catch (error) {
+            logger.warn({ error, sourceId, targetId }, 'failed to strengthen link');
+        }
+    }
+    /**
+     * Get associated memories through link traversal
+     *
+     * Uses spreading activation: stronger links activate targets more
+     */
+    async getAssociatedMemories(memoryId, depth = 2, minStrength = 0.3, limit = 20) {
+        // Recursive CTE for graph traversal with strength accumulation
+        const query = `
+      WITH RECURSIVE association_path AS (
+        -- Base case: direct associations
+        SELECT
+          ma.target_id as memory_id,
+          ARRAY[ma.source_id, ma.target_id] as path,
+          ma.strength as total_strength,
+          1 as depth
+        FROM memory_associations ma
+        WHERE ma.source_id = $1
+          AND ma.strength >= $2
+
+        UNION ALL
+
+        -- Recursive case: follow associations
+        SELECT
+          ma.target_id,
+          ap.path || ma.target_id,
+          ap.total_strength * ma.strength,
+          ap.depth + 1
+        FROM association_path ap
+        JOIN memory_associations ma ON ma.source_id = ap.memory_id
+        WHERE ap.depth < $3
+          AND ma.strength >= $2
+          AND NOT ma.target_id = ANY(ap.path)  -- Prevent cycles
+      )
+      SELECT DISTINCT ON (m.id)
+        m.*,
+        ap.path,
+        ap.total_strength
+      FROM association_path ap
+      JOIN memories m ON m.id = ap.memory_id
+      WHERE (m.expires_at IS NULL OR m.expires_at > NOW())
+      ORDER BY m.id, ap.total_strength DESC
+      LIMIT $4
+    `;
+        const result = await this.db.query(query, [memoryId, minStrength, depth, limit]);
+        return result.rows.map((row) => ({
+            memory: this.rowToMemory(row),
+            path: row.path,
+            totalStrength: row.total_strength
+        }));
+    }
+    /**
+     * Decay old association links (run periodically)
+     *
+     * Links that aren't reinforced will gradually weaken
+     */
+    async decayAssociations(decayDays = 30) {
+        const query = `
+      UPDATE memory_associations
+      SET strength = strength * (1 - decay_rate)
+      WHERE last_co_activation < NOW() - INTERVAL '1 day' * $1
+
+      -- Also delete very weak links
+      DELETE FROM memory_associations WHERE strength < 0.05
+
+      RETURNING id
+    `;
+        const result = await this.db.query(query, [decayDays]);
+        return result.rowCount || 0;
+    }
+    // ============================================================
+    // MEMORY CHAINS IMPLEMENTATION
+    // ============================================================
+    /**
+     * Create a new memory chain (reasoning path)
+     */
+    async createChain(name, description, memoryIds, chainType, importance) {
+        const chain = {
+            id: uuidv4(),
+            name,
+            description,
+            memoryIds,
+            chainType,
+            importance,
+            createdAt: new Date(),
+            lastAccessedAt: new Date(),
+            accessCount: 1,
+            metadata: {}
+        };
+        const query = `
+      INSERT INTO memory_chains (
+        id, name, description, memory_ids, chain_type,
+        importance, created_at, last_accessed_at, access_count, metadata
+      ) VALUES ($1, $2, $3, $4, $5, $6, $7, $8, $9, $10)
+    `;
+        await this.db.query(query, [
+            chain.id,
+            chain.name,
+            chain.description,
+            chain.memoryIds,
+            chain.chainType,
+            chain.importance,
+            chain.createdAt,
+            chain.lastAccessedAt,
+            chain.accessCount,
+            chain.metadata
+        ]);
+        // Create sequential links between chain memories
+        for (let i = 0; i < memoryIds.length - 1; i++) {
+            await this.strengthenLink(memoryIds[i], memoryIds[i + 1], 'causal', chain.createdAt);
+        }
+        logger.info({ chainId: chain.id, length: memoryIds.length }, 'memory chain created');
+        return chain;
+    }
+    /**
+     * Extend an existing chain with new memories
+     */
+    async extendChain(chainId, newMemoryIds) {
+        const query = `
+      UPDATE memory_chains
+      SET
+        memory_ids = memory_ids || $2,
+        last_accessed_at = NOW(),
+        access_count = access_count + 1
+      WHERE id = $1
+      RETURNING *
+    `;
+        const result = await this.db.query(query, [chainId, newMemoryIds]);
+        if (result.rows.length === 0) {
+            throw new Error(`Chain ${chainId} not found`);
+        }
+        const row = result.rows[0];
+        // Link new memories to each other and to the last existing memory
+        const existingIds = row.memory_ids;
+        if (existingIds.length > 0 && newMemoryIds.length > 0) {
+            const lastExisting = existingIds[existingIds.length - newMemoryIds.length - 1];
+            await this.strengthenLink(lastExisting, newMemoryIds[0], 'causal', new Date());
+        }
+        return {
+            id: row.id,
+            name: row.name,
+            description: row.description,
+            memoryIds: row.memory_ids,
+            chainType: row.chain_type,
+            importance: row.importance,
+            createdAt: row.created_at,
+            lastAccessedAt: row.last_accessed_at,
+            accessCount: row.access_count,
+            metadata: row.metadata
+        };
+    }
+    /**
+     * Find chains that contain a specific memory
+     */
+    async findChainsContaining(memoryId) {
+        const query = `
+      SELECT * FROM memory_chains
+      WHERE $1 = ANY(memory_ids)
+      ORDER BY last_accessed_at DESC
+    `;
+        const result = await this.db.query(query, [memoryId]);
+        return result.rows.map((row) => ({
+            id: row.id,
+            name: row.name,
+            description: row.description,
+            memoryIds: row.memory_ids,
+            chainType: row.chain_type,
+            importance: row.importance,
+            createdAt: row.created_at,
+            lastAccessedAt: row.last_accessed_at,
+            accessCount: row.access_count,
+            metadata: row.metadata
+        }));
+    }
+    // ============================================================
+    // ADAPTIVE CONTEXT WINDOWS
+    // ============================================================
+    /**
+     * Build an adaptive context window for a query
+     *
+     * The context window expands based on:
+     * - Query complexity
+     * - Number of relevant memories found
+     * - Strength of associations
+     * - Available token budget
+     */
+    async buildContextWindow(query, embedding, options = {}) {
+        const { maxTokens = 8000, minRelevance = 0.6, includeAssociations = true, includeChains = true, maxAssociationDepth = 2 } = options;
+        // Validate and prepare embedding for the memories table (dynamic dimension)
+        const dimService = getDimensionService(this.db, this.embeddingProvider);
+        const prepared = await dimService.validateAndPrepare('memories', embedding, query);
+        const validatedEmbedding = prepared.embedding;
+        if (prepared.wasModified) {
+            logger.info({ action: prepared.action }, 'Adjusted embedding dimension for buildContextWindow');
+        }
+        // PROJECT NAMESPACING: Filter by current project
+        const projectPath = getProjectContext().getProjectPath();
+        // Phase 1: Get core memories by semantic similarity
+        const coreQuery = `
+      SELECT m.*, 1 - (m.embedding <=> $1::vector) as similarity
+      FROM memories m
+      WHERE
+        m.embedding IS NOT NULL
+        AND (m.expires_at IS NULL OR m.expires_at > NOW())
+        AND 1 - (m.embedding <=> $1::vector) >= $2
+        AND m.project_path = $3
+      ORDER BY similarity DESC
+      LIMIT 20
+    `;
+        const coreResult = await this.db.query(coreQuery, [
+            `[${validatedEmbedding.join(',')}]`,
+            minRelevance,
+            projectPath
+        ]);
+        const coreMemories = coreResult.rows.map((row) => this.rowToMemory(row));
+        let totalTokens = this.estimateTokens(coreMemories);
+        // Phase 2: Get associated memories (spreading activation)
+        let associatedMemories = [];
+        if (includeAssociations && coreMemories.length > 0 && totalTokens < maxTokens * 0.7) {
+            const associatedIds = new Set();
+            for (const core of coreMemories.slice(0, 5)) { // Top 5 core memories
+                const associated = await this.getAssociatedMemories(core.id, maxAssociationDepth, 0.4, 10);
+                for (const { memory } of associated) {
+                    if (!associatedIds.has(memory.id) &&
+                        !coreMemories.some(c => c.id === memory.id)) {
+                        associatedIds.add(memory.id);
+                        associatedMemories.push(memory);
+                    }
+                }
+            }
+            totalTokens += this.estimateTokens(associatedMemories);
+        }
+        // Phase 3: Get chain memories
+        let chainMemories = [];
+        if (includeChains && totalTokens < maxTokens * 0.85) {
+            const chainIds = new Set();
+            for (const core of coreMemories.slice(0, 3)) { // Top 3 core memories
+                const chains = await this.findChainsContaining(core.id);
+                for (const chain of chains.slice(0, 2)) { // Top 2 chains per memory
+                    for (const memId of chain.memoryIds) {
+                        if (!chainIds.has(memId) &&
+                            !coreMemories.some(c => c.id === memId) &&
+                            !associatedMemories.some(a => a.id === memId)) {
+                            chainIds.add(memId);
+                        }
+                    }
+                }
+            }
+            if (chainIds.size > 0) {
+                const chainQuery = `
+          SELECT * FROM memories
+          WHERE id = ANY($1)
+            AND (expires_at IS NULL OR expires_at > NOW())
+            AND project_path = $2
+        `;
+                const chainResult = await this.db.query(chainQuery, [Array.from(chainIds), projectPath]);
+                chainMemories = chainResult.rows.map((row) => this.rowToMemory(row));
+                totalTokens += this.estimateTokens(chainMemories);
+            }
+        }
+        // Phase 4: Add contextual memories if we have token budget
+        let contextualMemories = [];
+        if (totalTokens < maxTokens * 0.95) {
+            const contextQuery = `
+        SELECT m.*, 1 - (m.embedding <=> $1::vector) as similarity
+        FROM memories m
+        WHERE
+          m.embedding IS NOT NULL
+          AND (m.expires_at IS NULL OR m.expires_at > NOW())
+          AND m.id NOT IN (SELECT unnest($2::uuid[]))
+          AND 1 - (m.embedding <=> $1::vector) >= $3
+          AND m.project_path = $4
+        ORDER BY similarity DESC
+        LIMIT 10
+      `;
+            const existingIds = [
+                ...coreMemories.map(m => m.id),
+                ...associatedMemories.map(m => m.id),
+                ...chainMemories.map(m => m.id)
+            ];
+            // Use the already validated embedding (consistent dimension)
+            const contextResult = await this.db.query(contextQuery, [
+                `[${validatedEmbedding.join(',')}]`,
+                existingIds,
+                minRelevance * 0.8, // Slightly lower threshold
+                projectPath
+            ]);
+            contextualMemories = contextResult.rows.map((row) => this.rowToMemory(row));
+        }
+        // Record co-activations for all memories in context
+        const allIds = [
+            ...coreMemories.map(m => m.id),
+            ...associatedMemories.map(m => m.id).slice(0, 5),
+            ...chainMemories.map(m => m.id).slice(0, 5)
+        ];
+        await this.recordCoActivation(allIds, 'contextual');
+        return {
+            coreMemories,
+            associatedMemories,
+            chainMemories,
+            contextualMemories,
+            totalTokenEstimate: totalTokens + this.estimateTokens(contextualMemories),
+            relevanceThreshold: minRelevance,
+            maxDepth: maxAssociationDepth
+        };
+    }
+    /**
+     * Estimate tokens for a list of memories
+     */
+    estimateTokens(memories) {
+        // Rough estimate: ~4 characters per token
+        return memories.reduce((sum, m) => sum + Math.ceil(m.content.length / 4), 0);
+    }
+    // ============================================================
+    // HELPER METHODS
+    // ============================================================
+    async getMemoryStrength(memoryId) {
+        // Check cache first
+        const cached = this.strengthCache.get(memoryId);
+        if (cached)
+            return cached;
+        const query = `
+      SELECT * FROM memory_strength WHERE memory_id = $1
+    `;
+        const result = await this.db.query(query, [memoryId]);
+        if (result.rows.length === 0)
+            return null;
+        const row = result.rows[0];
+        const strength = {
+            memoryId: row.memory_id,
+            stability: row.stability,
+            retrievability: row.retrievability,
+            lastReview: row.last_review,
+            reviewCount: row.review_count,
+            intervalDays: row.interval_days,
+            easeFactor: row.ease_factor
+        };
+        this.strengthCache.set(memoryId, strength);
+        return strength;
+    }
+    async saveMemoryStrength(strength) {
+        const query = `
+      INSERT INTO memory_strength (
+        memory_id, stability, retrievability, last_review,
+        review_count, interval_days, ease_factor
+      ) VALUES ($1, $2, $3, $4, $5, $6, $7)
+      ON CONFLICT (memory_id)
+      DO UPDATE SET
+        stability = $2,
+        retrievability = $3,
+        last_review = $4,
+        review_count = $5,
+        interval_days = $6,
+        ease_factor = $7
+    `;
+        await this.db.query(query, [
+            strength.memoryId,
+            strength.stability,
+            strength.retrievability,
+            strength.lastReview,
+            strength.reviewCount,
+            strength.intervalDays,
+            strength.easeFactor
+        ]);
+    }
+    rowToMemory(row) {
+        return {
+            id: row.id,
+            content: row.content,
+            memoryType: row.memory_type,
+            importance: row.importance,
+            tags: row.tags || [],
+            metadata: row.metadata || {},
+            embedding: row.embedding ? this.parseEmbedding(row.embedding) : undefined,
+            createdAt: row.created_at,
+            updatedAt: row.updated_at,
+            accessCount: row.access_count || 0,
+            lastAccessedAt: row.last_accessed_at,
+            expiresAt: row.expires_at,
+            consolidatedFrom: row.consolidated_from
+        };
+    }
+    parseEmbedding(embeddingStr) {
+        if (Array.isArray(embeddingStr))
+            return embeddingStr;
+        const cleaned = embeddingStr.replace(/[\[\]]/g, '');
+        return cleaned.split(',').map(Number);
+    }
+}
+export default HumanLikeMemorySystem;
+//# sourceMappingURL=humanLikeMemory.js.map

package/dist/memory/humanLikeMemory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"humanLikeMemory.js","sourceRoot":"","sources":["../../src/memory/humanLikeMemory.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,EAAE,IAAI,MAAM,EAAE,MAAM,MAAM,CAAC;AACpC,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAE5C,OAAO,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AACtE,OAAO,EAAE,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AAqFlE;;;;;;;;GAQG;AACH,MAAM,OAAO,qBAAqB;IACxB,EAAE,CAAM;IACR,iBAAiB,CAAoB;IAE7C,8CAA8C;IACtC,aAAa,GAAgC,IAAI,GAAG,EAAE,CAAC;IACvD,YAAY,GAAG,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,YAAY;IAElD,YAAY,EAAO,EAAE,iBAAoC;QACvD,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,iBAAiB,GAAG,iBAAiB,CAAC;IAC7C,CAAC;IAED,+DAA+D;IAC/D,kCAAkC;IAClC,+DAA+D;IAE/D;;;;;;;OAOG;IACH,uBAAuB,CACrB,UAAgB,EAChB,SAAiB,EACjB,UAA+B;QAE/B,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,eAAe,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,UAAU,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAEvF,uDAAuD;QACvD,MAAM,oBAAoB,GAAG;YAC3B,QAAQ,EAAE,GAAG;YACb,IAAI,EAAE,GAAG;YACT,MAAM,EAAE,GAAG;YACX,GAAG,EAAE,GAAG;YACR,OAAO,EAAE,GAAG;SACb,CAAC,UAAU,CAAC,CAAC;QAEd,MAAM,kBAAkB,GAAG,SAAS,GAAG,oBAAoB,CAAC;QAE5D,qBAAqB;QACrB,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,eAAe,GAAG,kBAAkB,CAAC,CAAC;QAEvE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC;IAClD,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,oBAAoB,CACxB,QAAgB,EAChB,mBAA4B,EAC5B,UAA+B;QAE/B,sCAAsC;QACtC,IAAI,QAAQ,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;QAEtD,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,QAAQ,GAAG,IAAI,CAAC,qBAAqB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QAC9D,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,eAAe,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,QAAQ,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAEhG,IAAI,mBAAmB,EAAE,CAAC;YACxB,wDAAwD;YACxD,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC;YAE/D,gDAAgD;YAChD,MAAM,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;YAClE,QAAQ,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC;YAE7E,kCAAkC;YAClC,QAAQ,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,YAAY,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC;QACnF,CAAC;aAAM,CAAC;YACN,oCAAoC;YACpC,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC;YAC/D,QAAQ,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC;YAC3D,QAAQ,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,mBAAmB;QAChD,CAAC;QAED,QAAQ,CAAC,UAAU,GAAG,GAAG,CAAC;QAC1B,QAAQ,CAAC,WAAW,EAAE,CAAC;QACvB,QAAQ,CAAC,cAAc,GAAG,GAAG,CAAC,CAAC,qBAAqB;QAEpD,sBAAsB;QACtB,MAAM,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;QAExC,eAAe;QACf,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAE3C,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,qBAAqB,CAC3B,QAAgB,EAChB,UAA+B;QAE/B,wCAAwC;QACxC,MAAM,aAAa,GAAG;YACpB,QAAQ,EAAE,EAAE;YACZ,IAAI,EAAE,EAAE;YACR,MAAM,EAAE,EAAE;YACV,GAAG,EAAE,CAAC;YACN,OAAO,EAAE,CAAC;SACX,CAAC,UAAU,CAAC,CAAC;QAEd,OAAO;YACL,QAAQ;YACR,SAAS,EAAE,aAAa;YACxB,cAAc,EAAE,GAAG;YACnB,UAAU,EAAE,IAAI,IAAI,EAAE;YACtB,WAAW,EAAE,CAAC;YACd,YAAY,EAAE,CAAC;YACf,UAAU,EAAE,GAAG,CAAC,cAAc;SAC/B,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,iBAAiB,CACrB,YAAoB,GAAG,EACvB,QAAgB,EAAE;QAElB,iDAAiD;QACjD,MAAM,WAAW,GAAG,iBAAiB,EAAE,CAAC,cAAc,EAAE,CAAC;QAEzD,MAAM,KAAK,GAAG;;;;;;;;;;;;;;;;;;;;KAoBb,CAAC;QAEF,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,SAAS,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC;QAE3E,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAQ,EAAE,EAAE,CAAC,CAAC;YACpC,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;YAC7B,QAAQ,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;gBACxB,QAAQ,EAAE,GAAG,CAAC,EAAE;gBAChB,SAAS,EAAE,GAAG,CAAC,SAAS;gBACxB,cAAc,EAAE,GAAG,CAAC,cAAc;gBAClC,UAAU,EAAE,GAAG,CAAC,WAAW;gBAC3B,WAAW,EAAE,GAAG,CAAC,YAAY;gBAC7B,YAAY,EAAE,GAAG,CAAC,aAAa;gBAC/B,UAAU,EAAE,GAAG,CAAC,WAAW;aAC5B,CAAC,CAAC,CAAC,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,UAAU,CAAC;SACvD,CAAC,CAAC,CAAC;IACN,CAAC;IAED,+DAA+D;IAC/D,oCAAoC;IACpC,+DAA+D;IAE/D;;;;;;;OAOG;IACH,KAAK,CAAC,kBAAkB,CACtB,SAAmB,EACnB,WAAwC,YAAY;QAEpD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO;QAEjC,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;QAEvB,iCAAiC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9C,MAAM,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,CAAE,EAAE,SAAS,CAAC,CAAC,CAAE,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;YACzE,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,cAAc,CAC1B,QAAgB,EAChB,QAAgB,EAChB,QAAqC,EACrC,SAAe;QAEf,iCAAiC;QACjC,MAAM,KAAK,GAAG;;;;;;;;;;;KAWb,CAAC;QAEF,IAAI,CAAC;YACH,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC;QACxE,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,EAAE,2BAA2B,CAAC,CAAC;QAC1E,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,qBAAqB,CACzB,QAAgB,EAChB,QAAgB,CAAC,EACjB,cAAsB,GAAG,EACzB,QAAgB,EAAE;QAElB,+DAA+D;QAC/D,MAAM,KAAK,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KAmCb,CAAC;QAEF,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,QAAQ,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QAEjF,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAQ,EAAE,EAAE,CAAC,CAAC;YACpC,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;YAC7B,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,aAAa,EAAE,GAAG,CAAC,cAAc;SAClC,CAAC,CAAC,CAAC;IACN,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,iBAAiB,CAAC,YAAoB,EAAE;QAC5C,MAAM,KAAK,GAAG;;;;;;;;;KASb,CAAC;QAEF,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;QACvD,OAAO,MAAM,CAAC,QAAQ,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,+DAA+D;IAC/D,+BAA+B;IAC/B,+DAA+D;IAE/D;;OAEG;IACH,KAAK,CAAC,WAAW,CACf,IAAY,EACZ,WAAmB,EACnB,SAAmB,EACnB,SAAmC,EACnC,UAA+B;QAE/B,MAAM,KAAK,GAAgB;YACzB,EAAE,EAAE,MAAM,EAAE;YACZ,IAAI;YACJ,WAAW;YACX,SAAS;YACT,SAAS;YACT,UAAU;YACV,SAAS,EAAE,IAAI,IAAI,EAAE;YACrB,cAAc,EAAE,IAAI,IAAI,EAAE;YAC1B,WAAW,EAAE,CAAC;YACd,QAAQ,EAAE,EAAE;SACb,CAAC;QAEF,MAAM,KAAK,GAAG;;;;;KAKb,CAAC;QAEF,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE;YACzB,KAAK,CAAC,EAAE;YACR,KAAK,CAAC,IAAI;YACV,KAAK,CAAC,WAAW;YACjB,KAAK,CAAC,SAAS;YACf,KAAK,CAAC,SAAS;YACf,KAAK,CAAC,UAAU;YAChB,KAAK,CAAC,SAAS;YACf,KAAK,CAAC,cAAc;YACpB,KAAK,CAAC,WAAW;YACjB,KAAK,CAAC,QAAQ;SACf,CAAC,CAAC;QAEH,iDAAiD;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,MAAM,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,CAAE,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,CAAE,EAAE,QAAQ,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;QACzF,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,CAAC,MAAM,EAAE,EAAE,sBAAsB,CAAC,CAAC;QAErF,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CAAC,OAAe,EAAE,YAAsB;QACvD,MAAM,KAAK,GAAG;;;;;;;;KAQb,CAAC;QAEF,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC;QAEnE,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,SAAS,OAAO,YAAY,CAAC,CAAC;QAChD,CAAC;QAED,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QAE5B,kEAAkE;QAClE,MAAM,WAAW,GAAG,GAAG,CAAC,UAAU,CAAC;QACnC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtD,MAAM,YAAY,GAAG,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC/E,MAAM,IAAI,CAAC,cAAc,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC,CAAE,EAAE,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAC,CAAC;QAClF,CAAC;QAED,OAAO;YACL,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,WAAW,EAAE,GAAG,CAAC,WAAW;YAC5B,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,cAAc,EAAE,GAAG,CAAC,gBAAgB;YACpC,WAAW,EAAE,GAAG,CAAC,YAAY;YAC7B,QAAQ,EAAE,GAAG,CAAC,QAAQ;SACvB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,oBAAoB,CAAC,QAAgB;QACzC,MAAM,KAAK,GAAG;;;;KAIb,CAAC;QAEF,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;QAEtD,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAQ,EAAE,EAAE,CAAC,CAAC;YACpC,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,WAAW,EAAE,GAAG,CAAC,WAAW;YAC5B,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,cAAc,EAAE,GAAG,CAAC,gBAAgB;YACpC,WAAW,EAAE,GAAG,CAAC,YAAY;YAC7B,QAAQ,EAAE,GAAG,CAAC,QAAQ;SACvB,CAAC,CAAC,CAAC;IACN,CAAC;IAED,+DAA+D;IAC/D,2BAA2B;IAC3B,+DAA+D;IAE/D;;;;;;;;OAQG;IACH,KAAK,CAAC,kBAAkB,CACtB,KAAa,EACb,SAAmB,EACnB,UAMI,EAAE;QAEN,MAAM,EACJ,SAAS,GAAG,IAAI,EAChB,YAAY,GAAG,GAAG,EAClB,mBAAmB,GAAG,IAAI,EAC1B,aAAa,GAAG,IAAI,EACpB,mBAAmB,GAAG,CAAC,EACxB,GAAG,OAAO,CAAC;QAEZ,4EAA4E;QAC5E,MAAM,UAAU,GAAG,mBAAmB,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC;QACxE,MAAM,QAAQ,GAAG,MAAM,UAAU,CAAC,kBAAkB,CAAC,UAAU,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QACnF,MAAM,kBAAkB,GAAG,QAAQ,CAAC,SAAS,CAAC;QAE9C,IAAI,QAAQ,CAAC,WAAW,EAAE,CAAC;YACzB,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,EAAE,qDAAqD,CAAC,CAAC;QAClG,CAAC;QAED,iDAAiD;QACjD,MAAM,WAAW,GAAG,iBAAiB,EAAE,CAAC,cAAc,EAAE,CAAC;QAEzD,oDAAoD;QACpD,MAAM,SAAS,GAAG;;;;;;;;;;KAUjB,CAAC;QAEF,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,EAAE;YAChD,IAAI,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG;YACnC,YAAY;YACZ,WAAW;SACZ,CAAC,CAAC;QAEH,MAAM,YAAY,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9E,IAAI,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC;QAEpD,0DAA0D;QAC1D,IAAI,kBAAkB,GAAa,EAAE,CAAC;QACtC,IAAI,mBAAmB,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,IAAI,WAAW,GAAG,SAAS,GAAG,GAAG,EAAE,CAAC;YACpF,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;YAExC,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,sBAAsB;gBACnE,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,qBAAqB,CACjD,IAAI,CAAC,EAAE,EACP,mBAAmB,EACnB,GAAG,EACH,EAAE,CACH,CAAC;gBAEF,KAAK,MAAM,EAAE,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;oBACpC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;wBAC7B,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;wBAChD,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;wBAC7B,kBAAkB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAClC,CAAC;gBACH,CAAC;YACH,CAAC;YAED,WAAW,IAAI,IAAI,CAAC,cAAc,CAAC,kBAAkB,CAAC,CAAC;QACzD,CAAC;QAED,8BAA8B;QAC9B,IAAI,aAAa,GAAa,EAAE,CAAC;QACjC,IAAI,aAAa,IAAI,WAAW,GAAG,SAAS,GAAG,IAAI,EAAE,CAAC;YACpD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;YAEnC,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,sBAAsB;gBACnE,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAExD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,0BAA0B;oBAClE,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;wBACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC;4BACpB,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC;4BACvC,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,CAAC;4BAClD,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;wBACtB,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBACtB,MAAM,UAAU,GAAG;;;;;SAKlB,CAAC;gBACF,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC;gBACzF,aAAa,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC1E,WAAW,IAAI,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;QAED,2DAA2D;QAC3D,IAAI,kBAAkB,GAAa,EAAE,CAAC;QACtC,IAAI,WAAW,GAAG,SAAS,GAAG,IAAI,EAAE,CAAC;YACnC,MAAM,YAAY,GAAG;;;;;;;;;;;OAWpB,CAAC;YAEF,MAAM,WAAW,GAAG;gBAClB,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC9B,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAChC,CAAC;YAEF,6DAA6D;YAC7D,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,YAAY,EAAE;gBACtD,IAAI,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG;gBACnC,WAAW;gBACX,YAAY,GAAG,GAAG,EAAE,2BAA2B;gBAC/C,WAAW;aACZ,CAAC,CAAC;YAEH,kBAAkB,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;QACnF,CAAC;QAED,oDAAoD;QACpD,MAAM,MAAM,GAAG;YACb,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC9B,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;YAChD,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SAC5C,CAAC;QACF,MAAM,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;QAEpD,OAAO;YACL,YAAY;YACZ,kBAAkB;YAClB,aAAa;YACb,kBAAkB;YAClB,kBAAkB,EAAE,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,kBAAkB,CAAC;YACzE,kBAAkB,EAAE,YAAY;YAChC,QAAQ,EAAE,mBAAmB;SAC9B,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,QAAkB;QACvC,0CAA0C;QAC1C,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/E,CAAC;IAED,+DAA+D;IAC/D,iBAAiB;IACjB,+DAA+D;IAEvD,KAAK,CAAC,iBAAiB,CAAC,QAAgB;QAC9C,oBAAoB;QACpB,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAChD,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAE1B,MAAM,KAAK,GAAG;;KAEb,CAAC;QAEF,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;QAEtD,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAE1C,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QAC5B,MAAM,QAAQ,GAAmB;YAC/B,QAAQ,EAAE,GAAG,CAAC,SAAS;YACvB,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,cAAc,EAAE,GAAG,CAAC,cAAc;YAClC,UAAU,EAAE,GAAG,CAAC,WAAW;YAC3B,WAAW,EAAE,GAAG,CAAC,YAAY;YAC7B,YAAY,EAAE,GAAG,CAAC,aAAa;YAC/B,UAAU,EAAE,GAAG,CAAC,WAAW;SAC5B,CAAC;QAEF,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC3C,OAAO,QAAQ,CAAC;IAClB,CAAC;IAEO,KAAK,CAAC,kBAAkB,CAAC,QAAwB;QACvD,MAAM,KAAK,GAAG;;;;;;;;;;;;;KAab,CAAC;QAEF,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE;YACzB,QAAQ,CAAC,QAAQ;YACjB,QAAQ,CAAC,SAAS;YAClB,QAAQ,CAAC,cAAc;YACvB,QAAQ,CAAC,UAAU;YACnB,QAAQ,CAAC,WAAW;YACpB,QAAQ,CAAC,YAAY;YACrB,QAAQ,CAAC,UAAU;SACpB,CAAC,CAAC;IACL,CAAC;IAEO,WAAW,CAAC,GAAQ;QAC1B,OAAO;YACL,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,UAAU,EAAE,GAAG,CAAC,WAAW;YAC3B,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE;YACpB,QAAQ,EAAE,GAAG,CAAC,QAAQ,IAAI,EAAE;YAC5B,SAAS,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS;YACzE,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,WAAW,EAAE,GAAG,CAAC,YAAY,IAAI,CAAC;YAClC,cAAc,EAAE,GAAG,CAAC,gBAAgB;YACpC,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,gBAAgB,EAAE,GAAG,CAAC,iBAAiB;SACxC,CAAC;IACJ,CAAC;IAEO,cAAc,CAAC,YAAoB;QACzC,IAAI,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC;YAAE,OAAO,YAAY,CAAC;QACrD,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QACpD,OAAO,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACxC,CAAC;CACF;AAED,eAAe,qBAAqB,CAAC"}

package/dist/memory/index.d.ts

@@ -0,0 +1,22 @@
+/**
+ * memory/index.ts - Human-Like Memory Evolution System
+ *
+ * This module exports all components for SpecMem's evolved memory architecture:
+ *
+ * 1. HumanLikeMemorySystem - Core system with forgetting curves, associations, chains
+ * 2. QuadrantSearchSystem - Spatial/semantic partitioning for fast search
+ * 3. Migration utilities - Database schema for evolution features
+ *
+ * The goal is to make 's memory more natural and intelligent,
+ * supporting human-like patterns of:
+ * - Forgetting (Ebbinghaus curves)
+ * - Association (spreading activation)
+ * - Reasoning chains (sequential paths)
+ * - Adaptive context (dynamic windows)
+ * - Spatial organization (quadrants)
+ */
+export { HumanLikeMemorySystem, type MemoryStrength, type AssociativeLink, type MemoryChain, type ContextWindow } from './humanLikeMemory.js';
+export { QuadrantSearchSystem, type Quadrant, type QuadrantSearchResult, type QuadrantAssignment } from './quadrantSearch.js';
+export { MEMORY_EVOLUTION_MIGRATIONS, getMemoryEvolutionMigrationSQL, getMemoryEvolutionRollbackSQL } from './memoryEvolutionMigration.js';
+export type { Memory, MemoryType, ImportanceLevelType, SearchResult } from '../types/index.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/memory/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAGH,OAAO,EACL,qBAAqB,EACrB,KAAK,cAAc,EACnB,KAAK,eAAe,EACpB,KAAK,WAAW,EAChB,KAAK,aAAa,EACnB,MAAM,sBAAsB,CAAC;AAG9B,OAAO,EACL,oBAAoB,EACpB,KAAK,QAAQ,EACb,KAAK,oBAAoB,EACzB,KAAK,kBAAkB,EACxB,MAAM,qBAAqB,CAAC;AAG7B,OAAO,EACL,2BAA2B,EAC3B,8BAA8B,EAC9B,6BAA6B,EAC9B,MAAM,+BAA+B,CAAC;AAGvC,YAAY,EACV,MAAM,EACN,UAAU,EACV,mBAAmB,EACnB,YAAY,EACb,MAAM,mBAAmB,CAAC"}

package/dist/memory/index.js

@@ -0,0 +1,24 @@
+/**
+ * memory/index.ts - Human-Like Memory Evolution System
+ *
+ * This module exports all components for SpecMem's evolved memory architecture:
+ *
+ * 1. HumanLikeMemorySystem - Core system with forgetting curves, associations, chains
+ * 2. QuadrantSearchSystem - Spatial/semantic partitioning for fast search
+ * 3. Migration utilities - Database schema for evolution features
+ *
+ * The goal is to make 's memory more natural and intelligent,
+ * supporting human-like patterns of:
+ * - Forgetting (Ebbinghaus curves)
+ * - Association (spreading activation)
+ * - Reasoning chains (sequential paths)
+ * - Adaptive context (dynamic windows)
+ * - Spatial organization (quadrants)
+ */
+// Core human-like memory system
+export { HumanLikeMemorySystem } from './humanLikeMemory.js';
+// Quadrant-based search system
+export { QuadrantSearchSystem } from './quadrantSearch.js';
+// Database migrations
+export { MEMORY_EVOLUTION_MIGRATIONS, getMemoryEvolutionMigrationSQL, getMemoryEvolutionRollbackSQL } from './memoryEvolutionMigration.js';
+//# sourceMappingURL=index.js.map