summaryrefslogtreecommitdiffstats
path: root/Lib/heapq.py
Commit message (Collapse)AuthorAgeFilesLines
* Make life easier for non-CPython implementations.Raymond Hettinger2009-03-291-1/+1
|
* Speedup and simplify negative counter using count's new step argument.Raymond Hettinger2009-02-211-3/+3
|
* I believe the intention here was to avoid a global lookupBenjamin Peterson2009-01-311-1/+1
|
* fix encoding cookie caseBenjamin Peterson2009-01-181-1/+1
|
* Optimize heapq.nsmallest/nlargest for cases where n==1 or n>=size.Raymond Hettinger2009-01-121-1/+46
|
* Manually merge r68095,68186,68187,68188,68190 from 2.6 branch.Georg Brandl2009-01-031-0/+8
|
* Implement heapq in terms of less-than (to match list.sort()).Raymond Hettinger2008-05-311-6/+7
|
* Simplify the nlargest() code using heappushpop().Raymond Hettinger2008-03-131-6/+2
|
* Issue 2274: Add heapq.heappushpop().Raymond Hettinger2008-03-131-2/+9
|
* Docstring nit.Raymond Hettinger2007-02-281-1/+1
|
* Fixup docstrings for merge().Raymond Hettinger2007-02-191-2/+2
|
* Use C heapreplace() instead of slower _siftup() in pure python.Raymond Hettinger2007-02-191-2/+2
|
* Add tie-breaker count to preserve sort stability.Raymond Hettinger2007-02-191-6/+6
|
* Add merge() function to heapq.Raymond Hettinger2007-02-191-2/+40
|
* Fix stability of heapq's nlargest() and nsmallest().Raymond Hettinger2007-01-041-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
| | | | | an alternate algorithm when the number of selected items is small relative to the full iterable.
* 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
| | | | * Mark the C version as private and only use when available.
* 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
| | | | (From SF patch #810751)
* 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
| | | | empty heap, since heap[0] raises the appropriate IndexError already.
* _siftup(): __le__ is now the only comparison operator used on arrayTim Peters2002-08-031-1/+1
| | | | elements.
* Added new heapreplace(heap, item) function, to pop (and return) theTim Peters2002-08-031-0/+18
| | | | | currently-smallest value, and add item, in one gulp. See the second N-Best algorithm in the test suite for a natural use.
* Large code rearrangement to use better algorithms, in the sense of needingTim Peters2002-08-031-39/+79
| | | | | | | | | | | | substantially fewer array-element compares. This is best practice as of Kntuh Volume 3 Ed 2, and the code is actually simpler this way (although the key idea may be counter-intuitive at first glance! breaking out of a loop early loses when it costs more to try to get out early than getting out early saves). Also added a comment block explaining the difference and giving some real counts; demonstrating that heapify() is more efficient than repeated heappush(); and emphasizing the obvious point thatlist.sort() is more efficient if what you really want to do is sort.
* Minor fiddling, including a simple class to implement a heap iteratorTim Peters2002-08-031-5/+5
| | | | | in the test file. I have docs for heapq.heapify ready to check in, but Jack appears to have left behind a stale lock in the Doc/lib directory.
* 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
| | | | | | | | | | | | Added new heapify() function, which transforms an arbitrary list into a heap in linear time; that's a fundamental tool for using heaps in real life <wink>. Added heapyify() test. Added a "less naive" N-best algorithm to the test suite, and noted that this could actually go much faster (building on heapify()) if we had max-heaps instead of min-heaps (the iterative method is appropriate when all the data isn't known in advance, but when it is known in advance the tradeoffs get murkier).
* Add a PEP-263-style encoding turd^H^H^H^Hdeclaration, because there'sGuido van Rossum2002-08-021-0/+2
| | | | a c-cedilla in one of the docstrings.
* 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
| | | | don't use division at all.
* 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
week.
generated by cgit v0.12 at 2024-10-23 16:26:38 (GMT)