Fetching contributors…
Cannot retrieve contributors at this time
86 lines (73 sloc) 2.83 KB
import functools
import gc
import itertools
import sys
from timeit import default_timer as _timer
def timeit(_func=None, *, repeat=3, number=1000, file=sys.stdout):
"""Decorator: prints time from best of `repeat` trials.
Mimics `timeit.repeat()`, but avg. time is printed.
Returns function result and prints time.
You can decorate with or without parentheses, as in
Python's @dataclass class decorator.
kwargs are passed to `print()`.
>>> @timeit
... def f():
... return "-".join(str(n) for n in range(100))
>>> @timeit(number=100000)
... def g():
... return "-".join(str(n) for n in range(10))
_repeat = functools.partial(itertools.repeat, None)
def wrap(func):
def _timeit(*args, **kwargs):
# Temporarily turn off garbage collection during the timing.
# Makes independent timings more comparable.
# If it was originally enabled, switch it back on afterwards.
gcold = gc.isenabled()
# Outer loop - the number of repeats.
trials = []
for _ in _repeat(repeat):
# Inner loop - the number of calls within each repeat.
total = 0
for _ in _repeat(number):
start = _timer()
result = func(*args, **kwargs)
end = _timer()
total += end - start
# We want the *average time* from the *best* trial.
# For more on this methodology, see the docs for
# Python's `timeit` module.
# "In a typical case, the lowest value gives a lower bound
# for how fast your machine can run the given code snippet;
# higher values in the result vector are typically not
# caused by variability in Python’s speed, but by other
# processes interfering with your timing accuracy."
best = min(trials) / number
"Best of {} trials with {} function"
" calls per trial:".format(repeat, number)
"Function `{}` ran in average"
" of {:0.3f} seconds.".format(func.__name__, best),
if gcold:
# Result is returned *only once*
return result
return _timeit
# Syntax trick from Python @dataclass
if _func is None:
return wrap
return wrap(_func)