How to Install and Uninstall perl-Heap.noarch Package on Red Hat Enterprise Linux 8 (RHEL 8)
Last updated: November 28,2024
1. Install "perl-Heap.noarch" package
Please follow the instructions below to install perl-Heap.noarch on Red Hat Enterprise Linux 8 (RHEL 8)
$
sudo dnf update
Copied
$
sudo dnf install
perl-Heap.noarch
Copied
2. Uninstall "perl-Heap.noarch" package
This guide let you learn how to uninstall perl-Heap.noarch on Red Hat Enterprise Linux 8 (RHEL 8):
$
sudo dnf remove
perl-Heap.noarch
Copied
$
sudo dnf autoremove
Copied
3. Information about the perl-Heap.noarch package on Red Hat Enterprise Linux 8 (RHEL 8)
Last metadata expiration check: 0:14:38 ago on Mon Feb 26 15:59:38 2024.
Available Packages
Name : perl-Heap
Version : 0.80
Release : 33.el8
Architecture : noarch
Size : 46 k
Source : perl-Heap-0.80-33.el8.src.rpm
Repository : epel
Summary : Perl extension for keeping data partially sorted
URL : https://metacpan.org/release/Heap
License : GPL+ or Artistic
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.
Available Packages
Name : perl-Heap
Version : 0.80
Release : 33.el8
Architecture : noarch
Size : 46 k
Source : perl-Heap-0.80-33.el8.src.rpm
Repository : epel
Summary : Perl extension for keeping data partially sorted
URL : https://metacpan.org/release/Heap
License : GPL+ or Artistic
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.