gentoo resync : 14.07.2018

4 files changed, 0 insertions, 67 deletions

diff --git a/dev-haskell/lcs/Manifest b/dev-haskell/lcs/Manifest
deleted file mode 100644
index 40b0e17ed939..000000000000
--- a/dev-haskell/lcs/Manifest
+++ /dev/null
@@ -1,4 +0,0 @@
-AUX lcs-0.2-ghc-7.10.patch 313 BLAKE2B ac278030ef0c00d0d97d5660a078ddc188e38cceaca01a071c606e416a0292507d4880929192d383014870605ff38008923e1a15e79c08c3442dada640cb0b13 SHA512 d1b05ed47d0ce1bcb79af6e180b5955abc6f76ebce318ea8fa0b1195c3d44b8887ec4a4587b1de8b0e8f911f35153950e290654ebbdf407cfaa961d92b018456
-DIST lcs-0.2.tar.gz 11638 BLAKE2B e90201a50746416391156fadb05c67a4432d063294b751b8c48a71541e7567aaad8cc8cdad59c9a58633d8ab72fd917990cab14ef044f2ecb0f9012354add709 SHA512 ac5ac6d9a151be46054f2f56a5927182fe6942e518a04a8c484b02c8caec0506ddaf846f51f5575f1f30d6f0fca9b7b26f16e32675b322d014f8b68db76d5f5e
-EBUILD lcs-0.2-r1.ebuild 650 BLAKE2B 2d947d5d12f2c8a952ff739c0bfedaac7bd3d4bf85c6a685562d084bde2fb9fbb0c5dacf43771cd1bc6d7495a088603295d2be2942fcaba9de7ddde623fc1f93 SHA512 aa46f793542e94c789494307d5ca3a74384e154878c8c179c49430f9c87e9737f0be6fdbeda04e52bc22e575a4b9651f49d2a45cfece3a933be35ae4ce85c4a1
-MISC metadata.xml 1062 BLAKE2B 7f0e9f42997af8f7fe610f2cfb7532c6e5f9cbf578b4316937995e88140962bc2cd71d74fdd54d61190969f6239a35a56836d721a36360689ec81f2d7aceba12 SHA512 21990dc7fc022fe45ae02ca8f54d4a5dde60097da0b83660c4259a7258b824cd9b71ccffa7fa4c55e39a9bb0f492f5c5c79fcb6c0d0603bdd10e5cfa1aedf0fd
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 4aef464615dc..000000000000
--- a/dev-haskell/lcs/lcs-0.2-r1.ebuild
+++ /dev/null
@@ -1,28 +0,0 @@
-# Copyright 1999-2015 Gentoo Foundation
-# 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="mirror://hackage/packages/archive/${PN}/${PV}/${P}.tar.gz"
-
-LICENSE="|| ( BSD GPL-2 )"
-SLOT="0/${PV}"
-KEYWORDS="alpha amd64 ia64 ppc ppc64 sparc 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>