permutation

A library for permutations and combinations.

https://github.com/spacekitteh/permutation

Version on this page:	0.5.0.5
LTS Haskell 8.24:	0.5.0.5
Stackage Nightly 2017-03-09:	0.5.0.5
Latest on Hackage:	0.5.0.5@rev:1

See all snapshots permutation appears in

BSD-3-Clause licensed by Patrick Perry

Maintained by Sophie Taylor

This version can be pinned in stack with:permutation-0.5.0.5@sha256:5fdee2614d98ab0fa4423c28b6c4c97609c79e9bce57e3fc7f1d292374cfb5e1,2568

Module documentation for 0.5.0.5

Data
- Data.Choose
- Data.Permute

Depends on 3 packages(full list with versions):

base, ghc-prim, QuickCheck

Used by 1 package in lts-7.24(full list with versions):

hmt

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