openlore 2.0.0

package/dist/core/analyzer/refactor-analyzer.js

@@ -0,0 +1,351 @@
+/**
+ * Refactoring Priority Analyzer
+ *
+ * Combines call graph metrics with requirement mappings to produce a
+ * prioritized list of refactoring candidates. Output is a flat JSON array
+ * suitable for consumption by a coding assistant.
+ *
+ * Metrics per function:
+ *   fanIn        — number of internal callers
+ *   fanOut       — number of internal callees
+ *   depth        — hops from nearest entry point (-1 = unreachable)
+ *   sccSize      — strongly connected component size (>1 = in a cycle)
+ *   requirements — list of requirement names this function implements
+ *
+ * Issues detected:
+ *   unreachable       — not reachable from any entry point AND no requirements
+ *   high_fan_in       — fanIn >= HIGH_FAN_IN (likely hub utility)
+ *   high_fan_out      — fanOut >= HIGH_FAN_OUT (likely god function / orchestrator)
+ *   multi_requirement — implements > SRP_MAX requirements (SRP violation)
+ *   in_cycle          — part of a cyclic dependency (sccSize > 1)
+ *   in_clone_group    — appears in a duplicate code clone group
+ */
+import { MAX_FAN_IN_SCORE_BOOST, MAX_FAN_OUT_SCORE_BOOST, REFACTOR_EXCESS_BASE_SCORE, SRP_BASE_SCORE, SRP_PER_REQUIREMENT_PENALTY, CLONE_GROUP_MEMBERSHIP_SCORE, SHALLOW_FUNCTION_DEPTH_MAX, SHALLOW_FUNCTION_SCORE_BONUS, HIGH_COMPLEXITY_THRESHOLD, HIGH_COMPLEXITY_SCORE_BOOST, } from '../../constants.js';
+// ============================================================================
+// THRESHOLDS
+// ============================================================================
+const HIGH_FAN_IN = 8;
+const HIGH_FAN_OUT = 8;
+const SRP_MAX_REQUIREMENTS = 2;
+/** Minimum clone group size to flag (functions appearing in ≥ N clones) */
+const MIN_CLONE_GROUP_SIZE = 2;
+/**
+ * File path patterns for cross-cutting utility/logging modules.
+ * Functions in these files that are pure sinks (fanOut === 0) are designed to be
+ * called from everywhere — flagging them as hub overloads is noise, not signal.
+ */
+const UTILITY_PATH_PATTERNS = [
+    /\/logger\.[^/]+$/i,
+    /\/logging\.[^/]+$/i,
+    /\/log\.[^/]+$/i,
+    /\/utils\//i,
+    /\/helpers\//i,
+    /\/common\//i,
+    /\/shared\//i,
+];
+/** Returns true if a high-fanIn node is a cross-cutting utility sink by design. */
+function isCrossCuttingHub(node) {
+    return node.fanOut === 0 && UTILITY_PATH_PATTERNS.some(p => p.test(node.filePath));
+}
+// ============================================================================
+// DEPTH CALCULATION (BFS from entry points)
+// ============================================================================
+function computeDepths(nodes, edges) {
+    // Forward adjacency list
+    const adj = new Map();
+    for (const node of nodes)
+        adj.set(node.id, []);
+    for (const edge of edges) {
+        if (edge.calleeId) {
+            const list = adj.get(edge.callerId);
+            if (list)
+                list.push(edge.calleeId);
+        }
+    }
+    const depths = new Map();
+    const queue = [];
+    // Entry points (no internal callers) start at depth 0
+    for (const node of nodes) {
+        if (node.fanIn === 0) {
+            depths.set(node.id, 0);
+            queue.push(node.id);
+        }
+    }
+    // BFS
+    let head = 0;
+    while (head < queue.length) {
+        const id = queue[head++];
+        const d = depths.get(id);
+        for (const calleeId of adj.get(id) ?? []) {
+            if (!depths.has(calleeId)) {
+                depths.set(calleeId, d + 1);
+                queue.push(calleeId);
+            }
+        }
+    }
+    // Unreachable nodes get depth -1
+    for (const node of nodes) {
+        if (!depths.has(node.id)) {
+            depths.set(node.id, -1);
+        }
+    }
+    return depths;
+}
+// ============================================================================
+// SCC — TARJAN'S ALGORITHM (iterative to avoid stack overflow)
+// ============================================================================
+function computeSCCs(nodes, edges) {
+    const adj = new Map();
+    for (const node of nodes)
+        adj.set(node.id, []);
+    for (const edge of edges) {
+        if (edge.calleeId) {
+            const list = adj.get(edge.callerId);
+            if (list)
+                list.push(edge.calleeId);
+        }
+    }
+    const sccMap = new Map(); // nodeId → sccId
+    const indexMap = new Map();
+    const lowlink = new Map();
+    const onStack = new Set();
+    const stack = [];
+    let counter = 0;
+    let sccId = 0;
+    // Iterative Tarjan's using explicit call stack
+    for (const startNode of nodes) {
+        if (indexMap.has(startNode.id))
+            continue;
+        // Each frame: { nodeId, neighborIndex, index }
+        const callStack = [
+            { id: startNode.id, neighborIdx: 0 },
+        ];
+        indexMap.set(startNode.id, counter);
+        lowlink.set(startNode.id, counter);
+        counter++;
+        stack.push(startNode.id);
+        onStack.add(startNode.id);
+        while (callStack.length > 0) {
+            const frame = callStack[callStack.length - 1];
+            const neighbors = adj.get(frame.id) ?? [];
+            if (frame.neighborIdx < neighbors.length) {
+                const w = neighbors[frame.neighborIdx++];
+                if (!indexMap.has(w)) {
+                    callStack.push({ id: w, neighborIdx: 0 });
+                    indexMap.set(w, counter);
+                    lowlink.set(w, counter);
+                    counter++;
+                    stack.push(w);
+                    onStack.add(w);
+                }
+                else if (onStack.has(w)) {
+                    lowlink.set(frame.id, Math.min(lowlink.get(frame.id), indexMap.get(w)));
+                }
+            }
+            else {
+                // Done with this node
+                callStack.pop();
+                if (callStack.length > 0) {
+                    const parent = callStack[callStack.length - 1];
+                    lowlink.set(parent.id, Math.min(lowlink.get(parent.id), lowlink.get(frame.id)));
+                }
+                // If root of SCC
+                if (lowlink.get(frame.id) === indexMap.get(frame.id)) {
+                    const scc = [];
+                    let w;
+                    do {
+                        w = stack.pop();
+                        onStack.delete(w);
+                        scc.push(w);
+                        sccMap.set(w, sccId);
+                    } while (w !== frame.id);
+                    sccId++;
+                }
+            }
+        }
+    }
+    return sccMap;
+}
+// ============================================================================
+// MAIN ANALYZER
+// ============================================================================
+/**
+ * Analyze a call graph for refactoring priorities.
+ *
+ * @param callGraph   Serialized call graph from the analyzer
+ * @param mappings    Optional: requirement mappings from mapping.json
+ */
+export function analyzeForRefactoring(callGraph, mappings, duplicates) {
+    const nodes = callGraph.nodes.filter(n => !n.isExternal);
+    const edges = callGraph.edges;
+    // Build requirement reverse index: functionKey → requirement names
+    // Key format: "name@filePath" (partial match — file suffix match)
+    const reqByFn = new Map(); // functionId → requirement names
+    if (mappings && mappings.length > 0) {
+        for (const mapping of mappings) {
+            for (const fn of mapping.functions) {
+                // Match against call graph nodes
+                for (const node of nodes) {
+                    const pathMatch = node.filePath === fn.file ||
+                        node.filePath.endsWith('/' + fn.file) ||
+                        fn.file.endsWith('/' + node.filePath) ||
+                        fn.file === node.filePath;
+                    if (pathMatch && node.name === fn.name) {
+                        const existing = reqByFn.get(node.id) ?? [];
+                        if (!existing.includes(mapping.requirement)) {
+                            existing.push(mapping.requirement);
+                        }
+                        reqByFn.set(node.id, existing);
+                    }
+                }
+            }
+        }
+    }
+    // Compute depths and SCCs
+    const depths = computeDepths(nodes, edges);
+    const sccMap = computeSCCs(nodes, edges);
+    // Compute SCC sizes
+    const sccSizes = new Map();
+    for (const sccId of sccMap.values()) {
+        sccSizes.set(sccId, (sccSizes.get(sccId) ?? 0) + 1);
+    }
+    // Build RefactorEntry per function
+    const entries = [];
+    for (const node of nodes) {
+        const requirements = reqByFn.get(node.id) ?? [];
+        const depth = depths.get(node.id) ?? -1;
+        const sccId = sccMap.get(node.id) ?? -1;
+        const sccSize = sccId >= 0 ? (sccSizes.get(sccId) ?? 1) : 1;
+        const issues = [];
+        if (depth === -1 && requirements.length === 0) {
+            issues.push('unreachable');
+        }
+        if (node.fanIn >= HIGH_FAN_IN && !isCrossCuttingHub(node)) {
+            issues.push('high_fan_in');
+        }
+        if (node.fanOut >= HIGH_FAN_OUT) {
+            issues.push('high_fan_out');
+        }
+        if (requirements.length > SRP_MAX_REQUIREMENTS) {
+            issues.push('multi_requirement');
+        }
+        if (sccSize > 1) {
+            issues.push('in_cycle');
+        }
+        if ((node.cyclomaticComplexity ?? 0) >= HIGH_COMPLEXITY_THRESHOLD) {
+            issues.push('high_complexity');
+        }
+        // Check if this function appears in any clone group
+        if (duplicates && duplicates.cloneGroups.length > 0) {
+            const functionKey = `${node.name}@${node.filePath}`;
+            for (const group of duplicates.cloneGroups) {
+                if (group.instances.some(i => {
+                    // Match by function name and file path (exact or partial match)
+                    const instanceKey = `${i.functionName}@${i.file}`;
+                    return instanceKey === functionKey ||
+                        (i.functionName === node.name &&
+                            (i.file === node.filePath ||
+                                node.filePath.endsWith('/' + i.file) ||
+                                i.file.endsWith('/' + node.filePath)));
+                })) {
+                    // Only flag if clone group is significant (>= MIN_CLONE_GROUP_SIZE)
+                    if (group.instances.length >= MIN_CLONE_GROUP_SIZE) {
+                        issues.push('in_clone_group');
+                        break;
+                    }
+                }
+            }
+        }
+        const priorityScore = computePriorityScore(node, depth, sccSize, requirements.length, issues);
+        entries.push({
+            function: node.name,
+            file: node.filePath,
+            ...(node.className ? { className: node.className } : {}),
+            fanIn: node.fanIn,
+            fanOut: node.fanOut,
+            depth,
+            sccSize,
+            requirements,
+            issues,
+            ...(node.cyclomaticComplexity !== undefined ? { cyclomaticComplexity: node.cyclomaticComplexity } : {}),
+            priorityScore,
+        });
+    }
+    // Sort by priorityScore descending, filter to those with issues
+    const withIssues = entries
+        .filter(e => e.issues.length > 0)
+        .sort((a, b) => b.priorityScore - a.priorityScore);
+    // Build cycles summary (SCCs with size > 1)
+    const cycleSCCs = new Map();
+    for (const node of nodes) {
+        const sccId = sccMap.get(node.id) ?? -1;
+        const size = sccId >= 0 ? (sccSizes.get(sccId) ?? 1) : 1;
+        if (size > 1) {
+            if (!cycleSCCs.has(sccId)) {
+                cycleSCCs.set(sccId, { sccId, size, participants: [] });
+            }
+            cycleSCCs.get(sccId).participants.push({
+                function: node.name,
+                file: node.filePath,
+            });
+        }
+    }
+    const cycles = Array.from(cycleSCCs.values());
+    // Stats
+    const unreachableCount = entries.filter(e => e.issues.includes('unreachable')).length;
+    const highFanInCount = entries.filter(e => e.issues.includes('high_fan_in')).length;
+    const highFanOutCount = entries.filter(e => e.issues.includes('high_fan_out')).length;
+    const srpCount = entries.filter(e => e.issues.includes('multi_requirement')).length;
+    const cycleParticipants = entries.filter(e => e.issues.includes('in_cycle')).length;
+    const highComplexityCount = entries.filter(e => e.issues.includes('high_complexity')).length;
+    return {
+        generatedAt: new Date().toISOString(),
+        stats: {
+            totalFunctions: nodes.length,
+            withIssues: withIssues.length,
+            unreachable: unreachableCount,
+            highFanIn: highFanInCount,
+            highFanOut: highFanOutCount,
+            srpViolations: srpCount,
+            cycleParticipants,
+            cyclesDetected: cycles.length,
+            highComplexity: highComplexityCount,
+        },
+        priorities: withIssues,
+        cycles,
+    };
+}
+function computePriorityScore(node, depth, sccSize, reqCount, issues) {
+    let score = 0;
+    // Dead code — low urgency but worth flagging
+    if (issues.includes('unreachable'))
+        score += 1;
+    // High fan-in: score proportional to excess
+    if (node.fanIn >= HIGH_FAN_IN) {
+        score += REFACTOR_EXCESS_BASE_SCORE + Math.min(MAX_FAN_IN_SCORE_BOOST, (node.fanIn - HIGH_FAN_IN) / HIGH_FAN_IN);
+    }
+    // High fan-out: score proportional to excess
+    if (node.fanOut >= HIGH_FAN_OUT) {
+        score += REFACTOR_EXCESS_BASE_SCORE + Math.min(MAX_FAN_OUT_SCORE_BOOST, (node.fanOut - HIGH_FAN_OUT) / HIGH_FAN_OUT);
+    }
+    // SRP violation: +1 per requirement above threshold
+    if (reqCount > SRP_MAX_REQUIREMENTS) {
+        score += SRP_BASE_SCORE + (reqCount - SRP_MAX_REQUIREMENTS) * SRP_PER_REQUIREMENT_PENALTY;
+    }
+    // Cycles: +2 per cycle participant
+    if (sccSize > 1)
+        score += 2;
+    // Clone groups: per clone group membership
+    if (issues.includes('in_clone_group'))
+        score += CLONE_GROUP_MEMBERSHIP_SCORE;
+    // High complexity: base boost + proportional to excess above threshold (capped at 3×)
+    if (issues.includes('high_complexity')) {
+        const excess = Math.max(0, (node.cyclomaticComplexity ?? HIGH_COMPLEXITY_THRESHOLD) - HIGH_COMPLEXITY_THRESHOLD);
+        score += HIGH_COMPLEXITY_SCORE_BOOST * (1 + Math.min(excess / 10, 2));
+    }
+    // Depth bonus: shallower functions are more impactful to refactor
+    if (depth >= 0 && depth <= SHALLOW_FUNCTION_DEPTH_MAX && issues.length > 0)
+        score += SHALLOW_FUNCTION_SCORE_BONUS;
+    return Math.round(score * 10) / 10;
+}
+//# sourceMappingURL=refactor-analyzer.js.map

