String-

package string-class
package
String class library Version 0.1.5.1
package string-combinators
package
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.4
package string-conversions
package
Provides a simple type class for converting values of different string types into values of other string types. Version 0.3.0.1
package string-qq
package
QuasiQuoter for non-interpolated strings, texts and bytestrings. Version 0.0.2
package string-quote
package
QuasiQuoter for non-interpolated strings, texts and bytestrings. Version 0.0.1
package string-similarity
package
algorithms for finding the longest common substring in a set of documents Version 0.1.0.0
package bytestring-builder
package
This is the bytestring builder that is debuting in bytestring-0.10.4.0, which should be shipping with GHC 7.8, probably late in 2013. This builder has several nice simplifications and improvements, and more out-of-box functionality than the older blaze-builder. Note that this package detects which version of bytestring you are compiling against,  and if you are compiling against bytestring-0.10.4 or later, will be an empty package. This package lets the new interface and implementation be used with most older compilers without upgrading bytestring, which can be rather problematic.  In conjunction with blaze-builder-0.4 or later,  which offers an implementation of blaze-builder in terms of bytestring-builder, this should let most people try the new interface and implementation without causing undue compatibility problems with packages that depend on blaze-builder. GHC 7.6 did debut an almost identical interface and implementation, but with slightly different module names and organization.   Trying to re-export/rename the builder provided with 7.6 did not turn out to be very practical,  because this interface includes new functions that rely on Builder internals, which are not exported in 7.6.  Furthermore, these module names should be deprecated in 7.10. Version 0.10.4.0.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-handle
package
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.3
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.6
package bytestring-plain
package
More compact representation for strict ByteStrings avoiding the overhead and indirection caused by ForeignPtr. This representation is useful to reduce the incurred memory overhead when operating with many small, long-lived, distinct byte strings (such as keys for containers). See documentation in Data.ByteString.Plain for more details about this representation. As an alternative, recent `bytestring` versions provide Data.ByteString.Short which has a similiar overhead but uses unpinned memory instead (and thus requires an additional string data copy in contrast to Data.ByteString.Plain which allows to share the string data with the associated Data.ByteString value). Version 0.1.0.1
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.3
package bytestring-rematch
package
package bytestring-show
package
Efficient conversion of values into readable byte strings. Version 0.3.5.5
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 compact-string-fix
package
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

Show more results