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


-- | Existential type that can be constrained
--   
--   This library provides utilities for working with existential types and
--   type-level constraints. It allows you to enforce multiple constraints
--   on polymorphic types and containers complementing the package some.
@package constrained-some
@version 0.1.2

module Data.Some.Constraint

-- | AllC ensures that a list of <a>Constraint</a>s is applied to a
--   poly-kinded <a>Type</a> <tt>k</tt>.
type family AllC cs k :: Constraint

-- | Existential with <a>Constraint</a>s.
--   
--   <h4><b>Example</b></h4>
--   
--   <pre>
--   someShowableOrd :: <a>Somes</a> '[<a>Show</a>, <a>Ord</a>]
--   someShowableOrd = <a>Somes</a> (<a>mempty</a> :: [<a>Double</a>])
--   </pre>
data Somes cs
[Some] :: forall (cs :: [Type -> Constraint]) (a :: Type). AllC cs a => a -> Somes cs

-- | Alias for <a>Somes</a> with just one <a>Constraint</a>.
type Some c = Somes '[c]

-- | Existential for containers with <a>Constraint</a>s.
--   
--   <h4><b>Example</b></h4>
--   
--   <pre>
--   someNumFunctor :: <a>Somes1</a> '[<a>Functor</a>] '[<a>Num</a>]
--   someNumFunctor = <a>Somes1</a> $ [1, 2, 3 :: <a>Int</a>]
--   </pre>
data Somes1 csf csa
[Some1] :: forall k (csf :: [(k -> Type) -> Constraint]) (csa :: [k -> Constraint]) (f :: k -> Type) (a :: k). (AllC csf f, AllC csa a) => f a -> Somes1 csf csa

-- | Alias for <a>Somes1</a> with just one <a>Constraint</a>.
type Some1 cf ca = Somes1 '[cf] '[ca]

-- | Alias for <a>Somes1</a> with a container <tt>f</tt> and multiple
--   <a>Constraint</a>s <tt>csa</tt> for its elements.
type SomesF f csa = Somes1 '[(~) f] csa

-- | Alias for <a>SomeF</a> with just one <a>Constraint</a> for its
--   elements.
type SomeF f c = SomesF f '[c]

-- | Natural transformation of one container to another.
mapSome :: (forall a. AllC csa a => f a -> g a) -> SomesF f csa -> SomesF g csa

-- | Infix version of <a>mapSome</a>.
(<~$>) :: (forall a. AllC csa a => f a -> g a) -> SomesF f csa -> SomesF g csa
infixl 4 <~$>

-- | Natural transformation of one container to another - with side effects
--   in <tt>m</tt>.
traverseSome :: Functor m => (forall a. AllC csa a => f a -> m (g a)) -> SomesF f csa -> m (SomesF g csa)

-- | Infix version of <a>traverseSome</a>.
(<~*>) :: Functor m => (forall a. AllC csa a => f a -> m (g a)) -> SomesF f csa -> m (SomesF g csa)
infixl 4 <~*>
instance (forall a. GHC.Show.Show a => GHC.Show.Show (f a)) => GHC.Show.Show (Data.Some.Constraint.SomesF f (GHC.Show.Show : cs))
instance forall k (f :: k -> *) (cs :: [k -> GHC.Types.Constraint]) (c :: k -> GHC.Types.Constraint). GHC.Show.Show (Data.Some.Constraint.SomesF f cs) => GHC.Show.Show (Data.Some.Constraint.SomesF f (c : cs))
instance GHC.Show.Show (Data.Some.Constraint.Somes (GHC.Show.Show : cs))
instance GHC.Show.Show (Data.Some.Constraint.Somes cs) => GHC.Show.Show (Data.Some.Constraint.Somes (c : cs))