Hoogle Search
Within LTS Haskell 24.51 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
arbitraryBoundedEnum :: (Bounded a, Enum a) => Gen amassiv-test Test.Massiv.Utils Generates an element of a bounded enumeration.
chooseEnum :: Enum a => (a, a) -> Gen amassiv-test Test.Massiv.Utils A fast implementation of choose for enumerated types.
coarbitraryEnum :: Enum a => a -> Gen b -> Gen bmassiv-test Test.Massiv.Utils A coarbitrary implementation for enums.
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 []
-
microlens-aeson Lens.Micro.Aeson Traverse into various number types.
_Number :: AsNumber t => Traversal' t Scientificmicrolens-aeson Lens.Micro.Aeson >>> "[1, \"x\"]" ^? nth 0 . _Number Just 1.0
>>> "[1, \"x\"]" ^? nth 1 . _Number Nothing
-
mongoDB Database.MongoDB.Admin An operation indentifier.
PortNumber :: PortNumber -> PortIDmongoDB Database.MongoDB.Connection No documentation available.
-
prelude-compat Prelude2010 Class Enum defines operations on sequentially ordered types. The enumFrom... methods are used in Haskell's translation of arithmetic sequences. Instances of Enum may be derived for any enumeration type (types whose constructors have no fields). The nullary constructors are assumed to be numbered left-to-right by fromEnum from 0 through n-1. See Chapter 10 of the Haskell Report for more details. For any type that is an instance of class Bounded as well as Enum, the following should hold:
- The calls succ maxBound and pred minBound should result in a runtime error.
- fromEnum and toEnum should give a runtime error if the result value is not representable in the result type. For example, toEnum 7 :: Bool is an error.
- enumFrom and enumFromThen should be defined with an implicit bound, thus:
enumFrom x = enumFromTo x maxBound enumFromThen x y = enumFromThenTo x y bound where bound | fromEnum y >= fromEnum x = maxBound | otherwise = minBound
enumFrom :: Enum a => a -> [a]prelude-compat Prelude2010 Used in Haskell's translation of [n..] with [n..] = enumFrom n, a possible implementation being enumFrom n = n : enumFrom (succ n).
Examples
enumFrom 4 :: [Integer] = [4,5,6,7,...]
enumFrom 6 :: [Int] = [6,7,8,9,...,maxBound :: Int]