Portability | GHC |
---|---|
Stability | experimental |
Maintainer | bos@serpentine.com, rtomharper@googlemail.com, duncan@haskell.org |
Safe Haskell | Safe-Infered |
Data.Text.Lazy.Search
Description
Fast substring search for lazy Text
, based on work by Boyer,
Moore, Horspool, Sunday, and Lundh. Adapted from the strict
implementation.
Documentation
O(n+m) Find the offsets of all non-overlapping indices of
needle
within haystack
.
This function is strict in needle
, and lazy (as far as possible)
in the chunks of haystack
.
In (unlikely) bad cases, this algorithm's complexity degrades towards O(n*m).