Data.Vector.Vinyl.Default.Empty.Monomorphic

There are two vector types provided by this module: Vector and MVector. They must be parameterized over a type that unifies with 'Rec Identity rs'. An example would be:

foo :: Vector (Rec Identity '[Int,Char,Bool])

This vector stores records that have an Int, a Char, and a Bool.

Documentation

data Vector :: * -> *

Instances

(Vector Vector (Rec * Identity rs), HasDefaultVector r) => Vector Vector (Rec * Identity ((:) * r rs))

Vector Vector (Rec * Identity ([] *))

type Mutable Vector = MVector

data MVector :: * -> * -> *

Instances

(MVector MVector (Rec * Identity rs), HasDefaultVector r) => MVector MVector (Rec * Identity ((:) * r rs))

MVector MVector (Rec * Identity ([] *))

Accessors

Length information

length :: Vector (Rec Identity rs) -> Int

O(1) Yield the length of the vector.

null :: Vector (Rec Identity rs) -> Bool

O(1) Test whether a vector if empty

Indexing

(!) :: Vector Vector (Rec Identity rs) => Vector (Rec Identity rs) -> Int -> Rec Identity rs

O(1) Indexing

(!?) :: Vector Vector (Rec Identity rs) => Vector (Rec Identity rs) -> Int -> Maybe (Rec Identity rs)

O(1) Safe indexing

head :: Vector Vector (Rec Identity rs) => Vector (Rec Identity rs) -> Rec Identity rs

O(1) First element

last :: Vector Vector (Rec Identity rs) => Vector (Rec Identity rs) -> Rec Identity rs

O(1) Last element

unsafeIndex :: Vector Vector (Rec Identity rs) => Vector (Rec Identity rs) -> Int -> Rec Identity rs

O(1) Unsafe indexing without bounds checking

unsafeHead :: Vector Vector (Rec Identity rs) => Vector (Rec Identity rs) -> Rec Identity rs

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

unsafeLast :: Vector Vector (Rec Identity rs) => Vector (Rec Identity rs) -> Rec Identity rs

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

Monadic indexing

indexM :: (Monad m, Vector Vector (Rec Identity rs)) => Vector (Rec Identity rs) -> Int -> m (Rec Identity rs)

O(1) Indexing in a monad.

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 :: (Monad m, Vector Vector (Rec Identity rs)) => Vector (Rec Identity rs) -> m (Rec Identity rs)

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

lastM :: (Monad m, Vector Vector (Rec Identity rs)) => Vector (Rec Identity rs) -> m (Rec Identity rs)

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

unsafeIndexM :: (Monad m, Vector Vector (Rec Identity rs)) => Vector (Rec Identity rs) -> Int -> m (Rec Identity rs)

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

unsafeHeadM :: (Monad m, Vector Vector (Rec Identity rs)) => Vector (Rec Identity rs) -> m (Rec Identity rs)

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

unsafeLastM :: (Monad m, Vector Vector (Rec Identity rs)) => Vector (Rec Identity rs) -> m (Rec Identity rs)

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)

slice

Arguments

:: Vector Vector (Rec Identity rs)

=> Int

i starting index

-> Int

n length

-> Vector (Rec Identity rs)

-> Vector (Rec Identity rs)

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

init :: Vector Vector (Rec Identity rs) => Vector (Rec Identity rs) -> Vector (Rec Identity rs)

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

tail :: Vector Vector (Rec Identity rs) => Vector (Rec Identity rs) -> Vector (Rec Identity rs)

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

take :: Vector Vector (Rec Identity rs) => Int -> Vector (Rec Identity rs) -> Vector (Rec Identity rs)

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 :: Vector Vector (Rec Identity rs) => Int -> Vector (Rec Identity rs) -> Vector (Rec Identity rs)

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 :: Vector Vector (Rec Identity rs) => Int -> Vector (Rec Identity rs) -> (Vector (Rec Identity rs), Vector (Rec Identity rs))

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.

unsafeSlice

Arguments

:: Vector Vector (Rec Identity rs)

=> Int

i starting index

-> Int

n length

-> Vector (Rec Identity rs)

