(result_t)
| 10 | |
| 11 | |
| 12 | def task_changes(result_t): |
| 13 | n_tasks = int(result_t.max() + 1) |
| 14 | changes = [] |
| 15 | current = result_t[0] |
| 16 | for i, t in enumerate(result_t): |
| 17 | if t != current: |
| 18 | changes.append(i) |
| 19 | current = t |
| 20 | |
| 21 | return n_tasks, changes |
| 22 | |
| 23 | |
| 24 | def confusion_matrix(task_idxs, result_seqs, avg_accs, acc_on_mem, max_task=0, fname=None): |