diff options
| author | V3n3RiX <venerix@redcorelinux.org> | 2020-11-25 22:39:15 +0000 |
|---|---|---|
| committer | V3n3RiX <venerix@redcorelinux.org> | 2020-11-25 22:39:15 +0000 |
| commit | d934827bf44b7cfcf6711964418148fa60877668 (patch) | |
| tree | 0625f358789b5e015e49db139cc1dbc9be00428f /dev-haskell/lcs | |
| parent | 2e34d110f164bf74d55fced27fe0000201b3eec5 (diff) | |
gentoo resync : 25.11.2020
Diffstat (limited to 'dev-haskell/lcs')
| -rw-r--r-- | dev-haskell/lcs/Manifest | 4 | ||||
| -rw-r--r-- | dev-haskell/lcs/lcs-0.2-r1.ebuild | 12 | ||||
| -rw-r--r-- | dev-haskell/lcs/metadata.xml | 19 |
3 files changed, 7 insertions, 28 deletions
diff --git a/dev-haskell/lcs/Manifest b/dev-haskell/lcs/Manifest index 4579d154a941..33219326fa93 100644 --- a/dev-haskell/lcs/Manifest +++ b/dev-haskell/lcs/Manifest @@ -1,4 +1,4 @@ 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 617 BLAKE2B 5b8ae4ba44783dfe68d0cddd43deb679d88f02a9cde603c7bed1621cfe41db55b861eaa2381186ecc7c569d37f23f85ea57c3130e6b6d0b32b523f32be07a44c SHA512 3db369a5c18cebae65f5d2ffc512b752ee270a03f43a76abdb72acb965032886d31c2e581434df53555350530a6b509f7cffa6df90cfc6c29abe5ba4570a057b -MISC metadata.xml 1062 BLAKE2B 7f0e9f42997af8f7fe610f2cfb7532c6e5f9cbf578b4316937995e88140962bc2cd71d74fdd54d61190969f6239a35a56836d721a36360689ec81f2d7aceba12 SHA512 21990dc7fc022fe45ae02ca8f54d4a5dde60097da0b83660c4259a7258b824cd9b71ccffa7fa4c55e39a9bb0f492f5c5c79fcb6c0d0603bdd10e5cfa1aedf0fd +EBUILD lcs-0.2-r1.ebuild 600 BLAKE2B 131c20ba1b866a9c1db3a07a26840679f94fd89aa8d8004ab9263054e80a9f6f89f127fa2074046f72677aa21051c3d44e90152e2542d368b3239c928853b7eb SHA512 1d5bf41575deaee0e73554a76053c917bb6cec70ab2d708e5cda4f8f117a3cf920d6f0a769270d1f30f58bc59921a4fe5fd90c0d186f717e7bdc76ee7fba7dbc +MISC metadata.xml 249 BLAKE2B 84b809c265ff2a09d1f06c66d4797652ff4c64205d94323e07333ae0fbddcfb8c58d0176a8cc52bd37e9353371d987b9b473b9747cb082e1c2871ed80fcfa144 SHA512 ce055b41ff1c10209e88579fe21ce16550be7e9b21f87724564f06430aa6f478974f186a10c8ff7e92398f534c09109aeed57eae1c6d2b56b5c99ebfb64a0015 diff --git a/dev-haskell/lcs/lcs-0.2-r1.ebuild b/dev-haskell/lcs/lcs-0.2-r1.ebuild index 7fbefa014669..245d4794375c 100644 --- a/dev-haskell/lcs/lcs-0.2-r1.ebuild +++ b/dev-haskell/lcs/lcs-0.2-r1.ebuild @@ -1,12 +1,12 @@ # Copyright 1999-2020 Gentoo Authors # Distributed under the terms of the GNU General Public License v2 -EAPI=5 +EAPI=7 -# ebuild generated by hackport 0.4.5.9999 +# ebuild generated by hackport 0.6.6.9999 CABAL_FEATURES="lib profile haddock hoogle hscolour" -inherit eutils haskell-cabal +inherit haskell-cabal DESCRIPTION="Find longest common sublist of two lists" HOMEPAGE="http://urchin.earth.li/~ian/cabal/lcs/" @@ -20,9 +20,7 @@ IUSE="" RDEPEND=">=dev-lang/ghc-7.4.1:= " DEPEND="${RDEPEND} - dev-haskell/cabal + >=dev-haskell/cabal-1.0 " -src_prepare() { - epatch "${FILESDIR}"/${P}-ghc-7.10.patch -} +PATCHES=("${FILESDIR}"/${P}-ghc-7.10.patch) diff --git a/dev-haskell/lcs/metadata.xml b/dev-haskell/lcs/metadata.xml index 7a626927e1e6..b7878815d80d 100644 --- a/dev-haskell/lcs/metadata.xml +++ b/dev-haskell/lcs/metadata.xml @@ -5,23 +5,4 @@ <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> |