The permutation package
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||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.8), ghc-prim [details]|
|Copyright||(c) 2008. Patrick Perry <firstname.lastname@example.org>|
|Maintainer||Sophie Taylor <email@example.com>|
|Category||Data Structures, Math|
|Uploaded||Sun Apr 13 16:41:35 UTC 2014 by spacekitteh|
|Distributions||LTSHaskell:0.5.0.5, NixOS:0.5.0.5, Stackage:0.5.0.5, Tumbleweed:0.5.0.5|
|Downloads||3511 total (29 in the last 30 days)|
|Status||Docs uploaded by user [build log]
All reported builds failed [all 1 reports]
For package maintainers and hackage trustees