codehere 0.1.0 → 0.2.0

package/dist/domain/services/memory-retriever.js

@@ -0,0 +1,82 @@
+/**
+ * Domain Service: MemoryRetriever
+ * Retrieves relevant memories using 3-factor scoring + Graded Activation
+ * (Recency × Importance × Relevance × Activation)
+ *
+ * Pure domain logic - no external dependencies
+ */
+import { GradedMemoryActivation } from './graded-memory-activation.js';
+export class MemoryRetriever {
+    DECAY_CONSTANT = 86400000; // 24 hours in ms
+    gradedActivation;
+    constructor() {
+        this.gradedActivation = new GradedMemoryActivation();
+    }
+    /**
+     * Retrieve relevant memories with 3-factor scoring + graded activation
+     * @param memories - All available memories
+     * @param queryEmbedding - Pre-computed query embedding vector
+     * @param limit - Maximum number of memories to return
+     * @param useGradedActivation - Whether to apply g(t) function (default: true)
+     */
+    retrieve(memories, queryEmbedding, limit, useGradedActivation = true) {
+        if (memories.length === 0) {
+            return [];
+        }
+        // Score each memory with 3-factor scoring
+        const scored = memories.map((memory) => {
+            const recency = this.calculateRecency(memory.lastAccessed);
+            const importance = memory.importance / 10; // Normalize to 0-1
+            const relevance = this.cosineSimilarity(queryEmbedding, memory.embedding);
+            const baseScore = recency * importance * relevance;
+            return { memory, baseScore };
+        });
+        // Apply graded activation if enabled
+        let finalScored;
+        if (useGradedActivation && memories.length > 10) {
+            // Use graded activation for strategic learning
+            finalScored = this.gradedActivation.applyGradedActivation(scored);
+        }
+        else {
+            finalScored = scored.map(({ memory, baseScore }) => ({
+                memory,
+                finalScore: baseScore,
+            }));
+        }
+        // Sort by final score and return top N
+        return finalScored
+            .sort((a, b) => b.finalScore - a.finalScore)
+            .slice(0, limit)
+            .map(({ memory }) => memory);
+    }
+    /**
+     * Calculate recency score (exponential decay)
+     */
+    calculateRecency(lastAccessed) {
+        const now = Date.now();
+        const timeSinceAccess = now - lastAccessed.getTime();
+        return Math.exp(-timeSinceAccess / this.DECAY_CONSTANT);
+    }
+    /**
+     * Calculate cosine similarity
+     */
+    cosineSimilarity(a, b) {
+        if (a.length !== b.length) {
+            return 0;
+        }
+        let dotProduct = 0;
+        let normA = 0;
+        let normB = 0;
+        for (let i = 0; i < a.length; i++) {
+            dotProduct += a[i] * b[i];
+            normA += a[i] * a[i];
+            normB += b[i] * b[i];
+        }
+        const denominator = Math.sqrt(normA) * Math.sqrt(normB);
+        if (denominator === 0) {
+            return 0;
+        }
+        return dotProduct / denominator;
+    }
+}
+//# sourceMappingURL=memory-retriever.js.map

package/dist/domain/services/memory-retriever.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-retriever.js","sourceRoot":"","sources":["../../../src/domain/services/memory-retriever.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,EAAE,sBAAsB,EAAE,MAAM,+BAA+B,CAAC;AAEvE,MAAM,OAAO,eAAe;IACT,cAAc,GAAG,QAAQ,CAAC,CAAC,iBAAiB;IACrD,gBAAgB,CAAyB;IAEjD;QACE,IAAI,CAAC,gBAAgB,GAAG,IAAI,sBAAsB,EAAE,CAAC;IACvD,CAAC;IAED;;;;;;OAMG;IACH,QAAQ,CACN,QAAkB,EAClB,cAAwB,EACxB,KAAa,EACb,sBAA+B,IAAI;QAEnC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,0CAA0C;QAC1C,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;YACrC,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YAC3D,MAAM,UAAU,GAAG,MAAM,CAAC,UAAU,GAAG,EAAE,CAAC,CAAC,mBAAmB;YAC9D,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CACrC,cAAc,EACd,MAAM,CAAC,SAAS,CACjB,CAAC;YAEF,MAAM,SAAS,GAAG,OAAO,GAAG,UAAU,GAAG,SAAS,CAAC;YAEnD,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,qCAAqC;QACrC,IAAI,WAA0D,CAAC;QAC/D,IAAI,mBAAmB,IAAI,QAAQ,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;YAChD,+CAA+C;YAC/C,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;QACpE,CAAC;aAAM,CAAC;YACN,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAC;gBACnD,MAAM;gBACN,UAAU,EAAE,SAAS;aACtB,CAAC,CAAC,CAAC;QACN,CAAC;QAED,uCAAuC;QACvC,OAAO,WAAW;aACf,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;aAC3C,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;aACf,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,YAAkB;QACzC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,eAAe,GAAG,GAAG,GAAG,YAAY,CAAC,OAAO,EAAE,CAAC;QACrD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,eAAe,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC;IAC1D,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,CAAW,EAAE,CAAW;QAC/C,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;YAC1B,OAAO,CAAC,CAAC;QACX,CAAC;QAED,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxD,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;YACtB,OAAO,CAAC,CAAC;QACX,CAAC;QAED,OAAO,UAAU,GAAG,WAAW,CAAC;IAClC,CAAC;CACF"}

package/dist/domain/services/memory-synthesizer.d.ts

@@ -0,0 +1,57 @@
+/**
+ * Domain Service: Memory Synthesizer
+ * Synthesizes episodic memories into higher-level reflections
+ */
+import type { Memory } from '../entities/memory.js';
+import type { PatternExtractor } from './pattern-extractor.js';
+export interface Reflection {
+    id: string;
+    question: string;
+    insight: string;
+    evidence: string[];
+    timestamp: Date;
+    parentReflectionId?: string;
+    level: number;
+}
+export interface MemorySynthesisResult {
+    reflections: Reflection[];
+    salientQuestions: string[];
+    synthesizedContext: string;
+}
+/**
+ * Synthesize memories into hierarchical reflections
+ * Process:
+ * 1. Query recent memories to identify salient questions
+ * 2. Use questions to retrieve relevant memories
+ * 3. Extract insights and cite evidence
+ * 4. Create trees of reflections (non-leaf nodes = abstract thoughts)
+ */
+export declare class MemorySynthesizer {
+    private patternExtractor?;
+    constructor(patternExtractor?: PatternExtractor | undefined);
+    /**
+     * Generate salient questions from recent memories
+     * These questions help identify what high-level insights can be extracted
+     */
+    generateSalientQuestions(memories: Memory[], maxQuestions?: number): string[];
+    /**
+     * Extract patterns from memory reflections (if pattern extractor available)
+     */
+    extractPatternsFromReflections(memories: Memory[], codebaseId: string, codebasePath: string): Promise<void>;
+    /**
+     * Synthesize memories into reflections
+     * Takes raw observations and creates higher-level insights
+     */
+    synthesizeReflections(memories: Memory[], questions: string[]): Reflection[];
+    /**
+     * Build trees of reflections
+     * Non-leaf nodes represent abstract thoughts that influence future decisions
+     */
+    buildReflectionTree(reflections: Reflection[]): Reflection[];
+    /**
+     * Retrieve relevant memories for planning context
+     * Uses 3-factor scoring: Recency × Importance × Relevance
+     */
+    retrieveForPlanning(query: string, allMemories: Memory[], maxMemories?: number): Memory[];
+}
+//# sourceMappingURL=memory-synthesizer.d.ts.map

