How to Install and Uninstall libheap-perl Package on Ubuntu 21.10 (Impish Indri)

Last updated: May 20,2024

1. Install "libheap-perl" package

This guide let you learn how to install libheap-perl on Ubuntu 21.10 (Impish Indri)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libheap-perl
            
                    
    
    Copied

2. Uninstall "libheap-perl" package

Here is a brief guide to show you how to uninstall libheap-perl on Ubuntu 21.10 (Impish Indri):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libheap-perl
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libheap-perl package on Ubuntu 21.10 (Impish Indri)

Package: libheap-perl
Architecture: all
Version: 0.80-3
Priority: optional
Section: universe/perl
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Perl Group
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 88
Depends: perl
Filename: pool/universe/libh/libheap-perl/libheap-perl_0.80-3_all.deb
Size: 33166
MD5sum: 4a088de7c4bd142fe10da23248a41588
SHA1: cb30f18119730a70dea161ab7c7c98e7b252cd5c
SHA256: 29ea8609b4875014422a2abc22d872eaddeef9ca67f69635ca5eb5f7130b5581
SHA512: 1b2a9d748073ad4d84230773189e83527fbc21b1a8ea820988ef48c2de55f8c2f89b8c6199e21eed8dac709bf8d5f9160aa8f79bfc80ab23ab4cf9a4807661f3
Homepage: https://metacpan.org/release/Heap/
Description-en: 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).
.
If the collection of elements is changing dynamically, the
heap has less overhead than keeping the collection fully
sorted.
Description-md5: 49843651c79e36c52b7f4ae5ff981424