String-
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
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
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
Efficient conversion of values into readable byte strings.
Version 0.3.5.1
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
Fast, packed, strict strings with a list interface. Based on Data.ByteString. Multiple encodings are supported. This is the same package as compact-string-0.3.1 except for a small fix to work with the new Exception library. Once Twan updates that package, this package will be deprecated.
Version 0.3.2
QuasiQuoter for Perl6-style multi-line interpolated strings with "q", "qq" and "qc" support.
Version 0.9.0
QuasiQuoter for Ruby-style multi-line interpolated strings.
Version 0.2
DO NOT USE THIS. interpolatedstring-qq works now.
Version 0.1.1
Netstrings are a simple way to encode arbitrary binary data, so it can be decoded without requiring sentinel bytes.
Version 0.1.0.1
This library provides the class:
class ToString s where toString :: s -> String
Instances for String, Char and ShowS are provided. For other instances see the package:
http://hackage.haskell.org/package/to-string-instances
Also included is a general coercion function between string-like types:
fromToString :: (IsString s2, ToString s1) => s1 -> s2
fromToString = fromString . toString
Version 0.1.2
Show more results