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

Last updated: November 22,2024

1. Install "libghc-psqueues-dev" package

Please follow the steps below to install libghc-psqueues-dev on Kali Linux


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libghc-psqueues-dev
            
                    
    
    Copied

2. Uninstall "libghc-psqueues-dev" package

This guide let you learn how to uninstall libghc-psqueues-dev on Kali Linux:


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libghc-psqueues-dev
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

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

Package: libghc-psqueues-dev
Source: haskell-psqueues (0.2.7.3-2)
Version: 0.2.7.3-2+b1
Installed-Size: 1770
Maintainer: Debian Haskell Group
Architecture: amd64
Provides: libghc-psqueues-dev-0.2.7.3-e03fa
Depends: libghc-base-dev-4.17.2.0-68dfe, libghc-deepseq-dev-1.4.8.0-ddf16, libghc-ghc-prim-dev-0.9.1-ca9fc, libghc-hashable-dev-1.4.3.0-e937e, libc6 (>= 2.2.5), libgmp10 (>= 2:6.3.0+dfsg)
Size: 206344
SHA256: fe9eea00ea900be153c1f72c41906647af6f7f3e08482a1e4c38276e206a0331
SHA1: 405ed347446fb1ba39d1091330931a1bc33fd94b
MD5sum: ed4e571e031dba4793c3de71979ec1cd
Description: Pure priority search queues
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.
See http://www.haskell.org/ for more information on Haskell.
Description-md5:
Homepage: https://hackage.haskell.org/package/psqueues
Ghc-Package: psqueues-0.2.7.3-7jDJMZyHlur3fHJIdlsWRn
Section: haskell
Priority: optional
Filename: pool/main/h/haskell-psqueues/libghc-psqueues-dev_0.2.7.3-2+b1_amd64.deb