indices :: Text -> Text -> [Int]
O(n+m) Find the offsets of all non-overlapping indices of
needle within haystack.
In (unlikely) bad cases, this algorithm's complexity degrades towards O(n*m).
TextSubstring to search for (
needle)TextText to search in (
haystack)