mirrors/cpython
1
0
Fork 0
mirror of https://github.com/python/cpython.git synced 2025-08-04 08:59:19 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 11

Added new heapreplace(heap, item) function, to pop (and return) the

Browse source 
currently-smallest value, and add item, in one gulp.  See the second
N-Best algorithm in the test suite for a natural use.
This commit is contained in:
Tim Peters 2002-08-03 10:10:10 +00:00
parent 657fe38241
commit 0cd53a6c37
2 changed files with 20 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

5
Lib/test/test_heapq.py
View file

@ -2,7 +2,7 @@
from test.test_support import verify, vereq, verbose, TestFailed
from heapq import heappush, heappop, heapify
from heapq import heappush, heappop, heapify, heapreplace
import random
def check_invariant(heap):
@ -68,8 +68,7 @@ def test_main():
heapify(heap)
for item in data[10:]:
if item > heap[0]: # this gets rarer the longer we run
heappop(heap) # we know heap[0] isn't in best 10 anymore
heappush(heap, item)
heapreplace(heap, item)
vereq(list(heapiter(heap)), data_sorted[-10:])
# Make user happy
if verbose: