Hoogle Search

Within LTS Haskell 24.27 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. showDeriver :: Deriver

    domain Domain

    Derives Show. Requires to have the StandaloneDeriving compiler extension enabled.

  2. stdDeriver :: Deriver

    domain Domain

    Combination of all derivers exported by this module.

  3. typeableDeriver :: Deriver

    domain Domain

    Derives Typeable. Requires to have the StandaloneDeriving and DeriveDataTypeable compiler extensions enabled.

  4. reallyDeriveCascading :: Name -> (Name -> DecsQ) -> Name -> DecsQ

    express Data.Express.Utils.TH

    No documentation available.

  5. defineHasPrimaryConstraintInstanceDerived :: TypeQ -> Q [Dec]

    persistable-record Database.Record.TH

    Template of HasKeyConstraint instance.

  6. defaultDeriveOptions :: DeriveOptions

    avro Data.Avro.Deriving

    Default deriving options 

    defaultDeriveOptions = DeriveOptions
{ fieldNameBuilder  = mkPrefixedFieldName
, fieldStrictness   = mkLazyField
, namespaceBehavior = IgnoreNamespaces
}

  7. type CanDeriveApplicativeB (b :: k -> Type -> Type) (f :: k -> Type) (g :: k -> Type) = (GenericP 0 b f, GenericP 0 b g, GenericP 0 b Product f g, GApplicative 0 f g RepP 0 b f RepP 0 b g RepP 0 b Product f g)

    barbies Barbies.Internal

    CanDeriveApplicativeB B f g is in practice a predicate about B only. Intuitively, it says that the following holds, for any arbitrary f:

    • There is an instance of Generic (B f).
    • B has only one constructor (that is, it is not a sum-type).
    • Every field of B f is either a monoid, or of the form f a, for some type a.

  8. type CanDeriveApplicativeT (t :: k -> Type -> k1 -> Type) (f :: k -> Type) (g :: k -> Type) (x :: k1) = (GenericP 1 t f x, GenericP 1 t g x, GenericP 1 t Product f g x, GApplicative 1 f g RepP 1 t f x RepP 1 t g x RepP 1 t Product f g x)

    barbies Barbies.Internal

    CanDeriveApplicativeT T f g x is in practice a predicate about T only. Intuitively, it says that the following holds, for any arbitrary f:

    • There is an instance of Generic (T f).
    • T has only one constructor (that is, it is not a sum-type).
    • Every field of T f x is either a monoid, or of the form f a, for some type a.

  9. type CanDeriveBareB (b :: Type -> Type -> Type -> Type) = (GenericP 0 b Bare Identity, GenericP 0 b Covered Identity, GBare 0 RepP 0 b Covered Identity RepP 0 b Bare Identity)

    barbies Barbies.Internal

    All types that admit a generic FunctorB instance, and have all their occurrences of f under a Wear admit a generic BareB instance.

  10. type CanDeriveConstraintsB (c :: k -> Constraint) (b :: k -> Type -> Type) (f :: k -> Type) = (GenericN b f, GenericN b Product Dict c f, AllB c b ~ GAll 0 c GAllRepB b, GConstraints 0 c f GAllRepB b RepN b f RepN b Product Dict c f)

    barbies Barbies.Internal

    CanDeriveConstraintsB B f g is in practice a predicate about B only. Intuitively, it says that the following holds, for any arbitrary f:

    • There is an instance of Generic (B f).
    • B f can contain fields of type b f as long as there exists a ConstraintsB b instance. In particular, recursive usages of B f are allowed.

Page 94 of many | Previous | Next