Source: haskell-bytestring-trie
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,
               libghc-binary-prof
Build-Depends-Indep: ghc-doc,
                     haddock,
                     libghc-binary-doc
Standards-Version: 3.8.1
Homepage: http://code.haskell.org/~wren/

Package: libghc-bytestring-trie-dev
Architecture: any
Section: haskell
Depends: ${haskell:Depends},
         ${misc:Depends}
Description: An efficient finite map from (byte)strings to values.
 An efficient finite map from (byte)strings to values.
 .
 The implementation is based on big-endian patricia
 trees, like "Data.IntMap". We first trie on the
 elements of "Data.ByteString" and then trie on the
 big-endian bit representation of those elements.
 Patricia trees have efficient algorithms for union
 and other merging operations, but they're also quick
 for lookups and insertions.
 .
  Author: wren ng thornton
  Upstream-Maintainer: wren@community.haskell.org
 .
 This package contains the normal library files.

Package: libghc-bytestring-trie-prof
Architecture: any
Section: haskell
Depends: ${haskell:Depends},
         ${misc:Depends},
         libghc-bytestring-trie-dev
Description: An efficient finite map from (byte)strings to values.
 An efficient finite map from (byte)strings to values.
 .
 The implementation is based on big-endian patricia
 trees, like "Data.IntMap". We first trie on the
 elements of "Data.ByteString" and then trie on the
 big-endian bit representation of those elements.
 Patricia trees have efficient algorithms for union
 and other merging operations, but they're also quick
 for lookups and insertions.
 .
  Author: wren ng thornton
  Upstream-Maintainer: wren@community.haskell.org
 .
 This package contains the libraries compiled with profiling enabled.

Package: libghc-bytestring-trie-doc
Architecture: all
Section: doc
Depends: ${haskell:Depends},
         ${misc:Depends},
         ghc-doc
Description: An efficient finite map from (byte)strings to values.
 An efficient finite map from (byte)strings to values.
 .
 The implementation is based on big-endian patricia
 trees, like "Data.IntMap". We first trie on the
 elements of "Data.ByteString" and then trie on the
 big-endian bit representation of those elements.
 Patricia trees have efficient algorithms for union
 and other merging operations, but they're also quick
 for lookups and insertions.
 .
  Author: wren ng thornton
  Upstream-Maintainer: wren@community.haskell.org
 .
 This package contains the documentation files.