mirrors/cpython
1
0
Fork 0
mirror of https://github.com/python/cpython.git synced 2025-07-29 14:15:07 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 9

Added a word to the heapq description in response to user confusion.

Browse source
This commit is contained in:
Tim Peters 2002-12-10 21:04:25 +00:00
parent 598c210b5a
commit 85f7f83d71
1 changed files with 3 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

5
Doc/whatsnew/whatsnew23.tex
View file

@ -1104,8 +1104,9 @@ now return enhanced tuples:
\item The new \module{heapq} module contains an implementation of a
heap queue algorithm. A heap is an array-like data structure that
keeps items in a sorted order such that, for every index k, heap[k] <=
heap[2*k+1] and heap[k] <= heap[2*k+2]. This makes it quick to remove
keeps items in a partially sorted order such that,
for every index k, heap[k] <= heap[2*k+1] and heap[k] <= heap[2*k+2].
This makes it quick to remove
the smallest item, and inserting a new item while maintaining the heap
property is O(lg~n). (See
\url{http://www.nist.gov/dads/HTML/priorityque.html} for more