zalgo: Z-algorithm implemented on haskell's built-in cons-cell-based lists.
Deprecated
in favor of functional-kmp
A few efficient list-processing functions using the prefix-function, which is defined as:
(prefixFun 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.
Downloads
- zalgo-0.2.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
Versions [RSS] | 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.0.3, 0.1.1.0, 0.2.0.0 |
---|---|
Dependencies | base (>=4 && <5) [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-09-01T21:36:02Z |
Distributions | NixOS:0.2.0.0 |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Downloads | 3674 total (19 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2015-09-01 [all 1 reports] |