recker 1.0.12-alpha.04c18a7 → 1.0.12-alpha.1ab8aa7

package/dist/mcp/search/hybrid-search.js

@@ -0,0 +1,286 @@
+import Fuse from 'fuse.js';
+import { cosineSimilarity, combineScores, levenshtein } from './math.js';
+let cachedEmbeddings = null;
+export class HybridSearch {
+    fuse = null;
+    docs = [];
+    vectors = new Map();
+    embeddingsData = null;
+    initialized = false;
+    config;
+    constructor(config = {}) {
+        this.config = {
+            fuzzyThreshold: config.fuzzyThreshold ?? 0.4,
+            fuzzyWeight: config.fuzzyWeight ?? 0.5,
+            semanticWeight: config.semanticWeight ?? 0.5,
+            debug: config.debug ?? false,
+        };
+    }
+    async initialize(docs) {
+        this.docs = docs;
+        this.fuse = new Fuse(docs, {
+            keys: [
+                { name: 'title', weight: 3 },
+                { name: 'keywords', weight: 2 },
+                { name: 'path', weight: 1.5 },
+                { name: 'content', weight: 1 },
+            ],
+            includeScore: true,
+            threshold: this.config.fuzzyThreshold,
+            ignoreLocation: true,
+            useExtendedSearch: true,
+            findAllMatches: true,
+        });
+        await this.loadPrecomputedEmbeddings();
+        this.initialized = true;
+        this.log(`Initialized with ${docs.length} docs, ${this.vectors.size} embeddings`);
+    }
+    async loadPrecomputedEmbeddings() {
+        try {
+            if (cachedEmbeddings) {
+                this.embeddingsData = cachedEmbeddings;
+            }
+            else {
+                const embeddingsPath = new URL('../data/embeddings.json', import.meta.url);
+                try {
+                    const response = await fetch(embeddingsPath);
+                    if (response.ok) {
+                        this.embeddingsData = (await response.json());
+                        cachedEmbeddings = this.embeddingsData;
+                    }
+                }
+                catch {
+                    try {
+                        const fs = await import('fs');
+                        const path = await import('path');
+                        const embeddingsFile = path.join(path.dirname(new URL(import.meta.url).pathname), '../data/embeddings.json');
+                        if (fs.existsSync(embeddingsFile)) {
+                            const data = fs.readFileSync(embeddingsFile, 'utf-8');
+                            this.embeddingsData = JSON.parse(data);
+                            cachedEmbeddings = this.embeddingsData;
+                        }
+                    }
+                    catch {
+                    }
+                }
+            }
+            if (this.embeddingsData) {
+                for (const entry of this.embeddingsData.documents) {
+                    if (entry.vector && entry.vector.length > 0) {
+                        this.vectors.set(entry.id, entry.vector);
+                    }
+                }
+                this.log(`Loaded ${this.vectors.size} pre-computed embeddings (model: ${this.embeddingsData.model})`);
+            }
+        }
+        catch (error) {
+            this.log(`No pre-computed embeddings found: ${error}`);
+        }
+    }
+    async search(query, options = {}) {
+        const { limit = 10, category, mode = 'hybrid', minScore = 0 } = options;
+        if (!this.initialized) {
+            throw new Error('HybridSearch not initialized. Call initialize() first.');
+        }
+        const results = new Map();
+        if (mode === 'hybrid' || mode === 'fuzzy') {
+            const fuzzyResults = this.fuzzySearch(query, limit * 2, category);
+            for (const result of fuzzyResults) {
+                results.set(result.id, result);
+            }
+            this.log(`Fuzzy search found ${fuzzyResults.length} results`);
+        }
+        if ((mode === 'hybrid' || mode === 'semantic') && this.vectors.size > 0) {
+            const semanticResults = this.semanticSearch(query, limit * 2, category);
+            for (const result of semanticResults) {
+                const existing = results.get(result.id);
+                if (existing) {
+                    existing.score = combineScores(existing.score, result.score);
+                    existing.source = 'hybrid';
+                }
+                else {
+                    results.set(result.id, result);
+                }
+            }
+            this.log(`Semantic search found ${semanticResults.length} results`);
+        }
+        return Array.from(results.values())
+            .filter((r) => r.score >= minScore)
+            .sort((a, b) => b.score - a.score)
+            .slice(0, limit);
+    }
+    fuzzySearch(query, limit, category) {
+        if (!this.fuse)
+            return [];
+        let results = this.fuse.search(query, { limit: limit * 2 });
+        if (category) {
+            results = results.filter((r) => r.item.category.toLowerCase().includes(category.toLowerCase()));
+        }
+        return results.slice(0, limit).map((r) => ({
+            id: r.item.id,
+            path: r.item.path,
+            title: r.item.title,
+            content: r.item.content,
+            snippet: this.extractSnippet(r.item.content, query),
+            score: 1 - (r.score || 0),
+            source: 'fuzzy',
+        }));
+    }
+    semanticSearch(query, limit, category) {
+        if (!this.embeddingsData || this.vectors.size === 0) {
+            return [];
+        }
+        const queryTerms = this.tokenize(query);
+        const scores = [];
+        for (const entry of this.embeddingsData.documents) {
+            if (category && !entry.category.toLowerCase().includes(category.toLowerCase())) {
+                continue;
+            }
+            let termScore = 0;
+            const docText = `${entry.title} ${entry.keywords?.join(' ') || ''}`.toLowerCase();
+            const docTerms = this.tokenize(docText);
+            for (const queryTerm of queryTerms) {
+                if (docTerms.includes(queryTerm)) {
+                    termScore += 2;
+                    continue;
+                }
+                for (const docTerm of docTerms) {
+                    const distance = levenshtein(queryTerm, docTerm);
+                    const maxLen = Math.max(queryTerm.length, docTerm.length);
+                    if (distance <= Math.min(2, maxLen * 0.3)) {
+                        termScore += 1 - distance / maxLen;
+                        break;
+                    }
+                }
+            }
+            const normalizedScore = Math.min(1, termScore / (queryTerms.length * 2));
+            if (normalizedScore > 0.1) {
+                scores.push({ id: entry.id, score: normalizedScore });
+            }
+        }
+        const topDocs = scores.sort((a, b) => b.score - a.score).slice(0, 3);
+        if (topDocs.length > 0) {
+            const topVectors = topDocs
+                .map((d) => this.vectors.get(d.id))
+                .filter((v) => Array.isArray(v) && v.length > 0);
+            if (topVectors.length > 0 && topVectors.every((v) => v.length === topVectors[0].length)) {
+                const avgVector = this.averageVectors(topVectors);
+                const expectedDimensions = avgVector.length;
+                for (const entry of this.embeddingsData.documents) {
+                    if (scores.some((s) => s.id === entry.id))
+                        continue;
+                    if (category && !entry.category.toLowerCase().includes(category.toLowerCase()))
+                        continue;
+                    const vector = this.vectors.get(entry.id);
+                    if (!vector || vector.length === 0 || vector.length !== expectedDimensions)
+                        continue;
+                    const similarity = cosineSimilarity(avgVector, vector);
+                    if (similarity > 0.7) {
+                        scores.push({ id: entry.id, score: similarity * 0.5 });
+                    }
+                }
+            }
+        }
+        const results = [];
+        for (const s of scores.sort((a, b) => b.score - a.score).slice(0, limit)) {
+            const doc = this.docs.find((d) => d.id === s.id);
+            const entry = this.embeddingsData.documents.find((e) => e.id === s.id);
+            if (!doc && !entry) {
+                continue;
+            }
+            const title = doc?.title || entry?.title || 'Unknown';
+            const path = doc?.path || entry?.path || '';
+            const content = doc?.content || '';
+            results.push({
+                id: s.id,
+                path,
+                title,
+                content,
+                snippet: this.extractSnippet(content, query),
+                score: s.score,
+                source: 'semantic',
+            });
+        }
+        return results;
+    }
+    extractSnippet(content, query) {
+        if (!content)
+            return '';
+        const lowerContent = content.toLowerCase();
+        const queryTerms = this.tokenize(query);
+        let bestIndex = -1;
+        let bestScore = 0;
+        for (const term of queryTerms) {
+            const idx = lowerContent.indexOf(term);
+            if (idx !== -1) {
+                bestIndex = idx;
+                bestScore = term.length;
+                break;
+            }
+        }
+        if (bestIndex === -1) {
+            const words = lowerContent.split(/\s+/).slice(0, 500);
+            for (let i = 0; i < words.length; i++) {
+                for (const term of queryTerms) {
+                    const dist = levenshtein(words[i].slice(0, 20), term.slice(0, 20));
+                    if (dist <= 2 && dist < bestScore) {
+                        bestScore = dist;
+                        bestIndex = lowerContent.indexOf(words[i]);
+                    }
+                }
+            }
+        }
+        if (bestIndex === -1) {
+            return content.slice(0, 200).trim() + (content.length > 200 ? '...' : '');
+        }
+        const start = Math.max(0, bestIndex - 50);
+        const end = Math.min(content.length, bestIndex + 150);
+        let snippet = content.slice(start, end).trim();
+        if (start > 0)
+            snippet = '...' + snippet;
+        if (end < content.length)
+            snippet = snippet + '...';
+        return snippet.replace(/\n+/g, ' ').replace(/\s+/g, ' ');
+    }
+    tokenize(text) {
+        return text
+            .toLowerCase()
+            .split(/[\s\-_.,;:!?()[\]{}'"]+/)
+            .filter((t) => t.length > 2);
+    }
+    averageVectors(vectors) {
+        if (vectors.length === 0)
+            return [];
+        if (vectors.length === 1)
+            return vectors[0];
+        const result = new Array(vectors[0].length).fill(0);
+        for (const vec of vectors) {
+            for (let i = 0; i < vec.length; i++) {
+                result[i] += vec[i];
+            }
+        }
+        for (let i = 0; i < result.length; i++) {
+            result[i] /= vectors.length;
+        }
+        return result;
+    }
+    hasEmbeddings() {
+        return this.vectors.size > 0;
+    }
+    getStats() {
+        return {
+            documents: this.docs.length,
+            embeddings: this.vectors.size,
+            model: this.embeddingsData?.model,
+            dimensions: this.embeddingsData?.dimensions,
+        };
+    }
+    log(message) {
+        if (this.config.debug) {
+            console.log(`[HybridSearch] ${message}`);
+        }
+    }
+}
+export function createHybridSearch(config) {
+    return new HybridSearch(config);
+}

package/dist/mcp/search/index.d.ts

@@ -0,0 +1,4 @@
+export { HybridSearch, createHybridSearch } from './hybrid-search.js';
+export { cosineSimilarity, levenshtein, stringSimilarity, reciprocalRankFusion, combineScores, } from './math.js';
+export type { IndexedDoc, SearchResult, SearchOptions, HybridSearchConfig, EmbeddingsData, EmbeddingEntry, } from './types.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/mcp/search/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/mcp/search/index.ts"],"names":[],"mappings":"AAmBA,OAAO,EAAE,YAAY,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACtE,OAAO,EACL,gBAAgB,EAChB,WAAW,EACX,gBAAgB,EAChB,oBAAoB,EACpB,aAAa,GACd,MAAM,WAAW,CAAC;AACnB,YAAY,EACV,UAAU,EACV,YAAY,EACZ,aAAa,EACb,kBAAkB,EAClB,cAAc,EACd,cAAc,GACf,MAAM,YAAY,CAAC"}

package/dist/mcp/search/index.js

@@ -0,0 +1,2 @@
+export { HybridSearch, createHybridSearch } from './hybrid-search.js';
+export { cosineSimilarity, levenshtein, stringSimilarity, reciprocalRankFusion, combineScores, } from './math.js';

package/dist/mcp/search/math.d.ts

@@ -0,0 +1,6 @@
+export declare function cosineSimilarity(a: number[], b: number[]): number;
+export declare function levenshtein(a: string, b: string): number;
+export declare function stringSimilarity(a: string, b: string): number;
+export declare function reciprocalRankFusion(ranks: number[], k?: number): number;
+export declare function combineScores(score1: number, score2: number, k?: number): number;
+//# sourceMappingURL=math.d.ts.map

package/dist/mcp/search/math.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"math.d.ts","sourceRoot":"","sources":["../../../src/mcp/search/math.ts"],"names":[],"mappings":"AAoBA,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAqBjE;AAgBD,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAyCxD;AAeD,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAI7D;AAmBD,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,SAAK,GAAG,MAAM,CAEpE;AAWD,wBAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,SAAK,GAAG,MAAM,CAK5E"}

package/dist/mcp/search/math.js

@@ -0,0 +1,59 @@
+export function cosineSimilarity(a, b) {
+    if (a.length !== b.length) {
+        throw new Error(`Vector length mismatch: ${a.length} vs ${b.length}`);
+    }
+    if (a.length === 0) {
+        return 0;
+    }
+    let dot = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    const magnitude = Math.sqrt(normA) * Math.sqrt(normB);
+    return magnitude === 0 ? 0 : dot / magnitude;
+}
+export function levenshtein(a, b) {
+    if (a === b)
+        return 0;
+    if (a.length === 0)
+        return b.length;
+    if (b.length === 0)
+        return a.length;
+    if (a.length > b.length) {
+        [a, b] = [b, a];
+    }
+    const aLen = a.length;
+    const bLen = b.length;
+    let prevRow = new Array(aLen + 1);
+    let currRow = new Array(aLen + 1);
+    for (let i = 0; i <= aLen; i++) {
+        prevRow[i] = i;
+    }
+    for (let j = 1; j <= bLen; j++) {
+        currRow[0] = j;
+        for (let i = 1; i <= aLen; i++) {
+            const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+            currRow[i] = Math.min(prevRow[i] + 1, currRow[i - 1] + 1, prevRow[i - 1] + cost);
+        }
+        [prevRow, currRow] = [currRow, prevRow];
+    }
+    return prevRow[aLen];
+}
+export function stringSimilarity(a, b) {
+    const maxLen = Math.max(a.length, b.length);
+    if (maxLen === 0)
+        return 1;
+    return 1 - levenshtein(a, b) / maxLen;
+}
+export function reciprocalRankFusion(ranks, k = 60) {
+    return ranks.reduce((sum, rank) => sum + 1 / (k + rank), 0);
+}
+export function combineScores(score1, score2, k = 60) {
+    const rank1 = 1 + (1 - score1) * 100;
+    const rank2 = 1 + (1 - score2) * 100;
+    return reciprocalRankFusion([rank1, rank2], k);
+}

package/dist/mcp/search/types.d.ts

@@ -0,0 +1,45 @@
+export interface IndexedDoc {
+    id: string;
+    path: string;
+    title: string;
+    content: string;
+    category: string;
+    keywords: string[];
+}
+export interface SearchResult {
+    id: string;
+    path: string;
+    title: string;
+    content: string;
+    snippet: string;
+    score: number;
+    source: 'fuzzy' | 'semantic' | 'hybrid';
+}
+export interface EmbeddingsData {
+    version: string;
+    model: string;
+    dimensions: number;
+    generatedAt: string;
+    documents: EmbeddingEntry[];
+}
+export interface EmbeddingEntry {
+    id: string;
+    path: string;
+    title: string;
+    category: string;
+    keywords: string[];
+    vector: number[];
+}
+export interface SearchOptions {
+    limit?: number;
+    category?: string;
+    mode?: 'hybrid' | 'fuzzy' | 'semantic';
+    minScore?: number;
+}
+export interface HybridSearchConfig {
+    fuzzyThreshold?: number;
+    fuzzyWeight?: number;
+    semanticWeight?: number;
+    debug?: boolean;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/mcp/search/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/mcp/search/types.ts"],"names":[],"mappings":"AAOA,MAAM,WAAW,UAAU;IAEzB,EAAE,EAAE,MAAM,CAAC;IAEX,IAAI,EAAE,MAAM,CAAC;IAEb,KAAK,EAAE,MAAM,CAAC;IAEd,OAAO,EAAE,MAAM,CAAC;IAEhB,QAAQ,EAAE,MAAM,CAAC;IAEjB,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAKD,MAAM,WAAW,YAAY;IAE3B,EAAE,EAAE,MAAM,CAAC;IAEX,IAAI,EAAE,MAAM,CAAC;IAEb,KAAK,EAAE,MAAM,CAAC;IAEd,OAAO,EAAE,MAAM,CAAC;IAEhB,OAAO,EAAE,MAAM,CAAC;IAEhB,KAAK,EAAE,MAAM,CAAC;IAEd,MAAM,EAAE,OAAO,GAAG,UAAU,GAAG,QAAQ,CAAC;CACzC;AAMD,MAAM,WAAW,cAAc;IAE7B,OAAO,EAAE,MAAM,CAAC;IAEhB,KAAK,EAAE,MAAM,CAAC;IAEd,UAAU,EAAE,MAAM,CAAC;IAEnB,WAAW,EAAE,MAAM,CAAC;IAEpB,SAAS,EAAE,cAAc,EAAE,CAAC;CAC7B;AAKD,MAAM,WAAW,cAAc;IAE7B,EAAE,EAAE,MAAM,CAAC;IAEX,IAAI,EAAE,MAAM,CAAC;IAEb,KAAK,EAAE,MAAM,CAAC;IAEd,QAAQ,EAAE,MAAM,CAAC;IAEjB,QAAQ,EAAE,MAAM,EAAE,CAAC;IAEnB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAKD,MAAM,WAAW,aAAa;IAE5B,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB,IAAI,CAAC,EAAE,QAAQ,GAAG,OAAO,GAAG,UAAU,CAAC;IAEvC,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAKD,MAAM,WAAW,kBAAkB;IAEjC,cAAc,CAAC,EAAE,MAAM,CAAC;IAExB,WAAW,CAAC,EAAE,MAAM,CAAC;IAErB,cAAc,CAAC,EAAE,MAAM,CAAC;IAExB,KAAK,CAAC,EAAE,OAAO,CAAC;CACjB"}

package/dist/mcp/search/types.js

@@ -0,0 +1 @@
+export {};

package/dist/mcp/server.d.ts

@@ -4,28 +4,53 @@ export interface MCPServerOptions {
     name?: string;
     version?: string;
     docsPath?: string;
+    examplesPath?: string;
+    srcPath?: string;
     port?: number;
     transport?: MCPTransportMode;
     debug?: boolean;
+    toolsFilter?: string[];
 }
 export declare class MCPServer {
     private options;
     private server?;
+    private hybridSearch;
     private docsIndex;
+    private codeExamples;
+    private typeDefinitions;
     private sseClients;
     private initialized;
     constructor(options?: MCPServerOptions);
     private log;
     private findDocsPath;
+    private findExamplesPath;
+    private findSrcPath;
     private buildIndex;
+    private indexDocs;
+    private indexCodeExamples;
+    private parseCodeExample;
+    private humanizeFilename;
+    private inferFeature;
+    private inferComplexity;
+    private extractCodeKeywords;
+    private indexTypeDefinitions;
+    private extractTypeDefinitions;
+    private parseInterfaceProperties;
     private walkDir;
     private extractTitle;
     private extractKeywords;
     private getTools;
+    private isToolEnabled;
+    private matchPattern;
     private handleToolCall;
     private searchDocs;
     private extractSnippet;
     private getDoc;
+    private getCodeExamples;
+    private getApiSchema;
+    private getSuggestions;
+    private getFeatureConfig;
+    private getCombinedConfig;
     handleRequest(req: JsonRpcRequest): JsonRpcResponse;
     private sendNotification;
     private startStdio;
@@ -35,6 +60,8 @@ export declare class MCPServer {
     stop(): Promise<void>;
     getPort(): number;
     getDocsCount(): number;
+    getExamplesCount(): number;
+    getTypesCount(): number;
     getTransport(): MCPTransportMode;
 }
 export declare function createMCPServer(options?: MCPServerOptions): MCPServer;

package/dist/mcp/server.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"server.d.ts","sourceRoot":"","sources":["../../src/mcp/server.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EACV,cAAc,EACd,eAAe,EAMhB,MAAM,YAAY,CAAC;AAEpB,MAAM,MAAM,gBAAgB,GAAG,OAAO,GAAG,MAAM,GAAG,KAAK,CAAC;AAExD,MAAM,WAAW,gBAAgB;IAC/B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,SAAS,CAAC,EAAE,gBAAgB,CAAC;IAC7B,KAAK,CAAC,EAAE,OAAO,CAAC;CACjB;AAsBD,qBAAa,SAAS;IACpB,OAAO,CAAC,OAAO,CAA6B;IAC5C,OAAO,CAAC,MAAM,CAAC,CAAkC;IACjD,OAAO,CAAC,SAAS,CAAkB;IACnC,OAAO,CAAC,UAAU,CAAkC;IACpD,OAAO,CAAC,WAAW,CAAS;gBAEhB,OAAO,GAAE,gBAAqB;IAa1C,OAAO,CAAC,GAAG;IAWX,OAAO,CAAC,YAAY;IAuBpB,OAAO,CAAC,UAAU;IAiClB,OAAO,CAAC,OAAO;IAyBf,OAAO,CAAC,YAAY;IAKpB,OAAO,CAAC,eAAe;IAqBvB,OAAO,CAAC,QAAQ;IAyChB,OAAO,CAAC,cAAc;IActB,OAAO,CAAC,UAAU;IA2DlB,OAAO,CAAC,cAAc;IAmBtB,OAAO,CAAC,MAAM;IAmCd,aAAa,CAAC,GAAG,EAAE,cAAc,GAAG,eAAe;IAkEnD,OAAO,CAAC,gBAAgB;YAUV,UAAU;YAqCV,SAAS;YAkDT,QAAQ;IA2FhB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAatB,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAgB3B,OAAO,IAAI,MAAM;IAIjB,YAAY,IAAI,MAAM;IAItB,YAAY,IAAI,gBAAgB;CAGjC;AAoBD,wBAAgB,eAAe,CAAC,OAAO,CAAC,EAAE,gBAAgB,GAAG,SAAS,CAErE"}
+{"version":3,"file":"server.d.ts","sourceRoot":"","sources":["../../src/mcp/server.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EACV,cAAc,EACd,eAAe,EAMhB,MAAM,YAAY,CAAC;AAEpB,MAAM,MAAM,gBAAgB,GAAG,OAAO,GAAG,MAAM,GAAG,KAAK,CAAC;AAExD,MAAM,WAAW,gBAAgB;IAC/B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,SAAS,CAAC,EAAE,gBAAgB,CAAC;IAC7B,KAAK,CAAC,EAAE,OAAO,CAAC;IAEhB,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC;CACxB;AA0CD,qBAAa,SAAS;IACpB,OAAO,CAAC,OAAO,CAA6B;IAC5C,OAAO,CAAC,MAAM,CAAC,CAAkC;IACjD,OAAO,CAAC,YAAY,CAAe;IACnC,OAAO,CAAC,SAAS,CAAoB;IACrC,OAAO,CAAC,YAAY,CAAqB;IACzC,OAAO,CAAC,eAAe,CAAwB;IAC/C,OAAO,CAAC,UAAU,CAAkC;IACpD,OAAO,CAAC,WAAW,CAAS;gBAEhB,OAAO,GAAE,gBAAqB;IAiB1C,OAAO,CAAC,GAAG;IAUX,OAAO,CAAC,YAAY;IAyBpB,OAAO,CAAC,gBAAgB;IAiBxB,OAAO,CAAC,WAAW;YAwBL,UAAU;YAoBV,SAAS;IAiCvB,OAAO,CAAC,iBAAiB;IA6BzB,OAAO,CAAC,gBAAgB;IAqCxB,OAAO,CAAC,gBAAgB;IAOxB,OAAO,CAAC,YAAY;IA0BpB,OAAO,CAAC,eAAe;IA4BvB,OAAO,CAAC,mBAAmB;IA6B3B,OAAO,CAAC,oBAAoB;IA8B5B,OAAO,CAAC,sBAAsB;IA0E9B,OAAO,CAAC,wBAAwB;IAoBhC,OAAO,CAAC,OAAO;IAyBf,OAAO,CAAC,YAAY;IAKpB,OAAO,CAAC,eAAe;IAqBvB,OAAO,CAAC,QAAQ;IAkHhB,OAAO,CAAC,aAAa;IAiBrB,OAAO,CAAC,YAAY;IAYpB,OAAO,CAAC,cAAc;IAoBtB,OAAO,CAAC,UAAU;IA0ElB,OAAO,CAAC,cAAc;IA6BtB,OAAO,CAAC,MAAM;IAmCd,OAAO,CAAC,eAAe;IAgDvB,OAAO,CAAC,YAAY;IAmEpB,OAAO,CAAC,cAAc;IAmFtB,OAAO,CAAC,gBAAgB;IA+DxB,OAAO,CAAC,iBAAiB;IAuCzB,aAAa,CAAC,GAAG,EAAE,cAAc,GAAG,eAAe;IA8DnD,OAAO,CAAC,gBAAgB;YAOV,UAAU;YAgCV,SAAS;YA8CT,QAAQ;IAuFhB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAatB,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAe3B,OAAO,IAAI,MAAM;IAIjB,YAAY,IAAI,MAAM;IAItB,gBAAgB,IAAI,MAAM;IAI1B,aAAa,IAAI,MAAM;IAIvB,YAAY,IAAI,gBAAgB;CAGjC;AAoBD,wBAAgB,eAAe,CAAC,OAAO,CAAC,EAAE,gBAAgB,GAAG,SAAS,CAErE"}