-> Vector (Rec Identity rs)

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 :: Vector Vector (Rec Identity rs) => Vector (Rec Identity rs) -> Vector (Rec Identity rs)

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

unsafeTail :: Vector Vector (Rec Identity rs) => Vector (Rec Identity rs) -> Vector (Rec Identity rs)

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

unsafeTake :: Vector Vector (Rec Identity rs) => Int -> Vector (Rec Identity rs) -> Vector (Rec Identity rs)

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

unsafeDrop :: Vector Vector (Rec Identity rs) => Int -> Vector (Rec Identity rs) -> Vector (Rec Identity rs)

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 :: Vector Vector (Rec Identity rs) => Vector (Rec Identity rs)

O(1) Empty vector

singleton :: Vector Vector (Rec Identity rs) => Rec Identity rs -> Vector (Rec Identity rs)

O(1) Vector with exactly one element

replicate :: Vector Vector (Rec Identity rs) => Int -> Rec Identity rs -> Vector (Rec Identity rs)

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

generate :: Vector Vector (Rec Identity rs) => Int -> (Int -> Rec Identity rs) -> Vector (Rec Identity rs)

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

iterateN :: Vector Vector (Rec Identity rs) => Int -> (Rec Identity rs -> Rec Identity rs) -> Rec Identity rs -> Vector (Rec Identity rs)

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

Monadic initialisation

replicateM :: (Monad m, Vector Vector (Rec Identity rs)) => Int -> m (Rec Identity rs) -> m (Vector (Rec Identity rs))

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

generateM :: (Monad m, Vector Vector (Rec Identity rs)) => Int -> (Int -> m (Rec Identity rs)) -> m (Vector (Rec Identity rs))

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

create :: Vector Vector (Rec Identity rs) => (forall s. ST s (Mutable Vector s (Rec Identity rs))) -> Vector (Rec Identity rs)

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>

Unfolding

unfoldr :: Vector Vector (Rec Identity rs) => (c -> Maybe (Rec Identity rs, c)) -> c -> Vector (Rec Identity rs)

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 :: Vector Vector (Rec Identity rs) => Int -> (c -> Maybe (Rec Identity rs, c)) -> c -> Vector (Rec Identity rs)

O(n) Construct a vector with at most n by repeatedly applying the generator function to the 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>

constructN :: Vector Vector (Rec Identity rs) => Int -> (Vector (Rec Identity rs) -> Rec Identity rs) -> Vector (Rec Identity rs)

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 :: Vector Vector (Rec Identity rs) => Int -> (Vector (Rec Identity rs) -> Rec Identity rs) -> Vector (Rec Identity rs)

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>

Concatenation

cons :: Vector Vector (Rec Identity rs) => Rec Identity rs -> Vector (Rec Identity rs) -> Vector (Rec Identity rs)

O(n) Prepend an element

snoc :: Vector Vector (Rec Identity rs) => Vector (Rec Identity rs) -> Rec Identity rs -> Vector (Rec Identity rs)

O(n) Append an element

(++) :: Vector Vector (Rec Identity rs) => Vector (Rec Identity rs) -> Vector (Rec Identity rs) -> Vector (Rec Identity rs) infixr 5

O(m+n) Concatenate two vectors

concat :: Vector Vector (Rec Identity rs) => [Vector (Rec Identity rs)] -> Vector (Rec Identity rs)

O(n) Concatenate all vectors in the list

Restricting memory usage

force :: Vector Vector (Rec Identity rs) => Vector (Rec Identity rs) -> Vector (Rec Identity rs)

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

Bulk updates

