Hoogle Search

Within LTS Haskell 24.67 (ghc-9.10.3)

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

  1. class Typeable a => Enumerable a

    testing-feat Test.Feat

    No documentation available.

  2. data Enumerate a

    testing-feat Test.Feat

    A functional enumeration of type t is a partition of t into finite numbered sets. Each part contains values of a certain cost (typically the size of the value).

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

    testing-feat Test.Feat

    No documentation available.

  4. enumerate :: forall (f :: Type -> Type) . (Enumerable a, Typeable f, Sized f) => Shared f a

    testing-feat Test.Feat

    No documentation available.

  5. class Typeable a => Enumerable a

    testing-feat Test.Feat.Class

    No documentation available.

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

    testing-feat Test.Feat.Class

    No documentation available.

  7. enumerate :: forall (f :: Type -> Type) . (Enumerable a, Typeable f, Sized f) => Shared f a

    testing-feat Test.Feat.Class

    No documentation available.

  8. fEnum :: FlexOptions a -> Enumerate a

    testing-feat Test.Feat.Driver

    The base enumeration to use, before applying fProcess.

  9. module Test.Feat.Enumerate

    Basic combinators for building enumerations most users will want to use the type class based combinators in Test.Feat.Class instead.

  10. data Enumerate a

    testing-feat Test.Feat.Enumerate

    A functional enumeration of type t is a partition of t into finite numbered sets. Each part contains values of a certain cost (typically the size of the value).

Page 433 of many | Previous | Next