Bryan O'Sullivan  committed e01ef06

Clarify a bit of documentation

  • Participants
  • Parent commits 0e82161
  • Branches default

Comments (0)

Files changed (1)

File Data/Text/Search.hs

 -- | /O(n+m)/ Find the offsets of all non-overlapping indices of
 -- @needle@ within @haystack@.  The offsets returned represent
--- locations in the low-level array.
+-- uncorrected indices in the low-level \"needle\" array, to which its
+-- offset must be added.
 -- In (unlikely) bad cases, this algorithm's complexity degrades
 -- towards /O(n*m)/.