summaryrefslogtreecommitdiffstats
path: root/Lib/heapq.py
Commit message (Expand)AuthorAgeFilesLines
...
* Merged revisions 53005-53303 via svnmerge fromThomas Wouters2007-01-091-6/+2
* Add key= argument to heapq.nsmallest() and heapq.nlargest().Raymond Hettinger2004-12-021-1/+29
* Fix argument order in pure python version of nsmallest() and nlargest().Raymond Hettinger2004-11-291-2/+2
* Fix erroneous docstring comment.Raymond Hettinger2004-09-061-2/+3
* Improve the documented advice on how to best use heapq.heapreplace().Raymond Hettinger2004-06-201-1/+3
* Install C version of heapq.nsmallest().Raymond Hettinger2004-06-131-1/+1
* Improve the memory performance and speed of heapq.nsmallest() by usingRaymond Hettinger2004-06-121-0/+23
* SF patch #969791: Add nlargest() and nsmallest() to heapq.Raymond Hettinger2004-06-101-2/+34
* * Restore the pure python version of heapq.py.Raymond Hettinger2004-04-191-0/+261
* Convert heapq.py to a C implementation.Raymond Hettinger2003-11-081-255/+0
* Implement and apply PEP 322, reverse iterationRaymond Hettinger2003-11-061-1/+1
* Fix a bunch of typos in documentation, docstrings and comments.Walter Dörwald2003-10-201-1/+1
* Fix typo in comment.Fred Drake2002-11-131-2/+2
* Added __all__.Raymond Hettinger2002-10-301-0/+2
* Fixed misspelling in comment.Tim Peters2002-08-111-1/+1
* Whitespace normalization.Tim Peters2002-08-081-1/+1
* Simplify heapreplace() -- there's no need for an explicit test forGuido van Rossum2002-08-071-7/+4
* _siftup(): __le__ is now the only comparison operator used on arrayTim Peters2002-08-031-1/+1
* Added new heapreplace(heap, item) function, to pop (and return) theTim Peters2002-08-031-0/+18
* Large code rearrangement to use better algorithms, in the sense of needingTim Peters2002-08-031-39/+79
* Minor fiddling, including a simple class to implement a heap iteratorTim Peters2002-08-031-5/+5
* Augment credits.Guido van Rossum2002-08-021-1/+1
* Hmm! I thought I checked this in before! Oh well.Tim Peters2002-08-021-9/+29
* Add a PEP-263-style encoding turd^H^H^H^Hdeclaration, because there'sGuido van Rossum2002-08-021-0/+2
* heappop(): Added comments; simplified and sped the code.Tim Peters2002-08-021-21/+19
* heappop(): Use "while True" instead of "while 1".Tim Peters2002-08-021-1/+1
* Don't use true division where int division was intended. For that matter,Tim Peters2002-08-021-1/+1
* Add Kevin O'Connor, author of the heapq code.Guido van Rossum2002-08-021-0/+2
* Adding the heap queue algorithm, per discussion in python-dev lastGuido van Rossum2002-08-021-0/+176