How to Install and Uninstall libghc-psqueue-doc Package on Ubuntu 21.04 (Hirsute Hippo)

Last updated: May 05,2024

1. Install "libghc-psqueue-doc" package

This tutorial shows how to install libghc-psqueue-doc on Ubuntu 21.04 (Hirsute Hippo)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libghc-psqueue-doc
            
                    
    
    Copied

2. Uninstall "libghc-psqueue-doc" package

Learn how to uninstall libghc-psqueue-doc on Ubuntu 21.04 (Hirsute Hippo):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libghc-psqueue-doc
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libghc-psqueue-doc package on Ubuntu 21.04 (Hirsute Hippo)

Package: libghc-psqueue-doc
Architecture: all
Version: 1.1.0.1-3build2
Priority: extra
Section: universe/doc
Source: haskell-psqueue
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Haskell Group
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 637
Depends: haddock-interface-35
Recommends: libjs-mathjax
Filename: pool/universe/h/haskell-psqueue/libghc-psqueue-doc_1.1.0.1-3build2_all.deb
Size: 47748
MD5sum: 99ddae217830b1aa29f26c61449d8567
SHA1: fc690f88e0952c5bc6b57a12e4210138d0b3d037
SHA256: 84221518d401daf94da4679598df90c32e6b2e4798eee001b9a8f4d4ea7e59b2
SHA512: fda2c5ce9780e394314658557d05b3b2a6c43c9b51f1f415b15ef9028ffa41ab8028e2d3f8923fb4b6578ae34c1fe470de56b6615993af560c1a6561970d5bbb
Homepage: https://hackage.haskell.org/package/PSQueue
Description-en: Priority Search Queue; documentation
A /priority search queue/ efficiently supports the
opperations of both a search tree and a priority queue. A
'Binding' is a product of a key and a priority. Bindings
can be inserted, deleted, modified and queried in
logarithmic time, and the binding with the least priority
can be retrieved in constant time. A queue can be built
from a list of bindings, sorted by keys, in linear time.
.
This package contains the documentation files.
Description-md5: a8f5b1c07c0222236f02a1b0a396ed78