-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | GenValidity support for containers
--   
--   GenValidity support for containers
@package genvalidity-containers
@version 1.0.0.0

module Data.GenValidity.Map
genMapOf :: Ord k => Gen (k, v) -> Gen (Map k v)
instance (GHC.Show.Show k, GHC.Classes.Ord k, Data.GenValidity.GenValid k, Data.GenValidity.GenValid v) => Data.GenValidity.GenValid (Data.Map.Internal.Map k v)

module Data.GenValidity.Sequence
genSeqOf :: Gen v -> Gen (Seq v)
instance Data.GenValidity.GenValid v => Data.GenValidity.GenValid (Data.Sequence.Internal.Seq v)

module Data.GenValidity.Set
genSetOf :: Ord v => Gen v -> Gen (Set v)
genSeperate :: Ord a => Gen a -> Gen [a]
genSeperateFor :: Eq b => Gen b -> [a] -> Gen [(b, a)]
genSeperateForNE :: Eq b => Gen b -> NonEmpty a -> Gen (NonEmpty (b, a))
genValidSeperateFor :: (GenValid b, Eq b) => [a] -> Gen [(b, a)]
genValidSeperateForNE :: (GenValid b, Eq b) => NonEmpty a -> Gen (NonEmpty (b, a))
instance (GHC.Classes.Ord v, Data.GenValidity.GenValid v) => Data.GenValidity.GenValid (Data.Set.Internal.Set v)

module Data.GenValidity.Tree

-- | Generate a tree of values that are generated as specified.
--   
--   This takes the size parameter much better into account
genTreeOf :: Gen a -> Gen (Tree a)
instance Data.GenValidity.GenValid a => Data.GenValidity.GenValid (Data.Tree.Tree a)

module Data.GenValidity.Containers