permutation: 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).
|Versions [faq]||0.1, 0.2, 0.2.1, 0.3, 0.4, 0.4.1, 0.5.0, 0.5.0.1, 0.5.0.2, 0.5.0.3, 0.5.0.4, 0.5.0.5|
|Dependencies||base (==4.*), ghc-prim, QuickCheck [details]|
|Copyright||(c) 2008. Patrick Perry <email@example.com>|
|Maintainer||Sophie Taylor <firstname.lastname@example.org>|
|Revised||Revision 1 made by GeorgeWilson at 2018-06-04T06:52:41Z|
|Category||Data Structures, Math|
|Uploaded||by spacekitteh at 2015-01-20T23:55:53Z|
|Downloads||10436 total (30 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs available [build log]
Last success reported on 2015-01-21 [all 1 reports]
- permutation-0.5.0.5.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
For package maintainers and hackage trustees