Open-source implementation of AlphaEvolve
This report presents the forensic synthetic code analysis of algorithmicsuperintelligence/openevolve, a Python project with 6,711 GitHub stars. SynthScan v2.0 examined 126,637 lines of code across 455 source files, recording 2285 pattern matches distributed across 21 syntactic categories. The overall adjusted score of 24.7 places this repository in the Moderate AI signal band.
The scanner applied 160+ deterministic lexical heuristics, multi-line block detectors, abstract syntax tree depth profilers, and a cross-file Jaccard similarity matrix to construct a statistically normalised synthetic code estimate. All matches are individually weighted by severity coefficient and contextual multiplier before summation, and the resulting headline score is temporally discounted to account for the repository's development history relative to the commercial emergence of large language model coding tooling (November 2022 onward).
Longitudinal tracking requires multiple scan runs. Once this repository is re-scanned after new commits land, this chart will visualise how the synthetic code signal evolves over time — enabling you to detect whether AI authorship is growing, stabilising, or being actively corrected by human engineers.
Classifies detected patterns by their diagnostic confidence and structural impact. CRITICAL patterns (coefficient 10) represent definitive synthetic signatures — hallucinated imports, explicit LLM attribution metadata — virtually never produced by human authors. HIGH (5) indicates strong structural tells such as cross-file repetition or cross-linguistic idioms. MEDIUM (2) covers recognisable conversational padding and AI-specific vocabulary. LOW (1) captures subtle indicators like tautological comments and generic boilerplate that require density to carry independent signal.
This horizontal bar chart decomposes the repository's raw synthetic code score by top-level directory, allowing you to pinpoint precisely which modules or components carry the highest AI authorship density. Directories with disproportionately high scores relative to their size warrant targeted manual review: concentrated AI signatures often trace back to mass-generated configuration layers, auto-ported test suites, LLM-scaffolded boilerplate classes, or entire subsystems authored under heavy copilot assistance. Use this view to prioritise your human code-review effort.
The scanner identified 2285 distinct pattern matches across 21 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a statistically significant AI authorship indicator. Expand any category row to inspect the individual file paths, line numbers, code snippets, and the lexical context (CODE, COMMENT, or STRING) in which each match was detected.
Reading the findings table: The Severity column indicates the diagnostic confidence level (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — comment-context matches receive a ×1.5 weight because LLMs systematically over-annotate. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier as dense clusters constitute far stronger evidence of synthetic authorship than isolated hits.
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | examples/tsp_tour_minimization/utils/utils.py | 0 | run a function with a timeout using subprocess. args: func: function to run args: arguments to pass to the function kwar | STRING |
| HIGH | examples/function_minimization/evaluator.py | 0 | run a function with a timeout using subprocess. args: func: function to run args: arguments to pass to the function kwar | STRING |
| HIGH | examples/algotune/task_adapter.py | 0 | run a function with a timeout using subprocess. args: func: function to run args: arguments to pass to the function kwar | STRING |
| HIGH | examples/algotune/fft_cmplx_scipy_fftpack/evaluator.py | 0 | run a function with a timeout using subprocess. args: func: function to run args: arguments to pass to the function kwar | STRING |
| HIGH | examples/algotune/fft_convolution/evaluator.py | 0 | run a function with a timeout using subprocess. args: func: function to run args: arguments to pass to the function kwar | STRING |
| HIGH | examples/algotune/affine_transform_2d/evaluator.py | 0 | run a function with a timeout using subprocess. args: func: function to run args: arguments to pass to the function kwar | STRING |
| HIGH | examples/algotune/eigenvectors_complex/evaluator.py | 0 | run a function with a timeout using subprocess. args: func: function to run args: arguments to pass to the function kwar | STRING |
| HIGH | examples/algotune/convolve2d_full_fill/evaluator.py | 0 | run a function with a timeout using subprocess. args: func: function to run args: arguments to pass to the function kwar | STRING |
| HIGH | examples/algotune/lu_factorization/evaluator.py | 0 | run a function with a timeout using subprocess. args: func: function to run args: arguments to pass to the function kwar | STRING |
| HIGH | examples/algotune/psd_cone_projection/evaluator.py | 0 | run a function with a timeout using subprocess. args: func: function to run args: arguments to pass to the function kwar | STRING |
| HIGH | examples/algotune/polynomial_real/evaluator.py | 0 | run a function with a timeout using subprocess. args: func: function to run args: arguments to pass to the function kwar | STRING |
| HIGH | examples/claude_code_quickstart/evaluator.py | 0 | run a function with a timeout using subprocess. args: func: function to run args: arguments to pass to the function kwar | STRING |
| HIGH | examples/online_judge_programming/evaluator.py | 0 | run a function with a timeout using subprocess. args: func: function to run args: arguments to pass to the function kwar | STRING |
| HIGH | examples/function_minimization/README.md | 0 | a simple random search algorithm that often gets stuck in local minima. args: iterations: number of iterations to run bo | STRING |
| HIGH | examples/function_minimization/initial_program.py | 0 | a simple random search algorithm that often gets stuck in local minima. args: iterations: number of iterations to run bo | STRING |
| HIGH | examples/claude_code_quickstart/initial_program.py | 0 | a simple random search algorithm that often gets stuck in local minima. args: iterations: number of iterations to run bo | STRING |
| HIGH | examples/function_minimization/evaluator.py | 0 | evaluate the program by running it multiple times and checking how close it gets to the known global minimum. args: prog | STRING |
| HIGH | examples/arc_benchmark/evaluator.py | 0 | evaluate the program by running it multiple times and checking how close it gets to the known global minimum. args: prog | STRING |
| HIGH | examples/claude_code_quickstart/evaluator.py | 0 | evaluate the program by running it multiple times and checking how close it gets to the known global minimum. args: prog | STRING |
| HIGH | examples/circle_packing/initial_program.py | 0 | visualize the circle packing args: centers: np.array of shape (n, 2) with (x, y) coordinates radii: np.array of shape (n | STRING |
| HIGH | examples/circle_packing/best_program.py | 0 | visualize the circle packing args: centers: np.array of shape (n, 2) with (x, y) coordinates radii: np.array of shape (n | STRING |
| HIGH | …mples/circle_packing_with_artifacts/initial_program.py | 0 | visualize the circle packing args: centers: np.array of shape (n, 2) with (x, y) coordinates radii: np.array of shape (n | STRING |
| HIGH | examples/algotune/task_adapter.py | 0 | initial implementation of polynomial_real task. this will be evolved by openevolve to improve performance and correctnes | STRING |
| HIGH | …es/algotune/fft_cmplx_scipy_fftpack/initial_program.py | 0 | initial implementation of polynomial_real task. this will be evolved by openevolve to improve performance and correctnes | STRING |
| HIGH | …mples/algotune/fft_cmplx_scipy_fftpack/best_program.py | 0 | initial implementation of polynomial_real task. this will be evolved by openevolve to improve performance and correctnes | STRING |
| HIGH | examples/algotune/fft_convolution/initial_program.py | 0 | initial implementation of polynomial_real task. this will be evolved by openevolve to improve performance and correctnes | STRING |
| HIGH | examples/algotune/fft_convolution/best_program.py | 0 | initial implementation of polynomial_real task. this will be evolved by openevolve to improve performance and correctnes | STRING |
| HIGH | …amples/algotune/affine_transform_2d/initial_program.py | 0 | initial implementation of polynomial_real task. this will be evolved by openevolve to improve performance and correctnes | STRING |
| HIGH | examples/algotune/affine_transform_2d/best_program.py | 0 | initial implementation of polynomial_real task. this will be evolved by openevolve to improve performance and correctnes | STRING |
| HIGH | …mples/algotune/eigenvectors_complex/initial_program.py | 0 | initial implementation of polynomial_real task. this will be evolved by openevolve to improve performance and correctnes | STRING |
| HIGH | examples/algotune/eigenvectors_complex/best_program.py | 0 | initial implementation of polynomial_real task. this will be evolved by openevolve to improve performance and correctnes | STRING |
| HIGH | …mples/algotune/convolve2d_full_fill/initial_program.py | 0 | initial implementation of polynomial_real task. this will be evolved by openevolve to improve performance and correctnes | STRING |
| HIGH | examples/algotune/convolve2d_full_fill/best_program.py | 0 | initial implementation of polynomial_real task. this will be evolved by openevolve to improve performance and correctnes | STRING |
| HIGH | examples/algotune/lu_factorization/initial_program.py | 0 | initial implementation of polynomial_real task. this will be evolved by openevolve to improve performance and correctnes | STRING |
| HIGH | examples/algotune/lu_factorization/best_program.py | 0 | initial implementation of polynomial_real task. this will be evolved by openevolve to improve performance and correctnes | STRING |
| HIGH | …amples/algotune/psd_cone_projection/initial_program.py | 0 | initial implementation of polynomial_real task. this will be evolved by openevolve to improve performance and correctnes | STRING |
| HIGH | examples/algotune/psd_cone_projection/best_program.py | 0 | initial implementation of polynomial_real task. this will be evolved by openevolve to improve performance and correctnes | STRING |
| HIGH | examples/algotune/polynomial_real/initial_program.py | 0 | initial implementation of polynomial_real task. this will be evolved by openevolve to improve performance and correctnes | STRING |
| HIGH | examples/algotune/polynomial_real/best_program.py | 0 | initial implementation of polynomial_real task. this will be evolved by openevolve to improve performance and correctnes | STRING |
| HIGH | examples/algotune/task_adapter.py | 0 | solve the polynomial_real problem. args: problem: dictionary containing problem data specific to polynomial_real returns | STRING |
| HIGH | …es/algotune/fft_cmplx_scipy_fftpack/initial_program.py | 0 | solve the polynomial_real problem. args: problem: dictionary containing problem data specific to polynomial_real returns | STRING |
| HIGH | …mples/algotune/fft_cmplx_scipy_fftpack/best_program.py | 0 | solve the polynomial_real problem. args: problem: dictionary containing problem data specific to polynomial_real returns | STRING |
| HIGH | examples/algotune/fft_convolution/initial_program.py | 0 | solve the polynomial_real problem. args: problem: dictionary containing problem data specific to polynomial_real returns | STRING |
| HIGH | examples/algotune/fft_convolution/best_program.py | 0 | solve the polynomial_real problem. args: problem: dictionary containing problem data specific to polynomial_real returns | STRING |
| HIGH | …amples/algotune/affine_transform_2d/initial_program.py | 0 | solve the polynomial_real problem. args: problem: dictionary containing problem data specific to polynomial_real returns | STRING |
| HIGH | examples/algotune/affine_transform_2d/best_program.py | 0 | solve the polynomial_real problem. args: problem: dictionary containing problem data specific to polynomial_real returns | STRING |
| HIGH | …mples/algotune/eigenvectors_complex/initial_program.py | 0 | solve the polynomial_real problem. args: problem: dictionary containing problem data specific to polynomial_real returns | STRING |
| HIGH | examples/algotune/eigenvectors_complex/best_program.py | 0 | solve the polynomial_real problem. args: problem: dictionary containing problem data specific to polynomial_real returns | STRING |
| HIGH | …mples/algotune/convolve2d_full_fill/initial_program.py | 0 | solve the polynomial_real problem. args: problem: dictionary containing problem data specific to polynomial_real returns | STRING |
| HIGH | examples/algotune/lu_factorization/initial_program.py | 0 | solve the polynomial_real problem. args: problem: dictionary containing problem data specific to polynomial_real returns | STRING |
| HIGH | …amples/algotune/psd_cone_projection/initial_program.py | 0 | solve the polynomial_real problem. args: problem: dictionary containing problem data specific to polynomial_real returns | STRING |
| HIGH | examples/algotune/psd_cone_projection/best_program.py | 0 | solve the polynomial_real problem. args: problem: dictionary containing problem data specific to polynomial_real returns | STRING |
| HIGH | examples/algotune/polynomial_real/initial_program.py | 0 | solve the polynomial_real problem. args: problem: dictionary containing problem data specific to polynomial_real returns | STRING |
| HIGH | examples/algotune/task_adapter.py | 0 | check if the provided solution is valid. args: problem: the original problem solution: the proposed solution returns: tr | STRING |
| HIGH | …es/algotune/fft_cmplx_scipy_fftpack/initial_program.py | 0 | check if the provided solution is valid. args: problem: the original problem solution: the proposed solution returns: tr | STRING |
| HIGH | …mples/algotune/fft_cmplx_scipy_fftpack/best_program.py | 0 | check if the provided solution is valid. args: problem: the original problem solution: the proposed solution returns: tr | STRING |
| HIGH | examples/algotune/fft_convolution/initial_program.py | 0 | check if the provided solution is valid. args: problem: the original problem solution: the proposed solution returns: tr | STRING |
| HIGH | examples/algotune/fft_convolution/best_program.py | 0 | check if the provided solution is valid. args: problem: the original problem solution: the proposed solution returns: tr | STRING |
| HIGH | …amples/algotune/affine_transform_2d/initial_program.py | 0 | check if the provided solution is valid. args: problem: the original problem solution: the proposed solution returns: tr | STRING |
| HIGH | examples/algotune/affine_transform_2d/best_program.py | 0 | check if the provided solution is valid. args: problem: the original problem solution: the proposed solution returns: tr | STRING |
| 101 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | tests/test_template_dir_resolution.py | 16 | def test_relative_template_dir_resolved_to_config_location(self): | CODE |
| LOW | tests/test_template_dir_resolution.py | 39 | def test_absolute_template_dir_unchanged(self): | CODE |
| LOW | tests/test_template_dir_resolution.py | 59 | def test_null_template_dir_unchanged(self): | CODE |
| LOW | tests/test_template_dir_resolution.py | 78 | def test_nested_relative_template_dir(self): | CODE |
| LOW | tests/test_orphan_program_removal.py | 48 | def test_true_orphan_is_removed(self): | CODE |
| LOW⚡ | tests/test_orphan_program_removal.py | 65 | def test_island_member_is_kept(self): | CODE |
| LOW⚡ | tests/test_orphan_program_removal.py | 73 | def test_cell_owner_in_other_island_is_kept(self): | CODE |
| LOW⚡ | tests/test_orphan_program_removal.py | 81 | def test_missing_program_is_noop(self): | CODE |
| LOW⚡ | tests/test_orphan_program_removal.py | 86 | def test_orphan_removal_clears_stale_island_best(self): | CODE |
| LOW | tests/test_orphan_program_removal.py | 126 | def test_displaced_program_removed_on_replacement(self): | CODE |
| LOW | tests/test_orphan_program_removal.py | 138 | def test_no_zombie_accumulation_over_many_replacements(self): | CODE |
| LOW | tests/test_orphan_program_removal.py | 151 | def test_displaced_program_removed_from_archive(self): | CODE |
| LOW | tests/test_orphan_program_removal.py | 160 | def test_worse_program_does_not_displace_owner(self): | CODE |
| LOW | tests/test_cli_model_override.py | 14 | def test_rebuild_models_with_both_models(self): | CODE |
| LOW | tests/test_cli_model_override.py | 38 | def test_rebuild_models_primary_only(self): | CODE |
| LOW | tests/test_cli_model_override.py | 49 | def test_rebuild_models_with_weights(self): | CODE |
| LOW | tests/test_cli_model_override.py | 63 | def test_rebuild_models_zero_weight_secondary(self): | CODE |
| LOW | tests/test_cli_model_override.py | 76 | def test_rebuild_preserves_shared_config(self): | CODE |
| LOW | tests/test_cli_model_override.py | 89 | def test_rebuild_models_with_config_file_override(self): | CODE |
| LOW | tests/test_cli_model_override.py | 121 | def test_evaluator_models_updated_after_rebuild(self): | STRING |
| LOW | tests/test_utils.py | 172 | def get_evolution_test_program(): | CODE |
| LOW | tests/test_utils.py | 181 | def get_evolution_test_evaluator(): | STRING |
| LOW | tests/test_iteration_counting.py | 47 | def test_fresh_start_iteration_counting(self): | CODE |
| LOW | tests/test_iteration_counting.py | 81 | def test_resume_iteration_counting(self): | CODE |
| LOW | tests/test_iteration_counting.py | 114 | def test_checkpoint_boundary_conditions(self): | CODE |
| LOW | tests/test_database.py | 84 | def test_island_operations_basic(self): | CODE |
| LOW | tests/test_database.py | 127 | def test_feature_coordinates_calculation(self): | CODE |
| LOW | tests/test_database.py | 147 | def test_feature_map_operations(self): | CODE |
| LOW | tests/test_database.py | 207 | def test_get_top_programs_with_metrics(self): | CODE |
| LOW | tests/test_database.py | 253 | def test_best_program_tracking(self): | CODE |
| LOW | tests/test_database.py | 275 | def test_population_limit_enforcement(self): | CODE |
| LOW | tests/test_database.py | 297 | def test_calculate_complexity_bin_adaptive(self): | CODE |
| LOW | tests/test_database.py | 331 | def test_calculate_complexity_bin_cold_start(self): | CODE |
| LOW | tests/test_database.py | 347 | def test_calculate_diversity_bin_adaptive(self): | CODE |
| LOW | tests/test_database.py | 383 | def test_calculate_diversity_bin_cold_start(self): | CODE |
| LOW | tests/test_database.py | 399 | def test_calculate_diversity_bin_identical_programs(self): | CODE |
| LOW | tests/test_database.py | 414 | def test_fast_code_diversity_function(self): | CODE |
| LOW | tests/test_database.py | 434 | def test_diversity_feature_integration(self): | CODE |
| LOW | tests/test_database.py | 463 | def test_migration_prevents_re_migration(self): | CODE |
| LOW | tests/test_database.py | 514 | def test_empty_island_initialization_creates_copies(self): | CODE |
| LOW | tests/test_database.py | 554 | def test_no_program_assigned_to_multiple_islands(self): | CODE |
| LOW | tests/test_database.py | 597 | def test_migration_validation_passes(self): | CODE |
| LOW | tests/test_process_parallel_fix.py | 39 | def test_submit_iteration_uses_sample_from_island(self): | CODE |
| LOW | tests/test_process_parallel_fix.py | 92 | def test_concurrent_submissions_no_race_condition(self): | CODE |
| LOW | tests/test_process_parallel_fix.py | 127 | def test_database_state_unchanged_after_sampling(self): | CODE |
| LOW | tests/test_island_migration.py | 33 | def test_initial_island_setup(self): | CODE |
| LOW | tests/test_island_migration.py | 47 | def test_program_island_assignment(self): | CODE |
| LOW | tests/test_island_migration.py | 68 | def test_should_migrate_logic(self): | CODE |
| LOW | tests/test_island_migration.py | 81 | def test_migration_ring_topology(self): | CODE |
| LOW | tests/test_island_migration.py | 117 | def test_migration_rate_respected(self): | CODE |
| LOW | tests/test_island_migration.py | 153 | def test_migration_preserves_best_programs(self): | CODE |
| LOW | tests/test_island_migration.py | 183 | def test_migration_updates_generations(self): | CODE |
| LOW | tests/test_island_migration.py | 199 | def test_migration_with_empty_islands(self): | CODE |
| LOW | tests/test_island_migration.py | 214 | def test_migration_creates_proper_copies(self): | CODE |
| LOW | tests/test_island_migration.py | 256 | def test_no_migration_with_single_island(self): | CODE |
| LOW | tests/test_artifacts_integration.py | 106 | def test_compile_failure_artifact_capture(self): | CODE |
| LOW | tests/test_artifacts_integration.py | 137 | def test_end_to_end_artifact_flow(self): | CODE |
| LOW | tests/test_artifacts_integration.py | 181 | def test_cascade_evaluation_with_artifacts(self): | CODE |
| LOW | tests/test_artifacts_integration.py | 212 | def test_artifacts_disabled_integration(self): | CODE |
| LOW | tests/test_artifacts_integration.py | 235 | def test_successful_evaluation_with_artifacts(self): | CODE |
| 462 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | tests/test_utils.py | 83 | except Exception as e: | CODE |
| LOW | tests/test_island_migration.py | 211 | except Exception as e: | CODE |
| LOW | tests/test_artifacts_integration.py | 52 | except Exception as e: | STRING |
| LOW | tests/test_artifacts_integration.py | 71 | except Exception as e: | STRING |
| MEDIUM | tests/test_artifacts_integration.py | 39 | def evaluate(program_path): | CODE |
| LOW | tests/test_island_tracking.py | 227 | except Exception as e: | CODE |
| LOW | tests/test_concurrent_island_access.py | 86 | except Exception as e: | CODE |
| LOW | tests/test_concurrent_island_access.py | 136 | except Exception as e: | CODE |
| MEDIUM | tests/test_concurrent_island_access.py | 137 | print(f"Error sampling from island {island_id}: {e}") | CODE |
| LOW | tests/test_concurrent_island_access.py | 215 | except Exception as e: | CODE |
| LOW⚡ | tests/integration/test_examples_validation.py | 199 | except Exception as e: | CODE |
| LOW | tests/integration/test_examples_validation.py | 358 | except Exception as e: | CODE |
| LOW | tests/integration/conftest.py | 42 | except Exception as e: | CODE |
| LOW | tests/integration/test_library_api.py | 156 | except Exception as e: | CODE |
| LOW | tests/integration/test_library_api.py | 250 | except Exception as e: | CODE |
| LOW | examples/README.md | 56 | except Exception as e: | CODE |
| LOW | examples/attention_optimization/evaluator.py | 188 | except Exception as e: | CODE |
| LOW | examples/attention_optimization/evaluator.py | 276 | except Exception as e: | CODE |
| LOW | examples/attention_optimization/tests/test_results.py | 27 | except Exception as e: | CODE |
| LOW | examples/attention_optimization/tests/test_results.py | 51 | except Exception as e: | CODE |
| LOW | examples/attention_optimization/tests/test_evaluator.py | 61 | except Exception as e: | STRING |
| LOW | examples/attention_optimization/tests/test_evaluator.py | 90 | except Exception as e: | STRING |
| LOW | examples/attention_optimization/tests/test_evaluator.py | 115 | except Exception as e: | STRING |
| LOW | …ntion_optimization/legacy/prev_sim__works_evaluator.py | 319 | except Exception as e: | STRING |
| LOW | …ntion_optimization/legacy/prev_sim__works_evaluator.py | 503 | except Exception as e: | STRING |
| LOW | …les/attention_optimization/scripts/mlir_syntax_test.py | 244 | except Exception as e: | STRING |
| LOW | …les/attention_optimization/scripts/mlir_syntax_test.py | 295 | except Exception as e: | STRING |
| LOW | examples/attention_optimization/scripts/to_real_mlir.sh | 78 | except Exception as e: | CODE |
| LOW | examples/attention_optimization/scripts/to_real_mlir.sh | 109 | except Exception as e: | CODE |
| LOW | examples/attention_optimization/scripts/to_real_mlir.sh | 201 | except Exception as e: | CODE |
| LOW | examples/attention_optimization/scripts/to_real_mlir.sh | 299 | except Exception as e: | STRING |
| LOW | examples/attention_optimization/scripts/to_real_mlir.sh | 409 | except Exception as e: | STRING |
| LOW | examples/attention_optimization/scripts/to_real_mlir.sh | 428 | except Exception as e: | STRING |
| LOW | …attention_optimization/scripts/debug_real_execution.py | 67 | except Exception as e: | STRING |
| LOW | …attention_optimization/scripts/debug_real_execution.py | 120 | except Exception as e: | STRING |
| LOW | …tention_optimization/scripts/mlir_lowering_pipeline.py | 54 | except Exception as e: | CODE |
| LOW | …tention_optimization/scripts/mlir_lowering_pipeline.py | 132 | except Exception as e: | CODE |
| LOW | …tention_optimization/scripts/mlir_lowering_pipeline.py | 188 | except Exception as e: | CODE |
| LOW | examples/tsp_tour_minimization/evaluator.py | 233 | except Exception as e: | CODE |
| LOW | examples/tsp_tour_minimization/evaluator.py | 250 | except Exception as e: | CODE |
| LOW | examples/tsp_tour_minimization/evaluator.py | 282 | except Exception as e: | CODE |
| LOW | examples/tsp_tour_minimization/utils/tsp_runner.py | 273 | except Exception as exc: | CODE |
| LOW | examples/tsp_tour_minimization/utils/heat_map_runner.py | 262 | except Exception: | CODE |
| LOW | examples/tsp_tour_minimization/utils/heat_map_runner.py | 271 | except Exception: | CODE |
| MEDIUM | examples/function_minimization/evaluator.py | 69 | print(f"Error: program does not have 'run_search' function") | CODE |
| LOW | examples/function_minimization/evaluator.py | 166 | except Exception as e: | CODE |
| LOW | examples/function_minimization/evaluator.py | 234 | except Exception as e: | CODE |
| LOW | examples/function_minimization/evaluator.py | 449 | except Exception as e: | CODE |
| LOW | examples/function_minimization/evaluator.py | 469 | except Exception as e: | CODE |
| LOW⚡ | examples/circle_packing/evaluator.py | 127 | except Exception as e: | CODE |
| MEDIUM⚡ | examples/circle_packing/evaluator.py | 129 | print(f"Error in subprocess: {{str(e)}}") | CODE |
| MEDIUM⚡ | examples/circle_packing/evaluator.py | 133 | print(f"Error saved to {temp_file.name}.results") | CODE |
| LOW | examples/circle_packing/evaluator.py | 268 | except Exception as e: | STRING |
| LOW | examples/circle_packing/evaluator.py | 324 | except Exception as e: | STRING |
| LOW | examples/circle_packing/evaluator.py | 329 | except Exception as e: | STRING |
| LOW | …ples/mlx_metal_kernel_opt/mlx_lm_generate_with_hook.py | 150 | except Exception: | CODE |
| LOW | examples/mlx_metal_kernel_opt/initial_program.py | 235 | except Exception as e: | STRING |
| LOW | …mples/mlx_metal_kernel_opt/test_optimized_attention.py | 93 | except Exception as e: | CODE |
| LOW | …mples/mlx_metal_kernel_opt/test_optimized_attention.py | 119 | except Exception as e: | CODE |
| MEDIUM | …mples/mlx_metal_kernel_opt/test_optimized_attention.py | 187 | print(f"Error: {result.stderr[:200]}") | CODE |
| 381 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | tests/test_database_cleanup.py | 10 | CODE | |
| LOW | tests/test_utils.py | 7 | CODE | |
| LOW | tests/test_database.py | 6 | CODE | |
| LOW | tests/test_process_parallel_fix.py | 5 | CODE | |
| LOW | tests/test_process_parallel_fix.py | 6 | CODE | |
| LOW | tests/test_process_parallel_fix.py | 7 | CODE | |
| LOW | tests/test_artifacts_integration.py | 9 | CODE | |
| LOW | tests/test_artifacts_integration.py | 11 | CODE | |
| LOW | tests/test_artifacts_integration.py | 11 | CODE | |
| LOW | tests/test_process_parallel.py | 12 | CODE | |
| LOW | tests/test_process_parallel.py | 24 | CODE | |
| LOW | tests/test_process_parallel.py | 24 | CODE | |
| LOW | tests/test_process_parallel.py | 24 | CODE | |
| LOW | tests/test_process_parallel.py | 24 | CODE | |
| LOW | tests/test_novelty_asyncio_issue.py | 12 | CODE | |
| LOW | tests/test_novelty_asyncio_issue.py | 12 | CODE | |
| LOW | tests/test_novelty_asyncio_issue.py | 54 | CODE | |
| LOW | tests/test_evolution_trace.py | 6 | CODE | |
| LOW | tests/test_evolution_trace.py | 10 | CODE | |
| LOW | tests/test_evolution_trace.py | 10 | CODE | |
| LOW | tests/test_artifacts.py | 9 | CODE | |
| LOW | tests/test_migration_no_duplicates.py | 11 | CODE | |
| LOW | tests/test_openai_model_detection.py | 6 | CODE | |
| LOW | tests/test_prompt_sampler_comprehensive.py | 6 | CODE | |
| LOW | tests/test_prompt_sampler_comprehensive.py | 6 | CODE | |
| LOW | tests/test_grid_stability.py | 5 | CODE | |
| LOW | tests/test_map_elites_features.py | 6 | CODE | |
| LOW | tests/test_map_elites_features.py | 6 | CODE | |
| LOW | tests/test_valid_configs.py | 8 | CODE | |
| LOW | tests/test_llm_ensemble.py | 5 | CODE | |
| LOW | tests/test_file_extension_preservation.py | 9 | CODE | |
| LOW | tests/test_file_extension_preservation.py | 12 | CODE | |
| LOW | tests/test_file_extension_preservation.py | 14 | CODE | |
| LOW | tests/test_file_extension_preservation.py | 14 | CODE | |
| LOW | tests/test_island_child_placement.py | 10 | CODE | |
| LOW | tests/test_concurrent_island_access.py | 7 | CODE | |
| LOW | tests/test_concurrent_island_access.py | 8 | CODE | |
| LOW | tests/test_concurrent_island_access.py | 10 | CODE | |
| LOW | tests/test_concurrent_island_access.py | 10 | CODE | |
| LOW | tests/test_cascade_validation.py | 8 | CODE | |
| LOW | tests/test_checkpoint_resume.py | 10 | CODE | |
| LOW | tests/test_checkpoint_resume.py | 11 | CODE | |
| LOW | tests/test_checkpoint_resume.py | 18 | CODE | |
| LOW | tests/test_reasoning_effort_config.py | 6 | CODE | |
| LOW | tests/test_reasoning_effort_config.py | 12 | CODE | |
| LOW | tests/test_reasoning_effort_config.py | 12 | CODE | |
| LOW | tests/test_island_map_elites.py | 10 | CODE | |
| LOW | tests/test_api.py | 8 | CODE | |
| LOW | tests/test_visualization_sanitization.py | 7 | CODE | |
| LOW | tests/test_evaluator_timeout.py | 10 | CODE | |
| LOW | tests/test_island_isolation.py | 6 | CODE | |
| LOW | tests/test_island_isolation.py | 9 | CODE | |
| LOW | tests/test_island_isolation.py | 9 | CODE | |
| LOW | tests/integration/conftest.py | 6 | CODE | |
| LOW | tests/integration/conftest.py | 7 | CODE | |
| LOW | tests/integration/conftest.py | 8 | CODE | |
| LOW | tests/integration/test_library_api.py | 6 | CODE | |
| LOW | tests/integration/test_library_api.py | 13 | CODE | |
| LOW | tests/integration/test_smoke.py | 10 | CODE | |
| LOW | tests/integration/test_smoke.py | 10 | CODE | |
| 282 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | tests/integration/__init__.py | 1 | # Integration tests directory | COMMENT |
| LOW | …ntion_optimization/legacy/prev_sim__works_evaluator.py | 1 | # #!/usr/bin/env python3 | COMMENT |
| LOW | …ntion_optimization/legacy/prev_sim__works_evaluator.py | 21 | # self.reference_performance = None | COMMENT |
| LOW | …ntion_optimization/legacy/prev_sim__works_evaluator.py | 41 | # baseline = ''' | COMMENT |
| LOW | …ntion_optimization/legacy/prev_sim__works_evaluator.py | 61 | # def compile_mlir_with_optimizations(self, base_mlir, optimization_params): | COMMENT |
| LOW | …ntion_optimization/legacy/prev_sim__works_evaluator.py | 81 | COMMENT | |
| LOW | …ntion_optimization/legacy/prev_sim__works_evaluator.py | 101 | # if element not in mlir_code: | COMMENT |
| LOW | …ntion_optimization/legacy/prev_sim__works_evaluator.py | 121 | COMMENT | |
| LOW | …ntion_optimization/legacy/prev_sim__works_evaluator.py | 141 | # speedup *= 1.20 # 20% improvement from vectorization | COMMENT |
| LOW | …ntion_optimization/legacy/prev_sim__works_evaluator.py | 161 | # total_time = 0 | COMMENT |
| LOW | …ntion_optimization/legacy/prev_sim__works_evaluator.py | 181 | # "score": 0.0 | COMMENT |
| LOW | …ntion_optimization/legacy/prev_sim__works_evaluator.py | 201 | # for config in self.test_configs: | COMMENT |
| LOW | …ntion_optimization/legacy/prev_sim__works_evaluator.py | 221 | # } | COMMENT |
| LOW | …les/attention_optimization/scripts/mlir_syntax_test.py | 1 | # #!/usr/bin/env python3 | COMMENT |
| LOW | …les/attention_optimization/scripts/mlir_syntax_test.py | 21 | # module { | COMMENT |
| LOW | …les/attention_optimization/scripts/mlir_syntax_test.py | 41 | # ^bb0(%q: f32, %k: f32, %acc: f32): | COMMENT |
| LOW | …les/attention_optimization/scripts/mlir_syntax_test.py | 61 | # } | COMMENT |
| LOW | …les/attention_optimization/scripts/mlir_syntax_test.py | 81 | # print("✅ MLIR baseline syntax is correct!") | COMMENT |
| LOW | …les/attention_optimization/scripts/mlir_syntax_test.py | 101 | # iterator_types = ["parallel", "parallel"] | COMMENT |
| LOW | …les/attention_optimization/scripts/mlir_syntax_test.py | 121 | # # Test tiling with our syntax | COMMENT |
| LOW | …les/attention_optimization/scripts/mlir_syntax_test.py | 141 | COMMENT | |
| LOW | examples/tsp_tour_minimization/initial_program/TSP.cpp | 1 | // standart imports | COMMENT |
| LOW | examples/tsp_tour_minimization/initial_program/TSP.cpp | 21 | // additional functions & methods | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 21 | #include <algorithm> // all_of, find, for_each | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 41 | // SPDX-License-Identifier: MIT | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 61 | #if defined(NLOHMANN_JSON_VERSION_MAJOR) && defined(NLOHMANN_JSON_VERSION_MINOR) && defined(NLOHMANN_JSON_VERSION_PA | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 81 | #define NLOHMANN_JSON_ABI_TAG_DIAGNOSTICS _diag | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 141 | #endif | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 161 | #include <array> // array | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 181 | COMMENT | |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 201 | COMMENT | |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 221 | // __ _____ _____ _____ | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 321 | // __ _____ _____ _____ | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 341 | #undef JSON_HEDLEY_STRINGIFY_EX | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 361 | #undef JSON_HEDLEY_CONCAT3_EX | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 381 | #undef JSON_HEDLEY_VERSION_DECODE_MINOR | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 401 | #endif | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 421 | #endif | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 441 | #if defined(JSON_HEDLEY_INTEL_VERSION_CHECK) | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 461 | #define JSON_HEDLEY_INTEL_CL_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_INTEL_CL_VERSION >= JSON_HEDLEY_VERSION_E | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 481 | COMMENT | |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 501 | #define JSON_HEDLEY_SUNPRO_VERSION_CHECK(major,minor,patch) (0) | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 521 | #undef JSON_HEDLEY_ARM_VERSION | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 541 | #if defined(__ibmxl__) | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 561 | #if \ | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 581 | COMMENT | |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 601 | #if defined(__TI_COMPILER_VERSION__) && defined(__MSP430__) | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 621 | #if defined(JSON_HEDLEY_TI_ARMCL_VERSION_CHECK) | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 641 | #define JSON_HEDLEY_TI_CL6X_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_CL6X_VERSION >= JSON_HEDLEY_VERSION_ENC | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 661 | COMMENT | |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 681 | #if defined(_CRAYC) | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 701 | #if defined(__IAR_SYSTEMS_ICC__) | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 721 | #if defined(__TINYC__) | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 741 | #if defined(JSON_HEDLEY_DMC_VERSION_CHECK) | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 761 | #define JSON_HEDLEY_COMPCERT_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_COMPCERT_VERSION >= JSON_HEDLEY_VERSION_E | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 781 | COMMENT | |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 821 | #undef JSON_HEDLEY_GCC_VERSION_CHECK | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 841 | COMMENT | |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 861 | #undef JSON_HEDLEY_HAS_CPP_ATTRIBUTE | COMMENT |
| LOW | …tsp_tour_minimization/initial_program/include/json.hpp | 881 | (!defined(JSON_HEDLEY_MSVC_VERSION) || JSON_HEDLEY_MSVC_VERSION_CHECK(19,20,0)) | COMMENT |
| 321 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | tests/test_template_dir_resolution.py | 18 | # Create a temporary directory structure | COMMENT |
| MEDIUM | tests/test_database.py | 446 | # Create a test program with diversity feature enabled | COMMENT |
| MEDIUM | tests/test_novelty_asyncio_issue.py | 137 | # Create a new database with novelty checking disabled | COMMENT |
| MEDIUM⚡ | tests/test_evolution_trace.py | 625 | # Create a valid program | COMMENT |
| MEDIUM⚡ | tests/test_evolution_trace.py | 629 | # Create a corrupted file | COMMENT |
| MEDIUM | tests/test_evolution_trace.py | 423 | # Create a chain of programs | COMMENT |
| MEDIUM | tests/test_evolution_trace.py | 519 | # Create a chain of programs with prompts | COMMENT |
| MEDIUM | tests/test_island_parent_consistency.py | 33 | # Create a child of the initial program | COMMENT |
| MEDIUM | tests/test_island_parent_consistency.py | 72 | # Create a lineage with TRULY different code to avoid MAP-Elites deduplication | COMMENT |
| MEDIUM | tests/test_artifacts.py | 75 | # Create a test program | COMMENT |
| MEDIUM | tests/test_artifacts.py | 146 | # Create a mock evaluation file | COMMENT |
| MEDIUM | tests/test_migration_no_duplicates.py | 125 | # Create a program with specific content | COMMENT |
| MEDIUM | tests/test_migration_no_duplicates.py | 339 | # Create a program on island 0 | COMMENT |
| MEDIUM | tests/test_migration_no_duplicates.py | 354 | # Create a program with IDENTICAL CODE on island 1 (target island) | COMMENT |
| MEDIUM | tests/test_openai_model_detection.py | 15 | # Define the same constants as in the code | COMMENT |
| MEDIUM | tests/test_map_elites_features.py | 34 | # Create a test program | COMMENT |
| MEDIUM | tests/test_file_extension_preservation.py | 69 | # Create a temp evaluator file for this test | COMMENT |
| MEDIUM | tests/test_file_extension_preservation.py | 83 | # Create a mock config object with file_suffix | COMMENT |
| MEDIUM | tests/test_file_extension_preservation.py | 99 | # Create a mock database | COMMENT |
| MEDIUM | tests/test_file_extension_preservation.py | 132 | # Create a temp evaluator file | COMMENT |
| MEDIUM | tests/test_island_child_placement.py | 132 | # Create a child program | COMMENT |
| MEDIUM | tests/test_cascade_validation.py | 157 | # Create a dummy program file | STRING |
| MEDIUM | tests/test_cascade_validation.py | 191 | # Create a dummy program file | STRING |
| MEDIUM | tests/test_checkpoint_resume.py | 52 | # Create a simple test program | COMMENT |
| MEDIUM | tests/test_checkpoint_resume.py | 66 | # Create a simple evaluator file | STRING |
| MEDIUM | tests/test_reasoning_effort_config.py | 121 | # Create a mock model config with reasoning_effort | COMMENT |
| MEDIUM | tests/test_feature_stats_persistence.py | 95 | # Create a checkpoint manually without feature_stats | COMMENT |
| MEDIUM | tests/test_evaluator_timeout.py | 21 | # Create a test evaluation file | COMMENT |
| MEDIUM | tests/test_evaluator_timeout.py | 400 | # Create a test evaluation file that simulates a long-running evaluation | COMMENT |
| MEDIUM | …ntion_optimization/legacy/prev_sim__works_evaluator.py | 33 | # # Create a simple baseline if it doesn't exist | COMMENT |
| MEDIUM | …ntion_optimization/legacy/prev_sim__works_evaluator.py | 280 | # Create a simple baseline if it doesn't exist | COMMENT |
| MEDIUM | …tention_optimization/scripts/mlir_lowering_pipeline.py | 219 | # Create the lowered file | COMMENT |
| MEDIUM | examples/circle_packing/evaluator.py | 88 | # Create a temporary file to execute | COMMENT |
| MEDIUM | examples/r_robust_regression/evaluator.py | 48 | # Create a temporary R script that sources the program and runs it | COMMENT |
| MEDIUM | examples/rust_adaptive_sort/evaluator.py | 42 | # Create a temporary Rust project | COMMENT |
| MEDIUM | examples/symbolic_regression/scripts.sh | 3 | # Define the number of problems for each split | COMMENT |
| MEDIUM⚡ | examples/algotune/create_task.py | 51 | # Create the OpenEvolve files | COMMENT |
| MEDIUM | …haevolve_math_problems/heilbronn_triangle/evaluator.py | 3 | # This file implements the evaluator for the heilbronn problem for triangles, with | COMMENT |
| MEDIUM | …aevolve_math_problems/first_autocorr_ineq/evaluator.py | 3 | # This file implements the evaluator for the first autocorrelation inequality problem. | COMMENT |
| MEDIUM | …evolve_math_problems/second_autocorr_ineq/evaluator.py | 3 | # This file implements the evaluator for the second autocorrelation inequality problem. | COMMENT |
| MEDIUM | …aevolve_math_problems/third_autocorr_ineq/evaluator.py | 3 | # This file implements the evaluator for the third autocorrelation inequality problem. | COMMENT |
| MEDIUM | …/alphaevolve_math_problems/kissing_number/evaluator.py | 3 | # This file implements the evaluator for the kissing number problem on dimension 11. | COMMENT |
| MEDIUM | …lphaevolve_math_problems/uncertainty_ineq/evaluator.py | 3 | # This file implements the evaluator for the uncertainty inequality problem. | COMMENT |
| MEDIUM | …olve_math_problems/sums_diffs_finite_sets/evaluator.py | 3 | # This file implements the evaluator for the sums and differences of finite sets problem. | COMMENT |
| MEDIUM | …e_math_problems/minimizing_max_min_dist/3/evaluator.py | 3 | # This file implements the evaluator for problem of minimizing the ratio of maximum | COMMENT |
| MEDIUM | …e_math_problems/minimizing_max_min_dist/2/evaluator.py | 3 | # This file implements the evaluator for problem of minimizing the ratio of maximum | COMMENT |
| MEDIUM | …aevolve_math_problems/circle_packing_rect/evaluator.py | 3 | # This file implements the evaluator for the circle packing problem on a rectangle | COMMENT |
| MEDIUM | …haevolve_math_problems/hexagon_packing/11/evaluator.py | 3 | # This file implements the evaluator for problem of packing unit regular hexagons inside | COMMENT |
| MEDIUM | …haevolve_math_problems/hexagon_packing/12/evaluator.py | 3 | # This file implements the evaluator for problem of packing unit regular hexagons inside | COMMENT |
| MEDIUM | examples/alphaevolve_math_problems/matmul/evaluator.py | 3 | # This file implements the evaluator for the matrix multiplication problem with tensor size | COMMENT |
| MEDIUM | …phaevolve_math_problems/erdos_min_overlap/evaluator.py | 3 | # This file implements the evaluator for the erdos minimum overlap problem. | COMMENT |
| MEDIUM | …aevolve_math_problems/heilbronn_convex/13/evaluator.py | 3 | # This file implements the evaluator for the heilbronn problem for convex regions, with | COMMENT |
| MEDIUM | …aevolve_math_problems/heilbronn_convex/14/evaluator.py | 3 | # This file implements the evaluator for the heilbronn problem for convex regions, with | COMMENT |
| MEDIUM | examples/sldbench/run.sh | 44 | # This function is called when the script receives a signal to terminate (e.g., Ctrl+C). | COMMENT |
| MEDIUM | examples/signal_processing/initial_program.py | 107 | # Create a complex signal with multiple components | COMMENT |
| MEDIUM | examples/circle_packing_with_artifacts/evaluator.py | 94 | # Create a temporary file to execute | COMMENT |
| MEDIUM | configs/default_config.yaml | 2 | # This file contains all available configuration options with sensible defaults | COMMENT |
| MEDIUM | openevolve/database.py | 1309 | # Create a copy of best program for the empty island (don't reuse same ID) | COMMENT |
| MEDIUM | openevolve/database.py | 1355 | # Create a copy of best program for the empty island (don't reuse same ID) | COMMENT |
| MEDIUM | openevolve/database.py | 1636 | # Create a mapping of feature cells to island programs for efficient lookup | COMMENT |
| 6 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | tests/test_island_parent_consistency.py | 50 | # Check if parent is in child's island (this is what the user's assertion checks) | COMMENT |
| LOW | tests/test_migration_no_duplicates.py | 56 | self.db.island_generations[island] = 3 # Set generation to trigger migration | CODE |
| LOW | tests/test_migration_no_duplicates.py | 312 | # Set generation to trigger migration | COMMENT |
| LOW | tests/test_migration_no_duplicates.py | 369 | # Set generations to trigger migration | COMMENT |
| LOW | tests/test_migration_no_duplicates.py | 382 | # Check if any new programs were added to island 1 | COMMENT |
| LOW | tests/test_regional_endpoint.py | 51 | # Check if result matches expectation | COMMENT |
| LOW | tests/test_concurrent_island_access.py | 74 | # Check if we got programs from the correct island | COMMENT |
| LOW | tests/test_concurrent_island_access.py | 105 | # Check if the restored island doesn't match what we expect | COMMENT |
| LOW | tests/test_concurrent_island_access.py | 112 | # Check if any errors occurred | COMMENT |
| LOW | tests/integration/conftest.py | 29 | # Check if server is already running (for development) | COMMENT |
| LOW | tests/integration/test_checkpoint_with_llm.py | 80 | # Check if checkpoint was created | COMMENT |
| LOW | …es/attention_optimization/scripts/fix_tensor_shapes.py | 3 | # Read the file | COMMENT |
| LOW | examples/function_minimization/evaluator.py | 67 | # Check if the required function exists | COMMENT |
| LOW | examples/function_minimization/evaluator.py | 132 | # Check if the result is valid (not NaN or infinite) | COMMENT |
| LOW | examples/function_minimization/evaluator.py | 273 | # Check if the required function exists | COMMENT |
| LOW | examples/function_minimization/evaluator.py | 348 | # Check if the result is valid | COMMENT |
| LOW | examples/circle_packing/evaluator.py | 48 | # Check if radii are nonnegative and not nan | COMMENT |
| LOW | examples/circle_packing/evaluator.py | 57 | # Check if circles are inside the unit square | COMMENT |
| LOW | examples/circle_packing/evaluator.py | 164 | # Check if an error was returned | STRING |
| LOW | …mples/mlx_metal_kernel_opt/test_optimized_attention.py | 259 | # Check if we got meaningful results | COMMENT |
| LOW | …mples/mlx_metal_kernel_opt/test_optimized_attention.py | 329 | # Check if we have valid results | COMMENT |
| LOW | …mples/mlx_metal_kernel_opt/test_optimized_attention.py | 476 | # Check if mlx-lm is available | COMMENT |
| LOW⚡ | examples/mlx_metal_kernel_opt/evaluator.py | 363 | # Check if it inherits from nn.Module (recommended) | COMMENT |
| LOW | examples/symbolic_regression/scripts.sh | 26 | # Check if a prefix is defined (it can be an empty string if paths are like "split_name/0/") | COMMENT |
| LOW | examples/symbolic_regression/eval.py | 300 | # Check if the path is a single problem directory | COMMENT |
| LOW⚡ | examples/symbolic_regression/eval.py | 319 | # Check if this subdirectory looks like a problem directory | COMMENT |
| LOW | examples/symbolic_regression/data_api.py | 662 | # Check if all essential files already exist | STRING |
| LOW | examples/symbolic_regression/data_api.py | 682 | # Check if all files exist | STRING |
| LOW | examples/symbolic_regression/data_api.py | 762 | # Print results summary | STRING |
| LOW | examples/web_scraper_optillm/evaluator.py | 277 | # Check if we found this function | STRING |
| LOW | examples/k_module_problem/run_iterative.sh | 32 | # Check if agent repo exists | COMMENT |
| LOW | examples/k_module_problem/compare_results.py | 74 | # Check if solution found (score == 1.0 means 4/4 correct) | COMMENT |
| LOW | examples/k_module_problem/run_random_baseline.py | 160 | # Print results | COMMENT |
| LOW | examples/k_module_problem/iterative_agent.py | 254 | # Check if solution found | COMMENT |
| LOW | examples/algotune/task_adapter.py | 154 | # Check if this class inherits from Task or has the task name | COMMENT |
| LOW | examples/algotune/task_adapter.py | 871 | # Check if the required function exists | COMMENT |
| LOW | examples/algotune/task_adapter.py | 1093 | # Check if the required function exists | COMMENT |
| LOW | examples/algotune/task_adapter.py | 1412 | # Write files | STRING |
| LOW⚡ | examples/algotune/create_task.py | 45 | # Check if the task exists | COMMENT |
| LOW | examples/algotune/run_benchmark.py | 97 | # Check if it has the required files | STRING |
| LOW | examples/algotune/fft_cmplx_scipy_fftpack/evaluator.py | 317 | # Check if the required function exists | COMMENT |
| LOW | examples/algotune/fft_cmplx_scipy_fftpack/evaluator.py | 539 | # Check if the required function exists | COMMENT |
| LOW | examples/algotune/fft_convolution/evaluator.py | 317 | # Check if the required function exists | COMMENT |
| LOW | examples/algotune/fft_convolution/evaluator.py | 539 | # Check if the required function exists | COMMENT |
| LOW⚡ | …amples/algotune/affine_transform_2d/initial_program.py | 159 | # Check if reference solver also fails/produces empty-like result | COMMENT |
| LOW⚡ | …amples/algotune/affine_transform_2d/initial_program.py | 164 | if ref_output.size == 0: # Check if reference is also effectively empty | CODE |
| LOW⚡ | examples/algotune/affine_transform_2d/best_program.py | 161 | # Check if reference solver also fails/produces empty-like result | COMMENT |
| LOW⚡ | examples/algotune/affine_transform_2d/best_program.py | 166 | if ref_output.size == 0: # Check if reference is also effectively empty | CODE |
| LOW | examples/algotune/affine_transform_2d/evaluator.py | 317 | # Check if the required function exists | COMMENT |
| LOW | examples/algotune/affine_transform_2d/evaluator.py | 539 | # Check if the required function exists | COMMENT |
| LOW | examples/algotune/eigenvectors_complex/evaluator.py | 317 | # Check if the required function exists | COMMENT |
| LOW | examples/algotune/eigenvectors_complex/evaluator.py | 539 | # Check if the required function exists | COMMENT |
| LOW | examples/algotune/convolve2d_full_fill/best_program.py | 112 | # Check if the 2D convolution solution is valid and optimal. | COMMENT |
| LOW | examples/algotune/convolve2d_full_fill/evaluator.py | 317 | # Check if the required function exists | COMMENT |
| LOW | examples/algotune/convolve2d_full_fill/evaluator.py | 539 | # Check if the required function exists | COMMENT |
| LOW | examples/algotune/lu_factorization/evaluator.py | 317 | # Check if the required function exists | COMMENT |
| LOW | examples/algotune/lu_factorization/evaluator.py | 539 | # Check if the required function exists | COMMENT |
| LOW | …amples/algotune/psd_cone_projection/initial_program.py | 137 | # Check if solution contains required keys | COMMENT |
| LOW | examples/algotune/psd_cone_projection/best_program.py | 134 | # Check if solution contains required keys | COMMENT |
| LOW | examples/algotune/psd_cone_projection/evaluator.py | 317 | # Check if the required function exists | COMMENT |
| 40 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | tests/test_database.py | 147 | CODE | |
| LOW | tests/integration/test_library_api.py | 106 | CODE | |
| LOW | tests/integration/test_library_api.py | 120 | CODE | |
| LOW | examples/attention_optimization/evaluator.py | 193 | CODE | |
| LOW | examples/attention_optimization/tests/test_evaluator.py | 94 | CODE | |
| LOW | …ntion_optimization/legacy/prev_sim__works_evaluator.py | 377 | CODE | |
| LOW | …attention_optimization/scripts/debug_real_execution.py | 71 | CODE | |
| LOW | …tention_optimization/scripts/mlir_lowering_pipeline.py | 25 | CODE | |
| LOW | …tention_optimization/scripts/mlir_lowering_pipeline.py | 141 | CODE | |
| LOW | examples/lm_eval/lm-eval.py | 51 | CODE | |
| LOW | examples/tsp_tour_minimization/utils/tsp_runner.py | 37 | CODE | |
| LOW | examples/tsp_tour_minimization/utils/heat_map_runner.py | 30 | CODE | |
| LOW | examples/tsp_tour_minimization/utils/heat_map_runner.py | 109 | CODE | |
| LOW | examples/tsp_tour_minimization/utils/heat_map_runner.py | 209 | CODE | |
| LOW | examples/tsp_tour_minimization/utils/heat_map_runner.py | 231 | CODE | |
| LOW | examples/tsp_tour_minimization/utils/utils.py | 138 | CODE | |
| LOW | examples/function_minimization/evaluator.py | 45 | CODE | |
| LOW | examples/function_minimization/evaluator.py | 259 | CODE | |
| LOW | examples/circle_packing/evaluator.py | 76 | CODE | |
| LOW | …mples/mlx_metal_kernel_opt/test_optimized_attention.py | 138 | CODE | |
| LOW | …mples/mlx_metal_kernel_opt/test_optimized_attention.py | 297 | CODE | |
| LOW | examples/mlx_metal_kernel_opt/run_benchmarks.py | 332 | CODE | |
| LOW | examples/mlx_metal_kernel_opt/run_benchmarks.py | 415 | CODE | |
| LOW | examples/mlx_metal_kernel_opt/evaluator.py | 231 | CODE | |
| LOW | examples/mlx_metal_kernel_opt/evaluator.py | 426 | CODE | |
| LOW | examples/mlx_metal_kernel_opt/evaluator.py | 467 | CODE | |
| LOW | examples/mlx_metal_kernel_opt/evaluator.py | 544 | CODE | |
| LOW | examples/mlx_metal_kernel_opt/evaluator.py | 780 | CODE | |
| LOW | examples/mlx_metal_kernel_opt/evaluator.py | 1279 | CODE | |
| LOW | examples/mlx_metal_kernel_opt/qwen3_benchmark_suite.py | 558 | CODE | |
| LOW | examples/mlx_metal_kernel_opt/qwen3_benchmark_suite.py | 745 | CODE | |
| LOW | examples/r_robust_regression/evaluator.py | 19 | CODE | |
| LOW | examples/rust_adaptive_sort/evaluator.py | 31 | CODE | |
| LOW | examples/symbolic_regression/eval.py | 147 | CODE | |
| LOW | examples/symbolic_regression/data_api.py | 701 | CODE | |
| LOW | examples/symbolic_regression/bench/datamodules.py | 169 | CODE | |
| LOW | examples/web_scraper_optillm/initial_program.py | 78 | CODE | |
| LOW | examples/web_scraper_optillm/evaluator.py | 18 | CODE | |
| LOW | examples/web_scraper_optillm/evaluator.py | 260 | CODE | |
| LOW | examples/web_scraper_optillm/evaluator.py | 301 | CODE | |
| LOW | examples/k_module_problem/compare_results.py | 81 | CODE | |
| LOW | examples/k_module_problem/run_openevolve_trials.py | 15 | CODE | |
| LOW | examples/online_judge_programming/submit.py | 184 | CODE | |
| LOW | examples/online_judge_programming/submit.py | 221 | CODE | |
| LOW | examples/online_judge_programming/submit.py | 380 | CODE | |
| LOW | examples/algotune/task_adapter.py | 103 | CODE | |
| LOW | examples/algotune/fft_cmplx_scipy_fftpack/evaluator.py | 130 | CODE | |
| LOW | examples/algotune/fft_cmplx_scipy_fftpack/evaluator.py | 260 | CODE | |
| LOW | examples/algotune/fft_cmplx_scipy_fftpack/evaluator.py | 505 | CODE | |
| LOW | examples/algotune/fft_convolution/initial_program.py | 117 | CODE | |
| LOW | examples/algotune/fft_convolution/best_program.py | 84 | CODE | |
| LOW | examples/algotune/fft_convolution/best_program.py | 159 | CODE | |
| LOW | examples/algotune/fft_convolution/evaluator.py | 130 | CODE | |
| LOW | examples/algotune/fft_convolution/evaluator.py | 260 | CODE | |
| LOW | examples/algotune/fft_convolution/evaluator.py | 505 | CODE | |
| LOW | …amples/algotune/affine_transform_2d/initial_program.py | 111 | CODE | |
| LOW | examples/algotune/affine_transform_2d/best_program.py | 113 | CODE | |
| LOW | examples/algotune/affine_transform_2d/evaluator.py | 130 | CODE | |
| LOW | examples/algotune/affine_transform_2d/evaluator.py | 260 | CODE | |
| LOW | examples/algotune/affine_transform_2d/evaluator.py | 505 | CODE | |
| 72 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | …tention_optimization/scripts/mlir_lowering_pipeline.py | 67 | # More comprehensive lowering | COMMENT |
| MEDIUM | examples/circle_packing/config_phase_2.yaml | 57 | allow_full_rewrites: true # Definitely allow full rewrites | CODE |
| MEDIUM | examples/circle_packing/config_phase_2_anthropic.yaml | 59 | allow_full_rewrites: true # Definitely allow full rewrites | CODE |
| MEDIUM | examples/mlx_metal_kernel_opt/config.yaml | 112 | // OPTIMIZE: Better utilize Apple GPU memory hierarchy | COMMENT |
| MEDIUM⚡ | examples/mlx_metal_kernel_opt/evaluator.py | 193 | # Step 8: Generate comprehensive result with full error statistics | COMMENT |
| MEDIUM⚡ | examples/mlx_metal_kernel_opt/evaluator.py | 432 | # Execute with comprehensive error catching | COMMENT |
| MEDIUM | examples/mlx_metal_kernel_opt/evaluator.py | 44 | # Import the comprehensive benchmark suite for consistent testing | COMMENT |
| MEDIUM | examples/mlx_metal_kernel_opt/evaluator.py | 95 | # Use comprehensive benchmark suite | COMMENT |
| MEDIUM | examples/mlx_metal_kernel_opt/evaluator.py | 1141 | # Use robust statistics | COMMENT |
| MEDIUM | examples/mlx_metal_kernel_opt/evaluator.py | 232 | """Bulletproof extraction with comprehensive Metal kernel validation""" | STRING |
| MEDIUM | examples/mlx_metal_kernel_opt/evaluator.py | 1282 | """Generate comprehensive evaluation summary with safety info""" | STRING |
| MEDIUM | examples/mlx_metal_kernel_opt/evaluator.py | 1322 | """Get comprehensive error statistics""" | STRING |
| MEDIUM | examples/mlx_metal_kernel_opt/evaluator.py | 1351 | """Print comprehensive bulletproof evaluation results""" | STRING |
| MEDIUM | examples/mlx_metal_kernel_opt/evaluator.py | 1407 | """Create comprehensive failure result with full error statistics""" | STRING |
| MEDIUM | examples/mlx_metal_kernel_opt/qwen3_benchmark_suite.py | 69 | """Create comprehensive benchmark configurations""" | STRING |
| MEDIUM | examples/mlx_metal_kernel_opt/qwen3_benchmark_suite.py | 178 | prompt="""Create comprehensive documentation for a REST API with the following endpoints: | CODE |
| MEDIUM | examples/mlx_metal_kernel_opt/qwen3_benchmark_suite.py | 705 | # Use median for more robust results (less sensitive to outliers) | COMMENT |
| MEDIUM | examples/r_robust_regression/initial_program.r | 7 | # This can be evolved to use more robust methods like: | COMMENT |
| MEDIUM | examples/r_robust_regression/initial_program.r | 76 | # Perform robust regression | COMMENT |
| MEDIUM | examples/r_robust_regression/config.yaml | 41 | # Feature dimensions for robust regression | COMMENT |
| MEDIUM | examples/r_robust_regression/evaluator.py | 112 | # For cases with outliers, prioritize robust metrics | STRING |
| MEDIUM | examples/symbolic_regression/eval.py | 408 | # A more nuanced approach might replace inf with a very large/small number or handle per metric. | COMMENT |
| MEDIUM | examples/sldbench/evaluator.py | 267 | # 3. Combine results into a comprehensive output | COMMENT |
| MEDIUM | examples/llm_prompt_optimization/evaluator.py | 550 | # Fixed to 40 samples for Stage 2 (comprehensive evaluation) | COMMENT |
| MEDIUM | …ples/circle_packing_with_artifacts/config_phase_2.yaml | 57 | allow_full_rewrites: true # Definitely allow full rewrites | CODE |
| MEDIUM | configs/default_config.yaml | 83 | comprehensive_implementation_min_lines: 50 # Label as "comprehensive" if program has this many lines or more | CODE |
| MEDIUM | openevolve/config.py | 296 | 50 # Label as "comprehensive" if program has this many lines or more | CODE |
| LOW | openevolve/database.py | 1168 | # If archive is now not full after cleanup, just add the new program | COMMENT |
| LOW | openevolve/database.py | 1185 | # No valid programs in archive, just add the new one | COMMENT |
| LOW | openevolve/evaluator.py | 253 | # Handle timeout specially - don't retry, just return timeout result | COMMENT |
| MEDIUM | openevolve/prompt/sampler.py | 227 | elif abs(current_fitness - prev_fitness) < 1e-6: # Essentially unchanged | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | examples/symbolic_regression/README.md | 156 | # -------------------------------------------------------------------------- | COMMENT |
| MEDIUM | examples/background_blur/test_gaming.py | 43 | # -------------------------------------------------------------------------- | COMMENT |
| MEDIUM | examples/background_blur/test_gaming.py | 45 | # -------------------------------------------------------------------------- | COMMENT |
| MEDIUM | examples/background_blur/test_gaming.py | 105 | # -------------------------------------------------------------------------- | STRING |
| MEDIUM | examples/background_blur/test_gaming.py | 108 | # -------------------------------------------------------------------------- | STRING |
| MEDIUM | examples/background_blur/evaluator.py | 56 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | examples/background_blur/evaluator.py | 58 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | examples/background_blur/evaluator.py | 178 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | examples/background_blur/evaluator.py | 180 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | examples/background_blur/evaluator.py | 216 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | examples/background_blur/evaluator.py | 218 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | examples/background_blur/evaluator.py | 275 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | examples/background_blur/evaluator.py | 277 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | examples/background_blur/evaluator.py | 335 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | examples/background_blur/evaluator.py | 337 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | examples/background_blur/fixtures.py | 21 | # -------------------------------------------------------------------------- | COMMENT |
| MEDIUM | examples/background_blur/fixtures.py | 23 | # -------------------------------------------------------------------------- | COMMENT |
| MEDIUM | examples/background_blur/fixtures.py | 98 | # -------------------------------------------------------------------------- | COMMENT |
| MEDIUM | examples/background_blur/fixtures.py | 100 | # -------------------------------------------------------------------------- | COMMENT |
| MEDIUM | examples/background_blur/fixtures.py | 175 | # -------------------------------------------------------------------------- | COMMENT |
| MEDIUM | examples/background_blur/fixtures.py | 177 | # -------------------------------------------------------------------------- | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | examples/tsp_tour_minimization/utils/utils.py | 139 | Compute total cycle distances for a batch of instances Args: cities: np.ndarray of shape (B, n, 2). Al | STRING |
| HIGH | …ples/mlx_metal_kernel_opt/mlx_lm_generate_with_hook.py | 44 | Load an evolved hook program and apply its attention optimization. The hook program must expose a `create_meta | STRING |
| HIGH | openevolve/config.py | 22 | Resolve ${VAR} environment variable reference in a string value. In current implementation pattern must match t | STRING |
| HIGH | openevolve/api.py | 43 | Run evolution with flexible inputs - the main library API Args: initial_program: Can be: - | STRING |
| HIGH | openevolve/evaluator.py | 334 | Directly evaluate a program using the evaluation function with timeout Args: program_path: | STRING |
| HIGH | openevolve/utils/async_utils.py | 123 | Retry an async function with exponential backoff Args: coro: Coroutine function to retry *args | STRING |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | scripts/visualizer.py | 16 | logger = logging.getLogger(__name__) | CODE |
| LOW | openevolve/controller.py | 25 | logger = logging.getLogger(__name__) | CODE |
| LOW | openevolve/controller.py | 195 | def _setup_logging(self) -> None: | CODE |
| LOW | openevolve/controller.py | 219 | def _setup_manual_mode_queue(self) -> None: | CODE |
| LOW | openevolve/config.py | 197 | def update_model_params(self, args: Dict[str, Any], overwrite: bool = False) -> None: | CODE |
| LOW | openevolve/embedding.py | 12 | logger = logging.getLogger(__name__) | CODE |
| LOW⚡ | openevolve/database.py | 2222 | def _update_feature_stats(self, feature_name: str, value: float) -> None: | CODE |
| LOW | openevolve/database.py | 24 | logger = logging.getLogger(__name__) | CODE |
| LOW | openevolve/database.py | 1141 | def _update_archive(self, program: Program) -> None: | CODE |
| LOW | openevolve/database.py | 1188 | def _update_best_program(self, program: Program) -> None: | CODE |
| LOW | openevolve/database.py | 1228 | def _update_island_best_program(self, program: Program, island_idx: int) -> None: | CODE |
| LOW | openevolve/database.py | 1811 | def set_current_island(self, island_idx: int) -> None: | CODE |
| LOW | openevolve/database.py | 2161 | def _update_diversity_reference_set(self) -> None: | CODE |
| LOW | openevolve/__init__.py | 16 | __all__ = [ | CODE |
| LOW | openevolve/process_parallel.py | 21 | logger = logging.getLogger(__name__) | CODE |
| LOW | openevolve/cli.py | 15 | logger = logging.getLogger(__name__) | CODE |
| LOW | openevolve/evaluator.py | 29 | logger = logging.getLogger(__name__) | CODE |
| LOW | openevolve/evolution_trace.py | 21 | logger = logging.getLogger(__name__) | CODE |
| LOW | openevolve/llm/__init__.py | 10 | __all__ = [ | CODE |
| LOW | openevolve/llm/openai.py | 21 | logger = logging.getLogger(__name__) | CODE |
| LOW | openevolve/llm/ensemble.py | 14 | logger = logging.getLogger(__name__) | CODE |
| LOW | openevolve/llm/claude_code.py | 30 | logger = logging.getLogger(__name__) | CODE |
| LOW | openevolve/utils/async_utils.py | 11 | logger = logging.getLogger(__name__) | CODE |
| LOW | openevolve/utils/__init__.py | 29 | __all__ = [ | CODE |
| LOW | openevolve/utils/trace_export_utils.py | 11 | logger = logging.getLogger(__name__) | CODE |
| LOW | openevolve/prompt/__init__.py | 8 | __all__ = ["PromptSampler", "TemplateManager"] | CODE |
| LOW | openevolve/prompt/templates.py | 11 | logger = logging.getLogger(__name__) | CODE |
| LOW | openevolve/prompt/sampler.py | 18 | logger = logging.getLogger(__name__) | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | examples/web_scraper_optillm/README.md | 272 | # Use chain-of-thought + readurls for primary model | COMMENT |
| MEDIUM⚡ | examples/k_module_problem/run_iterative.sh | 7 | # 1. Clone the agentic-code-optimization repo: | COMMENT |
| MEDIUM⚡ | examples/k_module_problem/run_iterative.sh | 8 | # git clone https://github.com/ratulm/agentic-code-optimization.git | COMMENT |
| MEDIUM⚡ | examples/k_module_problem/run_iterative.sh | 8 | # git clone https://github.com/ratulm/agentic-code-optimization.git | COMMENT |
| MEDIUM | examples/k_module_problem/run_iterative.sh | 37 | echo " git clone https://github.com/ratulm/agentic-code-optimization.git $AGENT_REPO" | CODE |
| MEDIUM | examples/llm_prompt_optimization/evaluator.py | 85 | # Check for few-shot examples (high sophistication) | COMMENT |
| MEDIUM | examples/llm_prompt_optimization/evaluator.py | 112 | sophistication_score += 0.2 # Extensive few-shot | CODE |
| MEDIUM | examples/llm_prompt_optimization/evaluator.py | 114 | sophistication_score += 0.1 # Basic few-shot | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | examples/algotune/task_adapter.py | 546 | # Example usage | COMMENT |
| LOW | …es/algotune/fft_cmplx_scipy_fftpack/initial_program.py | 132 | # Example usage | COMMENT |
| LOW | …mples/algotune/fft_cmplx_scipy_fftpack/best_program.py | 132 | # Example usage | COMMENT |
| LOW | examples/algotune/fft_convolution/initial_program.py | 245 | # Example usage | COMMENT |
| LOW | examples/algotune/fft_convolution/best_program.py | 287 | # Example usage | COMMENT |
| LOW | …amples/algotune/affine_transform_2d/initial_program.py | 245 | # Example usage | COMMENT |
| LOW | examples/algotune/affine_transform_2d/best_program.py | 247 | # Example usage | COMMENT |
| LOW | …mples/algotune/eigenvectors_complex/initial_program.py | 201 | # Example usage | COMMENT |
| LOW | examples/algotune/eigenvectors_complex/best_program.py | 200 | # Example usage | COMMENT |
| LOW | …mples/algotune/convolve2d_full_fill/initial_program.py | 148 | # Example usage | COMMENT |
| LOW | examples/algotune/convolve2d_full_fill/best_program.py | 147 | # Example usage | COMMENT |
| LOW | examples/algotune/lu_factorization/initial_program.py | 227 | # Example usage | COMMENT |
| LOW | examples/algotune/lu_factorization/best_program.py | 202 | # Example usage | COMMENT |
| LOW | …amples/algotune/psd_cone_projection/initial_program.py | 199 | # Example usage | COMMENT |
| LOW | examples/algotune/psd_cone_projection/best_program.py | 196 | # Example usage | COMMENT |
| LOW | examples/algotune/polynomial_real/initial_program.py | 153 | # Example usage | COMMENT |
| LOW | examples/algotune/polynomial_real/best_program.py | 173 | # Example usage | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW⚡ | examples/mlx_metal_kernel_opt/evaluator.py | 141 | # Step 2: Pre-execution Metal kernel safety validation | COMMENT |
| LOW⚡ | examples/mlx_metal_kernel_opt/evaluator.py | 148 | # Step 3: Memory-safe correctness testing FIRST (fail fast, skip baseline if invalid) | COMMENT |
| LOW⚡ | examples/mlx_metal_kernel_opt/evaluator.py | 162 | # Step 4: GPU-protected baseline measurement (only if correctness passed) | COMMENT |
| LOW⚡ | examples/mlx_metal_kernel_opt/evaluator.py | 170 | # Step 5: Command-buffer-protected benchmarking | COMMENT |
| LOW⚡ | examples/mlx_metal_kernel_opt/evaluator.py | 182 | # Step 6: Enhanced performance analysis | COMMENT |
| LOW⚡ | examples/mlx_metal_kernel_opt/evaluator.py | 188 | # Step 7: Calculate safety-adjusted final score | COMMENT |
| LOW⚡ | examples/mlx_metal_kernel_opt/evaluator.py | 193 | # Step 8: Generate comprehensive result with full error statistics | COMMENT |
| LOW | examples/mlx_metal_kernel_opt/evaluator.py | 130 | # Step 1: Enhanced program extraction with Metal validation | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW⚡ | examples/mlx_metal_kernel_opt/evaluator.py | 141 | # Step 2: Pre-execution Metal kernel safety validation | COMMENT |
| LOW⚡ | examples/mlx_metal_kernel_opt/evaluator.py | 148 | # Step 3: Memory-safe correctness testing FIRST (fail fast, skip baseline if invalid) | COMMENT |
| LOW⚡ | examples/mlx_metal_kernel_opt/evaluator.py | 162 | # Step 4: GPU-protected baseline measurement (only if correctness passed) | COMMENT |
| LOW⚡ | examples/mlx_metal_kernel_opt/evaluator.py | 170 | # Step 5: Command-buffer-protected benchmarking | COMMENT |
| LOW⚡ | examples/mlx_metal_kernel_opt/evaluator.py | 182 | # Step 6: Enhanced performance analysis | COMMENT |
| LOW⚡ | examples/mlx_metal_kernel_opt/evaluator.py | 188 | # Step 7: Calculate safety-adjusted final score | COMMENT |
| LOW⚡ | examples/mlx_metal_kernel_opt/evaluator.py | 193 | # Step 8: Generate comprehensive result with full error statistics | COMMENT |
| LOW | examples/mlx_metal_kernel_opt/evaluator.py | 130 | # Step 1: Enhanced program extraction with Metal validation | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| CRITICAL | tests/test_reasoning_effort_config.py | 179 | llm.client.chat.completions.create.assert_called_once_with(**test_params) | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | examples/tsp_tour_minimization/config.yaml | 13 | api_key: "<your-api-key>" | CODE |
| HIGH | examples/online_judge_programming/config.yaml | 13 | api_key: YOUR_API_KEY | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | examples/mlx_metal_kernel_opt/initial_program.py | 80 | if (batch_idx >= BATCH_SIZE || head_idx >= NUM_HEADS || query_pos >= SEQ_LEN) { | CODE |
| HIGH | examples/mlx_metal_kernel_opt/best_program.py | 80 | if (batch_idx >= BATCH_SIZE || head_idx >= NUM_HEADS || query_pos >= SEQ_LEN) { | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | examples/tsp_tour_minimization/utils/tsp_runner.py | 280 | CODE | |
| LOW | examples/symbolic_regression/data_api.py | 67 | CODE | |
| LOW | openevolve/evaluator.py | 358 | CODE | |
| LOW | openevolve/evolution_trace.py | 66 | CODE | |
| LOW | openevolve/prompt/sampler.py | 51 | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | tests/test_checkpoint_resume.py | 54 | def test_function(): | CODE |
| LOW | tests/test_island_map_elites.py | 97 | identical_code = "def test_function(): return 42" | CODE |
| LOW⚡ | tests/test_api.py | 185 | code = "def my_function(): pass" | CODE |