bytestring
Fast, compact, strict and lazy byte strings with a list interface
https://github.com/haskell/bytestring
| Version on this page: | 0.11.3.1 |
| LTS Haskell 22.41: | 0.11.5.3 |
| Stackage Nightly 2024-11-12: | 0.12.1.0 |
| Latest on Hackage: | 0.12.1.0@rev:1 |
bytestring-0.11.3.1@sha256:0cc97b237df9a34d12de37973ad306391e24b0c262387c4d846bb8d1d65699dd,7339Module documentation for 0.11.3.1
ByteString: Fast, Packed Strings of Bytes
This library provides the Data.ByteString module – strict and lazy
byte arrays manipulable as strings – providing very time/space-efficient
string and IO operations.
For very large data requirements, or constraints on heap size,
Data.ByteString.Lazy is provided, a lazy list of bytestring chunks.
Efficient processing of multi-gigabyte data can be achieved this way.
The library also provides Data.ByteString.Builder for efficient construction
of ByteString values from smaller pieces during binary serialization.
Requirements:
- Cabal 1.10 or greater
- GHC 8.0 or greater
Authors
ByteString was derived from the GHC PackedString library,
originally written by Bryan O’Sullivan, and then by Simon Marlow.
It was adapted and greatly extended for darcs by David Roundy and
others. Don Stewart and Duncan Coutts cleaned up and further extended
the implementation and added the .Lazy code. Simon Meier contributed
the Builder feature.