Hoogle Search

Within LTS Haskell 24.43 (ghc-9.10.3)

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

  1. genShortByteStringST :: Int -> ST s Word64 -> ST s ShortByteString

    random System.Random.Stateful

    Same as genShortByteStringIO, but runs in ST.

  2. uniformByteStringM :: StatefulGen g m => Int -> g -> m ByteString

    random System.Random.Stateful

    Generates a pseudo-random ByteString of the specified size.

  3. uniformShortByteString :: StatefulGen g m => Int -> g -> m ShortByteString

    random System.Random.Stateful

    uniformShortByteString n g generates a ShortByteString of length n filled with pseudo-random bytes.

  4. fromByteString :: ByteString -> Builder

    binary Data.Binary.Builder

    O(1). A Builder taking a ByteString, satisfying

  5. fromLazyByteString :: ByteString -> Builder

    binary Data.Binary.Builder

    O(1). A Builder taking a lazy ByteString, satisfying

  6. fromShortByteString :: ShortByteString -> Builder

    binary Data.Binary.Builder

    O(n). A builder taking ShortByteString and copy it to a Builder, satisfying

  7. toLazyByteString :: Builder -> LazyByteString

    binary Data.Binary.Builder

    Execute a Builder and return the generated chunks as a LazyByteString. The work is performed lazy, i.e., only when a chunk of the LazyByteString is forced.

  8. getByteString :: Int -> Get ByteString

    binary Data.Binary.Get

    An efficient get method for strict ByteStrings. Fails if fewer than n bytes are left in the input. If n <= 0 then the empty string is returned.

  9. getLazyByteString :: Int64 -> Get ByteString

    binary Data.Binary.Get

    An efficient get method for lazy ByteStrings. Fails if fewer than n bytes are left in the input.

  10. getLazyByteStringNul :: Get ByteString

    binary Data.Binary.Get

    Get a lazy ByteString that is terminated with a NUL byte. The returned string does not contain the NUL byte. Fails if it reaches the end of input without finding a NUL.

Page 31 of many | Previous | Next