@aiready/pattern-detect 0.17.8 → 0.17.12

package/dist/detector.js

@@ -1,385 +0,0 @@
-import { estimateTokens } from '@aiready/core';
-import { calculateSeverity } from './context-rules';
-/**
- * Categorize code pattern based on content heuristics
- */
-function categorizePattern(code) {
-    const lower = code.toLowerCase();
-    // API handler patterns
-    if ((lower.includes('request') && lower.includes('response')) ||
-        lower.includes('router.') ||
-        lower.includes('app.get') ||
-        lower.includes('app.post') ||
-        lower.includes('express') ||
-        lower.includes('ctx.body')) {
-        return 'api-handler';
-    }
-    // Validator patterns
-    if (lower.includes('validate') ||
-        lower.includes('schema') ||
-        lower.includes('zod') ||
-        lower.includes('yup') ||
-        (lower.includes('if') && lower.includes('throw'))) {
-        return 'validator';
-    }
-    // Component patterns (React, Vue, etc.)
-    if (lower.includes('return (') ||
-        lower.includes('jsx') ||
-        lower.includes('component') ||
-        lower.includes('props')) {
-        return 'component';
-    }
-    // Class methods
-    if (lower.includes('class ') || lower.includes('this.')) {
-        return 'class-method';
-    }
-    // Utility functions (pure functions with clear input/output)
-    if (lower.includes('return ') &&
-        !lower.includes('this') &&
-        !lower.includes('new ')) {
-        return 'utility';
-    }
-    // Generic function
-    if (lower.includes('function') || lower.includes('=>')) {
-        return 'function';
-    }
-    return 'unknown';
-}
-/**
- * Extract function-like blocks from code using improved heuristics
- */
-function extractCodeBlocks(content, minLines) {
-    const lines = content.split('\n');
-    const blocks = [];
-    let currentBlock = [];
-    let blockStart = 0;
-    let braceDepth = 0;
-    let inFunction = false;
-    for (let i = 0; i < lines.length; i++) {
-        const line = lines[i];
-        const trimmed = line.trim();
-        // Detect function start
-        if (!inFunction &&
-            (trimmed.includes('function ') ||
-                trimmed.includes('=>') ||
-                trimmed.includes('async ') ||
-                /^(export\s+)?(async\s+)?function\s+/.test(trimmed) ||
-                /^(export\s+)?const\s+\w+\s*=\s*(async\s*)?\(/.test(trimmed))) {
-            inFunction = true;
-            blockStart = i;
-        }
-        // Track brace depth
-        for (const char of line) {
-            if (char === '{')
-                braceDepth++;
-            if (char === '}')
-                braceDepth--;
-        }
-        if (inFunction) {
-            currentBlock.push(line);
-        }
-        // When we close a function block
-        if (inFunction && braceDepth === 0 && currentBlock.length >= minLines) {
-            const blockContent = currentBlock.join('\n');
-            const linesOfCode = currentBlock.filter((l) => l.trim() && !l.trim().startsWith('//')).length;
-            blocks.push({
-                content: blockContent,
-                startLine: blockStart + 1,
-                endLine: i + 1,
-                patternType: categorizePattern(blockContent),
-                linesOfCode,
-            });
-            currentBlock = [];
-            inFunction = false;
-        }
-        else if (inFunction && braceDepth === 0) {
-            // Reset if we're not accumulating enough
-            currentBlock = [];
-            inFunction = false;
-        }
-    }
-    return blocks;
-}
-/**
- * Normalize code for comparison
- * - Remove comments
- * - Normalize whitespace
- * - Remove variable names (replace with placeholders)
- * - Keep structure intact
- */
-function normalizeCode(code) {
-    // Safety check for undefined/null input
-    if (!code) {
-        return '';
-    }
-    return (code
-        // Remove single-line comments
-        .replace(/\/\/.*$/gm, '')
-        // Remove multi-line comments
-        .replace(/\/\*[\s\S]*?\*\//g, '')
-        // Normalize string literals to generic placeholder
-        .replace(/"[^"]*"/g, '"STR"')
-        .replace(/'[^']*'/g, "'STR'")
-        .replace(/`[^`]*`/g, '`STR`')
-        // Normalize numbers
-        .replace(/\b\d+\b/g, 'NUM')
-        // Normalize whitespace but keep structure
-        .replace(/\s+/g, ' ')
-        .trim());
-}
-/**
- * Fast Jaccard similarity on token sets - O(N+M) instead of O(N×M)
- */
-function jaccardSimilarity(tokens1, tokens2) {
-    const set1 = new Set(tokens1);
-    const set2 = new Set(tokens2);
-    let intersection = 0;
-    for (const token of set1) {
-        if (set2.has(token))
-            intersection++;
-    }
-    const union = set1.size + set2.size - intersection;
-    return union === 0 ? 0 : intersection / union;
-}
-/**
- * Detect duplicate patterns across files with enhanced analysis
- */
-export async function detectDuplicatePatterns(files, options) {
-    const { minSimilarity, minLines, batchSize = 100, approx = true, minSharedTokens = 8, maxCandidatesPerBlock = 100, streamResults = false, } = options;
-    const duplicates = [];
-    // Safety limit only for --no-approx mode (O(B²) worst case)
-    // Approximate mode has natural limits and doesn't need budget
-    const maxComparisons = approx ? Infinity : 500000;
-    // Extract blocks from all files
-    const allBlocks = files.flatMap((file) => extractCodeBlocks(file.content, minLines)
-        .filter((block) => block.content && block.content.trim().length > 0)
-        .map((block) => ({
-        content: block.content,
-        startLine: block.startLine,
-        endLine: block.endLine,
-        file: file.file,
-        normalized: normalizeCode(block.content),
-        patternType: block.patternType,
-        tokenCost: estimateTokens(block.content),
-        linesOfCode: block.linesOfCode,
-    })));
-    console.log(`Extracted ${allBlocks.length} code blocks for analysis`);
-    // Add Python blocks if present
-    const pythonFiles = files.filter(f => f.file.toLowerCase().endsWith('.py'));
-    if (pythonFiles.length > 0) {
-        const { extractPythonPatterns } = await import('./extractors/python-extractor');
-        const patterns = await extractPythonPatterns(pythonFiles.map(f => f.file));
-        const pythonBlocks = patterns
-            .filter((p) => p.code && p.code.trim().length > 0)
-            .map(p => ({
-            content: p.code,
-            startLine: p.startLine,
-            endLine: p.endLine,
-            file: p.file,
-            normalized: normalizeCode(p.code),
-            patternType: p.type,
-            tokenCost: estimateTokens(p.code),
-            linesOfCode: p.endLine - p.startLine + 1,
-        }));
-        allBlocks.push(...pythonBlocks);
-        console.log(`Added ${pythonBlocks.length} Python patterns`);
-    }
-    // Warn about --no-approx performance implications
-    if (!approx && allBlocks.length > 500) {
-        console.log(`⚠️  Using --no-approx mode with ${allBlocks.length} blocks may be slow (O(B²) complexity).`);
-        console.log(`   Consider using approximate mode (default) for better performance.`);
-    }
-    // Use minLines to control scope instead of arbitrary block limits
-    // Tokenize blocks for candidate selection
-    const stopwords = new Set([
-        'return', 'const', 'let', 'var', 'function', 'class', 'new', 'if', 'else', 'for', 'while',
-        'async', 'await', 'try', 'catch', 'switch', 'case', 'default', 'import', 'export', 'from',
-        'true', 'false', 'null', 'undefined', 'this'
-    ]);
-    const tokenize = (norm) => norm
-        .split(/[\s(){}\[\];,\.]+/)
-        .filter((t) => t && t.length >= 3 && !stopwords.has(t.toLowerCase()));
-    const blockTokens = allBlocks.map((b) => tokenize(b.normalized));
-    // Build inverted index token -> block ids (for approx mode)
-    const invertedIndex = new Map();
-    if (approx) {
-        for (let i = 0; i < blockTokens.length; i++) {
-            for (const tok of blockTokens[i]) {
-                let arr = invertedIndex.get(tok);
-                if (!arr) {
-                    arr = [];
-                    invertedIndex.set(tok, arr);
-                }
-                arr.push(i);
-            }
-        }
-    }
-    // Process comparisons (exact or approximate) in batches to reduce memory pressure
-    const totalComparisons = approx
-        ? undefined
-        : (allBlocks.length * (allBlocks.length - 1)) / 2;
-    if (totalComparisons !== undefined) {
-        console.log(`Processing ${totalComparisons.toLocaleString()} comparisons in batches...`);
-    }
-    else {
-        console.log(`Using approximate candidate selection to reduce comparisons...`);
-    }
-    let comparisonsProcessed = 0;
-    let comparisonsBudgetExhausted = false;
-    const startTime = Date.now();
-    for (let i = 0; i < allBlocks.length; i++) {
-        if (maxComparisons && comparisonsProcessed >= maxComparisons) {
-            comparisonsBudgetExhausted = true;
-            break;
-        }
-        // Progress reporting every batch
-        if (i % batchSize === 0 && i > 0) {
-            const elapsed = ((Date.now() - startTime) / 1000).toFixed(1);
-            const duplicatesFound = duplicates.length;
-            if (totalComparisons !== undefined) {
-                const progress = ((comparisonsProcessed / totalComparisons) * 100).toFixed(1);
-                const remaining = totalComparisons - comparisonsProcessed;
-                const rate = comparisonsProcessed / parseFloat(elapsed);
-                const eta = remaining > 0 ? (remaining / rate).toFixed(0) : 0;
-                console.log(`   ${progress}% (${comparisonsProcessed.toLocaleString()}/${totalComparisons.toLocaleString()} comparisons, ${elapsed}s elapsed, ~${eta}s remaining, ${duplicatesFound} duplicates)`);
-            }
-            else {
-                console.log(`   Processed ${i.toLocaleString()}/${allBlocks.length} blocks (${elapsed}s elapsed, ${duplicatesFound} duplicates)`);
-            }
-            // Allow garbage collection between batches
-            await new Promise((resolve) => setImmediate(resolve));
-        }
-        const block1 = allBlocks[i];
-        // Build candidate list (approx mode) - much more aggressive filtering
-        let candidates = null;
-        if (approx) {
-            const counts = new Map();
-            const block1Tokens = new Set(blockTokens[i]);
-            const block1Size = block1Tokens.size;
-            // Only consider tokens that are not too common (appear in < 10% of blocks)
-            const rareTokens = blockTokens[i].filter(tok => {
-                const blocksWithToken = invertedIndex.get(tok)?.length || 0;
-                return blocksWithToken < allBlocks.length * 0.1; // < 10% of blocks
-            });
-            // Use only rare tokens for candidate selection to avoid noise from common tokens
-            for (const tok of rareTokens) {
-                const ids = invertedIndex.get(tok);
-                if (!ids)
-                    continue;
-                for (const j of ids) {
-                    if (j <= i)
-                        continue; // only forward pairs
-                    if (allBlocks[j].file === block1.file)
-                        continue; // skip same-file
-                    counts.set(j, (counts.get(j) || 0) + 1);
-                }
-            }
-            // Filter candidates more aggressively:
-            // - Must share at least minSharedTokens
-            // - Must share at least minSharedTokens
-            // - Must share at least 30% of the smaller block's tokens (to ensure substantial overlap)
-            candidates = Array.from(counts.entries())
-                .filter(([j, shared]) => {
-                const block2Tokens = blockTokens[j];
-                const block2Size = block2Tokens.length;
-                const minSize = Math.min(block1Size, block2Size);
-                const sharedPercentage = shared / minSize;
-                return shared >= minSharedTokens && sharedPercentage >= 0.3;
-            })
-                .sort((a, b) => b[1] - a[1])
-                .slice(0, Math.min(maxCandidatesPerBlock, 5)) // Even more aggressive limit
-                .map(([j, shared]) => ({ j, shared }));
-        }
-        if (approx && candidates) {
-            for (const { j } of candidates) {
-                if (!approx && maxComparisons !== Infinity && comparisonsProcessed >= maxComparisons) {
-                    console.log(`⚠️  Comparison safety limit reached (${maxComparisons.toLocaleString()} comparisons in --no-approx mode).`);
-                    console.log(`   This prevents excessive runtime on large repos. Consider using approximate mode (default) or --min-lines to reduce blocks.`);
-                    break;
-                }
-                comparisonsProcessed++;
-                const block2 = allBlocks[j];
-                // Optional: skip cross-type comparisons unless unknown
-                // if (block1.patternType !== block2.patternType &&
-                //     block1.patternType !== 'unknown' && block2.patternType !== 'unknown') continue;
-                const similarity = jaccardSimilarity(blockTokens[i], blockTokens[j]);
-                if (similarity >= minSimilarity) {
-                    // Calculate context-aware severity
-                    const { severity, reason, suggestion, matchedRule } = calculateSeverity(block1.file, block2.file, block1.content, similarity, block1.linesOfCode);
-                    const duplicate = {
-                        file1: block1.file,
-                        file2: block2.file,
-                        line1: block1.startLine,
-                        line2: block2.startLine,
-                        endLine1: block1.endLine,
-                        endLine2: block2.endLine,
-                        similarity,
-                        snippet: block1.content.split('\n').slice(0, 5).join('\n') + '\n...',
-                        patternType: block1.patternType,
-                        tokenCost: block1.tokenCost + block2.tokenCost,
-                        linesOfCode: block1.linesOfCode,
-                        severity,
-                        reason,
-                        suggestion,
-                        matchedRule,
-                    };
-                    duplicates.push(duplicate);
-                    if (streamResults) {
-                        console.log(`\n   ✅ Found: ${duplicate.patternType} ${Math.round(similarity * 100)}% similar`);
-                        console.log(`      ${duplicate.file1}:${duplicate.line1}-${duplicate.endLine1} ⇔ ${duplicate.file2}:${duplicate.line2}-${duplicate.endLine2}`);
-                        console.log(`      Token cost: ${duplicate.tokenCost.toLocaleString()}`);
-                    }
-                }
-            }
-        }
-        else {
-            // Exact mode: compare against all subsequent blocks
-            for (let j = i + 1; j < allBlocks.length; j++) {
-                if (maxComparisons && comparisonsProcessed >= maxComparisons)
-                    break;
-                comparisonsProcessed++;
-                const block2 = allBlocks[j];
-                // Skip comparing blocks from the same file
-                if (block1.file === block2.file)
-                    continue;
-                // Optional: skip cross-type comparisons unless unknown
-                // if (block1.patternType !== block2.patternType &&
-                //     block1.patternType !== 'unknown' && block2.patternType !== 'unknown') continue;
-                const similarity = jaccardSimilarity(blockTokens[i], blockTokens[j]);
-                if (similarity >= minSimilarity) {
-                    // Calculate context-aware severity
-                    const { severity, reason, suggestion, matchedRule } = calculateSeverity(block1.file, block2.file, block1.content, similarity, block1.linesOfCode);
-                    const duplicate = {
-                        file1: block1.file,
-                        file2: block2.file,
-                        line1: block1.startLine,
-                        line2: block2.startLine,
-                        endLine1: block1.endLine,
-                        endLine2: block2.endLine,
-                        similarity,
-                        snippet: block1.content.split('\n').slice(0, 5).join('\n') + '\n...',
-                        patternType: block1.patternType,
-                        tokenCost: block1.tokenCost + block2.tokenCost,
-                        linesOfCode: block1.linesOfCode,
-                        severity,
-                        reason,
-                        suggestion,
-                        matchedRule,
-                    };
-                    duplicates.push(duplicate);
-                    if (streamResults) {
-                        console.log(`\n   ✅ Found: ${duplicate.patternType} ${Math.round(similarity * 100)}% similar`);
-                        console.log(`      ${duplicate.file1}:${duplicate.line1}-${duplicate.endLine1} ⇔ ${duplicate.file2}:${duplicate.line2}-${duplicate.endLine2}`);
-                        console.log(`      Token cost: ${duplicate.tokenCost.toLocaleString()}`);
-                    }
-                }
-            }
-        }
-    }
-    if (comparisonsBudgetExhausted) {
-        console.log(`⚠️  Comparison budget exhausted (${maxComparisons.toLocaleString()} comparisons). Use --max-comparisons to increase.`);
-    }
-    // Sort by similarity descending, then by token cost
-    return duplicates.sort((a, b) => b.similarity - a.similarity || b.tokenCost - a.tokenCost);
-}
-//# sourceMappingURL=detector.js.map

package/dist/detector.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"detector.js","sourceRoot":"","sources":["../src/detector.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAC/C,OAAO,EAAE,iBAAiB,EAAiB,MAAM,iBAAiB,CAAC;AAyDnE;;GAEG;AACH,SAAS,iBAAiB,CAAC,IAAY;IACrC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAEjC,uBAAuB;IACvB,IACE,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACzD,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC;QACzB,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC;QACzB,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC;QAC1B,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC;QACzB,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,EAC1B,CAAC;QACD,OAAO,aAAa,CAAC;IACvB,CAAC;IAED,qBAAqB;IACrB,IACE,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC;QAC1B,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC;QACxB,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC;QACrB,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC;QACrB,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,EACjD,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,wCAAwC;IACxC,IACE,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC;QAC1B,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC;QACrB,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC;QAC3B,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,EACvB,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,gBAAgB;IAChB,IAAI,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QACxD,OAAO,cAAc,CAAC;IACxB,CAAC;IAED,6DAA6D;IAC7D,IACE,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC;QACzB,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;QACvB,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,EACvB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,mBAAmB;IACnB,IAAI,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QACvD,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,OAAe,EAAE,QAAgB;IAO1D,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,MAAM,GAMP,EAAE,CAAC;IAER,IAAI,YAAY,GAAa,EAAE,CAAC;IAChC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,UAAU,GAAG,KAAK,CAAC;IAEvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAE5B,wBAAwB;QACxB,IACE,CAAC,UAAU;YACX,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC;gBAC5B,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC;gBACtB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC;gBAC1B,qCAAqC,CAAC,IAAI,CAAC,OAAO,CAAC;gBACnD,8CAA8C,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAC/D,CAAC;YACD,UAAU,GAAG,IAAI,CAAC;YAClB,UAAU,GAAG,CAAC,CAAC;QACjB,CAAC;QAED,oBAAoB;QACpB,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,IAAI,KAAK,GAAG;gBAAE,UAAU,EAAE,CAAC;YAC/B,IAAI,IAAI,KAAK,GAAG;gBAAE,UAAU,EAAE,CAAC;QACjC,CAAC;QAED,IAAI,UAAU,EAAE,CAAC;YACf,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;QAED,iCAAiC;QACjC,IAAI,UAAU,IAAI,UAAU,KAAK,CAAC,IAAI,YAAY,CAAC,MAAM,IAAI,QAAQ,EAAE,CAAC;YACtE,MAAM,YAAY,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC7C,MAAM,WAAW,GAAG,YAAY,CAAC,MAAM,CACrC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAC9C,CAAC,MAAM,CAAC;YAET,MAAM,CAAC,IAAI,CAAC;gBACV,OAAO,EAAE,YAAY;gBACrB,SAAS,EAAE,UAAU,GAAG,CAAC;gBACzB,OAAO,EAAE,CAAC,GAAG,CAAC;gBACd,WAAW,EAAE,iBAAiB,CAAC,YAAY,CAAC;gBAC5C,WAAW;aACZ,CAAC,CAAC;YAEH,YAAY,GAAG,EAAE,CAAC;YAClB,UAAU,GAAG,KAAK,CAAC;QACrB,CAAC;aAAM,IAAI,UAAU,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;YAC1C,yCAAyC;YACzC,YAAY,GAAG,EAAE,CAAC;YAClB,UAAU,GAAG,KAAK,CAAC;QACrB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,aAAa,CAAC,IAAY;IACjC,wCAAwC;IACxC,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,OAAO,CACL,IAAI;QACF,8BAA8B;SAC7B,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC;QACzB,6BAA6B;SAC5B,OAAO,CAAC,mBAAmB,EAAE,EAAE,CAAC;QACjC,mDAAmD;SAClD,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC;SAC5B,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC;SAC5B,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC;QAC7B,oBAAoB;SACnB,OAAO,CAAC,UAAU,EAAE,KAAK,CAAC;QAC3B,0CAA0C;SACzC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;SACpB,IAAI,EAAE,CACV,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,OAAiB,EAAE,OAAiB;IAC7D,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;IAC9B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;IAE9B,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,YAAY,EAAE,CAAC;IACtC,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,YAAY,CAAC;IACnD,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC;AAChD,CAAC;AAID;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,uBAAuB,CAC3C,KAAoB,EACpB,OAAyB;IAEzB,MAAM,EACJ,aAAa,EACb,QAAQ,EACR,SAAS,GAAG,GAAG,EACf,MAAM,GAAG,IAAI,EACb,eAAe,GAAG,CAAC,EACnB,qBAAqB,GAAG,GAAG,EAC3B,aAAa,GAAG,KAAK,GACtB,GAAG,OAAO,CAAC;IACZ,MAAM,UAAU,GAAuB,EAAE,CAAC;IAE1C,4DAA4D;IAC5D,8DAA8D;IAC9D,MAAM,cAAc,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC;IAElD,gCAAgC;IAChC,MAAM,SAAS,GAAgB,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CACpD,iBAAiB,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC;SACtC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;SACnE,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACf,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,SAAS,EAAE,KAAK,CAAC,SAAS;QAC1B,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,UAAU,EAAE,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC;QACxC,WAAW,EAAE,KAAK,CAAC,WAAW;QAC9B,SAAS,EAAE,cAAc,CAAC,KAAK,CAAC,OAAO,CAAC;QACxC,WAAW,EAAE,KAAK,CAAC,WAAW;KAC/B,CAAC,CAAC,CACN,CAAC;IAEF,OAAO,CAAC,GAAG,CAAC,aAAa,SAAS,CAAC,MAAM,2BAA2B,CAAC,CAAC;IAEtE,+BAA+B;IAC/B,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5E,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,MAAM,EAAE,qBAAqB,EAAE,GAAG,MAAM,MAAM,CAAC,+BAA+B,CAAC,CAAC;QAChF,MAAM,QAAQ,GAAG,MAAM,qBAAqB,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAE3E,MAAM,YAAY,GAAgB,QAAQ;aACvC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;aACjD,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACT,OAAO,EAAE,CAAC,CAAC,IAAI;YACf,SAAS,EAAE,CAAC,CAAC,SAAS;YACtB,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,UAAU,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC;YACjC,WAAW,EAAE,CAAC,CAAC,IAAmB;YAClC,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC;YACjC,WAAW,EAAE,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,SAAS,GAAG,CAAC;SACzC,CAAC,CAAC,CAAC;QAEN,SAAS,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;QAChC,OAAO,CAAC,GAAG,CAAC,SAAS,YAAY,CAAC,MAAM,kBAAkB,CAAC,CAAC;IAC9D,CAAC;IAED,kDAAkD;IAClD,IAAI,CAAC,MAAM,IAAI,SAAS,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;QACtC,OAAO,CAAC,GAAG,CAAC,mCAAmC,SAAS,CAAC,MAAM,yCAAyC,CAAC,CAAC;QAC1G,OAAO,CAAC,GAAG,CAAC,sEAAsE,CAAC,CAAC;IACtF,CAAC;IAED,kEAAkE;IAElE,0CAA0C;IAC1C,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;QACxB,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO;QACzF,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM;QACzF,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM;KAC7C,CAAC,CAAC;IACH,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAY,EAAE,CAC1C,IAAI;SACD,KAAK,CAAC,mBAAmB,CAAC;SAC1B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAE1E,MAAM,WAAW,GAAe,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IAE7E,4DAA4D;IAC5D,MAAM,aAAa,GAA0B,IAAI,GAAG,EAAE,CAAC;IACvD,IAAI,MAAM,EAAE,CAAC;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjC,IAAI,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACjC,IAAI,CAAC,GAAG,EAAE,CAAC;oBACT,GAAG,GAAG,EAAE,CAAC;oBACT,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBAC9B,CAAC;gBACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IAED,kFAAkF;IAClF,MAAM,gBAAgB,GAAG,MAAM;QAC7B,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACpD,IAAI,gBAAgB,KAAK,SAAS,EAAE,CAAC;QACnC,OAAO,CAAC,GAAG,CAAC,cAAc,gBAAgB,CAAC,cAAc,EAAE,4BAA4B,CAAC,CAAC;IAC3F,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,GAAG,CAAC,gEAAgE,CAAC,CAAC;IAChF,CAAC;IAED,IAAI,oBAAoB,GAAG,CAAC,CAAC;IAC7B,IAAI,0BAA0B,GAAG,KAAK,CAAC;IACvC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,IAAI,cAAc,IAAI,oBAAoB,IAAI,cAAc,EAAE,CAAC;YAC7D,0BAA0B,GAAG,IAAI,CAAC;YAClC,MAAM;QACR,CAAC;QACD,iCAAiC;QACjC,IAAI,CAAC,GAAG,SAAS,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACjC,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC7D,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,CAAC;YAC1C,IAAI,gBAAgB,KAAK,SAAS,EAAE,CAAC;gBACnC,MAAM,QAAQ,GAAG,CAAC,CAAC,oBAAoB,GAAG,gBAAgB,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC9E,MAAM,SAAS,GAAG,gBAAgB,GAAG,oBAAoB,CAAC;gBAC1D,MAAM,IAAI,GAAG,oBAAoB,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;gBACxD,MAAM,GAAG,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9D,OAAO,CAAC,GAAG,CAAC,MAAM,QAAQ,MAAM,oBAAoB,CAAC,cAAc,EAAE,IAAI,gBAAgB,CAAC,cAAc,EAAE,iBAAiB,OAAO,eAAe,GAAG,gBAAgB,eAAe,cAAc,CAAC,CAAC;YACrM,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,cAAc,EAAE,IAAI,SAAS,CAAC,MAAM,YAAY,OAAO,cAAc,eAAe,cAAc,CAAC,CAAC;YACpI,CAAC;YACD,2CAA2C;YAC3C,MAAM,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC;QACxD,CAAC;QAED,MAAM,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAE5B,sEAAsE;QACtE,IAAI,UAAU,GAAgD,IAAI,CAAC;QACnE,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,MAAM,GAAwB,IAAI,GAAG,EAAE,CAAC;YAC9C,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC;YAErC,2EAA2E;YAC3E,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE;gBAC7C,MAAM,eAAe,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC;gBAC5D,OAAO,eAAe,GAAG,SAAS,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,kBAAkB;YACrE,CAAC,CAAC,CAAC;YAEH,iFAAiF;YACjF,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;gBAC7B,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACnC,IAAI,CAAC,GAAG;oBAAE,SAAS;gBACnB,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;oBACpB,IAAI,CAAC,IAAI,CAAC;wBAAE,SAAS,CAAC,qBAAqB;oBAC3C,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI;wBAAE,SAAS,CAAC,iBAAiB;oBAClE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC;YAED,uCAAuC;YACvC,wCAAwC;YACxC,wCAAwC;YACxC,0FAA0F;YAC1F,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;iBACtC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,EAAE;gBACtB,MAAM,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;gBACpC,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC;gBACvC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;gBACjD,MAAM,gBAAgB,GAAG,MAAM,GAAG,OAAO,CAAC;gBAC1C,OAAO,MAAM,IAAI,eAAe,IAAI,gBAAgB,IAAI,GAAG,CAAC;YAC9D,CAAC,CAAC;iBACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC3B,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC,CAAC,6BAA6B;iBAC1E,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;QAC3C,CAAC;QAED,IAAI,MAAM,IAAI,UAAU,EAAE,CAAC;YACzB,KAAK,MAAM,EAAE,CAAC,EAAE,IAAI,UAAU,EAAE,CAAC;gBAC/B,IAAI,CAAC,MAAM,IAAI,cAAc,KAAK,QAAQ,IAAI,oBAAoB,IAAI,cAAc,EAAE,CAAC;oBACrF,OAAO,CAAC,GAAG,CAAC,wCAAwC,cAAc,CAAC,cAAc,EAAE,oCAAoC,CAAC,CAAC;oBACzH,OAAO,CAAC,GAAG,CAAC,+HAA+H,CAAC,CAAC;oBAC7I,MAAM;gBACR,CAAC;gBACD,oBAAoB,EAAE,CAAC;gBACvB,MAAM,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;gBAE5B,uDAAuD;gBACvD,mDAAmD;gBACnD,sFAAsF;gBAEtF,MAAM,UAAU,GAAG,iBAAiB,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrE,IAAI,UAAU,IAAI,aAAa,EAAE,CAAC;oBAChC,mCAAmC;oBACnC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,GAAG,iBAAiB,CACrE,MAAM,CAAC,IAAI,EACX,MAAM,CAAC,IAAI,EACX,MAAM,CAAC,OAAO,EACd,UAAU,EACV,MAAM,CAAC,WAAW,CACnB,CAAC;oBAEF,MAAM,SAAS,GAAG;wBAChB,KAAK,EAAE,MAAM,CAAC,IAAI;wBAClB,KAAK,EAAE,MAAM,CAAC,IAAI;wBAClB,KAAK,EAAE,MAAM,CAAC,SAAS;wBACvB,KAAK,EAAE,MAAM,CAAC,SAAS;wBACvB,QAAQ,EAAE,MAAM,CAAC,OAAO;wBACxB,QAAQ,EAAE,MAAM,CAAC,OAAO;wBACxB,UAAU;wBACV,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO;wBACpE,WAAW,EAAE,MAAM,CAAC,WAAW;wBAC/B,SAAS,EAAE,MAAM,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS;wBAC9C,WAAW,EAAE,MAAM,CAAC,WAAW;wBAC/B,QAAQ;wBACR,MAAM;wBACN,UAAU;wBACV,WAAW;qBACZ,CAAC;oBACF,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBAE3B,IAAI,aAAa,EAAE,CAAC;wBAClB,OAAO,CAAC,GAAG,CAAC,iBAAiB,SAAS,CAAC,WAAW,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,GAAG,CAAC,WAAW,CAAC,CAAC;wBAC/F,OAAO,CAAC,GAAG,CAAC,SAAS,SAAS,CAAC,KAAK,IAAI,SAAS,CAAC,KAAK,IAAI,SAAS,CAAC,QAAQ,MAAM,SAAS,CAAC,KAAK,IAAI,SAAS,CAAC,KAAK,IAAI,SAAS,CAAC,QAAQ,EAAE,CAAC,CAAC;wBAC/I,OAAO,CAAC,GAAG,CAAC,qBAAqB,SAAS,CAAC,SAAS,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;oBAC3E,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,oDAAoD;YACpD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9C,IAAI,cAAc,IAAI,oBAAoB,IAAI,cAAc;oBAAE,MAAM;gBACpE,oBAAoB,EAAE,CAAC;gBACvB,MAAM,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;gBAE5B,2CAA2C;gBAC3C,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI;oBAAE,SAAS;gBAE1C,uDAAuD;gBACvD,mDAAmD;gBACnD,sFAAsF;gBAEtF,MAAM,UAAU,GAAG,iBAAiB,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrE,IAAI,UAAU,IAAI,aAAa,EAAE,CAAC;oBAChC,mCAAmC;oBACnC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,GAAG,iBAAiB,CACrE,MAAM,CAAC,IAAI,EACX,MAAM,CAAC,IAAI,EACX,MAAM,CAAC,OAAO,EACd,UAAU,EACV,MAAM,CAAC,WAAW,CACnB,CAAC;oBAEF,MAAM,SAAS,GAAG;wBAChB,KAAK,EAAE,MAAM,CAAC,IAAI;wBAClB,KAAK,EAAE,MAAM,CAAC,IAAI;wBAClB,KAAK,EAAE,MAAM,CAAC,SAAS;wBACvB,KAAK,EAAE,MAAM,CAAC,SAAS;wBACvB,QAAQ,EAAE,MAAM,CAAC,OAAO;wBACxB,QAAQ,EAAE,MAAM,CAAC,OAAO;wBACxB,UAAU;wBACV,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO;wBACpE,WAAW,EAAE,MAAM,CAAC,WAAW;wBAC/B,SAAS,EAAE,MAAM,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS;wBAC9C,WAAW,EAAE,MAAM,CAAC,WAAW;wBAC/B,QAAQ;wBACR,MAAM;wBACN,UAAU;wBACV,WAAW;qBACZ,CAAC;oBACF,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBAE3B,IAAI,aAAa,EAAE,CAAC;wBAClB,OAAO,CAAC,GAAG,CAAC,iBAAiB,SAAS,CAAC,WAAW,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,GAAG,CAAC,WAAW,CAAC,CAAC;wBAC/F,OAAO,CAAC,GAAG,CAAC,SAAS,SAAS,CAAC,KAAK,IAAI,SAAS,CAAC,KAAK,IAAI,SAAS,CAAC,QAAQ,MAAM,SAAS,CAAC,KAAK,IAAI,SAAS,CAAC,KAAK,IAAI,SAAS,CAAC,QAAQ,EAAE,CAAC,CAAC;wBAC/I,OAAO,CAAC,GAAG,CAAC,qBAAqB,SAAS,CAAC,SAAS,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;oBAC3E,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,0BAA0B,EAAE,CAAC;QAC/B,OAAO,CAAC,GAAG,CAAC,oCAAoC,cAAc,CAAC,cAAc,EAAE,mDAAmD,CAAC,CAAC;IACtI,CAAC;IAED,oDAAoD;IACpD,OAAO,UAAU,CAAC,IAAI,CACpB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CACnE,CAAC;AACJ,CAAC"}

package/dist/extractors/python-extractor.d.ts

@@ -1,19 +0,0 @@
-/**
- * Python Pattern Extractor
- *
- * Extracts functions and classes from Python code for similarity analysis
- */
-import type { CodePattern } from '../types';
-/**
- * Extract patterns from Python files
- */
-export declare function extractPythonPatterns(files: string[]): Promise<CodePattern[]>;
-/**
- * Calculate similarity between two Python patterns
- */
-export declare function calculatePythonSimilarity(pattern1: CodePattern, pattern2: CodePattern): number;
-/**
- * Detect common Python patterns that indicate duplication
- */
-export declare function detectPythonAntiPatterns(patterns: CodePattern[]): string[];
-//# sourceMappingURL=python-extractor.d.ts.map

package/dist/extractors/python-extractor.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"python-extractor.d.ts","sourceRoot":"","sources":["../../src/extractors/python-extractor.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AAE5C;;GAEG;AACH,wBAAsB,qBAAqB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAmDnF;AAUD;;GAEG;AACH,wBAAgB,yBAAyB,CACvC,QAAQ,EAAE,WAAW,EACrB,QAAQ,EAAE,WAAW,GACpB,MAAM,CAgCR;AA4DD;;GAEG;AACH,wBAAgB,wBAAwB,CAAC,QAAQ,EAAE,WAAW,EAAE,GAAG,MAAM,EAAE,CAwB1E"}

package/dist/extractors/python-extractor.js

@@ -1,164 +0,0 @@
-/**
- * Python Pattern Extractor
- *
- * Extracts functions and classes from Python code for similarity analysis
- */
-import { getParser } from '@aiready/core';
-/**
- * Extract patterns from Python files
- */
-export async function extractPythonPatterns(files) {
-    const patterns = [];
-    const parser = getParser('dummy.py');
-    if (!parser) {
-        console.warn('Python parser not available');
-        return patterns;
-    }
-    const pythonFiles = files.filter(f => f.toLowerCase().endsWith('.py'));
-    for (const file of pythonFiles) {
-        try {
-            const fs = await import('fs');
-            const code = await fs.promises.readFile(file, 'utf-8');
-            const result = parser.parse(code, file);
-            // Extract function patterns
-            for (const exp of result.exports) {
-                if (exp.type === 'function') {
-                    patterns.push({
-                        file,
-                        name: exp.name,
-                        type: 'function',
-                        startLine: exp.loc?.start.line || 0,
-                        endLine: exp.loc?.end.line || 0,
-                        imports: exp.imports || [],
-                        dependencies: exp.dependencies || [],
-                        signature: generatePythonSignature(exp),
-                        language: 'python',
-                    });
-                }
-                else if (exp.type === 'class') {
-                    patterns.push({
-                        file,
-                        name: exp.name,
-                        type: 'class',
-                        startLine: exp.loc?.start.line || 0,
-                        endLine: exp.loc?.end.line || 0,
-                        imports: exp.imports || [],
-                        dependencies: exp.dependencies || [],
-                        signature: `class ${exp.name}`,
-                        language: 'python',
-                    });
-                }
-            }
-        }
-        catch (error) {
-            console.warn(`Failed to extract patterns from ${file}:`, error);
-        }
-    }
-    return patterns;
-}
-/**
- * Generate a signature for a Python function
- */
-function generatePythonSignature(exp) {
-    const params = exp.parameters?.join(', ') || '';
-    return `def ${exp.name}(${params})`;
-}
-/**
- * Calculate similarity between two Python patterns
- */
-export function calculatePythonSimilarity(pattern1, pattern2) {
-    let similarity = 0;
-    let factors = 0;
-    // 1. Name similarity (30%)
-    const nameSimilarity = calculateNameSimilarity(pattern1.name, pattern2.name);
-    similarity += nameSimilarity * 0.3;
-    factors += 0.3;
-    // 2. Import similarity (40%)
-    const importSimilarity = calculateImportSimilarity(pattern1.imports || [], pattern2.imports || []);
-    similarity += importSimilarity * 0.4;
-    factors += 0.4;
-    // 3. Type similarity (10%)
-    if (pattern1.type === pattern2.type) {
-        similarity += 0.1;
-    }
-    factors += 0.1;
-    // 4. Signature similarity (20%)
-    const sigSimilarity = calculateSignatureSimilarity(pattern1.signature, pattern2.signature);
-    similarity += sigSimilarity * 0.2;
-    factors += 0.2;
-    return factors > 0 ? similarity / factors : 0;
-}
-/**
- * Calculate name similarity using Levenshtein-based approach
- */
-function calculateNameSimilarity(name1, name2) {
-    if (name1 === name2)
-        return 1;
-    // Remove common prefixes/suffixes
-    const clean1 = name1.replace(/^(get|set|is|has|create|delete|update|fetch)_?/, '');
-    const clean2 = name2.replace(/^(get|set|is|has|create|delete|update|fetch)_?/, '');
-    if (clean1 === clean2)
-        return 0.9;
-    // Check for substring match
-    if (clean1.includes(clean2) || clean2.includes(clean1)) {
-        return 0.7;
-    }
-    // Simple character overlap
-    const set1 = new Set(clean1.split('_'));
-    const set2 = new Set(clean2.split('_'));
-    const intersection = new Set([...set1].filter(x => set2.has(x)));
-    const union = new Set([...set1, ...set2]);
-    return intersection.size / union.size;
-}
-/**
- * Calculate import similarity (Jaccard index)
- */
-function calculateImportSimilarity(imports1, imports2) {
-    if (imports1.length === 0 && imports2.length === 0)
-        return 1;
-    if (imports1.length === 0 || imports2.length === 0)
-        return 0;
-    const set1 = new Set(imports1);
-    const set2 = new Set(imports2);
-    const intersection = new Set([...set1].filter(x => set2.has(x)));
-    const union = new Set([...set1, ...set2]);
-    return intersection.size / union.size;
-}
-/**
- * Calculate signature similarity
- */
-function calculateSignatureSimilarity(sig1, sig2) {
-    if (sig1 === sig2)
-        return 1;
-    // Extract parameter counts
-    const params1 = (sig1.match(/\([^)]*\)/)?.[0] || '').split(',').filter(Boolean).length;
-    const params2 = (sig2.match(/\([^)]*\)/)?.[0] || '').split(',').filter(Boolean).length;
-    if (params1 === params2)
-        return 0.8;
-    if (Math.abs(params1 - params2) === 1)
-        return 0.5;
-    return 0;
-}
-/**
- * Detect common Python patterns that indicate duplication
- */
-export function detectPythonAntiPatterns(patterns) {
-    const antiPatterns = [];
-    // Group by similar names
-    const nameGroups = new Map();
-    for (const pattern of patterns) {
-        const baseName = pattern.name.replace(/^(get|set|create|delete|update)_/, '');
-        if (!nameGroups.has(baseName)) {
-            nameGroups.set(baseName, []);
-        }
-        nameGroups.get(baseName).push(pattern);
-    }
-    // Check for groups with multiple similar patterns
-    for (const [baseName, group] of nameGroups) {
-        if (group.length >= 3) {
-            antiPatterns.push(`Found ${group.length} functions with similar names (${baseName}): Consider consolidating`);
-        }
-    }
-    return antiPatterns;
-}
-//# sourceMappingURL=python-extractor.js.map

package/dist/extractors/python-extractor.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"python-extractor.js","sourceRoot":"","sources":["../../src/extractors/python-extractor.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,SAAS,EAAY,MAAM,eAAe,CAAC;AAGpD;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CAAC,KAAe;IACzD,MAAM,QAAQ,GAAkB,EAAE,CAAC;IACnC,MAAM,MAAM,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC;IAErC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO,CAAC,IAAI,CAAC,6BAA6B,CAAC,CAAC;QAC5C,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IAEvE,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,IAAI,CAAC;YACH,MAAM,EAAE,GAAG,MAAM,MAAM,CAAC,IAAI,CAAC,CAAC;YAC9B,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YACvD,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAExC,4BAA4B;YAC5B,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBACjC,IAAI,GAAG,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;oBAC5B,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI;wBACJ,IAAI,EAAE,GAAG,CAAC,IAAI;wBACd,IAAI,EAAE,UAAU;wBAChB,SAAS,EAAE,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC;wBACnC,OAAO,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC;wBAC/B,OAAO,EAAE,GAAG,CAAC,OAAO,IAAI,EAAE;wBAC1B,YAAY,EAAE,GAAG,CAAC,YAAY,IAAI,EAAE;wBACpC,SAAS,EAAE,uBAAuB,CAAC,GAAG,CAAC;wBACvC,QAAQ,EAAE,QAAQ;qBACnB,CAAC,CAAC;gBACL,CAAC;qBAAM,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;oBAChC,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI;wBACJ,IAAI,EAAE,GAAG,CAAC,IAAI;wBACd,IAAI,EAAE,OAAO;wBACb,SAAS,EAAE,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC;wBACnC,OAAO,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC;wBAC/B,OAAO,EAAE,GAAG,CAAC,OAAO,IAAI,EAAE;wBAC1B,YAAY,EAAE,GAAG,CAAC,YAAY,IAAI,EAAE;wBACpC,SAAS,EAAE,SAAS,GAAG,CAAC,IAAI,EAAE;wBAC9B,QAAQ,EAAE,QAAQ;qBACnB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,IAAI,CAAC,mCAAmC,IAAI,GAAG,EAAE,KAAK,CAAC,CAAC;QAClE,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;GAEG;AACH,SAAS,uBAAuB,CAAC,GAAQ;IACvC,MAAM,MAAM,GAAG,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAChD,OAAO,OAAO,GAAG,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC;AACtC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,yBAAyB,CACvC,QAAqB,EACrB,QAAqB;IAErB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,2BAA2B;IAC3B,MAAM,cAAc,GAAG,uBAAuB,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC7E,UAAU,IAAI,cAAc,GAAG,GAAG,CAAC;IACnC,OAAO,IAAI,GAAG,CAAC;IAEf,6BAA6B;IAC7B,MAAM,gBAAgB,GAAG,yBAAyB,CAChD,QAAQ,CAAC,OAAO,IAAI,EAAE,EACtB,QAAQ,CAAC,OAAO,IAAI,EAAE,CACvB,CAAC;IACF,UAAU,IAAI,gBAAgB,GAAG,GAAG,CAAC;IACrC,OAAO,IAAI,GAAG,CAAC;IAEf,2BAA2B;IAC3B,IAAI,QAAQ,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,EAAE,CAAC;QACpC,UAAU,IAAI,GAAG,CAAC;IACpB,CAAC;IACD,OAAO,IAAI,GAAG,CAAC;IAEf,gCAAgC;IAChC,MAAM,aAAa,GAAG,4BAA4B,CAChD,QAAQ,CAAC,SAAS,EAClB,QAAQ,CAAC,SAAS,CACnB,CAAC;IACF,UAAU,IAAI,aAAa,GAAG,GAAG,CAAC;IAClC,OAAO,IAAI,GAAG,CAAC;IAEf,OAAO,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC;AAED;;GAEG;AACH,SAAS,uBAAuB,CAAC,KAAa,EAAE,KAAa;IAC3D,IAAI,KAAK,KAAK,KAAK;QAAE,OAAO,CAAC,CAAC;IAE9B,kCAAkC;IAClC,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,gDAAgD,EAAE,EAAE,CAAC,CAAC;IACnF,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,gDAAgD,EAAE,EAAE,CAAC,CAAC;IAEnF,IAAI,MAAM,KAAK,MAAM;QAAE,OAAO,GAAG,CAAC;IAElC,4BAA4B;IAC5B,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QACvD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,2BAA2B;IAC3B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACxC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;IAE1C,OAAO,YAAY,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;AACxC,CAAC;AAED;;GAEG;AACH,SAAS,yBAAyB,CAAC,QAAkB,EAAE,QAAkB;IACvE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC7D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAE7D,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;IAE/B,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;IAE1C,OAAO,YAAY,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;AACxC,CAAC;AAED;;GAEG;AACH,SAAS,4BAA4B,CAAC,IAAY,EAAE,IAAY;IAC9D,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,CAAC,CAAC;IAE5B,2BAA2B;IAC3B,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;IACvF,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;IAEvF,IAAI,OAAO,KAAK,OAAO;QAAE,OAAO,GAAG,CAAC;IACpC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAElD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,wBAAwB,CAAC,QAAuB;IAC9D,MAAM,YAAY,GAAa,EAAE,CAAC;IAElC,yBAAyB;IACzB,MAAM,UAAU,GAAG,IAAI,GAAG,EAAyB,CAAC;IAEpD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,kCAAkC,EAAE,EAAE,CAAC,CAAC;QAC9E,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC9B,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAC/B,CAAC;QACD,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC1C,CAAC;IAED,kDAAkD;IAClD,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3C,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACtB,YAAY,CAAC,IAAI,CACf,SAAS,KAAK,CAAC,MAAM,kCAAkC,QAAQ,2BAA2B,CAC3F,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO,YAAY,CAAC;AACtB,CAAC"}

package/dist/grouping.d.ts

@@ -1,54 +0,0 @@
-/**
- * Grouping and clustering utilities for duplicate patterns
- * Reduces noise by consolidating similar duplicates and creating refactor clusters
- */
-import type { DuplicatePattern, PatternType } from './detector';
-import type { Severity } from './context-rules';
-export interface DuplicateGroup {
-    filePair: string;
-    duplicates: DuplicatePattern[];
-    totalTokenCost: number;
-    averageSimilarity: number;
-    maxSimilarity: number;
-    severity: Severity;
-    patternType: PatternType;
-    occurrences: number;
-    lineRanges: Array<{
-        file1: {
-            start: number;
-            end: number;
-        };
-        file2: {
-            start: number;
-            end: number;
-        };
-    }>;
-}
-export interface RefactorCluster {
-    id: string;
-    name: string;
-    files: string[];
-    patternType: PatternType;
-    severity: Severity;
-    totalTokenCost: number;
-    averageSimilarity: number;
-    duplicateCount: number;
-    suggestion: string;
-    reason: string;
-}
-/**
- * Group duplicates by file pair, consolidating similar line ranges
- * Reduces "80% similar entries for the same file pairs" noise
- */
-export declare function groupDuplicatesByFilePair(duplicates: DuplicatePattern[]): DuplicateGroup[];
-/**
- * Create refactor clusters for related duplicates
- * Groups UI patterns, components, etc. into actionable clusters
- */
-export declare function createRefactorClusters(duplicates: DuplicatePattern[]): RefactorCluster[];
-/**
- * Filter clusters by minimum impact threshold
- * Reduces noise from minor refactoring opportunities
- */
-export declare function filterClustersByImpact(clusters: RefactorCluster[], minTokenCost?: number, minFileCount?: number): RefactorCluster[];
-//# sourceMappingURL=grouping.d.ts.map