vector-0.12.0.1: Efficient Arrays

Copyright (c) Roman Leshchinskiy 2008-2010 BSD-style Roman Leshchinskiy experimental non-portable None Haskell2010

Data.Vector.Primitive

Description

Unboxed vectors of primitive types. The use of this module is not recommended except in very special cases. Adaptive unboxed vectors defined in Data.Vector.Unboxed are significantly more flexible at no performance cost.

Synopsis

# Primitive vectors

data Vector a Source #

Unboxed vectors of primitive types

Constructors

 Vector !Int !Int !ByteArray offset, length, underlying byte array
Instances

data MVector s a Source #

Mutable vectors of primitive types.

Constructors

 MVector !Int !Int !(MutableByteArray s) offset, length, underlying mutable byte array
Instances

class Prim a #

Minimal complete definition

Instances

# Accessors

## Length information

length :: Prim a => Vector a -> Int Source #

O(1) Yield the length of the vector

null :: Prim a => Vector a -> Bool Source #

O(1) Test whether a vector is empty

## Indexing

(!) :: Prim a => Vector a -> Int -> a Source #

O(1) Indexing

(!?) :: Prim a => Vector a -> Int -> Maybe a Source #

O(1) Safe indexing

head :: Prim a => Vector a -> a Source #

O(1) First element

last :: Prim a => Vector a -> a Source #

O(1) Last element

unsafeIndex :: Prim a => Vector a -> Int -> a Source #

O(1) Unsafe indexing without bounds checking

unsafeHead :: Prim a => Vector a -> a Source #

O(1) First element without checking if the vector is empty

unsafeLast :: Prim a => Vector a -> a Source #

O(1) Last element without checking if the vector is empty

indexM :: (Prim a, Monad m) => Vector a -> Int -> m a Source #

The monad allows operations to be strict in the vector when necessary. Suppose vector copying is implemented like this:

copy mv v = ... write mv i (v ! i) ...

For lazy vectors, v ! i would not be evaluated which means that mv would unnecessarily retain a reference to v in each element written.

With indexM, copying can be implemented like this instead:

copy mv v = ... do
x <- indexM v i
write mv i x

Here, no references to v are retained because indexing (but not the elements) is evaluated eagerly.

headM :: (Prim a, Monad m) => Vector a -> m a Source #

O(1) First element of a vector in a monad. See indexM for an explanation of why this is useful.

lastM :: (Prim a, Monad m) => Vector a -> m a Source #

O(1) Last element of a vector in a monad. See indexM for an explanation of why this is useful.

unsafeIndexM :: (Prim a, Monad m) => Vector a -> Int -> m a Source #

O(1) Indexing in a monad without bounds checks. See indexM for an explanation of why this is useful.

unsafeHeadM :: (Prim a, Monad m) => Vector a -> m a Source #

O(1) First element in a monad without checking for empty vectors. See indexM for an explanation of why this is useful.

unsafeLastM :: (Prim a, Monad m) => Vector a -> m a Source #

O(1) Last element in a monad without checking for empty vectors. See indexM for an explanation of why this is useful.

## Extracting subvectors (slicing)

Arguments

 :: Prim a => Int i starting index -> Int n length -> Vector a -> Vector a

O(1) Yield a slice of the vector without copying it. The vector must contain at least i+n elements.

init :: Prim a => Vector a -> Vector a Source #

O(1) Yield all but the last element without copying. The vector may not be empty.

tail :: Prim a => Vector a -> Vector a Source #

O(1) Yield all but the first element without copying. The vector may not be empty.

take :: Prim a => Int -> Vector a -> Vector a Source #

O(1) Yield at the first n elements without copying. The vector may contain less than n elements in which case it is returned unchanged.

drop :: Prim a => Int -> Vector a -> Vector a Source #

O(1) Yield all but the first n elements without copying. The vector may contain less than n elements in which case an empty vector is returned.

splitAt :: Prim a => Int -> Vector a -> (Vector a, Vector a) Source #

O(1) Yield the first n elements paired with the remainder without copying.

Note that splitAt n v is equivalent to (take n v, drop n v) but slightly more efficient.

Arguments

 :: Prim a => Int i starting index -> Int n length -> Vector a -> Vector a

O(1) Yield a slice of the vector without copying. The vector must contain at least i+n elements but this is not checked.

unsafeInit :: Prim a => Vector a -> Vector a Source #

O(1) Yield all but the last element without copying. The vector may not be empty but this is not checked.

unsafeTail :: Prim a => Vector a -> Vector a Source #