(//)

Arguments

:: Vector Vector (Rec Identity rs)

=> Vector (Rec Identity rs)

initial vector (of length m)

-> [(Int, Rec Identity rs)]

list of index/value pairs (of length n)

-> Vector (Rec Identity rs)

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>

unsafeUpd :: Vector Vector (Rec Identity rs) => Vector (Rec Identity rs) -> [(Int, Rec Identity rs)] -> Vector (Rec Identity rs)

Same as (//) but without bounds checking.

Accumulations

accum

Arguments

:: Vector Vector (Rec Identity rs)

=> (Rec Identity rs -> c -> Rec Identity rs)

accumulating function f

-> Vector (Rec Identity rs)

initial vector (of length m)

-> [(Int, c)]

list of index/value pairs (of length n)

-> Vector (Rec Identity rs)

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

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

unsafeAccum :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> c -> Rec Identity rs) -> Vector (Rec Identity rs) -> [(Int, c)] -> Vector (Rec Identity rs)

Same as accum but without bounds checking.

Permutations

reverse :: Vector Vector (Rec Identity rs) => Vector (Rec Identity rs) -> Vector (Rec Identity rs)

O(n) Reverse a vector

Safe destructive updates

modify :: Vector Vector (Rec Identity rs) => (forall s. Mutable Vector s (Rec Identity rs) -> ST s ()) -> Vector (Rec Identity rs) -> Vector (Rec Identity rs)

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 :: (Vector Vector (Rec Identity rs), Vector Vector (Rec Identity ss)) => (Rec Identity rs -> Rec Identity ss) -> Vector (Rec Identity rs) -> Vector (Rec Identity ss)

O(n) Map a function over a vector

imap :: (Vector Vector (Rec Identity rs), Vector Vector (Rec Identity ss)) => (Int -> Rec Identity rs -> Rec Identity ss) -> Vector (Rec Identity rs) -> Vector (Rec Identity ss)

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

concatMap :: (Vector Vector (Rec Identity rs), Vector Vector (Rec Identity ss)) => (Rec Identity rs -> Vector (Rec Identity ss)) -> Vector (Rec Identity rs) -> Vector (Rec Identity ss)

Map a function over a vector and concatenate the results.

Monadic mapping

mapM :: (Monad m, Vector Vector (Rec Identity rs), Vector Vector (Rec Identity ss)) => (Rec Identity rs -> m (Rec Identity ss)) -> Vector (Rec Identity rs) -> m (Vector (Rec Identity ss))

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

mapM_ :: (Monad m, Vector Vector (Rec Identity rs)) => (Rec Identity rs -> m b) -> Vector (Rec Identity rs) -> m ()

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

forM :: (Monad m, Vector Vector (Rec Identity rs), Vector Vector (Rec Identity ss)) => Vector (Rec Identity rs) -> (Rec Identity rs -> m (Rec Identity ss)) -> m (Vector (Rec Identity ss))

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

forM_ :: (Monad m, Vector Vector (Rec Identity rs)) => Vector (Rec Identity rs) -> (Rec Identity rs -> m b) -> m ()

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

Zipping - Omitted due to me being lazy

Monadic zipping

zipWithM :: (Monad m, Vector Vector (Rec Identity rs), Vector Vector (Rec Identity ss), Vector Vector (Rec Identity ts)) => (Rec Identity rs -> Rec Identity ss -> m (Rec Identity ts)) -> Vector (Rec Identity rs) -> Vector (Rec Identity ss) -> m (Vector (Rec Identity ts))

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

zipWithM_ :: (Monad m, Vector Vector (Rec Identity rs), Vector Vector (Rec Identity ss)) => (Rec Identity rs -> Rec Identity ss -> m e) -> Vector (Rec Identity rs) -> Vector (Rec Identity ss) -> m ()

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

Working with predicates

Filtering

filter :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Bool) -> Vector (Rec Identity rs) -> Vector (Rec Identity rs)

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

ifilter :: Vector Vector (Rec Identity rs) => (Int -> Rec Identity rs -> Bool) -> Vector (Rec Identity rs) -> Vector (Rec Identity rs)

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

filterM :: (Monad m, Vector Vector (Rec Identity rs)) => (Rec Identity rs -> m Bool) -> Vector (Rec Identity rs) -> m (Vector (Rec Identity rs))

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

takeWhile :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Bool) -> Vector (Rec Identity rs) -> Vector (Rec Identity rs)

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

dropWhile :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Bool) -> Vector (Rec Identity rs) -> Vector (Rec Identity rs)

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

Partitioning

