Data.Vector.Primitive.Sized

This module re-exports the functionality in Sized specialized to Primitive.

Functions returning a vector determine the size from the type context unless they have a ' suffix in which case they take an explicit Proxy argument.

Functions where the resulting vector size is not known until runtime are not exported.

Documentation

type Vector = Vector Vector

Vector specialized to use Primitive.

pattern SomeSized :: Prim a => KnownNat n => Vector n a -> Vector a

Pattern synonym that lets you treat an unsized vector as if it "contained" a sized vector. If you pattern match on an unsized vector, its contents will be the sized vector counterpart.

testFunc :: Unsized.Vector Int -> Int
testFunc (SomeSized v) =
    sum (zipWith (+) v (replicate 1))
        -- ^ here, v is `Sized.Vector n Int`, and we have
                    `KnownNat n`

The n type variable will be properly instantiated to whatever the length of the vector is, and you will also have a KnownNat n instance available. You can get n in scope by turning on ScopedTypeVariables and matching on SomeSized (v :: Sized.Vector n Int).

Without this, you would otherwise have to use withSized to do the same thing:

testFunc :: Unsized.Vector Int -> Int
testFunc u = withSized u $ \v ->
    sum (zipWith (+) v (replicate 1))

Remember that the type of final result of your function (the Int, here) must not depend on n. However, the types of the intermediate values are allowed to depend on n.

This is especially useful in do blocks, where you can pattern match on the unsized results of actions, to use the sized vector in the rest of the do block. You also get a KnownNat n constraint for the remainder of the do block.

-- If you had:
getAVector :: IO (Unsized.Vector Int)

main :: IO ()
main = do
    SomeSized v <- getAVector -- v is `Sized.Vector n Int`
    -- get n in scope
    SomeSized (v :: Sized.Vector n Int) <- getAVector
    print v

Remember that the final type of the result of the do block ((), here) must not depend on n. However, the

Also useful in ghci, where you can pattern match to get sized vectors from unsized vectors.

ghci> SomeSized v <- pure (myUnsizedVector :: Unsized.Vector Int)
             -- ^ v is `Sized.Vector n Int`

This enables interactive exploration with sized vectors in ghci, and is useful for using with other libraries and functions that expect sized vectors in an interactive setting.

(Note that as of GHC 8.6, you cannot get the n in scope in your ghci session using ScopedTypeVariables, like you can with do blocks)

You can also use this as a constructor, to take a sized vector and "hide" the size, to produce an unsized vector:

SomeSized :: Sized.Vector n a -> Unsized.Vector a

type MVector = MVector MVector

Vector specialized to use Mutable.

Accessors

Length information

length :: forall n a. KnownNat n => Vector n a -> Int

O(1) Yield the length of the vector as an Int. This is more like natVal than length, extracting the value from the KnownNat instance and not looking at the vector itself.

length' :: forall n a. Vector n a -> Proxy n

O(1) Yield the length of the vector as a Proxy. This function doesn't do anything; it merely allows the size parameter of the vector to be passed around as a Proxy.

knownLength

Arguments

:: forall n a r. Prim a

=> Vector n a

a vector of some (potentially unknown) length

-> (KnownNat n => r)

a value that depends on knowing the vector's length

-> r

the value computed with the length

O(1) Reveal a KnownNat instance for a vector's length, determined at runtime.

knownLength'

Arguments

:: forall n a r. Prim a

=> Vector n a

a vector of some (potentially unknown) length

-> (KnownNat n => Proxy n -> r)

a value that depends on knowing the vector's length, which is given as a Proxy

-> r

the value computed with the length

O(1) Reveal a KnownNat instance and Proxy for a vector's length, determined at runtime.

Indexing

index :: forall n a. Prim a => Vector n a -> Finite n -> a

O(1) Safe indexing using a Finite.

index' :: forall n m a p. (KnownNat n, Prim a) => Vector ((n + m) + 1) a -> p n -> a

O(1) Safe indexing using a Proxy.

unsafeIndex :: forall n a. Prim a => Vector n a -> Int -> a

O(1) Indexing using an Int without bounds checking.

head :: forall n a. Prim a => Vector (1 + n) a -> a

O(1) Yield the first element of a non-empty vector.

last :: forall n a. Prim a => Vector (n + 1) a -> a

O(1) Yield the last element of a non-empty vector.

