| 1 |
Source: libheap-perl |
| 2 |
Section: perl |
| 3 |
Priority: optional |
| 4 |
Build-Depends: debhelper-compat (= 13) |
| 5 |
Build-Depends-Indep: perl |
| 6 |
Maintainer: Debian Perl Group <[email protected]> |
| 7 |
Uploaders: Dominic Hargreaves <[email protected]> |
| 8 |
Standards-Version: 3.9.7 |
| 9 |
Homepage: https://metacpan.org/release/Heap/ |
| 10 |
Vcs-Git: https://salsa.debian.org/perl-team/modules/packages/libheap-perl.git |
| 11 |
Vcs-Browser: https://salsa.debian.org/perl-team/modules/packages/libheap-perl |
| 12 |
Testsuite: autopkgtest-pkg-perl |
| 13 |
|
| 14 |
Package: libheap-perl |
| 15 |
Architecture: all |
| 16 |
Depends: ${perl:Depends}, ${misc:Depends} |
| 17 |
Multi-Arch: foreign |
| 18 |
Description: Perl extensions for keeping data partially sorted |
| 19 |
The Heap collection of modules provide routines that manage |
| 20 |
a heap of elements. A heap is a partially sorted structure |
| 21 |
that is always able to easily extract the smallest of the |
| 22 |
elements in the structure (or the largest if a reversed compare |
| 23 |
routine is provided). |
| 24 |
. |
| 25 |
If the collection of elements is changing dynamically, the |
| 26 |
heap has less overhead than keeping the collection fully |
| 27 |
sorted. |