- 83aa6a3 Simplify the nlargest() code using heappushpop(). by Raymond Hettinger · 17 years ago
- 53bdf09 Issue 2274: Add heapq.heappushpop(). by Raymond Hettinger · 17 years ago
- 3035d23 Docstring nit. by Raymond Hettinger · 18 years ago
- cbac8ce Fixup docstrings for merge(). by Raymond Hettinger · 18 years ago
- 45eb0f1 Use C heapreplace() instead of slower _siftup() in pure python. by Raymond Hettinger · 18 years ago
- 54da981 Add tie-breaker count to preserve sort stability. by Raymond Hettinger · 18 years ago
- 00166c5 Add merge() function to heapq. by Raymond Hettinger · 18 years ago
- 769a40a Fix stability of heapq's nlargest() and nsmallest(). by Raymond Hettinger · 18 years ago
- 4901a1f Add key= argument to heapq.nsmallest() and heapq.nlargest(). by Raymond Hettinger · 20 years ago
- e1defa4 Fix argument order in pure python version of nsmallest() and nlargest(). by Raymond Hettinger · 20 years ago
- 8158e84 Fix erroneous docstring comment. by Raymond Hettinger · 20 years ago
- 28224f8 Improve the documented advice on how to best use heapq.heapreplace(). by Raymond Hettinger · 20 years ago
- 2e3dfaf Install C version of heapq.nsmallest(). by Raymond Hettinger · 20 years ago
- b25aa36 Improve the memory performance and speed of heapq.nsmallest() by using by Raymond Hettinger · 20 years ago
- 33ecffb SF patch #969791: Add nlargest() and nsmallest() to heapq. by Raymond Hettinger · 20 years ago
- c46cb2a * Restore the pure python version of heapq.py. by Raymond Hettinger · 20 years ago
- b3af181 Convert heapq.py to a C implementation. by Raymond Hettinger · 21 years ago
- 85c20a4 Implement and apply PEP 322, reverse iteration by Raymond Hettinger · 21 years ago
- f0dfc7a Fix a bunch of typos in documentation, docstrings and comments. by Walter Dörwald · 21 years ago
- f2928eb Fix typo in comment. by Fred Drake · 22 years ago
- a853cc6 Added __all__. by Raymond Hettinger · 22 years ago
- 5f7617b Fixed misspelling in comment. by Tim Peters · 22 years ago
- 469cdad Whitespace normalization. by Tim Peters · 22 years ago
- 3c8dd0c Simplify heapreplace() -- there's no need for an explicit test for by Guido van Rossum · 22 years ago
- 6681de2 _siftup(): __le__ is now the only comparison operator used on array elements. by Tim Peters · 22 years ago
- 0cd53a6 Added new heapreplace(heap, item) function, to pop (and return) the by Tim Peters · 22 years ago
- 657fe38 Large code rearrangement to use better algorithms, in the sense of needing by Tim Peters · 22 years ago
- aa7d243 Minor fiddling, including a simple class to implement a heap iterator by Tim Peters · 22 years ago
- fbb2992 Augment credits. by Guido van Rossum · 22 years ago
- 28c2552 Hmm! I thought I checked this in before! Oh well. by Tim Peters · 22 years ago
- 4b48d6b Add a PEP-263-style encoding turd^H^H^H^Hdeclaration, because there's by Guido van Rossum · 22 years ago
- 62abc2f heappop(): Added comments; simplified and sped the code. by Tim Peters · 22 years ago
- a0b3a00 heappop(): Use "while True" instead of "while 1". by Tim Peters · 22 years ago
- d9ea39d Don't use true division where int division was intended. For that matter, by Tim Peters · 22 years ago
- 37c3b27 Add Kevin O'Connor, author of the heapq code. by Guido van Rossum · 22 years ago
- 0a82438 Adding the heap queue algorithm, per discussion in python-dev last week. by Guido van Rossum · 22 years ago