Monadic indexing

indexM :: forall n a m. (Prim a, Monad m) => Vector n a -> Finite n -> m a

O(1) Safe indexing in a monad. See the documentation for indexM for an explanation of why this is useful.

indexM' :: forall n k a m p. (KnownNat n, Prim a, Monad m) => Vector (n + k) a -> p n -> m a

O(1) Safe indexing in a monad using a Proxy. See the documentation for indexM for an explanation of why this is useful.

unsafeIndexM :: forall n a m. (Prim a, Monad m) => Vector n a -> Int -> m a

O(1) Indexing using an Int without bounds checking. See the documentation for indexM for an explanation of why this is useful.

headM :: forall n a m. (Prim a, Monad m) => Vector (1 + n) a -> m a

O(1) Yield the first element of a non-empty vector in a monad. See the documentation for indexM for an explanation of why this is useful.

lastM :: forall n a m. (Prim a, Monad m) => Vector (n + 1) a -> m a

O(1) Yield the last element of a non-empty vector in a monad. See the documentation for indexM for an explanation of why this is useful.

Extracting subvectors (slicing)

slice

Arguments

:: forall i n m a p. (KnownNat i, KnownNat n, Prim a)

=> p i

starting index

-> Vector ((i + n) + m) a

-> Vector n a

O(1) Yield a slice of the vector without copying it with an inferred length argument.

slice'

Arguments

:: forall i n m a p. (KnownNat i, KnownNat n, Prim a)

=> p i

starting index

-> p n

length

-> Vector ((i + n) + m) a

-> Vector n a

O(1) Yield a slice of the vector without copying it with an explicit length argument.

init :: forall n a. Prim a => Vector (n + 1) a -> Vector n a

O(1) Yield all but the last element of a non-empty vector without copying.

tail :: forall n a. Prim a => Vector (1 + n) a -> Vector n a

O(1) Yield all but the first element of a non-empty vector without copying.

take :: forall n m a. (KnownNat n, Prim a) => Vector (n + m) a -> Vector n a

O(1) Yield the first n elements. The resulting vector always contains this many elements. The length of the resulting vector is inferred from the type.

take' :: forall n m a p. (KnownNat n, Prim a) => p n -> Vector (n + m) a -> Vector n a

O(1) Yield the first n elements. The resulting vector always contains this many elements. The length of the resulting vector is given explicitly as a Proxy argument.

drop :: forall n m a. (KnownNat n, Prim a) => Vector (n + m) a -> Vector m a

O(1) Yield all but the the first n elements. The given vector must contain at least this many elements. The length of the resulting vector is inferred from the type.

drop' :: forall n m a p. (KnownNat n, Prim a) => p n -> Vector (n + m) a -> Vector m a

O(1) Yield all but the the first n elements. The given vector must contain at least this many elements. The length of the resulting vector is givel explicitly as a Proxy argument.

splitAt :: forall n m a. (KnownNat n, Prim a) => Vector (n + m) a -> (Vector n a, Vector m a)

O(1) Yield the first n elements, paired with the rest, without copying. The lengths of the resulting vectors are inferred from the type.

splitAt' :: forall n m a p. (KnownNat n, Prim a) => p n -> Vector (n + m) a -> (Vector n a, Vector m a)

O(1) Yield the first n elements paired with the remainder without copying. The length of the first resulting vector is passed explicitly as a Proxy argument.

Construction

Initialization

empty :: forall a. Prim a => Vector 0 a

O(1) Empty vector.

singleton :: forall a. Prim a => a -> Vector 1 a

O(1) Vector with exactly one element.

fromTuple :: forall a input length. (Prim a, IndexedListLiterals input length a, KnownNat length) => input -> Vector length a

O(n) Construct a vector in a type safe manner fromTuple (1,2) :: Vector 2 Int fromTuple ("hey", "what's", "going", "on") :: Vector 4 String

replicate :: forall n a. (KnownNat n, Prim a) => a -> Vector n a

O(n) Construct a vector with the same element in each position where the length is inferred from the type.

replicate' :: forall n a p. (KnownNat n, Prim a) => p n -> a -> Vector n a

O(n) Construct a vector with the same element in each position where the length is given explicitly as a Proxy argument.

generate :: forall n a. (KnownNat n, Prim a) => (Finite n -> a) -> Vector n a

O(n) construct a vector of the given length by applying the function to each index where the length is inferred from the type.

generate' :: forall n a p. (KnownNat n, Prim a) => p n -> (Finite n -> a) -> Vector n a

O(n) construct a vector of the given length by applying the function to each index where the length is given explicitly as a Proxy argument.

iterateN :: forall n a. (KnownNat n, Prim a) => (a -> a) -> a -> Vector n a

O(n) Apply function n times to value. Zeroth element is original value. The length is inferred from the type.

iterateN' :: forall n a p. (KnownNat n, Prim a) => p n -> (a -> a) -> a -> Vector n a

O(n) Apply function n times to value. Zeroth element is original value. The length is given explicitly as a Proxy argument.

Monadic initialization

replicateM :: forall n m a. (KnownNat n, Prim a, Monad m) => m a -> m (Vector n a)

O(n) Execute the monadic action n times and store the results in a vector where n is inferred from the type.

replicateM' :: forall n m a p. (KnownNat n, Prim a, Monad m) => p n -> m a -> m (Vector n a)

O(n) Execute the monadic action n times and store the results in a vector where n is given explicitly as a Proxy argument.

generateM :: forall n m a. (KnownNat n, Prim a, Monad m) => (Finite n -> m a) -> m (Vector n a)

O(n) Construct a vector of length n by applying the monadic action to each index where n is inferred from the type.

generateM' :: forall n m a p. (KnownNat n, Prim a, Monad m) => p n -> (Finite n -> m a) -> m (Vector n a)

O(n) Construct a vector of length n by applying the monadic action to each index where n is given explicitly as a Proxy argument.

Unfolding

unfoldrN :: forall n a b. (KnownNat n, Prim a) => (b -> (a, b)) -> b -> Vector n a

O(n) Construct a vector with exactly n elements by repeatedly applying the generator function to the a seed. The length is inferred from the type.

unfoldrN' :: forall n a b p. (KnownNat n, Prim a) => p n -> (b -> (a, b)) -> b -> Vector n a

O(n) Construct a vector with exactly n elements by repeatedly applying the generator function to the a seed. The length is given explicitly as a Proxy argument.

Enumeration

enumFromN :: forall n a. (KnownNat n, Prim a, Num a) => a -> Vector n a

O(n) Yield a vector of length n containing the values x, x+1, ..., x + (n - 1). The length is inferred from the type.

enumFromN' :: forall n a p. (KnownNat n, Prim a, Num a) => a -> p n -> Vector n a

O(n) Yield a vector of length n containing the values x, x+1, ..., x + (n - 1). The length is given explicitly as a Proxy argument.

enumFromStepN :: forall n a. (KnownNat n, Prim a, Num a) => a -> a -> Vector n a

O(n) Yield a vector of the given length containing the values x, x+y, x+2y, ..., x + (n - 1)y. The length is inferred from the type.

enumFromStepN' :: forall n a p. (KnownNat n, Prim a, Num a) => a -> a -> p n -> Vector n a

O(n) Yield a vector of the given length containing the values x, x+y, x+2y, ..., x + (n - 1)y. The length is given explicitly as a Proxy argument.

Concatenation

cons :: forall n a. Prim a => a -> Vector n a -> Vector (1 + n) a

O(n) Prepend an element.

snoc :: forall n a. Prim a => Vector n a -> a -> Vector (n + 1) a

O(n) Append an element.

(++) :: forall n m a. Prim a => Vector n a -> Vector m a -> Vector (n + m) a

O(m+n) Concatenate two vectors.

Restricting memory usage

force :: Prim a => Vector n a -> Vector n a

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

:: Prim a

=> Vector m a

initial vector (of length m)

-> [(Finite m, a)]

list of index/value pairs (of length n)

-> Vector m 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>

update_

Arguments

:: Prim a

=> Vector m a

initial vector (of length m)

-> Vector n Int

index vector (of length n)

-> Vector n a

value vector (of length n)

-> Vector m a

O(m+n) 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>

This function is useful for instances of Vector that cannot store pairs. Otherwise, update is probably more convenient.

update_ xs is ys = update xs (zip is ys)

unsafeUpd

Arguments

:: Prim a

=> Vector m a

initial vector (of length m)

-> [(Int, a)]

list of index/value pairs (of length n)

-> Vector m a

