Spaces:
Sleeping
Sleeping
Update app.py
Browse files
app.py
CHANGED
|
@@ -179,9 +179,6 @@ def evaluate(
|
|
| 179 |
eval_results[result["task_id"]].append(result)
|
| 180 |
del future, result
|
| 181 |
gc.collect()
|
| 182 |
-
|
| 183 |
-
del problems, futures
|
| 184 |
-
gc.collect()
|
| 185 |
|
| 186 |
# sort the results for each problem by completion_id
|
| 187 |
for task_id, task_results in eval_results.items():
|
|
@@ -215,7 +212,10 @@ def evaluate(
|
|
| 215 |
for k in pass_k
|
| 216 |
if total.min() >= k
|
| 217 |
})
|
| 218 |
-
|
|
|
|
|
|
|
|
|
|
| 219 |
pass_at_k["model"] = os.path.basename(samples).split("--bigcodebench-")[0]
|
| 220 |
pass_at_k["split"] = split
|
| 221 |
pass_at_k["subset"] = subset
|
|
|
|
| 179 |
eval_results[result["task_id"]].append(result)
|
| 180 |
del future, result
|
| 181 |
gc.collect()
|
|
|
|
|
|
|
|
|
|
| 182 |
|
| 183 |
# sort the results for each problem by completion_id
|
| 184 |
for task_id, task_results in eval_results.items():
|
|
|
|
| 212 |
for k in pass_k
|
| 213 |
if total.min() >= k
|
| 214 |
})
|
| 215 |
+
|
| 216 |
+
del problems, futures
|
| 217 |
+
gc.collect()
|
| 218 |
+
|
| 219 |
pass_at_k["model"] = os.path.basename(samples).split("--bigcodebench-")[0]
|
| 220 |
pass_at_k["split"] = split
|
| 221 |
pass_at_k["subset"] = subset
|