7f1b04b · text · git.iko.soy

Small haddock edits

--HG-- extra : convert_revision : b9d5d9f96595d5b8229c3ac49fcbd2c0878da1dd

commit7f1b04bdd5ab51859ad1de0f74da4b0b46ffba29 authorBryan O'Sullivan <bos@serpentine.com> dateWed 8 Sep 2010, 02:13 (16 years ago) parentdd1a5c9

2 files changed+7−1

unifiedsplit

Data/Text.hs+3

@@ -535,6 +535,9 @@ reverse t = S.reverse (stream t)

535535{-# INLINE reverse #-}

536536

537537-- | /O(m+n)/ Replace every occurrence of one substring with another.

538+--

539+-- In (unlikely) bad cases, this function's time complexity degrades

540+-- towards /O(n*m)/.

538541replace :: Text -- ^ Text to search for

539542 -> Text -- ^ Replacement text

540543 -> Text -- ^ Input text

Data/Text/Lazy.hs+4−1

@@ -27,7 +27,7 @@

2727-- This module is intended to be imported @qualified@, to avoid name

2828-- clashes with "Prelude" functions. eg.

2929--

30−-- > import qualified Data.Text.Lazy as B

30+-- > import qualified Data.Text.Lazy as L

3131

3232module Data.Text.Lazy

3333 (

@@ -518,6 +518,9 @@ reverse = rev Empty

518518 rev a (Chunk t ts) = rev (Chunk (T.reverse t) a) ts

519519

520520-- | /O(m+n)/ Replace every occurrence of one substring with another.

521+--

522+-- In (unlikely) bad cases, this function's time complexity degrades

523+-- towards /O(n*m)/.

521524replace :: Text -- ^ Text to search for

522525 -> Text -- ^ Replacement text

523526 -> Text -- ^ Input text