Clarify a bit of documentation
commit8e575b896d72aa80fbce1fa84f4877cb49ebf0e3
authorBryan O'Sullivan <bos@serpentine.com>
dateTue 3 Dec 2013, 21:57 (13 years ago)
parent9af7c1d
Data/Text/Search.hs+2−1
@@ -42,7 +42,8 @@ data T = {-# UNPACK #-} !Word64 :* {-# UNPACK #-} !Int
4242
4343-- | /O(n+m)/ Find the offsets of all non-overlapping indices of
4444-- @needle@ within @haystack@. The offsets returned represent
45−-- locations in the low-level array.
45+-- uncorrected indices in the low-level \"needle\" array, to which its
46+-- offset must be added.
4647--
4748-- In (unlikely) bad cases, this algorithm's complexity degrades
4849-- towards /O(n*m)/.