Data.Vector

Boxed vectors

Documentation

data Vector a

Instances

IVector Vector a

Eq a => Eq (Vector a)

Ord a => Ord (Vector a)

Show a => Show (Vector a)

Length information

length :: Vector a -> Int

null :: Vector a -> Bool

Construction

empty :: Vector a

Empty vector

singleton :: a -> Vector a

Vector with exaclty one element

cons :: a -> Vector a -> Vector a

Prepend an element

snoc :: Vector a -> a -> Vector a

Append an element

replicate :: Int -> a -> Vector a

Vector of the given length with the given value in each position

(++) :: Vector a -> Vector a -> Vector a

Concatenate two vectors

copy :: Vector a -> Vector a

Create a copy of a vector. Useful when dealing with slices.

Accessing individual elements

(!) :: Vector a -> Int -> a

Indexing

head :: Vector a -> a

First element

last :: Vector a -> a

Last element

indexM :: Monad m => Vector a -> Int -> m a

Monadic indexing which can be strict in the vector while remaining lazy in the element

headM :: Monad m => Vector a -> m a

lastM :: Monad m => Vector a -> m a

Subvectors

slice

Arguments

:: Vector a

-> Int

starting index

-> Int

length

-> Vector a

Yield a part of the vector without copying it. Safer version of unsafeSlice.

init :: Vector a -> Vector a

Yield all but the last element without copying.

tail :: Vector a -> Vector a

All but the first element (without copying).

take :: Int -> Vector a -> Vector a

Yield the first n elements without copying.

drop :: Int -> Vector a -> Vector a

Yield all but the first n elements without copying.

Permutations

accum :: (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a

(//) :: Vector a -> [(Int, a)] -> Vector a

update :: Vector a -> Vector (Int, a) -> Vector a

backpermute :: Vector a -> Vector Int -> Vector a

reverse :: Vector a -> Vector a

Mapping

map :: (a -> b) -> Vector a -> Vector b

Map a function over a vector

concatMap :: (a -> Vector b) -> Vector a -> Vector b

Zipping and unzipping

zipWith :: (a -> b -> c) -> Vector a -> Vector b -> Vector c

Zip two vectors with the given function.

zipWith3 :: (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d

Zip three vectors with the given function.

zip :: Vector a -> Vector b -> Vector (a, b)

zip3 :: Vector a -> Vector b -> Vector c -> Vector (a, b, c)

unzip :: Vector (a, b) -> (Vector a, Vector b)

unzip3 :: Vector (a, b, c) -> (Vector a, Vector b, Vector c)

Filtering

filter :: (a -> Bool) -> Vector a -> Vector a

Drop elements which do not satisfy the predicate

takeWhile :: (a -> Bool) -> Vector a -> Vector a

Yield the longest prefix of elements satisfying the predicate.

dropWhile :: (a -> Bool) -> Vector a -> Vector a

Drop the longest prefix of elements that satisfy the predicate.

Searching

elem :: Eq a => a -> Vector a -> Bool

Check whether the vector contains an element

notElem :: Eq a => a -> Vector a -> Bool

Inverse of elem

find :: (a -> Bool) -> Vector a -> Maybe a

Yield Just the first element matching the predicate or Nothing if no such element exists.

findIndex :: (a -> Bool) -> Vector a -> Maybe Int

Yield Just the index of the first element matching the predicate or Nothing if no such element exists.

Folding

foldl :: (a -> b -> a) -> a -> Vector b -> a

Left fold

foldl1 :: (a -> a -> a) -> Vector a -> a

Lefgt fold on non-empty vectors

foldl' :: (a -> b -> a) -> a -> Vector b -> a

Left fold with strict accumulator

foldl1' :: (a -> a -> a) -> Vector a -> a

Left fold on non-empty vectors with strict accumulator

foldr :: (a -> b -> b) -> b -> Vector a -> b

Right fold

foldr1 :: (a -> a -> a) -> Vector a -> a

Right fold on non-empty vectors

Specialised folds

and :: Vector Bool -> Bool

or :: Vector Bool -> Bool

sum :: Num a => Vector a -> a

product :: Num a => Vector a -> a

maximum :: Ord a => Vector a -> a

minimum :: Ord a => Vector a -> a

Unfolding

unfoldr :: (b -> Maybe (a, b)) -> b -> Vector a

Scans

prescanl :: (a -> b -> a) -> a -> Vector b -> Vector a

Prefix scan

prescanl' :: (a -> b -> a) -> a -> Vector b -> Vector a

Prefix scan with strict accumulator

Enumeration

enumFromTo :: Enum a => a -> a -> Vector a

enumFromThenTo :: Enum a => a -> a -> a -> Vector a

Conversion to/from lists

toList :: Vector a -> [a]

Convert a vector to a list

fromList :: [a] -> Vector a

Convert a list to a vector