Source: haskell-permutation
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
Homepage: http://stat.stanford.edu/~patperry/code/permutation

Package: libghc-permutation-dev
Architecture: any
Section: haskell
Depends: ${haskell:Depends},
         ${misc:Depends}
Description: A library for permutations and combinations.
 This library includes data types for storing permutations and
 combinations.  It implements pure and impure types, the latter of
 which can be modified in-place.  The library uses aggressive
 inlining and MutableByteArray#s internally, so it is very
 efficient.
 .
 The main utility of the library is converting between the linear
 representation of a permutation and a sequence of swaps.  This
 allows, for instance, applying a permutation or its inverse
 to an array with O(1) memory use.
 .
 Much of the interface for the library is based on the permutation
 and combination functions in the GNU Scientific Library (GSL).
 .
 .
  Author: Patrick Perry
  Upstream-Maintainer: Patrick Perry <patperry@stanford.edu>
 .
 This package contains the normal library files.

Package: libghc-permutation-prof
Architecture: any
Section: haskell
Depends: ${haskell:Depends},
         ${misc:Depends},
         libghc-permutation-dev
Description: A library for permutations and combinations.
 This library includes data types for storing permutations and
 combinations.  It implements pure and impure types, the latter of
 which can be modified in-place.  The library uses aggressive
 inlining and MutableByteArray#s internally, so it is very
 efficient.
 .
 The main utility of the library is converting between the linear
 representation of a permutation and a sequence of swaps.  This
 allows, for instance, applying a permutation or its inverse
 to an array with O(1) memory use.
 .
 Much of the interface for the library is based on the permutation
 and combination functions in the GNU Scientific Library (GSL).
 .
 .
  Author: Patrick Perry
  Upstream-Maintainer: Patrick Perry <patperry@stanford.edu>
 .
 This package contains the libraries compiled with profiling enabled.

Package: haskell-permutation-doc
Architecture: all
Section: doc
Depends: ${haskell:Depends},
         ${misc:Depends},
         ghc-doc
Description: A library for permutations and combinations.
 This library includes data types for storing permutations and
 combinations.  It implements pure and impure types, the latter of
 which can be modified in-place.  The library uses aggressive
 inlining and MutableByteArray#s internally, so it is very
 efficient.
 .
 The main utility of the library is converting between the linear
 representation of a permutation and a sequence of swaps.  This
 allows, for instance, applying a permutation or its inverse
 to an array with O(1) memory use.
 .
 Much of the interface for the library is based on the permutation
 and combination functions in the GNU Scientific Library (GSL).
 .
 .
  Author: Patrick Perry
  Upstream-Maintainer: Patrick Perry <patperry@stanford.edu>
 .
 This package contains the documentation files.