d2cbc2a92c
Perl extensions for keeping data partially sorted PR: 26389 Submitted by: Anatoliy Dmytriyev <tolid@plab.ku.dk>
4 lines
263 B
Text
4 lines
263 B
Text
The Heap collection of modules provide routines that manage a heap of elements.
|
|
A heap is a partially sorted structure that is always able to easily extract
|
|
the smallest of the elements in the structure (or the largest if a reversed
|
|
compare routine is provided).
|