O(1) Yield all but the first element without copying. The vector may not be empty but this is not checked.

unsafeTake :: Prim a => Int -> Vector a -> Vector a Source #

O(1) Yield the first n elements without copying. The vector must contain at least n elements but this is not checked.

unsafeDrop :: Prim a => Int -> Vector a -> Vector a Source #

O(1) Yield all but the first n elements without copying. The vector must contain at least n elements but this is not checked.

# Construction

## Initialisation

empty :: Prim a => Vector a Source #

O(1) Empty vector

singleton :: Prim a => a -> Vector a Source #

O(1) Vector with exactly one element

replicate :: Prim a => Int -> a -> Vector a Source #

O(n) Vector of the given length with the same value in each position

generate :: Prim a => Int -> (Int -> a) -> Vector a Source #

O(n) Construct a vector of the given length by applying the function to each index

iterateN :: Prim a => Int -> (a -> a) -> a -> Vector a Source #

O(n) Apply function n times to value. Zeroth element is original value.

replicateM :: (Monad m, Prim a) => Int -> m a -> m (Vector a) Source #

O(n) Execute the monadic action the given number of times and store the results in a vector.

generateM :: (Monad m, Prim a) => Int -> (Int -> m a) -> m (Vector a) Source #

O(n) Construct a vector of the given length by applying the monadic action to each index

iterateNM :: (Monad m, Prim a) => Int -> (a -> m a) -> a -> m (Vector a) Source #

O(n) Apply monadic function n times to value. Zeroth element is original value.

create :: Prim a => (forall s. ST s (MVector s a)) -> Vector a Source #

Execute the monadic action and freeze the resulting vector.

create (do { v <- new 2; write v 0 'a'; write v 1 'b'; return v }) = <a,b>


createT :: (Traversable f, Prim a) => (forall s. ST s (f (MVector s a))) -> f (Vector a) Source #

Execute the monadic action and freeze the resulting vectors.

## Unfolding

unfoldr :: Prim a => (b -> Maybe (a, b)) -> b -> Vector a Source #

O(n) Construct a vector by repeatedly applying the generator function to a seed. The generator function yields Just the next element and the new seed or Nothing if there are no more elements.

unfoldr (\n -> if n == 0 then Nothing else Just (n,n-1)) 10
= <10,9,8,7,6,5,4,3,2,1>

unfoldrN :: Prim a => Int -> (b -> Maybe (a, b)) -> b -> Vector a Source #

O(n) Construct a vector with at most n elements by repeatedly applying the generator function to a seed. The generator function yields Just the next element and the new seed or Nothing if there are no more elements.

unfoldrN 3 (\n -> Just (n,n-1)) 10 = <10,9,8>

unfoldrM :: (Monad m, Prim a) => (b -> m (Maybe (a, b))) -> b -> m (Vector a) Source #

O(n) Construct a vector by repeatedly applying the monadic generator function to a seed. The generator function yields Just the next element and the new seed or Nothing if there are no more elements.

unfoldrNM :: (Monad m, Prim a) => Int -> (b -> m (Maybe (a, b))) -> b -> m (Vector a) Source #

O(n) Construct a vector by repeatedly applying the monadic generator function to a seed. The generator function yields Just the next element and the new seed or Nothing if there are no more elements.

constructN :: Prim a => Int -> (Vector a -> a) -> Vector a Source #

O(n) Construct a vector with n elements by repeatedly applying the generator function to the already constructed part of the vector.

constructN 3 f = let a = f <> ; b = f <a> ; c = f <a,b> in f <a,b,c>

constructrN :: Prim a => Int -> (Vector a -> a) -> Vector a Source #

O(n) Construct a vector with n elements from right to left by repeatedly applying the generator function to the already constructed part of the vector.

constructrN 3 f = let a = f <> ; b = f<a> ; c = f <b,a> in f <c,b,a>

## Enumeration

enumFromN :: (Prim a, Num a) => a -> Int -> Vector a Source #

O(n) Yield a vector of the given length containing the values x, x+1 etc. This operation is usually more efficient than enumFromTo.

enumFromN 5 3 = <5,6,7>

enumFromStepN :: (Prim a, Num a) => a -> a -> Int -> Vector a Source #

O(n) Yield a vector of the given length containing the values x, x+y, x+y+y etc. This operations is usually more efficient than enumFromThenTo.

enumFromStepN 1 0.1 5 = <1,1.1,1.2,1.3,1.4>

