From fc8408cbe85dfc549686036668ceed77f2d8e76f Mon Sep 17 00:00:00 2001 From: Benjamin Peterson Date: Sat, 9 Oct 2010 01:58:37 +0000 Subject: [PATCH] remove author names from prose --- Doc/library/heapq.rst | 3 --- 1 file changed, 3 deletions(-) diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst index 49e3bf3577..78beee9978 100644 --- a/Doc/library/heapq.rst +++ b/Doc/library/heapq.rst @@ -203,9 +203,6 @@ entry as invalid and optionally add a new entry with the revised priority:: Theory ------ -(This explanation is due to François Pinard. The Python code for this module -was contributed by Kevin O'Connor.) - Heaps are arrays for which ``a[k] <= a[2*k+1]`` and ``a[k] <= a[2*k+2]`` for all *k*, counting elements from 0. For the sake of comparison, non-existing elements are considered to be infinite. The interesting property of a heap is -- 2.40.0