You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -80,7 +80,7 @@ Explanation of the terms in the table:
80
80
* Absolute Order: whether each group contains all tests between first and last element in the same order as the original list of tests
81
81
* Relative Order: whether each test in each group has the same relative order to its neighbours in the group as in the original list of tests
82
82
83
-
The `duration_based_chunks` algorithm aims to find optimal boundaries for the list of tests and every test group contains all tests between the start and end bounary.
83
+
The `duration_based_chunks` algorithm aims to find optimal boundaries for the list of tests and every test group contains all tests between the start and end boundary.
84
84
The `least_duration` algorithm walks the list of tests and assigns each test to the group with the smallest current duration.
0 commit comments