Source: haskell-psqueue
Priority: optional
Section: misc
Maintainer: Clifford Beshers <beshers@seereason.com>
Build-Depends: debhelper (>= 7.0),
               haskell-devscripts (>= 0.6.15+nmu7),
               hscolour,
               cdbs,
               ghc (>= 6.8),
               ghc-prof
Build-Depends-Indep: ghc-doc,
                     haddock
Standards-Version: 3.8.1

Package: libghc-psqueue-dev
Architecture: any
Section: haskell
Depends: ${haskell:Depends},
         ${misc:Depends}
Description: Priority Search Queue
 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.
 .
  Author: Ralf Hinze
  Upstream-Maintainer: Scott E. Dillard <sedillard@gmail.com>
 .
 This package contains the normal library files.

Package: libghc-psqueue-prof
Architecture: any
Section: haskell
Depends: ${haskell:Depends},
         ${misc:Depends},
         libghc-psqueue-dev
Description: Priority Search Queue
 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.
 .
  Author: Ralf Hinze
  Upstream-Maintainer: Scott E. Dillard <sedillard@gmail.com>
 .
 This package contains the libraries compiled with profiling enabled.

Package: libghc-psqueue-doc
Architecture: all
Section: doc
Depends: ${haskell:Depends},
         ${misc:Depends},
         ghc-doc
Description: Priority Search Queue
 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.
 .
  Author: Ralf Hinze
  Upstream-Maintainer: Scott E. Dillard <sedillard@gmail.com>
 .
 This package contains the documentation files.