byte-order

Portable big-endian and little-endian conversions

https://github.com/andrewthad/byte-order

Version on this page:	0.1.2.0
LTS Haskell 22.39:	0.1.3.1
Stackage Nightly 2024-10-31:	0.1.3.1
Latest on Hackage:	0.1.3.1

See all snapshots byte-order appears in

BSD-3-Clause licensed by Andrew Martin

Maintained by [email protected]

This version can be pinned in stack with:byte-order-0.1.2.0@sha256:e0a5de48cfcf8d01535c43a1c1657c2589c1848b9b209288538d1f0f20474336,1207

Module documentation for 0.1.2.0

Data
- Data.Primitive
  - Data.Primitive.ByteArray
    - Data.Primitive.ByteArray.BigEndian
    - Data.Primitive.ByteArray.LittleEndian
System
- System.ByteOrder
  - System.ByteOrder.Class

Depends on 3 packages(full list with versions):

base, primitive, primitive-unaligned

This library provides an interface to portably work with byte arrays whose contents are known to be of a fixed endianness. There are two ways to use this module. See the System.ByteOrder module for more documentation.

Changes

Revision history for byte-order

0.1.2.0 – 2020-01-06

Add a Bytes instance for Word.

0.1.1.0 – YYYY-mm-dd

Add PrimUnaligned instance for Fixed.
Add modules for more convenient interface to reading and writing fixed-endianness elements to byte arrays: Data.Primitive.ByteArray.LittleEndian and Data.Primitive.ByteArray.BigEndian.

0.1.0.0 – 2019-05-29

Initial release.