From: Éric Araujo <merwok@netwok.org>
Date: Fri, 15 Apr 2011 21:34:31 +0000 (+0200)
Subject: Minor tweaks to a few comments in heapq
X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=395ba35a9224339bdcaf20ad966ceaf084142444;p=python

Minor tweaks to a few comments in heapq
---

diff --git a/Lib/heapq.py b/Lib/heapq.py
index b74818e2ba..cc61294cc8 100644
--- a/Lib/heapq.py
+++ b/Lib/heapq.py
@@ -172,7 +172,7 @@ def heappushpop(heap, item):
     return item
 
 def heapify(x):
-    """Transform list into a heap, in-place, in O(len(heap)) time."""
+    """Transform list into a heap, in-place, in O(len(x)) time."""
     n = len(x)
     # Transform bottom-up.  The largest index there's any point to looking at
     # is the largest with a child index in-range, so must have 2*i + 1 < n,
@@ -363,7 +363,7 @@ def nsmallest(n, iterable, key=None):
             return [min(chain(head, it))]
         return [min(chain(head, it), key=key)]
 
-    # When n>=size, it's faster to use sort()
+    # When n>=size, it's faster to use sorted()
     try:
         size = len(iterable)
     except (TypeError, AttributeError):
@@ -401,7 +401,7 @@ def nlargest(n, iterable, key=None):
             return [max(chain(head, it))]
         return [max(chain(head, it), key=key)]
 
-    # When n>=size, it's faster to use sort()
+    # When n>=size, it's faster to use sorted()
     try:
         size = len(iterable)
     except (TypeError, AttributeError):