Safe Haskell | None |
---|---|
Language | Haskell2010 |
Documentation
Exists !(f a) |
BoundedForall k f => Bounded (Exists k f) Source # | |
EnumForall k f => Enum (Exists k f) Source # | |
EqForallPoly k f => Eq (Exists k f) Source # | |
OrdForallPoly k f => Ord (Exists k f) Source # | |
ReadForall k f => Read (Exists k f) Source # | |
ShowForall k f => Show (Exists k f) Source # | |
HashableForall k f => Hashable (Exists k f) Source # | |
ToJSONForall k f => ToJSON (Exists k f) Source # | |
(ToJSONKeyForall k f, ToJSONForall k f) => ToJSONKey (Exists k f) Source # | |
FromJSONForall k f => FromJSON (Exists k f) Source # | |
(FromJSONKeyForall k f, FromJSONForall k f) => FromJSONKey (Exists k f) Source # | |
PathPieceForall k f => PathPiece (Exists k f) Source # | |
data ToJSONKeyFunctionForall f Source #
ToJSONKeyTextForall !(forall a. f a -> Text) !(forall a. f a -> Encoding' Text) | |
ToJSONKeyValueForall !(forall a. f a -> Value) !(forall a. f a -> Encoding) |
class EqForall f => EqForallPoly f where Source #
eqForallPoly :: f a -> f b -> Bool Source #
Eq a => EqForallPoly k (Const k a) Source # | |
class (OrdForall f, EqForallPoly f) => OrdForallPoly f where Source #
compareForallPoly :: f a -> f b -> Ordering Source #
Ord a => OrdForallPoly k (Const k a) Source # | |
class ShowForall f where Source #
showsPrecForall :: Int -> f a -> ShowS Source #
ShowForall k (Proxy k) Source # | |
showsForall :: ShowForall f => f a -> ShowS Source #
showForall :: ShowForall f => f a -> String Source #
class ReadForall f where Source #
readPrecForall :: ReadPrec (Exists f) Source #
ReadForall k (Proxy k) Source # | |
class HashableForall f where Source #
hashWithSaltForall :: Int -> f a -> Int Source #
Hashable a => HashableForall k (Const k a) Source # | |
class ToJSONKeyForall f where Source #
class FromJSONKeyForall f where Source #
class FromJSONForall f where Source #
class EnumForall f where Source #
toEnumForall :: Int -> Exists f Source #
fromEnumForall :: f a -> Int Source #
class BoundedForall f where Source #
minBoundForall :: Exists f Source #
maxBoundForall :: Exists f Source #
class PathPieceForall f where Source #
fromPathPieceForall :: Text -> Maybe (Exists f) Source #
toPathPieceForall :: f a -> Text Source #
class MonoidForall f where Source #
memptyForall :: f a Source #
mappendForall :: f a -> f a -> f a Source #
MonoidForall k (Proxy k) Source # | |