Copyright | (C) 2012-2016 Edward Kmett |
---|---|
License | BSD-style (see the file LICENSE) |
Maintainer | Edward Kmett <ekmett@gmail.com> |
Stability | experimental |
Portability | non-portable |
Safe Haskell | Trustworthy |
Language | Haskell2010 |
This module spends a lot of time fiddling around with 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.
Documentation
traversedStrictTree :: IndexedTraversal' Int ByteString Word8 Source #
Traverse a strict ByteString
in a relatively balanced fashion, as a balanced tree with biased runs of
elements at the leaves.
traversedStrictTree8 :: IndexedTraversal' Int ByteString Char Source #
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.
traversedLazy :: IndexedTraversal' Int64 ByteString Word8 Source #
An IndexedTraversal
of the individual bytes in a lazy ByteString
traversedLazy8 :: IndexedTraversal' Int64 ByteString Char Source #
An IndexedTraversal
of the individual bytes in a lazy ByteString
pretending the bytes are chars.