How to Install and Uninstall perl-Heap Package on openSUSE Leap
Last updated: November 12,2024
1. Install "perl-Heap" package
Please follow the guidelines below to install perl-Heap on openSUSE Leap
$
sudo zypper refresh
Copied
$
sudo zypper install
perl-Heap
Copied
2. Uninstall "perl-Heap" package
This tutorial shows how to uninstall perl-Heap on openSUSE Leap:
$
sudo zypper remove
perl-Heap
Copied
3. Information about the perl-Heap package on openSUSE Leap
Information for package perl-Heap:
----------------------------------
Repository : Main Repository
Name : perl-Heap
Version : 0.80-bp155.1.5
Arch : noarch
Vendor : openSUSE
Installed Size : 65.3 KiB
Installed : No
Status : not installed
Source package : perl-Heap-0.80-bp155.1.5.src
Upstream URL : https://metacpan.org/release/Heap
Summary : Perl extensions for keeping data partially sorted
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.
The elements must be objects as described in "Heap::Elem" and all elements
inserted into one heap must be mutually compatible - either the same class
exactly or else classes that differ only in ways unrelated to the
*Heap::Elem* interface.
----------------------------------
Repository : Main Repository
Name : perl-Heap
Version : 0.80-bp155.1.5
Arch : noarch
Vendor : openSUSE
Installed Size : 65.3 KiB
Installed : No
Status : not installed
Source package : perl-Heap-0.80-bp155.1.5.src
Upstream URL : https://metacpan.org/release/Heap
Summary : Perl extensions for keeping data partially sorted
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.
The elements must be objects as described in "Heap::Elem" and all elements
inserted into one heap must be mutually compatible - either the same class
exactly or else classes that differ only in ways unrelated to the
*Heap::Elem* interface.