Files
compounding-intelligence/scripts/refactoring_opportunity_finder.py
2026-04-21 11:34:31 +00:00

156 lines
4.5 KiB
Python
Executable File

#!/usr/bin/env python3
"""
Finds refactoring opportunities in codebases
Engine ID: 10.4
Usage:
python3 scripts/refactoring_opportunity_finder.py --output proposals/refactoring_opportunity_finder.json
python3 scripts/refactoring_opportunity_finder.py --output proposals/refactoring_opportunity_finder.json --dry-run
"""
import ast
import argparse
import json
import os
import sys
from dataclasses import dataclass
from datetime import datetime, timezone
from typing import Optional, Tuple
@dataclass
class FileMetrics:
"""Metrics for a single source file."""
path: str
lines: int = 0
complexity: float = 0.0
max_complexity: int = 0
functions: int = 0
classes: int = 0
churn_30d: int = 0
churn_90d: int = 0
test_coverage: Optional[float] = None
refactoring_score: float = 0.0
class _ComplexityVisitor(ast.NodeVisitor):
def __init__(self):
self.functions = []
self.classes = 0
def visit_FunctionDef(self, node):
complexity = 1
for child in ast.walk(node):
if isinstance(child, (ast.If, ast.While, ast.For, ast.ExceptHandler)):
complexity += 1
elif isinstance(child, ast.BoolOp):
complexity += len(child.values) - 1
elif isinstance(child, ast.comprehension):
complexity += 1
for _ in child.ifs:
complexity += 1
self.functions.append((node.name, complexity))
self.generic_visit(node)
def visit_AsyncFunctionDef(self, node):
self.visit_FunctionDef(node)
def visit_ClassDef(self, node):
self.classes += 1
self.generic_visit(node)
def compute_file_complexity(filepath: str) -> Tuple[float, int, int, int, int]:
"""Compute cyclomatic complexity for a Python file.
Returns:
(avg_complexity, max_complexity, function_count, class_count, line_count)
"""
try:
with open(filepath) as f:
source = f.read()
tree = ast.parse(source, filename=filepath)
except (SyntaxError, UnicodeDecodeError, OSError):
return (0.0, 0, 0, 0, 0)
visitor = _ComplexityVisitor()
visitor.visit(tree)
line_count = len(source.splitlines())
if not visitor.functions:
return (0.0, 0, 0, visitor.classes, line_count)
complexities = [c for _, c in visitor.functions]
avg = sum(complexities) / len(complexities)
max_c = max(complexities)
return (round(avg, 1), max_c, len(visitor.functions), visitor.classes, line_count)
def calculate_refactoring_score(metrics: FileMetrics) -> float:
"""Calculate a refactoring priority score (0-100).
Components: complexity (30), size (20), churn (25), coverage (15), structure (10).
"""
score = 0.0
if metrics.complexity > 0:
score += min(30, metrics.complexity * 2)
if metrics.lines > 0:
score += min(20, metrics.lines / 50)
churn_score = (metrics.churn_30d * 2) + metrics.churn_90d
score += min(25, churn_score * 1.5)
if metrics.test_coverage is not None:
if metrics.test_coverage < 0.5:
score += 15 * (1 - metrics.test_coverage)
else:
score += 15 * (1 - metrics.test_coverage) * 0.3
else:
score += 7.5
if metrics.functions > 10:
score += min(10, (metrics.functions - 10) * 0.5)
return round(min(100, max(0, score)), 1)
def generate_proposals():
"""Generate sample proposals for this engine."""
return [
{
"title": "Sample improvement from 10.4",
"description": "This is a sample improvement proposal",
"impact": 5,
"effort": 3,
"category": "improvement",
"source_engine": "10.4",
"timestamp": datetime.now(timezone.utc).isoformat(),
}
]
def main():
parser = argparse.ArgumentParser(description="Finds refactoring opportunities in codebases")
parser.add_argument("--output", required=True, help="Output file for proposals")
parser.add_argument("--dry-run", action="store_true", help="Do not write output file")
args = parser.parse_args()
proposals = generate_proposals()
if not args.dry_run:
with open(args.output, "w") as f:
json.dump({"proposals": proposals}, f, indent=2)
print(f"Generated {len(proposals)} proposals -> {args.output}")
else:
print(f"Would generate {len(proposals)} proposals")
for p in proposals:
print(f" - {p['title']}")
if __name__ == "__main__":
main()