Perl Extensions for keeping Data partially sorted
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).
- Sources inherited from project openSUSE:Backports:SLE-15-SP5
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Leap:15.5:Update/perl-Heap && cd $_
- Create Badge
Refresh
Refresh
Source Files
Filename | Size | Changed |
---|---|---|
Heap-0.80.tar.gz | 0000015673 15.3 KB | |
cpanspec.yml | 0000000660 660 Bytes | |
perl-Heap.changes | 0000000605 605 Bytes | |
perl-Heap.spec | 0000002193 2.14 KB |
Latest Revision
Yuchen Lin (maxlin_factory)
accepted
request 996554
from
Yuchen Lin (maxlin_factory)
(revision 1)
Automatically create request by update submitter. This is going to update package to openSUSE:Backports:SLE-15-SP5 from openSUSE:Factory. Please review this change and decline it if Leap do not need it.
Comments 0