Data.ListLike.Chars

ListLike-4.5.1: Generic support for list-like structures

Safe Haskell | Safe
Language | Haskell98

Data.ListLike.Chars

Description

Work in progress.

# Documentation

data Chars #

Constructors

B Builder |
T Text |

Instances

Eq Chars # |
Methods (==) :: Chars -> Chars -> Bool # (/=) :: Chars -> Chars -> Bool #
Ord Chars # |
Methods compare :: Chars -> Chars -> Ordering # (<) :: Chars -> Chars -> Bool # (<=) :: Chars -> Chars -> Bool # (>) :: Chars -> Chars -> Bool # (>=) :: Chars -> Chars -> Bool # max :: Chars -> Chars -> Chars # min :: Chars -> Chars -> Chars #
Show Chars # |
Methods showsPrec :: Int -> Chars -> ShowS # show :: Chars -> String # showList :: [Chars] -> ShowS #
IsString Chars # |
Methods fromString :: String -> Chars #
Monoid Chars # |
Methods mempty :: Chars # mappend :: Chars -> Chars -> Chars # mconcat :: [Chars] -> Chars #
NFData Chars # |
Methods rnf :: Chars -> () #
StringLike Chars # |
Methods toString :: Chars -> String # fromString :: String -> Chars # lines :: ListLike full Chars => Chars -> full # words :: ListLike full Chars => Chars -> full # unlines :: ListLike full Chars => full -> Chars # unwords :: ListLike full Chars => full -> Chars #
FoldableLL Chars Char # |
Methods foldl :: (a -> Char -> a) -> a -> Chars -> a # foldl' :: (a -> Char -> a) -> a -> Chars -> a # foldl1 :: (Char -> Char -> Char) -> Chars -> Char # foldr :: (Char -> b -> b) -> b -> Chars -> b # foldr' :: (Char -> b -> b) -> b -> Chars -> b # foldr1 :: (Char -> Char -> Char) -> Chars -> Char #
ListLike Chars Char # |
Methods empty :: Chars # singleton :: Char -> Chars # cons :: Char -> Chars -> Chars # snoc :: Chars -> Char -> Chars # append :: Chars -> Chars -> Chars # head :: Chars -> Char # uncons :: Chars -> Maybe (Char, Chars) # last :: Chars -> Char # tail :: Chars -> Chars # init :: Chars -> Chars # null :: Chars -> Bool # length :: Chars -> Int # map :: ListLike full' item' => (Char -> item') -> Chars -> full' # rigidMap :: (Char -> Char) -> Chars -> Chars # reverse :: Chars -> Chars # intersperse :: Char -> Chars -> Chars # concat :: (ListLike full' Chars, Monoid Chars) => full' -> Chars # concatMap :: ListLike full' item' => (Char -> full') -> Chars -> full' # rigidConcatMap :: (Char -> Chars) -> Chars -> Chars # any :: (Char -> Bool) -> Chars -> Bool # all :: (Char -> Bool) -> Chars -> Bool # maximum :: Chars -> Char # minimum :: Chars -> Char # replicate :: Int -> Char -> Chars # take :: Int -> Chars -> Chars # drop :: Int -> Chars -> Chars # splitAt :: Int -> Chars -> (Chars, Chars) # takeWhile :: (Char -> Bool) -> Chars -> Chars # dropWhile :: (Char -> Bool) -> Chars -> Chars # dropWhileEnd :: (Char -> Bool) -> Chars -> Chars # span :: (Char -> Bool) -> Chars -> (Chars, Chars) # break :: (Char -> Bool) -> Chars -> (Chars, Chars) # group :: (ListLike full' Chars, Eq Char) => Chars -> full' # inits :: ListLike full' Chars => Chars -> full' # tails :: ListLike full' Chars => Chars -> full' # isPrefixOf :: Chars -> Chars -> Bool # isSuffixOf :: Chars -> Chars -> Bool # isInfixOf :: Chars -> Chars -> Bool # stripPrefix :: Chars -> Chars -> Maybe Chars # stripSuffix :: Chars -> Chars -> Maybe Chars # elem :: Char -> Chars -> Bool # notElem :: Char -> Chars -> Bool # find :: (Char -> Bool) -> Chars -> Maybe Char # filter :: (Char -> Bool) -> Chars -> Chars # partition :: (Char -> Bool) -> Chars -> (Chars, Chars) # index :: Chars -> Int -> Char # elemIndex :: Char -> Chars -> Maybe Int # elemIndices :: (Eq Char, ListLike result Int) => Char -> Chars -> result # findIndex :: (Char -> Bool) -> Chars -> Maybe Int # findIndices :: ListLike result Int => (Char -> Bool) -> Chars -> result # sequence :: (Monad m, ListLike fullinp (m Char)) => fullinp -> m Chars # mapM :: (Monad m, ListLike full' item') => (Char -> m item') -> Chars -> m full' # rigidMapM :: Monad m => (Char -> m Char) -> Chars -> m Chars # nub :: Chars -> Chars # delete :: Char -> Chars -> Chars # deleteFirsts :: Chars -> Chars -> Chars # union :: Chars -> Chars -> Chars # intersect :: Chars -> Chars -> Chars # sort :: Chars -> Chars # insert :: Char -> Chars -> Chars # toList :: Chars -> [Char] # fromList :: [Char] -> Chars # fromListLike :: ListLike full' Char => Chars -> full' # nubBy :: (Char -> Char -> Bool) -> Chars -> Chars # deleteBy :: (Char -> Char -> Bool) -> Char -> Chars -> Chars # deleteFirstsBy :: (Char -> Char -> Bool) -> Chars -> Chars -> Chars # unionBy :: (Char -> Char -> Bool) -> Chars -> Chars -> Chars # intersectBy :: (Char -> Char -> Bool) -> Chars -> Chars -> Chars # groupBy :: (ListLike full' Chars, Eq Char) => (Char -> Char -> Bool) -> Chars -> full' # sortBy :: (Char -> Char -> Ordering) -> Chars -> Chars # insertBy :: (Char -> Char -> Ordering) -> Char -> Chars -> Chars # genericLength :: Num a => Chars -> a # genericTake :: Integral a => a -> Chars -> Chars # genericDrop :: Integral a => a -> Chars -> Chars # genericSplitAt :: Integral a => a -> Chars -> (Chars, Chars) # genericReplicate :: Integral a => a -> Char -> Chars #
ListLikeIO Chars Char # |
Methods hGetLine :: Handle -> IO Chars # hGetContents :: Handle -> IO Chars # hGet :: Handle -> Int -> IO Chars # hGetNonBlocking :: Handle -> Int -> IO Chars # hPutStr :: Handle -> Chars -> IO () # hPutStrLn :: Handle -> Chars -> IO () # getLine :: IO Chars # getContents :: IO Chars # putStr :: Chars -> IO () # putStrLn :: Chars -> IO () # interact :: (Chars -> Chars) -> IO () # readFile :: FilePath -> IO Chars # writeFile :: FilePath -> Chars -> IO () # appendFile :: FilePath -> Chars -> IO () #

builder :: Chars -> Builder #