Safe Haskell | None |
---|---|
Language | Haskell2010 |
Boxed Vector
. Import as:
import qualified RIO.Vector.Boxed as VB
This module does not export any partial or unsafe functions. For those, see RIO.Vector.Boxed.Partial and RIO.Vector.Boxed.Unsafe
Synopsis
- data Vector a
- data MVector s a
- length :: Vector a -> Int
- null :: Vector a -> Bool
- (!?) :: Vector a -> Int -> Maybe a
- slice :: Int -> Int -> Vector a -> Vector a
- take :: Int -> Vector a -> Vector a
- drop :: Int -> Vector a -> Vector a
- splitAt :: Int -> Vector a -> (Vector a, Vector a)
- empty :: Vector a
- singleton :: a -> Vector a
- replicate :: Int -> a -> Vector a
- generate :: Int -> (Int -> a) -> Vector a
- iterateN :: Int -> (a -> a) -> a -> Vector a
- replicateM :: Monad m => Int -> m a -> m (Vector a)
- generateM :: Monad m => Int -> (Int -> m a) -> m (Vector a)
- iterateNM :: Monad m => Int -> (a -> m a) -> a -> m (Vector a)
- create :: (forall s. ST s (MVector s a)) -> Vector a
- createT :: Traversable f => (forall s. ST s (f (MVector s a))) -> f (Vector a)
- unfoldr :: (b -> Maybe (a, b)) -> b -> Vector a
- unfoldrN :: Int -> (b -> Maybe (a, b)) -> b -> Vector a
- unfoldrM :: Monad m => (b -> m (Maybe (a, b))) -> b -> m (Vector a)
- unfoldrNM :: Monad m => Int -> (b -> m (Maybe (a, b))) -> b -> m (Vector a)
- constructN :: Int -> (Vector a -> a) -> Vector a
- constructrN :: Int -> (Vector a -> a) -> 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
- concat :: [Vector a] -> Vector a
- force :: Vector a -> Vector a
- reverse :: Vector a -> Vector a
- modify :: (forall s. MVector s a -> ST s ()) -> Vector a -> Vector a
- indexed :: Vector a -> Vector (Int, 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)
- imapM :: Monad m => (Int -> a -> m b) -> Vector a -> m (Vector b)
- mapM_ :: Monad m => (a -> m b) -> Vector a -> m ()
- imapM_ :: Monad m => (Int -> 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)
- izipWithM :: Monad m => (Int -> a -> b -> m c) -> Vector a -> Vector b -> m (Vector c)
- zipWithM_ :: Monad m => (a -> b -> m c) -> Vector a -> Vector b -> m ()
- izipWithM_ :: Monad m => (Int -> 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
- uniq :: Eq a => Vector a -> Vector a
- mapMaybe :: (a -> Maybe b) -> Vector a -> Vector b
- imapMaybe :: (Int -> a -> Maybe b) -> Vector a -> Vector b
- 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
- foldl' :: (a -> b -> a) -> a -> Vector b -> a
- foldr :: (a -> b -> b) -> b -> Vector a -> b
- foldr' :: (a -> b -> b) -> b -> Vector a -> b
- 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
- foldM :: Monad m => (a -> b -> m a) -> a -> Vector b -> m a
- ifoldM :: Monad m => (a -> Int -> b -> m a) -> a -> Vector b -> m a
- foldM' :: Monad m => (a -> b -> m a) -> a -> Vector b -> m a
- ifoldM' :: Monad m => (a -> Int -> b -> m a) -> a -> Vector b -> m a
- foldM_ :: Monad m => (a -> b -> m a) -> a -> Vector b -> m ()
- ifoldM_ :: Monad m => (a -> Int -> b -> m a) -> a -> Vector b -> m ()
- foldM'_ :: Monad m => (a -> b -> m a) -> a -> Vector b -> m ()
- ifoldM'_ :: Monad m => (a -> Int -> b -> m a) -> a -> Vector b -> m ()
- sequence :: Monad m => Vector (m a) -> m (Vector a)
- sequence_ :: Monad m => Vector (m a) -> m ()
- 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
- iscanl :: (Int -> a -> b -> a) -> a -> Vector b -> Vector a
- iscanl' :: (Int -> a -> b -> a) -> a -> Vector b -> 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
- iscanr :: (Int -> a -> b -> b) -> b -> Vector a -> Vector b
- iscanr' :: (Int -> a -> b -> b) -> b -> Vector a -> Vector b
- toList :: Vector a -> [a]
- fromList :: [a] -> Vector a
- fromListN :: Int -> [a] -> Vector a
- convert :: (Vector v a, Vector w a) => v a -> w a
- freeze :: PrimMonad m => MVector (PrimState m) a -> m (Vector a)
- thaw :: PrimMonad m => Vector a -> m (MVector (PrimState m) a)
- copy :: PrimMonad m => MVector (PrimState m) a -> Vector a -> m ()
Boxed vectors
Boxed vectors, supporting efficient slicing.
Instances
Monad Vector | |
Functor Vector | |
MonadFix Vector | Instance has same semantics as one for lists Since: vector-0.12.2.0 |
Defined in Data.Vector | |
MonadFail Vector | Since: vector-0.12.1.0 |
Defined in Data.Vector | |
Applicative Vector | |
Foldable Vector | |
Defined in Data.Vector fold :: Monoid m => Vector m -> m # foldMap :: Monoid m => (a -> m) -> Vector a -> m # foldMap' :: Monoid m => (a -> m) -> Vector a -> m # foldr :: (a -> b -> b) -> b -> Vector a -> b # foldr' :: (a -> b -> b) -> b -> Vector a -> b # foldl :: (b -> a -> b) -> b -> Vector a -> b # foldl' :: (b -> a -> b) -> b -> Vector a -> b # foldr1 :: (a -> a -> a) -> Vector a -> a # foldl1 :: (a -> a -> a) -> Vector a -> a # elem :: Eq a => a -> Vector a -> Bool # maximum :: Ord a => Vector a -> a # minimum :: Ord a => Vector a -> a # | |
Traversable Vector | |
Eq1 Vector | |
Ord1 Vector | |
Defined in Data.Vector | |
Read1 Vector | |
Defined in Data.Vector | |
Show1 Vector | |
MonadZip Vector | |
Alternative Vector | |
MonadPlus Vector | |
NFData1 Vector | Since: vector-0.12.1.0 |
Defined in Data.Vector | |
Vector Vector a | |
Defined in Data.Vector basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) a -> m (Vector a) # basicUnsafeThaw :: PrimMonad m => Vector a -> m (Mutable Vector (PrimState m) a) # basicLength :: Vector a -> Int # basicUnsafeSlice :: Int -> Int -> Vector a -> Vector a # basicUnsafeIndexM :: Monad m => Vector a -> Int -> m a # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) a -> Vector a -> m () # | |
IsList (Vector a) | |
Eq a => Eq (Vector a) | |
Data a => Data (Vector a) | |
Defined in Data.Vector gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Vector a -> c (Vector a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Vector a) # toConstr :: Vector a -> Constr # dataTypeOf :: Vector a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Vector a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Vector a)) # gmapT :: (forall b. Data b => b -> b) -> Vector a -> Vector a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Vector a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Vector a -> r # gmapQ :: (forall d. Data d => d -> u) -> Vector a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Vector a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Vector a -> m (Vector a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Vector a -> m (Vector a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Vector a -> m (Vector a) # | |
Ord a => Ord (Vector a) | |
Defined in Data.Vector | |
Read a => Read (Vector a) | |
Show a => Show (Vector a) | |
Semigroup (Vector a) | |
Monoid (Vector a) | |
NFData a => NFData (Vector a) | |
Defined in Data.Vector | |
type Mutable Vector | |
Defined in Data.Vector | |
type Item (Vector a) | |
Defined in Data.Vector |
Mutable boxed vectors keyed on the monad they live in (IO
or
).ST
s
Instances
MVector MVector a | |
Defined in Data.Vector.Mutable basicLength :: MVector s a -> Int # basicUnsafeSlice :: Int -> Int -> MVector s a -> MVector s a # basicOverlaps :: MVector s a -> MVector s a -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) a) # basicInitialize :: PrimMonad m => MVector (PrimState m) a -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> a -> m (MVector (PrimState m) a) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) a -> Int -> m a # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) a -> Int -> a -> m () # basicClear :: PrimMonad m => MVector (PrimState m) a -> m () # basicSet :: PrimMonad m => MVector (PrimState m) a -> a -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) a -> MVector (PrimState m) a -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) a -> MVector (PrimState m) a -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) a -> Int -> m (MVector (PrimState m) a) # |
Accessors
Length information
Indexing
Extracting subvectors
O(1) Yield a slice of the vector without copying it. The vector must
contain at least i+n
elements.
take :: Int -> Vector a -> Vector a #
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 :: Int -> Vector a -> Vector a #
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.
Construction
Initialisation
replicate :: Int -> a -> Vector a #
O(n) Vector of the given length with the same value in each position
generate :: Int -> (Int -> a) -> Vector a #
O(n) Construct a vector of the given length by applying the function to each index
iterateN :: Int -> (a -> a) -> a -> Vector a #
O(n) Apply function \(\max(n - 1, 0)\) times to an initial value, producing a vector of length \(\max(n, 0)\). Zeroth element will contain the initial value, that's why there is one less function application than the number of elements in the produced vector.
\( \underbrace{x, f (x), f (f (x)), \ldots}_{\max(0,n)\rm{~elements}} \)
Examples
>>>
import qualified Data.Vector as V
>>>
V.iterateN 0 undefined undefined :: V.Vector String
[]>>>
V.iterateN 4 (\x -> x <> x) "Hi"
["Hi","HiHi","HiHiHiHi","HiHiHiHiHiHiHiHi"]
Since: vector-0.7.1
Monadic initialisation
replicateM :: Monad m => Int -> m a -> m (Vector a) #
O(n) Execute the monadic action the given number of times and store the results in a vector.
generateM :: Monad m => Int -> (Int -> m a) -> m (Vector a) #
O(n) Construct a vector of the given length by applying the monadic action to each index
iterateNM :: Monad m => Int -> (a -> m a) -> a -> m (Vector a) #
O(n) Apply monadic function \(\max(n - 1, 0)\) times to an initial value, producing a vector of length \(\max(n, 0)\). Zeroth element will contain the initial value, that's why there is one less function application than the number of elements in the produced vector.
For non-monadic version see iterateN
Since: vector-0.12.0.0
create :: (forall s. ST s (MVector s a)) -> Vector a #
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 => (forall s. ST s (f (MVector s a))) -> f (Vector a) #
Execute the monadic action and freeze the resulting vectors.
Unfolding
constructN :: Int -> (Vector a -> a) -> Vector a #
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 <a,b,c>
constructrN :: Int -> (Vector a -> a) -> Vector a #
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 <c,b,a>
Enumeration
enumFromN :: Num a => a -> Int -> Vector a #
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 :: Num a => a -> a -> Int -> Vector a #
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 :: Enum a => a -> a -> Vector a #
O(n) Enumerate values from x
to y
.
WARNING: This operation can be very inefficient. If at all possible, use
enumFromN
instead.
enumFromThenTo :: Enum a => a -> a -> a -> Vector a #
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
Restricting memory usage
force :: Vector a -> Vector 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
Permutations
Safe destructive update
modify :: (forall s. MVector s a -> ST s ()) -> Vector a -> Vector a #
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
Indexing
Mapping
imap :: (Int -> a -> b) -> Vector a -> Vector b #
O(n) Apply a function to every element of a vector and its index
concatMap :: (a -> Vector b) -> Vector a -> Vector b #
Map a function over a vector and concatenate the results.
Monadic mapping
mapM :: Monad m => (a -> m b) -> Vector a -> m (Vector b) #
O(n) Apply the monadic action to all elements of the vector, yielding a vector of results
imapM :: Monad m => (Int -> a -> m b) -> Vector a -> m (Vector b) #
O(n) Apply the monadic action to every element of a vector and its index, yielding a vector of results
mapM_ :: Monad m => (a -> m b) -> Vector a -> m () #
O(n) Apply the monadic action to all elements of a vector and ignore the results
imapM_ :: Monad m => (Int -> a -> m b) -> Vector a -> m () #
O(n) Apply the monadic action to every element of a vector and its index, ignoring the results
forM :: Monad m => Vector a -> (a -> m b) -> m (Vector b) #
O(n) Apply the monadic action to all elements of the vector, yielding a
vector of results. Equivalent to flip
.mapM
forM_ :: Monad m => Vector 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 :: (a -> b -> c) -> Vector a -> Vector b -> Vector c #
O(min(m,n)) Zip two vectors with the given function.
zipWith3 :: (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d #
Zip three vectors with the given function.
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 #
O(min(m,n)) Zip two vectors with a function that also takes the elements' indices.
izipWith3 :: (Int -> a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d #
Zip three vectors and their indices with the given function.
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 #
zip3 :: Vector a -> Vector b -> Vector c -> Vector (a, b, c) #
zip together three vectors into a vector of triples
zip6 :: Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector (a, b, c, d, e, f) #
Monadic zipping
zipWithM :: Monad m => (a -> b -> m c) -> Vector a -> Vector b -> m (Vector c) #
O(min(m,n)) Zip the two vectors with the monadic action and yield a vector of results
izipWithM :: Monad m => (Int -> a -> b -> m c) -> Vector a -> Vector b -> m (Vector c) #
O(min(m,n)) Zip the two vectors with a monadic action that also takes the element index and yield a vector of results
zipWithM_ :: Monad m => (a -> b -> m c) -> Vector a -> Vector b -> m () #
O(min(m,n)) Zip the two vectors with the monadic action and ignore the results
izipWithM_ :: Monad m => (Int -> a -> b -> m c) -> Vector a -> Vector b -> m () #
O(min(m,n)) Zip the two vectors with a monadic action that also takes the element index and ignore the results
Unzipping
unzip6 :: Vector (a, b, c, d, e, f) -> (Vector a, Vector b, Vector c, Vector d, Vector e, Vector f) #
Working with predicates
Filtering
ifilter :: (Int -> a -> Bool) -> Vector a -> Vector a #
O(n) Drop elements that do not satisfy the predicate which is applied to values and their indices
mapMaybe :: (a -> Maybe b) -> Vector a -> Vector b #
O(n) Drop elements when predicate returns Nothing
imapMaybe :: (Int -> a -> Maybe b) -> Vector a -> Vector b #
O(n) Drop elements when predicate, applied to index and value, returns Nothing
filterM :: Monad m => (a -> m Bool) -> Vector a -> m (Vector a) #
O(n) Drop elements that do not satisfy the monadic predicate
takeWhile :: (a -> Bool) -> Vector a -> Vector a #
O(n) Yield the longest prefix of elements satisfying the predicate. Current implementation is not copy-free, unless the result vector is fused away.
dropWhile :: (a -> Bool) -> Vector a -> Vector a #
O(n) Drop the longest prefix of elements that satisfy the predicate without copying.
Partitioning
partition :: (a -> Bool) -> Vector a -> (Vector a, Vector a) #
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 :: (a -> Bool) -> Vector a -> (Vector a, Vector a) #
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 :: (a -> Bool) -> Vector a -> (Vector a, Vector a) #
O(n) Split the vector into the longest prefix of elements that satisfy the predicate and the rest without copying.
break :: (a -> Bool) -> Vector a -> (Vector a, Vector a) #
O(n) Split the vector into the longest prefix of elements that do not satisfy the predicate and the rest without copying.
Searching
notElem :: Eq a => a -> Vector a -> Bool infix 4 #
O(n) Check if the vector does not contain an element (inverse of elem
)
findIndices :: (a -> Bool) -> Vector a -> Vector Int #
O(n) Yield the indices of elements satisfying the predicate in ascending order.
elemIndices :: Eq a => a -> Vector a -> Vector Int #
O(n) Yield the indices of all occurences of the given element in
ascending order. This is a specialised version of findIndices
.
Folding
ifoldl :: (a -> Int -> b -> a) -> a -> Vector b -> a #
O(n) Left fold (function applied to each element and its index)
ifoldl' :: (a -> Int -> b -> a) -> a -> Vector b -> a #
O(n) Left fold with strict accumulator (function applied to each element and its index)
ifoldr :: (Int -> a -> b -> b) -> b -> Vector a -> b #
O(n) Right fold (function applied to each element and its index)
ifoldr' :: (Int -> a -> b -> b) -> b -> Vector a -> b #
O(n) Right fold with strict accumulator (function applied to each element and its index)
Specialised folds
all :: (a -> Bool) -> Vector a -> Bool #
O(n) Check if all elements satisfy the predicate.
Examples
>>>
import qualified Data.Vector as V
>>>
V.all even $ V.fromList [2, 4, 12 :: Int]
True>>>
V.all even $ V.fromList [2, 4, 13 :: Int]
False>>>
V.all even (V.empty :: V.Vector Int)
True
any :: (a -> Bool) -> Vector a -> Bool #
O(n) Check if any element satisfies the predicate.
Examples
>>>
import qualified Data.Vector as V
>>>
V.any even $ V.fromList [1, 3, 7 :: Int]
False>>>
V.any even $ V.fromList [3, 2, 13 :: Int]
True>>>
V.any even (V.empty :: V.Vector Int)
False
O(n) Check if all elements are True
Examples
>>>
import qualified Data.Vector as V
>>>
V.and $ V.fromList [True, False]
False>>>
V.and V.empty
True
O(n) Check if any element is True
Examples
>>>
import qualified Data.Vector as V
>>>
V.or $ V.fromList [True, False]
True>>>
V.or V.empty
False
sum :: Num a => Vector a -> a #
O(n) Compute the sum of the elements
Examples
>>>
import qualified Data.Vector as V
>>>
V.sum $ V.fromList [300,20,1 :: Int]
321>>>
V.sum (V.empty :: V.Vector Int)
0
product :: Num a => Vector a -> a #
O(n) Compute the produce of the elements
Examples
>>>
import qualified Data.Vector as V
>>>
V.product $ V.fromList [1,2,3,4 :: Int]
24>>>
V.product (V.empty :: V.Vector Int)
1
Monadic folds
ifoldM :: Monad m => (a -> Int -> b -> m a) -> a -> Vector b -> m a #
O(n) Monadic fold (action applied to each element and its index)
foldM' :: Monad m => (a -> b -> m a) -> a -> Vector b -> m a #
O(n) Monadic fold with strict accumulator
ifoldM' :: Monad m => (a -> Int -> b -> m a) -> a -> Vector b -> m a #
O(n) Monadic fold with strict accumulator (action applied to each element and its index)
foldM_ :: Monad m => (a -> b -> m a) -> a -> Vector b -> m () #
O(n) Monadic fold that discards the result
ifoldM_ :: Monad m => (a -> Int -> b -> m a) -> a -> Vector b -> m () #
O(n) Monadic fold that discards the result (action applied to each element and its index)
foldM'_ :: Monad m => (a -> b -> m a) -> a -> Vector b -> m () #
O(n) Monadic fold with strict accumulator that discards the result
ifoldM'_ :: Monad m => (a -> Int -> b -> m a) -> a -> Vector b -> m () #
O(n) Monadic fold with strict accumulator that discards the result (action applied to each element and its index)
Monadic sequencing
Prefix sums (scans)
postscanl' :: (a -> b -> a) -> a -> Vector b -> Vector a #
O(n) Scan with strict accumulator
scanl :: (a -> b -> a) -> a -> Vector b -> Vector a #
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' :: (a -> b -> a) -> a -> Vector b -> Vector a #
O(n) Haskell-style scan with strict accumulator
iscanl :: (Int -> a -> b -> a) -> a -> Vector b -> Vector a #
O(n) Scan over a vector with its index
Since: vector-0.12.0.0
iscanl' :: (Int -> a -> b -> a) -> a -> Vector b -> Vector a #
O(n) Scan over a vector (strictly) with its index
Since: vector-0.12.0.0
prescanr' :: (a -> b -> b) -> b -> Vector a -> Vector b #
O(n) Right-to-left prescan with strict accumulator
postscanr' :: (a -> b -> b) -> b -> Vector a -> Vector b #
O(n) Right-to-left scan with strict accumulator
scanr' :: (a -> b -> b) -> b -> Vector a -> Vector b #
O(n) Right-to-left Haskell-style scan with strict accumulator
iscanr :: (Int -> a -> b -> b) -> b -> Vector a -> Vector b #
O(n) Right-to-left scan over a vector with its index
Since: vector-0.12.0.0
iscanr' :: (Int -> a -> b -> b) -> b -> Vector a -> Vector b #
O(n) Right-to-left scan over a vector (strictly) with its index
Since: vector-0.12.0.0
Conversions
Lists
Different vector types
Mutable vectors
freeze :: PrimMonad m => MVector (PrimState m) a -> m (Vector a) #
O(n) Yield an immutable copy of the mutable vector.