|
|
Linux temps réel embarqué et outils de développements
|
Technique |
|
libheap-perl
libheap-perl | Perl extensions for keeping data partially sorted | Priority | |
Section | perl |
Installed size | 272 |
Maintainer | Matt Hope <dopey@debian.org> |
Architecture | all |
Version | 0.71-0.1 |
Depends | perl (>= 5.6.0-16) |
Suggests | libhdf5-doc |
File name | pool/main/libh/libheap-perl/libheap-perl_0.71-0.1_all.deb |
Description | 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). . If the collection of elements is changing dynamically, the heap has less overhead than keeping the collection fully sorted. |
|
|