 | lcs-0.1 | Contents | Index |
| Data.List.LCS |
|
| lcs :: Ord a => [a] -> [a] -> [a] |
| ||||||||
| ||||||||
| Description | ||||||||
| Provides a function lcs that takes two lists and returns a longest common sublist. For example, lcs "abcd" "acbd" is either "abd" or "acd". | ||||||||
| Synopsis | ||||||||
| ||||||||
| Documentation | ||||||||
| lcs :: Ord a => [a] -> [a] -> [a] | ||||||||
| The lcs function takes two lists and returns a list with a longest common subsequence of the two. | ||||||||
| Produced by Haddock version 0.6 |