ListLike-4.7.8.2: Generalized support for list-like structures

Safe Haskell | None
Language | Haskell2010

Data.ListLike.FMList

Contents

- Orphan instances

Description

`ListLike` instances for `FMList`

# Orphan instances

MonadZip FMList # |
Instance details Methods mzip :: FMList a -> FMList b -> FMList (a, b) # mzipWith :: (a -> b -> c) -> FMList a -> FMList b -> FMList c # munzip :: FMList (a, b) -> (FMList a, FMList b) #
StringLike (FMList Char) # |

Instance details

Methods

toString :: FMList Char -> String #

lines :: ListLike full (FMList Char) => FMList Char -> full #

words :: ListLike full (FMList Char) => FMList Char -> full #

unlines :: ListLike full (FMList Char) => full -> FMList Char #

unwords :: ListLike full (FMList Char) => full -> FMList Char #

show :: Show a => a -> FMList Char #

fromStringLike :: StringLike s' => FMList Char -> s' #

fromText :: Text -> FMList Char #

fromLazyText :: Text -> FMList Char #

IsString (FMList Char) # |
Instance details Methods fromString :: String -> FMList Char #
IsList (FMList a) # |

Instance details

Associated Types

type Item (FMList a) |
Instance details Defined in Data.ListLike.FMList type Item (FMList a) = a

Methods

fromList :: [Item (FMList a)] -> FMList a #

fromListN :: Int -> [Item (FMList a)] -> FMList a #

toList :: FMList a -> [Item (FMList a)] #

InfiniteListLike (FMList a) a # |
Instance details Methods iterate :: (a -> a) -> a -> FMList a # repeat :: a -> FMList a # cycle :: FMList a -> FMList a #
ListLike (FMList a) a # |

Instance details

Methods

empty :: FMList a #

singleton :: a -> FMList a #

cons :: a -> FMList a -> FMList a #

snoc :: FMList a -> a -> FMList a #

append :: FMList a -> FMList a -> FMList a #

head :: FMList a -> a #

uncons :: FMList a -> Maybe (a, FMList a) #

last :: FMList a -> a #

tail :: FMList a -> FMList a #

init :: FMList a -> FMList a #

null :: FMList a -> Bool #

length :: FMList a -> Int #

map :: ListLike full' item' => (a -> item') -> FMList a -> full' #

rigidMap :: (a -> a) -> FMList a -> FMList a #

reverse :: FMList a -> FMList a #

intersperse :: a -> FMList a -> FMList a #

concat :: ListLike full' (FMList a) => full' -> FMList a #

concatMap :: ListLike full' item' => (a -> full') -> FMList a -> full' #

rigidConcatMap :: (a -> FMList a) -> FMList a -> FMList a #

any :: (a -> Bool) -> FMList a -> Bool #

all :: (a -> Bool) -> FMList a -> Bool #

maximum :: FMList a -> a #

minimum :: FMList a -> a #

replicate :: Int -> a -> FMList a #

take :: Int -> FMList a -> FMList a #

drop :: Int -> FMList a -> FMList a #

splitAt :: Int -> FMList a -> (FMList a, FMList a) #

takeWhile :: (a -> Bool) -> FMList a -> FMList a #

dropWhile :: (a -> Bool) -> FMList a -> FMList a #

dropWhileEnd :: (a -> Bool) -> FMList a -> FMList a #

span :: (a -> Bool) -> FMList a -> (FMList a, FMList a) #

break :: (a -> Bool) -> FMList a -> (FMList a, FMList a) #

group :: (ListLike full' (FMList a), Eq a) => FMList a -> full' #

inits :: ListLike full' (FMList a) => FMList a -> full' #

tails :: ListLike full' (FMList a) => FMList a -> full' #

isPrefixOf :: FMList a -> FMList a -> Bool #

isSuffixOf :: FMList a -> FMList a -> Bool #

isInfixOf :: FMList a -> FMList a -> Bool #

stripPrefix :: FMList a -> FMList a -> Maybe (FMList a) #

stripSuffix :: FMList a -> FMList a -> Maybe (FMList a) #

elem :: a -> FMList a -> Bool #

notElem :: a -> FMList a -> Bool #

find :: (a -> Bool) -> FMList a -> Maybe a #

filter :: (a -> Bool) -> FMList a -> FMList a #

partition :: (a -> Bool) -> FMList a -> (FMList a, FMList a) #

index :: FMList a -> Int -> a #

elemIndex :: a -> FMList a -> Maybe Int #

elemIndices :: (Eq a, ListLike result Int) => a -> FMList a -> result #

findIndex :: (a -> Bool) -> FMList a -> Maybe Int #

findIndices :: ListLike result Int => (a -> Bool) -> FMList a -> result #

sequence :: (Applicative m, ListLike fullinp (m a)) => fullinp -> m (FMList a) #

mapM :: (Applicative m, ListLike full' item') => (a -> m item') -> FMList a -> m full' #

rigidMapM :: Monad m => (a -> m a) -> FMList a -> m (FMList a) #

nub :: FMList a -> FMList a #

delete :: a -> FMList a -> FMList a #

deleteFirsts :: FMList a -> FMList a -> FMList a #

union :: FMList a -> FMList a -> FMList a #

intersect :: FMList a -> FMList a -> FMList a #

sort :: FMList a -> FMList a #

insert :: a -> FMList a -> FMList a #

toList' :: FMList a -> [a] #

fromList' :: [a] -> FMList a #

fromListLike :: ListLike full' a => FMList a -> full' #

nubBy :: (a -> a -> Bool) -> FMList a -> FMList a #

deleteBy :: (a -> a -> Bool) -> a -> FMList a -> FMList a #

deleteFirstsBy :: (a -> a -> Bool) -> FMList a -> FMList a -> FMList a #

unionBy :: (a -> a -> Bool) -> FMList a -> FMList a -> FMList a #

intersectBy :: (a -> a -> Bool) -> FMList a -> FMList a -> FMList a #

groupBy :: (ListLike full' (FMList a), Eq a) => (a -> a -> Bool) -> FMList a -> full' #

sortBy :: (a -> a -> Ordering) -> FMList a -> FMList a #

insertBy :: (a -> a -> Ordering) -> a -> FMList a -> FMList a #

genericLength :: Num a0 => FMList a -> a0 #

genericTake :: Integral a0 => a0 -> FMList a -> FMList a #

genericDrop :: Integral a0 => a0 -> FMList a -> FMList a #

genericSplitAt :: Integral a0 => a0 -> FMList a -> (FMList a, FMList a) #

genericReplicate :: Integral a0 => a0 -> a -> FMList a #

FoldableLL (FMList a) a # |
Instance details Methods foldl :: (a0 -> a -> a0) -> a0 -> FMList a -> a0 # foldl' :: (a0 -> a -> a0) -> a0 -> FMList a -> a0 # foldl1 :: (a -> a -> a) -> FMList a -> a # foldr :: (a -> b -> b) -> b -> FMList a -> b # foldr' :: (a -> b -> b) -> b -> FMList a -> b # foldr1 :: (a -> a -> a) -> FMList a -> a #