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 #