Name:                multiset-comb
Version:             0.2.3
Synopsis:            Combinatorial algorithms over multisets
Description:         Various combinatorial algorithms over multisets,
                     including generating all permutations,
                     partitions, size-2 partitions, size-k subsets,
                     and Sawada's algorithm for generating all
                     necklaces with elements from a multiset.
License:             BSD3
License-file:        LICENSE
Author:              Brent Yorgey
Maintainer:          byorgey@cis.upenn.edu
bug-reports:         http://hub.darcs.net/byorgey/multiset-comb/issues
Copyright:           (c) 2010 Brent Yorgey
Stability:           Experimental
Category:            Math
Tested-with:         GHC == 7.4.2, GHC == 7.6.1
Build-type:          Simple
Cabal-version:       >=1.10
source-repository head
  type:     darcs
  location: http://hub.darcs.net/byorgey/multiset-comb

Library
  Exposed-modules:     Math.Combinatorics.Multiset
  Build-depends:       base >= 3 && < 5
  Default-language:    Haskell2010