5f7bc600a6
Slow tests are now collected in a heap with a fixed size. When the maximum size is reached we evict the fastest test after adding a new test to the heap. Bug: v8:10168 Change-Id: If3298df85d6e924451f55fe9350e293169cc849d Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/2106205 Commit-Queue: Liviu Rau <liviurau@chromium.org> Reviewed-by: Michael Achenbach <machenbach@chromium.org> Reviewed-by: Tamer Tas <tmrts@chromium.org> Cr-Commit-Position: refs/heads/master@{#67572}
40 lines
1.2 KiB
Python
40 lines
1.2 KiB
Python
#!/usr/bin/env python
|
|
# Copyright 2020 the V8 project authors. All rights reserved.
|
|
# Use of this source code is governed by a BSD-style license that can be
|
|
# found in the LICENSE file.
|
|
|
|
import heapq
|
|
import random
|
|
|
|
|
|
class FixedSizeTopList():
|
|
"""Utility collection for gathering a fixed number of elements with the
|
|
biggest value for the given key. It employs a heap from which we pop the
|
|
smallest element when the collection is 'full'.
|
|
|
|
If you need a reversed behaviour (collect min values) just provide an
|
|
inverse key."""
|
|
|
|
def __init__(self, size, key=None):
|
|
self.size = size
|
|
self.key = key or (lambda x: x)
|
|
self.data = []
|
|
self.discriminator = 0
|
|
|
|
def add(self, elem):
|
|
elem_k = self.key(elem)
|
|
heapq.heappush(self.data, (elem_k, self.extra_key(), elem))
|
|
if len(self.data) > self.size:
|
|
heapq.heappop(self.data)
|
|
|
|
def extra_key(self):
|
|
# Avoid key clash in tuples sent to the heap.
|
|
# We want to avoid comparisons on the last element of the tuple
|
|
# since those elements might not be comparable.
|
|
self.discriminator += 1
|
|
return self.discriminator
|
|
|
|
def as_list(self):
|
|
original_data = [rec for (_, _, rec) in self.data]
|
|
return sorted(original_data, key=self.key, reverse=True)
|