Safe Haskell | None |
---|---|

Language | Haskell2010 |

`ListLike`

instances for `FMList`

# Orphan instances

MonadZip FMList Source # | |

IsList (FMList a) Source # | |

IsString (FMList Char) Source # | |

fromString :: String -> FMList Char # | |

StringLike (FMList Char) Source # | |

toString :: FMList Char -> String Source # lines :: ListLike full (FMList Char) => FMList Char -> full Source # words :: ListLike full (FMList Char) => FMList Char -> full Source # unlines :: ListLike full (FMList Char) => full -> FMList Char Source # unwords :: ListLike full (FMList Char) => full -> FMList Char Source # show :: Show a => a -> FMList Char Source # fromStringLike :: StringLike s' => FMList Char -> s' Source # fromText :: Text -> FMList Char Source # fromLazyText :: Text -> FMList Char Source # | |

FoldableLL (FMList a) a Source # | |

InfiniteListLike (FMList a) a Source # | |

ListLike (FMList a) a Source # | |

singleton :: a -> FMList a Source # cons :: a -> FMList a -> FMList a Source # snoc :: FMList a -> a -> FMList a Source # append :: FMList a -> FMList a -> FMList a Source # head :: FMList a -> a Source # uncons :: FMList a -> Maybe (a, FMList a) Source # last :: FMList a -> a Source # tail :: FMList a -> FMList a Source # init :: FMList a -> FMList a Source # null :: FMList a -> Bool Source # length :: FMList a -> Int Source # map :: ListLike full' item' => (a -> item') -> FMList a -> full' Source # rigidMap :: (a -> a) -> FMList a -> FMList a Source # reverse :: FMList a -> FMList a Source # intersperse :: a -> FMList a -> FMList a Source # concat :: ListLike full' (FMList a) => full' -> FMList a Source # concatMap :: ListLike full' item' => (a -> full') -> FMList a -> full' Source # rigidConcatMap :: (a -> FMList a) -> FMList a -> FMList a Source # any :: (a -> Bool) -> FMList a -> Bool Source # all :: (a -> Bool) -> FMList a -> Bool Source # maximum :: FMList a -> a Source # minimum :: FMList a -> a Source # replicate :: Int -> a -> FMList a Source # take :: Int -> FMList a -> FMList a Source # drop :: Int -> FMList a -> FMList a Source # splitAt :: Int -> FMList a -> (FMList a, FMList a) Source # takeWhile :: (a -> Bool) -> FMList a -> FMList a Source # dropWhile :: (a -> Bool) -> FMList a -> FMList a Source # dropWhileEnd :: (a -> Bool) -> FMList a -> FMList a Source # span :: (a -> Bool) -> FMList a -> (FMList a, FMList a) Source # break :: (a -> Bool) -> FMList a -> (FMList a, FMList a) Source # group :: (ListLike full' (FMList a), Eq a) => FMList a -> full' Source # inits :: ListLike full' (FMList a) => FMList a -> full' Source # tails :: ListLike full' (FMList a) => FMList a -> full' Source # isPrefixOf :: FMList a -> FMList a -> Bool Source # isSuffixOf :: FMList a -> FMList a -> Bool Source # isInfixOf :: FMList a -> FMList a -> Bool Source # stripPrefix :: FMList a -> FMList a -> Maybe (FMList a) Source # stripSuffix :: FMList a -> FMList a -> Maybe (FMList a) Source # elem :: a -> FMList a -> Bool Source # notElem :: a -> FMList a -> Bool Source # find :: (a -> Bool) -> FMList a -> Maybe a Source # filter :: (a -> Bool) -> FMList a -> FMList a Source # partition :: (a -> Bool) -> FMList a -> (FMList a, FMList a) Source # index :: FMList a -> Int -> a Source # elemIndex :: a -> FMList a -> Maybe Int Source # elemIndices :: (Eq a, ListLike result Int) => a -> FMList a -> result Source # findIndex :: (a -> Bool) -> FMList a -> Maybe Int Source # findIndices :: ListLike result Int => (a -> Bool) -> FMList a -> result Source # sequence :: (Monad m, ListLike fullinp (m a)) => fullinp -> m (FMList a) Source # mapM :: (Monad m, ListLike full' item') => (a -> m item') -> FMList a -> m full' Source # rigidMapM :: Monad m => (a -> m a) -> FMList a -> m (FMList a) Source # nub :: FMList a -> FMList a Source # delete :: a -> FMList a -> FMList a Source # deleteFirsts :: FMList a -> FMList a -> FMList a Source # union :: FMList a -> FMList a -> FMList a Source # intersect :: FMList a -> FMList a -> FMList a Source # sort :: FMList a -> FMList a Source # insert :: a -> FMList a -> FMList a Source # toList' :: FMList a -> [a] Source # fromList' :: [a] -> FMList a Source # fromListLike :: ListLike full' a => FMList a -> full' Source # nubBy :: (a -> a -> Bool) -> FMList a -> FMList a Source # deleteBy :: (a -> a -> Bool) -> a -> FMList a -> FMList a Source # deleteFirstsBy :: (a -> a -> Bool) -> FMList a -> FMList a -> FMList a Source # unionBy :: (a -> a -> Bool) -> FMList a -> FMList a -> FMList a Source # intersectBy :: (a -> a -> Bool) -> FMList a -> FMList a -> FMList a Source # groupBy :: (ListLike full' (FMList a), Eq a) => (a -> a -> Bool) -> FMList a -> full' Source # sortBy :: (a -> a -> Ordering) -> FMList a -> FMList a Source # insertBy :: (a -> a -> Ordering) -> a -> FMList a -> FMList a Source # genericLength :: Num a0 => FMList a -> a0 Source # genericTake :: Integral a0 => a0 -> FMList a -> FMList a Source # genericDrop :: Integral a0 => a0 -> FMList a -> FMList a Source # genericSplitAt :: Integral a0 => a0 -> FMList a -> (FMList a, FMList a) Source # genericReplicate :: Integral a0 => a0 -> a -> FMList a Source # |