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

Language | Haskell2010 |

# Orphan instances

IsString (Vector Char) Source # | |

fromString :: String -> Vector Char # | |

StringLike (Vector Char) Source # | |

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

Storable a => FoldableLL (Vector a) a Source # | |

Storable a => ListLike (Vector a) a Source # | |

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