Knuth–Morris–Pratt string searching algorithm https://github.com/CindyLinz/Haskell-KMP
|Latest on Hackage:||0.1.0.2|
This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.
It can search a word in a text in O(m+n) time, where m and n are the length of the word and the text.
This module can apply on any list of instance of Eq.
Donald Knuth; James H. Morris, Jr, Vaughan Pratt (1977).
Fast pattern matching in strings.
SIAM Journal on Computing 6 (2): 323–350. doi:10.1137/0206024
> word = "abababcaba"
> text = "abababababcabababcababbb"
> kmpTable = build word
> result = match kmpTable text
> -- the 'result' should be [4, 11]
Reimplement the real KMP version, instead of the MP version.
Thank MaskRay from #haskell for noticing.