homepage: http://github.com/mniip/zalgo
changelog-type: ''
hash: b5ecf468e6a3f3e460b7440a3c7b0327587cf3138b06410f49a5483e44459e34
test-bench-deps: {}
maintainer: mniip@mniip.com
synopsis: Z-algorithm implemented on haskell's built-in cons-cell-based lists.
changelog: ''
basic-deps:
  base: ! '>=4.8 && <4.9'
all-versions:
- '0.1.0.0'
author: mniip
latest: '0.1.0.0'
description-type: haddock
description: ! '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.'
license-name: BSD3

homepage: http://github.com/mniip/zalgo
changelog-type: ''
hash: c280da663903e68c6bfe740fe3419661617e2c0bc166bade2336623bfa04c939
test-bench-deps: {}
maintainer: mniip@mniip.com
synopsis: Z-algorithm implemented on haskell's built-in cons-cell-based lists.
changelog: ''
basic-deps:
  base: ==4.*
all-versions:
- '0.1.0.0'
- '0.1.0.1'
author: mniip
latest: '0.1.0.1'
description-type: haddock
description: ! '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.'
license-name: BSD3

Update from Hackage at 2015-08-29T08:18:26+0000
Update from Hackage at 2015-08-29T08:18:26+0000
