linting

Author: KRRT7

codeflash/code_utils/code_replacer.py

@@ -265,7 +265,6 @@ def visit_FunctionDef(self, node: cst.FunctionDef) -> bool:
             self.new_functions.append(node)
         return False
 
-
     def visit_ClassDef(self, node: cst.ClassDef) -> bool:
         if self.current_class:
             return False  # If already in a class, do not recurse deeper
@@ -316,7 +315,6 @@ def leave_FunctionDef(self, original_node: cst.FunctionDef, updated_node: cst.Fu
 
         return updated_node
 
-
     def visit_ClassDef(self, node: cst.ClassDef) -> bool:
         if self.current_class:
             return False  # If already in a class, do not recurse deeper

codeflash/code_utils/coverage_utils.py

@@ -14,7 +14,9 @@ def extract_dependent_function(main_function: str, code_context: CodeOptimizatio
     """Extract the single dependent function from the code context excluding the main function."""
     ast_tree = ast.parse(code_context.testgen_context_code)
 
-    dependent_functions = {node.name for node in ast_tree.body if isinstance(node, (ast.FunctionDef, ast.AsyncFunctionDef))}
+    dependent_functions = {
+        node.name for node in ast_tree.body if isinstance(node, (ast.FunctionDef, ast.AsyncFunctionDef))
+    }
 
     if main_function in dependent_functions:
         dependent_functions.discard(main_function)

codeflash/optimization/function_optimizer.py

@@ -566,11 +566,11 @@ def determine_best_candidate(
                     tree = Tree(f"Candidate #{candidate_index} - Runtime Information")
                     benchmark_tree = None
                     if speedup_critic(
-                        candidate_result, 
-                        original_code_baseline.runtime, 
-                        None, 
+                        candidate_result,
+                        original_code_baseline.runtime,
+                        None,
                         self.function_to_optimize,
-                        original_baseline_results=original_code_baseline
+                        original_baseline_results=original_code_baseline,
                     ) and quantity_of_tests_critic(candidate_result):
                         tree.add("This candidate is faster than the original code. 🚀")  # TODO: Change this description
                         tree.add(f"Original summed runtime: {humanize_runtime(original_code_baseline.runtime)}")

codeflash/result/critic.py

@@ -93,7 +93,9 @@ def async_speedup_critic(
         throughput_gain = (candidate_throughput - original_throughput) / original_throughput
         if throughput_gain > noise_floor:
             # Throughput improved above noise floor - accept optimization
-            return True if best_runtime_until_now is None else candidate_result.best_test_runtime < best_runtime_until_now
+            return (
+                True if best_runtime_until_now is None else candidate_result.best_test_runtime < best_runtime_until_now
+            )
 
     # Fall back to traditional runtime evaluation
     perf_gain = performance_gain(

codeflash/verification/parse_test_output.py

@@ -37,7 +37,9 @@ def parse_func(file_path: Path) -> XMLParser:
 
 
 matches_re_start = re.compile(r"!\$######(.*?):(.*?)([^\.:]*?):(.*?):(.*?):(.*?)######\$!\n")
-matches_re_end = re.compile(r"!######(.*?):(.*?)([^\.:]*?):(.*?):(.*?):(.*?)(?::throughput_([\d\.]+)_ops_per_sec)?######!")
+matches_re_end = re.compile(
+    r"!######(.*?):(.*?)([^\.:]*?):(.*?):(.*?):(.*?)(?::throughput_([\d\.]+)_ops_per_sec)?######!"
+)
 
 
 def parse_test_return_values_bin(file_location: Path, test_files: TestFiles, test_config: TestConfig) -> TestResults: