Filip/playwright
1
0
Fork 0
Code Issues Pull requests Actions Packages Projects Releases Wiki Activity

improve shard algorithm by sorting test groups by number of tests

Browse source
This commit is contained in:
Mathias Leppich 2024-05-22 19:22:22 +02:00
parent 54bbba8cf4
commit ee64b15d47
1 changed files with 5 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

7
packages/playwright/src/runner/testGroups.ts
View file

@ -141,8 +141,11 @@ export function filterForShard(shard: { total: number, current: number }, testGr
const lengths = new Array(shard.total).fill(0);
const shardSet = new Array(shard.total).fill(0).map(() => new Set<TestGroup>());
for (const group of testGroups) {
// We add the group to the shard with the smallest number of tests.
// We sort the test groups by the number of tests in descending order.
const sortedTestGroups = testGroups.slice().sort((a, b) => b.tests.length - a.tests.length);
// Then we add each group to the shard with the smallest number of tests.
for (const group of sortedTestGroups) {
const index = lengths.reduce((minIndex, currentLength, currentIndex) => currentLength < lengths[minIndex] ? currentIndex : minIndex, 0);
lengths[index] += group.tests.length;
shardSet[index].add(group);