The permutation package

[Tags:bsd3, library]

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).

Properties

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
Change log NEWS
Dependencies base, ghc-prim [details]
License BSD3
Copyright (c) 2008. Patrick Perry <patperry@stanford.edu>
Author Patrick Perry
Maintainer Patrick Perry <patperry@stanford.edu>
Stability Unknown
Category Data Structures, Math
Home page http://stat.stanford.edu/~patperry/code/permutation
Uploaded Mon Jan 19 19:56:09 UTC 2009 by PatrickPerry
Distributions LTSHaskell:0.5.0.5, NixOS:0.5.0.5, Stackage:0.5.0.5, Tumbleweed:0.5.0.5
Downloads 3599 total (32 in the last 30 days)
Votes
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees