Name:                multiset-comb
Version:             0.2.4.2
Synopsis:            Combinatorial algorithms over multisets
Description:         Various combinatorial algorithms over multisets,
                     including generating all permutations,
                     partitions, size-2 partitions, size-k subsets,
                     necklaces, and bracelets.
License:             BSD3
License-file:        LICENSE
Author:              Brent Yorgey
Maintainer:          byorgey@gmail.com
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 || ==7.6.3 || ==7.8.4 || ==7.10.1 || ==8.10.1 || ==9.0.2 || ==9.2.5 || ==9.4.4
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,
                       containers >= 0.5 && < 0.7,
                       transformers >= 0.3 && < 0.7
  Default-language:    Haskell2010