homepage: https://github.com/nikita-volkov/bytestring-tree-builder
changelog-type: ''
hash: 93c480b52484949f7caa79f550ed869a6f31fc1a9fc0da76ae42a20dc5a9056e
test-bench-deps:
  bytestring: -any
  tasty-smallcheck: ==0.8.*
  base-prelude: -any
  criterion: ==1.1.*
  quickcheck-instances: ! '>=0.3.11 && <0.4'
  tasty-quickcheck: ==0.8.*
  bytestring-tree-builder: -any
  tasty-hunit: ==0.9.*
  tasty: ==0.11.*
  deepseq: ==1.*
  QuickCheck: ! '>=2.8.1 && <2.9'
maintainer: Nikita Volkov <nikita.y.volkov@mail.ru>
synopsis: A very efficient ByteString builder implementation based on the binary tree
changelog: ''
basic-deps:
  bytestring: ! '>=0.10 && <0.11'
  base-prelude: ! '>=0.1.19 && <0.2'
  base: ! '>=4.6 && <5'
all-versions:
- '0.2.1.1'
author: Nikita Volkov <nikita.y.volkov@mail.ru>
latest: '0.2.1.1'
description-type: haddock
description: ! 'According to

  <https://github.com/nikita-volkov/bytestring-builders-benchmark benchmarks>

  this builder implementation beats all the alternative implementations.

  It is especially well-suited for producing strict bytestrings,

  beating the standard builder by at least the factor of 4.'
license-name: MIT

Update from Hackage at 2015-12-05T16:36:05+0000
Update from Hackage at 2015-12-05T16:36:05+0000
