How to Install and Uninstall perl-Heap.noarch Package on Rocky Linux 9
Last updated: November 27,2024
1. Install "perl-Heap.noarch" package
Please follow the guidance below to install perl-Heap.noarch on Rocky Linux 9
$
sudo dnf update
Copied
$
sudo dnf install
perl-Heap.noarch
Copied
2. Uninstall "perl-Heap.noarch" package
This tutorial shows how to uninstall perl-Heap.noarch on Rocky Linux 9:
$
sudo dnf remove
perl-Heap.noarch
Copied
$
sudo dnf autoremove
Copied
3. Information about the perl-Heap.noarch package on Rocky Linux 9
Last metadata expiration check: 0:49:11 ago on Fri Feb 16 06:49:52 2024.
Available Packages
Name : perl-Heap
Version : 0.80
Release : 38.el9
Architecture : noarch
Size : 43 k
Source : perl-Heap-0.80-38.el9.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 : 38.el9
Architecture : noarch
Size : 43 k
Source : perl-Heap-0.80-38.el9.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.