How to Install and Uninstall libghc-psqueues-doc Package on Ubuntu 16.04 LTS (Xenial Xerus)

Last updated: May 18,2024

1. Install "libghc-psqueues-doc" package

Please follow the guidance below to install libghc-psqueues-doc on Ubuntu 16.04 LTS (Xenial Xerus)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libghc-psqueues-doc
            
                    
    
    Copied

2. Uninstall "libghc-psqueues-doc" package

Learn how to uninstall libghc-psqueues-doc on Ubuntu 16.04 LTS (Xenial Xerus):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libghc-psqueues-doc
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libghc-psqueues-doc package on Ubuntu 16.04 LTS (Xenial Xerus)

Package: libghc-psqueues-doc
Priority: extra
Section: universe/doc
Installed-Size: 715
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Haskell Group
Architecture: all
Source: haskell-psqueues
Version: 0.2.0.3-1build1
Depends: haddock-interface-27
Recommends: ghc-doc, libghc-hashable-doc
Filename: pool/universe/h/haskell-psqueues/libghc-psqueues-doc_0.2.0.3-1build1_all.deb
Size: 49166
MD5sum: f54c518e36c87b04772f91dccd6273b9
SHA1: 84604760e37cfca162ec2fc80c39e7259cdf3c84
SHA256: 48cc086cd25ef36ec23ec43178b38d045f050d8e4c34ca50f2d2e74e731a521c
Description-en: 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: 4b01bcba4a003fce5cc40f1ee117b50f
Homepage: http://hackage.haskell.org/package/psqueues
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu