traverseda
/
cpython
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Issue 13274: Make the pure python code for heapq more closely match the C implementation for an undefined corner case.

This commit is contained in:
Raymond Hettinger 2011-10-30 14:32:54 -07:00
parent 9783b44bcf
commit e584457e24
1 changed files with 4 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Lib/heapq.py
View File

@ -185,6 +185,8 @@ def nlargest(n, iterable):
Equivalent to: sorted(iterable, reverse=True)[:n] Equivalent to: sorted(iterable, reverse=True)[:n]
""" """
if n < 0:
return []
it = iter(iterable) it = iter(iterable)
result = list(islice(it, n)) result = list(islice(it, n))
if not result: if not result:
@ -201,6 +203,8 @@ def nsmallest(n, iterable):
Equivalent to: sorted(iterable)[:n] Equivalent to: sorted(iterable)[:n]
""" """
if n < 0:
return []
if hasattr(iterable, '__len__') and n * 10 <= len(iterable): if hasattr(iterable, '__len__') and n * 10 <= len(iterable):
# For smaller values of n, the bisect method is faster than a minheap. # For smaller values of n, the bisect method is faster than a minheap.
# It is also memory efficient, consuming only n elements of space. # It is also memory efficient, consuming only n elements of space.