summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMark Wright <gienah@gentoo.org>2014-07-03 07:34:46 +0000
committerMark Wright <gienah@gentoo.org>2014-07-03 07:34:46 +0000
commitef0757a3afd174a5c2da9e9977038356bbafbc08 (patch)
tree8042d7efa2933d0493db933a02029d953aeba32b /dev-haskell
parentAdd tasty-ant-xml (diff)
downloadgentoo-2-ef0757a3afd174a5c2da9e9977038356bbafbc08.tar.gz
gentoo-2-ef0757a3afd174a5c2da9e9977038356bbafbc08.tar.bz2
gentoo-2-ef0757a3afd174a5c2da9e9977038356bbafbc08.zip
Add lcs
(Portage version: 2.2.10/cvs/Linux x86_64, signed Manifest commit with key 618E971F)
Diffstat (limited to 'dev-haskell')
-rw-r--r--dev-haskell/lcs/ChangeLog8
-rw-r--r--dev-haskell/lcs/Manifest3
-rw-r--r--dev-haskell/lcs/lcs-0.2.ebuild23
-rw-r--r--dev-haskell/lcs/metadata.xml27
4 files changed, 61 insertions, 0 deletions
diff --git a/dev-haskell/lcs/ChangeLog b/dev-haskell/lcs/ChangeLog
new file mode 100644
index 000000000000..676841d7757f
--- /dev/null
+++ b/dev-haskell/lcs/ChangeLog
@@ -0,0 +1,8 @@
+# ChangeLog for dev-haskell/lcs
+# Copyright 1999-2014 Gentoo Foundation; Distributed under the GPL v2
+# $Header: /var/cvsroot/gentoo-x86/dev-haskell/lcs/ChangeLog,v 1.1 2014/07/03 07:34:46 gienah Exp $
+
+*lcs-0.2 (03 Jul 2014)
+
+ 03 Jul 2014; Mark Wright <gienah@gentoo.org> +lcs-0.2.ebuild, +metadata.xml:
+ Add lcs
diff --git a/dev-haskell/lcs/Manifest b/dev-haskell/lcs/Manifest
new file mode 100644
index 000000000000..c9ca84b2f6a3
--- /dev/null
+++ b/dev-haskell/lcs/Manifest
@@ -0,0 +1,3 @@
+DIST lcs-0.2.tar.gz 11638 SHA256 b4db67ead4e2f58c4d462d4c1006d2158744ef3ca8597295a1dfa08537401ff1 SHA512 ac5ac6d9a151be46054f2f56a5927182fe6942e518a04a8c484b02c8caec0506ddaf846f51f5575f1f30d6f0fca9b7b26f16e32675b322d014f8b68db76d5f5e WHIRLPOOL 1b210507fe1298b2b67caa496cedbe549923302d74aab51fe4eb2dae5fc0d0867099b4dbcd73eb733ca359decfcacd2e84046f6dee10034e973c7209ce30bb8f
+EBUILD lcs-0.2.ebuild 562 SHA256 2e0acf28c1635e5818934f9e36b4da5ba084528a3ee5de3e2ff93f587146b287 SHA512 22aea0b72a7211e7df9a560e991273a5ee7c1d0d82ebe89c2a218a581344b78409b0f699e638bdcf63b50eff0dead011445f48267d96c78d209fc3a69621d653 WHIRLPOOL 6cf3463ceece6c71715c0800b8f1bc5c518799dc63daba7508cdac64e2a42165fe23140e88aa6291293cd8e4dd8291c65a73403470e2b80d811f9493aca36cbe
+MISC metadata.xml 1089 SHA256 f58ae8d1ec4b4ee50c03cff176cce6b762fa916830a107815c9a73cfa1d058f3 SHA512 1afa0748094414a44b389457466de7b658faa40eb2323b26be473421a180a09587bab2032b6a43d464709e010c66049d9b27824fdd5489c7c1af440ef3d4f437 WHIRLPOOL 30b566d6de23b6acc08c5baa1586ee4c9ffcc4bb309eb70b330501c52dfe4405a9e89b040fc3068aff0ec02439e68346a867a97e46614d77328ea0b493811682
diff --git a/dev-haskell/lcs/lcs-0.2.ebuild b/dev-haskell/lcs/lcs-0.2.ebuild
new file mode 100644
index 000000000000..0c071f08b579
--- /dev/null
+++ b/dev-haskell/lcs/lcs-0.2.ebuild
@@ -0,0 +1,23 @@
+# Copyright 1999-2014 Gentoo Foundation
+# Distributed under the terms of the GNU General Public License v2
+# $Header: /var/cvsroot/gentoo-x86/dev-haskell/lcs/lcs-0.2.ebuild,v 1.1 2014/07/03 07:34:46 gienah Exp $
+
+EAPI=4
+
+# ebuild generated by hackport 0.2.18.9999
+
+CABAL_FEATURES="lib profile haddock hoogle hscolour"
+inherit haskell-cabal
+
+DESCRIPTION="Find longest common sublist of two lists"
+HOMEPAGE="http://urchin.earth.li/~ian/cabal/lcs/"
+SRC_URI="mirror://hackage/packages/archive/${PN}/${PV}/${P}.tar.gz"
+
+LICENSE="|| ( BSD GPL-2 )"
+SLOT="0"
+KEYWORDS="~amd64 ~x86"
+IUSE=""
+
+RDEPEND=">=dev-lang/ghc-6.8.2"
+DEPEND="${RDEPEND}
+ dev-haskell/cabal"
diff --git a/dev-haskell/lcs/metadata.xml b/dev-haskell/lcs/metadata.xml
new file mode 100644
index 000000000000..d4394fed6859
--- /dev/null
+++ b/dev-haskell/lcs/metadata.xml
@@ -0,0 +1,27 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd">
+<pkgmetadata>
+ <herd>haskell</herd>
+ <maintainer>
+ <email>haskell@gentoo.org</email>
+ </maintainer>
+ <longdescription>
+ Provides a function lcs that takes two lists and returns a longest
+ common sublist. For example, lcs &quot;abcd&quot; &quot;acbd&quot; is either &quot;abd&quot; or
+ &quot;acd&quot;.
+
+ The package provides a simple, stupid and (most of all) slow
+ implementation that needs, for inputs of length m and n, O(m+n)
+ space and O((m+n)!) time in the worst case.
+
+ It also provides an implementation of the Hunt-Szymanski LCS
+ algorithm, based on that in &quot;String searching algorithms&quot; by
+ Graham A Stephen, ISBN 981021829X.
+
+ Given inputs xs and ys of length m and n respectively, where there
+ are r pairs (x, y) where x is in xs, y is in ys and x == y,
+ Hunt-Szymanski needs O(r+m+n) space and O((r+m+n)*log(m+n)) time.
+ Thus this is O((m+n)^2) space and O((m+n)^2*log(m+n)) time in the
+ worst case.
+ </longdescription>
+</pkgmetadata>