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


-- | Rage against the quantification
--   
--   Data types and typeclasses to deal with universally and existentially
--   quantified types
@package quantification
@version 0.2

module Data.Monoid.Lifted
class Semigroup1 f
sappend1 :: Semigroup1 f => (a -> a -> a) -> f a -> f a -> f a
instance Data.Monoid.Lifted.Semigroup1 GHC.Base.Maybe
instance (Data.Monoid.Lifted.Semigroup1 f, Data.Monoid.Lifted.Semigroup1 g) => Data.Monoid.Lifted.Semigroup1 (Data.Functor.Compose.Compose f g)


-- | Data types and type classes for working with existentially quantified
--   values. In the event that Quantified Class Constraints ever land in
--   GHC, this package will be considered obsolete. The benefit that most
--   of the typeclasses in this module provide is that they help populate
--   the instances of <a>Exists</a>.
module Data.Exists

-- | Hide a type parameter.
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
class EqForall f
eqForall :: EqForall f => f a -> f a -> Bool
class EqForall f => EqForallPoly f where eqForallPoly = defaultEqForallPoly
eqForallPoly :: EqForallPoly f => f a -> f b -> Bool
eqForallPoly :: (EqForallPoly f, TestEquality f) => f a -> f b -> Bool
class EqForall f => OrdForall f
compareForall :: OrdForall f => f a -> f a -> Ordering
class (OrdForall f, EqForallPoly f) => OrdForallPoly f where compareForallPoly = defaultCompareForallPoly
compareForallPoly :: OrdForallPoly f => f a -> f b -> Ordering
compareForallPoly :: (OrdForallPoly f, TestEquality f) => f a -> f b -> Ordering
class ShowForall f
showsPrecForall :: ShowForall f => Int -> f a -> ShowS
class ReadForall f
readPrecForall :: ReadForall f => ReadPrec (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 SemigroupForall f
sappendForall :: SemigroupForall f => f a -> f a -> f a
class SemigroupForall f => MonoidForall f
memptyForall :: MonoidForall f => Sing a -> f a
class HashableForall f
hashWithSaltForall :: HashableForall f => Int -> f a -> Int
class PathPieceForall f
fromPathPieceForall :: PathPieceForall f => Text -> Maybe (Exists f)
toPathPieceForall :: PathPieceForall f => f a -> Text
class FromJSONForall f
parseJSONForall :: FromJSONForall f => Sing a -> Value -> Parser (f a)
class FromJSONExists f
parseJSONExists :: FromJSONExists f => Value -> Parser (Exists f)
class ToJSONForall f
toJSONForall :: ToJSONForall f => f a -> Value
class ToJSONKeyForall f
toJSONKeyForall :: ToJSONKeyForall f => ToJSONKeyFunctionForall f
class FromJSONKeyExists f
fromJSONKeyExists :: FromJSONKeyExists f => FromJSONKeyFunction (Exists f)
class StorableForall (f :: k -> *)
peekForall :: StorableForall f => Sing a -> Ptr (f a) -> IO (f a)
pokeForall :: StorableForall f => Ptr (f a) -> f a -> IO ()
sizeOfFunctorForall :: StorableForall f => f a -> Int
sizeOfForall :: forall (a :: k). StorableForall f => Proxy f -> Sing a -> Int
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 ShowForall2 f
showsPrecForall2 :: ShowForall2 f => Int -> f a b -> ShowS
data SingList :: [k] -> *
[SingListNil] :: SingList '[]
[SingListCons] :: Sing r -> SingList rs -> SingList (r : rs)
class Reify a
reify :: Reify a => Sing a
class Unreify k
unreify :: forall (a :: k) b. Unreify k => Sing a -> (Reify a => b) -> b
showsForall :: ShowForall f => f a -> ShowS
showForall :: ShowForall f => f a -> String
showsForall2 :: ShowForall2 f => f a b -> ShowS
showForall2 :: ShowForall2 f => f a b -> String
defaultEqForallPoly :: (TestEquality f, EqForall f) => f a -> f b -> Bool
defaultCompareForallPoly :: (TestEquality f, OrdForall f) => f a -> f b -> Ordering
unreifyList :: forall (as :: [k]) b. Unreify k => SingList as -> (Reify as => b) -> b
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.SemigroupForall 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.FromJSONKeyExists f, Data.Exists.FromJSONExists 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 j k (f :: k -> j -> *). Data.Exists.EqForallPoly2 f => GHC.Classes.Eq (Data.Exists.Exists2 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.FromJSONExists 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 j k (f :: k -> j -> *). Data.Exists.ShowForall2 f => GHC.Show.Show (Data.Exists.Exists2 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)
instance forall k (f :: k -> *) (g :: k -> *). (Data.Exists.EqForall f, Data.Exists.EqForall g) => Data.Exists.EqForall (Data.Functor.Product.Product f g)
instance forall k (f :: k -> *) (g :: k -> *). (Data.Exists.EqForallPoly f, Data.Exists.EqForallPoly g) => Data.Exists.EqForallPoly (Data.Functor.Product.Product f g)
instance forall k (f :: k -> *) (g :: k -> *). (Data.Exists.OrdForall f, Data.Exists.OrdForall g) => Data.Exists.OrdForall (Data.Functor.Product.Product f g)
instance forall k (f :: k -> *) (g :: k -> *). (Data.Exists.OrdForallPoly f, Data.Exists.OrdForallPoly g) => Data.Exists.OrdForallPoly (Data.Functor.Product.Product f g)
instance forall k (f :: k -> *) (g :: k -> *). (Data.Exists.ShowForall f, Data.Exists.ShowForall g) => Data.Exists.ShowForall (Data.Functor.Product.Product f g)
instance forall k (f :: * -> *) (g :: k -> *). (Data.Functor.Classes.Eq1 f, Data.Exists.EqForall g) => Data.Exists.EqForall (Data.Functor.Compose.Compose f g)
instance forall k (f :: * -> *) (g :: k -> *). (Data.Functor.Classes.Eq1 f, Data.Exists.EqForallPoly g) => Data.Exists.EqForallPoly (Data.Functor.Compose.Compose f g)
instance forall k (f :: * -> *) (g :: k -> *). (Data.Functor.Classes.Show1 f, Data.Exists.ShowForall g) => Data.Exists.ShowForall (Data.Functor.Compose.Compose f g)
instance forall k (f :: k -> *) (g :: k -> *). (Data.Exists.EqForall f, Data.Exists.EqForall g) => Data.Exists.EqForall (Data.Functor.Sum.Sum f g)
instance forall k (f :: k -> *) (g :: k -> *). (Data.Exists.OrdForall f, Data.Exists.OrdForall g) => Data.Exists.OrdForall (Data.Functor.Sum.Sum f g)
instance Data.Exists.Reify '[]
instance forall a (a1 :: a) (as :: [a]). (Data.Exists.Reify a1, Data.Exists.Reify as) => Data.Exists.Reify (a1 : as)

module Topaz.Rec
data Rec :: (k -> *) -> [k] -> *
[RecNil] :: Rec f '[]
[RecCons] :: f r -> Rec f rs -> Rec f (r : rs)
map :: (forall x. f x -> g x) -> Rec f as -> Rec g as
traverse :: Applicative h => (forall x. f x -> h (g x)) -> Rec f rs -> h (Rec g rs)
traverse_ :: Applicative h => (forall x. f x -> h b) -> Rec f rs -> h ()
zipWith :: (forall x. f x -> g x -> h x) -> Rec f rs -> Rec g rs -> Rec h rs

-- | Map each element of a record to a monoid and combine the results.
foldMap :: forall f m rs. Monoid m => (forall x. f x -> m) -> Rec f rs -> m
foldMap1 :: forall f m r rs. Semigroup m => (forall x. f x -> m) -> Rec f (r : rs) -> m
instance forall k (f :: k -> *). Data.Type.Equality.TestEquality f => Data.Type.Equality.TestEquality (Topaz.Rec.Rec f)
instance forall k (f :: k -> *). Data.Type.Coercion.TestCoercion f => Data.Type.Coercion.TestCoercion (Topaz.Rec.Rec f)
instance forall k (f :: k -> *) (as :: [k]). Data.Exists.EqForall f => GHC.Classes.Eq (Topaz.Rec.Rec f as)
instance forall k (f :: k -> *). Data.Exists.HashableForall f => Data.Exists.HashableForall (Topaz.Rec.Rec f)
instance forall k (f :: k -> *) (as :: [k]). Data.Exists.HashableForall f => Data.Hashable.Class.Hashable (Topaz.Rec.Rec f as)
instance forall k (f :: k -> *). Data.Exists.ShowForall f => Data.Exists.ShowForall (Topaz.Rec.Rec f)
instance forall k (f :: k -> *) (as :: [k]). Data.Exists.ShowForall f => GHC.Show.Show (Topaz.Rec.Rec f as)
instance forall k (f :: k -> *). Data.Exists.EqForall f => Data.Exists.EqForall (Topaz.Rec.Rec f)
instance forall k (f :: k -> *) (as :: [k]). Data.Exists.OrdForall f => GHC.Classes.Ord (Topaz.Rec.Rec f as)
instance forall k (f :: k -> *). Data.Exists.OrdForall f => Data.Exists.OrdForall (Topaz.Rec.Rec f)
instance forall k (f :: k -> *) (as :: [k]). Data.Exists.SemigroupForall f => Data.Semigroup.Semigroup (Topaz.Rec.Rec f as)
instance forall k (f :: k -> *) (as :: [k]). (Data.Exists.MonoidForall f, Data.Exists.Reify as) => GHC.Base.Monoid (Topaz.Rec.Rec f as)
instance forall k (f :: k -> *). Data.Exists.MonoidForall f => Data.Exists.MonoidForall (Topaz.Rec.Rec f)
instance forall k (f :: k -> *). Data.Exists.SemigroupForall f => Data.Exists.SemigroupForall (Topaz.Rec.Rec f)
instance forall k (f :: k -> *) (as :: [k]). Data.Exists.ToJSONForall f => Data.Aeson.Types.ToJSON.ToJSON (Topaz.Rec.Rec f as)
instance forall k (f :: k -> *). Data.Exists.ToJSONForall f => Data.Exists.ToJSONForall (Topaz.Rec.Rec f)
instance forall k (f :: k -> *) (as :: [k]). (Data.Exists.FromJSONForall f, Data.Exists.Reify as) => Data.Aeson.Types.FromJSON.FromJSON (Topaz.Rec.Rec f as)
instance forall k (f :: k -> *). Data.Exists.FromJSONForall f => Data.Exists.FromJSONForall (Topaz.Rec.Rec f)
instance forall k (f :: k -> GHC.Types.*). Data.Exists.StorableForall f => Data.Exists.StorableForall (Topaz.Rec.Rec f)
instance forall k (f :: k -> GHC.Types.*) (as :: [k]). (Data.Exists.StorableForall f, Data.Exists.Reify as) => Foreign.Storable.Storable (Topaz.Rec.Rec f as)
instance forall k (f :: k -> GHC.Types.*). Data.Exists.FromJSONExists f => Data.Exists.FromJSONExists (Topaz.Rec.Rec f)