String +package
String class library
Version 0.1.5.1
string-combinators provides handy polymorphic functions to build and combine string-like values.
All functions are polymorphic in their string-like type but usually have a Monoid or IsString constraint.
Version 0.6.0.3
Provides a simple type class for converting values of different string types into values of other string types.
Version 0.2
QuasiQuoter for non-interpolated strings, texts and bytestrings.
Version 0.0.2
QuasiQuoter for non-interpolated strings, texts and bytestrings.
Version 0.0.1
This package provides several functions to quickly search for substrings in strict or lazy ByteStrings. It also provides functions for breaking or splitting on substrings and replacing all occurrences of a substring (the first in case of overlaps) with another. GHC before 6.10 are no longer supported, other compilers only if they support BangPatterns. If you need it to work with other compilers, send a feature request.
Version 0.3.6.3
Memoize Strings as Atoms for fast comparison and sorting, with maps and sets
Version 0.0.6.1
Fast base16 (hex) encoding and decoding for ByteStrings
Version 0.1.1.4
Fast base64 encoding and deconding for ByteStrings
Version 0.1.1.1
This Base64 implementation uses the characters A-Z a-z 0-9 + along with = to signal the number of characters mod 3. It is compliant with both PEM (RFC 989 RFC 1421) and MIME (RFC 2045).
Version 0.2
Lazy bit strings, built on the top of bytestrings.
Version 0.0.0
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
In theory, this allows the design of more data-agnostic APIs.
Version 0.0.0
Parse CSV formatted data efficiently
Version 0.1.2
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
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
Parse numeric literals from ByteStrings.
Version 0.3.5
Show more results