diff options
| author | ng0 <ng0@we.make.ritual.n0.is> | 2016-09-18 16:09:49 +0000 |
|---|---|---|
| committer | Leo Famulari <leo@famulari.name> | 2016-09-22 20:09:53 -0400 |
| commit | fe3c62c7d541abd8f77b9f216d087f8b8997c4df (patch) | |
| tree | 81c39ccdaa9d462685c900edad92f1944af2002b /gnu/packages/haskell.scm | |
| parent | 7e444dba6e4dc43577680b0c1e205d9ac1d24397 (diff) | |
| download | patches-fe3c62c7d541abd8f77b9f216d087f8b8997c4df.tar patches-fe3c62c7d541abd8f77b9f216d087f8b8997c4df.tar.gz | |
gnu: Add ghc-regex-compat-tdfa.
* gnu/packages/haskell.scm (ghc-regex-compat-tdfa): New variable.
Signed-off-by: Leo Famulari <leo@famulari.name>
Diffstat (limited to 'gnu/packages/haskell.scm')
| -rw-r--r-- | gnu/packages/haskell.scm | 26 |
1 files changed, 26 insertions, 0 deletions
diff --git a/gnu/packages/haskell.scm b/gnu/packages/haskell.scm index f401492094..544c21d245 100644 --- a/gnu/packages/haskell.scm +++ b/gnu/packages/haskell.scm @@ -6615,4 +6615,30 @@ extended regular expressions. It is a \"tagged\" DFA regex engine. It is inspired by libtre.") (license license:bsd-3))) +(define-public ghc-regex-compat-tdfa + (package + (name "ghc-regex-compat-tdfa") + (version "0.95.1.4") + (source + (origin + (method url-fetch) + (uri (string-append + "https://hackage.haskell.org/package/regex-compat-tdfa/regex-compat-tdfa-" + version ".tar.gz")) + (sha256 + (base32 + "1p90fn90yhp7fvljjdqjp41cszidcfz4pw7fwvzyx4739b98x8sg")))) + (build-system haskell-build-system) + (inputs + `(("ghc-regex-base" ,ghc-regex-base) + ("ghc-regex-tdfa" ,ghc-regex-tdfa))) + (home-page "http://hub.darcs.net/shelarcy/regex-compat-tdfa") + (synopsis "Unicode Support version of Text.Regex, using regex-tdfa") + (description + "One module layer over @code{regex-tdfa} to replace @code{Text.Regex}. +@code{regex-compat} can't use Unicode characters correctly because of using regex-posix. +This is not good for Unicode users. This modified regex-compat uses regex-tdfa to solve +this problem.") + (license license:bsd-3))) + ;;; haskell.scm ends here |