Traverse a strict ByteString in a relatively balanced fashion, as a balanced tree with biased runs of elements at the leaves.
Modulelens-5.3.6Haskell2010
Control.Lens.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
- Packagelens-5.3.6
- Exports4
- LanguageHaskell2010
- LicenceBSD-2-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 IndexedTraversal of the individual bytes in a lazy ByteString
An IndexedTraversal of the individual bytes in a lazy ByteString pretending the bytes are chars.