bytesmith

Nonresumable byte parser

https://github.com/andrewthad/bytesmith

Version on this page:0.3.0.0
LTS Haskell 22.18:0.3.11.1
Stackage Nightly 2024-04-22:0.3.11.1
Latest on Hackage:0.3.11.1

See all snapshots bytesmith appears in

BSD-3-Clause licensed by Andrew Martin
Maintained by [email protected]
This version can be pinned in stack with:bytesmith-0.3.0.0@sha256:9cdbd3ecca3afae792f722f1e0c3261877d9c0ef3b09ce8ea229933e41fe2182,1652

Module documentation for 0.3.0.0

Used by 1 package in nightly-2019-11-11(full list with versions):
ip

Parse bytes as fast as possible. This is a nonresumable parser that aggresively uses UnboxedSums to avoid performing any allocations.

Changes

Revision history for bytesmith

0.3.0.0 – 2019-??-??

  • Include the offset into the byte sequence in Result. Breaking change.
  • Rename hexWord16 to hexFixedWord16. Breaking change.
  • Rename parseBytesST to parseBytesEffectfully. Breaking change.
  • Add hexNibbleLower and tryHexNibbleLower.
  • Add hexNibble and tryHexNibble.

0.2.0.1 – 2019-09-24

  • Correct an overflow-detection mistake in the implementation of machine-word parsers.

0.2.0.0 – 2019-09-24

  • Add big-endian word parsers.
  • Redo module structure so that encoding-specific functions each live in their own module.
  • Add a lot more functions and attempt to make naming somewhat consistent.
  • Add delimit.
  • Add replicate.
  • Add annotate and its infix synonym <?>.

0.1.0.0 – 2019-08-22

  • First version.