partition :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Bool) -> Vector (Rec Identity rs) -> (Vector (Rec Identity rs), Vector (Rec Identity rs))

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 :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Bool) -> Vector (Rec Identity rs) -> (Vector (Rec Identity rs), Vector (Rec Identity rs))

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 :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Bool) -> Vector (Rec Identity rs) -> (Vector (Rec Identity rs), Vector (Rec Identity rs))

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

break :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Bool) -> Vector (Rec Identity rs) -> (Vector (Rec Identity rs), Vector (Rec Identity rs))

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

Searching

elem :: (Vector Vector (Rec Identity rs), Eq (Rec Identity rs)) => Rec Identity rs -> Vector (Rec Identity rs) -> Bool infix 4

O(n) Check if the vector contains an element

notElem :: (Vector Vector (Rec Identity rs), Eq (Rec Identity rs)) => Rec Identity rs -> Vector (Rec Identity rs) -> Bool infix 4

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

find :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Bool) -> Vector (Rec Identity rs) -> Maybe (Rec Identity rs)

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

findIndex :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Bool) -> Vector (Rec Identity rs) -> Maybe Int

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

elemIndex :: (Vector Vector (Rec Identity rs), Eq (Rec Identity rs)) => Rec Identity rs -> Vector (Rec Identity rs) -> Maybe Int

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.

Folding

foldl :: Vector Vector (Rec Identity rs) => (r -> Rec Identity rs -> r) -> r -> Vector (Rec Identity rs) -> r

O(n) Left fold

foldl1 :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Rec Identity rs -> Rec Identity rs) -> Vector (Rec Identity rs) -> Rec Identity rs

O(n) Left fold on non-empty vectors

foldl' :: Vector Vector (Rec Identity rs) => (r -> Rec Identity rs -> r) -> r -> Vector (Rec Identity rs) -> r

O(n) Left fold with strict accumulator

foldl1' :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Rec Identity rs -> Rec Identity rs) -> Vector (Rec Identity rs) -> Rec Identity rs

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

foldr :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> r -> r) -> r -> Vector (Rec Identity rs) -> r

O(n) Right fold

foldr1 :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Rec Identity rs -> Rec Identity rs) -> Vector (Rec Identity rs) -> Rec Identity rs

O(n) Right fold on non-empty vectors

foldr' :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> r -> r) -> r -> Vector (Rec Identity rs) -> r

O(n) Right fold with a strict accumulator

foldr1' :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Rec Identity rs -> Rec Identity rs) -> Vector (Rec Identity rs) -> Rec Identity rs

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

ifoldl :: Vector Vector (Rec Identity rs) => (r -> Int -> Rec Identity rs -> r) -> r -> Vector (Rec Identity rs) -> r

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

ifoldl' :: Vector Vector (Rec Identity rs) => (r -> Int -> Rec Identity rs -> r) -> r -> Vector (Rec Identity rs) -> r

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

ifoldr :: Vector Vector (Rec Identity rs) => (Int -> Rec Identity rs -> r -> r) -> r -> Vector (Rec Identity rs) -> r

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

ifoldr' :: Vector Vector (Rec Identity rs) => (Int -> Rec Identity rs -> r -> r) -> r -> Vector (Rec Identity rs) -> r

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

Specialised folds

all :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Bool) -> Vector (Rec Identity rs) -> Bool

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

any :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Bool) -> Vector (Rec Identity rs) -> Bool

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

maximum :: (Vector Vector (Rec Identity rs), Ord (Rec Identity rs)) => Vector (Rec Identity rs) -> Rec Identity rs

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

maximumBy :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Rec Identity rs -> Ordering) -> Vector (Rec Identity rs) -> Rec Identity rs

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

minimum :: (Vector Vector (Rec Identity rs), Ord (Rec Identity rs)) => Vector (Rec Identity rs) -> Rec Identity rs

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

minimumBy :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Rec Identity rs -> Ordering) -> Vector (Rec Identity rs) -> Rec Identity rs

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

minIndex :: (Vector Vector (Rec Identity rs), Ord (Rec Identity rs)) => Vector (Rec Identity rs) -> Int

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

minIndexBy :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Rec Identity rs -> Ordering) -> Vector (Rec Identity rs) -> Int

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 :: (Vector Vector (Rec Identity rs), Ord (Rec Identity rs)) => Vector (Rec Identity rs) -> Int

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

