| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Correct “an” → “a” with “Unicode”, “user”, “UTF”, etc | Martin Panter | 2016-04-15 | 1 | -1/+1 |
| * | Fix unintended switch from a constant to a global in 56a3c0bc4634 | Raymond Hettinger | 2013-10-28 | 1 | -1/+1 |
| * | Issue #19018: The heapq.merge() function no longer suppresses IndexError | Raymond Hettinger | 2013-09-14 | 1 | -5/+10 |
| * | Issue #16098: Update heapq.nsmallest to use the same algorithm as nlargest. | Raymond Hettinger | 2013-03-05 | 1 | -25/+59 |
| * | Issue 13274: Make the pure python code for heapq more closely match the C im... | Raymond Hettinger | 2011-10-30 | 1 | -0/+4 |
| * | Minor tweaks to a few comments in heapq | Éric Araujo | 2011-04-15 | 1 | -3/+3 |
| * | Issue 3051: make pure python code pass the same tests as the C version. | Raymond Hettinger | 2011-04-13 | 1 | -8/+12 |
| * | Make life easier for non-CPython implementations. | Raymond Hettinger | 2009-03-29 | 1 | -1/+1 |
| * | Speedup and simplify negative counter using count's new step argument. | Raymond Hettinger | 2009-02-21 | 1 | -3/+3 |
| * | I believe the intention here was to avoid a global lookup | Benjamin Peterson | 2009-01-31 | 1 | -1/+1 |
| * | fix encoding cookie case | Benjamin Peterson | 2009-01-18 | 1 | -1/+1 |
| * | Optimize heapq.nsmallest/nlargest for cases where n==1 or n>=size. | Raymond Hettinger | 2009-01-12 | 1 | -1/+46 |
| * | Manually merge r68095,68186,68187,68188,68190 from 2.6 branch. | Georg Brandl | 2009-01-03 | 1 | -0/+8 |
| * | Implement heapq in terms of less-than (to match list.sort()). | Raymond Hettinger | 2008-05-31 | 1 | -6/+7 |
| * | Simplify the nlargest() code using heappushpop(). | Raymond Hettinger | 2008-03-13 | 1 | -6/+2 |
| * | Issue 2274: Add heapq.heappushpop(). | Raymond Hettinger | 2008-03-13 | 1 | -2/+9 |
| * | Docstring nit. | Raymond Hettinger | 2007-02-28 | 1 | -1/+1 |
| * | Fixup docstrings for merge(). | Raymond Hettinger | 2007-02-19 | 1 | -2/+2 |
| * | Use C heapreplace() instead of slower _siftup() in pure python. | Raymond Hettinger | 2007-02-19 | 1 | -2/+2 |
| * | Add tie-breaker count to preserve sort stability. | Raymond Hettinger | 2007-02-19 | 1 | -6/+6 |
| * | Add merge() function to heapq. | Raymond Hettinger | 2007-02-19 | 1 | -2/+40 |
| * | Fix stability of heapq's nlargest() and nsmallest(). | Raymond Hettinger | 2007-01-04 | 1 | -6/+2 |
| * | Add key= argument to heapq.nsmallest() and heapq.nlargest(). | Raymond Hettinger | 2004-12-02 | 1 | -1/+29 |
| * | Fix argument order in pure python version of nsmallest() and nlargest(). | Raymond Hettinger | 2004-11-29 | 1 | -2/+2 |
| * | Fix erroneous docstring comment. | Raymond Hettinger | 2004-09-06 | 1 | -2/+3 |
| * | Improve the documented advice on how to best use heapq.heapreplace(). | Raymond Hettinger | 2004-06-20 | 1 | -1/+3 |
| * | Install C version of heapq.nsmallest(). | Raymond Hettinger | 2004-06-13 | 1 | -1/+1 |
| * | Improve the memory performance and speed of heapq.nsmallest() by using | Raymond Hettinger | 2004-06-12 | 1 | -0/+23 |
| * | SF patch #969791: Add nlargest() and nsmallest() to heapq. | Raymond Hettinger | 2004-06-10 | 1 | -2/+34 |
| * | * Restore the pure python version of heapq.py. | Raymond Hettinger | 2004-04-19 | 1 | -0/+261 |
| * | Convert heapq.py to a C implementation. | Raymond Hettinger | 2003-11-08 | 1 | -255/+0 |
| * | Implement and apply PEP 322, reverse iteration | Raymond Hettinger | 2003-11-06 | 1 | -1/+1 |
| * | Fix a bunch of typos in documentation, docstrings and comments. | Walter Dörwald | 2003-10-20 | 1 | -1/+1 |
| * | Fix typo in comment. | Fred Drake | 2002-11-13 | 1 | -2/+2 |
| * | Added __all__. | Raymond Hettinger | 2002-10-30 | 1 | -0/+2 |
| * | Fixed misspelling in comment. | Tim Peters | 2002-08-11 | 1 | -1/+1 |
| * | Whitespace normalization. | Tim Peters | 2002-08-08 | 1 | -1/+1 |
| * | Simplify heapreplace() -- there's no need for an explicit test for | Guido van Rossum | 2002-08-07 | 1 | -7/+4 |
| * | _siftup(): __le__ is now the only comparison operator used on array | Tim Peters | 2002-08-03 | 1 | -1/+1 |
| * | Added new heapreplace(heap, item) function, to pop (and return) the | Tim Peters | 2002-08-03 | 1 | -0/+18 |
| * | Large code rearrangement to use better algorithms, in the sense of needing | Tim Peters | 2002-08-03 | 1 | -39/+79 |
| * | Minor fiddling, including a simple class to implement a heap iterator | Tim Peters | 2002-08-03 | 1 | -5/+5 |
| * | Augment credits. | Guido van Rossum | 2002-08-02 | 1 | -1/+1 |
| * | Hmm! I thought I checked this in before! Oh well. | Tim Peters | 2002-08-02 | 1 | -9/+29 |
| * | Add a PEP-263-style encoding turd^H^H^H^Hdeclaration, because there's | Guido van Rossum | 2002-08-02 | 1 | -0/+2 |
| * | heappop(): Added comments; simplified and sped the code. | Tim Peters | 2002-08-02 | 1 | -21/+19 |
| * | heappop(): Use "while True" instead of "while 1". | Tim Peters | 2002-08-02 | 1 | -1/+1 |
| * | Don't use true division where int division was intended. For that matter, | Tim Peters | 2002-08-02 | 1 | -1/+1 |
| * | Add Kevin O'Connor, author of the heapq code. | Guido van Rossum | 2002-08-02 | 1 | -0/+2 |
| * | Adding the heap queue algorithm, per discussion in python-dev last | Guido van Rossum | 2002-08-02 | 1 | -0/+176 |
