|
Data.Vector | Portability | non-portable | Stability | experimental | Maintainer | Roman Leshchinskiy <rl@cse.unsw.edu.au> |
|
|
|
|
|
Description |
A library for boxed vectors (that is, polymorphic arrays capable of
holding any Haskell value). The vectors come in two flavors:
and support a rich interface of both list-like operations, and bulk
array operations.
For unboxed arrays, use the Data.Vector.Unboxed interface.
|
|
Synopsis |
|
data Vector a | | data MVector s a | | length :: Vector a -> Int | | null :: Vector a -> Bool | | (!) :: Vector a -> Int -> a | | head :: Vector a -> a | | last :: Vector a -> a | | unsafeIndex :: Vector a -> Int -> a | | unsafeHead :: Vector a -> a | | unsafeLast :: Vector a -> a | | indexM :: Monad m => Vector a -> Int -> m a | | headM :: Monad m => Vector a -> m a | | lastM :: Monad m => Vector a -> m a | | unsafeIndexM :: Monad m => Vector a -> Int -> m a | | unsafeHeadM :: Monad m => Vector a -> m a | | unsafeLastM :: Monad m => Vector a -> m a | | slice :: Int -> Int -> Vector a -> Vector a | | init :: Vector a -> Vector a | | tail :: Vector a -> Vector a | | take :: Int -> Vector a -> Vector a | | drop :: Int -> Vector a -> Vector a | | unsafeSlice :: Int -> Int -> Vector a -> Vector a | | unsafeInit :: Vector a -> Vector a | | unsafeTail :: Vector a -> Vector a | | unsafeTake :: Int -> Vector a -> Vector a | | unsafeDrop :: Int -> Vector a -> Vector a | | empty :: Vector a | | singleton :: a -> Vector a | | replicate :: Int -> a -> Vector a | | generate :: Int -> (Int -> a) -> Vector a | | replicateM :: Monad m => Int -> m a -> m (Vector a) | | create :: (forall s. ST s (MVector s a)) -> Vector a | | unfoldr :: (b -> Maybe (a, b)) -> b -> Vector a | | unfoldrN :: Int -> (b -> Maybe (a, b)) -> b -> Vector a | | enumFromN :: Num a => a -> Int -> Vector a | | enumFromStepN :: Num a => a -> a -> Int -> Vector a | | enumFromTo :: Enum a => a -> a -> Vector a | | enumFromThenTo :: Enum a => a -> a -> a -> Vector a | | cons :: a -> Vector a -> Vector a | | snoc :: Vector a -> a -> Vector a | | (++) :: Vector a -> Vector a -> Vector a | | force :: Vector a -> Vector a | | (//) :: Vector a -> [(Int, a)] -> Vector a | | update :: Vector a -> Vector (Int, a) -> Vector a | | update_ :: Vector a -> Vector Int -> Vector a -> Vector a | | unsafeUpd :: Vector a -> [(Int, a)] -> Vector a | | unsafeUpdate :: Vector a -> Vector (Int, a) -> Vector a | | unsafeUpdate_ :: Vector a -> Vector Int -> Vector a -> Vector a | | accum :: (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a | | accumulate :: (a -> b -> a) -> Vector a -> Vector (Int, b) -> Vector a | | accumulate_ :: (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a | | unsafeAccum :: (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a | | unsafeAccumulate :: (a -> b -> a) -> Vector a -> Vector (Int, b) -> Vector a | | unsafeAccumulate_ :: (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a | | reverse :: Vector a -> Vector a | | backpermute :: Vector a -> Vector Int -> Vector a | | unsafeBackpermute :: Vector a -> Vector Int -> Vector a | | modify :: (forall s. MVector s a -> ST s ()) -> Vector a -> Vector a | | map :: (a -> b) -> Vector a -> Vector b | | imap :: (Int -> a -> b) -> Vector a -> Vector b | | concatMap :: (a -> Vector b) -> Vector a -> Vector b | | mapM :: Monad m => (a -> m b) -> Vector a -> m (Vector b) | | mapM_ :: Monad m => (a -> m b) -> Vector a -> m () | | forM :: Monad m => Vector a -> (a -> m b) -> m (Vector b) | | forM_ :: Monad m => Vector a -> (a -> m b) -> m () | | zipWith :: (a -> b -> c) -> Vector a -> Vector b -> Vector c | | zipWith3 :: (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d | | zipWith4 :: (a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e | | zipWith5 :: (a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f | | zipWith6 :: (a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g | | izipWith :: (Int -> a -> b -> c) -> Vector a -> Vector b -> Vector c | | izipWith3 :: (Int -> a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d | | izipWith4 :: (Int -> a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e | | izipWith5 :: (Int -> a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f | | izipWith6 :: (Int -> a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g | | zip :: Vector a -> Vector b -> Vector (a, b) | | zip3 :: Vector a -> Vector b -> Vector c -> Vector (a, b, c) | | zip4 :: Vector a -> Vector b -> Vector c -> Vector d -> Vector (a, b, c, d) | | zip5 :: Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector (a, b, c, d, e) | | zip6 :: Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector (a, b, c, d, e, f) | | zipWithM :: Monad m => (a -> b -> m c) -> Vector a -> Vector b -> m (Vector c) | | zipWithM_ :: Monad m => (a -> b -> m c) -> Vector a -> Vector b -> m () | | unzip :: Vector (a, b) -> (Vector a, Vector b) | | unzip3 :: Vector (a, b, c) -> (Vector a, Vector b, Vector c) | | unzip4 :: Vector (a, b, c, d) -> (Vector a, Vector b, Vector c, Vector d) | | unzip5 :: Vector (a, b, c, d, e) -> (Vector a, Vector b, Vector c, Vector d, Vector e) | | unzip6 :: Vector (a, b, c, d, e, f) -> (Vector a, Vector b, Vector c, Vector d, Vector e, Vector f) | | filter :: (a -> Bool) -> Vector a -> Vector a | | ifilter :: (Int -> a -> Bool) -> Vector a -> Vector a | | filterM :: Monad m => (a -> m Bool) -> Vector a -> m (Vector a) | | takeWhile :: (a -> Bool) -> Vector a -> Vector a | | dropWhile :: (a -> Bool) -> Vector a -> Vector a | | partition :: (a -> Bool) -> Vector a -> (Vector a, Vector a) | | unstablePartition :: (a -> Bool) -> Vector a -> (Vector a, Vector a) | | span :: (a -> Bool) -> Vector a -> (Vector a, Vector a) | | break :: (a -> Bool) -> Vector a -> (Vector a, Vector a) | | elem :: Eq a => a -> Vector a -> Bool | | notElem :: Eq a => a -> Vector a -> Bool | | find :: (a -> Bool) -> Vector a -> Maybe a | | findIndex :: (a -> Bool) -> Vector a -> Maybe Int | | findIndices :: (a -> Bool) -> Vector a -> Vector Int | | elemIndex :: Eq a => a -> Vector a -> Maybe Int | | elemIndices :: Eq a => a -> Vector a -> Vector Int | | foldl :: (a -> b -> a) -> a -> Vector b -> a | | foldl1 :: (a -> a -> a) -> Vector a -> a | | foldl' :: (a -> b -> a) -> a -> Vector b -> a | | foldl1' :: (a -> a -> a) -> Vector a -> a | | foldr :: (a -> b -> b) -> b -> Vector a -> b | | foldr1 :: (a -> a -> a) -> Vector a -> a | | foldr' :: (a -> b -> b) -> b -> Vector a -> b | | foldr1' :: (a -> a -> a) -> Vector a -> a | | ifoldl :: (a -> Int -> b -> a) -> a -> Vector b -> a | | ifoldl' :: (a -> Int -> b -> a) -> a -> Vector b -> a | | ifoldr :: (Int -> a -> b -> b) -> b -> Vector a -> b | | ifoldr' :: (Int -> a -> b -> b) -> b -> Vector a -> b | | all :: (a -> Bool) -> Vector a -> Bool | | any :: (a -> Bool) -> Vector a -> Bool | | 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 | | maximumBy :: (a -> a -> Ordering) -> Vector a -> a | | minimum :: Ord a => Vector a -> a | | minimumBy :: (a -> a -> Ordering) -> Vector a -> a | | minIndex :: Ord a => Vector a -> Int | | minIndexBy :: (a -> a -> Ordering) -> Vector a -> Int | | maxIndex :: Ord a => Vector a -> Int | | maxIndexBy :: (a -> a -> Ordering) -> Vector a -> Int | | foldM :: Monad m => (a -> b -> m a) -> a -> Vector b -> m a | | foldM' :: Monad m => (a -> b -> m a) -> a -> Vector b -> m a | | fold1M :: Monad m => (a -> a -> m a) -> Vector a -> m a | | fold1M' :: Monad m => (a -> a -> m a) -> Vector a -> m a | | prescanl :: (a -> b -> a) -> a -> Vector b -> Vector a | | prescanl' :: (a -> b -> a) -> a -> Vector b -> Vector a | | postscanl :: (a -> b -> a) -> a -> Vector b -> Vector a | | postscanl' :: (a -> b -> a) -> a -> Vector b -> Vector a | | scanl :: (a -> b -> a) -> a -> Vector b -> Vector a | | scanl' :: (a -> b -> a) -> a -> Vector b -> Vector a | | scanl1 :: (a -> a -> a) -> Vector a -> Vector a | | scanl1' :: (a -> a -> a) -> Vector a -> Vector a | | prescanr :: (a -> b -> b) -> b -> Vector a -> Vector b | | prescanr' :: (a -> b -> b) -> b -> Vector a -> Vector b | | postscanr :: (a -> b -> b) -> b -> Vector a -> Vector b | | postscanr' :: (a -> b -> b) -> b -> Vector a -> Vector b | | scanr :: (a -> b -> b) -> b -> Vector a -> Vector b | | scanr' :: (a -> b -> b) -> b -> Vector a -> Vector b | | scanr1 :: (a -> a -> a) -> Vector a -> Vector a | | scanr1' :: (a -> a -> a) -> Vector a -> Vector a | | toList :: Vector a -> [a] | | fromList :: [a] -> Vector a | | fromListN :: Int -> [a] -> Vector a | | copy :: PrimMonad m => MVector (PrimState m) a -> Vector a -> m () | | unsafeCopy :: PrimMonad m => MVector (PrimState m) a -> Vector a -> m () |
|
|
|
Boxed vectors
|
|
|
Boxed vectors, supporting efficient slicing.
|
|
|
|
Mutable boxed vectors keyed on the monad they live in (IO or ST s).
|
|
|
Accessors
|
|
Length information
|
|
|
O(1) Yield the length of the vector.
|
|
|
O(1) Test whether a vector if empty
|
|
Indexing
|
|
|
O(1) Indexing
|
|
|
O(1) First element
|
|
|
O(1) Last element
|
|
|
O(1) Unsafe indexing without bounds checking
|
|
|
O(1) First element without checking if the vector is empty
|
|
|
O(1) Last element without checking if the vector is empty
|
|
Monadic indexing
|
|
|
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.
|
|
|
O(1) First element of a vector in a monad. See indexM for an
explanation of why this is useful.
|
|
|
O(1) Last element of a vector in a monad. See indexM for an
explanation of why this is useful.
|
|
|
O(1) Indexing in a monad without bounds checks. See indexM for an
explanation of why this is useful.
|
|
|
O(1) First element in a monad without checking for empty vectors.
See indexM for an explanation of why this is useful.
|
|
|
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)
|
|
|
:: 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.
|
|
|
|
O(1) Yield all but the last element without copying. The vector may not
be empty.
|
|
|
O(1) Yield all but the first element without copying. The vector may not
be empty.
|
|
|
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.
|
|
|
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.
|
|
|
:: 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.
|
|
|
|
O(1) Yield all but the last element without copying. The vector may not
be empty but this is not checked.
|
|
|
O(1) Yield all but the first element without copying. The vector may not
be empty but this is not checked.
|
|
|
O(1) Yield the first n elements without copying. The vector must
contain at least n elements but this is not checked.
|
|
|
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
|
|
|
O(1) Empty vector
|
|
|
O(1) Vector with exactly one element
|
|
|
O(n) Vector of the given length with the same value in each position
|
|
|
O(n) Construct a vector of the given length by applying the function to
each index
|
|
Monadic initialisation
|
|
|
O(n) Execute the monadic action the given number of times and store the
results in a vector.
|
|
|
Execute the monadic action and freeze the resulting vector.
create (do { v <- new 2; write v 0 'a'; write v 1 'b' }) = <a,b>
|
|
Unfolding
|
|
|
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>
|
|
|
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>
|
|
Enumeration
|
|
|
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>
|
|
|
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>
|
|
|
O(n) Enumerate values from x to y.
WARNING: This operation can be very inefficient. If at all possible, use
enumFromN instead.
|
|
|
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
|
|
|
O(n) Prepend an element
|
|
|
O(n) Append an element
|
|
|
O(m+n) Concatenate two vectors
|
|
Restricting memory usage
|
|
|
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
|
|
|
:: 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>
|
|
|
|
:: Vector a | initial vector (of length m)
| -> Vector (Int, a) | vector of index/value pairs (of length n)
| -> Vector a | | O(m+n) For each pair (i,a) from the vector of index/value pairs,
replace the vector element at position i by a.
update <5,9,2,7> <(2,1),(0,3),(2,8)> = <3,9,8,7>
|
|
|
|
:: 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>
The function update provides the same functionality and is usually more
convenient.
update_ xs is ys = update xs (zip is ys)
|
|
|
|
Same as (//) but without bounds checking.
|
|
|
Same as update but without bounds checking.
|
|
|
Same as update_ but without bounds checking.
|
|
Accumulations
|
|
|
:: 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>
|
|
|
|
:: a -> b -> a | accumulating function f
| -> Vector a | initial vector (of length m)
| -> Vector (Int, b) | vector of index/value pairs (of length n)
| -> Vector a | | O(m+n) For each pair (i,b) from the vector of pairs, replace the vector
element a at position i by f a b.
accumulate (+) <5,9,2> <(2,4),(1,6),(0,3),(1,7)> = <5+3, 9+6+7, 2+4>
|
|
|
|
:: 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>
The function accumulate provides the same functionality and is usually more
convenient.
accumulate_ f as is bs = accumulate f as (zip is bs)
|
|
|
|
Same as accum but without bounds checking.
|
|
|
Same as accumulate but without bounds checking.
|
|
|
Same as accumulate_ but without bounds checking.
|
|
Permutations
|
|
|
O(n) Reverse a vector
|
|
|
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>
|
|
|
Same as backpermute but without bounds checking.
|
|
Safe destructive updates
|
|
|
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
|
|
|
O(n) Map a function over a vector
|
|
|
O(n) Apply a function to every element of a vector and its index
|
|
|
Map a function over a vector and concatenate the results.
|
|
Monadic mapping
|
|
|
O(n) Apply the monadic action to all elements of the vector, yielding a
vector of results
|
|
|
O(n) Apply the monadic action to all elements of a vector and ignore the
results
|
|
|
O(n) Apply the monadic action to all elements of the vector, yielding a
vector of results. Equvalent to flip mapM.
|
|
|
O(n) Apply the monadic action to all elements of a vector and ignore the
results. Equivalent to flip mapM_.
|
|
Zipping
|
|
|
O(min(m,n)) Zip two vectors with the given function.
|
|
|
Zip three vectors with the given function.
|
|
|
|
|
|
|
|
|
O(min(m,n)) Zip two vectors with a function that also takes the
elements' indices.
|
|
|
Zip three vectors and their indices with the given function.
|
|
|
|
|
|
|
|
|
Elementwise pairing of array elements.
|
|
|
zip together three vectors into a vector of triples
|
|
|
|
|
|
|
|
Monadic zipping
|
|
|
O(min(m,n)) Zip the two vectors with the monadic action and yield a
vector of results
|
|
|
O(min(m,n)) Zip the two vectors with the monadic action and ignore the
results
|
|
Unzipping
|
|
|
O(min(m,n)) Unzip a vector of pairs.
|
|
|
|
|
|
|
|
unzip6 :: Vector (a, b, c, d, e, f) -> (Vector a, Vector b, Vector c, Vector d, Vector e, Vector f) | Source |
|
|
Working with predicates
|
|
Filtering
|
|
|
O(n) Drop elements that do not satisfy the predicate
|
|
|
O(n) Drop elements that do not satisfy the predicate which is applied to
values and their indices
|
|
|
O(n) Drop elements that do not satisfy the monadic predicate
|
|
|
O(n) Yield the longest prefix of elements satisfying the predicate
without copying.
|
|
|
O(n) Drop the longest prefix of elements that satisfy the predicate
without copying.
|
|
Partitioning
|
|
|
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.
|
|
|
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.
|
|
|
O(n) Split the vector into the longest prefix of elements that satisfy
the predicate and the rest without copying.
|
|
|
O(n) Split the vector into the longest prefix of elements that do not
satisfy the predicate and the rest without copying.
|
|
Searching
|
|
|
O(n) Check if the vector contains an element
|
|
|
O(n) Check if the vector does not contain an element (inverse of elem)
|
|
|
O(n) Yield Just the first element matching the predicate or Nothing
if no such element exists.
|
|
|
O(n) Yield Just the index of the first element matching the predicate
or Nothing if no such element exists.
|
|
|
O(n) Yield the indices of elements satisfying the predicate in ascending
order.
|
|
|
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.
|
|
|
O(n) Yield the indices of all occurences of the given element in
ascending order. This is a specialised version of findIndices.
|
|
Folding
|
|
|
O(n) Left fold
|
|
|
O(n) Left fold on non-empty vectors
|
|
|
O(n) Left fold with strict accumulator
|
|
|
O(n) Left fold on non-empty vectors with strict accumulator
|
|
|
O(n) Right fold
|
|
|
O(n) Right fold on non-empty vectors
|
|
|
O(n) Right fold with a strict accumulator
|
|
|
O(n) Right fold on non-empty vectors with strict accumulator
|
|
|
O(n) Left fold (function applied to each element and its index)
|
|
|
O(n) Left fold with strict accumulator (function applied to each element
and its index)
|
|
|
O(n) Right fold (function applied to each element and its index)
|
|
|
O(n) Right fold with strict accumulator (function applied to each
element and its index)
|
|
Specialised folds
|
|
|
O(n) Check if all elements satisfy the predicate.
|
|
|
O(n) Check if any element satisfies the predicate.
|
|
|
O(n) Check if all elements are True
|
|
|
O(n) Check if any element is True
|
|
|
O(n) Compute the sum of the elements
|
|
|
O(n) Compute the produce of the elements
|
|
|
O(n) Yield the maximum element of the vector. The vector may not be
empty.
|
|
|
O(n) Yield the maximum element of the vector according to the given
comparison function. The vector may not be empty.
|
|
|
O(n) Yield the minimum element of the vector. The vector may not be
empty.
|
|
|
O(n) Yield the minimum element of the vector according to the given
comparison function. The vector may not be empty.
|
|
|
O(n) Yield the index of the minimum element of the vector. The vector
may not be empty.
|
|
|
O(n) Yield the index of the minimum element of the vector according to
the given comparison function. The vector may not be empty.
|
|
|
O(n) Yield the index of the maximum element of the vector. The vector
may not be empty.
|
|
|
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
|
|
|
O(n) Monadic fold
|
|
|
O(n) Monadic fold with strict accumulator
|
|
|
O(n) Monadic fold over non-empty vectors
|
|
|
O(n) Monad fold over non-empty vectors with strict accumulator
|
|
Prefix sums (scans)
|
|
|
O(n) Prescan
prescanl f z = init . scanl f z
Example: prescanl (+) 0 <1,2,3,4> = <0,1,3,6>
|
|
|
O(n) Prescan with strict accumulator
|
|
|
O(n) Scan
postscanl f z = tail . scanl f z
Example: postscanl (+) 0 <1,2,3,4> = <1,3,6,10>
|
|
|
O(n) Scan with strict accumulator
|
|
|
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>
|
|
|
O(n) Haskell-style scan with strict accumulator
|
|
|
O(n) Scan over a non-empty vector
scanl f <x1,...,xn> = <y1,...,yn>
where y1 = x1
yi = f y(i-1) xi
|
|
|
O(n) Scan over a non-empty vector with a strict accumulator
|
|
|
O(n) Right-to-left prescan
prescanr f z = reverse . prescanl (flip f) z . reverse
|
|
|
O(n) Right-to-left prescan with strict accumulator
|
|
|
O(n) Right-to-left scan
|
|
|
O(n) Right-to-left scan with strict accumulator
|
|
|
O(n) Right-to-left Haskell-style scan
|
|
|
O(n) Right-to-left Haskell-style scan with strict accumulator
|
|
|
O(n) Right-to-left scan over a non-empty vector
|
|
|
O(n) Right-to-left scan over a non-empty vector with a strict
accumulator
|
|
Conversions
|
|
Lists
|
|
|
O(n) Convert a vector to a list
|
|
|
O(n) Convert a list to a vector
|
|
|
O(n) Convert the first n elements of a list to a vector
fromListN n xs = fromList (take n xs)
|
|
Mutable vectors
|
|
|
O(n) Copy an immutable vector into a mutable one. The two vectors must
have the same length. This is not checked.
|
|
|
O(n) Copy an immutable vector into a mutable one. The two vectors must
have the same length.
|
|
Produced by Haddock version 2.6.1 |