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/metadata.xml | |
parent | 2e34d110f164bf74d55fced27fe0000201b3eec5 (diff) |
gentoo resync : 25.11.2020
Diffstat (limited to 'dev-haskell/lcs/metadata.xml')
-rw-r--r-- | dev-haskell/lcs/metadata.xml | 19 |
1 files changed, 0 insertions, 19 deletions
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> |