Skip to content

removing redundant slicing in heapq.py #139087

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Sep 18, 2025
Merged

removing redundant slicing in heapq.py #139087

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions Lib/heapq.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -494,7 +494,7 @@ def nsmallest(n, iterable, key=None):
pass
else:
if n >= size:
return sorted(iterable, key=key)[:n]
return sorted(iterable, key=key)

# When key is none, use simpler decoration
if key is None:
Expand Down Expand Up @@ -554,7 +554,7 @@ def nlargest(n, iterable, key=None):
pass
else:
if n >= size:
return sorted(iterable, key=key, reverse=True)[:n]
return sorted(iterable, key=key, reverse=True)

# When key is none, use simpler decoration
if key is None:
Expand Down
Loading