How to Install and Uninstall libghc-psqueues-prof Package on Kali Linux

Last updated: November 26,2024

1. Install "libghc-psqueues-prof" package

Learn how to install libghc-psqueues-prof on Kali Linux


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libghc-psqueues-prof
            
                    
    
    Copied

2. Uninstall "libghc-psqueues-prof" package

Please follow the instructions below to uninstall libghc-psqueues-prof on Kali Linux:


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libghc-psqueues-prof
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libghc-psqueues-prof package on Kali Linux

Package: libghc-psqueues-prof
Source: haskell-psqueues (0.2.7.3-2)
Version: 0.2.7.3-2+b1
Installed-Size: 1766
Maintainer: Debian Haskell Group
Architecture: amd64
Provides: libghc-psqueues-prof-0.2.7.3-e03fa
Depends: libghc-base-prof-4.17.2.0-68dfe, libghc-deepseq-prof-1.4.8.0-ddf16, libghc-ghc-prim-prof-0.9.1-ca9fc, libghc-hashable-prof-1.4.3.0-e937e, libghc-psqueues-dev (= 0.2.7.3-2+b1)
Size: 192060
SHA256: 20204861eccd3b57f01ebe6ab1562c0377e537ea4afb6a6d2b4468fab6193bc3
SHA1: 53a4f48d89e60412da54fc598a5075c137028658
MD5sum: bbd1fa3a083ec6becceb66c2c376dd98
Description: Pure priority search queues; profiling libraries
This package provides Priority Search Queues in three different flavors.
.
* OrdPSQ k p v, which uses the Ord k instance to provide fast insertion,
deletion and lookup. This implementation is based on Ralf Hinze's "A Simple
Implementation Technique for Priority Search Queues". Hence, it is similar to
the PSQueue library, although it is considerably faster and provides a
slightly different API.
.
* IntPSQ p v is a far more efficient implementation. It fixes the key type
to Int and uses a radix tree (like IntMap) with an additional min-heap
property.
.
* HashPSQ k p v is a fairly straightforward extension of IntPSQ: it
simply uses the keys' hashes as indices in the IntPSQ. If there are any hash
collisions, it uses an OrdPSQ to resolve those. The performance of this
implementation is comparable to that of IntPSQ, but it is more widely
applicable since the keys are not restricted to Int, but rather to any
Hashable datatype.
.
Each of the three implementations provides the same API, so they can be used
interchangeably.
.
Typical applications of Priority Search Queues include:
.
* Caches, and more specifically LRU Caches;
.
* Schedulers;
.
* Pathfinding algorithms, such as Dijkstra's and A*.
.
This package provides a library for the Haskell programming language, compiled
for profiling. See http://www.haskell.org/ for more information on Haskell.
Description-md5:
Homepage: https://hackage.haskell.org/package/psqueues
Section: haskell
Priority: optional
Filename: pool/main/h/haskell-psqueues/libghc-psqueues-prof_0.2.7.3-2+b1_amd64.deb