Merged revisions 83371,83390 via svnmerge from
svn+ssh://svn.python.org/python/branches/py3k ........ r83371 | georg.brandl | 2010-07-31 23:54:24 +0200 (Sa, 31 Jul 2010) | 1 line #8292: Fix three instances of truth tests on return values of filter() (which is always true in Python 3). ........ r83390 | georg.brandl | 2010-08-01 10:07:49 +0200 (So, 01 Aug 2010) | 1 line #8230: make Lib/test/sortperf.py run on Python 3. ........
This commit is contained in:
parent
44c58236d7
commit
caa78fee03
|
@ -240,8 +240,7 @@ class sdist(Command):
|
|||
optional = ['test/test*.py', 'setup.cfg']
|
||||
for pattern in optional:
|
||||
files = filter(os.path.isfile, glob(pattern))
|
||||
if files:
|
||||
self.filelist.extend(files)
|
||||
self.filelist.extend(files)
|
||||
|
||||
# build_py is used to get:
|
||||
# - python modules
|
||||
|
|
|
@ -1015,8 +1015,9 @@ class CGIHTTPRequestHandler(SimpleHTTPRequestHandler):
|
|||
if ua:
|
||||
env['HTTP_USER_AGENT'] = ua
|
||||
co = filter(None, self.headers.get_all('cookie', []))
|
||||
if co:
|
||||
env['HTTP_COOKIE'] = ', '.join(co)
|
||||
cookie_str = ', '.join(co)
|
||||
if cookie_str:
|
||||
env['HTTP_COOKIE'] = cookie_str
|
||||
# XXX Other HTTP_* headers
|
||||
# Since we're setting the env in the parent, provide empty
|
||||
# values to override previously set values
|
||||
|
|
|
@ -1109,7 +1109,7 @@ def uname():
|
|||
except AttributeError:
|
||||
no_os_uname = 1
|
||||
|
||||
if no_os_uname or not filter(None, (system, node, release, version, machine)):
|
||||
if no_os_uname or not list(filter(None, (system, node, release, version, machine))):
|
||||
# Hmm, no there is either no uname or uname has returned
|
||||
#'unknowns'... we'll have to poke around the system then.
|
||||
if no_os_uname:
|
||||
|
|
|
@ -118,12 +118,12 @@ def tabulate(r):
|
|||
L = L * (n // 4)
|
||||
# Force the elements to be distinct objects, else timings can be
|
||||
# artificially low.
|
||||
L = map(lambda x: --x, L)
|
||||
L = list(map(lambda x: --x, L))
|
||||
doit(L) # ~sort
|
||||
del L
|
||||
|
||||
# All equal. Again, force the elements to be distinct objects.
|
||||
L = map(abs, [-0.5] * n)
|
||||
L = list(map(abs, [-0.5] * n))
|
||||
doit(L) # =sort
|
||||
del L
|
||||
|
||||
|
@ -131,11 +131,11 @@ def tabulate(r):
|
|||
# for an older implementation of quicksort, which used the median
|
||||
# of the first, last and middle elements as the pivot.
|
||||
half = n // 2
|
||||
L = range(half - 1, -1, -1)
|
||||
L = list(range(half - 1, -1, -1))
|
||||
L.extend(range(half))
|
||||
# Force to float, so that the timings are comparable. This is
|
||||
# significantly faster if we leave tham as ints.
|
||||
L = map(float, L)
|
||||
L = list(map(float, L))
|
||||
doit(L) # !sort
|
||||
print()
|
||||
|
||||
|
|
Loading…
Reference in New Issue