Same as (//) but without bounds checking.

unsafeUpdate_

Arguments

:: Prim a

=> Vector m a

initial vector (of length m)

-> Vector n Int

index vector (of length n)

-> Vector n a

value vector (of length n)

-> Vector m a

Same as update_ but without bounds checking.

Accumulations

accum

Arguments

:: Prim a

=> (a -> b -> a)

accumulating function f

-> Vector m a

initial vector (of length m)

-> [(Int, b)]

list of index/value pairs (of length n)

-> Vector m 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>

accumulate_

Arguments

:: (Prim a, Prim b)

=> (a -> b -> a)

accumulating function f

-> Vector m a

initial vector (of length m)

-> Vector n Int

index vector (of length n)

-> Vector n b

value vector (of length n)

-> Vector m a

O(m+n) 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>

This function is useful for instances of Vector that cannot store pairs. Otherwise, accumulate is probably more convenient:

accumulate_ f as is bs = accumulate f as (zip is bs)

unsafeAccum

Arguments

:: Prim a

=> (a -> b -> a)

accumulating function f

-> Vector m a

initial vector (of length m)

-> [(Int, b)]

list of index/value pairs (of length n)

-> Vector m a

Same as accum but without bounds checking.

unsafeAccumulate_

Arguments

:: (Prim a, Prim b)

=> (a -> b -> a)

accumulating function f

-> Vector m a

initial vector (of length m)

-> Vector n Int

index vector (of length n)

-> Vector n b

value vector (of length n)

-> Vector m a

Same as accumulate_ but without bounds checking.

Permutations

reverse :: Prim a => Vector n a -> Vector n a

O(n) Reverse a vector.

backpermute

Arguments

:: Prim a

=> Vector m a

xs value vector

-> Vector n Int

is index vector (of length n)

-> Vector n a

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

Arguments

:: Prim a

=> Vector m a

xs value vector

-> Vector n Int

is index vector (of length n)

-> Vector n a

Same as backpermute but without bounds checking.

Lenses

ix :: forall n a f. (Prim a, Functor f) => Finite n -> (a -> f a) -> Vector n a -> f (Vector n a)

Lens to access (O(1)) and update (O(n)) an arbitrary element by its index.

_head :: forall n a f. (Prim a, Functor f) => (a -> f a) -> Vector (1 + n) a -> f (Vector (1 + n) a)

Lens to access (O(1)) and update (O(n)) the first element of a non-empty vector.

_last :: forall n a f. (Prim a, Functor f) => (a -> f a) -> Vector (n + 1) a -> f (Vector (n + 1) a)

Lens to access (O(1)) and update (O(n)) the last element of a non-empty vector.

Elementwise operations

Mapping

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

O(n) Map a function over a vector.

imap :: (Prim a, Prim b) => (Finite n -> a -> b) -> Vector n a -> Vector n b

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

concatMap :: (Prim a, Prim b) => (a -> Vector m b) -> Vector n a -> Vector (n * m) b

O(n*m) Map a function over a vector and concatenate the results. The function is required to always return the same length vector.

Monadic mapping

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

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

imapM :: (Monad m, Prim a, Prim b) => (Finite n -> a -> m b) -> Vector n a -> m (Vector n b)

O(n) Apply the monadic action to every element of a vector and its index, yielding a vector of results.

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

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

imapM_ :: (Monad m, Prim a) => (Finite n -> a -> m b) -> Vector n a -> m ()

O(n) Apply the monadic action to every element of a vector and its index, ignoring the results.

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

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

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

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 n a -> Vector n b -> Vector n c

O(n) Zip two vectors of the same length with the given function.

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

Zip three vectors with the given function.

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

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

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

izipWith :: (Prim a, Prim b, Prim c) => (Finite n -> a -> b -> c) -> Vector n a -> Vector n b -> Vector n c

O(n) Zip two vectors of the same length with a function that also takes the elements' indices).

izipWith3 :: (Prim a, Prim b, Prim c, Prim d) => (Finite n -> a -> b -> c -> d) -> Vector n a -> Vector n b -> Vector n c -> Vector n d

izipWith4 :: (Prim a, Prim b, Prim c, Prim d, Prim e) => (Finite n -> a -> b -> c -> d -> e) -> Vector n a -> Vector n b -> Vector n c -> Vector n d -> Vector n e

izipWith5 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f) => (Finite n -> a -> b -> c -> d -> e -> f) -> Vector n a -> Vector n b -> Vector n c -> Vector n d -> Vector n e -> Vector n f

