How to Install and Uninstall perl-Heap.noarch Package on Fedora 38
Last updated: January 11,2025
1. Install "perl-Heap.noarch" package
This is a short guide on how to install perl-Heap.noarch on Fedora 38
$
sudo dnf update
Copied
$
sudo dnf install
perl-Heap.noarch
Copied
2. Uninstall "perl-Heap.noarch" package
Please follow the steps below to uninstall perl-Heap.noarch on Fedora 38:
$
sudo dnf remove
perl-Heap.noarch
Copied
$
sudo dnf autoremove
Copied
3. Information about the perl-Heap.noarch package on Fedora 38
Last metadata expiration check: 1:04:01 ago on Sun Mar 17 04:59:58 2024.
Available Packages
Name : perl-Heap
Version : 0.80
Release : 42.fc38
Architecture : noarch
Size : 45 k
Source : perl-Heap-0.80-42.fc38.src.rpm
Repository : fedora
Summary : Perl extension for keeping data partially sorted
URL : https://metacpan.org/release/Heap
License : GPL-1.0-or-later OR Artistic-1.0-Perl
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 : 42.fc38
Architecture : noarch
Size : 45 k
Source : perl-Heap-0.80-42.fc38.src.rpm
Repository : fedora
Summary : Perl extension for keeping data partially sorted
URL : https://metacpan.org/release/Heap
License : GPL-1.0-or-later OR Artistic-1.0-Perl
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.