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

Last updated: May 10,2024

1. Install "libghc-psqueues-doc" package

This guide let you learn how to install libghc-psqueues-doc on Kali Linux


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libghc-psqueues-doc
            
                    
    
    Copied

2. Uninstall "libghc-psqueues-doc" package

This guide covers the steps necessary to uninstall libghc-psqueues-doc on Kali Linux:


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libghc-psqueues-doc
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

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

Package: libghc-psqueues-doc
Source: haskell-psqueues
Version: 0.2.7.3-2
Installed-Size: 2053
Maintainer: Debian Haskell Group
Architecture: all
Depends: haddock-interface-41
Recommends: ghc-doc, libghc-hashable-doc, libghc-psqueues-dev, libjs-mathjax
Suggests: libghc-psqueues-prof
Size: 109604
SHA256: f31aa32b5b344122cd953bbbbbb20dbce45656768c52551822a446d3ad289990
SHA1: 23931647544ede7cf9f259472e5c53c4aa4242b1
MD5sum: 103bc1b503ae26e733ae6c65467c3e5a
Description: Pure priority search queues; documentation
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 the documentation for 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
Section: doc
Priority: optional
Filename: pool/main/h/haskell-psqueues/libghc-psqueues-doc_0.2.7.3-2_all.deb