[Python-checkins] python/dist/src/Doc/whatsnew whatsnew23.tex,1.83,1.84
tim_one@users.sourceforge.net
tim_one@users.sourceforge.net
Tue, 10 Dec 2002 13:04:30 -0800
Update of /cvsroot/python/python/dist/src/Doc/whatsnew
In directory sc8-pr-cvs1:/tmp/cvs-serv10530/python/Doc/whatsnew
Modified Files:
whatsnew23.tex
Log Message:
Added a word to the heapq description in response to user confusion.
Index: whatsnew23.tex
===================================================================
RCS file: /cvsroot/python/python/dist/src/Doc/whatsnew/whatsnew23.tex,v
retrieving revision 1.83
retrieving revision 1.84
diff -C2 -d -r1.83 -r1.84
*** whatsnew23.tex 3 Dec 2002 13:35:17 -0000 1.83
--- whatsnew23.tex 10 Dec 2002 21:04:25 -0000 1.84
***************
*** 1105,1110 ****
\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
the smallest item, and inserting a new item while maintaining the heap
property is O(lg~n). (See
--- 1105,1111 ----
\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 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