Traverse a strict ByteString in a relatively balanced fashion, as a balanced tree with biased runs of elements at the leaves.
Moduleoptics-extra-0.4.2.1Haskell2010
Optics.Extra.Internal.ByteString
This module spends a lot of time fiddling around with Data.ByteString
internals to work around http://hackage.haskell.org/trac/ghc/ticket/7556 on
older Haskell Platforms and to improve constant and asymptotic factors in our
performance.
Synopsis
- value traversedStrictTree
- value traversedStrictTree8
- value traversedLazy
- value traversedLazy8
- Packageoptics-extra-0.4.2.1
- Exports4
- LanguageHaskell2010
- LicenceBSD-3-Clause
- SourceByteString.hs
Traverse a strict ByteString in a relatively balanced fashion, as a balanced tree with biased runs of elements at the leaves, pretending the bytes are chars.
An IxTraversal of the individual bytes in a lazy ByteString.
An IxTraversal of the individual bytes in a lazy ByteString pretending the bytes are chars.