package/dist/domain/services/memory-synthesizer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-synthesizer.d.ts","sourceRoot":"","sources":["../../../src/domain/services/memory-synthesizer.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAE/D,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,SAAS,EAAE,IAAI,CAAC;IAChB,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,qBAAqB;IACpC,WAAW,EAAE,UAAU,EAAE,CAAC;IAC1B,gBAAgB,EAAE,MAAM,EAAE,CAAC;IAC3B,kBAAkB,EAAE,MAAM,CAAC;CAC5B;AAED;;;;;;;GAOG;AACH,qBAAa,iBAAiB;IAChB,OAAO,CAAC,gBAAgB,CAAC;gBAAjB,gBAAgB,CAAC,EAAE,gBAAgB,YAAA;IAEvD;;;OAGG;IACH,wBAAwB,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,YAAY,GAAE,MAAU,GAAG,MAAM,EAAE;IAMhF;;OAEG;IACG,8BAA8B,CAClC,QAAQ,EAAE,MAAM,EAAE,EAClB,UAAU,EAAE,MAAM,EAClB,YAAY,EAAE,MAAM,GACnB,OAAO,CAAC,IAAI,CAAC;IAchB;;;OAGG;IACH,qBAAqB,CACnB,QAAQ,EAAE,MAAM,EAAE,EAClB,SAAS,EAAE,MAAM,EAAE,GAClB,UAAU,EAAE;IAMf;;;OAGG;IACH,mBAAmB,CAAC,WAAW,EAAE,UAAU,EAAE,GAAG,UAAU,EAAE;IA4B5D;;;OAGG;IACH,mBAAmB,CACjB,KAAK,EAAE,MAAM,EACb,WAAW,EAAE,MAAM,EAAE,EACrB,WAAW,GAAE,MAAY,GACxB,MAAM,EAAE;CAKZ"}

package/dist/domain/services/memory-synthesizer.js

@@ -0,0 +1,91 @@
+/**
+ * Domain Service: Memory Synthesizer
+ * Synthesizes episodic memories into higher-level reflections
+ */
+/**
+ * Synthesize memories into hierarchical reflections
+ * Process:
+ * 1. Query recent memories to identify salient questions
+ * 2. Use questions to retrieve relevant memories
+ * 3. Extract insights and cite evidence
+ * 4. Create trees of reflections (non-leaf nodes = abstract thoughts)
+ */
+export class MemorySynthesizer {
+    patternExtractor;
+    constructor(patternExtractor) {
+        this.patternExtractor = patternExtractor;
+    }
+    /**
+     * Generate salient questions from recent memories
+     * These questions help identify what high-level insights can be extracted
+     */
+    generateSalientQuestions(memories, maxQuestions = 5) {
+        // This will be implemented using AI in the application layer
+        // For now, return placeholder
+        return [];
+    }
+    /**
+     * Extract patterns from memory reflections (if pattern extractor available)
+     */
+    async extractPatternsFromReflections(memories, codebaseId, codebasePath) {
+        if (!this.patternExtractor) {
+            return; // Pattern extraction not available
+        }
+        try {
+            // Extract patterns from memory reflections
+            await this.patternExtractor.extractFromMemory(memories, codebaseId, codebasePath);
+        }
+        catch (error) {
+            // Don't fail memory synthesis if pattern extraction fails
+            console.warn('Pattern extraction from memories failed (non-critical):', error);
+        }
+    }
+    /**
+     * Synthesize memories into reflections
+     * Takes raw observations and creates higher-level insights
+     */
+    synthesizeReflections(memories, questions) {
+        // This will be implemented using AI in the application layer
+        // Returns reflections with evidence citations
+        return [];
+    }
+    /**
+     * Build trees of reflections
+     * Non-leaf nodes represent abstract thoughts that influence future decisions
+     */
+    buildReflectionTree(reflections) {
+        // Organize reflections hierarchically
+        // Parent reflections are more abstract, children are more specific
+        const tree = [];
+        const byParent = new Map();
+        // Group by parent
+        for (const reflection of reflections) {
+            if (reflection.parentReflectionId) {
+                if (!byParent.has(reflection.parentReflectionId)) {
+                    byParent.set(reflection.parentReflectionId, []);
+                }
+                byParent.get(reflection.parentReflectionId).push(reflection);
+            }
+            else {
+                tree.push(reflection);
+            }
+        }
+        // Attach children to parents
+        const attachChildren = (parent) => {
+            const children = byParent.get(parent.id) || [];
+            // In a full implementation, we'd attach children here
+            return parent;
+        };
+        return tree.map(attachChildren);
+    }
+    /**
+     * Retrieve relevant memories for planning context
+     * Uses 3-factor scoring: Recency × Importance × Relevance
+     */
+    retrieveForPlanning(query, allMemories, maxMemories = 100) {
+        // This uses the same 3-factor scoring as MemoryRetriever
+        // Will be implemented in application layer with actual retrieval
+        return allMemories.slice(0, maxMemories);
+    }
+}
+//# sourceMappingURL=memory-synthesizer.js.map

