Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Hiding existentials
Synopsis
- data Some f = forall a. Some (f a)
- data DictEq a where
- class SomeEq f where
- data DictShow a where
- class SomeShow f where
- data DictPretty a where
- DictPretty :: Pretty a => DictPretty a
- class SomePretty f where
- somePretty :: DictPretty (f a)
- typecheckSome :: Typed f => Some f -> Some (TypeOf f) -> Bool
Documentation
forall a. Some (f a) |
Instances
ReportSchemaErrors m => FromJSON m (Some Key) Source # | |
ReportSchemaErrors m => FromJSON m (Some KeyType) Source # | |
ReportSchemaErrors m => FromJSON m (Some PublicKey) Source # | |
Monad m => ToJSON m (Some Key) Source # | |
Monad m => ToJSON m (Some KeyType) Source # | |
Monad m => ToJSON m (Some PublicKey) Source # | |
SomeShow f => Show (Some f) Source # | |
(Typed f, SomeEq f) => Eq (Some f) Source # | |
SomePretty f => Pretty (Some f) Source # | |
Equality
Type f
satisfies SomeEq f
if f a
satisfies Eq
independent of a
Serialization
class SomeShow f where Source #
Type f
satisfies SomeShow f
if f a
satisfies Show
independent of a
Pretty-printing
data DictPretty a where Source #
DictPretty :: Pretty a => DictPretty a |
class SomePretty f where Source #
Type f
satisfies SomeShow f
if f a
satisfies Show
independent of a
somePretty :: DictPretty (f a) Source #
Instances
SomePretty IndexFile Source # | |
Defined in Hackage.Security.TUF.Layout.Index somePretty :: DictPretty (IndexFile a) Source # |