diff options
Diffstat (limited to 'dev-haskell/lcs')
| -rw-r--r-- | dev-haskell/lcs/Manifest | 1 | ||||
| -rw-r--r-- | dev-haskell/lcs/files/lcs-0.2-ghc-7.10.patch | 8 | ||||
| -rw-r--r-- | dev-haskell/lcs/lcs-0.2-r1.ebuild | 28 | ||||
| -rw-r--r-- | dev-haskell/lcs/metadata.xml | 27 |
4 files changed, 0 insertions, 64 deletions
diff --git a/dev-haskell/lcs/Manifest b/dev-haskell/lcs/Manifest deleted file mode 100644 index 298af2d9b699..000000000000 --- a/dev-haskell/lcs/Manifest +++ /dev/null @@ -1 +0,0 @@ -DIST lcs-0.2.tar.gz 11638 BLAKE2B e90201a50746416391156fadb05c67a4432d063294b751b8c48a71541e7567aaad8cc8cdad59c9a58633d8ab72fd917990cab14ef044f2ecb0f9012354add709 SHA512 ac5ac6d9a151be46054f2f56a5927182fe6942e518a04a8c484b02c8caec0506ddaf846f51f5575f1f30d6f0fca9b7b26f16e32675b322d014f8b68db76d5f5e diff --git a/dev-haskell/lcs/files/lcs-0.2-ghc-7.10.patch b/dev-haskell/lcs/files/lcs-0.2-ghc-7.10.patch deleted file mode 100644 index 24165ffb9104..000000000000 --- a/dev-haskell/lcs/files/lcs-0.2-ghc-7.10.patch +++ /dev/null @@ -1,8 +0,0 @@ -diff --git a/Data/List/LCS/HuntSzymanski.hs b/Data/List/LCS/HuntSzymanski.hs -index 306368f..e9df4ef 100644 ---- a/Data/List/LCS/HuntSzymanski.hs -+++ b/Data/List/LCS/HuntSzymanski.hs -@@ -1,2 +1,2 @@ -- -+{-# LANGUAGE FlexibleContexts #-} - ----------------------------------------------------------------------------- diff --git a/dev-haskell/lcs/lcs-0.2-r1.ebuild b/dev-haskell/lcs/lcs-0.2-r1.ebuild deleted file mode 100644 index 7fbefa014669..000000000000 --- a/dev-haskell/lcs/lcs-0.2-r1.ebuild +++ /dev/null @@ -1,28 +0,0 @@ -# Copyright 1999-2020 Gentoo Authors -# Distributed under the terms of the GNU General Public License v2 - -EAPI=5 - -# ebuild generated by hackport 0.4.5.9999 - -CABAL_FEATURES="lib profile haddock hoogle hscolour" -inherit eutils haskell-cabal - -DESCRIPTION="Find longest common sublist of two lists" -HOMEPAGE="http://urchin.earth.li/~ian/cabal/lcs/" -SRC_URI="https://hackage.haskell.org/package/${P}/${P}.tar.gz" - -LICENSE="|| ( BSD GPL-2 )" -SLOT="0/${PV}" -KEYWORDS="~amd64 ~x86" -IUSE="" - -RDEPEND=">=dev-lang/ghc-7.4.1:= -" -DEPEND="${RDEPEND} - dev-haskell/cabal -" - -src_prepare() { - epatch "${FILESDIR}"/${P}-ghc-7.10.patch -} diff --git a/dev-haskell/lcs/metadata.xml b/dev-haskell/lcs/metadata.xml deleted file mode 100644 index 7a626927e1e6..000000000000 --- a/dev-haskell/lcs/metadata.xml +++ /dev/null @@ -1,27 +0,0 @@ -<?xml version="1.0" encoding="UTF-8"?> -<!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd"> -<pkgmetadata> - <maintainer type="project"> - <email>haskell@gentoo.org</email> - <name>Gentoo Haskell</name> - </maintainer> - <longdescription> - Provides a function lcs that takes two lists and returns a longest - common sublist. For example, lcs "abcd" "acbd" is either "abd" or - "acd". - - 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 "String searching algorithms" 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> |