package/dist/domain/services/memory-synthesizer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-synthesizer.js","sourceRoot":"","sources":["../../../src/domain/services/memory-synthesizer.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAqBH;;;;;;;GAOG;AACH,MAAM,OAAO,iBAAiB;IACR;IAApB,YAAoB,gBAAmC;QAAnC,qBAAgB,GAAhB,gBAAgB,CAAmB;IAAG,CAAC;IAE3D;;;OAGG;IACH,wBAAwB,CAAC,QAAkB,EAAE,eAAuB,CAAC;QACnE,6DAA6D;QAC7D,8BAA8B;QAC9B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,8BAA8B,CAClC,QAAkB,EAClB,UAAkB,EAClB,YAAoB;QAEpB,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC3B,OAAO,CAAC,mCAAmC;QAC7C,CAAC;QAED,IAAI,CAAC;YACH,2CAA2C;YAC3C,MAAM,IAAI,CAAC,gBAAgB,CAAC,iBAAiB,CAAC,QAAQ,EAAE,UAAU,EAAE,YAAY,CAAC,CAAC;QACpF,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,0DAA0D;YAC1D,OAAO,CAAC,IAAI,CAAC,yDAAyD,EAAE,KAAK,CAAC,CAAC;QACjF,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,qBAAqB,CACnB,QAAkB,EAClB,SAAmB;QAEnB,6DAA6D;QAC7D,8CAA8C;QAC9C,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;;OAGG;IACH,mBAAmB,CAAC,WAAyB;QAC3C,sCAAsC;QACtC,mEAAmE;QACnE,MAAM,IAAI,GAAiB,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAwB,CAAC;QAEjD,kBAAkB;QAClB,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;YACrC,IAAI,UAAU,CAAC,kBAAkB,EAAE,CAAC;gBAClC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,kBAAkB,CAAC,EAAE,CAAC;oBACjD,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,kBAAkB,EAAE,EAAE,CAAC,CAAC;gBAClD,CAAC;gBACD,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,kBAAkB,CAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAChE,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QAED,6BAA6B;QAC7B,MAAM,cAAc,GAAG,CAAC,MAAkB,EAAE,EAAE;YAC5C,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YAC/C,sDAAsD;YACtD,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC;QAEF,OAAO,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IAClC,CAAC;IAED;;;OAGG;IACH,mBAAmB,CACjB,KAAa,EACb,WAAqB,EACrB,cAAsB,GAAG;QAEzB,yDAAyD;QACzD,iEAAiE;QACjE,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IAC3C,CAAC;CACF"}

package/dist/domain/services/pattern-extractor.d.ts

