string-combinators: Polymorphic functions to build and combine string-like values
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.
Downloads
- string-combinators-0.5.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.6.0.1, 0.6.0.2, 0.6.0.3, 0.6.0.4, 0.6.0.5 |
|---|---|
| Dependencies | base (>=4 && <4.3), base-unicode-symbols (>=0.1.1 && <0.3) [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> |
| Uploaded | by BasVanDijk at 2010-05-02T20:21:29Z |
| Category | Data |
| Source repo | head: darcs get http://code.haskell.org/~basvandijk/code/string-combinators/ |
| Distributions | LTSHaskell:0.6.0.5, NixOS:0.6.0.5, Stackage:0.6.0.5 |
| Reverse Dependencies | 3 direct, 23 indirect [details] |
| Downloads | 9802 total (43 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] |