Data.ListLike.Vector.Vector

ListLike-4.5.1: Generic support for list-like structures

Safe Haskell | None
Language | Haskell98

Data.ListLike.Vector.Vector

Contents

- Orphan instances

# Orphan instances

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