mirror of
https://github.com/python/cpython.git
synced 2025-10-14 18:59:46 +00:00
Kill reduce(). A coproduction of John Reese, Jacques Frechet, and Alex M.
This commit is contained in:
parent
6cefeb0e81
commit
89da5d7c3d
10 changed files with 25 additions and 144 deletions
|
@ -462,12 +462,10 @@ class TokenEater:
|
|||
rentries = reverse[rkey]
|
||||
rentries.sort()
|
||||
for k, v in rentries:
|
||||
isdocstring = 0
|
||||
# If the entry was gleaned out of a docstring, then add a
|
||||
# comment stating so. This is to aid translators who may wish
|
||||
# to skip translating some unimportant docstrings.
|
||||
if reduce(operator.__add__, v.values()):
|
||||
isdocstring = 1
|
||||
isdocstring = any(v.values())
|
||||
# k is the message string, v is a dictionary-set of (filename,
|
||||
# lineno) tuples. We want to sort the entries in v first by
|
||||
# file name and then by line number.
|
||||
|
|
|
@ -370,7 +370,7 @@ class Test:
|
|||
if runs == 0:
|
||||
return 0.0, 0.0, 0.0, 0.0
|
||||
min_time = min(self.times)
|
||||
total_time = reduce(operator.add, self.times, 0.0)
|
||||
total_time = sum(self.times)
|
||||
avg_time = total_time / float(runs)
|
||||
operation_avg = total_time / float(runs
|
||||
* self.rounds
|
||||
|
@ -570,7 +570,7 @@ class Benchmark:
|
|||
if runs == 0:
|
||||
return 0.0, 0.0
|
||||
min_time = min(self.roundtimes)
|
||||
total_time = reduce(operator.add, self.roundtimes, 0.0)
|
||||
total_time = sum(self.roundtimes)
|
||||
avg_time = total_time / float(runs)
|
||||
max_time = max(self.roundtimes)
|
||||
return (min_time, avg_time, max_time)
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue