| 6a8163a928f9ff04242580c09216431ddd39cdbc |
|
15-Apr-2016 |
Martin Panter <vadmium+py@gmail.com> |
Correct “an” → “a” with “Unicode”, “user”, “UTF”, etc
This affects documentation and code comments.
/external/python/cpython2/Lib/heapq.py
|
| 9a2325fac884e3e34af0476e05d6800cfba22ad8 |
|
28-Oct-2013 |
Raymond Hettinger <python@rcn.com> |
Fix unintended switch from a constant to a global in 56a3c0bc4634
/external/python/cpython2/Lib/heapq.py
|
| 39659f22fa6e86039faa92bf0bc5c82cf1650767 |
|
15-Sep-2013 |
Raymond Hettinger <python@rcn.com> |
Issue #19018: The heapq.merge() function no longer suppresses IndexError
/external/python/cpython2/Lib/heapq.py
|
| 3e6aafe20993f5b3690c870bf88eed3d8ba53492 |
|
05-Mar-2013 |
Raymond Hettinger <python@rcn.com> |
Issue #16098: Update heapq.nsmallest to use the same algorithm as nlargest.
This removes the dependency on bisect and it bring the pure Python code
in-sync with the C code.
/external/python/cpython2/Lib/heapq.py
|
| e11a47e2070c9c271da5b26a77c8ab50437e58b4 |
|
30-Oct-2011 |
Raymond Hettinger <python@rcn.com> |
Issue 13274: Make the pure python code for heapq more closely match the C implementation for an undefined corner case.
/external/python/cpython2/Lib/heapq.py
|
| 4800d6470cb8bb8646963123f656a9670a52334e |
|
15-Apr-2011 |
Éric Araujo <merwok@netwok.org> |
Minor tweaks to a few comments in heapq
/external/python/cpython2/Lib/heapq.py
|
| 9b342c6fd4455aa5ee988007a0cac09032b3219c |
|
13-Apr-2011 |
Raymond Hettinger <python@rcn.com> |
Issue 3051: make pure python code pass the same tests as the C version.
/external/python/cpython2/Lib/heapq.py
|
| b006fcc30ce0277e5fa45fbab059cc7d3154bbcc |
|
29-Mar-2009 |
Raymond Hettinger <python@rcn.com> |
Make life easier for non-CPython implementations.
/external/python/cpython2/Lib/heapq.py
|
| be9b765c073eefcc109320b651d977ff03090f2f |
|
21-Feb-2009 |
Raymond Hettinger <python@rcn.com> |
Speedup and simplify negative counter using count's new step argument.
/external/python/cpython2/Lib/heapq.py
|
| fb921e2c0034e00fcc75fa23358cab4c48f6d450 |
|
31-Jan-2009 |
Benjamin Peterson <benjamin@python.org> |
I believe the intention here was to avoid a global lookup
/external/python/cpython2/Lib/heapq.py
|
| b6e112bd952c2023b95212364ed07ad9c235da41 |
|
18-Jan-2009 |
Benjamin Peterson <benjamin@python.org> |
fix encoding cookie case
/external/python/cpython2/Lib/heapq.py
|
| b5bc33cdabc2361afa60463fedd262a6b457dfde |
|
12-Jan-2009 |
Raymond Hettinger <python@rcn.com> |
Optimize heapq.nsmallest/nlargest for cases where n==1 or n>=size.
/external/python/cpython2/Lib/heapq.py
|
| fe427895b58769840f1f61a82ea0cdfe55150347 |
|
03-Jan-2009 |
Georg Brandl <georg@python.org> |
Manually merge r68095,68186,68187,68188,68190 from 2.6 branch.
/external/python/cpython2/Lib/heapq.py
|
| 6d7702ecd11e067f72029244b3f7aa8baa3ed2fc |
|
31-May-2008 |
Raymond Hettinger <python@rcn.com> |
Implement heapq in terms of less-than (to match list.sort()).
/external/python/cpython2/Lib/heapq.py
|
| 83aa6a3b1a6a406b3cde2fa7daa5d5b1db0cc6a7 |
|
13-Mar-2008 |
Raymond Hettinger <python@rcn.com> |
Simplify the nlargest() code using heappushpop().
/external/python/cpython2/Lib/heapq.py
|
| 53bdf093437349907807da9143f9c2bdcea9ab3a |
|
13-Mar-2008 |
Raymond Hettinger <python@rcn.com> |
Issue 2274: Add heapq.heappushpop().
/external/python/cpython2/Lib/heapq.py
|
| 3035d2397f4a6d028d7b1f87563c649457d5cbb4 |
|
28-Feb-2007 |
Raymond Hettinger <python@rcn.com> |
Docstring nit.
/external/python/cpython2/Lib/heapq.py
|
| cbac8ce5b0394fe68329ac839a07474969dd7493 |
|
19-Feb-2007 |
Raymond Hettinger <python@rcn.com> |
Fixup docstrings for merge().
/external/python/cpython2/Lib/heapq.py
|
| 45eb0f141964bf59d20949fe82bea0af124d6854 |
|
19-Feb-2007 |
Raymond Hettinger <python@rcn.com> |
Use C heapreplace() instead of slower _siftup() in pure python.
/external/python/cpython2/Lib/heapq.py
|
| 54da9819cc74fe6091d090d12753116cfb6c6c62 |
|
19-Feb-2007 |
Raymond Hettinger <python@rcn.com> |
Add tie-breaker count to preserve sort stability.
/external/python/cpython2/Lib/heapq.py
|
| 00166c5532fc7562c07383a0ae2985b3ffaf253a |
|
19-Feb-2007 |
Raymond Hettinger <python@rcn.com> |
Add merge() function to heapq.
/external/python/cpython2/Lib/heapq.py
|
| 769a40a1d046baddbac4c01fa8feada2ee9e5207 |
|
04-Jan-2007 |
Raymond Hettinger <python@rcn.com> |
Fix stability of heapq's nlargest() and nsmallest().
/external/python/cpython2/Lib/heapq.py
|
| 4901a1f267e9d632f85054ce8b21ff23bff305e1 |
|
02-Dec-2004 |
Raymond Hettinger <python@rcn.com> |
Add key= argument to heapq.nsmallest() and heapq.nlargest().
/external/python/cpython2/Lib/heapq.py
|
| e1defa4175426594be53c1bc6c3d2f02a0952bae |
|
29-Nov-2004 |
Raymond Hettinger <python@rcn.com> |
Fix argument order in pure python version of nsmallest() and nlargest().
/external/python/cpython2/Lib/heapq.py
|
| 8158e849305d0e0ab3e19cdc93a86bb7d5fc0651 |
|
06-Sep-2004 |
Raymond Hettinger <python@rcn.com> |
Fix erroneous docstring comment.
/external/python/cpython2/Lib/heapq.py
|
| 28224f897a1849dd616ad82538bdda45f3351d42 |
|
20-Jun-2004 |
Raymond Hettinger <python@rcn.com> |
Improve the documented advice on how to best use heapq.heapreplace().
/external/python/cpython2/Lib/heapq.py
|
| 2e3dfaf7070900c459d5879530dbdb3680f7fb9d |
|
13-Jun-2004 |
Raymond Hettinger <python@rcn.com> |
Install C version of heapq.nsmallest().
/external/python/cpython2/Lib/heapq.py
|
| b25aa36f83a3cd2200f2bc479e594458e27794a3 |
|
12-Jun-2004 |
Raymond Hettinger <python@rcn.com> |
Improve the memory performance and speed of heapq.nsmallest() by using
an alternate algorithm when the number of selected items is small
relative to the full iterable.
/external/python/cpython2/Lib/heapq.py
|
| 33ecffb65ae43ece95e4d828f95819395187d579 |
|
10-Jun-2004 |
Raymond Hettinger <python@rcn.com> |
SF patch #969791: Add nlargest() and nsmallest() to heapq.
/external/python/cpython2/Lib/heapq.py
|
| c46cb2a1a92c26e01ddb3921aa6828bcd3576f3e |
|
19-Apr-2004 |
Raymond Hettinger <python@rcn.com> |
* Restore the pure python version of heapq.py.
* Mark the C version as private and only use when available.
/external/python/cpython2/Lib/heapq.py
|
| b3af1813eb5cf99766f55a0dfc0d566e9bd7c3c1 |
|
08-Nov-2003 |
Raymond Hettinger <python@rcn.com> |
Convert heapq.py to a C implementation.
/external/python/cpython2/Lib/heapq.py
|
| 85c20a41dfcec04d161ad7da7260e7b94c62d228 |
|
06-Nov-2003 |
Raymond Hettinger <python@rcn.com> |
Implement and apply PEP 322, reverse iteration
/external/python/cpython2/Lib/heapq.py
|
| f0dfc7ac5c2f76baaae0c3b45bc339281cfa2adc |
|
20-Oct-2003 |
Walter Dörwald <walter@livinglogic.de> |
Fix a bunch of typos in documentation, docstrings and comments.
(From SF patch #810751)
/external/python/cpython2/Lib/heapq.py
|
| f2928eb0179ade849ca3b8220bd5a4018babb1c1 |
|
13-Nov-2002 |
Fred Drake <fdrake@acm.org> |
Fix typo in comment.
/external/python/cpython2/Lib/heapq.py
|
| a853cc6647fdbe5d880e5c4f63d499dd61cee271 |
|
30-Oct-2002 |
Raymond Hettinger <python@rcn.com> |
Added __all__.
/external/python/cpython2/Lib/heapq.py
|
| 5f7617b5f634dd52e6b3995198f18dd870ef22f2 |
|
11-Aug-2002 |
Tim Peters <tim.peters@gmail.com> |
Fixed misspelling in comment.
/external/python/cpython2/Lib/heapq.py
|
| 469cdad8228df7bc294dc946b8cd4c0b7f810735 |
|
08-Aug-2002 |
Tim Peters <tim.peters@gmail.com> |
Whitespace normalization.
/external/python/cpython2/Lib/heapq.py
|
| 3c8dd0c6e783b2a07017d0fdf7f60232603ed407 |
|
07-Aug-2002 |
Guido van Rossum <guido@python.org> |
Simplify heapreplace() -- there's no need for an explicit test for
empty heap, since heap[0] raises the appropriate IndexError already.
/external/python/cpython2/Lib/heapq.py
|
| 6681de2455f8d43de9cb22ddaf6a155c63af81c3 |
|
03-Aug-2002 |
Tim Peters <tim.peters@gmail.com> |
_siftup(): __le__ is now the only comparison operator used on array
elements.
/external/python/cpython2/Lib/heapq.py
|
| 0cd53a6c37347800f786c4ddaa2e91af30350b5a |
|
03-Aug-2002 |
Tim Peters <tim.peters@gmail.com> |
Added new heapreplace(heap, item) function, to pop (and return) the
currently-smallest value, and add item, in one gulp. See the second
N-Best algorithm in the test suite for a natural use.
/external/python/cpython2/Lib/heapq.py
|
| 657fe38241a7f072bdbf040a7bd05df96f326c5c |
|
03-Aug-2002 |
Tim Peters <tim.peters@gmail.com> |
Large code rearrangement to use better algorithms, in the sense of needing
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.
/external/python/cpython2/Lib/heapq.py
|
| aa7d24319ebf62d38463e798b99be1afad314db6 |
|
03-Aug-2002 |
Tim Peters <tim.peters@gmail.com> |
Minor fiddling, including a simple class to implement a heap iterator
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.
/external/python/cpython2/Lib/heapq.py
|
| fbb299226d486b63459c0ec084e191c7eee6ddb9 |
|
03-Aug-2002 |
Guido van Rossum <guido@python.org> |
Augment credits.
/external/python/cpython2/Lib/heapq.py
|
| 28c25527c25babcf31e4b00dea316ca6f8612079 |
|
02-Aug-2002 |
Tim Peters <tim.peters@gmail.com> |
Hmm! I thought I checked this in before! Oh well.
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).
/external/python/cpython2/Lib/heapq.py
|
| 4b48d6b37c3e52721c18c33217b75ba864695109 |
|
02-Aug-2002 |
Guido van Rossum <guido@python.org> |
Add a PEP-263-style encoding turd^H^H^H^Hdeclaration, because there's
a c-cedilla in one of the docstrings.
/external/python/cpython2/Lib/heapq.py
|
| 62abc2f6ce9cb2ad9a83f744cf91cdf77a769f24 |
|
02-Aug-2002 |
Tim Peters <tim.peters@gmail.com> |
heappop(): Added comments; simplified and sped the code.
/external/python/cpython2/Lib/heapq.py
|
| a0b3a00bc5f55cfbdc3d9b7925ee8a28fa2bdc55 |
|
02-Aug-2002 |
Tim Peters <tim.peters@gmail.com> |
heappop(): Use "while True" instead of "while 1".
/external/python/cpython2/Lib/heapq.py
|
| d9ea39db84a78b3b994943bc7490615dfe6b009d |
|
02-Aug-2002 |
Tim Peters <tim.peters@gmail.com> |
Don't use true division where int division was intended. For that matter,
don't use division at all.
/external/python/cpython2/Lib/heapq.py
|
| 37c3b2788be1b3eea69fac9a8517459478afb6fd |
|
02-Aug-2002 |
Guido van Rossum <guido@python.org> |
Add Kevin O'Connor, author of the heapq code.
/external/python/cpython2/Lib/heapq.py
|
| 0a82438859a39c46a356c798c7bc84a08b0dc8b6 |
|
02-Aug-2002 |
Guido van Rossum <guido@python.org> |
Adding the heap queue algorithm, per discussion in python-dev last
week.
/external/python/cpython2/Lib/heapq.py
|