izipWith6 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f, Prim g) => (Finite n -> a -> b -> c -> d -> e -> f -> g) -> Vector n a -> Vector n b -> Vector n c -> Vector n d -> Vector n e -> Vector n f -> Vector n g

Monadic zipping

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

O(n) Zip the two vectors of the same length with the monadic action and yield a vector of results.

izipWithM :: (Monad m, Prim a, Prim b, Prim c) => (Finite n -> a -> b -> m c) -> Vector n a -> Vector n b -> m (Vector n c)

O(n) Zip the two vectors with a monadic action that also takes the element index and yield a vector of results.

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

O(n) Zip the two vectors with the monadic action and ignore the results.

izipWithM_ :: (Monad m, Prim a, Prim b) => (Finite n -> a -> b -> m c) -> Vector n a -> Vector n b -> m ()

O(n) Zip the two vectors with a monadic action that also takes the element index and ignore the results.

Working with predicates

Searching

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

O(n) Check if the vector contains an element.

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

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

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

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

findIndex :: Prim a => (a -> Bool) -> Vector n a -> Maybe (Finite n)

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

elemIndex :: (Prim a, Eq a) => a -> Vector n a -> Maybe (Finite n)

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 :: Prim b => (a -> b -> a) -> a -> Vector n b -> a

O(n) Left fold.

foldl1 :: Prim a => (a -> a -> a) -> Vector (1 + n) a -> a

O(n) Left fold on non-empty vectors.

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

O(n) Left fold with strict accumulator.

foldl1' :: Prim a => (a -> a -> a) -> Vector (1 + n) a -> a

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

foldr :: Prim a => (a -> b -> b) -> b -> Vector n a -> b

O(n) Right fold.

foldr1 :: Prim a => (a -> a -> a) -> Vector (n + 1) a -> a

O(n) Right fold on non-empty vectors.

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

O(n) Right fold with a strict accumulator.

foldr1' :: Prim a => (a -> a -> a) -> Vector (n + 1) a -> a

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

ifoldl :: Prim b => (a -> Finite n -> b -> a) -> a -> Vector n b -> a

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

ifoldl' :: Prim b => (a -> Finite n -> b -> a) -> a -> Vector n b -> a

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

ifoldr :: Prim a => (Finite n -> a -> b -> b) -> b -> Vector n a -> b

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

ifoldr' :: Prim a => (Finite n -> a -> b -> b) -> b -> Vector n a -> b

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

Specialised folds

all :: Prim a => (a -> Bool) -> Vector n a -> Bool

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

any :: Prim a => (a -> Bool) -> Vector n a -> Bool

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

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

O(n) Compute the sum of the elements.

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

O(n) Compute the product of the elements.

maximum :: (Prim a, Ord a) => Vector (n + 1) a -> a

O(n) Yield the maximum element of the non-empty vector.

maximumBy :: Prim a => (a -> a -> Ordering) -> Vector (n + 1) a -> a

O(n) Yield the maximum element of the non-empty vector according to the given comparison function.

minimum :: (Prim a, Ord a) => Vector (n + 1) a -> a

O(n) Yield the minimum element of the non-empty vector.

minimumBy :: Prim a => (a -> a -> Ordering) -> Vector (n + 1) a -> a

O(n) Yield the minimum element of the non-empty vector according to the given comparison function.

maxIndex :: (Prim a, Ord a) => Vector (n + 1) a -> Finite (n + 1)

O(n) Yield the index of the maximum element of the non-empty vector.

maxIndexBy :: Prim a => (a -> a -> Ordering) -> Vector (n + 1) a -> Finite (n + 1)

O(n) Yield the index of the maximum element of the non-empty vector according to the given comparison function.

minIndex :: (Prim a, Ord a) => Vector (n + 1) a -> Finite (n + 1)

O(n) Yield the index of the minimum element of the non-empty vector.

minIndexBy :: Prim a => (a -> a -> Ordering) -> Vector (n + 1) a -> Finite (n + 1)

O(n) Yield the index of the minimum element of the non-empty vector according to the given comparison function.

Monadic folds

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

O(n) Monadic fold.

ifoldM :: (Monad m, Prim b) => (a -> Finite n -> b -> m a) -> a -> Vector n b -> m a