enumFromTo :: (Prim a, Enum a) => a -> a -> Vector a Source #

O(n) Enumerate values from x to y.

WARNING: This operation can be very inefficient. If at all possible, use enumFromN instead.

enumFromThenTo :: (Prim a, Enum a) => a -> a -> a -> Vector a Source #

O(n) Enumerate values from x to y with a specific step z.

WARNING: This operation can be very inefficient. If at all possible, use enumFromStepN instead.

## Concatenation

cons :: Prim a => a -> Vector a -> Vector a Source #

O(n) Prepend an element

snoc :: Prim a => Vector a -> a -> Vector a Source #

O(n) Append an element

(++) :: Prim a => Vector a -> Vector a -> Vector a infixr 5 Source #

O(m+n) Concatenate two vectors

concat :: Prim a => [Vector a] -> Vector a Source #

O(n) Concatenate all vectors in the list

## Restricting memory usage

force :: Prim a => Vector a -> Vector a Source #

O(n) Yield the argument but force it not to retain any extra memory, possibly by copying it.

This is especially useful when dealing with slices. For example:

force (slice 0 2 <huge vector>)

Here, the slice retains a reference to the huge vector. Forcing it creates a copy of just the elements that belong to the slice and allows the huge vector to be garbage collected.

# Modifying vectors

Arguments

 :: Prim a => Vector a initial vector (of length m) -> [(Int, a)] list of index/value pairs (of length n) -> Vector a

O(m+n) For each pair (i,a) from the list, replace the vector element at position i by a.

<5,9,2,7> // [(2,1),(0,3),(2,8)] = <3,9,8,7>

Arguments

 :: Prim a => Vector a initial vector (of length m) -> Vector Int index vector (of length n1) -> Vector a value vector (of length n2) -> Vector a

O(m+min(n1,n2)) For each index i from the index vector and the corresponding value a from the value vector, replace the element of the initial vector at position i by a.

update_ <5,9,2,7>  <2,0,2> <1,3,8> = <3,9,8,7>

unsafeUpd :: Prim a => Vector a -> [(Int, a)] -> Vector a Source #