package/dist/core/analyzer/refactor-analyzer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"refactor-analyzer.js","sourceRoot":"","sources":["../../../src/core/analyzer/refactor-analyzer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,EACL,sBAAsB,EACtB,uBAAuB,EACvB,0BAA0B,EAC1B,cAAc,EACd,2BAA2B,EAC3B,4BAA4B,EAC5B,0BAA0B,EAC1B,4BAA4B,EAC5B,yBAAyB,EACzB,2BAA2B,GAC5B,MAAM,oBAAoB,CAAC;AAI5B,+EAA+E;AAC/E,aAAa;AACb,+EAA+E;AAE/E,MAAM,WAAW,GAAG,CAAC,CAAC;AACtB,MAAM,YAAY,GAAG,CAAC,CAAC;AACvB,MAAM,oBAAoB,GAAG,CAAC,CAAC;AAC/B,2EAA2E;AAC3E,MAAM,oBAAoB,GAAG,CAAC,CAAC;AAE/B;;;;GAIG;AACH,MAAM,qBAAqB,GAAG;IAC5B,mBAAmB;IACnB,oBAAoB;IACpB,gBAAgB;IAChB,YAAY;IACZ,cAAc;IACd,aAAa;IACb,aAAa;CACd,CAAC;AAEF,mFAAmF;AACnF,SAAS,iBAAiB,CAAC,IAAkB;IAC3C,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,qBAAqB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;AACrF,CAAC;AA+DD,+EAA+E;AAC/E,4CAA4C;AAC5C,+EAA+E;AAE/E,SAAS,aAAa,CACpB,KAAqB,EACrB,KAAmC;IAEnC,yBAAyB;IACzB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACpC,IAAI,IAAI;gBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,sDAAsD;IACtD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACvB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED,MAAM;IACN,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC1B,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC1B,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC5B,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAED,iCAAiC;IACjC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+EAA+E;AAC/E,+DAA+D;AAC/D,+EAA+E;AAE/E,SAAS,WAAW,CAClB,KAAqB,EACrB,KAAmC;IAEnC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACpC,IAAI,IAAI;gBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,iBAAiB;IAC3D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,+CAA+C;IAC/C,KAAK,MAAM,SAAS,IAAI,KAAK,EAAE,CAAC;QAC9B,IAAI,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;YAAE,SAAS;QAEzC,+CAA+C;QAC/C,MAAM,SAAS,GAA+C;YAC5D,EAAE,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE;SACrC,CAAC;QAEF,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QACpC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QACnC,OAAO,EAAE,CAAC;QACV,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QACzB,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QAE1B,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9C,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YAE1C,IAAI,KAAK,CAAC,WAAW,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC;gBACzC,MAAM,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;gBAEzC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACrB,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;oBAC1C,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;oBACzB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;oBACxB,OAAO,EAAE,CAAC;oBACV,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACd,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjB,CAAC;qBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC1B,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAE,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;gBAC5E,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,sBAAsB;gBACtB,SAAS,CAAC,GAAG,EAAE,CAAC;gBAEhB,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACzB,MAAM,MAAM,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBAC/C,OAAO,CAAC,GAAG,CACT,MAAM,CAAC,EAAE,EACT,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAE,CAAC,CAC1D,CAAC;gBACJ,CAAC;gBAED,iBAAiB;gBACjB,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;oBACrD,MAAM,GAAG,GAAa,EAAE,CAAC;oBACzB,IAAI,CAAS,CAAC;oBACd,GAAG,CAAC;wBACF,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;wBACjB,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;wBAClB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBACZ,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;oBACvB,CAAC,QAAQ,CAAC,KAAK,KAAK,CAAC,EAAE,EAAE;oBACzB,KAAK,EAAE,CAAC;gBACV,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+EAA+E;AAC/E,gBAAgB;AAChB,+EAA+E;AAE/E;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CACnC,SAA8B,EAC9B,QAAyB,EACzB,UAAqC;IAErC,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IACzD,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC;IAE9B,mEAAmE;IACnE,kEAAkE;IAClE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC,CAAC,iCAAiC;IAE9E,IAAI,QAAQ,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpC,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,KAAK,MAAM,EAAE,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;gBACnC,iCAAiC;gBACjC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,MAAM,SAAS,GACb,IAAI,CAAC,QAAQ,KAAK,EAAE,CAAC,IAAI;wBACzB,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC;wBACrC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC;wBACrC,EAAE,CAAC,IAAI,KAAK,IAAI,CAAC,QAAQ,CAAC;oBAC5B,IAAI,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;wBACvC,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;wBAC5C,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;4BAC5C,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;wBACrC,CAAC;wBACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;oBACjC,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,0BAA0B;IAC1B,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC3C,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAEzC,oBAAoB;IACpB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QACpC,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,mCAAmC;IACnC,MAAM,OAAO,GAAoB,EAAE,CAAC;IAEpC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAChD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACxC,MAAM,OAAO,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE5D,MAAM,MAAM,GAAoB,EAAE,CAAC;QAEnC,IAAI,KAAK,KAAK,CAAC,CAAC,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9C,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC7B,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,IAAI,WAAW,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1D,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC7B,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,IAAI,YAAY,EAAE,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC9B,CAAC;QACD,IAAI,YAAY,CAAC,MAAM,GAAG,oBAAoB,EAAE,CAAC;YAC/C,MAAM,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;QACnC,CAAC;QACD,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;YAChB,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1B,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,oBAAoB,IAAI,CAAC,CAAC,IAAI,yBAAyB,EAAE,CAAC;YAClE,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;QACjC,CAAC;QAED,oDAAoD;QACpD,IAAI,UAAU,IAAI,UAAU,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpD,MAAM,WAAW,GAAG,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACpD,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,WAAW,EAAE,CAAC;gBAC3C,IAAI,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;oBAC3B,gEAAgE;oBAChE,MAAM,WAAW,GAAG,GAAG,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;oBAClD,OAAO,WAAW,KAAK,WAAW;wBAC3B,CAAC,CAAC,CAAC,YAAY,KAAK,IAAI,CAAC,IAAI;4BAC5B,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,QAAQ;gCACxB,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC;gCACpC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAClD,CAAC,CAAC,EAAE,CAAC;oBACH,oEAAoE;oBACpE,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,IAAI,oBAAoB,EAAE,CAAC;wBACnD,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;wBAC9B,MAAM;oBACR,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,aAAa,GAAG,oBAAoB,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAE9F,OAAO,CAAC,IAAI,CAAC;YACX,QAAQ,EAAE,IAAI,CAAC,IAAI;YACnB,IAAI,EAAE,IAAI,CAAC,QAAQ;YACnB,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACxD,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,KAAK;YACL,OAAO;YACP,YAAY;YACZ,MAAM;YACN,GAAG,CAAC,IAAI,CAAC,oBAAoB,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,oBAAoB,EAAE,IAAI,CAAC,oBAAoB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACvG,aAAa;SACd,CAAC,CAAC;IACL,CAAC;IAED,gEAAgE;IAChE,MAAM,UAAU,GAAG,OAAO;SACvB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;SAChC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC;IAErD,4CAA4C;IAC5C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAwB,CAAC;IAClD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC1B,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC,CAAC;YAC1D,CAAC;YACD,SAAS,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,YAAY,CAAC,IAAI,CAAC;gBACtC,QAAQ,EAAE,IAAI,CAAC,IAAI;gBACnB,IAAI,EAAE,IAAI,CAAC,QAAQ;aACpB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;IAE9C,QAAQ;IACR,MAAM,gBAAgB,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC;IACtF,MAAM,cAAc,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC;IACpF,MAAM,eAAe,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC;IACtF,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,mBAAmB,CAAC,CAAC,CAAC,MAAM,CAAC;IACpF,MAAM,iBAAiB,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC;IACpF,MAAM,mBAAmB,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC,CAAC,MAAM,CAAC;IAE7F,OAAO;QACL,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACrC,KAAK,EAAE;YACL,cAAc,EAAE,KAAK,CAAC,MAAM;YAC5B,UAAU,EAAE,UAAU,CAAC,MAAM;YAC7B,WAAW,EAAE,gBAAgB;YAC7B,SAAS,EAAE,cAAc;YACzB,UAAU,EAAE,eAAe;YAC3B,aAAa,EAAE,QAAQ;YACvB,iBAAiB;YACjB,cAAc,EAAE,MAAM,CAAC,MAAM;YAC7B,cAAc,EAAE,mBAAmB;SACpC;QACD,UAAU,EAAE,UAAU;QACtB,MAAM;KACP,CAAC;AACJ,CAAC;AAED,SAAS,oBAAoB,CAC3B,IAAkB,EAClB,KAAa,EACb,OAAe,EACf,QAAgB,EAChB,MAAuB;IAEvB,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,6CAA6C;IAC7C,IAAI,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC;QAAE,KAAK,IAAI,CAAC,CAAC;IAE/C,4CAA4C;IAC5C,IAAI,IAAI,CAAC,KAAK,IAAI,WAAW,EAAE,CAAC;QAC9B,KAAK,IAAI,0BAA0B,GAAG,IAAI,CAAC,GAAG,CAAC,sBAAsB,EAAE,CAAC,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC,GAAG,WAAW,CAAC,CAAC;IACnH,CAAC;IAED,6CAA6C;IAC7C,IAAI,IAAI,CAAC,MAAM,IAAI,YAAY,EAAE,CAAC;QAChC,KAAK,IAAI,0BAA0B,GAAG,IAAI,CAAC,GAAG,CAAC,uBAAuB,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,YAAY,CAAC,GAAG,YAAY,CAAC,CAAC;IACvH,CAAC;IAED,oDAAoD;IACpD,IAAI,QAAQ,GAAG,oBAAoB,EAAE,CAAC;QACpC,KAAK,IAAI,cAAc,GAAG,CAAC,QAAQ,GAAG,oBAAoB,CAAC,GAAG,2BAA2B,CAAC;IAC5F,CAAC;IAED,mCAAmC;IACnC,IAAI,OAAO,GAAG,CAAC;QAAE,KAAK,IAAI,CAAC,CAAC;IAE5B,2CAA2C;IAC3C,IAAI,MAAM,CAAC,QAAQ,CAAC,gBAAgB,CAAC;QAAE,KAAK,IAAI,4BAA4B,CAAC;IAE7E,sFAAsF;IACtF,IAAI,MAAM,CAAC,QAAQ,CAAC,iBAAiB,CAAC,EAAE,CAAC;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,oBAAoB,IAAI,yBAAyB,CAAC,GAAG,yBAAyB,CAAC,CAAC;QACjH,KAAK,IAAI,2BAA2B,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,kEAAkE;IAClE,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,0BAA0B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,KAAK,IAAI,4BAA4B,CAAC;IAElH,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;AACrC,CAAC"}