O(n) Monadic fold (action applied to each element and its index).

fold1M :: (Monad m, Prim a) => (a -> a -> m a) -> Vector (1 + n) a -> m a

O(n) Monadic fold over non-empty vectors.

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

O(n) Monadic fold with strict accumulator.

ifoldM' :: (Monad m, Prim b) => (a -> Finite n -> b -> m a) -> a -> Vector n b -> m a

O(n) Monadic fold with strict accumulator (action applied to each element and its index).

fold1M' :: (Monad m, Prim a) => (a -> a -> m a) -> Vector (n + 1) a -> m a

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

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

O(n) Monadic fold that discards the result.

ifoldM_ :: (Monad m, Prim b) => (a -> Finite n -> b -> m a) -> a -> Vector n b -> m ()

O(n) Monadic fold that discards the result (action applied to each element and its index).

fold1M_ :: (Monad m, Prim a) => (a -> a -> m a) -> Vector (n + 1) a -> m ()

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

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

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

ifoldM'_ :: (Monad m, Prim b) => (a -> Finite n -> b -> m a) -> a -> Vector n b -> m ()

O(n) Monadic fold with strict accumulator that discards the result (action applied to each element and its index).

fold1M'_ :: (Monad m, Prim a) => (a -> a -> m a) -> Vector (n + 1) a -> m ()

O(n) Monad 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 n b -> Vector n a

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 n b -> Vector n a

O(n) Prescan with strict accumulator.

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

O(n) Scan.

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

O(n) Scan with strict accumulator.

scanl :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector n b -> Vector (1 + n) a

O(n) Haskell-style scan.

scanl' :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector n b -> Vector (1 + n) a

O(n) Haskell-style scan with strict accumulator.

scanl1 :: Prim a => (a -> a -> a) -> Vector (1 + n) a -> Vector (2 + n) a

O(n) Scan over a non-empty vector.

scanl1' :: Prim a => (a -> a -> a) -> Vector (1 + n) a -> Vector (2 + n) a

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

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

O(n) Right-to-left prescan.

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

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

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

O(n) Right-to-left scan.

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

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

scanr :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector n a -> Vector (n + 1) b

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

scanr' :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector n a -> Vector (n + 1) b

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

scanr1 :: Prim a => (a -> a -> a) -> Vector (n + 1) a -> Vector (n + 2) a

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

scanr1' :: Prim a => (a -> a -> a) -> Vector (n + 1) a -> Vector (n + 2) a

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

Conversions

Lists

toList :: Prim a => Vector n a -> [a]

O(n) Convert a vector to a list.

fromList :: (Prim a, KnownNat n) => [a] -> Maybe (Vector n a)

O(n) Convert a list to a vector.

fromListN :: forall n a. (Prim a, KnownNat n) => [a] -> Maybe (Vector n a)

O(n) Convert the first n elements of a list to a vector. The length of the resulting vector is inferred from the type.

fromListN' :: forall n a p. (Prim a, KnownNat n) => p n -> [a] -> Maybe (Vector n a)

O(n) Convert the first n elements of a list to a vector. The length of the resulting vector is given explicitly as a Proxy argument.

withSizedList :: forall a r. Prim a => [a] -> (forall n. KnownNat n => Vector n a -> r) -> r

O(n) Takes a list and returns a continuation providing a vector with a size parameter corresponding to the length of the list.

Essentially converts a list into a vector with the proper size parameter, determined at runtime.

See withSized

Mutable vectors

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

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

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

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

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

O(n) Copy an immutable vector into a mutable one.

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

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

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

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

Unsized Vectors

toSized :: forall n a. (Prim a, KnownNat n) => Vector a -> Maybe (Vector n a)

Convert a Vector into a Vector if it has the correct size, otherwise return Nothing.

withSized :: forall a r. Prim a => Vector a -> (forall n. KnownNat n => Vector n a -> r) -> r

Takes a Vector and returns a continuation providing a Vector with a size parameter n that is determined at runtime based on the length of the input vector.

Essentially converts a Vector into a Vector with the correct size parameter n.

fromSized :: Vector n a -> Vector a

withVectorUnsafe :: forall a b (n :: Nat). (Vector a -> Vector b) -> Vector n a -> Vector n b

Apply a function on unsized vectors to a sized vector. The function must preserve the size of the vector, this is not checked.