How to Install and Uninstall ghc-psqueues Package on openSUSE Leap

Last updated: November 08,2024

1. Install "ghc-psqueues" package

This tutorial shows how to install ghc-psqueues on openSUSE Leap


    
        
            $
        

        
            
                sudo zypper refresh
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo zypper install
            
                        
                ghc-psqueues
            
                    
    
    Copied

2. Uninstall "ghc-psqueues" package

This guide covers the steps necessary to uninstall ghc-psqueues on openSUSE Leap:


    
        
            $
        

        
            
                sudo zypper remove
            
                        
                ghc-psqueues
            
                    
    
    Copied

3. Information about the ghc-psqueues package on openSUSE Leap

Information for package ghc-psqueues:
-------------------------------------
Repository : Main Repository
Name : ghc-psqueues
Version : 0.2.7.3-bp155.2.16
Arch : x86_64
Vendor : openSUSE
Installed Size : 490.0 KiB
Installed : No
Status : not installed
Source package : ghc-psqueues-0.2.7.3-bp155.2.16.src
Upstream URL : https://hackage.haskell.org/package/psqueues
Summary : Pure priority search queues
Description :
The psqueues 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
Technique for Priority Search Queues>. Hence, it is similar to the
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 (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. The benchmarks show how they perform relative to one another,
and also compared to the other Priority Search Queue implementations on
Hackage: and
.
<>
<>
Typical applications of Priority Search Queues include:
* Caches, and more specifically LRU Caches;
* Schedulers;
* Pathfinding algorithms, such as Dijkstra's and A*.