superbuffer
Efficiently build a bytestring from smaller chunks
https://github.com/agrafix/superbuffer#readme
| LTS Haskell 22.44: | 0.3.1.2 |
| Stackage Nightly 2023-12-26: | 0.3.1.2 |
| Latest on Hackage: | 0.3.1.2 |
Maintained by [email protected]
This version can be pinned in stack with:
superbuffer-0.3.1.2@sha256:c2b284771df6fce69505582c3c8d705d18d30d1e7541e0e8cc4b060407a2fac9,1793Module documentation for 0.3.1.2
- Data
- Data.ByteString
Depends on 2 packages(full list with versions):
Used by 1 package in lts-20.25(full list with versions):
Haskell SuperBuffer
The superbuffer packages was designed to efficiently build up bytestrings from IO actions producing
smaller chunks. The goal was to reduce memory overhead as much as possible while still being as fast as possible.
In our use case, it reduced total memory usage of the program from 350 MB (bytestring builder) to 50 MB (superbuffer).
For speed see benchmarks below. Note that the speed heavily depends on a good choice of the initial buffer size. superbuffer outperforms or performs similar to the bytestring alternatives consistently. superbuffer outperforms buffer-builder.
Usage
{-# LANGUAGE OverloadedStrings #-}
module Example where
import Data.ByteString.SuperBuffer
import qualified Data.ByteString as BS
myBS :: IO BS.ByteString
myBS =
-- note: performance of superbuffer heavily depends on a
-- smart choice of the initial buffer size. Benchmark to
-- find what suits your needs.
withBuffer 1024 $ \buf ->
do appendBuffer buf "Hello "
appendBuffer buf "World!"