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.

[maintain] [Publish]

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.

Properties

Versions	0.1.0.0, 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.0.3, 0.1.1.0, 0.2.0.0
Change log	None available
Dependencies	base (>=4.8 && <4.9) [details]
License	BSD-3-Clause
Author	mniip
Maintainer	mniip@mniip.com
Category	Data
Home page	http://github.com/mniip/zalgo
Source repo	head: git clone http://github.com/mniip/zalgo.git
Uploaded	by mniip at 2015-08-29T04:31:40Z

Modules

Data
- List
  - Data.List.Zalgo
    - Data.List.Zalgo.Internal

Downloads

zalgo-0.1.0.0.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

mniip

For package maintainers and hackage trustees

edit package information