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


-- | Data types and typeclasses to deal with universally and existentially quantified types
--   
--   Please see README.md
@package quantification
@version 0.1

module Data.Exists
data Exists (f :: k -> *)
Exists :: !(f a) -> Exists
data Exists2 (f :: k -> j -> *)
Exists2 :: !(f a b) -> Exists2
data Exists3 (f :: k -> j -> l -> *)
Exists3 :: !(f a b c) -> Exists3
data ToJSONKeyFunctionForall f
ToJSONKeyTextForall :: !(forall a. f a -> Text) -> !(forall a. f a -> Encoding' Text) -> ToJSONKeyFunctionForall f
ToJSONKeyValueForall :: !(forall a. f a -> Value) -> !(forall a. f a -> Encoding) -> ToJSONKeyFunctionForall f
class EqForall f
eqForall :: EqForall f => f a -> f a -> Bool
class EqForall f => OrdForall f
compareForall :: OrdForall f => f a -> f a -> Ordering
class EqForall f => EqForallPoly f
eqForallPoly :: EqForallPoly f => f a -> f b -> Bool
class (OrdForall f, EqForallPoly f) => OrdForallPoly f
compareForallPoly :: OrdForallPoly f => f a -> f b -> Ordering
class ShowForall f
showsPrecForall :: ShowForall f => Int -> f a -> ShowS
showsForall :: ShowForall f => f a -> ShowS
showForall :: ShowForall f => f a -> String
class ReadForall f
readPrecForall :: ReadForall f => ReadPrec (Exists f)
class EqForall2 f
eqForall2 :: EqForall2 f => f a b -> f a b -> Bool
class EqForallPoly2 f
eqForallPoly2 :: EqForallPoly2 f => f a b -> f c d -> Bool
class HashableForall f
hashWithSaltForall :: HashableForall f => Int -> f a -> Int
class ToJSONKeyForall f
toJSONKeyForall :: ToJSONKeyForall f => ToJSONKeyFunctionForall f
class FromJSONKeyForall f
fromJSONKeyForall :: FromJSONKeyForall f => FromJSONKeyFunction (Exists f)
class ToJSONForall f
toJSONForall :: ToJSONForall f => f a -> Value
class FromJSONForall f
parseJSONForall :: FromJSONForall f => Value -> Parser (Exists f)
class EnumForall f
toEnumForall :: EnumForall f => Int -> Exists f
fromEnumForall :: EnumForall f => f a -> Int
class BoundedForall f
minBoundForall :: BoundedForall f => Exists f
maxBoundForall :: BoundedForall f => Exists f
class PathPieceForall f
fromPathPieceForall :: PathPieceForall f => Text -> Maybe (Exists f)
toPathPieceForall :: PathPieceForall f => f a -> Text
class MonoidForall f
memptyForall :: MonoidForall f => f a
mappendForall :: MonoidForall f => f a -> f a -> f a
instance Data.Exists.EqForall Data.Proxy.Proxy
instance Data.Exists.OrdForall Data.Proxy.Proxy
instance Data.Exists.ShowForall Data.Proxy.Proxy
instance Data.Exists.ReadForall Data.Proxy.Proxy
instance Data.Exists.MonoidForall Data.Proxy.Proxy
instance forall k (a :: k). Data.Exists.EqForall ((Data.Type.Equality.:~:) a)
instance Data.Exists.EqForall2 (Data.Type.Equality.:~:)
instance GHC.Classes.Eq a => Data.Exists.EqForall (Data.Functor.Const.Const a)
instance GHC.Classes.Eq a => Data.Exists.EqForallPoly (Data.Functor.Const.Const a)
instance GHC.Classes.Ord a => Data.Exists.OrdForall (Data.Functor.Const.Const a)
instance GHC.Classes.Ord a => Data.Exists.OrdForallPoly (Data.Functor.Const.Const a)
instance Data.Hashable.Class.Hashable a => Data.Exists.HashableForall (Data.Functor.Const.Const a)
instance forall k (f :: k -> *). (Data.Exists.ToJSONKeyForall f, Data.Exists.ToJSONForall f) => Data.Aeson.Types.ToJSON.ToJSONKey (Data.Exists.Exists f)
instance forall k (f :: k -> GHC.Types.*). (Data.Exists.FromJSONKeyForall f, Data.Exists.FromJSONForall f) => Data.Aeson.Types.FromJSON.FromJSONKey (Data.Exists.Exists f)
instance forall k (f :: k -> *). Data.Exists.EqForallPoly f => GHC.Classes.Eq (Data.Exists.Exists f)
instance forall k (f :: k -> *). Data.Exists.OrdForallPoly f => GHC.Classes.Ord (Data.Exists.Exists f)
instance forall k (f :: k -> *). Data.Exists.HashableForall f => Data.Hashable.Class.Hashable (Data.Exists.Exists f)
instance forall k (f :: k -> *). Data.Exists.ToJSONForall f => Data.Aeson.Types.ToJSON.ToJSON (Data.Exists.Exists f)
instance forall k (f :: k -> GHC.Types.*). Data.Exists.FromJSONForall f => Data.Aeson.Types.FromJSON.FromJSON (Data.Exists.Exists f)
instance forall k (f :: k -> *). Data.Exists.ShowForall f => GHC.Show.Show (Data.Exists.Exists f)
instance forall k (f :: k -> GHC.Types.*). Data.Exists.ReadForall f => GHC.Read.Read (Data.Exists.Exists f)
instance forall k (f :: k -> GHC.Types.*). Data.Exists.EnumForall f => GHC.Enum.Enum (Data.Exists.Exists f)
instance forall k (f :: k -> GHC.Types.*). Data.Exists.BoundedForall f => GHC.Enum.Bounded (Data.Exists.Exists f)
instance forall k (f :: k -> GHC.Types.*). Data.Exists.PathPieceForall f => Web.PathPieces.PathPiece (Data.Exists.Exists f)