-- Hoogle documentation, generated by Haddock -- See Hoogle, http://www.haskell.org/hoogle/ -- | Utils for text -- -- Utils for text @package text-plus @version 0.1.0.1 module Data.Text.Plus decodeUtf8M :: ByteString -> Fail Text showText :: Show a => a -> Text readText :: Read a => Text -> a groupOn :: Eq a => (Char -> a) -> Text -> [(a, Text)] -- | Removes HTML Tags withoutTags :: Text -> Text showTable :: (Traversable t) => [(Text, a -> Text)] -> t a -> Text showTableRaw :: (Traversable t1, Traversable t2) => [Text] -> t1 (t2 Text) -> Text filename :: Text -> Text splitOnNoEmpty :: Text -> Text -> [Text] nothingIfEmpty :: Text -> Maybe Text noneIfEmpty :: Text -> Option Text emptyIfNone :: Option Text -> Text limitTo :: Int -> Text -> Text sep :: Text -> Char -> Text -> Text unsep :: Char -> Text -> (Text, Text) unsep' :: Monad m => Char -> Text -> m (Text, Text) shorten :: Int -> Text -> Text shortenL :: Int -> Text -> Text firstToUpper :: Text -> Text shortenLinesL :: Int -> Int -> Text -> Text lenientDecodeUtf8 :: ByteString -> Text lenientDecodeUtf8L :: ByteString -> Text toLazy :: Text -> Text fromLazy :: Text -> Text indicesOfOccurences :: Text -> Text -> [Int] -- | Simple tokenizer - that doesn't destroy delimiters, e.g. -- --
--   >>> tokenize (T.pack "This is blind-text, with punctuation.")
--   ["This"," ","is"," ","blind","-","text",", ","with"," ","punctuation","."]
--   
-- --
--   T.concat (tokenize x) == x
--   
-- -- Note: URLs, numbers won't be handled very well. tokenize :: Text -> [Text] -- | commonPrefixTotal s t returns a trippel (r,st,tt) -- s.t. s = r append st, t = r append tt such -- that r is longest possible. -- -- Note: Contrary to Data.commonPrefix there is no special case when -- T.null r. commonPrefixTotal :: Text -> Text -> (Text, Text, Text) firstLine :: Text -> Text firstParagraph :: Text -> Text escapeXml :: Text -> Text fixed :: Int -> Text -> Text fixed' :: Char -> Int -> Text -> Text instance Test.QuickCheck.Arbitrary.Arbitrary Data.Text.Internal.Text