Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. deriveMutableE :: [Name] -> Name -> DecsQ

   fitspec	Test.FitSpec.Derive

   Derives a Mutable instance for a given type Name using a given context for all type variables.

2. deriveCoSinkable :: Name -> Name -> Q [Dec]

   free-foil	Control.Monad.Foil.TH.MkInstancesFoil

   Generate Sinkable and CoSinkable instances.

3. deriveUnifiablePattern :: Name -> Name -> Q [Dec]

   free-foil	Control.Monad.Foil.TH.MkInstancesFoil

   Generate Sinkable and CoSinkable instances.

4. deriveZipMatch :: Name -> Q [Dec]

   free-foil	Control.Monad.Free.Foil.TH.ZipMatch

   Generate ZipMatch instance for a given bifunctor.

5. deriveFromGraphQL :: Name -> Q [Dec]

   graphql-spice	Language.GraphQL.Class

   Given a type derives a FromGraphQL instance for it. The derivation can only work when all nested types already have FromGraphQL instances. The following cases are supported:

   • Records encode input objects.
   • Sum types with all data constructors without parameters encode Enums.

6. deriveToGraphQL :: Name -> Q [Dec]

   graphql-spice	Language.GraphQL.Class

   Given a type derives a ToGraphQL instance for it. The derivation can only work when all nested types already have ToGraphQL instances. The following cases are supported:

   • Records are decoded as objects.
   • Sum types with all data constructors without parameters are decoded as Enums.
   • Sum types whose data constructors have exactly one parameter are decoded as Unions.

7. derivedNoSpecFresh :: (Generic a, GenSymNoSpec (Rep a), Mergeable a, MonadFresh m) => () -> m (Union a)

   grisette	Grisette.Core

   We cannot provide DerivingVia style derivation for GenSym, while you can use this fresh implementation to implement GenSym for your own types. This fresh implementation is for the types that does not need any specification. It will generate product types by generating each fields with () as specification, and generate all possible values for a sum type. Note: Never use on recursive types.

8. derivedNoSpecSimpleFresh :: (Generic a, GenSymSimpleNoSpec (Rep a), MonadFresh m) => () -> m a

   grisette	Grisette.Core

   We cannot provide DerivingVia style derivation for GenSymSimple, while you can use this simpleFresh implementation to implement GenSymSimple fo your own types. This simpleFresh implementation is for the types that does not need any specification. It will generate product types by generating each fields with () as specification. It will not work on sum types. Note: Never use on recursive types.

9. derivedSameShapeSimpleFresh :: (Generic a, GenSymSameShape (Rep a), MonadFresh m) => a -> m a

   grisette	Grisette.Core

   We cannot provide DerivingVia style derivation for GenSymSimple, while you can use this simpleFresh implementation to implement GenSymSimple fo your own types. This simpleFresh implementation is for the types that can be generated with a reference value of the same type. For sum types, it will generate the result with the same data constructor. For product types, it will generate the result by generating each field with the corresponding reference value. Note: Can be used on recursive types.

10. derivedFreshConstrainedNoSpec :: (Generic a, GenSymConstrainedNoSpec (Rep a), Mergeable a, MonadFresh m, MonadError e m, MonadUnion m) => e -> () -> m (Union a)

    grisette	Grisette.Experimental

    We cannot provide DerivingVia style derivation for GenSymConstrained, while you can use this freshConstrained implementation to implement GenSymConstrained for your own types. This freshConstrained implementation is for the types that does not need any specification. It will generate product types by generating each fields with () as specification, and generate all possible values for a sum type. Note: Never use on recursive types.

Page 40 of many | Previous | Next