maxIndexBy :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Rec Identity rs -> Ordering) -> Vector (Rec Identity rs) -> Int

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

Monadic folds

foldM :: (Monad m, Vector Vector (Rec Identity rs)) => (r -> Rec Identity rs -> m r) -> r -> Vector (Rec Identity rs) -> m r

O(n) Monadic fold

foldM' :: (Monad m, Vector Vector (Rec Identity rs)) => (r -> Rec Identity rs -> m r) -> r -> Vector (Rec Identity rs) -> m r

O(n) Monadic fold with strict accumulator

fold1M :: (Monad m, Vector Vector (Rec Identity rs)) => (Rec Identity rs -> Rec Identity rs -> m (Rec Identity rs)) -> Vector (Rec Identity rs) -> m (Rec Identity rs)

O(n) Monadic fold over non-empty vectors

fold1M' :: (Monad m, Vector Vector (Rec Identity rs)) => (Rec Identity rs -> Rec Identity rs -> m (Rec Identity rs)) -> Vector (Rec Identity rs) -> m (Rec Identity rs)

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

foldM_ :: (Monad m, Vector Vector (Rec Identity rs)) => (r -> Rec Identity rs -> m r) -> r -> Vector (Rec Identity rs) -> m ()

O(n) Monadic fold that discards the result

foldM'_ :: (Monad m, Vector Vector (Rec Identity rs)) => (r -> Rec Identity rs -> m r) -> r -> Vector (Rec Identity rs) -> m ()

O(n) Monadic fold with strict accumulator that discards the result

fold1M_ :: (Monad m, Vector Vector (Rec Identity rs)) => (Rec Identity rs -> Rec Identity rs -> m (Rec Identity rs)) -> Vector (Rec Identity rs) -> m ()

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

fold1M'_ :: (Monad m, Vector Vector (Rec Identity rs)) => (Rec Identity rs -> Rec Identity rs -> m (Rec Identity rs)) -> Vector (Rec Identity rs) -> m ()

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

Prefix sums (scans)

prescanl :: (Vector Vector (Rec Identity rs), Vector Vector (Rec Identity ss)) => (Rec Identity rs -> Rec Identity ss -> Rec Identity rs) -> Rec Identity rs -> Vector (Rec Identity ss) -> Vector (Rec Identity rs)

O(n) Prescan

prescanl f z = init . scanl f z

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

prescanl' :: (Vector Vector (Rec Identity rs), Vector Vector (Rec Identity ss)) => (Rec Identity rs -> Rec Identity ss -> Rec Identity rs) -> Rec Identity rs -> Vector (Rec Identity ss) -> Vector (Rec Identity rs)

O(n) Prescan with strict accumulator

postscanl :: (Vector Vector (Rec Identity rs), Vector Vector (Rec Identity ss)) => (Rec Identity rs -> Rec Identity ss -> Rec Identity rs) -> Rec Identity rs -> Vector (Rec Identity ss) -> Vector (Rec Identity rs)

O(n) Scan

postscanl f z = tail . scanl f z

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

postscanl' :: (Vector Vector (Rec Identity rs), Vector Vector (Rec Identity ss)) => (Rec Identity rs -> Rec Identity ss -> Rec Identity rs) -> Rec Identity rs -> Vector (Rec Identity ss) -> Vector (Rec Identity rs)

O(n) Scan with strict accumulator

scanl :: (Vector Vector (Rec Identity rs), Vector Vector (Rec Identity ss)) => (Rec Identity rs -> Rec Identity ss -> Rec Identity rs) -> Rec Identity rs -> Vector (Rec Identity ss) -> Vector (Rec Identity rs)

O(n) Haskell-style scan

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' :: (Vector Vector (Rec Identity rs), Vector Vector (Rec Identity ss)) => (Rec Identity rs -> Rec Identity ss -> Rec Identity rs) -> Rec Identity rs -> Vector (Rec Identity ss) -> Vector (Rec Identity rs)

O(n) Haskell-style scan with strict accumulator

scanl1 :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Rec Identity rs -> Rec Identity rs) -> Vector (Rec Identity rs) -> Vector (Rec Identity rs)

