Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

Exact lookup

1. chooseEnum :: Enum a => (a, a) -> Gen a

   massiv-test	Test.Massiv.Utils

   A fast implementation of choose for enumerated types.

2. coarbitraryEnum :: Enum a => a -> Gen b -> Gen b

   massiv-test	Test.Massiv.Utils

   A coarbitrary implementation for enums.

3. shrinkBoundedEnum :: (Bounded a, Enum a, Eq a) => a -> [a]

   massiv-test	Test.Massiv.Utils

   Shrink an element of a bounded enumeration.

   Example

   data MyEnum = E0 | E1 | E2 | E3 | E4 | E5 | E6 | E7 | E8 | E9
   deriving (Bounded, Enum, Eq, Ord, Show)
   

   >>> shrinkBoundedEnum E9
   [E0,E5,E7,E8]
   

   >>> shrinkBoundedEnum E5
   [E0,E3,E4]
   

   >>> shrinkBoundedEnum E0
   []
   

4. fromEnum :: Enum a => a -> Int

   prelude-compat	Prelude2010

   Convert to an Int. It is implementation-dependent what fromEnum returns when applied to a value that is too large to fit in an Int.

5. toEnum :: Enum a => Int -> a

   prelude-compat	Prelude2010

   Convert from an Int.

6. casesEnum :: (Bounded a, Enum a) => Cases a

   rebase	Rebase.Prelude

   The list of all possible values of an enumerable data type.

7. fromEnum :: Enum a => a -> Int

   rebase	Rebase.Prelude

   Convert to an Int. It is implementation-dependent what fromEnum returns when applied to a value that is too large to fit in an Int.

8. toEnum :: Enum a => Int -> a

   rebase	Rebase.Prelude

   Convert from an Int.

9. parseNumber :: (Exit m, Read a) => String -> (a -> Bool) -> String -> String -> m a

   shell-utility	Shell.Utility.ParseArgument

   No documentation available.

10. integrateNum :: (C a, C a v) => Int -> (a, a) -> (a -> v) -> v

    synthesizer-core	Synthesizer.Plain.Filter.Recursive.AllpassPoly

    No documentation available.

Page 159 of many | Previous | Next