Fix linting issues and formatting errors

Author: codegen-sh[bot]

codegen-on-oss/README.md

@@ -89,12 +89,7 @@ import matplotlib.pyplot as plt
 import networkx as nx
 
 # Create a filtered call graph visualizer
-visualizer = CallGraphFilter(
-    function_name="process_request",
-    class_name="ApiHandler",
-    method_names=["get", "post", "put", "delete"],
-    max_depth=3
-)
+visualizer = CallGraphFilter(function_name="process_request", class_name="ApiHandler", method_names=["get", "post", "put", "delete"], max_depth=3)
 
 # Generate the graph
 G = visualizer.visualize(codebase)
@@ -115,11 +110,7 @@ import matplotlib.pyplot as plt
 import networkx as nx
 
 # Create a call paths visualizer
-visualizer = CallPathsBetweenNodes(
-    start_function_name="start_process",
-    end_function_name="end_process",
-    max_depth=5
-)
+visualizer = CallPathsBetweenNodes(start_function_name="start_process", end_function_name="end_process", max_depth=5)
 
 # Generate the graph
 G = visualizer.visualize(codebase)

codegen-on-oss/codegen_on_oss/analyzers/context/graph/__init__.py

@@ -1,7 +1,7 @@
 """Graph utilities for analyzing code dependencies."""
 
 import logging
-from typing import Any, List, Optional, Set, Tuple
+from typing import Any
 
 import networkx as nx
 
@@ -75,4 +75,3 @@ def find_cycles(graph: nx.DiGraph) -> list:
         return list(nx.simple_cycles(graph))
     except nx.NetworkXNoCycle:
         return []
-

codegen-on-oss/codegen_on_oss/analyzers/diff_lite.py

@@ -1,9 +1,9 @@
-"""Lightweight diff utilities for analyzing code changes."""
+"""Lightweight diff utilities."""
 
 import logging
 from enum import Enum
 from pathlib import Path
-from typing import Dict, List, NamedTuple, Optional, Union
+from typing import NamedTuple
 
 logger = logging.getLogger(__name__)
 
@@ -53,10 +53,10 @@ class DiffLite(NamedTuple):
 
     change_type: ChangeType
     path: Path
-    rename_from: Optional[Path] = None
-    rename_to: Optional[Path] = None
-    old_content: Optional[bytes] = None
-    new_content: Optional[bytes] = None
+    rename_from: Path | None = None
+    rename_to: Path | None = None
+    old_content: bytes | None = None
+    new_content: bytes | None = None
 
     @property
     def is_added(self) -> bool:

codegen-on-oss/codegen_on_oss/analyzers/issues.py

@@ -155,10 +155,10 @@ def to_dict(self) -> dict[str, Any]:
             result["suggestion"] = self.suggestion
 
         if self.related_symbols:
-            result["related_symbols"] = self.related_symbols  # type: ignore
+            result["related_symbols"] = self.related_symbols  # type: ignore[assignment]
 
         if self.related_locations:
-            result["related_locations"] = [  # type: ignore
+            result["related_locations"] = [  # type: ignore[assignment]
                 loc.to_dict() for loc in self.related_locations
             ]
 
@@ -455,4 +455,3 @@ def create_issue(
         symbol=symbol,
         suggestion=suggestion,
     )
-

codegen-on-oss/codegen_on_oss/analyzers/visualizers/dead_code.py

@@ -0,0 +1,77 @@
+"""Dead code visualization utilities."""
+
+import networkx as nx
+
+from codegen_on_oss.analyzers.context.graph.function import Function
+from codegen_on_oss.analyzers.context.graph.import_resolution import Import
+from codegen_on_oss.analyzers.context.graph.symbol import Symbol
+from codegen_on_oss.visualizers.codebase_visualizer import CodebaseVisualizer
+
+
+class DeadCodeVisualizer(CodebaseVisualizer):
+    """Visualizes dead code in the codebase.
+    
+    This visualizer identifies functions that have no usages and are not in test files
+    or decorated. These functions are considered 'dead code' and are added to a directed
+    graph. The visualizer then explores the dependencies of these dead code functions,
+    adding them to the graph as well. This process helps to identify not only directly
+    unused code but also code that might only be used by other dead code (second-order
+    dead code).
+    """
+
+    def __init__(self, exclude_test_files: bool = True, exclude_decorated: bool = True):
+        """Initialize the dead code visualizer.
+        
+        Args:
+            exclude_test_files: Whether to exclude test files from analysis
+            exclude_decorated: Whether to exclude decorated functions from analysis
+        """
+        self.exclude_test_files = exclude_test_files
+        self.exclude_decorated = exclude_decorated
+
+    def visualize(self, codebase) -> nx.DiGraph:
+        """Create a visualization of dead code in the codebase.
+        
+        Args:
+            codebase: The codebase to analyze
+            
+        Returns:
+            A directed graph representing the dead code and its dependencies
+        """
+        # Create a directed graph to visualize dead and second-order dead code
+        G: nx.DiGraph = nx.DiGraph()
+        
+        # First, identify all dead code
+        dead_code: list[Function] = []
+        
+        # Iterate through all functions in the codebase
+        for function in codebase.functions:
+            # Filter down functions
+            if self.exclude_test_files and "test" in function.file.filepath:
+                continue
+                
+            if self.exclude_decorated and function.decorators:
+                continue
+                
+            # Check if the function has no usages
+            if not function.symbol_usages:
+                # Add the function to the dead code list
+                dead_code.append(function)
+                # Add the function to the graph as dead code
+                G.add_node(function, color="red")
+                
+        # Now, find second-order dead code
+        for symbol in dead_code:
+            # Get all usages of the dead code symbol
+            for dep in symbol.dependencies:
+                if isinstance(dep, Import):
+                    dep = dep.imported_symbol
+                if isinstance(dep, Symbol) and not (self.exclude_test_files and "test" in getattr(dep, 'name', '')):
+                    G.add_node(dep)
+                    G.add_edge(symbol, dep, color="red")
+                    for usage_symbol in dep.symbol_usages:
+                        if isinstance(usage_symbol, Function) and not (self.exclude_test_files and "test" in usage_symbol.name):
+                            G.add_edge(usage_symbol, dep)
+                                    
+        return G
+