Benjamin Peterson committed aeddb18

remove author names from prose

  • Participants
  • Parent commits 9c02618

Comments (0)

Files changed (1)

File Doc/library/heapq.rst

-(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