multiset-comb: Combinatorial algorithms over multisets

[ bsd3, library, math ] [ Propose Tags ]

Various combinatorial algorithms over multisets, including generating all permutations, partitions, size-2 partitions, size-k subsets, necklaces, and bracelets.

Versions [faq] 0.1, 0.2, 0.2.1, 0.2.2, 0.2.3, 0.2.4, 0.2.4.1
Dependencies base (>=3 && <5), containers (==0.5.*), transformers (>=0.3 && <0.5) [details]
License BSD-3-Clause
Copyright (c) 2010 Brent Yorgey
Author Brent Yorgey
Maintainer byorgey@gmail.com
Revised Revision 1 made by AdamBergmark at 2015-06-23T10:04:25Z
Category Math
Bug tracker http://hub.darcs.net/byorgey/multiset-comb/issues
Source repo head: darcs get http://hub.darcs.net/byorgey/multiset-comb
Uploaded by BrentYorgey at 2015-06-11T20:23:16Z
Distributions Debian:0.2.4.1, NixOS:0.2.4.1
Downloads 6549 total (6 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2015-06-12 [all 1 reports]

Modules

[Index]

Downloads

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

Maintainer's Corner

For package maintainers and hackage trustees