@@ -0,0 +1,108 @@
+/**
+ * Domain Service: PatternExtractor
+ * Extracts patterns from code, memories, and codebase analysis
+ *
+ * Clean Architecture: Domain Layer
+ * Pattern: Strategy Pattern (different extraction strategies for different pattern types)
+ *
+ * Responsibilities:
+ * - Extract patterns from code files
+ * - Extract patterns from memory reflections
+ * - Identify pattern types (architectural, structural, behavioral, etc.)
+ * - Store patterns in pattern repository
+ */
+import type { Pattern, PatternType } from '../entities/pattern.js';
+import type { IPatternRepository } from '../interfaces/pattern-repository.interface.js';
+import type { Memory } from '../entities/memory.js';
+import type { IAIService } from '../interfaces/ai-service.interface.js';
+export interface PatternExtractionRequest {
+    codebaseId: string;
+    codebasePath: string;
+    source: 'code' | 'memory' | 'reflection' | 'manual';
+    content?: string;
+    filepath?: string;
+    lineNumbers?: {
+        start: number;
+        end: number;
+    };
+    metadata?: any;
+}
+export interface PatternExtractionResult {
+    patterns: Pattern[];
+    extractionMethod: string;
+    confidence: number;
+}
+/**
+ * Pattern Extractor Service
+ * Uses AI to identify and extract patterns from various sources
+ */
+export declare class PatternExtractor {
+    private patternRepository;
+    private aiService;
+    constructor(patternRepository: IPatternRepository, aiService: IAIService);
+    /**
+     * Extract patterns from code
+     */
+    extractFromCode(request: PatternExtractionRequest): Promise<PatternExtractionResult>;
+    /**
+     * Extract patterns from memory reflections
+     */
+    extractFromMemory(memories: Memory[], codebaseId: string, codebasePath: string): Promise<PatternExtractionResult>;
+    /**
+     * Extract patterns from a reflection description
+     */
+    private extractFromReflection;
+    /**
+     * Extract structural patterns from code (file organization, naming conventions)
+     */
+    private extractStructuralPatterns;
+    /**
+     * Extract patterns using AI analysis
+     */
+    private extractPatternsWithAI;
+    /**
+     * Extract idiomatic patterns (language-specific conventions)
+     */
+    private extractIdiomaticPatterns;
+    /**
+     * Detect TypeScript/JavaScript idioms
+     */
+    private detectTypeScriptIdioms;
+    /**
+     * Extract patterns by keyword matching (fallback when AI fails)
+     */
+    private extractPatternsByKeywords;
+    /**
+     * Helper: Detect naming convention
+     */
+    private detectNamingConvention;
+    /**
+     * Helper: Get naming pattern
+     */
+    private getNamingPattern;
+    /**
+     * Helper: Detect directory structure pattern
+     */
+    private detectDirectoryStructure;
+    /**
+     * Helper: Get directory pattern
+     */
+    private getDirectoryPattern;
+    /**
+     * Helper: Extract code example matching regex
+     */
+    private extractCodeExample;
+    /**
+     * Helper: Calculate overall confidence
+     */
+    private calculateConfidence;
+    /**
+     * Get existing patterns for a codebase (useful for pattern reuse)
+     */
+    getExistingPatterns(codebaseId: string, type?: PatternType): Promise<Pattern[]>;
+    /**
+     * Suggest patterns for a given task
+     */
+    suggestPatterns(task: string, codebaseId: string, limit?: number): Promise<Pattern[]>;
+}
+//# sourceMappingURL=pattern-extractor.d.ts.map

package/dist/domain/services/pattern-extractor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pattern-extractor.d.ts","sourceRoot":"","sources":["../../../src/domain/services/pattern-extractor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,WAAW,EAAmB,MAAM,wBAAwB,CAAC;AACpF,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,+CAA+C,CAAC;AACxF,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,uCAAuC,CAAC;AAGxE,MAAM,WAAW,wBAAwB;IACvC,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,MAAM,EAAE,MAAM,GAAG,QAAQ,GAAG,YAAY,GAAG,QAAQ,CAAC;IACpD,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC;IAC7C,QAAQ,CAAC,EAAE,GAAG,CAAC;CAChB;AAED,MAAM,WAAW,uBAAuB;IACtC,QAAQ,EAAE,OAAO,EAAE,CAAC;IACpB,gBAAgB,EAAE,MAAM,CAAC;IACzB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;GAGG;AACH,qBAAa,gBAAgB;IAEzB,OAAO,CAAC,iBAAiB;IACzB,OAAO,CAAC,SAAS;gBADT,iBAAiB,EAAE,kBAAkB,EACrC,SAAS,EAAE,UAAU;IAG/B;;OAEG;IACG,eAAe,CAAC,OAAO,EAAE,wBAAwB,GAAG,OAAO,CAAC,uBAAuB,CAAC;IA+B1F;;OAEG;IACG,iBAAiB,CACrB,QAAQ,EAAE,MAAM,EAAE,EAClB,UAAU,EAAE,MAAM,EAClB,YAAY,EAAE,MAAM,GACnB,OAAO,CAAC,uBAAuB,CAAC;IA6BnC;;OAEG;YACW,qBAAqB;IAmEnC;;OAEG;IACH,OAAO,CAAC,yBAAyB;IAoDjC;;OAEG;YACW,qBAAqB;IAkEnC;;OAEG;YACW,wBAAwB;IAatC;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAsE9B;;OAEG;IACH,OAAO,CAAC,yBAAyB;IA+CjC;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAQ9B;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAQxB;;OAEG;IACH,OAAO,CAAC,wBAAwB;IAKhC;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAK3B;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAK1B;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAQ3B;;OAEG;IACG,mBAAmB,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;IAOrF;;OAEG;IACG,eAAe,CACnB,IAAI,EAAE,MAAM,EACZ,UAAU,EAAE,MAAM,EAClB,KAAK,GAAE,MAAU,GAChB,OAAO,CAAC,OAAO,EAAE,CAAC;CAItB"}