HORIZON HASKELLDocslts/ghc-9.14.x3e2d5682026-10-11Search names, modules, packages, or :: a typeCtrl K

GHC 9.14.1 · lts/ghc-9.14.x · 3e2d568 · 2026-10-11

Modulecrypton-2.1.7Haskell2010

Crypto.Number.Serialize.LE

Fast serialization primitives for integer (little endian)

  • 4 values
  • Packagecrypton-2.1.7
  • Exports4
  • LanguageHaskell2010
  • LicenceBSD-3-Clause AND MIT AND ISC
  • SourceLE.hs
valuei2osp :: ByteArray ba => Integer -> ba
#

i2osp converts a positive integer into a byte string.

The first byte is LSB (least significant byte); the last byte is the MSB (most significant byte)

valuei2ospOf :: ByteArray ba => Int -> Integer -> Maybe ba
#

Just like i2osp, but takes an extra parameter for size. If the number is too big to fit in len bytes, Nothing is returned otherwise the number is padded with 0 to fit the len required.

valuei2ospOf_ :: ByteArray ba => Int -> Integer -> ba
#

Just like i2ospOf except that it doesn't expect a failure: i.e. an integer larger than the number of output bytes requested.

For example if you just took a modulo of the number that represent the size (example the RSA modulo n).