dstring: Difference strings

[ bsd3, data, library ] [ Propose Tags ]

Difference strings: a data structure for O(1) append on strings. Note that a DString is just a newtype wrapper around a DList Char. The reason we need a new type instead of just a type synonym is that we can have an instance IsString DString without using language extensions (TypeSynonymInstances or FlexibleInstances) so we can write overloaded string literals of type DString.

Modules

[Index]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1, 0.2, 0.3, 0.3.0.1, 0.3.0.2, 0.4, 0.4.0.1, 0.4.0.2, 0.4.0.3, 0.4.0.4
Dependencies base (>=4 && <4.3), base-unicode-symbols (>=0.1.1 && <0.3), dlist (>=0.5 && <0.6), to-string-class (>=0.1.2 && <0.2) [details]
License BSD-3-Clause
Copyright 2009-2010 Bas van Dijk <v.dijk.bas@gmail.com>
Author Bas van Dijk <v.dijk.bas@gmail.com>
Maintainer Bas van Dijk <v.dijk.bas@gmail.com>
Category Data
Source repo head: darcs get http://code.haskell.org/~basvandijk/code/dstring
Uploaded by BasVanDijk at 2010-05-02T20:22:22Z
Distributions
Reverse Dependencies 5 direct, 23 indirect [details]
Downloads 8789 total (13 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]