package/dist/core/analyzer/repository-mapper.d.ts

@@ -0,0 +1,150 @@
+/**
+ * Repository Mapper
+ *
+ * Combines file walking and significance scoring into a comprehensive "map"
+ * of the repository that guides all subsequent analysis.
+ */
+import type { ProjectType, ScoredFile } from '../../types/index.js';
+import { type ScoringConfig } from './significance-scorer.js';
+/**
+ * Language breakdown in the repository
+ */
+export interface LanguageBreakdown {
+    language: string;
+    extension: string;
+    fileCount: number;
+    percentage: number;
+}
+/**
+ * Detected framework information
+ */
+export interface DetectedFramework {
+    name: string;
+    category: 'frontend' | 'backend' | 'database' | 'testing' | 'auth' | 'ci' | 'other';
+    confidence: 'high' | 'medium' | 'low';
+    evidence: string[];
+}
+/**
+ * Directory statistics
+ */
+export interface DirectoryStats {
+    path: string;
+    fileCount: number;
+    purpose: string;
+    avgScore: number;
+}
+/**
+ * File clusters by domain/layer
+ */
+export interface FileClusters {
+    byDirectory: Record<string, ScoredFile[]>;
+    byDomain: Record<string, ScoredFile[]>;
+    byLayer: {
+        presentation: ScoredFile[];
+        business: ScoredFile[];
+        data: ScoredFile[];
+        infrastructure: ScoredFile[];
+    };
+}
+/**
+ * Repository map metadata
+ */
+export interface RepositoryMapMetadata {
+    projectName: string;
+    projectType: ProjectType;
+    rootPath: string;
+    analyzedAt: string;
+    version: string;
+}
+/**
+ * Repository map summary
+ */
+export interface RepositoryMapSummary {
+    totalFiles: number;
+    analyzedFiles: number;
+    skippedFiles: number;
+    languages: LanguageBreakdown[];
+    frameworks: DetectedFramework[];
+    directories: DirectoryStats[];
+}
+/**
+ * Complete repository map
+ */
+export interface RepositoryMap {
+    metadata: RepositoryMapMetadata;
+    summary: RepositoryMapSummary;
+    highValueFiles: ScoredFile[];
+    entryPoints: ScoredFile[];
+    schemaFiles: ScoredFile[];
+    configFiles: ScoredFile[];
+    clusters: FileClusters;
+    allFiles: ScoredFile[];
+}
+/**
+ * Options for repository mapping
+ */
+export interface RepositoryMapperOptions {
+    /** Maximum files to process */
+    maxFiles?: number;
+    /** Patterns to force-include, overriding gitignore and excludePatterns */
+    includePatterns?: string[];
+    /** Additional patterns to exclude */
+    excludePatterns?: string[];
+    /** Custom scoring configuration */
+    scoringConfig?: ScoringConfig;
+    /** Progress callback */
+    onProgress?: (stage: string, progress: number) => void;
+    /** Output directory for analysis files */
+    outputDir?: string;
+}
+export declare class RepositoryMapper {
+    private rootPath;
+    private options;
+    private packageJson;
+    constructor(rootPath: string, options?: RepositoryMapperOptions);
+    /**
+     * Load package.json if it exists
+     */
+    private loadPackageJson;
+    /**
+     * Get project name from package.json or directory name
+     */
+    private getProjectName;
+    /**
+     * Detect project type
+     */
+    private detectProjectType;
+    /**
+     * Calculate language breakdown
+     */
+    private calculateLanguages;
+    /**
+     * Detect frameworks
+     */
+    private detectFrameworks;
+    /**
+     * Calculate directory statistics
+     */
+    private calculateDirectoryStats;
+    /**
+     * Cluster files by various dimensions
+     */
+    private clusterFiles;
+    /**
+     * Generate the repository map
+     */
+    map(): Promise<RepositoryMap>;
+    /**
+     * Write repository map to output directory
+     */
+    writeOutput(map: RepositoryMap): Promise<void>;
+    /**
+     * Generate human-readable summary
+     */
+    private generateSummaryMarkdown;
+}
+/**
+ * Convenience function to map a repository
+ */
+export declare function mapRepository(rootPath: string, options?: RepositoryMapperOptions): Promise<RepositoryMap>;
+//# sourceMappingURL=repository-mapper.d.ts.map

