Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Data.ListLike.Vector.Generic
Contents
Description
ListLike instance for any type supporting the Data.Vector.Generic
interface. To avoid collisions with other Vector instances, this module
must be imported directly.
Orphan instances
(Eq (v Char), Vector v Char) => StringLike (v Char) # | |
Methods toString :: v Char -> String # lines :: ListLike full (v Char) => v Char -> full # words :: ListLike full (v Char) => v Char -> full # unlines :: ListLike full (v Char) => full -> v Char # unwords :: ListLike full (v Char) => full -> v Char # show :: Show a => a -> v Char # fromStringLike :: StringLike s' => v Char -> s' # fromLazyText :: Text -> v Char # | |
(Eq (v Char), Vector v Char) => IsString (v Char) # | |
Methods fromString :: String -> v Char # | |
(IsList (v a), Item (v a) ~ a, Monoid (v a), Eq (v a), Vector v a) => ListLike (v a) a # | |
Methods uncons :: v a -> Maybe (a, v a) # map :: ListLike full' item' => (a -> item') -> v a -> full' # rigidMap :: (a -> a) -> v a -> v a # intersperse :: a -> v a -> v a # concat :: ListLike full' (v a) => full' -> v a # concatMap :: ListLike full' item' => (a -> full') -> v a -> full' # rigidConcatMap :: (a -> v a) -> v a -> v a # any :: (a -> Bool) -> v a -> Bool # all :: (a -> Bool) -> v a -> Bool # replicate :: Int -> a -> v a # splitAt :: Int -> v a -> (v a, v a) # takeWhile :: (a -> Bool) -> v a -> v a # dropWhile :: (a -> Bool) -> v a -> v a # dropWhileEnd :: (a -> Bool) -> v a -> v a # span :: (a -> Bool) -> v a -> (v a, v a) # break :: (a -> Bool) -> v a -> (v a, v a) # group :: (ListLike full' (v a), Eq a) => v a -> full' # inits :: ListLike full' (v a) => v a -> full' # tails :: ListLike full' (v a) => v a -> full' # isPrefixOf :: v a -> v a -> Bool # isSuffixOf :: v a -> v a -> Bool # isInfixOf :: v a -> v a -> Bool # stripPrefix :: v a -> v a -> Maybe (v a) # stripSuffix :: v a -> v a -> Maybe (v a) # find :: (a -> Bool) -> v a -> Maybe a # filter :: (a -> Bool) -> v a -> v a # partition :: (a -> Bool) -> v a -> (v a, v a) # elemIndex :: a -> v a -> Maybe Int # elemIndices :: (Eq a, ListLike result Int) => a -> v a -> result # findIndex :: (a -> Bool) -> v a -> Maybe Int # findIndices :: ListLike result Int => (a -> Bool) -> v a -> result # sequence :: (Applicative m, ListLike fullinp (m a)) => fullinp -> m (v a) # mapM :: (Applicative m, ListLike full' item') => (a -> m item') -> v a -> m full' # rigidMapM :: Monad m => (a -> m a) -> v a -> m (v a) # deleteFirsts :: v a -> v a -> v a # intersect :: v a -> v a -> v a # fromListLike :: ListLike full' a => v a -> full' # nubBy :: (a -> a -> Bool) -> v a -> v a # deleteBy :: (a -> a -> Bool) -> a -> v a -> v a # deleteFirstsBy :: (a -> a -> Bool) -> v a -> v a -> v a # unionBy :: (a -> a -> Bool) -> v a -> v a -> v a # intersectBy :: (a -> a -> Bool) -> v a -> v a -> v a # groupBy :: (ListLike full' (v a), Eq a) => (a -> a -> Bool) -> v a -> full' # sortBy :: (a -> a -> Ordering) -> v a -> v a # insertBy :: (a -> a -> Ordering) -> a -> v a -> v a # genericLength :: Num a0 => v a -> a0 # genericTake :: Integral a0 => a0 -> v a -> v a # genericDrop :: Integral a0 => a0 -> v a -> v a # genericSplitAt :: Integral a0 => a0 -> v a -> (v a, v a) # genericReplicate :: Integral a0 => a0 -> a -> v a # | |
Vector v a => FoldableLL (v a) a # | |