Hoogle Search
Within LTS Haskell 24.36 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
primMapListBounded :: BoundedPrim a -> [a] -> Builderbytestring Data.ByteString.Builder.Prim Create a Builder that encodes a list of values consecutively using a BoundedPrim for each element. This function is more efficient than
mconcat . map (primBounded w)
orfoldMap (primBounded w)
because it moves several variables out of the inner loop.primUnfoldrBounded :: BoundedPrim b -> (a -> Maybe (b, a)) -> a -> Builderbytestring Data.ByteString.Builder.Prim Create a Builder that encodes a sequence generated from a seed value using a BoundedPrim for each sequence element.
liftFixedToBounded :: FixedPrim a -> BoundedPrim abytestring Data.ByteString.Builder.Prim.Internal Lift a FixedPrim to a BoundedPrim.
arbitraryBoundedEnum :: (Bounded a, Enum a) => Gen aQuickCheck Test.QuickCheck Generates an element of a bounded enumeration.
arbitraryBoundedIntegral :: (Bounded a, Integral a) => Gen aQuickCheck Test.QuickCheck Generates an integral number. The number is chosen uniformly from the entire range of the type. You may want to use arbitrarySizedBoundedIntegral instead.
arbitraryBoundedRandom :: (Bounded a, Random a) => Gen aQuickCheck Test.QuickCheck Generates an element of a bounded type. The element is chosen from the entire range of the type.
arbitrarySizedBoundedIntegral :: (Bounded a, Integral a) => Gen aQuickCheck Test.QuickCheck Generates an integral number from a bounded domain. The number is chosen from the entire range of the type, but small numbers are generated more often than big numbers. Inspired by demands from Phil Wadler.
chooseBoundedIntegral :: (Bounded a, Integral a) => (a, a) -> Gen aQuickCheck Test.QuickCheck A fast implementation of choose for bounded integral types.
functionBoundedEnum :: (Eq a, Bounded a, Enum a) => (a -> b) -> a :-> bQuickCheck Test.QuickCheck Provides a Function instance for types with Bounded and Enum. Use only for small types (i.e. not integers): creates the list [minBound..maxBound]!
shrinkBoundedEnum :: (Bounded a, Enum a, Eq a) => a -> [a]QuickCheck Test.QuickCheck 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 []