/var/lib/ghc/package.conf.d/psqueues-0.2.0.3.conf is in libghc-psqueues-dev 0.2.0.3-1build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 | name: psqueues
version: 0.2.0.3
id: psqueues-0.2.0.3-788287049b2675d8f1bedac8a62b2181
key: psque_LcSRh6AQi7Z5TpRJTtLMbE
license: BSD3
maintainer: Jasper Van der Jeugt <jaspervdj@gmail.com>
synopsis: Pure priority search queues
description:
The psqueues package provides
<http://en.wikipedia.org/wiki/Priority_queue 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
<http://citeseer.ist.psu.edu/hinze01simple.html A Simple Implementation Technique for Priority Search Queues>.
Hence, it is similar to the
<http://hackage.haskell.org/package/PSQueue 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 <http://en.wikipedia.org/wiki/Radix_tree 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. The benchmarks show how they perform relative to one
another, and also compared to the other Priority Search Queue
implementations on Hackage:
<http://hackage.haskell.org/package/PSQueue PSQueue>
and
<http://hackage.haskell.org/package/fingertree-psqueue fingertree-psqueue>.
.
<<http://i.imgur.com/KmbDKR6.png>>
.
<<http://i.imgur.com/ClT181D.png>>
.
Typical applications of Priority Search Queues include:
.
* Caches, and more specifically LRU Caches;
.
* Schedulers;
.
* Pathfinding algorithms, such as Dijkstra's and A*.
category: Data Structures
exposed: True
exposed-modules:
Data.HashPSQ Data.IntPSQ Data.OrdPSQ
hidden-modules: Data.BitUtil Data.HashPSQ.Internal
Data.IntPSQ.Internal Data.OrdPSQ.Internal
trusted: False
import-dirs: /usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-7.10.3/psqueues-0.2.0.3-LcSRh6AQi7Z5TpRJTtLMbE
library-dirs: /usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-7.10.3/psqueues-0.2.0.3-LcSRh6AQi7Z5TpRJTtLMbE
data-dir: /usr/share/psqueues
hs-libraries: HSpsqueues-0.2.0.3-LcSRh6AQi7Z5TpRJTtLMbE
depends:
base-4.8.2.0-0d6d1084fbc041e1cded9228e80e264d
deepseq-1.4.1.1-614b63b36dd6e29d2b35afff57c25311
ghc-prim-0.4.0.0-6cdc86811872333585fa98756aa7c51e
hashable-1.2.3.3-ce7af8ca3ebd83133b0e846c245dc9e2
haddock-interfaces: /usr/lib/ghc-doc/haddock/psqueues-0.2.0.3/psqueues.haddock
haddock-html: /usr/share/doc/libghc-psqueues-doc/html/
|