Same as (//) but without bounds checking.

unsafeUpdate_ :: Prim a => Vector a -> Vector Int -> Vector a -> Vector a Source #

Same as update_ but without bounds checking.

## Accumulations

Arguments

 :: Prim a => (a -> b -> a) accumulating function f -> Vector a initial vector (of length m) -> [(Int, b)] list of index/value pairs (of length n) -> Vector a

O(m+n) For each pair (i,b) from the list, replace the vector element a at position i by f a b.

accum (+) <5,9,2> [(2,4),(1,6),(0,3),(1,7)] = <5+3, 9+6+7, 2+4>

Arguments

 :: (Prim a, Prim b) => (a -> b -> a) accumulating function f -> Vector a initial vector (of length m) -> Vector Int index vector (of length n1) -> Vector b value vector (of length n2) -> Vector a

O(m+min(n1,n2)) For each index i from the index vector and the corresponding value b from the the value vector, replace the element of the initial vector at position i by f a b.

accumulate_ (+) <5,9,2> <2,1,0,1> <4,6,3,7> = <5+3, 9+6+7, 2+4>

unsafeAccum :: Prim a => (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a Source #

Same as accum but without bounds checking.

unsafeAccumulate_ :: (Prim a, Prim b) => (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a Source #

Same as accumulate_ but without bounds checking.

## Permutations

reverse :: Prim a => Vector a -> Vector a Source #

O(n) Reverse a vector

backpermute :: Prim a => Vector a -> Vector Int -> Vector a Source #

O(n) Yield the vector obtained by replacing each element i of the index vector by xs!i. This is equivalent to map (xs!) is but is often much more efficient.

backpermute <a,b,c,d> <0,3,2,3,1,0> = <a,d,c,d,b,a>

unsafeBackpermute :: Prim a => Vector a -> Vector Int -> Vector a Source #

Same as backpermute but without bounds checking.

modify :: Prim a => (forall s. MVector s a -> ST s ()) -> Vector a -> Vector a Source #

Apply a destructive operation to a vector. The operation will be performed in place if it is safe to do so and will modify a copy of the vector otherwise.

modify (\v -> write v 0 'x') (replicate 3 'a') = <'x','a','a'>


# Elementwise operations

## Mapping

map :: (Prim a, Prim b) => (a -> b) -> Vector a -> Vector b Source #

O(n) Map a function over a vector

imap :: (Prim a, Prim b) => (Int -> a -> b) -> Vector a -> Vector b Source #

O(n) Apply a function to every element of a vector and its index

concatMap :: (Prim a, Prim b) => (a -> Vector b) -> Vector a -> Vector b Source #

Map a function over a vector and concatenate the results.

mapM :: (Monad m, Prim a, Prim b) => (a -> m b) -> Vector a -> m (Vector b) Source #

O(n) Apply the monadic action to all elements of the vector, yielding a vector of results

mapM_ :: (Monad m, Prim a) => (a -> m b) -> Vector a -> m () Source #

O(n) Apply the monadic action to all elements of a vector and ignore the results

forM :: (Monad m, Prim a, Prim b) => Vector a -> (a -> m b) -> m (Vector b) Source #

O(n) Apply the monadic action to all elements of the vector, yielding a vector of results. Equivalent to flip mapM.

forM_ :: (Monad m, Prim a) => Vector a -> (a -> m b) -> m () Source #

O(n) Apply the monadic action to all elements of a vector and ignore the results. Equivalent to flip mapM_.

## Zipping

zipWith :: (Prim a, Prim b, Prim c) => (a -> b -> c) -> Vector a -> Vector b -> Vector c Source #

O(min(m,n)) Zip two vectors with the given function.

zipWith3 :: (Prim a, Prim b, Prim c, Prim d) => (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d Source #

Zip three vectors with the given function.

zipWith4 :: (Prim a, Prim b, Prim c, Prim d, Prim e) => (a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e Source #

zipWith5 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f) => (a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f Source #

zipWith6 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f, Prim g) => (a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g Source #

izipWith :: (Prim a, Prim b, Prim c) => (Int -> a -> b -> c) -> Vector a -> Vector b -> Vector c Source #

O(min(m,n)) Zip two vectors with a function that also takes the elements' indices.

izipWith3 :: (Prim a, Prim b, Prim c, Prim d) => (Int -> a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d Source #

Zip three vectors and their indices with the given function.

izipWith4 :: (Prim a, Prim b, Prim c, Prim d, Prim e) => (Int -> a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e Source #

izipWith5 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f) => (Int -> a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f Source #

izipWith6 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f, Prim g) => (Int -> a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g Source #

zipWithM :: (Monad m, Prim a, Prim b, Prim c) => (a -> b -> m c) -> Vector a -> Vector b -> m (Vector c) Source #

O(min(m,n)) Zip the two vectors with the monadic action and yield a vector of results

zipWithM_ :: (Monad m, Prim a, Prim b) => (a -> b -> m c) -> Vector a -> Vector b -> m () Source #

O(min(m,n)) Zip the two vectors with the monadic action and ignore the results

# Working with predicates

## Filtering

filter :: Prim a => (a -> Bool) -> Vector a -> Vector a Source #

O(n) Drop elements that do not satisfy the predicate

ifilter :: Prim a => (Int -> a -> Bool) -> Vector a -> Vector a Source #

O(n) Drop elements that do not satisfy the predicate which is applied to values and their indices

uniq :: (Prim a, Eq a) => Vector a -> Vector a Source #

mapMaybe :: (Prim a, Prim b) => (a -> Maybe b) -> Vector a -> Vector b Source #

O(n) Drop elements when predicate returns Nothing

imapMaybe :: (Prim a, Prim b) => (Int -> a -> Maybe b) -> Vector a -> Vector b Source #

O(n) Drop elements when predicate, applied to index and value, returns Nothing

filterM :: (Monad m, Prim a) => (a -> m Bool) -> Vector a -> m (Vector a) Source #

O(n) Drop elements that do not satisfy the monadic predicate

takeWhile :: Prim a => (a -> Bool) -> Vector a -> Vector a Source #

O(n) Yield the longest prefix of elements satisfying the predicate without copying.

dropWhile :: Prim a => (a -> Bool) -> Vector a -> Vector a Source #

O(n) Drop the longest prefix of elements that satisfy the predicate without copying.

## Partitioning

partition :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a) Source #

O(n) Split the vector in two parts, the first one containing those elements that satisfy the predicate and the second one those that don't. The relative order of the elements is preserved at the cost of a sometimes reduced performance compared to unstablePartition.

unstablePartition :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a) Source #

O(n) Split the vector in two parts, the first one containing those elements that satisfy the predicate and the second one those that don't. The order of the elements is not preserved but the operation is often faster than partition.

span :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a) Source #

O(n) Split the vector into the longest prefix of elements that satisfy the predicate and the rest without copying.

break :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a) Source #

O(n) Split the vector into the longest prefix of elements that do not satisfy the predicate and the rest without copying.

## Searching

elem :: (Prim a, Eq a) => a -> Vector a -> Bool infix 4 Source #

O(n) Check if the vector contains an element

notElem :: (Prim a, Eq a) => a -> Vector a -> Bool infix 4 Source #

O(n) Check if the vector does not contain an element (inverse of elem)

find :: Prim a => (a -> Bool) -> Vector a -> Maybe a Source #

O(n) Yield Just the first element matching the predicate or Nothing if no such element exists.

findIndex :: Prim a => (a -> Bool) -> Vector a -> Maybe Int Source #

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

findIndices :: Prim a => (a -> Bool) -> Vector a -> Vector Int Source #

O(n) Yield the indices of elements satisfying the predicate in ascending order.

elemIndex :: (Prim a, Eq a) => a -> Vector a -> Maybe Int Source #

O(n) Yield Just the index of the first occurence of the given element or Nothing if the vector does not contain the element. This is a specialised version of findIndex.

elemIndices :: (Prim a, Eq a) => a -> Vector a -> Vector Int Source #

O(n) Yield the indices of all occurences of the given element in ascending order. This is a specialised version of findIndices.

# Folding

foldl :: Prim b => (a -> b -> a) -> a -> Vector b -> a Source #

O(n) Left fold

foldl1 :: Prim a => (a -> a -> a) -> Vector a -> a Source #

O(n) Left fold on non-empty vectors

foldl' :: Prim b => (a -> b -> a) -> a -> Vector b -> a Source #

O(n) Left fold with strict accumulator

foldl1' :: Prim a => (a -> a -> a) -> Vector a -> a Source #

O(n) Left fold on non-empty vectors with strict accumulator

foldr :: Prim a => (a -> b -> b) -> b -> Vector a -> b Source #

O(n) Right fold

foldr1 :: Prim a => (a -> a -> a) -> Vector a -> a Source #

O(n) Right fold on non-empty vectors

foldr' :: Prim a => (a -> b -> b) -> b -> Vector a -> b Source #

O(n) Right fold with a strict accumulator

foldr1' :: Prim a => (a -> a -> a) -> Vector a -> a Source #

O(n) Right fold on non-empty vectors with strict accumulator

ifoldl :: Prim b => (a -> Int -> b -> a) -> a -> Vector b -> a Source #

O(n) Left fold (function applied to each element and its index)

ifoldl' :: Prim b => (a -> Int -> b -> a) -> a -> Vector b -> a Source #

O(n) Left fold with strict accumulator (function applied to each element and its index)

ifoldr :: Prim a => (Int -> a -> b -> b) -> b -> Vector a -> b Source #

O(n) Right fold (function applied to each element and its index)

ifoldr' :: Prim a => (Int -> a -> b -> b) -> b -> Vector a -> b Source #

O(n) Right fold with strict accumulator (function applied to each element and its index)

## Specialised folds

all :: Prim a => (a -> Bool) -> Vector a -> Bool Source #

O(n) Check if all elements satisfy the predicate.

any :: Prim a => (a -> Bool) -> Vector a -> Bool Source #

O(n) Check if any element satisfies the predicate.

sum :: (Prim a, Num a) => Vector a -> a Source #

O(n) Compute the sum of the elements

product :: (Prim a, Num a) => Vector a -> a Source #

O(n) Compute the produce of the elements

maximum :: (Prim a, Ord a) => Vector a -> a Source #

O(n) Yield the maximum element of the vector. The vector may not be empty.

maximumBy :: Prim a => (a -> a -> Ordering) -> Vector a -> a Source #

O(n) Yield the maximum element of the vector according to the given comparison function. The vector may not be empty.

minimum :: (Prim a, Ord a) => Vector a -> a Source #

O(n) Yield the minimum element of the vector. The vector may not be empty.

minimumBy :: Prim a => (a -> a -> Ordering) -> Vector a -> a Source #

O(n) Yield the minimum element of the vector according to the given comparison function. The vector may not be empty.

minIndex :: (Prim a, Ord a) => Vector a -> Int Source #

O(n) Yield the index of the minimum element of the vector. The vector may not be empty.

minIndexBy :: Prim a => (a -> a -> Ordering) -> Vector a -> Int Source #

O(n) Yield the index of the minimum element of the vector according to the given comparison function. The vector may not be empty.

maxIndex :: (Prim a, Ord a) => Vector a -> Int Source #

O(n) Yield the index of the maximum element of the vector. The vector may not be empty.

maxIndexBy :: Prim a => (a -> a -> Ordering) -> Vector a -> Int Source #

O(n) Yield the index of the maximum element of the vector according to the given comparison function. The vector may not be empty.

foldM :: (Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m a Source #

foldM' :: (Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m a Source #

O(n) Monadic fold with strict accumulator

fold1M :: (Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m a Source #

O(n) Monadic fold over non-empty vectors

fold1M' :: (Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m a Source #

O(n) Monadic fold over non-empty vectors with strict accumulator

foldM_ :: (Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m () Source #

foldM'_ :: (Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m () Source #

fold1M_ :: (Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m () Source #

fold1M'_ :: (Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m () Source #

O(n) Monadic fold over non-empty vectors with strict accumulator that discards the result

# Prefix sums (scans)

prescanl :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a Source #

O(n) Prescan

prescanl f z = init . scanl f z


Example: prescanl (+) 0 <1,2,3,4> = <0,1,3,6>

prescanl' :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a Source #

O(n) Prescan with strict accumulator

postscanl :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a Source #

O(n) Scan

postscanl f z = tail . scanl f z


Example: postscanl (+) 0 <1,2,3,4> = <1,3,6,10>

postscanl' :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a Source #

O(n) Scan with strict accumulator

scanl :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a Source #

scanl f z <x1,...,xn> = <y1,...,y(n+1)>
where y1 = z
yi = f y(i-1) x(i-1)

Example: scanl (+) 0 <1,2,3,4> = <0,1,3,6,10>

scanl' :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a Source #

O(n) Haskell-style scan with strict accumulator

scanl1 :: Prim a => (a -> a -> a) -> Vector a -> Vector a Source #

O(n) Scan over a non-empty vector

scanl f <x1,...,xn> = <y1,...,yn>
where y1 = x1
yi = f y(i-1) xi

scanl1' :: Prim a => (a -> a -> a) -> Vector a -> Vector a Source #

O(n) Scan over a non-empty vector with a strict accumulator

prescanr :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b Source #

O(n) Right-to-left prescan

prescanr f z = reverse . prescanl (flip f) z . reverse


prescanr' :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b Source #

O(n) Right-to-left prescan with strict accumulator

postscanr :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b Source #

O(n) Right-to-left scan

postscanr' :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b Source #

O(n) Right-to-left scan with strict accumulator

scanr :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b Source #

scanr' :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b Source #

O(n) Right-to-left Haskell-style scan with strict accumulator

scanr1 :: Prim a => (a -> a -> a) -> Vector a -> Vector a Source #

O(n) Right-to-left scan over a non-empty vector

scanr1' :: Prim a => (a -> a -> a) -> Vector a -> Vector a Source #

O(n) Right-to-left scan over a non-empty vector with a strict accumulator

# Conversions

## Lists

toList :: Prim a => Vector a -> [a] Source #

O(n) Convert a vector to a list

fromList :: Prim a => [a] -> Vector a Source #

O(n) Convert a list to a vector

fromListN :: Prim a => Int -> [a] -> Vector a Source #

O(n) Convert the first n elements of a list to a vector

fromListN n xs = fromList (take n xs)


## Other vector types

convert :: (Vector v a, Vector w a) => v a -> w a Source #

O(n) Convert different vector types

## Mutable vectors

freeze :: (Prim a, PrimMonad m) => MVector (PrimState m) a -> m (Vector a) Source #

O(n) Yield an immutable copy of the mutable vector.

thaw :: (Prim a, PrimMonad m) => Vector a -> m (MVector (PrimState m) a) Source #

O(n) Yield a mutable copy of the immutable vector.

copy :: (Prim a, PrimMonad m) => MVector (PrimState m) a -> Vector a -> m () Source #

O(n) Copy an immutable vector into a mutable one. The two vectors must have the same length.

unsafeFreeze :: (Prim a, PrimMonad m) => MVector (PrimState m) a -> m (Vector a) Source #

O(1) Unsafe convert a mutable vector to an immutable one without copying. The mutable vector may not be used after this operation.

unsafeThaw :: (Prim a, PrimMonad m) => Vector a -> m (MVector (PrimState m) a) Source #

O(1) Unsafely convert an immutable vector to a mutable one without copying. The immutable vector may not be used after this operation.

unsafeCopy :: (Prim a, PrimMonad m) => MVector (PrimState m) a -> Vector a -> m () Source #

O(n) Copy an immutable vector into a mutable one. The two vectors must have the same length. This is not checked.