ByteString +Data.ByteString.Lazy

data ByteString
bytestring Data.ByteString, bytestring Data.ByteString.Char8, bytestring Data.ByteString.Lazy, bytestring Data.ByteString.Lazy.Char8
A space-efficient representation of a Word8 vector, supporting many efficient operations. A ByteString contains 8-bit characters only. Instances of Eq, Ord, Read, Show, Data, Typeable
package bytestring
package
A time and space-efficient implementation of byte vectors using packed Word8 arrays, suitable for high performance use, both in terms of large data quantities, or high speed requirements. Byte vectors are encoded as strict Word8 arrays of bytes, and lazy lists of strict chunks, held in a ForeignPtr, and can be passed between C and Haskell with little effort. Test coverage data for this library is available at: http://code.haskell.org/~dons/tests/bytestring/hpc_index.html Version 0.9.2.1
package bytestring-class
package
In theory, this allows the design of more data-agnostic APIs. Version 0.0.0
package bytestring-csv
package
Parse CSV formatted data efficiently Version 0.1.2
package bytestring-delta
package
Compute a patch between two ByteStrings which can later be applied to the first to produce the second.  This can be used to save bandwidth and disk space when many strings differing by a small number of bytes need to be transmitted or stored. The underlying implementation is written in C, and can also be found at http://ccodearchive.net/info/bdelta.html. Currently, a patch does not save any space when two strings differ by more than 1000 bytes.  This arbitrary limit serves to keep applications from spiking in memory and CPU usage, as the algorithm uses quadratic space and time with respect to the length of the patch.  A better algorithm may be introduced in a future version of bytestring-delta. Version 0.1.0.1
package bytestring-lexing
package
Parse and produce literals efficiently from strict or lazy bytestrings. Some benchmarks for this package can be found at: http://community.haskell.org/~wren/bytestring-lexing/test/bench/html Version 0.4.0
package bytestring-mmap
package
This library provides a wrapper to mmap(2), allowing files or devices to be lazily loaded into memory as strict or lazy ByteStrings, using the virtual memory subsystem to do on-demand loading. Version 0.2.2
package bytestring-nums
package
Parse numeric literals from ByteStrings. Version 0.3.5
package bytestring-progress
package
In some cases, it is useful to know how fast a ByteString is being consumed. Typically, this could be to report some measure of progress to a waiting user, but it could also be to perform some form of testing on input / consumption code. Version 1.0.2.1
package bytestring-show
package
Efficient conversion of values into readable byte strings. Version 0.3.5.1
package bytestring-trie
package
An efficient finite map from (byte)strings to values. The implementation is based on big-endian patricia trees, like Data.IntMap. We first trie on the elements of Data.ByteString and then trie on the big-endian bit representation of those elements. Patricia trees have efficient algorithms for union and other merging operations, but they're also quick for lookups and insertions. If you are only interested in being able to associate strings to values, then you may prefer the hashmap package which is faster for those only needing a map-like structure. This package is intended for those who need the extra capabilities that a trie-like structure can offer (e.g., structure sharing to reduce memory costs for highly redundant keys, taking the submap of all keys with a given prefix, contextual mapping, extracting the minimum and maximum keys, etc.) Version 0.2.3
package bytestringparser
package
package bytestringparser-temporary
package
AttoParsec with a small patch so I can get on with my parser. Version 0.4.1
package bytestringreadp
package
This is a library of parser combinators, originally written by Koen Claessen. It parses all alternatives in parallel, so it never keeps hold of the beginning of the input string, a common source of space leaks with other parsers.  The '(+++)' choice combinator is genuinely commutative; it makes no difference which branch is "shorter". Adapted to use Data.ByteString by Gracjan Polak. Designed as a drop-in replacement for Text.ParserCombinators.ReadP. Version 0.2
package base16-bytestring
package
Fast base16 (hex) encoding and decoding for ByteStrings Version 0.1.1.4
package base64-bytestring
package
Fast base64 encoding and deconding for ByteStrings Version 0.1.1.1
package explicit-iomodes-bytestring
package
Extends explicit-iomodes with ByteString operations Version 0.2.0.1
package network-bytestring
package
Fast, memory-efficient, low-level socket functions that use Data.ByteStrings instead of Strings. Version 0.1.3.4
package NumLazyByteString
package
Num, Enum, Eq, Integral, Ord, Real, and Show instances for Lazy ByteStrings Version 0.0.0.1
package repa-bytestring
package
(deprecated) Version 3.0.0.1

Show more results