HORIZON HASKELLDocslts/ghc-10.0.x2b276322026-10-31Search packagesCtrl K
Theme: |

GHC 10.0.0.20260917 · lts/ghc-10.0.x · 2b27632 · 2026-10-31

Modulememory-0.18.0Haskell2010

Data.ByteArray.Pack

Simple Byte Array packer

Simple example:

> flip pack 20 $ putWord8 0x41 >> putByteString "BCD" >> putWord8 0x20 >> putStorable (42 :: Word32)
Right (ABCD *\NUL\NUL\NUL")

Original code from https://hackage.haskell.org/package/bspack generalized and adapted to run on memory, and spellchecked / tweaked. (2015-05) Copyright (c) 2014 Nicolas DI PRIMA

Contents
  1. Operations
  2. put
  3. skip
Synopsis
  • Packagememory-0.18.0
  • Exports13
  • LanguageHaskell2010
  • LicenceBSD-3-Clause
  • SourcePack.hs
newtypenewtype Packer a

Simple ByteArray Packer

Instances3Monad, Functor, Applicative
  • Monad PackerDefined in memory-0.18.0 · Data.ByteArray.Pack.Internal
  • Functor PackerDefined in memory-0.18.0 · Data.ByteArray.Pack.Internal
  • Applicative PackerDefined in memory-0.18.0 · Data.ByteArray.Pack.Internal

Operations

put

valuefillList :: Storable storable => [storable] -> Packer ()

Will put the given storable list from the current position in the stream to the end.

This function will fail with not enough storage if the given storable can't be written (not enough space)

Example:

> pack (fillList $ [1..] :: Word8) 9
"\1\2\3\4\5\6\7\8\9"
> pack (fillList $ [1..] :: Word32) 4
"\1\0\0\0"
> pack (fillList $ [1..] :: Word32) 64
.. <..succesful..>
> pack (fillList $ [1..] :: Word32) 1
.. <.. not enough space ..>
> pack (fillList $ [1..] :: Word32) 131
.. <.. not enough space ..>
valuefillUpWith :: Storable storable => storable -> Packer ()

Fill up from the current position in the stream to the end

It is equivalent to:

fillUpWith s == fillList (repeat s)

skip