O(n) Scan over a non-empty vector

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

scanl1' :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Rec Identity rs -> Rec Identity rs) -> Vector (Rec Identity rs) -> Vector (Rec Identity rs)

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

prescanr :: (Vector Vector (Rec Identity rs), Vector Vector (Rec Identity ss)) => (Rec Identity rs -> Rec Identity ss -> Rec Identity ss) -> Rec Identity ss -> Vector (Rec Identity rs) -> Vector (Rec Identity ss)

O(n) Right-to-left prescan

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

prescanr' :: (Vector Vector (Rec Identity rs), Vector Vector (Rec Identity ss)) => (Rec Identity rs -> Rec Identity ss -> Rec Identity ss) -> Rec Identity ss -> Vector (Rec Identity rs) -> Vector (Rec Identity ss)

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

postscanr :: (Vector Vector (Rec Identity rs), Vector Vector (Rec Identity ss)) => (Rec Identity rs -> Rec Identity ss -> Rec Identity ss) -> Rec Identity ss -> Vector (Rec Identity rs) -> Vector (Rec Identity ss)

O(n) Right-to-left scan

postscanr' :: (Vector Vector (Rec Identity rs), Vector Vector (Rec Identity ss)) => (Rec Identity rs -> Rec Identity ss -> Rec Identity ss) -> Rec Identity ss -> Vector (Rec Identity rs) -> Vector (Rec Identity ss)

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

scanr :: (Vector Vector (Rec Identity rs), Vector Vector (Rec Identity ss)) => (Rec Identity rs -> Rec Identity ss -> Rec Identity ss) -> Rec Identity ss -> Vector (Rec Identity rs) -> Vector (Rec Identity ss)

O(n) Right-to-left Haskell-style scan

scanr' :: (Vector Vector (Rec Identity rs), Vector Vector (Rec Identity ss)) => (Rec Identity rs -> Rec Identity ss -> Rec Identity ss) -> Rec Identity ss -> Vector (Rec Identity rs) -> Vector (Rec Identity ss)

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

scanr1 :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Rec Identity rs -> Rec Identity rs) -> Vector (Rec Identity rs) -> Vector (Rec Identity rs)

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

scanr1' :: Vector Vector (Rec Identity rs) => (Rec Identity rs -> Rec Identity rs -> Rec Identity rs) -> Vector (Rec Identity rs) -> Vector (Rec Identity rs)

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

Lists

toList :: Vector Vector (Rec Identity rs) => Vector (Rec Identity rs) -> [Rec Identity rs]

O(n) Convert a vector to a list

fromList :: Vector Vector (Rec Identity rs) => [Rec Identity rs] -> Vector (Rec Identity rs)

O(n) Convert a list to a vector

fromListN :: Vector Vector (Rec Identity rs) => Int -> [Rec Identity rs] -> Vector (Rec Identity rs)

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

O(n) Convert different vector types

Mutable vectors

freeze :: (PrimMonad m, Vector Vector (Rec Identity rs)) => Mutable Vector (PrimState m) (Rec Identity rs) -> m (Vector (Rec Identity rs))

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

thaw :: (PrimMonad m, Vector Vector (Rec Identity rs)) => Vector (Rec Identity rs) -> m (Mutable Vector (PrimState m) (Rec Identity rs))

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

copy :: (PrimMonad m, Vector Vector (Rec Identity rs)) => Mutable Vector (PrimState m) (Rec Identity rs) -> Vector (Rec Identity rs) -> m ()

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

unsafeFreeze :: (PrimMonad m, Vector Vector (Rec Identity rs)) => Mutable Vector (PrimState m) (Rec Identity rs) -> m (Vector (Rec Identity rs))

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

unsafeThaw :: (PrimMonad m, Vector Vector (Rec Identity rs)) => Vector (Rec Identity rs) -> m (Mutable Vector (PrimState m) (Rec Identity rs))

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

unsafeCopy :: (PrimMonad m, Vector Vector (Rec Identity rs)) => Mutable Vector (PrimState m) (Rec Identity rs) -> Vector (Rec Identity rs) -> m ()

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