@@ -401,7 +401,7 @@ reverse :: Text -> Text
401401reverse t = S.reverse (stream t)
402402{-# INLINE reverse #-}
403403
404−-- | /O(m)*O(n)/ Replace every occurrence of one substring with another.
404+-- | /O(m*n)/ Replace every occurrence of one substring with another.
405405replace :: Text -- ^ Text to search for
406406 -> Text -- ^ Replacement text
407407 -> Text -- ^ Input text
@@ -899,7 +899,7 @@ tails t | null t = [empty]
899899-- copies to create substrings; they just construct new 'Text's that
900900-- are slices of the original.
901901
902−-- | /O(m)*O(n)/ Break a 'Text' into pieces separated by the first
902+-- | /O(m*n)/ Break a 'Text' into pieces separated by the first
903903-- 'Text' argument, consuming the delimiter. An empty delimiter is
904904-- invalid, and will cause an error to be raised.
905905--
@@ -935,7 +935,7 @@ split pat src0
935935 split (singleton c) t = splitWith (==c) t
936936 #-}
937937
938−-- | /O(m)*O(n)/ Break a 'Text' into pieces at most @k@ times,
938+-- | /O(m*n)/ Break a 'Text' into pieces at most @k@ times,
939939-- treating the first 'Text' argument as the delimiter to break on,
940940-- and consuming the delimiter. The last element of the list contains
941941-- the remaining text after the number of times to split has been
@@ -970,7 +970,7 @@ splitTimes k pat src0
970970 | otherwise = search (n+1) (unsafeTail s)
971971{-# INLINE splitTimes #-}
972972
973−-- | /O(m)*O(n)/ Break a 'Text' into pieces at most @k@ times, like
973+-- | /O(m*n)/ Break a 'Text' into pieces at most @k@ times, like
974974-- 'splitTimes', but start from the end of the input and work towards
975975-- the start.
976976--