dearwolf/aider
1
0
Fork 0
mirror of https://github.com/Aider-AI/aider.git synced 2025-05-28 08:14:59 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 4

refactor: Subsort exercises by name when solve rates are equal

Browse source
This commit is contained in:
Paul Gauthier (aider) 2024-12-18 12:55:43 -08:00
parent e5a693ab94
commit e35909ac7d
1 changed files with 2 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

4
benchmark/problem_stats.py
View file

@ -137,8 +137,8 @@ def analyze_exercise_solutions(dirs=None, topn=None):
testcase = testcase[len(lang) + 1 :]
exercise_stats.append((lang, testcase, num_solved, percent))
# Sort all exercises by solve rate
exercise_stats.sort(key=lambda x: x[2], reverse=True)
# Sort all exercises by solve rate, then by exercise name
exercise_stats.sort(key=lambda x: (-x[2], x[1])) # -x[2] for descending solve rate, x[1] for ascending exercise name
# Calculate max lengths for alignment after cleaning up paths
max_name_len = max(len(f"{lang}/{testcase}") for lang, testcase, _, _ in exercise_stats)