package/dist/core/analyzer/repository-mapper.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"repository-mapper.d.ts","sourceRoot":"","sources":["../../../src/core/analyzer/repository-mapper.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAeH,OAAO,KAAK,EAAE,WAAW,EAAE,UAAU,EAAgB,MAAM,sBAAsB,CAAC;AAElF,OAAO,EAAsB,KAAK,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAMlF;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,UAAU,GAAG,SAAS,GAAG,UAAU,GAAG,SAAS,GAAG,MAAM,GAAG,IAAI,GAAG,OAAO,CAAC;IACpF,UAAU,EAAE,MAAM,GAAG,QAAQ,GAAG,KAAK,CAAC;IACtC,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;IAC1C,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;IACvC,OAAO,EAAE;QACP,YAAY,EAAE,UAAU,EAAE,CAAC;QAC3B,QAAQ,EAAE,UAAU,EAAE,CAAC;QACvB,IAAI,EAAE,UAAU,EAAE,CAAC;QACnB,cAAc,EAAE,UAAU,EAAE,CAAC;KAC9B,CAAC;CACH;AAED;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,WAAW,CAAC;IACzB,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,MAAM,CAAC;IACtB,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,EAAE,iBAAiB,EAAE,CAAC;IAC/B,UAAU,EAAE,iBAAiB,EAAE,CAAC;IAChC,WAAW,EAAE,cAAc,EAAE,CAAC;CAC/B;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,EAAE,qBAAqB,CAAC;IAChC,OAAO,EAAE,oBAAoB,CAAC;IAC9B,cAAc,EAAE,UAAU,EAAE,CAAC;IAC7B,WAAW,EAAE,UAAU,EAAE,CAAC;IAC1B,WAAW,EAAE,UAAU,EAAE,CAAC;IAC1B,WAAW,EAAE,UAAU,EAAE,CAAC;IAC1B,QAAQ,EAAE,YAAY,CAAC;IACvB,QAAQ,EAAE,UAAU,EAAE,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,uBAAuB;IACtC,+BAA+B;IAC/B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,0EAA0E;IAC1E,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B,qCAAqC;IACrC,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B,mCAAmC;IACnC,aAAa,CAAC,EAAE,aAAa,CAAC;IAC9B,wBAAwB;IACxB,UAAU,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,KAAK,IAAI,CAAC;IACvD,0CAA0C;IAC1C,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAgZD,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,OAAO,CAA0B;IACzC,OAAO,CAAC,WAAW,CAAwC;gBAE/C,QAAQ,EAAE,MAAM,EAAE,OAAO,GAAE,uBAA4B;IAYnE;;OAEG;YACW,eAAe;IAS7B;;OAEG;IACH,OAAO,CAAC,cAAc;IAOtB;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAqBzB;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAqD1B;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAkBxB;;OAEG;IACH,OAAO,CAAC,uBAAuB;IA4C/B;;OAEG;IACH,OAAO,CAAC,YAAY;IAgCpB;;OAEG;IACG,GAAG,IAAI,OAAO,CAAC,aAAa,CAAC;IAiFnC;;OAEG;IACG,WAAW,CAAC,GAAG,EAAE,aAAa,GAAG,OAAO,CAAC,IAAI,CAAC;IAcpD;;OAEG;IACH,OAAO,CAAC,uBAAuB;CAuFhC;AAED;;GAEG;AACH,wBAAsB,aAAa,CACjC,QAAQ,EAAE,MAAM,EAChB,OAAO,CAAC,EAAE,uBAAuB,GAChC,OAAO,CAAC,aAAa,CAAC,CAOxB"}