zalgo: Z-algorithm implemented on haskell's built-in cons-cell-based lists.

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.


A few efficient list-processing functions using the Z-function, which is defined as:

(z xs) !! i

is the length of the largest proper substring of xs ending at position i, such that it equals the beginning of xs.

For example:

.-----.             .-----.
a b a c a b a a a b a b a c d
0 0 1 0 1 2 3 1 1 2 3 2 3 4 0

The marked substrings are equal, hence the value at the marked location is their length, 4.


Change logNone available
Dependenciesbase (==4.8.*) [details]
Home page
Source repositoryhead: git clone
UploadedSat Aug 29 04:31:40 UTC 2015 by mniip



Maintainers' corner

For package maintainers and hackage trustees