Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. primMapLazyByteStringBounded :: BoundedPrim Word8 -> LazyByteString -> Builder

    bytestring Data.ByteString.Builder.Prim

    Chunk-wise application of primMapByteStringBounded.

  2. primMapListBounded :: BoundedPrim a -> [a] -> Builder

    bytestring 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)
    
    or
    foldMap (primBounded w)
    
    because it moves several variables out of the inner loop.

  3. primUnfoldrBounded :: BoundedPrim b -> (a -> Maybe (b, a)) -> a -> Builder

    bytestring Data.ByteString.Builder.Prim

    Create a Builder that encodes a sequence generated from a seed value using a BoundedPrim for each sequence element.

  4. liftFixedToBounded :: FixedPrim a -> BoundedPrim a

    bytestring Data.ByteString.Builder.Prim.Internal

    Lift a FixedPrim to a BoundedPrim.

  5. arbitraryBoundedEnum :: (Bounded a, Enum a) => Gen a

    QuickCheck Test.QuickCheck

    Generates an element of a bounded enumeration.

  6. arbitraryBoundedIntegral :: (Bounded a, Integral a) => Gen a

    QuickCheck 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.

  7. arbitraryBoundedRandom :: (Bounded a, Random a) => Gen a

    QuickCheck Test.QuickCheck

    Generates an element of a bounded type. The element is chosen from the entire range of the type.

  8. arbitrarySizedBoundedIntegral :: (Bounded a, Integral a) => Gen a

    QuickCheck 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.

  9. chooseBoundedIntegral :: (Bounded a, Integral a) => (a, a) -> Gen a

    QuickCheck Test.QuickCheck

    A fast implementation of choose for bounded integral types.

  10. functionBoundedEnum :: (Eq a, Bounded a, Enum a) => (a -> b) -> a :-> b

    QuickCheck 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]!

Page 17 of many | Previous | Next