def timeit_alias(args, stdin=None):
"""Runs timing study on arguments."""
# some real args
number = 0
quiet = False
repeat = 3
precision = 3
# setup
ctx = builtins.__xonsh__.ctx
timer = Timer(timer=clock)
stmt = " ".join(args)
innerstr = INNER_TEMPLATE.format(stmt=stmt)
# Track compilation time so it can be reported if too long
# Minimum time above which compilation time will be reported
tc_min = 0.1
t0 = clock()
innercode = builtins.compilex(innerstr,
filename="<xonsh-timeit>",
mode="exec",
glbs=ctx)
tc = clock() - t0
# get inner func
ns = {}
builtins.execx(innercode, glbs=ctx, locs=ns, mode="exec")
timer.inner = ns["inner"]
# Check if there is a huge difference between the best and worst timings.
worst_tuning = 0
if number == 0:
# determine number so that 0.2 <= total time < 2.0
number = 1
for _ in range(1, 10):
time_number = timer.timeit(number)
worst_tuning = max(worst_tuning, time_number / number)
if time_number >= 0.2:
break
number *= 10
all_runs = timer.repeat(repeat, number)
best = min(all_runs) / number
# print some debug info
if not quiet:
worst = max(all_runs) / number
if worst_tuning:
worst = max(worst, worst_tuning)
# Check best timing is greater than zero to avoid a
# ZeroDivisionError.
# In cases where the slowest timing is less than 10 microseconds
# we assume that it does not really matter if the fastest
# timing is 4 times faster than the slowest timing or not.
if worst > 4 * best and best > 0 and worst > 1e-5:
print(("The slowest run took {0:0.2f} times longer than the "
"fastest. This could mean that an intermediate result "
"is being cached.").format(worst / best))
print("{0} loops, best of {1}: {2} per loop".format(
number, repeat, format_time(best, precision)))
if tc > tc_min:
print("Compiler time: {0:.2f} s".format(tc))
return
def timeit_alias(args, stdin=None):
"""Runs timing study on arguments."""
# some real args
number = 0
quiet = False
repeat = 3
precision = 3
# setup
ctx = builtins.__xonsh_ctx__
timer = Timer(timer=clock)
stmt = " ".join(args)
innerstr = INNER_TEMPLATE.format(stmt=stmt)
# Track compilation time so it can be reported if too long
# Minimum time above which compilation time will be reported
tc_min = 0.1
t0 = clock()
innercode = builtins.compilex(innerstr, filename="<xonsh-timeit>", mode="exec", glbs=ctx)
tc = clock() - t0
# get inner func
ns = {}
builtins.execx(innercode, glbs=ctx, locs=ns, mode="exec")
timer.inner = ns["inner"]
# Check if there is a huge difference between the best and worst timings.
worst_tuning = 0
if number == 0:
# determine number so that 0.2 <= total time < 2.0
number = 1
for _ in range(1, 10):
time_number = timer.timeit(number)
worst_tuning = max(worst_tuning, time_number / number)
if time_number >= 0.2:
break
number *= 10
all_runs = timer.repeat(repeat, number)
best = min(all_runs) / number
# print some debug info
if not quiet:
worst = max(all_runs) / number
if worst_tuning:
worst = max(worst, worst_tuning)
# Check best timing is greater than zero to avoid a
# ZeroDivisionError.
# In cases where the slowest timing is lesser than 10 micoseconds
# we assume that it does not really matter if the fastest
# timing is 4 times faster than the slowest timing or not.
if worst > 4 * best and best > 0 and worst > 1e-5:
print(
(
"The slowest run took {0:0.2f} times longer than the "
"fastest. This could mean that an intermediate result "
"is being cached."
).format(worst / best)
)
print("{0} loops, best of {1}: {2} per loop".format(number, repeat, format_time(best, precision)))
if tc > tc_min:
print("Compiler time: {0:.2f} s".format(tc))
return