Message 122203 - Python tracker

➜

This issue tracker has been migrated to GitHub , and is currently read-only.
For more information, see the GitHub FAQs in the Python's Developer Guide.

In-reply-to
Author	georg.brandl
Recipients	georg.brandl, rhettinger
Date	2010年11月23日.08:10:10
SpamBayes Score	0.0038483203
Marked as misclassified	No
Message-id	<1290499811.48.0.151604893048.issue10511@psf.upfronthosting.co.za>

Content
On the python-docs mailing list, a user suggested to rewrite the first paragraph of the heapq docs like this. Are you okay with this change, Raymond? Heaps are trees for which every parent node has a value less than or equal to any of its children. This implementation uses arrays for which ``heap[k] <= heap[2k+1]`` and ``heap[k] <= heap[2k+2]`` for all k, counting elements from zero. For the sake of comparison, non-existing elements are considered to be infinite. The interesting property of a heap is that its smallest element is always the root, ``heap[0]``.

Content

On the python-docs mailing list, a user suggested to rewrite the first paragraph of the heapq docs like this. Are you okay with this change, Raymond?
Heaps are trees for which every parent node has a value less than or equal to
any of its children. This implementation uses arrays for which ``heap[k] <=
heap[2*k+1]`` and ``heap[k] <= heap[2*k+2]`` for all *k*, counting elements from
zero. For the sake of comparison, non-existing elements are considered to be
infinite. The interesting property of a heap is that its smallest element is
always the root, ``heap[0]``.

History
Date	User	Action	Args
2010年11月23日 08:10:11	georg.brandl	set	recipients: + georg.brandl, rhettinger
2010年11月23日 08:10:11	georg.brandl	set	messageid: <1290499811.48.0.151604893048.issue10511@psf.upfronthosting.co.za>
2010年11月23日 08:10:10	georg.brandl	link	issue10511 messages
2010年11月23日 08:10:10	georg.brandl	create

homepage