~amirouche/mutation

aaeea1c60794a4b15c6f7da3904c1685b97f48ea — Amirouche 7 months ago a55a849
sort files by size before computing mutations...

... it is better, because big files will take a lot of time to
complete, whereas small file will do fast, that way we can maximaze
the time where the pool is busy.
1 files changed, 2 insertions(+), 1 deletions(-)

M mutation.py
M mutation.py => mutation.py +2 -1
@@ 721,7 721,8 @@ async def play_create_mutations(loop, root, db, repository, max_workers, argumen
        )
        return out

    items = [make_item(blob) for blob in blobs if coverage.get(blob.path, set())]
    items = (make_item(blob) for blob in blobs if coverage.get(blob.path, set()))
    items = sorted(items, key=lambda x: len(x[1]), reverse=True)

    # prepare to create mutations
    total = 0